@faicad/faijs 0.13.0

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

@@ -0,0 +1,28 @@
+/**
+ * Shape modifier types for fillet/chamfer operations.
+ */
+// ---------------------------------------------------------------------------
+// Type guards
+// ---------------------------------------------------------------------------
+export function isNumber(r) {
+    return typeof r === 'number';
+}
+export function isChamferRadius(r) {
+    if (typeof r === 'number')
+        return true;
+    if (typeof r === 'object' && r !== null) {
+        const obj = r;
+        return (('distances' in obj && Array.isArray(obj['distances']) && 'selectedFace' in obj) ||
+            ('distance' in obj && 'angle' in obj && 'selectedFace' in obj));
+    }
+    return false;
+}
+export function isFilletRadius(r) {
+    if (typeof r === 'number')
+        return true;
+    if (Array.isArray(r) && r.length === 2) {
+        return r.every(isNumber);
+    }
+    return false;
+}
+//# sourceMappingURL=shapeModifiers.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"shapeModifiers.js","sourceRoot":"","sources":["../../../../src/vendored/brepjs/topology/shapeModifiers.ts"],"names":[],"mappings":"AAAA;;GAEG;AAoCH,8EAA8E;AAC9E,cAAc;AACd,8EAA8E;AAE9E,MAAM,UAAU,QAAQ,CAAC,CAAU;IACjC,OAAO,OAAO,CAAC,KAAK,QAAQ,CAAC;AAC/B,CAAC;AAED,MAAM,UAAU,eAAe,CAAC,CAAU;IACxC,IAAI,OAAO,CAAC,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC;IACvC,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;QACxC,MAAM,GAAG,GAAG,CAA4B,CAAC;QACzC,OAAO,CACL,CAAC,WAAW,IAAI,GAAG,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,IAAI,cAAc,IAAI,GAAG,CAAC;YAChF,CAAC,UAAU,IAAI,GAAG,IAAI,OAAO,IAAI,GAAG,IAAI,cAAc,IAAI,GAAG,CAAC,CAC/D,CAAC;IACJ,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,MAAM,UAAU,cAAc,CAAC,CAAU;IACvC,IAAI,OAAO,CAAC,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC;IACvC,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvC,OAAO,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;IAC3B,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC","sourcesContent":["/**\n * Shape modifier types for fillet/chamfer operations.\n */\n\nimport type { EdgeFinderFn, FaceFinderFn } from '../query/finderFns.js';\nimport type { Edge } from '../core/shapeTypes.js';\n\n// ---------------------------------------------------------------------------\n// Fillet / Chamfer types\n// ---------------------------------------------------------------------------\n\n/**\n * A chamfer radius specification.\n *\n * - A number for symmetric chamfer.\n * - Two distances for asymmetric chamfer (first distance for the selected face).\n * - A distance and angle for asymmetric chamfer.\n */\nexport type ChamferRadius =\n  | number\n  | {\n      distances: [number, number];\n      selectedFace: (f: FaceFinderFn) => FaceFinderFn;\n    }\n  | {\n      distance: number;\n      angle: number;\n      selectedFace: (f: FaceFinderFn) => FaceFinderFn;\n    };\n\nexport type FilletRadius = number | [number, number];\n\n/**\n * A generic way to define radii for fillet or chamfer operations.\n */\nexport type RadiusOptions<R = number> =\n  ((e: Edge) => R | null) | R | { filter: EdgeFinderFn; radius: R; keep?: boolean };\n\n// ---------------------------------------------------------------------------\n// Type guards\n// ---------------------------------------------------------------------------\n\nexport function isNumber(r: unknown): r is number {\n  return typeof r === 'number';\n}\n\nexport function isChamferRadius(r: unknown): r is ChamferRadius {\n  if (typeof r === 'number') return true;\n  if (typeof r === 'object' && r !== null) {\n    const obj = r as Record<string, unknown>;\n    return (\n      ('distances' in obj && Array.isArray(obj['distances']) && 'selectedFace' in obj) ||\n      ('distance' in obj && 'angle' in obj && 'selectedFace' in obj)\n    );\n  }\n  return false;\n}\n\nexport function isFilletRadius(r: unknown): r is FilletRadius {\n  if (typeof r === 'number') return true;\n  if (Array.isArray(r) && r.length === 2) {\n    return r.every(isNumber);\n  }\n  return false;\n}\n"]}

package/dist/vendored/brepjs/topology/shapeRef/derivedFaceRefFns.d.ts

@@ -0,0 +1,29 @@
+/**
+ * Lineage references for *generated* faces — fillet rounds and chamfer bevels.
+ *
+ * A generated face has no stable hash: it doesn't exist until the op runs, and
+ * fillet/chamfer evolution is empty on the OCCT kernels (so even the role table
+ * can't track the faces it bridges). It's named instead by the two faces it
+ * bridges and resolved geometrically: re-find those two faces (by their captured
+ * outward normals), then take the face adjacent to *both* whose normal blends
+ * both. The flanking faces are also adjacent to both, but their normals are
+ * orthogonal to the bridged pair, so the blend filter rejects them. This is the
+ * lineage-by-neighbors approach applied to geometry the referencing edit creates.
+ */
+import type { Edge, Shape3D } from '../../core/shapeTypes.js';
+import type { DerivedFaceRef, ResolvedDerivedFaceRef, BrokenDerivedFaceRef, RoleTable } from './shapeRefTypes.js';
+/**
+ * Capture a reference to the face an `op` (fillet/chamfer) will generate across
+ * `edge`: the roles of the edge's two faces, their outward normals, and the edge
+ * midpoint. Call this on the PRE-op shape. Returns undefined when the edge
+ * doesn't bound two named faces.
+ */
+export declare function createDerivedFaceRef(origin: string, op: 'fillet' | 'chamfer', edge: Edge, preShape: Shape3D, roles: RoleTable): DerivedFaceRef | undefined;
+/**
+ * Resolve a DerivedFaceRef in the post-op `shape`: re-derive the two bridged
+ * faces (role table, else by captured normal), then return the face adjacent to
+ * both whose normal blends both. One survivor → resolved; several →
+ * nearest-to-edge-midpoint; none → broken.
+ */
+export declare function resolveDerivedFaceRef(ref: DerivedFaceRef, roles: RoleTable, shape: Shape3D): ResolvedDerivedFaceRef | BrokenDerivedFaceRef;
+//# sourceMappingURL=derivedFaceRefFns.d.ts.map

package/dist/vendored/brepjs/topology/shapeRef/derivedFaceRefFns.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"derivedFaceRefFns.d.ts","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/topology/shapeRef/derivedFaceRefFns.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAQ,OAAO,EAAE,MAAM,0BAA0B,CAAC;AAOpE,OAAO,KAAK,EACV,cAAc,EACd,sBAAsB,EACtB,oBAAoB,EACpB,SAAS,EACV,MAAM,oBAAoB,CAAC;AAgE5B;;;;;GAKG;AACH,wBAAgB,oBAAoB,CAClC,MAAM,EAAE,MAAM,EACd,EAAE,EAAE,QAAQ,GAAG,SAAS,EACxB,IAAI,EAAE,IAAI,EACV,QAAQ,EAAE,OAAO,EACjB,KAAK,EAAE,SAAS,GACf,cAAc,GAAG,SAAS,CAiB5B;AAED;;;;;GAKG;AACH,wBAAgB,qBAAqB,CACnC,GAAG,EAAE,cAAc,EACnB,KAAK,EAAE,SAAS,EAChB,KAAK,EAAE,OAAO,GACb,sBAAsB,GAAG,oBAAoB,CAuB/C"}

