@faicad/faijs 0.13.0

package/dist/vendored/brepjs/kernel/types.d.ts

@@ -0,0 +1,214 @@
+/**
+ * KernelAdapter — abstraction over geometry kernel operations.
+ *
+ * All kernel-agnostic operations go through this interface. The adapter
+ * provides factory methods, queries, and operations that insulate callers
+ * from any specific kernel implementation (OCCT, Rust/WASM, etc.).
+ *
+ * The `oc` property is the only kernel-specific escape hatch and must only
+ * be accessed by code in `kernel/` and `core/`.
+ */
+import type { KernelAdapter } from './interfaces/index.js';
+export type KernelInstance = any;
+/**
+ * Opaque shape handle — the kernel-level shape representation.
+ * For OCCT: TopoDS_Shape. For Rust: your shape type.
+ */
+export type KernelShape = any;
+/**
+ * Opaque kernel type — covers non-shape kernel objects (geometry primitives,
+ * curve handles, transform objects, etc.).
+ */
+export type KernelType = any;
+/** Options shared by all boolean and compound operations. */
+export interface BooleanOptions {
+    /** Glue algorithm hint for faces shared between operands. */
+    optimisation?: 'none' | 'commonFace' | 'sameFace';
+    /** Merge same-domain faces/edges after the boolean. */
+    simplify?: boolean;
+    /** Algorithm selection: 'native' uses N-way BRepAlgoAPI_BuilderAlgo; 'pairwise' uses recursive divide-and-conquer. */
+    strategy?: 'native' | 'pairwise';
+    /** Abort signal to cancel long-running operations between steps. */
+    signal?: AbortSignal;
+    /**
+     * Fuzzy tolerance for boolean operations. When set to a small positive value
+     * (e.g., 1e-5), OCCT merges nearly-coincident vertices and edges early,
+     * reducing intersection computation. Useful for 3D printing workflows where
+     * sub-micron precision is not needed. Default: 0 (exact geometry).
+     */
+    fuzzyValue?: number | undefined;
+    /**
+     * When true, accepts any Shape3D (shells, compounds) without requiring
+     * ValidSolid branding. This is a type-level escape hatch only — no runtime
+     * effect.
+     */
+    unsafe?: boolean;
+    /**
+     * When false, skips face evolution tracking (hash collection, Modified/Generated/Deleted
+     * queries, metadata propagation). This is a performance optimization for intermediate
+     * boolean operations where face tags/colors are not needed. Defaults to `true`.
+     */
+    trackEvolution?: boolean | undefined;
+}
+export type ShapeType = 'vertex' | 'edge' | 'wire' | 'face' | 'shell' | 'solid' | 'compsolid' | 'compound';
+/** Surface type discriminant returned by surfaceType(). */
+export type SurfaceType = 'plane' | 'cylinder' | 'cone' | 'sphere' | 'torus' | 'bezier' | 'bspline' | 'revolution' | 'extrusion' | 'offset' | 'other';
+/** Shape orientation. */
+export type ShapeOrientation = 'forward' | 'reversed' | 'internal' | 'external';
+export interface MeshOptions {
+    /** Linear deflection tolerance for tessellation. */
+    tolerance: number;
+    /**
+     * Angular deflection tolerance for tessellation. Honoured by both the OCCT
+     * and brepkit kernels; a non-positive value falls back to the kernel default.
+     */
+    angularTolerance: number;
+    skipNormals?: boolean;
+    includeUVs?: boolean;
+    /** Abort signal to cancel mesh generation between face iterations. */
+    signal?: AbortSignal;
+}
+export interface KernelMeshResult {
+    vertices: Float32Array;
+    normals: Float32Array;
+    triangles: Uint32Array;
+    uvs: Float32Array;
+    faceGroups: Array<{
+        start: number;
+        count: number;
+        faceHash: number;
+    }>;
+}
+export interface KernelEdgeMeshResult {
+    lines: Float32Array;
+    edgeGroups: Array<{
+        start: number;
+        count: number;
+        edgeHash: number;
+    }>;
+}
+export interface DistanceResult {
+    value: number;
+    point1: [number, number, number];
+    point2: [number, number, number];
+}
+/**
+ * Shape evolution record — tracks how input faces map to result faces
+ * through a kernel operation (boolean, transform, fillet, etc.).
+ *
+ * For each input face hash, `modified` contains the result face hashes it evolved into.
+ * `generated` contains hashes of newly created faces (e.g., fillet rounds).
+ * `deleted` lists hashes of faces that were removed entirely.
+ */
+export interface ShapeEvolution {
+    /** Map from input face hash → result face hashes it was modified into. */
+    readonly modified: ReadonlyMap<number, readonly number[]>;
+    /** Map from input face hash → newly generated face hashes (e.g., fillet surfaces). */
+    readonly generated: ReadonlyMap<number, readonly number[]>;
+    /** Set of input face hashes that were deleted by the operation. */
+    readonly deleted: ReadonlySet<number>;
+}
+/** Result of an operation that tracks shape history. */
+export interface OperationResult {
+    readonly shape: KernelShape;
+    readonly evolution: ShapeEvolution;
+}
+/** Diagnostic information from a boolean operation. */
+export interface BooleanDiagnostics {
+    /** Whether the OCCT algorithm reported internal errors. */
+    readonly hasErrors: boolean;
+    /** Whether the OCCT algorithm reported warnings. */
+    readonly hasWarnings: boolean;
+    /**
+     * Human-readable messages. Currently always empty — OCCT's message
+     * reporting via Standard_OStream is not accessible in WASM builds.
+     * Reserved for future use.
+     */
+    readonly messages: readonly string[];
+}
+/** Extended operation result with diagnostics. */
+export interface DiagnosticOperationResult extends OperationResult {
+    readonly diagnostics: BooleanDiagnostics;
+}
+/** Issue detected during boolean pre-validation. */
+export interface BooleanIssue {
+    readonly operand: 'base' | 'tool';
+    readonly issue: 'null-shape' | 'not-valid';
+    readonly message: string;
+}
+/** Result of boolean pre-validation. */
+export interface CheckBooleanResult {
+    readonly valid: boolean;
+    readonly issues: readonly BooleanIssue[];
+}
+/** Boolean operation type for checkBoolean. */
+export type BooleanOpType = 'fuse' | 'cut' | 'intersect';
+/** Options for STEP assembly export with named/colored parts. */
+export interface StepAssemblyPart {
+    shape: KernelShape;
+    name: string;
+    color?: [number, number, number, number];
+}
+/** Read-only NURBS curve data. */
+export interface NurbsCurveData {
+    readonly degree: number;
+    readonly poles: ReadonlyArray<readonly [number, number, number]>;
+    readonly weights: ReadonlyArray<number>;
+    readonly knots: ReadonlyArray<number>;
+    readonly multiplicities: ReadonlyArray<number>;
+    readonly isPeriodic: boolean;
+    readonly isRational: boolean;
+}
+/** Read-only NURBS surface data. */
+export interface NurbsSurfaceData {
+    readonly degreeU: number;
+    readonly degreeV: number;
+    readonly nbPolesU: number;
+    readonly nbPolesV: number;
+    readonly poles: ReadonlyArray<ReadonlyArray<readonly [number, number, number]>>;
+    readonly weights: ReadonlyArray<ReadonlyArray<number>>;
+    readonly knotsU: ReadonlyArray<number>;
+    readonly knotsV: ReadonlyArray<number>;
+    readonly multiplicitiesU: ReadonlyArray<number>;
+    readonly multiplicitiesV: ReadonlyArray<number>;
+    readonly isPeriodicU: boolean;
+    readonly isPeriodicV: boolean;
+    readonly isRational: boolean;
+}
+export type { KernelAdapter } from './interfaces/index.js';
+/** Capability for 2D constraint sketch solving. */
+export interface ConstraintSketchCapability {
+    /** Create a new constraint sketch. Returns an opaque sketch handle. */
+    sketchNew(): number;
+    /** Add a point to a constraint sketch. Returns the point index. */
+    sketchAddPoint(sketch: number, x: number, y: number, fixed: boolean): number;
+    /** Add an arc entity to a constraint sketch. Returns the arc index. */
+    sketchAddArc(sketch: number, centerIdx: number, startIdx: number, endIdx: number): number;
+    /** Add a constraint to a sketch (JSON-encoded constraint descriptor). */
+    sketchAddConstraint(sketch: number, constraintJson: string): void;
+    /** Solve sketch constraints. Returns a JSON result with solved point positions. */
+    sketchSolve(sketch: number, maxIterations: number, tolerance: number): string;
+    /** Get degrees of freedom remaining in a constraint sketch. Returns JSON string. */
+    sketchDof(sketch: number): string;
+}
+/** Capability for hidden-line removal (3D → 2D projection). */
+export interface ProjectionCapability {
+    /** Project 3D edges onto a 2D plane (hidden line removal). */
+    projectEdges(shape: KernelShape, cameraOrigin: [number, number, number], cameraDirection: [number, number, number], cameraXAxis?: [number, number, number]): {
+        visible: {
+            outline: KernelShape;
+            smooth: KernelShape;
+            sharp: KernelShape;
+        };
+        hidden: {
+            outline: KernelShape;
+            smooth: KernelShape;
+            sharp: KernelShape;
+        };
+    };
+}
+/** Check if the kernel supports hidden-line-removal projection. */
+export declare function supportsProjection(kernel: KernelAdapter): kernel is KernelAdapter & ProjectionCapability;
+/** Check if the kernel supports 2D constraint sketch solving. */
+export declare function supportsConstraintSketch(kernel: KernelAdapter): kernel is KernelAdapter & ConstraintSketchCapability;
+//# sourceMappingURL=types.d.ts.map

