@faicad/faijs 0.13.0

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

@@ -0,0 +1,53 @@
+/**
+ * Standalone pure functions for 2D curve operations.
+ *
+ * Each function wraps a corresponding {@link Curve2D} method without mutating
+ * the input curve, providing a functional API for 2D geometry pipelines.
+ *
+ * @module
+ */
+import type { Point2D } from './definitions.js';
+import type { BoundingBox2d } from './boundingBox2d.js';
+import type { Curve2D } from './curve2D.js';
+import type { Result } from '../../core/result.js';
+/**
+ * Return a reversed copy of the curve (non-mutating).
+ *
+ * @returns A new `Curve2D` with swapped start/end orientation.
+ */
+export declare function reverseCurve(curve: Curve2D): Curve2D;
+/**
+ * Get the bounding box of a 2D curve.
+ *
+ * @remarks The box is borrowed from the curve's cache and is disposed with the
+ * curve. Clone it if it must outlive the curve.
+ */
+export declare function curve2dBoundingBox(curve: Curve2D): BoundingBox2d;
+/** Get the first point of a 2D curve. */
+export declare function curve2dFirstPoint(curve: Curve2D): Point2D;
+/** Get the last point of a 2D curve. */
+export declare function curve2dLastPoint(curve: Curve2D): Point2D;
+/**
+ * Split a curve at the given parameters or points.
+ *
+ * @param params - Parameter values or `Point2D` locations at which to split.
+ * @returns An ordered array of sub-curves covering the original curve.
+ */
+export declare function curve2dSplitAt(curve: Curve2D, params: Point2D[] | number[], precision?: number): Curve2D[];
+/**
+ * Find the parameter on the curve closest to the given point.
+ *
+ * @returns `Ok(parameter)` when the point is on the curve, or an error result.
+ */
+export declare function curve2dParameter(curve: Curve2D, point: Point2D, precision?: number): Result<number>;
+/**
+ * Get the tangent vector at a parameter position on the curve.
+ *
+ * @param param - A normalized parameter (0..1) or a `Point2D` to project onto the curve.
+ */
+export declare function curve2dTangentAt(curve: Curve2D, param: number | Point2D): Point2D;
+/** Check if a point lies on the curve. */
+export declare function curve2dIsOnCurve(curve: Curve2D, point: Point2D): boolean;
+/** Compute the distance from a point to the curve. */
+export declare function curve2dDistanceFrom(curve: Curve2D, point: Point2D): number;
+//# sourceMappingURL=curve2dFns.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"curve2dFns.d.ts","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/2d/lib/curve2dFns.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,kBAAkB,CAAC;AAChD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AACxD,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AAC5C,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,sBAAsB,CAAC;AAEnD;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO,CAIpD;AAED;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,OAAO,GAAG,aAAa,CAEhE;AAED,yCAAyC;AACzC,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO,CAEzD;AAED,wCAAwC;AACxC,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO,CAExD;AAED;;;;;GAKG;AACH,wBAAgB,cAAc,CAC5B,KAAK,EAAE,OAAO,EACd,MAAM,EAAE,OAAO,EAAE,GAAG,MAAM,EAAE,EAC5B,SAAS,CAAC,EAAE,MAAM,GACjB,OAAO,EAAE,CAEX;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,OAAO,EACd,KAAK,EAAE,OAAO,EACd,SAAS,CAAC,EAAE,MAAM,GACjB,MAAM,CAAC,MAAM,CAAC,CAEhB;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,GAAG,OAAO,CAEjF;AAED,0CAA0C;AAC1C,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,GAAG,OAAO,CAExE;AAED,sDAAsD;AACtD,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,GAAG,MAAM,CAE1E"}

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

@@ -0,0 +1,69 @@
+/**
+ * Standalone pure functions for 2D curve operations.
+ *
+ * Each function wraps a corresponding {@link Curve2D} method without mutating
+ * the input curve, providing a functional API for 2D geometry pipelines.
+ *
+ * @module
+ */
+/**
+ * Return a reversed copy of the curve (non-mutating).
+ *
+ * @returns A new `Curve2D` with swapped start/end orientation.
+ */
+export function reverseCurve(curve) {
+    const cloned = curve.clone();
+    cloned.reverse();
+    return cloned;
+}
+/**
+ * Get the bounding box of a 2D curve.
+ *
+ * @remarks The box is borrowed from the curve's cache and is disposed with the
+ * curve. Clone it if it must outlive the curve.
+ */
+export function curve2dBoundingBox(curve) {
+    return curve.boundingBox;
+}
+/** Get the first point of a 2D curve. */
+export function curve2dFirstPoint(curve) {
+    return curve.firstPoint;
+}
+/** Get the last point of a 2D curve. */
+export function curve2dLastPoint(curve) {
+    return curve.lastPoint;
+}
+/**
+ * Split a curve at the given parameters or points.
+ *
+ * @param params - Parameter values or `Point2D` locations at which to split.
+ * @returns An ordered array of sub-curves covering the original curve.
+ */
+export function curve2dSplitAt(curve, params, precision) {
+    return curve.splitAt(params, precision);
+}
+/**
+ * Find the parameter on the curve closest to the given point.
+ *
+ * @returns `Ok(parameter)` when the point is on the curve, or an error result.
+ */
+export function curve2dParameter(curve, point, precision) {
+    return curve.parameter(point, precision);
+}
+/**
+ * Get the tangent vector at a parameter position on the curve.
+ *
+ * @param param - A normalized parameter (0..1) or a `Point2D` to project onto the curve.
+ */
+export function curve2dTangentAt(curve, param) {
+    return curve.tangentAt(param);
+}
+/** Check if a point lies on the curve. */
+export function curve2dIsOnCurve(curve, point) {
+    return curve.isOnCurve(point);
+}
+/** Compute the distance from a point to the curve. */
+export function curve2dDistanceFrom(curve, point) {
+    return curve.distanceFrom(point);
+}
+//# sourceMappingURL=curve2dFns.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"curve2dFns.js","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/2d/lib/curve2dFns.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAOH;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAAC,KAAc;IACzC,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;IAC7B,MAAM,CAAC,OAAO,EAAE,CAAC;IACjB,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,kBAAkB,CAAC,KAAc;IAC/C,OAAO,KAAK,CAAC,WAAW,CAAC;AAC3B,CAAC;AAED,yCAAyC;AACzC,MAAM,UAAU,iBAAiB,CAAC,KAAc;IAC9C,OAAO,KAAK,CAAC,UAAU,CAAC;AAC1B,CAAC;AAED,wCAAwC;AACxC,MAAM,UAAU,gBAAgB,CAAC,KAAc;IAC7C,OAAO,KAAK,CAAC,SAAS,CAAC;AACzB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,cAAc,CAC5B,KAAc,EACd,MAA4B,EAC5B,SAAkB;IAElB,OAAO,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;AAC1C,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,gBAAgB,CAC9B,KAAc,EACd,KAAc,EACd,SAAkB;IAElB,OAAO,KAAK,CAAC,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;AAC3C,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAAc,EAAE,KAAuB;IACtE,OAAO,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;AAChC,CAAC;AAED,0CAA0C;AAC1C,MAAM,UAAU,gBAAgB,CAAC,KAAc,EAAE,KAAc;IAC7D,OAAO,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;AAChC,CAAC;AAED,sDAAsD;AACtD,MAAM,UAAU,mBAAmB,CAAC,KAAc,EAAE,KAAc;IAChE,OAAO,KAAK,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;AACnC,CAAC","sourcesContent":["/**\n * Standalone pure functions for 2D curve operations.\n *\n * Each function wraps a corresponding {@link Curve2D} method without mutating\n * the input curve, providing a functional API for 2D geometry pipelines.\n *\n * @module\n */\n\nimport type { Point2D } from './definitions.js';\nimport type { BoundingBox2d } from './boundingBox2d.js';\nimport type { Curve2D } from './curve2D.js';\nimport type { Result } from '../../core/result.js';\n\n/**\n * Return a reversed copy of the curve (non-mutating).\n *\n * @returns A new `Curve2D` with swapped start/end orientation.\n */\nexport function reverseCurve(curve: Curve2D): Curve2D {\n  const cloned = curve.clone();\n  cloned.reverse();\n  return cloned;\n}\n\n/**\n * Get the bounding box of a 2D curve.\n *\n * @remarks The box is borrowed from the curve's cache and is disposed with the\n * curve. Clone it if it must outlive the curve.\n */\nexport function curve2dBoundingBox(curve: Curve2D): BoundingBox2d {\n  return curve.boundingBox;\n}\n\n/** Get the first point of a 2D curve. */\nexport function curve2dFirstPoint(curve: Curve2D): Point2D {\n  return curve.firstPoint;\n}\n\n/** Get the last point of a 2D curve. */\nexport function curve2dLastPoint(curve: Curve2D): Point2D {\n  return curve.lastPoint;\n}\n\n/**\n * Split a curve at the given parameters or points.\n *\n * @param params - Parameter values or `Point2D` locations at which to split.\n * @returns An ordered array of sub-curves covering the original curve.\n */\nexport function curve2dSplitAt(\n  curve: Curve2D,\n  params: Point2D[] | number[],\n  precision?: number\n): Curve2D[] {\n  return curve.splitAt(params, precision);\n}\n\n/**\n * Find the parameter on the curve closest to the given point.\n *\n * @returns `Ok(parameter)` when the point is on the curve, or an error result.\n */\nexport function curve2dParameter(\n  curve: Curve2D,\n  point: Point2D,\n  precision?: number\n): Result<number> {\n  return curve.parameter(point, precision);\n}\n\n/**\n * Get the tangent vector at a parameter position on the curve.\n *\n * @param param - A normalized parameter (0..1) or a `Point2D` to project onto the curve.\n */\nexport function curve2dTangentAt(curve: Curve2D, param: number | Point2D): Point2D {\n  return curve.tangentAt(param);\n}\n\n/** Check if a point lies on the curve. */\nexport function curve2dIsOnCurve(curve: Curve2D, point: Point2D): boolean {\n  return curve.isOnCurve(point);\n}\n\n/** Compute the distance from a point to the curve. */\nexport function curve2dDistanceFrom(curve: Curve2D, point: Point2D): number {\n  return curve.distanceFrom(point);\n}\n"]}

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

