@faicad/faijs 0.13.0

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

@@ -0,0 +1,57 @@
+/**
+ * Standalone functions for Blueprint operations.
+ *
+ * Each function wraps the corresponding {@link Blueprint} class method as a
+ * pure function, enabling a functional programming style.
+ *
+ * @see {@link Blueprint} for the OOP equivalent.
+ */
+import type { Point2D, BoundingBox2d } from '../../2d/lib/index.js';
+import type Blueprint from './blueprint.js';
+import type CompoundBlueprint from './compoundBlueprint.js';
+import type { PointInput } from '../../core/types.js';
+import type { Plane, PlaneName } from '../../core/planeTypes.js';
+import type { Face } from '../../core/shapeTypes.js';
+import type { ScaleMode } from '../../2d/curves.js';
+import { type Result } from '../../core/result.js';
+/**
+ * Create a new Blueprint from an ordered array of 2D curves.
+ *
+ * Returns a `Result` — use `unwrap()` in tests or `isOk()`/`match()` in
+ * production code.
+ *
+ * @see {@link Blueprint} constructor.
+ */
+export declare function createBlueprint(curves: Blueprint['curves']): Result<Blueprint>;
+/**
+ * Create a CompoundBlueprint from an outer boundary and optional holes.
+ *
+ * The first element of `blueprints` is the outer boundary; subsequent
+ * elements are subtracted as holes.
+ *
+ * @see {@link CompoundBlueprint} constructor.
+ */
+export declare function createCompoundBlueprint(blueprints: Blueprint[]): Result<CompoundBlueprint>;
+/** Get the axis-aligned bounding box of a 2D blueprint. */
+export declare function getBounds2D(bp: Blueprint): BoundingBox2d;
+/** Get the winding direction of a 2D blueprint. */
+export declare function getOrientation2D(bp: Blueprint): 'clockwise' | 'counterClockwise';
+/** Test whether a 2D point lies strictly inside a blueprint. */
+export declare function isInside2D(bp: Blueprint, point: Point2D): boolean;
+/** Convert a 2D blueprint to an SVG path d attribute string. */
+export declare function toSVGPathD(bp: Blueprint): string;
+/** Translate a 2D blueprint by the given x and y distances. */
+export declare function translate2D(bp: Blueprint, dx: number, dy: number): Blueprint;
+/** Rotate a 2D blueprint by the given angle in degrees. */
+export declare function rotate2D(bp: Blueprint, angle: number, center?: Point2D): Blueprint;
+/** Uniformly scale a 2D blueprint by a factor around a center point. */
+export declare function scale2D(bp: Blueprint, factor: number, center?: Point2D): Blueprint;
+/** Mirror a 2D blueprint across a point or plane. */
+export declare function mirror2D(bp: Blueprint, centerOrDirection: Point2D, origin?: Point2D, mode?: 'center' | 'plane'): Blueprint;
+/** Stretch a 2D blueprint along a direction by a given ratio. */
+export declare function stretch2D(bp: Blueprint, ratio: number, direction: Point2D, origin?: Point2D): Blueprint;
+/** Project a blueprint onto a 3D plane, producing sketch data. */
+export declare function sketchOnPlane2D(bp: Blueprint, inputPlane?: PlaneName | Plane, origin?: PointInput | number): any;
+/** Map a blueprint onto a 3D face's UV surface, producing sketch data. */
+export declare function sketchOnFace2D(bp: Blueprint, face: Face, scaleMode?: ScaleMode): any;
+//# sourceMappingURL=blueprintFns.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"blueprintFns.d.ts","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/2d/blueprints/blueprintFns.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,OAAO,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAC;AAEpE,OAAO,KAAK,SAAS,MAAM,gBAAgB,CAAC;AAE5C,OAAO,KAAK,iBAAiB,MAAM,wBAAwB,CAAC;AAC5D,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AACtD,OAAO,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,0BAA0B,CAAC;AACjE,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,0BAA0B,CAAC;AACrD,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AACpD,OAAO,EAAE,KAAK,MAAM,EAAW,MAAM,sBAAsB,CAAC;AAG5D;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAAC,MAAM,EAAE,SAAS,CAAC,QAAQ,CAAC,GAAG,MAAM,CAAC,SAAS,CAAC,CAU9E;AAED;;;;;;;GAOG;AACH,wBAAgB,uBAAuB,CAAC,UAAU,EAAE,SAAS,EAAE,GAAG,MAAM,CAAC,iBAAiB,CAAC,CAU1F;AAID,2DAA2D;AAC3D,wBAAgB,WAAW,CAAC,EAAE,EAAE,SAAS,GAAG,aAAa,CAExD;AAED,mDAAmD;AACnD,wBAAgB,gBAAgB,CAAC,EAAE,EAAE,SAAS,GAAG,WAAW,GAAG,kBAAkB,CAEhF;AAED,gEAAgE;AAChE,wBAAgB,UAAU,CAAC,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,OAAO,GAAG,OAAO,CAEjE;AAED,gEAAgE;AAChE,wBAAgB,UAAU,CAAC,EAAE,EAAE,SAAS,GAAG,MAAM,CAEhD;AAID,+DAA+D;AAC/D,wBAAgB,WAAW,CAAC,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,SAAS,CAE5E;AAED,2DAA2D;AAC3D,wBAAgB,QAAQ,CAAC,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,SAAS,CAElF;AAED,wEAAwE;AACxE,wBAAgB,OAAO,CAAC,EAAE,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,SAAS,CAElF;AAED,qDAAqD;AACrD,wBAAgB,QAAQ,CACtB,EAAE,EAAE,SAAS,EACb,iBAAiB,EAAE,OAAO,EAC1B,MAAM,CAAC,EAAE,OAAO,EAChB,IAAI,CAAC,EAAE,QAAQ,GAAG,OAAO,GACxB,SAAS,CAEX;AAED,iEAAiE;AACjE,wBAAgB,SAAS,CACvB,EAAE,EAAE,SAAS,EACb,KAAK,EAAE,MAAM,EACb,SAAS,EAAE,OAAO,EAClB,MAAM,CAAC,EAAE,OAAO,GACf,SAAS,CAEX;AAID,kEAAkE;AAClE,wBAAgB,eAAe,CAC7B,EAAE,EAAE,SAAS,EACb,UAAU,CAAC,EAAE,SAAS,GAAG,KAAK,EAC9B,MAAM,CAAC,EAAE,UAAU,GAAG,MAAM,GAE3B,GAAG,CAEL;AAED,0EAA0E;AAC1E,wBAAgB,cAAc,CAC5B,EAAE,EAAE,SAAS,EACb,IAAI,EAAE,IAAI,EACV,SAAS,CAAC,EAAE,SAAS,GAEpB,GAAG,CAEL"}

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