package/dist/vendored/brepjs/kernel/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../../src/vendored/brepjs/kernel/types.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAC;AAG3D,MAAM,MAAM,cAAc,GAAG,GAAG,CAAC;AAEjC;;;GAGG;AAEH,MAAM,MAAM,WAAW,GAAG,GAAG,CAAC;AAE9B;;;GAGG;AAEH,MAAM,MAAM,UAAU,GAAG,GAAG,CAAC;AAE7B,6DAA6D;AAC7D,MAAM,WAAW,cAAc;IAC7B,6DAA6D;IAC7D,YAAY,CAAC,EAAE,MAAM,GAAG,YAAY,GAAG,UAAU,CAAC;IAClD,uDAAuD;IACvD,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB,sHAAsH;IACtH,QAAQ,CAAC,EAAE,QAAQ,GAAG,UAAU,CAAC;IACjC,oEAAoE;IACpE,MAAM,CAAC,EAAE,WAAW,CAAC;IACrB;;;;;OAKG;IACH,UAAU,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAChC;;;;OAIG;IACH,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB;;;;OAIG;IACH,cAAc,CAAC,EAAE,OAAO,GAAG,SAAS,CAAC;CACtC;AAED,MAAM,MAAM,SAAS,GACnB,QAAQ,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,OAAO,GAAG,OAAO,GAAG,WAAW,GAAG,UAAU,CAAC;AAErF,2DAA2D;AAC3D,MAAM,MAAM,WAAW,GACnB,OAAO,GACP,UAAU,GACV,MAAM,GACN,QAAQ,GACR,OAAO,GACP,QAAQ,GACR,SAAS,GACT,YAAY,GACZ,WAAW,GACX,QAAQ,GACR,OAAO,CAAC;AAEZ,yBAAyB;AACzB,MAAM,MAAM,gBAAgB,GAAG,SAAS,GAAG,UAAU,GAAG,UAAU,GAAG,UAAU,CAAC;AAEhF,MAAM,WAAW,WAAW;IAC1B,oDAAoD;IACpD,SAAS,EAAE,MAAM,CAAC;IAClB;;;OAGG;IACH,gBAAgB,EAAE,MAAM,CAAC;IACzB,WAAW,CAAC,EAAE,OAAO,CAAC;IACtB,UAAU,CAAC,EAAE,OAAO,CAAC;IACrB,sEAAsE;IACtE,MAAM,CAAC,EAAE,WAAW,CAAC;CACtB;AAED,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,EAAE,YAAY,CAAC;IACvB,OAAO,EAAE,YAAY,CAAC;IACtB,SAAS,EAAE,WAAW,CAAC;IACvB,GAAG,EAAE,YAAY,CAAC;IAClB,UAAU,EAAE,KAAK,CAAC;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CACvE;AAED,MAAM,WAAW,oBAAoB;IACnC,KAAK,EAAE,YAAY,CAAC;IACpB,UAAU,EAAE,KAAK,CAAC;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CACvE;AAED,MAAM,WAAW,cAAc;IAC7B,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;IACjC,MAAM,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;CAClC;AAED;;;;;;;GAOG;AACH,MAAM,WAAW,cAAc;IAC7B,0EAA0E;IAC1E,QAAQ,CAAC,QAAQ,EAAE,WAAW,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,CAAC;IAC1D,sFAAsF;IACtF,QAAQ,CAAC,SAAS,EAAE,WAAW,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,CAAC;IAC3D,mEAAmE;IACnE,QAAQ,CAAC,OAAO,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;CACvC;AAED,wDAAwD;AACxD,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC;IAC5B,QAAQ,CAAC,SAAS,EAAE,cAAc,CAAC;CACpC;AAED,uDAAuD;AACvD,MAAM,WAAW,kBAAkB;IACjC,2DAA2D;IAC3D,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC;IAC5B,oDAAoD;IACpD,QAAQ,CAAC,WAAW,EAAE,OAAO,CAAC;IAC9B;;;;OAIG;IACH,QAAQ,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,CAAC;CACtC;AAED,kDAAkD;AAClD,MAAM,WAAW,yBAA0B,SAAQ,eAAe;IAChE,QAAQ,CAAC,WAAW,EAAE,kBAAkB,CAAC;CAC1C;AAED,oDAAoD;AACpD,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,CAAC;IAClC,QAAQ,CAAC,KAAK,EAAE,YAAY,GAAG,WAAW,CAAC;IAC3C,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;CAC1B;AAED,wCAAwC;AACxC,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC;IACxB,QAAQ,CAAC,MAAM,EAAE,SAAS,YAAY,EAAE,CAAC;CAC1C;AAED,+CAA+C;AAC/C,MAAM,MAAM,aAAa,GAAG,MAAM,GAAG,KAAK,GAAG,WAAW,CAAC;AAEzD,iEAAiE;AACjE,MAAM,WAAW,gBAAgB;IAC/B,KAAK,EAAE,WAAW,CAAC;IACnB,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;CAC1C;AAED,kCAAkC;AAClC,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,KAAK,EAAE,aAAa,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IACjE,QAAQ,CAAC,OAAO,EAAE,aAAa,CAAC,MAAM,CAAC,CAAC;IACxC,QAAQ,CAAC,KAAK,EAAE,aAAa,CAAC,MAAM,CAAC,CAAC;IACtC,QAAQ,CAAC,cAAc,EAAE,aAAa,CAAC,MAAM,CAAC,CAAC;IAC/C,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC;IAC7B,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC;CAC9B;AAED,oCAAoC;AACpC,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,KAAK,EAAE,aAAa,CAAC,aAAa,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;IAChF,QAAQ,CAAC,OAAO,EAAE,aAAa,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC;IACvD,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAC,MAAM,CAAC,CAAC;IACvC,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAC,MAAM,CAAC,CAAC;IACvC,QAAQ,CAAC,eAAe,EAAE,aAAa,CAAC,MAAM,CAAC,CAAC;IAChD,QAAQ,CAAC,eAAe,EAAE,aAAa,CAAC,MAAM,CAAC,CAAC;IAChD,QAAQ,CAAC,WAAW,EAAE,OAAO,CAAC;IAC9B,QAAQ,CAAC,WAAW,EAAE,OAAO,CAAC;IAC9B,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC;CAC9B;AAMD,YAAY,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAC;AAM3D,mDAAmD;AACnD,MAAM,WAAW,0BAA0B;IACzC,uEAAuE;IACvE,SAAS,IAAI,MAAM,CAAC;IACpB,mEAAmE;IACnE,cAAc,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,GAAG,MAAM,CAAC;IAC7E,uEAAuE;IACvE,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,CAAC;IAC1F,yEAAyE;IACzE,mBAAmB,CAAC,MAAM,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM,GAAG,IAAI,CAAC;IAClE,mFAAmF;IACnF,WAAW,CAAC,MAAM,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,MAAM,CAAC;IAC9E,oFAAoF;IACpF,SAAS,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAAC;CACnC;AAED,+DAA+D;AAC/D,MAAM,WAAW,oBAAoB;IACnC,8DAA8D;IAC9D,YAAY,CACV,KAAK,EAAE,WAAW,EAClB,YAAY,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,EACtC,eAAe,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,EACzC,WAAW,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,GACrC;QACD,OAAO,EAAE;YAAE,OAAO,EAAE,WAAW,CAAC;YAAC,MAAM,EAAE,WAAW,CAAC;YAAC,KAAK,EAAE,WAAW,CAAA;SAAE,CAAC;QAC3E,MAAM,EAAE;YAAE,OAAO,EAAE,WAAW,CAAC;YAAC,MAAM,EAAE,WAAW,CAAC;YAAC,KAAK,EAAE,WAAW,CAAA;SAAE,CAAC;KAC3E,CAAC;CACH;AAMD,mEAAmE;AACnE,wBAAgB,kBAAkB,CAChC,MAAM,EAAE,aAAa,GACpB,MAAM,IAAI,aAAa,GAAG,oBAAoB,CAEhD;AAED,iEAAiE;AACjE,wBAAgB,wBAAwB,CACtC,MAAM,EAAE,aAAa,GACpB,MAAM,IAAI,aAAa,GAAG,0BAA0B,CAEtD"}

