@faicad/faijs 0.13.0

package/dist/vendored/brepjs/2d/lib/approximations.js

@@ -0,0 +1,82 @@
+import { bug } from '../../core/errors.js';
+import { getKernel2D } from '../../kernel/index.js';
+import { Curve2D } from './curve2D.js';
+import { samePoint } from './vectorOperations.js';
+/**
+ * Approximate a 2D curve as a B-spline via the kernel's
+ * `approximateCurve2dAsBSpline` method.
+ *
+ * @param curve - The source `Curve2D` to approximate.
+ * @param tolerance - Maximum deviation from the original curve.
+ * @param continuity - Required geometric continuity of the result.
+ * @param maxSegments - Maximum number of B-spline spans.
+ *
+ * @example
+ * ```ts
+ * const bspline = approximateAsBSpline(curve, 1e-4, 'C1');
+ * ```
+ */
+export const approximateAsBSpline = (curve, tolerance = 1e-4, continuity = 'C0', maxSegments = 200) => {
+    const kernel = getKernel2D();
+    const handle = kernel.approximateCurve2dAsBSpline(curve.wrapped, tolerance, continuity, maxSegments);
+    return new Curve2D(handle);
+};
+/**
+ * Decompose a B-spline curve into an array of Bezier arcs.
+ *
+ * @param curve - A `Curve2D` whose type must be `BSPLINE_CURVE`.
+ * @returns An array of Bezier `Curve2D` segments covering the original B-spline.
+ */
+export const BSplineToBezier = (curve) => {
+    if (curve.geomType !== 'BSPLINE_CURVE')
+        bug('BSplineToBezier', 'You can only convert a Bspline');
+    const kernel = getKernel2D();
+    const handles = kernel.decomposeBSpline2dToBeziers(curve.wrapped);
+    return handles.map((h) => new Curve2D(h));
+};
+/**
+ * Convert an array of curves to SVG-compatible primitives (lines, arcs, and
+ * degree-1/2/3 Bezier curves).
+ *
+ * Higher-degree B-splines are decomposed into Bezier arcs and recursively
+ * processed. Full circles/ellipses are split at the midpoint so they can be
+ * represented as two SVG arcs.
+ *
+ * @example
+ * ```ts
+ * const svgCurves = approximateAsSvgCompatibleCurve(curves, { tolerance: 1e-5 });
+ * ```
+ */
+export function approximateAsSvgCompatibleCurve(curves, options = {
+    tolerance: 1e-4,
+    continuity: 'C0',
+    maxSegments: 300,
+}) {
+    const kernel = getKernel2D();
+    return curves.flatMap((curve) => {
+        const curveType = curve.geomType;
+        if (curveType === 'ELLIPSE' ||
+            (curveType === 'CIRCLE' && samePoint(curve.firstPoint, curve.lastPoint))) {
+            // splitAt takes RAW parameters: a full conic spans [0, 2*PI], so the
+            // literal 0.5 split a closed circle into a 0.5 rad sliver and a 5.78
+            // rad remainder instead of two halves.
+            return curve.splitAt([(curve.firstParameter + curve.lastParameter) / 2]);
+        }
+        if (['LINE', 'ELLIPSE', 'CIRCLE'].includes(curveType)) {
+            return curve;
+        }
+        if (curveType === 'BEZIER_CURVE') {
+            const deg = kernel.getCurve2dBezierDegree(curve.wrapped);
+            if (deg !== null && [1, 2, 3].includes(deg)) {
+                return curve;
+            }
+        }
+        if (curveType === 'BSPLINE_CURVE') {
+            const c = BSplineToBezier(curve);
+            return approximateAsSvgCompatibleCurve(c, options);
+        }
+        const bspline = approximateAsBSpline(curve, options.tolerance, options.continuity, options.maxSegments);
+        return approximateAsSvgCompatibleCurve(BSplineToBezier(bspline), options);
+    });
+}
+//# sourceMappingURL=approximations.js.map

package/dist/vendored/brepjs/2d/lib/approximations.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"approximations.js","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/2d/lib/approximations.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,GAAG,EAAE,MAAM,sBAAsB,CAAC;AAC3C,OAAO,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AACpD,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AACvC,OAAO,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AAElD;;;;;;;;;;;;;GAaG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAClC,KAAc,EACd,SAAS,GAAG,IAAI,EAChB,aAAwC,IAAI,EAC5C,WAAW,GAAG,GAAG,EACR,EAAE;IACX,MAAM,MAAM,GAAG,WAAW,EAAE,CAAC;IAC7B,MAAM,MAAM,GAAG,MAAM,CAAC,2BAA2B,CAC/C,KAAK,CAAC,OAAO,EACb,SAAS,EACT,UAAU,EACV,WAAW,CACZ,CAAC;IACF,OAAO,IAAI,OAAO,CAAC,MAAM,CAAC,CAAC;AAC7B,CAAC,CAAC;AAEF;;;;;GAKG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,CAAC,KAAc,EAAa,EAAE;IAC3D,IAAI,KAAK,CAAC,QAAQ,KAAK,eAAe;QAAE,GAAG,CAAC,iBAAiB,EAAE,gCAAgC,CAAC,CAAC;IAEjG,MAAM,MAAM,GAAG,WAAW,EAAE,CAAC;IAC7B,MAAM,OAAO,GAAG,MAAM,CAAC,2BAA2B,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAClE,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;AAC5C,CAAC,CAAC;AAYF;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,+BAA+B,CAC7C,MAAiB,EACjB,UAAgC;IAC9B,SAAS,EAAE,IAAI;IACf,UAAU,EAAE,IAAI;IAChB,WAAW,EAAE,GAAG;CACjB;IAED,MAAM,MAAM,GAAG,WAAW,EAAE,CAAC;IAE7B,OAAO,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;QAC9B,MAAM,SAAS,GAAG,KAAK,CAAC,QAAQ,CAAC;QAEjC,IACE,SAAS,KAAK,SAAS;YACvB,CAAC,SAAS,KAAK,QAAQ,IAAI,SAAS,CAAC,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC,EACxE,CAAC;YACD,qEAAqE;YACrE,qEAAqE;YACrE,uCAAuC;YACvC,OAAO,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,cAAc,GAAG,KAAK,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC3E,CAAC;QAED,IAAI,CAAC,MAAM,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC;YACtD,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,SAAS,KAAK,cAAc,EAAE,CAAC;YACjC,MAAM,GAAG,GAAG,MAAM,CAAC,sBAAsB,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;YAEzD,IAAI,GAAG,KAAK,IAAI,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC5C,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QAED,IAAI,SAAS,KAAK,eAAe,EAAE,CAAC;YAClC,MAAM,CAAC,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;YACjC,OAAO,+BAA+B,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;QACrD,CAAC;QAED,MAAM,OAAO,GAAG,oBAAoB,CAClC,KAAK,EACL,OAAO,CAAC,SAAS,EACjB,OAAO,CAAC,UAAU,EAClB,OAAO,CAAC,WAAW,CACpB,CAAC;QACF,OAAO,+BAA+B,CAAC,eAAe,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC,CAAC;IAC5E,CAAC,CAAC,CAAC;AACL,CAAC","sourcesContent":["import { bug } from '../../core/errors.js';\nimport { getKernel2D } from '../../kernel/index.js';\nimport { Curve2D } from './curve2D.js';\nimport { samePoint } from './vectorOperations.js';\n\n/**\n * Approximate a 2D curve as a B-spline via the kernel's\n * `approximateCurve2dAsBSpline` method.\n *\n * @param curve - The source `Curve2D` to approximate.\n * @param tolerance - Maximum deviation from the original curve.\n * @param continuity - Required geometric continuity of the result.\n * @param maxSegments - Maximum number of B-spline spans.\n *\n * @example\n * ```ts\n * const bspline = approximateAsBSpline(curve, 1e-4, 'C1');\n * ```\n */\nexport const approximateAsBSpline = (\n  curve: Curve2D,\n  tolerance = 1e-4,\n  continuity: 'C0' | 'C1' | 'C2' | 'C3' = 'C0',\n  maxSegments = 200\n): Curve2D => {\n  const kernel = getKernel2D();\n  const handle = kernel.approximateCurve2dAsBSpline(\n    curve.wrapped,\n    tolerance,\n    continuity,\n    maxSegments\n  );\n  return new Curve2D(handle);\n};\n\n/**\n * Decompose a B-spline curve into an array of Bezier arcs.\n *\n * @param curve - A `Curve2D` whose type must be `BSPLINE_CURVE`.\n * @returns An array of Bezier `Curve2D` segments covering the original B-spline.\n */\nexport const BSplineToBezier = (curve: Curve2D): Curve2D[] => {\n  if (curve.geomType !== 'BSPLINE_CURVE') bug('BSplineToBezier', 'You can only convert a Bspline');\n\n  const kernel = getKernel2D();\n  const handles = kernel.decomposeBSpline2dToBeziers(curve.wrapped);\n  return handles.map((h) => new Curve2D(h));\n};\n\n/** Options for SVG-compatible curve approximation. */\nexport interface ApproximationOptions {\n  /** Maximum deviation from the original curve. */\n  tolerance?: number;\n  /** Required geometric continuity. */\n  continuity?: 'C0' | 'C1' | 'C2' | 'C3';\n  /** Maximum number of B-spline spans. */\n  maxSegments?: number;\n}\n\n/**\n * Convert an array of curves to SVG-compatible primitives (lines, arcs, and\n * degree-1/2/3 Bezier curves).\n *\n * Higher-degree B-splines are decomposed into Bezier arcs and recursively\n * processed. Full circles/ellipses are split at the midpoint so they can be\n * represented as two SVG arcs.\n *\n * @example\n * ```ts\n * const svgCurves = approximateAsSvgCompatibleCurve(curves, { tolerance: 1e-5 });\n * ```\n */\nexport function approximateAsSvgCompatibleCurve(\n  curves: Curve2D[],\n  options: ApproximationOptions = {\n    tolerance: 1e-4,\n    continuity: 'C0',\n    maxSegments: 300,\n  }\n): Curve2D[] {\n  const kernel = getKernel2D();\n\n  return curves.flatMap((curve) => {\n    const curveType = curve.geomType;\n\n    if (\n      curveType === 'ELLIPSE' ||\n      (curveType === 'CIRCLE' && samePoint(curve.firstPoint, curve.lastPoint))\n    ) {\n      // splitAt takes RAW parameters: a full conic spans [0, 2*PI], so the\n      // literal 0.5 split a closed circle into a 0.5 rad sliver and a 5.78\n      // rad remainder instead of two halves.\n      return curve.splitAt([(curve.firstParameter + curve.lastParameter) / 2]);\n    }\n\n    if (['LINE', 'ELLIPSE', 'CIRCLE'].includes(curveType)) {\n      return curve;\n    }\n\n    if (curveType === 'BEZIER_CURVE') {\n      const deg = kernel.getCurve2dBezierDegree(curve.wrapped);\n\n      if (deg !== null && [1, 2, 3].includes(deg)) {\n        return curve;\n      }\n    }\n\n    if (curveType === 'BSPLINE_CURVE') {\n      const c = BSplineToBezier(curve);\n      return approximateAsSvgCompatibleCurve(c, options);\n    }\n\n    const bspline = approximateAsBSpline(\n      curve,\n      options.tolerance,\n      options.continuity,\n      options.maxSegments\n    );\n    return approximateAsSvgCompatibleCurve(BSplineToBezier(bspline), options);\n  });\n}\n"]}

