@faicad/faijs 0.13.0

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

@@ -0,0 +1 @@
+{"version":3,"file":"booleanHelpers.js","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/2d/blueprints/booleanHelpers.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,SAAS,IAAI,gBAAgB,EAAE,sBAAsB,EAAE,MAAM,uBAAuB,CAAC;AAC9F,OAAO,EAAE,GAAG,EAAE,MAAM,sBAAsB,CAAC;AAE3C,8EAA8E;AAC9E,mCAAmC;AACnC,8EAA8E;AAE9E,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC,CAAU,EAAE,CAAU,EAAW,EAAE,CAC3D,gBAAgB,CAAC,CAAC,EAAE,CAAC,EAAE,sBAAsB,CAAC,CAAC;AAEjD,8EAA8E;AAC9E,2DAA2D;AAC3D,8EAA8E;AAE9E;;;;GAIG;AACH,MAAM,UAAU,SAAS,CAAC,CAAU;IAClC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;AACjD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,WAAW,CAAC,KAAc,EAAE,IAAa;IACvD,MAAM,EAAE,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC;IAC5B,MAAM,EAAE,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;IAC3B,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC;AACjD,CAAC;AASD,MAAM,UAAU,cAAc,CAAC,CAAU;IACvC,MAAM,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACnB,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;QACxB,GAAG,CAAC,gBAAgB,EAAE,eAAe,CAAC,CAAC;IACzC,CAAC;IACD,OAAO,KAAK,CAAC,UAAU,CAAC;AAC1B,CAAC;AAED,MAAM,UAAU,YAAY,CAAC,CAAU;IACrC,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC7B,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QACvB,GAAG,CAAC,cAAc,EAAE,eAAe,CAAC,CAAC;IACvC,CAAC;IACD,OAAO,IAAI,CAAC,SAAS,CAAC;AACxB,CAAC;AAED,MAAM,UAAU,cAAc,CAAC,OAAgB;IAC7C,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;QAC1C,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,QAAQ,CAAC,OAAO,EAAE,CAAC;QACnB,OAAO,QAAQ,CAAC;IAClB,CAAC,CAAC,CAAC;AACL,CAAC;AAED,MAAM,UAAU,eAAe,CAAC,QAAmB;IACjD,OAAO,CAAC,GAAG,QAAQ,CAAC,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;AACrD,CAAC;AAED,8EAA8E;AAC9E,4BAA4B;AAC5B,8EAA8E;AAE9E,MAAM,UAAU,aAAa,CAAC,KAAc;IAC1C,MAAM,YAAY,GAAG,CAAC,KAAK,CAAC,aAAa,GAAG,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;IACtE,OAAO,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;AACnC,CAAC;AAED,8EAA8E;AAC9E,yBAAyB;AACzB,8EAA8E;AAE9E;;;;;GAKG;AACH,SAAS,0BAA0B,CAAC,MAAiB,EAAE,KAAc;IACnE,MAAM,UAAU,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC;IACpC,8BAA8B;IAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,KAAK,KAAK,SAAS;YAAE,SAAS;QAClC,IAAI,SAAS,CAAC,KAAK,CAAC,UAAU,CAAC,KAAK,UAAU,IAAI,SAAS,CAAC,KAAK,EAAE,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC;YACrF,OAAO,CAAC,CAAC;QACX,CAAC;IACH,CAAC;IACD,4EAA4E;IAC5E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,KAAK,KAAK,SAAS;YAAE,SAAS;QAClC,IAAI,SAAS,CAAC,KAAK,EAAE,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC;YACvC,OAAO,CAAC,CAAC;QACX,CAAC;IACH,CAAC;IACD,OAAO,CAAC,CAAC,CAAC;AACZ,CAAC;AAED;;;;;GAKG;AACH,SAAS,uBAAuB,CAC9B,MAAiB,EACjB,YAAoB,EACpB,WAAmB,EACnB,SAAsC;IAEtC,8BAA8B;IAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,KAAK,KAAK,SAAS;YAAE,SAAS;QAClC,IACE,SAAS,CAAC,KAAK,CAAC,UAAU,CAAC,KAAK,YAAY;YAC5C,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC,KAAK,WAAW;YAC1C,SAAS,CAAC,KAAK,CAAC,EAChB,CAAC;YACD,OAAO,CAAC,CAAC;QACX,CAAC;IACH,CAAC;IACD,4EAA4E;IAC5E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,KAAK,KAAK,SAAS;YAAE,SAAS;QAClC,IAAI,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;YACrB,OAAO,CAAC,CAAC;QACX,CAAC;IACH,CAAC;IACD,OAAO,CAAC,CAAC,CAAC;AACZ,CAAC;AAED,iFAAiF;AACjF,SAAS,WAAW,CAAI,GAAQ,EAAE,UAAkB;IAClD,IAAI,UAAU,IAAI,CAAC;QAAE,OAAO,GAAG,CAAC;IAChC,OAAO,GAAG,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC;AAChE,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,eAAe,CAAC,MAAiB,EAAE,KAAc;IAC/D,MAAM,UAAU,GAAG,0BAA0B,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IAC7D,OAAO,WAAW,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;AACzC,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,sBAAsB,CAAC,MAAiB,EAAE,OAAgB;IACxE,MAAM,YAAY,GAAG,SAAS,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;IACnD,MAAM,WAAW,GAAG,SAAS,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;IAEjD,2EAA2E;IAC3E,MAAM,cAAc,GAAG,CAAC,KAAc,EAAW,EAAE,CACjD,SAAS,CAAC,OAAO,CAAC,UAAU,EAAE,KAAK,CAAC,UAAU,CAAC;QAC/C,SAAS,CAAC,OAAO,CAAC,SAAS,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;IAEhD,8DAA8D;IAC9D,MAAM,cAAc,GAAG,CAAC,KAAc,EAAW,EAAE,CACjD,SAAS,CAAC,OAAO,CAAC,SAAS,EAAE,KAAK,CAAC,UAAU,CAAC;QAC9C,SAAS,CAAC,OAAO,CAAC,UAAU,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;IAEjD,wEAAwE;IACxE,2DAA2D;IAC3D,SAAS,SAAS,CAChB,KAAgB,EAChB,SAAiB,EACjB,QAAgB,EAChB,OAAoC;QAEpC,MAAM,GAAG,GAAG,uBAAuB,CAAC,KAAK,EAAE,SAAS,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;QACzE,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IACrD,CAAC;IAED,wCAAwC;IACxC,MAAM,MAAM,GAAG,SAAS,CAAC,MAAM,EAAE,YAAY,EAAE,WAAW,EAAE,cAAc,CAAC,CAAC;IAC5E,IAAI,MAAM,KAAK,IAAI;QAAE,OAAO,MAAM,CAAC;IAEnC,4EAA4E;IAC5E,0EAA0E;IAC1E,gFAAgF;IAChF,6DAA6D;IAC7D,yEAAyE;IACzE,MAAM,OAAO,GAAG,SAAS,CAAC,MAAM,EAAE,WAAW,EAAE,YAAY,EAAE,cAAc,CAAC,CAAC;IAC7E,IAAI,OAAO,KAAK,IAAI;QAAE,OAAO,OAAO,CAAC;IAErC,mEAAmE;IACnE,MAAM,QAAQ,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC;IAExC,MAAM,MAAM,GAAG,SAAS,CAAC,QAAQ,EAAE,YAAY,EAAE,WAAW,EAAE,cAAc,CAAC,CAAC;IAC9E,IAAI,MAAM,KAAK,IAAI;QAAE,OAAO,MAAM,CAAC;IAEnC,MAAM,OAAO,GAAG,SAAS,CAAC,QAAQ,EAAE,WAAW,EAAE,YAAY,EAAE,cAAc,CAAC,CAAC;IAC/E,IAAI,OAAO,KAAK,IAAI;QAAE,OAAO,OAAO,CAAC;IAErC,GAAG,CAAC,wBAAwB,EAAE,mCAAmC,CAAC,CAAC;AACrE,CAAC","sourcesContent":["import type { Point2D, Curve2D } from '../../2d/lib/index.js';\nimport { samePoint as defaultSamePoint, PRECISION_INTERSECTION } from '../../2d/lib/index.js';\nimport { bug } from '../../core/errors.js';\n\n// ---------------------------------------------------------------------------\n// Precision-aware point comparison\n// ---------------------------------------------------------------------------\n\nexport const samePoint = (x: Point2D, y: Point2D): boolean =>\n  defaultSamePoint(x, y, PRECISION_INTERSECTION);\n\n// ---------------------------------------------------------------------------\n// Hashing utilities for O(1) lookup of points and segments\n// ---------------------------------------------------------------------------\n\n/**\n * Hash a point for Set/Map lookup using precision rounding.\n * Must match PRECISION_INTERSECTION (1e-9) to avoid hash collisions for\n * nearly-equal points.\n */\nexport function hashPoint(p: Point2D): string {\n  return `${p[0].toFixed(9)},${p[1].toFixed(9)}`;\n}\n\n/**\n * Hash a segment by both orientations for bidirectional lookup.\n * The smaller hash comes first so that (A,B) and (B,A) produce the same key.\n */\nexport function hashSegment(first: Point2D, last: Point2D): string {\n  const h1 = hashPoint(first);\n  const h2 = hashPoint(last);\n  return h1 < h2 ? `${h1}|${h2}` : `${h2}|${h1}`;\n}\n\n// ---------------------------------------------------------------------------\n// Segment type and accessors\n// ---------------------------------------------------------------------------\n\nexport type Segment = Curve2D[];\nexport type IntersectionSegment = [Segment, Segment | 'same'];\n\nexport function startOfSegment(s: Segment): Point2D {\n  const first = s[0];\n  if (first === undefined) {\n    bug('startOfSegment', 'empty segment');\n  }\n  return first.firstPoint;\n}\n\nexport function endOfSegment(s: Segment): Point2D {\n  const last = s[s.length - 1];\n  if (last === undefined) {\n    bug('endOfSegment', 'empty segment');\n  }\n  return last.lastPoint;\n}\n\nexport function reverseSegment(segment: Segment): Segment {\n  return [...segment].reverse().map((curve) => {\n    const newCurve = curve.clone();\n    newCurve.reverse();\n    return newCurve;\n  });\n}\n\nexport function reverseSegments(segments: Segment[]): Segment[] {\n  return [...segments].reverse().map(reverseSegment);\n}\n\n// ---------------------------------------------------------------------------\n// Curve midpoint evaluation\n// ---------------------------------------------------------------------------\n\nexport function curveMidPoint(curve: Curve2D): Point2D {\n  const midParameter = (curve.lastParameter + curve.firstParameter) / 2;\n  return curve.value(midParameter);\n}\n\n// ---------------------------------------------------------------------------\n// Array rotation helpers\n// ---------------------------------------------------------------------------\n\n/**\n * Find the index of the first curve in `curves` whose firstPoint matches\n * `point`. Uses hash for a fast first pass, then falls back to tolerance-only\n * comparison to handle floating-point rounding at `toFixed(9)` boundaries.\n * Returns -1 if no match is found.\n */\nfunction findCurveIndexByStartPoint(curves: Curve2D[], point: Point2D): number {\n  const targetHash = hashPoint(point);\n  // Fast path: hash + tolerance\n  for (let i = 0; i < curves.length; i++) {\n    const curve = curves[i];\n    if (curve === undefined) continue;\n    if (hashPoint(curve.firstPoint) === targetHash && samePoint(point, curve.firstPoint)) {\n      return i;\n    }\n  }\n  // Fallback: tolerance-only (handles hash mismatches at rounding boundaries)\n  for (let i = 0; i < curves.length; i++) {\n    const curve = curves[i];\n    if (curve === undefined) continue;\n    if (samePoint(point, curve.firstPoint)) {\n      return i;\n    }\n  }\n  return -1;\n}\n\n/**\n * Find the index of the first curve in `curves` that matches the given\n * segment's start and end points. Uses hash for a fast first pass, then\n * falls back to tolerance-only comparison.\n * Returns -1 if no match is found.\n */\nfunction findCurveIndexBySegment(\n  curves: Curve2D[],\n  segFirstHash: string,\n  segLastHash: string,\n  matchesFn: (curve: Curve2D) => boolean\n): number {\n  // Fast path: hash + tolerance\n  for (let i = 0; i < curves.length; i++) {\n    const curve = curves[i];\n    if (curve === undefined) continue;\n    if (\n      hashPoint(curve.firstPoint) === segFirstHash &&\n      hashPoint(curve.lastPoint) === segLastHash &&\n      matchesFn(curve)\n    ) {\n      return i;\n    }\n  }\n  // Fallback: tolerance-only (handles hash mismatches at rounding boundaries)\n  for (let i = 0; i < curves.length; i++) {\n    const curve = curves[i];\n    if (curve === undefined) continue;\n    if (matchesFn(curve)) {\n      return i;\n    }\n  }\n  return -1;\n}\n\n/** Rotate an array so that element at `startIndex` becomes the first element. */\nfunction rotateArray<T>(arr: T[], startIndex: number): T[] {\n  if (startIndex <= 0) return arr;\n  return arr.slice(startIndex).concat(arr.slice(0, startIndex));\n}\n\n/**\n * Rotate the curves array so that it starts at the curve whose firstPoint\n * matches the given point.\n */\nexport function rotateToStartAt(curves: Curve2D[], point: Point2D): Curve2D[] {\n  const startIndex = findCurveIndexByStartPoint(curves, point);\n  return rotateArray(curves, startIndex);\n}\n\n/**\n * Rotate the curves array so that it starts at the curve matching the given\n * segment. Tries both segment orientations (forward and flipped) against both\n * curve orientations (original and reversed chain) to handle cases where\n * `intersectCurves` returns a common segment oriented opposite to the\n * matching curve in the split result.\n */\nexport function rotateToStartAtSegment(curves: Curve2D[], segment: Curve2D): Curve2D[] {\n  const segFirstHash = hashPoint(segment.firstPoint);\n  const segLastHash = hashPoint(segment.lastPoint);\n\n  // matchesForward: curve runs in the same direction as segment (first→last)\n  const matchesForward = (curve: Curve2D): boolean =>\n    samePoint(segment.firstPoint, curve.firstPoint) &&\n    samePoint(segment.lastPoint, curve.lastPoint);\n\n  // matchesFlipped: curve runs opposite to segment (last→first)\n  const matchesFlipped = (curve: Curve2D): boolean =>\n    samePoint(segment.lastPoint, curve.firstPoint) &&\n    samePoint(segment.firstPoint, curve.lastPoint);\n\n  // Attempt to locate the segment in `chain` and return a rotated result.\n  // Returns null when the segment is not found in the chain.\n  function tryRotate(\n    chain: Curve2D[],\n    firstHash: string,\n    lastHash: string,\n    matchFn: (curve: Curve2D) => boolean\n  ): Curve2D[] | null {\n    const idx = findCurveIndexBySegment(chain, firstHash, lastHash, matchFn);\n    return idx !== -1 ? rotateArray(chain, idx) : null;\n  }\n\n  // Try forward segment on forward curves\n  const fwdFwd = tryRotate(curves, segFirstHash, segLastHash, matchesForward);\n  if (fwdFwd !== null) return fwdFwd;\n\n  // Try flipped segment on forward curves (common segment oriented opposite).\n  // Expected to trigger only for secondCurveSegments — allCommonSegments[0]\n  // is oriented with the first blueprint's curve direction, so firstCurveSegments\n  // should always match via fwdFwd. The downstream reversal in\n  // blueprintsIntersectionSegments always flips secondIntersectedSegments.\n  const flipFwd = tryRotate(curves, segLastHash, segFirstHash, matchesFlipped);\n  if (flipFwd !== null) return flipFwd;\n\n  // Reverse the chain once; try both segment orientations against it\n  const reversed = reverseSegment(curves);\n\n  const fwdRev = tryRotate(reversed, segFirstHash, segLastHash, matchesForward);\n  if (fwdRev !== null) return fwdRev;\n\n  const flipRev = tryRotate(reversed, segLastHash, segFirstHash, matchesFlipped);\n  if (flipRev !== null) return flipRev;\n\n  bug('rotateToStartAtSegment', 'failed to rotate to segment start');\n}\n"]}

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