package/dist/vendored/brepjs/kernel/types.js

@@ -0,0 +1,22 @@
+/**
+ * KernelAdapter — abstraction over geometry kernel operations.
+ *
+ * All kernel-agnostic operations go through this interface. The adapter
+ * provides factory methods, queries, and operations that insulate callers
+ * from any specific kernel implementation (OCCT, Rust/WASM, etc.).
+ *
+ * The `oc` property is the only kernel-specific escape hatch and must only
+ * be accessed by code in `kernel/` and `core/`.
+ */
+// ---------------------------------------------------------------------------
+// Capability type guards
+// ---------------------------------------------------------------------------
+/** Check if the kernel supports hidden-line-removal projection. */
+export function supportsProjection(kernel) {
+    return 'projectEdges' in kernel;
+}
+/** Check if the kernel supports 2D constraint sketch solving. */
+export function supportsConstraintSketch(kernel) {
+    return 'sketchNew' in kernel && 'sketchDof' in kernel;
+}
+//# sourceMappingURL=types.js.map

package/dist/vendored/brepjs/kernel/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../../src/vendored/brepjs/kernel/types.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AA8OH,8EAA8E;AAC9E,yBAAyB;AACzB,8EAA8E;AAE9E,mEAAmE;AACnE,MAAM,UAAU,kBAAkB,CAChC,MAAqB;IAErB,OAAO,cAAc,IAAI,MAAM,CAAC;AAClC,CAAC;AAED,iEAAiE;AACjE,MAAM,UAAU,wBAAwB,CACtC,MAAqB;IAErB,OAAO,WAAW,IAAI,MAAM,IAAI,WAAW,IAAI,MAAM,CAAC;AACxD,CAAC","sourcesContent":["/**\n * KernelAdapter — abstraction over geometry kernel operations.\n *\n * All kernel-agnostic operations go through this interface. The adapter\n * provides factory methods, queries, and operations that insulate callers\n * from any specific kernel implementation (OCCT, Rust/WASM, etc.).\n *\n * The `oc` property is the only kernel-specific escape hatch and must only\n * be accessed by code in `kernel/` and `core/`.\n */\n\nimport type { KernelAdapter } from './interfaces/index.js';\n\n// eslint-disable-next-line @typescript-eslint/no-explicit-any -- Kernel WASM instance type\nexport type KernelInstance = any;\n\n/**\n * Opaque shape handle — the kernel-level shape representation.\n * For OCCT: TopoDS_Shape. For Rust: your shape type.\n */\n// eslint-disable-next-line @typescript-eslint/no-explicit-any -- Opaque kernel shape handle\nexport type KernelShape = any;\n\n/**\n * Opaque kernel type — covers non-shape kernel objects (geometry primitives,\n * curve handles, transform objects, etc.).\n */\n// eslint-disable-next-line @typescript-eslint/no-explicit-any -- Opaque kernel type\nexport type KernelType = any;\n\n/** Options shared by all boolean and compound operations. */\nexport interface BooleanOptions {\n  /** Glue algorithm hint for faces shared between operands. */\n  optimisation?: 'none' | 'commonFace' | 'sameFace';\n  /** Merge same-domain faces/edges after the boolean. */\n  simplify?: boolean;\n  /** Algorithm selection: 'native' uses N-way BRepAlgoAPI_BuilderAlgo; 'pairwise' uses recursive divide-and-conquer. */\n  strategy?: 'native' | 'pairwise';\n  /** Abort signal to cancel long-running operations between steps. */\n  signal?: AbortSignal;\n  /**\n   * Fuzzy tolerance for boolean operations. When set to a small positive value\n   * (e.g., 1e-5), OCCT merges nearly-coincident vertices and edges early,\n   * reducing intersection computation. Useful for 3D printing workflows where\n   * sub-micron precision is not needed. Default: 0 (exact geometry).\n   */\n  fuzzyValue?: number | undefined;\n  /**\n   * When true, accepts any Shape3D (shells, compounds) without requiring\n   * ValidSolid branding. This is a type-level escape hatch only — no runtime\n   * effect.\n   */\n  unsafe?: boolean;\n  /**\n   * When false, skips face evolution tracking (hash collection, Modified/Generated/Deleted\n   * queries, metadata propagation). This is a performance optimization for intermediate\n   * boolean operations where face tags/colors are not needed. Defaults to `true`.\n   */\n  trackEvolution?: boolean | undefined;\n}\n\nexport type ShapeType =\n  'vertex' | 'edge' | 'wire' | 'face' | 'shell' | 'solid' | 'compsolid' | 'compound';\n\n/** Surface type discriminant returned by surfaceType(). */\nexport type SurfaceType =\n  | 'plane'\n  | 'cylinder'\n  | 'cone'\n  | 'sphere'\n  | 'torus'\n  | 'bezier'\n  | 'bspline'\n  | 'revolution'\n  | 'extrusion'\n  | 'offset'\n  | 'other';\n\n/** Shape orientation. */\nexport type ShapeOrientation = 'forward' | 'reversed' | 'internal' | 'external';\n\nexport interface MeshOptions {\n  /** Linear deflection tolerance for tessellation. */\n  tolerance: number;\n  /**\n   * Angular deflection tolerance for tessellation. Honoured by both the OCCT\n   * and brepkit kernels; a non-positive value falls back to the kernel default.\n   */\n  angularTolerance: number;\n  skipNormals?: boolean;\n  includeUVs?: boolean;\n  /** Abort signal to cancel mesh generation between face iterations. */\n  signal?: AbortSignal;\n}\n\nexport interface KernelMeshResult {\n  vertices: Float32Array;\n  normals: Float32Array;\n  triangles: Uint32Array;\n  uvs: Float32Array;\n  faceGroups: Array<{ start: number; count: number; faceHash: number }>;\n}\n\nexport interface KernelEdgeMeshResult {\n  lines: Float32Array;\n  edgeGroups: Array<{ start: number; count: number; edgeHash: number }>;\n}\n\nexport interface DistanceResult {\n  value: number;\n  point1: [number, number, number];\n  point2: [number, number, number];\n}\n\n/**\n * Shape evolution record — tracks how input faces map to result faces\n * through a kernel operation (boolean, transform, fillet, etc.).\n *\n * For each input face hash, `modified` contains the result face hashes it evolved into.\n * `generated` contains hashes of newly created faces (e.g., fillet rounds).\n * `deleted` lists hashes of faces that were removed entirely.\n */\nexport interface ShapeEvolution {\n  /** Map from input face hash → result face hashes it was modified into. */\n  readonly modified: ReadonlyMap<number, readonly number[]>;\n  /** Map from input face hash → newly generated face hashes (e.g., fillet surfaces). */\n  readonly generated: ReadonlyMap<number, readonly number[]>;\n  /** Set of input face hashes that were deleted by the operation. */\n  readonly deleted: ReadonlySet<number>;\n}\n\n/** Result of an operation that tracks shape history. */\nexport interface OperationResult {\n  readonly shape: KernelShape;\n  readonly evolution: ShapeEvolution;\n}\n\n/** Diagnostic information from a boolean operation. */\nexport interface BooleanDiagnostics {\n  /** Whether the OCCT algorithm reported internal errors. */\n  readonly hasErrors: boolean;\n  /** Whether the OCCT algorithm reported warnings. */\n  readonly hasWarnings: boolean;\n  /**\n   * Human-readable messages. Currently always empty — OCCT's message\n   * reporting via Standard_OStream is not accessible in WASM builds.\n   * Reserved for future use.\n   */\n  readonly messages: readonly string[];\n}\n\n/** Extended operation result with diagnostics. */\nexport interface DiagnosticOperationResult extends OperationResult {\n  readonly diagnostics: BooleanDiagnostics;\n}\n\n/** Issue detected during boolean pre-validation. */\nexport interface BooleanIssue {\n  readonly operand: 'base' | 'tool';\n  readonly issue: 'null-shape' | 'not-valid';\n  readonly message: string;\n}\n\n/** Result of boolean pre-validation. */\nexport interface CheckBooleanResult {\n  readonly valid: boolean;\n  readonly issues: readonly BooleanIssue[];\n}\n\n/** Boolean operation type for checkBoolean. */\nexport type BooleanOpType = 'fuse' | 'cut' | 'intersect';\n\n/** Options for STEP assembly export with named/colored parts. */\nexport interface StepAssemblyPart {\n  shape: KernelShape;\n  name: string;\n  color?: [number, number, number, number]; // RGBA 0-255\n}\n\n/** Read-only NURBS curve data. */\nexport interface NurbsCurveData {\n  readonly degree: number;\n  readonly poles: ReadonlyArray<readonly [number, number, number]>;\n  readonly weights: ReadonlyArray<number>;\n  readonly knots: ReadonlyArray<number>;\n  readonly multiplicities: ReadonlyArray<number>;\n  readonly isPeriodic: boolean;\n  readonly isRational: boolean;\n}\n\n/** Read-only NURBS surface data. */\nexport interface NurbsSurfaceData {\n  readonly degreeU: number;\n  readonly degreeV: number;\n  readonly nbPolesU: number;\n  readonly nbPolesV: number;\n  readonly poles: ReadonlyArray<ReadonlyArray<readonly [number, number, number]>>;\n  readonly weights: ReadonlyArray<ReadonlyArray<number>>;\n  readonly knotsU: ReadonlyArray<number>;\n  readonly knotsV: ReadonlyArray<number>;\n  readonly multiplicitiesU: ReadonlyArray<number>;\n  readonly multiplicitiesV: ReadonlyArray<number>;\n  readonly isPeriodicU: boolean;\n  readonly isPeriodicV: boolean;\n  readonly isRational: boolean;\n}\n\n// ---------------------------------------------------------------------------\n// Kernel adapter — composed from domain-aligned sub-interfaces\n// ---------------------------------------------------------------------------\n\nexport type { KernelAdapter } from './interfaces/index.js';\n\n// ---------------------------------------------------------------------------\n// Capability interfaces (optional per kernel)\n// ---------------------------------------------------------------------------\n\n/** Capability for 2D constraint sketch solving. */\nexport interface ConstraintSketchCapability {\n  /** Create a new constraint sketch. Returns an opaque sketch handle. */\n  sketchNew(): number;\n  /** Add a point to a constraint sketch. Returns the point index. */\n  sketchAddPoint(sketch: number, x: number, y: number, fixed: boolean): number;\n  /** Add an arc entity to a constraint sketch. Returns the arc index. */\n  sketchAddArc(sketch: number, centerIdx: number, startIdx: number, endIdx: number): number;\n  /** Add a constraint to a sketch (JSON-encoded constraint descriptor). */\n  sketchAddConstraint(sketch: number, constraintJson: string): void;\n  /** Solve sketch constraints. Returns a JSON result with solved point positions. */\n  sketchSolve(sketch: number, maxIterations: number, tolerance: number): string;\n  /** Get degrees of freedom remaining in a constraint sketch. Returns JSON string. */\n  sketchDof(sketch: number): string;\n}\n\n/** Capability for hidden-line removal (3D → 2D projection). */\nexport interface ProjectionCapability {\n  /** Project 3D edges onto a 2D plane (hidden line removal). */\n  projectEdges(\n    shape: KernelShape,\n    cameraOrigin: [number, number, number],\n    cameraDirection: [number, number, number],\n    cameraXAxis?: [number, number, number]\n  ): {\n    visible: { outline: KernelShape; smooth: KernelShape; sharp: KernelShape };\n    hidden: { outline: KernelShape; smooth: KernelShape; sharp: KernelShape };\n  };\n}\n\n// ---------------------------------------------------------------------------\n// Capability type guards\n// ---------------------------------------------------------------------------\n\n/** Check if the kernel supports hidden-line-removal projection. */\nexport function supportsProjection(\n  kernel: KernelAdapter\n): kernel is KernelAdapter & ProjectionCapability {\n  return 'projectEdges' in kernel;\n}\n\n/** Check if the kernel supports 2D constraint sketch solving. */\nexport function supportsConstraintSketch(\n  kernel: KernelAdapter\n): kernel is KernelAdapter & ConstraintSketchCapability {\n  return 'sketchNew' in kernel && 'sketchDof' in kernel;\n}\n"]}

