@faicad/faijs 0.30.9 → 0.32.2

package/dist/vendored/brepjs/operations/loftFns.js

@@ -1,112 +0,0 @@
-/**
- * Functional loft operation using branded shape types.
- */
-import { getKernel } from '../kernel/index.js';
-import { toVec3 } from '../core/types.js';
-import { castResultShape, disposeResultShape, isShape3D } from '../core/shapeTypes.js';
-import { ok, err } from '../core/result.js';
-import { typeCastError, validationError, kernelError } from '../core/errors.js';
-/**
- * Loft through a set of wire profiles to create a 3D shape.
- *
- * Builds a `BRepOffsetAPI_ThruSections` surface through the given wires,
- * optionally starting and/or ending at point vertices. Produces a solid
- * by default, or a shell when `returnShell` is `true`.
- *
- * @param wires - Ordered wire profiles to loft through.
- * @param config - Loft configuration (ruled interpolation, start/end points).
- * @param returnShell - When `true`, return a shell instead of a solid.
- * @returns `Result` containing the lofted 3D shape, or an error on failure.
- *
- * @example
- * ```ts
- * const result = loft([bottomWire, topWire], { ruled: false });
- * ```
- *
- * @see {@link loft!loft | loft} for the OOP API equivalent.
- */
-export function loft(wires, { ruled = true, startPoint, endPoint, tolerance = 1e-6 } = {}, returnShell = false) {
-    if (wires.length === 0 && !startPoint && !endPoint) {
-        return err(validationError('LOFT_EMPTY', 'Loft requires at least one wire or start/end point'));
-    }
-    const kernel = getKernel();
-    const startVertex = startPoint ? kernel.makeVertex(...toVec3(startPoint)) : undefined;
-    const endVertex = endPoint ? kernel.makeVertex(...toVec3(endPoint)) : undefined;
-    try {
-        const shape = kernel.loftAdvanced(wires.map((w) => w.wrapped), {
-            solid: !returnShell,
-            ruled,
-            tolerance,
-            ...(startVertex ? { startVertex } : {}),
-            ...(endVertex ? { endVertex } : {}),
-        });
-        const result = castResultShape(shape);
-        if (!isShape3D(result)) {
-            disposeResultShape(result);
-            return err(typeCastError('LOFT_NOT_3D', 'Loft did not produce a 3D shape'));
-        }
-        return ok(result);
-    }
-    catch (e) {
-        return err(kernelError('LOFT_FAILED', 'Loft operation failed', e, undefined, 'Common causes: wire profiles with different edge counts, self-intersecting result, or profiles too far apart. Ensure profiles are compatible and ordered.'));
-    }
-}
-/**
- * Batch loft: build N independent lofts in a single kernel call.
- *
- * Uses the C++ LoftBatch extractor when available (single WASM call),
- * falling back to N individual loft operations otherwise.
- *
- * @returns Array of 3D shapes, one per entry.
- */
-export function loftAll(entries) {
-    if (entries.length === 0)
-        return ok([]);
-    const kernel = getKernel();
-    // eslint-disable-next-line @typescript-eslint/no-explicit-any -- WASM vertex handles
-    const verticesToDelete = [];
-    const kernelEntries = entries.map((e) => {
-        const startVertex = e.startPoint ? kernel.makeVertex(...toVec3(e.startPoint)) : undefined;
-        const endVertex = e.endPoint ? kernel.makeVertex(...toVec3(e.endPoint)) : undefined;
-        if (startVertex)
-            verticesToDelete.push(startVertex);
-        if (endVertex)
-            verticesToDelete.push(endVertex);
-        return {
-            wires: e.wires.map((w) => w.wrapped),
-            solid: true,
-            ruled: e.ruled ?? true,
-            tolerance: e.tolerance ?? 1e-6,
-            startVertex,
-            endVertex,
-        };
-    });
-    try {
-        const shapes = kernel.loftBatch?.(kernelEntries) ??
-            kernelEntries.map((e) => kernel.loftAdvanced(e.wires, {
-                solid: e.solid,
-                ruled: e.ruled,
-                tolerance: e.tolerance,
-                startVertex: e.startVertex,
-                endVertex: e.endVertex,
-            }));
-        const results = [];
-        for (const shape of shapes) {
-            const cast = castResultShape(shape);
-            if (!isShape3D(cast)) {
-                disposeResultShape(cast);
-                return err(typeCastError('LOFT_ALL_NOT_3D', 'Batch loft entry did not produce a 3D shape'));
-            }
-            results.push(cast);
-        }
-        return ok(results);
-    }
-    catch (e) {
-        return err(kernelError('LOFT_ALL_FAILED', 'Batch loft operation failed', e));
-    }
-    finally {
-        for (const v of verticesToDelete)
-            kernel.dispose(v);
-    }
-}
-//# sourceMappingURL=loftFns.js.map