package/dist/vendored/brepjs/2d/lib/boundingBox2d.d.ts

@@ -0,0 +1,39 @@
+import type { KernelType } from '../../kernel/types.js';
+import type { Point2D } from './definitions.js';
+/**
+ * Axis-aligned 2D bounding box backed by an kernel `Bnd_Box2d`.
+ *
+ * Provides bounds queries, containment tests, and union operations for
+ * spatial indexing of 2D geometry.
+ */
+export declare class BoundingBox2d {
+    private readonly _wrapped;
+    private _deleted;
+    constructor(wrapped?: KernelType);
+    get wrapped(): KernelType;
+    delete(): void;
+    [Symbol.dispose](): void;
+    /** Return a human-readable string of the form `(xMin,yMin) - (xMax,yMax)`. */
+    get repr(): string;
+    /** Return the `[min, max]` corner points of the bounding box. */
+    get bounds(): [Point2D, Point2D];
+    /** Return the center point of the bounding box. */
+    get center(): Point2D;
+    /** Return the width (x-extent) of the bounding box. */
+    get width(): number;
+    /** Return the height (y-extent) of the bounding box. */
+    get height(): number;
+    /**
+     * Return a point guaranteed to lie outside the bounding box.
+     *
+     * @param paddingPercent - Extra padding as a percentage of the box dimensions.
+     */
+    outsidePoint(paddingPercent?: number): Point2D;
+    /** Expand this bounding box to include `other`. */
+    add(other: BoundingBox2d): void;
+    /** Test whether this bounding box and `other` are completely disjoint. */
+    isOut(other: BoundingBox2d): boolean;
+    /** Test whether the given point lies inside (or on the boundary of) this box. */
+    containsPoint(other: Point2D): boolean;
+}
+//# sourceMappingURL=boundingBox2d.d.ts.map

package/dist/vendored/brepjs/2d/lib/boundingBox2d.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"boundingBox2d.d.ts","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/2d/lib/boundingBox2d.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AAExD,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,kBAAkB,CAAC;AAGhD;;;;;GAKG;AACH,qBAAa,aAAa;IACxB,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAa;IACtC,OAAO,CAAC,QAAQ,CAAS;gBAEb,OAAO,CAAC,EAAE,UAAU;IAKhC,IAAI,OAAO,IAAI,UAAU,CAGxB;IAED,MAAM,IAAI,IAAI;IAQd,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,IAAI;IAIxB,8EAA8E;IAC9E,IAAI,IAAI,IAAI,MAAM,CAGjB;IAED,iEAAiE;IACjE,IAAI,MAAM,IAAI,CAAC,OAAO,EAAE,OAAO,CAAC,CAM/B;IAED,mDAAmD;IACnD,IAAI,MAAM,IAAI,OAAO,CAGpB;IAED,uDAAuD;IACvD,IAAI,KAAK,IAAI,MAAM,CAGlB;IAED,wDAAwD;IACxD,IAAI,MAAM,IAAI,MAAM,CAGnB;IAED;;;;OAIG;IACH,YAAY,CAAC,cAAc,SAAI,GAAG,OAAO;IAWzC,mDAAmD;IACnD,GAAG,CAAC,KAAK,EAAE,aAAa;IAIxB,0EAA0E;IAC1E,KAAK,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO;IAIpC,iFAAiF;IACjF,aAAa,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO;CAGvC"}

package/dist/vendored/brepjs/2d/lib/boundingBox2d.js

