brepjs 20.12.6 → 20.12.8

package/dist/{meshFns-Czlt-GBJ.cjs → meshFns-Djbb4PUC.cjs}

@@ -1,7 +1,8 @@
-const require_shapeTypes = require("./shapeTypes-Dc7j-MYg.cjs");
+const require_shapeTypes = require("./shapeTypes-DmThK_oa.cjs");
+const require_occtWasmAdapter = require("./occtWasmAdapter-UcYZRi-w.cjs");
 const require_errors = require("./errors-O_blYTWT.cjs");
-const require_topologyQueryFns = require("./topologyQueryFns-5Frx8Y-0.cjs");
-const require_originTrackingFns = require("./originTrackingFns-CHymOLLm.cjs");
+const require_topologyQueryFns = require("./topologyQueryFns-CXbCFaU2.cjs");
+const require_solidBuilders = require("./solidBuilders-DGskMugU.cjs");
 // src/topology/meshCache.ts
 /**
 * Build a parameter key for the inner cache map (excludes shape identity).
@@ -107,6 +108,16 @@ function createMeshCache() {
 		}
 	};
 }
+// src/io/igesSupport.ts
+/**
+* The capability error for an IGES call on a kernel built without an IGES
+* translator (occt-wasm), or `null` when `cause` is any other failure.
+*/
+function igesUnsupportedError(operation, cause) {
+	if (!require_occtWasmAdapter.isUnsupportedKernelOperationError(cause)) return null;
+	const kernel = require_shapeTypes.getKernel().kernelId;
+	return require_errors.unsupportedError(require_errors.BrepErrorCode.UNSUPPORTED_CAPABILITY, `${operation}: the ${kernel} kernel has no IGES support`, cause, { kernel }, "Exchange the model as STEP (importSTEP / exportSTEP) instead");
+}
 // src/topology/meshFns.ts
 /**
 * Meshing and export functions — functional replacements for Shape mesh/export methods.
@@ -150,7 +161,7 @@ function mesh(shape, opts = {}) {
 		includeUVs,
 		...signal ? { signal } : {}
 	});
-	const origins = require_originTrackingFns.getFaceOrigins(shape);
+	const origins = require_solidBuilders.getFaceOrigins(shape);
 	const mesh = {
 		vertices: result.vertices,
 		normals: result.normals,
@@ -297,13 +308,16 @@ function exportSTL(shape, opts = {}) {
 * Export a shape as an IGES file Blob.
 *
 * @returns Ok with a Blob (MIME type `application/iges`), or Err on failure.
+*
+* @remarks The default occt-wasm kernel is built without an IGES translator, so
+* there this returns an `UNSUPPORTED_CAPABILITY` error; export STEP instead.
 */
 function exportIGES(shape) {
 	try {
 		const igesString = require_shapeTypes.getKernel().exportIGES([shape.wrapped]);
 		return require_errors.ok(new Blob([igesString], { type: "application/iges" }));
 	} catch (e) {
-		return require_errors.err(require_errors.ioError("IGES_EXPORT_FAILED", "Failed to write IGES file", e));
+		return require_errors.err(igesUnsupportedError("exportIGES", e) ?? require_errors.ioError("IGES_EXPORT_FAILED", "Failed to write IGES file", e));
 	}
 }
 /**
@@ -472,6 +486,12 @@ Object.defineProperty(exports, "exportSTL", {
 		return exportSTL;
 	}
 });
+Object.defineProperty(exports, "igesUnsupportedError", {
+	enumerable: true,
+	get: function() {
+		return igesUnsupportedError;
+	}
+});
 Object.defineProperty(exports, "mesh", {
 	enumerable: true,
 	get: function() {

package/dist/{occtWasmAdapter-B9d0Q0Vl.js → occtWasmAdapter-BCCwaYkq.js}

@@ -1541,10 +1541,7 @@ function intersectCurves2dFn(c1, c2, tolerance) {
 		points: intersectLineCircle(c2, b2, c1, b1, tolerance),
 		segments: []
 	};
-	if (b1.__bk2d === "circle" && b2.__bk2d === "circle") return {
-		points: intersectCircleCircle(c1, b1, c2, b2, tolerance),
-		segments: []
-	};
+	if (b1.__bk2d === "circle" && b2.__bk2d === "circle") return intersectCircleCircle(c1, b1, c2, b2, tolerance);
 	return numericalIntersect(c1, c2, tolerance, c1 === c2);
 }
 /** Unwrap trimmed wrappers to get the basis curve type. */
@@ -1553,9 +1550,32 @@ function unwrapCurve(c) {
 	while (cur.__bk2d === "trimmed") cur = cur.basis;
 	return cur;
 }