package/dist/vendored/brepjs/topology/shapeRef/derivedFaceRefFns.js

@@ -0,0 +1,135 @@
+/**
+ * Lineage references for *generated* faces — fillet rounds and chamfer bevels.
+ *
+ * A generated face has no stable hash: it doesn't exist until the op runs, and
+ * fillet/chamfer evolution is empty on the OCCT kernels (so even the role table
+ * can't track the faces it bridges). It's named instead by the two faces it
+ * bridges and resolved geometrically: re-find those two faces (by their captured
+ * outward normals), then take the face adjacent to *both* whose normal blends
+ * both. The flanking faces are also adjacent to both, but their normals are
+ * orthogonal to the bridged pair, so the blend filter rejects them. This is the
+ * lineage-by-neighbors approach applied to geometry the referencing edit creates.
+ */
+import { getFaces } from '../topologyQueryFns.js';
+import { getHashCode } from '../shapeFns.js';
+import { adjacentFaceHashes, facesOfEdge, verticesOfEdge } from '../adjacencyFns.js';
+import { normalAt, faceCenter } from '../faceFns.js';
+import { distance, facesForRole, roleOfFace, vertexCentroid } from './roleLookup.js';
+/** A face re-derives a bridged face when its normal is nearly identical. */
+const NORMAL_MATCH = 0.99;
+/** A generated face's normal has a positive component along BOTH bridged normals. */
+const BLEND_THRESHOLD = 0.1;
+/** Tiebreak distances closer than this are indistinguishable (→ ambiguous). */
+const HINT_MARGIN = 1e-6;
+function normalDot(a, b) {
+    return a[0] * b[0] + a[1] * b[1] + a[2] * b[2];
+}
+/** Faces whose outward normal nearly matches `normal` (re-derives a bridged face). */
+function facesByNormal(shape, normal) {
+    return getFaces(shape).filter((f) => normalDot(normalAt(f), normal) > NORMAL_MATCH);
+}
+/**
+ * Faces adjacent to BOTH face sets, excluding the sets themselves. Works purely
+ * in face-hash space via `adjacentFaceHashes` (kernel-native adjacency where
+ * available, no per-call edge extraction), then maps the surviving hashes back to
+ * the parent's borrowed cache faces — so the returned handles keep the same
+ * borrowed lifetime (freed with `shape`) the resolution path already assumes.
+ */
+function betweenFaces(shape, aFaces, bFaces) {
+    const exclude = new Set([...aFaces, ...bFaces].map(getHashCode));
+    const adjacentToA = new Set();
+    for (const a of aFaces)
+        for (const h of adjacentFaceHashes(shape, a))
+            adjacentToA.add(h);
+    const betweenHashes = [];
+    const seen = new Set();
+    for (const b of bFaces) {
+        for (const h of adjacentFaceHashes(shape, b)) {
+            if (exclude.has(h) || seen.has(h) || !adjacentToA.has(h))
+                continue;
+            seen.add(h);
+            betweenHashes.push(h);
+        }
+    }
+    if (betweenHashes.length === 0)
+        return [];
+    const byHash = new Map(getFaces(shape).map((f) => [getHashCode(f), f]));
+    return betweenHashes.map((h) => byHash.get(h)).filter((f) => f !== undefined);
+}
+/** Face whose center is nearest `point`; undefined on a tie (→ ambiguous). */
+function nearestFace(faces, point) {
+    let best;
+    let bestDist = Infinity;
+    let secondDist = Infinity;
+    for (const f of faces) {
+        const d = distance(faceCenter(f), point);
+        if (d < bestDist) {
+            secondDist = bestDist;
+            bestDist = d;
+            best = f;
+        }
+        else if (d < secondDist) {
+            secondDist = d;
+        }
+    }
+    if (best === undefined || secondDist - bestDist < HINT_MARGIN)
+        return undefined;
+    return best;
+}
+/**
+ * Capture a reference to the face an `op` (fillet/chamfer) will generate across
+ * `edge`: the roles of the edge's two faces, their outward normals, and the edge
+ * midpoint. Call this on the PRE-op shape. Returns undefined when the edge
+ * doesn't bound two named faces.
+ */
+export function createDerivedFaceRef(origin, op, edge, preShape, roles) {
+    const [faceA, faceB] = facesOfEdge(preShape, edge);
+    if (faceA === undefined || faceB === undefined)
+        return undefined;
+    const roleA = roleOfFace(faceA, origin, roles);
+    const roleB = roleOfFace(faceB, origin, roles);
+    if (roleA === undefined || roleB === undefined)
+        return undefined;
+    return {
+        origin,
+        op,
+        betweenRoles: [roleA, roleB],
+        hint: {
+            entityType: 'derived-face',
+            normalA: normalAt(faceA),
+            normalB: normalAt(faceB),
+            edgeMidpoint: vertexCentroid(verticesOfEdge(edge)),
+        },
+    };
+}
+/**
+ * Resolve a DerivedFaceRef in the post-op `shape`: re-derive the two bridged
+ * faces (role table, else by captured normal), then return the face adjacent to
+ * both whose normal blends both. One survivor → resolved; several →
+ * nearest-to-edge-midpoint; none → broken.
+ */
+export function resolveDerivedFaceRef(ref, roles, shape) {
+    let aFaces = facesForRole(shape, ref.origin, ref.betweenRoles[0], roles);
+    if (aFaces.length === 0)
+        aFaces = facesByNormal(shape, ref.hint.normalA);
+    let bFaces = facesForRole(shape, ref.origin, ref.betweenRoles[1], roles);
+    if (bFaces.length === 0)
+        bFaces = facesByNormal(shape, ref.hint.normalB);
+    if (aFaces.length === 0 || bFaces.length === 0)
+        return { ref, reason: 'not-found' };
+    const blended = betweenFaces(shape, aFaces, bFaces).filter((f) => normalDot(normalAt(f), ref.hint.normalA) > BLEND_THRESHOLD &&
+        normalDot(normalAt(f), ref.hint.normalB) > BLEND_THRESHOLD);
+    if (blended.length === 1) {
+        const [only] = blended;
+        if (only !== undefined)
+            return { face: only, confidence: 'geometric-fallback' };
+    }
+    if (blended.length > 1) {
+        const best = ref.hint.edgeMidpoint && nearestFace(blended, ref.hint.edgeMidpoint);
+        if (best)
+            return { face: best, confidence: 'geometric-fallback' };
+        return { ref, reason: 'ambiguous', candidates: blended };
+    }
+    return { ref, reason: 'not-found' };
+}
+//# sourceMappingURL=derivedFaceRefFns.js.map

