@faicad/faijs 0.13.0

package/dist/vendored/brepjs/topology/apiTypes.js

@@ -0,0 +1,24 @@
+/**
+ * API types for the public API.
+ *
+ * Defines `Shapeable`, `Wrapped`, `FinderFn`, and modifier parameter types
+ * that are shared across functional functions and the shape() wrapper.
+ */
+// ---------------------------------------------------------------------------
+// resolve() — extract raw shape from Shapeable
+// ---------------------------------------------------------------------------
+/** Extract the raw branded shape from a Shapeable value. */
+export function resolve(s) {
+    if ('__wrapped' in s) {
+        return s.val;
+    }
+    return s;
+}
+// ---------------------------------------------------------------------------
+// Resolve for Shape3D (common case in booleans/modifiers)
+// ---------------------------------------------------------------------------
+/** Extract the raw branded 3D shape from a Shapeable<Shape3D>. */
+export function resolve3D(s) {
+    return resolve(s);
+}
+//# sourceMappingURL=apiTypes.js.map

package/dist/vendored/brepjs/topology/apiTypes.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"apiTypes.js","sourceRoot":"","sources":["../../../../src/vendored/brepjs/topology/apiTypes.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAmKH,8EAA8E;AAC9E,+CAA+C;AAC/C,8EAA8E;AAE9E,4DAA4D;AAC5D,MAAM,UAAU,OAAO,CAAgC,CAAe;IACpE,IAAI,WAAW,IAAI,CAAC,EAAE,CAAC;QACrB,OAAO,CAAC,CAAC,GAAG,CAAC;IACf,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,8EAA8E;AAC9E,0DAA0D;AAC1D,8EAA8E;AAE9E,kEAAkE;AAClE,MAAM,UAAU,SAAS,CAAC,CAAqB;IAC7C,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC;AACpB,CAAC","sourcesContent":["/**\n * API types for the public API.\n *\n * Defines `Shapeable`, `Wrapped`, `FinderFn`, and modifier parameter types\n * that are shared across functional functions and the shape() wrapper.\n */\n\nimport type { Vec2, Vec3 } from '../core/types.js';\nimport type { AnyShape, Dimension, Edge, Face, Wire, Shape3D } from '../core/shapeTypes.js';\nimport type { ShapeFinder } from '../query/finderFns.js';\n\n/**\n * Structural type matching a Drawing's wire-producing interface.\n * Used in place of importing the actual Drawing class to avoid\n * Layer 2 → Layer 3 boundary violations.\n */\nexport interface DrawingLike {\n  sketchOnPlane(plane: string): { wire: Wire };\n}\n\n// ---------------------------------------------------------------------------\n// FinderFn — callback that configures a finder\n// ---------------------------------------------------------------------------\n\n/** Callback that configures a shape finder for inline use in modifiers. */\nexport type FinderFn<T extends AnyShape<Dimension>> = (finder: ShapeFinder<T>) => ShapeFinder<T>;\n\n// ---------------------------------------------------------------------------\n// FilletRadius — all radius modes for fillet()\n// ---------------------------------------------------------------------------\n\n/**\n * Fillet radius specification.\n *\n * - `number` — constant radius on all selected edges\n * - `[number, number]` — variable radius (start, end)\n * - callback — per-edge radius; return `null` to skip an edge\n */\nexport type FilletRadius =\n  number | [number, number] | ((edge: Edge<Dimension>) => number | [number, number] | null);\n\n// ---------------------------------------------------------------------------\n// ChamferDistance — all distance modes for chamfer()\n// ---------------------------------------------------------------------------\n\n/**\n * Chamfer distance specification.\n *\n * - `number` — equal distance\n * - `[number, number]` — asymmetric distances (dist1, dist2)\n * - `{ distance, angle }` — distance-angle mode (replaces chamferDistAngleShape)\n * - callback — per-edge distance; return `null` to skip an edge\n */\nexport type ChamferDistance =\n  | number\n  | [number, number]\n  | { distance: number; angle: number }\n  | ((\n      edge: Edge<Dimension>\n    ) => number | [number, number] | { distance: number; angle: number } | null);\n\n// ---------------------------------------------------------------------------\n// DraftAngle — angle specification for draft()\n// ---------------------------------------------------------------------------\n\n/**\n * Draft angle specification.\n *\n * - `number` — constant angle in degrees for all selected faces\n * - callback — per-face angle; return `null` to skip a face\n */\nexport type DraftAngle = number | ((face: Face<Dimension>) => number | null);\n\n/** Options for the draft() modifier. */\nexport interface DraftOptions {\n  /** Pull direction (mold opening direction). */\n  pullDirection: Vec3;\n  /** A point on the neutral plane (where no material is added or removed). */\n  neutralPlane: Vec3;\n  /** Draft angle in degrees. Constant or per-face callback. */\n  angle: DraftAngle;\n}\n\n// ---------------------------------------------------------------------------\n// Compound operation option types\n// ---------------------------------------------------------------------------\n\n/** Options for the drill() compound operation. */\nexport interface DrillOptions {\n  /** Position of the hole (Vec2 projects along axis). */\n  at: Vec2 | Vec3;\n  /** Hole radius. */\n  radius: number;\n  /** Hole depth. Omit for through-all (computed from bounds). */\n  depth?: number;\n  /** Drill axis direction. Default: [0, 0, 1] (Z). */\n  axis?: Vec3;\n}\n\n/** Options for the pocket() compound operation. */\nexport interface PocketOptions {\n  /** 2D profile shape to cut into the face. */\n  profile: DrawingLike | Wire;\n  /** Which face to pocket. Default: top face. */\n  face?: Face | FinderFn<Face>;\n  /** Depth of the pocket cut. */\n  depth: number;\n}\n\n/** Options for the boss() compound operation. */\nexport interface BossOptions {\n  /** 2D profile shape to extrude onto the face. */\n  profile: DrawingLike | Wire;\n  /** Which face to add onto. Default: top face. */\n  face?: Face | FinderFn<Face>;\n  /** Height of the boss extrusion. */\n  height: number;\n}\n\n/** Options for the mirrorJoin() compound operation. */\nexport interface MirrorJoinOptions {\n  /** Mirror plane normal. Default: [1, 0, 0] (mirror across YZ plane). */\n  normal?: Vec3;\n  /** Mirror plane origin. Default: [0, 0, 0]. */\n  at?: Vec3;\n}\n\n/** Options for the rectangularPattern() compound operation. */\nexport interface RectangularPatternOptions {\n  /** Direction for X repetition. */\n  xDir: Vec3;\n  /** Number of copies in X direction. */\n  xCount: number;\n  /** Spacing between copies in X direction. */\n  xSpacing: number;\n  /** Direction for Y repetition. */\n  yDir: Vec3;\n  /** Number of copies in Y direction. */\n  yCount: number;\n  /** Spacing between copies in Y direction. */\n  ySpacing: number;\n}\n\n// ---------------------------------------------------------------------------\n// Shapeable<T> — accept both raw branded types and shape() wrappers\n// ---------------------------------------------------------------------------\n\n/**\n * Marker interface for the shape() wrapper.\n *\n * Full definition lives in wrapperFns.ts — this minimal interface is enough\n * for the `resolve()` utility and `Shapeable<T>` type to work without\n * creating circular imports.\n */\nexport interface WrappedMarker<T extends AnyShape<Dimension>> {\n  readonly val: T;\n  /** Brand property to distinguish wrappers from branded shape handles. */\n  readonly __wrapped: true;\n}\n\n/**\n * Accept either a raw branded shape or a shape() wrapper.\n *\n * All functional API functions use this as their shape parameter type,\n * enabling seamless interop between styles.\n */\nexport type Shapeable<T extends AnyShape<Dimension>> = T | WrappedMarker<T>;\n\n// ---------------------------------------------------------------------------\n// resolve() — extract raw shape from Shapeable\n// ---------------------------------------------------------------------------\n\n/** Extract the raw branded shape from a Shapeable value. */\nexport function resolve<T extends AnyShape<Dimension>>(s: Shapeable<T>): T {\n  if ('__wrapped' in s) {\n    return s.val;\n  }\n  return s;\n}\n\n// ---------------------------------------------------------------------------\n// Resolve for Shape3D (common case in booleans/modifiers)\n// ---------------------------------------------------------------------------\n\n/** Extract the raw branded 3D shape from a Shapeable<Shape3D>. */\nexport function resolve3D(s: Shapeable<Shape3D>): Shape3D {\n  return resolve(s);\n}\n"]}