@@ -0,0 +1,55 @@
+/**
+ * Boolean operations on 2D blueprints: fuse, cut, and intersect.
+ *
+ * This module is the public API. Internal logic is split across:
+ * - `booleanHelpers.ts` — hashing, segment types, rotation utilities
+ * - `intersectionSegments.ts` — curve intersection and segment pairing
+ * - `segmentAssembly.ts` — segment selection and path assembly
+ */
+import Blueprint from './blueprint.js';
+import Blueprints from './blueprints.js';
+export type { Segment, IntersectionSegment } from './booleanHelpers.js';
+export { blueprintsIntersectionSegments } from './intersectionSegments.js';
+/**
+ * Compute the boolean union of two simple blueprints.
+ *
+ * Segments each blueprint at their intersection points, discards segments
+ * inside the other shape, and reassembles the remaining curves.
+ *
+ * @param first - First blueprint operand.
+ * @param second - Second blueprint operand.
+ * @returns The fused outline, a {@link Blueprints} if the result is
+ *   disjoint, or `null` if the operation produces no geometry.
+ *
+ * @remarks Both blueprints must be closed. For compound or multi-blueprint
+ * inputs, use {@link fuse2D} instead.
+ */
+export declare function fuseBlueprints(first: Blueprint, second: Blueprint): null | Blueprint | Blueprints;
+/**
+ * Compute the boolean difference of two simple blueprints (first minus second).
+ *
+ * Segments the blueprints at their intersections, keeps segments of the first
+ * that are outside the second, and segments of the second that are inside the
+ * first (reversed to form the boundary of the cut).
+ *
+ * @param first - Base blueprint to cut from.
+ * @param second - Tool blueprint to subtract.
+ * @returns The remaining outline, or `null` if nothing remains.
+ *
+ * @remarks Both blueprints must be closed. For compound inputs use {@link cut2D}.
+ */
+export declare function cutBlueprints(first: Blueprint, second: Blueprint): null | Blueprint | Blueprints;
+/**
+ * Compute the boolean intersection of two simple blueprints.
+ *
+ * Keeps only the segments of each blueprint that lie inside the other,
+ * producing the overlapping region.
+ *
+ * @param first - First blueprint operand.
+ * @param second - Second blueprint operand.
+ * @returns The intersection outline, or `null` if the blueprints do not overlap.
+ *
+ * @remarks Both blueprints must be closed. For compound inputs use {@link intersect2D}.
+ */
+export declare function intersectBlueprints(first: Blueprint, second: Blueprint): null | Blueprint | Blueprints;
+//# sourceMappingURL=booleanOperations.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"booleanOperations.d.ts","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/2d/blueprints/booleanOperations.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,SAAS,MAAM,gBAAgB,CAAC;AACvC,OAAO,UAAU,MAAM,iBAAiB,CAAC;AAKzC,YAAY,EAAE,OAAO,EAAE,mBAAmB,EAAE,MAAM,qBAAqB,CAAC;AACxE,OAAO,EAAE,8BAA8B,EAAE,MAAM,2BAA2B,CAAC;AAM3E;;;;;;;;;;;;;GAaG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,GAAG,IAAI,GAAG,SAAS,GAAG,UAAU,CAqBjG;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,GAAG,IAAI,GAAG,SAAS,GAAG,UAAU,CAqBhG;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,mBAAmB,CACjC,KAAK,EAAE,SAAS,EAChB,MAAM,EAAE,SAAS,GAChB,IAAI,GAAG,SAAS,GAAG,UAAU,CAqB/B"}

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