package/dist/vendored/brepjs/topology/shapeRef/derivedFaceRefFns.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"derivedFaceRefFns.js","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/topology/shapeRef/derivedFaceRefFns.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAIH,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAClD,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAC7C,OAAO,EAAE,kBAAkB,EAAE,WAAW,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAC;AACrF,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AACrD,OAAO,EAAE,QAAQ,EAAE,YAAY,EAAE,UAAU,EAAE,cAAc,EAAE,MAAM,iBAAiB,CAAC;AAQrF,4EAA4E;AAC5E,MAAM,YAAY,GAAG,IAAI,CAAC;AAC1B,qFAAqF;AACrF,MAAM,eAAe,GAAG,GAAG,CAAC;AAC5B,+EAA+E;AAC/E,MAAM,WAAW,GAAG,IAAI,CAAC;AAEzB,SAAS,SAAS,CAAC,CAAO,EAAE,CAAO;IACjC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AACjD,CAAC;AAED,sFAAsF;AACtF,SAAS,aAAa,CAAC,KAAc,EAAE,MAAY;IACjD,OAAO,QAAQ,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,GAAG,YAAY,CAAC,CAAC;AACtF,CAAC;AAED;;;;;;GAMG;AACH,SAAS,YAAY,CAAC,KAAc,EAAE,MAAuB,EAAE,MAAuB;IACpF,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC;IACjE,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;IACtC,KAAK,MAAM,CAAC,IAAI,MAAM;QAAE,KAAK,MAAM,CAAC,IAAI,kBAAkB,CAAC,KAAK,EAAE,CAAC,CAAC;YAAE,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAEzF,MAAM,aAAa,GAAa,EAAE,CAAC;IACnC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,KAAK,MAAM,CAAC,IAAI,kBAAkB,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC;YAC7C,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,SAAS;YACnE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACZ,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IAED,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAC1C,MAAM,MAAM,GAAG,IAAI,GAAG,CAAe,QAAQ,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACtF,OAAO,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAa,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC;AAC3F,CAAC;AAED,8EAA8E;AAC9E,SAAS,WAAW,CAAC,KAAsB,EAAE,KAAW;IACtD,IAAI,IAAsB,CAAC;IAC3B,IAAI,QAAQ,GAAG,QAAQ,CAAC;IACxB,IAAI,UAAU,GAAG,QAAQ,CAAC;IAC1B,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,CAAC,GAAG,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QACzC,IAAI,CAAC,GAAG,QAAQ,EAAE,CAAC;YACjB,UAAU,GAAG,QAAQ,CAAC;YACtB,QAAQ,GAAG,CAAC,CAAC;YACb,IAAI,GAAG,CAAC,CAAC;QACX,CAAC;aAAM,IAAI,CAAC,GAAG,UAAU,EAAE,CAAC;YAC1B,UAAU,GAAG,CAAC,CAAC;QACjB,CAAC;IACH,CAAC;IACD,IAAI,IAAI,KAAK,SAAS,IAAI,UAAU,GAAG,QAAQ,GAAG,WAAW;QAAE,OAAO,SAAS,CAAC;IAChF,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,oBAAoB,CAClC,MAAc,EACd,EAAwB,EACxB,IAAU,EACV,QAAiB,EACjB,KAAgB;IAEhB,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,WAAW,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;IACnD,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IACjE,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;IAC/C,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;IAC/C,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IACjE,OAAO;QACL,MAAM;QACN,EAAE;QACF,YAAY,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC;QAC5B,IAAI,EAAE;YACJ,UAAU,EAAE,cAAc;YAC1B,OAAO,EAAE,QAAQ,CAAC,KAAK,CAAC;YACxB,OAAO,EAAE,QAAQ,CAAC,KAAK,CAAC;YACxB,YAAY,EAAE,cAAc,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;SACnD;KACF,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,qBAAqB,CACnC,GAAmB,EACnB,KAAgB,EAChB,KAAc;IAEd,IAAI,MAAM,GAAG,YAAY,CAAC,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACzE,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,MAAM,GAAG,aAAa,CAAC,KAAK,EAAE,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACzE,IAAI,MAAM,GAAG,YAAY,CAAC,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACzE,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,MAAM,GAAG,aAAa,CAAC,KAAK,EAAE,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACzE,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,GAAG,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC;IAEpF,MAAM,OAAO,GAAG,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,MAAM,CACxD,CAAC,CAAC,EAAE,EAAE,CACJ,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,eAAe;QAC1D,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,eAAe,CAC7D,CAAC;IAEF,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,MAAM,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC;QACvB,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,UAAU,EAAE,oBAAoB,EAAE,CAAC;IAClF,CAAC;IACD,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACvB,MAAM,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC,YAAY,IAAI,WAAW,CAAC,OAAO,EAAE,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAClF,IAAI,IAAI;YAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,UAAU,EAAE,oBAAoB,EAAE,CAAC;QAClE,OAAO,EAAE,GAAG,EAAE,MAAM,EAAE,WAAW,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC;IAC3D,CAAC;IACD,OAAO,EAAE,GAAG,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC;AACtC,CAAC","sourcesContent":["/**\n * Lineage references for *generated* faces — fillet rounds and chamfer bevels.\n *\n * A generated face has no stable hash: it doesn't exist until the op runs, and\n * fillet/chamfer evolution is empty on the OCCT kernels (so even the role table\n * can't track the faces it bridges). It's named instead by the two faces it\n * bridges and resolved geometrically: re-find those two faces (by their captured\n * outward normals), then take the face adjacent to *both* whose normal blends\n * both. The flanking faces are also adjacent to both, but their normals are\n * orthogonal to the bridged pair, so the blend filter rejects them. This is the\n * lineage-by-neighbors approach applied to geometry the referencing edit creates.\n */\n\nimport type { Edge, Face, Shape3D } from '../../core/shapeTypes.js';\nimport type { Vec3 } from '../../core/types.js';\nimport { getFaces } from '../topologyQueryFns.js';\nimport { getHashCode } from '../shapeFns.js';\nimport { adjacentFaceHashes, facesOfEdge, verticesOfEdge } from '../adjacencyFns.js';\nimport { normalAt, faceCenter } from '../faceFns.js';\nimport { distance, facesForRole, roleOfFace, vertexCentroid } from './roleLookup.js';\nimport type {\n  DerivedFaceRef,\n  ResolvedDerivedFaceRef,\n  BrokenDerivedFaceRef,\n  RoleTable,\n} from './shapeRefTypes.js';\n\n/** A face re-derives a bridged face when its normal is nearly identical. */\nconst NORMAL_MATCH = 0.99;\n/** A generated face's normal has a positive component along BOTH bridged normals. */\nconst BLEND_THRESHOLD = 0.1;\n/** Tiebreak distances closer than this are indistinguishable (→ ambiguous). */\nconst HINT_MARGIN = 1e-6;\n\nfunction normalDot(a: Vec3, b: Vec3): number {\n  return a[0] * b[0] + a[1] * b[1] + a[2] * b[2];\n}\n\n/** Faces whose outward normal nearly matches `normal` (re-derives a bridged face). */\nfunction facesByNormal(shape: Shape3D, normal: Vec3): Face[] {\n  return getFaces(shape).filter((f) => normalDot(normalAt(f), normal) > NORMAL_MATCH);\n}\n\n/**\n * Faces adjacent to BOTH face sets, excluding the sets themselves. Works purely\n * in face-hash space via `adjacentFaceHashes` (kernel-native adjacency where\n * available, no per-call edge extraction), then maps the surviving hashes back to\n * the parent's borrowed cache faces — so the returned handles keep the same\n * borrowed lifetime (freed with `shape`) the resolution path already assumes.\n */\nfunction betweenFaces(shape: Shape3D, aFaces: readonly Face[], bFaces: readonly Face[]): Face[] {\n  const exclude = new Set([...aFaces, ...bFaces].map(getHashCode));\n  const adjacentToA = new Set<number>();\n  for (const a of aFaces) for (const h of adjacentFaceHashes(shape, a)) adjacentToA.add(h);\n\n  const betweenHashes: number[] = [];\n  const seen = new Set<number>();\n  for (const b of bFaces) {\n    for (const h of adjacentFaceHashes(shape, b)) {\n      if (exclude.has(h) || seen.has(h) || !adjacentToA.has(h)) continue;\n      seen.add(h);\n      betweenHashes.push(h);\n    }\n  }\n\n  if (betweenHashes.length === 0) return [];\n  const byHash = new Map<number, Face>(getFaces(shape).map((f) => [getHashCode(f), f]));\n  return betweenHashes.map((h) => byHash.get(h)).filter((f): f is Face => f !== undefined);\n}\n\n/** Face whose center is nearest `point`; undefined on a tie (→ ambiguous). */\nfunction nearestFace(faces: readonly Face[], point: Vec3): Face | undefined {\n  let best: Face | undefined;\n  let bestDist = Infinity;\n  let secondDist = Infinity;\n  for (const f of faces) {\n    const d = distance(faceCenter(f), point);\n    if (d < bestDist) {\n      secondDist = bestDist;\n      bestDist = d;\n      best = f;\n    } else if (d < secondDist) {\n      secondDist = d;\n    }\n  }\n  if (best === undefined || secondDist - bestDist < HINT_MARGIN) return undefined;\n  return best;\n}\n\n/**\n * Capture a reference to the face an `op` (fillet/chamfer) will generate across\n * `edge`: the roles of the edge's two faces, their outward normals, and the edge\n * midpoint. Call this on the PRE-op shape. Returns undefined when the edge\n * doesn't bound two named faces.\n */\nexport function createDerivedFaceRef(\n  origin: string,\n  op: 'fillet' | 'chamfer',\n  edge: Edge,\n  preShape: Shape3D,\n  roles: RoleTable\n): DerivedFaceRef | undefined {\n  const [faceA, faceB] = facesOfEdge(preShape, edge);\n  if (faceA === undefined || faceB === undefined) return undefined;\n  const roleA = roleOfFace(faceA, origin, roles);\n  const roleB = roleOfFace(faceB, origin, roles);\n  if (roleA === undefined || roleB === undefined) return undefined;\n  return {\n    origin,\n    op,\n    betweenRoles: [roleA, roleB],\n    hint: {\n      entityType: 'derived-face',\n      normalA: normalAt(faceA),\n      normalB: normalAt(faceB),\n      edgeMidpoint: vertexCentroid(verticesOfEdge(edge)),\n    },\n  };\n}\n\n/**\n * Resolve a DerivedFaceRef in the post-op `shape`: re-derive the two bridged\n * faces (role table, else by captured normal), then return the face adjacent to\n * both whose normal blends both. One survivor → resolved; several →\n * nearest-to-edge-midpoint; none → broken.\n */\nexport function resolveDerivedFaceRef(\n  ref: DerivedFaceRef,\n  roles: RoleTable,\n  shape: Shape3D\n): ResolvedDerivedFaceRef | BrokenDerivedFaceRef {\n  let aFaces = facesForRole(shape, ref.origin, ref.betweenRoles[0], roles);\n  if (aFaces.length === 0) aFaces = facesByNormal(shape, ref.hint.normalA);\n  let bFaces = facesForRole(shape, ref.origin, ref.betweenRoles[1], roles);\n  if (bFaces.length === 0) bFaces = facesByNormal(shape, ref.hint.normalB);\n  if (aFaces.length === 0 || bFaces.length === 0) return { ref, reason: 'not-found' };\n\n  const blended = betweenFaces(shape, aFaces, bFaces).filter(\n    (f) =>\n      normalDot(normalAt(f), ref.hint.normalA) > BLEND_THRESHOLD &&\n      normalDot(normalAt(f), ref.hint.normalB) > BLEND_THRESHOLD\n  );\n\n  if (blended.length === 1) {\n    const [only] = blended;\n    if (only !== undefined) return { face: only, confidence: 'geometric-fallback' };\n  }\n  if (blended.length > 1) {\n    const best = ref.hint.edgeMidpoint && nearestFace(blended, ref.hint.edgeMidpoint);\n    if (best) return { face: best, confidence: 'geometric-fallback' };\n    return { ref, reason: 'ambiguous', candidates: blended };\n  }\n  return { ref, reason: 'not-found' };\n}\n"]}