package/dist/vendored/brepjs/topology/booleanBatchFns.d.ts

@@ -0,0 +1,52 @@
+import { type Result } from '../core/result.js';
+import type { Shape3D } from '../core/shapeTypes.js';
+import type { ValidSolid } from '../core/validityTypes.js';
+import type { BooleanOptions } from '../kernel/types.js';
+import { fuse, cut, fuseAll, cutAll } from './booleanFns.js';
+/**
+ * Injectable kernel ops, used by the bisect internals. The public
+ * `cutAllBisect` / `fuseAllBisect` wire in the real implementations; tests
+ * and benchmarks can substitute synthetic ones that throw on specified
+ * inputs to drive the bisect-recovery path without module mocking.
+ */
+export interface BisectKernelOps {
+    readonly cut: typeof cut;
+    readonly cutAll: typeof cutAll;
+    readonly fuse: typeof fuse;
+    readonly fuseAll: typeof fuseAll;
+}
+export interface BatchBisectResult<T extends Shape3D = Shape3D> {
+    readonly shape: T;
+    readonly telemetry: BatchBisectTelemetry;
+}
+export interface BatchBisectTelemetry {
+    /** Number of inputs the caller passed (tools for cut, shapes for fuse). */
+    readonly totalInputs: number;
+    /** N-way kernel batch (`cutAll` / `fuseAll`) attempts, including failures. */
+    readonly batchAttempts: number;
+    /** N-way kernel batch attempts that succeeded. */
+    readonly batchSucceeded: number;
+    /**
+     * 2-input pairwise kernel call attempts after bisection bottomed out. For
+     * `cutAllBisect` this counts singleton `cut(base, tool)` calls; for
+     * `fuseAllBisect` this counts the `fuse(a, b)` calls that combine the
+     * results of two recursive halves. Both flavors mean "the kernel did a
+     * pair op, not a batch op."
+     */
+    readonly singletonFallbacks: number;
+    /**
+     * Sorted, deduplicated input indices that failed even as pairwise ops and
+     * were dropped from the result. Multi-level fuse failures can target the
+     * same index from different recursion levels — dedup happens at freeze.
+     */
+    readonly failedInputs: readonly number[];
+}
+export declare function cutAllBisect(base: ValidSolid, tools: ValidSolid[], options?: BooleanOptions): Result<BatchBisectResult<ValidSolid>>;
+export declare function cutAllBisect(base: Shape3D, tools: Shape3D[], options: BooleanOptions & {
+    unsafe: true;
+}): Result<BatchBisectResult>;
+export declare function fuseAllBisect(shapes: ValidSolid[], options?: BooleanOptions): Result<BatchBisectResult<ValidSolid>>;
+export declare function fuseAllBisect(shapes: Shape3D[], options: BooleanOptions & {
+    unsafe: true;
+}): Result<BatchBisectResult>;
+//# sourceMappingURL=booleanBatchFns.d.ts.map

package/dist/vendored/brepjs/topology/booleanBatchFns.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"booleanBatchFns.d.ts","sourceRoot":"","sources":["../../../../src/vendored/brepjs/topology/booleanBatchFns.ts"],"names":[],"mappings":"AAaA,OAAO,EAAkB,KAAK,MAAM,EAAE,MAAM,mBAAmB,CAAC;AAEhE,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,uBAAuB,CAAC;AACrD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AAC3D,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAC;AACzD,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,iBAAiB,CAAC;AAO7D;;;;;GAKG;AACH,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,GAAG,EAAE,OAAO,GAAG,CAAC;IACzB,QAAQ,CAAC,MAAM,EAAE,OAAO,MAAM,CAAC;IAC/B,QAAQ,CAAC,IAAI,EAAE,OAAO,IAAI,CAAC;IAC3B,QAAQ,CAAC,OAAO,EAAE,OAAO,OAAO,CAAC;CAClC;AAQD,MAAM,WAAW,iBAAiB,CAAC,CAAC,SAAS,OAAO,GAAG,OAAO;IAC5D,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC;IAClB,QAAQ,CAAC,SAAS,EAAE,oBAAoB,CAAC;CAC1C;AAED,MAAM,WAAW,oBAAoB;IACnC,2EAA2E;IAC3E,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,8EAA8E;IAC9E,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,kDAAkD;IAClD,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC;;;;;;OAMG;IACH,QAAQ,CAAC,kBAAkB,EAAE,MAAM,CAAC;IACpC;;;;OAIG;IACH,QAAQ,CAAC,YAAY,EAAE,SAAS,MAAM,EAAE,CAAC;CAC1C;AA2BD,wBAAgB,YAAY,CAC1B,IAAI,EAAE,UAAU,EAChB,KAAK,EAAE,UAAU,EAAE,EACnB,OAAO,CAAC,EAAE,cAAc,GACvB,MAAM,CAAC,iBAAiB,CAAC,UAAU,CAAC,CAAC,CAAC;AACzC,wBAAgB,YAAY,CAC1B,IAAI,EAAE,OAAO,EACb,KAAK,EAAE,OAAO,EAAE,EAChB,OAAO,EAAE,cAAc,GAAG;IAAE,MAAM,EAAE,IAAI,CAAA;CAAE,GACzC,MAAM,CAAC,iBAAiB,CAAC,CAAC;AA+E7B,wBAAgB,aAAa,CAC3B,MAAM,EAAE,UAAU,EAAE,EACpB,OAAO,CAAC,EAAE,cAAc,GACvB,MAAM,CAAC,iBAAiB,CAAC,UAAU,CAAC,CAAC,CAAC;AACzC,wBAAgB,aAAa,CAC3B,MAAM,EAAE,OAAO,EAAE,EACjB,OAAO,EAAE,cAAc,GAAG;IAAE,MAAM,EAAE,IAAI,CAAA;CAAE,GACzC,MAAM,CAAC,iBAAiB,CAAC,CAAC"}

package/dist/vendored/brepjs/topology/booleanBatchFns.js