@@ -0,0 +1,29 @@
+import { Curve2D } from './curve2D.js';
+/**
+ * Insert a circular fillet arc at the corner between two curves.
+ *
+ * Trims both curves and inserts a tangent arc of the given radius.
+ * Returns the original curves unmodified when they are collinear.
+ *
+ * @example
+ * ```ts
+ * const segments = filletCurves(line1, line2, 5);
+ * // [trimmedLine1, filletArc, trimmedLine2]
+ * ```
+ */
+export declare function filletCurves(firstCurve: Curve2D, secondCurve: Curve2D, radius: number): Curve2D[];
+/**
+ * Insert a straight chamfer segment at the corner between two curves.
+ *
+ * Trims both curves and connects them with a line segment.
+ * Returns the original curves unmodified when they are collinear.
+ */
+export declare function chamferCurves(firstCurve: Curve2D, secondCurve: Curve2D, radius: number): Curve2D[];
+/**
+ * Insert a dogbone fillet at an inner corner for CNC milling clearance.
+ *
+ * Creates a circular arc that extends past the original corner so that a
+ * round end-mill of the given radius can fully reach the corner.
+ */
+export declare function dogboneFilletCurves(firstCurve: Curve2D, secondCurve: Curve2D, radius: number): Curve2D[];
+//# sourceMappingURL=customCorners.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"customCorners.d.ts","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/2d/lib/customCorners.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AA2IvC;;;;;;;;;;;GAWG;AACH,wBAAgB,YAAY,CAAC,UAAU,EAAE,OAAO,EAAE,WAAW,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,aAarF;AAED;;;;;GAKG;AACH,wBAAgB,aAAa,CAAC,UAAU,EAAE,OAAO,EAAE,WAAW,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,aAatF;AAED;;;;;GAKG;AACH,wBAAgB,mBAAmB,CAAC,UAAU,EAAE,OAAO,EAAE,WAAW,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,aA2E5F"}

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

