@faicad/faijs 0.13.0

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

@@ -0,0 +1,16 @@
+import Blueprint from './blueprint.js';
+import CompoundBlueprint from './compoundBlueprint.js';
+import Blueprints from './blueprints.js';
+import type { DrawingInterface } from './lib.js';
+import { organiseBlueprints } from './lib.js';
+import type { ScaleMode } from '../../2d/curves.js';
+import offset from './blueprintOffset.js';
+export { Blueprint, CompoundBlueprint, Blueprints, organiseBlueprints, offset };
+export type { DrawingInterface, ScaleMode };
+export * from './cannedBlueprints.js';
+export * from './booleanOperations.js';
+export * from './boolean2D.js';
+export * from './blueprintApproximations.js';
+export * from './blueprintOffset.js';
+export * from './blueprintCustomCorners.js';
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/2d/blueprints/index.ts"],"names":[],"mappings":"AAAA,OAAO,SAAS,MAAM,gBAAgB,CAAC;AACvC,OAAO,iBAAiB,MAAM,wBAAwB,CAAC;AACvD,OAAO,UAAU,MAAM,iBAAiB,CAAC;AACzC,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,UAAU,CAAC;AACjD,OAAO,EAAE,kBAAkB,EAAE,MAAM,UAAU,CAAC;AAC9C,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AACpD,OAAO,MAAM,MAAM,sBAAsB,CAAC;AAE1C,OAAO,EAAE,SAAS,EAAE,iBAAiB,EAAE,UAAU,EAAE,kBAAkB,EAAE,MAAM,EAAE,CAAC;AAEhF,YAAY,EAAE,gBAAgB,EAAE,SAAS,EAAE,CAAC;AAE5C,cAAc,uBAAuB,CAAC;AACtC,cAAc,wBAAwB,CAAC;AACvC,cAAc,gBAAgB,CAAC;AAC/B,cAAc,8BAA8B,CAAC;AAC7C,cAAc,sBAAsB,CAAC;AACrC,cAAc,6BAA6B,CAAC"}

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

@@ -0,0 +1,13 @@
+import Blueprint from './blueprint.js';
+import CompoundBlueprint from './compoundBlueprint.js';
+import Blueprints from './blueprints.js';
+import { organiseBlueprints } from './lib.js';
+import offset from './blueprintOffset.js';
+export { Blueprint, CompoundBlueprint, Blueprints, organiseBlueprints, offset };
+export * from './cannedBlueprints.js';
+export * from './booleanOperations.js';
+export * from './boolean2D.js';
+export * from './blueprintApproximations.js';
+export * from './blueprintOffset.js';
+export * from './blueprintCustomCorners.js';
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/2d/blueprints/index.ts"],"names":[],"mappings":"AAAA,OAAO,SAAS,MAAM,gBAAgB,CAAC;AACvC,OAAO,iBAAiB,MAAM,wBAAwB,CAAC;AACvD,OAAO,UAAU,MAAM,iBAAiB,CAAC;AAEzC,OAAO,EAAE,kBAAkB,EAAE,MAAM,UAAU,CAAC;AAE9C,OAAO,MAAM,MAAM,sBAAsB,CAAC;AAE1C,OAAO,EAAE,SAAS,EAAE,iBAAiB,EAAE,UAAU,EAAE,kBAAkB,EAAE,MAAM,EAAE,CAAC;AAIhF,cAAc,uBAAuB,CAAC;AACtC,cAAc,wBAAwB,CAAC;AACvC,cAAc,gBAAgB,CAAC;AAC/B,cAAc,8BAA8B,CAAC;AAC7C,cAAc,sBAAsB,CAAC;AACrC,cAAc,6BAA6B,CAAC","sourcesContent":["import Blueprint from './blueprint.js';\nimport CompoundBlueprint from './compoundBlueprint.js';\nimport Blueprints from './blueprints.js';\nimport type { DrawingInterface } from './lib.js';\nimport { organiseBlueprints } from './lib.js';\nimport type { ScaleMode } from '../../2d/curves.js';\nimport offset from './blueprintOffset.js';\n\nexport { Blueprint, CompoundBlueprint, Blueprints, organiseBlueprints, offset };\n\nexport type { DrawingInterface, ScaleMode };\n\nexport * from './cannedBlueprints.js';\nexport * from './booleanOperations.js';\nexport * from './boolean2D.js';\nexport * from './blueprintApproximations.js';\nexport * from './blueprintOffset.js';\nexport * from './blueprintCustomCorners.js';\n"]}

package/dist/vendored/brepjs/2d/blueprints/intersectionSegments.d.ts

@@ -0,0 +1,18 @@
+import type { Point2D } from '../../2d/lib/index.js';
+import type Blueprint from './blueprint.js';
+import type { IntersectionSegment } from './booleanHelpers.js';
+/**
+ * Check whether a segment's start/end points match one of the common segment
+ * point pairs.
+ */
+export declare function isCommonSegmentMatch(commonSegmentsPoints: Point2D[][], segmentStart: Point2D, segmentEnd: Point2D): boolean;
+/**
+ * Given two closed blueprints, find their intersection points, split each
+ * blueprint's curves at those points, and pair up the resulting segments.
+ *
+ * Returns an array of paired segments (one from each blueprint) that share
+ * the same start/end intersection points, or `null` if the blueprints do not
+ * intersect.
+ */
+export declare function blueprintsIntersectionSegments(first: Blueprint, second: Blueprint): IntersectionSegment[] | null;
+//# sourceMappingURL=intersectionSegments.d.ts.map

package/dist/vendored/brepjs/2d/blueprints/intersectionSegments.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"intersectionSegments.d.ts","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/2d/blueprints/intersectionSegments.ts"],"names":[],"mappings":"AAKA,OAAO,KAAK,EAAE,OAAO,EAAW,MAAM,uBAAuB,CAAC;AAG9D,OAAO,KAAK,SAAS,MAAM,gBAAgB,CAAC;AAY5C,OAAO,KAAK,EAAW,mBAAmB,EAAE,MAAM,qBAAqB,CAAC;AAsLxE;;;GAGG;AACH,wBAAgB,oBAAoB,CAClC,oBAAoB,EAAE,OAAO,EAAE,EAAE,EACjC,YAAY,EAAE,OAAO,EACrB,UAAU,EAAE,OAAO,GAClB,OAAO,CAQT;AAMD;;;;;;;GAOG;AACH,wBAAgB,8BAA8B,CAC5C,KAAK,EAAE,SAAS,EAChB,MAAM,EAAE,SAAS,GAChB,mBAAmB,EAAE,GAAG,IAAI,CAsF9B"}

package/dist/vendored/brepjs/2d/blueprints/intersectionSegments.js

