curvy 1.0.9 → 2.0.0-alpha.2

package/dist/shared/rationalCubic2d-B6g97ryJ.d.mts

@@ -0,0 +1,308 @@
+import { t as Vector2 } from "./vector2-DPUY3_eA.mjs";
+import { t as Pipeable } from "./utils-MCckigYk.mjs";
+import { n as Closed } from "./interval-Dy-RMEE3.mjs";
+import { t as Interval2d } from "./interval2d-C2id9u31.mjs";
+import { r as CubicCurve2d, t as RationalCubicCurve2d } from "./rationalCubic2d-DlQfBURs.mjs";
+
+//#region src/path/traits.d.ts
+/**
+ * Trait brands for paths.
+ *
+ * Brands are phantom types — they exist only at the type level and carry no
+ * runtime data. Refiners (`isContinuous`) and assertions (`asContinuous`) on
+ * each path module attach these brands to the path's `Trait` parameter at the
+ * type level.
+ *
+ * @since 2.0.0
+ */
+declare const ContinuousId: unique symbol;
+/**
+ * Brand for paths whose adjacent curves connect at their join points (G⁰
+ * continuity). Calling `toPathData` on a `Continuous` path skips the
+ * per-segment discontinuity check and emits a single `M` followed by drawing
+ * commands.
+ *
+ * @since 2.0.0
+ */
+type Continuous = {
+  readonly [ContinuousId]: 'continuous';
+};
+/**
+ * Phantom property key used by path interfaces to hold their `Trait` type
+ * parameter. The runtime object never has a value at this key.
+ *
+ * @since 2.0.0
+ */
+declare const PathTraits: unique symbol;
+type PathTraits = typeof PathTraits;
+//#endregion
+//#region src/path/cubic2d.internal.d.ts
+declare const CubicPath2dTypeId: unique symbol;
+type CubicPath2dTypeId = typeof CubicPath2dTypeId;
+declare namespace cubic2d_d_exports {
+  export { Continuous, CubicPath2d, append$1 as append, asContinuous, boundingBox, fromArray$1 as fromArray, isContinuous, isCubicPath2d, length, make$1 as make, solve$1 as solve, solveByDistance, toPathData };
+}
+/**
+ * A cubic path in 2D space.
+ *
+ * All fields are readonly and immutable, and all operations create new instances.
+ *
+ * The `Trait` type parameter accumulates trait brands as the path is refined
+ * via `isContinuous` / `asContinuous`.
+ *
+ * @since 1.0.0
+ */
+interface CubicPath2d<out Trait = unknown> extends Pipeable, Iterable<CubicCurve2d> {
+  readonly [CubicPath2dTypeId]: CubicPath2dTypeId;
+  readonly [PathTraits]: Trait;
+}
+/**
+ * Creates a new `CubicPath2d` instance from a sequence of curves.
+ *
+ * @param curves - The curves to create the path from.
+ * @returns A new `CubicPath2d` instance.
+ * @since 2.0.0
+ */
+declare const make$1: (...curves: ReadonlyArray<CubicCurve2d>) => CubicPath2d;
+/**
+ * Creates a new `CubicPath2d` instance from an array of curves.
+ *
+ * @param curves - The curves to create the path from.
+ * @returns A new `CubicPath2d` instance.
+ * @since 2.0.0
+ */
+declare const fromArray$1: (curves: ReadonlyArray<CubicCurve2d>) => CubicPath2d;
+/**
+ * Checks if a value is a `CubicPath2d`.
+ *
+ * @param p - The value to check.
+ * @returns `true` if the value is a `CubicPath2d`, `false` otherwise.
+ * @since 1.0.0
+ */
+declare const isCubicPath2d: (p: unknown) => p is CubicPath2d;
+declare const append$1: {
+  /**
+   * Appends a cubic curve to a cubic path.
+   *
+   * @param c - The cubic curve to append.
+   * @returns A function that takes a cubic path and returns a new cubic path.
+   * @since 1.0.0
+   */
+  (c: CubicCurve2d): (p: CubicPath2d) => CubicPath2d;
+  /**
+   * Appends a cubic curve to a cubic path.
+   *
+   * @param p - The cubic path to append to.
+   * @param c - The cubic curve to append.
+   * @returns A new cubic path.
+   * @since 1.0.0
+   */
+  (p: CubicPath2d, c: CubicCurve2d): CubicPath2d;
+};
+/**
+ * Calculates the length of a cubic path.
+ *
+ * @param p - The cubic path to calculate the length of.
+ * @returns The length of the cubic path.
+ * @since 1.0.0
+ */
+declare const length: (p: CubicPath2d) => number;
+declare const solve$1: {
+  /**
+   * Solves a cubic path for a given parameter.
+   *
+   * @param u - The parameter to solve for.
+   * @returns A function that takes a cubic path and returns the solved vector.
+   * @since 1.0.0
+   */
+  (u: number): (p: CubicPath2d) => Vector2;
+  /**
+   * Solves a cubic path for a given parameter.
+   *
+   * @param p - The cubic path to solve.
+   * @param u - The parameter to solve for.
+   * @returns The solved vector.
+   * @since 1.0.0
+   */
+  (p: CubicPath2d, u: number): Vector2;
+};
+/**
+ * Serializes a cubic path as an SVG path data string (the value of a `<path>`
+ * element's `d` attribute), using `M` and `C` commands. Discontinuities between
+ * curves emit a fresh `M` command.
+ *
+ * @param p - The cubic path to serialize.
+ * @returns The SVG path data string.
+ * @since 2.0.0
+ */
+declare const toPathData: (p: CubicPath2d) => string;
+/**
+ * Type-narrowing predicate: refines `CubicPath2d<T>` to
+ * `CubicPath2d<T & Continuous>` when adjacent curves connect.
+ *
+ * @since 2.0.0
+ */
+declare const isContinuous: <T>(p: CubicPath2d<T>) => p is CubicPath2d<T & Continuous>;
+/**
+ * Asserts that the cubic path is continuous, throwing on failure.
+ *
+ * @since 2.0.0
+ */
+declare const asContinuous: <T>(p: CubicPath2d<T>) => CubicPath2d<T & Continuous>;
+declare const solveByDistance: {
+  /**
+   * Solves a cubic path by normalized arc length. Unlike {@link solve}, which
+   * is parameterized by curve `u`, this samples points at constant speed along
+   * the path — `s = 0.5` returns the point exactly halfway along the curve by
+   * arc length, regardless of how the underlying parameterization stretches.
+   *
+   * Cumulative segment lengths are cached by path identity so repeated calls
+   * with the same path are fast.
+   *
+   * @param p - The cubic path to sample.
+   * @param s - Normalized arc length in `[0, 1]`. Values outside the range are
+   *   clamped to path endpoints.
+   * @returns The point on the path at the given normalized arc length.
+   * @since 1.1.0
+   */
+  (p: CubicPath2d, s: number): Vector2;
+  /**
+   * Solves a cubic path by normalized arc length.
+   *
+   * @param s - Normalized arc length in `[0, 1]`.
+   * @returns A function that takes a cubic path and returns the point at that
+   *   arc length.
+   * @since 1.1.0
+   */
+  (s: number): (p: CubicPath2d) => Vector2;
+};
+/**
+ * Computes the axis-aligned bounding box of the path — the smallest closed
+ * `Box2d` enclosing every segment.
+ *
+ * @param p - The cubic path.
+ * @returns A closed `Box2d` enclosing the path.
+ * @since 2.1.0
+ */
+declare const boundingBox: (p: CubicPath2d) => Interval2d<Closed, Closed>;
+//#endregion
+//#region src/path/rationalCubic2d.internal.d.ts
+declare const RationalCubicPath2dTypeId: unique symbol;
+type RationalCubicPath2dTypeId = typeof RationalCubicPath2dTypeId;
+declare namespace rationalCubic2d_d_exports {
+  export { RationalCubicPath2d, append, approximateAsCubicPath, fromArray, isRationalCubicPath2d, make, solve };
+}
+/**
+ * A rational cubic path in 2D space.
+ *
+ * Holds a non-empty sequence of `RationalCubicCurve2d` segments; iteration
+ * yields the segments in order. The path parameter `u ∈ [0, 1]` is mapped
+ * uniformly across segments — `u = 0` is the start of the first segment,
+ * `u = 1` is the end of the last segment, and intermediate values pick a
+ * segment by index and a local parameter within it.
+ *
+ * Counterpart to `CubicPath2d` for curves whose evaluation includes the
+ * homogeneous-to-plane projection.
+ *
+ * All fields are readonly and immutable, and all operations create new instances.
+ *
+ * @since 2.1.0
+ */
+interface RationalCubicPath2d extends Pipeable, Iterable<RationalCubicCurve2d> {
+  readonly [RationalCubicPath2dTypeId]: RationalCubicPath2dTypeId;
+}
+/**
+ * Checks if a value is a `RationalCubicPath2d`.
+ *
+ * @param p - The value to check.
+ * @returns `true` if the value is a `RationalCubicPath2d`, `false` otherwise.
+ * @since 2.1.0
+ */
+declare const isRationalCubicPath2d: (p: unknown) => p is RationalCubicPath2d;
+/**
+ * Creates a new `RationalCubicPath2d` from a sequence of curves.
+ *
+ * @param curves - The curves to create the path from.
+ * @returns A new `RationalCubicPath2d` instance.
+ * @since 2.1.0
+ */
+declare const make: (...curves: ReadonlyArray<RationalCubicCurve2d>) => RationalCubicPath2d;
+/**
+ * Creates a new `RationalCubicPath2d` from an array of curves.
+ *
+ * @param curves - The curves to create the path from.
+ * @returns A new `RationalCubicPath2d` instance.
+ * @since 2.1.0
+ */
+declare const fromArray: (curves: ReadonlyArray<RationalCubicCurve2d>) => RationalCubicPath2d;
+declare const append: {
+  /**
+   * Appends a curve to a `RationalCubicPath2d`.
+   *
+   * @param c - The curve to append.
+   * @returns A function that takes a path and returns a new path with the appended curve.
+   * @since 2.1.0
+   */
+  (c: RationalCubicCurve2d): (p: RationalCubicPath2d) => RationalCubicPath2d;
+  /**
+   * Appends a curve to a `RationalCubicPath2d`.
+   *
+   * @param p - The path to append to.
+   * @param c - The curve to append.
+   * @returns A new path with the appended curve.
+   * @since 2.1.0
+   */
+  (p: RationalCubicPath2d, c: RationalCubicCurve2d): RationalCubicPath2d;
+};
+declare const solve: {
+  /**
+   * Evaluates the rational cubic path at parameter `u ∈ [0, 1]`.
+   *
+   * Picks the segment containing `u` (uniform mapping across segments) and
+   * delegates to `RationalCubicCurve2d.solve` on that segment with the local
+   * parameter.
+   *
+   * @param p - The path to evaluate.
+   * @param u - The path parameter in `[0, 1]`.
+   * @returns The point on the path at parameter `u`.
+   * @since 2.1.0
+   */
+  (p: RationalCubicPath2d, u: number): Vector2;
+  /**
+   * Evaluates the rational cubic path at parameter `u ∈ [0, 1]`.
+   *
+   * @param u - The path parameter in `[0, 1]`.
+   * @returns A function that takes a path and returns the point at `u`.
+   * @since 2.1.0
+   */
+  (u: number): (p: RationalCubicPath2d) => Vector2;
+};
+declare const approximateAsCubicPath: {
+  /**
+   * Approximates the rational cubic path as a `CubicPath2d` via per-segment
+   * recursive subdivision. Each input segment is split until its midpoint
+   * deviates from a polynomial-cubic candidate by at most `tolerance`; the
+   * surviving candidates are concatenated into a new path.
+   *
+   * Lossy in general — only exact when every input segment has uniform
+   * weights, in which case segment count is preserved. Tighter tolerance
+   * produces more segments.
+   *
+   * @param p - The rational cubic path to approximate.
+   * @param tolerance - Maximum allowed midpoint deviation per segment; must be positive.
+   * @returns A new `CubicPath2d` approximating the input.
+   * @since 2.1.0
+   */
+  (p: RationalCubicPath2d, tolerance: number): CubicPath2d;
+  /**
+   * Approximates the rational cubic path as a `CubicPath2d`.
+   *
+   * @param tolerance - Maximum allowed midpoint deviation per segment; must be positive.
+   * @returns A function that takes a rational path and returns its approximation.
+   * @since 2.1.0
+   */
+  (tolerance: number): (p: RationalCubicPath2d) => CubicPath2d;
+};
+//#endregion
+export { Continuous as a, cubic2d_d_exports as i, rationalCubic2d_d_exports as n, PathTraits as o, CubicPath2d as r, RationalCubicPath2d as t };
+//# sourceMappingURL=rationalCubic2d-B6g97ryJ.d.mts.map