package/dist/vendored/brepjs/operations/loftFns.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"loftFns.js","sourceRoot":"","sources":["../../../../src/vendored/brepjs/operations/loftFns.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAE/C,OAAO,EAAE,MAAM,EAAE,MAAM,kBAAkB,CAAC;AAE1C,OAAO,EAAE,eAAe,EAAE,kBAAkB,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AACvF,OAAO,EAAe,EAAE,EAAE,GAAG,EAAE,MAAM,mBAAmB,CAAC;AACzD,OAAO,EAAE,aAAa,EAAE,eAAe,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAchF;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,UAAU,IAAI,CAClB,KAAwB,EACxB,EAAE,KAAK,GAAG,IAAI,EAAE,UAAU,EAAE,QAAQ,EAAE,SAAS,GAAG,IAAI,KAAkB,EAAE,EAC1E,WAAW,GAAG,KAAK;IAEnB,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,UAAU,IAAI,CAAC,QAAQ,EAAE,CAAC;QACnD,OAAO,GAAG,CAAC,eAAe,CAAC,YAAY,EAAE,oDAAoD,CAAC,CAAC,CAAC;IAClG,CAAC;IAED,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC;IAE3B,MAAM,WAAW,GAAG,UAAU,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACtF,MAAM,SAAS,GAAG,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAEhF,IAAI,CAAC;QACH,MAAM,KAAK,GAAG,MAAM,CAAC,YAAY,CAC/B,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,EAC3B;YACE,KAAK,EAAE,CAAC,WAAW;YACnB,KAAK;YACL,SAAS;YACT,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACvC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACpC,CACF,CAAC;QAEF,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;QACtC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC;YACvB,kBAAkB,CAAC,MAAM,CAAC,CAAC;YAC3B,OAAO,GAAG,CAAC,aAAa,CAAC,aAAa,EAAE,iCAAiC,CAAC,CAAC,CAAC;QAC9E,CAAC;QACD,OAAO,EAAE,CAAC,MAAM,CAAC,CAAC;IACpB,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,OAAO,GAAG,CACR,WAAW,CACT,aAAa,EACb,uBAAuB,EACvB,CAAC,EACD,SAAS,EACT,2JAA2J,CAC5J,CACF,CAAC;IACJ,CAAC;AACH,CAAC;AAgBD;;;;;;;GAOG;AACH,MAAM,UAAU,OAAO,CAAC,OAAgC;IACtD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC;IAExC,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC;IAC3B,qFAAqF;IACrF,MAAM,gBAAgB,GAAU,EAAE,CAAC;IACnC,MAAM,aAAa,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QACtC,MAAM,WAAW,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAC1F,MAAM,SAAS,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QACpF,IAAI,WAAW;YAAE,gBAAgB,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QACpD,IAAI,SAAS;YAAE,gBAAgB,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAChD,OAAO;YACL,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC;YACpC,KAAK,EAAE,IAAI;YACX,KAAK,EAAE,CAAC,CAAC,KAAK,IAAI,IAAI;YACtB,SAAS,EAAE,CAAC,CAAC,SAAS,IAAI,IAAI;YAC9B,WAAW;YACX,SAAS;SACV,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC;QACH,MAAM,MAAM,GACV,MAAM,CAAC,SAAS,EAAE,CAAC,aAAa,CAAC;YACjC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CACtB,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,EAAE;gBAC3B,KAAK,EAAE,CAAC,CAAC,KAAK;gBACd,KAAK,EAAE,CAAC,CAAC,KAAK;gBACd,SAAS,EAAE,CAAC,CAAC,SAAS;gBACtB,WAAW,EAAE,CAAC,CAAC,WAAW;gBAC1B,SAAS,EAAE,CAAC,CAAC,SAAS;aACvB,CAAC,CACH,CAAC;QAEJ,MAAM,OAAO,GAAc,EAAE,CAAC;QAC9B,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;YACpC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;gBACrB,kBAAkB,CAAC,IAAI,CAAC,CAAC;gBACzB,OAAO,GAAG,CAAC,aAAa,CAAC,iBAAiB,EAAE,6CAA6C,CAAC,CAAC,CAAC;YAC9F,CAAC;YACD,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrB,CAAC;QACD,OAAO,EAAE,CAAC,OAAO,CAAC,CAAC;IACrB,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,OAAO,GAAG,CAAC,WAAW,CAAC,iBAAiB,EAAE,6BAA6B,EAAE,CAAC,CAAC,CAAC,CAAC;IAC/E,CAAC;YAAS,CAAC;QACT,KAAK,MAAM,CAAC,IAAI,gBAAgB;YAAE,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACtD,CAAC;AACH,CAAC","sourcesContent":["/**\n * Functional loft operation using branded shape types.\n */\n\nimport { getKernel } from '../kernel/index.js';\nimport type { PointInput } from '../core/types.js';\nimport { toVec3 } from '../core/types.js';\nimport type { Dimension, Wire, Shape3D } from '../core/shapeTypes.js';\nimport { castResultShape, disposeResultShape, isShape3D } from '../core/shapeTypes.js';\nimport { type Result, ok, err } from '../core/result.js';\nimport { typeCastError, validationError, kernelError } from '../core/errors.js';\n\n/** Configuration for the functional loft operation. */\nexport interface LoftOptions {\n  /** Use ruled (straight) interpolation between profiles. Defaults to `true`. */\n  ruled?: boolean;\n  /** Optional start vertex before the first wire profile. */\n  startPoint?: PointInput;\n  /** Optional end vertex after the last wire profile. */\n  endPoint?: PointInput;\n  /** Sewing tolerance for ThruSections builder. Defaults to `1e-6`. */\n  tolerance?: number;\n}\n\n/**\n * Loft through a set of wire profiles to create a 3D shape.\n *\n * Builds a `BRepOffsetAPI_ThruSections` surface through the given wires,\n * optionally starting and/or ending at point vertices. Produces a solid\n * by default, or a shell when `returnShell` is `true`.\n *\n * @param wires - Ordered wire profiles to loft through.\n * @param config - Loft configuration (ruled interpolation, start/end points).\n * @param returnShell - When `true`, return a shell instead of a solid.\n * @returns `Result` containing the lofted 3D shape, or an error on failure.\n *\n * @example\n * ```ts\n * const result = loft([bottomWire, topWire], { ruled: false });\n * ```\n *\n * @see {@link loft!loft | loft} for the OOP API equivalent.\n */\nexport function loft(\n  wires: Wire<Dimension>[],\n  { ruled = true, startPoint, endPoint, tolerance = 1e-6 }: LoftOptions = {},\n  returnShell = false\n): Result<Shape3D> {\n  if (wires.length === 0 && !startPoint && !endPoint) {\n    return err(validationError('LOFT_EMPTY', 'Loft requires at least one wire or start/end point'));\n  }\n\n  const kernel = getKernel();\n\n  const startVertex = startPoint ? kernel.makeVertex(...toVec3(startPoint)) : undefined;\n  const endVertex = endPoint ? kernel.makeVertex(...toVec3(endPoint)) : undefined;\n\n  try {\n    const shape = kernel.loftAdvanced(\n      wires.map((w) => w.wrapped),\n      {\n        solid: !returnShell,\n        ruled,\n        tolerance,\n        ...(startVertex ? { startVertex } : {}),\n        ...(endVertex ? { endVertex } : {}),\n      }\n    );\n\n    const result = castResultShape(shape);\n    if (!isShape3D(result)) {\n      disposeResultShape(result);\n      return err(typeCastError('LOFT_NOT_3D', 'Loft did not produce a 3D shape'));\n    }\n    return ok(result);\n  } catch (e) {\n    return err(\n      kernelError(\n        'LOFT_FAILED',\n        'Loft operation failed',\n        e,\n        undefined,\n        'Common causes: wire profiles with different edge counts, self-intersecting result, or profiles too far apart. Ensure profiles are compatible and ordered.'\n      )\n    );\n  }\n}\n\n/** Configuration for a single entry in a batch loft operation. */\nexport interface LoftAllEntry {\n  /** Ordered wire profiles to loft through. */\n  wires: Wire<Dimension>[];\n  /** Use ruled (straight) interpolation. Defaults to `true`. */\n  ruled?: boolean;\n  /** Optional start point before the first wire. */\n  startPoint?: PointInput;\n  /** Optional end point after the last wire. */\n  endPoint?: PointInput;\n  /** Sewing tolerance. Defaults to `1e-6`. */\n  tolerance?: number;\n}\n\n/**\n * Batch loft: build N independent lofts in a single kernel call.\n *\n * Uses the C++ LoftBatch extractor when available (single WASM call),\n * falling back to N individual loft operations otherwise.\n *\n * @returns Array of 3D shapes, one per entry.\n */\nexport function loftAll(entries: readonly LoftAllEntry[]): Result<Shape3D[]> {\n  if (entries.length === 0) return ok([]);\n\n  const kernel = getKernel();\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any -- WASM vertex handles\n  const verticesToDelete: any[] = [];\n  const kernelEntries = entries.map((e) => {\n    const startVertex = e.startPoint ? kernel.makeVertex(...toVec3(e.startPoint)) : undefined;\n    const endVertex = e.endPoint ? kernel.makeVertex(...toVec3(e.endPoint)) : undefined;\n    if (startVertex) verticesToDelete.push(startVertex);\n    if (endVertex) verticesToDelete.push(endVertex);\n    return {\n      wires: e.wires.map((w) => w.wrapped),\n      solid: true,\n      ruled: e.ruled ?? true,\n      tolerance: e.tolerance ?? 1e-6,\n      startVertex,\n      endVertex,\n    };\n  });\n\n  try {\n    const shapes =\n      kernel.loftBatch?.(kernelEntries) ??\n      kernelEntries.map((e) =>\n        kernel.loftAdvanced(e.wires, {\n          solid: e.solid,\n          ruled: e.ruled,\n          tolerance: e.tolerance,\n          startVertex: e.startVertex,\n          endVertex: e.endVertex,\n        })\n      );\n\n    const results: Shape3D[] = [];\n    for (const shape of shapes) {\n      const cast = castResultShape(shape);\n      if (!isShape3D(cast)) {\n        disposeResultShape(cast);\n        return err(typeCastError('LOFT_ALL_NOT_3D', 'Batch loft entry did not produce a 3D shape'));\n      }\n      results.push(cast);\n    }\n    return ok(results);\n  } catch (e) {\n    return err(kernelError('LOFT_ALL_FAILED', 'Batch loft operation failed', e));\n  } finally {\n    for (const v of verticesToDelete) kernel.dispose(v);\n  }\n}\n"]}

package/dist/vendored/brepjs/operations/mateFns.d.ts

@@ -1,53 +0,0 @@
-/**
- * Assembly mates — constraint-based positioning for assembly parts.
- */
-import type { Face, Edge } from '../core/shapeTypes.js';
-import type { Vec3 } from '../core/types.js';
-import { type Result } from '../core/result.js';
-import type { AssemblyNode } from './assemblyFns.js';
-export interface MateEntity {
-    node: string;
-    face?: Face;
-    edge?: Edge;
-    point?: Vec3;
-}
-export type MateConstraint = {
-    type: 'coincident';
-    entityA: MateEntity;
-    entityB: MateEntity;
-} | {
-    type: 'concentric';
-    axisA: MateEntity;
-    axisB: MateEntity;
-} | {
-    type: 'distance';
-    entityA: MateEntity;
-    entityB: MateEntity;
-    distance: number;
-} | {
-    type: 'angle';
-    entityA: MateEntity;
-    entityB: MateEntity;
-    angle: number;
-} | {
-    type: 'fixed';
-    entity: MateEntity;
-};
-export interface AssemblySolveResult {
-    transforms: Map<string, {
-        position: Vec3;
-        rotation: [number, number, number, number];
-    }>;
-    dof: number;
-    converged: boolean;
-}
-/**
- * Add a mate constraint to an assembly.
- * Returns a new assembly node with the constraint added.
- */
-export declare function addMate(assembly: AssemblyNode, constraint: MateConstraint): AssemblyNode;
-/**
- * Solve all mate constraints and compute part transforms.
- */
-export declare function solveAssembly(assembly: AssemblyNode): Result<AssemblySolveResult>;
-//# sourceMappingURL=mateFns.d.ts.map