@@ -0,0 +1,92 @@
+/**
+ * Standalone functions for Blueprint operations.
+ *
+ * Each function wraps the corresponding {@link Blueprint} class method as a
+ * pure function, enabling a functional programming style.
+ *
+ * @see {@link Blueprint} for the OOP equivalent.
+ */
+import BlueprintClass from './blueprint.js';
+import CompoundBlueprintClass from './compoundBlueprint.js';
+import { ok, err } from '../../core/result.js';
+import { validationError, BrepErrorCode } from '../../core/errors.js';
+/**
+ * Create a new Blueprint from an ordered array of 2D curves.
+ *
+ * Returns a `Result` — use `unwrap()` in tests or `isOk()`/`match()` in
+ * production code.
+ *
+ * @see {@link Blueprint} constructor.
+ */
+export function createBlueprint(curves) {
+    if (curves.length === 0) {
+        return err(validationError(BrepErrorCode.BLUEPRINT_EMPTY_CURVES, 'createBlueprint: at least one curve is required'));
+    }
+    return ok(new BlueprintClass(curves));
+}
+/**
+ * Create a CompoundBlueprint from an outer boundary and optional holes.
+ *
+ * The first element of `blueprints` is the outer boundary; subsequent
+ * elements are subtracted as holes.
+ *
+ * @see {@link CompoundBlueprint} constructor.
+ */
+export function createCompoundBlueprint(blueprints) {
+    if (blueprints.length === 0) {
+        return err(validationError(BrepErrorCode.COMPOUND_BLUEPRINT_EMPTY, 'createCompoundBlueprint: at least one blueprint (outer boundary) is required'));
+    }
+    return ok(new CompoundBlueprintClass(blueprints));
+}
+// ── Utility Functions (Clean 2D API) ──
+/** Get the axis-aligned bounding box of a 2D blueprint. */
+export function getBounds2D(bp) {
+    return bp.boundingBox;
+}
+/** Get the winding direction of a 2D blueprint. */
+export function getOrientation2D(bp) {
+    return bp.orientation;
+}
+/** Test whether a 2D point lies strictly inside a blueprint. */
+export function isInside2D(bp, point) {
+    return bp.isInside(point);
+}
+/** Convert a 2D blueprint to an SVG path d attribute string. */
+export function toSVGPathD(bp) {
+    return bp.toSVGPathD();
+}
+// ── Transform Functions (Clean 2D API) ──
+/** Translate a 2D blueprint by the given x and y distances. */
+export function translate2D(bp, dx, dy) {
+    return bp.translate(dx, dy);
+}
+/** Rotate a 2D blueprint by the given angle in degrees. */
+export function rotate2D(bp, angle, center) {
+    return bp.rotate(angle, center);
+}
+/** Uniformly scale a 2D blueprint by a factor around a center point. */
+export function scale2D(bp, factor, center) {
+    return bp.scale(factor, center);
+}
+/** Mirror a 2D blueprint across a point or plane. */
+export function mirror2D(bp, centerOrDirection, origin, mode) {
+    return bp.mirror(centerOrDirection, origin, mode);
+}
+/** Stretch a 2D blueprint along a direction by a given ratio. */
+export function stretch2D(bp, ratio, direction, origin) {
+    return bp.stretch(ratio, direction, origin);
+}
+// ── Sketching Functions (Clean 2D API) ──
+/** Project a blueprint onto a 3D plane, producing sketch data. */
+export function sketchOnPlane2D(bp, inputPlane, origin
+// eslint-disable-next-line @typescript-eslint/no-explicit-any -- Sketch type not yet ported
+) {
+    return bp.sketchOnPlane(inputPlane, origin);
+}
+/** Map a blueprint onto a 3D face's UV surface, producing sketch data. */
+export function sketchOnFace2D(bp, face, scaleMode
+// eslint-disable-next-line @typescript-eslint/no-explicit-any -- Sketch types not yet ported
+) {
+    return bp.sketchOnFace(face, scaleMode);
+}
+//# sourceMappingURL=blueprintFns.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"blueprintFns.js","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/2d/blueprints/blueprintFns.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAGH,OAAO,cAAc,MAAM,gBAAgB,CAAC;AAE5C,OAAO,sBAAsB,MAAM,wBAAwB,CAAC;AAM5D,OAAO,EAAe,EAAE,EAAE,GAAG,EAAE,MAAM,sBAAsB,CAAC;AAC5D,OAAO,EAAE,eAAe,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AAEtE;;;;;;;GAOG;AACH,MAAM,UAAU,eAAe,CAAC,MAA2B;IACzD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,OAAO,GAAG,CACR,eAAe,CACb,aAAa,CAAC,sBAAsB,EACpC,iDAAiD,CAClD,CACF,CAAC;IACJ,CAAC;IACD,OAAO,EAAE,CAAC,IAAI,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC;AACxC,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,uBAAuB,CAAC,UAAuB;IAC7D,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5B,OAAO,GAAG,CACR,eAAe,CACb,aAAa,CAAC,wBAAwB,EACtC,8EAA8E,CAC/E,CACF,CAAC;IACJ,CAAC;IACD,OAAO,EAAE,CAAC,IAAI,sBAAsB,CAAC,UAAU,CAAC,CAAC,CAAC;AACpD,CAAC;AAED,yCAAyC;AAEzC,2DAA2D;AAC3D,MAAM,UAAU,WAAW,CAAC,EAAa;IACvC,OAAO,EAAE,CAAC,WAAW,CAAC;AACxB,CAAC;AAED,mDAAmD;AACnD,MAAM,UAAU,gBAAgB,CAAC,EAAa;IAC5C,OAAO,EAAE,CAAC,WAAW,CAAC;AACxB,CAAC;AAED,gEAAgE;AAChE,MAAM,UAAU,UAAU,CAAC,EAAa,EAAE,KAAc;IACtD,OAAO,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;AAC5B,CAAC;AAED,gEAAgE;AAChE,MAAM,UAAU,UAAU,CAAC,EAAa;IACtC,OAAO,EAAE,CAAC,UAAU,EAAE,CAAC;AACzB,CAAC;AAED,2CAA2C;AAE3C,+DAA+D;AAC/D,MAAM,UAAU,WAAW,CAAC,EAAa,EAAE,EAAU,EAAE,EAAU;IAC/D,OAAO,EAAE,CAAC,SAAS,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;AAC9B,CAAC;AAED,2DAA2D;AAC3D,MAAM,UAAU,QAAQ,CAAC,EAAa,EAAE,KAAa,EAAE,MAAgB;IACrE,OAAO,EAAE,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;AAClC,CAAC;AAED,wEAAwE;AACxE,MAAM,UAAU,OAAO,CAAC,EAAa,EAAE,MAAc,EAAE,MAAgB;IACrE,OAAO,EAAE,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;AAClC,CAAC;AAED,qDAAqD;AACrD,MAAM,UAAU,QAAQ,CACtB,EAAa,EACb,iBAA0B,EAC1B,MAAgB,EAChB,IAAyB;IAEzB,OAAO,EAAE,CAAC,MAAM,CAAC,iBAAiB,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;AACpD,CAAC;AAED,iEAAiE;AACjE,MAAM,UAAU,SAAS,CACvB,EAAa,EACb,KAAa,EACb,SAAkB,EAClB,MAAgB;IAEhB,OAAO,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;AAC9C,CAAC;AAED,2CAA2C;AAE3C,kEAAkE;AAClE,MAAM,UAAU,eAAe,CAC7B,EAAa,EACb,UAA8B,EAC9B,MAA4B;AAC5B,4FAA4F;;IAE5F,OAAO,EAAE,CAAC,aAAa,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;AAC9C,CAAC;AAED,0EAA0E;AAC1E,MAAM,UAAU,cAAc,CAC5B,EAAa,EACb,IAAU,EACV,SAAqB;AACrB,6FAA6F;;IAE7F,OAAO,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;AAC1C,CAAC","sourcesContent":["/**\n * Standalone functions for Blueprint operations.\n *\n * Each function wraps the corresponding {@link Blueprint} class method as a\n * pure function, enabling a functional programming style.\n *\n * @see {@link Blueprint} for the OOP equivalent.\n */\n\nimport type { Point2D, BoundingBox2d } from '../../2d/lib/index.js';\nimport BlueprintClass from './blueprint.js';\nimport type Blueprint from './blueprint.js';\nimport CompoundBlueprintClass from './compoundBlueprint.js';\nimport type CompoundBlueprint from './compoundBlueprint.js';\nimport type { PointInput } from '../../core/types.js';\nimport type { Plane, PlaneName } from '../../core/planeTypes.js';\nimport type { Face } from '../../core/shapeTypes.js';\nimport type { ScaleMode } from '../../2d/curves.js';\nimport { type Result, ok, err } from '../../core/result.js';\nimport { validationError, BrepErrorCode } from '../../core/errors.js';\n\n/**\n * Create a new Blueprint from an ordered array of 2D curves.\n *\n * Returns a `Result` — use `unwrap()` in tests or `isOk()`/`match()` in\n * production code.\n *\n * @see {@link Blueprint} constructor.\n */\nexport function createBlueprint(curves: Blueprint['curves']): Result<Blueprint> {\n  if (curves.length === 0) {\n    return err(\n      validationError(\n        BrepErrorCode.BLUEPRINT_EMPTY_CURVES,\n        'createBlueprint: at least one curve is required'\n      )\n    );\n  }\n  return ok(new BlueprintClass(curves));\n}\n\n/**\n * Create a CompoundBlueprint from an outer boundary and optional holes.\n *\n * The first element of `blueprints` is the outer boundary; subsequent\n * elements are subtracted as holes.\n *\n * @see {@link CompoundBlueprint} constructor.\n */\nexport function createCompoundBlueprint(blueprints: Blueprint[]): Result<CompoundBlueprint> {\n  if (blueprints.length === 0) {\n    return err(\n      validationError(\n        BrepErrorCode.COMPOUND_BLUEPRINT_EMPTY,\n        'createCompoundBlueprint: at least one blueprint (outer boundary) is required'\n      )\n    );\n  }\n  return ok(new CompoundBlueprintClass(blueprints));\n}\n\n// ── Utility Functions (Clean 2D API) ──\n\n/** Get the axis-aligned bounding box of a 2D blueprint. */\nexport function getBounds2D(bp: Blueprint): BoundingBox2d {\n  return bp.boundingBox;\n}\n\n/** Get the winding direction of a 2D blueprint. */\nexport function getOrientation2D(bp: Blueprint): 'clockwise' | 'counterClockwise' {\n  return bp.orientation;\n}\n\n/** Test whether a 2D point lies strictly inside a blueprint. */\nexport function isInside2D(bp: Blueprint, point: Point2D): boolean {\n  return bp.isInside(point);\n}\n\n/** Convert a 2D blueprint to an SVG path d attribute string. */\nexport function toSVGPathD(bp: Blueprint): string {\n  return bp.toSVGPathD();\n}\n\n// ── Transform Functions (Clean 2D API) ──\n\n/** Translate a 2D blueprint by the given x and y distances. */\nexport function translate2D(bp: Blueprint, dx: number, dy: number): Blueprint {\n  return bp.translate(dx, dy);\n}\n\n/** Rotate a 2D blueprint by the given angle in degrees. */\nexport function rotate2D(bp: Blueprint, angle: number, center?: Point2D): Blueprint {\n  return bp.rotate(angle, center);\n}\n\n/** Uniformly scale a 2D blueprint by a factor around a center point. */\nexport function scale2D(bp: Blueprint, factor: number, center?: Point2D): Blueprint {\n  return bp.scale(factor, center);\n}\n\n/** Mirror a 2D blueprint across a point or plane. */\nexport function mirror2D(\n  bp: Blueprint,\n  centerOrDirection: Point2D,\n  origin?: Point2D,\n  mode?: 'center' | 'plane'\n): Blueprint {\n  return bp.mirror(centerOrDirection, origin, mode);\n}\n\n/** Stretch a 2D blueprint along a direction by a given ratio. */\nexport function stretch2D(\n  bp: Blueprint,\n  ratio: number,\n  direction: Point2D,\n  origin?: Point2D\n): Blueprint {\n  return bp.stretch(ratio, direction, origin);\n}\n\n// ── Sketching Functions (Clean 2D API) ──\n\n/** Project a blueprint onto a 3D plane, producing sketch data. */\nexport function sketchOnPlane2D(\n  bp: Blueprint,\n  inputPlane?: PlaneName | Plane,\n  origin?: PointInput | number\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any -- Sketch type not yet ported\n): any {\n  return bp.sketchOnPlane(inputPlane, origin);\n}\n\n/** Map a blueprint onto a 3D face's UV surface, producing sketch data. */\nexport function sketchOnFace2D(\n  bp: Blueprint,\n  face: Face,\n  scaleMode?: ScaleMode\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any -- Sketch types not yet ported\n): any {\n  return bp.sketchOnFace(face, scaleMode);\n}\n"]}

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