package/dist/shared/rationalCubic2d-BEgUGSFf.mjs

@@ -0,0 +1,295 @@
+import { t as __exportAll } from "./chunk-25Hzd3z8.mjs";
+import { Pipeable, dual, invariant } from "../utils.mjs";
+import { epsEquals } from "../number.mjs";
+import { r as magnitude } from "./vector2-CL1HDdPr.mjs";
+import { c as make$4, p as unit } from "./interval-05CR6eBf.mjs";
+import { r as union } from "./interval2d-8IBZnUOq.mjs";
+import { a as boundingBox$2, c as length$2, i as solve$6, l as solve$4, m as solve$5, t as approximateAsCubicCurves, u as derivative } from "./rationalCubic2d-Bys2Uory.mjs";
+//#region src/path/cubic2d.internal.ts
+const CubicPath2dTypeId = Symbol("curvy/path/cubic2d");
+var CubicPath2dImpl = class extends Pipeable {
+	[CubicPath2dTypeId] = CubicPath2dTypeId;
+	curves;
+	constructor(curves) {
+		invariant(curves.length > 0, "cubic path requires at least one curve");
+		super();
+		this.curves = curves;
+	}
+	[Symbol.iterator]() {
+		return this.curves[Symbol.iterator]();
+	}
+};
+const isCubicPath2d$1 = (p) => typeof p === "object" && p !== null && CubicPath2dTypeId in p;
+const make$3 = (...curves) => new CubicPath2dImpl(curves);
+const fromArray$3 = (curves) => new CubicPath2dImpl(curves);
+const append$3 = dual(2, (p, c) => fromArray$3([...p, c]));
+const length$1 = (p) => {
+	let total = 0;
+	for (const curve of p) total += length$2(curve, unit);
+	return total;
+};
+const solve$3 = dual(2, (p, u) => {
+	const curves = p instanceof CubicPath2dImpl ? p.curves : [...p];
+	if (u === 1) return solve$4(curves.at(-1), 1);
+	const t = u * curves.length;
+	const i = Math.floor(t);
+	const curve = curves[i];
+	return solve$4(curve, t - i);
+});
+const cumulativeLengthCache = /* @__PURE__ */ new WeakMap();
+const getCumulativeLengths = (p) => {
+	let cached = cumulativeLengthCache.get(p);
+	if (cached === void 0) {
+		const lengths = [];
+		let total = 0;
+		for (const curve of p) {
+			total += length$2(curve, unit);
+			lengths.push(total);
+		}
+		cached = lengths;
+		cumulativeLengthCache.set(p, cached);
+	}
+	return cached;
+};
+const solveCurveByDistance = (curve, target, segmentLength) => {
+	if (target <= 0) return 0;
+	if (target >= segmentLength) return 1;
+	const derivative$1 = derivative(curve);
+	let t = target / segmentLength;
+	let lo = 0;
+	let hi = 1;
+	for (let iter = 0; iter < 16; iter++) {
+		const error = length$2(curve, make$4(0, t)) - target;
+		if (Math.abs(error) < 1e-10) return t;
+		if (error > 0) hi = t;
+		else lo = t;
+		const speed = magnitude(solve$5(derivative$1, t));
+		if (speed === 0) {
+			t = (lo + hi) / 2;
+			continue;
+		}
+		const next = t - error / speed;
+		t = next > lo && next < hi ? next : (lo + hi) / 2;
+	}
+	return t;
+};
+const toPathData$1 = (p) => {
+	let result = "";
+	let prevEndX = NaN;
+	let prevEndY = NaN;
+	for (const curve of p) {
+		const c0x = curve.x.c0;
+		const c0y = curve.y.c0;
+		const c1x = curve.x.c1;
+		const c1y = curve.y.c1;
+		const c2x = curve.x.c2;
+		const c2y = curve.y.c2;
+		const c3x = curve.x.c3;
+		const c3y = curve.y.c3;
+		const startX = c0x;
+		const startY = c0y;
+		const ctrl1X = c0x + c1x / 3;
+		const ctrl1Y = c0y + c1y / 3;
+		const ctrl2X = c0x + 2 * c1x / 3 + c2x / 3;
+		const ctrl2Y = c0y + 2 * c1y / 3 + c2y / 3;
+		const endX = c0x + c1x + c2x + c3x;
+		const endY = c0y + c1y + c2y + c3y;
+		if (!epsEquals(startX, prevEndX) || !epsEquals(startY, prevEndY)) result += ` M ${startX},${startY}`;
+		result += ` C ${ctrl1X},${ctrl1Y} ${ctrl2X},${ctrl2Y} ${endX},${endY}`;
+		prevEndX = endX;
+		prevEndY = endY;
+	}
+	return result.slice(1);
+};
+const isContinuous$1 = (p) => {
+	let prevEndX = NaN;
+	let prevEndY = NaN;
+	let first = true;
+	for (const curve of p) {
+		const startX = curve.x.c0;
+		const startY = curve.y.c0;
+		if (!first && (!epsEquals(startX, prevEndX) || !epsEquals(startY, prevEndY))) return false;
+		prevEndX = curve.x.c0 + curve.x.c1 + curve.x.c2 + curve.x.c3;
+		prevEndY = curve.y.c0 + curve.y.c1 + curve.y.c2 + curve.y.c3;
+		first = false;
+	}
+	return true;
+};
+const asContinuous$1 = (p) => {
+	invariant(isContinuous$1(p), "cubic path is not continuous");
+	return p;
+};
+const solveByDistance$1 = dual(2, (p, s) => {
+	if (s <= 0) return solve$3(p, 0);
+	if (s >= 1) return solve$3(p, 1);
+	const lengths = getCumulativeLengths(p);
+	const target = s * lengths[lengths.length - 1];
+	let k = 0;
+	while (k < lengths.length - 1 && lengths[k] < target) k++;
+	const segmentStart = k === 0 ? 0 : lengths[k - 1];
+	const segmentLength = lengths[k] - segmentStart;
+	const segmentTarget = target - segmentStart;
+	const curve = (p instanceof CubicPath2dImpl ? p.curves : [...p])[k];
+	return solve$4(curve, solveCurveByDistance(curve, segmentTarget, segmentLength));
+});
+const boundingBox$1 = (p) => {
+	const iter = p[Symbol.iterator]();
+	let acc = boundingBox$2(iter.next().value);
+	for (let next = iter.next(); !next.done; next = iter.next()) acc = union(acc, boundingBox$2(next.value));
+	return acc;
+};
+//#endregion
+//#region src/path/cubic2d.ts
+var cubic2d_exports = /* @__PURE__ */ __exportAll({
+	append: () => append$2,
+	asContinuous: () => asContinuous,
+	boundingBox: () => boundingBox,
+	fromArray: () => fromArray$2,
+	isContinuous: () => isContinuous,
+	isCubicPath2d: () => isCubicPath2d,
+	length: () => length,
+	make: () => make$2,
+	solve: () => solve$2,
+	solveByDistance: () => solveByDistance,
+	toPathData: () => toPathData
+});
+/**
+* Creates a new `CubicPath2d` instance from a sequence of curves.
+*
+* @param curves - The curves to create the path from.
+* @returns A new `CubicPath2d` instance.
+* @since 2.0.0
+*/
+const make$2 = make$3;
+/**
+* Creates a new `CubicPath2d` instance from an array of curves.
+*
+* @param curves - The curves to create the path from.
+* @returns A new `CubicPath2d` instance.
+* @since 2.0.0
+*/
+const fromArray$2 = fromArray$3;
+/**
+* Checks if a value is a `CubicPath2d`.
+*
+* @param p - The value to check.
+* @returns `true` if the value is a `CubicPath2d`, `false` otherwise.
+* @since 1.0.0
+*/
+const isCubicPath2d = isCubicPath2d$1;
+const append$2 = append$3;
+/**
+* Calculates the length of a cubic path.
+*
+* @param p - The cubic path to calculate the length of.
+* @returns The length of the cubic path.
+* @since 1.0.0
+*/
+const length = length$1;
+const solve$2 = solve$3;
+/**
+* Serializes a cubic path as an SVG path data string (the value of a `<path>`
+* element's `d` attribute), using `M` and `C` commands. Discontinuities between
+* curves emit a fresh `M` command.
+*
+* @param p - The cubic path to serialize.
+* @returns The SVG path data string.
+* @since 2.0.0
+*/
+const toPathData = toPathData$1;
+/**
+* Type-narrowing predicate: refines `CubicPath2d<T>` to
+* `CubicPath2d<T & Continuous>` when adjacent curves connect.
+*
+* @since 2.0.0
+*/
+const isContinuous = isContinuous$1;
+/**
+* Asserts that the cubic path is continuous, throwing on failure.
+*
+* @since 2.0.0
+*/
+const asContinuous = asContinuous$1;
+const solveByDistance = solveByDistance$1;
+/**
+* Computes the axis-aligned bounding box of the path — the smallest closed
+* `Box2d` enclosing every segment.
+*
+* @param p - The cubic path.
+* @returns A closed `Box2d` enclosing the path.
+* @since 2.1.0
+*/
+const boundingBox = boundingBox$1;
+//#endregion
+//#region src/path/rationalCubic2d.internal.ts
+const RationalCubicPath2dTypeId = Symbol("curvy/path/rationalCubic2d");
+var RationalCubicPath2dImpl = class extends Pipeable {
+	[RationalCubicPath2dTypeId] = RationalCubicPath2dTypeId;
+	curves;
+	constructor(curves) {
+		invariant(curves.length > 0, "rational cubic path requires at least one curve");
+		super();
+		this.curves = curves;
+	}
+	[Symbol.iterator]() {
+		return this.curves[Symbol.iterator]();
+	}
+};
+const isRationalCubicPath2d$1 = (p) => typeof p === "object" && p !== null && RationalCubicPath2dTypeId in p;
+const make$1 = (...curves) => new RationalCubicPath2dImpl(curves);
+const fromArray$1 = (curves) => new RationalCubicPath2dImpl(curves);
+const append$1 = dual(2, (p, c) => fromArray$1([...p, c]));
+const solve$1 = dual(2, (p, u) => {
+	const curves = p instanceof RationalCubicPath2dImpl ? p.curves : [...p];
+	if (u === 1) return solve$6(curves.at(-1), 1);
+	const t = u * curves.length;
+	const i = Math.floor(t);
+	const curve = curves[i];
+	return solve$6(curve, t - i);
+});
+const approximateAsCubicPath$1 = dual(2, (p, tolerance) => {
+	const curves = [];
+	for (const segment of p) for (const approx of approximateAsCubicCurves(segment, tolerance)) curves.push(approx);
+	return fromArray$2(curves);
+});
+//#endregion
+//#region src/path/rationalCubic2d.ts
+var rationalCubic2d_exports = /* @__PURE__ */ __exportAll({
+	append: () => append,
+	approximateAsCubicPath: () => approximateAsCubicPath,
+	fromArray: () => fromArray,
+	isRationalCubicPath2d: () => isRationalCubicPath2d,
+	make: () => make,
+	solve: () => solve
+});
+/**
+* Checks if a value is a `RationalCubicPath2d`.
+*
+* @param p - The value to check.
+* @returns `true` if the value is a `RationalCubicPath2d`, `false` otherwise.
+* @since 2.1.0
+*/
+const isRationalCubicPath2d = isRationalCubicPath2d$1;
+/**
+* Creates a new `RationalCubicPath2d` from a sequence of curves.
+*
+* @param curves - The curves to create the path from.
+* @returns A new `RationalCubicPath2d` instance.
+* @since 2.1.0
+*/
+const make = make$1;
+/**
+* Creates a new `RationalCubicPath2d` from an array of curves.
+*
+* @param curves - The curves to create the path from.
+* @returns A new `RationalCubicPath2d` instance.
+* @since 2.1.0
+*/
+const fromArray = fromArray$1;
+const append = append$1;
+const solve = solve$1;
+const approximateAsCubicPath = approximateAsCubicPath$1;
+//#endregion
+export { make$2 as i, rationalCubic2d_exports as n, cubic2d_exports as r, fromArray as t };
+
+//# sourceMappingURL=rationalCubic2d-BEgUGSFf.mjs.map

