brepjs 18.118.7 → 18.118.9

package/dist/2d.cjs

@@ -1,11 +1,11 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const require_shapeTypes = require("./shapeTypes-OqAALhek.cjs");
+const require_shapeTypes = require("./shapeTypes-B8a39SS3.cjs");
 const require_errors = require("./errors-CXJtc4I7.cjs");
-const require_topologyQueryFns = require("./topologyQueryFns-DK-ktEI-.cjs");
-const require_blueprintSketcher = require("./blueprintSketcher-BbT1WvI0.cjs");
-const require_blueprint = require("./blueprint-8aYTu_pt.cjs");
-const require_boolean2D = require("./boolean2D-gvWTFM1D.cjs");
-const require_blueprintFns = require("./blueprintFns-DeFKRkeJ.cjs");
+const require_topologyQueryFns = require("./topologyQueryFns-BJbOwoZm.cjs");
+const require_blueprintSketcher = require("./blueprintSketcher-D5AHgjkT.cjs");
+const require_blueprint = require("./blueprint-qWwhQGSr.cjs");
+const require_boolean2D = require("./boolean2D-Bemx5WZV.cjs");
+const require_blueprintFns = require("./blueprintFns-BhiWnHuR.cjs");
 //#region src/core/curve2dHandle.ts
 /**
 * Wrap a raw kernel 2D curve handle with brand + disposal tracking.

package/dist/2d.js

@@ -1,10 +1,10 @@
-import { W as createKernelHandle, nt as getKernel2D, o as createEdge } from "./shapeTypes-USExUZfW.js";
+import { G as createKernelHandle, rt as getKernel2D, s as createEdge } from "./shapeTypes-D8Fprilr.js";
 import { A as ok, b as err, d as validationError, t as BrepErrorCode } from "./errors-DNWJsfVU.js";
-import { w as kernelCallRaw } from "./topologyQueryFns-Jg9SyAWe.js";
-import { a as Blueprints, i as CompoundBlueprint, r as organiseBlueprints } from "./blueprintSketcher-L_UQ6PjH.js";
-import { _ as Curve2D, t as Blueprint, y as BoundingBox2d } from "./blueprint-Cq4SoX4f.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-Bo8N_bkO.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-BFCNzqOo.js";
+import { w as kernelCallRaw } from "./topologyQueryFns-DfThB5LA.js";
+import { a as Blueprints, i as CompoundBlueprint, r as organiseBlueprints } from "./blueprintSketcher-cgkF6uCj.js";
+import { _ as Curve2D, t as Blueprint, y as BoundingBox2d } from "./blueprint-nrz4fL3I.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-CSZIZMaq.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-BaWyLnF-.js";
 //#region src/core/curve2dHandle.ts
 /**
 * Wrap a raw kernel 2D curve handle with brand + disposal tracking.

package/dist/{adjacencyFns-DGMGVQl7.js → adjacencyFns-CTNUxf0c.js}

@@ -1,5 +1,5 @@
-import { i as castShapeWithKnownType, tt as getKernel } from "./shapeTypes-USExUZfW.js";
-import { l as getOrCreateCache } from "./topologyQueryFns-Jg9SyAWe.js";
+import { a as castShapeWithKnownType, n as castResultShapeWithKnownType, nt as getKernel } from "./shapeTypes-D8Fprilr.js";
+import { c as getFaces, f as getVertices, l as getOrCreateCache, s as getEdges } from "./topologyQueryFns-DfThB5LA.js";
 import { n as HASH_CODE_MAX } from "./constants-ITRzCnCp.js";
 //#region src/topology/adjacencyFns.ts
 /**
@@ -8,6 +8,11 @@ import { n as HASH_CODE_MAX } from "./constants-ITRzCnCp.js";
 * Uses cached topology extraction and an edge→faces adjacency map
 * (built once per parent shape and cached) to avoid redundant WASM calls.
 */
+/**
+* Brand cache-owned raw sub-shapes (from the edge/face adjacency maps) without
+* consuming them. Each cast allocates a fresh downcast the caller disposes; the
+* cached source stays intact — so this must NOT release its input.
+*/
 function wrapAll(shapes, type) {
 	return shapes.map((s) => castShapeWithKnownType(s, type));
 }
