@faicad/faijs 0.13.0

package/dist/vendored/brepjs/text/textMetrics.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"textMetrics.js","sourceRoot":"","sources":["../../../../src/vendored/brepjs/text/textMetrics.ts"],"names":[],"mappings":"AAAA,OAAO,EAAe,EAAE,EAAE,GAAG,EAAE,MAAM,mBAAmB,CAAC;AACzD,OAAO,EAAE,eAAe,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AACnE,OAAO,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AAwB5C;;;;GAIG;AACH,MAAM,UAAU,WAAW,CACzB,IAAY,EACZ,OAAoD;IAEpD,MAAM,QAAQ,GAAG,OAAO,EAAE,QAAQ,IAAI,CAAC,CAAC;IACxC,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;IAC1C,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,OAAO,GAAG,CACR,eAAe,CACb,aAAa,CAAC,cAAc,EAC5B,wCAAwC,EACxC,SAAS,EACT,SAAS,EACT,0DAA0D,CAC3D,CACF,CAAC;IACJ,CAAC;IAED,MAAM,KAAK,GAAG,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IACnD,MAAM,KAAK,GAAG,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC;IACzC,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;IACvC,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;IAEzC,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,GAAG,SAAS,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,CAAC;AAC1E,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,WAAW,CAAC,OAG3B;IACC,MAAM,QAAQ,GAAG,OAAO,EAAE,QAAQ,IAAI,CAAC,CAAC;IACxC,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;IAC1C,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,OAAO,GAAG,CACR,eAAe,CACb,aAAa,CAAC,cAAc,EAC5B,wCAAwC,EACxC,SAAS,EACT,SAAS,EACT,0DAA0D,CAC3D,CACF,CAAC;IACJ,CAAC;IAED,MAAM,KAAK,GAAG,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC;IACzC,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;IACvC,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;IACzC,MAAM,OAAO,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,EAAE,YAAY,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC;IAE9D,OAAO,EAAE,CAAC;QACR,QAAQ;QACR,SAAS;QACT,UAAU,EAAE,IAAI,CAAC,UAAU;QAC3B,UAAU,EAAE,QAAQ,GAAG,SAAS,GAAG,OAAO;KAC3C,CAAC,CAAC;AACL,CAAC","sourcesContent":["import { type Result, ok, err } from '../core/result.js';\nimport { validationError, BrepErrorCode } from '../core/errors.js';\nimport { getFont } from './fontRegistry.js';\n\nexport interface TextMetricsResult {\n  /** Total advance width of the text string. */\n  width: number;\n  /** Height from descender to ascender. */\n  height: number;\n  /** Distance from baseline to top of tallest glyph (positive). */\n  ascender: number;\n  /** Distance from baseline to bottom of lowest glyph (negative). */\n  descender: number;\n}\n\nexport interface FontMetricsResult {\n  /** Ascender in font units scaled to fontSize. */\n  ascender: number;\n  /** Descender in font units scaled to fontSize (negative). */\n  descender: number;\n  /** Units per em of the font. */\n  unitsPerEm: number;\n  /** Total line height (ascender - descender + line gap). */\n  lineHeight: number;\n}\n\n/**\n * Measure the dimensions of a text string without generating geometry.\n *\n * Requires a font to be loaded via {@link loadFont} first.\n */\nexport function textMetrics(\n  text: string,\n  options?: { fontSize?: number; fontFamily?: string }\n): Result<TextMetricsResult> {\n  const fontSize = options?.fontSize ?? 1;\n  const font = getFont(options?.fontFamily);\n  if (!font) {\n    return err(\n      validationError(\n        BrepErrorCode.NO_FONT_LOADED,\n        'No font loaded. Call loadFont() first.',\n        undefined,\n        undefined,\n        'Load a font with loadFont() before calling textMetrics()'\n      )\n    );\n  }\n\n  const width = font.getAdvanceWidth(text, fontSize);\n  const scale = fontSize / font.unitsPerEm;\n  const ascender = font.ascender * scale;\n  const descender = font.descender * scale;\n\n  return ok({ width, height: ascender - descender, ascender, descender });\n}\n\n/**\n * Retrieve font-level metrics without referencing specific text.\n *\n * Requires a font to be loaded via {@link loadFont} first.\n */\nexport function fontMetrics(options?: {\n  fontSize?: number;\n  fontFamily?: string;\n}): Result<FontMetricsResult> {\n  const fontSize = options?.fontSize ?? 1;\n  const font = getFont(options?.fontFamily);\n  if (!font) {\n    return err(\n      validationError(\n        BrepErrorCode.NO_FONT_LOADED,\n        'No font loaded. Call loadFont() first.',\n        undefined,\n        undefined,\n        'Load a font with loadFont() before calling fontMetrics()'\n      )\n    );\n  }\n\n  const scale = fontSize / font.unitsPerEm;\n  const ascender = font.ascender * scale;\n  const descender = font.descender * scale;\n  const lineGap = (font.tables?.os2?.sTypoLineGap ?? 0) * scale;\n\n  return ok({\n    ascender,\n    descender,\n    unitsPerEm: font.unitsPerEm,\n    lineHeight: ascender - descender + lineGap,\n  });\n}\n"]}

package/dist/vendored/brepjs/text.d.ts

@@ -0,0 +1,13 @@
+/**
+ * brepjs/text — Font loading and text-to-geometry conversion.
+ *
+ * @example
+ * ```typescript
+ * import { loadFont, sketchText } from 'brepjs/text';
+ * ```
+ */
+export { loadFont, getFont } from './text/fontRegistry.js';
+export { textBlueprints } from './text/textBlueprints.js';
+export { sketchText } from './text/sketchText.js';
+export { textMetrics, fontMetrics, type TextMetricsResult, type FontMetricsResult, } from './text/textMetrics.js';
+//# sourceMappingURL=text.d.ts.map

package/dist/vendored/brepjs/text.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"text.d.ts","sourceRoot":"","sources":["../../../src/vendored/brepjs/text.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AAC3D,OAAO,EAAE,cAAc,EAAE,MAAM,0BAA0B,CAAC;AAC1D,OAAO,EAAE,UAAU,EAAE,MAAM,sBAAsB,CAAC;AAClD,OAAO,EACL,WAAW,EACX,WAAW,EACX,KAAK,iBAAiB,EACtB,KAAK,iBAAiB,GACvB,MAAM,uBAAuB,CAAC"}

package/dist/vendored/brepjs/text.js

@@ -0,0 +1,13 @@
+/**
+ * brepjs/text — Font loading and text-to-geometry conversion.
+ *
+ * @example
+ * ```typescript
+ * import { loadFont, sketchText } from 'brepjs/text';
+ * ```
+ */
+export { loadFont, getFont } from './text/fontRegistry.js';
+export { textBlueprints } from './text/textBlueprints.js';
+export { sketchText } from './text/sketchText.js';
+export { textMetrics, fontMetrics, } from './text/textMetrics.js';
+//# sourceMappingURL=text.js.map