@@ -0,0 +1,164 @@
+// Recursive halving wrappers around fuseAll / cutAll.
+//
+// The kernel's native N-way booleans (BRepAlgoAPI_BuilderAlgo) are
+// dramatically faster than sequential pairwise ops — when they succeed.
+// When they fail (one bad tool, tangent face, fuzzy tolerance mismatch),
+// the only recovery used to be N pairwise calls, which is O(N) WASM
+// crossings and frequently the dominant cost in BREP-heavy consumers.
+//
+// fuseAllBisect / cutAllBisect catch the batch failure and bisect the
+// input recursively — O(log N) batch attempts + at most 1 pairwise
+// singleton, instead of N pairwise. Telemetry surfaces which path the
+// recovery actually took.
+import { isErr, ok, err } from '../core/result.js';
+import { validationError, BrepErrorCode } from '../core/errors.js';
+import { fuse, cut, fuseAll, cutAll } from './booleanFns.js';
+import { firstOrThrow } from '../utils/arrayAccess.js';
+const REAL_OPS = { cut, cutAll, fuse, fuseAll };
+function freezeTelemetry(t) {
+    return {
+        totalInputs: t.totalInputs,
+        batchAttempts: t.batchAttempts,
+        batchSucceeded: t.batchSucceeded,
+        singletonFallbacks: t.singletonFallbacks,
+        failedInputs: [...t.failedInputs].sort((a, b) => a - b),
+    };
+}
+export function cutAllBisect(base, tools, options = {}) {
+    return cutAllBisectWith(REAL_OPS, base, tools, options);
+}
+/** @internal — testable variant accepting injected kernel ops. */
+export function cutAllBisectWith(ops, base, tools, options = {}) {
+    if (options.signal?.aborted)
+        throw options.signal.reason;
+    const telemetry = {
+        totalInputs: tools.length,
+        batchAttempts: 0,
+        batchSucceeded: 0,
+        singletonFallbacks: 0,
+        failedInputs: new Set(),
+    };
+    const result = bisectCut(ops, base, tools, 0, options, telemetry);
+    if (isErr(result))
+        return result;
+    return ok({ shape: result.value, telemetry: freezeTelemetry(telemetry) });
+}
+function bisectCut(ops, base, tools, startIdx, options, telemetry) {
+    if (tools.length === 0)
+        return ok(base);
+    if (tools.length === 1)
+        return applySingletonCut(ops, base, tools, startIdx, options, telemetry);
+    telemetry.batchAttempts++;
+    const batchResult = tryBatch(() => ops.cutAll(base, tools, options));
+    if (batchResult && batchResult.ok) {
+        telemetry.batchSucceeded++;
+        return batchResult;
+    }
+    if (options.signal?.aborted)
+        throw options.signal.reason;
+    const mid = Math.floor(tools.length / 2);
+    const left = bisectCut(ops, base, tools.slice(0, mid), startIdx, options, telemetry);
+    if (!left.ok)
+        return left;
+    return bisectCut(ops, left.value, tools.slice(mid), startIdx + mid, options, telemetry);
+}
+function applySingletonCut(ops, base, tools, startIdx, options, telemetry) {
+    telemetry.singletonFallbacks++;
+    const tool = firstOrThrow(tools);
+    const pairResult = tryBatch(() => ops.cut(base, tool, options));
+    if (pairResult && pairResult.ok)
+        return pairResult;
+    if (options.signal?.aborted)
+        throw options.signal.reason;
+    // Pairwise also failed: skip this tool, return base unchanged so the
+    // surrounding bisect can continue with the next slice.
+    telemetry.failedInputs.add(startIdx);
+    return ok(base);
+}
+export function fuseAllBisect(shapes, options = {}) {
+    return fuseAllBisectWith(REAL_OPS, shapes, options);
+}
+/** @internal — testable variant accepting injected kernel ops. */
+export function fuseAllBisectWith(ops, shapes, options = {}) {
+    if (options.signal?.aborted)
+        throw options.signal.reason;
+    if (shapes.length === 0) {
+        return err(validationError(BrepErrorCode.FUSE_ALL_EMPTY, 'fuseAllBisect requires at least one shape'));
+    }
+    const telemetry = {
+        totalInputs: shapes.length,
+        batchAttempts: 0,
+        batchSucceeded: 0,
+        singletonFallbacks: 0,
+        failedInputs: new Set(),
+    };
+    const result = bisectFuse(ops, shapes, 0, options, telemetry);
+    if (isErr(result))
+        return result;
+    return ok({ shape: result.value, telemetry: freezeTelemetry(telemetry) });
+}
+function bisectFuse(ops, shapes, startIdx, options, telemetry) {
+    if (shapes.length === 1) {
+        // No kernel call: a one-shape "fuse" is the identity. Don't count this
+        // as a fallback — the pairwise fuse that actually combines two halves
+        // is counted in combineFuseHalves, keeping the telemetry symmetric
+        // with cutAllBisect (where singletonFallbacks counts actual pairwise
+        // kernel calls).
+        return ok(firstOrThrow(shapes));
+    }
+    telemetry.batchAttempts++;
+    const batchResult = tryBatch(() => ops.fuseAll(shapes, options));
+    if (batchResult && batchResult.ok) {
+        telemetry.batchSucceeded++;
+        return batchResult;
+    }
+    if (options.signal?.aborted)
+        throw options.signal.reason;
+    const mid = Math.floor(shapes.length / 2);
+    const left = bisectFuse(ops, shapes.slice(0, mid), startIdx, options, telemetry);
+    const right = bisectFuse(ops, shapes.slice(mid), startIdx + mid, options, telemetry);
+    return combineFuseHalves(ops, left, right, shapes, startIdx, mid, options, telemetry);
+}
+function combineFuseHalves(ops, left, right, shapes, startIdx, mid, options, telemetry) {
+    if (left.ok && right.ok) {
+        // Pairwise fuse(a, b) — the 2-input kernel call, NOT a batch op.
+        telemetry.singletonFallbacks++;
+        const merged = tryBatch(() => ops.fuse(left.value, right.value, options));
+        if (merged && merged.ok) {
+            return merged;
+        }
+        // Final pairwise fuse failed: drop the right side's indices and return left.
+        for (let i = mid; i < shapes.length; i++)
+            telemetry.failedInputs.add(startIdx + i);
+        return left;
+    }
+    if (left.ok) {
+        for (let i = mid; i < shapes.length; i++)
+            telemetry.failedInputs.add(startIdx + i);
+        return left;
+    }
+    if (right.ok) {
+        for (let i = 0; i < mid; i++)
+            telemetry.failedInputs.add(startIdx + i);
+        return right;
+    }
+    return left;
+}
+// ---------------------------------------------------------------------------
+// Shared
+// ---------------------------------------------------------------------------
+/**
+ * Run a batch boolean op, returning null on kernel throw (signal-aborts
+ * propagate). The caller checks for null and bisects.
+ */
+function tryBatch(fn) {
+    try {
+        return fn();
+    }
+    catch {
+        // Caller re-checks signal.aborted before bisecting, so we don't need
+        // to distinguish abort from other throws here.
+        return null;
+    }
+}
+//# sourceMappingURL=booleanBatchFns.js.map