@@ -0,0 +1,88 @@
+import { registerForCleanup, unregisterFromCleanup } from '../../core/disposal.js';
+import { getKernel2D } from '../../kernel/index.js';
+import { reprPnt } from './utils.js';
+/**
+ * Axis-aligned 2D bounding box backed by an kernel `Bnd_Box2d`.
+ *
+ * Provides bounds queries, containment tests, and union operations for
+ * spatial indexing of 2D geometry.
+ */
+export class BoundingBox2d {
+    _wrapped;
+    _deleted = false;
+    constructor(wrapped) {
+        this._wrapped = wrapped ?? getKernel2D().createBoundingBox2d();
+        registerForCleanup(this, this._wrapped);
+    }
+    get wrapped() {
+        if (this._deleted)
+            throw new Error('This object has been deleted');
+        return this._wrapped;
+    }
+    delete() {
+        if (!this._deleted) {
+            this._deleted = true;
+            unregisterFromCleanup(this._wrapped);
+            if (typeof this._wrapped.delete === 'function')
+                this._wrapped.delete();
+        }
+    }
+    [Symbol.dispose]() {
+        this.delete();
+    }
+    /** Return a human-readable string of the form `(xMin,yMin) - (xMax,yMax)`. */
+    get repr() {
+        const [min, max] = this.bounds;
+        return `${reprPnt(min)} - ${reprPnt(max)}`;
+    }
+    /** Return the `[min, max]` corner points of the bounding box. */
+    get bounds() {
+        const { xMin, yMin, xMax, yMax } = getKernel2D().getBBox2dBounds(this.wrapped);
+        return [
+            [xMin, yMin],
+            [xMax, yMax],
+        ];
+    }
+    /** Return the center point of the bounding box. */
+    get center() {
+        const [[xmin, ymin], [xmax, ymax]] = this.bounds;
+        return [xmin + (xmax - xmin) / 2, ymin + (ymax - ymin) / 2];
+    }
+    /** Return the width (x-extent) of the bounding box. */
+    get width() {
+        const [[xmin], [xmax]] = this.bounds;
+        return Math.abs(xmax - xmin);
+    }
+    /** Return the height (y-extent) of the bounding box. */
+    get height() {
+        const [[, ymin], [, ymax]] = this.bounds;
+        return Math.abs(ymax - ymin);
+    }
+    /**
+     * Return a point guaranteed to lie outside the bounding box.
+     *
+     * @param paddingPercent - Extra padding as a percentage of the box dimensions.
+     */
+    outsidePoint(paddingPercent = 1) {
+        const [min, max] = this.bounds;
+        const width = max[0] - min[0];
+        const height = max[1] - min[1];
+        return [
+            max[0] + (width / 100) * paddingPercent,
+            max[1] + (height / 100) * paddingPercent * 0.9,
+        ];
+    }
+    /** Expand this bounding box to include `other`. */
+    add(other) {
+        getKernel2D().mergeBBox2d(this.wrapped, other.wrapped);
+    }
+    /** Test whether this bounding box and `other` are completely disjoint. */
+    isOut(other) {
+        return getKernel2D().isBBox2dOut(this.wrapped, other.wrapped);
+    }
+    /** Test whether the given point lies inside (or on the boundary of) this box. */
+    containsPoint(other) {
+        return !getKernel2D().isBBox2dOutPoint(this.wrapped, other[0], other[1]);
+    }
+}
+//# sourceMappingURL=boundingBox2d.js.map

package/dist/vendored/brepjs/2d/lib/boundingBox2d.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"boundingBox2d.js","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/2d/lib/boundingBox2d.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,kBAAkB,EAAE,qBAAqB,EAAE,MAAM,wBAAwB,CAAC;AACnF,OAAO,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AAIpD,OAAO,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AAErC;;;;;GAKG;AACH,MAAM,OAAO,aAAa;IACP,QAAQ,CAAa;IAC9B,QAAQ,GAAG,KAAK,CAAC;IAEzB,YAAY,OAAoB;QAC9B,IAAI,CAAC,QAAQ,GAAG,OAAO,IAAI,WAAW,EAAE,CAAC,mBAAmB,EAAE,CAAC;QAC/D,kBAAkB,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC1C,CAAC;IAED,IAAI,OAAO;QACT,IAAI,IAAI,CAAC,QAAQ;YAAE,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC,CAAC;QACnE,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IAED,MAAM;QACJ,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;YACnB,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;YACrB,qBAAqB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACrC,IAAI,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,UAAU;gBAAE,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;QACzE,CAAC;IACH,CAAC;IAED,CAAC,MAAM,CAAC,OAAO,CAAC;QACd,IAAI,CAAC,MAAM,EAAE,CAAC;IAChB,CAAC;IAED,8EAA8E;IAC9E,IAAI,IAAI;QACN,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QAC/B,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;IAC7C,CAAC;IAED,iEAAiE;IACjE,IAAI,MAAM;QACR,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,WAAW,EAAE,CAAC,eAAe,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC/E,OAAO;YACL,CAAC,IAAI,EAAE,IAAI,CAAC;YACZ,CAAC,IAAI,EAAE,IAAI,CAAC;SACb,CAAC;IACJ,CAAC;IAED,mDAAmD;IACnD,IAAI,MAAM;QACR,MAAM,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACjD,OAAO,CAAC,IAAI,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IAC9D,CAAC;IAED,uDAAuD;IACvD,IAAI,KAAK;QACP,MAAM,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACrC,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC;IAC/B,CAAC;IAED,wDAAwD;IACxD,IAAI,MAAM;QACR,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACzC,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC;IAC/B,CAAC;IAED;;;;OAIG;IACH,YAAY,CAAC,cAAc,GAAG,CAAC;QAC7B,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QAC/B,MAAM,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QAE/B,OAAO;YACL,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,GAAG,GAAG,CAAC,GAAG,cAAc;YACvC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,GAAG,GAAG,CAAC,GAAG,cAAc,GAAG,GAAG;SAC/C,CAAC;IACJ,CAAC;IAED,mDAAmD;IACnD,GAAG,CAAC,KAAoB;QACtB,WAAW,EAAE,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;IACzD,CAAC;IAED,0EAA0E;IAC1E,KAAK,CAAC,KAAoB;QACxB,OAAO,WAAW,EAAE,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;IAChE,CAAC;IAED,iFAAiF;IACjF,aAAa,CAAC,KAAc;QAC1B,OAAO,CAAC,WAAW,EAAE,CAAC,gBAAgB,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3E,CAAC;CACF","sourcesContent":["import { registerForCleanup, unregisterFromCleanup } from '../../core/disposal.js';\nimport { getKernel2D } from '../../kernel/index.js';\nimport type { KernelType } from '../../kernel/types.js';\n\nimport type { Point2D } from './definitions.js';\nimport { reprPnt } from './utils.js';\n\n/**\n * Axis-aligned 2D bounding box backed by an kernel `Bnd_Box2d`.\n *\n * Provides bounds queries, containment tests, and union operations for\n * spatial indexing of 2D geometry.\n */\nexport class BoundingBox2d {\n  private readonly _wrapped: KernelType;\n  private _deleted = false;\n\n  constructor(wrapped?: KernelType) {\n    this._wrapped = wrapped ?? getKernel2D().createBoundingBox2d();\n    registerForCleanup(this, this._wrapped);\n  }\n\n  get wrapped(): KernelType {\n    if (this._deleted) throw new Error('This object has been deleted');\n    return this._wrapped;\n  }\n\n  delete(): void {\n    if (!this._deleted) {\n      this._deleted = true;\n      unregisterFromCleanup(this._wrapped);\n      if (typeof this._wrapped.delete === 'function') this._wrapped.delete();\n    }\n  }\n\n  [Symbol.dispose](): void {\n    this.delete();\n  }\n\n  /** Return a human-readable string of the form `(xMin,yMin) - (xMax,yMax)`. */\n  get repr(): string {\n    const [min, max] = this.bounds;\n    return `${reprPnt(min)} - ${reprPnt(max)}`;\n  }\n\n  /** Return the `[min, max]` corner points of the bounding box. */\n  get bounds(): [Point2D, Point2D] {\n    const { xMin, yMin, xMax, yMax } = getKernel2D().getBBox2dBounds(this.wrapped);\n    return [\n      [xMin, yMin],\n      [xMax, yMax],\n    ];\n  }\n\n  /** Return the center point of the bounding box. */\n  get center(): Point2D {\n    const [[xmin, ymin], [xmax, ymax]] = this.bounds;\n    return [xmin + (xmax - xmin) / 2, ymin + (ymax - ymin) / 2];\n  }\n\n  /** Return the width (x-extent) of the bounding box. */\n  get width(): number {\n    const [[xmin], [xmax]] = this.bounds;\n    return Math.abs(xmax - xmin);\n  }\n\n  /** Return the height (y-extent) of the bounding box. */\n  get height(): number {\n    const [[, ymin], [, ymax]] = this.bounds;\n    return Math.abs(ymax - ymin);\n  }\n\n  /**\n   * Return a point guaranteed to lie outside the bounding box.\n   *\n   * @param paddingPercent - Extra padding as a percentage of the box dimensions.\n   */\n  outsidePoint(paddingPercent = 1): Point2D {\n    const [min, max] = this.bounds;\n    const width = max[0] - min[0];\n    const height = max[1] - min[1];\n\n    return [\n      max[0] + (width / 100) * paddingPercent,\n      max[1] + (height / 100) * paddingPercent * 0.9,\n    ];\n  }\n\n  /** Expand this bounding box to include `other`. */\n  add(other: BoundingBox2d) {\n    getKernel2D().mergeBBox2d(this.wrapped, other.wrapped);\n  }\n\n  /** Test whether this bounding box and `other` are completely disjoint. */\n  isOut(other: BoundingBox2d): boolean {\n    return getKernel2D().isBBox2dOut(this.wrapped, other.wrapped);\n  }\n\n  /** Test whether the given point lies inside (or on the boundary of) this box. */\n  containsPoint(other: Point2D): boolean {\n    return !getKernel2D().isBBox2dOutPoint(this.wrapped, other[0], other[1]);\n  }\n}\n"]}