package/dist/vendored/brepjs/operations/mateFns.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"mateFns.d.ts","sourceRoot":"","sources":["../../../../src/vendored/brepjs/operations/mateFns.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,uBAAuB,CAAC;AACxD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AAC7C,OAAO,EAAE,KAAK,MAAM,EAAW,MAAM,mBAAmB,CAAC;AAEzD,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAcrD,MAAM,WAAW,UAAU;IACzB,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,CAAC,EAAE,IAAI,CAAC;IACZ,IAAI,CAAC,EAAE,IAAI,CAAC;IACZ,KAAK,CAAC,EAAE,IAAI,CAAC;CACd;AAED,MAAM,MAAM,cAAc,GACtB;IAAE,IAAI,EAAE,YAAY,CAAC;IAAC,OAAO,EAAE,UAAU,CAAC;IAAC,OAAO,EAAE,UAAU,CAAA;CAAE,GAChE;IAAE,IAAI,EAAE,YAAY,CAAC;IAAC,KAAK,EAAE,UAAU,CAAC;IAAC,KAAK,EAAE,UAAU,CAAA;CAAE,GAC5D;IAAE,IAAI,EAAE,UAAU,CAAC;IAAC,OAAO,EAAE,UAAU,CAAC;IAAC,OAAO,EAAE,UAAU,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAA;CAAE,GAChF;IAAE,IAAI,EAAE,OAAO,CAAC;IAAC,OAAO,EAAE,UAAU,CAAC;IAAC,OAAO,EAAE,UAAU,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,GAC1E;IAAE,IAAI,EAAE,OAAO,CAAC;IAAC,MAAM,EAAE,UAAU,CAAA;CAAE,CAAC;AAE1C,MAAM,WAAW,mBAAmB;IAClC,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE;QAAE,QAAQ,EAAE,IAAI,CAAC;QAAC,QAAQ,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAA;KAAE,CAAC,CAAC;IACxF,GAAG,EAAE,MAAM,CAAC;IACZ,SAAS,EAAE,OAAO,CAAC;CACpB;AAqGD;;;GAGG;AACH,wBAAgB,OAAO,CAAC,QAAQ,EAAE,YAAY,EAAE,UAAU,EAAE,cAAc,GAAG,YAAY,CAGxF;AAED;;GAEG;AACH,wBAAgB,aAAa,CAAC,QAAQ,EAAE,YAAY,GAAG,MAAM,CAAC,mBAAmB,CAAC,CA6CjF"}

package/dist/vendored/brepjs/operations/mateFns.js

@@ -1,142 +0,0 @@
-/**
- * Assembly mates — constraint-based positioning for assembly parts.
- */
-import { ok, err } from '../core/result.js';
-import { validationError, kernelError, BrepErrorCode } from '../core/errors.js';
-import { walkAssembly } from './assemblyFns.js';
-import { faceCenter, normalAt, faceAxis } from '../topology/faceFns.js';
-import { getCurveType, curveStartPoint, curveTangentAt, curveAxis } from '../topology/curveFns.js';
-import { solveConstraints, } from '../kernel/solverAdapter.js';
-// ---------------------------------------------------------------------------
-// Geometry extraction
-// ---------------------------------------------------------------------------
-function extractEntity(mate) {
-    if (mate.face) {
-        // A cylindrical (or otherwise axial) face yields an axis; a planar face a
-        // plane. faceAxis returns null for non-axial faces, so it doubles as the
-        // discriminator.
-        const axis = faceAxis(mate.face);
-        if (axis) {
-            return { type: 'axis', origin: axis.origin, direction: axis.direction };
-        }
-        return { type: 'plane', origin: faceCenter(mate.face), normal: normalAt(mate.face) };
-    }
-    if (mate.edge) {
-        // A straight edge defines an axis along its tangent; a circular edge defines
-        // one through its center, normal to its plane (bore rim, shaft fillet).
-        if (getCurveType(mate.edge) === 'LINE') {
-            return {
-                type: 'axis',
-                origin: curveStartPoint(mate.edge),
-                direction: curveTangentAt(mate.edge),
-            };
-        }
-        const axis = curveAxis(mate.edge);
-        if (axis) {
-            return { type: 'axis', origin: axis.origin, direction: axis.direction };
-        }
-        return null;
-    }
-    if (mate.point) {
-        return { type: 'point', origin: mate.point };
-    }
-    return null;
-}
-/** Extract and validate a pair of MateEntities into a partial SolverConstraint. */
-function extractPair(a, b) {
-    const entA = extractEntity(a);
-    const entB = extractEntity(b);
-    if (!entA || !entB) {
-        return err(validationError(BrepErrorCode.ASSEMBLY_MATE_INVALID, 'solveAssembly: could not extract geometry from mate entities'));
-    }
-    return ok({
-        entityA: { node: a.node, entity: entA },
-        entityB: { node: b.node, entity: entB },
-    });
-}
-/** Convert a single mate into a solver constraint. */
-function mateToSolverConstraint(mate) {
-    switch (mate.type) {
-        case 'fixed':
-            return ok({
-                type: 'fixed',
-                entityA: { node: mate.entity.node, entity: { type: 'point', origin: [0, 0, 0] } },
-            });
-        case 'coincident': {
-            const pair = extractPair(mate.entityA, mate.entityB);
-            if (!pair.ok)
-                return pair;
-            return ok({ type: 'coincident', ...pair.value });
-        }
-        case 'distance': {
-            const pair = extractPair(mate.entityA, mate.entityB);
-            if (!pair.ok)
-                return pair;
-            return ok({ type: 'distance', ...pair.value, value: mate.distance });
-        }
-        case 'angle': {
-            const pair = extractPair(mate.entityA, mate.entityB);
-            if (!pair.ok)
-                return pair;
-            return ok({ type: 'angle', ...pair.value, value: mate.angle });
-        }
-        case 'concentric': {
-            const pair = extractPair(mate.axisA, mate.axisB);
-            if (!pair.ok)
-                return pair;
-            return ok({ type: 'concentric', ...pair.value });
-        }
-    }
-}
-// ---------------------------------------------------------------------------
-// Public API
-// ---------------------------------------------------------------------------
-/**
- * Add a mate constraint to an assembly.
- * Returns a new assembly node with the constraint added.
- */
-export function addMate(assembly, constraint) {
-    const existing = (assembly.mates ?? []);
-    return { ...assembly, mates: [...existing, constraint] };
-}
-/**
- * Solve all mate constraints and compute part transforms.
- */
-export function solveAssembly(assembly) {
-    const mates = assembly.mates;
-    if (!mates || mates.length === 0) {
-        return err(validationError(BrepErrorCode.ASSEMBLY_MATE_INVALID, 'solveAssembly: no mates defined'));
-    }
-    try {
-        // Collect all node names
-        const nodes = [];
-        walkAssembly(assembly, (node) => {
-            nodes.push(node.name);
-        });
-        // Convert mates to solver constraints
-        const solverConstraints = [];
-        for (const mate of mates) {
-            const result = mateToSolverConstraint(mate);
-            if (!result.ok)
-                return result;
-            solverConstraints.push(result.value);
-        }
-        const result = solveConstraints(nodes, solverConstraints);
-        if (!result.converged) {
-            const detail = result.unsupported.length > 0
-                ? `Unsupported constraint types: ${result.unsupported.join(', ')} (${result.dof} DOF unresolved)`
-                : 'Assembly constraint solver did not converge';
-            return err(kernelError(BrepErrorCode.ASSEMBLY_NOT_CONVERGED, detail));
-        }
-        return ok({
-            transforms: result.transforms,
-            dof: result.dof,
-            converged: result.converged,
-        });
-    }
-    catch (e) {
-        const raw = e instanceof Error ? e.message : String(e);
-        return err(kernelError(BrepErrorCode.ASSEMBLY_SOLVE_FAILED, `Assembly solve failed: ${raw}`, e));
-    }
-}
-//# sourceMappingURL=mateFns.js.map