package/dist/vendored/brepjs/topology/booleanBatchFns.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"booleanBatchFns.js","sourceRoot":"","sources":["../../../../src/vendored/brepjs/topology/booleanBatchFns.ts"],"names":[],"mappings":"AAAA,sDAAsD;AACtD,EAAE;AACF,mEAAmE;AACnE,wEAAwE;AACxE,yEAAyE;AACzE,oEAAoE;AACpE,sEAAsE;AACtE,EAAE;AACF,sEAAsE;AACtE,mEAAmE;AACnE,sEAAsE;AACtE,0BAA0B;AAE1B,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,GAAG,EAAe,MAAM,mBAAmB,CAAC;AAChE,OAAO,EAAE,eAAe,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAInE,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,iBAAiB,CAAC;AAC7D,OAAO,EAAE,YAAY,EAAE,MAAM,yBAAyB,CAAC;AAmBvD,MAAM,QAAQ,GAAoB,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;AA6CjE,SAAS,eAAe,CAAC,CAAmB;IAC1C,OAAO;QACL,WAAW,EAAE,CAAC,CAAC,WAAW;QAC1B,aAAa,EAAE,CAAC,CAAC,aAAa;QAC9B,cAAc,EAAE,CAAC,CAAC,cAAc;QAChC,kBAAkB,EAAE,CAAC,CAAC,kBAAkB;QACxC,YAAY,EAAE,CAAC,GAAG,CAAC,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;KACxD,CAAC;AACJ,CAAC;AAgBD,MAAM,UAAU,YAAY,CAC1B,IAAa,EACb,KAAgB,EAChB,UAA0B,EAAE;IAE5B,OAAO,gBAAgB,CAAC,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;AAC1D,CAAC;AAED,kEAAkE;AAClE,MAAM,UAAU,gBAAgB,CAC9B,GAAoB,EACpB,IAAa,EACb,KAAgB,EAChB,UAA0B,EAAE;IAE5B,IAAI,OAAO,CAAC,MAAM,EAAE,OAAO;QAAE,MAAM,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC;IACzD,MAAM,SAAS,GAAqB;QAClC,WAAW,EAAE,KAAK,CAAC,MAAM;QACzB,aAAa,EAAE,CAAC;QAChB,cAAc,EAAE,CAAC;QACjB,kBAAkB,EAAE,CAAC;QACrB,YAAY,EAAE,IAAI,GAAG,EAAE;KACxB,CAAC;IACF,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;IAClE,IAAI,KAAK,CAAC,MAAM,CAAC;QAAE,OAAO,MAAM,CAAC;IACjC,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,SAAS,EAAE,eAAe,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;AAC5E,CAAC;AAED,SAAS,SAAS,CAChB,GAAoB,EACpB,IAAa,EACb,KAAyB,EACzB,QAAgB,EAChB,OAAuB,EACvB,SAA2B;IAE3B,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC,IAAI,CAAC,CAAC;IACxC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,iBAAiB,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;IAEjG,SAAS,CAAC,aAAa,EAAE,CAAC;IAC1B,MAAM,WAAW,GAAG,QAAQ,CAAC,GAAG,EAAE,CAChC,GAAG,CAAC,MAAM,CAAC,IAAkB,EAAE,KAAqB,EAAE,OAAO,CAAC,CAC/D,CAAC;IACF,IAAI,WAAW,IAAI,WAAW,CAAC,EAAE,EAAE,CAAC;QAClC,SAAS,CAAC,cAAc,EAAE,CAAC;QAC3B,OAAO,WAAW,CAAC;IACrB,CAAC;IACD,IAAI,OAAO,CAAC,MAAM,EAAE,OAAO;QAAE,MAAM,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC;IAEzD,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACzC,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;IACrF,IAAI,CAAC,IAAI,CAAC,EAAE;QAAE,OAAO,IAAI,CAAC;IAC1B,OAAO,SAAS,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,QAAQ,GAAG,GAAG,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;AAC1F,CAAC;AAED,SAAS,iBAAiB,CACxB,GAAoB,EACpB,IAAa,EACb,KAAyB,EACzB,QAAgB,EAChB,OAAuB,EACvB,SAA2B;IAE3B,SAAS,CAAC,kBAAkB,EAAE,CAAC;IAC/B,MAAM,IAAI,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;IACjC,MAAM,UAAU,GAAG,QAAQ,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,IAAkB,EAAE,IAAkB,EAAE,OAAO,CAAC,CAAC,CAAC;IAC5F,IAAI,UAAU,IAAI,UAAU,CAAC,EAAE;QAAE,OAAO,UAAU,CAAC;IACnD,IAAI,OAAO,CAAC,MAAM,EAAE,OAAO;QAAE,MAAM,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC;IACzD,qEAAqE;IACrE,uDAAuD;IACvD,SAAS,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IACrC,OAAO,EAAE,CAAC,IAAI,CAAC,CAAC;AAClB,CAAC;AAcD,MAAM,UAAU,aAAa,CAC3B,MAAiB,EACjB,UAA0B,EAAE;IAE5B,OAAO,iBAAiB,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;AACtD,CAAC;AAED,kEAAkE;AAClE,MAAM,UAAU,iBAAiB,CAC/B,GAAoB,EACpB,MAAiB,EACjB,UAA0B,EAAE;IAE5B,IAAI,OAAO,CAAC,MAAM,EAAE,OAAO;QAAE,MAAM,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC;IACzD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,OAAO,GAAG,CACR,eAAe,CAAC,aAAa,CAAC,cAAc,EAAE,2CAA2C,CAAC,CAC3F,CAAC;IACJ,CAAC;IACD,MAAM,SAAS,GAAqB;QAClC,WAAW,EAAE,MAAM,CAAC,MAAM;QAC1B,aAAa,EAAE,CAAC;QAChB,cAAc,EAAE,CAAC;QACjB,kBAAkB,EAAE,CAAC;QACrB,YAAY,EAAE,IAAI,GAAG,EAAE;KACxB,CAAC;IACF,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;IAC9D,IAAI,KAAK,CAAC,MAAM,CAAC;QAAE,OAAO,MAAM,CAAC;IACjC,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,SAAS,EAAE,eAAe,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;AAC5E,CAAC;AAED,SAAS,UAAU,CACjB,GAAoB,EACpB,MAA0B,EAC1B,QAAgB,EAChB,OAAuB,EACvB,SAA2B;IAE3B,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,uEAAuE;QACvE,sEAAsE;QACtE,mEAAmE;QACnE,qEAAqE;QACrE,iBAAiB;QACjB,OAAO,EAAE,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC;IAClC,CAAC;IAED,SAAS,CAAC,aAAa,EAAE,CAAC;IAC1B,MAAM,WAAW,GAAG,QAAQ,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,OAAO,CAAC,MAAsB,EAAE,OAAO,CAAC,CAAC,CAAC;IACjF,IAAI,WAAW,IAAI,WAAW,CAAC,EAAE,EAAE,CAAC;QAClC,SAAS,CAAC,cAAc,EAAE,CAAC;QAC3B,OAAO,WAAW,CAAC;IACrB,CAAC;IACD,IAAI,OAAO,CAAC,MAAM,EAAE,OAAO;QAAE,MAAM,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC;IAEzD,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC1C,MAAM,IAAI,GAAG,UAAU,CAAC,GAAG,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;IACjF,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,QAAQ,GAAG,GAAG,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;IACrF,OAAO,iBAAiB,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;AACxF,CAAC;AAED,SAAS,iBAAiB,CACxB,GAAoB,EACpB,IAAqB,EACrB,KAAsB,EACtB,MAA0B,EAC1B,QAAgB,EAChB,GAAW,EACX,OAAuB,EACvB,SAA2B;IAE3B,IAAI,IAAI,CAAC,EAAE,IAAI,KAAK,CAAC,EAAE,EAAE,CAAC;QACxB,iEAAiE;QACjE,SAAS,CAAC,kBAAkB,EAAE,CAAC;QAC/B,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,EAAE,CAC3B,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAmB,EAAE,KAAK,CAAC,KAAmB,EAAE,OAAO,CAAC,CACvE,CAAC;QACF,IAAI,MAAM,IAAI,MAAM,CAAC,EAAE,EAAE,CAAC;YACxB,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,6EAA6E;QAC7E,KAAK,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,SAAS,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;QACnF,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,SAAS,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;QACnF,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAI,KAAK,CAAC,EAAE,EAAE,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE;YAAE,SAAS,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;QACvE,OAAO,KAAK,CAAC;IACf,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,8EAA8E;AAC9E,SAAS;AACT,8EAA8E;AAE9E;;;GAGG;AACH,SAAS,QAAQ,CAAI,EAAmB;IACtC,IAAI,CAAC;QACH,OAAO,EAAE,EAAE,CAAC;IACd,CAAC;IAAC,MAAM,CAAC;QACP,qEAAqE;QACrE,+CAA+C;QAC/C,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC","sourcesContent":["// Recursive halving wrappers around fuseAll / cutAll.\n//\n// The kernel's native N-way booleans (BRepAlgoAPI_BuilderAlgo) are\n// dramatically faster than sequential pairwise ops — when they succeed.\n// When they fail (one bad tool, tangent face, fuzzy tolerance mismatch),\n// the only recovery used to be N pairwise calls, which is O(N) WASM\n// crossings and frequently the dominant cost in BREP-heavy consumers.\n//\n// fuseAllBisect / cutAllBisect catch the batch failure and bisect the\n// input recursively — O(log N) batch attempts + at most 1 pairwise\n// singleton, instead of N pairwise. Telemetry surfaces which path the\n// recovery actually took.\n\nimport { isErr, ok, err, type Result } from '../core/result.js';\nimport { validationError, BrepErrorCode } from '../core/errors.js';\nimport type { Shape3D } from '../core/shapeTypes.js';\nimport type { ValidSolid } from '../core/validityTypes.js';\nimport type { BooleanOptions } from '../kernel/types.js';\nimport { fuse, cut, fuseAll, cutAll } from './booleanFns.js';\nimport { firstOrThrow } from '../utils/arrayAccess.js';\n\n// ---------------------------------------------------------------------------\n// Dependency-injection seam for tests and benchmarks\n// ---------------------------------------------------------------------------\n\n/**\n * Injectable kernel ops, used by the bisect internals. The public\n * `cutAllBisect` / `fuseAllBisect` wire in the real implementations; tests\n * and benchmarks can substitute synthetic ones that throw on specified\n * inputs to drive the bisect-recovery path without module mocking.\n */\nexport interface BisectKernelOps {\n  readonly cut: typeof cut;\n  readonly cutAll: typeof cutAll;\n  readonly fuse: typeof fuse;\n  readonly fuseAll: typeof fuseAll;\n}\n\nconst REAL_OPS: BisectKernelOps = { cut, cutAll, fuse, fuseAll };\n\n// ---------------------------------------------------------------------------\n// Public result + telemetry types\n// ---------------------------------------------------------------------------\n\nexport interface BatchBisectResult<T extends Shape3D = Shape3D> {\n  readonly shape: T;\n  readonly telemetry: BatchBisectTelemetry;\n}\n\nexport interface BatchBisectTelemetry {\n  /** Number of inputs the caller passed (tools for cut, shapes for fuse). */\n  readonly totalInputs: number;\n  /** N-way kernel batch (`cutAll` / `fuseAll`) attempts, including failures. */\n  readonly batchAttempts: number;\n  /** N-way kernel batch attempts that succeeded. */\n  readonly batchSucceeded: number;\n  /**\n   * 2-input pairwise kernel call attempts after bisection bottomed out. For\n   * `cutAllBisect` this counts singleton `cut(base, tool)` calls; for\n   * `fuseAllBisect` this counts the `fuse(a, b)` calls that combine the\n   * results of two recursive halves. Both flavors mean \"the kernel did a\n   * pair op, not a batch op.\"\n   */\n  readonly singletonFallbacks: number;\n  /**\n   * Sorted, deduplicated input indices that failed even as pairwise ops and\n   * were dropped from the result. Multi-level fuse failures can target the\n   * same index from different recursion levels — dedup happens at freeze.\n   */\n  readonly failedInputs: readonly number[];\n}\n\ninterface MutableTelemetry {\n  totalInputs: number;\n  batchAttempts: number;\n  batchSucceeded: number;\n  singletonFallbacks: number;\n  // Set: multi-level fuse failures can attempt to push the same index twice\n  // (an inner combineFuseHalves drops [k], then the outer drops the same\n  // half including k). Dedup at the source.\n  failedInputs: Set<number>;\n}\n\nfunction freezeTelemetry(t: MutableTelemetry): BatchBisectTelemetry {\n  return {\n    totalInputs: t.totalInputs,\n    batchAttempts: t.batchAttempts,\n    batchSucceeded: t.batchSucceeded,\n    singletonFallbacks: t.singletonFallbacks,\n    failedInputs: [...t.failedInputs].sort((a, b) => a - b),\n  };\n}\n\n// ---------------------------------------------------------------------------\n// cutAllBisect\n// ---------------------------------------------------------------------------\n\nexport function cutAllBisect(\n  base: ValidSolid,\n  tools: ValidSolid[],\n  options?: BooleanOptions\n): Result<BatchBisectResult<ValidSolid>>;\nexport function cutAllBisect(\n  base: Shape3D,\n  tools: Shape3D[],\n  options: BooleanOptions & { unsafe: true }\n): Result<BatchBisectResult>;\nexport function cutAllBisect(\n  base: Shape3D,\n  tools: Shape3D[],\n  options: BooleanOptions = {}\n): Result<BatchBisectResult> {\n  return cutAllBisectWith(REAL_OPS, base, tools, options);\n}\n\n/** @internal — testable variant accepting injected kernel ops. */\nexport function cutAllBisectWith(\n  ops: BisectKernelOps,\n  base: Shape3D,\n  tools: Shape3D[],\n  options: BooleanOptions = {}\n): Result<BatchBisectResult> {\n  if (options.signal?.aborted) throw options.signal.reason;\n  const telemetry: MutableTelemetry = {\n    totalInputs: tools.length,\n    batchAttempts: 0,\n    batchSucceeded: 0,\n    singletonFallbacks: 0,\n    failedInputs: new Set(),\n  };\n  const result = bisectCut(ops, base, tools, 0, options, telemetry);\n  if (isErr(result)) return result;\n  return ok({ shape: result.value, telemetry: freezeTelemetry(telemetry) });\n}\n\nfunction bisectCut(\n  ops: BisectKernelOps,\n  base: Shape3D,\n  tools: readonly Shape3D[],\n  startIdx: number,\n  options: BooleanOptions,\n  telemetry: MutableTelemetry\n): Result<Shape3D> {\n  if (tools.length === 0) return ok(base);\n  if (tools.length === 1) return applySingletonCut(ops, base, tools, startIdx, options, telemetry);\n\n  telemetry.batchAttempts++;\n  const batchResult = tryBatch(() =>\n    ops.cutAll(base as ValidSolid, tools as ValidSolid[], options)\n  );\n  if (batchResult && batchResult.ok) {\n    telemetry.batchSucceeded++;\n    return batchResult;\n  }\n  if (options.signal?.aborted) throw options.signal.reason;\n\n  const mid = Math.floor(tools.length / 2);\n  const left = bisectCut(ops, base, tools.slice(0, mid), startIdx, options, telemetry);\n  if (!left.ok) return left;\n  return bisectCut(ops, left.value, tools.slice(mid), startIdx + mid, options, telemetry);\n}\n\nfunction applySingletonCut(\n  ops: BisectKernelOps,\n  base: Shape3D,\n  tools: readonly Shape3D[],\n  startIdx: number,\n  options: BooleanOptions,\n  telemetry: MutableTelemetry\n): Result<Shape3D> {\n  telemetry.singletonFallbacks++;\n  const tool = firstOrThrow(tools);\n  const pairResult = tryBatch(() => ops.cut(base as ValidSolid, tool as ValidSolid, options));\n  if (pairResult && pairResult.ok) return pairResult;\n  if (options.signal?.aborted) throw options.signal.reason;\n  // Pairwise also failed: skip this tool, return base unchanged so the\n  // surrounding bisect can continue with the next slice.\n  telemetry.failedInputs.add(startIdx);\n  return ok(base);\n}\n\n// ---------------------------------------------------------------------------\n// fuseAllBisect\n// ---------------------------------------------------------------------------\n\nexport function fuseAllBisect(\n  shapes: ValidSolid[],\n  options?: BooleanOptions\n): Result<BatchBisectResult<ValidSolid>>;\nexport function fuseAllBisect(\n  shapes: Shape3D[],\n  options: BooleanOptions & { unsafe: true }\n): Result<BatchBisectResult>;\nexport function fuseAllBisect(\n  shapes: Shape3D[],\n  options: BooleanOptions = {}\n): Result<BatchBisectResult> {\n  return fuseAllBisectWith(REAL_OPS, shapes, options);\n}\n\n/** @internal — testable variant accepting injected kernel ops. */\nexport function fuseAllBisectWith(\n  ops: BisectKernelOps,\n  shapes: Shape3D[],\n  options: BooleanOptions = {}\n): Result<BatchBisectResult> {\n  if (options.signal?.aborted) throw options.signal.reason;\n  if (shapes.length === 0) {\n    return err(\n      validationError(BrepErrorCode.FUSE_ALL_EMPTY, 'fuseAllBisect requires at least one shape')\n    );\n  }\n  const telemetry: MutableTelemetry = {\n    totalInputs: shapes.length,\n    batchAttempts: 0,\n    batchSucceeded: 0,\n    singletonFallbacks: 0,\n    failedInputs: new Set(),\n  };\n  const result = bisectFuse(ops, shapes, 0, options, telemetry);\n  if (isErr(result)) return result;\n  return ok({ shape: result.value, telemetry: freezeTelemetry(telemetry) });\n}\n\nfunction bisectFuse(\n  ops: BisectKernelOps,\n  shapes: readonly Shape3D[],\n  startIdx: number,\n  options: BooleanOptions,\n  telemetry: MutableTelemetry\n): Result<Shape3D> {\n  if (shapes.length === 1) {\n    // No kernel call: a one-shape \"fuse\" is the identity. Don't count this\n    // as a fallback — the pairwise fuse that actually combines two halves\n    // is counted in combineFuseHalves, keeping the telemetry symmetric\n    // with cutAllBisect (where singletonFallbacks counts actual pairwise\n    // kernel calls).\n    return ok(firstOrThrow(shapes));\n  }\n\n  telemetry.batchAttempts++;\n  const batchResult = tryBatch(() => ops.fuseAll(shapes as ValidSolid[], options));\n  if (batchResult && batchResult.ok) {\n    telemetry.batchSucceeded++;\n    return batchResult;\n  }\n  if (options.signal?.aborted) throw options.signal.reason;\n\n  const mid = Math.floor(shapes.length / 2);\n  const left = bisectFuse(ops, shapes.slice(0, mid), startIdx, options, telemetry);\n  const right = bisectFuse(ops, shapes.slice(mid), startIdx + mid, options, telemetry);\n  return combineFuseHalves(ops, left, right, shapes, startIdx, mid, options, telemetry);\n}\n\nfunction combineFuseHalves(\n  ops: BisectKernelOps,\n  left: Result<Shape3D>,\n  right: Result<Shape3D>,\n  shapes: readonly Shape3D[],\n  startIdx: number,\n  mid: number,\n  options: BooleanOptions,\n  telemetry: MutableTelemetry\n): Result<Shape3D> {\n  if (left.ok && right.ok) {\n    // Pairwise fuse(a, b) — the 2-input kernel call, NOT a batch op.\n    telemetry.singletonFallbacks++;\n    const merged = tryBatch(() =>\n      ops.fuse(left.value as ValidSolid, right.value as ValidSolid, options)\n    );\n    if (merged && merged.ok) {\n      return merged;\n    }\n    // Final pairwise fuse failed: drop the right side's indices and return left.\n    for (let i = mid; i < shapes.length; i++) telemetry.failedInputs.add(startIdx + i);\n    return left;\n  }\n  if (left.ok) {\n    for (let i = mid; i < shapes.length; i++) telemetry.failedInputs.add(startIdx + i);\n    return left;\n  }\n  if (right.ok) {\n    for (let i = 0; i < mid; i++) telemetry.failedInputs.add(startIdx + i);\n    return right;\n  }\n  return left;\n}\n\n// ---------------------------------------------------------------------------\n// Shared\n// ---------------------------------------------------------------------------\n\n/**\n * Run a batch boolean op, returning null on kernel throw (signal-aborts\n * propagate). The caller checks for null and bisects.\n */\nfunction tryBatch<T>(fn: () => Result<T>): Result<T> | null {\n  try {\n    return fn();\n  } catch {\n    // Caller re-checks signal.aborted before bisecting, so we don't need\n    // to distinguish abort from other throws here.\n    return null;\n  }\n}\n"]}