package/dist/vendored/brepjs/topology/shapeRef/edgeRefFns.d.ts

@@ -0,0 +1,25 @@
+/**
+ * Lineage-based edge references. An edge's stable identity is the pair of roles
+ * of its two adjacent faces — "an edge is the intersection of its two faces."
+ * Capture snapshots those two face-roles (`facesOfEdge` + reverse role lookup);
+ * resolution finds the edge shared by the current faces of those roles
+ * (`sharedEdges`). Because identity rides on the (separately-resolved, split-
+ * aware) face roles, an edge ref survives edits that re-hash the edge, and it
+ * never touches the kernel's unreliable `generated`-face hashes.
+ */
+import type { Edge, Shape3D } from '../../core/shapeTypes.js';
+import type { EdgeRef, ResolvedEdgeRef, BrokenEdgeRef, RoleTable } from './shapeRefTypes.js';
+/**
+ * Capture a lineage-based reference to `edge`: its two adjacent faces' roles
+ * plus a geometric hint. Returns undefined when the edge doesn't bound two faces
+ * (a boundary/degenerate edge) or when either bounding face has no role yet.
+ */
+export declare function createEdgeRef(origin: string, edge: Edge, shape: Shape3D, roles: RoleTable): EdgeRef | undefined;
+/**
+ * Resolve an EdgeRef in `shape`: resolve its two face-roles to current faces,
+ * then return the edge they share. One shared edge → exact; several (the two
+ * faces meet along more than one edge) → disambiguate by hint; none, or a
+ * missing bounding face → broken.
+ */
+export declare function resolveEdgeRef(ref: EdgeRef, roles: RoleTable, shape: Shape3D): ResolvedEdgeRef | BrokenEdgeRef;
+//# sourceMappingURL=edgeRefFns.d.ts.map