package/dist/vendored/brepjs/operations/mateFns.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"mateFns.js","sourceRoot":"","sources":["../../../../src/vendored/brepjs/operations/mateFns.ts"],"names":[],"mappings":"AAAA;;GAEG;AAIH,OAAO,EAAe,EAAE,EAAE,GAAG,EAAE,MAAM,mBAAmB,CAAC;AACzD,OAAO,EAAE,eAAe,EAAE,WAAW,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAEhF,OAAO,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAChD,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AACxE,OAAO,EAAE,YAAY,EAAE,eAAe,EAAE,cAAc,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACnG,OAAO,EACL,gBAAgB,GAGjB,MAAM,4BAA4B,CAAC;AA0BpC,8EAA8E;AAC9E,sBAAsB;AACtB,8EAA8E;AAE9E,SAAS,aAAa,CAAC,IAAgB;IACrC,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;QACd,0EAA0E;QAC1E,yEAAyE;QACzE,iBAAiB;QACjB,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,IAAI,IAAI,EAAE,CAAC;YACT,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC;QAC1E,CAAC;QACD,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;IACvF,CAAC;IAED,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;QACd,6EAA6E;QAC7E,wEAAwE;QACxE,IAAI,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,MAAM,EAAE,CAAC;YACvC,OAAO;gBACL,IAAI,EAAE,MAAM;gBACZ,MAAM,EAAE,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC;gBAClC,SAAS,EAAE,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC;aACrC,CAAC;QACJ,CAAC;QACD,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,IAAI,EAAE,CAAC;YACT,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC;QAC1E,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QACf,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC;IAC/C,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED,mFAAmF;AACnF,SAAS,WAAW,CAClB,CAAa,EACb,CAAa;IAKb,MAAM,IAAI,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;IAC9B,MAAM,IAAI,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;IAC9B,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;QACnB,OAAO,GAAG,CACR,eAAe,CACb,aAAa,CAAC,qBAAqB,EACnC,8DAA8D,CAC/D,CACF,CAAC;IACJ,CAAC;IACD,OAAO,EAAE,CAAC;QACR,OAAO,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE;QACvC,OAAO,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE;KACxC,CAAC,CAAC;AACL,CAAC;AAED,sDAAsD;AACtD,SAAS,sBAAsB,CAAC,IAAoB;IAClD,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,OAAO;YACV,OAAO,EAAE,CAAC;gBACR,IAAI,EAAE,OAAO;gBACb,OAAO,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE;aAClF,CAAC,CAAC;QACL,KAAK,YAAY,CAAC,CAAC,CAAC;YAClB,MAAM,IAAI,GAAG,WAAW,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;YACrD,IAAI,CAAC,IAAI,CAAC,EAAE;gBAAE,OAAO,IAAI,CAAC;YAC1B,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;QACnD,CAAC;QACD,KAAK,UAAU,CAAC,CAAC,CAAC;YAChB,MAAM,IAAI,GAAG,WAAW,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;YACrD,IAAI,CAAC,IAAI,CAAC,EAAE;gBAAE,OAAO,IAAI,CAAC;YAC1B,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,GAAG,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;QACvE,CAAC;QACD,KAAK,OAAO,CAAC,CAAC,CAAC;YACb,MAAM,IAAI,GAAG,WAAW,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;YACrD,IAAI,CAAC,IAAI,CAAC,EAAE;gBAAE,OAAO,IAAI,CAAC;YAC1B,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;QACjE,CAAC;QACD,KAAK,YAAY,CAAC,CAAC,CAAC;YAClB,MAAM,IAAI,GAAG,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;YACjD,IAAI,CAAC,IAAI,CAAC,EAAE;gBAAE,OAAO,IAAI,CAAC;YAC1B,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;QACnD,CAAC;IACH,CAAC;AACH,CAAC;AAED,8EAA8E;AAC9E,aAAa;AACb,8EAA8E;AAE9E;;;GAGG;AACH,MAAM,UAAU,OAAO,CAAC,QAAsB,EAAE,UAA0B;IACxE,MAAM,QAAQ,GAAG,CAAC,QAAQ,CAAC,KAAK,IAAI,EAAE,CAA8B,CAAC;IACrE,OAAO,EAAE,GAAG,QAAQ,EAAE,KAAK,EAAE,CAAC,GAAG,QAAQ,EAAE,UAAU,CAAC,EAAE,CAAC;AAC3D,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,aAAa,CAAC,QAAsB;IAClD,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAqC,CAAC;IAC7D,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACjC,OAAO,GAAG,CACR,eAAe,CAAC,aAAa,CAAC,qBAAqB,EAAE,iCAAiC,CAAC,CACxF,CAAC;IACJ,CAAC;IAED,IAAI,CAAC;QACH,yBAAyB;QACzB,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,YAAY,CAAC,QAAQ,EAAE,CAAC,IAAI,EAAE,EAAE;YAC9B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxB,CAAC,CAAC,CAAC;QAEH,sCAAsC;QACtC,MAAM,iBAAiB,GAAuB,EAAE,CAAC;QAEjD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,MAAM,GAAG,sBAAsB,CAAC,IAAI,CAAC,CAAC;YAC5C,IAAI,CAAC,MAAM,CAAC,EAAE;gBAAE,OAAO,MAAM,CAAC;YAC9B,iBAAiB,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACvC,CAAC;QAED,MAAM,MAAM,GAAG,gBAAgB,CAAC,KAAK,EAAE,iBAAiB,CAAC,CAAC;QAE1D,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC;YACtB,MAAM,MAAM,GACV,MAAM,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC;gBAC3B,CAAC,CAAC,iCAAiC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,MAAM,CAAC,GAAG,kBAAkB;gBACjG,CAAC,CAAC,6CAA6C,CAAC;YACpD,OAAO,GAAG,CAAC,WAAW,CAAC,aAAa,CAAC,sBAAsB,EAAE,MAAM,CAAC,CAAC,CAAC;QACxE,CAAC;QAED,OAAO,EAAE,CAAC;YACR,UAAU,EAAE,MAAM,CAAC,UAAU;YAC7B,GAAG,EAAE,MAAM,CAAC,GAAG;YACf,SAAS,EAAE,MAAM,CAAC,SAAS;SAC5B,CAAC,CAAC;IACL,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,MAAM,GAAG,GAAG,CAAC,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACvD,OAAO,GAAG,CACR,WAAW,CAAC,aAAa,CAAC,qBAAqB,EAAE,0BAA0B,GAAG,EAAE,EAAE,CAAC,CAAC,CACrF,CAAC;IACJ,CAAC;AACH,CAAC","sourcesContent":["/**\n * Assembly mates — constraint-based positioning for assembly parts.\n */\n\nimport type { Face, Edge } from '../core/shapeTypes.js';\nimport type { Vec3 } from '../core/types.js';\nimport { type Result, ok, err } from '../core/result.js';\nimport { validationError, kernelError, BrepErrorCode } from '../core/errors.js';\nimport type { AssemblyNode } from './assemblyFns.js';\nimport { walkAssembly } from './assemblyFns.js';\nimport { faceCenter, normalAt, faceAxis } from '../topology/faceFns.js';\nimport { getCurveType, curveStartPoint, curveTangentAt, curveAxis } from '../topology/curveFns.js';\nimport {\n  solveConstraints,\n  type SolverEntity,\n  type SolverConstraint,\n} from '../kernel/solverAdapter.js';\n\n// ---------------------------------------------------------------------------\n// Types\n// ---------------------------------------------------------------------------\n\nexport interface MateEntity {\n  node: string;\n  face?: Face;\n  edge?: Edge;\n  point?: Vec3;\n}\n\nexport type MateConstraint =\n  | { type: 'coincident'; entityA: MateEntity; entityB: MateEntity }\n  | { type: 'concentric'; axisA: MateEntity; axisB: MateEntity }\n  | { type: 'distance'; entityA: MateEntity; entityB: MateEntity; distance: number }\n  | { type: 'angle'; entityA: MateEntity; entityB: MateEntity; angle: number }\n  | { type: 'fixed'; entity: MateEntity };\n\nexport interface AssemblySolveResult {\n  transforms: Map<string, { position: Vec3; rotation: [number, number, number, number] }>;\n  dof: number;\n  converged: boolean;\n}\n\n// ---------------------------------------------------------------------------\n// Geometry extraction\n// ---------------------------------------------------------------------------\n\nfunction extractEntity(mate: MateEntity): SolverEntity | null {\n  if (mate.face) {\n    // A cylindrical (or otherwise axial) face yields an axis; a planar face a\n    // plane. faceAxis returns null for non-axial faces, so it doubles as the\n    // discriminator.\n    const axis = faceAxis(mate.face);\n    if (axis) {\n      return { type: 'axis', origin: axis.origin, direction: axis.direction };\n    }\n    return { type: 'plane', origin: faceCenter(mate.face), normal: normalAt(mate.face) };\n  }\n\n  if (mate.edge) {\n    // A straight edge defines an axis along its tangent; a circular edge defines\n    // one through its center, normal to its plane (bore rim, shaft fillet).\n    if (getCurveType(mate.edge) === 'LINE') {\n      return {\n        type: 'axis',\n        origin: curveStartPoint(mate.edge),\n        direction: curveTangentAt(mate.edge),\n      };\n    }\n    const axis = curveAxis(mate.edge);\n    if (axis) {\n      return { type: 'axis', origin: axis.origin, direction: axis.direction };\n    }\n    return null;\n  }\n\n  if (mate.point) {\n    return { type: 'point', origin: mate.point };\n  }\n\n  return null;\n}\n\n/** Extract and validate a pair of MateEntities into a partial SolverConstraint. */\nfunction extractPair(\n  a: MateEntity,\n  b: MateEntity\n): Result<{\n  entityA: { node: string; entity: SolverEntity };\n  entityB: { node: string; entity: SolverEntity };\n}> {\n  const entA = extractEntity(a);\n  const entB = extractEntity(b);\n  if (!entA || !entB) {\n    return err(\n      validationError(\n        BrepErrorCode.ASSEMBLY_MATE_INVALID,\n        'solveAssembly: could not extract geometry from mate entities'\n      )\n    );\n  }\n  return ok({\n    entityA: { node: a.node, entity: entA },\n    entityB: { node: b.node, entity: entB },\n  });\n}\n\n/** Convert a single mate into a solver constraint. */\nfunction mateToSolverConstraint(mate: MateConstraint): Result<SolverConstraint> {\n  switch (mate.type) {\n    case 'fixed':\n      return ok({\n        type: 'fixed',\n        entityA: { node: mate.entity.node, entity: { type: 'point', origin: [0, 0, 0] } },\n      });\n    case 'coincident': {\n      const pair = extractPair(mate.entityA, mate.entityB);\n      if (!pair.ok) return pair;\n      return ok({ type: 'coincident', ...pair.value });\n    }\n    case 'distance': {\n      const pair = extractPair(mate.entityA, mate.entityB);\n      if (!pair.ok) return pair;\n      return ok({ type: 'distance', ...pair.value, value: mate.distance });\n    }\n    case 'angle': {\n      const pair = extractPair(mate.entityA, mate.entityB);\n      if (!pair.ok) return pair;\n      return ok({ type: 'angle', ...pair.value, value: mate.angle });\n    }\n    case 'concentric': {\n      const pair = extractPair(mate.axisA, mate.axisB);\n      if (!pair.ok) return pair;\n      return ok({ type: 'concentric', ...pair.value });\n    }\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Public API\n// ---------------------------------------------------------------------------\n\n/**\n * Add a mate constraint to an assembly.\n * Returns a new assembly node with the constraint added.\n */\nexport function addMate(assembly: AssemblyNode, constraint: MateConstraint): AssemblyNode {\n  const existing = (assembly.mates ?? []) as readonly MateConstraint[];\n  return { ...assembly, mates: [...existing, constraint] };\n}\n\n/**\n * Solve all mate constraints and compute part transforms.\n */\nexport function solveAssembly(assembly: AssemblyNode): Result<AssemblySolveResult> {\n  const mates = assembly.mates as MateConstraint[] | undefined;\n  if (!mates || mates.length === 0) {\n    return err(\n      validationError(BrepErrorCode.ASSEMBLY_MATE_INVALID, 'solveAssembly: no mates defined')\n    );\n  }\n\n  try {\n    // Collect all node names\n    const nodes: string[] = [];\n    walkAssembly(assembly, (node) => {\n      nodes.push(node.name);\n    });\n\n    // Convert mates to solver constraints\n    const solverConstraints: SolverConstraint[] = [];\n\n    for (const mate of mates) {\n      const result = mateToSolverConstraint(mate);\n      if (!result.ok) return result;\n      solverConstraints.push(result.value);\n    }\n\n    const result = solveConstraints(nodes, solverConstraints);\n\n    if (!result.converged) {\n      const detail =\n        result.unsupported.length > 0\n          ? `Unsupported constraint types: ${result.unsupported.join(', ')} (${result.dof} DOF unresolved)`\n          : 'Assembly constraint solver did not converge';\n      return err(kernelError(BrepErrorCode.ASSEMBLY_NOT_CONVERGED, detail));\n    }\n\n    return ok({\n      transforms: result.transforms,\n      dof: result.dof,\n      converged: result.converged,\n    });\n  } catch (e) {\n    const raw = e instanceof Error ? e.message : String(e);\n    return err(\n      kernelError(BrepErrorCode.ASSEMBLY_SOLVE_FAILED, `Assembly solve failed: ${raw}`, e)\n    );\n  }\n}\n"]}

