@faicad/faijs 0.13.0

package/dist/vendored/brepjs/topology/metadata/originTrackingFns.js

@@ -0,0 +1,270 @@
+/**
+ * Face origin tracking — tag faces with integer origins and propagate
+ * them through kernel operations via ShapeEvolution records.
+ */
+import { getKernel } from '../../kernel/index.js';
+import { HASH_CODE_MAX } from '../../core/constants.js';
+import { getOrCreateCache, getCacheEntry, getFaces, subShapeHashes, } from '../topologyQueryFns.js';
+// ---------------------------------------------------------------------------
+// Origin assignment
+// ---------------------------------------------------------------------------
+/**
+ * Tag all faces of a shape with an opaque integer origin.
+ * Consumers assign meaning (e.g., source line number).
+ */
+export function setShapeOrigin(shape, origin) {
+    const cache = getOrCreateCache(shape);
+    const map = new Map();
+    // Only the face hashes are needed, so use subShapeHashes — no per-face handle
+    // is allocated (native on occt-wasm >= 3.7.0; iterate-and-release elsewhere).
+    for (const hash of subShapeHashes(shape, 'face'))
+        map.set(hash, origin);
+    cache.faceOrigins = map;
+}
+/**
+ * Get the face origin map for a shape (faceHash → originTag).
+ * Returns undefined if no origins have been set or propagated.
+ */
+export function getFaceOrigins(shape) {
+    return getCacheEntry(shape)?.faceOrigins;
+}
+// ---------------------------------------------------------------------------
+// Origin propagation via evolution
+// ---------------------------------------------------------------------------
+/**
+ * Propagate face origins using a kernel-provided ShapeEvolution record.
+ */
+export function propagateOriginsFromEvolution(evolution, inputs, result) {
+    // Collect all input face origins
+    const inputOrigins = 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 = 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 {
+            // Face was not modified — reuse original hash
+            resultMap.set(hash, origin);
+        }
+        const generatedHashes = evolution.generated.get(hash);
+        if (generatedHashes) {
+            for (const genHash of generatedHashes) {
+                if (!resultMap.has(genHash)) {
+                    // Generated faces (new geometry created at a boolean seam) inherit
+                    // the origin of the input face that generated them, rather than
+                    // defaulting to 0 (body). Without this the surface where a feature
+                    // tool meets the body — e.g. a scoop ramp's top edge against the
+                    // wall — loses its tag and renders in the body color in multi-color
+                    // consumers (gridfinity-layout-tool GH #1654). first-writer-wins via
+                    // the `has` guard keeps it deterministic when a seam is shared.
+                    resultMap.set(genHash, origin);
+                }
+            }
+        }
+    }
+    if (resultMap.size > 0) {
+        const cache = getOrCreateCache(result);
+        cache.faceOrigins = resultMap;
+    }
+}
+// ---------------------------------------------------------------------------
+// Geometric matching helper
+// ---------------------------------------------------------------------------
+/** Max 3D centroid separation (mm²) for a "near" match — the general case. */
+const MAX_MATCH_DIST_SQ = 100;
+/** Min |outNormal·inNormal| for two faces to count as sharing a plane's orientation. */
+const COPLANAR_NORMAL_MIN = 0.985;
+/**
+ * Max squared perpendicular offset (mm²) from an input face's plane for the
+ * output face to count as *coplanar* with it — i.e. a piece the boolean sliced
+ * off that same planar surface. 0.1mm² tolerates kernel/mesh float noise while
+ * still separating floors that sit even a fraction of a mm apart in depth.
+ */
+const COPLANAR_OFFSET_SQ = 0.1;
+/**
+ * Find the best origin match for a result face by comparing normals and centroids
+ * against input face signatures. Returns `undefined` if no good match exists.
+ *
+ * Two passes, near strictly preferred:
+ *  1. Near match — same-facing normal (signed dot ≥ 0.707) and centroids within
+ *     {@link MAX_MATCH_DIST_SQ}. The general case for regenerated seam faces
+ *     (feature tops, flush walls). Unchanged legacy behavior. If any near match
+ *     exists it wins outright — the coplanar pass never runs — so a distant
+ *     coplanar candidate can't outscore a valid near one.
+ *  2. Coplanar match (only when no near match, and only between PLANAR faces) —
+ *     the output face lies on an input face's plane (parallel *or* antiparallel
+ *     normal, tiny perpendicular offset) regardless of how far its centroid
+ *     drifted in-plane. Two cases pass 1 misses:
+ *       • A boolean that splits a large planar face — a wide cutout floor sliced
+ *         by an overlapping deeper cutout — leaves pieces >10mm from the parent
+ *         centroid (past pass 1's cutoff).
+ *       • A cut flips the cavity face's normal versus the tool face it came from,
+ *         so the floor is antiparallel to its origin's input face.
+ *     Both left the surface tagless → body color in multi-color consumers
+ *     (gridfinity GH #2443). The planar gate keeps a curved output face from
+ *     inheriting an origin off an unrelated face that merely shares a sampled
+ *     tangent plane; among coplanar candidates the nearest in-plane wins.
+ */
+function findBestOriginMatch(outNormal, outCentroid, outPlanar, inputSigs) {
+    // Pass 1: near match — always wins when present.
+    let bestNearScore = -Infinity;
+    let bestNear;
+    for (const inp of inputSigs) {
+        const dot = outNormal[0] * inp.normal[0] + outNormal[1] * inp.normal[1] + outNormal[2] * inp.normal[2];
+        if (dot < 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 > MAX_MATCH_DIST_SQ)
+            continue;
+        const score = dot - distSq / MAX_MATCH_DIST_SQ;
+        if (score > bestNearScore) {
+            bestNearScore = score;
+            bestNear = inp.origin;
+        }
+    }
+    if (bestNear !== undefined)
+        return bestNear;
+    // Pass 2: coplanar planar-face fallback. Only planar↔planar surfaces qualify.
+    if (!outPlanar)
+        return undefined;
+    let bestInPlaneSq = Infinity;
+    let bestCoplanar;
+    for (const inp of inputSigs) {
+        if (!inp.planar)
+            continue;
+        const dot = outNormal[0] * inp.normal[0] + outNormal[1] * inp.normal[1] + outNormal[2] * inp.normal[2];
+        if (Math.abs(dot) < COPLANAR_NORMAL_MIN)
+            continue;
+        const dx = outCentroid[0] - inp.centroid[0];
+        const dy = outCentroid[1] - inp.centroid[1];
+        const dz = outCentroid[2] - inp.centroid[2];
+        const perp = dx * inp.normal[0] + dy * inp.normal[1] + dz * inp.normal[2];
+        if (perp * perp > COPLANAR_OFFSET_SQ)
+            continue;
+        const inPlaneSq = Math.max(0, dx * dx + dy * dy + dz * dz - perp * perp);
+        if (inPlaneSq < bestInPlaneSq) {
+            bestInPlaneSq = inPlaneSq;
+            bestCoplanar = inp.origin;
+        }
+    }
+    return bestCoplanar;
+}
+// ---------------------------------------------------------------------------
+// Origin propagation by hash (fallback)
+// ---------------------------------------------------------------------------
+/**
+ * Fallback origin propagation when no kernel op object is available
+ * (native `fuseAll` / `cutAll`, which expose no ShapeEvolution record).
+ *
+ * Matches result faces to input faces by hash code first. Faces that pass
+ * through the boolean unchanged keep their hash and recover their origin
+ * directly. Faces the boolean *regenerates* (split, merged, or re-created at
+ * the intersection) get a fresh hash that matches no input — these fall back
+ * to geometric matching (normal + centroid) against the input face
+ * signatures.
+ *
+ * The geometric pass runs for every unmatched face, not only when the hash
+ * pass found nothing. A partial hash match is the common case for additive
+ * features (pass-through side walls match by hash; the surfaces where the
+ * tool meets the body — feature tops, flush walls — are regenerated and need
+ * the geometric pass). Gating the fallback on "zero hash matches" left those
+ * regenerated faces with no origin, so they fell back to 0 (body) at mesh
+ * time — the multi-color export bug where a scoop/label/lip top printed in
+ * the body color. Matching against the full signature set (body origin 0
+ * included) keeps body faces body and feature faces feature.
+ */
+export function propagateOriginsByHash(inputs, result) {
+    const lookup = 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 = getKernel();
+    const resultMap = new Map();
+    const resultFaces = getFaces(result);
+    // Hash pass: faces unchanged by the boolean keep their origin directly.
+    const unmatched = [];
+    for (const f of resultFaces) {
+        const hash = kernel.hashCode(f.wrapped, HASH_CODE_MAX);
+        const origin = lookup.get(hash);
+        if (origin !== undefined) {
+            resultMap.set(hash, origin);
+        }
+        else {
+            unmatched.push(f);
+        }
+    }
+    // Geometric pass: recover origins for boolean-regenerated faces by matching
+    // surface normal + centroid against the input faces.
+    if (unmatched.length > 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, HASH_CODE_MAX);
+                const origin = origins.get(hash);
+                if (origin === undefined)
+                    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);
+                    const planar = kernel.surfaceType(f.wrapped) === 'plane';
+                    inputSigs.push({ origin, normal, centroid, planar });
+                }
+                catch {
+                    // skip faces that can't compute normal/centroid
+                }
+            }
+        }
+        if (inputSigs.length > 0) {
+            for (const f of unmatched) {
+                const hash = kernel.hashCode(f.wrapped, 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);
+                    const outPlanar = kernel.surfaceType(f.wrapped) === 'plane';
+                    const bestOrigin = findBestOriginMatch(outNormal, outCentroid, outPlanar, inputSigs);
+                    if (bestOrigin !== undefined) {
+                        resultMap.set(hash, bestOrigin);
+                    }
+                }
+                catch {
+                    // skip faces that can't compute normal/centroid
+                }
+            }
+        }
+    }
+    if (resultMap.size > 0) {
+        const cache = getOrCreateCache(result);
+        cache.faceOrigins = resultMap;
+    }
+}
+//# sourceMappingURL=originTrackingFns.js.map