@@ -0,0 +1,110 @@
+/**
+ * Boolean operations on 2D blueprints: fuse, cut, and intersect.
+ *
+ * This module is the public API. Internal logic is split across:
+ * - `booleanHelpers.ts` — hashing, segment types, rotation utilities
+ * - `intersectionSegments.ts` — curve intersection and segment pairing
+ * - `segmentAssembly.ts` — segment selection and path assembly
+ */
+import Blueprint from './blueprint.js';
+import Blueprints from './blueprints.js';
+import CompoundBlueprint from './compoundBlueprint.js';
+import { booleanOperation } from './segmentAssembly.js';
+export { blueprintsIntersectionSegments } from './intersectionSegments.js';
+// ---------------------------------------------------------------------------
+// Public boolean operations
+// ---------------------------------------------------------------------------
+/**
+ * Compute the boolean union of two simple blueprints.
+ *
+ * Segments each blueprint at their intersection points, discards segments
+ * inside the other shape, and reassembles the remaining curves.
+ *
+ * @param first - First blueprint operand.
+ * @param second - Second blueprint operand.
+ * @returns The fused outline, a {@link Blueprints} if the result is
+ *   disjoint, or `null` if the operation produces no geometry.
+ *
+ * @remarks Both blueprints must be closed. For compound or multi-blueprint
+ * inputs, use {@link fuse2D} instead.
+ */
+export function fuseBlueprints(first, second) {
+    const result = booleanOperation(first, second, {
+        firstInside: 'remove',
+        secondInside: 'remove',
+    });
+    if (result === null || result instanceof Blueprint || result instanceof Blueprints)
+        return result;
+    if (result.identical) {
+        return first.clone();
+    }
+    if (result.firstCurveInSecond) {
+        return second.clone();
+    }
+    if (result.secondCurveInFirst) {
+        return first.clone();
+    }
+    return new Blueprints([first, second]);
+}
+/**
+ * Compute the boolean difference of two simple blueprints (first minus second).
+ *
+ * Segments the blueprints at their intersections, keeps segments of the first
+ * that are outside the second, and segments of the second that are inside the
+ * first (reversed to form the boundary of the cut).
+ *
+ * @param first - Base blueprint to cut from.
+ * @param second - Tool blueprint to subtract.
+ * @returns The remaining outline, or `null` if nothing remains.
+ *
+ * @remarks Both blueprints must be closed. For compound inputs use {@link cut2D}.
+ */
+export function cutBlueprints(first, second) {
+    const result = booleanOperation(first, second, {
+        firstInside: 'remove',
+        secondInside: 'keep',
+    });
+    if (result === null || result instanceof Blueprint || result instanceof Blueprints)
+        return result;
+    if (result.identical) {
+        return null;
+    }
+    if (result.firstCurveInSecond) {
+        return null;
+    }
+    if (result.secondCurveInFirst) {
+        return new Blueprints([new CompoundBlueprint([first, second])]);
+    }
+    return first.clone();
+}
+/**
+ * Compute the boolean intersection of two simple blueprints.
+ *
+ * Keeps only the segments of each blueprint that lie inside the other,
+ * producing the overlapping region.
+ *
+ * @param first - First blueprint operand.
+ * @param second - Second blueprint operand.
+ * @returns The intersection outline, or `null` if the blueprints do not overlap.
+ *
+ * @remarks Both blueprints must be closed. For compound inputs use {@link intersect2D}.
+ */
+export function intersectBlueprints(first, second) {
+    const result = booleanOperation(first, second, {
+        firstInside: 'keep',
+        secondInside: 'keep',
+    });
+    if (result === null || result instanceof Blueprint || result instanceof Blueprints)
+        return result;
+    if (result.identical) {
+        return first.clone();
+    }
+    if (result.firstCurveInSecond) {
+        return first.clone();
+    }
+    if (result.secondCurveInFirst) {
+        return second.clone();
+    }
+    return null;
+}
+//# sourceMappingURL=booleanOperations.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"booleanOperations.js","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/2d/blueprints/booleanOperations.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,SAAS,MAAM,gBAAgB,CAAC;AACvC,OAAO,UAAU,MAAM,iBAAiB,CAAC;AACzC,OAAO,iBAAiB,MAAM,wBAAwB,CAAC;AACvD,OAAO,EAAE,gBAAgB,EAAE,MAAM,sBAAsB,CAAC;AAIxD,OAAO,EAAE,8BAA8B,EAAE,MAAM,2BAA2B,CAAC;AAE3E,8EAA8E;AAC9E,4BAA4B;AAC5B,8EAA8E;AAE9E;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,cAAc,CAAC,KAAgB,EAAE,MAAiB;IAChE,MAAM,MAAM,GAAG,gBAAgB,CAAC,KAAK,EAAE,MAAM,EAAE;QAC7C,WAAW,EAAE,QAAQ;QACrB,YAAY,EAAE,QAAQ;KACvB,CAAC,CAAC;IAEH,IAAI,MAAM,KAAK,IAAI,IAAI,MAAM,YAAY,SAAS,IAAI,MAAM,YAAY,UAAU;QAAE,OAAO,MAAM,CAAC;IAElG,IAAI,MAAM,CAAC,SAAS,EAAE,CAAC;QACrB,OAAO,KAAK,CAAC,KAAK,EAAE,CAAC;IACvB,CAAC;IAED,IAAI,MAAM,CAAC,kBAAkB,EAAE,CAAC;QAC9B,OAAO,MAAM,CAAC,KAAK,EAAE,CAAC;IACxB,CAAC;IAED,IAAI,MAAM,CAAC,kBAAkB,EAAE,CAAC;QAC9B,OAAO,KAAK,CAAC,KAAK,EAAE,CAAC;IACvB,CAAC;IAED,OAAO,IAAI,UAAU,CAAC,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC;AACzC,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,aAAa,CAAC,KAAgB,EAAE,MAAiB;IAC/D,MAAM,MAAM,GAAG,gBAAgB,CAAC,KAAK,EAAE,MAAM,EAAE;QAC7C,WAAW,EAAE,QAAQ;QACrB,YAAY,EAAE,MAAM;KACrB,CAAC,CAAC;IAEH,IAAI,MAAM,KAAK,IAAI,IAAI,MAAM,YAAY,SAAS,IAAI,MAAM,YAAY,UAAU;QAAE,OAAO,MAAM,CAAC;IAElG,IAAI,MAAM,CAAC,SAAS,EAAE,CAAC;QACrB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,IAAI,MAAM,CAAC,kBAAkB,EAAE,CAAC;QAC9B,OAAO,IAAI,CAAC;IACd,CAAC;IAED,IAAI,MAAM,CAAC,kBAAkB,EAAE,CAAC;QAC9B,OAAO,IAAI,UAAU,CAAC,CAAC,IAAI,iBAAiB,CAAC,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IAClE,CAAC;IAED,OAAO,KAAK,CAAC,KAAK,EAAE,CAAC;AACvB,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,mBAAmB,CACjC,KAAgB,EAChB,MAAiB;IAEjB,MAAM,MAAM,GAAG,gBAAgB,CAAC,KAAK,EAAE,MAAM,EAAE;QAC7C,WAAW,EAAE,MAAM;QACnB,YAAY,EAAE,MAAM;KACrB,CAAC,CAAC;IAEH,IAAI,MAAM,KAAK,IAAI,IAAI,MAAM,YAAY,SAAS,IAAI,MAAM,YAAY,UAAU;QAAE,OAAO,MAAM,CAAC;IAElG,IAAI,MAAM,CAAC,SAAS,EAAE,CAAC;QACrB,OAAO,KAAK,CAAC,KAAK,EAAE,CAAC;IACvB,CAAC;IAED,IAAI,MAAM,CAAC,kBAAkB,EAAE,CAAC;QAC9B,OAAO,KAAK,CAAC,KAAK,EAAE,CAAC;IACvB,CAAC;IAED,IAAI,MAAM,CAAC,kBAAkB,EAAE,CAAC;QAC9B,OAAO,MAAM,CAAC,KAAK,EAAE,CAAC;IACxB,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC","sourcesContent":["/**\n * Boolean operations on 2D blueprints: fuse, cut, and intersect.\n *\n * This module is the public API. Internal logic is split across:\n * - `booleanHelpers.ts` — hashing, segment types, rotation utilities\n * - `intersectionSegments.ts` — curve intersection and segment pairing\n * - `segmentAssembly.ts` — segment selection and path assembly\n */\n\nimport Blueprint from './blueprint.js';\nimport Blueprints from './blueprints.js';\nimport CompoundBlueprint from './compoundBlueprint.js';\nimport { booleanOperation } from './segmentAssembly.js';\n\n// Re-export internal types and functions for backward compatibility\nexport type { Segment, IntersectionSegment } from './booleanHelpers.js';\nexport { blueprintsIntersectionSegments } from './intersectionSegments.js';\n\n// ---------------------------------------------------------------------------\n// Public boolean operations\n// ---------------------------------------------------------------------------\n\n/**\n * Compute the boolean union of two simple blueprints.\n *\n * Segments each blueprint at their intersection points, discards segments\n * inside the other shape, and reassembles the remaining curves.\n *\n * @param first - First blueprint operand.\n * @param second - Second blueprint operand.\n * @returns The fused outline, a {@link Blueprints} if the result is\n *   disjoint, or `null` if the operation produces no geometry.\n *\n * @remarks Both blueprints must be closed. For compound or multi-blueprint\n * inputs, use {@link fuse2D} instead.\n */\nexport function fuseBlueprints(first: Blueprint, second: Blueprint): null | Blueprint | Blueprints {\n  const result = booleanOperation(first, second, {\n    firstInside: 'remove',\n    secondInside: 'remove',\n  });\n\n  if (result === null || result instanceof Blueprint || result instanceof Blueprints) return result;\n\n  if (result.identical) {\n    return first.clone();\n  }\n\n  if (result.firstCurveInSecond) {\n    return second.clone();\n  }\n\n  if (result.secondCurveInFirst) {\n    return first.clone();\n  }\n\n  return new Blueprints([first, second]);\n}\n\n/**\n * Compute the boolean difference of two simple blueprints (first minus second).\n *\n * Segments the blueprints at their intersections, keeps segments of the first\n * that are outside the second, and segments of the second that are inside the\n * first (reversed to form the boundary of the cut).\n *\n * @param first - Base blueprint to cut from.\n * @param second - Tool blueprint to subtract.\n * @returns The remaining outline, or `null` if nothing remains.\n *\n * @remarks Both blueprints must be closed. For compound inputs use {@link cut2D}.\n */\nexport function cutBlueprints(first: Blueprint, second: Blueprint): null | Blueprint | Blueprints {\n  const result = booleanOperation(first, second, {\n    firstInside: 'remove',\n    secondInside: 'keep',\n  });\n\n  if (result === null || result instanceof Blueprint || result instanceof Blueprints) return result;\n\n  if (result.identical) {\n    return null;\n  }\n\n  if (result.firstCurveInSecond) {\n    return null;\n  }\n\n  if (result.secondCurveInFirst) {\n    return new Blueprints([new CompoundBlueprint([first, second])]);\n  }\n\n  return first.clone();\n}\n\n/**\n * Compute the boolean intersection of two simple blueprints.\n *\n * Keeps only the segments of each blueprint that lie inside the other,\n * producing the overlapping region.\n *\n * @param first - First blueprint operand.\n * @param second - Second blueprint operand.\n * @returns The intersection outline, or `null` if the blueprints do not overlap.\n *\n * @remarks Both blueprints must be closed. For compound inputs use {@link intersect2D}.\n */\nexport function intersectBlueprints(\n  first: Blueprint,\n  second: Blueprint\n): null | Blueprint | Blueprints {\n  const result = booleanOperation(first, second, {\n    firstInside: 'keep',\n    secondInside: 'keep',\n  });\n\n  if (result === null || result instanceof Blueprint || result instanceof Blueprints) return result;\n\n  if (result.identical) {\n    return first.clone();\n  }\n\n  if (result.firstCurveInSecond) {\n    return first.clone();\n  }\n\n  if (result.secondCurveInFirst) {\n    return second.clone();\n  }\n\n  return null;\n}\n"]}

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