package/dist/vendored/brepjs/topology/booleanDiagnosticFns.d.ts

@@ -0,0 +1,21 @@
+/**
+ * Boolean pre-validation diagnostics.
+ */
+import type { Shape3D } from '../core/shapeTypes.js';
+import type { BooleanOpType, CheckBooleanResult } from '../kernel/types.js';
+/**
+ * Pre-validate operands before a boolean operation.
+ *
+ * Checks that both shapes are non-null and topologically valid.
+ * Returns a structured report of any issues found.
+ *
+ * @example
+ * ```typescript
+ * const check = checkBoolean(base, tool, 'fuse');
+ * if (!check.valid) {
+ *   console.warn('Boolean will likely fail:', check.issues);
+ * }
+ * ```
+ */
+export declare function checkBoolean(base: Shape3D, tool: Shape3D, op: BooleanOpType): CheckBooleanResult;
+//# sourceMappingURL=booleanDiagnosticFns.d.ts.map

package/dist/vendored/brepjs/topology/booleanDiagnosticFns.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"booleanDiagnosticFns.d.ts","sourceRoot":"","sources":["../../../../src/vendored/brepjs/topology/booleanDiagnosticFns.ts"],"names":[],"mappings":"AAAA;;GAEG;AAGH,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,uBAAuB,CAAC;AACrD,OAAO,KAAK,EAAE,aAAa,EAAE,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AAE5E;;;;;;;;;;;;;GAaG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,EAAE,aAAa,GAAG,kBAAkB,CAGhG"}

