curvy 1.0.9 → 2.0.0-alpha.2

package/dist/path/index.d.mts

@@ -0,0 +1,261 @@
+import { t as Vector2 } from "../shared/vector2-DPUY3_eA.mjs";
+import { t as Pipeable } from "../shared/utils-MCckigYk.mjs";
+import { n as Closed } from "../shared/interval-Dy-RMEE3.mjs";
+import { t as Interval2d } from "../shared/interval2d-C2id9u31.mjs";
+import { a as QuadraticCurve2d, s as LinearCurve2d } from "../shared/rationalCubic2d-DlQfBURs.mjs";
+import { a as Continuous, i as cubic2d_d_exports, n as rationalCubic2d_d_exports, o as PathTraits } from "../shared/rationalCubic2d-B6g97ryJ.mjs";
+
+//#region src/path/linear2d.internal.d.ts
+declare const LinearPath2dTypeId: unique symbol;
+type LinearPath2dTypeId = typeof LinearPath2dTypeId;
+declare namespace linear2d_d_exports {
+  export { Continuous, LinearPath2d, append$1 as append, asContinuous$1 as asContinuous, boundingBox$1 as boundingBox, fromArray$1 as fromArray, isContinuous$1 as isContinuous, isLinearPath2d, length$1 as length, make$1 as make, solve$1 as solve, toPathData$1 as toPathData };
+}
+/**
+ * A linear 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`. A `Continuous` path's `toPathData`
+ * skips the per-segment discontinuity check.
+ *
+ * @since 1.0.0
+ */
+interface LinearPath2d<out Trait = unknown> extends Pipeable, Iterable<LinearCurve2d> {
+  readonly [LinearPath2dTypeId]: LinearPath2dTypeId;
+  readonly [PathTraits]: Trait;
+}
+/**
+ * Creates a new `LinearPath2d` instance from a sequence of curves.
+ *
+ * @param curves - The curves to create the path from.
+ * @returns A new `LinearPath2d` instance.
+ * @since 2.0.0
+ */
+declare const make$1: (...curves: ReadonlyArray<LinearCurve2d>) => LinearPath2d;
+/**
+ * Creates a new `LinearPath2d` instance from an array of curves.
+ *
+ * @param curves - The curves to create the path from.
+ * @returns A new `LinearPath2d` instance.
+ * @since 2.0.0
+ */
+declare const fromArray$1: (curves: ReadonlyArray<LinearCurve2d>) => LinearPath2d;
+/**
+ * Checks if a value is a `LinearPath2d`.
+ *
+ * @param p - The value to check.
+ * @returns `true` if the value is a `LinearPath2d`, `false` otherwise.
+ * @since 1.0.0
+ */
+declare const isLinearPath2d: (p: unknown) => p is LinearPath2d;
+declare const append$1: {
+  /**
+   * Appends a linear curve to a linear path.
+   *
+   * @param c - The linear curve to append.
+   * @returns A function that takes a linear path and returns a new linear path.
+   * @since 1.0.0
+   */
+  (c: LinearCurve2d): (p: LinearPath2d) => LinearPath2d;
+  /**
+   * Appends a linear curve to a linear path.
+   *
+   * @param p - The linear path to append to.
+   * @param c - The linear curve to append.
+   * @returns A new `LinearPath2d` instance with the appended curve.
+   * @since 1.0.0
+   */
+  (p: LinearPath2d, c: LinearCurve2d): LinearPath2d;
+};
+/**
+ * Calculates the length of a linear path.
+ *
+ * @param p - The linear path to calculate the length of.
+ * @returns The length of the linear path.
+ * @since 1.0.0
+ */
+declare const length$1: (p: LinearPath2d) => number;
+declare const solve$1: {
+  /**
+   * Solves a linear path for a given parameter.
+   *
+   * @param u - The parameter to solve for.
+   * @returns A function that takes a linear path and returns the solved point.
+   * @since 1.0.0
+   */
+  (u: number): (p: LinearPath2d) => Vector2;
+  /**
+   * Solves a linear path for a given parameter.
+   *
+   * @param p - The linear path to solve.
+   * @param u - The parameter to solve for.
+   * @returns The solved point on the linear path.
+   * @since 1.0.0
+   */
+  (p: LinearPath2d, u: number): Vector2;
+};
+/**
+ * Serializes a linear path as an SVG path data string (the value of a `<path>`
+ * element's `d` attribute), using `M` and `L` commands. Discontinuities between
+ * curves emit a fresh `M` command.
+ *
+ * @param p - The linear path to serialize.
+ * @returns The SVG path data string.
+ * @since 2.0.0
+ */
+declare const toPathData$1: (p: LinearPath2d) => string;
+/**
+ * Type-narrowing predicate: refines `LinearPath2d<T>` to
+ * `LinearPath2d<T & Continuous>` when adjacent curves connect at their join
+ * points.
+ *
+ * @param p - The linear path to check.
+ * @returns `true` when the path is continuous (G⁰).
+ * @since 2.0.0
+ */
+declare const isContinuous$1: <T>(p: LinearPath2d<T>) => p is LinearPath2d<T & Continuous>;
+/**
+ * Asserts that the linear path is continuous, throwing on failure.
+ *
+ * @param p - The linear path to assert against.
+ * @returns The same path, typed with the `Continuous` brand.
+ * @throws When the path has a discontinuity between adjacent curves.
+ * @since 2.0.0
+ */
+declare const asContinuous$1: <T>(p: LinearPath2d<T>) => LinearPath2d<T & Continuous>;
+/**
+ * Computes the axis-aligned bounding box of the path — the smallest closed
+ * `Box2d` enclosing every segment.
+ *
+ * @param p - The linear path.
+ * @returns A closed `Box2d` enclosing the path.
+ * @since 2.1.0
+ */
+declare const boundingBox$1: (p: LinearPath2d) => Interval2d<Closed, Closed>;
+//#endregion
+//#region src/path/quadratic2d.internal.d.ts
+declare const QuadraticPath2dTypeId: unique symbol;
+type QuadraticPath2dTypeId = typeof QuadraticPath2dTypeId;
+declare namespace quadratic2d_d_exports {
+  export { Continuous, QuadraticPath2d, append, asContinuous, boundingBox, fromArray, isContinuous, isQuadraticPath2d, length, make, solve, toPathData };
+}
+/**
+ * A quadratic 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 QuadraticPath2d<out Trait = unknown> extends Pipeable, Iterable<QuadraticCurve2d> {
+  readonly [QuadraticPath2dTypeId]: QuadraticPath2dTypeId;
+  readonly [PathTraits]: Trait;
+}
+/**
+ * Creates a new `QuadraticPath2d` instance from a sequence of curves.
+ *
+ * @param curves - The curves to create the path from.
+ * @returns A new `QuadraticPath2d` instance.
+ * @since 2.0.0
+ */
+declare const make: (...curves: ReadonlyArray<QuadraticCurve2d>) => QuadraticPath2d;
+/**
+ * Creates a new `QuadraticPath2d` instance from an array of curves.
+ *
+ * @param curves - The curves to create the path from.
+ * @returns A new `QuadraticPath2d` instance.
+ * @since 2.0.0
+ */
+declare const fromArray: (curves: ReadonlyArray<QuadraticCurve2d>) => QuadraticPath2d;
+/**
+ * Checks if a value is a `QuadraticPath2d`.
+ *
+ * @param p - The value to check.
+ * @returns `true` if the value is a `QuadraticPath2d`, `false` otherwise.
+ * @since 1.0.0
+ */
+declare const isQuadraticPath2d: (p: unknown) => p is QuadraticPath2d;
+declare const append: {
+  /**
+   * Appends a quadratic curve to a quadratic path.
+   *
+   * @param c - The quadratic curve to append.
+   * @returns A function that takes a quadratic path and returns a new quadratic path.
+   * @since 1.0.0
+   */
+  (c: QuadraticCurve2d): (p: QuadraticPath2d) => QuadraticPath2d;
+  /**
+   * Appends a quadratic curve to a quadratic path.
+   *
+   * @param p - The quadratic path to append to.
+   * @param c - The quadratic curve to append.
+   * @returns A new `QuadraticPath2d` instance with the appended curve.
+   * @since 1.0.0
+   */
+  (p: QuadraticPath2d, c: QuadraticCurve2d): QuadraticPath2d;
+};
+/**
+ * Calculates the length of a quadratic path.
+ *
+ * @param p - The quadratic path to calculate the length of.
+ * @returns The length of the path.
+ */
+declare const length: (p: QuadraticPath2d) => number;
+declare const solve: {
+  /**
+   * Solves a quadratic path at a given parameter.
+   *
+   * @param u - The parameter to solve for.
+   * @returns A function that takes a quadratic path and returns the solved point.
+   * @since 1.0.0
+   */
+  (u: number): (p: QuadraticPath2d) => Vector2;
+  /**
+   * Solves a quadratic path at a given parameter.
+   *
+   * @param p - The quadratic path to solve.
+   * @param u - The parameter to solve for.
+   * @returns The solved point.
+   * @since 1.0.0
+   */
+  (p: QuadraticPath2d, u: number): Vector2;
+};
+/**
+ * Serializes a quadratic path as an SVG path data string (the value of a
+ * `<path>` element's `d` attribute), using `M` and `Q` commands. Discontinuities
+ * between curves emit a fresh `M` command.
+ *
+ * @param p - The quadratic path to serialize.
+ * @returns The SVG path data string.
+ * @since 2.0.0
+ */
+declare const toPathData: (p: QuadraticPath2d) => string;
+/**
+ * Type-narrowing predicate: refines `QuadraticPath2d<T>` to
+ * `QuadraticPath2d<T & Continuous>` when adjacent curves connect.
+ *
+ * @since 2.0.0
+ */
+declare const isContinuous: <T>(p: QuadraticPath2d<T>) => p is QuadraticPath2d<T & Continuous>;
+/**
+ * Asserts that the quadratic path is continuous, throwing on failure.
+ *
+ * @since 2.0.0
+ */
+declare const asContinuous: <T>(p: QuadraticPath2d<T>) => QuadraticPath2d<T & Continuous>;
+/**
+ * Computes the axis-aligned bounding box of the path — the smallest closed
+ * `Box2d` enclosing every segment.
+ *
+ * @param p - The quadratic path.
+ * @returns A closed `Box2d` enclosing the path.
+ * @since 2.1.0
+ */
+declare const boundingBox: (p: QuadraticPath2d) => Interval2d<Closed, Closed>;
+//#endregion
+export { cubic2d_d_exports as CubicPath2d, linear2d_d_exports as LinearPath2d, quadratic2d_d_exports as QuadraticPath2d, rationalCubic2d_d_exports as RationalCubicPath2d };
+//# sourceMappingURL=index.d.mts.map