@@ -0,0 +1,230 @@
+import Flatbush from 'flatbush';
+import { unwrap } from '../../core/result.js';
+import zip from '../../utils/zip.js';
+import { wasmIndex } from '../../utils/vec3.js';
+import { intersectCurves, removeDuplicatePoints, PRECISION_INTERSECTION } from '../../2d/lib/index.js';
+import { samePoint, hashPoint, hashSegment, startOfSegment, endOfSegment, reverseSegments, curveMidPoint, rotateToStartAt, rotateToStartAtSegment, } from './booleanHelpers.js';
+// ---------------------------------------------------------------------------
+// Segment generator: splits curves at intersection points and common segments
+// ---------------------------------------------------------------------------
+function* createSegmentOnPoints(curves, allIntersections, allCommonSegments) {
+    // Pre-compute hash sets for fast O(1) lookup (first pass)
+    const intersectionSet = new Set(allIntersections.map(hashPoint));
+    const commonSegmentSet = new Set(allCommonSegments.map((seg) => hashSegment(seg.firstPoint, seg.lastPoint)));
+    // Hash-then-tolerance lookup: handles toFixed(9) rounding boundary mismatches
+    const matchesIntersection = (point) => {
+        if (intersectionSet.has(hashPoint(point)))
+            return true;
+        return allIntersections.some((p) => samePoint(p, point));
+    };
+    const matchesCommonSegment = (first, last) => {
+        if (commonSegmentSet.has(hashSegment(first, last)))
+            return true;
+        return allCommonSegments.some((seg) => (samePoint(seg.firstPoint, first) && samePoint(seg.lastPoint, last)) ||
+            (samePoint(seg.firstPoint, last) && samePoint(seg.lastPoint, first)));
+    };
+    let currentCurves = [];
+    for (const curve of curves) {
+        // Degenerate curves (both endpoints within tolerance) from prior boolean
+        // operations are absorbed into the current accumulator without triggering
+        // a segment break — they carry no meaningful geometry.
+        if (samePoint(curve.firstPoint, curve.lastPoint)) {
+            currentCurves.push(curve);
+            continue;
+        }
+        const endsAtIntersection = matchesIntersection(curve.lastPoint);
+        const isCommon = matchesCommonSegment(curve.firstPoint, curve.lastPoint);
+        if (endsAtIntersection) {
+            currentCurves.push(curve);
+            yield currentCurves;
+            currentCurves = [];
+        }
+        else if (isCommon) {
+            if (currentCurves.length) {
+                yield currentCurves;
+                currentCurves = [];
+            }
+            yield [curve];
+        }
+        else {
+            currentCurves.push(curve);
+        }
+    }
+    if (currentCurves.length) {
+        yield currentCurves;
+    }
+}
+// ---------------------------------------------------------------------------
+// Non-crossing point removal
+// ---------------------------------------------------------------------------
+/**
+ * Filter out intersection points where the curves only touch but do not
+ * actually cross from one side to the other.
+ */
+function removeNonCrossingPoints(allIntersections, segmentedCurve, blueprintToCheck) {
+    return allIntersections.filter((intersection) => {
+        const touching = segmentedCurve.filter((s) => samePoint(s.firstPoint, intersection) || samePoint(s.lastPoint, intersection));
+        // When a prior boolean operation left near-zero-length curves at corner
+        // junctions, a single intersection point can touch an odd number of
+        // segments: the two expected segments on either side plus the degenerate
+        // bystander whose both endpoints fall within PRECISION_INTERSECTION.
+        // Exclude such bystanders to restore the even-parity invariant.
+        const effectiveTouching = touching.length % 2
+            ? touching.filter((s) => !(samePoint(s.firstPoint, intersection) && samePoint(s.lastPoint, intersection)))
+            : touching;
+        // If nothing is left, or the count is still odd after removing
+        // bystanders, the intersection geometry is degenerate — conservatively
+        // classify as non-crossing so downstream segment pairing stays balanced.
+        if (effectiveTouching.length === 0 || effectiveTouching.length % 2)
+            return false;
+        const insideFlags = effectiveTouching.map((segment) => blueprintToCheck.isInside(curveMidPoint(segment)));
+        // Either all inside or all outside means no crossing
+        const allSameSide = insideFlags.every(Boolean) || insideFlags.every((f) => !f);
+        return !allSameSide;
+    });
+}
+/**
+ * Find all intersection points and common segments between two blueprints'
+ * curves. Returns per-curve intersection points for subsequent splitting.
+ */
+function findAllIntersections(first, second) {
+    const allIntersections = [];
+    const allCommonSegments = [];
+    const firstCurvePoints = first.curves.map(() => []);
+    const secondCurvePoints = second.curves.map(() => []);
+    const secondIndex = new Flatbush(second.curves.length);
+    for (const curve of second.curves) {
+        const [[xMin, yMin], [xMax, yMax]] = curve.boundingBox.bounds;
+        secondIndex.add(xMin, yMin, xMax, yMax);
+    }
+    secondIndex.finish();
+    first.curves.forEach((thisCurve, firstIdx) => {
+        const [[xMin, yMin], [xMax, yMax]] = thisCurve.boundingBox.bounds;
+        const candidates = secondIndex.search(xMin, yMin, xMax, yMax);
+        for (const secondIdx of candidates) {
+            const otherCurve = wasmIndex(second.curves, secondIdx);
+            const { intersections, commonSegments, commonSegmentsPoints } = unwrap(intersectCurves(thisCurve, otherCurve, PRECISION_INTERSECTION / 100));
+            allIntersections.push(...intersections);
+            firstCurvePoints[firstIdx]?.push(...intersections);
+            secondCurvePoints[secondIdx]?.push(...intersections);
+            allCommonSegments.push(...commonSegments);
+            allIntersections.push(...commonSegmentsPoints);
+            firstCurvePoints[firstIdx]?.push(...commonSegmentsPoints);
+            secondCurvePoints[secondIdx]?.push(...commonSegmentsPoints);
+        }
+    });
+    return {
+        allIntersections: removeDuplicatePoints(allIntersections, PRECISION_INTERSECTION),
+        allCommonSegments,
+        firstCurvePoints,
+        secondCurvePoints,
+    };
+}
+/**
+ * Split each curve at its intersection points and return the resulting
+ * sub-curves.
+ */
+function splitCurvesAtIntersections(curves, curvePoints) {
+    return zip([curves, curvePoints]).flatMap(([curve, intersections]) => {
+        if (intersections.length === 0)
+            return [curve];
+        return curve.splitAt(intersections, PRECISION_INTERSECTION / 100);
+    });
+}
+// ---------------------------------------------------------------------------
+// Common segment matching
+// ---------------------------------------------------------------------------
+/**
+ * Check whether a segment's start/end points match one of the common segment
+ * point pairs.
+ */
+export function isCommonSegmentMatch(commonSegmentsPoints, segmentStart, segmentEnd) {
+    return commonSegmentsPoints.some(([startPoint, endPoint]) => {
+        if (startPoint === undefined || endPoint === undefined)
+            return false;
+        return ((samePoint(startPoint, segmentStart) && samePoint(endPoint, segmentEnd)) ||
+            (samePoint(startPoint, segmentEnd) && samePoint(endPoint, segmentStart)));
+    });
+}
+// ---------------------------------------------------------------------------
+// Main entry: blueprintsIntersectionSegments
+// ---------------------------------------------------------------------------
+/**
+ * Given two closed blueprints, find their intersection points, split each
+ * blueprint's curves at those points, and pair up the resulting segments.
+ *
+ * Returns an array of paired segments (one from each blueprint) that share
+ * the same start/end intersection points, or `null` if the blueprints do not
+ * intersect.
+ */
+export function blueprintsIntersectionSegments(first, second) {
+    // Find all intersection points between the two blueprints' curves
+    const { allIntersections: rawIntersections, allCommonSegments, firstCurvePoints, secondCurvePoints, } = findAllIntersections(first, second);
+    // Need at least two intersection points for a meaningful intersection
+    if (rawIntersections.length <= 1)
+        return null;
+    // Split curves at intersection points
+    let firstCurveSegments = splitCurvesAtIntersections(first.curves, firstCurvePoints);
+    let secondCurveSegments = splitCurvesAtIntersections(second.curves, secondCurvePoints);
+    const commonSegmentsPoints = allCommonSegments.map((c) => [c.firstPoint, c.lastPoint]);
+    // Remove intersection points that only touch but don't cross
+    const filteredByFirst = removeNonCrossingPoints(rawIntersections, firstCurveSegments, second);
+    const allIntersections = removeNonCrossingPoints(filteredByFirst, secondCurveSegments, first);
+    if (allIntersections.length === 0 && allCommonSegments.length === 0)
+        return null;
+    // Align the beginning of both curve arrays to the same starting point
+    if (allCommonSegments.length === 0) {
+        const startAt = allIntersections[0];
+        if (startAt === undefined)
+            return null;
+        firstCurveSegments = rotateToStartAt(firstCurveSegments, startAt);
+        secondCurveSegments = rotateToStartAt(secondCurveSegments, startAt);
+    }
+    else {
+        // When there are common segments, always start on the first one
+        const startSegment = allCommonSegments[0];
+        if (startSegment === undefined)
+            return null;
+        firstCurveSegments = rotateToStartAtSegment(firstCurveSegments, startSegment);
+        secondCurveSegments = rotateToStartAtSegment(secondCurveSegments, startSegment);
+    }
+    // Group curves into segments between intersection points
+    const firstIntersectedSegments = Array.from(createSegmentOnPoints(firstCurveSegments, allIntersections, allCommonSegments));
+    let secondIntersectedSegments = Array.from(createSegmentOnPoints(secondCurveSegments, allIntersections, allCommonSegments));
+    // Ensure the second blueprint's segments are oriented to match the first
+    const firstSeg = firstIntersectedSegments[0];
+    const secondSeg = secondIntersectedSegments[0];
+    if (firstSeg !== undefined && secondSeg !== undefined) {
+        const endpointsMismatch = !samePoint(endOfSegment(secondSeg), endOfSegment(firstSeg));
+        const commonSegmentLengthMismatch = allCommonSegments.length > 0 && secondSeg.length !== 1;
+        if (endpointsMismatch || commonSegmentLengthMismatch) {
+            secondIntersectedSegments = reverseSegments(secondIntersectedSegments);
+        }
+    }
+    // Pair up segments and mark common ones.
+    // When segment counts differ (e.g. tangent intersections splitting
+    // asymmetrically), pad the shorter list to avoid silent truncation.
+    const maxLen = Math.max(firstIntersectedSegments.length, secondIntersectedSegments.length);
+    const result = [];
+    for (let i = 0; i < maxLen; i++) {
+        const firstSeg2 = firstIntersectedSegments[i];
+        const secondSeg2 = secondIntersectedSegments[i];
+        if (firstSeg2 === undefined || secondSeg2 === undefined) {
+            const available = firstSeg2 ?? secondSeg2;
+            if (available === undefined)
+                continue;
+            result.push([available, available]);
+            continue;
+        }
+        const currentStart = startOfSegment(firstSeg2);
+        const currentEnd = endOfSegment(firstSeg2);
+        if (isCommonSegmentMatch(commonSegmentsPoints, currentStart, currentEnd)) {
+            result.push([firstSeg2, 'same']);
+        }
+        else {
+            result.push([firstSeg2, secondSeg2]);
+        }
+    }
+    return result;
+}
+//# sourceMappingURL=intersectionSegments.js.map