package/dist/vendored/brepjs/topology/booleanDiagnosticFns.js

@@ -0,0 +1,23 @@
+/**
+ * Boolean pre-validation diagnostics.
+ */
+import { getKernel } from '../kernel/index.js';
+/**
+ * Pre-validate operands before a boolean operation.
+ *
+ * Checks that both shapes are non-null and topologically valid.
+ * Returns a structured report of any issues found.
+ *
+ * @example
+ * ```typescript
+ * const check = checkBoolean(base, tool, 'fuse');
+ * if (!check.valid) {
+ *   console.warn('Boolean will likely fail:', check.issues);
+ * }
+ * ```
+ */
+export function checkBoolean(base, tool, op) {
+    const kernel = getKernel();
+    return kernel.checkBoolean(base.wrapped, tool.wrapped, op);
+}
+//# sourceMappingURL=booleanDiagnosticFns.js.map

package/dist/vendored/brepjs/topology/booleanDiagnosticFns.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"booleanDiagnosticFns.js","sourceRoot":"","sources":["../../../../src/vendored/brepjs/topology/booleanDiagnosticFns.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAI/C;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,YAAY,CAAC,IAAa,EAAE,IAAa,EAAE,EAAiB;IAC1E,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC;IAC3B,OAAO,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;AAC7D,CAAC","sourcesContent":["/**\n * Boolean pre-validation diagnostics.\n */\n\nimport { getKernel } from '../kernel/index.js';\nimport type { Shape3D } from '../core/shapeTypes.js';\nimport type { BooleanOpType, CheckBooleanResult } from '../kernel/types.js';\n\n/**\n * Pre-validate operands before a boolean operation.\n *\n * Checks that both shapes are non-null and topologically valid.\n * Returns a structured report of any issues found.\n *\n * @example\n * ```typescript\n * const check = checkBoolean(base, tool, 'fuse');\n * if (!check.valid) {\n *   console.warn('Boolean will likely fail:', check.issues);\n * }\n * ```\n */\nexport function checkBoolean(base: Shape3D, tool: Shape3D, op: BooleanOpType): CheckBooleanResult {\n  const kernel = getKernel();\n  return kernel.checkBoolean(base.wrapped, tool.wrapped, op);\n}\n"]}

