brepjs 12.8.2 → 12.9.1

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "brepjs",
-  "version": "12.8.2",
+  "version": "12.9.1",
   "description": "Web CAD library with pluggable geometry kernel",
   "keywords": [
     "cad",
@@ -194,7 +194,7 @@
     "@types/opentype.js": "1.3.9",
     "@vitest/coverage-v8": "4.0.18",
     "brepjs-opencascade": "*",
-    "brepkit-wasm": "1.1.0",
+    "brepkit-wasm": "2.1.0",
     "eslint": "10.0.3",
     "husky": "9.1.7",
     "knip": "5.86.0",
@@ -210,7 +210,7 @@
   },
   "peerDependencies": {
     "brepjs-opencascade": "^0.5.1 || ^0.6.0 || ^0.7.0 || ^0.8.0 || ^0.9.0 || ^0.10.0",
-    "brepkit-wasm": "^0.10.1 || ^1.0.0"
+    "brepkit-wasm": "^0.10.1 || ^1.0.0 || ^2.0.0"
   },
   "peerDependenciesMeta": {
     "brepjs-opencascade": {

package/dist/core/geometryHelpers.d.ts

@@ -1,30 +0,0 @@
-import { Plane, PlaneName, PlaneInput } from './planeTypes.js';
-import { PointInput } from './types.js';
-import { KernelType } from '../kernel/types.js';
-/**
- * Create or copy a {@link Plane}.
- *
- * When called with a `Plane` object, returns a shallow copy.
- * When called with a `PlaneName` string (or no arguments), resolves the named
- * plane with an optional origin offset.
- *
- * @param plane - A `Plane` object to copy, or a `PlaneName` string to resolve.
- * @param origin - Origin point or scalar offset along the plane normal.
- * @default plane `'XY'`
- */
-declare function makePlane(plane: Plane): Plane;
-declare function makePlane(plane?: PlaneName, origin?: PointInput | number): Plane;
-export { makePlane };
-/**
- * Mirror an kernel shape across a plane.
- *
- * The mirror plane can be specified as a `PlaneName`, a `Plane` object,
- * or a direction vector (used as the plane normal). Defaults to the YZ plane.
- *
- * @param shape - Raw kernel shape to mirror.
- * @param inputPlane - Mirror plane specification.
- * @param origin - Override origin for the mirror plane.
- * @returns A new mirrored kernel shape.
- */
-export declare function mirror(shape: KernelType, inputPlane?: PlaneInput | PointInput, origin?: PointInput): KernelType;
-//# sourceMappingURL=geometryHelpers.d.ts.map

package/dist/core/geometryHelpers.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"geometryHelpers.d.ts","sourceRoot":"","sources":["../../src/core/geometryHelpers.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAEpE,OAAO,KAAK,EAAQ,UAAU,EAAE,MAAM,YAAY,CAAC;AAEnD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAGrD;;;;;;;;;;GAUG;AACH,iBAAS,SAAS,CAAC,KAAK,EAAE,KAAK,GAAG,KAAK,CAAC;AACxC,iBAAS,SAAS,CAAC,KAAK,CAAC,EAAE,SAAS,EAAE,MAAM,CAAC,EAAE,UAAU,GAAG,MAAM,GAAG,KAAK,CAAC;AAU3E,OAAO,EAAE,SAAS,EAAE,CAAC;AAErB;;;;;;;;;;GAUG;AACH,wBAAgB,MAAM,CACpB,KAAK,EAAE,UAAU,EACjB,UAAU,CAAC,EAAE,UAAU,GAAG,UAAU,EACpC,MAAM,CAAC,EAAE,UAAU,GAClB,UAAU,CAgCZ"}

package/dist/core/memory.d.ts

@@ -1,6 +0,0 @@
-/**
- * Memory management utilities — re-export hub for disposal.ts.
- */
-export type { Deletable } from './disposal.js';
-export { createHandle, createKernelHandle, DisposalScope, withScope, withScopeResult, withScopeResultAsync, isLive, registerForCleanup, unregisterFromCleanup, type ShapeHandle, type KernelHandle, } from './disposal.js';
-//# sourceMappingURL=memory.d.ts.map

package/dist/core/memory.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"memory.d.ts","sourceRoot":"","sources":["../../src/core/memory.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,YAAY,EAAE,SAAS,EAAE,MAAM,eAAe,CAAC;AAC/C,OAAO,EACL,YAAY,EACZ,kBAAkB,EAClB,aAAa,EACb,SAAS,EACT,eAAe,EACf,oBAAoB,EACpB,MAAM,EACN,kBAAkB,EAClB,qBAAqB,EACrB,KAAK,WAAW,EAChB,KAAK,YAAY,GAClB,MAAM,eAAe,CAAC"}

package/dist/core/typeErrors.d.ts

@@ -1,17 +0,0 @@
-import { Dimension } from './shapeTypes.js';
-/**
- * Compile-time error message for dimension mismatches.
- * Resolves to a string literal type that appears in IDE diagnostics.
- */
-export type DimensionError<Op extends string, Expected extends string, Got extends string> = `❌ ${Op}: expected ${Expected}, got ${Got}`;
-/**
- * Conditional type that resolves to T if D matches Expected,
- * otherwise resolves to a readable error string type.
- */
-export type RequireDimension<D extends Dimension, Expected extends Dimension, T, Op extends string = 'operation'> = D extends Expected ? T : DimensionError<Op, Expected, D>;
-/**
- * Asserts both dimensions are equal at the type level.
- * Resolves to the shared dimension if equal, or a readable error if not.
- */
-export type SameDimension<A extends Dimension, B extends Dimension, Op extends string = 'operation'> = A extends B ? A : DimensionError<Op, A, B>;
-//# sourceMappingURL=typeErrors.d.ts.map

package/dist/core/typeErrors.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"typeErrors.d.ts","sourceRoot":"","sources":["../../src/core/typeErrors.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAEjD;;;GAGG;AACH,MAAM,MAAM,cAAc,CACxB,EAAE,SAAS,MAAM,EACjB,QAAQ,SAAS,MAAM,EACvB,GAAG,SAAS,MAAM,IAChB,KAAK,EAAE,cAAc,QAAQ,SAAS,GAAG,EAAE,CAAC;AAEhD;;;GAGG;AACH,MAAM,MAAM,gBAAgB,CAC1B,CAAC,SAAS,SAAS,EACnB,QAAQ,SAAS,SAAS,EAC1B,CAAC,EACD,EAAE,SAAS,MAAM,GAAG,WAAW,IAC7B,CAAC,SAAS,QAAQ,GAAG,CAAC,GAAG,cAAc,CAAC,EAAE,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;AAE7D;;;GAGG;AACH,MAAM,MAAM,aAAa,CACvB,CAAC,SAAS,SAAS,EACnB,CAAC,SAAS,SAAS,EACnB,EAAE,SAAS,MAAM,GAAG,WAAW,IAC7B,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,cAAc,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC"}

package/dist/cornerFinder-Ckz-mPHE.js

@@ -1,59 +0,0 @@
-import { D as DEG2RAD } from "./vecOps-ZDdZWbwT.js";
-import { a as angle2d, s as samePoint, d as distance2d } from "./helpers-X0juxnwj.js";
-const PI_2 = 2 * Math.PI;
-function positiveHalfAngle(angle) {
-  const limitedAngle = angle % PI_2;
-  const coterminalAngle = limitedAngle < 0 ? limitedAngle + PI_2 : limitedAngle;
-  if (coterminalAngle < Math.PI) return coterminalAngle;
-  if (coterminalAngle === Math.PI) return 0;
-  return Math.abs(coterminalAngle - PI_2);
-}
-function blueprintCorners(blueprint) {
-  return blueprint.curves.map((curve, index) => ({
-    firstCurve: curve,
-    // eslint-disable-next-line @typescript-eslint/no-non-null-assertion -- modulo wraps within bounds
-    secondCurve: blueprint.curves[(index + 1) % blueprint.curves.length],
-    point: curve.lastPoint
-  }));
-}
-function buildCornerFinder(filters) {
-  const withFilter = (pred) => buildCornerFinder([...filters, pred]);
-  const shouldKeep = (corner) => filters.every((f) => f(corner));
-  return {
-    shouldKeep,
-    when: (pred) => withFilter(pred),
-    inList: (points) => withFilter((corner) => points.some((p) => samePoint(p, corner.point))),
-    atDistance: (distance, point = [0, 0]) => withFilter((corner) => Math.abs(distance2d(point, corner.point) - distance) < 1e-9),
-    atPoint: (point) => withFilter((corner) => samePoint(point, corner.point)),
-    inBox: (corner1, corner2) => {
-      const minX = Math.min(corner1[0], corner2[0]);
-      const maxX = Math.max(corner1[0], corner2[0]);
-      const minY = Math.min(corner1[1], corner2[1]);
-      const maxY = Math.max(corner1[1], corner2[1]);
-      return withFilter((corner) => {
-        const [x, y] = corner.point;
-        return x >= minX && x <= maxX && y >= minY && y <= maxY;
-      });
-    },
-    ofAngle: (angle) => withFilter((corner) => {
-      const tgt1 = corner.firstCurve.tangentAt(1);
-      const tgt2 = corner.secondCurve.tangentAt(0);
-      return Math.abs(positiveHalfAngle(angle2d(tgt1, tgt2)) - positiveHalfAngle(DEG2RAD * angle)) < 1e-9;
-    }),
-    not: (fn) => {
-      const inner = fn(buildCornerFinder([]));
-      return withFilter((corner) => !inner.shouldKeep(corner));
-    },
-    either: (fns) => {
-      const builtFinders = fns.map((fn) => fn(buildCornerFinder([])));
-      return withFilter((corner) => builtFinders.some((f) => f.shouldKeep(corner)));
-    },
-    find: (blueprint) => blueprintCorners(blueprint).filter(shouldKeep)
-  };
-}
-function cornerFinder() {
-  return buildCornerFinder([]);
-}
-export {
-  cornerFinder as c
-};

package/dist/cornerFinder-ZmOyOOsh.cjs

@@ -1,58 +0,0 @@
-"use strict";
-const vecOps = require("./vecOps-CjRL1jau.cjs");
-const helpers = require("./helpers-C8NoT0Wu.cjs");
-const PI_2 = 2 * Math.PI;
-function positiveHalfAngle(angle) {
-  const limitedAngle = angle % PI_2;
-  const coterminalAngle = limitedAngle < 0 ? limitedAngle + PI_2 : limitedAngle;
-  if (coterminalAngle < Math.PI) return coterminalAngle;
-  if (coterminalAngle === Math.PI) return 0;
-  return Math.abs(coterminalAngle - PI_2);
-}
-function blueprintCorners(blueprint) {
-  return blueprint.curves.map((curve, index) => ({
-    firstCurve: curve,
-    // eslint-disable-next-line @typescript-eslint/no-non-null-assertion -- modulo wraps within bounds
-    secondCurve: blueprint.curves[(index + 1) % blueprint.curves.length],
-    point: curve.lastPoint
-  }));
-}
-function buildCornerFinder(filters) {
-  const withFilter = (pred) => buildCornerFinder([...filters, pred]);
-  const shouldKeep = (corner) => filters.every((f) => f(corner));
-  return {
-    shouldKeep,
-    when: (pred) => withFilter(pred),
-    inList: (points) => withFilter((corner) => points.some((p) => helpers.samePoint(p, corner.point))),
-    atDistance: (distance, point = [0, 0]) => withFilter((corner) => Math.abs(helpers.distance2d(point, corner.point) - distance) < 1e-9),
-    atPoint: (point) => withFilter((corner) => helpers.samePoint(point, corner.point)),
-    inBox: (corner1, corner2) => {
-      const minX = Math.min(corner1[0], corner2[0]);
-      const maxX = Math.max(corner1[0], corner2[0]);
-      const minY = Math.min(corner1[1], corner2[1]);
-      const maxY = Math.max(corner1[1], corner2[1]);
-      return withFilter((corner) => {
-        const [x, y] = corner.point;
-        return x >= minX && x <= maxX && y >= minY && y <= maxY;
-      });
-    },
-    ofAngle: (angle) => withFilter((corner) => {
-      const tgt1 = corner.firstCurve.tangentAt(1);
-      const tgt2 = corner.secondCurve.tangentAt(0);
-      return Math.abs(positiveHalfAngle(helpers.angle2d(tgt1, tgt2)) - positiveHalfAngle(vecOps.DEG2RAD * angle)) < 1e-9;
-    }),
-    not: (fn) => {
-      const inner = fn(buildCornerFinder([]));
-      return withFilter((corner) => !inner.shouldKeep(corner));
-    },
-    either: (fns) => {
-      const builtFinders = fns.map((fn) => fn(buildCornerFinder([])));
-      return withFilter((corner) => builtFinders.some((f) => f.shouldKeep(corner)));
-    },
-    find: (blueprint) => blueprintCorners(blueprint).filter(shouldKeep)
-  };
-}
-function cornerFinder() {
-  return buildCornerFinder([]);
-}
-exports.cornerFinder = cornerFinder;

package/dist/shapeFns-C2SnNvdH.cjs

@@ -1,468 +0,0 @@
-"use strict";
-const shapeTypes = require("./shapeTypes-7xEam9Ri.cjs");
-const vecOps = require("./vecOps-CjRL1jau.cjs");
-const faceFns = require("./faceFns-DB1Fc5gy.cjs");
-const result = require("./result-fAX0OZzI.cjs");
-function clone(shape) {
-  return shapeTypes.castShape(result.unwrap(faceFns.downcast(shape.wrapped)));
-}
-function toBREP(shape) {
-  return shapeTypes.getKernel().toBREP(shape.wrapped);
-}
-function getHashCode(shape) {
-  return shapeTypes.getKernel().hashCode(shape.wrapped, vecOps.HASH_CODE_MAX);
-}
-function isEmpty(shape) {
-  return shapeTypes.getKernel().isNull(shape.wrapped);
-}
-function isSameShape(a, b) {
-  return shapeTypes.getKernel().isSame(a.wrapped, b.wrapped);
-}
-function isEqualShape(a, b) {
-  return shapeTypes.getKernel().isEqual(a.wrapped, b.wrapped);
-}
-function simplify(shape) {
-  return shapeTypes.castShape(shapeTypes.getKernel().simplify(shape.wrapped));
-}
-function collectInputFaceHashes(inputs) {
-  const hashes = [];
-  for (const input of inputs) {
-    const origins = getFaceOrigins(input);
-    if (!origins) continue;
-    for (const hash of origins.keys()) {
-      hashes.push(hash);
-    }
-  }
-  return hashes;
-}
-function translate(shape, v) {
-  const inputFaceHashes = collectInputFaceHashes([shape]);
-  const { shape: resultShape, evolution } = shapeTypes.getKernel().translateWithHistory(
-    shape.wrapped,
-    v[0],
-    v[1],
-    v[2],
-    inputFaceHashes,
-    vecOps.HASH_CODE_MAX
-  );
-  const result2 = shapeTypes.castShape(resultShape);
-  propagateOriginsFromEvolution(evolution, [shape], result2);
-  return result2;
-}
-function rotate(shape, angle, position = [0, 0, 0], direction = [0, 0, 1]) {
-  const inputFaceHashes = collectInputFaceHashes([shape]);
-  const { shape: resultShape, evolution } = shapeTypes.getKernel().rotateWithHistory(
-    shape.wrapped,
-    angle * vecOps.DEG2RAD,
-    inputFaceHashes,
-    vecOps.HASH_CODE_MAX,
-    direction,
-    position
-  );
-  const result2 = shapeTypes.castShape(resultShape);
-  propagateOriginsFromEvolution(evolution, [shape], result2);
-  return result2;
-}
-function mirror(shape, planeNormal = [0, 1, 0], planeOrigin = [0, 0, 0]) {
-  const inputFaceHashes = collectInputFaceHashes([shape]);
-  const { shape: resultShape, evolution } = shapeTypes.getKernel().mirrorWithHistory(
-    shape.wrapped,
-    planeOrigin,
-    planeNormal,
-    inputFaceHashes,
-    vecOps.HASH_CODE_MAX
-  );
-  const result2 = shapeTypes.castShape(resultShape);
-  propagateOriginsFromEvolution(evolution, [shape], result2);
-  return result2;
-}
-function scale(shape, factor, center = [0, 0, 0]) {
-  const inputFaceHashes = collectInputFaceHashes([shape]);
-  const { shape: resultShape, evolution } = shapeTypes.getKernel().scaleWithHistory(
-    shape.wrapped,
-    center,
-    factor,
-    inputFaceHashes,
-    vecOps.HASH_CODE_MAX
-  );
-  const result2 = shapeTypes.castShape(resultShape);
-  propagateOriginsFromEvolution(evolution, [shape], result2);
-  return result2;
-}
-function resize(shape, dimensions, options) {
-  const bbox = shapeTypes.getKernel().boundingBox(shape.wrapped);
-  const size = [
-    bbox.max[0] - bbox.min[0],
-    bbox.max[1] - bbox.min[1],
-    bbox.max[2] - bbox.min[2]
-  ];
-  const auto = options?.auto === true;
-  function factor(dim, sz, baseFactor) {
-    if (dim !== void 0 && sz > 1e-12) return dim / sz;
-    if (dim === void 0 && auto) return baseFactor;
-    return 1;
-  }
-  let autoFactor = 1;
-  if (auto) {
-    if (dimensions[0] !== void 0 && size[0] > 1e-12) autoFactor = dimensions[0] / size[0];
-    else if (dimensions[1] !== void 0 && size[1] > 1e-12) autoFactor = dimensions[1] / size[1];
-    else if (dimensions[2] !== void 0 && size[2] > 1e-12) autoFactor = dimensions[2] / size[2];
-  }
-  const factors = [
-    factor(dimensions[0], size[0], autoFactor),
-    factor(dimensions[1], size[1], autoFactor),
-    factor(dimensions[2], size[2], autoFactor)
-  ];
-  const isUniform = Math.abs(factors[0] - factors[1]) < 1e-6 && Math.abs(factors[1] - factors[2]) < 1e-6;
-  if (!isUniform) {
-    throw new Error(
-      "resize: non-uniform scaling is not supported (WASM build lacks BRepBuilderAPI_GTransform). Use auto: true to scale proportionally, or set all three dimensions to achieve uniform scaling."
-    );
-  }
-  return scale(shape, factors[0]);
-}
-function parseMatrixInput(input) {
-  if ("linear" in input) {
-    return { linear: input.linear, translation: input.translation };
-  }
-  const [r0, r1, r2, r3] = input;
-  const TOL = 1e-10;
-  if (Math.abs(r3[0]) > TOL || Math.abs(r3[1]) > TOL || Math.abs(r3[2]) > TOL || Math.abs(r3[3] - 1) > TOL) {
-    throw new Error(
-      `applyMatrix: invalid bottom row [${String(r3[0])}, ${String(r3[1])}, ${String(r3[2])}, ${String(r3[3])}]. Must be [0, 0, 0, 1] for an affine transform.`
-    );
-  }
-  return {
-    linear: [r0[0], r0[1], r0[2], r1[0], r1[1], r1[2], r2[0], r2[1], r2[2]],
-    translation: [r0[3], r1[3], r2[3]]
-  };
-}
-function det3x3(m) {
-  return m[0] * (m[4] * m[8] - m[5] * m[7]) - m[1] * (m[3] * m[8] - m[5] * m[6]) + m[2] * (m[3] * m[7] - m[4] * m[6]);
-}
-function isOrthogonalMatrix(m) {
-  const TOL = 1e-8;
-  const d00 = m[0] * m[0] + m[3] * m[3] + m[6] * m[6];
-  const d11 = m[1] * m[1] + m[4] * m[4] + m[7] * m[7];
-  const d22 = m[2] * m[2] + m[5] * m[5] + m[8] * m[8];
-  const d01 = m[0] * m[1] + m[3] * m[4] + m[6] * m[7];
-  const d02 = m[0] * m[2] + m[3] * m[5] + m[6] * m[8];
-  const d12 = m[1] * m[2] + m[4] * m[5] + m[7] * m[8];
-  if (Math.abs(d01) > TOL) return false;
-  if (Math.abs(d02) > TOL) return false;
-  if (Math.abs(d12) > TOL) return false;
-  if (Math.abs(d00 - d11) > TOL) return false;
-  if (Math.abs(d00 - d22) > TOL) return false;
-  return true;
-}
-function applyMatrix(shape, matrix) {
-  const { linear, translation } = parseMatrixInput(matrix);
-  const d = det3x3(linear);
-  if (Math.abs(d) < 1e-12) {
-    throw new Error(
-      "applyMatrix: singular matrix (determinant ≈ 0). Cannot apply a non-invertible transform."
-    );
-  }
-  const orthogonal = isOrthogonalMatrix(linear);
-  if (orthogonal) {
-    const inputFaceHashes = collectInputFaceHashes([shape]);
-    const { shape: resultShape2, evolution } = shapeTypes.getKernel().generalTransformWithHistory(
-      shape.wrapped,
-      linear,
-      translation,
-      true,
-      inputFaceHashes,
-      vecOps.HASH_CODE_MAX
-    );
-    const result22 = shapeTypes.castShape(resultShape2);
-    propagateOriginsFromEvolution(evolution, [shape], result22);
-    return result22;
-  }
-  const resultShape = shapeTypes.getKernel().generalTransformNonOrthogonal(shape.wrapped, linear, translation);
-  const result2 = shapeTypes.castShape(resultShape);
-  propagateOriginsByHash([shape], result2);
-  return result2;
-}
-function composeTransforms(ops) {
-  const kernelOps = ops.map((op) => {
-    if (op.type === "translate") {
-      return { type: "translate", x: op.v[0], y: op.v[1], z: op.v[2] };
-    }
-    return {
-      type: "rotate",
-      angle: op.angle,
-      axis: op.axis,
-      center: op.center
-    };
-  });
-  const { handle, dispose } = shapeTypes.getKernel().composeTransform(kernelOps);
-  return { trsf: handle, cleanup: dispose };
-}
-function transformCopy(shape, composed) {
-  const inputFaceHashes = collectInputFaceHashes([shape]);
-  const { shape: resultShape, evolution } = shapeTypes.getKernel().applyComposedTransformWithHistory(
-    shape.wrapped,
-    composed.trsf,
-    inputFaceHashes,
-    vecOps.HASH_CODE_MAX
-  );
-  const result2 = shapeTypes.castShape(resultShape);
-  propagateOriginsFromEvolution(evolution, [shape], result2);
-  return result2;
-}
-const topoCache = /* @__PURE__ */ new WeakMap();
-function getOrCreateCache(shape) {
-  let entry = topoCache.get(shape.wrapped);
-  if (!entry) {
-    entry = {};
-    topoCache.set(shape.wrapped, entry);
-  }
-  return entry;
-}
-function invalidateShapeCache(shape) {
-  topoCache.delete(shape.wrapped);
-}
-function getEdges(shape) {
-  const cache = getOrCreateCache(shape);
-  if (cache.edges) return cache.edges;
-  const edges = Array.from(faceFns.iterTopo(shape.wrapped, "edge")).map(
-    (e) => shapeTypes.castShape(result.unwrap(faceFns.downcast(e)))
-  );
-  cache.edges = edges;
-  return edges;
-}
-function getFaces(shape) {
-  const cache = getOrCreateCache(shape);
-  if (cache.faces) return cache.faces;
-  const faces = Array.from(faceFns.iterTopo(shape.wrapped, "face")).map(
-    (e) => shapeTypes.castShape(result.unwrap(faceFns.downcast(e)))
-  );
-  cache.faces = faces;
-  return faces;
-}
-function getWires(shape) {
-  const cache = getOrCreateCache(shape);
-  if (cache.wires) return cache.wires;
-  const wires = Array.from(faceFns.iterTopo(shape.wrapped, "wire")).map(
-    (e) => shapeTypes.castShape(result.unwrap(faceFns.downcast(e)))
-  );
-  cache.wires = wires;
-  return wires;
-}
-function setShapeOrigin(shape, origin) {
-  const cache = getOrCreateCache(shape);
-  const map = /* @__PURE__ */ new Map();
-  for (const f of getFaces(shape)) {
-    map.set(shapeTypes.getKernel().hashCode(f.wrapped, vecOps.HASH_CODE_MAX), origin);
-  }
-  cache.faceOrigins = map;
-}
-function getFaceOrigins(shape) {
-  return topoCache.get(shape.wrapped)?.faceOrigins;
-}
-function propagateOriginsFromEvolution(evolution, inputs, result2) {
-  const inputOrigins = /* @__PURE__ */ new Map();
-  for (const input of inputs) {
-    const origins = getFaceOrigins(input);
-    if (!origins) continue;
-    for (const [hash, origin] of origins) {
-      inputOrigins.set(hash, origin);
-    }
-  }
-  if (inputOrigins.size === 0) return;
-  const resultMap = /* @__PURE__ */ new Map();
-  for (const [hash, origin] of inputOrigins) {
-    if (evolution.deleted.has(hash)) continue;
-    const modifiedHashes = evolution.modified.get(hash);
-    if (modifiedHashes && modifiedHashes.length > 0) {
-      for (const modHash of modifiedHashes) {
-        resultMap.set(modHash, origin);
-      }
-    } else {
-      resultMap.set(hash, origin);
-    }
-    const generatedHashes = evolution.generated.get(hash);
-    if (generatedHashes) {
-      for (const genHash of generatedHashes) {
-        if (!resultMap.has(genHash)) {
-          resultMap.set(genHash, 0);
-        }
-      }
-    }
-  }
-  if (resultMap.size > 0) {
-    const cache = getOrCreateCache(result2);
-    cache.faceOrigins = resultMap;
-  }
-}
-function propagateOriginsByHash(inputs, result2) {
-  const lookup = /* @__PURE__ */ new Map();
-  for (const input of inputs) {
-    const origins = getFaceOrigins(input);
-    if (!origins) continue;
-    for (const [hash, origin] of origins) {
-      lookup.set(hash, origin);
-    }
-  }
-  if (lookup.size === 0) return;
-  const kernel = shapeTypes.getKernel();
-  const resultMap = /* @__PURE__ */ new Map();
-  const resultFaces = getFaces(result2);
-  for (const f of resultFaces) {
-    const hash = kernel.hashCode(f.wrapped, vecOps.HASH_CODE_MAX);
-    const origin = lookup.get(hash);
-    if (origin !== void 0) {
-      resultMap.set(hash, origin);
-    }
-  }
-  if (resultMap.size === 0) {
-    const inputSigs = [];
-    for (const input of inputs) {
-      const origins = getFaceOrigins(input);
-      if (!origins) continue;
-      for (const f of getFaces(input)) {
-        const hash = kernel.hashCode(f.wrapped, vecOps.HASH_CODE_MAX);
-        const origin = origins.get(hash);
-        if (origin === void 0) continue;
-        try {
-          const bounds = kernel.uvBounds(f.wrapped);
-          const normal = kernel.surfaceNormal(
-            f.wrapped,
-            0.5 * (bounds.uMin + bounds.uMax),
-            0.5 * (bounds.vMin + bounds.vMax)
-          );
-          const centroid = kernel.surfaceCenterOfMass(f.wrapped);
-          inputSigs.push({ origin, normal, centroid });
-        } catch {
-        }
-      }
-    }
-    if (inputSigs.length > 0) {
-      for (const f of resultFaces) {
-        const hash = kernel.hashCode(f.wrapped, vecOps.HASH_CODE_MAX);
-        try {
-          const outBounds = kernel.uvBounds(f.wrapped);
-          const outNormal = kernel.surfaceNormal(
-            f.wrapped,
-            0.5 * (outBounds.uMin + outBounds.uMax),
-            0.5 * (outBounds.vMin + outBounds.vMax)
-          );
-          const outCentroid = kernel.surfaceCenterOfMass(f.wrapped);
-          let bestScore = -Infinity;
-          let bestOrigin;
-          for (const inp of inputSigs) {
-            const dot = outNormal[0] * inp.normal[0] + outNormal[1] * inp.normal[1] + outNormal[2] * inp.normal[2];
-            if (dot < 0.707) continue;
-            const dx = outCentroid[0] - inp.centroid[0];
-            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 (bestOrigin !== void 0) {
-            resultMap.set(hash, bestOrigin);
-          }
-        } catch {
-        }
-      }
-    }
-  }
-  if (resultMap.size > 0) {
-    const cache = getOrCreateCache(result2);
-    cache.faceOrigins = resultMap;
-  }
-}
-function getVertices(shape) {
-  const cache = getOrCreateCache(shape);
-  if (cache.vertices) return cache.vertices;
-  const vertices = Array.from(faceFns.iterTopo(shape.wrapped, "vertex")).map(
-    (e) => shapeTypes.castShape(result.unwrap(faceFns.downcast(e)))
-  );
-  cache.vertices = vertices;
-  return vertices;
-}
-function* iterEdges(shape) {
-  for (const e of faceFns.iterTopo(shape.wrapped, "edge")) {
-    yield shapeTypes.castShape(result.unwrap(faceFns.downcast(e)));
-  }
-}
-function* iterFaces(shape) {
-  for (const f of faceFns.iterTopo(shape.wrapped, "face")) {
-    yield shapeTypes.castShape(result.unwrap(faceFns.downcast(f)));
-  }
-}
-function* iterWires(shape) {
-  for (const w of faceFns.iterTopo(shape.wrapped, "wire")) {
-    yield shapeTypes.castShape(result.unwrap(faceFns.downcast(w)));
-  }
-}
-function* iterVertices(shape) {
-  for (const v of faceFns.iterTopo(shape.wrapped, "vertex")) {
-    yield shapeTypes.castShape(result.unwrap(faceFns.downcast(v)));
-  }
-}
-function getBounds(shape) {
-  const cache = getOrCreateCache(shape);
-  if (cache.bounds) return cache.bounds;
-  const { min, max } = shapeTypes.getKernel().boundingBox(shape.wrapped);
-  const bounds = {
-    xMin: min[0],
-    xMax: max[0],
-    yMin: min[1],
-    yMax: max[1],
-    zMin: min[2],
-    zMax: max[2]
-  };
-  cache.bounds = bounds;
-  return bounds;
-}
-function describe(shape) {
-  return {
-    kind: shapeTypes.getShapeKind(shape),
-    faceCount: getFaces(shape).length,
-    edgeCount: getEdges(shape).length,
-    wireCount: getWires(shape).length,
-    vertexCount: getVertices(shape).length,
-    valid: shapeTypes.getKernel().isValid(shape.wrapped),
-    bounds: getBounds(shape)
-  };
-}
-function vertexPosition(vertex) {
-  return shapeTypes.getKernel().vertexPosition(vertex.wrapped);
-}
-exports.applyMatrix = applyMatrix;
-exports.clone = clone;
-exports.composeTransforms = composeTransforms;
-exports.describe = describe;
-exports.getBounds = getBounds;
-exports.getEdges = getEdges;
-exports.getFaceOrigins = getFaceOrigins;
-exports.getFaces = getFaces;
-exports.getHashCode = getHashCode;
-exports.getVertices = getVertices;
-exports.getWires = getWires;
-exports.invalidateShapeCache = invalidateShapeCache;
-exports.isEmpty = isEmpty;
-exports.isEqualShape = isEqualShape;
-exports.isSameShape = isSameShape;
-exports.iterEdges = iterEdges;
-exports.iterFaces = iterFaces;
-exports.iterVertices = iterVertices;
-exports.iterWires = iterWires;
-exports.mirror = mirror;
-exports.propagateOriginsByHash = propagateOriginsByHash;
-exports.propagateOriginsFromEvolution = propagateOriginsFromEvolution;
-exports.resize = resize;
-exports.rotate = rotate;
-exports.scale = scale;
-exports.setShapeOrigin = setShapeOrigin;
-exports.simplify = simplify;
-exports.toBREP = toBREP;
-exports.transformCopy = transformCopy;
-exports.translate = translate;
-exports.vertexPosition = vertexPosition;