package/dist/vendored/brepjs/topology/metadata/originTrackingFns.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"originTrackingFns.js","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/topology/metadata/originTrackingFns.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AAGlD,OAAO,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AACxD,OAAO,EACL,gBAAgB,EAChB,aAAa,EACb,QAAQ,EACR,cAAc,GACf,MAAM,wBAAwB,CAAC;AAEhC,8EAA8E;AAC9E,oBAAoB;AACpB,8EAA8E;AAE9E;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,KAA0B,EAAE,MAAc;IACvE,MAAM,KAAK,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;IACtC,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtC,8EAA8E;IAC9E,8EAA8E;IAC9E,KAAK,MAAM,IAAI,IAAI,cAAc,CAAC,KAAK,EAAE,MAAM,CAAC;QAAE,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IACxE,KAAK,CAAC,WAAW,GAAG,GAAG,CAAC;AAC1B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,KAA0B;IACvD,OAAO,aAAa,CAAC,KAAK,CAAC,EAAE,WAAW,CAAC;AAC3C,CAAC;AAED,8EAA8E;AAC9E,mCAAmC;AACnC,8EAA8E;AAE9E;;GAEG;AACH,MAAM,UAAU,6BAA6B,CAC3C,SAAyB,EACzB,MAAsC,EACtC,MAA2B;IAE3B,iCAAiC;IACjC,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC/C,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,MAAM,OAAO,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;QACtC,IAAI,CAAC,OAAO;YAAE,SAAS;QACvB,KAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACrC,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACjC,CAAC;IACH,CAAC;IACD,IAAI,YAAY,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO;IAEpC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;IAE5C,KAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,YAAY,EAAE,CAAC;QAC1C,IAAI,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAS;QAE1C,MAAM,cAAc,GAAG,SAAS,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACpD,IAAI,cAAc,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAChD,KAAK,MAAM,OAAO,IAAI,cAAc,EAAE,CAAC;gBACrC,SAAS,CAAC,GAAG,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;aAAM,CAAC;YACN,8CAA8C;YAC9C,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAC9B,CAAC;QAED,MAAM,eAAe,GAAG,SAAS,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACtD,IAAI,eAAe,EAAE,CAAC;YACpB,KAAK,MAAM,OAAO,IAAI,eAAe,EAAE,CAAC;gBACtC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;oBAC5B,mEAAmE;oBACnE,gEAAgE;oBAChE,mEAAmE;oBACnE,iEAAiE;oBACjE,oEAAoE;oBACpE,qEAAqE;oBACrE,gEAAgE;oBAChE,SAAS,CAAC,GAAG,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;gBACjC,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI,SAAS,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QACvB,MAAM,KAAK,GAAG,gBAAgB,CAAC,MAAM,CAAC,CAAC;QACvC,KAAK,CAAC,WAAW,GAAG,SAAS,CAAC;IAChC,CAAC;AACH,CAAC;AAED,8EAA8E;AAC9E,4BAA4B;AAC5B,8EAA8E;AAE9E,8EAA8E;AAC9E,MAAM,iBAAiB,GAAG,GAAG,CAAC;AAE9B,wFAAwF;AACxF,MAAM,mBAAmB,GAAG,KAAK,CAAC;AAElC;;;;;GAKG;AACH,MAAM,kBAAkB,GAAG,GAAG,CAAC;AAU/B;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,SAAS,mBAAmB,CAC1B,SAA4C,EAC5C,WAA8C,EAC9C,SAAkB,EAClB,SAA+B;IAE/B,iDAAiD;IACjD,IAAI,aAAa,GAAG,CAAC,QAAQ,CAAC;IAC9B,IAAI,QAA4B,CAAC;IACjC,KAAK,MAAM,GAAG,IAAI,SAAS,EAAE,CAAC;QAC5B,MAAM,GAAG,GACP,SAAS,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC7F,IAAI,GAAG,GAAG,KAAK;YAAE,SAAS;QAC1B,MAAM,EAAE,GAAG,WAAW,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC5C,MAAM,EAAE,GAAG,WAAW,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC5C,MAAM,EAAE,GAAG,WAAW,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC5C,MAAM,MAAM,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QAC3C,IAAI,MAAM,GAAG,iBAAiB;YAAE,SAAS;QACzC,MAAM,KAAK,GAAG,GAAG,GAAG,MAAM,GAAG,iBAAiB,CAAC;QAC/C,IAAI,KAAK,GAAG,aAAa,EAAE,CAAC;YAC1B,aAAa,GAAG,KAAK,CAAC;YACtB,QAAQ,GAAG,GAAG,CAAC,MAAM,CAAC;QACxB,CAAC;IACH,CAAC;IACD,IAAI,QAAQ,KAAK,SAAS;QAAE,OAAO,QAAQ,CAAC;IAE5C,8EAA8E;IAC9E,IAAI,CAAC,SAAS;QAAE,OAAO,SAAS,CAAC;IACjC,IAAI,aAAa,GAAG,QAAQ,CAAC;IAC7B,IAAI,YAAgC,CAAC;IACrC,KAAK,MAAM,GAAG,IAAI,SAAS,EAAE,CAAC;QAC5B,IAAI,CAAC,GAAG,CAAC,MAAM;YAAE,SAAS;QAC1B,MAAM,GAAG,GACP,SAAS,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC7F,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,mBAAmB;YAAE,SAAS;QAClD,MAAM,EAAE,GAAG,WAAW,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC5C,MAAM,EAAE,GAAG,WAAW,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC5C,MAAM,EAAE,GAAG,WAAW,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC5C,MAAM,IAAI,GAAG,EAAE,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC1E,IAAI,IAAI,GAAG,IAAI,GAAG,kBAAkB;YAAE,SAAS;QAC/C,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,GAAG,IAAI,CAAC,CAAC;QACzE,IAAI,SAAS,GAAG,aAAa,EAAE,CAAC;YAC9B,aAAa,GAAG,SAAS,CAAC;YAC1B,YAAY,GAAG,GAAG,CAAC,MAAM,CAAC;QAC5B,CAAC;IACH,CAAC;IACD,OAAO,YAAY,CAAC;AACtB,CAAC;AAED,8EAA8E;AAC9E,wCAAwC;AACxC,8EAA8E;AAE9E;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,UAAU,sBAAsB,CACpC,MAAsC,EACtC,MAA2B;IAE3B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,MAAM,OAAO,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;QACtC,IAAI,CAAC,OAAO;YAAE,SAAS;QACvB,KAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACrC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAC3B,CAAC;IACH,CAAC;IACD,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO;IAE9B,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC;IAC3B,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC5C,MAAM,WAAW,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;IAErC,wEAAwE;IACxE,MAAM,SAAS,GAAuB,EAAE,CAAC;IACzC,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;QAC5B,MAAM,IAAI,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC;QACvD,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAChC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAC9B,CAAC;aAAM,CAAC;YACN,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IAED,4EAA4E;IAC5E,qDAAqD;IACrD,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzB,MAAM,SAAS,GAAgB,EAAE,CAAC;QAClC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,MAAM,OAAO,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;YACtC,IAAI,CAAC,OAAO;gBAAE,SAAS;YACvB,KAAK,MAAM,CAAC,IAAI,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;gBAChC,MAAM,IAAI,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC;gBACvD,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBACjC,IAAI,MAAM,KAAK,SAAS;oBAAE,SAAS;gBACnC,IAAI,CAAC;oBACH,MAAM,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;oBAC1C,MAAM,MAAM,GAAG,MAAM,CAAC,aAAa,CACjC,CAAC,CAAC,OAAO,EACT,GAAG,GAAG,CAAC,MAAM,CAAC,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,EACjC,GAAG,GAAG,CAAC,MAAM,CAAC,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAClC,CAAC;oBACF,MAAM,QAAQ,GAAG,MAAM,CAAC,mBAAmB,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;oBACvD,MAAM,MAAM,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,OAAO,CAAC;oBACzD,SAAS,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC,CAAC;gBACvD,CAAC;gBAAC,MAAM,CAAC;oBACP,gDAAgD;gBAClD,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACzB,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;gBAC1B,MAAM,IAAI,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC;gBACvD,IAAI,CAAC;oBACH,MAAM,SAAS,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;oBAC7C,MAAM,SAAS,GAAG,MAAM,CAAC,aAAa,CACpC,CAAC,CAAC,OAAO,EACT,GAAG,GAAG,CAAC,SAAS,CAAC,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC,EACvC,GAAG,GAAG,CAAC,SAAS,CAAC,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC,CACxC,CAAC;oBACF,MAAM,WAAW,GAAG,MAAM,CAAC,mBAAmB,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;oBAC1D,MAAM,SAAS,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,OAAO,CAAC;oBAE5D,MAAM,UAAU,GAAG,mBAAmB,CAAC,SAAS,EAAE,WAAW,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;oBACrF,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;wBAC7B,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;oBAClC,CAAC;gBACH,CAAC;gBAAC,MAAM,CAAC;oBACP,gDAAgD;gBAClD,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI,SAAS,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QACvB,MAAM,KAAK,GAAG,gBAAgB,CAAC,MAAM,CAAC,CAAC;QACvC,KAAK,CAAC,WAAW,GAAG,SAAS,CAAC;IAChC,CAAC;AACH,CAAC","sourcesContent":["/**\n * Face origin tracking — tag faces with integer origins and propagate\n * them through kernel operations via ShapeEvolution records.\n */\n\nimport { getKernel } from '../../kernel/index.js';\nimport type { ShapeEvolution } from '../../kernel/types.js';\nimport type { AnyShape, Dimension } from '../../core/shapeTypes.js';\nimport { HASH_CODE_MAX } from '../../core/constants.js';\nimport {\n  getOrCreateCache,\n  getCacheEntry,\n  getFaces,\n  subShapeHashes,\n} from '../topologyQueryFns.js';\n\n// ---------------------------------------------------------------------------\n// Origin assignment\n// ---------------------------------------------------------------------------\n\n/**\n * Tag all faces of a shape with an opaque integer origin.\n * Consumers assign meaning (e.g., source line number).\n */\nexport function setShapeOrigin(shape: AnyShape<Dimension>, origin: number): void {\n  const cache = getOrCreateCache(shape);\n  const map = new Map<number, number>();\n  // Only the face hashes are needed, so use subShapeHashes — no per-face handle\n  // is allocated (native on occt-wasm >= 3.7.0; iterate-and-release elsewhere).\n  for (const hash of subShapeHashes(shape, 'face')) map.set(hash, origin);\n  cache.faceOrigins = map;\n}\n\n/**\n * Get the face origin map for a shape (faceHash → originTag).\n * Returns undefined if no origins have been set or propagated.\n */\nexport function getFaceOrigins(shape: AnyShape<Dimension>): Map<number, number> | undefined {\n  return getCacheEntry(shape)?.faceOrigins;\n}\n\n// ---------------------------------------------------------------------------\n// Origin propagation via evolution\n// ---------------------------------------------------------------------------\n\n/**\n * Propagate face origins using a kernel-provided ShapeEvolution record.\n */\nexport function propagateOriginsFromEvolution(\n  evolution: ShapeEvolution,\n  inputs: readonly AnyShape<Dimension>[],\n  result: AnyShape<Dimension>\n): void {\n  // Collect all input face origins\n  const inputOrigins = new Map<number, number>();\n  for (const input of inputs) {\n    const origins = getFaceOrigins(input);\n    if (!origins) continue;\n    for (const [hash, origin] of origins) {\n      inputOrigins.set(hash, origin);\n    }\n  }\n  if (inputOrigins.size === 0) return;\n\n  const resultMap = new Map<number, number>();\n\n  for (const [hash, origin] of inputOrigins) {\n    if (evolution.deleted.has(hash)) continue;\n\n    const modifiedHashes = evolution.modified.get(hash);\n    if (modifiedHashes && modifiedHashes.length > 0) {\n      for (const modHash of modifiedHashes) {\n        resultMap.set(modHash, origin);\n      }\n    } else {\n      // Face was not modified — reuse original hash\n      resultMap.set(hash, origin);\n    }\n\n    const generatedHashes = evolution.generated.get(hash);\n    if (generatedHashes) {\n      for (const genHash of generatedHashes) {\n        if (!resultMap.has(genHash)) {\n          // Generated faces (new geometry created at a boolean seam) inherit\n          // the origin of the input face that generated them, rather than\n          // defaulting to 0 (body). Without this the surface where a feature\n          // tool meets the body — e.g. a scoop ramp's top edge against the\n          // wall — loses its tag and renders in the body color in multi-color\n          // consumers (gridfinity-layout-tool GH #1654). first-writer-wins via\n          // the `has` guard keeps it deterministic when a seam is shared.\n          resultMap.set(genHash, origin);\n        }\n      }\n    }\n  }\n\n  if (resultMap.size > 0) {\n    const cache = getOrCreateCache(result);\n    cache.faceOrigins = resultMap;\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Geometric matching helper\n// ---------------------------------------------------------------------------\n\n/** Max 3D centroid separation (mm²) for a \"near\" match — the general case. */\nconst MAX_MATCH_DIST_SQ = 100;\n\n/** Min |outNormal·inNormal| for two faces to count as sharing a plane's orientation. */\nconst COPLANAR_NORMAL_MIN = 0.985;\n\n/**\n * Max squared perpendicular offset (mm²) from an input face's plane for the\n * output face to count as *coplanar* with it — i.e. a piece the boolean sliced\n * off that same planar surface. 0.1mm² tolerates kernel/mesh float noise while\n * still separating floors that sit even a fraction of a mm apart in depth.\n */\nconst COPLANAR_OFFSET_SQ = 0.1;\n\ninterface OriginSig {\n  readonly normal: readonly [number, number, number];\n  readonly centroid: readonly [number, number, number];\n  readonly origin: number;\n  /** True only for planar surfaces — the coplanar fallback requires it. */\n  readonly planar: boolean;\n}\n\n/**\n * Find the best origin match for a result face by comparing normals and centroids\n * against input face signatures. Returns `undefined` if no good match exists.\n *\n * Two passes, near strictly preferred:\n *  1. Near match — same-facing normal (signed dot ≥ 0.707) and centroids within\n *     {@link MAX_MATCH_DIST_SQ}. The general case for regenerated seam faces\n *     (feature tops, flush walls). Unchanged legacy behavior. If any near match\n *     exists it wins outright — the coplanar pass never runs — so a distant\n *     coplanar candidate can't outscore a valid near one.\n *  2. Coplanar match (only when no near match, and only between PLANAR faces) —\n *     the output face lies on an input face's plane (parallel *or* antiparallel\n *     normal, tiny perpendicular offset) regardless of how far its centroid\n *     drifted in-plane. Two cases pass 1 misses:\n *       • A boolean that splits a large planar face — a wide cutout floor sliced\n *         by an overlapping deeper cutout — leaves pieces >10mm from the parent\n *         centroid (past pass 1's cutoff).\n *       • A cut flips the cavity face's normal versus the tool face it came from,\n *         so the floor is antiparallel to its origin's input face.\n *     Both left the surface tagless → body color in multi-color consumers\n *     (gridfinity GH #2443). The planar gate keeps a curved output face from\n *     inheriting an origin off an unrelated face that merely shares a sampled\n *     tangent plane; among coplanar candidates the nearest in-plane wins.\n */\nfunction findBestOriginMatch(\n  outNormal: readonly [number, number, number],\n  outCentroid: readonly [number, number, number],\n  outPlanar: boolean,\n  inputSigs: readonly OriginSig[]\n): number | undefined {\n  // Pass 1: near match — always wins when present.\n  let bestNearScore = -Infinity;\n  let bestNear: number | undefined;\n  for (const inp of inputSigs) {\n    const dot =\n      outNormal[0] * inp.normal[0] + outNormal[1] * inp.normal[1] + outNormal[2] * inp.normal[2];\n    if (dot < 0.707) continue;\n    const dx = outCentroid[0] - inp.centroid[0];\n    const dy = outCentroid[1] - inp.centroid[1];\n    const dz = outCentroid[2] - inp.centroid[2];\n    const distSq = dx * dx + dy * dy + dz * dz;\n    if (distSq > MAX_MATCH_DIST_SQ) continue;\n    const score = dot - distSq / MAX_MATCH_DIST_SQ;\n    if (score > bestNearScore) {\n      bestNearScore = score;\n      bestNear = inp.origin;\n    }\n  }\n  if (bestNear !== undefined) return bestNear;\n\n  // Pass 2: coplanar planar-face fallback. Only planar↔planar surfaces qualify.\n  if (!outPlanar) return undefined;\n  let bestInPlaneSq = Infinity;\n  let bestCoplanar: number | undefined;\n  for (const inp of inputSigs) {\n    if (!inp.planar) continue;\n    const dot =\n      outNormal[0] * inp.normal[0] + outNormal[1] * inp.normal[1] + outNormal[2] * inp.normal[2];\n    if (Math.abs(dot) < COPLANAR_NORMAL_MIN) continue;\n    const dx = outCentroid[0] - inp.centroid[0];\n    const dy = outCentroid[1] - inp.centroid[1];\n    const dz = outCentroid[2] - inp.centroid[2];\n    const perp = dx * inp.normal[0] + dy * inp.normal[1] + dz * inp.normal[2];\n    if (perp * perp > COPLANAR_OFFSET_SQ) continue;\n    const inPlaneSq = Math.max(0, dx * dx + dy * dy + dz * dz - perp * perp);\n    if (inPlaneSq < bestInPlaneSq) {\n      bestInPlaneSq = inPlaneSq;\n      bestCoplanar = inp.origin;\n    }\n  }\n  return bestCoplanar;\n}\n\n// ---------------------------------------------------------------------------\n// Origin propagation by hash (fallback)\n// ---------------------------------------------------------------------------\n\n/**\n * Fallback origin propagation when no kernel op object is available\n * (native `fuseAll` / `cutAll`, which expose no ShapeEvolution record).\n *\n * Matches result faces to input faces by hash code first. Faces that pass\n * through the boolean unchanged keep their hash and recover their origin\n * directly. Faces the boolean *regenerates* (split, merged, or re-created at\n * the intersection) get a fresh hash that matches no input — these fall back\n * to geometric matching (normal + centroid) against the input face\n * signatures.\n *\n * The geometric pass runs for every unmatched face, not only when the hash\n * pass found nothing. A partial hash match is the common case for additive\n * features (pass-through side walls match by hash; the surfaces where the\n * tool meets the body — feature tops, flush walls — are regenerated and need\n * the geometric pass). Gating the fallback on \"zero hash matches\" left those\n * regenerated faces with no origin, so they fell back to 0 (body) at mesh\n * time — the multi-color export bug where a scoop/label/lip top printed in\n * the body color. Matching against the full signature set (body origin 0\n * included) keeps body faces body and feature faces feature.\n */\nexport function propagateOriginsByHash(\n  inputs: readonly AnyShape<Dimension>[],\n  result: AnyShape<Dimension>\n): void {\n  const lookup = new Map<number, number>();\n  for (const input of inputs) {\n    const origins = getFaceOrigins(input);\n    if (!origins) continue;\n    for (const [hash, origin] of origins) {\n      lookup.set(hash, origin);\n    }\n  }\n  if (lookup.size === 0) return;\n\n  const kernel = getKernel();\n  const resultMap = new Map<number, number>();\n  const resultFaces = getFaces(result);\n\n  // Hash pass: faces unchanged by the boolean keep their origin directly.\n  const unmatched: typeof resultFaces = [];\n  for (const f of resultFaces) {\n    const hash = kernel.hashCode(f.wrapped, HASH_CODE_MAX);\n    const origin = lookup.get(hash);\n    if (origin !== undefined) {\n      resultMap.set(hash, origin);\n    } else {\n      unmatched.push(f);\n    }\n  }\n\n  // Geometric pass: recover origins for boolean-regenerated faces by matching\n  // surface normal + centroid against the input faces.\n  if (unmatched.length > 0) {\n    const inputSigs: OriginSig[] = [];\n    for (const input of inputs) {\n      const origins = getFaceOrigins(input);\n      if (!origins) continue;\n      for (const f of getFaces(input)) {\n        const hash = kernel.hashCode(f.wrapped, HASH_CODE_MAX);\n        const origin = origins.get(hash);\n        if (origin === undefined) continue;\n        try {\n          const bounds = kernel.uvBounds(f.wrapped);\n          const normal = kernel.surfaceNormal(\n            f.wrapped,\n            0.5 * (bounds.uMin + bounds.uMax),\n            0.5 * (bounds.vMin + bounds.vMax)\n          );\n          const centroid = kernel.surfaceCenterOfMass(f.wrapped);\n          const planar = kernel.surfaceType(f.wrapped) === 'plane';\n          inputSigs.push({ origin, normal, centroid, planar });\n        } catch {\n          // skip faces that can't compute normal/centroid\n        }\n      }\n    }\n\n    if (inputSigs.length > 0) {\n      for (const f of unmatched) {\n        const hash = kernel.hashCode(f.wrapped, HASH_CODE_MAX);\n        try {\n          const outBounds = kernel.uvBounds(f.wrapped);\n          const outNormal = kernel.surfaceNormal(\n            f.wrapped,\n            0.5 * (outBounds.uMin + outBounds.uMax),\n            0.5 * (outBounds.vMin + outBounds.vMax)\n          );\n          const outCentroid = kernel.surfaceCenterOfMass(f.wrapped);\n          const outPlanar = kernel.surfaceType(f.wrapped) === 'plane';\n\n          const bestOrigin = findBestOriginMatch(outNormal, outCentroid, outPlanar, inputSigs);\n          if (bestOrigin !== undefined) {\n            resultMap.set(hash, bestOrigin);\n          }\n        } catch {\n          // skip faces that can't compute normal/centroid\n        }\n      }\n    }\n  }\n\n  if (resultMap.size > 0) {\n    const cache = getOrCreateCache(result);\n    cache.faceOrigins = resultMap;\n  }\n}\n"]}

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