package/dist/vendored/brepjs/2d/blueprints/intersectionSegments.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"intersectionSegments.js","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/2d/blueprints/intersectionSegments.ts"],"names":[],"mappings":"AAAA,OAAO,QAAQ,MAAM,UAAU,CAAC;AAEhC,OAAO,EAAE,MAAM,EAAE,MAAM,sBAAsB,CAAC;AAC9C,OAAO,GAAG,MAAM,oBAAoB,CAAC;AACrC,OAAO,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AAEhD,OAAO,EAAE,eAAe,EAAE,qBAAqB,EAAE,sBAAsB,EAAE,MAAM,uBAAuB,CAAC;AAGvG,OAAO,EACL,SAAS,EACT,SAAS,EACT,WAAW,EACX,cAAc,EACd,YAAY,EACZ,eAAe,EACf,aAAa,EACb,eAAe,EACf,sBAAsB,GACvB,MAAM,qBAAqB,CAAC;AAG7B,8EAA8E;AAC9E,8EAA8E;AAC9E,8EAA8E;AAE9E,QAAQ,CAAC,CAAC,qBAAqB,CAC7B,MAAiB,EACjB,gBAA2B,EAC3B,iBAA4B;IAE5B,0DAA0D;IAC1D,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,gBAAgB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC;IACjE,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAC9B,iBAAiB,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC,CAC3E,CAAC;IAEF,8EAA8E;IAC9E,MAAM,mBAAmB,GAAG,CAAC,KAAc,EAAW,EAAE;QACtD,IAAI,eAAe,CAAC,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;YAAE,OAAO,IAAI,CAAC;QACvD,OAAO,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;IAC3D,CAAC,CAAC;IAEF,MAAM,oBAAoB,GAAG,CAAC,KAAc,EAAE,IAAa,EAAW,EAAE;QACtE,IAAI,gBAAgB,CAAC,GAAG,CAAC,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;YAAE,OAAO,IAAI,CAAC;QAChE,OAAO,iBAAiB,CAAC,IAAI,CAC3B,CAAC,GAAG,EAAE,EAAE,CACN,CAAC,SAAS,CAAC,GAAG,CAAC,UAAU,EAAE,KAAK,CAAC,IAAI,SAAS,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;YACpE,CAAC,SAAS,CAAC,GAAG,CAAC,UAAU,EAAE,IAAI,CAAC,IAAI,SAAS,CAAC,GAAG,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC,CACvE,CAAC;IACJ,CAAC,CAAC;IAEF,IAAI,aAAa,GAAc,EAAE,CAAC;IAClC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,yEAAyE;QACzE,0EAA0E;QAC1E,uDAAuD;QACvD,IAAI,SAAS,CAAC,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC;YACjD,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC1B,SAAS;QACX,CAAC;QAED,MAAM,kBAAkB,GAAG,mBAAmB,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QAChE,MAAM,QAAQ,GAAG,oBAAoB,CAAC,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;QAEzE,IAAI,kBAAkB,EAAE,CAAC;YACvB,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC1B,MAAM,aAAa,CAAC;YACpB,aAAa,GAAG,EAAE,CAAC;QACrB,CAAC;aAAM,IAAI,QAAQ,EAAE,CAAC;YACpB,IAAI,aAAa,CAAC,MAAM,EAAE,CAAC;gBACzB,MAAM,aAAa,CAAC;gBACpB,aAAa,GAAG,EAAE,CAAC;YACrB,CAAC;YACD,MAAM,CAAC,KAAK,CAAC,CAAC;QAChB,CAAC;aAAM,CAAC;YACN,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC5B,CAAC;IACH,CAAC;IACD,IAAI,aAAa,CAAC,MAAM,EAAE,CAAC;QACzB,MAAM,aAAa,CAAC;IACtB,CAAC;AACH,CAAC;AAED,8EAA8E;AAC9E,6BAA6B;AAC7B,8EAA8E;AAE9E;;;GAGG;AACH,SAAS,uBAAuB,CAC9B,gBAA2B,EAC3B,cAAyB,EACzB,gBAA2B;IAE3B,OAAO,gBAAgB,CAAC,MAAM,CAAC,CAAC,YAAY,EAAE,EAAE;QAC9C,MAAM,QAAQ,GAAG,cAAc,CAAC,MAAM,CACpC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,UAAU,EAAE,YAAY,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,SAAS,EAAE,YAAY,CAAC,CACrF,CAAC;QACF,wEAAwE;QACxE,oEAAoE;QACpE,yEAAyE;QACzE,qEAAqE;QACrE,gEAAgE;QAChE,MAAM,iBAAiB,GACrB,QAAQ,CAAC,MAAM,GAAG,CAAC;YACjB,CAAC,CAAC,QAAQ,CAAC,MAAM,CACb,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,UAAU,EAAE,YAAY,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC,CACxF;YACH,CAAC,CAAC,QAAQ,CAAC;QAEf,+DAA+D;QAC/D,uEAAuE;QACvE,yEAAyE;QACzE,IAAI,iBAAiB,CAAC,MAAM,KAAK,CAAC,IAAI,iBAAiB,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;QAEjF,MAAM,WAAW,GAAG,iBAAiB,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CACpD,gBAAgB,CAAC,QAAQ,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAClD,CAAC;QAEF,qDAAqD;QACrD,MAAM,WAAW,GAAG,WAAW,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/E,OAAO,CAAC,WAAW,CAAC;IACtB,CAAC,CAAC,CAAC;AACL,CAAC;AAaD;;;GAGG;AACH,SAAS,oBAAoB,CAAC,KAAgB,EAAE,MAAiB;IAC/D,MAAM,gBAAgB,GAAc,EAAE,CAAC;IACvC,MAAM,iBAAiB,GAAc,EAAE,CAAC;IACxC,MAAM,gBAAgB,GAAgB,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;IACjE,MAAM,iBAAiB,GAAgB,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;IAEnE,MAAM,WAAW,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IACvD,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;QAClC,MAAM,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC;QAC9D,WAAW,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;IAC1C,CAAC;IACD,WAAW,CAAC,MAAM,EAAE,CAAC;IAErB,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,SAAS,EAAE,QAAQ,EAAE,EAAE;QAC3C,MAAM,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,GAAG,SAAS,CAAC,WAAW,CAAC,MAAM,CAAC;QAClE,MAAM,UAAU,GAAG,WAAW,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QAE9D,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;YACnC,MAAM,UAAU,GAAG,SAAS,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;YACvD,MAAM,EAAE,aAAa,EAAE,cAAc,EAAE,oBAAoB,EAAE,GAAG,MAAM,CACpE,eAAe,CAAC,SAAS,EAAE,UAAU,EAAE,sBAAsB,GAAG,GAAG,CAAC,CACrE,CAAC;YAEF,gBAAgB,CAAC,IAAI,CAAC,GAAG,aAAa,CAAC,CAAC;YACxC,gBAAgB,CAAC,QAAQ,CAAC,EAAE,IAAI,CAAC,GAAG,aAAa,CAAC,CAAC;YACnD,iBAAiB,CAAC,SAAS,CAAC,EAAE,IAAI,CAAC,GAAG,aAAa,CAAC,CAAC;YAErD,iBAAiB,CAAC,IAAI,CAAC,GAAG,cAAc,CAAC,CAAC;YAC1C,gBAAgB,CAAC,IAAI,CAAC,GAAG,oBAAoB,CAAC,CAAC;YAC/C,gBAAgB,CAAC,QAAQ,CAAC,EAAE,IAAI,CAAC,GAAG,oBAAoB,CAAC,CAAC;YAC1D,iBAAiB,CAAC,SAAS,CAAC,EAAE,IAAI,CAAC,GAAG,oBAAoB,CAAC,CAAC;QAC9D,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,OAAO;QACL,gBAAgB,EAAE,qBAAqB,CAAC,gBAAgB,EAAE,sBAAsB,CAAC;QACjF,iBAAiB;QACjB,gBAAgB;QAChB,iBAAiB;KAClB,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,SAAS,0BAA0B,CAAC,MAAiB,EAAE,WAAwB;IAC7E,OAAO,GAAG,CAAC,CAAC,MAAM,EAAE,WAAW,CAA6B,CAAC,CAAC,OAAO,CACnE,CAAC,CAAC,KAAK,EAAE,aAAa,CAAuB,EAAE,EAAE;QAC/C,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,CAAC,KAAK,CAAC,CAAC;QAC/C,OAAO,KAAK,CAAC,OAAO,CAAC,aAAa,EAAE,sBAAsB,GAAG,GAAG,CAAC,CAAC;IACpE,CAAC,CACF,CAAC;AACJ,CAAC;AAED,8EAA8E;AAC9E,0BAA0B;AAC1B,8EAA8E;AAE9E;;;GAGG;AACH,MAAM,UAAU,oBAAoB,CAClC,oBAAiC,EACjC,YAAqB,EACrB,UAAmB;IAEnB,OAAO,oBAAoB,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,EAAE,QAAQ,CAAC,EAAE,EAAE;QAC1D,IAAI,UAAU,KAAK,SAAS,IAAI,QAAQ,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;QACrE,OAAO,CACL,CAAC,SAAS,CAAC,UAAU,EAAE,YAAY,CAAC,IAAI,SAAS,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;YACxE,CAAC,SAAS,CAAC,UAAU,EAAE,UAAU,CAAC,IAAI,SAAS,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC,CACzE,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC;AAED,8EAA8E;AAC9E,6CAA6C;AAC7C,8EAA8E;AAE9E;;;;;;;GAOG;AACH,MAAM,UAAU,8BAA8B,CAC5C,KAAgB,EAChB,MAAiB;IAEjB,kEAAkE;IAClE,MAAM,EACJ,gBAAgB,EAAE,gBAAgB,EAClC,iBAAiB,EACjB,gBAAgB,EAChB,iBAAiB,GAClB,GAAG,oBAAoB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAExC,sEAAsE;IACtE,IAAI,gBAAgB,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IAE9C,sCAAsC;IACtC,IAAI,kBAAkB,GAAG,0BAA0B,CAAC,KAAK,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;IACpF,IAAI,mBAAmB,GAAG,0BAA0B,CAAC,MAAM,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAC;IAEvF,MAAM,oBAAoB,GAAG,iBAAiB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;IAEvF,6DAA6D;IAC7D,MAAM,eAAe,GAAG,uBAAuB,CAAC,gBAAgB,EAAE,kBAAkB,EAAE,MAAM,CAAC,CAAC;IAC9F,MAAM,gBAAgB,GAAG,uBAAuB,CAAC,eAAe,EAAE,mBAAmB,EAAE,KAAK,CAAC,CAAC;IAE9F,IAAI,gBAAgB,CAAC,MAAM,KAAK,CAAC,IAAI,iBAAiB,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAEjF,sEAAsE;IACtE,IAAI,iBAAiB,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACnC,MAAM,OAAO,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;QACpC,IAAI,OAAO,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC;QACvC,kBAAkB,GAAG,eAAe,CAAC,kBAAkB,EAAE,OAAO,CAAC,CAAC;QAClE,mBAAmB,GAAG,eAAe,CAAC,mBAAmB,EAAE,OAAO,CAAC,CAAC;IACtE,CAAC;SAAM,CAAC;QACN,gEAAgE;QAChE,MAAM,YAAY,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC;QAC1C,IAAI,YAAY,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC;QAC5C,kBAAkB,GAAG,sBAAsB,CAAC,kBAAkB,EAAE,YAAY,CAAC,CAAC;QAC9E,mBAAmB,GAAG,sBAAsB,CAAC,mBAAmB,EAAE,YAAY,CAAC,CAAC;IAClF,CAAC;IAED,yDAAyD;IACzD,MAAM,wBAAwB,GAAG,KAAK,CAAC,IAAI,CACzC,qBAAqB,CAAC,kBAAkB,EAAE,gBAAgB,EAAE,iBAAiB,CAAC,CAC/E,CAAC;IACF,IAAI,yBAAyB,GAAG,KAAK,CAAC,IAAI,CACxC,qBAAqB,CAAC,mBAAmB,EAAE,gBAAgB,EAAE,iBAAiB,CAAC,CAChF,CAAC;IAEF,yEAAyE;IACzE,MAAM,QAAQ,GAAG,wBAAwB,CAAC,CAAC,CAAC,CAAC;IAC7C,MAAM,SAAS,GAAG,yBAAyB,CAAC,CAAC,CAAC,CAAC;IAC/C,IAAI,QAAQ,KAAK,SAAS,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;QACtD,MAAM,iBAAiB,GAAG,CAAC,SAAS,CAAC,YAAY,CAAC,SAAS,CAAC,EAAE,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC;QACtF,MAAM,2BAA2B,GAAG,iBAAiB,CAAC,MAAM,GAAG,CAAC,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,CAAC;QAE3F,IAAI,iBAAiB,IAAI,2BAA2B,EAAE,CAAC;YACrD,yBAAyB,GAAG,eAAe,CAAC,yBAAyB,CAAC,CAAC;QACzE,CAAC;IACH,CAAC;IAED,yCAAyC;IACzC,mEAAmE;IACnE,oEAAoE;IACpE,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,wBAAwB,CAAC,MAAM,EAAE,yBAAyB,CAAC,MAAM,CAAC,CAAC;IAC3F,MAAM,MAAM,GAA0B,EAAE,CAAC;IAEzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,MAAM,SAAS,GAAG,wBAAwB,CAAC,CAAC,CAAC,CAAC;QAC9C,MAAM,UAAU,GAAG,yBAAyB,CAAC,CAAC,CAAC,CAAC;QAEhD,IAAI,SAAS,KAAK,SAAS,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;YACxD,MAAM,SAAS,GAAG,SAAS,IAAI,UAAU,CAAC;YAC1C,IAAI,SAAS,KAAK,SAAS;gBAAE,SAAS;YACtC,MAAM,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC;YACpC,SAAS;QACX,CAAC;QAED,MAAM,YAAY,GAAG,cAAc,CAAC,SAAS,CAAC,CAAC;QAC/C,MAAM,UAAU,GAAG,YAAY,CAAC,SAAS,CAAC,CAAC;QAE3C,IAAI,oBAAoB,CAAC,oBAAoB,EAAE,YAAY,EAAE,UAAU,CAAC,EAAE,CAAC;YACzE,MAAM,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC,CAAC;QACnC,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC,CAAC;QACvC,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC","sourcesContent":["import Flatbush from 'flatbush';\n\nimport { unwrap } from '../../core/result.js';\nimport zip from '../../utils/zip.js';\nimport { wasmIndex } from '../../utils/vec3.js';\nimport type { Point2D, Curve2D } from '../../2d/lib/index.js';\nimport { intersectCurves, removeDuplicatePoints, PRECISION_INTERSECTION } from '../../2d/lib/index.js';\n\nimport type Blueprint from './blueprint.js';\nimport {\n  samePoint,\n  hashPoint,\n  hashSegment,\n  startOfSegment,\n  endOfSegment,\n  reverseSegments,\n  curveMidPoint,\n  rotateToStartAt,\n  rotateToStartAtSegment,\n} from './booleanHelpers.js';\nimport type { Segment, IntersectionSegment } from './booleanHelpers.js';\n\n// ---------------------------------------------------------------------------\n// Segment generator: splits curves at intersection points and common segments\n// ---------------------------------------------------------------------------\n\nfunction* createSegmentOnPoints(\n  curves: Curve2D[],\n  allIntersections: Point2D[],\n  allCommonSegments: Curve2D[]\n): Generator<Segment> {\n  // Pre-compute hash sets for fast O(1) lookup (first pass)\n  const intersectionSet = new Set(allIntersections.map(hashPoint));\n  const commonSegmentSet = new Set(\n    allCommonSegments.map((seg) => hashSegment(seg.firstPoint, seg.lastPoint))\n  );\n\n  // Hash-then-tolerance lookup: handles toFixed(9) rounding boundary mismatches\n  const matchesIntersection = (point: Point2D): boolean => {\n    if (intersectionSet.has(hashPoint(point))) return true;\n    return allIntersections.some((p) => samePoint(p, point));\n  };\n\n  const matchesCommonSegment = (first: Point2D, last: Point2D): boolean => {\n    if (commonSegmentSet.has(hashSegment(first, last))) return true;\n    return allCommonSegments.some(\n      (seg) =>\n        (samePoint(seg.firstPoint, first) && samePoint(seg.lastPoint, last)) ||\n        (samePoint(seg.firstPoint, last) && samePoint(seg.lastPoint, first))\n    );\n  };\n\n  let currentCurves: Curve2D[] = [];\n  for (const curve of curves) {\n    // Degenerate curves (both endpoints within tolerance) from prior boolean\n    // operations are absorbed into the current accumulator without triggering\n    // a segment break — they carry no meaningful geometry.\n    if (samePoint(curve.firstPoint, curve.lastPoint)) {\n      currentCurves.push(curve);\n      continue;\n    }\n\n    const endsAtIntersection = matchesIntersection(curve.lastPoint);\n    const isCommon = matchesCommonSegment(curve.firstPoint, curve.lastPoint);\n\n    if (endsAtIntersection) {\n      currentCurves.push(curve);\n      yield currentCurves;\n      currentCurves = [];\n    } else if (isCommon) {\n      if (currentCurves.length) {\n        yield currentCurves;\n        currentCurves = [];\n      }\n      yield [curve];\n    } else {\n      currentCurves.push(curve);\n    }\n  }\n  if (currentCurves.length) {\n    yield currentCurves;\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Non-crossing point removal\n// ---------------------------------------------------------------------------\n\n/**\n * Filter out intersection points where the curves only touch but do not\n * actually cross from one side to the other.\n */\nfunction removeNonCrossingPoints(\n  allIntersections: Point2D[],\n  segmentedCurve: Curve2D[],\n  blueprintToCheck: Blueprint\n): Point2D[] {\n  return allIntersections.filter((intersection) => {\n    const touching = segmentedCurve.filter(\n      (s) => samePoint(s.firstPoint, intersection) || samePoint(s.lastPoint, intersection)\n    );\n    // When a prior boolean operation left near-zero-length curves at corner\n    // junctions, a single intersection point can touch an odd number of\n    // segments: the two expected segments on either side plus the degenerate\n    // bystander whose both endpoints fall within PRECISION_INTERSECTION.\n    // Exclude such bystanders to restore the even-parity invariant.\n    const effectiveTouching =\n      touching.length % 2\n        ? touching.filter(\n            (s) => !(samePoint(s.firstPoint, intersection) && samePoint(s.lastPoint, intersection))\n          )\n        : touching;\n\n    // If nothing is left, or the count is still odd after removing\n    // bystanders, the intersection geometry is degenerate — conservatively\n    // classify as non-crossing so downstream segment pairing stays balanced.\n    if (effectiveTouching.length === 0 || effectiveTouching.length % 2) return false;\n\n    const insideFlags = effectiveTouching.map((segment) =>\n      blueprintToCheck.isInside(curveMidPoint(segment))\n    );\n\n    // Either all inside or all outside means no crossing\n    const allSameSide = insideFlags.every(Boolean) || insideFlags.every((f) => !f);\n    return !allSameSide;\n  });\n}\n\n// ---------------------------------------------------------------------------\n// Curve intersection and splitting\n// ---------------------------------------------------------------------------\n\ninterface CurveIntersectionResult {\n  allIntersections: Point2D[];\n  allCommonSegments: Curve2D[];\n  firstCurvePoints: Point2D[][];\n  secondCurvePoints: Point2D[][];\n}\n\n/**\n * Find all intersection points and common segments between two blueprints'\n * curves. Returns per-curve intersection points for subsequent splitting.\n */\nfunction findAllIntersections(first: Blueprint, second: Blueprint): CurveIntersectionResult {\n  const allIntersections: Point2D[] = [];\n  const allCommonSegments: Curve2D[] = [];\n  const firstCurvePoints: Point2D[][] = first.curves.map(() => []);\n  const secondCurvePoints: Point2D[][] = second.curves.map(() => []);\n\n  const secondIndex = new Flatbush(second.curves.length);\n  for (const curve of second.curves) {\n    const [[xMin, yMin], [xMax, yMax]] = curve.boundingBox.bounds;\n    secondIndex.add(xMin, yMin, xMax, yMax);\n  }\n  secondIndex.finish();\n\n  first.curves.forEach((thisCurve, firstIdx) => {\n    const [[xMin, yMin], [xMax, yMax]] = thisCurve.boundingBox.bounds;\n    const candidates = secondIndex.search(xMin, yMin, xMax, yMax);\n\n    for (const secondIdx of candidates) {\n      const otherCurve = wasmIndex(second.curves, secondIdx);\n      const { intersections, commonSegments, commonSegmentsPoints } = unwrap(\n        intersectCurves(thisCurve, otherCurve, PRECISION_INTERSECTION / 100)\n      );\n\n      allIntersections.push(...intersections);\n      firstCurvePoints[firstIdx]?.push(...intersections);\n      secondCurvePoints[secondIdx]?.push(...intersections);\n\n      allCommonSegments.push(...commonSegments);\n      allIntersections.push(...commonSegmentsPoints);\n      firstCurvePoints[firstIdx]?.push(...commonSegmentsPoints);\n      secondCurvePoints[secondIdx]?.push(...commonSegmentsPoints);\n    }\n  });\n\n  return {\n    allIntersections: removeDuplicatePoints(allIntersections, PRECISION_INTERSECTION),\n    allCommonSegments,\n    firstCurvePoints,\n    secondCurvePoints,\n  };\n}\n\n/**\n * Split each curve at its intersection points and return the resulting\n * sub-curves.\n */\nfunction splitCurvesAtIntersections(curves: Curve2D[], curvePoints: Point2D[][]): Curve2D[] {\n  return zip([curves, curvePoints] as [Curve2D[], Point2D[][]]).flatMap(\n    ([curve, intersections]: [Curve2D, Point2D[]]) => {\n      if (intersections.length === 0) return [curve];\n      return curve.splitAt(intersections, PRECISION_INTERSECTION / 100);\n    }\n  );\n}\n\n// ---------------------------------------------------------------------------\n// Common segment matching\n// ---------------------------------------------------------------------------\n\n/**\n * Check whether a segment's start/end points match one of the common segment\n * point pairs.\n */\nexport function isCommonSegmentMatch(\n  commonSegmentsPoints: Point2D[][],\n  segmentStart: Point2D,\n  segmentEnd: Point2D\n): boolean {\n  return commonSegmentsPoints.some(([startPoint, endPoint]) => {\n    if (startPoint === undefined || endPoint === undefined) return false;\n    return (\n      (samePoint(startPoint, segmentStart) && samePoint(endPoint, segmentEnd)) ||\n      (samePoint(startPoint, segmentEnd) && samePoint(endPoint, segmentStart))\n    );\n  });\n}\n\n// ---------------------------------------------------------------------------\n// Main entry: blueprintsIntersectionSegments\n// ---------------------------------------------------------------------------\n\n/**\n * Given two closed blueprints, find their intersection points, split each\n * blueprint's curves at those points, and pair up the resulting segments.\n *\n * Returns an array of paired segments (one from each blueprint) that share\n * the same start/end intersection points, or `null` if the blueprints do not\n * intersect.\n */\nexport function blueprintsIntersectionSegments(\n  first: Blueprint,\n  second: Blueprint\n): IntersectionSegment[] | null {\n  // Find all intersection points between the two blueprints' curves\n  const {\n    allIntersections: rawIntersections,\n    allCommonSegments,\n    firstCurvePoints,\n    secondCurvePoints,\n  } = findAllIntersections(first, second);\n\n  // Need at least two intersection points for a meaningful intersection\n  if (rawIntersections.length <= 1) return null;\n\n  // Split curves at intersection points\n  let firstCurveSegments = splitCurvesAtIntersections(first.curves, firstCurvePoints);\n  let secondCurveSegments = splitCurvesAtIntersections(second.curves, secondCurvePoints);\n\n  const commonSegmentsPoints = allCommonSegments.map((c) => [c.firstPoint, c.lastPoint]);\n\n  // Remove intersection points that only touch but don't cross\n  const filteredByFirst = removeNonCrossingPoints(rawIntersections, firstCurveSegments, second);\n  const allIntersections = removeNonCrossingPoints(filteredByFirst, secondCurveSegments, first);\n\n  if (allIntersections.length === 0 && allCommonSegments.length === 0) return null;\n\n  // Align the beginning of both curve arrays to the same starting point\n  if (allCommonSegments.length === 0) {\n    const startAt = allIntersections[0];\n    if (startAt === undefined) return null;\n    firstCurveSegments = rotateToStartAt(firstCurveSegments, startAt);\n    secondCurveSegments = rotateToStartAt(secondCurveSegments, startAt);\n  } else {\n    // When there are common segments, always start on the first one\n    const startSegment = allCommonSegments[0];\n    if (startSegment === undefined) return null;\n    firstCurveSegments = rotateToStartAtSegment(firstCurveSegments, startSegment);\n    secondCurveSegments = rotateToStartAtSegment(secondCurveSegments, startSegment);\n  }\n\n  // Group curves into segments between intersection points\n  const firstIntersectedSegments = Array.from(\n    createSegmentOnPoints(firstCurveSegments, allIntersections, allCommonSegments)\n  );\n  let secondIntersectedSegments = Array.from(\n    createSegmentOnPoints(secondCurveSegments, allIntersections, allCommonSegments)\n  );\n\n  // Ensure the second blueprint's segments are oriented to match the first\n  const firstSeg = firstIntersectedSegments[0];\n  const secondSeg = secondIntersectedSegments[0];\n  if (firstSeg !== undefined && secondSeg !== undefined) {\n    const endpointsMismatch = !samePoint(endOfSegment(secondSeg), endOfSegment(firstSeg));\n    const commonSegmentLengthMismatch = allCommonSegments.length > 0 && secondSeg.length !== 1;\n\n    if (endpointsMismatch || commonSegmentLengthMismatch) {\n      secondIntersectedSegments = reverseSegments(secondIntersectedSegments);\n    }\n  }\n\n  // Pair up segments and mark common ones.\n  // When segment counts differ (e.g. tangent intersections splitting\n  // asymmetrically), pad the shorter list to avoid silent truncation.\n  const maxLen = Math.max(firstIntersectedSegments.length, secondIntersectedSegments.length);\n  const result: IntersectionSegment[] = [];\n\n  for (let i = 0; i < maxLen; i++) {\n    const firstSeg2 = firstIntersectedSegments[i];\n    const secondSeg2 = secondIntersectedSegments[i];\n\n    if (firstSeg2 === undefined || secondSeg2 === undefined) {\n      const available = firstSeg2 ?? secondSeg2;\n      if (available === undefined) continue;\n      result.push([available, available]);\n      continue;\n    }\n\n    const currentStart = startOfSegment(firstSeg2);\n    const currentEnd = endOfSegment(firstSeg2);\n\n    if (isCommonSegmentMatch(commonSegmentsPoints, currentStart, currentEnd)) {\n      result.push([firstSeg2, 'same']);\n    } else {\n      result.push([firstSeg2, secondSeg2]);\n    }\n  }\n\n  return result;\n}\n"]}

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

