brepjs 18.113.0 → 18.114.0

package/dist/brepjs.cjs

@@ -16,7 +16,7 @@ const require_meshFns = require("./meshFns-1hQSn1p2.cjs");
 const require_arrayAccess = require("./arrayAccess-e4H9cBfh.cjs");
 const require_surfaceBuilders = require("./surfaceBuilders-UyyfZy8w.cjs");
 const require_solidBuilders = require("./solidBuilders-DiUv_mD0.cjs");
-const require_healingFns = require("./healingFns-x1sHV-HO.cjs");
+const require_healingFns = require("./healingFns-xLJ6Cp_O.cjs");
 const require_threadFns = require("./threadFns-C8bErjVC.cjs");
 const require_blueprintSketcher = require("./blueprintSketcher-RK-cH6ps.cjs");
 const require_helpers = require("./helpers-BSLPCflF.cjs");
@@ -29,7 +29,8 @@ const require_importFns = require("./importFns-CgMQIi0z.cjs");
 const require_loftFns = require("./loftFns-fpTmrIdd.cjs");
 const require_cameraFns = require("./cameraFns-uo1sZbBT.cjs");
 const require_textMetrics = require("./textMetrics-IC_IoI7l.cjs");
-const require_shapeRefFns = require("./shapeRefFns-CuepnFOm.cjs");
+const require_adjacencyFns = require("./adjacencyFns-d8ZabkvX.cjs");
+const require_refResolveFns = require("./refResolveFns-BK5NSDFd.cjs");
 const require_workerPool = require("./workerPool-D30NsiIW.cjs");
 const require_primitiveFns = require("./primitiveFns-DLIWtQWA.cjs");
 //#region src/topology/shapeBooleans.ts
@@ -1175,390 +1176,6 @@ function withKernelDir(v, fn) {
 	}
 }
 //#endregion