package/dist/vendored/brepjs/2d/lib/curve2D.d.ts

@@ -0,0 +1,82 @@
+import type { KernelType } from '../../kernel/types.js';
+import type { CurveType } from '../../core/typeDiscriminants.js';
+import { type Result } from '../../core/result.js';
+import { BoundingBox2d } from './boundingBox2d.js';
+import type { Point2D } from './definitions.js';
+/**
+ * Deserialize a curve from a string produced by {@link Curve2D.serialize}.
+ *
+ * @returns A new `Curve2D` restored from the serialized data.
+ */
+export declare function deserializeCurve2D(data: string): Curve2D;
+/**
+ * Handle-wrapped 2D parametric curve backed by an kernel `kernel 2D curve`.
+ *
+ * Provides evaluation, splitting, projection, tangent queries, and distance
+ * computations on a single parametric curve.
+ */
+export declare class Curve2D {
+    private readonly _wrapped;
+    private _deleted;
+    _boundingBox: null | BoundingBox2d;
+    private _firstPoint;
+    private _lastPoint;
+    private _firstParameter;
+    private _lastParameter;
+    constructor(handle: KernelType);
+    get wrapped(): KernelType;
+    delete(): void;
+    [Symbol.dispose](): void;
+    /**
+     * Compute (and cache) the 2D bounding box of this curve.
+     *
+     * @remarks The returned box is owned by the curve and is disposed when the
+     * curve is deleted. Clone it if it must outlive the curve.
+     */
+    get boundingBox(): BoundingBox2d;
+    /** Return a human-readable representation, e.g. `LINE (0,0) - (1,1)`. */
+    get repr(): string;
+    /** Serialize this curve to a string that can be restored with {@link deserializeCurve2D}. */
+    serialize(): string;
+    /** Evaluate the curve at the given parameter, returning the 2D point. */
+    value(parameter: number): Point2D;
+    /** Return the point at the start of the curve (cached after first access). */
+    get firstPoint(): Point2D;
+    /** Return the point at the end of the curve (cached after first access). */
+    get lastPoint(): Point2D;
+    /** Return the parameter value at the start of the curve (cached after first access). */
+    get firstParameter(): number;
+    /** Return the parameter value at the end of the curve (cached after first access). */
+    get lastParameter(): number;
+    /** Return the geometric type of this curve (e.g. `LINE`, `CIRCLE`, `BSPLINE_CURVE`). */
+    get geomType(): CurveType;
+    /** Create an independent deep copy of this curve. */
+    clone(): Curve2D;
+    /** Reverse the orientation of this curve in place. */
+    reverse(): void;
+    private distanceFromPoint;
+    private distanceFromCurve;
+    /** Compute the minimum distance from this curve to a point or another curve. */
+    distanceFrom(element: Curve2D | Point2D): number;
+    /** Test whether a point lies on the curve within a tight tolerance (1e-9). */
+    isOnCurve(point: Point2D): boolean;
+    /**
+     * Project a point onto the curve and return its parameter value.
+     *
+     * @returns `Ok(parameter)` when the point is on the curve, or an error result otherwise.
+     */
+    parameter(point: Point2D, precision?: number): Result<number>;
+    /**
+     * Compute the tangent vector at a parameter position or at the projection of a point.
+     *
+     * @param index - A normalized parameter (0..1) or a Point2D to project onto the curve.
+     */
+    tangentAt(index: number | Point2D): Point2D;
+    /**
+     * Split this curve at the given points or parameter values.
+     *
+     * @returns An array of sub-curves whose union covers the original curve.
+     */
+    splitAt(points: Point2D[] | number[], precision?: number): Curve2D[];
+}
+//# sourceMappingURL=curve2D.d.ts.map

package/dist/vendored/brepjs/2d/lib/curve2D.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"curve2D.d.ts","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/2d/lib/curve2D.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AAExD,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,iCAAiC,CAAC;AACjE,OAAO,EAAE,KAAK,MAAM,EAAmB,MAAM,sBAAsB,CAAC;AAOpE,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AACnD,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,kBAAkB,CAAC;AAMhD;;;;GAIG;AACH,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAExD;AAED;;;;;GAKG;AACH,qBAAa,OAAO;IAClB,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAa;IACtC,OAAO,CAAC,QAAQ,CAAS;IACzB,YAAY,EAAE,IAAI,GAAG,aAAa,CAAC;IACnC,OAAO,CAAC,WAAW,CAAwB;IAC3C,OAAO,CAAC,UAAU,CAAwB;IAC1C,OAAO,CAAC,eAAe,CAAuB;IAC9C,OAAO,CAAC,cAAc,CAAuB;gBAEjC,MAAM,EAAE,UAAU;IAW9B,IAAI,OAAO,IAAI,UAAU,CAGxB;IAED,MAAM,IAAI,IAAI;IAcd,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,IAAI;IAIxB;;;;;OAKG;IACH,IAAI,WAAW,kBAOd;IAED,yEAAyE;IACzE,IAAI,IAAI,WAEP;IAED,6FAA6F;IAC7F,SAAS,IAAI,MAAM;IAInB,yEAAyE;IACzE,KAAK,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO;IAIjC,8EAA8E;IAC9E,IAAI,UAAU,IAAI,OAAO,CAKxB;IAED,4EAA4E;IAC5E,IAAI,SAAS,IAAI,OAAO,CAKvB;IAED,wFAAwF;IACxF,IAAI,cAAc,IAAI,MAAM,CAK3B;IAED,sFAAsF;IACtF,IAAI,aAAa,IAAI,MAAM,CAK1B;IAED,wFAAwF;IACxF,IAAI,QAAQ,IAAI,SAAS,CAExB;IAED,qDAAqD;IACrD,KAAK,IAAI,OAAO;IAUhB,sDAAsD;IACtD,OAAO,IAAI,IAAI;IAUf,OAAO,CAAC,iBAAiB;IAWzB,OAAO,CAAC,iBAAiB;IAyBzB,gFAAgF;IAChF,YAAY,CAAC,OAAO,EAAE,OAAO,GAAG,OAAO,GAAG,MAAM;IAQhD,8EAA8E;IAC9E,SAAS,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO;IAIlC;;;;OAIG;IACH,SAAS,CAAC,KAAK,EAAE,OAAO,EAAE,SAAS,SAAO,GAAG,MAAM,CAAC,MAAM,CAAC;IAsC3D;;;;OAIG;IACH,SAAS,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,GAAG,OAAO;IAe3C;;;;OAIG;IACH,OAAO,CAAC,MAAM,EAAE,OAAO,EAAE,GAAG,MAAM,EAAE,EAAE,SAAS,SAAO,GAAG,OAAO,EAAE;CA6BnE"}

package/dist/vendored/brepjs/2d/lib/curve2D.js