package/dist/vendored/brepjs/operations/multiSweepFns.d.ts

@@ -1,6 +0,0 @@
-/**
- * Re-exports from `./sweepFns.js` for backward compatibility.
- * Multi-section sweep has been consolidated into sweepFns.
- */
-export { multiSectionSweep, type SweepSectionConfig, type MultiSweepOptions } from './sweepFns.js';
-//# sourceMappingURL=multiSweepFns.d.ts.map

package/dist/vendored/brepjs/operations/multiSweepFns.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"multiSweepFns.d.ts","sourceRoot":"","sources":["../../../../src/vendored/brepjs/operations/multiSweepFns.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,OAAO,EAAE,iBAAiB,EAAE,KAAK,kBAAkB,EAAE,KAAK,iBAAiB,EAAE,MAAM,eAAe,CAAC"}

package/dist/vendored/brepjs/operations/multiSweepFns.js

@@ -1,6 +0,0 @@
-/**
- * Re-exports from `./sweepFns.js` for backward compatibility.
- * Multi-section sweep has been consolidated into sweepFns.
- */
-export { multiSectionSweep } from './sweepFns.js';
-//# sourceMappingURL=multiSweepFns.js.map

package/dist/vendored/brepjs/operations/multiSweepFns.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"multiSweepFns.js","sourceRoot":"","sources":["../../../../src/vendored/brepjs/operations/multiSweepFns.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,OAAO,EAAE,iBAAiB,EAAmD,MAAM,eAAe,CAAC","sourcesContent":["/**\n * Re-exports from `./sweepFns.js` for backward compatibility.\n * Multi-section sweep has been consolidated into sweepFns.\n */\nexport { multiSectionSweep, type SweepSectionConfig, type MultiSweepOptions } from './sweepFns.js';\n"]}

package/dist/vendored/brepjs/operations/patternFns.d.ts

