brepjs 18.118.2 → 18.118.4

package/dist/{shapeFns-DqGDtCsE.js → shapeFns-DED4C70_.js}

@@ -1,6 +1,6 @@
-import { Z as getKernel, t as castShape } from "./shapeTypes-EI4Uxlsb.js";
+import { et as getKernel, t as castResultShape } from "./shapeTypes-BguzpBK0.js";
 import { A as ok, b as err, d as validationError, t as BrepErrorCode } from "./errors-DNWJsfVU.js";
-import { C as kernelCall, c as getFaces, l as getOrCreateCache, r as getCacheEntry, w as kernelCallRaw } from "./topologyQueryFns-BjgBf2t-.js";
+import { C as kernelCall, c as getFaces, l as getOrCreateCache, r as getCacheEntry, w as kernelCallRaw } from "./topologyQueryFns-Dl2F-2d9.js";
 import { n as HASH_CODE_MAX, t as DEG2RAD } from "./constants-ITRzCnCp.js";
 //#region src/topology/metadata/originTrackingFns.ts
 /**
@@ -13,8 +13,12 @@ import { n as HASH_CODE_MAX, t as DEG2RAD } from "./constants-ITRzCnCp.js";
 */
 function setShapeOrigin(shape, origin) {
 	const cache = getOrCreateCache(shape);
+	const kernel = getKernel();
 	const map = /* @__PURE__ */ new Map();
-	for (const f of getFaces(shape)) map.set(getKernel().hashCode(f.wrapped, HASH_CODE_MAX), origin);
+	for (const face of kernel.iterShapes(shape.wrapped, "face")) {
+		map.set(kernel.hashCode(face, HASH_CODE_MAX), origin);
+		kernel.dispose(face);
+	}
 	cache.faceOrigins = map;
 }
 /**
@@ -51,13 +55,44 @@ function propagateOriginsFromEvolution(evolution, inputs, result) {
 		cache.faceOrigins = resultMap;
 	}
 }
+/** Max 3D centroid separation (mm²) for a "near" match — the general case. */
+var MAX_MATCH_DIST_SQ = 100;
+/** Min |outNormal·inNormal| for two faces to count as sharing a plane's orientation. */
+var COPLANAR_NORMAL_MIN = .985;
+/**
+* Max squared perpendicular offset (mm²) from an input face's plane for the
+* output face to count as *coplanar* with it — i.e. a piece the boolean sliced
+* off that same planar surface. 0.1mm² tolerates kernel/mesh float noise while
+* still separating floors that sit even a fraction of a mm apart in depth.
+*/
+var COPLANAR_OFFSET_SQ = .1;
 /**
 * Find the best origin match for a result face by comparing normals and centroids
 * against input face signatures. Returns `undefined` if no good match exists.
+*
+* Two passes, near strictly preferred:
+*  1. Near match — same-facing normal (signed dot ≥ 0.707) and centroids within
+*     {@link MAX_MATCH_DIST_SQ}. The general case for regenerated seam faces
+*     (feature tops, flush walls). Unchanged legacy behavior. If any near match
+*     exists it wins outright — the coplanar pass never runs — so a distant
+*     coplanar candidate can't outscore a valid near one.
+*  2. Coplanar match (only when no near match, and only between PLANAR faces) —
+*     the output face lies on an input face's plane (parallel *or* antiparallel
+*     normal, tiny perpendicular offset) regardless of how far its centroid
+*     drifted in-plane. Two cases pass 1 misses:
+*       • A boolean that splits a large planar face — a wide cutout floor sliced
+*         by an overlapping deeper cutout — leaves pieces >10mm from the parent
+*         centroid (past pass 1's cutoff).
+*       • A cut flips the cavity face's normal versus the tool face it came from,
+*         so the floor is antiparallel to its origin's input face.
+*     Both left the surface tagless → body color in multi-color consumers
+*     (gridfinity GH #2443). The planar gate keeps a curved output face from
+*     inheriting an origin off an unrelated face that merely shares a sampled
+*     tangent plane; among coplanar candidates the nearest in-plane wins.
 */