package/dist/vendored/brepjs/kernel/unsupported.d.ts

@@ -0,0 +1,15 @@
+/**
+ * Shared error for "this kernel doesn't implement this operation" — a stubbed
+ * adapter method (occt's brepkit-only stubs, occt-wasm's not-yet-implemented) or
+ * a manifold op that needs an absent occt replay. Feature-detection recognises it
+ * structurally via {@link isUnsupportedKernelOperationError} instead of matching
+ * each adapter's message text, so a native-vs-fallback probe stays decoupled from
+ * wording. Adapters keep their existing messages; this only adds the marker.
+ */
+/** Thrown by a kernel adapter asked to perform an operation it doesn't support. */
+export declare class UnsupportedKernelOperationError extends Error {
+    constructor(message: string);
+}
+/** True if `error` is an {@link UnsupportedKernelOperationError} from any kernel adapter. */
+export declare function isUnsupportedKernelOperationError(error: unknown): boolean;
+//# sourceMappingURL=unsupported.d.ts.map

package/dist/vendored/brepjs/kernel/unsupported.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"unsupported.d.ts","sourceRoot":"","sources":["../../../../src/vendored/brepjs/kernel/unsupported.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAIH,mFAAmF;AACnF,qBAAa,+BAAgC,SAAQ,KAAK;gBAC5C,OAAO,EAAE,MAAM;CAQ5B;AAED,6FAA6F;AAC7F,wBAAgB,iCAAiC,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO,CAEzE"}

