@faicad/faijs 0.13.0

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

@@ -0,0 +1,307 @@
+/**
+ * Topology query functions — extract sub-shapes, compute bounds, and
+ * describe shape topology. All results are lazily cached per shape.
+ */
+import { getKernel } from '../kernel/index.js';
+import { castResultShapeWithKnownType } from '../core/shapeTypes.js';
+import { getOrQueryType } from '../core/shapeTypeCache.js';
+import { HASH_CODE_MAX } from '../core/constants.js';
+// ---------------------------------------------------------------------------
+// Fast sub-shape extraction (avoids per-item downcast + generator overhead)
+// ---------------------------------------------------------------------------
+/**
+ * Extract sub-shapes of a known type, bypassing the generator wrapper and
+ * redundant downcast calls. Uses iterShapes (C++ bulk extraction) directly
+ * and passes the known type to castShape to skip the shapeType() WASM call.
+ */
+function castSubShapes(parentShape, type) {
+    const kernel = getKernel();
+    const rawShapes = kernel.iterShapes(parentShape, type);
+    const result = new Array(rawShapes.length);
+    for (let i = 0; i < rawShapes.length; i++) {
+        result[i] = castResultShapeWithKnownType(rawShapes[i], type);
+    }
+    return result;
+}
+/**
+ * Count sub-shapes of a type without materialising (and disposing) a handle per
+ * sub-shape. Uses the kernel's native `subShapeCount` when available (occt-wasm
+ * >= 3.7.0); otherwise iterates and releases. Prefer this over
+ * `getFaces(shape).length` when only the count is needed and the handles aren't
+ * — it neither allocates nor warms the topology cache.
+ */
+export function subShapeCount(shape, type) {
+    const kernel = getKernel();
+    if (kernel.subShapeCount)
+        return kernel.subShapeCount(shape.wrapped, type);
+    const items = kernel.iterShapes(shape.wrapped, type);
+    for (const item of items)
+        kernel.dispose(item);
+    return items.length;
+}
+/**
+ * Deduplicated hashes of a shape's sub-shapes, keyed the same as
+ * {@link getKernel}'s `hashCode(_, HASH_CODE_MAX)`. Uses the native
+ * `subShapeHashes` when available (occt-wasm >= 3.7.0); otherwise iterates,
+ * hashes, and releases. For hash-only paths (origin/tag maps) that would
+ * otherwise allocate a handle per sub-shape just to hash it.
+ */
+export function subShapeHashes(shape, type) {
+    const kernel = getKernel();
+    if (kernel.subShapeHashes)
+        return kernel.subShapeHashes(shape.wrapped, type, HASH_CODE_MAX);
+    const seen = new Set();
+    for (const item of kernel.iterShapes(shape.wrapped, type)) {
+        seen.add(kernel.hashCode(item, HASH_CODE_MAX));
+        kernel.dispose(item);
+    }
+    return [...seen];
+}
+const topoCache = new WeakMap();
+/**
+ * Release the cached sub-shape handles for a cache entry and drop it. The
+ * extractor arrays own arena slots (their branded downcast handles); the
+ * adjacency maps only alias those same handles, so dropping the maps is enough.
+ * Disposal is idempotent, so a manually-disposed handle here is a safe no-op.
+ */
+function disposeCacheEntry(key) {
+    const entry = topoCache.get(key);
+    if (!entry)
+        return;
+    topoCache.delete(key);
+    const arrays = [
+        entry.edges,
+        entry.faces,
+        entry.wires,
+        entry.vertices,
+        entry.shells,
+        entry.solids,
+        entry.compSolids,
+    ];
+    for (const arr of arrays) {
+        if (arr)
+            for (const handle of arr)
+                handle[Symbol.dispose]();
+    }
+}
+/** Handles whose disposal is already wired to release their cache entry. */
+const cleanupRegistered = new WeakSet();
+/** @internal Get or create a cache entry for a shape. Used by originTrackingFns. */
+export function getOrCreateCache(shape) {
+    const key = shape.wrapped;
+    let entry = topoCache.get(key);
+    if (!entry) {
+        entry = {};
+        topoCache.set(key, entry);
+    }
+    // Release the cached sub-shape handles when the parent shape is disposed, so
+    // its arena slots don't outlive it. (GC of an undisposed parent drops the
+    // WeakMap entry, letting the handles' own finalizers reclaim them.) Register
+    // once per handle — keyed on the handle, not the entry, so a re-query after
+    // invalidateShapeCache rebuilds the entry without stacking dead callbacks.
+    if (!cleanupRegistered.has(shape)) {
+        cleanupRegistered.add(shape);
+        shape.onDispose(() => {
+            disposeCacheEntry(key);
+        });
+    }
+    return entry;
+}
+/** @internal Direct cache access. Used by originTrackingFns for getFaceOrigins. */
+export function getCacheEntry(shape) {
+    return topoCache.get(shape.wrapped);
+}
+/**
+ * Invalidate cached topology data for a shape, releasing its cached sub-shape
+ * handles. Call this after operations that modify a shape in-place (e.g.,
+ * unifyFaces).
+ */
+export function invalidateShapeCache(shape) {
+    disposeCacheEntry(shape.wrapped);
+}
+// ---------------------------------------------------------------------------
+// Cached topology extractors
+// ---------------------------------------------------------------------------
+/** Get all edges of a shape as branded Edge handles. Results are cached per shape. */
+export function getEdges(shape) {
+    const cache = getOrCreateCache(shape);
+    if (cache.edges)
+        return cache.edges;
+    const edges = castSubShapes(shape.wrapped, 'edge');
+    cache.edges = edges;
+    return edges;
+}
+/**
+ * Get all faces of a shape. Results are cached per shape.
+ *
+ * Returns `Face[]` — use `isOrientedFace()` or `orientedFace()` to narrow
+ * individual faces to `OrientedFace` when the orientation guarantee is needed.
+ */
+export function getFaces(shape) {
+    const cache = getOrCreateCache(shape);
+    if (cache.faces)
+        return cache.faces;
+    const faces = castSubShapes(shape.wrapped, 'face');
+    cache.faces = faces;
+    return faces;
+}
+/** Get all wires of a shape as branded Wire handles. Results are cached per shape. */
+export function getWires(shape) {
+    const cache = getOrCreateCache(shape);
+    if (cache.wires)
+        return cache.wires;
+    const wires = castSubShapes(shape.wrapped, 'wire');
+    cache.wires = wires;
+    return wires;
+}
+/** Get all vertices of a shape as branded Vertex handles. Results are cached per shape. */
+export function getVertices(shape) {
+    const cache = getOrCreateCache(shape);
+    if (cache.vertices)
+        return cache.vertices;
+    const vertices = castSubShapes(shape.wrapped, 'vertex');
+    cache.vertices = vertices;
+    return vertices;
+}
+/**
+ * Get all solids of a shape as branded Solid handles. Results are cached per shape.
+ *
+ * Booleans (`cut`/`fuse`/`fuseAll`), `chamfer`/`fillet`, and some sweeps return a
+ * `Compound` wrapping the solid(s); use this to unwrap them without reaching into
+ * the kernel. Returns `[]` for shapes with no solids (wires, bare faces, shells).
+ */
+export function getSolids(shape) {
+    const cache = getOrCreateCache(shape);
+    if (cache.solids)
+        return cache.solids;
+    const solids = castSubShapes(shape.wrapped, 'solid');
+    cache.solids = solids;
+    return solids;
+}
+/** Get all shells of a shape as branded Shell handles. Results are cached per shape. */
+export function getShells(shape) {
+    const cache = getOrCreateCache(shape);
+    if (cache.shells)
+        return cache.shells;
+    const shells = castSubShapes(shape.wrapped, 'shell');
+    cache.shells = shells;
+    return shells;
+}
+/** Get all compsolids of a shape as branded CompSolid handles. Results are cached per shape. */
+export function getCompSolids(shape) {
+    const cache = getOrCreateCache(shape);
+    if (cache.compSolids)
+        return cache.compSolids;
+    const compSolids = castSubShapes(shape.wrapped, 'compsolid');
+    cache.compSolids = compSolids;
+    return compSolids;
+}
+// ---------------------------------------------------------------------------
+// Lazy topology iterators (generators)
+// ---------------------------------------------------------------------------
+/** Lazily iterate edges of a shape, yielding branded Edge handles one at a time. */
+export function* iterEdges(shape) {
+    for (const e of getKernel().iterShapes(shape.wrapped, 'edge')) {
+        yield castResultShapeWithKnownType(e, 'edge');
+    }
+}
+/** Lazily iterate faces of a shape, yielding branded Face handles one at a time. */
+export function* iterFaces(shape) {
+    for (const f of getKernel().iterShapes(shape.wrapped, 'face')) {
+        yield castResultShapeWithKnownType(f, 'face');
+    }
+}
+/** Lazily iterate wires of a shape, yielding branded Wire handles one at a time. */
+export function* iterWires(shape) {
+    for (const w of getKernel().iterShapes(shape.wrapped, 'wire')) {
+        yield castResultShapeWithKnownType(w, 'wire');
+    }
+}
+/** Lazily iterate vertices of a shape, yielding branded Vertex handles one at a time. */
+export function* iterVertices(shape) {
+    for (const v of getKernel().iterShapes(shape.wrapped, 'vertex')) {
+        yield castResultShapeWithKnownType(v, 'vertex');
+    }
+}
+/** Lazily iterate solids of a shape, yielding branded Solid handles one at a time. */
+export function* iterSolids(shape) {
+    for (const s of getKernel().iterShapes(shape.wrapped, 'solid')) {
+        yield castResultShapeWithKnownType(s, 'solid');
+    }
+}
+/** Lazily iterate shells of a shape, yielding branded Shell handles one at a time. */
+export function* iterShells(shape) {
+    for (const s of getKernel().iterShapes(shape.wrapped, 'shell')) {
+        yield castResultShapeWithKnownType(s, 'shell');
+    }
+}
+/** Lazily iterate compsolids of a shape, yielding branded CompSolid handles one at a time. */
+export function* iterCompSolids(shape) {
+    for (const s of getKernel().iterShapes(shape.wrapped, 'compsolid')) {
+        yield castResultShapeWithKnownType(s, 'compsolid');
+    }
+}
+/** Get the axis-aligned bounding box of a shape. Cached per shape. */
+export function getBounds(shape) {
+    const cache = getOrCreateCache(shape);
+    if (cache.bounds)
+        return cache.bounds;
+    const { min, max } = 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;
+}
+// ---------------------------------------------------------------------------
+// Cached shape kind
+// ---------------------------------------------------------------------------
+/** Get the topological kind of a shape. Cached per shape via shapeTypeCache. */
+export function getCachedShapeKind(shape) {
+    return getOrQueryType(getKernel(), shape.wrapped);
+}
+/** Get the kernel surface type of a face. Cached per face (shapes are immutable). */
+export function getCachedSurfaceType(face) {
+    const cache = getOrCreateCache(face);
+    if (cache.surfaceType !== undefined)
+        return cache.surfaceType;
+    const surfType = getKernel().surfaceType(face.wrapped);
+    cache.surfaceType = surfType;
+    return surfType;
+}
+/** Get whether a shape is valid. Cached per shape (shapes are immutable). */
+export function getCachedIsValid(shape) {
+    const cache = getOrCreateCache(shape);
+    if (cache.isValid !== undefined)
+        return cache.isValid;
+    const valid = getKernel().isValid(shape.wrapped);
+    cache.isValid = valid;
+    return valid;
+}
+/** Get a quick summary of a shape for debugging and inspection. */
+export function describe(shape) {
+    return {
+        kind: getCachedShapeKind(shape),
+        // Count-only: subShapeCount avoids allocating (and caching) a handle per
+        // sub-shape just to read `.length`.
+        faceCount: subShapeCount(shape, 'face'),
+        edgeCount: subShapeCount(shape, 'edge'),
+        wireCount: subShapeCount(shape, 'wire'),
+        vertexCount: subShapeCount(shape, 'vertex'),
+        valid: getCachedIsValid(shape),
+        bounds: getBounds(shape),
+    };
+}
+// ---------------------------------------------------------------------------
+// Vertex position
+// ---------------------------------------------------------------------------
+/** Get the position of a vertex as a Vec3 tuple. */
+export function vertexPosition(vertex) {
+    return getKernel().vertexPosition(vertex.wrapped);
+}
+//# sourceMappingURL=topologyQueryFns.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"topologyQueryFns.js","sourceRoot":"","sources":["../../../../src/vendored/brepjs/topology/topologyQueryFns.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAc/C,OAAO,EAAE,4BAA4B,EAAE,MAAM,uBAAuB,CAAC;AACrE,OAAO,EAAE,cAAc,EAAE,MAAM,2BAA2B,CAAC;AAC3D,OAAO,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AAGrD,8EAA8E;AAC9E,4EAA4E;AAC5E,8EAA8E;AAE9E;;;;GAIG;AACH,SAAS,aAAa,CAAI,WAAwB,EAAE,IAAe;IACjE,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC;IAC3B,MAAM,SAAS,GAAG,MAAM,CAAC,UAAU,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;IACvD,MAAM,MAAM,GAAQ,IAAI,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;IAChD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1C,MAAM,CAAC,CAAC,CAAC,GAAG,4BAA4B,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,CAAM,CAAC;IACpE,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,aAAa,CAAC,KAA0B,EAAE,IAAe;IACvE,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC;IAC3B,IAAI,MAAM,CAAC,aAAa;QAAE,OAAO,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;IAC3E,MAAM,KAAK,GAAG,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;IACrD,KAAK,MAAM,IAAI,IAAI,KAAK;QAAE,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IAC/C,OAAO,KAAK,CAAC,MAAM,CAAC;AACtB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,cAAc,CAAC,KAA0B,EAAE,IAAe;IACxE,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC;IAC3B,IAAI,MAAM,CAAC,cAAc;QAAE,OAAO,MAAM,CAAC,cAAc,CAAC,KAAK,CAAC,OAAO,EAAE,IAAI,EAAE,aAAa,CAAC,CAAC;IAC5F,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,CAAC;QAC1D,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC,CAAC;QAC/C,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IACvB,CAAC;IACD,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC;AACnB,CAAC;AA0BD,MAAM,SAAS,GAAG,IAAI,OAAO,EAA0B,CAAC;AAExD;;;;;GAKG;AACH,SAAS,iBAAiB,CAAC,GAAW;IACpC,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACjC,IAAI,CAAC,KAAK;QAAE,OAAO;IACnB,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IACtB,MAAM,MAAM,GAAG;QACb,KAAK,CAAC,KAAK;QACX,KAAK,CAAC,KAAK;QACX,KAAK,CAAC,KAAK;QACX,KAAK,CAAC,QAAQ;QACd,KAAK,CAAC,MAAM;QACZ,KAAK,CAAC,MAAM;QACZ,KAAK,CAAC,UAAU;KACjB,CAAC;IACF,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;QACzB,IAAI,GAAG;YAAE,KAAK,MAAM,MAAM,IAAI,GAAG;gBAAE,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;IAC9D,CAAC;AACH,CAAC;AAED,4EAA4E;AAC5E,MAAM,iBAAiB,GAAG,IAAI,OAAO,EAAE,CAAC;AAExC,oFAAoF;AACpF,MAAM,UAAU,gBAAgB,CAAC,KAA0B;IACzD,MAAM,GAAG,GAAG,KAAK,CAAC,OAAO,CAAC;IAC1B,IAAI,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC/B,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,KAAK,GAAG,EAAE,CAAC;QACX,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IAC5B,CAAC;IACD,6EAA6E;IAC7E,0EAA0E;IAC1E,6EAA6E;IAC7E,4EAA4E;IAC5E,2EAA2E;IAC3E,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;QAClC,iBAAiB,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC7B,KAAK,CAAC,SAAS,CAAC,GAAG,EAAE;YACnB,iBAAiB,CAAC,GAAG,CAAC,CAAC;QACzB,CAAC,CAAC,CAAC;IACL,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,mFAAmF;AACnF,MAAM,UAAU,aAAa,CAAC,KAA0B;IACtD,OAAO,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;AACtC,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,oBAAoB,CAAC,KAA0B;IAC7D,iBAAiB,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;AACnC,CAAC;AAED,8EAA8E;AAC9E,6BAA6B;AAC7B,8EAA8E;AAE9E,sFAAsF;AACtF,MAAM,UAAU,QAAQ,CAAsB,KAAkB;IAC9D,MAAM,KAAK,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;IACtC,IAAI,KAAK,CAAC,KAAK;QAAE,OAAO,KAAK,CAAC,KAAkB,CAAC;IACjD,MAAM,KAAK,GAAG,aAAa,CAAU,KAAK,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;IAC5D,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC;IACpB,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,QAAQ,CAAsB,KAAkB;IAC9D,MAAM,KAAK,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;IACtC,IAAI,KAAK,CAAC,KAAK;QAAE,OAAO,KAAK,CAAC,KAAkB,CAAC;IACjD,MAAM,KAAK,GAAG,aAAa,CAAU,KAAK,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;IAC5D,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC;IACpB,OAAO,KAAK,CAAC;AACf,CAAC;AAED,sFAAsF;AACtF,MAAM,UAAU,QAAQ,CAAsB,KAAkB;IAC9D,MAAM,KAAK,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;IACtC,IAAI,KAAK,CAAC,KAAK;QAAE,OAAO,KAAK,CAAC,KAAkB,CAAC;IACjD,MAAM,KAAK,GAAG,aAAa,CAAU,KAAK,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;IAC5D,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC;IACpB,OAAO,KAAK,CAAC;AACf,CAAC;AAED,2FAA2F;AAC3F,MAAM,UAAU,WAAW,CAAsB,KAAkB;IACjE,MAAM,KAAK,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;IACtC,IAAI,KAAK,CAAC,QAAQ;QAAE,OAAO,KAAK,CAAC,QAAuB,CAAC;IACzD,MAAM,QAAQ,GAAG,aAAa,CAAY,KAAK,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;IACnE,KAAK,CAAC,QAAQ,GAAG,QAAQ,CAAC;IAC1B,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,SAAS,CAAC,KAA0B;IAClD,MAAM,KAAK,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;IACtC,IAAI,KAAK,CAAC,MAAM;QAAE,OAAO,KAAK,CAAC,MAAM,CAAC;IACtC,MAAM,MAAM,GAAG,aAAa,CAAQ,KAAK,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;IAC5D,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC;IACtB,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,wFAAwF;AACxF,MAAM,UAAU,SAAS,CAAC,KAA0B;IAClD,MAAM,KAAK,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;IACtC,IAAI,KAAK,CAAC,MAAM;QAAE,OAAO,KAAK,CAAC,MAAM,CAAC;IACtC,MAAM,MAAM,GAAG,aAAa,CAAQ,KAAK,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;IAC5D,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC;IACtB,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,gGAAgG;AAChG,MAAM,UAAU,aAAa,CAAC,KAA0B;IACtD,MAAM,KAAK,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;IACtC,IAAI,KAAK,CAAC,UAAU;QAAE,OAAO,KAAK,CAAC,UAAU,CAAC;IAC9C,MAAM,UAAU,GAAG,aAAa,CAAY,KAAK,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;IACxE,KAAK,CAAC,UAAU,GAAG,UAAU,CAAC;IAC9B,OAAO,UAAU,CAAC;AACpB,CAAC;AAED,8EAA8E;AAC9E,uCAAuC;AACvC,8EAA8E;AAE9E,oFAAoF;AACpF,MAAM,SAAS,CAAC,CAAC,SAAS,CAAsB,KAAkB;IAChE,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC,OAAO,EAAE,MAAM,CAAC,EAAE,CAAC;QAC9D,MAAM,4BAA4B,CAAC,CAAC,EAAE,MAAM,CAAY,CAAC;IAC3D,CAAC;AACH,CAAC;AAED,oFAAoF;AACpF,MAAM,SAAS,CAAC,CAAC,SAAS,CAAsB,KAAkB;IAChE,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC,OAAO,EAAE,MAAM,CAAC,EAAE,CAAC;QAC9D,MAAM,4BAA4B,CAAC,CAAC,EAAE,MAAM,CAAY,CAAC;IAC3D,CAAC;AACH,CAAC;AAED,oFAAoF;AACpF,MAAM,SAAS,CAAC,CAAC,SAAS,CAAsB,KAAkB;IAChE,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC,OAAO,EAAE,MAAM,CAAC,EAAE,CAAC;QAC9D,MAAM,4BAA4B,CAAC,CAAC,EAAE,MAAM,CAAY,CAAC;IAC3D,CAAC;AACH,CAAC;AAED,yFAAyF;AACzF,MAAM,SAAS,CAAC,CAAC,YAAY,CAAsB,KAAkB;IACnE,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC,OAAO,EAAE,QAAQ,CAAC,EAAE,CAAC;QAChE,MAAM,4BAA4B,CAAC,CAAC,EAAE,QAAQ,CAAc,CAAC;IAC/D,CAAC;AACH,CAAC;AAED,sFAAsF;AACtF,MAAM,SAAS,CAAC,CAAC,UAAU,CAAC,KAA0B;IACpD,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC,OAAO,EAAE,OAAO,CAAC,EAAE,CAAC;QAC/D,MAAM,4BAA4B,CAAC,CAAC,EAAE,OAAO,CAAU,CAAC;IAC1D,CAAC;AACH,CAAC;AAED,sFAAsF;AACtF,MAAM,SAAS,CAAC,CAAC,UAAU,CAAC,KAA0B;IACpD,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC,OAAO,EAAE,OAAO,CAAC,EAAE,CAAC;QAC/D,MAAM,4BAA4B,CAAC,CAAC,EAAE,OAAO,CAAU,CAAC;IAC1D,CAAC;AACH,CAAC;AAED,8FAA8F;AAC9F,MAAM,SAAS,CAAC,CAAC,cAAc,CAAC,KAA0B;IACxD,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC,OAAO,EAAE,WAAW,CAAC,EAAE,CAAC;QACnE,MAAM,4BAA4B,CAAC,CAAC,EAAE,WAAW,CAAc,CAAC;IAClE,CAAC;AACH,CAAC;AAgBD,sEAAsE;AACtE,MAAM,UAAU,SAAS,CAAC,KAA0B;IAClD,MAAM,KAAK,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;IACtC,IAAI,KAAK,CAAC,MAAM;QAAE,OAAO,KAAK,CAAC,MAAM,CAAC;IACtC,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,SAAS,EAAE,CAAC,WAAW,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAC5D,MAAM,MAAM,GAAa;QACvB,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;QACZ,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;QACZ,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;QACZ,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;QACZ,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;QACZ,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;KACb,CAAC;IACF,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC;IACtB,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,8EAA8E;AAC9E,oBAAoB;AACpB,8EAA8E;AAE9E,gFAAgF;AAChF,MAAM,UAAU,kBAAkB,CAAC,KAA0B;IAC3D,OAAO,cAAc,CAAC,SAAS,EAAE,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;AACpD,CAAC;AAED,qFAAqF;AACrF,MAAM,UAAU,oBAAoB,CAAC,IAAqB;IACxD,MAAM,KAAK,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC;IACrC,IAAI,KAAK,CAAC,WAAW,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC,WAAW,CAAC;IAC9D,MAAM,QAAQ,GAAG,SAAS,EAAE,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACvD,KAAK,CAAC,WAAW,GAAG,QAAQ,CAAC;IAC7B,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,6EAA6E;AAC7E,MAAM,UAAU,gBAAgB,CAAC,KAA0B;IACzD,MAAM,KAAK,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;IACtC,IAAI,KAAK,CAAC,OAAO,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC,OAAO,CAAC;IACtD,MAAM,KAAK,GAAG,SAAS,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IACjD,KAAK,CAAC,OAAO,GAAG,KAAK,CAAC;IACtB,OAAO,KAAK,CAAC;AACf,CAAC;AAiBD,mEAAmE;AACnE,MAAM,UAAU,QAAQ,CAAC,KAA0B;IACjD,OAAO;QACL,IAAI,EAAE,kBAAkB,CAAC,KAAK,CAAC;QAC/B,yEAAyE;QACzE,oCAAoC;QACpC,SAAS,EAAE,aAAa,CAAC,KAAK,EAAE,MAAM,CAAC;QACvC,SAAS,EAAE,aAAa,CAAC,KAAK,EAAE,MAAM,CAAC;QACvC,SAAS,EAAE,aAAa,CAAC,KAAK,EAAE,MAAM,CAAC;QACvC,WAAW,EAAE,aAAa,CAAC,KAAK,EAAE,QAAQ,CAAC;QAC3C,KAAK,EAAE,gBAAgB,CAAC,KAAK,CAAC;QAC9B,MAAM,EAAE,SAAS,CAAC,KAAK,CAAC;KACzB,CAAC;AACJ,CAAC;AAED,8EAA8E;AAC9E,kBAAkB;AAClB,8EAA8E;AAE9E,oDAAoD;AACpD,MAAM,UAAU,cAAc,CAAC,MAAc;IAC3C,OAAO,SAAS,EAAE,CAAC,cAAc,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;AACpD,CAAC","sourcesContent":["/**\n * Topology query functions — extract sub-shapes, compute bounds, and\n * describe shape topology. All results are lazily cached per shape.\n */\n\nimport { getKernel } from '../kernel/index.js';\nimport type { KernelShape, ShapeType, SurfaceType } from '../kernel/types.js';\nimport type {\n  AnyShape,\n  Dimension,\n  Edge,\n  Face,\n  Wire,\n  Vertex,\n  Shell,\n  Solid,\n  CompSolid,\n  ShapeKind,\n} from '../core/shapeTypes.js';\nimport { castResultShapeWithKnownType } from '../core/shapeTypes.js';\nimport { getOrQueryType } from '../core/shapeTypeCache.js';\nimport { HASH_CODE_MAX } from '../core/constants.js';\nimport type { Vec3 } from '../core/types.js';\n\n// ---------------------------------------------------------------------------\n// Fast sub-shape extraction (avoids per-item downcast + generator overhead)\n// ---------------------------------------------------------------------------\n\n/**\n * Extract sub-shapes of a known type, bypassing the generator wrapper and\n * redundant downcast calls. Uses iterShapes (C++ bulk extraction) directly\n * and passes the known type to castShape to skip the shapeType() WASM call.\n */\nfunction castSubShapes<T>(parentShape: KernelShape, type: ShapeType): T[] {\n  const kernel = getKernel();\n  const rawShapes = kernel.iterShapes(parentShape, type);\n  const result: T[] = new Array(rawShapes.length);\n  for (let i = 0; i < rawShapes.length; i++) {\n    result[i] = castResultShapeWithKnownType(rawShapes[i], type) as T;\n  }\n  return result;\n}\n\n/**\n * Count sub-shapes of a type without materialising (and disposing) a handle per\n * sub-shape. Uses the kernel's native `subShapeCount` when available (occt-wasm\n * >= 3.7.0); otherwise iterates and releases. Prefer this over\n * `getFaces(shape).length` when only the count is needed and the handles aren't\n * — it neither allocates nor warms the topology cache.\n */\nexport function subShapeCount(shape: AnyShape<Dimension>, type: ShapeType): number {\n  const kernel = getKernel();\n  if (kernel.subShapeCount) return kernel.subShapeCount(shape.wrapped, type);\n  const items = kernel.iterShapes(shape.wrapped, type);\n  for (const item of items) kernel.dispose(item);\n  return items.length;\n}\n\n/**\n * Deduplicated hashes of a shape's sub-shapes, keyed the same as\n * {@link getKernel}'s `hashCode(_, HASH_CODE_MAX)`. Uses the native\n * `subShapeHashes` when available (occt-wasm >= 3.7.0); otherwise iterates,\n * hashes, and releases. For hash-only paths (origin/tag maps) that would\n * otherwise allocate a handle per sub-shape just to hash it.\n */\nexport function subShapeHashes(shape: AnyShape<Dimension>, type: ShapeType): number[] {\n  const kernel = getKernel();\n  if (kernel.subShapeHashes) return kernel.subShapeHashes(shape.wrapped, type, HASH_CODE_MAX);\n  const seen = new Set<number>();\n  for (const item of kernel.iterShapes(shape.wrapped, type)) {\n    seen.add(kernel.hashCode(item, HASH_CODE_MAX));\n    kernel.dispose(item);\n  }\n  return [...seen];\n}\n\n// ---------------------------------------------------------------------------\n// Shared topology cache\n// ---------------------------------------------------------------------------\n\n/** @internal Cache entry type — exported for originTrackingFns and adjacencyFns. */\nexport interface TopoCacheEntry {\n  edges?: Edge<Dimension>[];\n  faces?: Face<Dimension>[];\n  wires?: Wire<Dimension>[];\n  vertices?: Vertex<Dimension>[];\n  shells?: Shell[];\n  solids?: Solid[];\n  compSolids?: CompSolid[];\n  faceOrigins?: Map<number, number>;\n  bounds?: Bounds3D;\n  isValid?: boolean;\n  surfaceType?: SurfaceType;\n  /** Edge hash → edge-face pairs for adjacency queries. Stores the edge alongside\n   *  each face so facesOfEdge can verify via isSame without re-extracting face edges. */\n  edgeToFaces?: Map<number, Array<{ edge: KernelShape; face: KernelShape }>>;\n  /** Vertex hash → vertex-face pairs — the vertex analogue of {@link edgeToFaces}. */\n  vertexToFaces?: Map<number, Array<{ vertex: KernelShape; face: KernelShape }>>;\n}\n\nconst topoCache = new WeakMap<object, TopoCacheEntry>();\n\n/**\n * Release the cached sub-shape handles for a cache entry and drop it. The\n * extractor arrays own arena slots (their branded downcast handles); the\n * adjacency maps only alias those same handles, so dropping the maps is enough.\n * Disposal is idempotent, so a manually-disposed handle here is a safe no-op.\n */\nfunction disposeCacheEntry(key: object): void {\n  const entry = topoCache.get(key);\n  if (!entry) return;\n  topoCache.delete(key);\n  const arrays = [\n    entry.edges,\n    entry.faces,\n    entry.wires,\n    entry.vertices,\n    entry.shells,\n    entry.solids,\n    entry.compSolids,\n  ];\n  for (const arr of arrays) {\n    if (arr) for (const handle of arr) handle[Symbol.dispose]();\n  }\n}\n\n/** Handles whose disposal is already wired to release their cache entry. */\nconst cleanupRegistered = new WeakSet();\n\n/** @internal Get or create a cache entry for a shape. Used by originTrackingFns. */\nexport function getOrCreateCache(shape: AnyShape<Dimension>): TopoCacheEntry {\n  const key = shape.wrapped;\n  let entry = topoCache.get(key);\n  if (!entry) {\n    entry = {};\n    topoCache.set(key, entry);\n  }\n  // Release the cached sub-shape handles when the parent shape is disposed, so\n  // its arena slots don't outlive it. (GC of an undisposed parent drops the\n  // WeakMap entry, letting the handles' own finalizers reclaim them.) Register\n  // once per handle — keyed on the handle, not the entry, so a re-query after\n  // invalidateShapeCache rebuilds the entry without stacking dead callbacks.\n  if (!cleanupRegistered.has(shape)) {\n    cleanupRegistered.add(shape);\n    shape.onDispose(() => {\n      disposeCacheEntry(key);\n    });\n  }\n  return entry;\n}\n\n/** @internal Direct cache access. Used by originTrackingFns for getFaceOrigins. */\nexport function getCacheEntry(shape: AnyShape<Dimension>): TopoCacheEntry | undefined {\n  return topoCache.get(shape.wrapped);\n}\n\n/**\n * Invalidate cached topology data for a shape, releasing its cached sub-shape\n * handles. Call this after operations that modify a shape in-place (e.g.,\n * unifyFaces).\n */\nexport function invalidateShapeCache(shape: AnyShape<Dimension>): void {\n  disposeCacheEntry(shape.wrapped);\n}\n\n// ---------------------------------------------------------------------------\n// Cached topology extractors\n// ---------------------------------------------------------------------------\n\n/** Get all edges of a shape as branded Edge handles. Results are cached per shape. */\nexport function getEdges<D extends Dimension>(shape: AnyShape<D>): Edge<D>[] {\n  const cache = getOrCreateCache(shape);\n  if (cache.edges) return cache.edges as Edge<D>[];\n  const edges = castSubShapes<Edge<D>>(shape.wrapped, 'edge');\n  cache.edges = edges;\n  return edges;\n}\n\n/**\n * Get all faces of a shape. Results are cached per shape.\n *\n * Returns `Face[]` — use `isOrientedFace()` or `orientedFace()` to narrow\n * individual faces to `OrientedFace` when the orientation guarantee is needed.\n */\nexport function getFaces<D extends Dimension>(shape: AnyShape<D>): Face<D>[] {\n  const cache = getOrCreateCache(shape);\n  if (cache.faces) return cache.faces as Face<D>[];\n  const faces = castSubShapes<Face<D>>(shape.wrapped, 'face');\n  cache.faces = faces;\n  return faces;\n}\n\n/** Get all wires of a shape as branded Wire handles. Results are cached per shape. */\nexport function getWires<D extends Dimension>(shape: AnyShape<D>): Wire<D>[] {\n  const cache = getOrCreateCache(shape);\n  if (cache.wires) return cache.wires as Wire<D>[];\n  const wires = castSubShapes<Wire<D>>(shape.wrapped, 'wire');\n  cache.wires = wires;\n  return wires;\n}\n\n/** Get all vertices of a shape as branded Vertex handles. Results are cached per shape. */\nexport function getVertices<D extends Dimension>(shape: AnyShape<D>): Vertex<D>[] {\n  const cache = getOrCreateCache(shape);\n  if (cache.vertices) return cache.vertices as Vertex<D>[];\n  const vertices = castSubShapes<Vertex<D>>(shape.wrapped, 'vertex');\n  cache.vertices = vertices;\n  return vertices;\n}\n\n/**\n * Get all solids of a shape as branded Solid handles. Results are cached per shape.\n *\n * Booleans (`cut`/`fuse`/`fuseAll`), `chamfer`/`fillet`, and some sweeps return a\n * `Compound` wrapping the solid(s); use this to unwrap them without reaching into\n * the kernel. Returns `[]` for shapes with no solids (wires, bare faces, shells).\n */\nexport function getSolids(shape: AnyShape<Dimension>): Solid[] {\n  const cache = getOrCreateCache(shape);\n  if (cache.solids) return cache.solids;\n  const solids = castSubShapes<Solid>(shape.wrapped, 'solid');\n  cache.solids = solids;\n  return solids;\n}\n\n/** Get all shells of a shape as branded Shell handles. Results are cached per shape. */\nexport function getShells(shape: AnyShape<Dimension>): Shell[] {\n  const cache = getOrCreateCache(shape);\n  if (cache.shells) return cache.shells;\n  const shells = castSubShapes<Shell>(shape.wrapped, 'shell');\n  cache.shells = shells;\n  return shells;\n}\n\n/** Get all compsolids of a shape as branded CompSolid handles. Results are cached per shape. */\nexport function getCompSolids(shape: AnyShape<Dimension>): CompSolid[] {\n  const cache = getOrCreateCache(shape);\n  if (cache.compSolids) return cache.compSolids;\n  const compSolids = castSubShapes<CompSolid>(shape.wrapped, 'compsolid');\n  cache.compSolids = compSolids;\n  return compSolids;\n}\n\n// ---------------------------------------------------------------------------\n// Lazy topology iterators (generators)\n// ---------------------------------------------------------------------------\n\n/** Lazily iterate edges of a shape, yielding branded Edge handles one at a time. */\nexport function* iterEdges<D extends Dimension>(shape: AnyShape<D>): Generator<Edge<D>> {\n  for (const e of getKernel().iterShapes(shape.wrapped, 'edge')) {\n    yield castResultShapeWithKnownType(e, 'edge') as Edge<D>;\n  }\n}\n\n/** Lazily iterate faces of a shape, yielding branded Face handles one at a time. */\nexport function* iterFaces<D extends Dimension>(shape: AnyShape<D>): Generator<Face<D>> {\n  for (const f of getKernel().iterShapes(shape.wrapped, 'face')) {\n    yield castResultShapeWithKnownType(f, 'face') as Face<D>;\n  }\n}\n\n/** Lazily iterate wires of a shape, yielding branded Wire handles one at a time. */\nexport function* iterWires<D extends Dimension>(shape: AnyShape<D>): Generator<Wire<D>> {\n  for (const w of getKernel().iterShapes(shape.wrapped, 'wire')) {\n    yield castResultShapeWithKnownType(w, 'wire') as Wire<D>;\n  }\n}\n\n/** Lazily iterate vertices of a shape, yielding branded Vertex handles one at a time. */\nexport function* iterVertices<D extends Dimension>(shape: AnyShape<D>): Generator<Vertex<D>> {\n  for (const v of getKernel().iterShapes(shape.wrapped, 'vertex')) {\n    yield castResultShapeWithKnownType(v, 'vertex') as Vertex<D>;\n  }\n}\n\n/** Lazily iterate solids of a shape, yielding branded Solid handles one at a time. */\nexport function* iterSolids(shape: AnyShape<Dimension>): Generator<Solid> {\n  for (const s of getKernel().iterShapes(shape.wrapped, 'solid')) {\n    yield castResultShapeWithKnownType(s, 'solid') as Solid;\n  }\n}\n\n/** Lazily iterate shells of a shape, yielding branded Shell handles one at a time. */\nexport function* iterShells(shape: AnyShape<Dimension>): Generator<Shell> {\n  for (const s of getKernel().iterShapes(shape.wrapped, 'shell')) {\n    yield castResultShapeWithKnownType(s, 'shell') as Shell;\n  }\n}\n\n/** Lazily iterate compsolids of a shape, yielding branded CompSolid handles one at a time. */\nexport function* iterCompSolids(shape: AnyShape<Dimension>): Generator<CompSolid> {\n  for (const s of getKernel().iterShapes(shape.wrapped, 'compsolid')) {\n    yield castResultShapeWithKnownType(s, 'compsolid') as CompSolid;\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Bounding box\n// ---------------------------------------------------------------------------\n\n/** Bounding box as a plain object. */\nexport interface Bounds3D {\n  readonly xMin: number;\n  readonly xMax: number;\n  readonly yMin: number;\n  readonly yMax: number;\n  readonly zMin: number;\n  readonly zMax: number;\n}\n\n/** Get the axis-aligned bounding box of a shape. Cached per shape. */\nexport function getBounds(shape: AnyShape<Dimension>): Bounds3D {\n  const cache = getOrCreateCache(shape);\n  if (cache.bounds) return cache.bounds;\n  const { min, max } = getKernel().boundingBox(shape.wrapped);\n  const bounds: Bounds3D = {\n    xMin: min[0],\n    xMax: max[0],\n    yMin: min[1],\n    yMax: max[1],\n    zMin: min[2],\n    zMax: max[2],\n  };\n  cache.bounds = bounds;\n  return bounds;\n}\n\n// ---------------------------------------------------------------------------\n// Cached shape kind\n// ---------------------------------------------------------------------------\n\n/** Get the topological kind of a shape. Cached per shape via shapeTypeCache. */\nexport function getCachedShapeKind(shape: AnyShape<Dimension>): ShapeKind {\n  return getOrQueryType(getKernel(), shape.wrapped);\n}\n\n/** Get the kernel surface type of a face. Cached per face (shapes are immutable). */\nexport function getCachedSurfaceType(face: Face<Dimension>): SurfaceType {\n  const cache = getOrCreateCache(face);\n  if (cache.surfaceType !== undefined) return cache.surfaceType;\n  const surfType = getKernel().surfaceType(face.wrapped);\n  cache.surfaceType = surfType;\n  return surfType;\n}\n\n/** Get whether a shape is valid. Cached per shape (shapes are immutable). */\nexport function getCachedIsValid(shape: AnyShape<Dimension>): boolean {\n  const cache = getOrCreateCache(shape);\n  if (cache.isValid !== undefined) return cache.isValid;\n  const valid = getKernel().isValid(shape.wrapped);\n  cache.isValid = valid;\n  return valid;\n}\n\n// ---------------------------------------------------------------------------\n// Shape description\n// ---------------------------------------------------------------------------\n\n/** A summary of a shape's topology, geometry, and validity. */\nexport interface ShapeDescription {\n  readonly kind: ShapeKind;\n  readonly faceCount: number;\n  readonly edgeCount: number;\n  readonly wireCount: number;\n  readonly vertexCount: number;\n  readonly valid: boolean;\n  readonly bounds: Bounds3D;\n}\n\n/** Get a quick summary of a shape for debugging and inspection. */\nexport function describe(shape: AnyShape<Dimension>): ShapeDescription {\n  return {\n    kind: getCachedShapeKind(shape),\n    // Count-only: subShapeCount avoids allocating (and caching) a handle per\n    // sub-shape just to read `.length`.\n    faceCount: subShapeCount(shape, 'face'),\n    edgeCount: subShapeCount(shape, 'edge'),\n    wireCount: subShapeCount(shape, 'wire'),\n    vertexCount: subShapeCount(shape, 'vertex'),\n    valid: getCachedIsValid(shape),\n    bounds: getBounds(shape),\n  };\n}\n\n// ---------------------------------------------------------------------------\n// Vertex position\n// ---------------------------------------------------------------------------\n\n/** Get the position of a vertex as a Vec3 tuple. */\nexport function vertexPosition(vertex: Vertex): Vec3 {\n  return getKernel().vertexPosition(vertex.wrapped);\n}\n"]}

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