package/dist/vendored/brepjs/topology/shapeRef/edgeRefFns.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"edgeRefFns.d.ts","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/topology/shapeRef/edgeRefFns.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,0BAA0B,CAAC;AAK9D,OAAO,KAAK,EAEV,OAAO,EACP,eAAe,EACf,aAAa,EACb,SAAS,EACV,MAAM,oBAAoB,CAAC;AAgE5B;;;;GAIG;AACH,wBAAgB,aAAa,CAC3B,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,IAAI,EACV,KAAK,EAAE,OAAO,EACd,KAAK,EAAE,SAAS,GACf,OAAO,GAAG,SAAS,CAOrB;AAED;;;;;GAKG;AACH,wBAAgB,cAAc,CAC5B,GAAG,EAAE,OAAO,EACZ,KAAK,EAAE,SAAS,EAChB,KAAK,EAAE,OAAO,GACb,eAAe,GAAG,aAAa,CAwBjC"}

package/dist/vendored/brepjs/topology/shapeRef/edgeRefFns.js

@@ -0,0 +1,123 @@
+/**
+ * Lineage-based edge references. An edge's stable identity is the pair of roles
+ * of its two adjacent faces — "an edge is the intersection of its two faces."
+ * Capture snapshots those two face-roles (`facesOfEdge` + reverse role lookup);
+ * resolution finds the edge shared by the current faces of those roles
+ * (`sharedEdges`). Because identity rides on the (separately-resolved, split-
+ * aware) face roles, an edge ref survives edits that re-hash the edge, and it
+ * never touches the kernel's unreliable `generated`-face hashes.
+ */
+import { getHashCode } from '../shapeFns.js';
+import { facesOfEdge, sharedEdges, verticesOfEdge } from '../adjacencyFns.js';
+import { measureLength } from '../../measurement/measureFns.js';
+import { distance, facesForRole, roleOfFace, vertexCentroid } from './roleLookup.js';
+function captureEdgeHint(edge) {
+    const lengthResult = measureLength(edge);
+    return {
+        entityType: 'edge',
+        length: lengthResult.ok ? lengthResult.value : undefined,
+        midpoint: vertexCentroid(verticesOfEdge(edge)),
+    };
+}
+function dedupeEdges(edges) {
+    const seen = new Set();
+    const out = [];
+    for (const e of edges) {
+        const h = getHashCode(e);
+        if (!seen.has(h)) {
+            seen.add(h);
+            out.push(e);
+        }
+    }
+    return out;
+}
+/** Hint scores closer than this are treated as indistinguishable (→ ambiguous). */
+const HINT_MARGIN = 1e-6;
+/**
+ * Pick the candidate edge closest to the hint (length + endpoint midpoint).
+ * Returns undefined when it genuinely can't discriminate — the hint carries no
+ * signal, or the two best candidates score within {@link HINT_MARGIN} — so the
+ * caller can report `ambiguous` rather than committing to an arbitrary edge.
+ */
+function bestByHint(candidates, hint) {
+    if (hint.length === undefined && hint.midpoint === undefined)
+        return undefined;
+    let best;
+    let bestScore = Infinity;
+    let secondScore = Infinity;
+    for (const edge of candidates) {
+        let score = 0;
+        if (hint.length !== undefined) {
+            const len = measureLength(edge);
+            if (len.ok)
+                score += Math.abs(len.value - hint.length);
+        }
+        if (hint.midpoint !== undefined) {
+            const mid = vertexCentroid(verticesOfEdge(edge));
+            if (mid !== undefined)
+                score += distance(hint.midpoint, mid);
+        }
+        if (score < bestScore) {
+            secondScore = bestScore;
+            bestScore = score;
+            best = edge;
+        }
+        else if (score < secondScore) {
+            secondScore = score;
+        }
+    }
+    if (best === undefined || secondScore - bestScore < HINT_MARGIN)
+        return undefined;
+    return best;
+}
+// ---------------------------------------------------------------------------
+// Public API
+// ---------------------------------------------------------------------------
+/**
+ * Capture a lineage-based reference to `edge`: its two adjacent faces' roles
+ * plus a geometric hint. Returns undefined when the edge doesn't bound two faces
+ * (a boundary/degenerate edge) or when either bounding face has no role yet.
+ */
+export function createEdgeRef(origin, edge, shape, roles) {
+    const [faceA, faceB] = facesOfEdge(shape, edge);
+    if (faceA === undefined || faceB === undefined)
+        return undefined;
+    const roleA = roleOfFace(faceA, origin, roles);
+    const roleB = roleOfFace(faceB, origin, roles);
+    if (roleA === undefined || roleB === undefined)
+        return undefined;
+    return { origin, faceRoles: [roleA, roleB], hint: captureEdgeHint(edge) };
+}
+/**
+ * Resolve an EdgeRef in `shape`: resolve its two face-roles to current faces,
+ * then return the edge they share. One shared edge → exact; several (the two
+ * faces meet along more than one edge) → disambiguate by hint; none, or a
+ * missing bounding face → broken.
+ */
+export function resolveEdgeRef(ref, roles, shape) {
+    const [roleA, roleB] = ref.faceRoles;
+    const facesA = facesForRole(shape, ref.origin, roleA, roles);
+    const facesB = facesForRole(shape, ref.origin, roleB, roles);
+    if (facesA.length === 0 || facesB.length === 0) {
+        return { ref, reason: 'not-found' };
+    }
+    const candidates = [];
+    for (const a of facesA) {
+        for (const b of facesB)
+            candidates.push(...sharedEdges(a, b));
+    }
+    const unique = dedupeEdges(candidates);
+    if (unique.length === 1) {
+        const [only] = unique;
+        if (only !== undefined)
+            return { edge: only, confidence: 'exact' };
+    }
+    if (unique.length > 1) {
+        const best = bestByHint(unique, ref.hint);
+        if (best !== undefined)
+            return { edge: best, confidence: 'geometric-fallback' };
+        return { ref, reason: 'ambiguous', candidates: unique };
+    }
+    return { ref, reason: 'not-found' };
+}
+//# sourceMappingURL=edgeRefFns.js.map