package/dist/vendored/brepjs/kernel/unsupported.js

@@ -0,0 +1,25 @@
+/**
+ * Shared error for "this kernel doesn't implement this operation" — a stubbed
+ * adapter method (occt's brepkit-only stubs, occt-wasm's not-yet-implemented) or
+ * a manifold op that needs an absent occt replay. Feature-detection recognises it
+ * structurally via {@link isUnsupportedKernelOperationError} instead of matching
+ * each adapter's message text, so a native-vs-fallback probe stays decoupled from
+ * wording. Adapters keep their existing messages; this only adds the marker.
+ */
+const UNSUPPORTED_MARKER = Symbol.for('faijs.kernel.unsupportedOperation');
+/** Thrown by a kernel adapter asked to perform an operation it doesn't support. */
+export class UnsupportedKernelOperationError extends Error {
+    constructor(message) {
+        super(message);
+        this.name = 'UnsupportedKernelOperationError';
+        // Global-registry symbol, checked in place of `instanceof`, so the marker
+        // still matches across a bundle boundary that loaded a second copy of this
+        // class (e.g. a consumer bundling its own brepjs).
+        Object.defineProperty(this, UNSUPPORTED_MARKER, { value: true });
+    }
+}
+/** True if `error` is an {@link UnsupportedKernelOperationError} from any kernel adapter. */
+export function isUnsupportedKernelOperationError(error) {
+    return error instanceof Error && Reflect.get(error, UNSUPPORTED_MARKER) === true;
+}
+//# sourceMappingURL=unsupported.js.map

package/dist/vendored/brepjs/kernel/unsupported.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"unsupported.js","sourceRoot":"","sources":["../../../../src/vendored/brepjs/kernel/unsupported.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,MAAM,kBAAkB,GAAG,MAAM,CAAC,GAAG,CAAC,mCAAmC,CAAC,CAAC;AAE3E,mFAAmF;AACnF,MAAM,OAAO,+BAAgC,SAAQ,KAAK;IACxD,YAAY,OAAe;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,iCAAiC,CAAC;QAC9C,0EAA0E;QAC1E,2EAA2E;QAC3E,mDAAmD;QACnD,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,kBAAkB,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;IACnE,CAAC;CACF;AAED,6FAA6F;AAC7F,MAAM,UAAU,iCAAiC,CAAC,KAAc;IAC9D,OAAO,KAAK,YAAY,KAAK,IAAI,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,kBAAkB,CAAC,KAAK,IAAI,CAAC;AACnF,CAAC","sourcesContent":["/**\n * Shared error for \"this kernel doesn't implement this operation\" — a stubbed\n * adapter method (occt's brepkit-only stubs, occt-wasm's not-yet-implemented) or\n * a manifold op that needs an absent occt replay. Feature-detection recognises it\n * structurally via {@link isUnsupportedKernelOperationError} instead of matching\n * each adapter's message text, so a native-vs-fallback probe stays decoupled from\n * wording. Adapters keep their existing messages; this only adds the marker.\n */\n\nconst UNSUPPORTED_MARKER = Symbol.for('faijs.kernel.unsupportedOperation');\n\n/** Thrown by a kernel adapter asked to perform an operation it doesn't support. */\nexport class UnsupportedKernelOperationError extends Error {\n  constructor(message: string) {\n    super(message);\n    this.name = 'UnsupportedKernelOperationError';\n    // Global-registry symbol, checked in place of `instanceof`, so the marker\n    // still matches across a bundle boundary that loaded a second copy of this\n    // class (e.g. a consumer bundling its own brepjs).\n    Object.defineProperty(this, UNSUPPORTED_MARKER, { value: true });\n  }\n}\n\n/** True if `error` is an {@link UnsupportedKernelOperationError} from any kernel adapter. */\nexport function isUnsupportedKernelOperationError(error: unknown): boolean {\n  return error instanceof Error && Reflect.get(error, UNSUPPORTED_MARKER) === true;\n}\n"]}

package/dist/vendored/brepjs/measurement/interferenceFns.d.ts

@@ -0,0 +1,68 @@
+/**
+ * Interference detection between shapes.
+ *
+ * Uses the kernel distance API to detect collisions, contact,
+ * and proximity between shape pairs.
+ */
+import type { Vec3 } from '../core/types.js';
+import type { AnyShape, Dimension } from '../core/shapeTypes.js';
+import { type Result } from '../core/result.js';
+/** Result of a pairwise interference check between two shapes. */
+export interface InterferenceResult {
+    /** True if shapes are touching or overlapping (distance within tolerance). */
+    readonly hasInterference: boolean;
+    /** Minimum distance between the shapes. 0 when touching or overlapping. */
+    readonly minDistance: number;
+    /** Closest point on the first shape as [x, y, z]. */
+    readonly pointOnShape1: Vec3;
+    /** Closest point on the second shape as [x, y, z]. */
+    readonly pointOnShape2: Vec3;
+}
+/** A pair of shapes that were found to interfere during batch checking. */
+export interface InterferencePair {
+    /** Index of the first shape in the input array. */
+    readonly i: number;
+    /** Index of the second shape in the input array. */
+    readonly j: number;
+    /** Detailed interference result for this pair. */
+    readonly result: InterferenceResult;
+}
+/**
+ * Check for interference (collision/contact) between two shapes.
+ *
+ * Returns detailed proximity information including the minimum distance
+ * and closest points. Shapes are considered interfering when their
+ * minimum distance is within the given tolerance.
+ *
+ * @param shape1 - First shape.
+ * @param shape2 - Second shape.
+ * @param tolerance - Distance threshold below which shapes are considered interfering. Default: 1e-6.
+ * @returns A `Result` wrapping the {@link InterferenceResult}.
+ *
+ * @example
+ * ```ts
+ * const result = unwrap(checkInterference(boxA, boxB));
+ * if (result.hasInterference) {
+ *   console.log('Collision at distance', result.minDistance);
+ * }
+ * ```
+ */
+export declare function checkInterference(shape1: AnyShape<Dimension>, shape2: AnyShape<Dimension>, tolerance?: number): Result<InterferenceResult>;
+/**
+ * Check all pairs in an array of shapes for interference.
+ *
+ * Returns only pairs that have interference (distance within tolerance).
+ * For N shapes, checks N*(N-1)/2 unique pairs.
+ *
+ * @param shapes - Array of shapes to test pairwise.
+ * @param tolerance - Distance threshold for interference. Default: 1e-6.
+ * @returns Array of {@link InterferencePair} entries, one per colliding pair.
+ *
+ * @example
+ * ```ts
+ * const collisions = checkAllInterferences([box, sphere, cylinder]);
+ * collisions.forEach(({ i, j }) => console.log(`Shape ${i} hits shape ${j}`));
+ * ```
+ */
+export declare function checkAllInterferences(shapes: ReadonlyArray<AnyShape<Dimension>>, tolerance?: number): InterferencePair[];
+//# sourceMappingURL=interferenceFns.d.ts.map