@@ -1,46 +0,0 @@
-/**
- * Pattern operations — linear, circular, and grid array replication.
- * Composes translate/rotate transforms with boolean fuse.
- */
-import type { Vec3 } from '../core/types.js';
-import type { Shape3D } from '../core/shapeTypes.js';
-import type { Result } from '../core/result.js';
-import { type BooleanOptions } from '../topology/booleanFns.js';
-/**
- * Create a linear pattern of a shape along a direction.
- *
- * @param shape - The shape to replicate
- * @param direction - Direction vector for the pattern
- * @param count - Total number of copies (including the original)
- * @param spacing - Distance between each copy along the direction
- * @param options - Boolean options for the fuse operation
- * @returns Fused shape of all copies
- */
-export declare function linearPattern(shape: Shape3D, direction: Vec3, count: number, spacing: number, options?: BooleanOptions): Result<Shape3D>;
-/**
- * Create a circular pattern of a shape around an axis.
- *
- * @param shape - The shape to replicate
- * @param axis - Rotation axis direction
- * @param count - Total number of copies (including the original)
- * @param fullAngle - Total angle to spread copies over in degrees (default: 360)
- * @param center - Center point of rotation (default: [0,0,0])
- * @param options - Boolean options for the fuse operation
- * @returns Fused shape of all copies
- */
-export declare function circularPattern(shape: Shape3D, axis: Vec3, count: number, fullAngle?: number, center?: Vec3, options?: BooleanOptions): Result<Shape3D>;
-/**
- * Create a 2D grid pattern of a shape along two directions.
- *
- * @param shape - The shape to replicate
- * @param directionX - First direction vector for the grid
- * @param directionY - Second direction vector for the grid
- * @param countX - Number of copies along directionX
- * @param countY - Number of copies along directionY
- * @param spacingX - Distance between copies along directionX
- * @param spacingY - Distance between copies along directionY
- * @param options - Boolean options for the fuse operation (used in fallback path)
- * @returns Compound shape containing all copies, or fused result
- */
-export declare function gridPattern(shape: Shape3D, directionX: Vec3, directionY: Vec3, countX: number, countY: number, spacingX: number, spacingY: number, options?: BooleanOptions): Result<Shape3D>;
-//# sourceMappingURL=patternFns.d.ts.map

package/dist/vendored/brepjs/operations/patternFns.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"patternFns.d.ts","sourceRoot":"","sources":["../../../../src/vendored/brepjs/operations/patternFns.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AAC7C,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,uBAAuB,CAAC;AACrD,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AAGhD,OAAO,EAAW,KAAK,cAAc,EAAE,MAAM,2BAA2B,CAAC;AAKzE;;;;;;;;;GASG;AACH,wBAAgB,aAAa,CAC3B,KAAK,EAAE,OAAO,EACd,SAAS,EAAE,IAAI,EACf,KAAK,EAAE,MAAM,EACb,OAAO,EAAE,MAAM,EACf,OAAO,CAAC,EAAE,cAAc,GACvB,MAAM,CAAC,OAAO,CAAC,CAuBjB;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,eAAe,CAC7B,KAAK,EAAE,OAAO,EACd,IAAI,EAAE,IAAI,EACV,KAAK,EAAE,MAAM,EACb,SAAS,GAAE,MAAY,EACvB,MAAM,GAAE,IAAgB,EACxB,OAAO,CAAC,EAAE,cAAc,GACvB,MAAM,CAAC,OAAO,CAAC,CA6BjB;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,WAAW,CACzB,KAAK,EAAE,OAAO,EACd,UAAU,EAAE,IAAI,EAChB,UAAU,EAAE,IAAI,EAChB,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,MAAM,EAChB,OAAO,CAAC,EAAE,cAAc,GACvB,MAAM,CAAC,OAAO,CAAC,CAsCjB"}

package/dist/vendored/brepjs/operations/patternFns.js

@@ -1,126 +0,0 @@
-/**
- * Pattern operations — linear, circular, and grid array replication.
- * Composes translate/rotate transforms with boolean fuse.
- */
-import { ok, err } from '../core/result.js';
-import { vecNormalize, vecIsZero } from '../core/vecOps.js';
-import { fuseAll } from '../topology/booleanFns.js';
-import { validationError } from '../core/errors.js';
-import { getKernel } from '../kernel/index.js';
-import { castResultShape } from '../core/shapeTypes.js';
-/**
- * Create a linear pattern of a shape along a direction.
- *
- * @param shape - The shape to replicate
- * @param direction - Direction vector for the pattern
- * @param count - Total number of copies (including the original)
- * @param spacing - Distance between each copy along the direction
- * @param options - Boolean options for the fuse operation
- * @returns Fused shape of all copies
- */
-export function linearPattern(shape, direction, count, spacing, options) {
-    if (count < 1)
-        return err(validationError('PATTERN_INVALID_COUNT', 'Pattern count must be at least 1'));
-    if (count === 1)
-        return ok(shape);
-    if (vecIsZero(direction))
-        return err(validationError('PATTERN_ZERO_DIRECTION', 'Pattern direction cannot be zero'));
-    const dir = vecNormalize(direction);
-    const ocShapes = getKernel().linearPattern(shape.wrapped, [...dir], spacing, count);
-    const copies = ocShapes.map((s) => castResultShape(s));
-    // Pattern copies share exact face geometry — sameFace glue lets OCCT skip
-    // expensive intersection calculations (default unless caller overrides)
-    try {
-        return fuseAll(copies, {
-            optimisation: 'sameFace',
-            ...options,
-            unsafe: true,
-        });
-    }
-    finally {
-        // fuseAll is immutable and does not consume its inputs — dispose the copies.
-        for (const c of copies)
-            c[Symbol.dispose]();
-    }
-}
-/**
- * Create a circular pattern of a shape around an axis.
- *
- * @param shape - The shape to replicate
- * @param axis - Rotation axis direction
- * @param count - Total number of copies (including the original)
- * @param fullAngle - Total angle to spread copies over in degrees (default: 360)
- * @param center - Center point of rotation (default: [0,0,0])
- * @param options - Boolean options for the fuse operation
- * @returns Fused shape of all copies
- */
-export function circularPattern(shape, axis, count, fullAngle = 360, center = [0, 0, 0], options) {
-    if (count < 1)
-        return err(validationError('PATTERN_INVALID_COUNT', 'Pattern count must be at least 1'));
-    if (count === 1)
-        return ok(shape);
-    if (vecIsZero(axis))
-        return err(validationError('PATTERN_ZERO_AXIS', 'Pattern axis cannot be zero'));
-    const angleStep = fullAngle / count;
-    const ocShapes = getKernel().circularPattern(shape.wrapped, [...center], [...axis], angleStep, count);
-    const copies = ocShapes.map((s) => castResultShape(s));
-    // Pattern copies share exact face geometry — sameFace glue lets OCCT skip
-    // expensive intersection calculations (default unless caller overrides)
-    try {
-        return fuseAll(copies, {
-            optimisation: 'sameFace',
-            ...options,
-            unsafe: true,
-        });
-    }
-    finally {
-        // fuseAll is immutable and does not consume its inputs — dispose the copies.
-        for (const c of copies)
-            c[Symbol.dispose]();
-    }
-}
-/**
- * Create a 2D grid pattern of a shape along two directions.
- *
- * @param shape - The shape to replicate
- * @param directionX - First direction vector for the grid
- * @param directionY - Second direction vector for the grid
- * @param countX - Number of copies along directionX
- * @param countY - Number of copies along directionY
- * @param spacingX - Distance between copies along directionX
- * @param spacingY - Distance between copies along directionY
- * @param options - Boolean options for the fuse operation (used in fallback path)
- * @returns Compound shape containing all copies, or fused result
- */
-export function gridPattern(shape, directionX, directionY, countX, countY, spacingX, spacingY, options) {
-    if (countX < 1 || countY < 1)
-        return err(validationError('PATTERN_INVALID_COUNT', 'Grid pattern counts must be at least 1'));
-    if (countX === 1 && countY === 1)
-        return ok(shape);
-    if (vecIsZero(directionX))
-        return err(validationError('PATTERN_ZERO_DIRECTION', 'Grid directionX cannot be zero'));
-    if (vecIsZero(directionY))
-        return err(validationError('PATTERN_ZERO_DIRECTION', 'Grid directionY cannot be zero'));
-    const kernel = getKernel();
-    const dirX = vecNormalize(directionX);
-    const dirY = vecNormalize(directionY);
-    // Use native gridPattern if available (brepkit), otherwise fall back to nested linearPattern
-    if (typeof kernel.gridPattern === 'function') {
-        const compound = kernel.gridPattern(shape.wrapped, [...dirX], [...dirY], spacingX, spacingY, countX, countY);
-        return ok(castResultShape(compound));
-    }
-    // Fallback: nested linearPattern
-    const rowResult = linearPattern(shape, directionX, countX, spacingX, options);
-    if (!rowResult.ok)
-        return rowResult;
-    const row = rowResult.value;
-    const out = linearPattern(row, directionY, countY, spacingY, options);
-    // Dispose the intermediate row unless linearPattern short-circuited: countX===1
-    // hands back the caller's own shape, and countY===1 passes `row` straight
-    // through as the result — disposing either would be a use-after-free.
-    const passthrough = out.ok && out.value === row;
-    if (row !== shape && !passthrough)
-        row[Symbol.dispose]();
-    return out;
-}
-//# sourceMappingURL=patternFns.js.map