@@ -0,0 +1,258 @@
+import { ok, err, unwrap } from '../../core/result.js';
+import { computationError } from '../../core/errors.js';
+import precisionRound from '../../utils/precisionRound.js';
+import { wasmIndex } from '../../utils/vec3.js';
+import { getKernel } from '../../kernel/index.js';
+import { registerForCleanup, unregisterFromCleanup } from '../../core/disposal.js';
+import { BoundingBox2d } from './boundingBox2d.js';
+import { isPoint2D } from './definitions.js';
+// pnt import removed — projection/distance now use kernel methods
+import { reprPnt } from './utils.js';
+import { distance2d, samePoint } from './vectorOperations.js';
+/**
+ * Deserialize a curve from a string produced by {@link Curve2D.serialize}.
+ *
+ * @returns A new `Curve2D` restored from the serialized data.
+ */
+export function deserializeCurve2D(data) {
+    return new Curve2D(getKernel().deserializeCurve2d(data));
+}
+/**
+ * Handle-wrapped 2D parametric curve backed by an kernel `kernel 2D curve`.
+ *
+ * Provides evaluation, splitting, projection, tangent queries, and distance
+ * computations on a single parametric curve.
+ */
+export class Curve2D {
+    _wrapped;
+    _deleted = false;
+    _boundingBox;
+    _firstPoint = null;
+    _lastPoint = null;
+    _firstParameter = null;
+    _lastParameter = null;
+    constructor(handle) {
+        this._wrapped = getKernel().wrapCurve2dHandle(handle);
+        this._boundingBox = null;
+        // Only register for GC cleanup if the handle has a real delete method
+        // (OCCT WASM handles). Pure-TS geometry2d objects have no-op delete
+        // and don't need FinalizationRegistry tracking.
+        if (typeof this._wrapped.delete === 'function') {
+            registerForCleanup(this, this._wrapped);
+        }
+    }
+    get wrapped() {
+        if (this._deleted)
+            throw new Error('This object has been deleted');
+        return this._wrapped;
+    }
+    delete() {
+        if (!this._deleted) {
+            this._deleted = true;
+            if (this._boundingBox) {
+                this._boundingBox.delete();
+                this._boundingBox = null;
+            }
+            if (typeof this._wrapped.delete === 'function') {
+                unregisterFromCleanup(this._wrapped);
+                this._wrapped.delete();
+            }
+        }
+    }
+    [Symbol.dispose]() {
+        this.delete();
+    }
+    /**
+     * Compute (and cache) the 2D bounding box of this curve.
+     *
+     * @remarks The returned box is owned by the curve and is disposed when the
+     * curve is deleted. Clone it if it must outlive the curve.
+     */
+    get boundingBox() {
+        if (this._boundingBox)
+            return this._boundingBox;
+        const kernel = getKernel();
+        const boundBox = kernel.createBoundingBox2d();
+        kernel.addCurveToBBox2d(boundBox, this.wrapped, 1e-6);
+        this._boundingBox = new BoundingBox2d(boundBox);
+        return this._boundingBox;
+    }
+    /** Return a human-readable representation, e.g. `LINE (0,0) - (1,1)`. */
+    get repr() {
+        return `${this.geomType} ${reprPnt(this.firstPoint)} - ${reprPnt(this.lastPoint)}`;
+    }
+    /** Serialize this curve to a string that can be restored with {@link deserializeCurve2D}. */
+    serialize() {
+        return getKernel().serializeCurve2d(this.wrapped);
+    }
+    /** Evaluate the curve at the given parameter, returning the 2D point. */
+    value(parameter) {
+        return getKernel().evaluateCurve2d(this.wrapped, parameter);
+    }
+    /** Return the point at the start of the curve (cached after first access). */
+    get firstPoint() {
+        if (this._firstPoint === null) {
+            this._firstPoint = this.value(this.firstParameter);
+        }
+        return this._firstPoint;
+    }
+    /** Return the point at the end of the curve (cached after first access). */
+    get lastPoint() {
+        if (this._lastPoint === null) {
+            this._lastPoint = this.value(this.lastParameter);
+        }
+        return this._lastPoint;
+    }
+    /** Return the parameter value at the start of the curve (cached after first access). */
+    get firstParameter() {
+        if (this._firstParameter === null) {
+            this._firstParameter = getKernel().getCurve2dBounds(this.wrapped).first;
+        }
+        return this._firstParameter;
+    }
+    /** Return the parameter value at the end of the curve (cached after first access). */
+    get lastParameter() {
+        if (this._lastParameter === null) {
+            this._lastParameter = getKernel().getCurve2dBounds(this.wrapped).last;
+        }
+        return this._lastParameter;
+    }
+    /** Return the geometric type of this curve (e.g. `LINE`, `CIRCLE`, `BSPLINE_CURVE`). */
+    get geomType() {
+        return getKernel().getCurve2dType(this.wrapped);
+    }
+    /** Create an independent deep copy of this curve. */
+    clone() {
+        const cloned = new Curve2D(getKernel().copyCurve2d(this.wrapped));
+        // Copy cached endpoint values to avoid redundant recalculation
+        cloned._firstPoint = this._firstPoint;
+        cloned._lastPoint = this._lastPoint;
+        cloned._firstParameter = this._firstParameter;
+        cloned._lastParameter = this._lastParameter;
+        return cloned;
+    }
+    /** Reverse the orientation of this curve in place. */
+    reverse() {
+        getKernel().reverseCurve2d(this.wrapped);
+        const tmpPt = this._firstPoint;
+        this._firstPoint = this._lastPoint;
+        this._lastPoint = tmpPt;
+        const tmpParam = this._firstParameter;
+        this._firstParameter = this._lastParameter;
+        this._lastParameter = tmpParam;
+    }
+    distanceFromPoint(point) {
+        const proj = getKernel().projectPointOnCurve2d(this.wrapped, point[0], point[1]);
+        const curveToPoint = proj ? proj.distance : Infinity;
+        return Math.min(curveToPoint, distance2d(point, this.firstPoint), distance2d(point, this.lastPoint));
+    }
+    distanceFromCurve(curve) {
+        let curveDistance;
+        try {
+            curveDistance = getKernel().distanceBetweenCurves2d(this.wrapped, curve.wrapped, this.firstParameter, this.lastParameter, curve.firstParameter, curve.lastParameter);
+        }
+        catch {
+            curveDistance = Infinity;
+        }
+        // We need to take the shorter distance between the curves and the extremities
+        return Math.min(curveDistance, this.distanceFromPoint(curve.firstPoint), this.distanceFromPoint(curve.lastPoint), curve.distanceFromPoint(this.firstPoint), curve.distanceFromPoint(this.lastPoint));
+    }
+    /** Compute the minimum distance from this curve to a point or another curve. */
+    distanceFrom(element) {
+        if (isPoint2D(element)) {
+            return this.distanceFromPoint(element);
+        }
+        return this.distanceFromCurve(element);
+    }
+    /** Test whether a point lies on the curve within a tight tolerance (1e-9). */
+    isOnCurve(point) {
+        return this.distanceFromPoint(point) < 1e-9;
+    }
+    /**
+     * Project a point onto the curve and return its parameter value.
+     *
+     * @returns `Ok(parameter)` when the point is on the curve, or an error result otherwise.
+     */
+    parameter(point, precision = 1e-9) {
+        let lowerDistance;
+        let lowerDistanceParameter;
+        let projectionFailed = false;
+        try {
+            const proj = getKernel().projectPointOnCurve2d(this.wrapped, point[0], point[1]);
+            if (!proj) {
+                projectionFailed = true;
+            }
+            else {
+                lowerDistance = proj.distance;
+                lowerDistanceParameter = proj.param;
+            }
+        }
+        catch {
+            projectionFailed = true;
+        }
+        if (projectionFailed) {
+            // Perhaps it failed because it is on an extremity
+            if (samePoint(point, this.firstPoint, precision))
+                return ok(this.firstParameter);
+            if (samePoint(point, this.lastPoint, precision))
+                return ok(this.lastParameter);
+            return err(computationError('PARAMETER_NOT_FOUND', 'Failed to find parameter'));
+        }
+        if (lowerDistance === undefined || lowerDistanceParameter === undefined) {
+            return err(computationError('PARAMETER_NOT_FOUND', 'Failed to find parameter'));
+        }
+        if (lowerDistance > precision) {
+            return err(computationError('POINT_NOT_ON_CURVE', `Point ${reprPnt(point)} not on curve ${this.repr}, ${lowerDistance.toFixed(9)}`));
+        }
+        return ok(lowerDistanceParameter);
+    }
+    /**
+     * Compute the tangent vector at a parameter position or at the projection of a point.
+     *
+     * @param index - A normalized parameter (0..1) or a Point2D to project onto the curve.
+     */
+    tangentAt(index) {
+        let param;
+        if (Array.isArray(index)) {
+            param = unwrap(this.parameter(index));
+        }
+        else {
+            const bounds = getKernel().getCurve2dBounds(this.wrapped);
+            const paramLength = bounds.last - bounds.first;
+            param = paramLength * index + bounds.first;
+        }
+        const result = getKernel().evaluateCurve2dD1(this.wrapped, param);
+        return result.tangent;
+    }
+    /**
+     * Split this curve at the given points or parameter values.
+     *
+     * @returns An array of sub-curves whose union covers the original curve.
+     */
+    splitAt(points, precision = 1e-9) {
+        let parameters = points.map((point) => {
+            if (isPoint2D(point))
+                return unwrap(this.parameter(point, precision));
+            return point;
+        });
+        // We only split on each point once
+        parameters = Array.from(new Map(parameters.map((p) => [precisionRound(p, -Math.log10(precision)), p])).values()).sort((a, b) => a - b);
+        const firstParam = this.firstParameter;
+        const lastParam = this.lastParameter;
+        if (firstParam > lastParam) {
+            parameters.reverse();
+        }
+        // We do not split again on the start and end
+        if (Math.abs(wasmIndex(parameters, 0) - firstParam) < precision * 100)
+            parameters = parameters.slice(1);
+        if (!parameters.length)
+            return [this];
+        if (Math.abs(wasmIndex(parameters, parameters.length - 1) - lastParam) < precision * 100)
+            parameters = parameters.slice(0, -1);
+        if (!parameters.length)
+            return [this];
+        const handles = getKernel().splitCurve2d(this.wrapped, parameters);
+        return handles.map((h) => new Curve2D(h));
+    }
+}
+//# sourceMappingURL=curve2D.js.map