@@ -0,0 +1,41 @@
+import type Blueprint from './blueprint.js';
+/**
+ * Create a regular polygon blueprint inscribed in a circle of the given radius.
+ *
+ * @param radius - Circumscribed circle radius.
+ * @param sidesCount - Number of sides (3 = triangle, 6 = hexagon, etc.).
+ * @param sagitta - When non-zero, sides are replaced by sagitta arcs (bulge height).
+ * @returns A closed Blueprint representing the polygon.
+ *
+ * @example
+ * ```ts
+ * const hexagon = polysidesBlueprint(10, 6);
+ * const roundedTriangle = polysidesBlueprint(10, 3, 2);
+ * ```
+ */
+export declare const polysidesBlueprint: (radius: number, sidesCount: number, sagitta?: number) => Blueprint;
+/**
+ * Create an axis-aligned rectangle blueprint with optional rounded corners.
+ *
+ * The rectangle is centered at the origin. When `r` is zero the corners
+ * are sharp; otherwise they are filleted with circular or elliptical arcs.
+ *
+ * @param width - Total width of the rectangle.
+ * @param height - Total height of the rectangle.
+ * @param r - Corner radius. Pass a number for uniform rounding, or
+ *   `{ rx, ry }` for elliptical corners. Clamped to half the respective
+ *   dimension.
+ * @returns A closed Blueprint representing the rectangle.
+ *
+ * @example
+ * ```ts
+ * const sharp = roundedRectangleBlueprint(20, 10);
+ * const rounded = roundedRectangleBlueprint(20, 10, 3);
+ * const elliptical = roundedRectangleBlueprint(20, 10, { rx: 4, ry: 2 });
+ * ```
+ */
+export declare const roundedRectangleBlueprint: (width: number, height: number, r?: number | {
+    rx?: number;
+    ry?: number;
+}) => Blueprint;
+//# sourceMappingURL=cannedBlueprints.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"cannedBlueprints.d.ts","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/2d/blueprints/cannedBlueprints.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,SAAS,MAAM,gBAAgB,CAAC;AAI5C;;;;;;;;;;;;;GAaG;AACH,eAAO,MAAM,kBAAkB,GAAI,QAAQ,MAAM,EAAE,YAAY,MAAM,EAAE,gBAAW,KAAG,SAiBpF,CAAC;AAEF;;;;;;;;;;;;;;;;;;;GAmBG;AACH,eAAO,MAAM,yBAAyB,GACpC,OAAO,MAAM,EACb,QAAQ,MAAM,EACd,IAAG,MAAM,GAAG;IAAE,EAAE,CAAC,EAAE,MAAM,CAAC;IAAC,EAAE,CAAC,EAAE,MAAM,CAAA;CAAM,cAwC7C,CAAC"}

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