-function findBestOriginMatch(outNormal, outCentroid, inputSigs) {
-	let bestScore = -Infinity;
-	let bestOrigin;
+function findBestOriginMatch(outNormal, outCentroid, outPlanar, inputSigs) {
+	let bestNearScore = -Infinity;
+	let bestNear;
 	for (const inp of inputSigs) {
 		const dot = outNormal[0] * inp.normal[0] + outNormal[1] * inp.normal[1] + outNormal[2] * inp.normal[2];
 		if (dot < .707) continue;
@@ -65,14 +100,33 @@ function findBestOriginMatch(outNormal, outCentroid, inputSigs) {
 		const dy = outCentroid[1] - inp.centroid[1];
 		const dz = outCentroid[2] - inp.centroid[2];
 		const distSq = dx * dx + dy * dy + dz * dz;
-		if (distSq > 100) continue;
-		const score = dot - distSq / 100;
-		if (score > bestScore) {
-			bestScore = score;
-			bestOrigin = inp.origin;
+		if (distSq > MAX_MATCH_DIST_SQ) continue;
+		const score = dot - distSq / MAX_MATCH_DIST_SQ;
+		if (score > bestNearScore) {
+			bestNearScore = score;
+			bestNear = inp.origin;
 		}
 	}
-	return bestOrigin;
+	if (bestNear !== void 0) return bestNear;
+	if (!outPlanar) return void 0;
+	let bestInPlaneSq = Infinity;
+	let bestCoplanar;
+	for (const inp of inputSigs) {
+		if (!inp.planar) continue;
+		const dot = outNormal[0] * inp.normal[0] + outNormal[1] * inp.normal[1] + outNormal[2] * inp.normal[2];
+		if (Math.abs(dot) < COPLANAR_NORMAL_MIN) continue;
+		const dx = outCentroid[0] - inp.centroid[0];
+		const dy = outCentroid[1] - inp.centroid[1];
+		const dz = outCentroid[2] - inp.centroid[2];
+		const perp = dx * inp.normal[0] + dy * inp.normal[1] + dz * inp.normal[2];
+		if (perp * perp > COPLANAR_OFFSET_SQ) continue;
+		const inPlaneSq = Math.max(0, dx * dx + dy * dy + dz * dz - perp * perp);
+		if (inPlaneSq < bestInPlaneSq) {
+			bestInPlaneSq = inPlaneSq;
+			bestCoplanar = inp.origin;
+		}
+	}
+	return bestCoplanar;
 }
 /**
 * Fallback origin propagation when no kernel op object is available
@@ -126,10 +180,12 @@ function propagateOriginsByHash(inputs, result) {
 					const bounds = kernel.uvBounds(f.wrapped);
 					const normal = kernel.surfaceNormal(f.wrapped, .5 * (bounds.uMin + bounds.uMax), .5 * (bounds.vMin + bounds.vMax));
 					const centroid = kernel.surfaceCenterOfMass(f.wrapped);
+					const planar = kernel.surfaceType(f.wrapped) === "plane";
 					inputSigs.push({
 						origin,
 						normal,
-						centroid
+						centroid,
+						planar
 					});
 				} catch {}
 			}
@@ -138,7 +194,7 @@ function propagateOriginsByHash(inputs, result) {
 			const hash = kernel.hashCode(f.wrapped, HASH_CODE_MAX);
 			try {
 				const outBounds = kernel.uvBounds(f.wrapped);
-				const bestOrigin = findBestOriginMatch(kernel.surfaceNormal(f.wrapped, .5 * (outBounds.uMin + outBounds.uMax), .5 * (outBounds.vMin + outBounds.vMax)), kernel.surfaceCenterOfMass(f.wrapped), inputSigs);
+				const bestOrigin = findBestOriginMatch(kernel.surfaceNormal(f.wrapped, .5 * (outBounds.uMin + outBounds.uMax), .5 * (outBounds.vMin + outBounds.vMax)), kernel.surfaceCenterOfMass(f.wrapped), kernel.surfaceType(f.wrapped) === "plane", inputSigs);
 				if (bestOrigin !== void 0) resultMap.set(hash, bestOrigin);
 			} catch {}
 		}
@@ -390,7 +446,10 @@ function collectInputFaceHashes(inputs) {
 	const hashes = [];
 	for (const input of inputs) {
 		const faces = kernel.iterShapes(input.wrapped, "face");
-		for (const face of faces) hashes.push(kernel.hashCode(face, HASH_CODE_MAX));
+		for (const face of faces) {
+			hashes.push(kernel.hashCode(face, HASH_CODE_MAX));
+			kernel.dispose(face);
+		}
 	}
 	return hashes;
 }
@@ -446,6 +505,8 @@ function propagateMetadataThroughRelocation(source, moved) {
 		if (sf === void 0 || mf === void 0) continue;
 		modified.set(kernel.hashCode(sf, HASH_CODE_MAX), [kernel.hashCode(mf, HASH_CODE_MAX)]);
 	}
+	for (const f of srcFaces) kernel.dispose(f);
+	for (const f of movedFaces) kernel.dispose(f);
 	propagateAllMetadata({
 		modified,
 		generated: /* @__PURE__ */ new Map(),
@@ -462,7 +523,7 @@ function propagateMetadataThroughRelocation(source, moved) {
 function translate(shape, v) {
 	const inputFaceHashes = collectInputFaceHashes([shape]);
 	const { shape: resultShape, evolution } = getKernel().translateWithHistory(shape.wrapped, v[0], v[1], v[2], inputFaceHashes, HASH_CODE_MAX);
-	const result = castShape(resultShape);
+	const result = castResultShape(resultShape);
 	propagateAllMetadata(evolution, [shape], result);
 	return result;
 }
@@ -478,7 +539,7 @@ function rotate(shape, angle, position = [
 ]) {
 	const inputFaceHashes = collectInputFaceHashes([shape]);
 	const { shape: resultShape, evolution } = getKernel().rotateWithHistory(shape.wrapped, angle * DEG2RAD, inputFaceHashes, HASH_CODE_MAX, direction, position);
-	const result = castShape(resultShape);
+	const result = castResultShape(resultShape);
 	propagateAllMetadata(evolution, [shape], result);
 	return result;
 }
@@ -494,7 +555,7 @@ function mirror(shape, planeNormal = [
 ]) {
 	const inputFaceHashes = collectInputFaceHashes([shape]);
 	const { shape: resultShape, evolution } = getKernel().mirrorWithHistory(shape.wrapped, planeOrigin, planeNormal, inputFaceHashes, HASH_CODE_MAX);
-	const result = castShape(resultShape);
+	const result = castResultShape(resultShape);
 	propagateAllMetadata(evolution, [shape], result);
 	return result;
 }
@@ -506,7 +567,7 @@ function scale(shape, factor, center = [
 ]) {
 	const inputFaceHashes = collectInputFaceHashes([shape]);
 	const { shape: resultShape, evolution } = getKernel().scaleWithHistory(shape.wrapped, center, factor, inputFaceHashes, HASH_CODE_MAX);
-	const result = castShape(resultShape);
+	const result = castResultShape(resultShape);
 	propagateAllMetadata(evolution, [shape], result);
 	return result;
 }
@@ -608,11 +669,11 @@ function applyMatrix(shape, matrix) {
 	if (isOrthogonalMatrix(linear)) {
 		const inputFaceHashes = collectInputFaceHashes([shape]);
 		const { shape: resultShape, evolution } = getKernel().generalTransformWithHistory(shape.wrapped, linear, translation, true, inputFaceHashes, HASH_CODE_MAX);
-		const result = castShape(resultShape);
+		const result = castResultShape(resultShape);
 		propagateAllMetadata(evolution, [shape], result);
 		return ok(result);
 	}
-	const result = castShape(getKernel().generalTransformNonOrthogonal(shape.wrapped, linear, translation));
+	const result = castResultShape(getKernel().generalTransformNonOrthogonal(shape.wrapped, linear, translation));
 	propagateMetadataByHash([shape], result);
 	return ok(result);
 	/* v8 ignore stop */
@@ -661,7 +722,7 @@ function locate(shape, placement) {
 	const { trsf, cleanup } = composeTransforms("type" in placement ? [placement] : placement);
 	let moved;
 	try {
-		moved = castShape(getKernel().locate(shape.wrapped, trsf));
+		moved = castResultShape(getKernel().locate(shape.wrapped, trsf));
 	} finally {
 		cleanup();
 	}
@@ -675,7 +736,7 @@ function locate(shape, placement) {
 function transformCopy(shape, composed) {
 	const inputFaceHashes = collectInputFaceHashes([shape]);
 	const { shape: resultShape, evolution } = getKernel().applyComposedTransformWithHistory(shape.wrapped, composed.trsf, inputFaceHashes, HASH_CODE_MAX);
-	const result = castShape(resultShape);
+	const result = castResultShape(resultShape);
 	propagateAllMetadata(evolution, [shape], result);
 	return result;
 }

package/dist/{shapeFns-DvmBIZaX.cjs → shapeFns-DxAhtxFP.cjs}

@@ -1,6 +1,6 @@
-const require_shapeTypes = require("./shapeTypes-BLREi6xB.cjs");
+const require_shapeTypes = require("./shapeTypes-Ca76Bklg.cjs");
 const require_errors = require("./errors-CXJtc4I7.cjs");
-const require_topologyQueryFns = require("./topologyQueryFns-1PqfeHrV.cjs");
+const require_topologyQueryFns = require("./topologyQueryFns-B1QAiZVI.cjs");
 const require_constants = require("./constants-BOVyEYGH.cjs");
 //#region src/topology/metadata/originTrackingFns.ts
 /**
@@ -13,8 +13,12 @@ const require_constants = require("./constants-BOVyEYGH.cjs");
 */
 function setShapeOrigin(shape, origin) {
 	const cache = require_topologyQueryFns.getOrCreateCache(shape);
+	const kernel = require_shapeTypes.getKernel();
 	const map = /* @__PURE__ */ new Map();
-	for (const f of require_topologyQueryFns.getFaces(shape)) map.set(require_shapeTypes.getKernel().hashCode(f.wrapped, require_constants.HASH_CODE_MAX), origin);
+	for (const face of kernel.iterShapes(shape.wrapped, "face")) {
+		map.set(kernel.hashCode(face, require_constants.HASH_CODE_MAX), origin);
+		kernel.dispose(face);
+	}
 	cache.faceOrigins = map;
 }
 /**
@@ -51,13 +55,44 @@ function propagateOriginsFromEvolution(evolution, inputs, result) {
 		cache.faceOrigins = resultMap;
 	}
 }
+/** Max 3D centroid separation (mm²) for a "near" match — the general case. */
+var MAX_MATCH_DIST_SQ = 100;
+/** Min |outNormal·inNormal| for two faces to count as sharing a plane's orientation. */
+var COPLANAR_NORMAL_MIN = .985;
+/**
+* Max squared perpendicular offset (mm²) from an input face's plane for the
+* output face to count as *coplanar* with it — i.e. a piece the boolean sliced
+* off that same planar surface. 0.1mm² tolerates kernel/mesh float noise while
+* still separating floors that sit even a fraction of a mm apart in depth.
+*/
+var COPLANAR_OFFSET_SQ = .1;
 /**
 * Find the best origin match for a result face by comparing normals and centroids
 * against input face signatures. Returns `undefined` if no good match exists.
+*
+* Two passes, near strictly preferred:
+*  1. Near match — same-facing normal (signed dot ≥ 0.707) and centroids within
+*     {@link MAX_MATCH_DIST_SQ}. The general case for regenerated seam faces
+*     (feature tops, flush walls). Unchanged legacy behavior. If any near match
+*     exists it wins outright — the coplanar pass never runs — so a distant
+*     coplanar candidate can't outscore a valid near one.
+*  2. Coplanar match (only when no near match, and only between PLANAR faces) —
+*     the output face lies on an input face's plane (parallel *or* antiparallel
+*     normal, tiny perpendicular offset) regardless of how far its centroid
+*     drifted in-plane. Two cases pass 1 misses:
+*       • A boolean that splits a large planar face — a wide cutout floor sliced
+*         by an overlapping deeper cutout — leaves pieces >10mm from the parent
+*         centroid (past pass 1's cutoff).
+*       • A cut flips the cavity face's normal versus the tool face it came from,
+*         so the floor is antiparallel to its origin's input face.
+*     Both left the surface tagless → body color in multi-color consumers
+*     (gridfinity GH #2443). The planar gate keeps a curved output face from
+*     inheriting an origin off an unrelated face that merely shares a sampled
+*     tangent plane; among coplanar candidates the nearest in-plane wins.
 */
-function findBestOriginMatch(outNormal, outCentroid, inputSigs) {
-	let bestScore = -Infinity;
-	let bestOrigin;
+function findBestOriginMatch(outNormal, outCentroid, outPlanar, inputSigs) {
+	let bestNearScore = -Infinity;
+	let bestNear;
 	for (const inp of inputSigs) {
 		const dot = outNormal[0] * inp.normal[0] + outNormal[1] * inp.normal[1] + outNormal[2] * inp.normal[2];
 		if (dot < .707) continue;
@@ -65,14 +100,33 @@ function findBestOriginMatch(outNormal, outCentroid, inputSigs) {
 		const dy = outCentroid[1] - inp.centroid[1];
 		const dz = outCentroid[2] - inp.centroid[2];
 		const distSq = dx * dx + dy * dy + dz * dz;
-		if (distSq > 100) continue;
-		const score = dot - distSq / 100;
-		if (score > bestScore) {
-			bestScore = score;
-			bestOrigin = inp.origin;
+		if (distSq > MAX_MATCH_DIST_SQ) continue;
+		const score = dot - distSq / MAX_MATCH_DIST_SQ;
+		if (score > bestNearScore) {
+			bestNearScore = score;
+			bestNear = inp.origin;
 		}
 	}
-	return bestOrigin;
+	if (bestNear !== void 0) return bestNear;
+	if (!outPlanar) return void 0;
+	let bestInPlaneSq = Infinity;
+	let bestCoplanar;
+	for (const inp of inputSigs) {
+		if (!inp.planar) continue;
+		const dot = outNormal[0] * inp.normal[0] + outNormal[1] * inp.normal[1] + outNormal[2] * inp.normal[2];
+		if (Math.abs(dot) < COPLANAR_NORMAL_MIN) continue;
+		const dx = outCentroid[0] - inp.centroid[0];
+		const dy = outCentroid[1] - inp.centroid[1];
+		const dz = outCentroid[2] - inp.centroid[2];
+		const perp = dx * inp.normal[0] + dy * inp.normal[1] + dz * inp.normal[2];
+		if (perp * perp > COPLANAR_OFFSET_SQ) continue;
+		const inPlaneSq = Math.max(0, dx * dx + dy * dy + dz * dz - perp * perp);
+		if (inPlaneSq < bestInPlaneSq) {
+			bestInPlaneSq = inPlaneSq;
+			bestCoplanar = inp.origin;
+		}
+	}
+	return bestCoplanar;
 }
 /**
 * Fallback origin propagation when no kernel op object is available
@@ -126,10 +180,12 @@ function propagateOriginsByHash(inputs, result) {
 					const bounds = kernel.uvBounds(f.wrapped);
 					const normal = kernel.surfaceNormal(f.wrapped, .5 * (bounds.uMin + bounds.uMax), .5 * (bounds.vMin + bounds.vMax));
 					const centroid = kernel.surfaceCenterOfMass(f.wrapped);
+					const planar = kernel.surfaceType(f.wrapped) === "plane";
 					inputSigs.push({
 						origin,
 						normal,
-						centroid
+						centroid,
+						planar
 					});
 				} catch {}
 			}
@@ -138,7 +194,7 @@ function propagateOriginsByHash(inputs, result) {
 			const hash = kernel.hashCode(f.wrapped, require_constants.HASH_CODE_MAX);
 			try {
 				const outBounds = kernel.uvBounds(f.wrapped);
-				const bestOrigin = findBestOriginMatch(kernel.surfaceNormal(f.wrapped, .5 * (outBounds.uMin + outBounds.uMax), .5 * (outBounds.vMin + outBounds.vMax)), kernel.surfaceCenterOfMass(f.wrapped), inputSigs);
+				const bestOrigin = findBestOriginMatch(kernel.surfaceNormal(f.wrapped, .5 * (outBounds.uMin + outBounds.uMax), .5 * (outBounds.vMin + outBounds.vMax)), kernel.surfaceCenterOfMass(f.wrapped), kernel.surfaceType(f.wrapped) === "plane", inputSigs);
 				if (bestOrigin !== void 0) resultMap.set(hash, bestOrigin);
 			} catch {}
 		}
@@ -390,7 +446,10 @@ function collectInputFaceHashes(inputs) {
 	const hashes = [];
 	for (const input of inputs) {
 		const faces = kernel.iterShapes(input.wrapped, "face");
-		for (const face of faces) hashes.push(kernel.hashCode(face, require_constants.HASH_CODE_MAX));
+		for (const face of faces) {
+			hashes.push(kernel.hashCode(face, require_constants.HASH_CODE_MAX));
+			kernel.dispose(face);
+		}
 	}
 	return hashes;
 }
@@ -446,6 +505,8 @@ function propagateMetadataThroughRelocation(source, moved) {
 		if (sf === void 0 || mf === void 0) continue;
 		modified.set(kernel.hashCode(sf, require_constants.HASH_CODE_MAX), [kernel.hashCode(mf, require_constants.HASH_CODE_MAX)]);
 	}
+	for (const f of srcFaces) kernel.dispose(f);
+	for (const f of movedFaces) kernel.dispose(f);
 	propagateAllMetadata({
 		modified,
 		generated: /* @__PURE__ */ new Map(),
@@ -462,7 +523,7 @@ function propagateMetadataThroughRelocation(source, moved) {
 function translate(shape, v) {
 	const inputFaceHashes = collectInputFaceHashes([shape]);
 	const { shape: resultShape, evolution } = require_shapeTypes.getKernel().translateWithHistory(shape.wrapped, v[0], v[1], v[2], inputFaceHashes, require_constants.HASH_CODE_MAX);
-	const result = require_shapeTypes.castShape(resultShape);
+	const result = require_shapeTypes.castResultShape(resultShape);
 	propagateAllMetadata(evolution, [shape], result);
 	return result;
 }
@@ -478,7 +539,7 @@ function rotate(shape, angle, position = [
 ]) {
 	const inputFaceHashes = collectInputFaceHashes([shape]);
 	const { shape: resultShape, evolution } = require_shapeTypes.getKernel().rotateWithHistory(shape.wrapped, angle * require_constants.DEG2RAD, inputFaceHashes, require_constants.HASH_CODE_MAX, direction, position);
-	const result = require_shapeTypes.castShape(resultShape);
+	const result = require_shapeTypes.castResultShape(resultShape);
 	propagateAllMetadata(evolution, [shape], result);
 	return result;
 }
@@ -494,7 +555,7 @@ function mirror(shape, planeNormal = [
 ]) {
 	const inputFaceHashes = collectInputFaceHashes([shape]);
 	const { shape: resultShape, evolution } = require_shapeTypes.getKernel().mirrorWithHistory(shape.wrapped, planeOrigin, planeNormal, inputFaceHashes, require_constants.HASH_CODE_MAX);
-	const result = require_shapeTypes.castShape(resultShape);
+	const result = require_shapeTypes.castResultShape(resultShape);
 	propagateAllMetadata(evolution, [shape], result);
 	return result;
 }
@@ -506,7 +567,7 @@ function scale(shape, factor, center = [
 ]) {
 	const inputFaceHashes = collectInputFaceHashes([shape]);
 	const { shape: resultShape, evolution } = require_shapeTypes.getKernel().scaleWithHistory(shape.wrapped, center, factor, inputFaceHashes, require_constants.HASH_CODE_MAX);
-	const result = require_shapeTypes.castShape(resultShape);
+	const result = require_shapeTypes.castResultShape(resultShape);
 	propagateAllMetadata(evolution, [shape], result);
 	return result;
 }
@@ -608,11 +669,11 @@ function applyMatrix(shape, matrix) {
 	if (isOrthogonalMatrix(linear)) {
 		const inputFaceHashes = collectInputFaceHashes([shape]);
 		const { shape: resultShape, evolution } = require_shapeTypes.getKernel().generalTransformWithHistory(shape.wrapped, linear, translation, true, inputFaceHashes, require_constants.HASH_CODE_MAX);
-		const result = require_shapeTypes.castShape(resultShape);
+		const result = require_shapeTypes.castResultShape(resultShape);
 		propagateAllMetadata(evolution, [shape], result);
 		return require_errors.ok(result);
 	}
-	const result = require_shapeTypes.castShape(require_shapeTypes.getKernel().generalTransformNonOrthogonal(shape.wrapped, linear, translation));
+	const result = require_shapeTypes.castResultShape(require_shapeTypes.getKernel().generalTransformNonOrthogonal(shape.wrapped, linear, translation));
 	propagateMetadataByHash([shape], result);
 	return require_errors.ok(result);
 	/* v8 ignore stop */
@@ -661,7 +722,7 @@ function locate(shape, placement) {
 	const { trsf, cleanup } = composeTransforms("type" in placement ? [placement] : placement);
 	let moved;
 	try {
-		moved = require_shapeTypes.castShape(require_shapeTypes.getKernel().locate(shape.wrapped, trsf));
+		moved = require_shapeTypes.castResultShape(require_shapeTypes.getKernel().locate(shape.wrapped, trsf));
 	} finally {
 		cleanup();
 	}
@@ -675,7 +736,7 @@ function locate(shape, placement) {
 function transformCopy(shape, composed) {
 	const inputFaceHashes = collectInputFaceHashes([shape]);
 	const { shape: resultShape, evolution } = require_shapeTypes.getKernel().applyComposedTransformWithHistory(shape.wrapped, composed.trsf, inputFaceHashes, require_constants.HASH_CODE_MAX);
-	const result = require_shapeTypes.castShape(resultShape);
+	const result = require_shapeTypes.castResultShape(resultShape);
 	propagateAllMetadata(evolution, [shape], result);
 	return result;
 }

package/dist/shapeRef.cjs

@@ -1,5 +1,5 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const require_refResolveFns = require("./refResolveFns-Du0v4e3Y.cjs");
+const require_refResolveFns = require("./refResolveFns-DbTYd_Nj.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-NGXXyTBa.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-DL1zXF8u.js";
 export { assignRoles, captureHint, createDerivedFaceRef, createEdgeRef, createRef, createVertexRef, defaultScorer, isDerivedFaceRef, isEdgeRef, isFaceRef, isLineageRef, isVertexRef, resolveDerivedFaceRef, resolveEdgeRef, resolveLineageRef, resolveRef, resolveRefIn, resolveRefParams, resolveVertexRef, updateRoles };