brepjs 18.113.0 → 18.115.0

package/dist/{healingFns-D00TPE9p.js → healingFns-2TJHHDg5.js}

@@ -1,6 +1,6 @@
-import { Z as getKernel, _ as isSolid, h as isShape3D, p as isFace, r as castShapeWithKnownType, t as castShape, y as isWire } from "./shapeTypes-Dpu6mD3m.js";
+import { Z as getKernel, _ as isSolid, h as isShape3D, p as isFace, t as castShape, y as isWire } from "./shapeTypes-Dpu6mD3m.js";
 import { A as ok, T as isOk, b as err, d as validationError, i as kernelError, l as typeCastError, t as BrepErrorCode, w as isErr } from "./errors-DNWJsfVU.js";
-import { c as getFaces, i as getCachedIsValid, l as getOrCreateCache, m as invalidateShapeCache, p as getWires, s as getEdges } from "./topologyQueryFns-BeKaWpNm.js";
+import { c as getFaces, i as getCachedIsValid, m as invalidateShapeCache, p as getWires, s as getEdges } from "./topologyQueryFns-BeKaWpNm.js";
 import { n as HASH_CODE_MAX } from "./constants-ITRzCnCp.js";
 import { v as downcast } from "./faceFns-B86WGqDg.js";
 import { g as collectInputFaceHashes, v as propagateAllMetadata } from "./shapeFns-DrZOVwHX.js";
@@ -155,249 +155,6 @@ function chamferDistAngle(shape, edges, distance, angleDeg) {
 	return ok(wrapped);
 }
 //#endregion