package/dist/vendored/brepjs/2d/lib/curve2D.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"curve2D.js","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/2d/lib/curve2D.ts"],"names":[],"mappings":"AAGA,OAAO,EAAe,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,MAAM,sBAAsB,CAAC;AACpE,OAAO,EAAE,gBAAgB,EAAE,MAAM,sBAAsB,CAAC;AACxD,OAAO,cAAc,MAAM,+BAA+B,CAAC;AAC3D,OAAO,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AAClD,OAAO,EAAE,kBAAkB,EAAE,qBAAqB,EAAE,MAAM,wBAAwB,CAAC;AAEnF,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AAEnD,OAAO,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AAC7C,kEAAkE;AAClE,OAAO,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AACrC,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AAE9D;;;;GAIG;AACH,MAAM,UAAU,kBAAkB,CAAC,IAAY;IAC7C,OAAO,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC,CAAC;AAC3D,CAAC;AAED;;;;;GAKG;AACH,MAAM,OAAO,OAAO;IACD,QAAQ,CAAa;IAC9B,QAAQ,GAAG,KAAK,CAAC;IACzB,YAAY,CAAuB;IAC3B,WAAW,GAAmB,IAAI,CAAC;IACnC,UAAU,GAAmB,IAAI,CAAC;IAClC,eAAe,GAAkB,IAAI,CAAC;IACtC,cAAc,GAAkB,IAAI,CAAC;IAE7C,YAAY,MAAkB;QAC5B,IAAI,CAAC,QAAQ,GAAG,SAAS,EAAE,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;QACtD,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC;QACzB,sEAAsE;QACtE,oEAAoE;QACpE,gDAAgD;QAChD,IAAI,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,UAAU,EAAE,CAAC;YAC/C,kBAAkB,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC1C,CAAC;IACH,CAAC;IAED,IAAI,OAAO;QACT,IAAI,IAAI,CAAC,QAAQ;YAAE,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC,CAAC;QACnE,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IAED,MAAM;QACJ,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;YACnB,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;YACrB,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;gBACtB,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC;gBAC3B,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC;YAC3B,CAAC;YACD,IAAI,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,UAAU,EAAE,CAAC;gBAC/C,qBAAqB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACrC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;YACzB,CAAC;QACH,CAAC;IACH,CAAC;IAED,CAAC,MAAM,CAAC,OAAO,CAAC;QACd,IAAI,CAAC,MAAM,EAAE,CAAC;IAChB,CAAC;IAED;;;;;OAKG;IACH,IAAI,WAAW;QACb,IAAI,IAAI,CAAC,YAAY;YAAE,OAAO,IAAI,CAAC,YAAY,CAAC;QAChD,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC;QAC3B,MAAM,QAAQ,GAAG,MAAM,CAAC,mBAAmB,EAAE,CAAC;QAC9C,MAAM,CAAC,gBAAgB,CAAC,QAAQ,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QACtD,IAAI,CAAC,YAAY,GAAG,IAAI,aAAa,CAAC,QAAQ,CAAC,CAAC;QAChD,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IAED,yEAAyE;IACzE,IAAI,IAAI;QACN,OAAO,GAAG,IAAI,CAAC,QAAQ,IAAI,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;IACrF,CAAC;IAED,6FAA6F;IAC7F,SAAS;QACP,OAAO,SAAS,EAAE,CAAC,gBAAgB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACpD,CAAC;IAED,yEAAyE;IACzE,KAAK,CAAC,SAAiB;QACrB,OAAO,SAAS,EAAE,CAAC,eAAe,CAAC,IAAI,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;IAC9D,CAAC;IAED,8EAA8E;IAC9E,IAAI,UAAU;QACZ,IAAI,IAAI,CAAC,WAAW,KAAK,IAAI,EAAE,CAAC;YAC9B,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QACrD,CAAC;QACD,OAAO,IAAI,CAAC,WAAW,CAAC;IAC1B,CAAC;IAED,4EAA4E;IAC5E,IAAI,SAAS;QACX,IAAI,IAAI,CAAC,UAAU,KAAK,IAAI,EAAE,CAAC;YAC7B,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QACnD,CAAC;QACD,OAAO,IAAI,CAAC,UAAU,CAAC;IACzB,CAAC;IAED,wFAAwF;IACxF,IAAI,cAAc;QAChB,IAAI,IAAI,CAAC,eAAe,KAAK,IAAI,EAAE,CAAC;YAClC,IAAI,CAAC,eAAe,GAAG,SAAS,EAAE,CAAC,gBAAgB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,KAAK,CAAC;QAC1E,CAAC;QACD,OAAO,IAAI,CAAC,eAAe,CAAC;IAC9B,CAAC;IAED,sFAAsF;IACtF,IAAI,aAAa;QACf,IAAI,IAAI,CAAC,cAAc,KAAK,IAAI,EAAE,CAAC;YACjC,IAAI,CAAC,cAAc,GAAG,SAAS,EAAE,CAAC,gBAAgB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC;QACxE,CAAC;QACD,OAAO,IAAI,CAAC,cAAc,CAAC;IAC7B,CAAC;IAED,wFAAwF;IACxF,IAAI,QAAQ;QACV,OAAO,SAAS,EAAE,CAAC,cAAc,CAAC,IAAI,CAAC,OAAO,CAAc,CAAC;IAC/D,CAAC;IAED,qDAAqD;IACrD,KAAK;QACH,MAAM,MAAM,GAAG,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;QAClE,+DAA+D;QAC/D,MAAM,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC;QACtC,MAAM,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;QACpC,MAAM,CAAC,eAAe,GAAG,IAAI,CAAC,eAAe,CAAC;QAC9C,MAAM,CAAC,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC;QAC5C,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,sDAAsD;IACtD,OAAO;QACL,SAAS,EAAE,CAAC,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACzC,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC;QAC/B,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,UAAU,CAAC;QACnC,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC;QACxB,MAAM,QAAQ,GAAG,IAAI,CAAC,eAAe,CAAC;QACtC,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC,cAAc,CAAC;QAC3C,IAAI,CAAC,cAAc,GAAG,QAAQ,CAAC;IACjC,CAAC;IAEO,iBAAiB,CAAC,KAAc;QACtC,MAAM,IAAI,GAAG,SAAS,EAAE,CAAC,qBAAqB,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QACjF,MAAM,YAAY,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC;QAErD,OAAO,IAAI,CAAC,GAAG,CACb,YAAY,EACZ,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,UAAU,CAAC,EAClC,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,CAClC,CAAC;IACJ,CAAC;IAEO,iBAAiB,CAAC,KAAc;QACtC,IAAI,aAAa,CAAC;QAClB,IAAI,CAAC;YACH,aAAa,GAAG,SAAS,EAAE,CAAC,uBAAuB,CACjD,IAAI,CAAC,OAAO,EACZ,KAAK,CAAC,OAAO,EACb,IAAI,CAAC,cAAc,EACnB,IAAI,CAAC,aAAa,EAClB,KAAK,CAAC,cAAc,EACpB,KAAK,CAAC,aAAa,CACpB,CAAC;QACJ,CAAC;QAAC,MAAM,CAAC;YACP,aAAa,GAAG,QAAQ,CAAC;QAC3B,CAAC;QAED,8EAA8E;QAC9E,OAAO,IAAI,CAAC,GAAG,CACb,aAAa,EACb,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,UAAU,CAAC,EACxC,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,SAAS,CAAC,EACvC,KAAK,CAAC,iBAAiB,CAAC,IAAI,CAAC,UAAU,CAAC,EACxC,KAAK,CAAC,iBAAiB,CAAC,IAAI,CAAC,SAAS,CAAC,CACxC,CAAC;IACJ,CAAC;IAED,gFAAgF;IAChF,YAAY,CAAC,OAA0B;QACrC,IAAI,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC;YACvB,OAAO,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC;QACzC,CAAC;QAED,OAAO,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC;IACzC,CAAC;IAED,8EAA8E;IAC9E,SAAS,CAAC,KAAc;QACtB,OAAO,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC;IAC9C,CAAC;IAED;;;;OAIG;IACH,SAAS,CAAC,KAAc,EAAE,SAAS,GAAG,IAAI;QACxC,IAAI,aAAiC,CAAC;QACtC,IAAI,sBAA0C,CAAC;QAC/C,IAAI,gBAAgB,GAAG,KAAK,CAAC;QAC7B,IAAI,CAAC;YACH,MAAM,IAAI,GAAG,SAAS,EAAE,CAAC,qBAAqB,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YACjF,IAAI,CAAC,IAAI,EAAE,CAAC;gBACV,gBAAgB,GAAG,IAAI,CAAC;YAC1B,CAAC;iBAAM,CAAC;gBACN,aAAa,GAAG,IAAI,CAAC,QAAQ,CAAC;gBAC9B,sBAAsB,GAAG,IAAI,CAAC,KAAK,CAAC;YACtC,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,gBAAgB,GAAG,IAAI,CAAC;QAC1B,CAAC;QAED,IAAI,gBAAgB,EAAE,CAAC;YACrB,kDAAkD;YAClD,IAAI,SAAS,CAAC,KAAK,EAAE,IAAI,CAAC,UAAU,EAAE,SAAS,CAAC;gBAAE,OAAO,EAAE,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;YACjF,IAAI,SAAS,CAAC,KAAK,EAAE,IAAI,CAAC,SAAS,EAAE,SAAS,CAAC;gBAAE,OAAO,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;YAE/E,OAAO,GAAG,CAAC,gBAAgB,CAAC,qBAAqB,EAAE,0BAA0B,CAAC,CAAC,CAAC;QAClF,CAAC;QAED,IAAI,aAAa,KAAK,SAAS,IAAI,sBAAsB,KAAK,SAAS,EAAE,CAAC;YACxE,OAAO,GAAG,CAAC,gBAAgB,CAAC,qBAAqB,EAAE,0BAA0B,CAAC,CAAC,CAAC;QAClF,CAAC;QACD,IAAI,aAAa,GAAG,SAAS,EAAE,CAAC;YAC9B,OAAO,GAAG,CACR,gBAAgB,CACd,oBAAoB,EACpB,SAAS,OAAO,CAAC,KAAK,CAAC,iBAAiB,IAAI,CAAC,IAAI,KAAK,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CACjF,CACF,CAAC;QACJ,CAAC;QACD,OAAO,EAAE,CAAC,sBAAsB,CAAC,CAAC;IACpC,CAAC;IAED;;;;OAIG;IACH,SAAS,CAAC,KAAuB;QAC/B,IAAI,KAAK,CAAC;QAEV,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YACzB,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC;QACxC,CAAC;aAAM,CAAC;YACN,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC,gBAAgB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC1D,MAAM,WAAW,GAAG,MAAM,CAAC,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC;YAC/C,KAAK,GAAG,WAAW,GAAG,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC;QAC7C,CAAC;QAED,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC,iBAAiB,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAClE,OAAO,MAAM,CAAC,OAAO,CAAC;IACxB,CAAC;IAED;;;;OAIG;IACH,OAAO,CAAC,MAA4B,EAAE,SAAS,GAAG,IAAI;QACpD,IAAI,UAAU,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,KAAuB,EAAE,EAAE;YACtD,IAAI,SAAS,CAAC,KAAK,CAAC;gBAAE,OAAO,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC;YACtE,OAAO,KAAK,CAAC;QACf,CAAC,CAAC,CAAC;QAEH,mCAAmC;QACnC,UAAU,GAAG,KAAK,CAAC,IAAI,CACrB,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CACxF,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACxB,MAAM,UAAU,GAAG,IAAI,CAAC,cAAc,CAAC;QACvC,MAAM,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC;QAErC,IAAI,UAAU,GAAG,SAAS,EAAE,CAAC;YAC3B,UAAU,CAAC,OAAO,EAAE,CAAC;QACvB,CAAC;QAED,6CAA6C;QAC7C,IAAI,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,UAAU,EAAE,CAAC,CAAC,GAAG,UAAU,CAAC,GAAG,SAAS,GAAG,GAAG;YACnE,UAAU,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACnC,IAAI,CAAC,UAAU,CAAC,MAAM;YAAE,OAAO,CAAC,IAAI,CAAC,CAAC;QAEtC,IAAI,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,UAAU,EAAE,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,GAAG,SAAS,GAAG,GAAG;YACtF,UAAU,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACvC,IAAI,CAAC,UAAU,CAAC,MAAM;YAAE,OAAO,CAAC,IAAI,CAAC,CAAC;QAEtC,MAAM,OAAO,GAAG,SAAS,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;QACnE,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5C,CAAC;CACF","sourcesContent":["import type { KernelType } from '../../kernel/types.js';\n\nimport type { CurveType } from '../../core/typeDiscriminants.js';\nimport { type Result, ok, err, unwrap } from '../../core/result.js';\nimport { computationError } from '../../core/errors.js';\nimport precisionRound from '../../utils/precisionRound.js';\nimport { wasmIndex } from '../../utils/vec3.js';\nimport { getKernel } from '../../kernel/index.js';\nimport { registerForCleanup, unregisterFromCleanup } from '../../core/disposal.js';\n\nimport { BoundingBox2d } from './boundingBox2d.js';\nimport type { Point2D } from './definitions.js';\nimport { isPoint2D } from './definitions.js';\n// pnt import removed — projection/distance now use kernel methods\nimport { reprPnt } from './utils.js';\nimport { distance2d, samePoint } from './vectorOperations.js';\n\n/**\n * Deserialize a curve from a string produced by {@link Curve2D.serialize}.\n *\n * @returns A new `Curve2D` restored from the serialized data.\n */\nexport function deserializeCurve2D(data: string): Curve2D {\n  return new Curve2D(getKernel().deserializeCurve2d(data));\n}\n\n/**\n * Handle-wrapped 2D parametric curve backed by an kernel `kernel 2D curve`.\n *\n * Provides evaluation, splitting, projection, tangent queries, and distance\n * computations on a single parametric curve.\n */\nexport class Curve2D {\n  private readonly _wrapped: KernelType;\n  private _deleted = false;\n  _boundingBox: null | BoundingBox2d;\n  private _firstPoint: Point2D | null = null;\n  private _lastPoint: Point2D | null = null;\n  private _firstParameter: number | null = null;\n  private _lastParameter: number | null = null;\n\n  constructor(handle: KernelType) {\n    this._wrapped = getKernel().wrapCurve2dHandle(handle);\n    this._boundingBox = null;\n    // Only register for GC cleanup if the handle has a real delete method\n    // (OCCT WASM handles). Pure-TS geometry2d objects have no-op delete\n    // and don't need FinalizationRegistry tracking.\n    if (typeof this._wrapped.delete === 'function') {\n      registerForCleanup(this, this._wrapped);\n    }\n  }\n\n  get wrapped(): KernelType {\n    if (this._deleted) throw new Error('This object has been deleted');\n    return this._wrapped;\n  }\n\n  delete(): void {\n    if (!this._deleted) {\n      this._deleted = true;\n      if (this._boundingBox) {\n        this._boundingBox.delete();\n        this._boundingBox = null;\n      }\n      if (typeof this._wrapped.delete === 'function') {\n        unregisterFromCleanup(this._wrapped);\n        this._wrapped.delete();\n      }\n    }\n  }\n\n  [Symbol.dispose](): void {\n    this.delete();\n  }\n\n  /**\n   * Compute (and cache) the 2D bounding box of this curve.\n   *\n   * @remarks The returned box is owned by the curve and is disposed when the\n   * curve is deleted. Clone it if it must outlive the curve.\n   */\n  get boundingBox() {\n    if (this._boundingBox) return this._boundingBox;\n    const kernel = getKernel();\n    const boundBox = kernel.createBoundingBox2d();\n    kernel.addCurveToBBox2d(boundBox, this.wrapped, 1e-6);\n    this._boundingBox = new BoundingBox2d(boundBox);\n    return this._boundingBox;\n  }\n\n  /** Return a human-readable representation, e.g. `LINE (0,0) - (1,1)`. */\n  get repr() {\n    return `${this.geomType} ${reprPnt(this.firstPoint)} - ${reprPnt(this.lastPoint)}`;\n  }\n\n  /** Serialize this curve to a string that can be restored with {@link deserializeCurve2D}. */\n  serialize(): string {\n    return getKernel().serializeCurve2d(this.wrapped);\n  }\n\n  /** Evaluate the curve at the given parameter, returning the 2D point. */\n  value(parameter: number): Point2D {\n    return getKernel().evaluateCurve2d(this.wrapped, parameter);\n  }\n\n  /** Return the point at the start of the curve (cached after first access). */\n  get firstPoint(): Point2D {\n    if (this._firstPoint === null) {\n      this._firstPoint = this.value(this.firstParameter);\n    }\n    return this._firstPoint;\n  }\n\n  /** Return the point at the end of the curve (cached after first access). */\n  get lastPoint(): Point2D {\n    if (this._lastPoint === null) {\n      this._lastPoint = this.value(this.lastParameter);\n    }\n    return this._lastPoint;\n  }\n\n  /** Return the parameter value at the start of the curve (cached after first access). */\n  get firstParameter(): number {\n    if (this._firstParameter === null) {\n      this._firstParameter = getKernel().getCurve2dBounds(this.wrapped).first;\n    }\n    return this._firstParameter;\n  }\n\n  /** Return the parameter value at the end of the curve (cached after first access). */\n  get lastParameter(): number {\n    if (this._lastParameter === null) {\n      this._lastParameter = getKernel().getCurve2dBounds(this.wrapped).last;\n    }\n    return this._lastParameter;\n  }\n\n  /** Return the geometric type of this curve (e.g. `LINE`, `CIRCLE`, `BSPLINE_CURVE`). */\n  get geomType(): CurveType {\n    return getKernel().getCurve2dType(this.wrapped) as CurveType;\n  }\n\n  /** Create an independent deep copy of this curve. */\n  clone(): Curve2D {\n    const cloned = new Curve2D(getKernel().copyCurve2d(this.wrapped));\n    // Copy cached endpoint values to avoid redundant recalculation\n    cloned._firstPoint = this._firstPoint;\n    cloned._lastPoint = this._lastPoint;\n    cloned._firstParameter = this._firstParameter;\n    cloned._lastParameter = this._lastParameter;\n    return cloned;\n  }\n\n  /** Reverse the orientation of this curve in place. */\n  reverse(): void {\n    getKernel().reverseCurve2d(this.wrapped);\n    const tmpPt = this._firstPoint;\n    this._firstPoint = this._lastPoint;\n    this._lastPoint = tmpPt;\n    const tmpParam = this._firstParameter;\n    this._firstParameter = this._lastParameter;\n    this._lastParameter = tmpParam;\n  }\n\n  private distanceFromPoint(point: Point2D): number {\n    const proj = getKernel().projectPointOnCurve2d(this.wrapped, point[0], point[1]);\n    const curveToPoint = proj ? proj.distance : Infinity;\n\n    return Math.min(\n      curveToPoint,\n      distance2d(point, this.firstPoint),\n      distance2d(point, this.lastPoint)\n    );\n  }\n\n  private distanceFromCurve(curve: Curve2D): number {\n    let curveDistance;\n    try {\n      curveDistance = getKernel().distanceBetweenCurves2d(\n        this.wrapped,\n        curve.wrapped,\n        this.firstParameter,\n        this.lastParameter,\n        curve.firstParameter,\n        curve.lastParameter\n      );\n    } catch {\n      curveDistance = Infinity;\n    }\n\n    // We need to take the shorter distance between the curves and the extremities\n    return Math.min(\n      curveDistance,\n      this.distanceFromPoint(curve.firstPoint),\n      this.distanceFromPoint(curve.lastPoint),\n      curve.distanceFromPoint(this.firstPoint),\n      curve.distanceFromPoint(this.lastPoint)\n    );\n  }\n\n  /** Compute the minimum distance from this curve to a point or another curve. */\n  distanceFrom(element: Curve2D | Point2D): number {\n    if (isPoint2D(element)) {\n      return this.distanceFromPoint(element);\n    }\n\n    return this.distanceFromCurve(element);\n  }\n\n  /** Test whether a point lies on the curve within a tight tolerance (1e-9). */\n  isOnCurve(point: Point2D): boolean {\n    return this.distanceFromPoint(point) < 1e-9;\n  }\n\n  /**\n   * Project a point onto the curve and return its parameter value.\n   *\n   * @returns `Ok(parameter)` when the point is on the curve, or an error result otherwise.\n   */\n  parameter(point: Point2D, precision = 1e-9): Result<number> {\n    let lowerDistance: number | undefined;\n    let lowerDistanceParameter: number | undefined;\n    let projectionFailed = false;\n    try {\n      const proj = getKernel().projectPointOnCurve2d(this.wrapped, point[0], point[1]);\n      if (!proj) {\n        projectionFailed = true;\n      } else {\n        lowerDistance = proj.distance;\n        lowerDistanceParameter = proj.param;\n      }\n    } catch {\n      projectionFailed = true;\n    }\n\n    if (projectionFailed) {\n      // Perhaps it failed because it is on an extremity\n      if (samePoint(point, this.firstPoint, precision)) return ok(this.firstParameter);\n      if (samePoint(point, this.lastPoint, precision)) return ok(this.lastParameter);\n\n      return err(computationError('PARAMETER_NOT_FOUND', 'Failed to find parameter'));\n    }\n\n    if (lowerDistance === undefined || lowerDistanceParameter === undefined) {\n      return err(computationError('PARAMETER_NOT_FOUND', 'Failed to find parameter'));\n    }\n    if (lowerDistance > precision) {\n      return err(\n        computationError(\n          'POINT_NOT_ON_CURVE',\n          `Point ${reprPnt(point)} not on curve ${this.repr}, ${lowerDistance.toFixed(9)}`\n        )\n      );\n    }\n    return ok(lowerDistanceParameter);\n  }\n\n  /**\n   * Compute the tangent vector at a parameter position or at the projection of a point.\n   *\n   * @param index - A normalized parameter (0..1) or a Point2D to project onto the curve.\n   */\n  tangentAt(index: number | Point2D): Point2D {\n    let param;\n\n    if (Array.isArray(index)) {\n      param = unwrap(this.parameter(index));\n    } else {\n      const bounds = getKernel().getCurve2dBounds(this.wrapped);\n      const paramLength = bounds.last - bounds.first;\n      param = paramLength * index + bounds.first;\n    }\n\n    const result = getKernel().evaluateCurve2dD1(this.wrapped, param);\n    return result.tangent;\n  }\n\n  /**\n   * Split this curve at the given points or parameter values.\n   *\n   * @returns An array of sub-curves whose union covers the original curve.\n   */\n  splitAt(points: Point2D[] | number[], precision = 1e-9): Curve2D[] {\n    let parameters = points.map((point: Point2D | number) => {\n      if (isPoint2D(point)) return unwrap(this.parameter(point, precision));\n      return point;\n    });\n\n    // We only split on each point once\n    parameters = Array.from(\n      new Map(parameters.map((p) => [precisionRound(p, -Math.log10(precision)), p])).values()\n    ).sort((a, b) => a - b);\n    const firstParam = this.firstParameter;\n    const lastParam = this.lastParameter;\n\n    if (firstParam > lastParam) {\n      parameters.reverse();\n    }\n\n    // We do not split again on the start and end\n    if (Math.abs(wasmIndex(parameters, 0) - firstParam) < precision * 100)\n      parameters = parameters.slice(1);\n    if (!parameters.length) return [this];\n\n    if (Math.abs(wasmIndex(parameters, parameters.length - 1) - lastParam) < precision * 100)\n      parameters = parameters.slice(0, -1);\n    if (!parameters.length) return [this];\n\n    const handles = getKernel().splitCurve2d(this.wrapped, parameters);\n    return handles.map((h) => new Curve2D(h));\n  }\n}\n"]}