@@ -0,0 +1,26 @@
+/**
+ * Minkowski sum operation — approximates the Minkowski sum of two 3D shapes.
+ *
+ * Uses a sphere-detection fast path (offset shell) when the tool is a sphere,
+ * otherwise falls back to a convex-hull-of-pairwise-vertex-sums approach.
+ */
+import type { Shape3D, Solid } from '../core/shapeTypes.js';
+import { type Result } from '../core/result.js';
+/** Options for the minkowski sum operation. */
+export interface MinkowskiOptions {
+    /** Tolerance for geometric operations (default: 1e-6). */
+    tolerance?: number;
+}
+/**
+ * Approximate the Minkowski sum of two 3D shapes.
+ *
+ * When the tool is a sphere, uses the fast offset-shell path.
+ * Otherwise, uses vertex placement + edge sweep + boolean fuse.
+ *
+ * @param shape - The base shape.
+ * @param tool - The tool shape (structuring element).
+ * @param options - Operation options.
+ * @returns Ok with the resulting solid, or Err on failure.
+ */
+export declare function minkowski(shape: Shape3D, tool: Shape3D, options?: MinkowskiOptions): Result<Solid>;
+//# sourceMappingURL=minkowskiFns.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"minkowskiFns.d.ts","sourceRoot":"","sources":["../../../../src/vendored/brepjs/topology/minkowskiFns.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAGH,OAAO,KAAK,EAAE,OAAO,EAAE,KAAK,EAAQ,MAAM,uBAAuB,CAAC;AAElE,OAAO,EAAE,KAAK,MAAM,EAAW,MAAM,mBAAmB,CAAC;AAUzD,+CAA+C;AAC/C,MAAM,WAAW,gBAAgB;IAC/B,0DAA0D;IAC1D,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAyHD;;;;;;;;;;GAUG;AACH,wBAAgB,SAAS,CACvB,KAAK,EAAE,OAAO,EACd,IAAI,EAAE,OAAO,EACb,OAAO,GAAE,gBAAqB,GAC7B,MAAM,CAAC,KAAK,CAAC,CA4Bf"}

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