@@ -16,7 +21,11 @@ function wrapAll(shapes, type) {
 * hash+isSame, and return branded handles of type `T`.
 *
 * Used by edgesOfFace, wiresOfFace, and verticesOfEdge — all of which need
-* the same deduplicated-children pattern on a raw KernelShape.
+* the same deduplicated-children pattern on a raw KernelShape. Each iterated
+* sub-shape is a fresh arena slot the caller owns: uniques are cast with
+* `castResultShapeWithKnownType` (releasing the orphaned pre-downcast source),
+* and duplicates are released outright — otherwise every call leaks one slot
+* per sub-shape on the occt-wasm arena kernel.
 */
 function deduplicatedSubShapes(parentKernel, type) {
 	const kernel = getKernel();
@@ -26,64 +35,94 @@ function deduplicatedSubShapes(parentKernel, type) {
 	for (const item of items) {
 		const hash = kernel.hashCode(item, HASH_CODE_MAX);
 		const bucket = seen.get(hash);
-		if (!bucket) {
-			seen.set(hash, [item]);
-			results.push(item);
-		} else if (!bucket.some((r) => kernel.isSame(r, item))) {
-			bucket.push(item);
-			results.push(item);
+		if (bucket?.some((r) => kernel.isSame(r, item))) {
+			kernel.dispose(item);
+			continue;
 		}
+		const casted = castResultShapeWithKnownType(item, type);
+		results.push(casted);
+		if (bucket) bucket.push(casted.wrapped);
+		else seen.set(hash, [casted.wrapped]);
+	}
+	return results;
+}
+/** Hash-index branded sub-shapes for isSame lookup by hash code. */
+function indexByHash(items) {
+	const kernel = getKernel();
+	const index = /* @__PURE__ */ new Map();
+	for (const item of items) {
+		const hash = kernel.hashCode(item.wrapped, HASH_CODE_MAX);
+		const bucket = index.get(hash);
+		if (bucket) bucket.push(item);
+		else index.set(hash, [item]);
 	}
-	return wrapAll(results, type);
+	return index;
+}
+/** The managed handle matching a raw sub-shape by hash + isSame, or undefined. */
+function findManaged(index, raw, hash) {
+	const kernel = getKernel();
+	return index.get(hash)?.find((m) => kernel.isSame(m.wrapped, raw));
 }
 /**
 * Build or retrieve the cached edge→faces adjacency map for a parent shape.
 * Maps edge hash codes to edge-face pairs, storing the edge alongside each
 * face so facesOfEdge can verify via isSame without re-extracting face edges.
+*
+* The stored handles are the parent's **managed** `getEdges`/`getFaces` handles
+* (owned by the topology cache), never fresh iterated slots — so the map holds
+* no arena slots of its own. The transient per-face edges used only for
+* matching are released immediately.
 */
 function getEdgeToFacesMap(parent) {
 	const cache = getOrCreateCache(parent);
 	if (cache.edgeToFaces) return cache.edgeToFaces;
 	const kernel = getKernel();
+	const faces = getFaces(parent);
+	const edgeIndex = indexByHash(getEdges(parent));
 	const edgeToFaces = /* @__PURE__ */ new Map();
-	const allFaces = kernel.iterShapes(parent.wrapped, "face");
-	for (const f of allFaces) {
-		const edges = kernel.iterShapes(f, "edge");
-		for (const e of edges) {
-			const hash = kernel.hashCode(e, HASH_CODE_MAX);
-			let bucket = edgeToFaces.get(hash);
-			if (!bucket) {
-				bucket = [];
-				edgeToFaces.set(hash, bucket);
-			}
-			if (!bucket.some((entry) => kernel.isSame(entry.edge, e) && kernel.isSame(entry.face, f))) bucket.push({
-				edge: e,
-				face: f
-			});
+	for (const face of faces) for (const rawEdge of kernel.iterShapes(face.wrapped, "edge")) {
+		const hash = kernel.hashCode(rawEdge, HASH_CODE_MAX);
+		const managedEdge = findManaged(edgeIndex, rawEdge, hash);
+		kernel.dispose(rawEdge);
+		if (!managedEdge) continue;
+		let bucket = edgeToFaces.get(hash);
+		if (!bucket) {
+			bucket = [];
+			edgeToFaces.set(hash, bucket);
 		}
+		if (!bucket.some((entry) => kernel.isSame(entry.edge, managedEdge.wrapped) && kernel.isSame(entry.face, face.wrapped))) bucket.push({
+			edge: managedEdge.wrapped,
+			face: face.wrapped
+		});
 	}
 	cache.edgeToFaces = edgeToFaces;
 	return edgeToFaces;
 }
 /**
 * Build or retrieve the cached vertex→faces adjacency map for a parent shape —
-* the vertex analogue of {@link getEdgeToFacesMap}.
+* the vertex analogue of {@link getEdgeToFacesMap}. Stores the parent's managed
+* `getVertices`/`getFaces` handles and releases the transient per-face vertices.
 */
 function getVertexToFacesMap(parent) {
 	const cache = getOrCreateCache(parent);
 	if (cache.vertexToFaces) return cache.vertexToFaces;
 	const kernel = getKernel();
+	const faces = getFaces(parent);
+	const vertexIndex = indexByHash(getVertices(parent));
 	const vertexToFaces = /* @__PURE__ */ new Map();
-	for (const f of kernel.iterShapes(parent.wrapped, "face")) for (const v of kernel.iterShapes(f, "vertex")) {
-		const hash = kernel.hashCode(v, HASH_CODE_MAX);
+	for (const face of faces) for (const rawVertex of kernel.iterShapes(face.wrapped, "vertex")) {
+		const hash = kernel.hashCode(rawVertex, HASH_CODE_MAX);
+		const managedVertex = findManaged(vertexIndex, rawVertex, hash);
+		kernel.dispose(rawVertex);
+		if (!managedVertex) continue;
 		let bucket = vertexToFaces.get(hash);
 		if (!bucket) {
 			bucket = [];
 			vertexToFaces.set(hash, bucket);
 		}
-		if (!bucket.some((entry) => kernel.isSame(entry.vertex, v) && kernel.isSame(entry.face, f))) bucket.push({
-			vertex: v,
-			face: f
+		if (!bucket.some((entry) => kernel.isSame(entry.vertex, managedVertex.wrapped) && kernel.isSame(entry.face, face.wrapped))) bucket.push({
+			vertex: managedVertex.wrapped,
+			face: face.wrapped
 		});
 	}
 	cache.vertexToFaces = vertexToFaces;
@@ -216,6 +255,7 @@ function adjacentFaces(parent, face) {
 			}
 		}
 	}
+	for (const e of faceEdgeHandles) e[Symbol.dispose]();
 	return wrapAll(neighborRaw, "face");
 }
 /**
@@ -240,8 +280,10 @@ function sharedEdges(face1, face2) {
 		bucket.push(e2);
 	}
 	const shared = [];
-	for (const e1 of edges1) if (edge2Map.get(kernel.hashCode(e1, 2147483647))?.some((e2) => kernel.isSame(e1, e2))) shared.push(e1);
-	return wrapAll(shared, "edge");
+	for (const e1 of edges1) if (edge2Map.get(kernel.hashCode(e1, 2147483647))?.some((e2) => kernel.isSame(e1, e2))) shared.push(castResultShapeWithKnownType(e1, "edge"));
+	else kernel.dispose(e1);
+	for (const e2 of edges2) kernel.dispose(e2);
+	return shared;
 }
 //#endregion
 export { sharedEdges as a, wiresOfFace as c, facesOfVertex as i, edgesOfFace as n, verticesOfEdge as o, facesOfEdge as r, verticesOfFace as s, adjacentFaces as t };

package/dist/{adjacencyFns-BmnrcGXe.cjs → adjacencyFns-Wc3R-UZr.cjs}

@@ -1,5 +1,5 @@
-const require_shapeTypes = require("./shapeTypes-OqAALhek.cjs");
-const require_topologyQueryFns = require("./topologyQueryFns-DK-ktEI-.cjs");
+const require_shapeTypes = require("./shapeTypes-B8a39SS3.cjs");
+const require_topologyQueryFns = require("./topologyQueryFns-BJbOwoZm.cjs");
 const require_constants = require("./constants-BOVyEYGH.cjs");
 //#region src/topology/adjacencyFns.ts
 /**
@@ -8,6 +8,11 @@ const require_constants = require("./constants-BOVyEYGH.cjs");
 * Uses cached topology extraction and an edge→faces adjacency map
 * (built once per parent shape and cached) to avoid redundant WASM calls.
 */
+/**
+* Brand cache-owned raw sub-shapes (from the edge/face adjacency maps) without
+* consuming them. Each cast allocates a fresh downcast the caller disposes; the
+* cached source stays intact — so this must NOT release its input.
+*/
 function wrapAll(shapes, type) {
 	return shapes.map((s) => require_shapeTypes.castShapeWithKnownType(s, type));
 }
@@ -16,7 +21,11 @@ function wrapAll(shapes, type) {
 * hash+isSame, and return branded handles of type `T`.
 *
 * Used by edgesOfFace, wiresOfFace, and verticesOfEdge — all of which need
-* the same deduplicated-children pattern on a raw KernelShape.
+* the same deduplicated-children pattern on a raw KernelShape. Each iterated
+* sub-shape is a fresh arena slot the caller owns: uniques are cast with
+* `castResultShapeWithKnownType` (releasing the orphaned pre-downcast source),
+* and duplicates are released outright — otherwise every call leaks one slot
+* per sub-shape on the occt-wasm arena kernel.
 */
 function deduplicatedSubShapes(parentKernel, type) {
 	const kernel = require_shapeTypes.getKernel();
@@ -26,64 +35,94 @@ function deduplicatedSubShapes(parentKernel, type) {
 	for (const item of items) {
 		const hash = kernel.hashCode(item, require_constants.HASH_CODE_MAX);
 		const bucket = seen.get(hash);
-		if (!bucket) {
-			seen.set(hash, [item]);
-			results.push(item);
-		} else if (!bucket.some((r) => kernel.isSame(r, item))) {
-			bucket.push(item);
-			results.push(item);
+		if (bucket?.some((r) => kernel.isSame(r, item))) {
+			kernel.dispose(item);
+			continue;
 		}
+		const casted = require_shapeTypes.castResultShapeWithKnownType(item, type);
+		results.push(casted);
+		if (bucket) bucket.push(casted.wrapped);
+		else seen.set(hash, [casted.wrapped]);
+	}
+	return results;
+}
+/** Hash-index branded sub-shapes for isSame lookup by hash code. */
+function indexByHash(items) {
+	const kernel = require_shapeTypes.getKernel();
+	const index = /* @__PURE__ */ new Map();
+	for (const item of items) {
+		const hash = kernel.hashCode(item.wrapped, require_constants.HASH_CODE_MAX);
+		const bucket = index.get(hash);
+		if (bucket) bucket.push(item);
+		else index.set(hash, [item]);
 	}
-	return wrapAll(results, type);
+	return index;
+}
+/** The managed handle matching a raw sub-shape by hash + isSame, or undefined. */
+function findManaged(index, raw, hash) {
+	const kernel = require_shapeTypes.getKernel();
+	return index.get(hash)?.find((m) => kernel.isSame(m.wrapped, raw));
 }
 /**
 * Build or retrieve the cached edge→faces adjacency map for a parent shape.
 * Maps edge hash codes to edge-face pairs, storing the edge alongside each
 * face so facesOfEdge can verify via isSame without re-extracting face edges.
+*
+* The stored handles are the parent's **managed** `getEdges`/`getFaces` handles
+* (owned by the topology cache), never fresh iterated slots — so the map holds
+* no arena slots of its own. The transient per-face edges used only for
+* matching are released immediately.
 */
 function getEdgeToFacesMap(parent) {
 	const cache = require_topologyQueryFns.getOrCreateCache(parent);
 	if (cache.edgeToFaces) return cache.edgeToFaces;
 	const kernel = require_shapeTypes.getKernel();
+	const faces = require_topologyQueryFns.getFaces(parent);
+	const edgeIndex = indexByHash(require_topologyQueryFns.getEdges(parent));
 	const edgeToFaces = /* @__PURE__ */ new Map();
-	const allFaces = kernel.iterShapes(parent.wrapped, "face");
-	for (const f of allFaces) {
-		const edges = kernel.iterShapes(f, "edge");
-		for (const e of edges) {
-			const hash = kernel.hashCode(e, require_constants.HASH_CODE_MAX);
-			let bucket = edgeToFaces.get(hash);
-			if (!bucket) {
-				bucket = [];
-				edgeToFaces.set(hash, bucket);
-			}
-			if (!bucket.some((entry) => kernel.isSame(entry.edge, e) && kernel.isSame(entry.face, f))) bucket.push({
-				edge: e,
-				face: f
-			});
+	for (const face of faces) for (const rawEdge of kernel.iterShapes(face.wrapped, "edge")) {
+		const hash = kernel.hashCode(rawEdge, require_constants.HASH_CODE_MAX);
+		const managedEdge = findManaged(edgeIndex, rawEdge, hash);
+		kernel.dispose(rawEdge);
+		if (!managedEdge) continue;
+		let bucket = edgeToFaces.get(hash);
+		if (!bucket) {
+			bucket = [];
+			edgeToFaces.set(hash, bucket);
 		}
+		if (!bucket.some((entry) => kernel.isSame(entry.edge, managedEdge.wrapped) && kernel.isSame(entry.face, face.wrapped))) bucket.push({
+			edge: managedEdge.wrapped,
+			face: face.wrapped
+		});
 	}
 	cache.edgeToFaces = edgeToFaces;
 	return edgeToFaces;
 }
 /**
 * Build or retrieve the cached vertex→faces adjacency map for a parent shape —
-* the vertex analogue of {@link getEdgeToFacesMap}.
+* the vertex analogue of {@link getEdgeToFacesMap}. Stores the parent's managed
+* `getVertices`/`getFaces` handles and releases the transient per-face vertices.
 */
 function getVertexToFacesMap(parent) {
 	const cache = require_topologyQueryFns.getOrCreateCache(parent);
 	if (cache.vertexToFaces) return cache.vertexToFaces;
 	const kernel = require_shapeTypes.getKernel();
+	const faces = require_topologyQueryFns.getFaces(parent);
+	const vertexIndex = indexByHash(require_topologyQueryFns.getVertices(parent));
 	const vertexToFaces = /* @__PURE__ */ new Map();
-	for (const f of kernel.iterShapes(parent.wrapped, "face")) for (const v of kernel.iterShapes(f, "vertex")) {
-		const hash = kernel.hashCode(v, require_constants.HASH_CODE_MAX);
+	for (const face of faces) for (const rawVertex of kernel.iterShapes(face.wrapped, "vertex")) {
+		const hash = kernel.hashCode(rawVertex, require_constants.HASH_CODE_MAX);
+		const managedVertex = findManaged(vertexIndex, rawVertex, hash);
+		kernel.dispose(rawVertex);
+		if (!managedVertex) continue;
 		let bucket = vertexToFaces.get(hash);
 		if (!bucket) {
 			bucket = [];
 			vertexToFaces.set(hash, bucket);
 		}
-		if (!bucket.some((entry) => kernel.isSame(entry.vertex, v) && kernel.isSame(entry.face, f))) bucket.push({
-			vertex: v,
-			face: f
+		if (!bucket.some((entry) => kernel.isSame(entry.vertex, managedVertex.wrapped) && kernel.isSame(entry.face, face.wrapped))) bucket.push({
+			vertex: managedVertex.wrapped,
+			face: face.wrapped
 		});
 	}
 	cache.vertexToFaces = vertexToFaces;
@@ -216,6 +255,7 @@ function adjacentFaces(parent, face) {
 			}
 		}
 	}
+	for (const e of faceEdgeHandles) e[Symbol.dispose]();
 	return wrapAll(neighborRaw, "face");
 }
 /**
@@ -240,8 +280,10 @@ function sharedEdges(face1, face2) {
 		bucket.push(e2);
 	}
 	const shared = [];
-	for (const e1 of edges1) if (edge2Map.get(kernel.hashCode(e1, 2147483647))?.some((e2) => kernel.isSame(e1, e2))) shared.push(e1);
-	return wrapAll(shared, "edge");
+	for (const e1 of edges1) if (edge2Map.get(kernel.hashCode(e1, 2147483647))?.some((e2) => kernel.isSame(e1, e2))) shared.push(require_shapeTypes.castResultShapeWithKnownType(e1, "edge"));
+	else kernel.dispose(e1);
+	for (const e2 of edges2) kernel.dispose(e2);
+	return shared;
 }
 //#endregion
 Object.defineProperty(exports, "adjacentFaces", {

package/dist/{blueprint-Cq4SoX4f.js → blueprint-nrz4fL3I.js}

@@ -1,14 +1,14 @@
-import { Y as unregisterFromCleanup, d as createWire, nt as getKernel2D, o as createEdge, q as registerForCleanup, tt as getKernel } from "./shapeTypes-USExUZfW.js";
+import { J as registerForCleanup, X as unregisterFromCleanup, f as createWire, nt as getKernel, rt as getKernel2D, s as createEdge } from "./shapeTypes-D8Fprilr.js";
 import { n as wasmIndex } from "./vec3-Dpha8d5k.js";
 import { A as ok, R as unwrap, b as err, d as validationError, h as bug, n as computationError } from "./errors-DNWJsfVU.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-DSjjtrjg.js";
-import { _ as cast, h as uvCoordinates, i as faceGeomType, m as uvBounds, r as faceCenter } from "./faceFns-CnCX9BM_.js";
-import { p as getOrientation } from "./curveFns-QU4XEJMN.js";
+import { _ as cast, h as uvCoordinates, i as faceGeomType, m as uvBounds, r as faceCenter } from "./faceFns-Bm3-D75M.js";
+import { p as getOrientation } from "./curveFns-Y1TTdL_y.js";
 import { n as getAtOrThrow, r as lastOrThrow, t as firstOrThrow } from "./arrayAccess-DrUGPADn.js";
-import { r as makeFace } from "./surfaceBuilders-BPTkEKy4.js";
-import { _ as samePoint, b as subtract2d, l as add2d, o as normalize2d, p as distance2d, t as getSingleFace, v as scalarMultiply2d } from "./helpers-nTMuqwBX.js";
+import { r as makeFace } from "./surfaceBuilders-B15_8txg.js";
+import { _ as samePoint, b as subtract2d, l as add2d, o as normalize2d, p as distance2d, t as getSingleFace, v as scalarMultiply2d } from "./helpers-DzOME9UE.js";
 //#region src/2d/lib/definitions.ts
 /** Type guard that checks whether a value is a `Point2D`. */
 function isPoint2D(point) {

package/dist/{blueprint-8aYTu_pt.cjs → blueprint-qWwhQGSr.cjs}

@@ -1,14 +1,14 @@
-const require_shapeTypes = require("./shapeTypes-OqAALhek.cjs");
+const require_shapeTypes = require("./shapeTypes-B8a39SS3.cjs");
 const require_vec3 = require("./vec3-CFwOI0ZI.cjs");
 const require_errors = require("./errors-CXJtc4I7.cjs");
 const require_constants = require("./constants-BOVyEYGH.cjs");
 const require_types = require("./types-KjA8tY4Y.cjs");
 const require_planeOps = require("./planeOps-BA4HfgQu.cjs");
-const require_faceFns = require("./faceFns-DlUhG1i5.cjs");
-const require_curveFns = require("./curveFns-Bbq8YwiP.cjs");
+const require_faceFns = require("./faceFns-BhBJ_Hsb.cjs");
+const require_curveFns = require("./curveFns-Bb3wuFj4.cjs");
 const require_arrayAccess = require("./arrayAccess-e4H9cBfh.cjs");
-const require_surfaceBuilders = require("./surfaceBuilders-_pFeqIF8.cjs");
-const require_helpers = require("./helpers-CXHMPCPr.cjs");
+const require_surfaceBuilders = require("./surfaceBuilders-DUG4Y0qA.cjs");
+const require_helpers = require("./helpers-DKfkqED3.cjs");
 //#region src/2d/lib/definitions.ts
 /** Type guard that checks whether a value is a `Point2D`. */
 function isPoint2D(point) {

package/dist/{blueprintFns-BFCNzqOo.js → blueprintFns-BaWyLnF-.js}

@@ -1,6 +1,6 @@
 import { A as ok, b as err, d as validationError, t as BrepErrorCode } from "./errors-DNWJsfVU.js";
-import { i as CompoundBlueprint } from "./blueprintSketcher-L_UQ6PjH.js";
-import { t as Blueprint } from "./blueprint-Cq4SoX4f.js";
+import { i as CompoundBlueprint } from "./blueprintSketcher-cgkF6uCj.js";
+import { t as Blueprint } from "./blueprint-nrz4fL3I.js";
 //#region src/2d/lib/curve2dFns.ts
 /**
 * Return a reversed copy of the curve (non-mutating).

package/dist/{blueprintFns-DeFKRkeJ.cjs → blueprintFns-BhiWnHuR.cjs}

@@ -1,6 +1,6 @@
 const require_errors = require("./errors-CXJtc4I7.cjs");
-const require_blueprintSketcher = require("./blueprintSketcher-BbT1WvI0.cjs");
-const require_blueprint = require("./blueprint-8aYTu_pt.cjs");
+const require_blueprintSketcher = require("./blueprintSketcher-D5AHgjkT.cjs");
+const require_blueprint = require("./blueprint-qWwhQGSr.cjs");
 //#region src/2d/lib/curve2dFns.ts
 /**
 * Return a reversed copy of the curve (non-mutating).

package/dist/{blueprintSketcher-BbT1WvI0.cjs → blueprintSketcher-D5AHgjkT.cjs}

@@ -1,10 +1,10 @@
-const require_shapeTypes = require("./shapeTypes-OqAALhek.cjs");
+const require_shapeTypes = require("./shapeTypes-B8a39SS3.cjs");
 const require_vec3 = require("./vec3-CFwOI0ZI.cjs");
 const require_errors = require("./errors-CXJtc4I7.cjs");
 const require_constants = require("./constants-BOVyEYGH.cjs");
 const require_arrayAccess = require("./arrayAccess-e4H9cBfh.cjs");
-const require_helpers = require("./helpers-CXHMPCPr.cjs");
-const require_blueprint = require("./blueprint-8aYTu_pt.cjs");
+const require_helpers = require("./helpers-DKfkqED3.cjs");
+const require_blueprint = require("./blueprint-qWwhQGSr.cjs");
 //#region node_modules/flatqueue/index.js
 /**
 * @typedef {Float64ArrayConstructor | Float32ArrayConstructor |

package/dist/{blueprintSketcher-L_UQ6PjH.js → blueprintSketcher-cgkF6uCj.js}

@@ -1,10 +1,10 @@
-import { nt as getKernel2D, tt as getKernel } from "./shapeTypes-USExUZfW.js";
+import { nt as getKernel, rt as getKernel2D } from "./shapeTypes-D8Fprilr.js";
 import { n as wasmIndex } from "./vec3-Dpha8d5k.js";
 import { A as ok, R as unwrap, T as isOk, b as err, h as bug, n as computationError, s as safeIndex } from "./errors-DNWJsfVU.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, d as cartesianToPolar, f as crossProduct2d, g as rotate2d, h as polarToCartesian, l as add2d, m as polarAngle2d, o as normalize2d, p as distance2d, v as scalarMultiply2d } from "./helpers-nTMuqwBX.js";
-import { _ as Curve2D, 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, x as isPoint2D, y as BoundingBox2d } from "./blueprint-Cq4SoX4f.js";
+import { _ as samePoint, b as subtract2d, d as cartesianToPolar, f as crossProduct2d, g as rotate2d, h as polarToCartesian, l as add2d, m as polarAngle2d, o as normalize2d, p as distance2d, v as scalarMultiply2d } from "./helpers-DzOME9UE.js";
+import { _ as Curve2D, 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, x as isPoint2D, y as BoundingBox2d } from "./blueprint-nrz4fL3I.js";
 //#region node_modules/flatqueue/index.js
 /**
 * @typedef {Float64ArrayConstructor | Float32ArrayConstructor |

package/dist/{boolean2D-gvWTFM1D.cjs → boolean2D-Bemx5WZV.cjs}

@@ -1,10 +1,10 @@
 const require_vec3 = require("./vec3-CFwOI0ZI.cjs");
 const require_errors = require("./errors-CXJtc4I7.cjs");
 const require_arrayAccess = require("./arrayAccess-e4H9cBfh.cjs");
-const require_surfaceBuilders = require("./surfaceBuilders-_pFeqIF8.cjs");
-const require_blueprintSketcher = require("./blueprintSketcher-BbT1WvI0.cjs");
-const require_helpers = require("./helpers-CXHMPCPr.cjs");
-const require_blueprint = require("./blueprint-8aYTu_pt.cjs");
+const require_surfaceBuilders = require("./surfaceBuilders-DUG4Y0qA.cjs");
+const require_blueprintSketcher = require("./blueprintSketcher-D5AHgjkT.cjs");
+const require_helpers = require("./helpers-DKfkqED3.cjs");
+const require_blueprint = require("./blueprint-qWwhQGSr.cjs");
 //#region src/2d/blueprints/cannedBlueprints.ts
 /**
 * Create a regular polygon blueprint inscribed in a circle of the given radius.

package/dist/{boolean2D-Bo8N_bkO.js → boolean2D-CSZIZMaq.js}

@@ -1,10 +1,10 @@
 import { n as wasmIndex } from "./vec3-Dpha8d5k.js";
 import { R as unwrap, h as bug, s as safeIndex } from "./errors-DNWJsfVU.js";
 import { r as lastOrThrow } from "./arrayAccess-DrUGPADn.js";
-import { v as zip } from "./surfaceBuilders-BPTkEKy4.js";
-import { a as Blueprints, i as CompoundBlueprint, l as intersectCurves, r as organiseBlueprints, t as BlueprintSketcher, u as Flatbush } from "./blueprintSketcher-L_UQ6PjH.js";
-import { _ as samePoint$1, b as subtract2d, f as crossProduct2d, s as PRECISION_INTERSECTION } from "./helpers-nTMuqwBX.js";
-import { b as removeDuplicatePoints, f as make2dSegmentCurve, t as Blueprint } from "./blueprint-Cq4SoX4f.js";
+import { v as zip } from "./surfaceBuilders-B15_8txg.js";
+import { a as Blueprints, i as CompoundBlueprint, l as intersectCurves, r as organiseBlueprints, t as BlueprintSketcher, u as Flatbush } from "./blueprintSketcher-cgkF6uCj.js";
+import { _ as samePoint$1, b as subtract2d, f as crossProduct2d, s as PRECISION_INTERSECTION } from "./helpers-DzOME9UE.js";
+import { b as removeDuplicatePoints, f as make2dSegmentCurve, t as Blueprint } from "./blueprint-nrz4fL3I.js";
 //#region src/2d/blueprints/cannedBlueprints.ts
 /**
 * Create a regular polygon blueprint inscribed in a circle of the given radius.

package/dist/brepjs.cjs

@@ -1,38 +1,38 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const require_textBlueprints = require("./textBlueprints-BKi0ghsT.cjs");
-const require_shapeTypes = require("./shapeTypes-OqAALhek.cjs");
+const require_textBlueprints = require("./textBlueprints-BXtV_DY6.cjs");
+const require_shapeTypes = require("./shapeTypes-B8a39SS3.cjs");
 const require_occtWasmAdapter = require("./occtWasmAdapter-8wX1Z2-I.cjs");
 const require_vec3 = require("./vec3-CFwOI0ZI.cjs");
 const require_errors = require("./errors-CXJtc4I7.cjs");
-const require_topologyQueryFns = require("./topologyQueryFns-DK-ktEI-.cjs");
+const require_topologyQueryFns = require("./topologyQueryFns-BJbOwoZm.cjs");
 const require_constants = require("./constants-BOVyEYGH.cjs");
 const require_types = require("./types-KjA8tY4Y.cjs");
 const require_vecOps = require("./vecOps-CCnJt-yH.cjs");
 const require_planeOps = require("./planeOps-BA4HfgQu.cjs");
-const require_faceFns = require("./faceFns-DlUhG1i5.cjs");
-const require_shapeFns = require("./shapeFns-7T0gykWr.cjs");
-const require_curveFns = require("./curveFns-Bbq8YwiP.cjs");
-const require_meshFns = require("./meshFns-tNFtjrAg.cjs");
+const require_faceFns = require("./faceFns-BhBJ_Hsb.cjs");
+const require_shapeFns = require("./shapeFns-1aqO2bz4.cjs");
+const require_curveFns = require("./curveFns-Bb3wuFj4.cjs");
+const require_meshFns = require("./meshFns-s-c0lABa.cjs");
 const require_arrayAccess = require("./arrayAccess-e4H9cBfh.cjs");
-const require_surfaceBuilders = require("./surfaceBuilders-_pFeqIF8.cjs");
-const require_solidBuilders = require("./solidBuilders-oBXWp32X.cjs");
-const require_healingFns = require("./healingFns-DS2jVC-6.cjs");
-const require_threadFns = require("./threadFns-CILCsLs1.cjs");
-const require_blueprintSketcher = require("./blueprintSketcher-BbT1WvI0.cjs");
-const require_helpers = require("./helpers-CXHMPCPr.cjs");
-const require_drawFns = require("./drawFns-BaoKhtS2.cjs");
-const require_measureFns = require("./measureFns-BXpXVoE1.cjs");
-const require_cornerFinder = require("./cornerFinder-Dg00ADRE.cjs");
-const require_boolean2D = require("./boolean2D-gvWTFM1D.cjs");
-const require_blueprintFns = require("./blueprintFns-DeFKRkeJ.cjs");
-const require_importFns = require("./importFns-Rtl8_piv.cjs");
-const require_loftFns = require("./loftFns-CYHPZMOq.cjs");
-const require_cameraFns = require("./cameraFns-BgMZW_YF.cjs");
-const require_textMetrics = require("./textMetrics-66K6zyvX.cjs");
-const require_adjacencyFns = require("./adjacencyFns-BmnrcGXe.cjs");
-const require_refResolveFns = require("./refResolveFns-BdEmu7yh.cjs");
+const require_surfaceBuilders = require("./surfaceBuilders-DUG4Y0qA.cjs");
+const require_solidBuilders = require("./solidBuilders-CkkgC2se.cjs");
+const require_healingFns = require("./healingFns-DoJQUwBN.cjs");
+const require_threadFns = require("./threadFns-CWIlyEcP.cjs");
+const require_blueprintSketcher = require("./blueprintSketcher-D5AHgjkT.cjs");
+const require_helpers = require("./helpers-DKfkqED3.cjs");
+const require_drawFns = require("./drawFns-Bgug3W7c.cjs");
+const require_measureFns = require("./measureFns-DJ1SESSY.cjs");
+const require_cornerFinder = require("./cornerFinder-BDwDNTdN.cjs");
+const require_boolean2D = require("./boolean2D-Bemx5WZV.cjs");
+const require_blueprintFns = require("./blueprintFns-BhiWnHuR.cjs");
+const require_importFns = require("./importFns-D8i8O8di.cjs");
+const require_loftFns = require("./loftFns-BJiGxTys.cjs");
+const require_cameraFns = require("./cameraFns-taUY1CFZ.cjs");
+const require_textMetrics = require("./textMetrics-DBdtpVNo.cjs");
+const require_adjacencyFns = require("./adjacencyFns-Wc3R-UZr.cjs");
+const require_refResolveFns = require("./refResolveFns-AbuzUhGC.cjs");
 const require_workerPool = require("./workerPool-D30NsiIW.cjs");
-const require_primitiveFns = require("./primitiveFns-CTCpyACp.cjs");
+const require_primitiveFns = require("./primitiveFns-BDdThy3-.cjs");
 //#region src/topology/shapeBooleans.ts
 var BOPAlgo_GlueShift = 1;
 var BOPAlgo_GlueFull = 2;