@@ -0,0 +1,90 @@
+import { BlueprintSketcher } from './blueprintSketcher.js';
+import { lastOrThrow } from '../../utils/arrayAccess.js';
+/**
+ * Create a regular polygon blueprint inscribed in a circle of the given radius.
+ *
+ * @param radius - Circumscribed circle radius.
+ * @param sidesCount - Number of sides (3 = triangle, 6 = hexagon, etc.).
+ * @param sagitta - When non-zero, sides are replaced by sagitta arcs (bulge height).
+ * @returns A closed Blueprint representing the polygon.
+ *
+ * @example
+ * ```ts
+ * const hexagon = polysidesBlueprint(10, 6);
+ * const roundedTriangle = polysidesBlueprint(10, 3, 2);
+ * ```
+ */
+export const polysidesBlueprint = (radius, sidesCount, sagitta = 0) => {
+    const points = [...Array(sidesCount).keys()].map((i) => {
+        const theta = -((Math.PI * 2) / sidesCount) * i;
+        return [radius * Math.sin(theta), radius * Math.cos(theta)];
+    });
+    // We start with the last point to make sure the shape is complete
+    const lastPoint = lastOrThrow(points);
+    const blueprint = new BlueprintSketcher().movePointerTo([lastPoint[0], lastPoint[1]]);
+    if (sagitta) {
+        points.forEach(([x, y]) => blueprint.sagittaArcTo([x, y], sagitta));
+    }
+    else {
+        points.forEach(([x, y]) => blueprint.lineTo([x, y]));
+    }
+    return blueprint.done();
+};
+/**
+ * Create an axis-aligned rectangle blueprint with optional rounded corners.
+ *
+ * The rectangle is centered at the origin. When `r` is zero the corners
+ * are sharp; otherwise they are filleted with circular or elliptical arcs.
+ *
+ * @param width - Total width of the rectangle.
+ * @param height - Total height of the rectangle.
+ * @param r - Corner radius. Pass a number for uniform rounding, or
+ *   `{ rx, ry }` for elliptical corners. Clamped to half the respective
+ *   dimension.
+ * @returns A closed Blueprint representing the rectangle.
+ *
+ * @example
+ * ```ts
+ * const sharp = roundedRectangleBlueprint(20, 10);
+ * const rounded = roundedRectangleBlueprint(20, 10, 3);
+ * const elliptical = roundedRectangleBlueprint(20, 10, { rx: 4, ry: 2 });
+ * ```
+ */
+export const roundedRectangleBlueprint = (width, height, r = 0) => {
+    const { rx: inputRx = 0, ry: inputRy = 0 } = typeof r === 'number' ? { ry: r, rx: r } : r;
+    let rx = Math.min(inputRx, width / 2);
+    let ry = Math.min(inputRy, height / 2);
+    const withRadius = rx && ry;
+    if (!withRadius) {
+        rx = 0;
+        ry = 0;
+    }
+    const symmetricRadius = rx === ry;
+    const sk = new BlueprintSketcher([Math.min(0, -(width / 2 - rx)), -height / 2]);
+    const addFillet = (xDist, yDist) => {
+        if (withRadius) {
+            if (symmetricRadius)
+                sk.tangentArc(xDist, yDist);
+            else
+                sk.ellipse(xDist, yDist, rx, ry, 0, false, true);
+        }
+    };
+    if (rx < width / 2) {
+        sk.hLine(width - 2 * rx);
+    }
+    addFillet(rx, ry);
+    if (ry < height / 2) {
+        sk.vLine(height - 2 * ry);
+    }
+    addFillet(-rx, ry);
+    if (rx < width / 2) {
+        sk.hLine(-(width - 2 * rx));
+    }
+    addFillet(-rx, -ry);
+    if (ry < height / 2) {
+        sk.vLine(-(height - 2 * ry));
+    }
+    addFillet(rx, -ry);
+    return sk.close();
+};
+//# sourceMappingURL=cannedBlueprints.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"cannedBlueprints.js","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/2d/blueprints/cannedBlueprints.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,iBAAiB,EAAE,MAAM,wBAAwB,CAAC;AAC3D,OAAO,EAAE,WAAW,EAAE,MAAM,4BAA4B,CAAC;AAEzD;;;;;;;;;;;;;GAaG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,MAAc,EAAE,UAAkB,EAAE,OAAO,GAAG,CAAC,EAAa,EAAE;IAC/F,MAAM,MAAM,GAAuB,CAAC,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QACzE,MAAM,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;QAChD,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAqB,CAAC;IAClF,CAAC,CAAC,CAAC;IAEH,kEAAkE;IAClE,MAAM,SAAS,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC;IACtC,MAAM,SAAS,GAAG,IAAI,iBAAiB,EAAE,CAAC,aAAa,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEtF,IAAI,OAAO,EAAE,CAAC;QACZ,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;IACtE,CAAC;SAAM,CAAC;QACN,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACvD,CAAC;IAED,OAAO,SAAS,CAAC,IAAI,EAAE,CAAC;AAC1B,CAAC,CAAC;AAEF;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,CAAC,MAAM,yBAAyB,GAAG,CACvC,KAAa,EACb,MAAc,EACd,IAA2C,CAAC,EAC5C,EAAE;IACF,MAAM,EAAE,EAAE,EAAE,OAAO,GAAG,CAAC,EAAE,EAAE,EAAE,OAAO,GAAG,CAAC,EAAE,GAAG,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAE1F,IAAI,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;IACtC,IAAI,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC;IAEvC,MAAM,UAAU,GAAG,EAAE,IAAI,EAAE,CAAC;IAC5B,IAAI,CAAC,UAAU,EAAE,CAAC;QAChB,EAAE,GAAG,CAAC,CAAC;QACP,EAAE,GAAG,CAAC,CAAC;IACT,CAAC;IACD,MAAM,eAAe,GAAG,EAAE,KAAK,EAAE,CAAC;IAElC,MAAM,EAAE,GAAG,IAAI,iBAAiB,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IAEhF,MAAM,SAAS,GAAG,CAAC,KAAa,EAAE,KAAa,EAAE,EAAE;QACjD,IAAI,UAAU,EAAE,CAAC;YACf,IAAI,eAAe;gBAAE,EAAE,CAAC,UAAU,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;;gBAC5C,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;QACxD,CAAC;IACH,CAAC,CAAC;IAEF,IAAI,EAAE,GAAG,KAAK,GAAG,CAAC,EAAE,CAAC;QACnB,EAAE,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC;IAC3B,CAAC;IACD,SAAS,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAClB,IAAI,EAAE,GAAG,MAAM,GAAG,CAAC,EAAE,CAAC;QACpB,EAAE,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC;IAC5B,CAAC;IACD,SAAS,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACnB,IAAI,EAAE,GAAG,KAAK,GAAG,CAAC,EAAE,CAAC;QACnB,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAC9B,CAAC;IACD,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;IACpB,IAAI,EAAE,GAAG,MAAM,GAAG,CAAC,EAAE,CAAC;QACpB,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAC/B,CAAC;IACD,SAAS,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;IACnB,OAAO,EAAE,CAAC,KAAK,EAAE,CAAC;AACpB,CAAC,CAAC","sourcesContent":["import type Blueprint from './blueprint.js';\nimport { BlueprintSketcher } from './blueprintSketcher.js';\nimport { lastOrThrow } from '../../utils/arrayAccess.js';\n\n/**\n * Create a regular polygon blueprint inscribed in a circle of the given radius.\n *\n * @param radius - Circumscribed circle radius.\n * @param sidesCount - Number of sides (3 = triangle, 6 = hexagon, etc.).\n * @param sagitta - When non-zero, sides are replaced by sagitta arcs (bulge height).\n * @returns A closed Blueprint representing the polygon.\n *\n * @example\n * ```ts\n * const hexagon = polysidesBlueprint(10, 6);\n * const roundedTriangle = polysidesBlueprint(10, 3, 2);\n * ```\n */\nexport const polysidesBlueprint = (radius: number, sidesCount: number, sagitta = 0): Blueprint => {\n  const points: [number, number][] = [...Array(sidesCount).keys()].map((i) => {\n    const theta = -((Math.PI * 2) / sidesCount) * i;\n    return [radius * Math.sin(theta), radius * Math.cos(theta)] as [number, number];\n  });\n\n  // We start with the last point to make sure the shape is complete\n  const lastPoint = lastOrThrow(points);\n  const blueprint = new BlueprintSketcher().movePointerTo([lastPoint[0], lastPoint[1]]);\n\n  if (sagitta) {\n    points.forEach(([x, y]) => blueprint.sagittaArcTo([x, y], sagitta));\n  } else {\n    points.forEach(([x, y]) => blueprint.lineTo([x, y]));\n  }\n\n  return blueprint.done();\n};\n\n/**\n * Create an axis-aligned rectangle blueprint with optional rounded corners.\n *\n * The rectangle is centered at the origin. When `r` is zero the corners\n * are sharp; otherwise they are filleted with circular or elliptical arcs.\n *\n * @param width - Total width of the rectangle.\n * @param height - Total height of the rectangle.\n * @param r - Corner radius. Pass a number for uniform rounding, or\n *   `{ rx, ry }` for elliptical corners. Clamped to half the respective\n *   dimension.\n * @returns A closed Blueprint representing the rectangle.\n *\n * @example\n * ```ts\n * const sharp = roundedRectangleBlueprint(20, 10);\n * const rounded = roundedRectangleBlueprint(20, 10, 3);\n * const elliptical = roundedRectangleBlueprint(20, 10, { rx: 4, ry: 2 });\n * ```\n */\nexport const roundedRectangleBlueprint = (\n  width: number,\n  height: number,\n  r: number | { rx?: number; ry?: number } = 0\n) => {\n  const { rx: inputRx = 0, ry: inputRy = 0 } = typeof r === 'number' ? { ry: r, rx: r } : r;\n\n  let rx = Math.min(inputRx, width / 2);\n  let ry = Math.min(inputRy, height / 2);\n\n  const withRadius = rx && ry;\n  if (!withRadius) {\n    rx = 0;\n    ry = 0;\n  }\n  const symmetricRadius = rx === ry;\n\n  const sk = new BlueprintSketcher([Math.min(0, -(width / 2 - rx)), -height / 2]);\n\n  const addFillet = (xDist: number, yDist: number) => {\n    if (withRadius) {\n      if (symmetricRadius) sk.tangentArc(xDist, yDist);\n      else sk.ellipse(xDist, yDist, rx, ry, 0, false, true);\n    }\n  };\n\n  if (rx < width / 2) {\n    sk.hLine(width - 2 * rx);\n  }\n  addFillet(rx, ry);\n  if (ry < height / 2) {\n    sk.vLine(height - 2 * ry);\n  }\n  addFillet(-rx, ry);\n  if (rx < width / 2) {\n    sk.hLine(-(width - 2 * rx));\n  }\n  addFillet(-rx, -ry);\n  if (ry < height / 2) {\n    sk.vLine(-(height - 2 * ry));\n  }\n  addFillet(rx, -ry);\n  return sk.close();\n};\n"]}

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