@@ -0,0 +1,237 @@
+import { Curve2D } from './curve2D.js';
+import { isPoint2D } from './definitions.js';
+import { intersectCurves } from './intersections.js';
+import { unwrap, isOk } from '../../core/result.js';
+import { make2dArcFromCenter, make2dCircle, make2dSegmentCurve, make2dThreePointArc, } from './makeCurves.js';
+import { make2dOffset } from './offset.js';
+import { add2d, crossProduct2d, normalize2d, scalarMultiply2d } from './vectorOperations.js';
+/** Unwrap an intersection, discarding the common-segment curves the caller does not use. */
+function intersectionPoints(first, second) {
+    const result = unwrap(intersectCurves(first, second));
+    result.commonSegments.forEach((c) => {
+        c.delete();
+    });
+    return result.intersections;
+}
+/**
+ * Delete the split pieces the caller is discarding. `splitAt` returns the curve
+ * itself when there is nothing to split, so the source is never deleted here.
+ */
+function disposeSplitPieces(pieces, source, kept) {
+    pieces.forEach((piece) => {
+        if (piece !== source && piece !== kept)
+            piece.delete();
+    });
+}
+/**
+ * Run `split` and, if it throws, dispose the pieces an earlier split already
+ * produced. Splitting the second curve of a corner can fail (its parameter may
+ * not project onto the offset), stranding the first curve's pieces.
+ */
+function splitOrDiscard(split, earlier) {
+    try {
+        return split();
+    }
+    catch (e) {
+        disposeSplitPieces(earlier.pieces, earlier.source);
+        throw e;
+    }
+}
+/**
+ * Build the corner result, disposing the trimmed halves if the connecting curve
+ * cannot be built. They are unreachable once the error propagates.
+ */
+function discardTrimsOnError(firstCurve, secondCurve, first, second, build) {
+    try {
+        return build();
+    }
+    catch (e) {
+        if (first !== firstCurve)
+            first.delete();
+        if (second !== secondCurve)
+            second.delete();
+        throw e;
+    }
+}
+function removeCorner(firstCurve, secondCurve, radius) {
+    const sinAngle = crossProduct2d(firstCurve.tangentAt(1), secondCurve.tangentAt(0));
+    // This cover the case when the curves are colinear
+    if (Math.abs(sinAngle) < 1e-10)
+        return null;
+    const orientationCorrection = sinAngle > 0 ? -1 : 1;
+    const offset = Math.abs(radius) * orientationCorrection;
+    let firstOffset = null;
+    let secondOffset = null;
+    try {
+        firstOffset = make2dOffset(firstCurve, offset);
+        secondOffset = make2dOffset(secondCurve, offset);
+        if (!(firstOffset instanceof Curve2D) || !(secondOffset instanceof Curve2D)) {
+            return null;
+        }
+        const firstOffsetCurve = firstOffset;
+        const secondOffsetCurve = secondOffset;
+        const intersectionResult = intersectCurves(firstOffsetCurve, secondOffsetCurve, 1e-9);
+        if (!isOk(intersectionResult)) {
+            return null;
+        }
+        intersectionResult.value.commonSegments.forEach((c) => {
+            c.delete();
+        });
+        const potentialCenter = intersectionResult.value.intersections.at(-1);
+        if (!isPoint2D(potentialCenter)) {
+            return null;
+        }
+        const center = potentialCenter;
+        const splitForFillet = (curve, offsetCurve) => {
+            const [x, y] = offsetCurve.tangentAt(center);
+            const normal = normalize2d([-y, x]);
+            const splitPoint = add2d(center, scalarMultiply2d(normal, offset));
+            const splitParam = unwrap(curve.parameter(splitPoint, 1e-6));
+            return curve.splitAt([splitParam]);
+        };
+        const firstSplit = splitForFillet(firstCurve, firstOffsetCurve);
+        const secondSplit = splitOrDiscard(() => splitForFillet(secondCurve, secondOffsetCurve), {
+            pieces: firstSplit,
+            source: firstCurve,
+        });
+        const first = firstSplit[0];
+        const second = secondSplit[1];
+        // A radius that consumes a whole segment splits it at its own endpoint, so
+        // splitAt hands back the curve itself and there is no trimmed half to keep.
+        if (!first || !second) {
+            disposeSplitPieces(firstSplit, firstCurve);
+            disposeSplitPieces(secondSplit, secondCurve);
+            return null;
+        }
+        disposeSplitPieces(firstSplit, firstCurve, first);
+        disposeSplitPieces(secondSplit, secondCurve, second);
+        return { first, second, center };
+    }
+    finally {
+        if (firstOffset instanceof Curve2D)
+            firstOffset.delete();
+        if (secondOffset instanceof Curve2D)
+            secondOffset.delete();
+    }
+}
+/**
+ * Insert a circular fillet arc at the corner between two curves.
+ *
+ * Trims both curves and inserts a tangent arc of the given radius.
+ * Returns the original curves unmodified when they are collinear.
+ *
+ * @example
+ * ```ts
+ * const segments = filletCurves(line1, line2, 5);
+ * // [trimmedLine1, filletArc, trimmedLine2]
+ * ```
+ */
+export function filletCurves(firstCurve, secondCurve, radius) {
+    const cornerRemoved = removeCorner(firstCurve, secondCurve, radius);
+    if (!cornerRemoved) {
+        return [firstCurve, secondCurve];
+    }
+    const { first, second, center } = cornerRemoved;
+    return discardTrimsOnError(firstCurve, secondCurve, first, second, () => [
+        first,
+        make2dArcFromCenter(first.lastPoint, second.firstPoint, center),
+        second,
+    ]);
+}
+/**
+ * Insert a straight chamfer segment at the corner between two curves.
+ *
+ * Trims both curves and connects them with a line segment.
+ * Returns the original curves unmodified when they are collinear.
+ */
+export function chamferCurves(firstCurve, secondCurve, radius) {
+    const cornerRemoved = removeCorner(firstCurve, secondCurve, radius);
+    if (!cornerRemoved) {
+        return [firstCurve, secondCurve];
+    }
+    const { first, second } = cornerRemoved;
+    return discardTrimsOnError(firstCurve, secondCurve, first, second, () => [
+        first,
+        make2dSegmentCurve(first.lastPoint, second.firstPoint),
+        second,
+    ]);
+}
+/**
+ * Insert a dogbone fillet at an inner corner for CNC milling clearance.
+ *
+ * Creates a circular arc that extends past the original corner so that a
+ * round end-mill of the given radius can fully reach the corner.
+ */
+export function dogboneFilletCurves(firstCurve, secondCurve, radius) {
+    const tgt1 = normalize2d(firstCurve.tangentAt(1));
+    const tgt2 = normalize2d(secondCurve.tangentAt(0));
+    const sinAngle = crossProduct2d(tgt1, tgt2);
+    const a = Math.asin(sinAngle);
+    // This cover the case when the curves are colinear
+    if (Math.abs(sinAngle) < 1e-10)
+        return [firstCurve, secondCurve];
+    const orientationCorrection = sinAngle > 0 ? -1 : 1;
+    const offset = Math.abs(radius) * Math.sin(a / 2) * orientationCorrection;
+    let firstOffset = null;
+    let secondOffset = null;
+    let circle = null;
+    try {
+        firstOffset = make2dOffset(firstCurve, offset);
+        secondOffset = make2dOffset(secondCurve, offset);
+        if (!(firstOffset instanceof Curve2D) || !(secondOffset instanceof Curve2D)) {
+            return [firstCurve, secondCurve];
+        }
+        const intersectionResult2 = intersectCurves(firstOffset, secondOffset, 1e-9);
+        if (!isOk(intersectionResult2)) {
+            return [firstCurve, secondCurve];
+        }
+        intersectionResult2.value.commonSegments.forEach((c) => {
+            c.delete();
+        });
+        const potentialCenter = intersectionResult2.value.intersections.at(-1);
+        if (!isPoint2D(potentialCenter)) {
+            return [firstCurve, secondCurve];
+        }
+        circle = make2dCircle(radius, potentialCenter);
+        const firstInt = intersectionPoints(firstCurve, circle)[0];
+        const secondInt = intersectionPoints(secondCurve, circle).at(-1);
+        if (!firstInt || !secondInt)
+            return [firstCurve, secondCurve];
+        const firstSplit = firstCurve.splitAt([firstInt]);
+        const secondSplit = splitOrDiscard(() => secondCurve.splitAt([secondInt]), {
+            pieces: firstSplit,
+            source: firstCurve,
+        });
+        const firstPart = firstSplit[0];
+        const secondPart = secondSplit[secondSplit.length - 1];
+        if (!firstPart || !secondPart) {
+            disposeSplitPieces(firstSplit, firstCurve);
+            disposeSplitPieces(secondSplit, secondCurve);
+            return [firstCurve, secondCurve];
+        }
+        disposeSplitPieces(firstSplit, firstCurve, firstPart);
+        disposeSplitPieces(secondSplit, secondCurve, secondPart);
+        try {
+            return [
+                firstPart,
+                make2dThreePointArc(firstPart.lastPoint, firstCurve.lastPoint, secondPart.firstPoint),
+                secondPart,
+            ];
+        }
+        catch {
+            if (firstPart !== firstCurve)
+                firstPart.delete();
+            if (secondPart !== secondCurve)
+                secondPart.delete();
+            return [firstCurve, secondCurve];
+        }
+    }
+    finally {
+        if (firstOffset instanceof Curve2D)
+            firstOffset.delete();
+        if (secondOffset instanceof Curve2D)
+            secondOffset.delete();
+        circle?.delete();
+    }
+}
+//# sourceMappingURL=customCorners.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"customCorners.js","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/2d/lib/customCorners.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AAEvC,OAAO,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AAC7C,OAAO,EAAE,eAAe,EAAE,MAAM,oBAAoB,CAAC;AACrD,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,sBAAsB,CAAC;AACpD,OAAO,EACL,mBAAmB,EACnB,YAAY,EACZ,kBAAkB,EAClB,mBAAmB,GACpB,MAAM,iBAAiB,CAAC;AACzB,OAAO,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAC3C,OAAO,EAAE,KAAK,EAAE,cAAc,EAAE,WAAW,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AAE7F,4FAA4F;AAC5F,SAAS,kBAAkB,CAAC,KAAc,EAAE,MAAe;IACzD,MAAM,MAAM,GAAG,MAAM,CAAC,eAAe,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC;IACtD,MAAM,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QAClC,CAAC,CAAC,MAAM,EAAE,CAAC;IACb,CAAC,CAAC,CAAC;IACH,OAAO,MAAM,CAAC,aAAa,CAAC;AAC9B,CAAC;AAED;;;GAGG;AACH,SAAS,kBAAkB,CAAC,MAAiB,EAAE,MAAe,EAAE,IAAc;IAC5E,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;QACvB,IAAI,KAAK,KAAK,MAAM,IAAI,KAAK,KAAK,IAAI;YAAE,KAAK,CAAC,MAAM,EAAE,CAAC;IACzD,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;;GAIG;AACH,SAAS,cAAc,CACrB,KAAsB,EACtB,OAA+C;IAE/C,IAAI,CAAC;QACH,OAAO,KAAK,EAAE,CAAC;IACjB,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,kBAAkB,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;QACnD,MAAM,CAAC,CAAC;IACV,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,SAAS,mBAAmB,CAC1B,UAAmB,EACnB,WAAoB,EACpB,KAAc,EACd,MAAe,EACf,KAAsB;IAEtB,IAAI,CAAC;QACH,OAAO,KAAK,EAAE,CAAC;IACjB,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,IAAI,KAAK,KAAK,UAAU;YAAE,KAAK,CAAC,MAAM,EAAE,CAAC;QACzC,IAAI,MAAM,KAAK,WAAW;YAAE,MAAM,CAAC,MAAM,EAAE,CAAC;QAC5C,MAAM,CAAC,CAAC;IACV,CAAC;AACH,CAAC;AAED,SAAS,YAAY,CAAC,UAAmB,EAAE,WAAoB,EAAE,MAAc;IAC7E,MAAM,QAAQ,GAAG,cAAc,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAEnF,mDAAmD;IACnD,IAAI,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,KAAK;QAAE,OAAO,IAAI,CAAC;IAE5C,MAAM,qBAAqB,GAAG,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACpD,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,qBAAqB,CAAC;IAExD,IAAI,WAAW,GAA2C,IAAI,CAAC;IAC/D,IAAI,YAAY,GAA2C,IAAI,CAAC;IAEhE,IAAI,CAAC;QACH,WAAW,GAAG,YAAY,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;QAC/C,YAAY,GAAG,YAAY,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;QAEjD,IAAI,CAAC,CAAC,WAAW,YAAY,OAAO,CAAC,IAAI,CAAC,CAAC,YAAY,YAAY,OAAO,CAAC,EAAE,CAAC;YAC5E,OAAO,IAAI,CAAC;QACd,CAAC;QACD,MAAM,gBAAgB,GAAY,WAAW,CAAC;QAC9C,MAAM,iBAAiB,GAAY,YAAY,CAAC;QAEhD,MAAM,kBAAkB,GAAG,eAAe,CAAC,gBAAgB,EAAE,iBAAiB,EAAE,IAAI,CAAC,CAAC;QACtF,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,EAAE,CAAC;YAC9B,OAAO,IAAI,CAAC;QACd,CAAC;QACD,kBAAkB,CAAC,KAAK,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;YACpD,CAAC,CAAC,MAAM,EAAE,CAAC;QACb,CAAC,CAAC,CAAC;QAEH,MAAM,eAAe,GAAG,kBAAkB,CAAC,KAAK,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACtE,IAAI,CAAC,SAAS,CAAC,eAAe,CAAC,EAAE,CAAC;YAChC,OAAO,IAAI,CAAC;QACd,CAAC;QACD,MAAM,MAAM,GAAG,eAAe,CAAC;QAE/B,MAAM,cAAc,GAAG,CAAC,KAAc,EAAE,WAAoB,EAAE,EAAE;YAC9D,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,WAAW,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;YAC7C,MAAM,MAAM,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACpC,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,EAAE,gBAAgB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;YACnE,MAAM,UAAU,GAAG,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC,CAAC;YAC7D,OAAO,KAAK,CAAC,OAAO,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;QACrC,CAAC,CAAC;QAEF,MAAM,UAAU,GAAG,cAAc,CAAC,UAAU,EAAE,gBAAgB,CAAC,CAAC;QAChE,MAAM,WAAW,GAAG,cAAc,CAAC,GAAG,EAAE,CAAC,cAAc,CAAC,WAAW,EAAE,iBAAiB,CAAC,EAAE;YACvF,MAAM,EAAE,UAAU;YAClB,MAAM,EAAE,UAAU;SACnB,CAAC,CAAC;QACH,MAAM,KAAK,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,MAAM,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;QAE9B,2EAA2E;QAC3E,4EAA4E;QAC5E,IAAI,CAAC,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;YACtB,kBAAkB,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;YAC3C,kBAAkB,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;YAC7C,OAAO,IAAI,CAAC;QACd,CAAC;QAED,kBAAkB,CAAC,UAAU,EAAE,UAAU,EAAE,KAAK,CAAC,CAAC;QAClD,kBAAkB,CAAC,WAAW,EAAE,WAAW,EAAE,MAAM,CAAC,CAAC;QACrD,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC;IACnC,CAAC;YAAS,CAAC;QACT,IAAI,WAAW,YAAY,OAAO;YAAE,WAAW,CAAC,MAAM,EAAE,CAAC;QACzD,IAAI,YAAY,YAAY,OAAO;YAAE,YAAY,CAAC,MAAM,EAAE,CAAC;IAC7D,CAAC;AACH,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,YAAY,CAAC,UAAmB,EAAE,WAAoB,EAAE,MAAc;IACpF,MAAM,aAAa,GAAG,YAAY,CAAC,UAAU,EAAE,WAAW,EAAE,MAAM,CAAC,CAAC;IACpE,IAAI,CAAC,aAAa,EAAE,CAAC;QACnB,OAAO,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC;IACnC,CAAC;IAED,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,aAAa,CAAC;IAEhD,OAAO,mBAAmB,CAAC,UAAU,EAAE,WAAW,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC;QACvE,KAAK;QACL,mBAAmB,CAAC,KAAK,CAAC,SAAS,EAAE,MAAM,CAAC,UAAU,EAAE,MAAM,CAAC;QAC/D,MAAM;KACP,CAAC,CAAC;AACL,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,aAAa,CAAC,UAAmB,EAAE,WAAoB,EAAE,MAAc;IACrF,MAAM,aAAa,GAAG,YAAY,CAAC,UAAU,EAAE,WAAW,EAAE,MAAM,CAAC,CAAC;IACpE,IAAI,CAAC,aAAa,EAAE,CAAC;QACnB,OAAO,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC;IACnC,CAAC;IAED,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,aAAa,CAAC;IAExC,OAAO,mBAAmB,CAAC,UAAU,EAAE,WAAW,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC;QACvE,KAAK;QACL,kBAAkB,CAAC,KAAK,CAAC,SAAS,EAAE,MAAM,CAAC,UAAU,CAAC;QACtD,MAAM;KACP,CAAC,CAAC;AACL,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,mBAAmB,CAAC,UAAmB,EAAE,WAAoB,EAAE,MAAc;IAC3F,MAAM,IAAI,GAAG,WAAW,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAClD,MAAM,IAAI,GAAG,WAAW,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAEnD,MAAM,QAAQ,GAAG,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAC5C,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC9B,mDAAmD;IACnD,IAAI,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,KAAK;QAAE,OAAO,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC;IACjE,MAAM,qBAAqB,GAAG,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEpD,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,qBAAqB,CAAC;IAE1E,IAAI,WAAW,GAA2C,IAAI,CAAC;IAC/D,IAAI,YAAY,GAA2C,IAAI,CAAC;IAChE,IAAI,MAAM,GAAmB,IAAI,CAAC;IAElC,IAAI,CAAC;QACH,WAAW,GAAG,YAAY,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;QAC/C,YAAY,GAAG,YAAY,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;QAEjD,IAAI,CAAC,CAAC,WAAW,YAAY,OAAO,CAAC,IAAI,CAAC,CAAC,YAAY,YAAY,OAAO,CAAC,EAAE,CAAC;YAC5E,OAAO,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC;QACnC,CAAC;QAED,MAAM,mBAAmB,GAAG,eAAe,CAAC,WAAW,EAAE,YAAY,EAAE,IAAI,CAAC,CAAC;QAC7E,IAAI,CAAC,IAAI,CAAC,mBAAmB,CAAC,EAAE,CAAC;YAC/B,OAAO,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC;QACnC,CAAC;QACD,mBAAmB,CAAC,KAAK,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;YACrD,CAAC,CAAC,MAAM,EAAE,CAAC;QACb,CAAC,CAAC,CAAC;QACH,MAAM,eAAe,GAAG,mBAAmB,CAAC,KAAK,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACvE,IAAI,CAAC,SAAS,CAAC,eAAe,CAAC,EAAE,CAAC;YAChC,OAAO,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC;QACnC,CAAC;QAED,MAAM,GAAG,YAAY,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;QAC/C,MAAM,QAAQ,GAAG,kBAAkB,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3D,MAAM,SAAS,GAAG,kBAAkB,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAEjE,IAAI,CAAC,QAAQ,IAAI,CAAC,SAAS;YAAE,OAAO,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC;QAE9D,MAAM,UAAU,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;QAClD,MAAM,WAAW,GAAG,cAAc,CAAC,GAAG,EAAE,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE;YACzE,MAAM,EAAE,UAAU;YAClB,MAAM,EAAE,UAAU;SACnB,CAAC,CAAC;QACH,MAAM,SAAS,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,UAAU,GAAG,WAAW,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAEvD,IAAI,CAAC,SAAS,IAAI,CAAC,UAAU,EAAE,CAAC;YAC9B,kBAAkB,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;YAC3C,kBAAkB,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;YAC7C,OAAO,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC;QACnC,CAAC;QAED,kBAAkB,CAAC,UAAU,EAAE,UAAU,EAAE,SAAS,CAAC,CAAC;QACtD,kBAAkB,CAAC,WAAW,EAAE,WAAW,EAAE,UAAU,CAAC,CAAC;QAEzD,IAAI,CAAC;YACH,OAAO;gBACL,SAAS;gBACT,mBAAmB,CAAC,SAAS,CAAC,SAAS,EAAE,UAAU,CAAC,SAAS,EAAE,UAAU,CAAC,UAAU,CAAC;gBACrF,UAAU;aACX,CAAC;QACJ,CAAC;QAAC,MAAM,CAAC;YACP,IAAI,SAAS,KAAK,UAAU;gBAAE,SAAS,CAAC,MAAM,EAAE,CAAC;YACjD,IAAI,UAAU,KAAK,WAAW;gBAAE,UAAU,CAAC,MAAM,EAAE,CAAC;YACpD,OAAO,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC;QACnC,CAAC;IACH,CAAC;YAAS,CAAC;QACT,IAAI,WAAW,YAAY,OAAO;YAAE,WAAW,CAAC,MAAM,EAAE,CAAC;QACzD,IAAI,YAAY,YAAY,OAAO;YAAE,YAAY,CAAC,MAAM,EAAE,CAAC;QAC3D,MAAM,EAAE,MAAM,EAAE,CAAC;IACnB,CAAC;AACH,CAAC","sourcesContent":["import { Curve2D } from './curve2D.js';\nimport type { Point2D } from './definitions.js';\nimport { isPoint2D } from './definitions.js';\nimport { intersectCurves } from './intersections.js';\nimport { unwrap, isOk } from '../../core/result.js';\nimport {\n  make2dArcFromCenter,\n  make2dCircle,\n  make2dSegmentCurve,\n  make2dThreePointArc,\n} from './makeCurves.js';\nimport { make2dOffset } from './offset.js';\nimport { add2d, crossProduct2d, normalize2d, scalarMultiply2d } from './vectorOperations.js';\n\n/** Unwrap an intersection, discarding the common-segment curves the caller does not use. */\nfunction intersectionPoints(first: Curve2D, second: Curve2D): Point2D[] {\n  const result = unwrap(intersectCurves(first, second));\n  result.commonSegments.forEach((c) => {\n    c.delete();\n  });\n  return result.intersections;\n}\n\n/**\n * Delete the split pieces the caller is discarding. `splitAt` returns the curve\n * itself when there is nothing to split, so the source is never deleted here.\n */\nfunction disposeSplitPieces(pieces: Curve2D[], source: Curve2D, kept?: Curve2D): void {\n  pieces.forEach((piece) => {\n    if (piece !== source && piece !== kept) piece.delete();\n  });\n}\n\n/**\n * Run `split` and, if it throws, dispose the pieces an earlier split already\n * produced. Splitting the second curve of a corner can fail (its parameter may\n * not project onto the offset), stranding the first curve's pieces.\n */\nfunction splitOrDiscard(\n  split: () => Curve2D[],\n  earlier: { pieces: Curve2D[]; source: Curve2D }\n): Curve2D[] {\n  try {\n    return split();\n  } catch (e) {\n    disposeSplitPieces(earlier.pieces, earlier.source);\n    throw e;\n  }\n}\n\n/**\n * Build the corner result, disposing the trimmed halves if the connecting curve\n * cannot be built. They are unreachable once the error propagates.\n */\nfunction discardTrimsOnError(\n  firstCurve: Curve2D,\n  secondCurve: Curve2D,\n  first: Curve2D,\n  second: Curve2D,\n  build: () => Curve2D[]\n): Curve2D[] {\n  try {\n    return build();\n  } catch (e) {\n    if (first !== firstCurve) first.delete();\n    if (second !== secondCurve) second.delete();\n    throw e;\n  }\n}\n\nfunction removeCorner(firstCurve: Curve2D, secondCurve: Curve2D, radius: number) {\n  const sinAngle = crossProduct2d(firstCurve.tangentAt(1), secondCurve.tangentAt(0));\n\n  // This cover the case when the curves are colinear\n  if (Math.abs(sinAngle) < 1e-10) return null;\n\n  const orientationCorrection = sinAngle > 0 ? -1 : 1;\n  const offset = Math.abs(radius) * orientationCorrection;\n\n  let firstOffset: ReturnType<typeof make2dOffset> | null = null;\n  let secondOffset: ReturnType<typeof make2dOffset> | null = null;\n\n  try {\n    firstOffset = make2dOffset(firstCurve, offset);\n    secondOffset = make2dOffset(secondCurve, offset);\n\n    if (!(firstOffset instanceof Curve2D) || !(secondOffset instanceof Curve2D)) {\n      return null;\n    }\n    const firstOffsetCurve: Curve2D = firstOffset;\n    const secondOffsetCurve: Curve2D = secondOffset;\n\n    const intersectionResult = intersectCurves(firstOffsetCurve, secondOffsetCurve, 1e-9);\n    if (!isOk(intersectionResult)) {\n      return null;\n    }\n    intersectionResult.value.commonSegments.forEach((c) => {\n      c.delete();\n    });\n\n    const potentialCenter = intersectionResult.value.intersections.at(-1);\n    if (!isPoint2D(potentialCenter)) {\n      return null;\n    }\n    const center = potentialCenter;\n\n    const splitForFillet = (curve: Curve2D, offsetCurve: Curve2D) => {\n      const [x, y] = offsetCurve.tangentAt(center);\n      const normal = normalize2d([-y, x]);\n      const splitPoint = add2d(center, scalarMultiply2d(normal, offset));\n      const splitParam = unwrap(curve.parameter(splitPoint, 1e-6));\n      return curve.splitAt([splitParam]);\n    };\n\n    const firstSplit = splitForFillet(firstCurve, firstOffsetCurve);\n    const secondSplit = splitOrDiscard(() => splitForFillet(secondCurve, secondOffsetCurve), {\n      pieces: firstSplit,\n      source: firstCurve,\n    });\n    const first = firstSplit[0];\n    const second = secondSplit[1];\n\n    // A radius that consumes a whole segment splits it at its own endpoint, so\n    // splitAt hands back the curve itself and there is no trimmed half to keep.\n    if (!first || !second) {\n      disposeSplitPieces(firstSplit, firstCurve);\n      disposeSplitPieces(secondSplit, secondCurve);\n      return null;\n    }\n\n    disposeSplitPieces(firstSplit, firstCurve, first);\n    disposeSplitPieces(secondSplit, secondCurve, second);\n    return { first, second, center };\n  } finally {\n    if (firstOffset instanceof Curve2D) firstOffset.delete();\n    if (secondOffset instanceof Curve2D) secondOffset.delete();\n  }\n}\n\n/**\n * Insert a circular fillet arc at the corner between two curves.\n *\n * Trims both curves and inserts a tangent arc of the given radius.\n * Returns the original curves unmodified when they are collinear.\n *\n * @example\n * ```ts\n * const segments = filletCurves(line1, line2, 5);\n * // [trimmedLine1, filletArc, trimmedLine2]\n * ```\n */\nexport function filletCurves(firstCurve: Curve2D, secondCurve: Curve2D, radius: number) {\n  const cornerRemoved = removeCorner(firstCurve, secondCurve, radius);\n  if (!cornerRemoved) {\n    return [firstCurve, secondCurve];\n  }\n\n  const { first, second, center } = cornerRemoved;\n\n  return discardTrimsOnError(firstCurve, secondCurve, first, second, () => [\n    first,\n    make2dArcFromCenter(first.lastPoint, second.firstPoint, center),\n    second,\n  ]);\n}\n\n/**\n * Insert a straight chamfer segment at the corner between two curves.\n *\n * Trims both curves and connects them with a line segment.\n * Returns the original curves unmodified when they are collinear.\n */\nexport function chamferCurves(firstCurve: Curve2D, secondCurve: Curve2D, radius: number) {\n  const cornerRemoved = removeCorner(firstCurve, secondCurve, radius);\n  if (!cornerRemoved) {\n    return [firstCurve, secondCurve];\n  }\n\n  const { first, second } = cornerRemoved;\n\n  return discardTrimsOnError(firstCurve, secondCurve, first, second, () => [\n    first,\n    make2dSegmentCurve(first.lastPoint, second.firstPoint),\n    second,\n  ]);\n}\n\n/**\n * Insert a dogbone fillet at an inner corner for CNC milling clearance.\n *\n * Creates a circular arc that extends past the original corner so that a\n * round end-mill of the given radius can fully reach the corner.\n */\nexport function dogboneFilletCurves(firstCurve: Curve2D, secondCurve: Curve2D, radius: number) {\n  const tgt1 = normalize2d(firstCurve.tangentAt(1));\n  const tgt2 = normalize2d(secondCurve.tangentAt(0));\n\n  const sinAngle = crossProduct2d(tgt1, tgt2);\n  const a = Math.asin(sinAngle);\n  // This cover the case when the curves are colinear\n  if (Math.abs(sinAngle) < 1e-10) return [firstCurve, secondCurve];\n  const orientationCorrection = sinAngle > 0 ? -1 : 1;\n\n  const offset = Math.abs(radius) * Math.sin(a / 2) * orientationCorrection;\n\n  let firstOffset: ReturnType<typeof make2dOffset> | null = null;\n  let secondOffset: ReturnType<typeof make2dOffset> | null = null;\n  let circle: Curve2D | null = null;\n\n  try {\n    firstOffset = make2dOffset(firstCurve, offset);\n    secondOffset = make2dOffset(secondCurve, offset);\n\n    if (!(firstOffset instanceof Curve2D) || !(secondOffset instanceof Curve2D)) {\n      return [firstCurve, secondCurve];\n    }\n\n    const intersectionResult2 = intersectCurves(firstOffset, secondOffset, 1e-9);\n    if (!isOk(intersectionResult2)) {\n      return [firstCurve, secondCurve];\n    }\n    intersectionResult2.value.commonSegments.forEach((c) => {\n      c.delete();\n    });\n    const potentialCenter = intersectionResult2.value.intersections.at(-1);\n    if (!isPoint2D(potentialCenter)) {\n      return [firstCurve, secondCurve];\n    }\n\n    circle = make2dCircle(radius, potentialCenter);\n    const firstInt = intersectionPoints(firstCurve, circle)[0];\n    const secondInt = intersectionPoints(secondCurve, circle).at(-1);\n\n    if (!firstInt || !secondInt) return [firstCurve, secondCurve];\n\n    const firstSplit = firstCurve.splitAt([firstInt]);\n    const secondSplit = splitOrDiscard(() => secondCurve.splitAt([secondInt]), {\n      pieces: firstSplit,\n      source: firstCurve,\n    });\n    const firstPart = firstSplit[0];\n    const secondPart = secondSplit[secondSplit.length - 1];\n\n    if (!firstPart || !secondPart) {\n      disposeSplitPieces(firstSplit, firstCurve);\n      disposeSplitPieces(secondSplit, secondCurve);\n      return [firstCurve, secondCurve];\n    }\n\n    disposeSplitPieces(firstSplit, firstCurve, firstPart);\n    disposeSplitPieces(secondSplit, secondCurve, secondPart);\n\n    try {\n      return [\n        firstPart,\n        make2dThreePointArc(firstPart.lastPoint, firstCurve.lastPoint, secondPart.firstPoint),\n        secondPart,\n      ];\n    } catch {\n      if (firstPart !== firstCurve) firstPart.delete();\n      if (secondPart !== secondCurve) secondPart.delete();\n      return [firstCurve, secondCurve];\n    }\n  } finally {\n    if (firstOffset instanceof Curve2D) firstOffset.delete();\n    if (secondOffset instanceof Curve2D) secondOffset.delete();\n    circle?.delete();\n  }\n}\n"]}

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