package/dist/vendored/brepjs/text.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"text.js","sourceRoot":"","sources":["../../../src/vendored/brepjs/text.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AAC3D,OAAO,EAAE,cAAc,EAAE,MAAM,0BAA0B,CAAC;AAC1D,OAAO,EAAE,UAAU,EAAE,MAAM,sBAAsB,CAAC;AAClD,OAAO,EACL,WAAW,EACX,WAAW,GAGZ,MAAM,uBAAuB,CAAC","sourcesContent":["/**\n * brepjs/text — Font loading and text-to-geometry conversion.\n *\n * @example\n * ```typescript\n * import { loadFont, sketchText } from 'brepjs/text';\n * ```\n */\n\nexport { loadFont, getFont } from './text/fontRegistry.js';\nexport { textBlueprints } from './text/textBlueprints.js';\nexport { sketchText } from './text/sketchText.js';\nexport {\n  textMetrics,\n  fontMetrics,\n  type TextMetricsResult,\n  type FontMetricsResult,\n} from './text/textMetrics.js';\n"]}

package/dist/vendored/brepjs/topology/adjacencyFns.d.ts

@@ -0,0 +1,89 @@
+/**
+ * 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.
+ */
+import type { AnyShape, ClosedWire, Dimension, Edge, Face, Vertex } from '../core/shapeTypes.js';
+/**
+ * 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.
+ */
+export declare function facesOfEdge<D extends Dimension>(parent: AnyShape<D>, edge: Edge<D>): Face<D>[];
+/**
+ * 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.
+ */
+export declare function facesOfVertex<D extends Dimension>(parent: AnyShape<D>, vertex: Vertex<D>): Face<D>[];
+/**
+ * Get all edges bounding a face.
+ *
+ * @param face - The face whose edges to enumerate.
+ * @returns Array of unique edges forming the face boundary.
+ */
+export declare function edgesOfFace<D extends Dimension>(face: Face<D>): Edge<D>[];
+/**
+ * Get all vertices of a face. The vertex equivalent of {@link edgesOfFace}.
+ *
+ * @param face - The face whose vertices to enumerate.
+ */
+export declare function verticesOfFace<D extends Dimension>(face: Face<D>): Vertex<D>[];
+/**
+ * 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.
+ */
+export declare function wiresOfFace<D extends Dimension>(face: Face<D>): ClosedWire<D>[];
+/**
+ * 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).
+ */
+export declare function verticesOfEdge<D extends Dimension>(edge: Edge<D>): Vertex<D>[];
+/**
+ * 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).
+ */
+export declare function adjacentFaces<D extends Dimension>(parent: AnyShape<D>, face: Face<D>): Face<D>[];
+/**
+ * Get all edges shared between two faces.
+ *
+ * Prefers the kernel's native `sharedEdges` (computed from its internal
+ * edge-to-face adjacency) and falls back to {@link sharedEdgesJS} on kernels
+ * that don't implement it. Both return fresh, caller-owned edge handles.
+ *
+ * @param face1 - The first face.
+ * @param face2 - The second face.
+ * @returns Array of edges present in both faces (via isSame comparison).
+ */
+export declare function sharedEdges<D extends Dimension>(face1: Face<D>, face2: Face<D>): Edge<D>[];
+/**
+ * Hashes of the faces adjacent to `face` within `parent`, keyed like the kernel's
+ * `hashCode(_, HASH_CODE_MAX)` (so they index the parent's cached faces).
+ *
+ * Prefers the kernel-native adjacency (occt-wasm/brepkit) — markedly faster than
+ * the borrowed JS edge-map path, which pays per-call edge extraction + hashing —
+ * and disposes the owned result handles here so none escape. Returns only hashes,
+ * keeping callers clear of the borrowed-vs-owned handle contract; falls back to
+ * the borrowed-view {@link adjacentFaces} where the native op is unsupported.
+ */
+export declare function adjacentFaceHashes<D extends Dimension>(parent: AnyShape<D>, face: Face<D>): number[];
+//# sourceMappingURL=adjacencyFns.d.ts.map

package/dist/vendored/brepjs/topology/adjacencyFns.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"adjacencyFns.d.ts","sourceRoot":"","sources":["../../../../src/vendored/brepjs/topology/adjacencyFns.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAKH,OAAO,KAAK,EAAE,QAAQ,EAAE,UAAU,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,uBAAuB,CAAC;AA4LjG;;;;;;;;;GASG;AACH,wBAAgB,WAAW,CAAC,CAAC,SAAS,SAAS,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE,CAwB9F;AAED;;;;;;;GAOG;AACH,wBAAgB,aAAa,CAAC,CAAC,SAAS,SAAS,EAC/C,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,EACnB,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,GAChB,IAAI,CAAC,CAAC,CAAC,EAAE,CAsBX;AAED;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,CAAC,SAAS,SAAS,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE,CAEzE;AAED;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,CAAC,SAAS,SAAS,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,CAE9E;AAED;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,CAAC,SAAS,SAAS,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,EAAE,CAE/E;AAED;;;;;GAKG;AACH,wBAAgB,cAAc,CAAC,CAAC,SAAS,SAAS,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,CAE9E;AAED;;;;;;;;;GASG;AACH,wBAAgB,aAAa,CAAC,CAAC,SAAS,SAAS,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE,CA8BhG;AASD;;;;;;;;;;GAUG;AACH,wBAAgB,WAAW,CAAC,CAAC,SAAS,SAAS,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE,CAqB1F;AAyCD;;;;;;;;;GASG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,SAAS,SAAS,EACpD,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,EACnB,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,GACZ,MAAM,EAAE,CAkBV"}

package/dist/vendored/brepjs/topology/adjacencyFns.js