package/dist/vendored/brepjs/operations/patternFns.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"patternFns.js","sourceRoot":"","sources":["../../../../src/vendored/brepjs/operations/patternFns.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAKH,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,MAAM,mBAAmB,CAAC;AAC5C,OAAO,EAAE,YAAY,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAC;AAC5D,OAAO,EAAE,OAAO,EAAuB,MAAM,2BAA2B,CAAC;AACzE,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACpD,OAAO,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAC/C,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AAExD;;;;;;;;;GASG;AACH,MAAM,UAAU,aAAa,CAC3B,KAAc,EACd,SAAe,EACf,KAAa,EACb,OAAe,EACf,OAAwB;IAExB,IAAI,KAAK,GAAG,CAAC;QACX,OAAO,GAAG,CAAC,eAAe,CAAC,uBAAuB,EAAE,kCAAkC,CAAC,CAAC,CAAC;IAC3F,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC,KAAK,CAAC,CAAC;IAClC,IAAI,SAAS,CAAC,SAAS,CAAC;QACtB,OAAO,GAAG,CAAC,eAAe,CAAC,wBAAwB,EAAE,kCAAkC,CAAC,CAAC,CAAC;IAE5F,MAAM,GAAG,GAAG,YAAY,CAAC,SAAS,CAAC,CAAC;IACpC,MAAM,QAAQ,GAAG,SAAS,EAAE,CAAC,aAAa,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,GAAG,GAAG,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;IACpF,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,eAAe,CAAC,CAAC,CAAY,CAAC,CAAC;IAElE,0EAA0E;IAC1E,wEAAwE;IACxE,IAAI,CAAC;QACH,OAAO,OAAO,CAAC,MAAM,EAAE;YACrB,YAAY,EAAE,UAAU;YACxB,GAAG,OAAO;YACV,MAAM,EAAE,IAAI;SACb,CAAC,CAAC;IACL,CAAC;YAAS,CAAC;QACT,6EAA6E;QAC7E,KAAK,MAAM,CAAC,IAAI,MAAM;YAAE,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;IAC9C,CAAC;AACH,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,eAAe,CAC7B,KAAc,EACd,IAAU,EACV,KAAa,EACb,YAAoB,GAAG,EACvB,SAAe,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EACxB,OAAwB;IAExB,IAAI,KAAK,GAAG,CAAC;QACX,OAAO,GAAG,CAAC,eAAe,CAAC,uBAAuB,EAAE,kCAAkC,CAAC,CAAC,CAAC;IAC3F,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC,KAAK,CAAC,CAAC;IAClC,IAAI,SAAS,CAAC,IAAI,CAAC;QACjB,OAAO,GAAG,CAAC,eAAe,CAAC,mBAAmB,EAAE,6BAA6B,CAAC,CAAC,CAAC;IAElF,MAAM,SAAS,GAAG,SAAS,GAAG,KAAK,CAAC;IACpC,MAAM,QAAQ,GAAG,SAAS,EAAE,CAAC,eAAe,CAC1C,KAAK,CAAC,OAAO,EACb,CAAC,GAAG,MAAM,CAAC,EACX,CAAC,GAAG,IAAI,CAAC,EACT,SAAS,EACT,KAAK,CACN,CAAC;IACF,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,eAAe,CAAC,CAAC,CAAY,CAAC,CAAC;IAElE,0EAA0E;IAC1E,wEAAwE;IACxE,IAAI,CAAC;QACH,OAAO,OAAO,CAAC,MAAM,EAAE;YACrB,YAAY,EAAE,UAAU;YACxB,GAAG,OAAO;YACV,MAAM,EAAE,IAAI;SACb,CAAC,CAAC;IACL,CAAC;YAAS,CAAC;QACT,6EAA6E;QAC7E,KAAK,MAAM,CAAC,IAAI,MAAM;YAAE,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;IAC9C,CAAC;AACH,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,WAAW,CACzB,KAAc,EACd,UAAgB,EAChB,UAAgB,EAChB,MAAc,EACd,MAAc,EACd,QAAgB,EAChB,QAAgB,EAChB,OAAwB;IAExB,IAAI,MAAM,GAAG,CAAC,IAAI,MAAM,GAAG,CAAC;QAC1B,OAAO,GAAG,CAAC,eAAe,CAAC,uBAAuB,EAAE,wCAAwC,CAAC,CAAC,CAAC;IACjG,IAAI,MAAM,KAAK,CAAC,IAAI,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC,KAAK,CAAC,CAAC;IACnD,IAAI,SAAS,CAAC,UAAU,CAAC;QACvB,OAAO,GAAG,CAAC,eAAe,CAAC,wBAAwB,EAAE,gCAAgC,CAAC,CAAC,CAAC;IAC1F,IAAI,SAAS,CAAC,UAAU,CAAC;QACvB,OAAO,GAAG,CAAC,eAAe,CAAC,wBAAwB,EAAE,gCAAgC,CAAC,CAAC,CAAC;IAE1F,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC;IAC3B,MAAM,IAAI,GAAG,YAAY,CAAC,UAAU,CAAC,CAAC;IACtC,MAAM,IAAI,GAAG,YAAY,CAAC,UAAU,CAAC,CAAC;IAEtC,6FAA6F;IAC7F,IAAI,OAAO,MAAM,CAAC,WAAW,KAAK,UAAU,EAAE,CAAC;QAC7C,MAAM,QAAQ,GAAG,MAAM,CAAC,WAAW,CACjC,KAAK,CAAC,OAAO,EACb,CAAC,GAAG,IAAI,CAAC,EACT,CAAC,GAAG,IAAI,CAAC,EACT,QAAQ,EACR,QAAQ,EACR,MAAM,EACN,MAAM,CACP,CAAC;QACF,OAAO,EAAE,CAAC,eAAe,CAAC,QAAQ,CAAY,CAAC,CAAC;IAClD,CAAC;IAED,iCAAiC;IACjC,MAAM,SAAS,GAAG,aAAa,CAAC,KAAK,EAAE,UAAU,EAAE,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;IAC9E,IAAI,CAAC,SAAS,CAAC,EAAE;QAAE,OAAO,SAAS,CAAC;IACpC,MAAM,GAAG,GAAG,SAAS,CAAC,KAAK,CAAC;IAC5B,MAAM,GAAG,GAAG,aAAa,CAAC,GAAG,EAAE,UAAU,EAAE,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;IACtE,gFAAgF;IAChF,0EAA0E;IAC1E,sEAAsE;IACtE,MAAM,WAAW,GAAG,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,KAAK,KAAK,GAAG,CAAC;IAChD,IAAI,GAAG,KAAK,KAAK,IAAI,CAAC,WAAW;QAAE,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;IACzD,OAAO,GAAG,CAAC;AACb,CAAC","sourcesContent":["/**\n * Pattern operations — linear, circular, and grid array replication.\n * Composes translate/rotate transforms with boolean fuse.\n */\n\nimport type { Vec3 } from '../core/types.js';\nimport type { Shape3D } from '../core/shapeTypes.js';\nimport type { Result } from '../core/result.js';\nimport { ok, err } from '../core/result.js';\nimport { vecNormalize, vecIsZero } from '../core/vecOps.js';\nimport { fuseAll, type BooleanOptions } from '../topology/booleanFns.js';\nimport { validationError } from '../core/errors.js';\nimport { getKernel } from '../kernel/index.js';\nimport { castResultShape } from '../core/shapeTypes.js';\n\n/**\n * Create a linear pattern of a shape along a direction.\n *\n * @param shape - The shape to replicate\n * @param direction - Direction vector for the pattern\n * @param count - Total number of copies (including the original)\n * @param spacing - Distance between each copy along the direction\n * @param options - Boolean options for the fuse operation\n * @returns Fused shape of all copies\n */\nexport function linearPattern(\n  shape: Shape3D,\n  direction: Vec3,\n  count: number,\n  spacing: number,\n  options?: BooleanOptions\n): Result<Shape3D> {\n  if (count < 1)\n    return err(validationError('PATTERN_INVALID_COUNT', 'Pattern count must be at least 1'));\n  if (count === 1) return ok(shape);\n  if (vecIsZero(direction))\n    return err(validationError('PATTERN_ZERO_DIRECTION', 'Pattern direction cannot be zero'));\n\n  const dir = vecNormalize(direction);\n  const ocShapes = getKernel().linearPattern(shape.wrapped, [...dir], spacing, count);\n  const copies = ocShapes.map((s) => castResultShape(s) as Shape3D);\n\n  // Pattern copies share exact face geometry — sameFace glue lets OCCT skip\n  // expensive intersection calculations (default unless caller overrides)\n  try {\n    return fuseAll(copies, {\n      optimisation: 'sameFace',\n      ...options,\n      unsafe: true,\n    });\n  } finally {\n    // fuseAll is immutable and does not consume its inputs — dispose the copies.\n    for (const c of copies) c[Symbol.dispose]();\n  }\n}\n\n/**\n * Create a circular pattern of a shape around an axis.\n *\n * @param shape - The shape to replicate\n * @param axis - Rotation axis direction\n * @param count - Total number of copies (including the original)\n * @param fullAngle - Total angle to spread copies over in degrees (default: 360)\n * @param center - Center point of rotation (default: [0,0,0])\n * @param options - Boolean options for the fuse operation\n * @returns Fused shape of all copies\n */\nexport function circularPattern(\n  shape: Shape3D,\n  axis: Vec3,\n  count: number,\n  fullAngle: number = 360,\n  center: Vec3 = [0, 0, 0],\n  options?: BooleanOptions\n): Result<Shape3D> {\n  if (count < 1)\n    return err(validationError('PATTERN_INVALID_COUNT', 'Pattern count must be at least 1'));\n  if (count === 1) return ok(shape);\n  if (vecIsZero(axis))\n    return err(validationError('PATTERN_ZERO_AXIS', 'Pattern axis cannot be zero'));\n\n  const angleStep = fullAngle / count;\n  const ocShapes = getKernel().circularPattern(\n    shape.wrapped,\n    [...center],\n    [...axis],\n    angleStep,\n    count\n  );\n  const copies = ocShapes.map((s) => castResultShape(s) as Shape3D);\n\n  // Pattern copies share exact face geometry — sameFace glue lets OCCT skip\n  // expensive intersection calculations (default unless caller overrides)\n  try {\n    return fuseAll(copies, {\n      optimisation: 'sameFace',\n      ...options,\n      unsafe: true,\n    });\n  } finally {\n    // fuseAll is immutable and does not consume its inputs — dispose the copies.\n    for (const c of copies) c[Symbol.dispose]();\n  }\n}\n\n/**\n * Create a 2D grid pattern of a shape along two directions.\n *\n * @param shape - The shape to replicate\n * @param directionX - First direction vector for the grid\n * @param directionY - Second direction vector for the grid\n * @param countX - Number of copies along directionX\n * @param countY - Number of copies along directionY\n * @param spacingX - Distance between copies along directionX\n * @param spacingY - Distance between copies along directionY\n * @param options - Boolean options for the fuse operation (used in fallback path)\n * @returns Compound shape containing all copies, or fused result\n */\nexport function gridPattern(\n  shape: Shape3D,\n  directionX: Vec3,\n  directionY: Vec3,\n  countX: number,\n  countY: number,\n  spacingX: number,\n  spacingY: number,\n  options?: BooleanOptions\n): Result<Shape3D> {\n  if (countX < 1 || countY < 1)\n    return err(validationError('PATTERN_INVALID_COUNT', 'Grid pattern counts must be at least 1'));\n  if (countX === 1 && countY === 1) return ok(shape);\n  if (vecIsZero(directionX))\n    return err(validationError('PATTERN_ZERO_DIRECTION', 'Grid directionX cannot be zero'));\n  if (vecIsZero(directionY))\n    return err(validationError('PATTERN_ZERO_DIRECTION', 'Grid directionY cannot be zero'));\n\n  const kernel = getKernel();\n  const dirX = vecNormalize(directionX);\n  const dirY = vecNormalize(directionY);\n\n  // Use native gridPattern if available (brepkit), otherwise fall back to nested linearPattern\n  if (typeof kernel.gridPattern === 'function') {\n    const compound = kernel.gridPattern(\n      shape.wrapped,\n      [...dirX],\n      [...dirY],\n      spacingX,\n      spacingY,\n      countX,\n      countY\n    );\n    return ok(castResultShape(compound) as Shape3D);\n  }\n\n  // Fallback: nested linearPattern\n  const rowResult = linearPattern(shape, directionX, countX, spacingX, options);\n  if (!rowResult.ok) return rowResult;\n  const row = rowResult.value;\n  const out = linearPattern(row, directionY, countY, spacingY, options);\n  // Dispose the intermediate row unless linearPattern short-circuited: countX===1\n  // hands back the caller's own shape, and countY===1 passes `row` straight\n  // through as the result — disposing either would be a use-after-free.\n  const passthrough = out.ok && out.value === row;\n  if (row !== shape && !passthrough) row[Symbol.dispose]();\n  return out;\n}\n"]}

