brepjs 18.118.8 → 18.118.9

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

@@ -1,5 +1,5 @@
-import { a as castShapeWithKnownType, nt as getKernel } from "./shapeTypes-D8Fprilr.js";
-import { l as getOrCreateCache } from "./topologyQueryFns-DfThB5LA.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-Crb9tLJd.cjs → adjacencyFns-Wc3R-UZr.cjs}

@@ -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/brepjs.cjs

@@ -17,7 +17,7 @@ const require_arrayAccess = require("./arrayAccess-e4H9cBfh.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-C_BapeNn.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");
@@ -29,8 +29,8 @@ 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-Crb9tLJd.cjs");
-const require_refResolveFns = require("./refResolveFns-CT1YEP-7.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-BDdThy3-.cjs");
 //#region src/topology/shapeBooleans.ts

package/dist/brepjs.js

@@ -15,7 +15,7 @@ import { n as getAtOrThrow, r as lastOrThrow, t as firstOrThrow } from "./arrayA
 import { _ as makeThreePointArc, d as makeCircle, h as makeLine, l as makeBSplineInterpolation, n as fill, r as makeFace, s as assembleWire } from "./surfaceBuilders-B15_8txg.js";
 import { _ as section$1, b as split$1, d as booleanPipeline, f as cut$2, g as intersect$2, h as fuseAll$2, m as fuse$2, p as cutAll$2, r as makeCylinder, t as makeCompound, v as sectionToFace$1, y as slice$1 } from "./solidBuilders-B_N5miaY.js";
 import { A as toBufferGeometryData, C as shellWithEvolution, D as getNurbsCurveData, E as fuseAllBisect, M as toLODGeometryData, N as toLODGeometryLevels, O as getNurbsSurfaceData, P as toLineGeometryData, S as intersectWithEvolution, T as cutAllBisect, _ as positionOnCurve, a as healFace, b as filletWithEvolution, c as isValid$1, d as draft$1, f as fillet$1, g as variableFillet, h as thicken$1, i as heal$1, j as toGroupedBufferGeometryData, k as chamferDistAngle, l as solidFromShell, m as shell$1, n as fixSelfIntersection, o as healSolid, p as offset$1, r as fixShape, s as healWire, t as autoHeal, u as chamfer$1, v as chamferWithEvolution, w as checkBoolean, x as fuseWithEvolution, y as cutWithEvolution } from "./healingFns-g8JymEUi.js";
-import { A as setJointValue, B as createAssemblyNode, C as cylindricalJoint, D as planarJoint, E as mechanismDOF, F as quatMultiply, G as circularPattern, H as removeChild, I as quatRotate, J as exportAssemblySTEP, K as gridPattern, L as addChild, M as sphericalJoint, N as quatFromAxisAngle, O as prismaticJoint, P as quatFromTo, R as collectShapes, S as addJoint, T as jointTransform, U as updateNode, V as findNode, W as walkAssembly, Y as createAssembly, _ as exportURDF, a as deserializeHistory, 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, p as serializeHistory, q as linearPattern, 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 countNodes } from "./threadFns-BM-VHcSJ.js";
+import { A as setJointValue, B as createAssemblyNode, C as cylindricalJoint, D as planarJoint, E as mechanismDOF, F as quatMultiply, G as circularPattern, H as removeChild, I as quatRotate, J as exportAssemblySTEP, K as gridPattern, L as addChild, M as sphericalJoint, N as quatFromAxisAngle, O as prismaticJoint, P as quatFromTo, R as collectShapes, S as addJoint, T as jointTransform, U as updateNode, V as findNode, W as walkAssembly, Y as createAssembly, _ as exportURDF, a as deserializeHistory, 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, p as serializeHistory, q as linearPattern, 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 countNodes } from "./threadFns-CMdXdlIH.js";
 import { n as BaseSketcher2d, r as organiseBlueprints, t as BlueprintSketcher } from "./blueprintSketcher-cgkF6uCj.js";
 import { a as createTypedFinder, i as wireFinder, n as edgeFinder, r as faceFinder, t as getSingleFace } from "./helpers-DzOME9UE.js";
 import { A as sketchEllipse, D as makeBaseBox, E as deserializeDrawing, F as sketchRectangle, I as sketchRoundedRectangle, L as FaceSketcher, M as sketchHelix, N as sketchParametricFunction, O as polysideInnerRadius, P as sketchPolysides, R as Sketcher, S as drawText, _ as drawPolysides, a as drawingIntersect, b as drawSingleCircle, c as rotateDrawing, d as drawFaceOutline, f as drawProjection, g as drawPointsInterpolation, h as drawParametricFunction, i as drawingFuse, j as sketchFaceOffset, k as sketchCircle, l as scaleDrawing, m as drawEllipse, n as drawingCut, o as drawingToSketchOnPlane, p as drawCircle, r as drawingFillet, s as mirrorDrawing, t as drawingChamfer, u as translateDrawing, v as drawRectangle, w as draw, x as drawSingleEllipse, y as drawRoundedRectangle } from "./drawFns-BksvLjN1.js";