@@ -0,0 +1,136 @@
+/**
+ * Minkowski sum operation — approximates the Minkowski sum of two 3D shapes.
+ *
+ * Uses a sphere-detection fast path (offset shell) when the tool is a sphere,
+ * otherwise falls back to a convex-hull-of-pairwise-vertex-sums approach.
+ */
+import { getKernel } from '../kernel/index.js';
+import { castResultShape, disposeResultShape, isShape3D } from '../core/shapeTypes.js';
+import { ok, err } from '../core/result.js';
+import { validationError, kernelError, typeCastError, BrepErrorCode } from '../core/errors.js';
+import { getFaces, getVertices } from './shapeFns.js';
+import { getCachedSurfaceType } from './topologyQueryFns.js';
+import { wasmIndex } from '../utils/vec3.js';
+// ---------------------------------------------------------------------------
+// Sphere detection
+// ---------------------------------------------------------------------------
+/**
+ * Check if a shape is a sphere. Returns the radius if so, or null.
+ * A sphere is detected as a shape with exactly one face whose surface
+ * type is 'sphere'.
+ */
+function detectSphere(shape) {
+    const faces = getFaces(shape);
+    if (faces.length !== 1)
+        return null;
+    const face = wasmIndex(faces, 0);
+    const surfType = getCachedSurfaceType(face);
+    if (surfType !== 'sphere')
+        return null;
+    // For a sphere with 1 face, area = 4*pi*r^2, so r = sqrt(area / (4*pi))
+    const faceArea = getKernel().area(face.wrapped);
+    const radius = Math.sqrt(faceArea / (4 * Math.PI));
+    return radius;
+}
+// ---------------------------------------------------------------------------
+// Sphere fast path (offset shell)
+// ---------------------------------------------------------------------------
+function minkowskiSphere(shape, radius, tolerance) {
+    try {
+        const resultShape = getKernel().offset(shape.wrapped, radius, tolerance);
+        const wrapped = castResultShape(resultShape);
+        if (!isShape3D(wrapped)) {
+            disposeResultShape(wrapped);
+            return err(typeCastError(BrepErrorCode.MINKOWSKI_NOT_3D, 'Minkowski sphere offset did not produce a 3D shape'));
+        }
+        return ok(wrapped);
+    }
+    catch (e) {
+        const raw = e instanceof Error ? e.message : String(e);
+        return err(kernelError(BrepErrorCode.MINKOWSKI_FAILED, `Minkowski sphere offset failed: ${raw}`, e, {
+            operation: 'minkowski',
+            fastPath: 'sphere',
+        }));
+    }
+}
+// ---------------------------------------------------------------------------
+// General path (vertex placement + edge sweep + fuse)
+// ---------------------------------------------------------------------------
+/**
+ * General Minkowski sum via convex hull of pairwise vertex sums.
+ *
+ * For two convex polyhedra A and B, their Minkowski sum equals the convex hull
+ * of {a + b : a in vertices(A), b in vertices(B)}. We build a vertex for each
+ * such sum point and pass them to the QuickHull-based hull() function.
+ */
+function minkowskiGeneral(shape, tool, tolerance) {
+    const kernel = getKernel();
+    try {
+        const shapeVerts = getVertices(shape);
+        const toolVerts = getVertices(tool);
+        if (shapeVerts.length === 0 || toolVerts.length === 0) {
+            return err(kernelError(BrepErrorCode.MINKOWSKI_FAILED, 'Minkowski sum: one or both shapes have no vertices', undefined, {
+                operation: 'minkowski',
+            }));
+        }
+        // Build pairwise sum points a+b
+        const sumPoints = [];
+        for (const sv of shapeVerts) {
+            const [ax, ay, az] = kernel.vertexPosition(sv.wrapped);
+            for (const tv of toolVerts) {
+                const [bx, by, bz] = kernel.vertexPosition(tv.wrapped);
+                sumPoints.push({ x: ax + bx, y: ay + by, z: az + bz });
+            }
+        }
+        // Compute convex hull of all sum points
+        const hullShape = kernel.hullFromPoints(sumPoints, tolerance);
+        const wrapped = castResultShape(hullShape);
+        if (!isShape3D(wrapped)) {
+            disposeResultShape(wrapped);
+            return err(typeCastError(BrepErrorCode.MINKOWSKI_NOT_3D, 'Minkowski hull did not produce a 3D shape'));
+        }
+        return ok(wrapped);
+    }
+    catch (e) {
+        const raw = e instanceof Error ? e.message : String(e);
+        return err(kernelError(BrepErrorCode.MINKOWSKI_FAILED, `Minkowski general path failed: ${raw}`, e, {
+            operation: 'minkowski',
+        }));
+    }
+}
+// ---------------------------------------------------------------------------
+// Public API
+// ---------------------------------------------------------------------------
+/**
+ * Approximate the Minkowski sum of two 3D shapes.
+ *
+ * When the tool is a sphere, uses the fast offset-shell path.
+ * Otherwise, uses vertex placement + edge sweep + boolean fuse.
+ *
+ * @param shape - The base shape.
+ * @param tool - The tool shape (structuring element).
+ * @param options - Operation options.
+ * @returns Ok with the resulting solid, or Err on failure.
+ */
+export function minkowski(shape, tool, options = {}) {
+    const { tolerance = 1e-6 } = options;
+    // Validate inputs
+    if (getKernel().isNull(shape.wrapped)) {
+        return err(validationError(BrepErrorCode.NULL_SHAPE_INPUT, 'minkowski: shape is a null shape'));
+    }
+    if (getKernel().isNull(tool.wrapped)) {
+        return err(validationError(BrepErrorCode.MINKOWSKI_NULL_TOOL, 'minkowski: tool is a null shape'));
+    }
+    // Check both are 3D
+    if (!isShape3D(shape) || !isShape3D(tool)) {
+        return err(validationError(BrepErrorCode.MINKOWSKI_NOT_3D, 'minkowski: both shape and tool must be 3D'));
+    }
+    // Sphere fast path
+    const sphereRadius = detectSphere(tool);
+    if (sphereRadius !== null) {
+        return minkowskiSphere(shape, sphereRadius, tolerance);
+    }
+    // General path
+    return minkowskiGeneral(shape, tool, tolerance);
+}
+//# sourceMappingURL=minkowskiFns.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"minkowskiFns.js","sourceRoot":"","sources":["../../../../src/vendored/brepjs/topology/minkowskiFns.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAE/C,OAAO,EAAE,eAAe,EAAE,kBAAkB,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AACvF,OAAO,EAAe,EAAE,EAAE,GAAG,EAAE,MAAM,mBAAmB,CAAC;AACzD,OAAO,EAAE,eAAe,EAAE,WAAW,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAC/F,OAAO,EAAE,QAAQ,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AACtD,OAAO,EAAE,oBAAoB,EAAE,MAAM,uBAAuB,CAAC;AAC7D,OAAO,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AAY7C,8EAA8E;AAC9E,mBAAmB;AACnB,8EAA8E;AAE9E;;;;GAIG;AACH,SAAS,YAAY,CAAC,KAAc;IAClC,MAAM,KAAK,GAAW,QAAQ,CAAC,KAAK,CAAC,CAAC;IACtC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAEpC,MAAM,IAAI,GAAG,SAAS,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IACjC,MAAM,QAAQ,GAAG,oBAAoB,CAAC,IAAI,CAAC,CAAC;IAE5C,IAAI,QAAQ,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC;IAEvC,wEAAwE;IACxE,MAAM,QAAQ,GAAG,SAAS,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAChD,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IACnD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,8EAA8E;AAC9E,kCAAkC;AAClC,8EAA8E;AAE9E,SAAS,eAAe,CAAC,KAAc,EAAE,MAAc,EAAE,SAAiB;IACxE,IAAI,CAAC;QACH,MAAM,WAAW,GAAG,SAAS,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC;QACzE,MAAM,OAAO,GAAG,eAAe,CAAC,WAAW,CAAC,CAAC;QAC7C,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC;YACxB,kBAAkB,CAAC,OAAO,CAAC,CAAC;YAC5B,OAAO,GAAG,CACR,aAAa,CACX,aAAa,CAAC,gBAAgB,EAC9B,oDAAoD,CACrD,CACF,CAAC;QACJ,CAAC;QACD,OAAO,EAAE,CAAC,OAAgB,CAAC,CAAC;IAC9B,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,MAAM,GAAG,GAAG,CAAC,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACvD,OAAO,GAAG,CACR,WAAW,CAAC,aAAa,CAAC,gBAAgB,EAAE,mCAAmC,GAAG,EAAE,EAAE,CAAC,EAAE;YACvF,SAAS,EAAE,WAAW;YACtB,QAAQ,EAAE,QAAQ;SACnB,CAAC,CACH,CAAC;IACJ,CAAC;AACH,CAAC;AAED,8EAA8E;AAC9E,sDAAsD;AACtD,8EAA8E;AAE9E;;;;;;GAMG;AACH,SAAS,gBAAgB,CAAC,KAAc,EAAE,IAAa,EAAE,SAAiB;IACxE,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC;IAE3B,IAAI,CAAC;QACH,MAAM,UAAU,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC;QACtC,MAAM,SAAS,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;QAEpC,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACtD,OAAO,GAAG,CACR,WAAW,CACT,aAAa,CAAC,gBAAgB,EAC9B,oDAAoD,EACpD,SAAS,EACT;gBACE,SAAS,EAAE,WAAW;aACvB,CACF,CACF,CAAC;QACJ,CAAC;QAED,gCAAgC;QAChC,MAAM,SAAS,GAA+C,EAAE,CAAC;QACjE,KAAK,MAAM,EAAE,IAAI,UAAU,EAAE,CAAC;YAC5B,MAAM,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,GAAG,MAAM,CAAC,cAAc,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC;YAEvD,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;gBAC3B,MAAM,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,GAAG,MAAM,CAAC,cAAc,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC;gBACvD,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC;YACzD,CAAC;QACH,CAAC;QAED,wCAAwC;QACxC,MAAM,SAAS,GAAG,MAAM,CAAC,cAAc,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QAC9D,MAAM,OAAO,GAAG,eAAe,CAAC,SAAS,CAAC,CAAC;QAC3C,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC;YACxB,kBAAkB,CAAC,OAAO,CAAC,CAAC;YAC5B,OAAO,GAAG,CACR,aAAa,CAAC,aAAa,CAAC,gBAAgB,EAAE,2CAA2C,CAAC,CAC3F,CAAC;QACJ,CAAC;QACD,OAAO,EAAE,CAAC,OAAgB,CAAC,CAAC;IAC9B,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,MAAM,GAAG,GAAG,CAAC,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACvD,OAAO,GAAG,CACR,WAAW,CAAC,aAAa,CAAC,gBAAgB,EAAE,kCAAkC,GAAG,EAAE,EAAE,CAAC,EAAE;YACtF,SAAS,EAAE,WAAW;SACvB,CAAC,CACH,CAAC;IACJ,CAAC;AACH,CAAC;AAED,8EAA8E;AAC9E,aAAa;AACb,8EAA8E;AAE9E;;;;;;;;;;GAUG;AACH,MAAM,UAAU,SAAS,CACvB,KAAc,EACd,IAAa,EACb,UAA4B,EAAE;IAE9B,MAAM,EAAE,SAAS,GAAG,IAAI,EAAE,GAAG,OAAO,CAAC;IAErC,kBAAkB;IAClB,IAAI,SAAS,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC;QACtC,OAAO,GAAG,CAAC,eAAe,CAAC,aAAa,CAAC,gBAAgB,EAAE,kCAAkC,CAAC,CAAC,CAAC;IAClG,CAAC;IACD,IAAI,SAAS,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;QACrC,OAAO,GAAG,CACR,eAAe,CAAC,aAAa,CAAC,mBAAmB,EAAE,iCAAiC,CAAC,CACtF,CAAC;IACJ,CAAC;IAED,oBAAoB;IACpB,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;QAC1C,OAAO,GAAG,CACR,eAAe,CAAC,aAAa,CAAC,gBAAgB,EAAE,2CAA2C,CAAC,CAC7F,CAAC;IACJ,CAAC;IAED,mBAAmB;IACnB,MAAM,YAAY,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;IACxC,IAAI,YAAY,KAAK,IAAI,EAAE,CAAC;QAC1B,OAAO,eAAe,CAAC,KAAK,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC;IACzD,CAAC;IAED,eAAe;IACf,OAAO,gBAAgB,CAAC,KAAK,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC;AAClD,CAAC","sourcesContent":["/**\n * Minkowski sum operation — approximates the Minkowski sum of two 3D shapes.\n *\n * Uses a sphere-detection fast path (offset shell) when the tool is a sphere,\n * otherwise falls back to a convex-hull-of-pairwise-vertex-sums approach.\n */\n\nimport { getKernel } from '../kernel/index.js';\nimport type { Shape3D, Solid, Face } from '../core/shapeTypes.js';\nimport { castResultShape, disposeResultShape, isShape3D } from '../core/shapeTypes.js';\nimport { type Result, ok, err } from '../core/result.js';\nimport { validationError, kernelError, typeCastError, BrepErrorCode } from '../core/errors.js';\nimport { getFaces, getVertices } from './shapeFns.js';\nimport { getCachedSurfaceType } from './topologyQueryFns.js';\nimport { wasmIndex } from '../utils/vec3.js';\n\n// ---------------------------------------------------------------------------\n// Types\n// ---------------------------------------------------------------------------\n\n/** Options for the minkowski sum operation. */\nexport interface MinkowskiOptions {\n  /** Tolerance for geometric operations (default: 1e-6). */\n  tolerance?: number;\n}\n\n// ---------------------------------------------------------------------------\n// Sphere detection\n// ---------------------------------------------------------------------------\n\n/**\n * Check if a shape is a sphere. Returns the radius if so, or null.\n * A sphere is detected as a shape with exactly one face whose surface\n * type is 'sphere'.\n */\nfunction detectSphere(shape: Shape3D): number | null {\n  const faces: Face[] = getFaces(shape);\n  if (faces.length !== 1) return null;\n\n  const face = wasmIndex(faces, 0);\n  const surfType = getCachedSurfaceType(face);\n\n  if (surfType !== 'sphere') return null;\n\n  // For a sphere with 1 face, area = 4*pi*r^2, so r = sqrt(area / (4*pi))\n  const faceArea = getKernel().area(face.wrapped);\n  const radius = Math.sqrt(faceArea / (4 * Math.PI));\n  return radius;\n}\n\n// ---------------------------------------------------------------------------\n// Sphere fast path (offset shell)\n// ---------------------------------------------------------------------------\n\nfunction minkowskiSphere(shape: Shape3D, radius: number, tolerance: number): Result<Solid> {\n  try {\n    const resultShape = getKernel().offset(shape.wrapped, radius, tolerance);\n    const wrapped = castResultShape(resultShape);\n    if (!isShape3D(wrapped)) {\n      disposeResultShape(wrapped);\n      return err(\n        typeCastError(\n          BrepErrorCode.MINKOWSKI_NOT_3D,\n          'Minkowski sphere offset did not produce a 3D shape'\n        )\n      );\n    }\n    return ok(wrapped as Solid);\n  } catch (e) {\n    const raw = e instanceof Error ? e.message : String(e);\n    return err(\n      kernelError(BrepErrorCode.MINKOWSKI_FAILED, `Minkowski sphere offset failed: ${raw}`, e, {\n        operation: 'minkowski',\n        fastPath: 'sphere',\n      })\n    );\n  }\n}\n\n// ---------------------------------------------------------------------------\n// General path (vertex placement + edge sweep + fuse)\n// ---------------------------------------------------------------------------\n\n/**\n * General Minkowski sum via convex hull of pairwise vertex sums.\n *\n * For two convex polyhedra A and B, their Minkowski sum equals the convex hull\n * of {a + b : a in vertices(A), b in vertices(B)}. We build a vertex for each\n * such sum point and pass them to the QuickHull-based hull() function.\n */\nfunction minkowskiGeneral(shape: Shape3D, tool: Shape3D, tolerance: number): Result<Solid> {\n  const kernel = getKernel();\n\n  try {\n    const shapeVerts = getVertices(shape);\n    const toolVerts = getVertices(tool);\n\n    if (shapeVerts.length === 0 || toolVerts.length === 0) {\n      return err(\n        kernelError(\n          BrepErrorCode.MINKOWSKI_FAILED,\n          'Minkowski sum: one or both shapes have no vertices',\n          undefined,\n          {\n            operation: 'minkowski',\n          }\n        )\n      );\n    }\n\n    // Build pairwise sum points a+b\n    const sumPoints: Array<{ x: number; y: number; z: number }> = [];\n    for (const sv of shapeVerts) {\n      const [ax, ay, az] = kernel.vertexPosition(sv.wrapped);\n\n      for (const tv of toolVerts) {\n        const [bx, by, bz] = kernel.vertexPosition(tv.wrapped);\n        sumPoints.push({ x: ax + bx, y: ay + by, z: az + bz });\n      }\n    }\n\n    // Compute convex hull of all sum points\n    const hullShape = kernel.hullFromPoints(sumPoints, tolerance);\n    const wrapped = castResultShape(hullShape);\n    if (!isShape3D(wrapped)) {\n      disposeResultShape(wrapped);\n      return err(\n        typeCastError(BrepErrorCode.MINKOWSKI_NOT_3D, 'Minkowski hull did not produce a 3D shape')\n      );\n    }\n    return ok(wrapped as Solid);\n  } catch (e) {\n    const raw = e instanceof Error ? e.message : String(e);\n    return err(\n      kernelError(BrepErrorCode.MINKOWSKI_FAILED, `Minkowski general path failed: ${raw}`, e, {\n        operation: 'minkowski',\n      })\n    );\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Public API\n// ---------------------------------------------------------------------------\n\n/**\n * Approximate the Minkowski sum of two 3D shapes.\n *\n * When the tool is a sphere, uses the fast offset-shell path.\n * Otherwise, uses vertex placement + edge sweep + boolean fuse.\n *\n * @param shape - The base shape.\n * @param tool - The tool shape (structuring element).\n * @param options - Operation options.\n * @returns Ok with the resulting solid, or Err on failure.\n */\nexport function minkowski(\n  shape: Shape3D,\n  tool: Shape3D,\n  options: MinkowskiOptions = {}\n): Result<Solid> {\n  const { tolerance = 1e-6 } = options;\n\n  // Validate inputs\n  if (getKernel().isNull(shape.wrapped)) {\n    return err(validationError(BrepErrorCode.NULL_SHAPE_INPUT, 'minkowski: shape is a null shape'));\n  }\n  if (getKernel().isNull(tool.wrapped)) {\n    return err(\n      validationError(BrepErrorCode.MINKOWSKI_NULL_TOOL, 'minkowski: tool is a null shape')\n    );\n  }\n\n  // Check both are 3D\n  if (!isShape3D(shape) || !isShape3D(tool)) {\n    return err(\n      validationError(BrepErrorCode.MINKOWSKI_NOT_3D, 'minkowski: both shape and tool must be 3D')\n    );\n  }\n\n  // Sphere fast path\n  const sphereRadius = detectSphere(tool);\n  if (sphereRadius !== null) {\n    return minkowskiSphere(shape, sphereRadius, tolerance);\n  }\n\n  // General path\n  return minkowskiGeneral(shape, tool, tolerance);\n}\n"]}

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