package/dist/vendored/brepjs/operations/roofFns.d.ts

@@ -1,25 +0,0 @@
-/**
- * Roof generation from a wire using straight skeleton extrusion.
- * Produces a solid roof shape where each edge slopes inward at a given angle.
- *
- * ADR-0006: ear-clip triangulation and 2D geometry helpers stay in TypeScript —
- * these are orchestration for assembling kernel faces, not core geometric
- * evaluation. The kernel builds the actual B-Rep faces and solid.
- */
-import type { ClosedWire, Dimension } from '../core/shapeTypes.js';
-import type { PlanarWire, ValidSolid } from '../core/validityTypes.js';
-import { type Result } from '../core/result.js';
-export interface RoofOptions {
-    /** Roof slope angle in degrees (default: 45). */
-    readonly angle?: number;
-}
-/**
- * Create a roof solid from a planar wire using the straight skeleton algorithm.
- * Each polygon edge produces a sloped face rising toward the skeleton ridge.
- *
- * @param w - A planar wire defining the roof footprint
- * @param options - Optional angle (degrees) for the roof slope
- * @returns A Result containing the roof Solid, or an error
- */
-export declare function roof(w: ClosedWire<Dimension> & PlanarWire<Dimension>, options?: RoofOptions): Result<ValidSolid>;
-//# sourceMappingURL=roofFns.d.ts.map

package/dist/vendored/brepjs/operations/roofFns.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"roofFns.d.ts","sourceRoot":"","sources":["../../../../src/vendored/brepjs/operations/roofFns.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAIH,OAAO,KAAK,EAAE,UAAU,EAAE,SAAS,EAAQ,MAAM,uBAAuB,CAAC;AAGzE,OAAO,KAAK,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AAEvE,OAAO,EAAE,KAAK,MAAM,EAAW,MAAM,mBAAmB,CAAC;AAWzD,MAAM,WAAW,WAAW;IAC1B,iDAAiD;IACjD,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;CACzB;AAgLD;;;;;;;GAOG;AACH,wBAAgB,IAAI,CAClB,CAAC,EAAE,UAAU,CAAC,SAAS,CAAC,GAAG,UAAU,CAAC,SAAS,CAAC,EAChD,OAAO,CAAC,EAAE,WAAW,GACpB,MAAM,CAAC,UAAU,CAAC,CA2EpB"}