brepjs 18.124.0 → 18.124.2

package/dist/2d.cjs

@@ -1,11 +1,11 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const require_shapeTypes = require("./shapeTypes-DZKuRt24.cjs");
+const require_shapeTypes = require("./shapeTypes-D5Y41q7x.cjs");
 const require_errors = require("./errors-RHkKO5bZ.cjs");
-const require_topologyQueryFns = require("./topologyQueryFns-DZUpJz2p.cjs");
-const require_blueprintSketcher = require("./blueprintSketcher-Bd5ZS9p6.cjs");
-const require_blueprint = require("./blueprint-BSfG0Uik.cjs");
-const require_boolean2D = require("./boolean2D-Cr6oLsbf.cjs");
-const require_blueprintFns = require("./blueprintFns-C0-nGqlW.cjs");
+const require_topologyQueryFns = require("./topologyQueryFns-gah07J7-.cjs");
+const require_blueprintSketcher = require("./blueprintSketcher-4e0yYtCY.cjs");
+const require_blueprint = require("./blueprint-CpJLcUJV.cjs");
+const require_boolean2D = require("./boolean2D-7heWA1co.cjs");
+const require_blueprintFns = require("./blueprintFns-B5nFaJI0.cjs");
 //#region src/core/curve2dHandle.ts
 /**
 * Wrap a raw kernel 2D curve handle with brand + disposal tracking.
@@ -14,7 +14,8 @@ const require_blueprintFns = require("./blueprintFns-C0-nGqlW.cjs");
 * `FinalizationRegistry` safety net, and double-dispose guards.
 */
 function createCurve2DHandle(rawHandle) {
-	const inner = require_shapeTypes.createKernelHandle(typeof rawHandle.delete === "function" ? rawHandle : { delete() {} });
+	const deletable = typeof rawHandle.delete === "function" ? rawHandle : { delete() {} };
+	const inner = require_shapeTypes.createKernelHandle(deletable);
 	return {
 		get raw() {
 			if (inner.disposed) throw new Error("Curve2DHandle has been disposed");
@@ -198,7 +199,8 @@ function distanceBetweenCurves2d(c1, c2, bounds1, bounds2) {
 */
 function liftCurve2dToPlane(curve, plane) {
 	return require_topologyQueryFns.kernelCallRaw(() => {
-		return require_shapeTypes.createEdge(require_shapeTypes.getKernel2D().liftCurve2dToPlane(curve.raw, [...plane.origin], [...plane.zDir], [...plane.xDir]));
+		const raw = require_shapeTypes.getKernel2D().liftCurve2dToPlane(curve.raw, [...plane.origin], [...plane.zDir], [...plane.xDir]);
+		return require_shapeTypes.createEdge(raw);
 	}, CURVE2D_BRIDGE_FAILED, "Failed to lift 2D curve to plane");
 }
 /** Extract the 2D parametric curve of a 3D edge on a face. */

package/dist/2d.js

@@ -1,10 +1,10 @@
-import { P as createKernelHandle, c as createEdge, q as getKernel2D } from "./shapeTypes-bHlssytH.js";
+import { P as createKernelHandle, c as createEdge, q as getKernel2D } from "./shapeTypes-BHRboc_x.js";
 import { E as ok, d as validationError, g as err, t as BrepErrorCode } from "./errors-MHLiNE-C.js";
-import { T as kernelCallRaw } from "./topologyQueryFns-DVhWxBwT.js";
-import { a as Blueprints, i as CompoundBlueprint, r as organiseBlueprints } from "./blueprintSketcher-BTGRoQ_G.js";
-import { _ as Curve2D, b as BoundingBox2d, t as Blueprint } from "./blueprint-BGWbpQ-w.js";
-import { a as fuseBlueprints, c as roundedRectangleBlueprint, i as cutBlueprints, n as fuse2D, o as intersectBlueprints, r as intersect2D, s as polysidesBlueprint, t as cut2D } from "./boolean2D-zZ9-qR5a.js";
-import { S as reverseCurve, _ as curve2dIsOnCurve, a as isInside2D, b as curve2dSplitAt, c as scale2D, d as stretch2D, f as toSVGPathD, g as curve2dFirstPoint, h as curve2dDistanceFrom, i as getOrientation2D, l as sketchOnFace2D, m as curve2dBoundingBox, o as mirror2D, p as translate2D, r as getBounds2D, s as rotate2D, t as createBlueprint, u as sketchOnPlane2D, v as curve2dLastPoint, x as curve2dTangentAt, y as curve2dParameter } from "./blueprintFns-Bt1hKlL7.js";
+import { T as kernelCallRaw } from "./topologyQueryFns-QvPyCF-7.js";
+import { a as Blueprints, i as CompoundBlueprint, r as organiseBlueprints } from "./blueprintSketcher-BjBjj2cK.js";
+import { _ as Curve2D, b as BoundingBox2d, t as Blueprint } from "./blueprint-CaY00-X2.js";
+import { a as fuseBlueprints, c as roundedRectangleBlueprint, i as cutBlueprints, n as fuse2D, o as intersectBlueprints, r as intersect2D, s as polysidesBlueprint, t as cut2D } from "./boolean2D-Bk-VrRyQ.js";
+import { S as reverseCurve, _ as curve2dIsOnCurve, a as isInside2D, b as curve2dSplitAt, c as scale2D, d as stretch2D, f as toSVGPathD, g as curve2dFirstPoint, h as curve2dDistanceFrom, i as getOrientation2D, l as sketchOnFace2D, m as curve2dBoundingBox, o as mirror2D, p as translate2D, r as getBounds2D, s as rotate2D, t as createBlueprint, u as sketchOnPlane2D, v as curve2dLastPoint, x as curve2dTangentAt, y as curve2dParameter } from "./blueprintFns-vgwEIgI0.js";
 //#region src/core/curve2dHandle.ts
 /**
 * Wrap a raw kernel 2D curve handle with brand + disposal tracking.
@@ -13,7 +13,8 @@ import { S as reverseCurve, _ as curve2dIsOnCurve, a as isInside2D, b as curve2d
 * `FinalizationRegistry` safety net, and double-dispose guards.
 */
 function createCurve2DHandle(rawHandle) {
-	const inner = createKernelHandle(typeof rawHandle.delete === "function" ? rawHandle : { delete() {} });
+	const deletable = typeof rawHandle.delete === "function" ? rawHandle : { delete() {} };
+	const inner = createKernelHandle(deletable);
 	return {
 		get raw() {
 			if (inner.disposed) throw new Error("Curve2DHandle has been disposed");
@@ -197,7 +198,8 @@ function distanceBetweenCurves2d(c1, c2, bounds1, bounds2) {
 */
 function liftCurve2dToPlane(curve, plane) {
 	return kernelCallRaw(() => {
-		return createEdge(getKernel2D().liftCurve2dToPlane(curve.raw, [...plane.origin], [...plane.zDir], [...plane.xDir]));
+		const raw = getKernel2D().liftCurve2dToPlane(curve.raw, [...plane.origin], [...plane.zDir], [...plane.xDir]);
+		return createEdge(raw);
 	}, CURVE2D_BRIDGE_FAILED, "Failed to lift 2D curve to plane");
 }
 /** Extract the 2D parametric curve of a 3D edge on a face. */

package/dist/{adjacencyFns-BJ6jcQ-N.cjs → adjacencyFns-CpKlADYt.cjs}

@@ -1,6 +1,6 @@
-const require_shapeTypes = require("./shapeTypes-DZKuRt24.cjs");
-const require_occtWasmAdapter = require("./occtWasmAdapter-Aubfbks6.cjs");
-const require_topologyQueryFns = require("./topologyQueryFns-DZUpJz2p.cjs");
+const require_shapeTypes = require("./shapeTypes-D5Y41q7x.cjs");
+const require_occtWasmAdapter = require("./occtWasmAdapter-DEpy64ji.cjs");
+const require_topologyQueryFns = require("./topologyQueryFns-gah07J7-.cjs");
 const require_constants = require("./constants-BOVyEYGH.cjs");
 //#region src/topology/adjacencyFns.ts
 /**

package/dist/{adjacencyFns-CnehwLNj.js → adjacencyFns-DECdcer5.js}

@@ -1,6 +1,6 @@
-import { G as getActiveKernelId, K as getKernel, r as castResultShapeWithKnownType, t as borrowShapeWithKnownType } from "./shapeTypes-bHlssytH.js";
-import { O as isUnsupportedKernelOperationError } from "./occtWasmAdapter-BQKQXF63.js";
-import { c as getFaces, f as getVertices, l as getOrCreateCache, s as getEdges } from "./topologyQueryFns-DVhWxBwT.js";
+import { G as getActiveKernelId, K as getKernel, r as castResultShapeWithKnownType, t as borrowShapeWithKnownType } from "./shapeTypes-BHRboc_x.js";
+import { O as isUnsupportedKernelOperationError } from "./occtWasmAdapter-BEe---7w.js";
+import { c as getFaces, f as getVertices, l as getOrCreateCache, s as getEdges } from "./topologyQueryFns-QvPyCF-7.js";
 import { n as HASH_CODE_MAX } from "./constants-ITRzCnCp.js";
 //#region src/topology/adjacencyFns.ts
 /**

package/dist/{blueprint-BGWbpQ-w.js → blueprint-CaY00-X2.js}

@@ -1,14 +1,14 @@
-import { K as getKernel, L as registerForCleanup, c as createEdge, p as createWire, q as getKernel2D, z as unregisterFromCleanup } from "./shapeTypes-bHlssytH.js";
+import { K as getKernel, L as registerForCleanup, c as createEdge, p as createWire, q as getKernel2D, z as unregisterFromCleanup } from "./shapeTypes-BHRboc_x.js";
 import { i as wasmIndex, n as bug } from "./bug-BdOHwn_e.js";
 import { E as ok, P as unwrap, d as validationError, g as err, n as computationError } from "./errors-MHLiNE-C.js";
 import { r as RAD2DEG, t as DEG2RAD } from "./constants-ITRzCnCp.js";
 import { r as toVec3 } from "./types-D24Y27N0.js";
 import { r as makePlane } from "./planeOps-CQahLrCx.js";
-import { _ as cast, h as uvCoordinates, i as faceGeomType, m as uvBounds, r as faceCenter } from "./faceFns-Ce7Fq6j5.js";
-import { p as getOrientation } from "./curveFns-BoHbhtqX.js";
+import { _ as cast, h as uvCoordinates, i as faceGeomType, m as uvBounds, r as faceCenter } from "./faceFns-fvp_zfuI.js";
+import { p as getOrientation } from "./curveFns-RczIU30U.js";
 import { n as getAtOrThrow, r as lastOrThrow, t as firstOrThrow } from "./arrayAccess-DrUGPADn.js";
-import { r as makeFace } from "./surfaceBuilders-B7UnwkQz.js";
-import { _ as samePoint, b as subtract2d, c as add2d, f as distance2d, p as normalize2d$1, t as getSingleFace, v as scalarMultiply2d } from "./helpers-CZsK8STz.js";
+import { r as makeFace } from "./surfaceBuilders-C8k0K7DR.js";
+import { _ as samePoint, b as subtract2d, c as add2d, f as distance2d, p as normalize2d$1, t as getSingleFace, v as scalarMultiply2d } from "./helpers-CyLQ07aD.js";
 //#region src/2d/lib/definitions.ts
 /** Type guard that checks whether a value is a `Point2D`. */
 function isPoint2D(point) {
@@ -504,13 +504,14 @@ var make2dBezierCurve = (startPoint, controls, endPoint) => {
 function make2dInerpolatedBSplineCurve(points, { tolerance = .001, smoothing = null, degMax = 3, degMin = 1 } = {}) {
 	try {
 		const pts = points.map((p) => [p[0], p[1]]);
-		return ok(new Curve2D(getKernel().makeBSpline2d(pts, {
+		const handle = getKernel().makeBSpline2d(pts, {
 			tolerance,
 			smoothing,
 			degMax,
 			degMin,
 			continuity: "C2"
-		})));
+		});
+		return ok(new Curve2D(handle));
 	} catch (e) {
 		return err(computationError("BSPLINE_2D_FAILED", "B-spline approximation failed", e));
 	}
@@ -523,7 +524,8 @@ function make2dInerpolatedBSplineCurve(points, { tolerance = .001, smoothing = n
 var make2dArcFromCenter = (startPoint, endPoint, center, longArc = false) => {
 	const midChord = scalarMultiply2d(add2d(startPoint, endPoint), .5);
 	const orientedRadius = distance2d(center, startPoint) * (longArc ? -1 : 1);
-	return make2dThreePointArc(startPoint, add2d(scalarMultiply2d(normalize2d(subtract2d(midChord, center)), orientedRadius), center), endPoint);
+	const midChordDir = normalize2d(subtract2d(midChord, center));
+	return make2dThreePointArc(startPoint, add2d(scalarMultiply2d(midChordDir, orientedRadius), center), endPoint);
 };
 //#endregion
 //#region src/2d/lib/svgPath.ts
@@ -916,8 +918,10 @@ var Blueprint = class Blueprint {
 	* @returns A new Face bounded by the blueprint's profile.
 	*/
 	subFace(face, origin) {
-		const originVec3 = toVec3(origin || [...faceCenter(face)]);
-		return unwrap(makeFace(this.translate(uvCoordinates(face, originVec3)).sketchOnFace(face, "original").wire));
+		const originPoint = origin || [...faceCenter(face)];
+		const originVec3 = toVec3(originPoint);
+		const sketch = this.translate(uvCoordinates(face, originVec3)).sketchOnFace(face, "original");
+		return unwrap(makeFace(sketch.wire));
 	}
 	/**
 	* Cut a prism-shaped hole through a solid along a face using this blueprint.
@@ -933,7 +937,8 @@ var Blueprint = class Blueprint {
 	punchHole(shape, face, { height = null, origin = null, draftAngle = 0 } = {}) {
 		const foundFace = unwrap(getSingleFace(face, shape));
 		const hole = this.subFace(foundFace, origin);
-		return unwrap(cast(getKernel().draftPrism(shape.wrapped, hole.wrapped, foundFace.wrapped, height, draftAngle, false)));
+		const result = getKernel().draftPrism(shape.wrapped, hole.wrapped, foundFace.wrapped, height, draftAngle, false);
+		return unwrap(cast(result));
 	}
 	/** Convert the blueprint to an SVG path `d` attribute string. */
 	toSVGPathD() {

package/dist/{blueprint-BSfG0Uik.cjs → blueprint-CpJLcUJV.cjs}

@@ -1,14 +1,14 @@
-const require_shapeTypes = require("./shapeTypes-DZKuRt24.cjs");
+const require_shapeTypes = require("./shapeTypes-D5Y41q7x.cjs");
 const require_bug = require("./bug-O02CsAmt.cjs");
 const require_errors = require("./errors-RHkKO5bZ.cjs");
 const require_constants = require("./constants-BOVyEYGH.cjs");
 const require_types = require("./types-KjA8tY4Y.cjs");
 const require_planeOps = require("./planeOps-VlFxtvzY.cjs");
-const require_faceFns = require("./faceFns-UozswcwP.cjs");
-const require_curveFns = require("./curveFns-BBLaLG1U.cjs");
+const require_faceFns = require("./faceFns-C4xNv2zn.cjs");
+const require_curveFns = require("./curveFns-BZZYHVow.cjs");
 const require_arrayAccess = require("./arrayAccess-e4H9cBfh.cjs");
-const require_surfaceBuilders = require("./surfaceBuilders-0x7j0ibk.cjs");
-const require_helpers = require("./helpers-DuTAcGVX.cjs");
+const require_surfaceBuilders = require("./surfaceBuilders-BXNZydNl.cjs");
+const require_helpers = require("./helpers-CHYzwQMk.cjs");
 //#region src/2d/lib/definitions.ts
 /** Type guard that checks whether a value is a `Point2D`. */
 function isPoint2D(point) {
@@ -504,13 +504,14 @@ var make2dBezierCurve = (startPoint, controls, endPoint) => {
 function make2dInerpolatedBSplineCurve(points, { tolerance = .001, smoothing = null, degMax = 3, degMin = 1 } = {}) {
 	try {
 		const pts = points.map((p) => [p[0], p[1]]);
-		return require_errors.ok(new Curve2D(require_shapeTypes.getKernel().makeBSpline2d(pts, {
+		const handle = require_shapeTypes.getKernel().makeBSpline2d(pts, {
 			tolerance,
 			smoothing,
 			degMax,
 			degMin,
 			continuity: "C2"
-		})));
+		});
+		return require_errors.ok(new Curve2D(handle));
 	} catch (e) {
 		return require_errors.err(require_errors.computationError("BSPLINE_2D_FAILED", "B-spline approximation failed", e));
 	}
@@ -917,8 +918,10 @@ var Blueprint = class Blueprint {
 	* @returns A new Face bounded by the blueprint's profile.
 	*/
 	subFace(face, origin) {
-		const originVec3 = require_types.toVec3(origin || [...require_faceFns.faceCenter(face)]);
-		return require_errors.unwrap(require_surfaceBuilders.makeFace(this.translate(require_faceFns.uvCoordinates(face, originVec3)).sketchOnFace(face, "original").wire));
+		const originPoint = origin || [...require_faceFns.faceCenter(face)];
+		const originVec3 = require_types.toVec3(originPoint);
+		const sketch = this.translate(require_faceFns.uvCoordinates(face, originVec3)).sketchOnFace(face, "original");
+		return require_errors.unwrap(require_surfaceBuilders.makeFace(sketch.wire));
 	}
 	/**
 	* Cut a prism-shaped hole through a solid along a face using this blueprint.
@@ -934,7 +937,8 @@ var Blueprint = class Blueprint {
 	punchHole(shape, face, { height = null, origin = null, draftAngle = 0 } = {}) {
 		const foundFace = require_errors.unwrap(require_helpers.getSingleFace(face, shape));
 		const hole = this.subFace(foundFace, origin);
-		return require_errors.unwrap(require_faceFns.cast(require_shapeTypes.getKernel().draftPrism(shape.wrapped, hole.wrapped, foundFace.wrapped, height, draftAngle, false)));
+		const result = require_shapeTypes.getKernel().draftPrism(shape.wrapped, hole.wrapped, foundFace.wrapped, height, draftAngle, false);
+		return require_errors.unwrap(require_faceFns.cast(result));
 	}
 	/** Convert the blueprint to an SVG path `d` attribute string. */
 	toSVGPathD() {

package/dist/{blueprintFns-C0-nGqlW.cjs → blueprintFns-B5nFaJI0.cjs}

@@ -1,6 +1,6 @@
 const require_errors = require("./errors-RHkKO5bZ.cjs");
-const require_blueprintSketcher = require("./blueprintSketcher-Bd5ZS9p6.cjs");
-const require_blueprint = require("./blueprint-BSfG0Uik.cjs");
+const require_blueprintSketcher = require("./blueprintSketcher-4e0yYtCY.cjs");
+const require_blueprint = require("./blueprint-CpJLcUJV.cjs");
 //#region src/2d/lib/curve2dFns.ts
 /**
 * Return a reversed copy of the curve (non-mutating).

package/dist/{blueprintFns-Bt1hKlL7.js → blueprintFns-vgwEIgI0.js}

@@ -1,6 +1,6 @@
 import { E as ok, d as validationError, g as err, t as BrepErrorCode } from "./errors-MHLiNE-C.js";
-import { i as CompoundBlueprint } from "./blueprintSketcher-BTGRoQ_G.js";
-import { t as Blueprint } from "./blueprint-BGWbpQ-w.js";
+import { i as CompoundBlueprint } from "./blueprintSketcher-BjBjj2cK.js";
+import { t as Blueprint } from "./blueprint-CaY00-X2.js";
 //#region src/2d/lib/curve2dFns.ts
 /**
 * Return a reversed copy of the curve (non-mutating).

package/dist/{blueprintSketcher-Bd5ZS9p6.cjs → blueprintSketcher-4e0yYtCY.cjs}

@@ -1,10 +1,10 @@
-const require_shapeTypes = require("./shapeTypes-DZKuRt24.cjs");
+const require_shapeTypes = require("./shapeTypes-D5Y41q7x.cjs");
 const require_bug = require("./bug-O02CsAmt.cjs");
 const require_errors = require("./errors-RHkKO5bZ.cjs");
 const require_constants = require("./constants-BOVyEYGH.cjs");
 const require_arrayAccess = require("./arrayAccess-e4H9cBfh.cjs");
-const require_helpers = require("./helpers-DuTAcGVX.cjs");
-const require_blueprint = require("./blueprint-BSfG0Uik.cjs");
+const require_helpers = require("./helpers-CHYzwQMk.cjs");
+const require_blueprint = require("./blueprint-CpJLcUJV.cjs");
 //#region node_modules/flatqueue/index.js
 /**
 * @typedef {Float64ArrayConstructor | Float32ArrayConstructor |
@@ -198,7 +198,7 @@ var Flatbush = class Flatbush {
 			this.minY = Infinity;
 			this.maxX = -Infinity;
 			this.maxY = -Infinity;
-			new Uint8Array(data, 0, 2).set([251, (VERSION << 4) + arrayTypeIndex]);
+			new Uint8Array(data, 0, 2).set([251, 48 + arrayTypeIndex]);
 			new Uint16Array(data, 2, 1)[0] = nodeSize;
 			new Uint32Array(data, 4, 1)[0] = numItems;
 		}
@@ -252,7 +252,9 @@ var Flatbush = class Flatbush {
 			const itemMinY = boxes[pos++];
 			const itemMaxX = boxes[pos++];
 			const itemMaxY = boxes[pos++];
-			hilbertValues[i] = hilbert(sx * ((itemMinX + itemMaxX) / 2 - minX) | 0, sy * ((itemMinY + itemMaxY) / 2 - minY) | 0);
+			const x = sx * ((itemMinX + itemMaxX) / 2 - minX) | 0;
+			const y = sy * ((itemMinY + itemMaxY) / 2 - minY) | 0;
+			hilbertValues[i] = hilbert(x, y);
 		}
 		sort(hilbertValues, boxes, indices, 0, numItems - 1, nodeSize);
 		let pos = numItems * 4;
@@ -557,7 +559,8 @@ var intersectCurves = (first, second, precision = 1e-9) => {
 	}
 	const isDegenerate = (c) => {
 		if (!require_helpers.samePoint(c.firstPoint, c.lastPoint, precision)) return false;
-		return require_helpers.samePoint(c.value((c.firstParameter + c.lastParameter) / 2), c.firstPoint, precision);
+		const mid = c.value((c.firstParameter + c.lastParameter) / 2);
+		return require_helpers.samePoint(mid, c.firstPoint, precision);
 	};
 	const segmentsAsPoints = commonSegments.filter(isDegenerate).map((c) => c.firstPoint);
 	if (segmentsAsPoints.length) {
@@ -642,7 +645,8 @@ var make2dOffset = (curve, offset) => {
 				lastPoint: offsetViaCenter(curve.lastPoint)
 			};
 		}
-		const fullCircle = new require_blueprint.Curve2D(kernel.makeCircle2d(cx, cy, newRadius, isDirect));
+		const circleHandle = kernel.makeCircle2d(cx, cy, newRadius, isDirect);
+		const fullCircle = new require_blueprint.Curve2D(circleHandle);
 		let trimmedHandle;
 		try {
 			trimmedHandle = kernel.trimCurve2d(fullCircle.wrapped, curve.firstParameter, curve.lastParameter);
@@ -655,7 +659,8 @@ var make2dOffset = (curve, offset) => {
 		const { firstPoint, lastPoint } = offsetEndPoints(curve.firstPoint, curve.lastPoint, offset);
 		return require_blueprint.make2dSegmentCurve(firstPoint, lastPoint);
 	}
-	const offsetCurve = new require_blueprint.Curve2D(kernel.offsetCurve2d(curve.wrapped, offset));
+	const offsetHandle = kernel.offsetCurve2d(curve.wrapped, offset);
+	const offsetCurve = new require_blueprint.Curve2D(offsetHandle);
 	const approximation = require_blueprint.approximateAsBSpline(offsetCurve);
 	offsetCurve.delete();
 	if (require_errors.unwrap(selfIntersections(approximation)).length) {
@@ -811,7 +816,9 @@ function chamferCurves(firstCurve, secondCurve, radius) {
 * round end-mill of the given radius can fully reach the corner.
 */
 function dogboneFilletCurves(firstCurve, secondCurve, radius) {
-	const sinAngle = require_helpers.crossProduct2d(require_blueprint.normalize2d(firstCurve.tangentAt(1)), require_blueprint.normalize2d(secondCurve.tangentAt(0)));
+	const tgt1 = require_blueprint.normalize2d(firstCurve.tangentAt(1));
+	const tgt2 = require_blueprint.normalize2d(secondCurve.tangentAt(0));
+	const sinAngle = require_helpers.crossProduct2d(tgt1, tgt2);
 	const a = Math.asin(sinAngle);
 	if (Math.abs(sinAngle) < 1e-10) return [firstCurve, secondCurve];
 	const orientationCorrection = sinAngle > 0 ? -1 : 1;
@@ -968,10 +975,11 @@ var Blueprints = class Blueprints {
 	}
 	/** Render a complete SVG document string for all child blueprints. */
 	toSVG(margin = 1) {
-		return require_blueprint.asSVG(this.blueprints.map((bp) => {
+		const elements = this.blueprints.map((bp) => {
 			if (bp instanceof require_blueprint.Blueprint) return bp.toSVGPath();
 			else return bp.toSVGGroup();
-		}).join("\n    "), this.boundingBox, margin);
+		});
+		return require_blueprint.asSVG(elements.join("\n    "), this.boundingBox, margin);
 	}
 };
 //#endregion

package/dist/{blueprintSketcher-BTGRoQ_G.js → blueprintSketcher-BjBjj2cK.js}

@@ -1,10 +1,10 @@
-import { K as getKernel, q as getKernel2D } from "./shapeTypes-bHlssytH.js";
+import { K as getKernel, q as getKernel2D } from "./shapeTypes-BHRboc_x.js";
 import { i as wasmIndex, n as bug } from "./bug-BdOHwn_e.js";
 import { E as ok, P as unwrap, g as err, n as computationError, s as safeIndex, x as isOk } from "./errors-MHLiNE-C.js";
 import { r as RAD2DEG, t as DEG2RAD } from "./constants-ITRzCnCp.js";
 import { t as firstOrThrow } from "./arrayAccess-DrUGPADn.js";
-import { _ as samePoint, b as subtract2d, c as add2d, d as crossProduct2d, f as distance2d, g as rotate2d, h as polarToCartesian, m as polarAngle2d, u as cartesianToPolar, v as scalarMultiply2d } from "./helpers-CZsK8STz.js";
-import { S as isPoint2D, _ as Curve2D, b as BoundingBox2d, c as make2dCircle, f as make2dSegmentCurve, h as approximateAsBSpline, m as make2dThreePointArc, n as asSVG, o as make2dArcFromCenter, p as make2dTangentArc, r as viewbox, s as make2dBezierCurve, t as Blueprint, u as make2dEllipseArc, y as normalize2d } from "./blueprint-BGWbpQ-w.js";
+import { _ as samePoint, b as subtract2d, c as add2d, d as crossProduct2d, f as distance2d, g as rotate2d, h as polarToCartesian, m as polarAngle2d, u as cartesianToPolar, v as scalarMultiply2d } from "./helpers-CyLQ07aD.js";
+import { S as isPoint2D, _ as Curve2D, b as BoundingBox2d, c as make2dCircle, f as make2dSegmentCurve, h as approximateAsBSpline, m as make2dThreePointArc, n as asSVG, o as make2dArcFromCenter, p as make2dTangentArc, r as viewbox, s as make2dBezierCurve, t as Blueprint, u as make2dEllipseArc, y as normalize2d } from "./blueprint-CaY00-X2.js";
 //#region node_modules/flatqueue/index.js
 /**
 * @typedef {Float64ArrayConstructor | Float32ArrayConstructor |
@@ -198,7 +198,7 @@ var Flatbush = class Flatbush {
 			this.minY = Infinity;
 			this.maxX = -Infinity;
 			this.maxY = -Infinity;
-			new Uint8Array(data, 0, 2).set([251, (VERSION << 4) + arrayTypeIndex]);
+			new Uint8Array(data, 0, 2).set([251, 48 + arrayTypeIndex]);
 			new Uint16Array(data, 2, 1)[0] = nodeSize;
 			new Uint32Array(data, 4, 1)[0] = numItems;
 		}
@@ -252,7 +252,9 @@ var Flatbush = class Flatbush {
 			const itemMinY = boxes[pos++];
 			const itemMaxX = boxes[pos++];
 			const itemMaxY = boxes[pos++];
-			hilbertValues[i] = hilbert(sx * ((itemMinX + itemMaxX) / 2 - minX) | 0, sy * ((itemMinY + itemMaxY) / 2 - minY) | 0);
+			const x = sx * ((itemMinX + itemMaxX) / 2 - minX) | 0;
+			const y = sy * ((itemMinY + itemMaxY) / 2 - minY) | 0;
+			hilbertValues[i] = hilbert(x, y);
 		}
 		sort(hilbertValues, boxes, indices, 0, numItems - 1, nodeSize);
 		let pos = numItems * 4;
@@ -557,7 +559,8 @@ var intersectCurves = (first, second, precision = 1e-9) => {
 	}
 	const isDegenerate = (c) => {
 		if (!samePoint(c.firstPoint, c.lastPoint, precision)) return false;
-		return samePoint(c.value((c.firstParameter + c.lastParameter) / 2), c.firstPoint, precision);
+		const mid = c.value((c.firstParameter + c.lastParameter) / 2);
+		return samePoint(mid, c.firstPoint, precision);
 	};
 	const segmentsAsPoints = commonSegments.filter(isDegenerate).map((c) => c.firstPoint);
 	if (segmentsAsPoints.length) {
@@ -642,7 +645,8 @@ var make2dOffset = (curve, offset) => {
 				lastPoint: offsetViaCenter(curve.lastPoint)
 			};
 		}
-		const fullCircle = new Curve2D(kernel.makeCircle2d(cx, cy, newRadius, isDirect));
+		const circleHandle = kernel.makeCircle2d(cx, cy, newRadius, isDirect);
+		const fullCircle = new Curve2D(circleHandle);
 		let trimmedHandle;
 		try {
 			trimmedHandle = kernel.trimCurve2d(fullCircle.wrapped, curve.firstParameter, curve.lastParameter);
@@ -655,7 +659,8 @@ var make2dOffset = (curve, offset) => {
 		const { firstPoint, lastPoint } = offsetEndPoints(curve.firstPoint, curve.lastPoint, offset);
 		return make2dSegmentCurve(firstPoint, lastPoint);
 	}
-	const offsetCurve = new Curve2D(kernel.offsetCurve2d(curve.wrapped, offset));
+	const offsetHandle = kernel.offsetCurve2d(curve.wrapped, offset);
+	const offsetCurve = new Curve2D(offsetHandle);
 	const approximation = approximateAsBSpline(offsetCurve);
 	offsetCurve.delete();
 	if (unwrap(selfIntersections(approximation)).length) {
@@ -811,7 +816,9 @@ function chamferCurves(firstCurve, secondCurve, radius) {
 * round end-mill of the given radius can fully reach the corner.
 */
 function dogboneFilletCurves(firstCurve, secondCurve, radius) {
-	const sinAngle = crossProduct2d(normalize2d(firstCurve.tangentAt(1)), normalize2d(secondCurve.tangentAt(0)));
+	const tgt1 = normalize2d(firstCurve.tangentAt(1));
+	const tgt2 = normalize2d(secondCurve.tangentAt(0));
+	const sinAngle = crossProduct2d(tgt1, tgt2);
 	const a = Math.asin(sinAngle);
 	if (Math.abs(sinAngle) < 1e-10) return [firstCurve, secondCurve];
 	const orientationCorrection = sinAngle > 0 ? -1 : 1;
@@ -968,10 +975,11 @@ var Blueprints = class Blueprints {
 	}
 	/** Render a complete SVG document string for all child blueprints. */
 	toSVG(margin = 1) {
-		return asSVG(this.blueprints.map((bp) => {
+		const elements = this.blueprints.map((bp) => {
 			if (bp instanceof Blueprint) return bp.toSVGPath();
 			else return bp.toSVGGroup();
-		}).join("\n    "), this.boundingBox, margin);
+		});
+		return asSVG(elements.join("\n    "), this.boundingBox, margin);
 	}
 };
 //#endregion

package/dist/{boolean2D-Cr6oLsbf.cjs → boolean2D-7heWA1co.cjs}

@@ -1,10 +1,10 @@
 const require_bug = require("./bug-O02CsAmt.cjs");
 const require_errors = require("./errors-RHkKO5bZ.cjs");
 const require_arrayAccess = require("./arrayAccess-e4H9cBfh.cjs");
-const require_surfaceBuilders = require("./surfaceBuilders-0x7j0ibk.cjs");
-const require_blueprintSketcher = require("./blueprintSketcher-Bd5ZS9p6.cjs");
-const require_helpers = require("./helpers-DuTAcGVX.cjs");
-const require_blueprint = require("./blueprint-BSfG0Uik.cjs");
+const require_surfaceBuilders = require("./surfaceBuilders-BXNZydNl.cjs");
+const require_blueprintSketcher = require("./blueprintSketcher-4e0yYtCY.cjs");
+const require_helpers = require("./helpers-CHYzwQMk.cjs");
+const require_blueprint = require("./blueprint-CpJLcUJV.cjs");
 //#region src/2d/blueprints/cannedBlueprints.ts
 /**
 * Create a regular polygon blueprint inscribed in a circle of the given radius.
@@ -66,8 +66,10 @@ var roundedRectangleBlueprint = (width, height, r = 0) => {
 	const symmetricRadius = rx === ry;
 	const sk = new require_blueprintSketcher.BlueprintSketcher([Math.min(0, -(width / 2 - rx)), -height / 2]);
 	const addFillet = (xDist, yDist) => {
-		if (withRadius) if (symmetricRadius) sk.tangentArc(xDist, yDist);
-		else sk.ellipse(xDist, yDist, rx, ry, 0, false, true);
+		if (withRadius) {
+			if (symmetricRadius) sk.tangentArc(xDist, yDist);
+			else sk.ellipse(xDist, yDist, rx, ry, 0, false, true);
+		}
 	};
 	if (rx < width / 2) sk.hLine(width - 2 * rx);
 	addFillet(rx, ry);
@@ -268,7 +270,8 @@ function findAllIntersections(first, second) {
 		const [[xMin, yMin], [xMax, yMax]] = thisCurve.boundingBox.bounds;
 		const candidates = secondIndex.search(xMin, yMin, xMax, yMax);
 		for (const secondIdx of candidates) {
-			const { intersections, commonSegments, commonSegmentsPoints } = require_errors.unwrap(require_blueprintSketcher.intersectCurves(thisCurve, require_bug.wasmIndex(second.curves, secondIdx), require_helpers.PRECISION_INTERSECTION / 100));
+			const otherCurve = require_bug.wasmIndex(second.curves, secondIdx);
+			const { intersections, commonSegments, commonSegmentsPoints } = require_errors.unwrap(require_blueprintSketcher.intersectCurves(thisCurve, otherCurve, require_helpers.PRECISION_INTERSECTION / 100));
 			allIntersections.push(...intersections);
 			firstCurvePoints[firstIdx]?.push(...intersections);
 			secondCurvePoints[secondIdx]?.push(...intersections);
@@ -404,7 +407,8 @@ function mergeCollinearSegments(curves) {
 function splitPaths(curves) {
 	const startPoints = curves.map((c) => c.firstPoint);
 	const shiftedEndPoints = curves.map((c) => c.lastPoint);
-	const discontinuities = require_surfaceBuilders.zip([startPoints, shiftedEndPoints.slice(-1).concat(shiftedEndPoints.slice(0, -1))]).map(([startPoint, endPoint], index) => {
+	const endPoints = shiftedEndPoints.slice(-1).concat(shiftedEndPoints.slice(0, -1));
+	const discontinuities = require_surfaceBuilders.zip([startPoints, endPoints]).map(([startPoint, endPoint], index) => {
 		if (startPoint === void 0 || endPoint === void 0) return null;
 		return samePoint(startPoint, endPoint) ? null : index;
 	}).filter((f) => f !== null);

package/dist/{boolean2D-zZ9-qR5a.js → boolean2D-Bk-VrRyQ.js}

@@ -1,10 +1,10 @@
 import { i as wasmIndex, n as bug } from "./bug-BdOHwn_e.js";
 import { P as unwrap, s as safeIndex } from "./errors-MHLiNE-C.js";
 import { r as lastOrThrow } from "./arrayAccess-DrUGPADn.js";
-import { v as zip } from "./surfaceBuilders-B7UnwkQz.js";
-import { a as Blueprints, i as CompoundBlueprint, l as intersectCurves, r as organiseBlueprints, t as BlueprintSketcher, u as Flatbush } from "./blueprintSketcher-BTGRoQ_G.js";
-import { _ as samePoint$1, b as subtract2d, d as crossProduct2d, o as PRECISION_INTERSECTION } from "./helpers-CZsK8STz.js";
-import { f as make2dSegmentCurve, t as Blueprint, x as removeDuplicatePoints } from "./blueprint-BGWbpQ-w.js";
+import { v as zip } from "./surfaceBuilders-C8k0K7DR.js";
+import { a as Blueprints, i as CompoundBlueprint, l as intersectCurves, r as organiseBlueprints, t as BlueprintSketcher, u as Flatbush } from "./blueprintSketcher-BjBjj2cK.js";
+import { _ as samePoint$1, b as subtract2d, d as crossProduct2d, o as PRECISION_INTERSECTION } from "./helpers-CyLQ07aD.js";
+import { f as make2dSegmentCurve, t as Blueprint, x as removeDuplicatePoints } from "./blueprint-CaY00-X2.js";
 //#region src/2d/blueprints/cannedBlueprints.ts
 /**
 * Create a regular polygon blueprint inscribed in a circle of the given radius.
@@ -66,8 +66,10 @@ var roundedRectangleBlueprint = (width, height, r = 0) => {
 	const symmetricRadius = rx === ry;
 	const sk = new BlueprintSketcher([Math.min(0, -(width / 2 - rx)), -height / 2]);
 	const addFillet = (xDist, yDist) => {
-		if (withRadius) if (symmetricRadius) sk.tangentArc(xDist, yDist);
-		else sk.ellipse(xDist, yDist, rx, ry, 0, false, true);
+		if (withRadius) {
+			if (symmetricRadius) sk.tangentArc(xDist, yDist);
+			else sk.ellipse(xDist, yDist, rx, ry, 0, false, true);
+		}
 	};
 	if (rx < width / 2) sk.hLine(width - 2 * rx);
 	addFillet(rx, ry);
@@ -268,7 +270,8 @@ function findAllIntersections(first, second) {
 		const [[xMin, yMin], [xMax, yMax]] = thisCurve.boundingBox.bounds;
 		const candidates = secondIndex.search(xMin, yMin, xMax, yMax);
 		for (const secondIdx of candidates) {
-			const { intersections, commonSegments, commonSegmentsPoints } = unwrap(intersectCurves(thisCurve, wasmIndex(second.curves, secondIdx), PRECISION_INTERSECTION / 100));
+			const otherCurve = wasmIndex(second.curves, secondIdx);
+			const { intersections, commonSegments, commonSegmentsPoints } = unwrap(intersectCurves(thisCurve, otherCurve, PRECISION_INTERSECTION / 100));
 			allIntersections.push(...intersections);
 			firstCurvePoints[firstIdx]?.push(...intersections);
 			secondCurvePoints[secondIdx]?.push(...intersections);
@@ -404,7 +407,8 @@ function mergeCollinearSegments(curves) {
 function splitPaths(curves) {
 	const startPoints = curves.map((c) => c.firstPoint);
 	const shiftedEndPoints = curves.map((c) => c.lastPoint);
-	const discontinuities = zip([startPoints, shiftedEndPoints.slice(-1).concat(shiftedEndPoints.slice(0, -1))]).map(([startPoint, endPoint], index) => {
+	const endPoints = shiftedEndPoints.slice(-1).concat(shiftedEndPoints.slice(0, -1));
+	const discontinuities = zip([startPoints, endPoints]).map(([startPoint, endPoint], index) => {
 		if (startPoint === void 0 || endPoint === void 0) return null;
 		return samePoint(startPoint, endPoint) ? null : index;
 	}).filter((f) => f !== null);
@@ -787,7 +791,8 @@ var cut2D = (first, second) => {
 		const wrapper = safeIndex(first.blueprints, 0, "cut2D");
 		if (second instanceof Blueprint && !second.intersects(wrapper)) {
 			if (!wrapper.isInside(second.firstPoint)) return first.clone();
-			return organiseBlueprints([wrapper, ...allBlueprints(fuse2D(second, new Blueprints(first.blueprints.slice(1))))]);
+			const cuts = fuse2D(second, new Blueprints(first.blueprints.slice(1)));
+			return organiseBlueprints([wrapper, ...allBlueprints(cuts)]);
 		} else {
 			let out = cut2D(wrapper, second);
 			first.blueprints.slice(1).forEach((bp) => {