package/dist/vendored/brepjs/measurement/interferenceFns.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"interferenceFns.d.ts","sourceRoot":"","sources":["../../../../src/vendored/brepjs/measurement/interferenceFns.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAGH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AAC7C,OAAO,KAAK,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AACjE,OAAO,EAAE,KAAK,MAAM,EAAmB,MAAM,mBAAmB,CAAC;AAUjE,kEAAkE;AAClE,MAAM,WAAW,kBAAkB;IACjC,8EAA8E;IAC9E,QAAQ,CAAC,eAAe,EAAE,OAAO,CAAC;IAClC,2EAA2E;IAC3E,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,qDAAqD;IACrD,QAAQ,CAAC,aAAa,EAAE,IAAI,CAAC;IAC7B,sDAAsD;IACtD,QAAQ,CAAC,aAAa,EAAE,IAAI,CAAC;CAC9B;AAED,2EAA2E;AAC3E,MAAM,WAAW,gBAAgB;IAC/B,mDAAmD;IACnD,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,oDAAoD;IACpD,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,kDAAkD;IAClD,QAAQ,CAAC,MAAM,EAAE,kBAAkB,CAAC;CACrC;AAMD;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,iBAAiB,CAC/B,MAAM,EAAE,QAAQ,CAAC,SAAS,CAAC,EAC3B,MAAM,EAAE,QAAQ,CAAC,SAAS,CAAC,EAC3B,SAAS,SAAO,GACf,MAAM,CAAC,kBAAkB,CAAC,CAgC5B;AAMD;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,qBAAqB,CACnC,MAAM,EAAE,aAAa,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,EAC1C,SAAS,SAAO,GACf,gBAAgB,EAAE,CAiBpB"}

package/dist/vendored/brepjs/measurement/interferenceFns.js

@@ -0,0 +1,102 @@
+/**
+ * Interference detection between shapes.
+ *
+ * Uses the kernel distance API to detect collisions, contact,
+ * and proximity between shape pairs.
+ */
+import { getKernel } from '../kernel/index.js';
+import { ok, err, unwrap } from '../core/result.js';
+import { validationError, BrepErrorCode } from '../core/errors.js';
+import { getBounds } from '../topology/shapeFns.js';
+import { withArenaCheckpoint } from '../core/disposal.js';
+import { wasmIndex } from '../utils/vec3.js';
+// ---------------------------------------------------------------------------
+// Core detection
+// ---------------------------------------------------------------------------
+/**
+ * Check for interference (collision/contact) between two shapes.
+ *
+ * Returns detailed proximity information including the minimum distance
+ * and closest points. Shapes are considered interfering when their
+ * minimum distance is within the given tolerance.
+ *
+ * @param shape1 - First shape.
+ * @param shape2 - Second shape.
+ * @param tolerance - Distance threshold below which shapes are considered interfering. Default: 1e-6.
+ * @returns A `Result` wrapping the {@link InterferenceResult}.
+ *
+ * @example
+ * ```ts
+ * const result = unwrap(checkInterference(boxA, boxB));
+ * if (result.hasInterference) {
+ *   console.log('Collision at distance', result.minDistance);
+ * }
+ * ```
+ */
+export function checkInterference(shape1, shape2, tolerance = 1e-6) {
+    if (getKernel().isNull(shape1.wrapped)) {
+        return err(validationError(BrepErrorCode.NULL_SHAPE_INPUT, 'checkInterference: first shape is a null shape'));
+    }
+    if (getKernel().isNull(shape2.wrapped)) {
+        return err(validationError(BrepErrorCode.NULL_SHAPE_INPUT, 'checkInterference: second shape is a null shape'));
+    }
+    // The kernel's distance computation leaves internal scratch handles brepjs
+    // holds no reference to — a per-call arena residue that compounds to O(N^2)
+    // across checkAllInterferences. We return only plain data (distance + points),
+    // so bulk-freeing the whole call with a checkpoint is safe and keeps the arena
+    // flat even under heavy pairwise batches.
+    return withArenaCheckpoint(() => {
+        const dist = getKernel().distance(shape1.wrapped, shape2.wrapped);
+        return ok({
+            hasInterference: dist.value <= tolerance,
+            minDistance: dist.value,
+            pointOnShape1: dist.point1,
+            pointOnShape2: dist.point2,
+        });
+    });
+}
+// ---------------------------------------------------------------------------
+// Batch detection
+// ---------------------------------------------------------------------------
+/**
+ * Check all pairs in an array of shapes for interference.
+ *
+ * Returns only pairs that have interference (distance within tolerance).
+ * For N shapes, checks N*(N-1)/2 unique pairs.
+ *
+ * @param shapes - Array of shapes to test pairwise.
+ * @param tolerance - Distance threshold for interference. Default: 1e-6.
+ * @returns Array of {@link InterferencePair} entries, one per colliding pair.
+ *
+ * @example
+ * ```ts
+ * const collisions = checkAllInterferences([box, sphere, cylinder]);
+ * collisions.forEach(({ i, j }) => console.log(`Shape ${i} hits shape ${j}`));
+ * ```
+ */
+export function checkAllInterferences(shapes, tolerance = 1e-6) {
+    const pairs = [];
+    // Pre-compute bounding boxes for cheap AABB rejection
+    const boxes = shapes.map((s) => getBounds(s));
+    shapes.forEach((si, i) => {
+        for (let j = i + 1; j < shapes.length; j++) {
+            if (aabbDisjoint(wasmIndex(boxes, i), wasmIndex(boxes, j), tolerance))
+                continue;
+            const result = unwrap(checkInterference(si, wasmIndex(shapes, j), tolerance));
+            if (result.hasInterference) {
+                pairs.push({ i, j, result });
+            }
+        }
+    });
+    return pairs;
+}
+/** Fast AABB disjointness check — returns true if boxes are separated by more than tolerance. */
+function aabbDisjoint(a, b, tolerance) {
+    return (a.xMax + tolerance < b.xMin ||
+        b.xMax + tolerance < a.xMin ||
+        a.yMax + tolerance < b.yMin ||
+        b.yMax + tolerance < a.yMin ||
+        a.zMax + tolerance < b.zMin ||
+        b.zMax + tolerance < a.zMin);
+}
+//# sourceMappingURL=interferenceFns.js.map