@@ -0,0 +1,12 @@
+import type { Point2D } from '../../utils/vec2d.js';
+/** A 2D point or vector represented as an `[x, y]` tuple. */
+export type { Point2D } from '../../utils/vec2d.js';
+/** Type guard that checks whether a value is a `Point2D`. */
+export declare function isPoint2D(point: unknown): point is Point2D;
+/** A 2x2 matrix represented as two row tuples. */
+export type Matrix2X2 = [[number, number], [number, number]];
+/**
+ * Type guard that checks whether a value is a `Matrix2X2`.
+ */
+export declare function isMatrix2X2(matrix: unknown): matrix is Matrix2X2;
+//# sourceMappingURL=definitions.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"definitions.d.ts","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/2d/lib/definitions.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,sBAAsB,CAAC;AAEpD,6DAA6D;AAC7D,YAAY,EAAE,OAAO,EAAE,MAAM,sBAAsB,CAAC;AAEpD,6DAA6D;AAC7D,wBAAgB,SAAS,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,OAAO,CAO1D;AAED,kDAAkD;AAClD,MAAM,MAAM,SAAS,GAAG,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;AAE7D;;GAEG;AACH,wBAAgB,WAAW,CAAC,MAAM,EAAE,OAAO,GAAG,MAAM,IAAI,SAAS,CAYhE"}

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