package/dist/vendored/brepjs/topology/booleanFns.d.ts

@@ -0,0 +1,155 @@
+/**
+ * Boolean and compound operations — functional replacements for _3DShape boolean methods.
+ * All functions are immutable: they return new shapes without disposing inputs.
+ */
+import type { AnyShape, Dimension, OrientedFace, Shape3D } from '../core/shapeTypes.js';
+import { type Result } from '../core/result.js';
+import type { PlaneInput } from '../core/planeTypes.js';
+import type { BooleanOptions } from '../kernel/types.js';
+import type { ValidSolid } from '../core/validityTypes.js';
+export type { BooleanOptions };
+/**
+ * Fuse two 3D shapes together (boolean union). Returns a new shape.
+ *
+ * @param a - The first operand.
+ * @param b - The second operand.
+ * @param options - Boolean operation options.
+ * @returns Ok with the fused shape, or Err if the result is not 3D.
+ *
+ * @example
+ * ```ts
+ * const result = fuse(box, cylinder);
+ * if (isOk(result)) console.log(describe(result.value));
+ * ```
+ */
+export declare function fuse(a: ValidSolid, b: ValidSolid, options?: BooleanOptions): Result<ValidSolid>;
+export declare function fuse(a: Shape3D, b: Shape3D, options: BooleanOptions & {
+    unsafe: true;
+}): Result<Shape3D>;
+/**
+ * Cut a tool shape from a base shape (boolean subtraction). Returns a new shape.
+ *
+ * @param base - The shape to cut from.
+ * @param tool - The shape to subtract.
+ * @param options - Boolean operation options.
+ * @returns Ok with the cut shape, or Err if the result is not 3D.
+ *
+ * @example
+ * ```ts
+ * const result = cut(box, hole);
+ * ```
+ */
+export declare function cut(base: ValidSolid, tool: ValidSolid, options?: BooleanOptions): Result<ValidSolid>;
+export declare function cut(base: Shape3D, tool: Shape3D, options: BooleanOptions & {
+    unsafe: true;
+}): Result<Shape3D>;
+/**
+ * Compute the intersection of two shapes (boolean common). Returns a new shape.
+ *
+ * @param a - The first operand.
+ * @param b - The second operand.
+ * @param options - Boolean operation options.
+ * @returns Ok with the intersection, or Err if the result is not 3D.
+ */
+export declare function intersect(a: ValidSolid, b: ValidSolid, options?: BooleanOptions): Result<ValidSolid>;
+export declare function intersect(a: Shape3D, b: Shape3D, options: BooleanOptions & {
+    unsafe: true;
+}): Result<Shape3D>;
+/**
+ * Fuse all shapes in a single boolean operation.
+ *
+ * With `strategy: 'native'` (default), uses N-way BRepAlgoAPI_BuilderAlgo.
+ * With `strategy: 'pairwise'`, uses recursive divide-and-conquer over
+ * BRepAlgoAPI_Fuse.
+ *
+ * `strategy: 'pairwise'` is the workaround for #1126: the native N-way builder
+ * can silently corrupt the topology of certain disjoint inputs (e.g. an
+ * annular-sector tread fused with a frenet-swept rail) so the result passes all
+ * in-memory checks but traps the STEP writer. The pairwise path uses a different
+ * OCCT algorithm that is not affected. Tracked upstream at
+ * andymai/opencascade.js#3.
+ *
+ * @param shapes - Array of 3D shapes to fuse (at least one required).
+ * @param options - Boolean operation options.
+ * @returns Ok with the fused shape, or Err if the array is empty or the result is not 3D.
+ *
+ * @example
+ * ```ts
+ * const result = fuseAll([box1, box2, box3], { simplify: true });
+ * ```
+ */
+export declare function fuseAll(shapes: ValidSolid[], options?: BooleanOptions): Result<ValidSolid>;
+export declare function fuseAll(shapes: Shape3D[], options: BooleanOptions & {
+    unsafe: true;
+}): Result<Shape3D>;
+/**
+ * Cut all tool shapes from a base shape in a single boolean operation.
+ *
+ * Combines all tools into a compound before cutting to avoid accumulated
+ * floating-point drift from sequential pair-wise cuts.
+ *
+ * @param base - The shape to cut from.
+ * @param tools - Array of tool shapes to subtract.
+ * @param options - Boolean operation options.
+ * @returns Ok with the cut shape, or the base shape unchanged if tools is empty.
+ */
+export declare function cutAll(base: ValidSolid, tools: ValidSolid[], options?: BooleanOptions): Result<ValidSolid>;
+export declare function cutAll(base: Shape3D, tools: Shape3D[], options: BooleanOptions & {
+    unsafe: true;
+}): Result<Shape3D>;
+/**
+ * Section (cross-section) a shape with a plane, returning the intersection
+ * edges and wires. Useful for slicing solids to get 2D cross-section profiles.
+ *
+ * @param shape The shape to section (typically a solid or shell)
+ * @param plane Plane definition — a named plane ("XY", "XZ", etc.) or a Plane object
+ * @param options.approximation Whether to approximate the section curves (default true)
+ * @param options.planeSize Half-size of the cutting plane. Defaults to the shape's
+ *   bounding-box diagonal so large or off-origin shapes aren't clipped.
+ * @returns The section result as a shape (typically containing wires/edges)
+ */
+export declare function section(shape: AnyShape<Dimension>, plane: PlaneInput, { approximation, planeSize }?: {
+    approximation?: boolean;
+    planeSize?: number;
+}): Result<AnyShape<Dimension>>;
+/**
+ * Section a shape with a plane and return a filled Face.
+ * The outermost wire (largest bounding-box area) becomes the outer boundary;
+ * any remaining wires are treated as holes.
+ */
+export declare function sectionToFace(shape: AnyShape<Dimension>, plane: PlaneInput, options?: {
+    approximation?: boolean;
+    planeSize?: number;
+}): Result<OrientedFace>;
+/**
+ * Split a shape with one or more tool shapes using BRepAlgoAPI_Splitter.
+ * Returns all pieces from the split as a compound.
+ */
+export declare function split(shape: AnyShape<Dimension>, tools: AnyShape<Dimension>[]): Result<AnyShape<Dimension>>;
+/**
+ * Slice a shape with multiple planes, returning one cross-section per plane.
+ * Each result entry corresponds to the input plane at the same index.
+ */
+export declare function slice(shape: AnyShape<Dimension>, planes: PlaneInput[], options?: {
+    approximation?: boolean;
+    planeSize?: number;
+}): Result<AnyShape<Dimension>[]>;
+export type PipelineOp = 'fuse' | 'cut' | 'intersect';
+export interface BooleanPipelineStep {
+    readonly op: PipelineOp;
+    readonly tool: Shape3D;
+}
+/**
+ * Execute a chained boolean pipeline in a single WASM call.
+ *
+ * More efficient than sequential fuse/cut calls for long chains (e.g., 16-step
+ * spiral staircase). Skips UnifySameDomain on intermediate results — only
+ * simplifies the final shape.
+ *
+ * Falls back to sequential operations when the C++ pipeline class is not
+ * available in the WASM build.
+ */
+export declare function booleanPipeline(base: Shape3D, steps: readonly BooleanPipelineStep[], options?: {
+    readonly optimisation?: 'none' | 'commonFace' | 'sameFace' | undefined;
+}): Result<Shape3D>;
+//# sourceMappingURL=booleanFns.d.ts.map