@@ -28,8 +28,8 @@ import { a as revolve$1, c as multiSectionSweep, d as twistExtrude, i as extrude
 import { a as Sketch, c as compoundSketchLoft, d as sketchFace, f as sketchLoft, h as sketchWires, i as Sketches, l as compoundSketchRevolve, m as sketchSweep, n as getFont, o as compoundSketchExtrude, p as sketchRevolve, r as loadFont, s as compoundSketchFace, t as textBlueprints, u as sketchExtrude, v as CompoundSketch } from "./textBlueprints-BYz-7-MZ.js";
 import { a as makeProjectedEdges, i as projectEdges, n as cameraLookAt, r as createCamera, s as isProjectionPlane, t as cameraFromPlane } from "./cameraFns-xD28Tsqu.js";
 import { n as textMetrics, r as sketchText, t as fontMetrics } from "./textMetrics-yyHcpdUd.js";
-import { a as sharedEdges, c as wiresOfFace, i as facesOfVertex, n as edgesOfFace, o as verticesOfEdge, r as facesOfEdge, s as verticesOfFace, t as adjacentFaces } from "./adjacencyFns-BcEHCYK3.js";
-import { _ as createRef, a as isVertexRef, b as defaultScorer, c as resolveRefParams, d as createVertexRef, f as resolveVertexRef, g as captureHint, h as assignRoles, i as isLineageRef, l as createDerivedFaceRef, m as resolveEdgeRef, n as isEdgeRef, o as resolveLineageRef, p as createEdgeRef, r as isFaceRef, s as resolveRefIn, t as isDerivedFaceRef, u as resolveDerivedFaceRef, v as resolveRef, y as updateRoles } from "./refResolveFns-xqQ8Z8vC.js";
+import { a as sharedEdges, c as wiresOfFace, i as facesOfVertex, n as edgesOfFace, o as verticesOfEdge, r as facesOfEdge, s as verticesOfFace, t as adjacentFaces } from "./adjacencyFns-CTNUxf0c.js";
+import { _ as createRef, a as isVertexRef, b as defaultScorer, c as resolveRefParams, d as createVertexRef, f as resolveVertexRef, g as captureHint, h as assignRoles, i as isLineageRef, l as createDerivedFaceRef, m as resolveEdgeRef, n as isEdgeRef, o as resolveLineageRef, p as createEdgeRef, r as isFaceRef, s as resolveRefIn, t as isDerivedFaceRef, u as resolveDerivedFaceRef, v as resolveRef, y as updateRoles } from "./refResolveFns-BNzUtX4y.js";
 import { _ as isSuccessResponse, a as createWorkerClient, c as enqueueTask, d as rejectAll, f as isBatchRequest, g as isOperationRequest, h as isInitRequest, i as registerHandler, l as isEmpty$1, m as isErrorResponse, n as createOperationRegistry, o as createTaskQueue, p as isDisposeRequest, r as createWorkerHandler, s as dequeueTask, t as createWorkerPool, u as pendingCount } from "./workerPool-XcYX2UZ0.js";
 import { C as threePointArc, D as wireLoop, E as wire, S as tangentArc, T as vertex, _ as polygon, a as circle, b as sphere$1, c as cylinder, d as ellipsoid, f as face, g as offsetFace, h as line, i as bsplineApprox, l as ellipse, m as helix, n as bezier, o as compound, p as filledFace, r as box, s as cone, t as addHoles, u as ellipseArc, v as sewShells, w as torus$1, x as subFace, y as solid } from "./primitiveFns-D-hFA6e9.js";
 //#region \0rolldown/runtime.js

package/dist/operations.cjs

@@ -1,5 +1,5 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const require_threadFns = require("./threadFns-C_BapeNn.cjs");
+const require_threadFns = require("./threadFns-CWIlyEcP.cjs");
 const require_loftFns = require("./loftFns-BJiGxTys.cjs");
 exports.addChild = require_threadFns.addChild;
 exports.addJoint = require_threadFns.addJoint;

package/dist/operations.js

@@ -1,3 +1,3 @@
-import { A as setJointValue, B as createAssemblyNode, C as cylindricalJoint, D as planarJoint, E as mechanismDOF, G as circularPattern, H as removeChild, J as exportAssemblySTEP, K as gridPattern, L as addChild, M as sphericalJoint, O as prismaticJoint, R as collectShapes, S as addJoint, T as jointTransform, U as updateNode, V as findNode, W as walkAssembly, 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, q as linearPattern, 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 countNodes } from "./threadFns-BM-VHcSJ.js";
+import { A as setJointValue, B as createAssemblyNode, C as cylindricalJoint, D as planarJoint, E as mechanismDOF, G as circularPattern, H as removeChild, J as exportAssemblySTEP, K as gridPattern, L as addChild, M as sphericalJoint, O as prismaticJoint, R as collectShapes, S as addJoint, T as jointTransform, U as updateNode, V as findNode, W as walkAssembly, 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, q as linearPattern, 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 countNodes } from "./threadFns-CMdXdlIH.js";
 import { d as twistExtrude, l as supportExtrude, o as complexExtrude, u as sweep } from "./loftFns-CK4PP1IR.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/{refResolveFns-CT1YEP-7.cjs → refResolveFns-AbuzUhGC.cjs}

@@ -3,7 +3,7 @@ const require_topologyQueryFns = require("./topologyQueryFns-BJbOwoZm.cjs");
 const require_faceFns = require("./faceFns-BhBJ_Hsb.cjs");
 const require_shapeFns = require("./shapeFns-1aqO2bz4.cjs");
 const require_measureFns = require("./measureFns-DJ1SESSY.cjs");
-const require_adjacencyFns = require("./adjacencyFns-Crb9tLJd.cjs");
+const require_adjacencyFns = require("./adjacencyFns-Wc3R-UZr.cjs");
 //#region src/topology/shapeRef/scoring.ts
 /**
 * Default face scorer combining surface type, normal alignment, centroid proximity,

package/dist/{refResolveFns-xqQ8Z8vC.js → refResolveFns-BNzUtX4y.js}

@@ -3,7 +3,7 @@ import { S as vertexPosition, c as getFaces } from "./topologyQueryFns-DfThB5LA.
 import { i as faceGeomType, l as normalAt, r as faceCenter } from "./faceFns-Bm3-D75M.js";
 import { n as getHashCode } from "./shapeFns-Dqlpy8wm.js";
 import { n as measureArea, s as measureLength } from "./measureFns-1akKMnXO.js";
-import { a as sharedEdges, i as facesOfVertex, o as verticesOfEdge, r as facesOfEdge, s as verticesOfFace, t as adjacentFaces } from "./adjacencyFns-BcEHCYK3.js";
+import { a as sharedEdges, i as facesOfVertex, o as verticesOfEdge, r as facesOfEdge, s as verticesOfFace, t as adjacentFaces } from "./adjacencyFns-CTNUxf0c.js";
 //#region src/topology/shapeRef/scoring.ts
 /**
 * Default face scorer combining surface type, normal alignment, centroid proximity,

package/dist/shapeRef.cjs

@@ -1,5 +1,5 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const require_refResolveFns = require("./refResolveFns-CT1YEP-7.cjs");
+const require_refResolveFns = require("./refResolveFns-AbuzUhGC.cjs");
 exports.assignRoles = require_refResolveFns.assignRoles;
 exports.captureHint = require_refResolveFns.captureHint;
 exports.createDerivedFaceRef = require_refResolveFns.createDerivedFaceRef;

package/dist/shapeRef.js

@@ -1,2 +1,2 @@
-import { _ as createRef, a as isVertexRef, b as defaultScorer, c as resolveRefParams, d as createVertexRef, f as resolveVertexRef, g as captureHint, h as assignRoles, i as isLineageRef, l as createDerivedFaceRef, m as resolveEdgeRef, n as isEdgeRef, o as resolveLineageRef, p as createEdgeRef, r as isFaceRef, s as resolveRefIn, t as isDerivedFaceRef, u as resolveDerivedFaceRef, v as resolveRef, y as updateRoles } from "./refResolveFns-xqQ8Z8vC.js";
+import { _ as createRef, a as isVertexRef, b as defaultScorer, c as resolveRefParams, d as createVertexRef, f as resolveVertexRef, g as captureHint, h as assignRoles, i as isLineageRef, l as createDerivedFaceRef, m as resolveEdgeRef, n as isEdgeRef, o as resolveLineageRef, p as createEdgeRef, r as isFaceRef, s as resolveRefIn, t as isDerivedFaceRef, u as resolveDerivedFaceRef, v as resolveRef, y as updateRoles } from "./refResolveFns-BNzUtX4y.js";
 export { assignRoles, captureHint, createDerivedFaceRef, createEdgeRef, createRef, createVertexRef, defaultScorer, isDerivedFaceRef, isEdgeRef, isFaceRef, isLineageRef, isVertexRef, resolveDerivedFaceRef, resolveEdgeRef, resolveLineageRef, resolveRef, resolveRefIn, resolveRefParams, resolveVertexRef, updateRoles };

package/dist/{threadFns-BM-VHcSJ.js → threadFns-CMdXdlIH.js}

@@ -5,7 +5,7 @@ import { b as fromBREP } from "./faceFns-Bm3-D75M.js";
 import { s as toBREP } from "./shapeFns-Dqlpy8wm.js";
 import { h as fuseAll } from "./solidBuilders-B_N5miaY.js";
 import { t as loft } from "./loftFns-CK4PP1IR.js";
-import { c as resolveRefParams } from "./refResolveFns-xqQ8Z8vC.js";
+import { c as resolveRefParams } from "./refResolveFns-BNzUtX4y.js";
 import { E as wire, h as line } from "./primitiveFns-D-hFA6e9.js";
 //#region src/utils/uuid.ts
 /** Generate a v4-style UUID string using `crypto.getRandomValues`. */

package/dist/{threadFns-C_BapeNn.cjs → threadFns-CWIlyEcP.cjs}

@@ -5,7 +5,7 @@ const require_faceFns = require("./faceFns-BhBJ_Hsb.cjs");
 const require_shapeFns = require("./shapeFns-1aqO2bz4.cjs");
 const require_solidBuilders = require("./solidBuilders-CkkgC2se.cjs");
 const require_loftFns = require("./loftFns-BJiGxTys.cjs");
-const require_refResolveFns = require("./refResolveFns-CT1YEP-7.cjs");
+const require_refResolveFns = require("./refResolveFns-AbuzUhGC.cjs");
 const require_primitiveFns = require("./primitiveFns-BDdThy3-.cjs");
 //#region src/utils/uuid.ts
 /** Generate a v4-style UUID string using `crypto.getRandomValues`. */

package/dist/topology.cjs

@@ -6,7 +6,7 @@ const require_curveFns = require("./curveFns-Bb3wuFj4.cjs");
 const require_meshFns = require("./meshFns-s-c0lABa.cjs");
 const require_solidBuilders = require("./solidBuilders-CkkgC2se.cjs");
 const require_healingFns = require("./healingFns-DoJQUwBN.cjs");
-const require_adjacencyFns = require("./adjacencyFns-Crb9tLJd.cjs");
+const require_adjacencyFns = require("./adjacencyFns-Wc3R-UZr.cjs");
 const require_primitiveFns = require("./primitiveFns-BDdThy3-.cjs");
 exports.addHoles = require_primitiveFns.addHoles;
 exports.adjacentFaces = require_adjacencyFns.adjacentFaces;

package/dist/topology.js

@@ -5,6 +5,6 @@ import { a as curveIsPeriodic, c as curvePointAt, d as flipOrientation, f as get
 import { d as createMeshCache, n as exportSTEP, r as exportSTL, t as exportIGES, u as clearMeshCache } from "./meshFns-Dt93gFGp.js";
 import { h as fuseAll, p as cutAll } from "./solidBuilders-B_N5miaY.js";
 import { A as toBufferGeometryData, C as shellWithEvolution, D as getNurbsCurveData, E as fuseAllBisect, O as getNurbsSurfaceData, P as toLineGeometryData, S as intersectWithEvolution, T as cutAllBisect, _ as positionOnCurve, a as healFace, b as filletWithEvolution, g as variableFillet, j as toGroupedBufferGeometryData, k as chamferDistAngle, l as solidFromShell, n as fixSelfIntersection, o as healSolid, r as fixShape, s as healWire, t as autoHeal, v as chamferWithEvolution, w as checkBoolean, x as fuseWithEvolution, y as cutWithEvolution } from "./healingFns-g8JymEUi.js";
-import { a as sharedEdges, c as wiresOfFace, n as edgesOfFace, o as verticesOfEdge, r as facesOfEdge, t as adjacentFaces } from "./adjacencyFns-BcEHCYK3.js";
+import { a as sharedEdges, c as wiresOfFace, n as edgesOfFace, o as verticesOfEdge, r as facesOfEdge, t as adjacentFaces } from "./adjacencyFns-CTNUxf0c.js";
 import { C as threePointArc, D as wireLoop, E as wire, S as tangentArc, T as vertex, _ as polygon, a as circle, b as sphere, c as cylinder, d as ellipsoid, f as face, g as offsetFace, h as line, i as bsplineApprox, l as ellipse, m as helix, n as bezier, o as compound, p as filledFace, r as box, s as cone, t as addHoles, u as ellipseArc, v as sewShells, w as torus, x as subFace, y as solid } from "./primitiveFns-D-hFA6e9.js";
 export { addHoles, adjacentFaces, approximateCurve, asTopo, autoHeal, bezier, box, bsplineApprox, cast, chamferDistAngle as chamferDistAngleShape, chamferWithEvolution, checkBoolean, circle, classifyPointOnFace, clearMeshCache, compound, cone, createMeshCache, curveAxis, curveEndPoint, curveIsClosed, curveIsPeriodic, curveLength, curvePeriod, curvePointAt, curveStartPoint, curveTangentAt, cutAll, cutAllBisect, cutWithEvolution, cylinder, fromBREP as deserializeShape, downcast, edgesOfFace, ellipse, ellipseArc, ellipsoid, exportIGES, exportSTEP, exportSTL, face, faceAxis, faceCenter, faceGeomType, faceOrientation, facesOfEdge, filledFace, filletWithEvolution, fixSelfIntersection, fixShape, flipFaceOrientation, flipOrientation, fuseAll, fuseAllBisect, fuseWithEvolution, getBounds, getCurveType, getEdges, getFaces, getHashCode, getNurbsCurveData, getNurbsSurfaceData, getOrientation, getSurfaceType, getVertices, getWires, healFace, healSolid, healWire, helix, innerWires, interpolateCurve, intersectWithEvolution, invalidateShapeCache, isCompSolid, isEqualShape, isSameShape, iterEdges, iterFaces, iterTopo, iterVertices, iterWires, line, normalAt, offsetFace, offsetWire2D, outerWire, pointOnSurface, polygon, positionOnCurve, projectPointOnFace, sewShells, shapeType, sharedEdges, shellWithEvolution, solid, solidFromShell, sphere, subFace, tangentArc, threePointArc, toBufferGeometryData, toGroupedBufferGeometryData, toLineGeometryData, torus, uvBounds, uvCoordinates, variableFillet, vertex, vertexPosition, verticesOfEdge, wire, wireLoop, wiresOfFace };

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "brepjs",
-  "version": "18.118.8",
+  "version": "18.118.9",
   "description": "Web CAD library with pluggable geometry kernel",
   "keywords": [
     "cad",