@@ -0,0 +1,19 @@
+/** Type guard that checks whether a value is a `Point2D`. */
+export function isPoint2D(point) {
+    return (Array.isArray(point) &&
+        point.length === 2 &&
+        typeof point[0] === 'number' &&
+        typeof point[1] === 'number');
+}
+/**
+ * Type guard that checks whether a value is a `Matrix2X2`.
+ */
+export function isMatrix2X2(matrix) {
+    return (Array.isArray(matrix) &&
+        matrix.length === 2 &&
+        matrix.every((row) => Array.isArray(row) &&
+            row.length === 2 &&
+            typeof row[0] === 'number' &&
+            typeof row[1] === 'number'));
+}
+//# sourceMappingURL=definitions.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"definitions.js","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/2d/lib/definitions.ts"],"names":[],"mappings":"AAKA,6DAA6D;AAC7D,MAAM,UAAU,SAAS,CAAC,KAAc;IACtC,OAAO,CACL,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QACpB,KAAK,CAAC,MAAM,KAAK,CAAC;QAClB,OAAO,KAAK,CAAC,CAAC,CAAC,KAAK,QAAQ;QAC5B,OAAO,KAAK,CAAC,CAAC,CAAC,KAAK,QAAQ,CAC7B,CAAC;AACJ,CAAC;AAKD;;GAEG;AACH,MAAM,UAAU,WAAW,CAAC,MAAe;IACzC,OAAO,CACL,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;QACrB,MAAM,CAAC,MAAM,KAAK,CAAC;QACnB,MAAM,CAAC,KAAK,CACV,CAAC,GAAG,EAAE,EAAE,CACN,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC;YAClB,GAAG,CAAC,MAAM,KAAK,CAAC;YAChB,OAAO,GAAG,CAAC,CAAC,CAAC,KAAK,QAAQ;YAC1B,OAAO,GAAG,CAAC,CAAC,CAAC,KAAK,QAAQ,CAC7B,CACF,CAAC;AACJ,CAAC","sourcesContent":["import type { Point2D } from '../../utils/vec2d.js';\n\n/** A 2D point or vector represented as an `[x, y]` tuple. */\nexport type { Point2D } from '../../utils/vec2d.js';\n\n/** Type guard that checks whether a value is a `Point2D`. */\nexport function isPoint2D(point: unknown): point is Point2D {\n  return (\n    Array.isArray(point) &&\n    point.length === 2 &&\n    typeof point[0] === 'number' &&\n    typeof point[1] === 'number'\n  );\n}\n\n/** A 2x2 matrix represented as two row tuples. */\nexport type Matrix2X2 = [[number, number], [number, number]];\n\n/**\n * Type guard that checks whether a value is a `Matrix2X2`.\n */\nexport function isMatrix2X2(matrix: unknown): matrix is Matrix2X2 {\n  return (\n    Array.isArray(matrix) &&\n    matrix.length === 2 &&\n    matrix.every(\n      (row) =>\n        Array.isArray(row) &&\n        row.length === 2 &&\n        typeof row[0] === 'number' &&\n        typeof row[1] === 'number'\n    )\n  );\n}\n"]}

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