-//#region src/topology/adjacencyFns.ts
-/**
-* Topology adjacency queries — find related sub-shapes within a parent shape.
-*
-* Uses cached topology extraction and an edge→faces adjacency map
-* (built once per parent shape and cached) to avoid redundant WASM calls.
-*/
-function wrapAll(shapes, type) {
-	return shapes.map((s) => castShapeWithKnownType(s, type));
-}
-/**
-* Iterate sub-shapes of `parentKernel` of the given `type`, deduplicate by
-* 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.
-*/
-function deduplicatedSubShapes(parentKernel, type) {
-	const kernel = getKernel();
-	const items = kernel.iterShapes(parentKernel, type);
-	const results = [];
-	const seen = /* @__PURE__ */ new Map();
-	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);
-		}
-	}
-	return wrapAll(results, type);
-}
-/**
-* 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.
-*/
-function getEdgeToFacesMap(parent) {
-	const cache = getOrCreateCache(parent);
-	if (cache.edgeToFaces) return cache.edgeToFaces;
-	const kernel = getKernel();
-	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
-			});
-		}
-	}
-	cache.edgeToFaces = edgeToFaces;
-	return edgeToFaces;
-}
-/**
-* Build or retrieve the cached vertex→faces adjacency map for a parent shape —
-* the vertex analogue of {@link getEdgeToFacesMap}.
-*/
-function getVertexToFacesMap(parent) {
-	const cache = getOrCreateCache(parent);
-	if (cache.vertexToFaces) return cache.vertexToFaces;
-	const kernel = getKernel();
-	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);
-		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
-		});
-	}
-	cache.vertexToFaces = vertexToFaces;
-	return vertexToFaces;
-}
-/**
-* Get all faces adjacent to a given edge within a parent shape.
-*
-* An edge typically borders exactly two faces in a solid, or one face
-* if the edge is on a boundary.
-*
-* @param parent - The parent shape to search within.
-* @param edge - The edge whose adjacent faces to find.
-* @returns Array of unique faces containing the given edge.
-*/
-function facesOfEdge(parent, edge) {
-	const kernel = getKernel();
-	const edgeToFaces = getEdgeToFacesMap(parent);
-	const hash = kernel.hashCode(edge.wrapped, HASH_CODE_MAX);
-	const bucket = edgeToFaces.get(hash) ?? [];
-	const results = [];
-	const seen = /* @__PURE__ */ new Map();
-	for (const entry of bucket) {
-		if (!kernel.isSame(entry.edge, edge.wrapped)) continue;
-		const fHash = kernel.hashCode(entry.face, HASH_CODE_MAX);
-		const fBucket = seen.get(fHash);
-		if (!fBucket) {
-			seen.set(fHash, [entry.face]);
-			results.push(entry.face);
-		} else if (!fBucket.some((r) => kernel.isSame(r, entry.face))) {
-			fBucket.push(entry.face);
-			results.push(entry.face);
-		}
-	}
-	return wrapAll(results, "face");
-}
-/**
-* Get all faces meeting at a vertex (≥3 for a solid corner, fewer on a
-* boundary), via the cached vertex→faces map. The vertex equivalent of
-* {@link facesOfEdge}, with the same hash-bucket + isSame verification.
-*
-* @param parent - The parent shape to search within.
-* @param vertex - The vertex whose adjacent faces to find.
-*/
-function facesOfVertex(parent, vertex) {
-	const kernel = getKernel();
-	const vertexToFaces = getVertexToFacesMap(parent);
-	const hash = kernel.hashCode(vertex.wrapped, HASH_CODE_MAX);
-	const bucket = vertexToFaces.get(hash) ?? [];
-	const results = [];
-	const seen = /* @__PURE__ */ new Map();
-	for (const entry of bucket) {
-		if (!kernel.isSame(entry.vertex, vertex.wrapped)) continue;
-		const fHash = kernel.hashCode(entry.face, HASH_CODE_MAX);
-		const fBucket = seen.get(fHash);
-		if (!fBucket) {
-			seen.set(fHash, [entry.face]);
-			results.push(entry.face);
-		} else if (!fBucket.some((r) => kernel.isSame(r, entry.face))) {
-			fBucket.push(entry.face);
-			results.push(entry.face);
-		}
-	}
-	return wrapAll(results, "face");
-}
-/**
-* Get all edges bounding a face.
-*
-* @param face - The face whose edges to enumerate.
-* @returns Array of unique edges forming the face boundary.
-*/
-function edgesOfFace(face) {
-	return deduplicatedSubShapes(face.wrapped, "edge");
-}
-/**
-* Get all vertices of a face. The vertex equivalent of {@link edgesOfFace}.
-*
-* @param face - The face whose vertices to enumerate.
-*/
-function verticesOfFace(face) {
-	return deduplicatedSubShapes(face.wrapped, "vertex");
-}
-/**
-* Get all wires of a face (outer wire + inner hole wires).
-* All wires bounding a face are closed by definition.
-*
-* @param face - The face whose wires to enumerate.
-*/
-function wiresOfFace(face) {
-	return deduplicatedSubShapes(face.wrapped, "wire");
-}
-/**
-* Get the start and end vertices of an edge.
-*
-* @param edge - The edge whose vertices to retrieve.
-* @returns Array of 1-2 vertices (1 if degenerate/closed, 2 otherwise).
-*/
-function verticesOfEdge(edge) {
-	return deduplicatedSubShapes(edge.wrapped, "vertex");
-}
-/**
-* Get all faces that share at least one edge with the given face.
-*
-* The returned list does not include the input face itself.
-* Uses the cached edge→faces adjacency map for the parent shape.
-*
-* @param parent - The parent shape to search within.
-* @param face - The face whose neighbors to find.
-* @returns Array of unique adjacent faces (excluding the input face).
-*/
-function adjacentFaces(parent, face) {
-	const kernel = getKernel();
-	const edgeToFaces = getEdgeToFacesMap(parent);
-	const faceEdgeHandles = deduplicatedSubShapes(face.wrapped, "edge");
-	const neighborRaw = [];
-	const seen = /* @__PURE__ */ new Map();
-	for (const edgeHandle of faceEdgeHandles) {
-		const hash = kernel.hashCode(edgeHandle.wrapped, HASH_CODE_MAX);
-		const entries = edgeToFaces.get(hash) ?? [];
-		for (const entry of entries) {
-			if (kernel.isSame(entry.face, face.wrapped)) continue;
-			const fHash = kernel.hashCode(entry.face, HASH_CODE_MAX);
-			const bucket = seen.get(fHash);
-			if (!bucket) {
-				seen.set(fHash, [entry.face]);
-				neighborRaw.push(entry.face);
-			} else if (!bucket.some((r) => kernel.isSame(r, entry.face))) {
-				bucket.push(entry.face);
-				neighborRaw.push(entry.face);
-			}
-		}
-	}
-	return wrapAll(neighborRaw, "face");
-}
-/**
-* Get all edges shared between two faces.
-*
-* @param face1 - The first face.
-* @param face2 - The second face.
-* @returns Array of edges present in both faces (via isSame comparison).
-*/
-function sharedEdges(face1, face2) {
-	const kernel = getKernel();
-	const edges1 = kernel.iterShapes(face1.wrapped, "edge");
-	const edges2 = kernel.iterShapes(face2.wrapped, "edge");
-	const edge2Map = /* @__PURE__ */ new Map();
-	for (const e2 of edges2) {
-		const hash = kernel.hashCode(e2, HASH_CODE_MAX);
-		let bucket = edge2Map.get(hash);
-		if (!bucket) {
-			bucket = [];
-			edge2Map.set(hash, bucket);
-		}
-		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");
-}
-//#endregion
 //#region src/topology/nurbsFns.ts
 /**
 * Extract NURBS data from a BSpline or Bezier edge.
@@ -1437,4 +1194,4 @@ function fixSelfIntersection(wire) {
 	}
 }
 //#endregion
-export { edgesOfFace as A, toLODGeometryData as B, shellWithEvolution as C, getNurbsCurveData as D, fuseAllBisect as E, verticesOfFace as F, toLineGeometryData as H, wiresOfFace as I, chamferDistAngle as L, facesOfVertex as M, sharedEdges as N, getNurbsSurfaceData as O, verticesOfEdge as P, toBufferGeometryData as R, intersectWithEvolution as S, cutAllBisect as T, toLODGeometryLevels as V, positionOnCurve as _, healFace as a, filletWithEvolution as b, isValid as c, draft as d, fillet as f, variableFillet as g, thicken as h, heal as i, facesOfEdge as j, adjacentFaces as k, solidFromShell as l, shell as m, fixSelfIntersection as n, healSolid as o, offset as p, fixShape as r, healWire as s, autoHeal as t, chamfer as u, chamferWithEvolution as v, checkBoolean as w, fuseWithEvolution as x, cutWithEvolution as y, toGroupedBufferGeometryData as z };
+export { toBufferGeometryData as A, shellWithEvolution as C, getNurbsCurveData as D, fuseAllBisect as E, toLODGeometryData as M, toLODGeometryLevels as N, getNurbsSurfaceData as O, toLineGeometryData as P, intersectWithEvolution as S, cutAllBisect as T, positionOnCurve as _, healFace as a, filletWithEvolution as b, isValid as c, draft as d, fillet as f, variableFillet as g, thicken as h, heal as i, toGroupedBufferGeometryData as j, chamferDistAngle as k, solidFromShell as l, shell as m, fixSelfIntersection as n, healSolid as o, offset as p, fixShape as r, healWire as s, autoHeal as t, chamfer as u, chamferWithEvolution as v, checkBoolean as w, fuseWithEvolution as x, cutWithEvolution as y };

package/dist/{healingFns-x1sHV-HO.cjs → healingFns-xLJ6Cp_O.cjs}

@@ -155,249 +155,6 @@ function chamferDistAngle(shape, edges, distance, angleDeg) {
 	return require_errors.ok(wrapped);
 }
 //#endregion
-//#region src/topology/adjacencyFns.ts
-/**
-* Topology adjacency queries — find related sub-shapes within a parent shape.
-*
-* Uses cached topology extraction and an edge→faces adjacency map
-* (built once per parent shape and cached) to avoid redundant WASM calls.
-*/
-function wrapAll(shapes, type) {
-	return shapes.map((s) => require_shapeTypes.castShapeWithKnownType(s, type));
-}
-/**
-* Iterate sub-shapes of `parentKernel` of the given `type`, deduplicate by
-* 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.
-*/
-function deduplicatedSubShapes(parentKernel, type) {
-	const kernel = require_shapeTypes.getKernel();
-	const items = kernel.iterShapes(parentKernel, type);
-	const results = [];
-	const seen = /* @__PURE__ */ new Map();
-	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);
-		}
-	}
-	return wrapAll(results, type);
-}
-/**
-* 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.
-*/
-function getEdgeToFacesMap(parent) {
-	const cache = require_topologyQueryFns.getOrCreateCache(parent);
-	if (cache.edgeToFaces) return cache.edgeToFaces;
-	const kernel = require_shapeTypes.getKernel();
-	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
-			});
-		}
-	}
-	cache.edgeToFaces = edgeToFaces;
-	return edgeToFaces;
-}
-/**
-* Build or retrieve the cached vertex→faces adjacency map for a parent shape —
-* the vertex analogue of {@link getEdgeToFacesMap}.
-*/
-function getVertexToFacesMap(parent) {
-	const cache = require_topologyQueryFns.getOrCreateCache(parent);
-	if (cache.vertexToFaces) return cache.vertexToFaces;
-	const kernel = require_shapeTypes.getKernel();
-	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);
-		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
-		});
-	}
-	cache.vertexToFaces = vertexToFaces;
-	return vertexToFaces;
-}
-/**
-* Get all faces adjacent to a given edge within a parent shape.
-*
-* An edge typically borders exactly two faces in a solid, or one face
-* if the edge is on a boundary.
-*
-* @param parent - The parent shape to search within.
-* @param edge - The edge whose adjacent faces to find.
-* @returns Array of unique faces containing the given edge.
-*/
-function facesOfEdge(parent, edge) {
-	const kernel = require_shapeTypes.getKernel();
-	const edgeToFaces = getEdgeToFacesMap(parent);
-	const hash = kernel.hashCode(edge.wrapped, require_constants.HASH_CODE_MAX);
-	const bucket = edgeToFaces.get(hash) ?? [];
-	const results = [];
-	const seen = /* @__PURE__ */ new Map();
-	for (const entry of bucket) {
-		if (!kernel.isSame(entry.edge, edge.wrapped)) continue;
-		const fHash = kernel.hashCode(entry.face, require_constants.HASH_CODE_MAX);
-		const fBucket = seen.get(fHash);
-		if (!fBucket) {
-			seen.set(fHash, [entry.face]);
-			results.push(entry.face);
-		} else if (!fBucket.some((r) => kernel.isSame(r, entry.face))) {
-			fBucket.push(entry.face);
-			results.push(entry.face);
-		}
-	}
-	return wrapAll(results, "face");
-}
-/**
-* Get all faces meeting at a vertex (≥3 for a solid corner, fewer on a
-* boundary), via the cached vertex→faces map. The vertex equivalent of
-* {@link facesOfEdge}, with the same hash-bucket + isSame verification.
-*
-* @param parent - The parent shape to search within.
-* @param vertex - The vertex whose adjacent faces to find.
-*/
-function facesOfVertex(parent, vertex) {
-	const kernel = require_shapeTypes.getKernel();
-	const vertexToFaces = getVertexToFacesMap(parent);
-	const hash = kernel.hashCode(vertex.wrapped, require_constants.HASH_CODE_MAX);
-	const bucket = vertexToFaces.get(hash) ?? [];
-	const results = [];
-	const seen = /* @__PURE__ */ new Map();
-	for (const entry of bucket) {
-		if (!kernel.isSame(entry.vertex, vertex.wrapped)) continue;
-		const fHash = kernel.hashCode(entry.face, require_constants.HASH_CODE_MAX);
-		const fBucket = seen.get(fHash);
-		if (!fBucket) {
-			seen.set(fHash, [entry.face]);
-			results.push(entry.face);
-		} else if (!fBucket.some((r) => kernel.isSame(r, entry.face))) {
-			fBucket.push(entry.face);
-			results.push(entry.face);
-		}
-	}
-	return wrapAll(results, "face");
-}
-/**
-* Get all edges bounding a face.
-*
-* @param face - The face whose edges to enumerate.
-* @returns Array of unique edges forming the face boundary.
-*/
-function edgesOfFace(face) {
-	return deduplicatedSubShapes(face.wrapped, "edge");
-}
-/**
-* Get all vertices of a face. The vertex equivalent of {@link edgesOfFace}.
-*
-* @param face - The face whose vertices to enumerate.
-*/
-function verticesOfFace(face) {
-	return deduplicatedSubShapes(face.wrapped, "vertex");
-}
-/**
-* Get all wires of a face (outer wire + inner hole wires).
-* All wires bounding a face are closed by definition.
-*
-* @param face - The face whose wires to enumerate.
-*/
-function wiresOfFace(face) {
-	return deduplicatedSubShapes(face.wrapped, "wire");
-}
-/**
-* Get the start and end vertices of an edge.
-*
-* @param edge - The edge whose vertices to retrieve.
-* @returns Array of 1-2 vertices (1 if degenerate/closed, 2 otherwise).
-*/
-function verticesOfEdge(edge) {
-	return deduplicatedSubShapes(edge.wrapped, "vertex");
-}
-/**
-* Get all faces that share at least one edge with the given face.
-*
-* The returned list does not include the input face itself.
-* Uses the cached edge→faces adjacency map for the parent shape.
-*
-* @param parent - The parent shape to search within.
-* @param face - The face whose neighbors to find.
-* @returns Array of unique adjacent faces (excluding the input face).
-*/
-function adjacentFaces(parent, face) {
-	const kernel = require_shapeTypes.getKernel();
-	const edgeToFaces = getEdgeToFacesMap(parent);
-	const faceEdgeHandles = deduplicatedSubShapes(face.wrapped, "edge");
-	const neighborRaw = [];
-	const seen = /* @__PURE__ */ new Map();
-	for (const edgeHandle of faceEdgeHandles) {
-		const hash = kernel.hashCode(edgeHandle.wrapped, require_constants.HASH_CODE_MAX);
-		const entries = edgeToFaces.get(hash) ?? [];
-		for (const entry of entries) {
-			if (kernel.isSame(entry.face, face.wrapped)) continue;
-			const fHash = kernel.hashCode(entry.face, require_constants.HASH_CODE_MAX);
-			const bucket = seen.get(fHash);
-			if (!bucket) {
-				seen.set(fHash, [entry.face]);
-				neighborRaw.push(entry.face);
-			} else if (!bucket.some((r) => kernel.isSame(r, entry.face))) {
-				bucket.push(entry.face);
-				neighborRaw.push(entry.face);
-			}
-		}
-	}
-	return wrapAll(neighborRaw, "face");
-}
-/**
-* Get all edges shared between two faces.
-*
-* @param face1 - The first face.
-* @param face2 - The second face.
-* @returns Array of edges present in both faces (via isSame comparison).
-*/
-function sharedEdges(face1, face2) {
-	const kernel = require_shapeTypes.getKernel();
-	const edges1 = kernel.iterShapes(face1.wrapped, "edge");
-	const edges2 = kernel.iterShapes(face2.wrapped, "edge");
-	const edge2Map = /* @__PURE__ */ new Map();
-	for (const e2 of edges2) {
-		const hash = kernel.hashCode(e2, require_constants.HASH_CODE_MAX);
-		let bucket = edge2Map.get(hash);
-		if (!bucket) {
-			bucket = [];
-			edge2Map.set(hash, bucket);
-		}
-		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");
-}
-//#endregion
 //#region src/topology/nurbsFns.ts
 /**
 * Extract NURBS data from a BSpline or Bezier edge.
@@ -1437,12 +1194,6 @@ function fixSelfIntersection(wire) {
 	}
 }
 //#endregion
-Object.defineProperty(exports, "adjacentFaces", {
-	enumerable: true,
-	get: function() {
-		return adjacentFaces;
-	}
-});
 Object.defineProperty(exports, "autoHeal", {
 	enumerable: true,
 	get: function() {
@@ -1491,24 +1242,6 @@ Object.defineProperty(exports, "draft", {
 		return draft;
 	}
 });
-Object.defineProperty(exports, "edgesOfFace", {
-	enumerable: true,
-	get: function() {
-		return edgesOfFace;
-	}
-});
-Object.defineProperty(exports, "facesOfEdge", {
-	enumerable: true,
-	get: function() {
-		return facesOfEdge;
-	}
-});
-Object.defineProperty(exports, "facesOfVertex", {
-	enumerable: true,
-	get: function() {
-		return facesOfVertex;
-	}
-});
 Object.defineProperty(exports, "fillet", {
 	enumerable: true,
 	get: function() {
@@ -1605,12 +1338,6 @@ Object.defineProperty(exports, "positionOnCurve", {
 		return positionOnCurve;
 	}
 });
-Object.defineProperty(exports, "sharedEdges", {
-	enumerable: true,
-	get: function() {
-		return sharedEdges;
-	}
-});
 Object.defineProperty(exports, "shell", {
 	enumerable: true,
 	get: function() {
@@ -1671,21 +1398,3 @@ Object.defineProperty(exports, "variableFillet", {
 		return variableFillet;
 	}
 });
-Object.defineProperty(exports, "verticesOfEdge", {
-	enumerable: true,
-	get: function() {
-		return verticesOfEdge;
-	}
-});
-Object.defineProperty(exports, "verticesOfFace", {
-	enumerable: true,
-	get: function() {
-		return verticesOfFace;
-	}
-});
-Object.defineProperty(exports, "wiresOfFace", {
-	enumerable: true,
-	get: function() {
-		return wiresOfFace;
-	}
-});

package/dist/index.d.ts

@@ -102,8 +102,8 @@ export { checkBoolean } from './topology/booleanDiagnosticFns.js';
 export type { CheckBooleanResult, BooleanIssue, BooleanOpType, BooleanDiagnostics, } from './kernel/types.js';
 export { fuseWithEvolution, cutWithEvolution, intersectWithEvolution, filletWithEvolution, chamferWithEvolution, shellWithEvolution, type EvolutionResult, } from './topology/evolutionFns.js';
 export type { ShapeEvolution } from './kernel/types.js';
-export { captureHint, assignRoles, createRef, updateRoles, resolveRef, defaultScorer, createEdgeRef, resolveEdgeRef, createVertexRef, resolveVertexRef, createDerivedFaceRef, resolveDerivedFaceRef, } from './topology/shapeRef/index.js';
-export type { GeometricHint, ShapeRef, RoleTable, ResolvedRef, BrokenRef, FaceScorer, EdgeHint, EdgeRef, ResolvedEdgeRef, BrokenEdgeRef, VertexHint, VertexRef, ResolvedVertexRef, BrokenVertexRef, DerivedFaceHint, DerivedFaceRef, ResolvedDerivedFaceRef, BrokenDerivedFaceRef, } from './topology/shapeRef/index.js';
+export { captureHint, assignRoles, createRef, updateRoles, resolveRef, defaultScorer, createEdgeRef, resolveEdgeRef, createVertexRef, resolveVertexRef, createDerivedFaceRef, resolveDerivedFaceRef, isLineageRef, isFaceRef, isEdgeRef, isVertexRef, isDerivedFaceRef, resolveLineageRef, resolveRefIn, resolveRefParams, } from './topology/shapeRef/index.js';
+export type { GeometricHint, ShapeRef, RoleTable, ResolvedRef, BrokenRef, FaceScorer, EdgeHint, EdgeRef, ResolvedEdgeRef, BrokenEdgeRef, VertexHint, VertexRef, ResolvedVertexRef, BrokenVertexRef, DerivedFaceHint, DerivedFaceRef, ResolvedDerivedFaceRef, BrokenDerivedFaceRef, LineageRef, ResolvedEntity, BrokenReason, LineageResolution, } from './topology/shapeRef/index.js';
 export { surfaceFromGrid, surfaceFromImage, type SurfaceFromGridOptions, type SurfaceFromImageOptions, } from './topology/surfaceFns.js';
 export { hull, type HullOptions } from './topology/hullFns.js';
 export { convexHull } from './operations/convexHullFns.js';