@@ -0,0 +1,58 @@
+import { Curve2D } from '../../2d/lib/index.js';
+import Blueprint from './blueprint.js';
+import type { Shape2D } from './boolean2D.js';
+/**
+ * Compute raw offset curves for a single blueprint without self-intersection cleanup.
+ *
+ * Offsets each curve individually, then joins adjacent offset curves using the
+ * configured line-join strategy (round, bevel, or miter).
+ *
+ * @param blueprint - The blueprint to offset.
+ * @param offset - Offset distance (positive = outward, negative = inward).
+ * @param offsetConfig - Join style configuration.
+ * @returns Array of offset curves (may contain self-intersections).
+ *
+ * @remarks This is the low-level building block used by {@link offsetBlueprint}.
+ * Most callers should prefer {@link offset} instead.
+ */
+export declare function rawOffsets(blueprint: Blueprint, offset: number, offsetConfig?: Offset2DConfig): Curve2D[];
+/** Configuration for 2D offset operations. */
+export interface Offset2DConfig {
+    /** Corner join style when offset curves diverge (default: `'round'`). */
+    lineJoinType?: 'miter' | 'bevel' | 'round';
+}
+/**
+ * Offset a single blueprint, resolving self-intersections and pruning invalid segments.
+ *
+ * Produces a new shape whose boundary is at a constant distance from the input
+ * blueprint. Self-intersections introduced by the offset are resolved using
+ * spatial indexing and curve splitting, following the
+ * {@link https://github.com/jbuckmccready/CavalierContours | Cavalier Contours} algorithm.
+ *
+ * @param blueprint - The source blueprint.
+ * @param offset - Offset distance (positive = outward, negative = inward).
+ * @param offsetConfig - Join style configuration.
+ * @returns The offset shape, or `null` if the offset collapses the blueprint.
+ *
+ * @see {@link offset} for the polymorphic version that handles all Shape2D types.
+ */
+export declare function offsetBlueprint(blueprint: Blueprint, offset: number, offsetConfig?: Offset2DConfig): Shape2D;
+/**
+ * Offset any 2D shape (Blueprint, CompoundBlueprint, or Blueprints) by a distance.
+ *
+ * Dispatches to {@link offsetBlueprint} for simple blueprints and recursively
+ * handles compound and multi-blueprint shapes.
+ *
+ * @param bp - The shape to offset.
+ * @param offsetDistance - Offset distance (positive = outward, negative = inward).
+ * @param offsetConfig - Join style configuration.
+ * @returns The offset shape, or `null` if the offset collapses entirely.
+ *
+ * @example
+ * ```ts
+ * const expanded = offset(blueprint, 2);
+ * const shrunk = offset(blueprint, -1, { lineJoinType: 'miter' });
+ * ```
+ */
+export default function offset(bp: Shape2D, offsetDistance: number, offsetConfig?: Offset2DConfig): Shape2D;
+//# sourceMappingURL=blueprintOffset.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"blueprintOffset.d.ts","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/2d/blueprints/blueprintOffset.ts"],"names":[],"mappings":"AAMA,OAAO,EAIL,OAAO,EAQR,MAAM,uBAAuB,CAAC;AAC/B,OAAO,SAAS,MAAM,gBAAgB,CAAC;AAGvC,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,gBAAgB,CAAC;AAiO9C;;;;;;;;;;;;;GAaG;AACH,wBAAgB,UAAU,CACxB,SAAS,EAAE,SAAS,EACpB,MAAM,EAAE,MAAM,EACd,YAAY,GAAE,cAAmB,GAChC,OAAO,EAAE,CAgGX;AAOD,8CAA8C;AAC9C,MAAM,WAAW,cAAc;IAC7B,yEAAyE;IACzE,YAAY,CAAC,EAAE,OAAO,GAAG,OAAO,GAAG,OAAO,CAAC;CAC5C;AAED;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,eAAe,CAC7B,SAAS,EAAE,SAAS,EACpB,MAAM,EAAE,MAAM,EACd,YAAY,GAAE,cAAmB,GAChC,OAAO,CA4DT;AAUD;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,CAAC,OAAO,UAAU,MAAM,CAC5B,EAAE,EAAE,OAAO,EACX,cAAc,EAAE,MAAM,EACtB,YAAY,GAAE,cAAmB,GAChC,OAAO,CAeT"}

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