package/dist/vendored/brepjs/topology/shapeRef/edgeRefFns.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"edgeRefFns.js","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/topology/shapeRef/edgeRefFns.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAGH,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAC7C,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAC;AAC9E,OAAO,EAAE,aAAa,EAAE,MAAM,iCAAiC,CAAC;AAChE,OAAO,EAAE,QAAQ,EAAE,YAAY,EAAE,UAAU,EAAE,cAAc,EAAE,MAAM,iBAAiB,CAAC;AASrF,SAAS,eAAe,CAAC,IAAU;IACjC,MAAM,YAAY,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;IACzC,OAAO;QACL,UAAU,EAAE,MAAM;QAClB,MAAM,EAAE,YAAY,CAAC,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS;QACxD,QAAQ,EAAE,cAAc,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;KAC/C,CAAC;AACJ,CAAC;AAED,SAAS,WAAW,CAAC,KAAsB;IACzC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,GAAG,GAAW,EAAE,CAAC;IACvB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;QACzB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YACjB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACZ,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,mFAAmF;AACnF,MAAM,WAAW,GAAG,IAAI,CAAC;AAEzB;;;;;GAKG;AACH,SAAS,UAAU,CAAC,UAA2B,EAAE,IAAc;IAC7D,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IAC/E,IAAI,IAAsB,CAAC;IAC3B,IAAI,SAAS,GAAG,QAAQ,CAAC;IACzB,IAAI,WAAW,GAAG,QAAQ,CAAC;IAC3B,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;QAC9B,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;YAC9B,MAAM,GAAG,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;YAChC,IAAI,GAAG,CAAC,EAAE;gBAAE,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;QACzD,CAAC;QACD,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YAChC,MAAM,GAAG,GAAG,cAAc,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC;YACjD,IAAI,GAAG,KAAK,SAAS;gBAAE,KAAK,IAAI,QAAQ,CAAC,IAAI,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;QAC/D,CAAC;QACD,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;YACtB,WAAW,GAAG,SAAS,CAAC;YACxB,SAAS,GAAG,KAAK,CAAC;YAClB,IAAI,GAAG,IAAI,CAAC;QACd,CAAC;aAAM,IAAI,KAAK,GAAG,WAAW,EAAE,CAAC;YAC/B,WAAW,GAAG,KAAK,CAAC;QACtB,CAAC;IACH,CAAC;IACD,IAAI,IAAI,KAAK,SAAS,IAAI,WAAW,GAAG,SAAS,GAAG,WAAW;QAAE,OAAO,SAAS,CAAC;IAClF,OAAO,IAAI,CAAC;AACd,CAAC;AAED,8EAA8E;AAC9E,aAAa;AACb,8EAA8E;AAE9E;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAC3B,MAAc,EACd,IAAU,EACV,KAAc,EACd,KAAgB;IAEhB,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAChD,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IACjE,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;IAC/C,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;IAC/C,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IACjE,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,IAAI,EAAE,eAAe,CAAC,IAAI,CAAC,EAAE,CAAC;AAC5E,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,cAAc,CAC5B,GAAY,EACZ,KAAgB,EAChB,KAAc;IAEd,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,GAAG,CAAC,SAAS,CAAC;IACrC,MAAM,MAAM,GAAG,YAAY,CAAC,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IAC7D,MAAM,MAAM,GAAG,YAAY,CAAC,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IAC7D,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC/C,OAAO,EAAE,GAAG,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC;IACtC,CAAC;IAED,MAAM,UAAU,GAAW,EAAE,CAAC;IAC9B,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,KAAK,MAAM,CAAC,IAAI,MAAM;YAAE,UAAU,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAChE,CAAC;IACD,MAAM,MAAM,GAAG,WAAW,CAAC,UAAU,CAAC,CAAC;IAEvC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,MAAM,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC;QACtB,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC;IACrE,CAAC;IACD,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtB,MAAM,IAAI,GAAG,UAAU,CAAC,MAAM,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;QAC1C,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,UAAU,EAAE,oBAAoB,EAAE,CAAC;QAChF,OAAO,EAAE,GAAG,EAAE,MAAM,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,EAAE,CAAC;IAC1D,CAAC;IACD,OAAO,EAAE,GAAG,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC;AACtC,CAAC","sourcesContent":["/**\n * Lineage-based edge references. An edge's stable identity is the pair of roles\n * of its two adjacent faces — \"an edge is the intersection of its two faces.\"\n * Capture snapshots those two face-roles (`facesOfEdge` + reverse role lookup);\n * resolution finds the edge shared by the current faces of those roles\n * (`sharedEdges`). Because identity rides on the (separately-resolved, split-\n * aware) face roles, an edge ref survives edits that re-hash the edge, and it\n * never touches the kernel's unreliable `generated`-face hashes.\n */\n\nimport type { Edge, Shape3D } from '../../core/shapeTypes.js';\nimport { getHashCode } from '../shapeFns.js';\nimport { facesOfEdge, sharedEdges, verticesOfEdge } from '../adjacencyFns.js';\nimport { measureLength } from '../../measurement/measureFns.js';\nimport { distance, facesForRole, roleOfFace, vertexCentroid } from './roleLookup.js';\nimport type {\n  EdgeHint,\n  EdgeRef,\n  ResolvedEdgeRef,\n  BrokenEdgeRef,\n  RoleTable,\n} from './shapeRefTypes.js';\n\nfunction captureEdgeHint(edge: Edge): EdgeHint {\n  const lengthResult = measureLength(edge);\n  return {\n    entityType: 'edge',\n    length: lengthResult.ok ? lengthResult.value : undefined,\n    midpoint: vertexCentroid(verticesOfEdge(edge)),\n  };\n}\n\nfunction dedupeEdges(edges: readonly Edge[]): Edge[] {\n  const seen = new Set<number>();\n  const out: Edge[] = [];\n  for (const e of edges) {\n    const h = getHashCode(e);\n    if (!seen.has(h)) {\n      seen.add(h);\n      out.push(e);\n    }\n  }\n  return out;\n}\n\n/** Hint scores closer than this are treated as indistinguishable (→ ambiguous). */\nconst HINT_MARGIN = 1e-6;\n\n/**\n * Pick the candidate edge closest to the hint (length + endpoint midpoint).\n * Returns undefined when it genuinely can't discriminate — the hint carries no\n * signal, or the two best candidates score within {@link HINT_MARGIN} — so the\n * caller can report `ambiguous` rather than committing to an arbitrary edge.\n */\nfunction bestByHint(candidates: readonly Edge[], hint: EdgeHint): Edge | undefined {\n  if (hint.length === undefined && hint.midpoint === undefined) return undefined;\n  let best: Edge | undefined;\n  let bestScore = Infinity;\n  let secondScore = Infinity;\n  for (const edge of candidates) {\n    let score = 0;\n    if (hint.length !== undefined) {\n      const len = measureLength(edge);\n      if (len.ok) score += Math.abs(len.value - hint.length);\n    }\n    if (hint.midpoint !== undefined) {\n      const mid = vertexCentroid(verticesOfEdge(edge));\n      if (mid !== undefined) score += distance(hint.midpoint, mid);\n    }\n    if (score < bestScore) {\n      secondScore = bestScore;\n      bestScore = score;\n      best = edge;\n    } else if (score < secondScore) {\n      secondScore = score;\n    }\n  }\n  if (best === undefined || secondScore - bestScore < HINT_MARGIN) return undefined;\n  return best;\n}\n\n// ---------------------------------------------------------------------------\n// Public API\n// ---------------------------------------------------------------------------\n\n/**\n * Capture a lineage-based reference to `edge`: its two adjacent faces' roles\n * plus a geometric hint. Returns undefined when the edge doesn't bound two faces\n * (a boundary/degenerate edge) or when either bounding face has no role yet.\n */\nexport function createEdgeRef(\n  origin: string,\n  edge: Edge,\n  shape: Shape3D,\n  roles: RoleTable\n): EdgeRef | undefined {\n  const [faceA, faceB] = facesOfEdge(shape, edge);\n  if (faceA === undefined || faceB === undefined) return undefined;\n  const roleA = roleOfFace(faceA, origin, roles);\n  const roleB = roleOfFace(faceB, origin, roles);\n  if (roleA === undefined || roleB === undefined) return undefined;\n  return { origin, faceRoles: [roleA, roleB], hint: captureEdgeHint(edge) };\n}\n\n/**\n * Resolve an EdgeRef in `shape`: resolve its two face-roles to current faces,\n * then return the edge they share. One shared edge → exact; several (the two\n * faces meet along more than one edge) → disambiguate by hint; none, or a\n * missing bounding face → broken.\n */\nexport function resolveEdgeRef(\n  ref: EdgeRef,\n  roles: RoleTable,\n  shape: Shape3D\n): ResolvedEdgeRef | BrokenEdgeRef {\n  const [roleA, roleB] = ref.faceRoles;\n  const facesA = facesForRole(shape, ref.origin, roleA, roles);\n  const facesB = facesForRole(shape, ref.origin, roleB, roles);\n  if (facesA.length === 0 || facesB.length === 0) {\n    return { ref, reason: 'not-found' };\n  }\n\n  const candidates: Edge[] = [];\n  for (const a of facesA) {\n    for (const b of facesB) candidates.push(...sharedEdges(a, b));\n  }\n  const unique = dedupeEdges(candidates);\n\n  if (unique.length === 1) {\n    const [only] = unique;\n    if (only !== undefined) return { edge: only, confidence: 'exact' };\n  }\n  if (unique.length > 1) {\n    const best = bestByHint(unique, ref.hint);\n    if (best !== undefined) return { edge: best, confidence: 'geometric-fallback' };\n    return { ref, reason: 'ambiguous', candidates: unique };\n  }\n  return { ref, reason: 'not-found' };\n}\n"]}