@@ -0,0 +1,21 @@
+/**
+ * SVG F.6.5 endpoint parameterization for elliptical arcs: given the two
+ * endpoints, an interior on-arc sample, and the ellipse frame (radii + x-axis
+ * rotation), recover which of the candidate arcs the curve traces. Trimmed
+ * curve bounds cannot decide this — occt-wasm reports them normalized to
+ * [0, 1], not as angles — so the flags must come from geometry.
+ */
+type Pt = readonly [number, number];
+/**
+ * Derive elliptical-arc flags from endpoints and an interior on-arc sample:
+ * `largeArc` when the traced sweep exceeds half a revolution, `ccw` when the
+ * arc runs counterclockwise from `from` to `to`. Returns null when the
+ * endpoints coincide (a closed loop or degenerate arc; the caller decides how
+ * to emit those).
+ */
+export declare function ellipseArcFlags(from: Pt, to: Pt, onArc: Pt, majorRadius: number, minorRadius: number, xAxisAngle: number): {
+    largeArc: boolean;
+    ccw: boolean;
+} | null;
+export {};
+//# sourceMappingURL=ellipseArcFlags.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"ellipseArcFlags.d.ts","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/2d/lib/ellipseArcFlags.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,KAAK,EAAE,GAAG,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;AAQpC;;;;;;GAMG;AACH,wBAAgB,eAAe,CAC7B,IAAI,EAAE,EAAE,EACR,EAAE,EAAE,EAAE,EACN,KAAK,EAAE,EAAE,EACT,WAAW,EAAE,MAAM,EACnB,WAAW,EAAE,MAAM,EACnB,UAAU,EAAE,MAAM,GACjB;IAAE,QAAQ,EAAE,OAAO,CAAC;IAAC,GAAG,EAAE,OAAO,CAAA;CAAE,GAAG,IAAI,CAgD5C"}

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