@@ -0,0 +1,346 @@
+import Flatbush from 'flatbush';
+import { bug, safeIndex } from '../../core/errors.js';
+import { unwrap } from '../../core/result.js';
+import { wasmIndex } from '../../utils/vec3.js';
+import { intersectCurves, stitchCurves, make2dOffset, Curve2D, samePoint as defaultSamePoint, make2dSegmentCurve, squareDistance2d, make2dArcFromCenter, add2d, subtract2d, PRECISION_OFFSET, } from '../../2d/lib/index.js';
+import Blueprint from './blueprint.js';
+import Blueprints from './blueprints.js';
+import CompoundBlueprint from './compoundBlueprint.js';
+import { fuse2D, cut2D } from './boolean2D.js';
+const samePoint = (x, y) => defaultSamePoint(x, y, PRECISION_OFFSET * 100);
+const getIntersectionPoint = (line1Start, line1End, line2Start, line2End) => {
+    // Pre-compute direction differences (det([[a,1],[b,1]]) = a - b)
+    const dx1 = line1Start[0] - line1End[0];
+    const dy1 = line1Start[1] - line1End[1];
+    const dx2 = line2Start[0] - line2End[0];
+    const dy2 = line2Start[1] - line2End[1];
+    // Denominator: det([[dx1, dy1], [dx2, dy2]])
+    const denom = dx1 * dy2 - dy1 * dx2;
+    if (Math.abs(denom) < 1e-12)
+        return null;
+    // Cross products for the line equations
+    const cross1 = line1Start[0] * line1End[1] - line1Start[1] * line1End[0];
+    const cross2 = line2Start[0] * line2End[1] - line2Start[1] * line2End[0];
+    // Intersection point using Cramer's rule
+    const x = (cross1 * dx2 - cross2 * dx1) / denom;
+    const y = (cross1 * dy2 - cross2 * dy1) / denom;
+    return [x, y];
+};
+function joinRound(appendCurve, previousLastPoint, firstPoint, previousCurve, _curve) {
+    const arcJoiner = make2dArcFromCenter(previousLastPoint, firstPoint, previousCurve.original.lastPoint);
+    appendCurve(previousCurve);
+    appendCurve(arcJoiner);
+}
+function joinBevel(appendCurve, previousLastPoint, firstPoint, previousCurve, _curve) {
+    const bevelJoiner = make2dSegmentCurve(previousLastPoint, firstPoint);
+    appendCurve(previousCurve);
+    appendCurve(bevelJoiner);
+}
+function joinMiter(appendCurve, previousLastPoint, firstPoint, previousCurve, curve) {
+    const previousOtherPoint = previousCurve.offset instanceof Curve2D
+        ? subtract2d(previousLastPoint, previousCurve.offset.tangentAt(1))
+        : previousCurve.offset.firstPoint;
+    const nextOtherPoint = curve.offset instanceof Curve2D
+        ? add2d(firstPoint, curve.offset.tangentAt(0))
+        : curve.offset.lastPoint;
+    const offsetIntersectionPoint = getIntersectionPoint(previousOtherPoint, previousLastPoint, firstPoint, nextOtherPoint);
+    if (!offsetIntersectionPoint) {
+        // Lines are parallel — fall back to bevel join
+        const bevelJoiner = make2dSegmentCurve(previousLastPoint, firstPoint);
+        appendCurve(previousCurve);
+        appendCurve(bevelJoiner);
+        return;
+    }
+    const midpoint = [
+        (previousLastPoint[0] + firstPoint[0]) / 2,
+        (previousLastPoint[1] + firstPoint[1]) / 2,
+    ];
+    const miterDist = squareDistance2d(midpoint, offsetIntersectionPoint);
+    const endpointDist = squareDistance2d(previousLastPoint, firstPoint);
+    if (endpointDist < 1e-18 || miterDist > 16 * endpointDist) {
+        const bevelJoiner = make2dSegmentCurve(previousLastPoint, firstPoint);
+        appendCurve(previousCurve);
+        appendCurve(bevelJoiner);
+        return;
+    }
+    const miterJoiner1 = make2dSegmentCurve(previousLastPoint, offsetIntersectionPoint);
+    const miterJoiner2 = make2dSegmentCurve(offsetIntersectionPoint, firstPoint);
+    appendCurve(previousCurve);
+    appendCurve(miterJoiner1);
+    appendCurve(miterJoiner2);
+}
+const OFFSET_JOINERS = {
+    round: joinRound,
+    bevel: joinBevel,
+    miter: joinMiter,
+};
+/**
+ * Handle the case where adjacent offset curves intersect: split both at
+ * the closest intersection and return updated previous/current curves.
+ */
+function splitAtIntersection(previousCurve, curve, intersections) {
+    const intersection = intersections.length === 1
+        ? safeIndex(intersections, 0, 'rawOffsets')
+        : selectClosestIntersection(intersections, previousCurve.original.lastPoint);
+    const splitPreviousCurve = safeIndex(previousCurve.offset.splitAt([intersection], PRECISION_OFFSET), 0, 'rawOffsets');
+    const splitCurve = curve.offset.splitAt([intersection], PRECISION_OFFSET).at(-1);
+    if (!splitCurve)
+        bug('offset.rawOffsets', 'Split produced no trailing curve segment');
+    return {
+        splitPrevious: { offset: splitPreviousCurve, original: previousCurve.original },
+        splitCurrent: { offset: splitCurve, original: curve.original },
+    };
+}
+/**
+ * From an array of candidate intersection points, select the one closest to
+ * a reference point (the original curve endpoint).
+ */
+function selectClosestIntersection(intersections, referencePoint) {
+    let closest = safeIndex(intersections, 0, 'selectClosestIntersection');
+    let minDist = squareDistance2d(closest, referencePoint);
+    for (let i = 1; i < intersections.length; i++) {
+        const point = safeIndex(intersections, i, 'selectClosestIntersection');
+        const d = squareDistance2d(point, referencePoint);
+        if (d < minDist) {
+            minDist = d;
+            closest = point;
+        }
+    }
+    return closest;
+}
+/**
+ * Build a map of self-intersection points per curve index using a spatial
+ * index over offset-curve bounding boxes.
+ */
+function findSelfIntersections(offsettedArray) {
+    const allIntersections = new Map();
+    const updateIntersections = (index, newPoints) => {
+        const intersections = allIntersections.get(index) || [];
+        allIntersections.set(index, [...intersections, ...newPoints]);
+    };
+    // Build spatial index of curve bounding boxes for O(n log n) intersection filtering
+    const spatialIndex = new Flatbush(offsettedArray.length);
+    for (const curve of offsettedArray) {
+        const [[xMin, yMin], [xMax, yMax]] = curve.boundingBox.bounds;
+        spatialIndex.add(xMin, yMin, xMax, yMax);
+    }
+    spatialIndex.finish();
+    // Use spatial index to find candidate pairs, avoiding O(n²) comparisons
+    offsettedArray.forEach((firstCurve, firstIndex) => {
+        const [[xMin, yMin], [xMax, yMax]] = firstCurve.boundingBox.bounds;
+        const candidates = spatialIndex.search(xMin, yMin, xMax, yMax);
+        for (const secondIndex of candidates) {
+            // Only test pairs where secondIndex > firstIndex to avoid duplicates
+            if (secondIndex <= firstIndex)
+                continue;
+            const secondCurve = safeIndex(offsettedArray, secondIndex, 'offsetBlueprint');
+            const { intersections: rawIntersections, commonSegmentsPoints } = unwrap(intersectCurves(firstCurve, secondCurve, PRECISION_OFFSET));
+            const intersections = [...rawIntersections, ...commonSegmentsPoints].filter((intersection) => {
+                const onFirstCurveExtremity = samePoint(intersection, firstCurve.firstPoint) ||
+                    samePoint(intersection, firstCurve.lastPoint);
+                const onSecondCurveExtremity = samePoint(intersection, secondCurve.firstPoint) ||
+                    samePoint(intersection, secondCurve.lastPoint);
+                return !(onFirstCurveExtremity && onSecondCurveExtremity);
+            });
+            if (!intersections.length)
+                continue;
+            updateIntersections(firstIndex, intersections);
+            updateIntersections(secondIndex, intersections);
+        }
+    });
+    return allIntersections;
+}
+/**
+ * Compute raw offset curves for a single blueprint without self-intersection cleanup.
+ *
+ * Offsets each curve individually, then joins adjacent offset curves using the
+ * configured line-join strategy (round, bevel, or miter).
+ *
+ * @param blueprint - The blueprint to offset.
+ * @param offset - Offset distance (positive = outward, negative = inward).
+ * @param offsetConfig - Join style configuration.
+ * @returns Array of offset curves (may contain self-intersections).
+ *
+ * @remarks This is the low-level building block used by {@link offsetBlueprint}.
+ * Most callers should prefer {@link offset} instead.
+ */
+export function rawOffsets(blueprint, offset, offsetConfig = {}) {
+    const correctedOffset = blueprint.orientation === 'clockwise' ? -offset : offset;
+    const offsetCurves = blueprint.curves.map((c) => ({
+        offset: make2dOffset(c, correctedOffset),
+        original: c,
+    }));
+    // Ideally we would use the length of the curve to make sure it is
+    // not only a point, but the algo we have access to are a bit to
+    // convoluted to be usable here
+    const offsettedArray = [];
+    let savedLastCurve = null;
+    let previousCurve = offsetCurves.at(-1);
+    // We have no offset curves
+    if (!previousCurve)
+        return [];
+    function appendCurve(curve) {
+        // There are different ways to build the array of offsetted curves.
+        // This should build the array of offsetted curves depending on the shape of
+        // what we are offsetting.
+        // if the curve is a Curve2D we just push it
+        if (curve instanceof Curve2D) {
+            offsettedArray.push(curve);
+            return;
+        }
+        if (!savedLastCurve) {
+            // we make the first curve we append available to wrap when iterating
+            savedLastCurve = curve;
+        }
+        else if (curve.offset instanceof Curve2D) {
+            // if we have an offset curve that is a Curve2D we push it
+            offsettedArray.push(curve.offset);
+        }
+        else if (!samePoint(curve.offset.firstPoint, curve.offset.lastPoint)) {
+            // if the offset curve is collapsed we push a segment curve
+            offsettedArray.push(make2dSegmentCurve(curve.offset.firstPoint, curve.offset.lastPoint));
+        }
+    }
+    const iterateOffsetCurves = function* () {
+        for (const curve of offsetCurves.slice(0, -1)) {
+            yield curve;
+        }
+        // This should never happen
+        if (!savedLastCurve)
+            bug('offset.rawOffsets', 'No saved curve after iterating offset segments');
+        yield savedLastCurve;
+    };
+    for (const curve of iterateOffsetCurves()) {
+        const previousLastPoint = previousCurve.offset.lastPoint;
+        const firstPoint = curve.offset.firstPoint;
+        // When the offset curves do still touch we do nothing
+        if (samePoint(previousLastPoint, firstPoint)) {
+            appendCurve(previousCurve);
+            previousCurve = curve;
+            continue;
+        }
+        let intersections = [];
+        if (previousCurve.offset instanceof Curve2D && curve.offset instanceof Curve2D) {
+            // When the offset curves intersect we cut them and save them at
+            const { intersections: pointIntersections, commonSegmentsPoints } = unwrap(intersectCurves(previousCurve.offset, curve.offset, PRECISION_OFFSET / 100));
+            intersections = [...pointIntersections, ...commonSegmentsPoints];
+        }
+        if (intersections.length > 0) {
+            // Pick the intersection closest to the original curve endpoint
+            // (following https://github.com/jbuckmccready/cavalier_contours/)
+            const { splitPrevious, splitCurrent } = splitAtIntersection(previousCurve, curve, intersections);
+            appendCurve(splitPrevious);
+            previousCurve = splitCurrent;
+            continue;
+        }
+        // When the offset curves do not intersect we link them with an offset
+        // joiner
+        const joiner = OFFSET_JOINERS[offsetConfig.lineJoinType ?? 'round'];
+        joiner(appendCurve, previousLastPoint, firstPoint, previousCurve, curve);
+        previousCurve = curve;
+    }
+    appendCurve(previousCurve);
+    return offsettedArray;
+}
+/**
+ * Offset a single blueprint, resolving self-intersections and pruning invalid segments.
+ *
+ * Produces a new shape whose boundary is at a constant distance from the input
+ * blueprint. Self-intersections introduced by the offset are resolved using
+ * spatial indexing and curve splitting, following the
+ * {@link https://github.com/jbuckmccready/CavalierContours | Cavalier Contours} algorithm.
+ *
+ * @param blueprint - The source blueprint.
+ * @param offset - Offset distance (positive = outward, negative = inward).
+ * @param offsetConfig - Join style configuration.
+ * @returns The offset shape, or `null` if the offset collapses the blueprint.
+ *
+ * @see {@link offset} for the polymorphic version that handles all Shape2D types.
+ */
+export function offsetBlueprint(blueprint, offset, offsetConfig = {}) {
+    const offsettedArray = rawOffsets(blueprint, offset, offsetConfig);
+    if (offsettedArray.length < 2)
+        return null;
+    // We remove the self intersections with the use the the algorithm as described in https://github.com/jbuckmccready/CavalierContours#offset-algorithm-and-stepwise-example
+    const allIntersections = findSelfIntersections(offsettedArray);
+    if (!allIntersections.size) {
+        const offsettedBlueprint = new Blueprint(offsettedArray);
+        if (!blueprint.intersects(offsettedBlueprint))
+            return offsettedBlueprint;
+        return null;
+    }
+    const splitCurves = offsettedArray.flatMap((curve, index) => {
+        if (!allIntersections.has(index))
+            return curve;
+        const intersections = allIntersections.get(index) || [];
+        const splitCurves = curve.splitAt(intersections, PRECISION_OFFSET * 100);
+        return splitCurves;
+    });
+    // We remove all the segments that are closer to the original curve than the offset
+    const originalIndex = new Flatbush(blueprint.curves.length);
+    for (const c of blueprint.curves) {
+        const [[xMin, yMin], [xMax, yMax]] = c.boundingBox.bounds;
+        originalIndex.add(xMin, yMin, xMax, yMax);
+    }
+    originalIndex.finish();
+    const absOffset = Math.abs(offset);
+    const prunedCurves = splitCurves.filter((curve) => {
+        const [[xMin, yMin], [xMax, yMax]] = curve.boundingBox.bounds;
+        const candidates = originalIndex.search(xMin - absOffset, yMin - absOffset, xMax + absOffset, yMax + absOffset);
+        return !candidates.some((idx) => {
+            const c = wasmIndex(blueprint.curves, idx);
+            return c.distanceFrom(curve) < absOffset - PRECISION_OFFSET;
+        });
+    });
+    if (!prunedCurves.length)
+        return null;
+    const curvesGrouped = stitchCurves(prunedCurves);
+    const blueprints = curvesGrouped
+        .filter((c) => c.length > 1)
+        .map((c) => new Blueprint(c))
+        .filter((b) => b.isClosed());
+    if (!blueprints.length)
+        return null;
+    if (blueprints.length === 1) {
+        return safeIndex(blueprints, 0, 'offsetBlueprint');
+    }
+    return new Blueprints(blueprints);
+}
+const fuseAll = (blueprints) => {
+    let fused = safeIndex(blueprints, 0, 'fuseAll');
+    for (let i = 1; i < blueprints.length; i++) {
+        fused = fuse2D(fused, safeIndex(blueprints, i, 'fuseAll'));
+    }
+    return fused;
+};
+/**
+ * Offset any 2D shape (Blueprint, CompoundBlueprint, or Blueprints) by a distance.
+ *
+ * Dispatches to {@link offsetBlueprint} for simple blueprints and recursively
+ * handles compound and multi-blueprint shapes.
+ *
+ * @param bp - The shape to offset.
+ * @param offsetDistance - Offset distance (positive = outward, negative = inward).
+ * @param offsetConfig - Join style configuration.
+ * @returns The offset shape, or `null` if the offset collapses entirely.
+ *
+ * @example
+ * ```ts
+ * const expanded = offset(blueprint, 2);
+ * const shrunk = offset(blueprint, -1, { lineJoinType: 'miter' });
+ * ```
+ */
+export default function offset(bp, offsetDistance, offsetConfig = {}) {
+    if (bp instanceof Blueprint) {
+        return offsetBlueprint(bp, offsetDistance, offsetConfig);
+    }
+    else if (bp instanceof Blueprints) {
+        return fuseAll(bp.blueprints.map((b) => offset(b, offsetDistance, offsetConfig)));
+    }
+    else if (bp instanceof CompoundBlueprint) {
+        const innerShape = fuseAll(bp.blueprints.slice(1).map((b) => offset(b, -offsetDistance, offsetConfig)));
+        return cut2D(offset(safeIndex(bp.blueprints, 0, 'offset'), offsetDistance, offsetConfig), innerShape);
+    }
+    return null;
+}
+//# sourceMappingURL=blueprintOffset.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"blueprintOffset.js","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/2d/blueprints/blueprintOffset.ts"],"names":[],"mappings":"AAAA,OAAO,QAAQ,MAAM,UAAU,CAAC;AAEhC,OAAO,EAAE,GAAG,EAAE,SAAS,EAAE,MAAM,sBAAsB,CAAC;AACtD,OAAO,EAAE,MAAM,EAAE,MAAM,sBAAsB,CAAC;AAC9C,OAAO,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AAEhD,OAAO,EACL,eAAe,EACf,YAAY,EACZ,YAAY,EACZ,OAAO,EACP,SAAS,IAAI,gBAAgB,EAC7B,kBAAkB,EAClB,gBAAgB,EAChB,mBAAmB,EACnB,KAAK,EACL,UAAU,EACV,gBAAgB,GACjB,MAAM,uBAAuB,CAAC;AAC/B,OAAO,SAAS,MAAM,gBAAgB,CAAC;AACvC,OAAO,UAAU,MAAM,iBAAiB,CAAC;AACzC,OAAO,iBAAiB,MAAM,wBAAwB,CAAC;AAEvD,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAC;AAE/C,MAAM,SAAS,GAAG,CAAC,CAAU,EAAE,CAAU,EAAE,EAAE,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,EAAE,gBAAgB,GAAG,GAAG,CAAC,CAAC;AAE7F,MAAM,oBAAoB,GAAG,CAC3B,UAAmB,EACnB,QAAiB,EACjB,UAAmB,EACnB,QAAiB,EACD,EAAE;IAClB,iEAAiE;IACjE,MAAM,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;IACxC,MAAM,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;IACxC,MAAM,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;IACxC,MAAM,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;IAExC,6CAA6C;IAC7C,MAAM,KAAK,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;IACpC,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,KAAK;QAAE,OAAO,IAAI,CAAC;IAEzC,wCAAwC;IACxC,MAAM,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;IACzE,MAAM,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;IAEzE,yCAAyC;IACzC,MAAM,CAAC,GAAG,CAAC,MAAM,GAAG,GAAG,GAAG,MAAM,GAAG,GAAG,CAAC,GAAG,KAAK,CAAC;IAChD,MAAM,CAAC,GAAG,CAAC,MAAM,GAAG,GAAG,GAAG,MAAM,GAAG,GAAG,CAAC,GAAG,KAAK,CAAC;IAEhD,OAAO,CAAC,CAAC,EAAE,CAAC,CAAY,CAAC;AAC3B,CAAC,CAAC;AAEF,SAAS,SAAS,CAChB,WAAuD,EACvD,iBAA0B,EAC1B,UAAmB,EACnB,aAA8B,EAC9B,MAAuB;IAEvB,MAAM,SAAS,GAAG,mBAAmB,CACnC,iBAAiB,EACjB,UAAU,EACV,aAAa,CAAC,QAAQ,CAAC,SAAS,CACjC,CAAC;IAEF,WAAW,CAAC,aAAa,CAAC,CAAC;IAC3B,WAAW,CAAC,SAAS,CAAC,CAAC;AACzB,CAAC;AAED,SAAS,SAAS,CAChB,WAAuD,EACvD,iBAA0B,EAC1B,UAAmB,EACnB,aAA8B,EAC9B,MAAuB;IAEvB,MAAM,WAAW,GAAG,kBAAkB,CAAC,iBAAiB,EAAE,UAAU,CAAC,CAAC;IAEtE,WAAW,CAAC,aAAa,CAAC,CAAC;IAC3B,WAAW,CAAC,WAAW,CAAC,CAAC;AAC3B,CAAC;AAED,SAAS,SAAS,CAChB,WAAuD,EACvD,iBAA0B,EAC1B,UAAmB,EACnB,aAA8B,EAC9B,KAAsB;IAEtB,MAAM,kBAAkB,GACtB,aAAa,CAAC,MAAM,YAAY,OAAO;QACrC,CAAC,CAAC,UAAU,CAAC,iBAAiB,EAAE,aAAa,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAClE,CAAC,CAAC,aAAa,CAAC,MAAM,CAAC,UAAU,CAAC;IACtC,MAAM,cAAc,GAClB,KAAK,CAAC,MAAM,YAAY,OAAO;QAC7B,CAAC,CAAC,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAC9C,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC;IAE7B,MAAM,uBAAuB,GAAG,oBAAoB,CAClD,kBAAkB,EAClB,iBAAiB,EACjB,UAAU,EACV,cAAc,CACf,CAAC;IAEF,IAAI,CAAC,uBAAuB,EAAE,CAAC;QAC7B,+CAA+C;QAC/C,MAAM,WAAW,GAAG,kBAAkB,CAAC,iBAAiB,EAAE,UAAU,CAAC,CAAC;QACtE,WAAW,CAAC,aAAa,CAAC,CAAC;QAC3B,WAAW,CAAC,WAAW,CAAC,CAAC;QACzB,OAAO;IACT,CAAC;IAED,MAAM,QAAQ,GAAY;QACxB,CAAC,iBAAiB,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;QAC1C,CAAC,iBAAiB,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;KAC3C,CAAC;IACF,MAAM,SAAS,GAAG,gBAAgB,CAAC,QAAQ,EAAE,uBAAuB,CAAC,CAAC;IACtE,MAAM,YAAY,GAAG,gBAAgB,CAAC,iBAAiB,EAAE,UAAU,CAAC,CAAC;IACrE,IAAI,YAAY,GAAG,KAAK,IAAI,SAAS,GAAG,EAAE,GAAG,YAAY,EAAE,CAAC;QAC1D,MAAM,WAAW,GAAG,kBAAkB,CAAC,iBAAiB,EAAE,UAAU,CAAC,CAAC;QACtE,WAAW,CAAC,aAAa,CAAC,CAAC;QAC3B,WAAW,CAAC,WAAW,CAAC,CAAC;QACzB,OAAO;IACT,CAAC;IAED,MAAM,YAAY,GAAG,kBAAkB,CAAC,iBAAiB,EAAE,uBAAuB,CAAC,CAAC;IACpF,MAAM,YAAY,GAAG,kBAAkB,CAAC,uBAAuB,EAAE,UAAU,CAAC,CAAC;IAE7E,WAAW,CAAC,aAAa,CAAC,CAAC;IAC3B,WAAW,CAAC,YAAY,CAAC,CAAC;IAC1B,WAAW,CAAC,YAAY,CAAC,CAAC;AAC5B,CAAC;AAED,MAAM,cAAc,GAAG;IACrB,KAAK,EAAE,SAAS;IAChB,KAAK,EAAE,SAAS;IAChB,KAAK,EAAE,SAAS;CACR,CAAC;AAEX;;;GAGG;AACH,SAAS,mBAAmB,CAC1B,aAA8B,EAC9B,KAAsB,EACtB,aAAwB;IAExB,MAAM,YAAY,GAChB,aAAa,CAAC,MAAM,KAAK,CAAC;QACxB,CAAC,CAAC,SAAS,CAAC,aAAa,EAAE,CAAC,EAAE,YAAY,CAAC;QAC3C,CAAC,CAAC,yBAAyB,CAAC,aAAa,EAAE,aAAa,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;IAEjF,MAAM,kBAAkB,GAAY,SAAS,CAC1C,aAAa,CAAC,MAAkB,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,EAAE,gBAAgB,CAAC,EAC3E,CAAC,EACD,YAAY,CACb,CAAC;IACF,MAAM,UAAU,GAAI,KAAK,CAAC,MAAkB,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,EAAE,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAE9F,IAAI,CAAC,UAAU;QAAE,GAAG,CAAC,mBAAmB,EAAE,0CAA0C,CAAC,CAAC;IAEtF,OAAO;QACL,aAAa,EAAE,EAAE,MAAM,EAAE,kBAAkB,EAAE,QAAQ,EAAE,aAAa,CAAC,QAAQ,EAAE;QAC/E,YAAY,EAAE,EAAE,MAAM,EAAE,UAAU,EAAE,QAAQ,EAAE,KAAK,CAAC,QAAQ,EAAE;KAC/D,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,SAAS,yBAAyB,CAAC,aAAwB,EAAE,cAAuB;IAClF,IAAI,OAAO,GAAG,SAAS,CAAC,aAAa,EAAE,CAAC,EAAE,2BAA2B,CAAC,CAAC;IACvE,IAAI,OAAO,GAAG,gBAAgB,CAAC,OAAO,EAAE,cAAc,CAAC,CAAC;IACxD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9C,MAAM,KAAK,GAAG,SAAS,CAAC,aAAa,EAAE,CAAC,EAAE,2BAA2B,CAAC,CAAC;QACvE,MAAM,CAAC,GAAG,gBAAgB,CAAC,KAAK,EAAE,cAAc,CAAC,CAAC;QAClD,IAAI,CAAC,GAAG,OAAO,EAAE,CAAC;YAChB,OAAO,GAAG,CAAC,CAAC;YACZ,OAAO,GAAG,KAAK,CAAC;QAClB,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;GAGG;AACH,SAAS,qBAAqB,CAAC,cAAyB;IACtD,MAAM,gBAAgB,GAA2B,IAAI,GAAG,EAAE,CAAC;IAC3D,MAAM,mBAAmB,GAAG,CAAC,KAAa,EAAE,SAAoB,EAAE,EAAE;QAClE,MAAM,aAAa,GAAG,gBAAgB,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;QACxD,gBAAgB,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,GAAG,aAAa,EAAE,GAAG,SAAS,CAAC,CAAC,CAAC;IAChE,CAAC,CAAC;IAEF,oFAAoF;IACpF,MAAM,YAAY,GAAG,IAAI,QAAQ,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;IACzD,KAAK,MAAM,KAAK,IAAI,cAAc,EAAE,CAAC;QACnC,MAAM,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC;QAC9D,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;IAC3C,CAAC;IACD,YAAY,CAAC,MAAM,EAAE,CAAC;IAEtB,wEAAwE;IACxE,cAAc,CAAC,OAAO,CAAC,CAAC,UAAU,EAAE,UAAU,EAAE,EAAE;QAChD,MAAM,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,GAAG,UAAU,CAAC,WAAW,CAAC,MAAM,CAAC;QACnE,MAAM,UAAU,GAAG,YAAY,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QAE/D,KAAK,MAAM,WAAW,IAAI,UAAU,EAAE,CAAC;YACrC,qEAAqE;YACrE,IAAI,WAAW,IAAI,UAAU;gBAAE,SAAS;YAExC,MAAM,WAAW,GAAG,SAAS,CAAC,cAAc,EAAE,WAAW,EAAE,iBAAiB,CAAC,CAAC;YAE9E,MAAM,EAAE,aAAa,EAAE,gBAAgB,EAAE,oBAAoB,EAAE,GAAG,MAAM,CACtE,eAAe,CAAC,UAAU,EAAE,WAAW,EAAE,gBAAgB,CAAC,CAC3D,CAAC;YAEF,MAAM,aAAa,GAAG,CAAC,GAAG,gBAAgB,EAAE,GAAG,oBAAoB,CAAC,CAAC,MAAM,CACzE,CAAC,YAAY,EAAE,EAAE;gBACf,MAAM,qBAAqB,GACzB,SAAS,CAAC,YAAY,EAAE,UAAU,CAAC,UAAU,CAAC;oBAC9C,SAAS,CAAC,YAAY,EAAE,UAAU,CAAC,SAAS,CAAC,CAAC;gBAEhD,MAAM,sBAAsB,GAC1B,SAAS,CAAC,YAAY,EAAE,WAAW,CAAC,UAAU,CAAC;oBAC/C,SAAS,CAAC,YAAY,EAAE,WAAW,CAAC,SAAS,CAAC,CAAC;gBAEjD,OAAO,CAAC,CAAC,qBAAqB,IAAI,sBAAsB,CAAC,CAAC;YAC5D,CAAC,CACF,CAAC;YAEF,IAAI,CAAC,aAAa,CAAC,MAAM;gBAAE,SAAS;YAEpC,mBAAmB,CAAC,UAAU,EAAE,aAAa,CAAC,CAAC;YAC/C,mBAAmB,CAAC,WAAW,EAAE,aAAa,CAAC,CAAC;QAClD,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,OAAO,gBAAgB,CAAC;AAC1B,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,UAAU,CACxB,SAAoB,EACpB,MAAc,EACd,eAA+B,EAAE;IAEjC,MAAM,eAAe,GAAG,SAAS,CAAC,WAAW,KAAK,WAAW,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC;IACjF,MAAM,YAAY,GAAsB,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACnE,MAAM,EAAE,YAAY,CAAC,CAAC,EAAE,eAAe,CAAC;QACxC,QAAQ,EAAE,CAAC;KACZ,CAAC,CAAC,CAAC;IAEJ,kEAAkE;IAClE,gEAAgE;IAChE,+BAA+B;IAE/B,MAAM,cAAc,GAAc,EAAE,CAAC;IAErC,IAAI,cAAc,GAA2B,IAAI,CAAC;IAElD,IAAI,aAAa,GAAG,YAAY,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAExC,2BAA2B;IAC3B,IAAI,CAAC,aAAa;QAAE,OAAO,EAAE,CAAC;IAE9B,SAAS,WAAW,CAAC,KAAgC;QACnD,mEAAmE;QACnE,4EAA4E;QAC5E,0BAA0B;QAE1B,4CAA4C;QAC5C,IAAI,KAAK,YAAY,OAAO,EAAE,CAAC;YAC7B,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC3B,OAAO;QACT,CAAC;QAED,IAAI,CAAC,cAAc,EAAE,CAAC;YACpB,qEAAqE;YACrE,cAAc,GAAG,KAAK,CAAC;QACzB,CAAC;aAAM,IAAI,KAAK,CAAC,MAAM,YAAY,OAAO,EAAE,CAAC;YAC3C,0DAA0D;YAC1D,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACpC,CAAC;aAAM,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,UAAU,EAAE,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC;YACvE,2DAA2D;YAC3D,cAAc,CAAC,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC,MAAM,CAAC,UAAU,EAAE,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC;QAC3F,CAAC;IACH,CAAC;IAED,MAAM,mBAAmB,GAAG,QAAQ,CAAC;QACnC,KAAK,MAAM,KAAK,IAAI,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC9C,MAAM,KAAK,CAAC;QACd,CAAC;QACD,2BAA2B;QAC3B,IAAI,CAAC,cAAc;YAAE,GAAG,CAAC,mBAAmB,EAAE,gDAAgD,CAAC,CAAC;QAChG,MAAM,cAAc,CAAC;IACvB,CAAC,CAAC;IAEF,KAAK,MAAM,KAAK,IAAI,mBAAmB,EAAE,EAAE,CAAC;QAC1C,MAAM,iBAAiB,GAAG,aAAa,CAAC,MAAM,CAAC,SAAS,CAAC;QACzD,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC;QAE3C,sDAAsD;QACtD,IAAI,SAAS,CAAC,iBAAiB,EAAE,UAAU,CAAC,EAAE,CAAC;YAC7C,WAAW,CAAC,aAAa,CAAC,CAAC;YAC3B,aAAa,GAAG,KAAK,CAAC;YACtB,SAAS;QACX,CAAC;QAED,IAAI,aAAa,GAAc,EAAE,CAAC;QAElC,IAAI,aAAa,CAAC,MAAM,YAAY,OAAO,IAAI,KAAK,CAAC,MAAM,YAAY,OAAO,EAAE,CAAC;YAC/E,gEAAgE;YAChE,MAAM,EAAE,aAAa,EAAE,kBAAkB,EAAE,oBAAoB,EAAE,GAAG,MAAM,CACxE,eAAe,CAAC,aAAa,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,gBAAgB,GAAG,GAAG,CAAC,CAC5E,CAAC;YACF,aAAa,GAAG,CAAC,GAAG,kBAAkB,EAAE,GAAG,oBAAoB,CAAC,CAAC;QACnE,CAAC;QAED,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC7B,+DAA+D;YAC/D,kEAAkE;YAClE,MAAM,EAAE,aAAa,EAAE,YAAY,EAAE,GAAG,mBAAmB,CACzD,aAAa,EACb,KAAK,EACL,aAAa,CACd,CAAC;YACF,WAAW,CAAC,aAAa,CAAC,CAAC;YAC3B,aAAa,GAAG,YAAY,CAAC;YAC7B,SAAS;QACX,CAAC;QAED,sEAAsE;QACtE,SAAS;QACT,MAAM,MAAM,GAAG,cAAc,CAAC,YAAY,CAAC,YAAY,IAAI,OAAO,CAAC,CAAC;QACpE,MAAM,CAAC,WAAW,EAAE,iBAAiB,EAAE,UAAU,EAAE,aAAa,EAAE,KAAK,CAAC,CAAC;QAEzE,aAAa,GAAG,KAAK,CAAC;IACxB,CAAC;IAED,WAAW,CAAC,aAAa,CAAC,CAAC;IAC3B,OAAO,cAAc,CAAC;AACxB,CAAC;AAaD;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,eAAe,CAC7B,SAAoB,EACpB,MAAc,EACd,eAA+B,EAAE;IAEjC,MAAM,cAAc,GAAG,UAAU,CAAC,SAAS,EAAE,MAAM,EAAE,YAAY,CAAC,CAAC;IAEnE,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IAE3C,0KAA0K;IAE1K,MAAM,gBAAgB,GAAG,qBAAqB,CAAC,cAAc,CAAC,CAAC;IAE/D,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,CAAC;QAC3B,MAAM,kBAAkB,GAAG,IAAI,SAAS,CAAC,cAAc,CAAC,CAAC;QACzD,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,kBAAkB,CAAC;YAAE,OAAO,kBAAkB,CAAC;QACzE,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,WAAW,GAAG,cAAc,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE;QAC1D,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;QAE/C,MAAM,aAAa,GAAG,gBAAgB,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;QACxD,MAAM,WAAW,GAAG,KAAK,CAAC,OAAO,CAAC,aAAa,EAAE,gBAAgB,GAAG,GAAG,CAAC,CAAC;QACzE,OAAO,WAAW,CAAC;IACrB,CAAC,CAAC,CAAC;IAEH,mFAAmF;IACnF,MAAM,aAAa,GAAG,IAAI,QAAQ,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAC5D,KAAK,MAAM,CAAC,IAAI,SAAS,CAAC,MAAM,EAAE,CAAC;QACjC,MAAM,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC;QAC1D,aAAa,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;IAC5C,CAAC;IACD,aAAa,CAAC,MAAM,EAAE,CAAC;IAEvB,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACnC,MAAM,YAAY,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE;QAChD,MAAM,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC;QAC9D,MAAM,UAAU,GAAG,aAAa,CAAC,MAAM,CACrC,IAAI,GAAG,SAAS,EAChB,IAAI,GAAG,SAAS,EAChB,IAAI,GAAG,SAAS,EAChB,IAAI,GAAG,SAAS,CACjB,CAAC;QACF,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE;YAC9B,MAAM,CAAC,GAAG,SAAS,CAAC,SAAS,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;YAC3C,OAAO,CAAC,CAAC,YAAY,CAAC,KAAK,CAAC,GAAG,SAAS,GAAG,gBAAgB,CAAC;QAC9D,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,YAAY,CAAC,MAAM;QAAE,OAAO,IAAI,CAAC;IAEtC,MAAM,aAAa,GAAG,YAAY,CAAC,YAAY,CAAC,CAAC;IAEjD,MAAM,UAAU,GAAG,aAAa;SAC7B,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;SAC3B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC;SAC5B,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC;IAE/B,IAAI,CAAC,UAAU,CAAC,MAAM;QAAE,OAAO,IAAI,CAAC;IACpC,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5B,OAAO,SAAS,CAAC,UAAU,EAAE,CAAC,EAAE,iBAAiB,CAAC,CAAC;IACrD,CAAC;IACD,OAAO,IAAI,UAAU,CAAC,UAAU,CAAC,CAAC;AACpC,CAAC;AAED,MAAM,OAAO,GAAG,CAAC,UAAqB,EAAW,EAAE;IACjD,IAAI,KAAK,GAAY,SAAS,CAAC,UAAU,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;IACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,KAAK,GAAG,MAAM,CAAC,KAAK,EAAE,SAAS,CAAC,UAAU,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC;IAC7D,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC,CAAC;AAEF;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,CAAC,OAAO,UAAU,MAAM,CAC5B,EAAW,EACX,cAAsB,EACtB,eAA+B,EAAE;IAEjC,IAAI,EAAE,YAAY,SAAS,EAAE,CAAC;QAC5B,OAAO,eAAe,CAAC,EAAE,EAAE,cAAc,EAAE,YAAY,CAAC,CAAC;IAC3D,CAAC;SAAM,IAAI,EAAE,YAAY,UAAU,EAAE,CAAC;QACpC,OAAO,OAAO,CAAC,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,cAAc,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC;IACpF,CAAC;SAAM,IAAI,EAAE,YAAY,iBAAiB,EAAE,CAAC;QAC3C,MAAM,UAAU,GAAG,OAAO,CACxB,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,cAAc,EAAE,YAAY,CAAC,CAAC,CAC5E,CAAC;QACF,OAAO,KAAK,CACV,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,UAAU,EAAE,CAAC,EAAE,QAAQ,CAAC,EAAE,cAAc,EAAE,YAAY,CAAC,EAC3E,UAAU,CACX,CAAC;IACJ,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC","sourcesContent":["import Flatbush from 'flatbush';\n\nimport { bug, safeIndex } from '../../core/errors.js';\nimport { unwrap } from '../../core/result.js';\nimport { wasmIndex } from '../../utils/vec3.js';\nimport type { Point2D } from '../../2d/lib/index.js';\nimport {\n  intersectCurves,\n  stitchCurves,\n  make2dOffset,\n  Curve2D,\n  samePoint as defaultSamePoint,\n  make2dSegmentCurve,\n  squareDistance2d,\n  make2dArcFromCenter,\n  add2d,\n  subtract2d,\n  PRECISION_OFFSET,\n} from '../../2d/lib/index.js';\nimport Blueprint from './blueprint.js';\nimport Blueprints from './blueprints.js';\nimport CompoundBlueprint from './compoundBlueprint.js';\nimport type { Shape2D } from './boolean2D.js';\nimport { fuse2D, cut2D } from './boolean2D.js';\n\nconst samePoint = (x: Point2D, y: Point2D) => defaultSamePoint(x, y, PRECISION_OFFSET * 100);\n\nconst getIntersectionPoint = (\n  line1Start: Point2D,\n  line1End: Point2D,\n  line2Start: Point2D,\n  line2End: Point2D\n): Point2D | null => {\n  // Pre-compute direction differences (det([[a,1],[b,1]]) = a - b)\n  const dx1 = line1Start[0] - line1End[0];\n  const dy1 = line1Start[1] - line1End[1];\n  const dx2 = line2Start[0] - line2End[0];\n  const dy2 = line2Start[1] - line2End[1];\n\n  // Denominator: det([[dx1, dy1], [dx2, dy2]])\n  const denom = dx1 * dy2 - dy1 * dx2;\n  if (Math.abs(denom) < 1e-12) return null;\n\n  // Cross products for the line equations\n  const cross1 = line1Start[0] * line1End[1] - line1Start[1] * line1End[0];\n  const cross2 = line2Start[0] * line2End[1] - line2Start[1] * line2End[0];\n\n  // Intersection point using Cramer's rule\n  const x = (cross1 * dx2 - cross2 * dx1) / denom;\n  const y = (cross1 * dy2 - cross2 * dy1) / denom;\n\n  return [x, y] as Point2D;\n};\n\nfunction joinRound(\n  appendCurve: (curve: OffsetCurvePair | Curve2D) => void,\n  previousLastPoint: Point2D,\n  firstPoint: Point2D,\n  previousCurve: OffsetCurvePair,\n  _curve: OffsetCurvePair\n) {\n  const arcJoiner = make2dArcFromCenter(\n    previousLastPoint,\n    firstPoint,\n    previousCurve.original.lastPoint\n  );\n\n  appendCurve(previousCurve);\n  appendCurve(arcJoiner);\n}\n\nfunction joinBevel(\n  appendCurve: (curve: OffsetCurvePair | Curve2D) => void,\n  previousLastPoint: Point2D,\n  firstPoint: Point2D,\n  previousCurve: OffsetCurvePair,\n  _curve: OffsetCurvePair\n) {\n  const bevelJoiner = make2dSegmentCurve(previousLastPoint, firstPoint);\n\n  appendCurve(previousCurve);\n  appendCurve(bevelJoiner);\n}\n\nfunction joinMiter(\n  appendCurve: (curve: OffsetCurvePair | Curve2D) => void,\n  previousLastPoint: Point2D,\n  firstPoint: Point2D,\n  previousCurve: OffsetCurvePair,\n  curve: OffsetCurvePair\n) {\n  const previousOtherPoint =\n    previousCurve.offset instanceof Curve2D\n      ? subtract2d(previousLastPoint, previousCurve.offset.tangentAt(1))\n      : previousCurve.offset.firstPoint;\n  const nextOtherPoint =\n    curve.offset instanceof Curve2D\n      ? add2d(firstPoint, curve.offset.tangentAt(0))\n      : curve.offset.lastPoint;\n\n  const offsetIntersectionPoint = getIntersectionPoint(\n    previousOtherPoint,\n    previousLastPoint,\n    firstPoint,\n    nextOtherPoint\n  );\n\n  if (!offsetIntersectionPoint) {\n    // Lines are parallel — fall back to bevel join\n    const bevelJoiner = make2dSegmentCurve(previousLastPoint, firstPoint);\n    appendCurve(previousCurve);\n    appendCurve(bevelJoiner);\n    return;\n  }\n\n  const midpoint: Point2D = [\n    (previousLastPoint[0] + firstPoint[0]) / 2,\n    (previousLastPoint[1] + firstPoint[1]) / 2,\n  ];\n  const miterDist = squareDistance2d(midpoint, offsetIntersectionPoint);\n  const endpointDist = squareDistance2d(previousLastPoint, firstPoint);\n  if (endpointDist < 1e-18 || miterDist > 16 * endpointDist) {\n    const bevelJoiner = make2dSegmentCurve(previousLastPoint, firstPoint);\n    appendCurve(previousCurve);\n    appendCurve(bevelJoiner);\n    return;\n  }\n\n  const miterJoiner1 = make2dSegmentCurve(previousLastPoint, offsetIntersectionPoint);\n  const miterJoiner2 = make2dSegmentCurve(offsetIntersectionPoint, firstPoint);\n\n  appendCurve(previousCurve);\n  appendCurve(miterJoiner1);\n  appendCurve(miterJoiner2);\n}\n\nconst OFFSET_JOINERS = {\n  round: joinRound,\n  bevel: joinBevel,\n  miter: joinMiter,\n} as const;\n\n/**\n * Handle the case where adjacent offset curves intersect: split both at\n * the closest intersection and return updated previous/current curves.\n */\nfunction splitAtIntersection(\n  previousCurve: OffsetCurvePair,\n  curve: OffsetCurvePair,\n  intersections: Point2D[]\n): { splitPrevious: OffsetCurvePair; splitCurrent: OffsetCurvePair } {\n  const intersection: Point2D =\n    intersections.length === 1\n      ? safeIndex(intersections, 0, 'rawOffsets')\n      : selectClosestIntersection(intersections, previousCurve.original.lastPoint);\n\n  const splitPreviousCurve: Curve2D = safeIndex(\n    (previousCurve.offset as Curve2D).splitAt([intersection], PRECISION_OFFSET),\n    0,\n    'rawOffsets'\n  );\n  const splitCurve = (curve.offset as Curve2D).splitAt([intersection], PRECISION_OFFSET).at(-1);\n\n  if (!splitCurve) bug('offset.rawOffsets', 'Split produced no trailing curve segment');\n\n  return {\n    splitPrevious: { offset: splitPreviousCurve, original: previousCurve.original },\n    splitCurrent: { offset: splitCurve, original: curve.original },\n  };\n}\n\n/**\n * From an array of candidate intersection points, select the one closest to\n * a reference point (the original curve endpoint).\n */\nfunction selectClosestIntersection(intersections: Point2D[], referencePoint: Point2D): Point2D {\n  let closest = safeIndex(intersections, 0, 'selectClosestIntersection');\n  let minDist = squareDistance2d(closest, referencePoint);\n  for (let i = 1; i < intersections.length; i++) {\n    const point = safeIndex(intersections, i, 'selectClosestIntersection');\n    const d = squareDistance2d(point, referencePoint);\n    if (d < minDist) {\n      minDist = d;\n      closest = point;\n    }\n  }\n  return closest;\n}\n\n/**\n * Build a map of self-intersection points per curve index using a spatial\n * index over offset-curve bounding boxes.\n */\nfunction findSelfIntersections(offsettedArray: Curve2D[]): Map<number, Point2D[]> {\n  const allIntersections: Map<number, Point2D[]> = new Map();\n  const updateIntersections = (index: number, newPoints: Point2D[]) => {\n    const intersections = allIntersections.get(index) || [];\n    allIntersections.set(index, [...intersections, ...newPoints]);\n  };\n\n  // Build spatial index of curve bounding boxes for O(n log n) intersection filtering\n  const spatialIndex = new Flatbush(offsettedArray.length);\n  for (const curve of offsettedArray) {\n    const [[xMin, yMin], [xMax, yMax]] = curve.boundingBox.bounds;\n    spatialIndex.add(xMin, yMin, xMax, yMax);\n  }\n  spatialIndex.finish();\n\n  // Use spatial index to find candidate pairs, avoiding O(n²) comparisons\n  offsettedArray.forEach((firstCurve, firstIndex) => {\n    const [[xMin, yMin], [xMax, yMax]] = firstCurve.boundingBox.bounds;\n    const candidates = spatialIndex.search(xMin, yMin, xMax, yMax);\n\n    for (const secondIndex of candidates) {\n      // Only test pairs where secondIndex > firstIndex to avoid duplicates\n      if (secondIndex <= firstIndex) continue;\n\n      const secondCurve = safeIndex(offsettedArray, secondIndex, 'offsetBlueprint');\n\n      const { intersections: rawIntersections, commonSegmentsPoints } = unwrap(\n        intersectCurves(firstCurve, secondCurve, PRECISION_OFFSET)\n      );\n\n      const intersections = [...rawIntersections, ...commonSegmentsPoints].filter(\n        (intersection) => {\n          const onFirstCurveExtremity =\n            samePoint(intersection, firstCurve.firstPoint) ||\n            samePoint(intersection, firstCurve.lastPoint);\n\n          const onSecondCurveExtremity =\n            samePoint(intersection, secondCurve.firstPoint) ||\n            samePoint(intersection, secondCurve.lastPoint);\n\n          return !(onFirstCurveExtremity && onSecondCurveExtremity);\n        }\n      );\n\n      if (!intersections.length) continue;\n\n      updateIntersections(firstIndex, intersections);\n      updateIntersections(secondIndex, intersections);\n    }\n  });\n\n  return allIntersections;\n}\n\n/**\n * Compute raw offset curves for a single blueprint without self-intersection cleanup.\n *\n * Offsets each curve individually, then joins adjacent offset curves using the\n * configured line-join strategy (round, bevel, or miter).\n *\n * @param blueprint - The blueprint to offset.\n * @param offset - Offset distance (positive = outward, negative = inward).\n * @param offsetConfig - Join style configuration.\n * @returns Array of offset curves (may contain self-intersections).\n *\n * @remarks This is the low-level building block used by {@link offsetBlueprint}.\n * Most callers should prefer {@link offset} instead.\n */\nexport function rawOffsets(\n  blueprint: Blueprint,\n  offset: number,\n  offsetConfig: Offset2DConfig = {}\n): Curve2D[] {\n  const correctedOffset = blueprint.orientation === 'clockwise' ? -offset : offset;\n  const offsetCurves: OffsetCurvePair[] = blueprint.curves.map((c) => ({\n    offset: make2dOffset(c, correctedOffset),\n    original: c,\n  }));\n\n  // Ideally we would use the length of the curve to make sure it is\n  // not only a point, but the algo we have access to are a bit to\n  // convoluted to be usable here\n\n  const offsettedArray: Curve2D[] = [];\n\n  let savedLastCurve: null | OffsetCurvePair = null;\n\n  let previousCurve = offsetCurves.at(-1);\n\n  // We have no offset curves\n  if (!previousCurve) return [];\n\n  function appendCurve(curve: OffsetCurvePair | Curve2D) {\n    // There are different ways to build the array of offsetted curves.\n    // This should build the array of offsetted curves depending on the shape of\n    // what we are offsetting.\n\n    // if the curve is a Curve2D we just push it\n    if (curve instanceof Curve2D) {\n      offsettedArray.push(curve);\n      return;\n    }\n\n    if (!savedLastCurve) {\n      // we make the first curve we append available to wrap when iterating\n      savedLastCurve = curve;\n    } else if (curve.offset instanceof Curve2D) {\n      // if we have an offset curve that is a Curve2D we push it\n      offsettedArray.push(curve.offset);\n    } else if (!samePoint(curve.offset.firstPoint, curve.offset.lastPoint)) {\n      // if the offset curve is collapsed we push a segment curve\n      offsettedArray.push(make2dSegmentCurve(curve.offset.firstPoint, curve.offset.lastPoint));\n    }\n  }\n\n  const iterateOffsetCurves = function* (): Generator<OffsetCurvePair> {\n    for (const curve of offsetCurves.slice(0, -1)) {\n      yield curve;\n    }\n    // This should never happen\n    if (!savedLastCurve) bug('offset.rawOffsets', 'No saved curve after iterating offset segments');\n    yield savedLastCurve;\n  };\n\n  for (const curve of iterateOffsetCurves()) {\n    const previousLastPoint = previousCurve.offset.lastPoint;\n    const firstPoint = curve.offset.firstPoint;\n\n    // When the offset curves do still touch we do nothing\n    if (samePoint(previousLastPoint, firstPoint)) {\n      appendCurve(previousCurve);\n      previousCurve = curve;\n      continue;\n    }\n\n    let intersections: Point2D[] = [];\n\n    if (previousCurve.offset instanceof Curve2D && curve.offset instanceof Curve2D) {\n      // When the offset curves intersect we cut them and save them at\n      const { intersections: pointIntersections, commonSegmentsPoints } = unwrap(\n        intersectCurves(previousCurve.offset, curve.offset, PRECISION_OFFSET / 100)\n      );\n      intersections = [...pointIntersections, ...commonSegmentsPoints];\n    }\n\n    if (intersections.length > 0) {\n      // Pick the intersection closest to the original curve endpoint\n      // (following https://github.com/jbuckmccready/cavalier_contours/)\n      const { splitPrevious, splitCurrent } = splitAtIntersection(\n        previousCurve,\n        curve,\n        intersections\n      );\n      appendCurve(splitPrevious);\n      previousCurve = splitCurrent;\n      continue;\n    }\n\n    // When the offset curves do not intersect we link them with an offset\n    // joiner\n    const joiner = OFFSET_JOINERS[offsetConfig.lineJoinType ?? 'round'];\n    joiner(appendCurve, previousLastPoint, firstPoint, previousCurve, curve);\n\n    previousCurve = curve;\n  }\n\n  appendCurve(previousCurve);\n  return offsettedArray;\n}\n\ninterface OffsetCurvePair {\n  offset: Curve2D | { collapsed: true; firstPoint: Point2D; lastPoint: Point2D };\n  original: Curve2D;\n}\n\n/** Configuration for 2D offset operations. */\nexport interface Offset2DConfig {\n  /** Corner join style when offset curves diverge (default: `'round'`). */\n  lineJoinType?: 'miter' | 'bevel' | 'round';\n}\n\n/**\n * Offset a single blueprint, resolving self-intersections and pruning invalid segments.\n *\n * Produces a new shape whose boundary is at a constant distance from the input\n * blueprint. Self-intersections introduced by the offset are resolved using\n * spatial indexing and curve splitting, following the\n * {@link https://github.com/jbuckmccready/CavalierContours | Cavalier Contours} algorithm.\n *\n * @param blueprint - The source blueprint.\n * @param offset - Offset distance (positive = outward, negative = inward).\n * @param offsetConfig - Join style configuration.\n * @returns The offset shape, or `null` if the offset collapses the blueprint.\n *\n * @see {@link offset} for the polymorphic version that handles all Shape2D types.\n */\nexport function offsetBlueprint(\n  blueprint: Blueprint,\n  offset: number,\n  offsetConfig: Offset2DConfig = {}\n): Shape2D {\n  const offsettedArray = rawOffsets(blueprint, offset, offsetConfig);\n\n  if (offsettedArray.length < 2) return null;\n\n  // We remove the self intersections with the use the the algorithm as described in https://github.com/jbuckmccready/CavalierContours#offset-algorithm-and-stepwise-example\n\n  const allIntersections = findSelfIntersections(offsettedArray);\n\n  if (!allIntersections.size) {\n    const offsettedBlueprint = new Blueprint(offsettedArray);\n    if (!blueprint.intersects(offsettedBlueprint)) return offsettedBlueprint;\n    return null;\n  }\n\n  const splitCurves = offsettedArray.flatMap((curve, index) => {\n    if (!allIntersections.has(index)) return curve;\n\n    const intersections = allIntersections.get(index) || [];\n    const splitCurves = curve.splitAt(intersections, PRECISION_OFFSET * 100);\n    return splitCurves;\n  });\n\n  // We remove all the segments that are closer to the original curve than the offset\n  const originalIndex = new Flatbush(blueprint.curves.length);\n  for (const c of blueprint.curves) {\n    const [[xMin, yMin], [xMax, yMax]] = c.boundingBox.bounds;\n    originalIndex.add(xMin, yMin, xMax, yMax);\n  }\n  originalIndex.finish();\n\n  const absOffset = Math.abs(offset);\n  const prunedCurves = splitCurves.filter((curve) => {\n    const [[xMin, yMin], [xMax, yMax]] = curve.boundingBox.bounds;\n    const candidates = originalIndex.search(\n      xMin - absOffset,\n      yMin - absOffset,\n      xMax + absOffset,\n      yMax + absOffset\n    );\n    return !candidates.some((idx) => {\n      const c = wasmIndex(blueprint.curves, idx);\n      return c.distanceFrom(curve) < absOffset - PRECISION_OFFSET;\n    });\n  });\n\n  if (!prunedCurves.length) return null;\n\n  const curvesGrouped = stitchCurves(prunedCurves);\n\n  const blueprints = curvesGrouped\n    .filter((c) => c.length > 1)\n    .map((c) => new Blueprint(c))\n    .filter((b) => b.isClosed());\n\n  if (!blueprints.length) return null;\n  if (blueprints.length === 1) {\n    return safeIndex(blueprints, 0, 'offsetBlueprint');\n  }\n  return new Blueprints(blueprints);\n}\n\nconst fuseAll = (blueprints: Shape2D[]): Shape2D => {\n  let fused: Shape2D = safeIndex(blueprints, 0, 'fuseAll');\n  for (let i = 1; i < blueprints.length; i++) {\n    fused = fuse2D(fused, safeIndex(blueprints, i, 'fuseAll'));\n  }\n  return fused;\n};\n\n/**\n * Offset any 2D shape (Blueprint, CompoundBlueprint, or Blueprints) by a distance.\n *\n * Dispatches to {@link offsetBlueprint} for simple blueprints and recursively\n * handles compound and multi-blueprint shapes.\n *\n * @param bp - The shape to offset.\n * @param offsetDistance - Offset distance (positive = outward, negative = inward).\n * @param offsetConfig - Join style configuration.\n * @returns The offset shape, or `null` if the offset collapses entirely.\n *\n * @example\n * ```ts\n * const expanded = offset(blueprint, 2);\n * const shrunk = offset(blueprint, -1, { lineJoinType: 'miter' });\n * ```\n */\nexport default function offset(\n  bp: Shape2D,\n  offsetDistance: number,\n  offsetConfig: Offset2DConfig = {}\n): Shape2D {\n  if (bp instanceof Blueprint) {\n    return offsetBlueprint(bp, offsetDistance, offsetConfig);\n  } else if (bp instanceof Blueprints) {\n    return fuseAll(bp.blueprints.map((b) => offset(b, offsetDistance, offsetConfig)));\n  } else if (bp instanceof CompoundBlueprint) {\n    const innerShape = fuseAll(\n      bp.blueprints.slice(1).map((b) => offset(b, -offsetDistance, offsetConfig))\n    );\n    return cut2D(\n      offset(safeIndex(bp.blueprints, 0, 'offset'), offsetDistance, offsetConfig),\n      innerShape\n    );\n  }\n  return null;\n}\n"]}