@@ -0,0 +1,87 @@
+/**
+ * Functional modifier operations — fillet, chamfer, shell, thicken, offset, draft.
+ *
+ * These are standalone functions that operate on branded shape types
+ * and return Result values.
+ */
+import type { Edge, Face, Shell, Solid } from '../core/shapeTypes.js';
+import type { ValidSolid } from '../core/validityTypes.js';
+import { type Result } from '../core/result.js';
+import type { Vec3 } from '../core/types.js';
+import type { DraftAngle } from './apiTypes.js';
+/**
+ * Thickens a surface (face or shell) into a solid by offsetting it.
+ *
+ * Takes a planar or non-planar surface shape and creates a solid
+ * by offsetting it by the given thickness. Positive thickness offsets
+ * along the surface normal; negative thickness offsets against it.
+ */
+export declare function thicken(shape: Face | Shell, thickness: number): Result<Solid>;
+/**
+ * Apply a fillet (rounded edge) to selected edges of a 3D shape.
+ *
+ * @param shape - The shape to modify.
+ * @param edges - Edges to fillet. Pass `undefined` to fillet all edges.
+ * @param radius - Constant radius, variable radius `[r1, r2]`, or per-edge callback.
+ */
+export declare function fillet(shape: ValidSolid, edges: ReadonlyArray<Edge> | undefined, radius: number | [number, number] | ((edge: Edge) => number | [number, number] | null), { trackEvolution }?: {
+    trackEvolution?: boolean | undefined;
+}): Result<ValidSolid>;
+/**
+ * Apply a chamfer (beveled edge) to selected edges of a 3D shape.
+ *
+ * @param shape - The shape to modify.
+ * @param edges - Edges to chamfer. Pass `undefined` to chamfer all edges.
+ * @param distance - Symmetric distance, asymmetric `[d1, d2]`, or per-edge callback.
+ */
+export declare function chamfer(shape: ValidSolid, edges: ReadonlyArray<Edge> | undefined, distance: number | [number, number] | ((edge: Edge) => number | [number, number] | null)): Result<ValidSolid>;
+/**
+ * Create a hollow shell by removing faces and offsetting remaining walls.
+ *
+ * @param shape - The solid to hollow out.
+ * @param faces - Faces to remove.
+ * @param thickness - Wall thickness.
+ * @param tolerance - Shell operation tolerance (default 1e-3).
+ */
+export declare function shell(shape: ValidSolid, faces: ReadonlyArray<Face>, thickness: number, tolerance?: number, { trackEvolution }?: {
+    trackEvolution?: boolean | undefined;
+}): Result<ValidSolid>;
+/**
+ * Offset all faces of a shape by a given distance.
+ *
+ * @param shape - The shape to offset (must be a 3D shape with faces).
+ * @param distance - Offset distance (positive = outward, negative = inward).
+ * @param tolerance - Offset tolerance (default 1e-6).
+ */
+export declare function offset(shape: ValidSolid, distance: number, tolerance?: number): Result<ValidSolid>;
+/**
+ * Apply a draft (taper) to selected faces of a 3D shape.
+ *
+ * Draft tilts faces by a specified angle relative to a pull direction,
+ * pivoting about a neutral plane. This is essential for injection molding
+ * and casting workflows where parts must release from a mold.
+ *
+ * @param shape - The solid to modify.
+ * @param faces - Faces to draft.
+ * @param pullDirection - Mold opening direction vector.
+ * @param neutralPlane - A point on the plane where faces are not displaced.
+ * @param angle - Constant angle in degrees, or per-face callback returning degrees (null to skip).
+ */
+export declare function draft(shape: ValidSolid, faces: ReadonlyArray<Face>, pullDirection: Vec3, neutralPlane: Vec3, angle: DraftAngle): Result<ValidSolid>;
+/** Specification for a radius point along a variable-radius fillet. */
+export interface VariableFilletRadius {
+    readonly param: number;
+    readonly radius: number;
+}
+/**
+ * Apply a variable-radius fillet to an edge.
+ *
+ * The radius varies along the edge according to the provided spec points.
+ * Each point specifies a normalized parameter (0 = start, 1 = end) and radius.
+ *
+ * **Cross-kernel note:** brepkit supports arbitrary multi-point radius profiles.
+ * occt-wasm supports a linear (start/end, <=2-point) profile and returns
+ * UNSUPPORTED for multi-point; the opencascade.js kernel does not implement it.
+ */
+export declare function variableFillet(shape: ValidSolid, edge: Edge, radii: ReadonlyArray<VariableFilletRadius>): Result<ValidSolid>;
+//# sourceMappingURL=modifierFns.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"modifierFns.d.ts","sourceRoot":"","sources":["../../../../src/vendored/brepjs/topology/modifierFns.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAGH,OAAO,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAgC,MAAM,uBAAuB,CAAC;AACpG,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AAG3D,OAAO,EAAE,KAAK,MAAM,EAA4B,MAAM,mBAAmB,CAAC;AAK1E,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AAC7C,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AA8IhD;;;;;;GAMG;AACH,wBAAgB,OAAO,CAAC,KAAK,EAAE,IAAI,GAAG,KAAK,EAAE,SAAS,EAAE,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,CAmB7E;AAuED;;;;;;GAMG;AACH,wBAAgB,MAAM,CACpB,KAAK,EAAE,UAAU,EACjB,KAAK,EAAE,aAAa,CAAC,IAAI,CAAC,GAAG,SAAS,EACtC,MAAM,EAAE,MAAM,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,IAAI,KAAK,MAAM,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,IAAI,CAAC,EACtF,EAAE,cAAqB,EAAE,GAAE;IAAE,cAAc,CAAC,EAAE,OAAO,GAAG,SAAS,CAAA;CAAO,GACvE,MAAM,CAAC,UAAU,CAAC,CA2CpB;AAMD;;;;;;GAMG;AACH,wBAAgB,OAAO,CACrB,KAAK,EAAE,UAAU,EACjB,KAAK,EAAE,aAAa,CAAC,IAAI,CAAC,GAAG,SAAS,EACtC,QAAQ,EAAE,MAAM,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,IAAI,KAAK,MAAM,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,IAAI,CAAC,GACvF,MAAM,CAAC,UAAU,CAAC,CA+DpB;AAMD;;;;;;;GAOG;AACH,wBAAgB,KAAK,CACnB,KAAK,EAAE,UAAU,EACjB,KAAK,EAAE,aAAa,CAAC,IAAI,CAAC,EAC1B,SAAS,EAAE,MAAM,EACjB,SAAS,SAAO,EAChB,EAAE,cAAqB,EAAE,GAAE;IAAE,cAAc,CAAC,EAAE,OAAO,GAAG,SAAS,CAAA;CAAO,GACvE,MAAM,CAAC,UAAU,CAAC,CAoDpB;AAMD;;;;;;GAMG;AACH,wBAAgB,MAAM,CAAC,KAAK,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,EAAE,SAAS,SAAO,GAAG,MAAM,CAAC,UAAU,CAAC,CA2BhG;AA0DD;;;;;;;;;;;;GAYG;AACH,wBAAgB,KAAK,CACnB,KAAK,EAAE,UAAU,EACjB,KAAK,EAAE,aAAa,CAAC,IAAI,CAAC,EAC1B,aAAa,EAAE,IAAI,EACnB,YAAY,EAAE,IAAI,EAClB,KAAK,EAAE,UAAU,GAChB,MAAM,CAAC,UAAU,CAAC,CA6CpB;AAMD,uEAAuE;AACvE,MAAM,WAAW,oBAAoB;IACnC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED;;;;;;;;;GASG;AACH,wBAAgB,cAAc,CAC5B,KAAK,EAAE,UAAU,EACjB,IAAI,EAAE,IAAI,EACV,KAAK,EAAE,aAAa,CAAC,oBAAoB,CAAC,GACzC,MAAM,CAAC,UAAU,CAAC,CAiDpB"}