-/** Check if parameter t is within the curve's domain. */
+/**
+* The interval a curve covers on its innermost basis's parameter. A trimmed wrapper's own
+* parameter runs 0..1, but the analytic solvers work on the unwrapped basis, so their
+* parameters must be bounded by this interval rather than by `curveBounds(c)`.
+*/
+function basisInterval(c) {
+	if (c.__bk2d !== "trimmed") return curveBounds(c);
+	const a = basisParam(c.basis, c.tStart);
+	const b = basisParam(c.basis, c.tEnd);
+	return {
+		first: Math.min(a, b),
+		last: Math.max(a, b)
+	};
+}
+function basisParam(c, t) {
+	let cur = c;
+	let s = t;
+	while (cur.__bk2d === "trimmed") {
+		s = cur.tStart + s * (cur.tEnd - cur.tStart);
+		cur = cur.basis;
+	}
+	return s;
+}
+/** Check if basis parameter t lies within the part of the basis that c covers. */
 function inDomain(c, t, tol) {
-	const b = curveBounds(c);
+	const b = basisInterval(c);
 	return t >= b.first - tol && t <= b.last + tol;
 }
 /** Find the parameter on curve c closest to point (px, py), searching near tGuess. */
@@ -1631,7 +1651,7 @@ function intersectLineLine(c1, l1, c2, l2, tol) {
 		points: [],
 		segments: []
 	};
-	const b1 = curveBounds(c1);
+	const b1 = basisInterval(c1);
 	const b2 = curveBounds(c2);
 	const p2s = evaluateCurve2d$1(c2, b2.first);
 	const p2e = evaluateCurve2d$1(c2, b2.last);
@@ -1672,42 +1692,83 @@ function intersectLineCircle(cLine, line, cCirc, circ, tol) {
 	}
 	return results;
 }