package/dist/vendored/brepjs/measurement/interferenceFns.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"interferenceFns.js","sourceRoot":"","sources":["../../../../src/vendored/brepjs/measurement/interferenceFns.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAG/C,OAAO,EAAe,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AACjE,OAAO,EAAE,eAAe,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AACnE,OAAO,EAAE,SAAS,EAAiB,MAAM,yBAAyB,CAAC;AACnE,OAAO,EAAE,mBAAmB,EAAE,MAAM,qBAAqB,CAAC;AAC1D,OAAO,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AA4B7C,8EAA8E;AAC9E,iBAAiB;AACjB,8EAA8E;AAE9E;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,UAAU,iBAAiB,CAC/B,MAA2B,EAC3B,MAA2B,EAC3B,SAAS,GAAG,IAAI;IAEhB,IAAI,SAAS,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;QACvC,OAAO,GAAG,CACR,eAAe,CACb,aAAa,CAAC,gBAAgB,EAC9B,gDAAgD,CACjD,CACF,CAAC;IACJ,CAAC;IACD,IAAI,SAAS,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;QACvC,OAAO,GAAG,CACR,eAAe,CACb,aAAa,CAAC,gBAAgB,EAC9B,iDAAiD,CAClD,CACF,CAAC;IACJ,CAAC;IAED,2EAA2E;IAC3E,4EAA4E;IAC5E,+EAA+E;IAC/E,+EAA+E;IAC/E,0CAA0C;IAC1C,OAAO,mBAAmB,CAAC,GAAG,EAAE;QAC9B,MAAM,IAAI,GAAG,SAAS,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC,OAAO,CAAC,CAAC;QAClE,OAAO,EAAE,CAAC;YACR,eAAe,EAAE,IAAI,CAAC,KAAK,IAAI,SAAS;YACxC,WAAW,EAAE,IAAI,CAAC,KAAK;YACvB,aAAa,EAAE,IAAI,CAAC,MAAM;YAC1B,aAAa,EAAE,IAAI,CAAC,MAAM;SAC3B,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC;AAED,8EAA8E;AAC9E,kBAAkB;AAClB,8EAA8E;AAE9E;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,qBAAqB,CACnC,MAA0C,EAC1C,SAAS,GAAG,IAAI;IAEhB,MAAM,KAAK,GAAuB,EAAE,CAAC;IAErC,sDAAsD;IACtD,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAE9C,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE;QACvB,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,IAAI,YAAY,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,SAAS,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,SAAS,CAAC;gBAAE,SAAS;YAChF,MAAM,MAAM,GAAG,MAAM,CAAC,iBAAiB,CAAC,EAAE,EAAE,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC;YAC9E,IAAI,MAAM,CAAC,eAAe,EAAE,CAAC;gBAC3B,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC;YAC/B,CAAC;QACH,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,OAAO,KAAK,CAAC;AACf,CAAC;AAED,iGAAiG;AACjG,SAAS,YAAY,CAAC,CAAW,EAAE,CAAW,EAAE,SAAiB;IAC/D,OAAO,CACL,CAAC,CAAC,IAAI,GAAG,SAAS,GAAG,CAAC,CAAC,IAAI;QAC3B,CAAC,CAAC,IAAI,GAAG,SAAS,GAAG,CAAC,CAAC,IAAI;QAC3B,CAAC,CAAC,IAAI,GAAG,SAAS,GAAG,CAAC,CAAC,IAAI;QAC3B,CAAC,CAAC,IAAI,GAAG,SAAS,GAAG,CAAC,CAAC,IAAI;QAC3B,CAAC,CAAC,IAAI,GAAG,SAAS,GAAG,CAAC,CAAC,IAAI;QAC3B,CAAC,CAAC,IAAI,GAAG,SAAS,GAAG,CAAC,CAAC,IAAI,CAC5B,CAAC;AACJ,CAAC","sourcesContent":["/**\n * Interference detection between shapes.\n *\n * Uses the kernel distance API to detect collisions, contact,\n * and proximity between shape pairs.\n */\n\nimport { getKernel } from '../kernel/index.js';\nimport type { Vec3 } from '../core/types.js';\nimport type { AnyShape, Dimension } from '../core/shapeTypes.js';\nimport { type Result, ok, err, unwrap } from '../core/result.js';\nimport { validationError, BrepErrorCode } from '../core/errors.js';\nimport { getBounds, type Bounds3D } from '../topology/shapeFns.js';\nimport { withArenaCheckpoint } from '../core/disposal.js';\nimport { wasmIndex } from '../utils/vec3.js';\n\n// ---------------------------------------------------------------------------\n// Types\n// ---------------------------------------------------------------------------\n\n/** Result of a pairwise interference check between two shapes. */\nexport interface InterferenceResult {\n  /** True if shapes are touching or overlapping (distance within tolerance). */\n  readonly hasInterference: boolean;\n  /** Minimum distance between the shapes. 0 when touching or overlapping. */\n  readonly minDistance: number;\n  /** Closest point on the first shape as [x, y, z]. */\n  readonly pointOnShape1: Vec3;\n  /** Closest point on the second shape as [x, y, z]. */\n  readonly pointOnShape2: Vec3;\n}\n\n/** A pair of shapes that were found to interfere during batch checking. */\nexport interface InterferencePair {\n  /** Index of the first shape in the input array. */\n  readonly i: number;\n  /** Index of the second shape in the input array. */\n  readonly j: number;\n  /** Detailed interference result for this pair. */\n  readonly result: InterferenceResult;\n}\n\n// ---------------------------------------------------------------------------\n// Core detection\n// ---------------------------------------------------------------------------\n\n/**\n * Check for interference (collision/contact) between two shapes.\n *\n * Returns detailed proximity information including the minimum distance\n * and closest points. Shapes are considered interfering when their\n * minimum distance is within the given tolerance.\n *\n * @param shape1 - First shape.\n * @param shape2 - Second shape.\n * @param tolerance - Distance threshold below which shapes are considered interfering. Default: 1e-6.\n * @returns A `Result` wrapping the {@link InterferenceResult}.\n *\n * @example\n * ```ts\n * const result = unwrap(checkInterference(boxA, boxB));\n * if (result.hasInterference) {\n *   console.log('Collision at distance', result.minDistance);\n * }\n * ```\n */\nexport function checkInterference(\n  shape1: AnyShape<Dimension>,\n  shape2: AnyShape<Dimension>,\n  tolerance = 1e-6\n): Result<InterferenceResult> {\n  if (getKernel().isNull(shape1.wrapped)) {\n    return err(\n      validationError(\n        BrepErrorCode.NULL_SHAPE_INPUT,\n        'checkInterference: first shape is a null shape'\n      )\n    );\n  }\n  if (getKernel().isNull(shape2.wrapped)) {\n    return err(\n      validationError(\n        BrepErrorCode.NULL_SHAPE_INPUT,\n        'checkInterference: second shape is a null shape'\n      )\n    );\n  }\n\n  // The kernel's distance computation leaves internal scratch handles brepjs\n  // holds no reference to — a per-call arena residue that compounds to O(N^2)\n  // across checkAllInterferences. We return only plain data (distance + points),\n  // so bulk-freeing the whole call with a checkpoint is safe and keeps the arena\n  // flat even under heavy pairwise batches.\n  return withArenaCheckpoint(() => {\n    const dist = getKernel().distance(shape1.wrapped, shape2.wrapped);\n    return ok({\n      hasInterference: dist.value <= tolerance,\n      minDistance: dist.value,\n      pointOnShape1: dist.point1,\n      pointOnShape2: dist.point2,\n    });\n  });\n}\n\n// ---------------------------------------------------------------------------\n// Batch detection\n// ---------------------------------------------------------------------------\n\n/**\n * Check all pairs in an array of shapes for interference.\n *\n * Returns only pairs that have interference (distance within tolerance).\n * For N shapes, checks N*(N-1)/2 unique pairs.\n *\n * @param shapes - Array of shapes to test pairwise.\n * @param tolerance - Distance threshold for interference. Default: 1e-6.\n * @returns Array of {@link InterferencePair} entries, one per colliding pair.\n *\n * @example\n * ```ts\n * const collisions = checkAllInterferences([box, sphere, cylinder]);\n * collisions.forEach(({ i, j }) => console.log(`Shape ${i} hits shape ${j}`));\n * ```\n */\nexport function checkAllInterferences(\n  shapes: ReadonlyArray<AnyShape<Dimension>>,\n  tolerance = 1e-6\n): InterferencePair[] {\n  const pairs: InterferencePair[] = [];\n\n  // Pre-compute bounding boxes for cheap AABB rejection\n  const boxes = shapes.map((s) => getBounds(s));\n\n  shapes.forEach((si, i) => {\n    for (let j = i + 1; j < shapes.length; j++) {\n      if (aabbDisjoint(wasmIndex(boxes, i), wasmIndex(boxes, j), tolerance)) continue;\n      const result = unwrap(checkInterference(si, wasmIndex(shapes, j), tolerance));\n      if (result.hasInterference) {\n        pairs.push({ i, j, result });\n      }\n    }\n  });\n\n  return pairs;\n}\n\n/** Fast AABB disjointness check — returns true if boxes are separated by more than tolerance. */\nfunction aabbDisjoint(a: Bounds3D, b: Bounds3D, tolerance: number): boolean {\n  return (\n    a.xMax + tolerance < b.xMin ||\n    b.xMax + tolerance < a.xMin ||\n    a.yMax + tolerance < b.yMin ||\n    b.yMax + tolerance < a.yMin ||\n    a.zMax + tolerance < b.zMin ||\n    b.zMax + tolerance < a.zMin\n  );\n}\n"]}