@@ -0,0 +1,71 @@
+/**
+ * SVG F.6.5 endpoint parameterization for elliptical arcs: given the two
+ * endpoints, an interior on-arc sample, and the ellipse frame (radii + x-axis
+ * rotation), recover which of the candidate arcs the curve traces. Trimmed
+ * curve bounds cannot decide this — occt-wasm reports them normalized to
+ * [0, 1], not as angles — so the flags must come from geometry.
+ */
+function rotInto(p, phi) {
+    const c = Math.cos(phi);
+    const s = Math.sin(phi);
+    return [c * p[0] + s * p[1], -s * p[0] + c * p[1]];
+}
+/**
+ * Derive elliptical-arc flags from endpoints and an interior on-arc sample:
+ * `largeArc` when the traced sweep exceeds half a revolution, `ccw` when the
+ * arc runs counterclockwise from `from` to `to`. Returns null when the
+ * endpoints coincide (a closed loop or degenerate arc; the caller decides how
+ * to emit those).
+ */
+export function ellipseArcFlags(from, to, onArc, majorRadius, minorRadius, xAxisAngle) {
+    let a = majorRadius;
+    let b = minorRadius;
+    const f = rotInto(from, xAxisAngle);
+    const l = rotInto(to, xAxisAngle);
+    const m = rotInto(onArc, xAxisAngle);
+    const hx = (f[0] - l[0]) / 2;
+    const hy = (f[1] - l[1]) / 2;
+    const lam = (hx * hx) / (a * a) + (hy * hy) / (b * b);
+    // lam is the squared half-chord in normalized ellipse coordinates, so this
+    // degeneracy cutoff tracks the radii rather than the drawing's absolute
+    // scale (chord below ~1e-9 of the radius reads as coincident endpoints).
+    if (lam < 1e-18)
+        return null;
+    // F.6.6 correction: scale the radii up when the chord cannot fit them.
+    if (lam > 1) {
+        const s = Math.sqrt(lam);
+        a *= s;
+        b *= s;
+    }
+    const num = a * a * b * b - a * a * hy * hy - b * b * hx * hx;
+    // den is zero only when both half-chord components are (the lam guard above
+    // already excluded that), so an exact-zero check suffices: any absolute
+    // threshold here would misclassify valid arcs on small-radius ellipses.
+    const den = a * a * hy * hy + b * b * hx * hx;
+    if (den === 0)
+        return null;
+    const coef = Math.sqrt(Math.max(0, num / den));
+    const mx = (f[0] + l[0]) / 2;
+    const my = (f[1] + l[1]) / 2;
+    const candidates = [
+        [mx + (coef * a * hy) / b, my - (coef * b * hx) / a],
+        [mx - (coef * a * hy) / b, my + (coef * b * hx) / a],
+    ];
+    // The interior sample lies on exactly one candidate ellipse (up to numeric
+    // residual); that candidate is the true center.
+    const residual = (c) => {
+        const dx = (m[0] - c[0]) / a;
+        const dy = (m[1] - c[1]) / b;
+        return Math.abs(dx * dx + dy * dy - 1);
+    };
+    const center = residual(candidates[0]) <= residual(candidates[1]) ? candidates[0] : candidates[1];
+    const theta = (p) => Math.atan2((p[1] - center[1]) / b, (p[0] - center[0]) / a);
+    const tau = 2 * Math.PI;
+    const tf = theta(f);
+    const tm = (((theta(m) - tf) % tau) + tau) % tau;
+    const tl = (((theta(l) - tf) % tau) + tau) % tau;
+    const ccw = tm < tl;
+    const sweep = ccw ? tl : tau - tl;
+    return { largeArc: sweep > Math.PI, ccw };
+}
+//# sourceMappingURL=ellipseArcFlags.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"ellipseArcFlags.js","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/2d/lib/ellipseArcFlags.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAIH,SAAS,OAAO,CAAC,CAAK,EAAE,GAAW;IACjC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACxB,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACxB,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACrD,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,eAAe,CAC7B,IAAQ,EACR,EAAM,EACN,KAAS,EACT,WAAmB,EACnB,WAAmB,EACnB,UAAkB;IAElB,IAAI,CAAC,GAAG,WAAW,CAAC;IACpB,IAAI,CAAC,GAAG,WAAW,CAAC;IACpB,MAAM,CAAC,GAAG,OAAO,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;IACpC,MAAM,CAAC,GAAG,OAAO,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;IAClC,MAAM,CAAC,GAAG,OAAO,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;IACrC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC7B,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC7B,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACtD,2EAA2E;IAC3E,wEAAwE;IACxE,yEAAyE;IACzE,IAAI,GAAG,GAAG,KAAK;QAAE,OAAO,IAAI,CAAC;IAC7B,uEAAuE;IACvE,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;QACZ,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACzB,CAAC,IAAI,CAAC,CAAC;QACP,CAAC,IAAI,CAAC,CAAC;IACT,CAAC;IACD,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC;IAC9D,4EAA4E;IAC5E,wEAAwE;IACxE,wEAAwE;IACxE,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC;IAC9C,IAAI,GAAG,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAC3B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC;IAC/C,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC7B,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC7B,MAAM,UAAU,GAAsB;QACpC,CAAC,EAAE,GAAG,CAAC,IAAI,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;QACpD,CAAC,EAAE,GAAG,CAAC,IAAI,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;KACrD,CAAC;IACF,2EAA2E;IAC3E,gDAAgD;IAChD,MAAM,QAAQ,GAAG,CAAC,CAAK,EAAU,EAAE;QACjC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAC7B,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAC7B,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IACzC,CAAC,CAAC;IACF,MAAM,MAAM,GAAG,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IAClG,MAAM,KAAK,GAAG,CAAC,CAAK,EAAU,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC5F,MAAM,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;IACxB,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IACpB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC;IACjD,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC;IACjD,MAAM,GAAG,GAAG,EAAE,GAAG,EAAE,CAAC;IACpB,MAAM,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC;IAClC,OAAO,EAAE,QAAQ,EAAE,KAAK,GAAG,IAAI,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC;AAC5C,CAAC","sourcesContent":["/**\n * SVG F.6.5 endpoint parameterization for elliptical arcs: given the two\n * endpoints, an interior on-arc sample, and the ellipse frame (radii + x-axis\n * rotation), recover which of the candidate arcs the curve traces. Trimmed\n * curve bounds cannot decide this — occt-wasm reports them normalized to\n * [0, 1], not as angles — so the flags must come from geometry.\n */\n\ntype Pt = readonly [number, number];\n\nfunction rotInto(p: Pt, phi: number): Pt {\n  const c = Math.cos(phi);\n  const s = Math.sin(phi);\n  return [c * p[0] + s * p[1], -s * p[0] + c * p[1]];\n}\n\n/**\n * Derive elliptical-arc flags from endpoints and an interior on-arc sample:\n * `largeArc` when the traced sweep exceeds half a revolution, `ccw` when the\n * arc runs counterclockwise from `from` to `to`. Returns null when the\n * endpoints coincide (a closed loop or degenerate arc; the caller decides how\n * to emit those).\n */\nexport function ellipseArcFlags(\n  from: Pt,\n  to: Pt,\n  onArc: Pt,\n  majorRadius: number,\n  minorRadius: number,\n  xAxisAngle: number\n): { largeArc: boolean; ccw: boolean } | null {\n  let a = majorRadius;\n  let b = minorRadius;\n  const f = rotInto(from, xAxisAngle);\n  const l = rotInto(to, xAxisAngle);\n  const m = rotInto(onArc, xAxisAngle);\n  const hx = (f[0] - l[0]) / 2;\n  const hy = (f[1] - l[1]) / 2;\n  const lam = (hx * hx) / (a * a) + (hy * hy) / (b * b);\n  // lam is the squared half-chord in normalized ellipse coordinates, so this\n  // degeneracy cutoff tracks the radii rather than the drawing's absolute\n  // scale (chord below ~1e-9 of the radius reads as coincident endpoints).\n  if (lam < 1e-18) return null;\n  // F.6.6 correction: scale the radii up when the chord cannot fit them.\n  if (lam > 1) {\n    const s = Math.sqrt(lam);\n    a *= s;\n    b *= s;\n  }\n  const num = a * a * b * b - a * a * hy * hy - b * b * hx * hx;\n  // den is zero only when both half-chord components are (the lam guard above\n  // already excluded that), so an exact-zero check suffices: any absolute\n  // threshold here would misclassify valid arcs on small-radius ellipses.\n  const den = a * a * hy * hy + b * b * hx * hx;\n  if (den === 0) return null;\n  const coef = Math.sqrt(Math.max(0, num / den));\n  const mx = (f[0] + l[0]) / 2;\n  const my = (f[1] + l[1]) / 2;\n  const candidates: readonly [Pt, Pt] = [\n    [mx + (coef * a * hy) / b, my - (coef * b * hx) / a],\n    [mx - (coef * a * hy) / b, my + (coef * b * hx) / a],\n  ];\n  // The interior sample lies on exactly one candidate ellipse (up to numeric\n  // residual); that candidate is the true center.\n  const residual = (c: Pt): number => {\n    const dx = (m[0] - c[0]) / a;\n    const dy = (m[1] - c[1]) / b;\n    return Math.abs(dx * dx + dy * dy - 1);\n  };\n  const center = residual(candidates[0]) <= residual(candidates[1]) ? candidates[0] : candidates[1];\n  const theta = (p: Pt): number => Math.atan2((p[1] - center[1]) / b, (p[0] - center[0]) / a);\n  const tau = 2 * Math.PI;\n  const tf = theta(f);\n  const tm = (((theta(m) - tf) % tau) + tau) % tau;\n  const tl = (((theta(l) - tf) % tau) + tau) % tau;\n  const ccw = tm < tl;\n  const sweep = ccw ? tl : tau - tl;\n  return { largeArc: sweep > Math.PI, ccw };\n}\n"]}

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