@@ -0,0 +1,85 @@
+import type { Point2D } from '../../2d/lib/index.js';
+import { BoundingBox2d } from '../../2d/lib/index.js';
+import type Blueprint from './blueprint.js';
+import type { DrawingInterface, SketchData } from './lib.js';
+import type { AnyShape, Dimension, Face } from '../../core/shapeTypes.js';
+import type { Plane, PlaneName } from '../../core/planeTypes.js';
+import type { PointInput } from '../../core/types.js';
+import type { ScaleMode } from '../../2d/curves.js';
+import type { SingleFace } from '../../query/helpers.js';
+/**
+ * Represent a 2D profile with holes (an outer boundary minus inner cutouts).
+ *
+ * The first element of {@link blueprints} is the outer boundary; all subsequent
+ * elements are holes subtracted from it. `CompoundBlueprint` implements the
+ * same {@link DrawingInterface} as {@link Blueprint}, so it can be transformed,
+ * sketched, and serialized to SVG in the same way.
+ *
+ * @see {@link Blueprint} for simple profiles without holes.
+ * @see {@link Blueprints} for collections of disjoint profiles.
+ */
+export default class CompoundBlueprint implements DrawingInterface {
+    /**
+     * Ordered array where `blueprints[0]` is the outer boundary and the
+     * remaining entries are inner holes.
+     */
+    blueprints: Blueprint[];
+    protected _boundingBox: BoundingBox2d | null;
+    /**
+     * Create a compound blueprint from an outer boundary and optional holes.
+     *
+     * @param blueprints - First element is the outer boundary; subsequent
+     *   elements are holes.
+     * @throws BrepBugError if the array is empty (use {@link createCompoundBlueprint} for Result-based validation).
+     */
+    constructor(blueprints: Blueprint[]);
+    /** Release the resources held by every child blueprint and the cached bounding box. */
+    delete(): void;
+    [Symbol.dispose](): void;
+    /** Return a deep copy of this compound blueprint and all its children. */
+    clone(): CompoundBlueprint;
+    /** Compute (and cache) the combined bounding box of all child blueprints. */
+    get boundingBox(): BoundingBox2d;
+    /** Return a multi-line debug representation showing outline and holes. */
+    get repr(): string;
+    /** Stretch all child blueprints along a direction by a given ratio. */
+    stretch(ratio: number, direction: Point2D, origin: Point2D): CompoundBlueprint;
+    /** Rotate all child blueprints by an angle in degrees. */
+    rotate(angle: number, center?: Point2D): CompoundBlueprint;
+    /** Uniformly scale all child blueprints around a center point. */
+    scale(scaleFactor: number, center?: Point2D): CompoundBlueprint;
+    /** Translate all child blueprints by separate x/y distances or a vector. */
+    translate(xDist: number, yDist: number): CompoundBlueprint;
+    translate(translationVector: Point2D): CompoundBlueprint;
+    /** Mirror all child blueprints across a point or plane. */
+    mirror(centerOrDirection: Point2D, origin?: Point2D, mode?: 'center' | 'plane'): CompoundBlueprint;
+    /** Project all child blueprints onto a 3D plane.
+     *
+     * @returns One {@link SketchData} per child blueprint (outer boundary + holes).
+     */
+    sketchOnPlane(plane?: PlaneName | Plane, origin?: PointInput | number): SketchData[];
+    /** Map all child blueprints onto a 3D face's UV surface.
+     *
+     * @returns One {@link SketchData} per child blueprint.
+     */
+    sketchOnFace(face: Face, scaleMode?: ScaleMode): SketchData[];
+    /**
+     * Punch a hole through a solid using the outer boundary of this compound.
+     *
+     * @remarks Only the outer boundary (`blueprints[0]`) is used for the hole.
+     */
+    punchHole(shape: AnyShape<Dimension>, face: SingleFace, options?: {
+        height?: number;
+        origin?: PointInput;
+        draftAngle?: number;
+    }): AnyShape<Dimension>;
+    /** Compute the SVG `viewBox` attribute for this compound blueprint. */
+    toSVGViewBox(margin?: number): string;
+    /** Return SVG path `d` strings for every child blueprint. */
+    toSVGPaths(): string[];
+    /** Wrap all child SVG paths in a `<g>` group element string. */
+    toSVGGroup(): string;
+    /** Render a complete SVG document string for this compound blueprint. */
+    toSVG(margin?: number): string;
+}
+//# sourceMappingURL=compoundBlueprint.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"compoundBlueprint.d.ts","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/2d/blueprints/compoundBlueprint.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,uBAAuB,CAAC;AACrD,OAAO,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAC;AAGtD,OAAO,KAAK,SAAS,MAAM,gBAAgB,CAAC;AAC5C,OAAO,KAAK,EAAE,gBAAgB,EAAE,UAAU,EAAE,MAAM,UAAU,CAAC;AAG7D,OAAO,KAAK,EAAE,QAAQ,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,0BAA0B,CAAC;AAE1E,OAAO,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,0BAA0B,CAAC;AACjE,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AAEtD,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AACpD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,wBAAwB,CAAC;AAEzD;;;;;;;;;;GAUG;AACH,MAAM,CAAC,OAAO,OAAO,iBAAkB,YAAW,gBAAgB;IAChE;;;OAGG;IACH,UAAU,EAAE,SAAS,EAAE,CAAC;IACxB,SAAS,CAAC,YAAY,EAAE,aAAa,GAAG,IAAI,CAAC;IAE7C;;;;;;OAMG;gBACS,UAAU,EAAE,SAAS,EAAE;IAWnC,uFAAuF;IACvF,MAAM,IAAI,IAAI;IAUd,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,IAAI;IAIxB,0EAA0E;IAC1E,KAAK,IAAI,iBAAiB;IAI1B,6EAA6E;IAC7E,IAAI,WAAW,IAAI,aAAa,CAS/B;IAED,0EAA0E;IAC1E,IAAI,IAAI,WAQP;IAED,uEAAuE;IACvE,OAAO,CAAC,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,GAAG,iBAAiB;IAI9E,0DAA0D;IAC1D,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,iBAAiB;IAI1D,kEAAkE;IAClE,KAAK,CAAC,WAAW,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,iBAAiB;IAK/D,4EAA4E;IAC5E,SAAS,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,iBAAiB;IAC1D,SAAS,CAAC,iBAAiB,EAAE,OAAO,GAAG,iBAAiB;IAWxD,2DAA2D;IAC3D,MAAM,CACJ,iBAAiB,EAAE,OAAO,EAC1B,MAAM,CAAC,EAAE,OAAO,EAChB,IAAI,CAAC,EAAE,QAAQ,GAAG,OAAO,GACxB,iBAAiB;IAMpB;;;OAGG;IACH,aAAa,CAAC,KAAK,CAAC,EAAE,SAAS,GAAG,KAAK,EAAE,MAAM,CAAC,EAAE,UAAU,GAAG,MAAM,GAAG,UAAU,EAAE;IAIpF;;;OAGG;IACH,YAAY,CAAC,IAAI,EAAE,IAAI,EAAE,SAAS,CAAC,EAAE,SAAS,GAAG,UAAU,EAAE;IAI7D;;;;OAIG;IACH,SAAS,CACP,KAAK,EAAE,QAAQ,CAAC,SAAS,CAAC,EAC1B,IAAI,EAAE,UAAU,EAChB,OAAO,GAAE;QACP,MAAM,CAAC,EAAE,MAAM,CAAC;QAChB,MAAM,CAAC,EAAE,UAAU,CAAC;QACpB,UAAU,CAAC,EAAE,MAAM,CAAC;KAChB,GACL,QAAQ,CAAC,SAAS,CAAC;IAItB,uEAAuE;IACvE,YAAY,CAAC,MAAM,SAAI;IAIvB,6DAA6D;IAC7D,UAAU;IAIV,gEAAgE;IAChE,UAAU;IAIV,yEAAyE;IACzE,KAAK,CAAC,MAAM,SAAI;CAGjB"}

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