@@ -0,0 +1,411 @@
+/**
+ * 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.
+ */
+import { getKernel, getActiveKernelId } from '../kernel/index.js';
+import { isUnsupportedKernelOperationError } from '../kernel/unsupported.js';
+import { castResultShapeWithKnownType, borrowShapeWithKnownType } from '../core/shapeTypes.js';
+import { HASH_CODE_MAX } from '../core/constants.js';
+import { getOrCreateCache, getFaces, getEdges, getVertices } from './topologyQueryFns.js';
+// ---------------------------------------------------------------------------
+// Internal helpers
+// ---------------------------------------------------------------------------
+/**
+ * Brand cache-owned raw sub-shapes (from the edge/face adjacency maps) as
+ * borrowed views. They must keep the cache slot's identity — the toponaming
+ * path compares the returned faces against the parent's topology via
+ * `isSame`/`sharedEdges` — so we cannot copy (a copy is a fresh TShape that
+ * matches nothing). And on occt-wasm >= 3.7.0 an identity `downcast` returns the
+ * SAME slot, so an owning handle here would let the caller's dispose free a slot
+ * the cache still points at. A borrowed handle preserves identity while leaving
+ * ownership (and disposal) with the cache — freed when the parent is disposed.
+ */
+function wrapAll(shapes, type) {
+    return shapes.map((s) => borrowShapeWithKnownType(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. 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();
+    const items = kernel.iterShapes(parentKernel, type);
+    const results = [];
+    // Store the branded downcast (its `.wrapped` shares the source TShape) for
+    // isSame dedup, so we can release the raw iterated slot immediately.
+    const seen = new Map();
+    for (const item of items) {
+        const hash = kernel.hashCode(item, HASH_CODE_MAX);
+        const bucket = seen.get(hash);
+        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 = 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 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 = new Map();
+    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}. 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 = new Map();
+    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, managedVertex.wrapped) &&
+                kernel.isSame(entry.face, face.wrapped))) {
+                bucket.push({ vertex: managedVertex.wrapped, face: face.wrapped });
+            }
+        }
+    }
+    cache.vertexToFaces = vertexToFaces;
+    return vertexToFaces;
+}
+// ---------------------------------------------------------------------------
+// Public API
+// ---------------------------------------------------------------------------
+/**
+ * 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.
+ */
+export 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) ?? [];
+    // Verify via isSame on the stored edge — no need to re-extract face edges.
+    // Dedup faces in case the same face appears with different edge instances.
+    const results = [];
+    const seen = 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.
+ */
+export 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 = 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.
+ */
+export 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.
+ */
+export 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.
+ */
+export 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).
+ */
+export 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).
+ */
+export function adjacentFaces(parent, face) {
+    const kernel = getKernel();
+    const edgeToFaces = getEdgeToFacesMap(parent);
+    // Deduplicate face edges to avoid redundant bucket lookups
+    const faceEdgeHandles = deduplicatedSubShapes(face.wrapped, 'edge');
+    const neighborRaw = [];
+    const seen = 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);
+            }
+        }
+    }
+    // faceEdgeHandles were extracted only to key into the map; release them.
+    // neighborRaw are cache-owned face handles — wrapAll copies, never consumes.
+    for (const e of faceEdgeHandles)
+        e[Symbol.dispose]();
+    return wrapAll(neighborRaw, 'face');
+}
+// Per-kernel memo of whether kernel.sharedEdges is a real implementation. occt-wasm
+// and brepkit compute shared edges natively (kernel-side edge-to-face map); the occt
+// (OpenCascade) adapter stubs it, and manifold has no exact topology of its own. We
+// probe once per kernel and fall back only for a marked UnsupportedKernelOperationError,
+// so a genuine geometry error still propagates instead of silently degrading to JS.
+const nativeSharedEdgesSupported = new Map();
+/**
+ * Get all edges shared between two faces.
+ *
+ * Prefers the kernel's native `sharedEdges` (computed from its internal
+ * edge-to-face adjacency) and falls back to {@link sharedEdgesJS} on kernels
+ * that don't implement it. Both return fresh, caller-owned edge handles.
+ *
+ * @param face1 - The first face.
+ * @param face2 - The second face.
+ * @returns Array of edges present in both faces (via isSame comparison).
+ */
+export function sharedEdges(face1, face2) {
+    const kernel = getKernel();
+    const kernelId = getActiveKernelId() ?? '';
+    if (nativeSharedEdgesSupported.get(kernelId) !== false) {
+        let raw;
+        try {
+            raw = kernel.sharedEdges(face1.wrapped, face2.wrapped);
+            const result = raw.map((e) => castResultShapeWithKnownType(e, 'edge'));
+            nativeSharedEdgesSupported.set(kernelId, true);
+            return result;
+        }
+        catch (e) {
+            // On a mid-map cast failure the native slots aren't all owned yet — release
+            // the whole batch so nothing leaks (dispose is idempotent for any the cast
+            // already adopted). Then classify: only fall back on the unsupported
+            // sentinels, else re-throw a genuine error.
+            if (raw)
+                for (const r of raw)
+                    kernel.dispose(r);
+            if (!isUnsupportedKernelOperationError(e))
+                throw e;
+            nativeSharedEdgesSupported.set(kernelId, false);
+        }
+    }
+    return sharedEdgesJS(face1, face2);
+}
+/** JS fallback for {@link sharedEdges}: match edges of both faces by hash + isSame. */
+function sharedEdgesJS(face1, face2) {
+    const kernel = getKernel();
+    const edges1 = kernel.iterShapes(face1.wrapped, 'edge');
+    const edges2 = kernel.iterShapes(face2.wrapped, 'edge');
+    // Build hash-bucket index of edges2 for O(1) average lookup instead of O(nxm) isSame scans
+    const edge2Map = 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);
+    }
+    // edges1/edges2 are fresh arena slots owned here: cast the matches (releasing
+    // their pre-downcast source) and release every other transient, so the query
+    // leaks nothing per call.
+    const shared = [];
+    for (const e1 of edges1) {
+        const bucket = edge2Map.get(kernel.hashCode(e1, HASH_CODE_MAX));
+        if (bucket?.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;
+}
+// Per-kernel memo of native kernel.adjacentFaces support (occt-wasm/brepkit native,
+// occt/manifold stub → JS fallback), mirroring nativeSharedEdgesSupported.
+const nativeAdjacentFacesSupported = new Map();
+/**
+ * Hashes of the faces adjacent to `face` within `parent`, keyed like the kernel's
+ * `hashCode(_, HASH_CODE_MAX)` (so they index the parent's cached faces).
+ *
+ * Prefers the kernel-native adjacency (occt-wasm/brepkit) — markedly faster than
+ * the borrowed JS edge-map path, which pays per-call edge extraction + hashing —
+ * and disposes the owned result handles here so none escape. Returns only hashes,
+ * keeping callers clear of the borrowed-vs-owned handle contract; falls back to
+ * the borrowed-view {@link adjacentFaces} where the native op is unsupported.
+ */
+export function adjacentFaceHashes(parent, face) {
+    const kernel = getKernel();
+    const kernelId = getActiveKernelId() ?? '';
+    if (nativeAdjacentFacesSupported.get(kernelId) !== false) {
+        try {
+            const raw = kernel.adjacentFaces(parent.wrapped, face.wrapped);
+            nativeAdjacentFacesSupported.set(kernelId, true);
+            try {
+                return raw.map((r) => kernel.hashCode(r, HASH_CODE_MAX));
+            }
+            finally {
+                for (const r of raw)
+                    kernel.dispose(r);
+            }
+        }
+        catch (e) {
+            if (!isUnsupportedKernelOperationError(e))
+                throw e;
+            nativeAdjacentFacesSupported.set(kernelId, false);
+        }
+    }
+    return adjacentFaces(parent, face).map((f) => kernel.hashCode(f.wrapped, HASH_CODE_MAX));
+}
+//# sourceMappingURL=adjacencyFns.js.map

package/dist/vendored/brepjs/topology/adjacencyFns.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"adjacencyFns.js","sourceRoot":"","sources":["../../../../src/vendored/brepjs/topology/adjacencyFns.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,SAAS,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AAClE,OAAO,EAAE,iCAAiC,EAAE,MAAM,0BAA0B,CAAC;AAG7E,OAAO,EAAE,4BAA4B,EAAE,wBAAwB,EAAE,MAAM,uBAAuB,CAAC;AAC/F,OAAO,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AACrD,OAAO,EAAE,gBAAgB,EAAE,QAAQ,EAAE,QAAQ,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AAE1F,8EAA8E;AAC9E,mBAAmB;AACnB,8EAA8E;AAE9E;;;;;;;;;GASG;AACH,SAAS,OAAO,CAAgC,MAAqB,EAAE,IAAe;IACpF,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,wBAAwB,CAAC,CAAC,EAAE,IAAI,CAAM,CAAC,CAAC;AACnE,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAS,qBAAqB,CAC5B,YAAyB,EACzB,IAAe;IAEf,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC;IAC3B,MAAM,KAAK,GAAG,MAAM,CAAC,UAAU,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;IAEpD,MAAM,OAAO,GAAQ,EAAE,CAAC;IACxB,2EAA2E;IAC3E,qEAAqE;IACrE,MAAM,IAAI,GAAG,IAAI,GAAG,EAAyB,CAAC;IAE9C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,MAAM,CAAC,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;QAClD,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC9B,IAAI,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC;YAChD,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YACrB,SAAS;QACX,CAAC;QACD,MAAM,MAAM,GAAG,4BAA4B,CAAC,IAAI,EAAE,IAAI,CAAM,CAAC;QAC7D,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrB,IAAI,MAAM;YAAE,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;;YACnC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;IACxC,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAQD,oEAAoE;AACpE,SAAS,WAAW,CAAgC,KAAmB;IACrE,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC;IAC3B,MAAM,KAAK,GAAG,IAAI,GAAG,EAAe,CAAC;IACrC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC;QAC1D,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAI,MAAM;YAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;YACzB,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;IAC/B,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,kFAAkF;AAClF,SAAS,WAAW,CAClB,KAAuB,EACvB,GAAgB,EAChB,IAAY;IAEZ,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC;IAC3B,OAAO,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC;AACrE,CAAC;AAED;;;;;;;;;GASG;AACH,SAAS,iBAAiB,CAAC,MAA2B;IACpD,MAAM,KAAK,GAAG,gBAAgB,CAAC,MAAM,CAAC,CAAC;IACvC,IAAI,KAAK,CAAC,WAAW;QAAE,OAAO,KAAK,CAAC,WAAW,CAAC;IAEhD,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC;IAC3B,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;IAC/B,MAAM,SAAS,GAAG,WAAW,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;IAChD,MAAM,WAAW,GAAG,IAAI,GAAG,EAA2B,CAAC;IAEvD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,EAAE,CAAC;YAC9D,MAAM,IAAI,GAAG,MAAM,CAAC,QAAQ,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC;YACrD,MAAM,WAAW,GAAG,WAAW,CAAC,SAAS,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;YAC1D,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;YACxB,IAAI,CAAC,WAAW;gBAAE,SAAS;YAC3B,IAAI,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACnC,IAAI,CAAC,MAAM,EAAE,CAAC;gBACZ,MAAM,GAAG,EAAE,CAAC;gBACZ,WAAW,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;YAChC,CAAC;YACD,IACE,CAAC,MAAM,CAAC,IAAI,CACV,CAAC,KAAK,EAAE,EAAE,CACR,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,WAAW,CAAC,OAAO,CAAC;gBAC9C,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,CAC1C,EACD,CAAC;gBACD,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;YACjE,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK,CAAC,WAAW,GAAG,WAAW,CAAC;IAChC,OAAO,WAAW,CAAC;AACrB,CAAC;AAQD;;;;GAIG;AACH,SAAS,mBAAmB,CAAC,MAA2B;IACtD,MAAM,KAAK,GAAG,gBAAgB,CAAC,MAAM,CAAC,CAAC;IACvC,IAAI,KAAK,CAAC,aAAa;QAAE,OAAO,KAAK,CAAC,aAAa,CAAC;IAEpD,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC;IAC3B,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;IAC/B,MAAM,WAAW,GAAG,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC;IACrD,MAAM,aAAa,GAAG,IAAI,GAAG,EAA6B,CAAC;IAE3D,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,MAAM,SAAS,IAAI,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,EAAE,CAAC;YAClE,MAAM,IAAI,GAAG,MAAM,CAAC,QAAQ,CAAC,SAAS,EAAE,aAAa,CAAC,CAAC;YACvD,MAAM,aAAa,GAAG,WAAW,CAAC,WAAW,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC;YAChE,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;YAC1B,IAAI,CAAC,aAAa;gBAAE,SAAS;YAC7B,IAAI,MAAM,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACrC,IAAI,CAAC,MAAM,EAAE,CAAC;gBACZ,MAAM,GAAG,EAAE,CAAC;gBACZ,aAAa,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;YAClC,CAAC;YACD,IACE,CAAC,MAAM,CAAC,IAAI,CACV,CAAC,KAAK,EAAE,EAAE,CACR,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,aAAa,CAAC,OAAO,CAAC;gBAClD,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,CAC1C,EACD,CAAC;gBACD,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,aAAa,CAAC,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;YACrE,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK,CAAC,aAAa,GAAG,aAAa,CAAC;IACpC,OAAO,aAAa,CAAC;AACvB,CAAC;AAED,8EAA8E;AAC9E,aAAa;AACb,8EAA8E;AAE9E;;;;;;;;;GASG;AACH,MAAM,UAAU,WAAW,CAAsB,MAAmB,EAAE,IAAa;IACjF,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC;IAC3B,MAAM,WAAW,GAAG,iBAAiB,CAAC,MAAM,CAAC,CAAC;IAC9C,MAAM,IAAI,GAAG,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC;IAC1D,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;IAE3C,2EAA2E;IAC3E,2EAA2E;IAC3E,MAAM,OAAO,GAAkB,EAAE,CAAC;IAClC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAyB,CAAC;IAC9C,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC;YAAE,SAAS;QACvD,MAAM,KAAK,GAAG,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;QACzD,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAChC,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;YAC9B,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC3B,CAAC;aAAM,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;YAC9D,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YACzB,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC3B,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAU,OAAO,EAAE,MAAM,CAAC,CAAC;AAC3C,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,aAAa,CAC3B,MAAmB,EACnB,MAAiB;IAEjB,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC;IAC3B,MAAM,aAAa,GAAG,mBAAmB,CAAC,MAAM,CAAC,CAAC;IAClD,MAAM,IAAI,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC;IAC5D,MAAM,MAAM,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;IAE7C,MAAM,OAAO,GAAkB,EAAE,CAAC;IAClC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAyB,CAAC;IAC9C,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,OAAO,CAAC;YAAE,SAAS;QAC3D,MAAM,KAAK,GAAG,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;QACzD,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAChC,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;YAC9B,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC3B,CAAC;aAAM,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;YAC9D,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YACzB,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC3B,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAU,OAAO,EAAE,MAAM,CAAC,CAAC;AAC3C,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,WAAW,CAAsB,IAAa;IAC5D,OAAO,qBAAqB,CAAU,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;AAC9D,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,cAAc,CAAsB,IAAa;IAC/D,OAAO,qBAAqB,CAAY,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;AAClE,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,WAAW,CAAsB,IAAa;IAC5D,OAAO,qBAAqB,CAAgB,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;AACpE,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,cAAc,CAAsB,IAAa;IAC/D,OAAO,qBAAqB,CAAY,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;AAClE,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,aAAa,CAAsB,MAAmB,EAAE,IAAa;IACnF,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC;IAC3B,MAAM,WAAW,GAAG,iBAAiB,CAAC,MAAM,CAAC,CAAC;IAE9C,2DAA2D;IAC3D,MAAM,eAAe,GAAG,qBAAqB,CAAU,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;IAC7E,MAAM,WAAW,GAAkB,EAAE,CAAC;IACtC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAyB,CAAC;IAE9C,KAAK,MAAM,UAAU,IAAI,eAAe,EAAE,CAAC;QACzC,MAAM,IAAI,GAAG,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC;QAChE,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QAC5C,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC;gBAAE,SAAS;YACtD,MAAM,KAAK,GAAG,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;YACzD,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAC/B,IAAI,CAAC,MAAM,EAAE,CAAC;gBACZ,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;gBAC9B,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAC/B,CAAC;iBAAM,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;gBAC7D,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBACxB,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAC/B,CAAC;QACH,CAAC;IACH,CAAC;IAED,yEAAyE;IACzE,6EAA6E;IAC7E,KAAK,MAAM,CAAC,IAAI,eAAe;QAAE,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;IACrD,OAAO,OAAO,CAAU,WAAW,EAAE,MAAM,CAAC,CAAC;AAC/C,CAAC;AAED,oFAAoF;AACpF,qFAAqF;AACrF,oFAAoF;AACpF,yFAAyF;AACzF,oFAAoF;AACpF,MAAM,0BAA0B,GAAG,IAAI,GAAG,EAAmB,CAAC;AAE9D;;;;;;;;;;GAUG;AACH,MAAM,UAAU,WAAW,CAAsB,KAAc,EAAE,KAAc;IAC7E,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC;IAC3B,MAAM,QAAQ,GAAG,iBAAiB,EAAE,IAAI,EAAE,CAAC;IAC3C,IAAI,0BAA0B,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,KAAK,EAAE,CAAC;QACvD,IAAI,GAA8B,CAAC;QACnC,IAAI,CAAC;YACH,GAAG,GAAG,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;YACvD,MAAM,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,4BAA4B,CAAC,CAAC,EAAE,MAAM,CAAY,CAAC,CAAC;YAClF,0BAA0B,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;YAC/C,OAAO,MAAM,CAAC;QAChB,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACX,4EAA4E;YAC5E,2EAA2E;YAC3E,qEAAqE;YACrE,4CAA4C;YAC5C,IAAI,GAAG;gBAAE,KAAK,MAAM,CAAC,IAAI,GAAG;oBAAE,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAChD,IAAI,CAAC,iCAAiC,CAAC,CAAC,CAAC;gBAAE,MAAM,CAAC,CAAC;YACnD,0BAA0B,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;QAClD,CAAC;IACH,CAAC;IACD,OAAO,aAAa,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;AACrC,CAAC;AAED,uFAAuF;AACvF,SAAS,aAAa,CAAsB,KAAc,EAAE,KAAc;IACxE,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC;IAC3B,MAAM,MAAM,GAAG,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;IACxD,MAAM,MAAM,GAAG,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;IAExD,2FAA2F;IAC3F,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAyB,CAAC;IAClD,KAAK,MAAM,EAAE,IAAI,MAAM,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,MAAM,CAAC,QAAQ,CAAC,EAAE,EAAE,aAAa,CAAC,CAAC;QAChD,IAAI,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAChC,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,MAAM,GAAG,EAAE,CAAC;YACZ,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAC7B,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAClB,CAAC;IAED,8EAA8E;IAC9E,6EAA6E;IAC7E,0BAA0B;IAC1B,MAAM,MAAM,GAAc,EAAE,CAAC;IAC7B,KAAK,MAAM,EAAE,IAAI,MAAM,EAAE,CAAC;QACxB,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,EAAE,aAAa,CAAC,CAAC,CAAC;QAChE,IAAI,MAAM,EAAE,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC;YAChD,MAAM,CAAC,IAAI,CAAC,4BAA4B,CAAC,EAAE,EAAE,MAAM,CAAY,CAAC,CAAC;QACnE,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACrB,CAAC;IACH,CAAC;IACD,KAAK,MAAM,EAAE,IAAI,MAAM;QAAE,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IAE5C,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,oFAAoF;AACpF,2EAA2E;AAC3E,MAAM,4BAA4B,GAAG,IAAI,GAAG,EAAmB,CAAC;AAEhE;;;;;;;;;GASG;AACH,MAAM,UAAU,kBAAkB,CAChC,MAAmB,EACnB,IAAa;IAEb,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC;IAC3B,MAAM,QAAQ,GAAG,iBAAiB,EAAE,IAAI,EAAE,CAAC;IAC3C,IAAI,4BAA4B,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,KAAK,EAAE,CAAC;QACzD,IAAI,CAAC;YACH,MAAM,GAAG,GAAG,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;YAC/D,4BAA4B,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;YACjD,IAAI,CAAC;gBACH,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC;YAC3D,CAAC;oBAAS,CAAC;gBACT,KAAK,MAAM,CAAC,IAAI,GAAG;oBAAE,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACzC,CAAC;QACH,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACX,IAAI,CAAC,iCAAiC,CAAC,CAAC,CAAC;gBAAE,MAAM,CAAC,CAAC;YACnD,4BAA4B,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;QACpD,CAAC;IACH,CAAC;IACD,OAAO,aAAa,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC,CAAC;AAC3F,CAAC","sourcesContent":["/**\n * Topology adjacency queries — find related sub-shapes within a parent shape.\n *\n * Uses cached topology extraction and an edge→faces adjacency map\n * (built once per parent shape and cached) to avoid redundant WASM calls.\n */\n\nimport { getKernel, getActiveKernelId } from '../kernel/index.js';\nimport { isUnsupportedKernelOperationError } from '../kernel/unsupported.js';\nimport type { KernelShape, ShapeType } from '../kernel/types.js';\nimport type { AnyShape, ClosedWire, Dimension, Edge, Face, Vertex } from '../core/shapeTypes.js';\nimport { castResultShapeWithKnownType, borrowShapeWithKnownType } from '../core/shapeTypes.js';\nimport { HASH_CODE_MAX } from '../core/constants.js';\nimport { getOrCreateCache, getFaces, getEdges, getVertices } from './topologyQueryFns.js';\n\n// ---------------------------------------------------------------------------\n// Internal helpers\n// ---------------------------------------------------------------------------\n\n/**\n * Brand cache-owned raw sub-shapes (from the edge/face adjacency maps) as\n * borrowed views. They must keep the cache slot's identity — the toponaming\n * path compares the returned faces against the parent's topology via\n * `isSame`/`sharedEdges` — so we cannot copy (a copy is a fresh TShape that\n * matches nothing). And on occt-wasm >= 3.7.0 an identity `downcast` returns the\n * SAME slot, so an owning handle here would let the caller's dispose free a slot\n * the cache still points at. A borrowed handle preserves identity while leaving\n * ownership (and disposal) with the cache — freed when the parent is disposed.\n */\nfunction wrapAll<T extends AnyShape<Dimension>>(shapes: KernelShape[], type: ShapeType): T[] {\n  return shapes.map((s) => borrowShapeWithKnownType(s, type) as T);\n}\n\n/**\n * Iterate sub-shapes of `parentKernel` of the given `type`, deduplicate by\n * hash+isSame, and return branded handles of type `T`.\n *\n * Used by edgesOfFace, wiresOfFace, and verticesOfEdge — all of which need\n * the same deduplicated-children pattern on a raw KernelShape. Each iterated\n * sub-shape is a fresh arena slot the caller owns: uniques are cast with\n * `castResultShapeWithKnownType` (releasing the orphaned pre-downcast source),\n * and duplicates are released outright — otherwise every call leaks one slot\n * per sub-shape on the occt-wasm arena kernel.\n */\nfunction deduplicatedSubShapes<T extends AnyShape<Dimension>>(\n  parentKernel: KernelShape,\n  type: ShapeType\n): T[] {\n  const kernel = getKernel();\n  const items = kernel.iterShapes(parentKernel, type);\n\n  const results: T[] = [];\n  // Store the branded downcast (its `.wrapped` shares the source TShape) for\n  // isSame dedup, so we can release the raw iterated slot immediately.\n  const seen = new Map<number, KernelShape[]>();\n\n  for (const item of items) {\n    const hash = kernel.hashCode(item, HASH_CODE_MAX);\n    const bucket = seen.get(hash);\n    if (bucket?.some((r) => kernel.isSame(r, item))) {\n      kernel.dispose(item);\n      continue;\n    }\n    const casted = castResultShapeWithKnownType(item, type) as T;\n    results.push(casted);\n    if (bucket) bucket.push(casted.wrapped);\n    else seen.set(hash, [casted.wrapped]);\n  }\n\n  return results;\n}\n\n/** Edge-face pair stored in the adjacency map. */\ninterface EdgeFaceEntry {\n  readonly edge: KernelShape;\n  readonly face: KernelShape;\n}\n\n/** Hash-index branded sub-shapes for isSame lookup by hash code. */\nfunction indexByHash<T extends AnyShape<Dimension>>(items: readonly T[]): Map<number, T[]> {\n  const kernel = getKernel();\n  const index = new Map<number, T[]>();\n  for (const item of items) {\n    const hash = kernel.hashCode(item.wrapped, HASH_CODE_MAX);\n    const bucket = index.get(hash);\n    if (bucket) bucket.push(item);\n    else index.set(hash, [item]);\n  }\n  return index;\n}\n\n/** The managed handle matching a raw sub-shape by hash + isSame, or undefined. */\nfunction findManaged<T extends AnyShape<Dimension>>(\n  index: Map<number, T[]>,\n  raw: KernelShape,\n  hash: number\n): T | undefined {\n  const kernel = getKernel();\n  return index.get(hash)?.find((m) => kernel.isSame(m.wrapped, raw));\n}\n\n/**\n * Build or retrieve the cached edge→faces adjacency map for a parent shape.\n * Maps edge hash codes to edge-face pairs, storing the edge alongside each\n * face so facesOfEdge can verify via isSame without re-extracting face edges.\n *\n * The stored handles are the parent's **managed** `getEdges`/`getFaces` handles\n * (owned by the topology cache), never fresh iterated slots — so the map holds\n * no arena slots of its own. The transient per-face edges used only for\n * matching are released immediately.\n */\nfunction getEdgeToFacesMap(parent: AnyShape<Dimension>): Map<number, EdgeFaceEntry[]> {\n  const cache = getOrCreateCache(parent);\n  if (cache.edgeToFaces) return cache.edgeToFaces;\n\n  const kernel = getKernel();\n  const faces = getFaces(parent);\n  const edgeIndex = indexByHash(getEdges(parent));\n  const edgeToFaces = new Map<number, EdgeFaceEntry[]>();\n\n  for (const face of faces) {\n    for (const rawEdge of kernel.iterShapes(face.wrapped, 'edge')) {\n      const hash = kernel.hashCode(rawEdge, HASH_CODE_MAX);\n      const managedEdge = findManaged(edgeIndex, rawEdge, hash);\n      kernel.dispose(rawEdge);\n      if (!managedEdge) continue;\n      let bucket = edgeToFaces.get(hash);\n      if (!bucket) {\n        bucket = [];\n        edgeToFaces.set(hash, bucket);\n      }\n      if (\n        !bucket.some(\n          (entry) =>\n            kernel.isSame(entry.edge, managedEdge.wrapped) &&\n            kernel.isSame(entry.face, face.wrapped)\n        )\n      ) {\n        bucket.push({ edge: managedEdge.wrapped, face: face.wrapped });\n      }\n    }\n  }\n\n  cache.edgeToFaces = edgeToFaces;\n  return edgeToFaces;\n}\n\n/** Vertex-face pair stored in the adjacency map. */\ninterface VertexFaceEntry {\n  readonly vertex: KernelShape;\n  readonly face: KernelShape;\n}\n\n/**\n * Build or retrieve the cached vertex→faces adjacency map for a parent shape —\n * the vertex analogue of {@link getEdgeToFacesMap}. Stores the parent's managed\n * `getVertices`/`getFaces` handles and releases the transient per-face vertices.\n */\nfunction getVertexToFacesMap(parent: AnyShape<Dimension>): Map<number, VertexFaceEntry[]> {\n  const cache = getOrCreateCache(parent);\n  if (cache.vertexToFaces) return cache.vertexToFaces;\n\n  const kernel = getKernel();\n  const faces = getFaces(parent);\n  const vertexIndex = indexByHash(getVertices(parent));\n  const vertexToFaces = new Map<number, VertexFaceEntry[]>();\n\n  for (const face of faces) {\n    for (const rawVertex of kernel.iterShapes(face.wrapped, 'vertex')) {\n      const hash = kernel.hashCode(rawVertex, HASH_CODE_MAX);\n      const managedVertex = findManaged(vertexIndex, rawVertex, hash);\n      kernel.dispose(rawVertex);\n      if (!managedVertex) continue;\n      let bucket = vertexToFaces.get(hash);\n      if (!bucket) {\n        bucket = [];\n        vertexToFaces.set(hash, bucket);\n      }\n      if (\n        !bucket.some(\n          (entry) =>\n            kernel.isSame(entry.vertex, managedVertex.wrapped) &&\n            kernel.isSame(entry.face, face.wrapped)\n        )\n      ) {\n        bucket.push({ vertex: managedVertex.wrapped, face: face.wrapped });\n      }\n    }\n  }\n\n  cache.vertexToFaces = vertexToFaces;\n  return vertexToFaces;\n}\n\n// ---------------------------------------------------------------------------\n// Public API\n// ---------------------------------------------------------------------------\n\n/**\n * Get all faces adjacent to a given edge within a parent shape.\n *\n * An edge typically borders exactly two faces in a solid, or one face\n * if the edge is on a boundary.\n *\n * @param parent - The parent shape to search within.\n * @param edge - The edge whose adjacent faces to find.\n * @returns Array of unique faces containing the given edge.\n */\nexport function facesOfEdge<D extends Dimension>(parent: AnyShape<D>, edge: Edge<D>): Face<D>[] {\n  const kernel = getKernel();\n  const edgeToFaces = getEdgeToFacesMap(parent);\n  const hash = kernel.hashCode(edge.wrapped, HASH_CODE_MAX);\n  const bucket = edgeToFaces.get(hash) ?? [];\n\n  // Verify via isSame on the stored edge — no need to re-extract face edges.\n  // Dedup faces in case the same face appears with different edge instances.\n  const results: KernelShape[] = [];\n  const seen = new Map<number, KernelShape[]>();\n  for (const entry of bucket) {\n    if (!kernel.isSame(entry.edge, edge.wrapped)) continue;\n    const fHash = kernel.hashCode(entry.face, HASH_CODE_MAX);\n    const fBucket = seen.get(fHash);\n    if (!fBucket) {\n      seen.set(fHash, [entry.face]);\n      results.push(entry.face);\n    } else if (!fBucket.some((r) => kernel.isSame(r, entry.face))) {\n      fBucket.push(entry.face);\n      results.push(entry.face);\n    }\n  }\n\n  return wrapAll<Face<D>>(results, 'face');\n}\n\n/**\n * Get all faces meeting at a vertex (≥3 for a solid corner, fewer on a\n * boundary), via the cached vertex→faces map. The vertex equivalent of\n * {@link facesOfEdge}, with the same hash-bucket + isSame verification.\n *\n * @param parent - The parent shape to search within.\n * @param vertex - The vertex whose adjacent faces to find.\n */\nexport function facesOfVertex<D extends Dimension>(\n  parent: AnyShape<D>,\n  vertex: Vertex<D>\n): Face<D>[] {\n  const kernel = getKernel();\n  const vertexToFaces = getVertexToFacesMap(parent);\n  const hash = kernel.hashCode(vertex.wrapped, HASH_CODE_MAX);\n  const bucket = vertexToFaces.get(hash) ?? [];\n\n  const results: KernelShape[] = [];\n  const seen = new Map<number, KernelShape[]>();\n  for (const entry of bucket) {\n    if (!kernel.isSame(entry.vertex, vertex.wrapped)) continue;\n    const fHash = kernel.hashCode(entry.face, HASH_CODE_MAX);\n    const fBucket = seen.get(fHash);\n    if (!fBucket) {\n      seen.set(fHash, [entry.face]);\n      results.push(entry.face);\n    } else if (!fBucket.some((r) => kernel.isSame(r, entry.face))) {\n      fBucket.push(entry.face);\n      results.push(entry.face);\n    }\n  }\n\n  return wrapAll<Face<D>>(results, 'face');\n}\n\n/**\n * Get all edges bounding a face.\n *\n * @param face - The face whose edges to enumerate.\n * @returns Array of unique edges forming the face boundary.\n */\nexport function edgesOfFace<D extends Dimension>(face: Face<D>): Edge<D>[] {\n  return deduplicatedSubShapes<Edge<D>>(face.wrapped, 'edge');\n}\n\n/**\n * Get all vertices of a face. The vertex equivalent of {@link edgesOfFace}.\n *\n * @param face - The face whose vertices to enumerate.\n */\nexport function verticesOfFace<D extends Dimension>(face: Face<D>): Vertex<D>[] {\n  return deduplicatedSubShapes<Vertex<D>>(face.wrapped, 'vertex');\n}\n\n/**\n * Get all wires of a face (outer wire + inner hole wires).\n * All wires bounding a face are closed by definition.\n *\n * @param face - The face whose wires to enumerate.\n */\nexport function wiresOfFace<D extends Dimension>(face: Face<D>): ClosedWire<D>[] {\n  return deduplicatedSubShapes<ClosedWire<D>>(face.wrapped, 'wire');\n}\n\n/**\n * Get the start and end vertices of an edge.\n *\n * @param edge - The edge whose vertices to retrieve.\n * @returns Array of 1-2 vertices (1 if degenerate/closed, 2 otherwise).\n */\nexport function verticesOfEdge<D extends Dimension>(edge: Edge<D>): Vertex<D>[] {\n  return deduplicatedSubShapes<Vertex<D>>(edge.wrapped, 'vertex');\n}\n\n/**\n * Get all faces that share at least one edge with the given face.\n *\n * The returned list does not include the input face itself.\n * Uses the cached edge→faces adjacency map for the parent shape.\n *\n * @param parent - The parent shape to search within.\n * @param face - The face whose neighbors to find.\n * @returns Array of unique adjacent faces (excluding the input face).\n */\nexport function adjacentFaces<D extends Dimension>(parent: AnyShape<D>, face: Face<D>): Face<D>[] {\n  const kernel = getKernel();\n  const edgeToFaces = getEdgeToFacesMap(parent);\n\n  // Deduplicate face edges to avoid redundant bucket lookups\n  const faceEdgeHandles = deduplicatedSubShapes<Edge<D>>(face.wrapped, 'edge');\n  const neighborRaw: KernelShape[] = [];\n  const seen = new Map<number, KernelShape[]>();\n\n  for (const edgeHandle of faceEdgeHandles) {\n    const hash = kernel.hashCode(edgeHandle.wrapped, HASH_CODE_MAX);\n    const entries = edgeToFaces.get(hash) ?? [];\n    for (const entry of entries) {\n      if (kernel.isSame(entry.face, face.wrapped)) continue;\n      const fHash = kernel.hashCode(entry.face, HASH_CODE_MAX);\n      const bucket = seen.get(fHash);\n      if (!bucket) {\n        seen.set(fHash, [entry.face]);\n        neighborRaw.push(entry.face);\n      } else if (!bucket.some((r) => kernel.isSame(r, entry.face))) {\n        bucket.push(entry.face);\n        neighborRaw.push(entry.face);\n      }\n    }\n  }\n\n  // faceEdgeHandles were extracted only to key into the map; release them.\n  // neighborRaw are cache-owned face handles — wrapAll copies, never consumes.\n  for (const e of faceEdgeHandles) e[Symbol.dispose]();\n  return wrapAll<Face<D>>(neighborRaw, 'face');\n}\n\n// Per-kernel memo of whether kernel.sharedEdges is a real implementation. occt-wasm\n// and brepkit compute shared edges natively (kernel-side edge-to-face map); the occt\n// (OpenCascade) adapter stubs it, and manifold has no exact topology of its own. We\n// probe once per kernel and fall back only for a marked UnsupportedKernelOperationError,\n// so a genuine geometry error still propagates instead of silently degrading to JS.\nconst nativeSharedEdgesSupported = new Map<string, boolean>();\n\n/**\n * Get all edges shared between two faces.\n *\n * Prefers the kernel's native `sharedEdges` (computed from its internal\n * edge-to-face adjacency) and falls back to {@link sharedEdgesJS} on kernels\n * that don't implement it. Both return fresh, caller-owned edge handles.\n *\n * @param face1 - The first face.\n * @param face2 - The second face.\n * @returns Array of edges present in both faces (via isSame comparison).\n */\nexport function sharedEdges<D extends Dimension>(face1: Face<D>, face2: Face<D>): Edge<D>[] {\n  const kernel = getKernel();\n  const kernelId = getActiveKernelId() ?? '';\n  if (nativeSharedEdgesSupported.get(kernelId) !== false) {\n    let raw: KernelShape[] | undefined;\n    try {\n      raw = kernel.sharedEdges(face1.wrapped, face2.wrapped);\n      const result = raw.map((e) => castResultShapeWithKnownType(e, 'edge') as Edge<D>);\n      nativeSharedEdgesSupported.set(kernelId, true);\n      return result;\n    } catch (e) {\n      // On a mid-map cast failure the native slots aren't all owned yet — release\n      // the whole batch so nothing leaks (dispose is idempotent for any the cast\n      // already adopted). Then classify: only fall back on the unsupported\n      // sentinels, else re-throw a genuine error.\n      if (raw) for (const r of raw) kernel.dispose(r);\n      if (!isUnsupportedKernelOperationError(e)) throw e;\n      nativeSharedEdgesSupported.set(kernelId, false);\n    }\n  }\n  return sharedEdgesJS(face1, face2);\n}\n\n/** JS fallback for {@link sharedEdges}: match edges of both faces by hash + isSame. */\nfunction sharedEdgesJS<D extends Dimension>(face1: Face<D>, face2: Face<D>): Edge<D>[] {\n  const kernel = getKernel();\n  const edges1 = kernel.iterShapes(face1.wrapped, 'edge');\n  const edges2 = kernel.iterShapes(face2.wrapped, 'edge');\n\n  // Build hash-bucket index of edges2 for O(1) average lookup instead of O(nxm) isSame scans\n  const edge2Map = new Map<number, KernelShape[]>();\n  for (const e2 of edges2) {\n    const hash = kernel.hashCode(e2, HASH_CODE_MAX);\n    let bucket = edge2Map.get(hash);\n    if (!bucket) {\n      bucket = [];\n      edge2Map.set(hash, bucket);\n    }\n    bucket.push(e2);\n  }\n\n  // edges1/edges2 are fresh arena slots owned here: cast the matches (releasing\n  // their pre-downcast source) and release every other transient, so the query\n  // leaks nothing per call.\n  const shared: Edge<D>[] = [];\n  for (const e1 of edges1) {\n    const bucket = edge2Map.get(kernel.hashCode(e1, HASH_CODE_MAX));\n    if (bucket?.some((e2) => kernel.isSame(e1, e2))) {\n      shared.push(castResultShapeWithKnownType(e1, 'edge') as Edge<D>);\n    } else {\n      kernel.dispose(e1);\n    }\n  }\n  for (const e2 of edges2) kernel.dispose(e2);\n\n  return shared;\n}\n\n// Per-kernel memo of native kernel.adjacentFaces support (occt-wasm/brepkit native,\n// occt/manifold stub → JS fallback), mirroring nativeSharedEdgesSupported.\nconst nativeAdjacentFacesSupported = new Map<string, boolean>();\n\n/**\n * Hashes of the faces adjacent to `face` within `parent`, keyed like the kernel's\n * `hashCode(_, HASH_CODE_MAX)` (so they index the parent's cached faces).\n *\n * Prefers the kernel-native adjacency (occt-wasm/brepkit) — markedly faster than\n * the borrowed JS edge-map path, which pays per-call edge extraction + hashing —\n * and disposes the owned result handles here so none escape. Returns only hashes,\n * keeping callers clear of the borrowed-vs-owned handle contract; falls back to\n * the borrowed-view {@link adjacentFaces} where the native op is unsupported.\n */\nexport function adjacentFaceHashes<D extends Dimension>(\n  parent: AnyShape<D>,\n  face: Face<D>\n): number[] {\n  const kernel = getKernel();\n  const kernelId = getActiveKernelId() ?? '';\n  if (nativeAdjacentFacesSupported.get(kernelId) !== false) {\n    try {\n      const raw = kernel.adjacentFaces(parent.wrapped, face.wrapped);\n      nativeAdjacentFacesSupported.set(kernelId, true);\n      try {\n        return raw.map((r) => kernel.hashCode(r, HASH_CODE_MAX));\n      } finally {\n        for (const r of raw) kernel.dispose(r);\n      }\n    } catch (e) {\n      if (!isUnsupportedKernelOperationError(e)) throw e;\n      nativeAdjacentFacesSupported.set(kernelId, false);\n    }\n  }\n  return adjacentFaces(parent, face).map((f) => kernel.hashCode(f.wrapped, HASH_CODE_MAX));\n}\n"]}