package/dist/vendored/brepjs/topology/shapeRef/index.d.ts

@@ -0,0 +1,11 @@
+/**
+ * ShapeRef — stable, serializable face references for parametric replay.
+ */
+export type { GeometricHint, ShapeRef, RoleTable, ResolvedRef, BrokenRef, EdgeHint, EdgeRef, ResolvedEdgeRef, BrokenEdgeRef, VertexHint, VertexRef, ResolvedVertexRef, BrokenVertexRef, DerivedFaceHint, DerivedFaceRef, ResolvedDerivedFaceRef, BrokenDerivedFaceRef, } from './shapeRefTypes.js';
+export { type FaceScorer, defaultScorer } from './scoring.js';
+export { captureHint, assignRoles, createRef, updateRoles, resolveRef } from './shapeRefFns.js';
+export { createEdgeRef, resolveEdgeRef } from './edgeRefFns.js';
+export { createVertexRef, resolveVertexRef } from './vertexRefFns.js';
+export { createDerivedFaceRef, resolveDerivedFaceRef } from './derivedFaceRefFns.js';
+export { type LineageRef, type ResolvedEntity, type BrokenReason, type LineageResolution, isLineageRef, isFaceRef, isEdgeRef, isVertexRef, isDerivedFaceRef, resolveLineageRef, resolveRefIn, resolveRefParams, } from './refResolveFns.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/vendored/brepjs/topology/shapeRef/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/topology/shapeRef/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,YAAY,EACV,aAAa,EACb,QAAQ,EACR,SAAS,EACT,WAAW,EACX,SAAS,EACT,QAAQ,EACR,OAAO,EACP,eAAe,EACf,aAAa,EACb,UAAU,EACV,SAAS,EACT,iBAAiB,EACjB,eAAe,EACf,eAAe,EACf,cAAc,EACd,sBAAsB,EACtB,oBAAoB,GACrB,MAAM,oBAAoB,CAAC;AAE5B,OAAO,EAAE,KAAK,UAAU,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAE9D,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,SAAS,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAEhG,OAAO,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,iBAAiB,CAAC;AAEhE,OAAO,EAAE,eAAe,EAAE,gBAAgB,EAAE,MAAM,mBAAmB,CAAC;AAEtE,OAAO,EAAE,oBAAoB,EAAE,qBAAqB,EAAE,MAAM,wBAAwB,CAAC;AAErF,OAAO,EACL,KAAK,UAAU,EACf,KAAK,cAAc,EACnB,KAAK,YAAY,EACjB,KAAK,iBAAiB,EACtB,YAAY,EACZ,SAAS,EACT,SAAS,EACT,WAAW,EACX,gBAAgB,EAChB,iBAAiB,EACjB,YAAY,EACZ,gBAAgB,GACjB,MAAM,oBAAoB,CAAC"}

package/dist/vendored/brepjs/topology/shapeRef/index.js

@@ -0,0 +1,10 @@
+/**
+ * ShapeRef — stable, serializable face references for parametric replay.
+ */
+export { defaultScorer } from './scoring.js';
+export { captureHint, assignRoles, createRef, updateRoles, resolveRef } from './shapeRefFns.js';
+export { createEdgeRef, resolveEdgeRef } from './edgeRefFns.js';
+export { createVertexRef, resolveVertexRef } from './vertexRefFns.js';
+export { createDerivedFaceRef, resolveDerivedFaceRef } from './derivedFaceRefFns.js';
+export { isLineageRef, isFaceRef, isEdgeRef, isVertexRef, isDerivedFaceRef, resolveLineageRef, resolveRefIn, resolveRefParams, } from './refResolveFns.js';
+//# sourceMappingURL=index.js.map

package/dist/vendored/brepjs/topology/shapeRef/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/topology/shapeRef/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAsBH,OAAO,EAAmB,aAAa,EAAE,MAAM,cAAc,CAAC;AAE9D,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,SAAS,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAEhG,OAAO,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,iBAAiB,CAAC;AAEhE,OAAO,EAAE,eAAe,EAAE,gBAAgB,EAAE,MAAM,mBAAmB,CAAC;AAEtE,OAAO,EAAE,oBAAoB,EAAE,qBAAqB,EAAE,MAAM,wBAAwB,CAAC;AAErF,OAAO,EAKL,YAAY,EACZ,SAAS,EACT,SAAS,EACT,WAAW,EACX,gBAAgB,EAChB,iBAAiB,EACjB,YAAY,EACZ,gBAAgB,GACjB,MAAM,oBAAoB,CAAC","sourcesContent":["/**\n * ShapeRef — stable, serializable face references for parametric replay.\n */\n\nexport type {\n  GeometricHint,\n  ShapeRef,\n  RoleTable,\n  ResolvedRef,\n  BrokenRef,\n  EdgeHint,\n  EdgeRef,\n  ResolvedEdgeRef,\n  BrokenEdgeRef,\n  VertexHint,\n  VertexRef,\n  ResolvedVertexRef,\n  BrokenVertexRef,\n  DerivedFaceHint,\n  DerivedFaceRef,\n  ResolvedDerivedFaceRef,\n  BrokenDerivedFaceRef,\n} from './shapeRefTypes.js';\n\nexport { type FaceScorer, defaultScorer } from './scoring.js';\n\nexport { captureHint, assignRoles, createRef, updateRoles, resolveRef } from './shapeRefFns.js';\n\nexport { createEdgeRef, resolveEdgeRef } from './edgeRefFns.js';\n\nexport { createVertexRef, resolveVertexRef } from './vertexRefFns.js';\n\nexport { createDerivedFaceRef, resolveDerivedFaceRef } from './derivedFaceRefFns.js';\n\nexport {\n  type LineageRef,\n  type ResolvedEntity,\n  type BrokenReason,\n  type LineageResolution,\n  isLineageRef,\n  isFaceRef,\n  isEdgeRef,\n  isVertexRef,\n  isDerivedFaceRef,\n  resolveLineageRef,\n  resolveRefIn,\n  resolveRefParams,\n} from './refResolveFns.js';\n"]}