package/dist/vendored/brepjs/measurement/measureCache.d.ts

@@ -0,0 +1,20 @@
+/**
+ * WeakMap-based cache for immutable shape measurement results.
+ *
+ * Shapes in brepjs are immutable after creation — boolean ops produce new shapes.
+ * This cache avoids redundant WASM calls for repeated measurements on the same shape.
+ * WeakMap keys auto-expire when shapes are GC'd.
+ */
+import type { VolumeProps, SurfaceProps, LinearProps } from './measureTypes.js';
+/** Maps measurement keys to their corresponding result types. */
+export interface MeasurementValueMap {
+    volume: VolumeProps;
+    surface: SurfaceProps;
+    linear: LinearProps;
+}
+/** Valid measurement cache keys. */
+export type MeasurementKey = keyof MeasurementValueMap;
+export declare function getCachedMeasurement<K extends MeasurementKey>(shape: object, key: K): MeasurementValueMap[K] | undefined;
+export declare function setCachedMeasurement<K extends MeasurementKey>(shape: object, key: K, value: MeasurementValueMap[K]): void;
+export declare function clearMeasurementCache(shape?: object): void;
+//# sourceMappingURL=measureCache.d.ts.map

package/dist/vendored/brepjs/measurement/measureCache.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"measureCache.d.ts","sourceRoot":"","sources":["../../../../src/vendored/brepjs/measurement/measureCache.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,WAAW,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAEhF,iEAAiE;AACjE,MAAM,WAAW,mBAAmB;IAClC,MAAM,EAAE,WAAW,CAAC;IACpB,OAAO,EAAE,YAAY,CAAC;IACtB,MAAM,EAAE,WAAW,CAAC;CACrB;AAED,oCAAoC;AACpC,MAAM,MAAM,cAAc,GAAG,MAAM,mBAAmB,CAAC;AAIvD,wBAAgB,oBAAoB,CAAC,CAAC,SAAS,cAAc,EAC3D,KAAK,EAAE,MAAM,EACb,GAAG,EAAE,CAAC,GACL,mBAAmB,CAAC,CAAC,CAAC,GAAG,SAAS,CAEpC;AAED,wBAAgB,oBAAoB,CAAC,CAAC,SAAS,cAAc,EAC3D,KAAK,EAAE,MAAM,EACb,GAAG,EAAE,CAAC,EACN,KAAK,EAAE,mBAAmB,CAAC,CAAC,CAAC,GAC5B,IAAI,CAON;AAED,wBAAgB,qBAAqB,CAAC,KAAK,CAAC,EAAE,MAAM,GAAG,IAAI,CAM1D"}

package/dist/vendored/brepjs/measurement/measureCache.js

@@ -0,0 +1,28 @@
+/**
+ * WeakMap-based cache for immutable shape measurement results.
+ *
+ * Shapes in brepjs are immutable after creation — boolean ops produce new shapes.
+ * This cache avoids redundant WASM calls for repeated measurements on the same shape.
+ * WeakMap keys auto-expire when shapes are GC'd.
+ */
+let cache = new WeakMap();
+export function getCachedMeasurement(shape, key) {
+    return cache.get(shape)?.get(key);
+}
+export function setCachedMeasurement(shape, key, value) {
+    let map = cache.get(shape);
+    if (!map) {
+        map = new Map();
+        cache.set(shape, map);
+    }
+    map.set(key, value);
+}
+export function clearMeasurementCache(shape) {
+    if (shape) {
+        cache.delete(shape);
+    }
+    else {
+        cache = new WeakMap();
+    }
+}
+//# sourceMappingURL=measureCache.js.map

package/dist/vendored/brepjs/measurement/measureCache.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"measureCache.js","sourceRoot":"","sources":["../../../../src/vendored/brepjs/measurement/measureCache.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAcH,IAAI,KAAK,GAAG,IAAI,OAAO,EAAoE,CAAC;AAE5F,MAAM,UAAU,oBAAoB,CAClC,KAAa,EACb,GAAM;IAEN,OAAO,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,GAAG,CAAuC,CAAC;AAC1E,CAAC;AAED,MAAM,UAAU,oBAAoB,CAClC,KAAa,EACb,GAAM,EACN,KAA6B;IAE7B,IAAI,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAC3B,IAAI,CAAC,GAAG,EAAE,CAAC;QACT,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;QAChB,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IACxB,CAAC;IACD,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;AACtB,CAAC;AAED,MAAM,UAAU,qBAAqB,CAAC,KAAc;IAClD,IAAI,KAAK,EAAE,CAAC;QACV,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IACtB,CAAC;SAAM,CAAC;QACN,KAAK,GAAG,IAAI,OAAO,EAAE,CAAC;IACxB,CAAC;AACH,CAAC","sourcesContent":["/**\n * WeakMap-based cache for immutable shape measurement results.\n *\n * Shapes in brepjs are immutable after creation — boolean ops produce new shapes.\n * This cache avoids redundant WASM calls for repeated measurements on the same shape.\n * WeakMap keys auto-expire when shapes are GC'd.\n */\n\nimport type { VolumeProps, SurfaceProps, LinearProps } from './measureTypes.js';\n\n/** Maps measurement keys to their corresponding result types. */\nexport interface MeasurementValueMap {\n  volume: VolumeProps;\n  surface: SurfaceProps;\n  linear: LinearProps;\n}\n\n/** Valid measurement cache keys. */\nexport type MeasurementKey = keyof MeasurementValueMap;\n\nlet cache = new WeakMap<object, Map<MeasurementKey, MeasurementValueMap[MeasurementKey]>>();\n\nexport function getCachedMeasurement<K extends MeasurementKey>(\n  shape: object,\n  key: K\n): MeasurementValueMap[K] | undefined {\n  return cache.get(shape)?.get(key) as MeasurementValueMap[K] | undefined;\n}\n\nexport function setCachedMeasurement<K extends MeasurementKey>(\n  shape: object,\n  key: K,\n  value: MeasurementValueMap[K]\n): void {\n  let map = cache.get(shape);\n  if (!map) {\n    map = new Map();\n    cache.set(shape, map);\n  }\n  map.set(key, value);\n}\n\nexport function clearMeasurementCache(shape?: object): void {\n  if (shape) {\n    cache.delete(shape);\n  } else {\n    cache = new WeakMap();\n  }\n}\n"]}