@@ -0,0 +1,73 @@
+import type { Point2D, BoundingBox2d } from '../../2d/lib/index.js';
+import type { Face, Wire } from '../../core/shapeTypes.js';
+import type { Plane, PlaneName } from '../../core/planeTypes.js';
+import type { Vec3, PointInput } from '../../core/types.js';
+import type { ScaleMode } from '../../2d/curves.js';
+import type Blueprint from './blueprint.js';
+import Blueprints from './blueprints.js';
+/**
+ * Groups an array of blueprints such that blueprints that correspond to holes
+ * in other blueprints are set in a `CompoundBlueprint`.
+ *
+ * The current algorithm does not handle cases where blueprints cross each
+ * other
+ */
+export declare const organiseBlueprints: (blueprints: Blueprint[]) => Blueprints;
+/** Plain data returned by blueprint sketchOnPlane/sketchOnFace (Layer 2).
+ *  Layer 3 wraps this in a Sketch class. */
+export interface SketchData {
+    wire: Wire;
+    defaultOrigin?: Vec3;
+    defaultDirection?: Vec3;
+    baseFace?: Face | null;
+}
+export interface DrawingInterface {
+    clone(): DrawingInterface;
+    /**
+     * Release the resources held by this drawing, cascading to child blueprints
+     * and their curves. The `boundingBox` handed out earlier dies with it.
+     */
+    delete(): void;
+    [Symbol.dispose](): void;
+    boundingBox: BoundingBox2d;
+    stretch(ratio: number, direction: Point2D, origin: Point2D): DrawingInterface;
+    rotate(angle: number, center: Point2D): DrawingInterface;
+    translate(xDist: number, yDist: number): DrawingInterface;
+    translate(translationVector: Point2D): DrawingInterface;
+    /**
+     * Returns the mirror image of this drawing made with a single point (in
+     * center mode, the default, or a plane, (plane mode, with both direction and
+     * origin of the plane).
+     */
+    mirror(centerOrDirection: Point2D, origin?: Point2D, mode?: 'center' | 'plane'): DrawingInterface;
+    /**
+     * Returns sketch data for the drawing on a plane.
+     */
+    sketchOnPlane(inputPlane?: PlaneName | Plane, origin?: PointInput | number): SketchData | SketchData[] | (SketchData | SketchData[])[];
+    /**
+     * Returns sketch data for the drawing on a face.
+     *
+     * The scale mode corresponds to the way the coordinates of the drawing are
+     * interpreted match with the face:
+     *
+     * - `original` uses global coordinates (1mm in the drawing is 1mm on the
+     *   face). This is the default, but currently supported only for planar
+     *   and circular faces
+     * - `bounds` normalises the UV parameters on the face to [0,1] intervals.
+     * - `native` uses the default UV parameters of kernel
+     */
+    sketchOnFace(face: Face, scaleMode: ScaleMode): SketchData | SketchData[] | (SketchData | SketchData[])[];
+    /**
+     * Formats the drawing as an SVG image
+     */
+    toSVG(margin: number): string;
+    /**
+     * Returns the SVG viewbox that corresponds to this drawing
+     */
+    toSVGViewBox(margin?: number): string;
+    /**
+     * Formats the drawing as a list of SVG paths
+     */
+    toSVGPaths(): string[] | string[][];
+}
+//# sourceMappingURL=lib.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"lib.d.ts","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/2d/blueprints/lib.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAE,OAAO,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAC;AACpE,OAAO,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,0BAA0B,CAAC;AAE3D,OAAO,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,0BAA0B,CAAC;AACjE,OAAO,KAAK,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AAE5D,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AACpD,OAAO,KAAK,SAAS,MAAM,gBAAgB,CAAC;AAC5C,OAAO,UAAU,MAAM,iBAAiB,CAAC;AAsHzC;;;;;;GAMG;AACH,eAAO,MAAM,kBAAkB,GAAI,YAAY,SAAS,EAAE,KAAG,UAU5D,CAAC;AAEF;4CAC4C;AAC5C,MAAM,WAAW,UAAU;IACzB,IAAI,EAAE,IAAI,CAAC;IACX,aAAa,CAAC,EAAE,IAAI,CAAC;IACrB,gBAAgB,CAAC,EAAE,IAAI,CAAC;IACxB,QAAQ,CAAC,EAAE,IAAI,GAAG,IAAI,CAAC;CACxB;AAED,MAAM,WAAW,gBAAgB;IAC/B,KAAK,IAAI,gBAAgB,CAAC;IAE1B;;;OAGG;IACH,MAAM,IAAI,IAAI,CAAC;IACf,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC;IAEzB,WAAW,EAAE,aAAa,CAAC;IAC3B,OAAO,CAAC,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,GAAG,gBAAgB,CAAC;IAE9E,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,GAAG,gBAAgB,CAAC;IAEzD,SAAS,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,gBAAgB,CAAC;IAC1D,SAAS,CAAC,iBAAiB,EAAE,OAAO,GAAG,gBAAgB,CAAC;IAExD;;;;OAIG;IACH,MAAM,CAAC,iBAAiB,EAAE,OAAO,EAAE,MAAM,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,QAAQ,GAAG,OAAO,GAAG,gBAAgB,CAAC;IAElG;;OAEG;IACH,aAAa,CACX,UAAU,CAAC,EAAE,SAAS,GAAG,KAAK,EAC9B,MAAM,CAAC,EAAE,UAAU,GAAG,MAAM,GAC3B,UAAU,GAAG,UAAU,EAAE,GAAG,CAAC,UAAU,GAAG,UAAU,EAAE,CAAC,EAAE,CAAC;IAE7D;;;;;;;;;;;OAWG;IACH,YAAY,CACV,IAAI,EAAE,IAAI,EACV,SAAS,EAAE,SAAS,GACnB,UAAU,GAAG,UAAU,EAAE,GAAG,CAAC,UAAU,GAAG,UAAU,EAAE,CAAC,EAAE,CAAC;IAE7D;;OAEG;IACH,KAAK,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAAC;IAE9B;;OAEG;IACH,YAAY,CAAC,MAAM,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IAEtC;;OAEG;IACH,UAAU,IAAI,MAAM,EAAE,GAAG,MAAM,EAAE,EAAE,CAAC;CACrC"}

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