@@ -0,0 +1,69 @@
+/**
+ * Immutable shape transforms — translate, rotate, scale, mirror, applyMatrix.
+ * All functions return new shapes without disposing inputs.
+ */
+import type { Vec3, MatrixInput } from '../core/types.js';
+import type { AnyShape, Dimension } from '../core/shapeTypes.js';
+import type { Result } from '../core/result.js';
+/** Translate a shape by a vector. Returns a new shape. */
+export declare function translate<T extends AnyShape<Dimension>>(shape: T, v: Vec3): T;
+/** Rotate a shape around an axis. Angle is in degrees. Returns a new shape. */
+export declare function rotate<T extends AnyShape<Dimension>>(shape: T, angle: number, position?: Vec3, direction?: Vec3): T;
+/** Mirror a shape through a plane defined by origin and normal. Returns a new shape. */
+export declare function mirror<T extends AnyShape<Dimension>>(shape: T, planeNormal?: Vec3, planeOrigin?: Vec3): T;
+/** Scale a shape uniformly. Returns a new shape. */
+export declare function scale<T extends AnyShape<Dimension>>(shape: T, factor: number, center?: Vec3): T;
+/** Resize a shape to exact target dimensions with optional auto-proportional scaling. */
+export declare function resize<T extends AnyShape<Dimension>>(shape: T, dimensions: [number | undefined, number | undefined, number | undefined], options?: {
+    auto?: boolean;
+}): Result<T>;
+/**
+ * Apply a 4x4 affine transformation matrix to a shape.
+ * Equivalent to OpenSCAD's `multmatrix`.
+ *
+ * Uses the fast `kernel transform` path for orthogonal matrices (rotation, uniform scale, mirror)
+ * and the general `gp_GTrsf` path for non-orthogonal transforms (shear, non-uniform scale).
+ */
+export declare function applyMatrix<T extends AnyShape<Dimension>>(shape: T, matrix: MatrixInput): Result<T>;
+/** A single transform operation: translate or rotate. */
+export type TransformOp = {
+    readonly type: 'translate';
+    readonly v: Vec3;
+} | {
+    readonly type: 'rotate';
+    readonly angle: number;
+    readonly axis?: Vec3;
+    readonly center?: Vec3;
+};
+/** A kernel transform with a cleanup function. Call `cleanup()` when done. */
+export interface ComposedTransform {
+    readonly trsf: any;
+    readonly cleanup: () => void;
+}
+/**
+ * Compose multiple translate/rotate operations into a single kernel transform.
+ * Operations are applied in order (first element applied first).
+ * Call `.cleanup()` on the result when done to free the kernel object.
+ */
+export declare function composeTransforms(ops: readonly TransformOp[]): ComposedTransform;
+/**
+ * Placement-only rigid move (translate / rotate) via the kernel's cheap location
+ * re-tag — an O(1) `TopLoc_Location` swap on occt-wasm ≥3.6.0, falling back to a
+ * copying transform on kernels without it. Unlike `translate` / `rotate` (which
+ * deep-copy through the history-tracking path), `locate` shares the source
+ * geometry and only re-tags its placement, then re-keys face metadata
+ * (tags/colors) onto the moved faces so it survives — the same metadata
+ * guarantee `translate` gives, at location-swap cost. For per-position placement
+ * of one cached cell (template instancing), this is the move without the copy.
+ *
+ * Accepts a single op or an ordered list (applied first-to-last, e.g. rotate
+ * then translate). Non-rigid ops (`scale`) aren't a placement and don't belong
+ * here — use `applyMatrix` for those.
+ */
+export declare function locate<T extends AnyShape<Dimension>>(shape: T, placement: TransformOp | readonly TransformOp[]): T;
+/**
+ * Clone a shape and apply a pre-composed transform in a single kernel operation.
+ * Much faster than separate clone() + translate() + rotate() calls.
+ */
+export declare function transformCopy<T extends AnyShape<Dimension>>(shape: T, composed: ComposedTransform): T;
+//# sourceMappingURL=transformFns.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"transformFns.d.ts","sourceRoot":"","sources":["../../../../src/vendored/brepjs/topology/transformFns.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,KAAK,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAC1D,OAAO,KAAK,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AAGjE,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AAehD,0DAA0D;AAC1D,wBAAgB,SAAS,CAAC,CAAC,SAAS,QAAQ,CAAC,SAAS,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,GAAG,CAAC,CAa7E;AAED,+EAA+E;AAC/E,wBAAgB,MAAM,CAAC,CAAC,SAAS,QAAQ,CAAC,SAAS,CAAC,EAClD,KAAK,EAAE,CAAC,EACR,KAAK,EAAE,MAAM,EACb,QAAQ,GAAE,IAAgB,EAC1B,SAAS,GAAE,IAAgB,GAC1B,CAAC,CAaH;AAED,wFAAwF;AACxF,wBAAgB,MAAM,CAAC,CAAC,SAAS,QAAQ,CAAC,SAAS,CAAC,EAClD,KAAK,EAAE,CAAC,EACR,WAAW,GAAE,IAAgB,EAC7B,WAAW,GAAE,IAAgB,GAC5B,CAAC,CAYH;AAED,oDAAoD;AACpD,wBAAgB,KAAK,CAAC,CAAC,SAAS,QAAQ,CAAC,SAAS,CAAC,EACjD,KAAK,EAAE,CAAC,EACR,MAAM,EAAE,MAAM,EACd,MAAM,GAAE,IAAgB,GACvB,CAAC,CAYH;AAED,yFAAyF;AACzF,wBAAgB,MAAM,CAAC,CAAC,SAAS,QAAQ,CAAC,SAAS,CAAC,EAClD,KAAK,EAAE,CAAC,EACR,UAAU,EAAE,CAAC,MAAM,GAAG,SAAS,EAAE,MAAM,GAAG,SAAS,EAAE,MAAM,GAAG,SAAS,CAAC,EACxE,OAAO,CAAC,EAAE;IAAE,IAAI,CAAC,EAAE,OAAO,CAAA;CAAE,GAC3B,MAAM,CAAC,CAAC,CAAC,CAgDX;AAiFD;;;;;;GAMG;AACH,wBAAgB,WAAW,CAAC,CAAC,SAAS,QAAQ,CAAC,SAAS,CAAC,EACvD,KAAK,EAAE,CAAC,EACR,MAAM,EAAE,WAAW,GAClB,MAAM,CAAC,CAAC,CAAC,CAwCX;AAMD,yDAAyD;AACzD,MAAM,MAAM,WAAW,GACnB;IAAE,QAAQ,CAAC,IAAI,EAAE,WAAW,CAAC;IAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAA;CAAE,GAChD;IACE,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC;IACxB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC;IACrB,QAAQ,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC;CACxB,CAAC;AAEN,8EAA8E;AAC9E,MAAM,WAAW,iBAAiB;IAEhC,QAAQ,CAAC,IAAI,EAAE,GAAG,CAAC;IACnB,QAAQ,CAAC,OAAO,EAAE,MAAM,IAAI,CAAC;CAC9B;AAED;;;;GAIG;AACH,wBAAgB,iBAAiB,CAAC,GAAG,EAAE,SAAS,WAAW,EAAE,GAAG,iBAAiB,CAchF;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,MAAM,CAAC,CAAC,SAAS,QAAQ,CAAC,SAAS,CAAC,EAClD,KAAK,EAAE,CAAC,EACR,SAAS,EAAE,WAAW,GAAG,SAAS,WAAW,EAAE,GAC9C,CAAC,CAWH;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAAC,CAAC,SAAS,QAAQ,CAAC,SAAS,CAAC,EACzD,KAAK,EAAE,CAAC,EACR,QAAQ,EAAE,iBAAiB,GAC1B,CAAC,CAWH"}