package/dist/path/index.mjs

@@ -0,0 +1,325 @@
+import { t as __exportAll } from "../shared/chunk-25Hzd3z8.mjs";
+import { Pipeable, dual, invariant } from "../utils.mjs";
+import { epsEquals } from "../number.mjs";
+import { p as unit } from "../shared/interval-05CR6eBf.mjs";
+import { r as union } from "../shared/interval2d-8IBZnUOq.mjs";
+import { d as boundingBox$5, f as length$5, g as length$4, h as boundingBox$4, m as solve$5, v as solve$4 } from "../shared/rationalCubic2d-Bys2Uory.mjs";
+import { n as rationalCubic2d_exports, r as cubic2d_exports } from "../shared/rationalCubic2d-BEgUGSFf.mjs";
+//#region src/path/linear2d.internal.ts
+const LinearPath2dTypeId = Symbol("curvy/path/linear2d");
+var LinearPath2dImpl = class extends Pipeable {
+	[LinearPath2dTypeId] = LinearPath2dTypeId;
+	curves;
+	constructor(curves) {
+		super();
+		this.curves = curves;
+	}
+	[Symbol.iterator]() {
+		return this.curves[Symbol.iterator]();
+	}
+};
+const isLinearPath2d$1 = (p) => typeof p === "object" && p !== null && LinearPath2dTypeId in p;
+const make$3 = (...curves) => new LinearPath2dImpl(curves);
+const fromArray$3 = (curves) => new LinearPath2dImpl(curves);
+const append$3 = dual(2, (p, c) => fromArray$3([...p, c]));
+const length$3 = (p) => {
+	let total = 0;
+	for (const curve of p) total += length$4(curve, unit);
+	return total;
+};
+const solve$3 = dual(2, (p, u) => {
+	const curves = p instanceof LinearPath2dImpl ? 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 toPathData$3 = (p) => {
+	let result = "";
+	let prevEndX = NaN;
+	let prevEndY = NaN;
+	for (const curve of p) {
+		const startX = curve.x.c0;
+		const startY = curve.y.c0;
+		const endX = curve.x.c0 + curve.x.c1;
+		const endY = curve.y.c0 + curve.y.c1;
+		if (!epsEquals(startX, prevEndX) || !epsEquals(startY, prevEndY)) result += ` M ${startX},${startY}`;
+		result += ` L ${endX},${endY}`;
+		prevEndX = endX;
+		prevEndY = endY;
+	}
+	return result.slice(1);
+};
+const isContinuous$3 = (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;
+		prevEndY = curve.y.c0 + curve.y.c1;
+		first = false;
+	}
+	return true;
+};
+const asContinuous$3 = (p) => {
+	invariant(isContinuous$3(p), "linear path is not continuous");
+	return p;
+};
+const boundingBox$3 = (p) => {
+	const iter = p[Symbol.iterator]();
+	let acc = boundingBox$4(iter.next().value);
+	for (let next = iter.next(); !next.done; next = iter.next()) acc = union(acc, boundingBox$4(next.value));
+	return acc;
+};
+//#endregion
+//#region src/path/linear2d.ts
+var linear2d_exports = /* @__PURE__ */ __exportAll({
+	append: () => append$2,
+	asContinuous: () => asContinuous$2,
+	boundingBox: () => boundingBox$2,
+	fromArray: () => fromArray$2,
+	isContinuous: () => isContinuous$2,
+	isLinearPath2d: () => isLinearPath2d,
+	length: () => length$2,
+	make: () => make$2,
+	solve: () => solve$2,
+	toPathData: () => toPathData$2
+});
+/**
+* Creates a new `LinearPath2d` instance from a sequence of curves.
+*
+* @param curves - The curves to create the path from.
+* @returns A new `LinearPath2d` instance.
+* @since 2.0.0
+*/
+const make$2 = make$3;
+/**
+* Creates a new `LinearPath2d` instance from an array of curves.
+*
+* @param curves - The curves to create the path from.
+* @returns A new `LinearPath2d` instance.
+* @since 2.0.0
+*/
+const fromArray$2 = fromArray$3;
+/**
+* Checks if a value is a `LinearPath2d`.
+*
+* @param p - The value to check.
+* @returns `true` if the value is a `LinearPath2d`, `false` otherwise.
+* @since 1.0.0
+*/
+const isLinearPath2d = isLinearPath2d$1;
+const append$2 = append$3;
+/**
+* Calculates the length of a linear path.
+*
+* @param p - The linear path to calculate the length of.
+* @returns The length of the linear path.
+* @since 1.0.0
+*/
+const length$2 = length$3;
+const solve$2 = solve$3;
+/**
+* Serializes a linear path as an SVG path data string (the value of a `<path>`
+* element's `d` attribute), using `M` and `L` commands. Discontinuities between
+* curves emit a fresh `M` command.
+*
+* @param p - The linear path to serialize.
+* @returns The SVG path data string.
+* @since 2.0.0
+*/
+const toPathData$2 = toPathData$3;
+/**
+* Type-narrowing predicate: refines `LinearPath2d<T>` to
+* `LinearPath2d<T & Continuous>` when adjacent curves connect at their join
+* points.
+*
+* @param p - The linear path to check.
+* @returns `true` when the path is continuous (G⁰).
+* @since 2.0.0
+*/
+const isContinuous$2 = isContinuous$3;
+/**
+* Asserts that the linear path is continuous, throwing on failure.
+*
+* @param p - The linear path to assert against.
+* @returns The same path, typed with the `Continuous` brand.
+* @throws When the path has a discontinuity between adjacent curves.
+* @since 2.0.0
+*/
+const asContinuous$2 = asContinuous$3;
+/**
+* Computes the axis-aligned bounding box of the path — the smallest closed
+* `Box2d` enclosing every segment.
+*
+* @param p - The linear path.
+* @returns A closed `Box2d` enclosing the path.
+* @since 2.1.0
+*/
+const boundingBox$2 = boundingBox$3;
+//#endregion
+//#region src/path/quadratic2d.internal.ts
+const QuadraticPath2dTypeId = Symbol("curvy/path/quadratic2d");
+var QuadraticPath2dImpl = class extends Pipeable {
+	[QuadraticPath2dTypeId] = QuadraticPath2dTypeId;
+	curves;
+	constructor(curves) {
+		super();
+		this.curves = curves;
+	}
+	[Symbol.iterator]() {
+		return this.curves[Symbol.iterator]();
+	}
+};
+const isQuadraticPath2d$1 = (p) => typeof p === "object" && p !== null && QuadraticPath2dTypeId in p;
+const make$1 = (...curves) => new QuadraticPath2dImpl(curves);
+const fromArray$1 = (curves) => new QuadraticPath2dImpl(curves);
+const append$1 = dual(2, (p, c) => fromArray$1([...p, c]));
+const length$1 = (p) => {
+	let total = 0;
+	for (const curve of p) total += length$5(curve, unit);
+	return total;
+};
+const solve$1 = dual(2, (p, u) => {
+	const curves = p instanceof QuadraticPath2dImpl ? p.curves : [...p];
+	if (u === 1) return solve$5(curves.at(-1), 1);
+	const t = u * curves.length;
+	const i = Math.floor(t);
+	const curve = curves[i];
+	return solve$5(curve, t - i);
+});
+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 startX = c0x;
+		const startY = c0y;
+		const ctrlX = c0x + c1x / 2;
+		const ctrlY = c0y + c1y / 2;
+		const endX = c0x + c1x + c2x;
+		const endY = c0y + c1y + c2y;
+		if (!epsEquals(startX, prevEndX) || !epsEquals(startY, prevEndY)) result += ` M ${startX},${startY}`;
+		result += ` Q ${ctrlX},${ctrlY} ${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;
+		prevEndY = curve.y.c0 + curve.y.c1 + curve.y.c2;
+		first = false;
+	}
+	return true;
+};
+const asContinuous$1 = (p) => {
+	invariant(isContinuous$1(p), "quadratic path is not continuous");
+	return p;
+};
+const boundingBox$1 = (p) => {
+	const iter = p[Symbol.iterator]();
+	let acc = boundingBox$5(iter.next().value);
+	for (let next = iter.next(); !next.done; next = iter.next()) acc = union(acc, boundingBox$5(next.value));
+	return acc;
+};
+//#endregion
+//#region src/path/quadratic2d.ts
+var quadratic2d_exports = /* @__PURE__ */ __exportAll({
+	append: () => append,
+	asContinuous: () => asContinuous,
+	boundingBox: () => boundingBox,
+	fromArray: () => fromArray,
+	isContinuous: () => isContinuous,
+	isQuadraticPath2d: () => isQuadraticPath2d,
+	length: () => length,
+	make: () => make,
+	solve: () => solve,
+	toPathData: () => toPathData
+});
+/**
+* Creates a new `QuadraticPath2d` instance from a sequence of curves.
+*
+* @param curves - The curves to create the path from.
+* @returns A new `QuadraticPath2d` instance.
+* @since 2.0.0
+*/
+const make = make$1;
+/**
+* Creates a new `QuadraticPath2d` instance from an array of curves.
+*
+* @param curves - The curves to create the path from.
+* @returns A new `QuadraticPath2d` instance.
+* @since 2.0.0
+*/
+const fromArray = fromArray$1;
+/**
+* Checks if a value is a `QuadraticPath2d`.
+*
+* @param p - The value to check.
+* @returns `true` if the value is a `QuadraticPath2d`, `false` otherwise.
+* @since 1.0.0
+*/
+const isQuadraticPath2d = isQuadraticPath2d$1;
+const append = append$1;
+/**
+* Calculates the length of a quadratic path.
+*
+* @param p - The quadratic path to calculate the length of.
+* @returns The length of the path.
+*/
+const length = length$1;
+const solve = solve$1;
+/**
+* Serializes a quadratic path as an SVG path data string (the value of a
+* `<path>` element's `d` attribute), using `M` and `Q` commands. Discontinuities
+* between curves emit a fresh `M` command.
+*
+* @param p - The quadratic path to serialize.
+* @returns The SVG path data string.
+* @since 2.0.0
+*/
+const toPathData = toPathData$1;
+/**
+* Type-narrowing predicate: refines `QuadraticPath2d<T>` to
+* `QuadraticPath2d<T & Continuous>` when adjacent curves connect.
+*
+* @since 2.0.0
+*/
+const isContinuous = isContinuous$1;
+/**
+* Asserts that the quadratic path is continuous, throwing on failure.
+*
+* @since 2.0.0
+*/
+const asContinuous = asContinuous$1;
+/**
+* Computes the axis-aligned bounding box of the path — the smallest closed
+* `Box2d` enclosing every segment.
+*
+* @param p - The quadratic path.
+* @returns A closed `Box2d` enclosing the path.
+* @since 2.1.0
+*/
+const boundingBox = boundingBox$1;
+//#endregion
+export { cubic2d_exports as CubicPath2d, linear2d_exports as LinearPath2d, quadratic2d_exports as QuadraticPath2d, rationalCubic2d_exports as RationalCubicPath2d };
+
+//# sourceMappingURL=index.mjs.map

package/dist/path/index.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.mjs","names":["isLinearPath2d","make","fromArray","append","length","LinearCurve2d.length","Interval.unit","solve","LinearCurve2d.solve","toPathData","isContinuous","asContinuous","boundingBox","LinearCurve2d.boundingBox","Interval2d.union","make","internal.make","fromArray","internal.fromArray","internal.isLinearPath2d","append","internal.append","length","internal.length","solve","internal.solve","toPathData","internal.toPathData","isContinuous","internal.isContinuous","asContinuous","internal.asContinuous","boundingBox","internal.boundingBox","isQuadraticPath2d","make","fromArray","append","length","QuadraticCurve2d.length","Interval.unit","solve","QuadraticCurve2d.solve","toPathData","isContinuous","asContinuous","boundingBox","QuadraticCurve2d.boundingBox","Interval2d.union","internal.make","internal.fromArray","internal.isQuadraticPath2d","internal.append","internal.length","internal.solve","internal.toPathData","internal.isContinuous","internal.asContinuous","internal.boundingBox"],"sources":["../../src/path/linear2d.internal.ts","../../src/path/linear2d.ts","../../src/path/quadratic2d.internal.ts","../../src/path/quadratic2d.ts"],"sourcesContent":["import * as Interval2d from '../interval/interval2d'\nimport * as LinearCurve2d from '../curve/linear2d'\nimport * as Interval from '../interval/interval'\nimport { dual, Pipeable } from '../utils'\nimport { invariant } from '../utils'\nimport { epsEquals } from '../number'\nimport type { Vector2 } from '../vector/vector2'\nimport type { LinearPath2d } from './linear2d'\nimport { PathTraits, type Continuous } from './traits'\n\nexport const LinearPath2dTypeId: unique symbol = Symbol('curvy/path/linear2d')\nexport type LinearPath2dTypeId = typeof LinearPath2dTypeId\n\nexport class LinearPath2dImpl extends Pipeable implements LinearPath2d<unknown> {\n  readonly [LinearPath2dTypeId]: LinearPath2dTypeId = LinearPath2dTypeId\n  declare readonly [PathTraits]: unknown\n\n  readonly curves: ReadonlyArray<LinearCurve2d.LinearCurve2d>\n\n  constructor(curves: ReadonlyArray<LinearCurve2d.LinearCurve2d>) {\n    super()\n    this.curves = curves\n  }\n\n  [Symbol.iterator](): Iterator<LinearCurve2d.LinearCurve2d> {\n    return this.curves[Symbol.iterator]()\n  }\n}\n\nexport const isLinearPath2d = (p: unknown): p is LinearPath2d =>\n  typeof p === 'object' && p !== null && LinearPath2dTypeId in p\n\nexport const make = (...curves: ReadonlyArray<LinearCurve2d.LinearCurve2d>): LinearPath2d =>\n  new LinearPath2dImpl(curves)\n\nexport const fromArray = (curves: ReadonlyArray<LinearCurve2d.LinearCurve2d>) =>\n  new LinearPath2dImpl(curves)\n\nexport const append = dual<\n  (c: LinearCurve2d.LinearCurve2d) => (p: LinearPath2d) => LinearPath2d,\n  (p: LinearPath2d, c: LinearCurve2d.LinearCurve2d) => LinearPath2d\n>(2, (p: LinearPath2d, c: LinearCurve2d.LinearCurve2d) => fromArray([...p, c]))\n\nexport const length = (p: LinearPath2d) => {\n  let total = 0\n  for (const curve of p) {\n    total += LinearCurve2d.length(curve, Interval.unit)\n  }\n\n  return total\n}\n\nexport const solve = dual<\n  (u: number) => (p: LinearPath2d) => Vector2,\n  (p: LinearPath2d, u: number) => Vector2\n>(2, (p: LinearPath2d, u: number) => {\n  const curves = p instanceof LinearPath2dImpl ? p.curves : [...p]\n\n  if (u === 1) {\n    const last = curves.at(-1) as LinearCurve2d.LinearCurve2d\n    return LinearCurve2d.solve(last, 1)\n  }\n\n  const t = u * curves.length\n  const i = Math.floor(t)\n  const curve = curves[i] as LinearCurve2d.LinearCurve2d\n  return LinearCurve2d.solve(curve, t - i)\n})\n\nexport const toPathData = (p: LinearPath2d): string => {\n  let result = ''\n  let prevEndX = Number.NaN\n  let prevEndY = Number.NaN\n\n  for (const curve of p) {\n    const startX = curve.x.c0\n    const startY = curve.y.c0\n    const endX = curve.x.c0 + curve.x.c1\n    const endY = curve.y.c0 + curve.y.c1\n\n    if (!epsEquals(startX, prevEndX) || !epsEquals(startY, prevEndY)) {\n      result += ` M ${startX},${startY}`\n    }\n    result += ` L ${endX},${endY}`\n\n    prevEndX = endX\n    prevEndY = endY\n  }\n\n  return result.slice(1)\n}\n\nexport const isContinuous = <T>(p: LinearPath2d<T>): p is LinearPath2d<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\n    prevEndY = curve.y.c0 + curve.y.c1\n    first = false\n  }\n  return true\n}\n\nexport const asContinuous = <T>(p: LinearPath2d<T>): LinearPath2d<T & Continuous> => {\n  invariant(isContinuous(p), 'linear path is not continuous')\n  return p\n}\n\nexport const boundingBox = (\n  p: LinearPath2d,\n): Interval2d.Interval2d<Interval.Closed, Interval.Closed> => {\n  const iter = p[Symbol.iterator]()\n  const first = iter.next()\n  // path invariant: at least one curve, so first.value is defined\n  let acc = LinearCurve2d.boundingBox(first.value as LinearCurve2d.LinearCurve2d)\n  for (let next = iter.next(); !next.done; next = iter.next()) {\n    acc = Interval2d.union(acc, LinearCurve2d.boundingBox(next.value))\n  }\n  return acc\n}\n","import type { Interval2d } from '../interval/interval2d'\nimport type { LinearCurve2d } from '../curve/linear2d'\nimport type { Closed } from '../interval/interval'\nimport type { Pipeable } from '../utils'\nimport type { Vector2 } from '../vector/vector2'\nimport type { LinearPath2dTypeId } from './linear2d.internal'\nimport * as internal from './linear2d.internal'\nimport type { Continuous, PathTraits } from './traits'\n\nexport type { Continuous } from './traits'\n\n/**\n * A linear 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`. A `Continuous` path's `toPathData`\n * skips the per-segment discontinuity check.\n *\n * @since 1.0.0\n */\nexport interface LinearPath2d<out Trait = unknown> extends Pipeable, Iterable<LinearCurve2d> {\n  readonly [LinearPath2dTypeId]: LinearPath2dTypeId\n  readonly [PathTraits]: Trait\n}\n\n/**\n * Creates a new `LinearPath2d` instance from a sequence of curves.\n *\n * @param curves - The curves to create the path from.\n * @returns A new `LinearPath2d` instance.\n * @since 2.0.0\n */\nexport const make: (...curves: ReadonlyArray<LinearCurve2d>) => LinearPath2d = internal.make\n\n/**\n * Creates a new `LinearPath2d` instance from an array of curves.\n *\n * @param curves - The curves to create the path from.\n * @returns A new `LinearPath2d` instance.\n * @since 2.0.0\n */\nexport const fromArray: (curves: ReadonlyArray<LinearCurve2d>) => LinearPath2d = internal.fromArray\n\n/**\n * Checks if a value is a `LinearPath2d`.\n *\n * @param p - The value to check.\n * @returns `true` if the value is a `LinearPath2d`, `false` otherwise.\n * @since 1.0.0\n */\nexport const isLinearPath2d: (p: unknown) => p is LinearPath2d = internal.isLinearPath2d\n\nexport const append: {\n  /**\n   * Appends a linear curve to a linear path.\n   *\n   * @param c - The linear curve to append.\n   * @returns A function that takes a linear path and returns a new linear path.\n   * @since 1.0.0\n   */\n  (c: LinearCurve2d): (p: LinearPath2d) => LinearPath2d\n  /**\n   * Appends a linear curve to a linear path.\n   *\n   * @param p - The linear path to append to.\n   * @param c - The linear curve to append.\n   * @returns A new `LinearPath2d` instance with the appended curve.\n   * @since 1.0.0\n   */\n  (p: LinearPath2d, c: LinearCurve2d): LinearPath2d\n} = internal.append\n\n/**\n * Calculates the length of a linear path.\n *\n * @param p - The linear path to calculate the length of.\n * @returns The length of the linear path.\n * @since 1.0.0\n */\nexport const length: (p: LinearPath2d) => number = internal.length\n\nexport const solve: {\n  /**\n   * Solves a linear path for a given parameter.\n   *\n   * @param u - The parameter to solve for.\n   * @returns A function that takes a linear path and returns the solved point.\n   * @since 1.0.0\n   */\n  (u: number): (p: LinearPath2d) => Vector2\n  /**\n   * Solves a linear path for a given parameter.\n   *\n   * @param p - The linear path to solve.\n   * @param u - The parameter to solve for.\n   * @returns The solved point on the linear path.\n   * @since 1.0.0\n   */\n  (p: LinearPath2d, u: number): Vector2\n} = internal.solve\n\n/**\n * Serializes a linear path as an SVG path data string (the value of a `<path>`\n * element's `d` attribute), using `M` and `L` commands. Discontinuities between\n * curves emit a fresh `M` command.\n *\n * @param p - The linear path to serialize.\n * @returns The SVG path data string.\n * @since 2.0.0\n */\nexport const toPathData: (p: LinearPath2d) => string = internal.toPathData\n\n/**\n * Type-narrowing predicate: refines `LinearPath2d<T>` to\n * `LinearPath2d<T & Continuous>` when adjacent curves connect at their join\n * points.\n *\n * @param p - The linear path to check.\n * @returns `true` when the path is continuous (G⁰).\n * @since 2.0.0\n */\nexport const isContinuous: <T>(p: LinearPath2d<T>) => p is LinearPath2d<T & Continuous> =\n  internal.isContinuous\n\n/**\n * Asserts that the linear path is continuous, throwing on failure.\n *\n * @param p - The linear path to assert against.\n * @returns The same path, typed with the `Continuous` brand.\n * @throws When the path has a discontinuity between adjacent curves.\n * @since 2.0.0\n */\nexport const asContinuous: <T>(p: LinearPath2d<T>) => LinearPath2d<T & Continuous> =\n  internal.asContinuous\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 linear path.\n * @returns A closed `Box2d` enclosing the path.\n * @since 2.1.0\n */\nexport const boundingBox: (p: LinearPath2d) => Interval2d<Closed, Closed> = internal.boundingBox\n","import * as Interval2d from '../interval/interval2d'\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 type { Vector2 } from '../vector/vector2'\nimport type { QuadraticPath2d } from './quadratic2d'\nimport { PathTraits, type Continuous } from './traits'\n\nexport const QuadraticPath2dTypeId: unique symbol = Symbol('curvy/path/quadratic2d')\nexport type QuadraticPath2dTypeId = typeof QuadraticPath2dTypeId\n\nexport class QuadraticPath2dImpl extends Pipeable implements QuadraticPath2d<unknown> {\n  readonly [QuadraticPath2dTypeId]: QuadraticPath2dTypeId = QuadraticPath2dTypeId\n  declare readonly [PathTraits]: unknown\n\n  readonly curves: ReadonlyArray<QuadraticCurve2d.QuadraticCurve2d>\n\n  constructor(curves: ReadonlyArray<QuadraticCurve2d.QuadraticCurve2d>) {\n    super()\n    this.curves = curves\n  }\n\n  [Symbol.iterator](): Iterator<QuadraticCurve2d.QuadraticCurve2d> {\n    return this.curves[Symbol.iterator]()\n  }\n}\n\nexport const isQuadraticPath2d = (p: unknown): p is QuadraticPath2d =>\n  typeof p === 'object' && p !== null && QuadraticPath2dTypeId in p\n\nexport const make = (\n  ...curves: ReadonlyArray<QuadraticCurve2d.QuadraticCurve2d>\n): QuadraticPath2d => new QuadraticPath2dImpl(curves)\n\nexport const fromArray = (\n  curves: ReadonlyArray<QuadraticCurve2d.QuadraticCurve2d>,\n): QuadraticPath2d => new QuadraticPath2dImpl(curves)\n\nexport const append = dual<\n  (c: QuadraticCurve2d.QuadraticCurve2d) => (p: QuadraticPath2d) => QuadraticPath2d,\n  (p: QuadraticPath2d, c: QuadraticCurve2d.QuadraticCurve2d) => QuadraticPath2d\n>(2, (p: QuadraticPath2d, c: QuadraticCurve2d.QuadraticCurve2d) => fromArray([...p, c]))\n\nexport const length = (p: QuadraticPath2d) => {\n  let total = 0\n  for (const curve of p) {\n    total += QuadraticCurve2d.length(curve, Interval.unit)\n  }\n\n  return total\n}\n\nexport const solve = dual<\n  (u: number) => (p: QuadraticPath2d) => Vector2,\n  (p: QuadraticPath2d, u: number) => Vector2\n>(2, (p: QuadraticPath2d, u: number) => {\n  const curves = p instanceof QuadraticPath2dImpl ? p.curves : [...p]\n\n  if (u === 1) {\n    const last = curves.at(-1) as QuadraticCurve2d.QuadraticCurve2d\n    return QuadraticCurve2d.solve(last, 1)\n  }\n\n  const t = u * curves.length\n  const i = Math.floor(t)\n  const curve = curves[i] as QuadraticCurve2d.QuadraticCurve2d\n  return QuadraticCurve2d.solve(curve, t - i)\n})\n\n// Quadratic Bernstein basis: P(t) = (1-t)²·p0 + 2(1-t)t·p1 + t²·p2\n// expanded gives c0 = p0, c1 = -2p0 + 2p1, c2 = p0 - 2p1 + p2, so:\n//   p0 = c0, p1 = c0 + c1/2, p2 = c0 + c1 + c2.\nexport const toPathData = (p: QuadraticPath2d): 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\n    const startX = c0x\n    const startY = c0y\n    const ctrlX = c0x + c1x / 2\n    const ctrlY = c0y + c1y / 2\n    const endX = c0x + c1x + c2x\n    const endY = c0y + c1y + c2y\n\n    if (!epsEquals(startX, prevEndX) || !epsEquals(startY, prevEndY)) {\n      result += ` M ${startX},${startY}`\n    }\n    result += ` Q ${ctrlX},${ctrlY} ${endX},${endY}`\n\n    prevEndX = endX\n    prevEndY = endY\n  }\n\n  return result.slice(1)\n}\n\nexport const isContinuous = <T>(p: QuadraticPath2d<T>): p is QuadraticPath2d<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\n    prevEndY = curve.y.c0 + curve.y.c1 + curve.y.c2\n    first = false\n  }\n  return true\n}\n\nexport const asContinuous = <T>(p: QuadraticPath2d<T>): QuadraticPath2d<T & Continuous> => {\n  invariant(isContinuous(p), 'quadratic path is not continuous')\n  return p\n}\n\nexport const boundingBox = (\n  p: QuadraticPath2d,\n): Interval2d.Interval2d<Interval.Closed, Interval.Closed> => {\n  const iter = p[Symbol.iterator]()\n  const first = iter.next()\n  let acc = QuadraticCurve2d.boundingBox(first.value as QuadraticCurve2d.QuadraticCurve2d)\n  for (let next = iter.next(); !next.done; next = iter.next()) {\n    acc = Interval2d.union(acc, QuadraticCurve2d.boundingBox(next.value))\n  }\n  return acc\n}\n","import type { Interval2d } from '../interval/interval2d'\nimport type { QuadraticCurve2d } from '../curve/quadratic2d'\nimport type { Closed } from '../interval/interval'\nimport type { Pipeable } from '../utils'\nimport type { Vector2 } from '../vector/vector2'\nimport type { QuadraticPath2dTypeId } from './quadratic2d.internal'\nimport * as internal from './quadratic2d.internal'\nimport type { Continuous, PathTraits } from './traits'\n\nexport type { Continuous } from './traits'\n\n/**\n * A quadratic 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 QuadraticPath2d<out Trait = unknown> extends Pipeable, Iterable<QuadraticCurve2d> {\n  readonly [QuadraticPath2dTypeId]: QuadraticPath2dTypeId\n  readonly [PathTraits]: Trait\n}\n\n/**\n * Creates a new `QuadraticPath2d` instance from a sequence of curves.\n *\n * @param curves - The curves to create the path from.\n * @returns A new `QuadraticPath2d` instance.\n * @since 2.0.0\n */\nexport const make: (...curves: ReadonlyArray<QuadraticCurve2d>) => QuadraticPath2d = internal.make\n\n/**\n * Creates a new `QuadraticPath2d` instance from an array of curves.\n *\n * @param curves - The curves to create the path from.\n * @returns A new `QuadraticPath2d` instance.\n * @since 2.0.0\n */\nexport const fromArray: (curves: ReadonlyArray<QuadraticCurve2d>) => QuadraticPath2d =\n  internal.fromArray\n\n/**\n * Checks if a value is a `QuadraticPath2d`.\n *\n * @param p - The value to check.\n * @returns `true` if the value is a `QuadraticPath2d`, `false` otherwise.\n * @since 1.0.0\n */\nexport const isQuadraticPath2d: (p: unknown) => p is QuadraticPath2d = internal.isQuadraticPath2d\n\nexport const append: {\n  /**\n   * Appends a quadratic curve to a quadratic path.\n   *\n   * @param c - The quadratic curve to append.\n   * @returns A function that takes a quadratic path and returns a new quadratic path.\n   * @since 1.0.0\n   */\n  (c: QuadraticCurve2d): (p: QuadraticPath2d) => QuadraticPath2d\n  /**\n   * Appends a quadratic curve to a quadratic path.\n   *\n   * @param p - The quadratic path to append to.\n   * @param c - The quadratic curve to append.\n   * @returns A new `QuadraticPath2d` instance with the appended curve.\n   * @since 1.0.0\n   */\n  (p: QuadraticPath2d, c: QuadraticCurve2d): QuadraticPath2d\n} = internal.append\n\n/**\n * Calculates the length of a quadratic path.\n *\n * @param p - The quadratic path to calculate the length of.\n * @returns The length of the path.\n */\nexport const length: (p: QuadraticPath2d) => number = internal.length\n\nexport const solve: {\n  /**\n   * Solves a quadratic path at a given parameter.\n   *\n   * @param u - The parameter to solve for.\n   * @returns A function that takes a quadratic path and returns the solved point.\n   * @since 1.0.0\n   */\n  (u: number): (p: QuadraticPath2d) => Vector2\n  /**\n   * Solves a quadratic path at a given parameter.\n   *\n   * @param p - The quadratic path to solve.\n   * @param u - The parameter to solve for.\n   * @returns The solved point.\n   * @since 1.0.0\n   */\n  (p: QuadraticPath2d, u: number): Vector2\n} = internal.solve\n\n/**\n * Serializes a quadratic path as an SVG path data string (the value of a\n * `<path>` element's `d` attribute), using `M` and `Q` commands. Discontinuities\n * between curves emit a fresh `M` command.\n *\n * @param p - The quadratic path to serialize.\n * @returns The SVG path data string.\n * @since 2.0.0\n */\nexport const toPathData: (p: QuadraticPath2d) => string = internal.toPathData\n\n/**\n * Type-narrowing predicate: refines `QuadraticPath2d<T>` to\n * `QuadraticPath2d<T & Continuous>` when adjacent curves connect.\n *\n * @since 2.0.0\n */\nexport const isContinuous: <T>(p: QuadraticPath2d<T>) => p is QuadraticPath2d<T & Continuous> =\n  internal.isContinuous\n\n/**\n * Asserts that the quadratic path is continuous, throwing on failure.\n *\n * @since 2.0.0\n */\nexport const asContinuous: <T>(p: QuadraticPath2d<T>) => QuadraticPath2d<T & Continuous> =\n  internal.asContinuous\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 quadratic path.\n * @returns A closed `Box2d` enclosing the path.\n * @since 2.1.0\n */\nexport const boundingBox: (p: QuadraticPath2d) => Interval2d<Closed, Closed> = internal.boundingBox\n"],"mappings":";;;;;;;;AAUA,MAAa,qBAAoC,OAAO,sBAAsB;AAG9E,IAAa,mBAAb,cAAsC,SAA0C;CAC9E,CAAU,sBAA0C;CAGpD;CAEA,YAAY,QAAoD;EAC9D,OAAO;EACP,KAAK,SAAS;;CAGhB,CAAC,OAAO,YAAmD;EACzD,OAAO,KAAK,OAAO,OAAO,WAAW;;;AAIzC,MAAaA,oBAAkB,MAC7B,OAAO,MAAM,YAAY,MAAM,QAAQ,sBAAsB;AAE/D,MAAaC,UAAQ,GAAG,WACtB,IAAI,iBAAiB,OAAO;AAE9B,MAAaC,eAAa,WACxB,IAAI,iBAAiB,OAAO;AAE9B,MAAaC,WAAS,KAGpB,IAAI,GAAiB,MAAmCD,YAAU,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC;AAE/E,MAAaE,YAAU,MAAoB;CACzC,IAAI,QAAQ;CACZ,KAAK,MAAM,SAAS,GAClB,SAASC,SAAqB,OAAOC,KAAc;CAGrD,OAAO;;AAGT,MAAaC,UAAQ,KAGnB,IAAI,GAAiB,MAAc;CACnC,MAAM,SAAS,aAAa,mBAAmB,EAAE,SAAS,CAAC,GAAG,EAAE;CAEhE,IAAI,MAAM,GAER,OAAOC,QADM,OAAO,GAAG,GACI,EAAM,EAAE;CAGrC,MAAM,IAAI,IAAI,OAAO;CACrB,MAAM,IAAI,KAAK,MAAM,EAAE;CACvB,MAAM,QAAQ,OAAO;CACrB,OAAOA,QAAoB,OAAO,IAAI,EAAE;EACxC;AAEF,MAAaC,gBAAc,MAA4B;CACrD,IAAI,SAAS;CACb,IAAI,WAAW;CACf,IAAI,WAAW;CAEf,KAAK,MAAM,SAAS,GAAG;EACrB,MAAM,SAAS,MAAM,EAAE;EACvB,MAAM,SAAS,MAAM,EAAE;EACvB,MAAM,OAAO,MAAM,EAAE,KAAK,MAAM,EAAE;EAClC,MAAM,OAAO,MAAM,EAAE,KAAK,MAAM,EAAE;EAElC,IAAI,CAAC,UAAU,QAAQ,SAAS,IAAI,CAAC,UAAU,QAAQ,SAAS,EAC9D,UAAU,MAAM,OAAO,GAAG;EAE5B,UAAU,MAAM,KAAK,GAAG;EAExB,WAAW;EACX,WAAW;;CAGb,OAAO,OAAO,MAAM,EAAE;;AAGxB,MAAaC,kBAAmB,MAA0D;CACxF,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;EAChC,WAAW,MAAM,EAAE,KAAK,MAAM,EAAE;EAChC,QAAQ;;CAEV,OAAO;;AAGT,MAAaC,kBAAmB,MAAqD;CACnF,UAAUD,eAAa,EAAE,EAAE,gCAAgC;CAC3D,OAAO;;AAGT,MAAaE,iBACX,MAC4D;CAC5D,MAAM,OAAO,EAAE,OAAO,WAAW;CAGjC,IAAI,MAAMC,cAFI,KAAK,MAEiB,CAAM,MAAqC;CAC/E,KAAK,IAAI,OAAO,KAAK,MAAM,EAAE,CAAC,KAAK,MAAM,OAAO,KAAK,MAAM,EACzD,MAAMC,MAAiB,KAAKD,cAA0B,KAAK,MAAM,CAAC;CAEpE,OAAO;;;;;;;;;;;;;;;;;;;;;;;AC3FT,MAAaE,SAAkEC;;;;;;;;AAS/E,MAAaC,cAAoEC;;;;;;;;AASjF,MAAa,iBAAoDC;AAEjE,MAAaC,WAkBTC;;;;;;;;AASJ,MAAaC,WAAsCC;AAEnD,MAAaC,UAkBTC;;;;;;;;;;AAWJ,MAAaC,eAA0CC;;;;;;;;;;AAWvD,MAAaC,iBACXC;;;;;;;;;AAUF,MAAaC,iBACXC;;;;;;;;;AAUF,MAAaC,gBAA+DC;;;ACvI5E,MAAa,wBAAuC,OAAO,yBAAyB;AAGpF,IAAa,sBAAb,cAAyC,SAA6C;CACpF,CAAU,yBAAgD;CAG1D;CAEA,YAAY,QAA0D;EACpE,OAAO;EACP,KAAK,SAAS;;CAGhB,CAAC,OAAO,YAAyD;EAC/D,OAAO,KAAK,OAAO,OAAO,WAAW;;;AAIzC,MAAaC,uBAAqB,MAChC,OAAO,MAAM,YAAY,MAAM,QAAQ,yBAAyB;AAElE,MAAaC,UACX,GAAG,WACiB,IAAI,oBAAoB,OAAO;AAErD,MAAaC,eACX,WACoB,IAAI,oBAAoB,OAAO;AAErD,MAAaC,WAAS,KAGpB,IAAI,GAAoB,MAAyCD,YAAU,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC;AAExF,MAAaE,YAAU,MAAuB;CAC5C,IAAI,QAAQ;CACZ,KAAK,MAAM,SAAS,GAClB,SAASC,SAAwB,OAAOC,KAAc;CAGxD,OAAO;;AAGT,MAAaC,UAAQ,KAGnB,IAAI,GAAoB,MAAc;CACtC,MAAM,SAAS,aAAa,sBAAsB,EAAE,SAAS,CAAC,GAAG,EAAE;CAEnE,IAAI,MAAM,GAER,OAAOC,QADM,OAAO,GAAG,GACO,EAAM,EAAE;CAGxC,MAAM,IAAI,IAAI,OAAO;CACrB,MAAM,IAAI,KAAK,MAAM,EAAE;CACvB,MAAM,QAAQ,OAAO;CACrB,OAAOA,QAAuB,OAAO,IAAI,EAAE;EAC3C;AAKF,MAAaC,gBAAc,MAA+B;CACxD,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;EAEpB,MAAM,SAAS;EACf,MAAM,SAAS;EACf,MAAM,QAAQ,MAAM,MAAM;EAC1B,MAAM,QAAQ,MAAM,MAAM;EAC1B,MAAM,OAAO,MAAM,MAAM;EACzB,MAAM,OAAO,MAAM,MAAM;EAEzB,IAAI,CAAC,UAAU,QAAQ,SAAS,IAAI,CAAC,UAAU,QAAQ,SAAS,EAC9D,UAAU,MAAM,OAAO,GAAG;EAE5B,UAAU,MAAM,MAAM,GAAG,MAAM,GAAG,KAAK,GAAG;EAE1C,WAAW;EACX,WAAW;;CAGb,OAAO,OAAO,MAAM,EAAE;;AAGxB,MAAaC,kBAAmB,MAAgE;CAC9F,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;EAC7C,WAAW,MAAM,EAAE,KAAK,MAAM,EAAE,KAAK,MAAM,EAAE;EAC7C,QAAQ;;CAEV,OAAO;;AAGT,MAAaC,kBAAmB,MAA2D;CACzF,UAAUD,eAAa,EAAE,EAAE,mCAAmC;CAC9D,OAAO;;AAGT,MAAaE,iBACX,MAC4D;CAC5D,MAAM,OAAO,EAAE,OAAO,WAAW;CAEjC,IAAI,MAAMC,cADI,KAAK,MACoB,CAAM,MAA2C;CACxF,KAAK,IAAI,OAAO,KAAK,MAAM,EAAE,CAAC,KAAK,MAAM,OAAO,KAAK,MAAM,EACzD,MAAMC,MAAiB,KAAKD,cAA6B,KAAK,MAAM,CAAC;CAEvE,OAAO;;;;;;;;;;;;;;;;;;;;;;;ACzGT,MAAa,OAAwEE;;;;;;;;AASrF,MAAa,YACXC;;;;;;;;AASF,MAAa,oBAA0DC;AAEvE,MAAa,SAkBTC;;;;;;;AAQJ,MAAa,SAAyCC;AAEtD,MAAa,QAkBTC;;;;;;;;;;AAWJ,MAAa,aAA6CC;;;;;;;AAQ1D,MAAa,eACXC;;;;;;AAOF,MAAa,eACXC;;;;;;;;;AAUF,MAAa,cAAkEC"}

package/dist/polynomial/index.d.mts

@@ -0,0 +1,2 @@
+import { i as quadratic_d_exports, n as cubic_d_exports, o as linear_d_exports } from "../shared/cubic-BajUY0JT.mjs";
+export { cubic_d_exports as CubicPolynomial, linear_d_exports as LinearPolynomial, quadratic_d_exports as QuadraticPolynomial };

package/dist/polynomial/index.mjs

@@ -0,0 +1,3 @@
+import { t as cubic_exports } from "../shared/cubic-CpHAx8cC.mjs";
+import { o as quadratic_exports, p as linear_exports } from "../shared/quadratic-CamozcFc.mjs";
+export { cubic_exports as CubicPolynomial, linear_exports as LinearPolynomial, quadratic_exports as QuadraticPolynomial };