@@ -0,0 +1,103 @@
+import Flatbush from 'flatbush';
+import { safeIndex } from '../../core/errors.js';
+import Blueprints from './blueprints.js';
+import CompoundBlueprint from './compoundBlueprint.js';
+/**
+ * Groups blueprints by bounding box overlap using a spatial index.
+ * Uses Flatbush for O(n log n) performance instead of O(n²) pairwise comparison.
+ */
+const groupByBoundingBoxOverlap = (blueprints) => {
+    if (blueprints.length === 0)
+        return [];
+    if (blueprints.length === 1)
+        return [[safeIndex(blueprints, 0, 'groupByBoundingBoxOverlap')]];
+    // Build spatial index
+    const index = new Flatbush(blueprints.length);
+    for (const bp of blueprints) {
+        const [[xMin, yMin], [xMax, yMax]] = bp.boundingBox.bounds;
+        index.add(xMin, yMin, xMax, yMax);
+    }
+    index.finish();
+    // Find overlaps using spatial queries
+    const overlaps = blueprints.map((blueprint, i) => {
+        const [[xMin, yMin], [xMax, yMax]] = blueprint.boundingBox.bounds;
+        const candidates = index.search(xMin, yMin, xMax, yMax);
+        // Filter to indices > i (to avoid duplicates) and verify overlap
+        return candidates.filter((j) => j > i &&
+            !blueprint.boundingBox.isOut(safeIndex(blueprints, j, 'groupByBoundingBoxOverlap').boundingBox));
+    });
+    // Union-find to group overlapping blueprints
+    const groups = [];
+    const groupsInOverlaps = new Array(overlaps.length);
+    overlaps.forEach((indices, i) => {
+        let myGroup = groupsInOverlaps[i];
+        if (!myGroup) {
+            myGroup = [];
+            groups.push(myGroup);
+        }
+        myGroup.push(safeIndex(blueprints, i, 'groupByBoundingBoxOverlap'));
+        if (indices.length) {
+            indices.forEach((idx) => {
+                groupsInOverlaps[idx] = myGroup;
+            });
+        }
+    });
+    return groups;
+};
+const addContainmentInfo = (groupedBlueprints) => {
+    return groupedBlueprints.map((blueprint, index) => {
+        const firstCurve = safeIndex(blueprint.curves, 0, 'addContainmentInfo');
+        const point = firstCurve.value((firstCurve.lastParameter + firstCurve.firstParameter) / 2);
+        const isIn = groupedBlueprints.filter((potentialOuterBlueprint, j) => {
+            if (index === j)
+                return false;
+            return potentialOuterBlueprint.isInside(point);
+        });
+        return {
+            blueprint,
+            isIn,
+        };
+    });
+};
+const splitMultipleOuterBlueprints = (outerBlueprints, allBlueprints) => {
+    return outerBlueprints.flatMap(({ blueprint: outerBlueprint }) => {
+        return cleanEdgeCases(allBlueprints.filter(({ blueprint, isIn }) => blueprint === outerBlueprint || isIn.indexOf(outerBlueprint) !== -1));
+    });
+};
+const handleNestedBlueprints = (nestedBlueprints, allBlueprints) => {
+    const firstLevelOuterBlueprints = allBlueprints.filter(({ isIn }) => isIn.length <= 1);
+    const innerLevelsBlueprints = cleanEdgeCases(addContainmentInfo(nestedBlueprints.map(({ blueprint }) => blueprint)));
+    return [firstLevelOuterBlueprints, ...innerLevelsBlueprints];
+};
+const cleanEdgeCases = (groupedBlueprints) => {
+    if (!groupedBlueprints.length)
+        return [];
+    const outerBlueprints = groupedBlueprints.filter(({ isIn }) => !isIn.length);
+    const nestedBlueprints = groupedBlueprints.filter(({ isIn }) => isIn.length > 1);
+    if (outerBlueprints.length === 1 && nestedBlueprints.length === 0) {
+        return [groupedBlueprints];
+    }
+    else if (outerBlueprints.length > 1) {
+        return splitMultipleOuterBlueprints(outerBlueprints, groupedBlueprints);
+    }
+    else {
+        return handleNestedBlueprints(nestedBlueprints, groupedBlueprints);
+    }
+};
+/**
+ * Groups an array of blueprints such that blueprints that correspond to holes
+ * in other blueprints are set in a `CompoundBlueprint`.
+ *
+ * The current algorithm does not handle cases where blueprints cross each
+ * other
+ */
+export const organiseBlueprints = (blueprints) => {
+    const basicGrouping = groupByBoundingBoxOverlap(blueprints).map(addContainmentInfo);
+    return new Blueprints(basicGrouping.flatMap(cleanEdgeCases).map((compounds) => {
+        if (compounds.length === 1)
+            return safeIndex(compounds, 0, 'organiseBlueprints').blueprint;
+        compounds.sort((a, b) => a.isIn.length - b.isIn.length);
+        return new CompoundBlueprint(compounds.map(({ blueprint }) => blueprint));
+    }));
+};
+//# sourceMappingURL=lib.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"lib.js","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/2d/blueprints/lib.ts"],"names":[],"mappings":"AAAA,OAAO,QAAQ,MAAM,UAAU,CAAC;AAEhC,OAAO,EAAE,SAAS,EAAE,MAAM,sBAAsB,CAAC;AAUjD,OAAO,UAAU,MAAM,iBAAiB,CAAC;AACzC,OAAO,iBAAiB,MAAM,wBAAwB,CAAC;AAEvD;;;GAGG;AACH,MAAM,yBAAyB,GAAG,CAAC,UAAuB,EAAiB,EAAE;IAC3E,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACvC,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC,SAAS,CAAC,UAAU,EAAE,CAAC,EAAE,2BAA2B,CAAC,CAAC,CAAC,CAAC;IAE9F,sBAAsB;IACtB,MAAM,KAAK,GAAG,IAAI,QAAQ,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IAC9C,KAAK,MAAM,EAAE,IAAI,UAAU,EAAE,CAAC;QAC5B,MAAM,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,WAAW,CAAC,MAAM,CAAC;QAC3D,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;IACpC,CAAC;IACD,KAAK,CAAC,MAAM,EAAE,CAAC;IAEf,sCAAsC;IACtC,MAAM,QAAQ,GAAe,UAAU,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE;QAC3D,MAAM,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,GAAG,SAAS,CAAC,WAAW,CAAC,MAAM,CAAC;QAClE,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QACxD,iEAAiE;QACjE,OAAO,UAAU,CAAC,MAAM,CACtB,CAAC,CAAS,EAAE,EAAE,CACZ,CAAC,GAAG,CAAC;YACL,CAAC,SAAS,CAAC,WAAW,CAAC,KAAK,CAC1B,SAAS,CAAC,UAAU,EAAE,CAAC,EAAE,2BAA2B,CAAC,CAAC,WAAW,CAClE,CACJ,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,6CAA6C;IAC7C,MAAM,MAAM,GAAkB,EAAE,CAAC;IACjC,MAAM,gBAAgB,GAAkB,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IAEnE,QAAQ,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE;QAC9B,IAAI,OAAO,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;QAClC,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,OAAO,GAAG,EAAE,CAAC;YACb,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACvB,CAAC;QAED,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,CAAC,EAAE,2BAA2B,CAAC,CAAC,CAAC;QAEpE,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;YACnB,OAAO,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE;gBACtB,gBAAgB,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC;YAClC,CAAC,CAAC,CAAC;QACL,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAOF,MAAM,kBAAkB,GAAG,CAAC,iBAA8B,EAAwB,EAAE;IAClF,OAAO,iBAAiB,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,KAAK,EAAE,EAAE;QAChD,MAAM,UAAU,GAAG,SAAS,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,oBAAoB,CAAC,CAAC;QACxE,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,UAAU,CAAC,aAAa,GAAG,UAAU,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC;QAE3F,MAAM,IAAI,GAAG,iBAAiB,CAAC,MAAM,CAAC,CAAC,uBAAuB,EAAE,CAAC,EAAE,EAAE;YACnE,IAAI,KAAK,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YAC9B,OAAO,uBAAuB,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACjD,CAAC,CAAC,CAAC;QAEH,OAAO;YACL,SAAS;YACT,IAAI;SACL,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,MAAM,4BAA4B,GAAG,CACnC,eAAqC,EACrC,aAAmC,EACX,EAAE;IAC1B,OAAO,eAAe,CAAC,OAAO,CAAC,CAAC,EAAE,SAAS,EAAE,cAAc,EAAE,EAAE,EAAE;QAC/D,OAAO,cAAc,CACnB,aAAa,CAAC,MAAM,CAClB,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,SAAS,KAAK,cAAc,IAAI,IAAI,CAAC,OAAO,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,CAC7F,CACF,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,MAAM,sBAAsB,GAAG,CAC7B,gBAAsC,EACtC,aAAmC,EACX,EAAE;IAC1B,MAAM,yBAAyB,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC;IAEvF,MAAM,qBAAqB,GAAG,cAAc,CAC1C,kBAAkB,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,CACvE,CAAC;IACF,OAAO,CAAC,yBAAyB,EAAE,GAAG,qBAAqB,CAAC,CAAC;AAC/D,CAAC,CAAC;AAEF,MAAM,cAAc,GAAG,CAAC,iBAAuC,EAA0B,EAAE;IACzF,IAAI,CAAC,iBAAiB,CAAC,MAAM;QAAE,OAAO,EAAE,CAAC;IAEzC,MAAM,eAAe,GAAG,iBAAiB,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC7E,MAAM,gBAAgB,GAAG,iBAAiB,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAEjF,IAAI,eAAe,CAAC,MAAM,KAAK,CAAC,IAAI,gBAAgB,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAClE,OAAO,CAAC,iBAAiB,CAAC,CAAC;IAC7B,CAAC;SAAM,IAAI,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtC,OAAO,4BAA4B,CAAC,eAAe,EAAE,iBAAiB,CAAC,CAAC;IAC1E,CAAC;SAAM,CAAC;QACN,OAAO,sBAAsB,CAAC,gBAAgB,EAAE,iBAAiB,CAAC,CAAC;IACrE,CAAC;AACH,CAAC,CAAC;AAEF;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,UAAuB,EAAc,EAAE;IACxE,MAAM,aAAa,GAAG,yBAAyB,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC;IACpF,OAAO,IAAI,UAAU,CACnB,aAAa,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE;QACtD,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC,SAAS,EAAE,CAAC,EAAE,oBAAoB,CAAC,CAAC,SAAS,CAAC;QAE3F,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACxD,OAAO,IAAI,iBAAiB,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC;IAC5E,CAAC,CAAC,CACH,CAAC;AACJ,CAAC,CAAC","sourcesContent":["import Flatbush from 'flatbush';\n\nimport { safeIndex } from '../../core/errors.js';\n\nimport type { Point2D, BoundingBox2d } from '../../2d/lib/index.js';\nimport type { Face, Wire } from '../../core/shapeTypes.js';\n\nimport type { Plane, PlaneName } from '../../core/planeTypes.js';\nimport type { Vec3, PointInput } from '../../core/types.js';\n\nimport type { ScaleMode } from '../../2d/curves.js';\nimport type Blueprint from './blueprint.js';\nimport Blueprints from './blueprints.js';\nimport CompoundBlueprint from './compoundBlueprint.js';\n\n/**\n * Groups blueprints by bounding box overlap using a spatial index.\n * Uses Flatbush for O(n log n) performance instead of O(n²) pairwise comparison.\n */\nconst groupByBoundingBoxOverlap = (blueprints: Blueprint[]): Blueprint[][] => {\n  if (blueprints.length === 0) return [];\n  if (blueprints.length === 1) return [[safeIndex(blueprints, 0, 'groupByBoundingBoxOverlap')]];\n\n  // Build spatial index\n  const index = new Flatbush(blueprints.length);\n  for (const bp of blueprints) {\n    const [[xMin, yMin], [xMax, yMax]] = bp.boundingBox.bounds;\n    index.add(xMin, yMin, xMax, yMax);\n  }\n  index.finish();\n\n  // Find overlaps using spatial queries\n  const overlaps: number[][] = blueprints.map((blueprint, i) => {\n    const [[xMin, yMin], [xMax, yMax]] = blueprint.boundingBox.bounds;\n    const candidates = index.search(xMin, yMin, xMax, yMax);\n    // Filter to indices > i (to avoid duplicates) and verify overlap\n    return candidates.filter(\n      (j: number) =>\n        j > i &&\n        !blueprint.boundingBox.isOut(\n          safeIndex(blueprints, j, 'groupByBoundingBoxOverlap').boundingBox\n        )\n    );\n  });\n\n  // Union-find to group overlapping blueprints\n  const groups: Blueprint[][] = [];\n  const groupsInOverlaps: Blueprint[][] = new Array(overlaps.length);\n\n  overlaps.forEach((indices, i) => {\n    let myGroup = groupsInOverlaps[i];\n    if (!myGroup) {\n      myGroup = [];\n      groups.push(myGroup);\n    }\n\n    myGroup.push(safeIndex(blueprints, i, 'groupByBoundingBoxOverlap'));\n\n    if (indices.length) {\n      indices.forEach((idx) => {\n        groupsInOverlaps[idx] = myGroup;\n      });\n    }\n  });\n\n  return groups;\n};\n\ninterface ContainedBlueprint {\n  blueprint: Blueprint;\n  isIn: Blueprint[];\n}\n\nconst addContainmentInfo = (groupedBlueprints: Blueprint[]): ContainedBlueprint[] => {\n  return groupedBlueprints.map((blueprint, index) => {\n    const firstCurve = safeIndex(blueprint.curves, 0, 'addContainmentInfo');\n    const point = firstCurve.value((firstCurve.lastParameter + firstCurve.firstParameter) / 2);\n\n    const isIn = groupedBlueprints.filter((potentialOuterBlueprint, j) => {\n      if (index === j) return false;\n      return potentialOuterBlueprint.isInside(point);\n    });\n\n    return {\n      blueprint,\n      isIn,\n    };\n  });\n};\n\nconst splitMultipleOuterBlueprints = (\n  outerBlueprints: ContainedBlueprint[],\n  allBlueprints: ContainedBlueprint[]\n): ContainedBlueprint[][] => {\n  return outerBlueprints.flatMap(({ blueprint: outerBlueprint }) => {\n    return cleanEdgeCases(\n      allBlueprints.filter(\n        ({ blueprint, isIn }) => blueprint === outerBlueprint || isIn.indexOf(outerBlueprint) !== -1\n      )\n    );\n  });\n};\n\nconst handleNestedBlueprints = (\n  nestedBlueprints: ContainedBlueprint[],\n  allBlueprints: ContainedBlueprint[]\n): ContainedBlueprint[][] => {\n  const firstLevelOuterBlueprints = allBlueprints.filter(({ isIn }) => isIn.length <= 1);\n\n  const innerLevelsBlueprints = cleanEdgeCases(\n    addContainmentInfo(nestedBlueprints.map(({ blueprint }) => blueprint))\n  );\n  return [firstLevelOuterBlueprints, ...innerLevelsBlueprints];\n};\n\nconst cleanEdgeCases = (groupedBlueprints: ContainedBlueprint[]): ContainedBlueprint[][] => {\n  if (!groupedBlueprints.length) return [];\n\n  const outerBlueprints = groupedBlueprints.filter(({ isIn }) => !isIn.length);\n  const nestedBlueprints = groupedBlueprints.filter(({ isIn }) => isIn.length > 1);\n\n  if (outerBlueprints.length === 1 && nestedBlueprints.length === 0) {\n    return [groupedBlueprints];\n  } else if (outerBlueprints.length > 1) {\n    return splitMultipleOuterBlueprints(outerBlueprints, groupedBlueprints);\n  } else {\n    return handleNestedBlueprints(nestedBlueprints, groupedBlueprints);\n  }\n};\n\n/**\n * Groups an array of blueprints such that blueprints that correspond to holes\n * in other blueprints are set in a `CompoundBlueprint`.\n *\n * The current algorithm does not handle cases where blueprints cross each\n * other\n */\nexport const organiseBlueprints = (blueprints: Blueprint[]): Blueprints => {\n  const basicGrouping = groupByBoundingBoxOverlap(blueprints).map(addContainmentInfo);\n  return new Blueprints(\n    basicGrouping.flatMap(cleanEdgeCases).map((compounds) => {\n      if (compounds.length === 1) return safeIndex(compounds, 0, 'organiseBlueprints').blueprint;\n\n      compounds.sort((a, b) => a.isIn.length - b.isIn.length);\n      return new CompoundBlueprint(compounds.map(({ blueprint }) => blueprint));\n    })\n  );\n};\n\n/** Plain data returned by blueprint sketchOnPlane/sketchOnFace (Layer 2).\n *  Layer 3 wraps this in a Sketch class. */\nexport interface SketchData {\n  wire: Wire;\n  defaultOrigin?: Vec3;\n  defaultDirection?: Vec3;\n  baseFace?: Face | null;\n}\n\nexport interface DrawingInterface {\n  clone(): DrawingInterface;\n\n  /**\n   * Release the resources held by this drawing, cascading to child blueprints\n   * and their curves. The `boundingBox` handed out earlier dies with it.\n   */\n  delete(): void;\n  [Symbol.dispose](): void;\n\n  boundingBox: BoundingBox2d;\n  stretch(ratio: number, direction: Point2D, origin: Point2D): DrawingInterface;\n\n  rotate(angle: number, center: Point2D): DrawingInterface;\n\n  translate(xDist: number, yDist: number): DrawingInterface;\n  translate(translationVector: Point2D): DrawingInterface;\n\n  /**\n   * Returns the mirror image of this drawing made with a single point (in\n   * center mode, the default, or a plane, (plane mode, with both direction and\n   * origin of the plane).\n   */\n  mirror(centerOrDirection: Point2D, origin?: Point2D, mode?: 'center' | 'plane'): DrawingInterface;\n\n  /**\n   * Returns sketch data for the drawing on a plane.\n   */\n  sketchOnPlane(\n    inputPlane?: PlaneName | Plane,\n    origin?: PointInput | number\n  ): SketchData | SketchData[] | (SketchData | SketchData[])[];\n\n  /**\n   * Returns sketch data for the drawing on a face.\n   *\n   * The scale mode corresponds to the way the coordinates of the drawing are\n   * interpreted match with the face:\n   *\n   * - `original` uses global coordinates (1mm in the drawing is 1mm on the\n   *   face). This is the default, but currently supported only for planar\n   *   and circular faces\n   * - `bounds` normalises the UV parameters on the face to [0,1] intervals.\n   * - `native` uses the default UV parameters of kernel\n   */\n  sketchOnFace(\n    face: Face,\n    scaleMode: ScaleMode\n  ): SketchData | SketchData[] | (SketchData | SketchData[])[];\n\n  /**\n   * Formats the drawing as an SVG image\n   */\n  toSVG(margin: number): string;\n\n  /**\n   * Returns the SVG viewbox that corresponds to this drawing\n   */\n  toSVGViewBox(margin?: number): string;\n\n  /**\n   * Formats the drawing as a list of SVG paths\n   */\n  toSVGPaths(): string[] | string[][];\n}\n"]}