package/dist/vendored/brepjs/topology/shapeRef/refResolveFns.d.ts

@@ -0,0 +1,66 @@
+/**
+ * Consumer-facing resolution for lineage references — the layer that turns the
+ * capture/resolve primitives into a parametric-replay flow.
+ *
+ * A downstream op (fillet, offset, shell, ...) names the entity it acts on with
+ * a lineage ref at author time. When an upstream parameter changes and the model
+ * is rebuilt, these helpers re-resolve that ref to the live entity on the new
+ * shape, so the op re-targets the *same* feature instead of a stale hash. One
+ * unified dispatch covers all four ref kinds (face / edge / vertex / generated
+ * face), since they share the `(ref, roles, shape)` resolve signature.
+ */
+import type { Edge, Face, Shape3D, Vertex } from '../../core/shapeTypes.js';
+import type { ShapeRef, EdgeRef, VertexRef, DerivedFaceRef, RoleTable } from './shapeRefTypes.js';
+/** Any of the four lineage reference kinds. */
+export type LineageRef = ShapeRef | EdgeRef | VertexRef | DerivedFaceRef;
+/** The live entity a lineage ref resolves to. */
+export type ResolvedEntity = Face | Edge | Vertex;
+/** Why a lineage ref failed to resolve (preserved from the underlying resolver). */
+export type BrokenReason = 'ambiguous' | 'not-found' | 'deleted';
+/**
+ * Outcome of resolving a lineage ref. Carries the failure `reason` (and any tied
+ * `candidates`) rather than collapsing to undefined, so a replay engine can tell
+ * "deleted by the edit" (expected — skip) from "ambiguous" (warn the author).
+ */
+export type LineageResolution = {
+    readonly ok: true;
+    readonly entity: ResolvedEntity;
+} | {
+    readonly ok: false;
+    readonly reason: BrokenReason;
+    readonly candidates?: readonly ResolvedEntity[];
+};
+/** A generated-face ref: carries the bridged roles + the op that made it. */
+export declare function isDerivedFaceRef(v: unknown): v is DerivedFaceRef;
+/** An edge ref: exactly two adjacent face-roles. */
+export declare function isEdgeRef(v: unknown): v is EdgeRef;
+/** A vertex ref: three or more adjacent face-roles. */
+export declare function isVertexRef(v: unknown): v is VertexRef;
+/** A face ref: a single role name. */
+export declare function isFaceRef(v: unknown): v is ShapeRef;
+/** True for any of the four lineage reference kinds. */
+export declare function isLineageRef(v: unknown): v is LineageRef;
+/**
+ * Resolve a lineage ref against `shape` using a prepared role table (the robust
+ * path — the table is maintained across edits via `updateRoles`). Returns the
+ * live entity on success, or the failure reason (and tied candidates) on failure.
+ */
+export declare function resolveLineageRef(ref: LineageRef, roles: RoleTable, shape: Shape3D): LineageResolution;
+/**
+ * Resolve a lineage ref against a freshly rebuilt `shape` with no maintained
+ * role table, re-deriving roles via `assignRoles(shape, ref.origin)`. The ref's
+ * `origin` must therefore be the role-assignment scheme (e.g. `'box'`), and
+ * stability is bounded by that scheme — `'box'` names faces semantically
+ * (rebuild-stable); other schemes fall back to positional `face_N`.
+ */
+export declare function resolveRefIn(ref: LineageRef, shape: Shape3D): LineageResolution;
+/**
+ * Replace every lineage ref in an operation's params with the live entity it
+ * resolves to in `shape`, recursing into arrays (a fillet's edge list) and
+ * nested plain objects (a `{ selection: { edge } }` options bag). Refs that
+ * can't resolve are left as-is. Role tables are re-derived once per `origin` and
+ * reused across the whole params map. Lets a replay engine pass stable entity
+ * selections that survive upstream edits.
+ */
+export declare function resolveRefParams(params: Readonly<Record<string, unknown>>, shape: Shape3D): Record<string, unknown>;
+//# sourceMappingURL=refResolveFns.d.ts.map

package/dist/vendored/brepjs/topology/shapeRef/refResolveFns.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"refResolveFns.d.ts","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/topology/shapeRef/refResolveFns.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,0BAA0B,CAAC;AAK5E,OAAO,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,EAAE,cAAc,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAElG,+CAA+C;AAC/C,MAAM,MAAM,UAAU,GAAG,QAAQ,GAAG,OAAO,GAAG,SAAS,GAAG,cAAc,CAAC;AACzE,iDAAiD;AACjD,MAAM,MAAM,cAAc,GAAG,IAAI,GAAG,IAAI,GAAG,MAAM,CAAC;AAElD,oFAAoF;AACpF,MAAM,MAAM,YAAY,GAAG,WAAW,GAAG,WAAW,GAAG,SAAS,CAAC;AAEjE;;;;GAIG;AACH,MAAM,MAAM,iBAAiB,GACzB;IAAE,QAAQ,CAAC,EAAE,EAAE,IAAI,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,cAAc,CAAA;CAAE,GACtD;IACE,QAAQ,CAAC,EAAE,EAAE,KAAK,CAAC;IACnB,QAAQ,CAAC,MAAM,EAAE,YAAY,CAAC;IAC9B,QAAQ,CAAC,UAAU,CAAC,EAAE,SAAS,cAAc,EAAE,CAAC;CACjD,CAAC;AAMN,6EAA6E;AAC7E,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,OAAO,GAAG,CAAC,IAAI,cAAc,CAEhE;AACD,oDAAoD;AACpD,wBAAgB,SAAS,CAAC,CAAC,EAAE,OAAO,GAAG,CAAC,IAAI,OAAO,CAElD;AACD,uDAAuD;AACvD,wBAAgB,WAAW,CAAC,CAAC,EAAE,OAAO,GAAG,CAAC,IAAI,SAAS,CAEtD;AACD,sCAAsC;AACtC,wBAAgB,SAAS,CAAC,CAAC,EAAE,OAAO,GAAG,CAAC,IAAI,QAAQ,CAEnD;AACD,wDAAwD;AACxD,wBAAgB,YAAY,CAAC,CAAC,EAAE,OAAO,GAAG,CAAC,IAAI,UAAU,CAExD;AASD;;;;GAIG;AACH,wBAAgB,iBAAiB,CAC/B,GAAG,EAAE,UAAU,EACf,KAAK,EAAE,SAAS,EAChB,KAAK,EAAE,OAAO,GACb,iBAAiB,CAiBnB;AAWD;;;;;;GAMG;AACH,wBAAgB,YAAY,CAAC,GAAG,EAAE,UAAU,EAAE,KAAK,EAAE,OAAO,GAAG,iBAAiB,CAE/E;AAcD;;;;;;;GAOG;AACH,wBAAgB,gBAAgB,CAC9B,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,EACzC,KAAK,EAAE,OAAO,GACb,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAoBzB"}