-function intersectConcentricArcs(c1, c2, tol) {
-	const b1 = curveBounds(c1);
-	const b2 = curveBounds(c2);
-	const isFullCircle1 = Math.abs(b1.last - b1.first - 2 * Math.PI) < 1e-10;
-	const isFullCircle2 = Math.abs(b2.last - b2.first - 2 * Math.PI) < 1e-10;
-	if (isFullCircle1 && isFullCircle2) return [];
-	if (isFullCircle1) return [evaluateCurve2d$1(c2, b2.first), evaluateCurve2d$1(c2, b2.last)];
-	if (isFullCircle2) return [evaluateCurve2d$1(c1, b1.first), evaluateCurve2d$1(c1, b1.last)];
-	const pts = [];
-	const checks = [
-		[c2, evaluateCurve2d$1(c1, b1.first)],
-		[c2, evaluateCurve2d$1(c1, b1.last)],
-		[c1, evaluateCurve2d$1(c2, b2.first)],
-		[c1, evaluateCurve2d$1(c2, b2.last)]
-	];
-	for (const [target, pt] of checks) {
-		const t = refineParam(target, pt[0], pt[1]);
-		if (t !== null) {
-			const [ex, ey] = evaluateCurve2d$1(target, t);
-			if ((ex - pt[0]) ** 2 + (ey - pt[1]) ** 2 < tol * tol * 100) pts.push(pt);
-		}
+/**
+* The counter-clockwise angular range [start, start + sweep] a circular curve covers,
+* and whether the curve itself runs counter-clockwise through it.
+*/
+function arcSpan(c, circ) {
+	const range = basisInterval(c);
+	const own = curveBounds(c);
+	const forward = basisParam(c, own.last) >= basisParam(c, own.first);
+	return {
+		start: circ.sense ? range.first : -range.last,
+		sweep: Math.min(range.last - range.first, 2 * Math.PI),
+		ccw: circ.sense === forward
+	};
+}
+/** The arc of `circ` from angle `from` counter-clockwise to `to`, traversed as `ccw` says. */
+function arcBetween(circ, from, to, ccw) {
+	const basis = makeCircle2d$1(circ.cx, circ.cy, circ.radius, ccw);
+	return ccw ? {
+		__bk2d: "trimmed",
+		basis,
+		tStart: from,
+		tEnd: to
+	} : {
+		__bk2d: "trimmed",
+		basis,
+		tStart: -to,
+		tEnd: -from
+	};
+}
+/**
+* Overlap of two arcs on the same circle: the shared stretches as segments oriented
+* along c1, and the places where the arcs only touch end to end as points.
+*/
+function intersectCoincidentArcs(c1, circ1, c2, circ2, tol) {
+	const turn = 2 * Math.PI;
+	const a = arcSpan(c1, circ1);
+	const b = arcSpan(c2, circ2);
+	const angleTol = tol / circ1.radius;
+	const isFull = (sweep) => turn - sweep <= angleTol;
+	const d = ((b.start - a.start) % turn + turn) % turn;
+	let windows;
+	if (isFull(b.sweep)) windows = [[0, a.sweep]];
+	else if (isFull(a.sweep)) windows = [[d, d + b.sweep]];
+	else windows = [[Math.max(0, d), Math.min(a.sweep, d + b.sweep)], [Math.max(0, d - turn), Math.min(a.sweep, d - turn + b.sweep)]];
+	const points = [];
+	const segments = [];
+	for (const [u, v] of windows) if (v - u > angleTol) segments.push(arcBetween(circ1, a.start + u, a.start + v, a.ccw));
+	else if (v - u > -angleTol) {
+		const angle = a.start + (u + v) / 2;
+		points.push([circ1.cx + circ1.radius * Math.cos(angle), circ1.cy + circ1.radius * Math.sin(angle)]);
 	}
-	const deduped = [];
-	for (const p of pts) if (!deduped.some(([ddx, ddy]) => (ddx - p[0]) ** 2 + (ddy - p[1]) ** 2 < tol * tol * 100)) deduped.push(p);
-	return deduped;
+	return {
+		points,
+		segments
+	};
 }
 function intersectCircleCircle(c1, circ1, c2, circ2, tol) {
 	const dx = circ2.cx - circ1.cx;
 	const dy = circ2.cy - circ1.cy;
 	const d = Math.sqrt(dx * dx + dy * dy);
+	if (d <= tol) {
+		if (Math.abs(circ1.radius - circ2.radius) > tol) return {
+			points: [],
+			segments: []
+		};
+		return intersectCoincidentArcs(c1, circ1, c2, circ2, tol);
+	}
+	return {
+		points: intersectCrossingCircles(c1, circ1, c2, circ2, tol, d),
+		segments: []
+	};
+}
+function intersectCrossingCircles(c1, circ1, c2, circ2, tol, d) {
+	const dx = circ2.cx - circ1.cx;
+	const dy = circ2.cy - circ1.cy;
 	if (d > circ1.radius + circ2.radius + tol) return [];
 	if (d < Math.abs(circ1.radius - circ2.radius) - tol) return [];
-	if (d < 1e-14) {
-		if (Math.abs(circ1.radius - circ2.radius) > tol) return [];
-		return intersectConcentricArcs(c1, c2, tol);
-	}
 	const a = (circ1.radius * circ1.radius - circ2.radius * circ2.radius + d * d) / (2 * d);
 	const h2 = circ1.radius * circ1.radius - a * a;
 	const h = Math.sqrt(Math.max(0, h2));
@@ -4447,13 +4508,15 @@ function importSTL(k, Module, data) {
 	return wrapResult(k, k.importStl(""));
 }
 function exportIGES(k, makeCompound, shapes) {
-	if (shapes.length === 1) return k.exportIges(unwrap(shapes[0]));
-	const compound = makeCompound(shapes);
-	return k.exportIges(unwrap(compound));
+	const exportIges = k.exportIges?.bind(k);
+	if (!exportIges) throw new UnsupportedKernelOperationError("occt-wasm: exportIGES is unsupported");
+	if (shapes.length === 1) return exportIges(unwrap(shapes[0]));
+	return exportIges(unwrap(makeCompound(shapes)));
 }
 function importIGES(k, data) {
-	const str = typeof data === "string" ? data : new TextDecoder().decode(data);
-	return [wrapResult(k, k.importIges(str))];
+	const importIges = k.importIges?.bind(k);
+	if (!importIges) throw new UnsupportedKernelOperationError("occt-wasm: importIGES is unsupported");
+	return [wrapResult(k, importIges(typeof data === "string" ? data : new TextDecoder().decode(data)))];
 }
 function exportSTEPAssembly(k, Module, parts, _options) {
 	if (parts.length === 0) return "";

package/dist/{occtWasmAdapter-DVxLkjlJ.cjs → occtWasmAdapter-UcYZRi-w.cjs}

@@ -1541,10 +1541,7 @@ function intersectCurves2dFn(c1, c2, tolerance) {
 		points: intersectLineCircle(c2, b2, c1, b1, tolerance),
 		segments: []
 	};
-	if (b1.__bk2d === "circle" && b2.__bk2d === "circle") return {
-		points: intersectCircleCircle(c1, b1, c2, b2, tolerance),
-		segments: []
-	};
+	if (b1.__bk2d === "circle" && b2.__bk2d === "circle") return intersectCircleCircle(c1, b1, c2, b2, tolerance);
 	return numericalIntersect(c1, c2, tolerance, c1 === c2);
 }
 /** Unwrap trimmed wrappers to get the basis curve type. */
@@ -1553,9 +1550,32 @@ function unwrapCurve(c) {
 	while (cur.__bk2d === "trimmed") cur = cur.basis;
 	return cur;
 }
-/** Check if parameter t is within the curve's domain. */
+/**
+* The interval a curve covers on its innermost basis's parameter. A trimmed wrapper's own
+* parameter runs 0..1, but the analytic solvers work on the unwrapped basis, so their
+* parameters must be bounded by this interval rather than by `curveBounds(c)`.
+*/
+function basisInterval(c) {
+	if (c.__bk2d !== "trimmed") return curveBounds(c);
+	const a = basisParam(c.basis, c.tStart);
+	const b = basisParam(c.basis, c.tEnd);
+	return {
+		first: Math.min(a, b),
+		last: Math.max(a, b)
+	};
+}
+function basisParam(c, t) {
+	let cur = c;
+	let s = t;
+	while (cur.__bk2d === "trimmed") {
+		s = cur.tStart + s * (cur.tEnd - cur.tStart);
+		cur = cur.basis;
+	}
+	return s;
+}
+/** Check if basis parameter t lies within the part of the basis that c covers. */
 function inDomain(c, t, tol) {
-	const b = curveBounds(c);
+	const b = basisInterval(c);
 	return t >= b.first - tol && t <= b.last + tol;
 }
 /** Find the parameter on curve c closest to point (px, py), searching near tGuess. */
@@ -1631,7 +1651,7 @@ function intersectLineLine(c1, l1, c2, l2, tol) {
 		points: [],
 		segments: []
 	};
-	const b1 = curveBounds(c1);
+	const b1 = basisInterval(c1);
 	const b2 = curveBounds(c2);
 	const p2s = evaluateCurve2d$1(c2, b2.first);
 	const p2e = evaluateCurve2d$1(c2, b2.last);
@@ -1672,42 +1692,83 @@ function intersectLineCircle(cLine, line, cCirc, circ, tol) {
 	}
 	return results;
 }
-function intersectConcentricArcs(c1, c2, tol) {
-	const b1 = curveBounds(c1);
-	const b2 = curveBounds(c2);
-	const isFullCircle1 = Math.abs(b1.last - b1.first - 2 * Math.PI) < 1e-10;
-	const isFullCircle2 = Math.abs(b2.last - b2.first - 2 * Math.PI) < 1e-10;
-	if (isFullCircle1 && isFullCircle2) return [];
-	if (isFullCircle1) return [evaluateCurve2d$1(c2, b2.first), evaluateCurve2d$1(c2, b2.last)];
-	if (isFullCircle2) return [evaluateCurve2d$1(c1, b1.first), evaluateCurve2d$1(c1, b1.last)];
-	const pts = [];
-	const checks = [
-		[c2, evaluateCurve2d$1(c1, b1.first)],
-		[c2, evaluateCurve2d$1(c1, b1.last)],
-		[c1, evaluateCurve2d$1(c2, b2.first)],
-		[c1, evaluateCurve2d$1(c2, b2.last)]
-	];
-	for (const [target, pt] of checks) {
-		const t = refineParam(target, pt[0], pt[1]);
-		if (t !== null) {
-			const [ex, ey] = evaluateCurve2d$1(target, t);
-			if ((ex - pt[0]) ** 2 + (ey - pt[1]) ** 2 < tol * tol * 100) pts.push(pt);
-		}
+/**
+* The counter-clockwise angular range [start, start + sweep] a circular curve covers,
+* and whether the curve itself runs counter-clockwise through it.
+*/
+function arcSpan(c, circ) {
+	const range = basisInterval(c);
+	const own = curveBounds(c);
+	const forward = basisParam(c, own.last) >= basisParam(c, own.first);
+	return {
+		start: circ.sense ? range.first : -range.last,
+		sweep: Math.min(range.last - range.first, 2 * Math.PI),
+		ccw: circ.sense === forward
+	};
+}
+/** The arc of `circ` from angle `from` counter-clockwise to `to`, traversed as `ccw` says. */
+function arcBetween(circ, from, to, ccw) {
+	const basis = makeCircle2d$1(circ.cx, circ.cy, circ.radius, ccw);
+	return ccw ? {
+		__bk2d: "trimmed",
+		basis,
+		tStart: from,
+		tEnd: to
+	} : {
+		__bk2d: "trimmed",
+		basis,
+		tStart: -to,
+		tEnd: -from
+	};
+}
+/**
+* Overlap of two arcs on the same circle: the shared stretches as segments oriented
+* along c1, and the places where the arcs only touch end to end as points.
+*/
+function intersectCoincidentArcs(c1, circ1, c2, circ2, tol) {
+	const turn = 2 * Math.PI;
+	const a = arcSpan(c1, circ1);
+	const b = arcSpan(c2, circ2);
+	const angleTol = tol / circ1.radius;
+	const isFull = (sweep) => turn - sweep <= angleTol;
+	const d = ((b.start - a.start) % turn + turn) % turn;
+	let windows;
+	if (isFull(b.sweep)) windows = [[0, a.sweep]];
+	else if (isFull(a.sweep)) windows = [[d, d + b.sweep]];
+	else windows = [[Math.max(0, d), Math.min(a.sweep, d + b.sweep)], [Math.max(0, d - turn), Math.min(a.sweep, d - turn + b.sweep)]];
+	const points = [];
+	const segments = [];
+	for (const [u, v] of windows) if (v - u > angleTol) segments.push(arcBetween(circ1, a.start + u, a.start + v, a.ccw));
+	else if (v - u > -angleTol) {
+		const angle = a.start + (u + v) / 2;
+		points.push([circ1.cx + circ1.radius * Math.cos(angle), circ1.cy + circ1.radius * Math.sin(angle)]);
 	}
-	const deduped = [];
-	for (const p of pts) if (!deduped.some(([ddx, ddy]) => (ddx - p[0]) ** 2 + (ddy - p[1]) ** 2 < tol * tol * 100)) deduped.push(p);
-	return deduped;
+	return {
+		points,
+		segments
+	};
 }
 function intersectCircleCircle(c1, circ1, c2, circ2, tol) {
 	const dx = circ2.cx - circ1.cx;
 	const dy = circ2.cy - circ1.cy;
 	const d = Math.sqrt(dx * dx + dy * dy);
+	if (d <= tol) {
+		if (Math.abs(circ1.radius - circ2.radius) > tol) return {
+			points: [],
+			segments: []
+		};
+		return intersectCoincidentArcs(c1, circ1, c2, circ2, tol);
+	}
+	return {
+		points: intersectCrossingCircles(c1, circ1, c2, circ2, tol, d),
+		segments: []
+	};
+}
+function intersectCrossingCircles(c1, circ1, c2, circ2, tol, d) {
+	const dx = circ2.cx - circ1.cx;
+	const dy = circ2.cy - circ1.cy;
 	if (d > circ1.radius + circ2.radius + tol) return [];
 	if (d < Math.abs(circ1.radius - circ2.radius) - tol) return [];
-	if (d < 1e-14) {
-		if (Math.abs(circ1.radius - circ2.radius) > tol) return [];
-		return intersectConcentricArcs(c1, c2, tol);
-	}
 	const a = (circ1.radius * circ1.radius - circ2.radius * circ2.radius + d * d) / (2 * d);
 	const h2 = circ1.radius * circ1.radius - a * a;
 	const h = Math.sqrt(Math.max(0, h2));
@@ -4447,13 +4508,15 @@ function importSTL(k, Module, data) {
 	return wrapResult(k, k.importStl(""));
 }
 function exportIGES(k, makeCompound, shapes) {
-	if (shapes.length === 1) return k.exportIges(unwrap(shapes[0]));
-	const compound = makeCompound(shapes);
-	return k.exportIges(unwrap(compound));
+	const exportIges = k.exportIges?.bind(k);
+	if (!exportIges) throw new UnsupportedKernelOperationError("occt-wasm: exportIGES is unsupported");
+	if (shapes.length === 1) return exportIges(unwrap(shapes[0]));
+	return exportIges(unwrap(makeCompound(shapes)));
 }
 function importIGES(k, data) {
-	const str = typeof data === "string" ? data : new TextDecoder().decode(data);
-	return [wrapResult(k, k.importIges(str))];
+	const importIges = k.importIges?.bind(k);
+	if (!importIges) throw new UnsupportedKernelOperationError("occt-wasm: importIGES is unsupported");
+	return [wrapResult(k, importIges(typeof data === "string" ? data : new TextDecoder().decode(data)))];
 }
 function exportSTEPAssembly(k, Module, parts, _options) {
 	if (parts.length === 0) return "";

package/dist/operations.cjs

@@ -1,6 +1,6 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const require_threadFns = require("./threadFns-CzXEnnmo.cjs");
-const require_loftFns = require("./loftFns-D5AvfCGG.cjs");
+const require_threadFns = require("./threadFns-CoGAFHHt.cjs");
+const require_loftFns = require("./loftFns-DgkK4Kj_.cjs");
 exports.addChild = require_threadFns.addChild;
 exports.addJoint = require_threadFns.addJoint;
 exports.addStep = require_threadFns.addStep;

package/dist/operations.js

@@ -1,3 +1,3 @@
-import { A as setJointValue, B as walkAssembly, C as cylindricalJoint, D as planarJoint, E as mechanismDOF, F as countNodes, H as circularPattern, I as createAssemblyNode, L as findNode, M as sphericalJoint, N as addChild, O as prismaticJoint, P as collectShapes, R as removeChild, S as addJoint, T as jointTransform, U as gridPattern, V as exportAssemblySTEP, W as linearPattern, Y as createAssembly, _ as exportURDF, b as inverseKinematics, c as modifyStep, d as replayFrom, f as replayHistory, g as undoLast, h as stepsFrom, i as createRegistry, j as setJointValues, k as revoluteJoint, l as registerOperation, m as stepCount, n as addStep, o as findStep, r as createHistory, s as getShape, t as thread, u as registerShape, v as importURDF, w as forwardKinematics, x as jointTrajectory, y as jointsFromDH, z as updateNode } from "./threadFns-DESH7lcs.js";
-import { c as twistExtrude, o as supportExtrude, r as complexExtrude, s as sweep } from "./loftFns-D5NJpHLZ.js";
+import { A as setJointValue, B as walkAssembly, C as cylindricalJoint, D as planarJoint, E as mechanismDOF, F as countNodes, H as circularPattern, I as createAssemblyNode, L as findNode, M as sphericalJoint, N as addChild, O as prismaticJoint, P as collectShapes, R as removeChild, S as addJoint, T as jointTransform, U as gridPattern, V as exportAssemblySTEP, W as linearPattern, Y as createAssembly, _ as exportURDF, b as inverseKinematics, c as modifyStep, d as replayFrom, f as replayHistory, g as undoLast, h as stepsFrom, i as createRegistry, j as setJointValues, k as revoluteJoint, l as registerOperation, m as stepCount, n as addStep, o as findStep, r as createHistory, s as getShape, t as thread, u as registerShape, v as importURDF, w as forwardKinematics, x as jointTrajectory, y as jointsFromDH, z as updateNode } from "./threadFns-BeB8s0tA.js";
+import { c as twistExtrude, o as supportExtrude, r as complexExtrude, s as sweep } from "./loftFns-lwzTh1fI.js";
 export { addChild, addJoint, addStep, circularPattern, collectShapes, complexExtrude, countNodes, createAssembly, createAssemblyNode, createHistory, createRegistry, cylindricalJoint, exportAssemblySTEP, exportURDF, findNode, findStep, forwardKinematics, getShape as getHistoryShape, gridPattern, importURDF, inverseKinematics, jointTrajectory, jointTransform, jointsFromDH, linearPattern, mechanismDOF, modifyStep, planarJoint, prismaticJoint, registerOperation, registerShape, removeChild, replayFrom, replayHistory, revoluteJoint, setJointValue, setJointValues, sphericalJoint, stepCount, stepsFrom, supportExtrude, sweep, thread, twistExtrude, undoLast, updateNode, walkAssembly };

package/dist/{primitiveFns-BVeBEaa4.cjs → primitiveFns-CfSnex9P.cjs}

@@ -1,10 +1,11 @@
-const require_shapeTypes = require("./shapeTypes-Dc7j-MYg.cjs");
+const require_shapeTypes = require("./shapeTypes-DmThK_oa.cjs");
 const require_errors = require("./errors-O_blYTWT.cjs");
-const require_validityTypes = require("./validityTypes-C6rROGTP.cjs");
+const require_validityTypes = require("./validityTypes-m6eLRTYE.cjs");
 const require_constants = require("./constants-oee0S_x6.cjs");
 const require_vecOps = require("./vecOps-CrGEPPQM.cjs");
-const require_solidBuilders = require("./solidBuilders-iS5DDwg8.cjs");
-const require_surfaceBuilders = require("./surfaceBuilders-BvwSgD3C.cjs");
+const require_solidBuilders = require("./solidBuilders-DGskMugU.cjs");
+const require_booleanFns = require("./booleanFns-D5nQ1nWS.cjs");
+const require_surfaceBuilders = require("./surfaceBuilders-DeSLKg73.cjs");
 // src/topology/transformFns.ts
 /**
 * Immutable shape transforms — translate, rotate, scale, mirror, applyMatrix.
@@ -12,10 +13,10 @@ const require_surfaceBuilders = require("./surfaceBuilders-BvwSgD3C.cjs");
 */
 /** Translate a shape by a vector. Returns a new shape. */
 function translate(shape, v) {
-	const inputFaceHashes = require_solidBuilders.collectInputFaceHashes([shape]);
+	const inputFaceHashes = require_booleanFns.collectInputFaceHashes([shape]);
 	const { shape: resultShape, evolution } = require_shapeTypes.getKernel().translateWithHistory(shape.wrapped, v[0], v[1], v[2], inputFaceHashes, require_constants.HASH_CODE_MAX);
 	const result = require_shapeTypes.castResultShape(resultShape);
-	require_solidBuilders.propagateAllMetadata(evolution, [shape], result);
+	require_booleanFns.propagateAllMetadata(evolution, [shape], result);
 	return result;
 }
 /** Rotate a shape around an axis. Angle is in degrees. Returns a new shape. */
@@ -28,10 +29,10 @@ function rotate(shape, angle, position = [
 	0,
 	1
 ]) {
-	const inputFaceHashes = require_solidBuilders.collectInputFaceHashes([shape]);
+	const inputFaceHashes = require_booleanFns.collectInputFaceHashes([shape]);
 	const { shape: resultShape, evolution } = require_shapeTypes.getKernel().rotateWithHistory(shape.wrapped, angle * require_constants.DEG2RAD, inputFaceHashes, require_constants.HASH_CODE_MAX, direction, position);
 	const result = require_shapeTypes.castResultShape(resultShape);
-	require_solidBuilders.propagateAllMetadata(evolution, [shape], result);
+	require_booleanFns.propagateAllMetadata(evolution, [shape], result);
 	return result;
 }
 /** Mirror a shape through a plane defined by origin and normal. Returns a new shape. */
@@ -44,10 +45,10 @@ function mirror(shape, planeNormal = [
 	0,
 	0
 ]) {
-	const inputFaceHashes = require_solidBuilders.collectInputFaceHashes([shape]);
+	const inputFaceHashes = require_booleanFns.collectInputFaceHashes([shape]);
 	const { shape: resultShape, evolution } = require_shapeTypes.getKernel().mirrorWithHistory(shape.wrapped, planeOrigin, planeNormal, inputFaceHashes, require_constants.HASH_CODE_MAX);
 	const result = require_shapeTypes.castResultShape(resultShape);
-	require_solidBuilders.propagateAllMetadata(evolution, [shape], result);
+	require_booleanFns.propagateAllMetadata(evolution, [shape], result);
 	return result;
 }
 /** Scale a shape uniformly. Returns a new shape. */
@@ -56,10 +57,10 @@ function scale(shape, factor, center = [
 	0,
 	0
 ]) {
-	const inputFaceHashes = require_solidBuilders.collectInputFaceHashes([shape]);
+	const inputFaceHashes = require_booleanFns.collectInputFaceHashes([shape]);
 	const { shape: resultShape, evolution } = require_shapeTypes.getKernel().scaleWithHistory(shape.wrapped, center, factor, inputFaceHashes, require_constants.HASH_CODE_MAX);
 	const result = require_shapeTypes.castResultShape(resultShape);
-	require_solidBuilders.propagateAllMetadata(evolution, [shape], result);
+	require_booleanFns.propagateAllMetadata(evolution, [shape], result);
 	return result;
 }
 /** Resize a shape to exact target dimensions with optional auto-proportional scaling. */
@@ -167,16 +168,16 @@ function applyMatrix(shape, matrix) {
 	const d = det3x3(linear);
 	if (Math.abs(d) < 1e-12) return require_errors.err(require_errors.validationError(require_errors.BrepErrorCode.VALIDATION_FAILED, "applyMatrix: singular matrix (determinant ≈ 0). Cannot apply a non-invertible transform."));
 	if (isOrthogonalMatrix(linear)) {
-		const inputFaceHashes = require_solidBuilders.collectInputFaceHashes([shape]);
+		const inputFaceHashes = require_booleanFns.collectInputFaceHashes([shape]);
 		const { shape: resultShape, evolution } = require_shapeTypes.getKernel().generalTransformWithHistory(shape.wrapped, linear, translation, true, inputFaceHashes, require_constants.HASH_CODE_MAX);
 		const result = require_shapeTypes.castResultShape(resultShape);
-		require_solidBuilders.propagateAllMetadata(evolution, [shape], result);
+		require_booleanFns.propagateAllMetadata(evolution, [shape], result);
 		return require_errors.ok(result);
 	}
 	/* v8 ignore start -- untestable until WASM is rebuilt with BRepBuilderAPI_GTransform */
 	const resultShape = require_shapeTypes.getKernel().generalTransformNonOrthogonal(shape.wrapped, linear, translation);
 	const result = require_shapeTypes.castResultShape(resultShape);
-	require_solidBuilders.propagateMetadataByHash([shape], result);
+	require_booleanFns.propagateMetadataByHash([shape], result);
 	return require_errors.ok(result);
 	/* v8 ignore stop */
 }
@@ -244,7 +245,7 @@ function locate(shape, placement) {
 		} finally {
 			_usingCtx$2.d();
 		}
-		if (require_solidBuilders.hasAnyMetadata(shape)) require_solidBuilders.propagateMetadataThroughRelocation(shape, moved);
+		if (require_booleanFns.hasAnyMetadata(shape)) require_booleanFns.propagateMetadataThroughRelocation(shape, moved);
 		return moved;
 	} catch (cause) {
 		if (moved !== void 0) try {
@@ -264,10 +265,10 @@ function locate(shape, placement) {
 * Much faster than separate clone() + translate() + rotate() calls.
 */
 function transformCopy(shape, composed) {
-	const inputFaceHashes = require_solidBuilders.collectInputFaceHashes([shape]);
+	const inputFaceHashes = require_booleanFns.collectInputFaceHashes([shape]);
 	const { shape: resultShape, evolution } = require_shapeTypes.getKernel().applyComposedTransformWithHistory(shape.wrapped, composed.trsf, inputFaceHashes, require_constants.HASH_CODE_MAX);
 	const result = require_shapeTypes.castResultShape(resultShape);
-	require_solidBuilders.propagateAllMetadata(evolution, [shape], result);
+	require_booleanFns.propagateAllMetadata(evolution, [shape], result);
 	return result;
 }
 // src/topology/primitiveFns.ts

package/dist/{primitiveFns-DeNl60Rw.js → primitiveFns-D-aYcwt2.js}

@@ -1,10 +1,11 @@
-import { E as GeometryCleanupError, G as _usingCtx, d as createSolid, n as castResultShape, q as getKernel } from "./shapeTypes-DwvQUp9M.js";
+import { E as GeometryCleanupError, G as _usingCtx, d as createSolid, n as castResultShape, q as getKernel } from "./shapeTypes-CIH-8d_a.js";
 import { E as ok, d as validationError, g as err, m as andThen, t as BrepErrorCode } from "./errors-BTccWbtE.js";
-import { n as isClosedWire } from "./validityTypes-DM-Iwe8N.js";
+import { n as isClosedWire } from "./validityTypes-DlrWkrSR.js";
 import { n as HASH_CODE_MAX, t as DEG2RAD } from "./constants-iraOnb2p.js";
 import { d as vecNormalize, h as vecScale } from "./vecOps-S-m9H_fe.js";
-import { C as propagateAllMetadata, S as hasAnyMetadata, T as propagateMetadataThroughRelocation, a as makeOffset, c as makeTorus, i as makeEllipsoid, l as makeVertex, n as makeCone, o as makeSolid, r as makeCylinder, s as makeSphere, t as makeCompound, u as weldShellsAndFaces, w as propagateMetadataByHash, x as collectInputFaceHashes } from "./solidBuilders-DT1gpVWM.js";
-import { _ as makeThreePointArc, a as makeNonPlanarFace, c as makeBSplineApproximation, d as makeCircle, f as makeEllipse, g as makeTangentArc, h as makeLine, i as makeNewFaceWithinFace, m as makeHelix, o as makePolygon, p as makeEllipseArc, r as makeFace, s as assembleWire, t as addHolesInFace, u as makeBezierCurve } from "./surfaceBuilders-CPLe0bbk.js";
+import { a as makeOffset, c as makeTorus, i as makeEllipsoid, l as makeVertex, n as makeCone, o as makeSolid, r as makeCylinder, s as makeSphere, t as makeCompound, u as weldShellsAndFaces } from "./solidBuilders-q_hwYsdo.js";
+import { d as collectInputFaceHashes, f as hasAnyMetadata, h as propagateMetadataThroughRelocation, m as propagateMetadataByHash, p as propagateAllMetadata } from "./booleanFns-cNfXGqMX.js";
+import { _ as makeThreePointArc, a as makeNonPlanarFace, c as makeBSplineApproximation, d as makeCircle, f as makeEllipse, g as makeTangentArc, h as makeLine, i as makeNewFaceWithinFace, m as makeHelix, o as makePolygon, p as makeEllipseArc, r as makeFace, s as assembleWire, t as addHolesInFace, u as makeBezierCurve } from "./surfaceBuilders-DXo4N7wQ.js";
 // src/topology/transformFns.ts
 /**
 * Immutable shape transforms — translate, rotate, scale, mirror, applyMatrix.

package/dist/{principalBoxFns-3mW_hA6z.js → principalBoxFns-Dcp9gg5e.js}

@@ -1,9 +1,9 @@
-import { G as _usingCtx, n as castResultShape, q as getKernel } from "./shapeTypes-DwvQUp9M.js";
+import { G as _usingCtx, n as castResultShape, q as getKernel } from "./shapeTypes-CIH-8d_a.js";
 import { i as wasmIndex } from "./bug-ClMTAJhe.js";
 import { E as ok, d as validationError, g as err, t as BrepErrorCode, u as unsupportedError } from "./errors-BTccWbtE.js";
-import { E as kernelCallRaw, S as subShapeCount } from "./topologyQueryFns-LXV1nTaS.js";
+import { E as kernelCallRaw, S as subShapeCount } from "./topologyQueryFns-Cp0yekBh.js";
 import { r as vecCross } from "./vecOps-S-m9H_fe.js";
-import { f as getCachedMeasurement, p as setCachedMeasurement } from "./measureFns-mxBdPiWa.js";
+import { f as getCachedMeasurement, p as setCachedMeasurement } from "./measureFns-Q3K25IfN.js";
 // src/measurement/principalBoxFns.ts
 /**
 * Principal-axes bounding box: a solid's extent measured in the frame of its

package/dist/{principalBoxFns-CG6kG7vT.cjs → principalBoxFns-IY8FfPVj.cjs}

@@ -1,9 +1,9 @@
-const require_shapeTypes = require("./shapeTypes-Dc7j-MYg.cjs");
+const require_shapeTypes = require("./shapeTypes-DmThK_oa.cjs");
 const require_bug = require("./bug-CBcpIPuf.cjs");
 const require_errors = require("./errors-O_blYTWT.cjs");
-const require_topologyQueryFns = require("./topologyQueryFns-5Frx8Y-0.cjs");
+const require_topologyQueryFns = require("./topologyQueryFns-CXbCFaU2.cjs");
 const require_vecOps = require("./vecOps-CrGEPPQM.cjs");
-const require_measureFns = require("./measureFns-CZHNWkiA.cjs");
+const require_measureFns = require("./measureFns-D_RRjCZg.cjs");
 // src/measurement/principalBoxFns.ts
 /**
 * Principal-axes bounding box: a solid's extent measured in the frame of its

package/dist/projection.cjs

@@ -1,5 +1,5 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const require_cameraFns = require("./cameraFns-RqraCXIc.cjs");
+const require_cameraFns = require("./cameraFns-6Er2lhp5.cjs");
 exports.PROJECTION_PLANES = require_cameraFns.PROJECTION_PLANES;
 exports.cameraFromPlane = require_cameraFns.cameraFromPlane;
 exports.cameraLookAt = require_cameraFns.cameraLookAt;

package/dist/projection.js

@@ -1 +1 @@
-export { o as PROJECTION_PLANES, t as cameraFromPlane, n as cameraLookAt, r as createCamera, s as isProjectionPlane, a as makeProjectedEdges, i as projectEdges } from "./cameraFns-CrClIkmV.js";
+export { o as PROJECTION_PLANES, t as cameraFromPlane, n as cameraLookAt, r as createCamera, s as isProjectionPlane, a as makeProjectedEdges, i as projectEdges } from "./cameraFns-YhB7A_Zc.js";

package/dist/query.cjs

@@ -1,6 +1,6 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const require_helpers = require("./helpers-DKEVm6Hu.cjs");
-const require_cornerFinder = require("./cornerFinder-CdOe1Wrb.cjs");
+const require_helpers = require("./helpers-DJQeDf_5.cjs");
+const require_cornerFinder = require("./cornerFinder-D9Wx3DWu.cjs");
 exports.cornerFinder = require_cornerFinder.cornerFinder;
 exports.edgeFinder = require_helpers.edgeFinder;
 exports.faceFinder = require_helpers.faceFinder;