package/dist/vendored/brepjs/2d/blueprints/segmentAssembly.d.ts

@@ -0,0 +1,31 @@
+import type { Curve2D } from '../../2d/lib/index.js';
+import Blueprint from './blueprint.js';
+import type Blueprints from './blueprints.js';
+/**
+ * Split an array of curves into separate continuous paths. A discontinuity
+ * occurs where one curve's lastPoint does not match the next curve's
+ * firstPoint.
+ */
+export declare function splitPaths(curves: Curve2D[]): Curve2D[][];
+interface NoIntersectionResult {
+    readonly identical: false;
+    readonly firstCurveInSecond: boolean;
+    readonly secondCurveInFirst: boolean;
+}
+interface IdenticalResult {
+    readonly identical: true;
+}
+export type BooleanOperationResult = Blueprint | Blueprints | null | IdenticalResult | NoIntersectionResult;
+interface BooleanOperationConfig {
+    readonly firstInside: 'keep' | 'remove';
+    readonly secondInside: 'keep' | 'remove';
+}
+/**
+ * Core boolean operation between two simple (non-compound) blueprints.
+ *
+ * Segments both blueprints at their intersection points, then selects which
+ * segments to keep based on the `firstInside`/`secondInside` configuration.
+ */
+export declare function booleanOperation(first: Blueprint, second: Blueprint, config: BooleanOperationConfig): BooleanOperationResult;
+export {};
+//# sourceMappingURL=segmentAssembly.d.ts.map