package/dist/vendored/brepjs/topology/booleanFns.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"booleanFns.d.ts","sourceRoot":"","sources":["../../../../src/vendored/brepjs/topology/booleanFns.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,KAAK,EACV,QAAQ,EAER,SAAS,EAET,YAAY,EAEZ,OAAO,EAGR,MAAM,uBAAuB,CAAC;AAS/B,OAAO,EAAE,KAAK,MAAM,EAA0B,MAAM,mBAAmB,CAAC;AAGxE,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AA6BxD,OAAO,KAAK,EAAE,cAAc,EAAkC,MAAM,oBAAoB,CAAC;AACzF,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AAC3D,YAAY,EAAE,cAAc,EAAE,CAAC;AAoC/B;;;;;;;;;;;;;GAaG;AACH,wBAAgB,IAAI,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,UAAU,EAAE,OAAO,CAAC,EAAE,cAAc,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;AACjG,wBAAgB,IAAI,CAClB,CAAC,EAAE,OAAO,EACV,CAAC,EAAE,OAAO,EACV,OAAO,EAAE,cAAc,GAAG;IAAE,MAAM,EAAE,IAAI,CAAA;CAAE,GACzC,MAAM,CAAC,OAAO,CAAC,CAAC;AAqEnB;;;;;;;;;;;;GAYG;AACH,wBAAgB,GAAG,CACjB,IAAI,EAAE,UAAU,EAChB,IAAI,EAAE,UAAU,EAChB,OAAO,CAAC,EAAE,cAAc,GACvB,MAAM,CAAC,UAAU,CAAC,CAAC;AACtB,wBAAgB,GAAG,CACjB,IAAI,EAAE,OAAO,EACb,IAAI,EAAE,OAAO,EACb,OAAO,EAAE,cAAc,GAAG;IAAE,MAAM,EAAE,IAAI,CAAA;CAAE,GACzC,MAAM,CAAC,OAAO,CAAC,CAAC;AAqEnB;;;;;;;GAOG;AACH,wBAAgB,SAAS,CACvB,CAAC,EAAE,UAAU,EACb,CAAC,EAAE,UAAU,EACb,OAAO,CAAC,EAAE,cAAc,GACvB,MAAM,CAAC,UAAU,CAAC,CAAC;AACtB,wBAAgB,SAAS,CACvB,CAAC,EAAE,OAAO,EACV,CAAC,EAAE,OAAO,EACV,OAAO,EAAE,cAAc,GAAG;IAAE,MAAM,EAAE,IAAI,CAAA;CAAE,GACzC,MAAM,CAAC,OAAO,CAAC,CAAC;AAiKnB;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,wBAAgB,OAAO,CAAC,MAAM,EAAE,UAAU,EAAE,EAAE,OAAO,CAAC,EAAE,cAAc,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;AAC5F,wBAAgB,OAAO,CACrB,MAAM,EAAE,OAAO,EAAE,EACjB,OAAO,EAAE,cAAc,GAAG;IAAE,MAAM,EAAE,IAAI,CAAA;CAAE,GACzC,MAAM,CAAC,OAAO,CAAC,CAAC;AA0DnB;;;;;;;;;;GAUG;AACH,wBAAgB,MAAM,CACpB,IAAI,EAAE,UAAU,EAChB,KAAK,EAAE,UAAU,EAAE,EACnB,OAAO,CAAC,EAAE,cAAc,GACvB,MAAM,CAAC,UAAU,CAAC,CAAC;AACtB,wBAAgB,MAAM,CACpB,IAAI,EAAE,OAAO,EACb,KAAK,EAAE,OAAO,EAAE,EAChB,OAAO,EAAE,cAAc,GAAG;IAAE,MAAM,EAAE,IAAI,CAAA;CAAE,GACzC,MAAM,CAAC,OAAO,CAAC,CAAC;AA+GnB;;;;;;;;;;GAUG;AACH,wBAAgB,OAAO,CACrB,KAAK,EAAE,QAAQ,CAAC,SAAS,CAAC,EAC1B,KAAK,EAAE,UAAU,EACjB,EAAE,aAAoB,EAAE,SAAS,EAAE,GAAE;IAAE,aAAa,CAAC,EAAE,OAAO,CAAC;IAAC,SAAS,CAAC,EAAE,MAAM,CAAA;CAAO,GACxF,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CA8B7B;AA4ID;;;;GAIG;AACH,wBAAgB,aAAa,CAC3B,KAAK,EAAE,QAAQ,CAAC,SAAS,CAAC,EAC1B,KAAK,EAAE,UAAU,EACjB,OAAO,GAAE;IAAE,aAAa,CAAC,EAAE,OAAO,CAAC;IAAC,SAAS,CAAC,EAAE,MAAM,CAAA;CAAO,GAC5D,MAAM,CAAC,YAAY,CAAC,CA0CtB;AAMD;;;GAGG;AACH,wBAAgB,KAAK,CACnB,KAAK,EAAE,QAAQ,CAAC,SAAS,CAAC,EAC1B,KAAK,EAAE,QAAQ,CAAC,SAAS,CAAC,EAAE,GAC3B,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAmC7B;AAMD;;;GAGG;AACH,wBAAgB,KAAK,CACnB,KAAK,EAAE,QAAQ,CAAC,SAAS,CAAC,EAC1B,MAAM,EAAE,UAAU,EAAE,EACpB,OAAO,GAAE;IAAE,aAAa,CAAC,EAAE,OAAO,CAAC;IAAC,SAAS,CAAC,EAAE,MAAM,CAAA;CAAO,GAC5D,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC,CAQ/B;AAMD,MAAM,MAAM,UAAU,GAAG,MAAM,GAAG,KAAK,GAAG,WAAW,CAAC;AAEtD,MAAM,WAAW,mBAAmB;IAClC,QAAQ,CAAC,EAAE,EAAE,UAAU,CAAC;IACxB,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC;CACxB;AAED;;;;;;;;;GASG;AACH,wBAAgB,eAAe,CAC7B,IAAI,EAAE,OAAO,EACb,KAAK,EAAE,SAAS,mBAAmB,EAAE,EACrC,OAAO,CAAC,EAAE;IACR,QAAQ,CAAC,YAAY,CAAC,EAAE,MAAM,GAAG,YAAY,GAAG,UAAU,GAAG,SAAS,CAAC;CACxE,GACA,MAAM,CAAC,OAAO,CAAC,CA+BjB"}