@@ -0,0 +1,136 @@
+import { BoundingBox2d } from '../../2d/lib/index.js';
+import { firstOrThrow } from '../../utils/arrayAccess.js';
+import { bug } from '../../core/errors.js';
+import { asSVG, viewbox } from './svg.js';
+/**
+ * Represent a 2D profile with holes (an outer boundary minus inner cutouts).
+ *
+ * The first element of {@link blueprints} is the outer boundary; all subsequent
+ * elements are holes subtracted from it. `CompoundBlueprint` implements the
+ * same {@link DrawingInterface} as {@link Blueprint}, so it can be transformed,
+ * sketched, and serialized to SVG in the same way.
+ *
+ * @see {@link Blueprint} for simple profiles without holes.
+ * @see {@link Blueprints} for collections of disjoint profiles.
+ */
+export default class CompoundBlueprint {
+    /**
+     * Ordered array where `blueprints[0]` is the outer boundary and the
+     * remaining entries are inner holes.
+     */
+    blueprints;
+    _boundingBox;
+    /**
+     * Create a compound blueprint from an outer boundary and optional holes.
+     *
+     * @param blueprints - First element is the outer boundary; subsequent
+     *   elements are holes.
+     * @throws BrepBugError if the array is empty (use {@link createCompoundBlueprint} for Result-based validation).
+     */
+    constructor(blueprints) {
+        if (blueprints.length === 0) {
+            bug('CompoundBlueprint', 'requires at least one blueprint (the outer boundary) — use createCompoundBlueprint() for Result-based validation');
+        }
+        this.blueprints = blueprints;
+        this._boundingBox = null;
+    }
+    /** Release the resources held by every child blueprint and the cached bounding box. */
+    delete() {
+        this.blueprints.forEach((bp) => {
+            bp.delete();
+        });
+        if (this._boundingBox) {
+            this._boundingBox.delete();
+            this._boundingBox = null;
+        }
+    }
+    [Symbol.dispose]() {
+        this.delete();
+    }
+    /** Return a deep copy of this compound blueprint and all its children. */
+    clone() {
+        return new CompoundBlueprint(this.blueprints.map((bp) => bp.clone()));
+    }
+    /** Compute (and cache) the combined bounding box of all child blueprints. */
+    get boundingBox() {
+        if (!this._boundingBox) {
+            const box = new BoundingBox2d();
+            this.blueprints.forEach((b) => {
+                box.add(b.boundingBox);
+            });
+            this._boundingBox = box;
+        }
+        return this._boundingBox;
+    }
+    /** Return a multi-line debug representation showing outline and holes. */
+    get repr() {
+        return [
+            'Compound Blueprints',
+            '-- Outline',
+            firstOrThrow(this.blueprints).repr,
+            '-- Holes',
+            ...this.blueprints.slice(1).map((b) => b.repr),
+        ].join('\n');
+    }
+    /** Stretch all child blueprints along a direction by a given ratio. */
+    stretch(ratio, direction, origin) {
+        return new CompoundBlueprint(this.blueprints.map((bp) => bp.stretch(ratio, direction, origin)));
+    }
+    /** Rotate all child blueprints by an angle in degrees. */
+    rotate(angle, center) {
+        return new CompoundBlueprint(this.blueprints.map((bp) => bp.rotate(angle, center)));
+    }
+    /** Uniformly scale all child blueprints around a center point. */
+    scale(scaleFactor, center) {
+        const centerPoint = center || this.boundingBox.center;
+        return new CompoundBlueprint(this.blueprints.map((bp) => bp.scale(scaleFactor, centerPoint)));
+    }
+    translate(xDistOrPoint, yDist = 0) {
+        return new CompoundBlueprint(this.blueprints.map((bp) => typeof xDistOrPoint === 'number'
+            ? bp.translate(xDistOrPoint, yDist)
+            : bp.translate(xDistOrPoint)));
+    }
+    /** Mirror all child blueprints across a point or plane. */
+    mirror(centerOrDirection, origin, mode) {
+        return new CompoundBlueprint(this.blueprints.map((bp) => bp.mirror(centerOrDirection, origin, mode)));
+    }
+    /** Project all child blueprints onto a 3D plane.
+     *
+     * @returns One {@link SketchData} per child blueprint (outer boundary + holes).
+     */
+    sketchOnPlane(plane, origin) {
+        return this.blueprints.map((blueprint) => blueprint.sketchOnPlane(plane, origin));
+    }
+    /** Map all child blueprints onto a 3D face's UV surface.
+     *
+     * @returns One {@link SketchData} per child blueprint.
+     */
+    sketchOnFace(face, scaleMode) {
+        return this.blueprints.map((blueprint) => blueprint.sketchOnFace(face, scaleMode));
+    }
+    /**
+     * Punch a hole through a solid using the outer boundary of this compound.
+     *
+     * @remarks Only the outer boundary (`blueprints[0]`) is used for the hole.
+     */
+    punchHole(shape, face, options = {}) {
+        return firstOrThrow(this.blueprints).punchHole(shape, face, options);
+    }
+    /** Compute the SVG `viewBox` attribute for this compound blueprint. */
+    toSVGViewBox(margin = 1) {
+        return viewbox(this.boundingBox, margin);
+    }
+    /** Return SVG path `d` strings for every child blueprint. */
+    toSVGPaths() {
+        return this.blueprints.flatMap((bp) => bp.toSVGPaths());
+    }
+    /** Wrap all child SVG paths in a `<g>` group element string. */
+    toSVGGroup() {
+        return `<g>${this.blueprints.map((b) => b.toSVGPath()).join('')}</g>`;
+    }
+    /** Render a complete SVG document string for this compound blueprint. */
+    toSVG(margin = 1) {
+        return asSVG(this.toSVGGroup(), this.boundingBox, margin);
+    }
+}
+//# sourceMappingURL=compoundBlueprint.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"compoundBlueprint.js","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/2d/blueprints/compoundBlueprint.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAC;AACtD,OAAO,EAAE,YAAY,EAAE,MAAM,4BAA4B,CAAC;AAC1D,OAAO,EAAE,GAAG,EAAE,MAAM,sBAAsB,CAAC;AAG3C,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,UAAU,CAAC;AAU1C;;;;;;;;;;GAUG;AACH,MAAM,CAAC,OAAO,OAAO,iBAAiB;IACpC;;;OAGG;IACH,UAAU,CAAc;IACd,YAAY,CAAuB;IAE7C;;;;;;OAMG;IACH,YAAY,UAAuB;QACjC,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5B,GAAG,CACD,mBAAmB,EACnB,kHAAkH,CACnH,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC;IAC3B,CAAC;IAED,uFAAuF;IACvF,MAAM;QACJ,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE;YAC7B,EAAE,CAAC,MAAM,EAAE,CAAC;QACd,CAAC,CAAC,CAAC;QACH,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACtB,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC;YAC3B,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC;QAC3B,CAAC;IACH,CAAC;IAED,CAAC,MAAM,CAAC,OAAO,CAAC;QACd,IAAI,CAAC,MAAM,EAAE,CAAC;IAChB,CAAC;IAED,0EAA0E;IAC1E,KAAK;QACH,OAAO,IAAI,iBAAiB,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IACxE,CAAC;IAED,6EAA6E;IAC7E,IAAI,WAAW;QACb,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC;YACvB,MAAM,GAAG,GAAG,IAAI,aAAa,EAAE,CAAC;YAChC,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;gBAC5B,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;YACzB,CAAC,CAAC,CAAC;YACH,IAAI,CAAC,YAAY,GAAG,GAAG,CAAC;QAC1B,CAAC;QACD,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IAED,0EAA0E;IAC1E,IAAI,IAAI;QACN,OAAO;YACL,qBAAqB;YACrB,YAAY;YACZ,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,IAAI;YAClC,UAAU;YACV,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;SAC/C,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACf,CAAC;IAED,uEAAuE;IACvE,OAAO,CAAC,KAAa,EAAE,SAAkB,EAAE,MAAe;QACxD,OAAO,IAAI,iBAAiB,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;IAClG,CAAC;IAED,0DAA0D;IAC1D,MAAM,CAAC,KAAa,EAAE,MAAgB;QACpC,OAAO,IAAI,iBAAiB,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;IACtF,CAAC;IAED,kEAAkE;IAClE,KAAK,CAAC,WAAmB,EAAE,MAAgB;QACzC,MAAM,WAAW,GAAG,MAAM,IAAI,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC;QACtD,OAAO,IAAI,iBAAiB,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC;IAChG,CAAC;IAKD,SAAS,CAAC,YAA8B,EAAE,KAAK,GAAG,CAAC;QACjD,OAAO,IAAI,iBAAiB,CAC1B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CACzB,OAAO,YAAY,KAAK,QAAQ;YAC9B,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,YAAY,EAAE,KAAK,CAAC;YACnC,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,YAAY,CAAC,CAC/B,CACF,CAAC;IACJ,CAAC;IAED,2DAA2D;IAC3D,MAAM,CACJ,iBAA0B,EAC1B,MAAgB,EAChB,IAAyB;QAEzB,OAAO,IAAI,iBAAiB,CAC1B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,CAAC,iBAAiB,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC,CACxE,CAAC;IACJ,CAAC;IAED;;;OAGG;IACH,aAAa,CAAC,KAAyB,EAAE,MAA4B;QACnE,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,aAAa,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC;IACpF,CAAC;IAED;;;OAGG;IACH,YAAY,CAAC,IAAU,EAAE,SAAqB;QAC5C,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,YAAY,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC;IACrF,CAAC;IAED;;;;OAIG;IACH,SAAS,CACP,KAA0B,EAC1B,IAAgB,EAChB,UAII,EAAE;QAEN,OAAO,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,SAAS,CAAC,KAAK,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;IACvE,CAAC;IAED,uEAAuE;IACvE,YAAY,CAAC,MAAM,GAAG,CAAC;QACrB,OAAO,OAAO,CAAC,IAAI,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;IAC3C,CAAC;IAED,6DAA6D;IAC7D,UAAU;QACR,OAAO,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,UAAU,EAAE,CAAC,CAAC;IAC1D,CAAC;IAED,gEAAgE;IAChE,UAAU;QACR,OAAO,MAAM,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC;IACxE,CAAC;IAED,yEAAyE;IACzE,KAAK,CAAC,MAAM,GAAG,CAAC;QACd,OAAO,KAAK,CAAC,IAAI,CAAC,UAAU,EAAE,EAAE,IAAI,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;IAC5D,CAAC;CACF","sourcesContent":["import type { Point2D } from '../../2d/lib/index.js';\nimport { BoundingBox2d } from '../../2d/lib/index.js';\nimport { firstOrThrow } from '../../utils/arrayAccess.js';\nimport { bug } from '../../core/errors.js';\nimport type Blueprint from './blueprint.js';\nimport type { DrawingInterface, SketchData } from './lib.js';\nimport { asSVG, viewbox } from './svg.js';\n\nimport type { AnyShape, Dimension, Face } from '../../core/shapeTypes.js';\n\nimport type { Plane, PlaneName } from '../../core/planeTypes.js';\nimport type { PointInput } from '../../core/types.js';\n\nimport type { ScaleMode } from '../../2d/curves.js';\nimport type { SingleFace } from '../../query/helpers.js';\n\n/**\n * Represent a 2D profile with holes (an outer boundary minus inner cutouts).\n *\n * The first element of {@link blueprints} is the outer boundary; all subsequent\n * elements are holes subtracted from it. `CompoundBlueprint` implements the\n * same {@link DrawingInterface} as {@link Blueprint}, so it can be transformed,\n * sketched, and serialized to SVG in the same way.\n *\n * @see {@link Blueprint} for simple profiles without holes.\n * @see {@link Blueprints} for collections of disjoint profiles.\n */\nexport default class CompoundBlueprint implements DrawingInterface {\n  /**\n   * Ordered array where `blueprints[0]` is the outer boundary and the\n   * remaining entries are inner holes.\n   */\n  blueprints: Blueprint[];\n  protected _boundingBox: BoundingBox2d | null;\n\n  /**\n   * Create a compound blueprint from an outer boundary and optional holes.\n   *\n   * @param blueprints - First element is the outer boundary; subsequent\n   *   elements are holes.\n   * @throws BrepBugError if the array is empty (use {@link createCompoundBlueprint} for Result-based validation).\n   */\n  constructor(blueprints: Blueprint[]) {\n    if (blueprints.length === 0) {\n      bug(\n        'CompoundBlueprint',\n        'requires at least one blueprint (the outer boundary) — use createCompoundBlueprint() for Result-based validation'\n      );\n    }\n    this.blueprints = blueprints;\n    this._boundingBox = null;\n  }\n\n  /** Release the resources held by every child blueprint and the cached bounding box. */\n  delete(): void {\n    this.blueprints.forEach((bp) => {\n      bp.delete();\n    });\n    if (this._boundingBox) {\n      this._boundingBox.delete();\n      this._boundingBox = null;\n    }\n  }\n\n  [Symbol.dispose](): void {\n    this.delete();\n  }\n\n  /** Return a deep copy of this compound blueprint and all its children. */\n  clone(): CompoundBlueprint {\n    return new CompoundBlueprint(this.blueprints.map((bp) => bp.clone()));\n  }\n\n  /** Compute (and cache) the combined bounding box of all child blueprints. */\n  get boundingBox(): BoundingBox2d {\n    if (!this._boundingBox) {\n      const box = new BoundingBox2d();\n      this.blueprints.forEach((b) => {\n        box.add(b.boundingBox);\n      });\n      this._boundingBox = box;\n    }\n    return this._boundingBox;\n  }\n\n  /** Return a multi-line debug representation showing outline and holes. */\n  get repr() {\n    return [\n      'Compound Blueprints',\n      '-- Outline',\n      firstOrThrow(this.blueprints).repr,\n      '-- Holes',\n      ...this.blueprints.slice(1).map((b) => b.repr),\n    ].join('\\n');\n  }\n\n  /** Stretch all child blueprints along a direction by a given ratio. */\n  stretch(ratio: number, direction: Point2D, origin: Point2D): CompoundBlueprint {\n    return new CompoundBlueprint(this.blueprints.map((bp) => bp.stretch(ratio, direction, origin)));\n  }\n\n  /** Rotate all child blueprints by an angle in degrees. */\n  rotate(angle: number, center?: Point2D): CompoundBlueprint {\n    return new CompoundBlueprint(this.blueprints.map((bp) => bp.rotate(angle, center)));\n  }\n\n  /** Uniformly scale all child blueprints around a center point. */\n  scale(scaleFactor: number, center?: Point2D): CompoundBlueprint {\n    const centerPoint = center || this.boundingBox.center;\n    return new CompoundBlueprint(this.blueprints.map((bp) => bp.scale(scaleFactor, centerPoint)));\n  }\n\n  /** Translate all child blueprints by separate x/y distances or a vector. */\n  translate(xDist: number, yDist: number): CompoundBlueprint;\n  translate(translationVector: Point2D): CompoundBlueprint;\n  translate(xDistOrPoint: number | Point2D, yDist = 0): CompoundBlueprint {\n    return new CompoundBlueprint(\n      this.blueprints.map((bp) =>\n        typeof xDistOrPoint === 'number'\n          ? bp.translate(xDistOrPoint, yDist)\n          : bp.translate(xDistOrPoint)\n      )\n    );\n  }\n\n  /** Mirror all child blueprints across a point or plane. */\n  mirror(\n    centerOrDirection: Point2D,\n    origin?: Point2D,\n    mode?: 'center' | 'plane'\n  ): CompoundBlueprint {\n    return new CompoundBlueprint(\n      this.blueprints.map((bp) => bp.mirror(centerOrDirection, origin, mode))\n    );\n  }\n\n  /** Project all child blueprints onto a 3D plane.\n   *\n   * @returns One {@link SketchData} per child blueprint (outer boundary + holes).\n   */\n  sketchOnPlane(plane?: PlaneName | Plane, origin?: PointInput | number): SketchData[] {\n    return this.blueprints.map((blueprint) => blueprint.sketchOnPlane(plane, origin));\n  }\n\n  /** Map all child blueprints onto a 3D face's UV surface.\n   *\n   * @returns One {@link SketchData} per child blueprint.\n   */\n  sketchOnFace(face: Face, scaleMode?: ScaleMode): SketchData[] {\n    return this.blueprints.map((blueprint) => blueprint.sketchOnFace(face, scaleMode));\n  }\n\n  /**\n   * Punch a hole through a solid using the outer boundary of this compound.\n   *\n   * @remarks Only the outer boundary (`blueprints[0]`) is used for the hole.\n   */\n  punchHole(\n    shape: AnyShape<Dimension>,\n    face: SingleFace,\n    options: {\n      height?: number;\n      origin?: PointInput;\n      draftAngle?: number;\n    } = {}\n  ): AnyShape<Dimension> {\n    return firstOrThrow(this.blueprints).punchHole(shape, face, options);\n  }\n\n  /** Compute the SVG `viewBox` attribute for this compound blueprint. */\n  toSVGViewBox(margin = 1) {\n    return viewbox(this.boundingBox, margin);\n  }\n\n  /** Return SVG path `d` strings for every child blueprint. */\n  toSVGPaths() {\n    return this.blueprints.flatMap((bp) => bp.toSVGPaths());\n  }\n\n  /** Wrap all child SVG paths in a `<g>` group element string. */\n  toSVGGroup() {\n    return `<g>${this.blueprints.map((b) => b.toSVGPath()).join('')}</g>`;\n  }\n\n  /** Render a complete SVG document string for this compound blueprint. */\n  toSVG(margin = 1) {\n    return asSVG(this.toSVGGroup(), this.boundingBox, margin);\n  }\n}\n"]}