package/dist/vendored/brepjs/2d/blueprints/segmentAssembly.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"segmentAssembly.d.ts","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/2d/blueprints/segmentAssembly.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,uBAAuB,CAAC;AAGrD,OAAO,SAAS,MAAM,gBAAgB,CAAC;AACvC,OAAO,KAAK,UAAU,MAAM,iBAAiB,CAAC;AAgE9C;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,MAAM,EAAE,OAAO,EAAE,GAAG,OAAO,EAAE,EAAE,CA6BzD;AAMD,UAAU,oBAAoB;IAC5B,QAAQ,CAAC,SAAS,EAAE,KAAK,CAAC;IAC1B,QAAQ,CAAC,kBAAkB,EAAE,OAAO,CAAC;IACrC,QAAQ,CAAC,kBAAkB,EAAE,OAAO,CAAC;CACtC;AAED,UAAU,eAAe;IACvB,QAAQ,CAAC,SAAS,EAAE,IAAI,CAAC;CAC1B;AAED,MAAM,MAAM,sBAAsB,GAChC,SAAS,GAAG,UAAU,GAAG,IAAI,GAAG,eAAe,GAAG,oBAAoB,CAAC;AAMzE,UAAU,sBAAsB;IAC9B,QAAQ,CAAC,WAAW,EAAE,MAAM,GAAG,QAAQ,CAAC;IACxC,QAAQ,CAAC,YAAY,EAAE,MAAM,GAAG,QAAQ,CAAC;CAC1C;AAmGD;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,SAAS,EAChB,MAAM,EAAE,SAAS,EACjB,MAAM,EAAE,sBAAsB,GAC7B,sBAAsB,CAmExB"}