@@ -0,0 +1,14 @@
+export * from './precision.js';
+export * from './definitions.js';
+export * from './approximations.js';
+export * from './boundingBox2d.js';
+export * from './vectorOperations.js';
+export * from './intersections.js';
+export * from './curve2D.js';
+export * from './customCorners.js';
+export * from './makeCurves.js';
+export * from './utils.js';
+export * from './offset.js';
+export * from './stitching.js';
+export * from './svgPath.js';
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/2d/lib/index.ts"],"names":[],"mappings":"AAAA,cAAc,gBAAgB,CAAC;AAC/B,cAAc,kBAAkB,CAAC;AACjC,cAAc,qBAAqB,CAAC;AACpC,cAAc,oBAAoB,CAAC;AACnC,cAAc,uBAAuB,CAAC;AACtC,cAAc,oBAAoB,CAAC;AACnC,cAAc,cAAc,CAAC;AAC7B,cAAc,oBAAoB,CAAC;AACnC,cAAc,iBAAiB,CAAC;AAChC,cAAc,YAAY,CAAC;AAC3B,cAAc,aAAa,CAAC;AAC5B,cAAc,gBAAgB,CAAC;AAC/B,cAAc,cAAc,CAAC"}

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

@@ -0,0 +1,14 @@
+export * from './precision.js';
+export * from './definitions.js';
+export * from './approximations.js';
+export * from './boundingBox2d.js';
+export * from './vectorOperations.js';
+export * from './intersections.js';
+export * from './curve2D.js';
+export * from './customCorners.js';
+export * from './makeCurves.js';
+export * from './utils.js';
+export * from './offset.js';
+export * from './stitching.js';
+export * from './svgPath.js';
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/2d/lib/index.ts"],"names":[],"mappings":"AAAA,cAAc,gBAAgB,CAAC;AAC/B,cAAc,kBAAkB,CAAC;AACjC,cAAc,qBAAqB,CAAC;AACpC,cAAc,oBAAoB,CAAC;AACnC,cAAc,uBAAuB,CAAC;AACtC,cAAc,oBAAoB,CAAC;AACnC,cAAc,cAAc,CAAC;AAC7B,cAAc,oBAAoB,CAAC;AACnC,cAAc,iBAAiB,CAAC;AAChC,cAAc,YAAY,CAAC;AAC3B,cAAc,aAAa,CAAC;AAC5B,cAAc,gBAAgB,CAAC;AAC/B,cAAc,cAAc,CAAC","sourcesContent":["export * from './precision.js';\nexport * from './definitions.js';\nexport * from './approximations.js';\nexport * from './boundingBox2d.js';\nexport * from './vectorOperations.js';\nexport * from './intersections.js';\nexport * from './curve2D.js';\nexport * from './customCorners.js';\nexport * from './makeCurves.js';\nexport * from './utils.js';\nexport * from './offset.js';\nexport * from './stitching.js';\nexport * from './svgPath.js';\n"]}