package/dist/shared/rationalCubic2d-BEgUGSFf.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"rationalCubic2d-BEgUGSFf.mjs","names":["isCubicPath2d","make","fromArray","append","length","CubicCurve2d.length","Interval.unit","solve","CubicCurve2d.solve","derivative","cubicCurveInternal.derivative","Interval.make","Vector2.magnitude","QuadraticCurve2d.solve","toPathData","isContinuous","asContinuous","solveByDistance","boundingBox","CubicCurve2d.boundingBox","Interval2d.union","make","internal.make","fromArray","internal.fromArray","internal.isCubicPath2d","append","internal.append","internal.length","solve","internal.solve","internal.toPathData","internal.isContinuous","internal.asContinuous","internal.solveByDistance","internal.boundingBox","isRationalCubicPath2d","make","fromArray","append","solve","RationalCubicCurve2d.solve","approximateAsCubicPath","RationalCubicCurve2d.approximateAsCubicCurves","CubicPath2d.fromArray","internal.isRationalCubicPath2d","internal.make","internal.fromArray","internal.append","internal.solve","internal.approximateAsCubicPath"],"sources":["../../src/path/cubic2d.internal.ts","../../src/path/cubic2d.ts","../../src/path/rationalCubic2d.internal.ts","../../src/path/rationalCubic2d.ts"],"sourcesContent":["import * as Interval2d from '../interval/interval2d'\nimport * as CubicCurve2d from '../curve/cubic2d'\nimport * as cubicCurveInternal from '../curve/cubic2d.internal'\nimport * as QuadraticCurve2d from '../curve/quadratic2d'\nimport * as Interval from '../interval/interval'\nimport { dual, Pipeable } from '../utils'\nimport { invariant } from '../utils'\nimport { epsEquals } from '../number'\nimport * as Vector2 from '../vector/vector2'\nimport type { CubicPath2d } from './cubic2d'\nimport { PathTraits, type Continuous } from './traits'\n\nexport const CubicPath2dTypeId: unique symbol = Symbol('curvy/path/cubic2d')\nexport type CubicPath2dTypeId = typeof CubicPath2dTypeId\n\nexport class CubicPath2dImpl extends Pipeable implements CubicPath2d<unknown> {\n  readonly [CubicPath2dTypeId]: CubicPath2dTypeId = CubicPath2dTypeId\n  declare readonly [PathTraits]: unknown\n\n  readonly curves: ReadonlyArray<CubicCurve2d.CubicCurve2d>\n\n  constructor(curves: ReadonlyArray<CubicCurve2d.CubicCurve2d>) {\n    invariant(curves.length > 0, 'cubic path requires at least one curve')\n    super()\n    this.curves = curves\n  }\n\n  [Symbol.iterator](): Iterator<CubicCurve2d.CubicCurve2d> {\n    return this.curves[Symbol.iterator]()\n  }\n}\n\nexport const isCubicPath2d = (p: unknown): p is CubicPath2d =>\n  typeof p === 'object' && p !== null && CubicPath2dTypeId in p\n\nexport const make = (...curves: ReadonlyArray<CubicCurve2d.CubicCurve2d>): CubicPath2d =>\n  new CubicPath2dImpl(curves)\n\nexport const fromArray = (curves: ReadonlyArray<CubicCurve2d.CubicCurve2d>): CubicPath2d =>\n  new CubicPath2dImpl(curves)\n\nexport const append = dual<\n  (c: CubicCurve2d.CubicCurve2d) => (p: CubicPath2d) => CubicPath2d,\n  (p: CubicPath2d, c: CubicCurve2d.CubicCurve2d) => CubicPath2d\n>(2, (p: CubicPath2d, c: CubicCurve2d.CubicCurve2d) => fromArray([...p, c]))\n\nexport const length = (p: CubicPath2d) => {\n  let total = 0\n  for (const curve of p) {\n    total += CubicCurve2d.length(curve, Interval.unit)\n  }\n\n  return total\n}\n\nexport const solve = dual<\n  (u: number) => (p: CubicPath2d) => Vector2.Vector2,\n  (p: CubicPath2d, u: number) => Vector2.Vector2\n>(2, (p: CubicPath2d, u: number) => {\n  const curves = p instanceof CubicPath2dImpl ? p.curves : [...p]\n\n  if (u === 1) {\n    const last = curves.at(-1) as CubicCurve2d.CubicCurve2d\n    return CubicCurve2d.solve(last, 1)\n  }\n\n  const t = u * curves.length\n  const i = Math.floor(t)\n  const curve = curves[i] as CubicCurve2d.CubicCurve2d\n  return CubicCurve2d.solve(curve, t - i)\n})\n\n// Cumulative segment lengths cache. lengths[k] = total length through segment k.\n// Cached by path identity since paths are immutable.\nconst cumulativeLengthCache = new WeakMap<CubicPath2d, ReadonlyArray<number>>()\n\nconst getCumulativeLengths = (p: CubicPath2d): ReadonlyArray<number> => {\n  let cached = cumulativeLengthCache.get(p)\n  if (cached === undefined) {\n    const lengths: Array<number> = []\n    let total = 0\n    for (const curve of p) {\n      total += CubicCurve2d.length(curve, Interval.unit)\n      lengths.push(total)\n    }\n    cached = lengths\n    cumulativeLengthCache.set(p, cached)\n  }\n  return cached\n}\n\n// Newton's method to find the local parameter t ∈ [0, 1] within `curve` such\n// that the arc length from 0 to t equals `target`. Each iteration costs one\n// GL32 quadrature plus one velocity eval; converges in 3–5 iterations for\n// well-behaved curves. Falls back to bisection on cusps where speed → 0.\nconst solveCurveByDistance = (\n  curve: CubicCurve2d.CubicCurve2d,\n  target: number,\n  segmentLength: number,\n): number => {\n  if (target <= 0) {\n    return 0\n  }\n  if (target >= segmentLength) {\n    return 1\n  }\n\n  const derivative = cubicCurveInternal.derivative(curve)\n\n  let t = target / segmentLength\n  let lo = 0\n  let hi = 1\n\n  for (let iter = 0; iter < 16; iter++) {\n    const currentLength = CubicCurve2d.length(curve, Interval.make(0, t))\n    const error = currentLength - target\n\n    if (Math.abs(error) < 1e-10) {\n      return t\n    }\n\n    if (error > 0) {\n      hi = t\n    } else {\n      lo = t\n    }\n\n    const speed = Vector2.magnitude(QuadraticCurve2d.solve(derivative, t))\n    if (speed === 0) {\n      // cusp — bisect instead\n      t = (lo + hi) / 2\n      continue\n    }\n\n    const next = t - error / speed\n    // bracket-clamp Newton step; if it leaves the bracket, fall back to bisection\n    t = next > lo && next < hi ? next : (lo + hi) / 2\n  }\n\n  return t\n}\n\n// Cubic Bernstein basis: P(t) = (1-t)³·p0 + 3(1-t)²t·p1 + 3(1-t)t²·p2 + t³·p3\n// expanded gives c0 = p0, c1 = -3p0 + 3p1, c2 = 3p0 - 6p1 + 3p2, c3 = -p0 + 3p1 - 3p2 + p3,\n// so: p0 = c0, p1 = c0 + c1/3, p2 = c0 + 2c1/3 + c2/3, p3 = c0 + c1 + c2 + c3.\nexport const toPathData = (p: CubicPath2d): string => {\n  let result = ''\n  let prevEndX = Number.NaN\n  let prevEndY = Number.NaN\n\n  for (const curve of p) {\n    const c0x = curve.x.c0\n    const c0y = curve.y.c0\n    const c1x = curve.x.c1\n    const c1y = curve.y.c1\n    const c2x = curve.x.c2\n    const c2y = curve.y.c2\n    const c3x = curve.x.c3\n    const c3y = curve.y.c3\n\n    const startX = c0x\n    const startY = c0y\n    const ctrl1X = c0x + c1x / 3\n    const ctrl1Y = c0y + c1y / 3\n    const ctrl2X = c0x + (2 * c1x) / 3 + c2x / 3\n    const ctrl2Y = c0y + (2 * c1y) / 3 + c2y / 3\n    const endX = c0x + c1x + c2x + c3x\n    const endY = c0y + c1y + c2y + c3y\n\n    if (!epsEquals(startX, prevEndX) || !epsEquals(startY, prevEndY)) {\n      result += ` M ${startX},${startY}`\n    }\n    result += ` C ${ctrl1X},${ctrl1Y} ${ctrl2X},${ctrl2Y} ${endX},${endY}`\n\n    prevEndX = endX\n    prevEndY = endY\n  }\n\n  return result.slice(1)\n}\n\nexport const isContinuous = <T>(p: CubicPath2d<T>): p is CubicPath2d<T & Continuous> => {\n  let prevEndX = Number.NaN\n  let prevEndY = Number.NaN\n  let first = true\n\n  for (const curve of p) {\n    const startX = curve.x.c0\n    const startY = curve.y.c0\n    if (!first && (!epsEquals(startX, prevEndX) || !epsEquals(startY, prevEndY))) {\n      return false\n    }\n    prevEndX = curve.x.c0 + curve.x.c1 + curve.x.c2 + curve.x.c3\n    prevEndY = curve.y.c0 + curve.y.c1 + curve.y.c2 + curve.y.c3\n    first = false\n  }\n  return true\n}\n\nexport const asContinuous = <T>(p: CubicPath2d<T>): CubicPath2d<T & Continuous> => {\n  invariant(isContinuous(p), 'cubic path is not continuous')\n  return p\n}\n\nexport const solveByDistance = dual<\n  (s: number) => (p: CubicPath2d) => Vector2.Vector2,\n  (p: CubicPath2d, s: number) => Vector2.Vector2\n>(2, (p: CubicPath2d, s: number) => {\n  if (s <= 0) {\n    return solve(p, 0)\n  }\n  if (s >= 1) {\n    return solve(p, 1)\n  }\n\n  const lengths = getCumulativeLengths(p)\n  const total = lengths[lengths.length - 1] as number\n  const target = s * total\n\n  // find segment k such that lengths[k-1] ≤ target ≤ lengths[k]\n  let k = 0\n  while (k < lengths.length - 1 && (lengths[k] as number) < target) {\n    k++\n  }\n\n  const segmentStart = k === 0 ? 0 : (lengths[k - 1] as number)\n  const segmentEnd = lengths[k] as number\n  const segmentLength = segmentEnd - segmentStart\n  const segmentTarget = target - segmentStart\n\n  const curves = p instanceof CubicPath2dImpl ? p.curves : [...p]\n  const curve = curves[k] as CubicCurve2d.CubicCurve2d\n  const localT = solveCurveByDistance(curve, segmentTarget, segmentLength)\n\n  return CubicCurve2d.solve(curve, localT)\n})\n\nexport const boundingBox = (\n  p: CubicPath2d,\n): Interval2d.Interval2d<Interval.Closed, Interval.Closed> => {\n  const iter = p[Symbol.iterator]()\n  const first = iter.next()\n  let acc = CubicCurve2d.boundingBox(first.value as CubicCurve2d.CubicCurve2d)\n  for (let next = iter.next(); !next.done; next = iter.next()) {\n    acc = Interval2d.union(acc, CubicCurve2d.boundingBox(next.value))\n  }\n  return acc\n}\n","import type { Interval2d } from '../interval/interval2d'\nimport type { CubicCurve2d } from '../curve/cubic2d'\nimport type { Closed } from '../interval/interval'\nimport type { Pipeable } from '../utils'\nimport type { Vector2 } from '../vector/vector2'\nimport type { CubicPath2dTypeId } from './cubic2d.internal'\nimport * as internal from './cubic2d.internal'\nimport type { Continuous, PathTraits } from './traits'\n\nexport type { Continuous } from './traits'\n\n/**\n * A cubic path in 2D space.\n *\n * All fields are readonly and immutable, and all operations create new instances.\n *\n * The `Trait` type parameter accumulates trait brands as the path is refined\n * via `isContinuous` / `asContinuous`.\n *\n * @since 1.0.0\n */\nexport interface CubicPath2d<out Trait = unknown> extends Pipeable, Iterable<CubicCurve2d> {\n  readonly [CubicPath2dTypeId]: CubicPath2dTypeId\n  readonly [PathTraits]: Trait\n}\n\n/**\n * Creates a new `CubicPath2d` instance from a sequence of curves.\n *\n * @param curves - The curves to create the path from.\n * @returns A new `CubicPath2d` instance.\n * @since 2.0.0\n */\nexport const make: (...curves: ReadonlyArray<CubicCurve2d>) => CubicPath2d = internal.make\n\n/**\n * Creates a new `CubicPath2d` instance from an array of curves.\n *\n * @param curves - The curves to create the path from.\n * @returns A new `CubicPath2d` instance.\n * @since 2.0.0\n */\nexport const fromArray: (curves: ReadonlyArray<CubicCurve2d>) => CubicPath2d = internal.fromArray\n\n/**\n * Checks if a value is a `CubicPath2d`.\n *\n * @param p - The value to check.\n * @returns `true` if the value is a `CubicPath2d`, `false` otherwise.\n * @since 1.0.0\n */\nexport const isCubicPath2d: (p: unknown) => p is CubicPath2d = internal.isCubicPath2d\n\nexport const append: {\n  /**\n   * Appends a cubic curve to a cubic path.\n   *\n   * @param c - The cubic curve to append.\n   * @returns A function that takes a cubic path and returns a new cubic path.\n   * @since 1.0.0\n   */\n  (c: CubicCurve2d): (p: CubicPath2d) => CubicPath2d\n  /**\n   * Appends a cubic curve to a cubic path.\n   *\n   * @param p - The cubic path to append to.\n   * @param c - The cubic curve to append.\n   * @returns A new cubic path.\n   * @since 1.0.0\n   */\n  (p: CubicPath2d, c: CubicCurve2d): CubicPath2d\n} = internal.append\n\n/**\n * Calculates the length of a cubic path.\n *\n * @param p - The cubic path to calculate the length of.\n * @returns The length of the cubic path.\n * @since 1.0.0\n */\nexport const length: (p: CubicPath2d) => number = internal.length\n\nexport const solve: {\n  /**\n   * Solves a cubic path for a given parameter.\n   *\n   * @param u - The parameter to solve for.\n   * @returns A function that takes a cubic path and returns the solved vector.\n   * @since 1.0.0\n   */\n  (u: number): (p: CubicPath2d) => Vector2\n  /**\n   * Solves a cubic path for a given parameter.\n   *\n   * @param p - The cubic path to solve.\n   * @param u - The parameter to solve for.\n   * @returns The solved vector.\n   * @since 1.0.0\n   */\n  (p: CubicPath2d, u: number): Vector2\n} = internal.solve\n\n/**\n * Serializes a cubic path as an SVG path data string (the value of a `<path>`\n * element's `d` attribute), using `M` and `C` commands. Discontinuities between\n * curves emit a fresh `M` command.\n *\n * @param p - The cubic path to serialize.\n * @returns The SVG path data string.\n * @since 2.0.0\n */\nexport const toPathData: (p: CubicPath2d) => string = internal.toPathData\n\n/**\n * Type-narrowing predicate: refines `CubicPath2d<T>` to\n * `CubicPath2d<T & Continuous>` when adjacent curves connect.\n *\n * @since 2.0.0\n */\nexport const isContinuous: <T>(p: CubicPath2d<T>) => p is CubicPath2d<T & Continuous> =\n  internal.isContinuous\n\n/**\n * Asserts that the cubic path is continuous, throwing on failure.\n *\n * @since 2.0.0\n */\nexport const asContinuous: <T>(p: CubicPath2d<T>) => CubicPath2d<T & Continuous> =\n  internal.asContinuous\n\nexport const solveByDistance: {\n  /**\n   * Solves a cubic path by normalized arc length. Unlike {@link solve}, which\n   * is parameterized by curve `u`, this samples points at constant speed along\n   * the path — `s = 0.5` returns the point exactly halfway along the curve by\n   * arc length, regardless of how the underlying parameterization stretches.\n   *\n   * Cumulative segment lengths are cached by path identity so repeated calls\n   * with the same path are fast.\n   *\n   * @param p - The cubic path to sample.\n   * @param s - Normalized arc length in `[0, 1]`. Values outside the range are\n   *   clamped to path endpoints.\n   * @returns The point on the path at the given normalized arc length.\n   * @since 1.1.0\n   */\n  (p: CubicPath2d, s: number): Vector2\n  /**\n   * Solves a cubic path by normalized arc length.\n   *\n   * @param s - Normalized arc length in `[0, 1]`.\n   * @returns A function that takes a cubic path and returns the point at that\n   *   arc length.\n   * @since 1.1.0\n   */\n  (s: number): (p: CubicPath2d) => Vector2\n} = internal.solveByDistance\n\n/**\n * Computes the axis-aligned bounding box of the path — the smallest closed\n * `Box2d` enclosing every segment.\n *\n * @param p - The cubic path.\n * @returns A closed `Box2d` enclosing the path.\n * @since 2.1.0\n */\nexport const boundingBox: (p: CubicPath2d) => Interval2d<Closed, Closed> = internal.boundingBox\n","import type * as CubicCurve2d from '../curve/cubic2d'\nimport * as RationalCubicCurve2d from '../curve/rationalCubic2d'\nimport { dual, Pipeable } from '../utils'\nimport { invariant } from '../utils'\nimport type * as Vector2 from '../vector/vector2'\nimport * as CubicPath2d from './cubic2d'\nimport type { RationalCubicPath2d } from './rationalCubic2d'\n\nexport const RationalCubicPath2dTypeId: unique symbol = Symbol('curvy/path/rationalCubic2d')\nexport type RationalCubicPath2dTypeId = typeof RationalCubicPath2dTypeId\n\nexport class RationalCubicPath2dImpl extends Pipeable implements RationalCubicPath2d {\n  readonly [RationalCubicPath2dTypeId]: RationalCubicPath2dTypeId = RationalCubicPath2dTypeId\n\n  readonly curves: ReadonlyArray<RationalCubicCurve2d.RationalCubicCurve2d>\n\n  constructor(curves: ReadonlyArray<RationalCubicCurve2d.RationalCubicCurve2d>) {\n    invariant(curves.length > 0, 'rational cubic path requires at least one curve')\n    super()\n    this.curves = curves\n  }\n\n  [Symbol.iterator](): Iterator<RationalCubicCurve2d.RationalCubicCurve2d> {\n    return this.curves[Symbol.iterator]()\n  }\n}\n\nexport const isRationalCubicPath2d = (p: unknown): p is RationalCubicPath2d =>\n  typeof p === 'object' && p !== null && RationalCubicPath2dTypeId in p\n\nexport const make = (\n  ...curves: ReadonlyArray<RationalCubicCurve2d.RationalCubicCurve2d>\n): RationalCubicPath2d => new RationalCubicPath2dImpl(curves)\n\nexport const fromArray = (\n  curves: ReadonlyArray<RationalCubicCurve2d.RationalCubicCurve2d>,\n): RationalCubicPath2d => new RationalCubicPath2dImpl(curves)\n\nexport const append = dual<\n  (c: RationalCubicCurve2d.RationalCubicCurve2d) => (p: RationalCubicPath2d) => RationalCubicPath2d,\n  (p: RationalCubicPath2d, c: RationalCubicCurve2d.RationalCubicCurve2d) => RationalCubicPath2d\n>(2, (p, c) => fromArray([...p, c]))\n\nexport const solve = dual<\n  (u: number) => (p: RationalCubicPath2d) => Vector2.Vector2,\n  (p: RationalCubicPath2d, u: number) => Vector2.Vector2\n>(2, (p: RationalCubicPath2d, u: number) => {\n  const curves = p instanceof RationalCubicPath2dImpl ? p.curves : [...p]\n\n  if (u === 1) {\n    const last = curves.at(-1) as RationalCubicCurve2d.RationalCubicCurve2d\n    return RationalCubicCurve2d.solve(last, 1)\n  }\n\n  const t = u * curves.length\n  const i = Math.floor(t)\n  const curve = curves[i] as RationalCubicCurve2d.RationalCubicCurve2d\n  return RationalCubicCurve2d.solve(curve, t - i)\n})\n\n// Path-level approximation: per-segment approximation is delegated to the\n// curve module; we just concat the results. Segment count grows from N\n// (input) to roughly N × k where k depends on weight magnitude and tolerance —\n// uniform-weight segments stay 1:1.\nexport const approximateAsCubicPath = dual<\n  (tolerance: number) => (p: RationalCubicPath2d) => CubicPath2d.CubicPath2d,\n  (p: RationalCubicPath2d, tolerance: number) => CubicPath2d.CubicPath2d\n>(2, (p: RationalCubicPath2d, tolerance: number) => {\n  const curves: Array<CubicCurve2d.CubicCurve2d> = []\n  for (const segment of p) {\n    for (const approx of RationalCubicCurve2d.approximateAsCubicCurves(segment, tolerance)) {\n      curves.push(approx)\n    }\n  }\n  return CubicPath2d.fromArray(curves)\n})\n","import type { RationalCubicCurve2d } from '../curve/rationalCubic2d'\nimport type { Pipeable } from '../utils'\nimport type { Vector2 } from '../vector/vector2'\nimport type { CubicPath2d } from './cubic2d'\nimport type { RationalCubicPath2dTypeId } from './rationalCubic2d.internal'\nimport * as internal from './rationalCubic2d.internal'\n\n/**\n * A rational cubic path in 2D space.\n *\n * Holds a non-empty sequence of `RationalCubicCurve2d` segments; iteration\n * yields the segments in order. The path parameter `u ∈ [0, 1]` is mapped\n * uniformly across segments — `u = 0` is the start of the first segment,\n * `u = 1` is the end of the last segment, and intermediate values pick a\n * segment by index and a local parameter within it.\n *\n * Counterpart to `CubicPath2d` for curves whose evaluation includes the\n * homogeneous-to-plane projection.\n *\n * All fields are readonly and immutable, and all operations create new instances.\n *\n * @since 2.1.0\n */\nexport interface RationalCubicPath2d extends Pipeable, Iterable<RationalCubicCurve2d> {\n  readonly [RationalCubicPath2dTypeId]: RationalCubicPath2dTypeId\n}\n\n/**\n * Checks if a value is a `RationalCubicPath2d`.\n *\n * @param p - The value to check.\n * @returns `true` if the value is a `RationalCubicPath2d`, `false` otherwise.\n * @since 2.1.0\n */\nexport const isRationalCubicPath2d: (p: unknown) => p is RationalCubicPath2d =\n  internal.isRationalCubicPath2d\n\n/**\n * Creates a new `RationalCubicPath2d` from a sequence of curves.\n *\n * @param curves - The curves to create the path from.\n * @returns A new `RationalCubicPath2d` instance.\n * @since 2.1.0\n */\nexport const make: (...curves: ReadonlyArray<RationalCubicCurve2d>) => RationalCubicPath2d =\n  internal.make\n\n/**\n * Creates a new `RationalCubicPath2d` from an array of curves.\n *\n * @param curves - The curves to create the path from.\n * @returns A new `RationalCubicPath2d` instance.\n * @since 2.1.0\n */\nexport const fromArray: (curves: ReadonlyArray<RationalCubicCurve2d>) => RationalCubicPath2d =\n  internal.fromArray\n\nexport const append: {\n  /**\n   * Appends a curve to a `RationalCubicPath2d`.\n   *\n   * @param c - The curve to append.\n   * @returns A function that takes a path and returns a new path with the appended curve.\n   * @since 2.1.0\n   */\n  (c: RationalCubicCurve2d): (p: RationalCubicPath2d) => RationalCubicPath2d\n  /**\n   * Appends a curve to a `RationalCubicPath2d`.\n   *\n   * @param p - The path to append to.\n   * @param c - The curve to append.\n   * @returns A new path with the appended curve.\n   * @since 2.1.0\n   */\n  (p: RationalCubicPath2d, c: RationalCubicCurve2d): RationalCubicPath2d\n} = internal.append\n\nexport const solve: {\n  /**\n   * Evaluates the rational cubic path at parameter `u ∈ [0, 1]`.\n   *\n   * Picks the segment containing `u` (uniform mapping across segments) and\n   * delegates to `RationalCubicCurve2d.solve` on that segment with the local\n   * parameter.\n   *\n   * @param p - The path to evaluate.\n   * @param u - The path parameter in `[0, 1]`.\n   * @returns The point on the path at parameter `u`.\n   * @since 2.1.0\n   */\n  (p: RationalCubicPath2d, u: number): Vector2\n  /**\n   * Evaluates the rational cubic path at parameter `u ∈ [0, 1]`.\n   *\n   * @param u - The path parameter in `[0, 1]`.\n   * @returns A function that takes a path and returns the point at `u`.\n   * @since 2.1.0\n   */\n  (u: number): (p: RationalCubicPath2d) => Vector2\n} = internal.solve\n\nexport const approximateAsCubicPath: {\n  /**\n   * Approximates the rational cubic path as a `CubicPath2d` via per-segment\n   * recursive subdivision. Each input segment is split until its midpoint\n   * deviates from a polynomial-cubic candidate by at most `tolerance`; the\n   * surviving candidates are concatenated into a new path.\n   *\n   * Lossy in general — only exact when every input segment has uniform\n   * weights, in which case segment count is preserved. Tighter tolerance\n   * produces more segments.\n   *\n   * @param p - The rational cubic path to approximate.\n   * @param tolerance - Maximum allowed midpoint deviation per segment; must be positive.\n   * @returns A new `CubicPath2d` approximating the input.\n   * @since 2.1.0\n   */\n  (p: RationalCubicPath2d, tolerance: number): CubicPath2d\n  /**\n   * Approximates the rational cubic path as a `CubicPath2d`.\n   *\n   * @param tolerance - Maximum allowed midpoint deviation per segment; must be positive.\n   * @returns A function that takes a rational path and returns its approximation.\n   * @since 2.1.0\n   */\n  (tolerance: number): (p: RationalCubicPath2d) => CubicPath2d\n} = internal.approximateAsCubicPath\n"],"mappings":";;;;;;;;AAYA,MAAa,oBAAmC,OAAO,qBAAqB;AAG5E,IAAa,kBAAb,cAAqC,SAAyC;CAC5E,CAAU,qBAAwC;CAGlD;CAEA,YAAY,QAAkD;EAC5D,UAAU,OAAO,SAAS,GAAG,yCAAyC;EACtE,OAAO;EACP,KAAK,SAAS;;CAGhB,CAAC,OAAO,YAAiD;EACvD,OAAO,KAAK,OAAO,OAAO,WAAW;;;AAIzC,MAAaA,mBAAiB,MAC5B,OAAO,MAAM,YAAY,MAAM,QAAQ,qBAAqB;AAE9D,MAAaC,UAAQ,GAAG,WACtB,IAAI,gBAAgB,OAAO;AAE7B,MAAaC,eAAa,WACxB,IAAI,gBAAgB,OAAO;AAE7B,MAAaC,WAAS,KAGpB,IAAI,GAAgB,MAAiCD,YAAU,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC;AAE5E,MAAaE,YAAU,MAAmB;CACxC,IAAI,QAAQ;CACZ,KAAK,MAAM,SAAS,GAClB,SAASC,SAAoB,OAAOC,KAAc;CAGpD,OAAO;;AAGT,MAAaC,UAAQ,KAGnB,IAAI,GAAgB,MAAc;CAClC,MAAM,SAAS,aAAa,kBAAkB,EAAE,SAAS,CAAC,GAAG,EAAE;CAE/D,IAAI,MAAM,GAER,OAAOC,QADM,OAAO,GAAG,GACG,EAAM,EAAE;CAGpC,MAAM,IAAI,IAAI,OAAO;CACrB,MAAM,IAAI,KAAK,MAAM,EAAE;CACvB,MAAM,QAAQ,OAAO;CACrB,OAAOA,QAAmB,OAAO,IAAI,EAAE;EACvC;AAIF,MAAM,wCAAwB,IAAI,SAA6C;AAE/E,MAAM,wBAAwB,MAA0C;CACtE,IAAI,SAAS,sBAAsB,IAAI,EAAE;CACzC,IAAI,WAAW,KAAA,GAAW;EACxB,MAAM,UAAyB,EAAE;EACjC,IAAI,QAAQ;EACZ,KAAK,MAAM,SAAS,GAAG;GACrB,SAASH,SAAoB,OAAOC,KAAc;GAClD,QAAQ,KAAK,MAAM;;EAErB,SAAS;EACT,sBAAsB,IAAI,GAAG,OAAO;;CAEtC,OAAO;;AAOT,MAAM,wBACJ,OACA,QACA,kBACW;CACX,IAAI,UAAU,GACZ,OAAO;CAET,IAAI,UAAU,eACZ,OAAO;CAGT,MAAMG,eAAaC,WAA8B,MAAM;CAEvD,IAAI,IAAI,SAAS;CACjB,IAAI,KAAK;CACT,IAAI,KAAK;CAET,KAAK,IAAI,OAAO,GAAG,OAAO,IAAI,QAAQ;EAEpC,MAAM,QADgBL,SAAoB,OAAOM,OAAc,GAAG,EAAE,CACzC,GAAG;EAE9B,IAAI,KAAK,IAAI,MAAM,GAAG,OACpB,OAAO;EAGT,IAAI,QAAQ,GACV,KAAK;OAEL,KAAK;EAGP,MAAM,QAAQC,UAAkBC,QAAuBJ,cAAY,EAAE,CAAC;EACtE,IAAI,UAAU,GAAG;GAEf,KAAK,KAAK,MAAM;GAChB;;EAGF,MAAM,OAAO,IAAI,QAAQ;EAEzB,IAAI,OAAO,MAAM,OAAO,KAAK,QAAQ,KAAK,MAAM;;CAGlD,OAAO;;AAMT,MAAaK,gBAAc,MAA2B;CACpD,IAAI,SAAS;CACb,IAAI,WAAW;CACf,IAAI,WAAW;CAEf,KAAK,MAAM,SAAS,GAAG;EACrB,MAAM,MAAM,MAAM,EAAE;EACpB,MAAM,MAAM,MAAM,EAAE;EACpB,MAAM,MAAM,MAAM,EAAE;EACpB,MAAM,MAAM,MAAM,EAAE;EACpB,MAAM,MAAM,MAAM,EAAE;EACpB,MAAM,MAAM,MAAM,EAAE;EACpB,MAAM,MAAM,MAAM,EAAE;EACpB,MAAM,MAAM,MAAM,EAAE;EAEpB,MAAM,SAAS;EACf,MAAM,SAAS;EACf,MAAM,SAAS,MAAM,MAAM;EAC3B,MAAM,SAAS,MAAM,MAAM;EAC3B,MAAM,SAAS,MAAO,IAAI,MAAO,IAAI,MAAM;EAC3C,MAAM,SAAS,MAAO,IAAI,MAAO,IAAI,MAAM;EAC3C,MAAM,OAAO,MAAM,MAAM,MAAM;EAC/B,MAAM,OAAO,MAAM,MAAM,MAAM;EAE/B,IAAI,CAAC,UAAU,QAAQ,SAAS,IAAI,CAAC,UAAU,QAAQ,SAAS,EAC9D,UAAU,MAAM,OAAO,GAAG;EAE5B,UAAU,MAAM,OAAO,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO,GAAG,KAAK,GAAG;EAEhE,WAAW;EACX,WAAW;;CAGb,OAAO,OAAO,MAAM,EAAE;;AAGxB,MAAaC,kBAAmB,MAAwD;CACtF,IAAI,WAAW;CACf,IAAI,WAAW;CACf,IAAI,QAAQ;CAEZ,KAAK,MAAM,SAAS,GAAG;EACrB,MAAM,SAAS,MAAM,EAAE;EACvB,MAAM,SAAS,MAAM,EAAE;EACvB,IAAI,CAAC,UAAU,CAAC,UAAU,QAAQ,SAAS,IAAI,CAAC,UAAU,QAAQ,SAAS,GACzE,OAAO;EAET,WAAW,MAAM,EAAE,KAAK,MAAM,EAAE,KAAK,MAAM,EAAE,KAAK,MAAM,EAAE;EAC1D,WAAW,MAAM,EAAE,KAAK,MAAM,EAAE,KAAK,MAAM,EAAE,KAAK,MAAM,EAAE;EAC1D,QAAQ;;CAEV,OAAO;;AAGT,MAAaC,kBAAmB,MAAmD;CACjF,UAAUD,eAAa,EAAE,EAAE,+BAA+B;CAC1D,OAAO;;AAGT,MAAaE,oBAAkB,KAG7B,IAAI,GAAgB,MAAc;CAClC,IAAI,KAAK,GACP,OAAOV,QAAM,GAAG,EAAE;CAEpB,IAAI,KAAK,GACP,OAAOA,QAAM,GAAG,EAAE;CAGpB,MAAM,UAAU,qBAAqB,EAAE;CAEvC,MAAM,SAAS,IADD,QAAQ,QAAQ,SAAS;CAIvC,IAAI,IAAI;CACR,OAAO,IAAI,QAAQ,SAAS,KAAM,QAAQ,KAAgB,QACxD;CAGF,MAAM,eAAe,MAAM,IAAI,IAAK,QAAQ,IAAI;CAEhD,MAAM,gBADa,QAAQ,KACQ;CACnC,MAAM,gBAAgB,SAAS;CAG/B,MAAM,SADS,aAAa,kBAAkB,EAAE,SAAS,CAAC,GAAG,EAAE,EAC1C;CAGrB,OAAOC,QAAmB,OAFX,qBAAqB,OAAO,eAAe,cAEzB,CAAO;EACxC;AAEF,MAAaU,iBACX,MAC4D;CAC5D,MAAM,OAAO,EAAE,OAAO,WAAW;CAEjC,IAAI,MAAMC,cADI,KAAK,MACgB,CAAM,MAAmC;CAC5E,KAAK,IAAI,OAAO,KAAK,MAAM,EAAE,CAAC,KAAK,MAAM,OAAO,KAAK,MAAM,EACzD,MAAMC,MAAiB,KAAKD,cAAyB,KAAK,MAAM,CAAC;CAEnE,OAAO;;;;;;;;;;;;;;;;;;;;;;;;ACrNT,MAAaE,SAAgEC;;;;;;;;AAS7E,MAAaC,cAAkEC;;;;;;;;AAS/E,MAAa,gBAAkDC;AAE/D,MAAaC,WAkBTC;;;;;;;;AASJ,MAAa,SAAqCC;AAElD,MAAaC,UAkBTC;;;;;;;;;;AAWJ,MAAa,aAAyCC;;;;;;;AAQtD,MAAa,eACXC;;;;;;AAOF,MAAa,eACXC;AAEF,MAAa,kBA0BTC;;;;;;;;;AAUJ,MAAa,cAA8DC;;;AC9J3E,MAAa,4BAA2C,OAAO,6BAA6B;AAG5F,IAAa,0BAAb,cAA6C,SAAwC;CACnF,CAAU,6BAAwD;CAElE;CAEA,YAAY,QAAkE;EAC5E,UAAU,OAAO,SAAS,GAAG,kDAAkD;EAC/E,OAAO;EACP,KAAK,SAAS;;CAGhB,CAAC,OAAO,YAAiE;EACvE,OAAO,KAAK,OAAO,OAAO,WAAW;;;AAIzC,MAAaC,2BAAyB,MACpC,OAAO,MAAM,YAAY,MAAM,QAAQ,6BAA6B;AAEtE,MAAaC,UACX,GAAG,WACqB,IAAI,wBAAwB,OAAO;AAE7D,MAAaC,eACX,WACwB,IAAI,wBAAwB,OAAO;AAE7D,MAAaC,WAAS,KAGpB,IAAI,GAAG,MAAMD,YAAU,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC;AAEpC,MAAaE,UAAQ,KAGnB,IAAI,GAAwB,MAAc;CAC1C,MAAM,SAAS,aAAa,0BAA0B,EAAE,SAAS,CAAC,GAAG,EAAE;CAEvE,IAAI,MAAM,GAER,OAAOC,QADM,OAAO,GAAG,GACW,EAAM,EAAE;CAG5C,MAAM,IAAI,IAAI,OAAO;CACrB,MAAM,IAAI,KAAK,MAAM,EAAE;CACvB,MAAM,QAAQ,OAAO;CACrB,OAAOA,QAA2B,OAAO,IAAI,EAAE;EAC/C;AAMF,MAAaC,2BAAyB,KAGpC,IAAI,GAAwB,cAAsB;CAClD,MAAM,SAA2C,EAAE;CACnD,KAAK,MAAM,WAAW,GACpB,KAAK,MAAM,UAAUC,yBAA8C,SAAS,UAAU,EACpF,OAAO,KAAK,OAAO;CAGvB,OAAOC,YAAsB,OAAO;EACpC;;;;;;;;;;;;;;;;;;ACzCF,MAAa,wBACXC;;;;;;;;AASF,MAAa,OACXC;;;;;;;;AASF,MAAa,YACXC;AAEF,MAAa,SAkBTC;AAEJ,MAAa,QAsBTC;AAEJ,MAAa,yBAyBTC"}