-//#region src/topology/shapeRef/roleLookup.ts
-/** Euclidean distance between two points. */
-function distance(a, b) {
-	const dx = a[0] - b[0];
-	const dy = a[1] - b[1];
-	const dz = a[2] - b[2];
-	return Math.sqrt(dx * dx + dy * dy + dz * dz);
-}
-/** Mean of a set of vertices' positions (e.g. an edge's endpoints). */
-function vertexCentroid(verts) {
-	if (verts.length === 0) return void 0;
-	let x = 0;
-	let y = 0;
-	let z = 0;
-	for (const v of verts) {
-		const p = require_topologyQueryFns.vertexPosition(v);
-		x += p[0];
-		y += p[1];
-		z += p[2];
-	}
-	const n = verts.length;
-	return [
-		x / n,
-		y / n,
-		z / n
-	];
-}
-/** The role whose tracked hashes include this face (reverse lookup). */
-function roleOfFace(face, origin, roles) {
-	const originRoles = roles.get(origin);
-	if (!originRoles) return void 0;
-	const hash = require_shapeFns.getHashCode(face);
-	for (const [role, hashes] of originRoles) if (hashes.includes(hash)) return role;
-}
-/** Current faces a role resolves to — its tracked successors present in `shape`. */
-function facesForRole(shape, origin, role, roles) {
-	const hashes = roles.get(origin)?.get(role);
-	if (hashes === void 0 || hashes.length === 0) return [];
-	return require_topologyQueryFns.getFaces(shape).filter((f) => hashes.includes(require_shapeFns.getHashCode(f)));
-}
-//#endregion
-//#region src/topology/shapeRef/edgeRefFns.ts
-function captureEdgeHint(edge) {
-	const lengthResult = require_measureFns.measureLength(edge);
-	return {
-		entityType: "edge",
-		length: lengthResult.ok ? lengthResult.value : void 0,
-		midpoint: vertexCentroid(require_healingFns.verticesOfEdge(edge))
-	};
-}
-function dedupeEdges(edges) {
-	const seen = /* @__PURE__ */ new Set();
-	const out = [];
-	for (const e of edges) {
-		const h = require_shapeFns.getHashCode(e);
-		if (!seen.has(h)) {
-			seen.add(h);
-			out.push(e);
-		}
-	}
-	return out;
-}
-/** Hint scores closer than this are treated as indistinguishable (→ ambiguous). */
-var HINT_MARGIN$2 = 1e-6;
-/**
-* Pick the candidate edge closest to the hint (length + endpoint midpoint).
-* Returns undefined when it genuinely can't discriminate — the hint carries no
-* signal, or the two best candidates score within {@link HINT_MARGIN} — so the
-* caller can report `ambiguous` rather than committing to an arbitrary edge.
-*/
-function bestByHint(candidates, hint) {
-	if (hint.length === void 0 && hint.midpoint === void 0) return void 0;
-	let best;
-	let bestScore = Infinity;
-	let secondScore = Infinity;
-	for (const edge of candidates) {
-		let score = 0;
-		if (hint.length !== void 0) {
-			const len = require_measureFns.measureLength(edge);
-			if (len.ok) score += Math.abs(len.value - hint.length);
-		}
-		if (hint.midpoint !== void 0) {
-			const mid = vertexCentroid(require_healingFns.verticesOfEdge(edge));
-			if (mid !== void 0) score += distance(hint.midpoint, mid);
-		}
-		if (score < bestScore) {
-			secondScore = bestScore;
-			bestScore = score;
-			best = edge;
-		} else if (score < secondScore) secondScore = score;
-	}
-	if (best === void 0 || secondScore - bestScore < HINT_MARGIN$2) return void 0;
-	return best;
-}
-/**
-* Capture a lineage-based reference to `edge`: its two adjacent faces' roles
-* plus a geometric hint. Returns undefined when the edge doesn't bound two faces
-* (a boundary/degenerate edge) or when either bounding face has no role yet.
-*/
-function createEdgeRef(origin, edge, shape, roles) {
-	const [faceA, faceB] = require_healingFns.facesOfEdge(shape, edge);
-	if (faceA === void 0 || faceB === void 0) return void 0;
-	const roleA = roleOfFace(faceA, origin, roles);
-	const roleB = roleOfFace(faceB, origin, roles);
-	if (roleA === void 0 || roleB === void 0) return void 0;
-	return {
-		origin,
-		faceRoles: [roleA, roleB],
-		hint: captureEdgeHint(edge)
-	};
-}
-/**
-* Resolve an EdgeRef in `shape`: resolve its two face-roles to current faces,
-* then return the edge they share. One shared edge → exact; several (the two
-* faces meet along more than one edge) → disambiguate by hint; none, or a
-* missing bounding face → broken.
-*/
-function resolveEdgeRef(ref, roles, shape) {
-	const [roleA, roleB] = ref.faceRoles;
-	const facesA = facesForRole(shape, ref.origin, roleA, roles);
-	const facesB = facesForRole(shape, ref.origin, roleB, roles);
-	if (facesA.length === 0 || facesB.length === 0) return {
-		ref,
-		reason: "not-found"
-	};
-	const candidates = [];
-	for (const a of facesA) for (const b of facesB) candidates.push(...require_healingFns.sharedEdges(a, b));
-	const unique = dedupeEdges(candidates);
-	if (unique.length === 1) {
-		const [only] = unique;
-		if (only !== void 0) return {
-			edge: only,
-			confidence: "exact"
-		};
-	}
-	if (unique.length > 1) {
-		const best = bestByHint(unique, ref.hint);
-		if (best !== void 0) return {
-			edge: best,
-			confidence: "geometric-fallback"
-		};
-		return {
-			ref,
-			reason: "ambiguous",
-			candidates: unique
-		};
-	}
-	return {
-		ref,
-		reason: "not-found"
-	};
-}
-//#endregion
-//#region src/topology/shapeRef/vertexRefFns.ts
-/** A corner needs at least this many faces to pin a unique point. */
-var MIN_VERTEX_FACES = 3;
-/** Hint distances closer than this are indistinguishable (→ ambiguous). */
-var HINT_MARGIN$1 = 1e-6;
-/** Hashes of all vertices across `faces`, recording one handle per hash. */
-function vertexHashes(faces, handles) {
-	const hashes = /* @__PURE__ */ new Set();
-	for (const f of faces) for (const v of require_healingFns.verticesOfFace(f)) {
-		const h = require_shapeFns.getHashCode(v);
-		hashes.add(h);
-		if (!handles.has(h)) handles.set(h, v);
-	}
-	return hashes;
-}
-function intersect$2(a, b) {
-	const out = /* @__PURE__ */ new Set();
-	for (const h of a) if (b.has(h)) out.add(h);
-	return out;
-}
-/** Vertices present in (a face of) every face-set — the shared corner(s). */
-function commonVertices(faceSets) {
-	const handles = /* @__PURE__ */ new Map();
-	let common;
-	for (const faces of faceSets) {
-		const hashes = vertexHashes(faces, handles);
-		common = common === void 0 ? hashes : intersect$2(common, hashes);
-	}
-	if (common === void 0) return [];
-	const result = [];
-	for (const h of common) {
-		const v = handles.get(h);
-		if (v !== void 0) result.push(v);
-	}
-	return result;
-}
-/** Nearest candidate to the hint position; undefined if no signal or a tie. */
-function nearestToHint(vertices, hint) {
-	if (hint.position === void 0) return void 0;
-	let best;
-	let bestDist = Infinity;
-	let secondDist = Infinity;
-	for (const v of vertices) {
-		const d = distance(require_topologyQueryFns.vertexPosition(v), hint.position);
-		if (d < bestDist) {
-			secondDist = bestDist;
-			bestDist = d;
-			best = v;
-		} else if (d < secondDist) secondDist = d;
-	}
-	if (best === void 0 || secondDist - bestDist < HINT_MARGIN$1) return void 0;
-	return best;
-}
-/**
-* Capture a lineage-based reference to `vertex`: the roles of the ≥3 faces
-* meeting at it, plus a position hint. Returns undefined when fewer than three
-* named faces meet there (a 2-face "vertex" is ambiguous — an edge has two).
-*/
-function createVertexRef(origin, vertex, shape, roles) {
-	const faces = require_healingFns.facesOfVertex(shape, vertex);
-	if (faces.length < MIN_VERTEX_FACES) return void 0;
-	const roleSet = /* @__PURE__ */ new Set();
-	for (const f of faces) {
-		const role = roleOfFace(f, origin, roles);
-		if (role !== void 0) roleSet.add(role);
-	}
-	if (roleSet.size < MIN_VERTEX_FACES) return void 0;
-	return {
-		origin,
-		faceRoles: [...roleSet].sort(),
-		hint: {
-			entityType: "vertex",
-			position: require_topologyQueryFns.vertexPosition(vertex)
-		}
-	};
-}
-/**
-* Resolve a VertexRef in `shape`: gather the current faces of each role, then
-* return the vertex common to all of them. One common vertex → exact; several →
-* disambiguate by hint position; none, or a missing role → broken.
-*/
-function resolveVertexRef(ref, roles, shape) {
-	const faceSets = [];
-	for (const role of ref.faceRoles) {
-		const faces = facesForRole(shape, ref.origin, role, roles);
-		if (faces.length === 0) return {
-			ref,
-			reason: "not-found"
-		};
-		faceSets.push(faces);
-	}
-	const common = commonVertices(faceSets);
-	if (common.length === 1) {
-		const [only] = common;
-		if (only !== void 0) return {
-			vertex: only,
-			confidence: "exact"
-		};
-	}
-	if (common.length > 1) {
-		const best = nearestToHint(common, ref.hint);
-		if (best !== void 0) return {
-			vertex: best,
-			confidence: "geometric-fallback"
-		};
-		return {
-			ref,
-			reason: "ambiguous",
-			candidates: common
-		};
-	}
-	return {
-		ref,
-		reason: "not-found"
-	};
-}
-//#endregion
-//#region src/topology/shapeRef/derivedFaceRefFns.ts
-/** A face re-derives a bridged face when its normal is nearly identical. */
-var NORMAL_MATCH = .99;
-/** A generated face's normal has a positive component along BOTH bridged normals. */
-var BLEND_THRESHOLD = .1;
-/** Tiebreak distances closer than this are indistinguishable (→ ambiguous). */
-var HINT_MARGIN = 1e-6;
-function normalDot(a, b) {
-	return a[0] * b[0] + a[1] * b[1] + a[2] * b[2];
-}
-/** Faces whose outward normal nearly matches `normal` (re-derives a bridged face). */
-function facesByNormal(shape, normal) {
-	return require_topologyQueryFns.getFaces(shape).filter((f) => normalDot(require_faceFns.normalAt(f), normal) > NORMAL_MATCH);
-}
-/**
-* Faces adjacent to BOTH face sets, excluding the sets themselves. Uses the
-* cached edge→faces adjacency (`adjacentFaces`) rather than an O(F·N) per-pair
-* `sharedEdges` scan.
-*/
-function betweenFaces(shape, aFaces, bFaces) {
-	const exclude = new Set([...aFaces, ...bFaces].map(require_shapeFns.getHashCode));
-	const adjacentToA = /* @__PURE__ */ new Set();
-	for (const a of aFaces) for (const f of require_healingFns.adjacentFaces(shape, a)) adjacentToA.add(require_shapeFns.getHashCode(f));
-	const result = [];
-	const seen = /* @__PURE__ */ new Set();
-	for (const b of bFaces) for (const f of require_healingFns.adjacentFaces(shape, b)) {
-		const h = require_shapeFns.getHashCode(f);
-		if (exclude.has(h) || seen.has(h) || !adjacentToA.has(h)) continue;
-		seen.add(h);
-		result.push(f);
-	}
-	return result;
-}
-/** Face whose center is nearest `point`; undefined on a tie (→ ambiguous). */
-function nearestFace(faces, point) {
-	let best;
-	let bestDist = Infinity;
-	let secondDist = Infinity;
-	for (const f of faces) {
-		const d = distance(require_faceFns.faceCenter(f), point);
-		if (d < bestDist) {
-			secondDist = bestDist;
-			bestDist = d;
-			best = f;
-		} else if (d < secondDist) secondDist = d;
-	}
-	if (best === void 0 || secondDist - bestDist < HINT_MARGIN) return void 0;
-	return best;
-}
-/**
-* Capture a reference to the face an `op` (fillet/chamfer) will generate across
-* `edge`: the roles of the edge's two faces, their outward normals, and the edge
-* midpoint. Call this on the PRE-op shape. Returns undefined when the edge
-* doesn't bound two named faces.
-*/
-function createDerivedFaceRef(origin, op, edge, preShape, roles) {
-	const [faceA, faceB] = require_healingFns.facesOfEdge(preShape, edge);
-	if (faceA === void 0 || faceB === void 0) return void 0;
-	const roleA = roleOfFace(faceA, origin, roles);
-	const roleB = roleOfFace(faceB, origin, roles);
-	if (roleA === void 0 || roleB === void 0) return void 0;
-	return {
-		origin,
-		op,
-		betweenRoles: [roleA, roleB],
-		hint: {
-			entityType: "derived-face",
-			normalA: require_faceFns.normalAt(faceA),
-			normalB: require_faceFns.normalAt(faceB),
-			edgeMidpoint: vertexCentroid(require_healingFns.verticesOfEdge(edge))
-		}
-	};
-}
-/**
-* Resolve a DerivedFaceRef in the post-op `shape`: re-derive the two bridged
-* faces (role table, else by captured normal), then return the face adjacent to
-* both whose normal blends both. One survivor → resolved; several →
-* nearest-to-edge-midpoint; none → broken.
-*/
-function resolveDerivedFaceRef(ref, roles, shape) {
-	let aFaces = facesForRole(shape, ref.origin, ref.betweenRoles[0], roles);
-	if (aFaces.length === 0) aFaces = facesByNormal(shape, ref.hint.normalA);
-	let bFaces = facesForRole(shape, ref.origin, ref.betweenRoles[1], roles);
-	if (bFaces.length === 0) bFaces = facesByNormal(shape, ref.hint.normalB);
-	if (aFaces.length === 0 || bFaces.length === 0) return {
-		ref,
-		reason: "not-found"
-	};
-	const blended = betweenFaces(shape, aFaces, bFaces).filter((f) => normalDot(require_faceFns.normalAt(f), ref.hint.normalA) > BLEND_THRESHOLD && normalDot(require_faceFns.normalAt(f), ref.hint.normalB) > BLEND_THRESHOLD);
-	if (blended.length === 1) {
-		const [only] = blended;
-		if (only !== void 0) return {
-			face: only,
-			confidence: "geometric-fallback"
-		};
-	}
-	if (blended.length > 1) {
-		const best = ref.hint.edgeMidpoint && nearestFace(blended, ref.hint.edgeMidpoint);
-		if (best) return {
-			face: best,
-			confidence: "geometric-fallback"
-		};
-		return {
-			ref,
-			reason: "ambiguous",
-			candidates: blended
-		};
-	}
-	return {
-		ref,
-		reason: "not-found"
-	};
-}
-//#endregion
 //#region src/topology/surfaceFns.ts
 /**
 * Surface creation functions — generate faces from height-map grids.
@@ -7191,7 +6808,7 @@ exports.addHoles = require_primitiveFns.addHoles;
 exports.addJoint = require_threadFns.addJoint;
 exports.addMate = addMate;
 exports.addStep = require_threadFns.addStep;
-exports.adjacentFaces = require_healingFns.adjacentFaces;
+exports.adjacentFaces = require_adjacencyFns.adjacentFaces;
 exports.all = require_errors.all;
 exports.andThen = require_errors.andThen;
 exports.applyGlue = applyGlue;
@@ -7200,7 +6817,7 @@ exports.approximateCurve = require_curveFns.approximateCurve;
 exports.as2D = require_shapeTypes.as2D;
 exports.as3D = require_shapeTypes.as3D;
 exports.asTopo = require_faceFns.asTopo;
-exports.assignRoles = require_shapeRefFns.assignRoles;
+exports.assignRoles = require_refResolveFns.assignRoles;
 exports.autoHeal = require_healingFns.autoHeal;
 exports.bezier = require_primitiveFns.bezier;
 exports.blueprintToDXF = require_importFns.blueprintToDXF;
@@ -7217,7 +6834,7 @@ exports.bsplineApprox = require_primitiveFns.bsplineApprox;
 exports.bug = require_errors.bug;
 exports.cameraFromPlane = require_cameraFns.cameraFromPlane;
 exports.cameraLookAt = require_cameraFns.cameraLookAt;
-exports.captureHint = require_shapeRefFns.captureHint;
+exports.captureHint = require_refResolveFns.captureHint;
 exports.cast = require_faceFns.cast;
 exports.castShape = require_shapeTypes.castShape;
 exports.castShape3D = require_shapeTypes.castShape3D;
@@ -7262,10 +6879,10 @@ exports.createBlueprint = require_blueprintFns.createBlueprint;
 exports.createCamera = require_cameraFns.createCamera;
 exports.createCompound = require_shapeTypes.createCompound;
 exports.createCompoundBlueprint = require_blueprintFns.createCompoundBlueprint;
-exports.createDerivedFaceRef = createDerivedFaceRef;
+exports.createDerivedFaceRef = require_refResolveFns.createDerivedFaceRef;
 exports.createDistanceQuery = require_measureFns.createDistanceQuery;
 exports.createEdge = require_shapeTypes.createEdge;
-exports.createEdgeRef = createEdgeRef;
+exports.createEdgeRef = require_refResolveFns.createEdgeRef;
 exports.createFace = require_shapeTypes.createFace;
 exports.createHandle = require_shapeTypes.createHandle;
 exports.createHistory = require_threadFns.createHistory;
@@ -7274,13 +6891,13 @@ exports.createMeshCache = require_meshFns.createMeshCache;
 exports.createNamedPlane = require_planeOps.createNamedPlane;
 exports.createOperationRegistry = require_workerPool.createOperationRegistry;
 exports.createPlane = require_planeOps.createPlane;
-exports.createRef = require_shapeRefFns.createRef;
+exports.createRef = require_refResolveFns.createRef;
 exports.createRegistry = require_threadFns.createRegistry;
 exports.createShell = require_shapeTypes.createShell;
 exports.createSolid = require_shapeTypes.createSolid;
 exports.createTaskQueue = require_workerPool.createTaskQueue;
 exports.createVertex = require_shapeTypes.createVertex;
-exports.createVertexRef = createVertexRef;
+exports.createVertexRef = require_refResolveFns.createVertexRef;
 exports.createWire = require_shapeTypes.createWire;
 exports.createWorkerClient = require_workerPool.createWorkerClient;
 exports.createWorkerHandler = require_workerPool.createWorkerHandler;
@@ -7317,7 +6934,7 @@ exports.cutBlueprints = require_boolean2D.cutBlueprints;
 exports.cutWithEvolution = require_healingFns.cutWithEvolution;
 exports.cylinder = require_primitiveFns.cylinder;
 exports.cylindricalJoint = require_threadFns.cylindricalJoint;
-exports.defaultScorer = require_shapeRefFns.defaultScorer;
+exports.defaultScorer = require_refResolveFns.defaultScorer;
 exports.dequeueTask = require_workerPool.dequeueTask;
 exports.describe = describe;
 exports.deserializeDrawing = require_drawFns.deserializeDrawing;
@@ -7346,7 +6963,7 @@ exports.drawingIntersect = require_drawFns.drawingIntersect;
 exports.drawingToSketchOnPlane = require_drawFns.drawingToSketchOnPlane;
 exports.drill = drill;
 exports.edgeFinder = require_helpers.edgeFinder;
-exports.edgesOfFace = require_healingFns.edgesOfFace;
+exports.edgesOfFace = require_adjacencyFns.edgesOfFace;
 exports.ellipse = require_primitiveFns.ellipse;
 exports.ellipseArc = require_primitiveFns.ellipseArc;
 exports.ellipsoid = require_primitiveFns.ellipsoid;
@@ -7371,8 +6988,8 @@ exports.faceCenter = require_faceFns.faceCenter;
 exports.faceFinder = require_helpers.faceFinder;
 exports.faceGeomType = require_faceFns.faceGeomType;
 exports.faceOrientation = require_faceFns.faceOrientation;
-exports.facesOfEdge = require_healingFns.facesOfEdge;
-exports.facesOfVertex = require_healingFns.facesOfVertex;
+exports.facesOfEdge = require_adjacencyFns.facesOfEdge;
+exports.facesOfVertex = require_adjacencyFns.facesOfVertex;
 exports.fieldBoolean = fieldBoolean;
 exports.fieldContour = fieldContour;
 exports.fieldOffset = fieldOffset;
@@ -7485,17 +7102,21 @@ exports.isChamferRadius = isChamferRadius;
 exports.isClosedWire = require_shapeTypes.isClosedWire;
 exports.isCompSolid = require_faceFns.isCompSolid;
 exports.isCompound = require_shapeTypes.isCompound;
+exports.isDerivedFaceRef = require_refResolveFns.isDerivedFaceRef;
 exports.isDisposeRequest = require_workerPool.isDisposeRequest;
 exports.isEdge = require_shapeTypes.isEdge;
+exports.isEdgeRef = require_refResolveFns.isEdgeRef;
 exports.isEmpty = isEmpty;
 exports.isEqualShape = require_shapeFns.isEqualShape;
 exports.isErr = require_errors.isErr;
 exports.isErrorResponse = require_workerPool.isErrorResponse;
 exports.isFace = require_shapeTypes.isFace;
+exports.isFaceRef = require_refResolveFns.isFaceRef;
 exports.isFilletRadius = isFilletRadius;
 exports.isInitRequest = require_workerPool.isInitRequest;
 exports.isInside2D = require_blueprintFns.isInside2D;
 exports.isInstanced = isInstanced;
+exports.isLineageRef = require_refResolveFns.isLineageRef;
 exports.isLive = require_shapeTypes.isLive;
 exports.isManifoldShell = require_shapeTypes.isManifoldShell;
 exports.isNumber = isNumber;
@@ -7515,6 +7136,7 @@ exports.isSuccessResponse = require_workerPool.isSuccessResponse;
 exports.isValid = isValid;
 exports.isValidSolid = require_shapeTypes.isValidSolid;
 exports.isVertex = require_shapeTypes.isVertex;
+exports.isVertexRef = require_refResolveFns.isVertexRef;
 exports.isWire = require_shapeTypes.isWire;
 exports.iterCompSolids = require_topologyQueryFns.iterCompSolids;
 exports.iterEdges = require_topologyQueryFns.iterEdges;
@@ -7654,12 +7276,15 @@ exports.resetPerformanceStats = require_shapeTypes.resetPerformanceStats;
 exports.resize = require_shapeFns.resize;
 exports.resolve = resolve;
 exports.resolve3D = resolve3D;
-exports.resolveDerivedFaceRef = resolveDerivedFaceRef;
+exports.resolveDerivedFaceRef = require_refResolveFns.resolveDerivedFaceRef;
 exports.resolveDirection = require_types.resolveDirection;
-exports.resolveEdgeRef = resolveEdgeRef;
+exports.resolveEdgeRef = require_refResolveFns.resolveEdgeRef;
+exports.resolveLineageRef = require_refResolveFns.resolveLineageRef;
 exports.resolvePlane = require_planeOps.resolvePlane;
-exports.resolveRef = require_shapeRefFns.resolveRef;
-exports.resolveVertexRef = resolveVertexRef;
+exports.resolveRef = require_refResolveFns.resolveRef;
+exports.resolveRefIn = require_refResolveFns.resolveRefIn;
+exports.resolveRefParams = require_refResolveFns.resolveRefParams;
+exports.resolveVertexRef = require_refResolveFns.resolveVertexRef;
 exports.reverseCurve = require_blueprintFns.reverseCurve;
 exports.revoluteJoint = require_threadFns.revoluteJoint;
 exports.revolve = revolve;
@@ -7698,7 +7323,7 @@ exports.sewShells = require_primitiveFns.sewShells;
 exports.shape = shape;
 exports.shapeToMeshInput = shapeToMeshInput;
 exports.shapeType = require_faceFns.shapeType;
-exports.sharedEdges = require_healingFns.sharedEdges;
+exports.sharedEdges = require_adjacencyFns.sharedEdges;
 exports.shell = shell;
 exports.shellMesh = shellMesh;
 exports.shellShape = shellShape;
@@ -7782,7 +7407,7 @@ exports.unwrapErr = require_errors.unwrapErr;
 exports.unwrapOr = require_errors.unwrapOr;
 exports.unwrapOrElse = require_errors.unwrapOrElse;
 exports.updateNode = require_threadFns.updateNode;
-exports.updateRoles = require_shapeRefFns.updateRoles;
+exports.updateRoles = require_refResolveFns.updateRoles;
 exports.uvBounds = require_faceFns.uvBounds;
 exports.uvCoordinates = require_faceFns.uvCoordinates;
 exports.validSolid = require_shapeTypes.validSolid;
@@ -7808,8 +7433,8 @@ exports.vecSub = require_vecOps.vecSub;
 exports.vertex = require_primitiveFns.vertex;
 exports.vertexFinder = vertexFinder;
 exports.vertexPosition = require_topologyQueryFns.vertexPosition;
-exports.verticesOfEdge = require_healingFns.verticesOfEdge;
-exports.verticesOfFace = require_healingFns.verticesOfFace;
+exports.verticesOfEdge = require_adjacencyFns.verticesOfEdge;
+exports.verticesOfFace = require_adjacencyFns.verticesOfFace;
 exports.voxelBoolean = voxelBoolean;
 exports.voxelBooleanField = voxelBooleanField;
 exports.voxelBooleanFieldShapes = voxelBooleanFieldShapes;
@@ -7821,7 +7446,7 @@ exports.windingNumbers = windingNumbers;
 exports.wire = require_primitiveFns.wire;
 exports.wireFinder = require_helpers.wireFinder;
 exports.wireLoop = require_primitiveFns.wireLoop;
-exports.wiresOfFace = require_healingFns.wiresOfFace;
+exports.wiresOfFace = require_adjacencyFns.wiresOfFace;
 exports.withKernel = require_shapeTypes.withKernel;
 exports.withKernelDir = withKernelDir;
 exports.withKernelPnt = withKernelPnt;