curvy 2.0.0-alpha.13 → 2.0.0-alpha.14

package/dist/shared/{matrix4x4-BWmf4lZM.mjs → matrix4x4-BrqgYZCD.mjs}

@@ -1,202 +1,9 @@
 import { t as __exportAll } from "./chunk-25Hzd3z8.mjs";
 import { Pipeable, dual, invariant } from "../utils.mjs";
-import { epsEquals } from "../number.mjs";
-import { h as make$4, i as dot } from "./vector2.internal-DP1nTBdS.mjs";
-import { A as dot$1, H as make$5, O as components, n as components$1, p as make$6, r as dot$2 } from "./vector4.internal-BJ1QN2Ck.mjs";
-//#region src/dimensions.ts
-function toIndex(input) {
-	if (typeof input === "number") {
-		invariant(input >= 0 && input <= 3, "Index out of bounds");
-		return input;
-	}
-	if (input === "x") return 0;
-	if (input === "y") return 1;
-	if (input === "z") return 2;
-	if (input === "w") return 3;
-	invariant(false, "Invalid component");
-}
-const toTwoDimensionalIndex = toIndex;
-const toThreeDimensionalIndex = toIndex;
-const toFourDimensionalIndex = toIndex;
-//#endregion
-//#region src/matrix/matrix2x2.internal.ts
-const Matrix2x2TypeId = Symbol.for("curvy/matrix2x2");
-var Matrix2x2Impl = class extends Pipeable {
-	[Matrix2x2TypeId] = Matrix2x2TypeId;
-	m00;
-	m01;
-	m10;
-	m11;
-	constructor(m00 = 0, m01 = 0, m10 = 0, m11 = 0) {
-		super();
-		this.m00 = m00;
-		this.m01 = m01;
-		this.m10 = m10;
-		this.m11 = m11;
-	}
-	get [Symbol.toStringTag]() {
-		return `Matrix2x2(${this.m00}, ${this.m01}, ${this.m10}, ${this.m11})`;
-	}
-	get [Symbol.for("nodejs.util.inspect.custom")]() {
-		return `Matrix2x2(${this.m00}, ${this.m01}, ${this.m10}, ${this.m11})`;
-	}
-	[Symbol.hasInstance](m) {
-		return isMatrix2x2(m);
-	}
-};
-/** @internal */
-const isMatrix2x2 = (m) => typeof m === "object" && m !== null && Matrix2x2TypeId in m;
-/** @internal */
-const equals$3 = dual(2, (a, b) => epsEquals(a.m00, b.m00) && epsEquals(a.m01, b.m01) && epsEquals(a.m10, b.m10) && epsEquals(a.m11, b.m11));
-/** @internal */
-const make$3 = (m00 = 0, m01 = m00, m10 = m01, m11 = m10) => new Matrix2x2Impl(m00, m01, m10, m11);
-/** @internal */
-const fromRows$3 = (v0, v1) => new Matrix2x2Impl(v0.x, v0.y, v1.x, v1.y);
-/** @internal */
-const fromColumns$3 = (v0, v1) => new Matrix2x2Impl(v0.x, v1.x, v0.y, v1.y);
-/** @internal */
-const setRow$3 = dual(3, (m, row, v) => fromRows$3(...toRows$3(m).with(toTwoDimensionalIndex(row), v)));
-/** @internal */
-const setColumn$3 = dual(3, (m, column, v) => fromColumns$3(...toColumns$3(m).with(toTwoDimensionalIndex(column), v)));
-/** @internal */
-const determinant$3 = (m) => m.m00 * m.m11 - m.m01 * m.m10;
-/** @internal */
-const vectorProductLeft$3 = dual(2, (m, v) => make$4(dot(rowVector$3(m, 0), v), dot(rowVector$3(m, 1), v)));
-/** @internal */
-const vectorProductRight$3 = dual(2, (m, v) => make$4(dot(columnVector$3(m, 0), v), dot(columnVector$3(m, 1), v)));
-/** @internal */
-const solveSystem$3 = dual(2, (m, v) => {
-	const inverseDeterminant = 1 / determinant$3(m);
-	invariant(Number.isFinite(inverseDeterminant), "cannot solve system when coefficient matrix determinant is zero");
-	return make$4(determinant$3(setColumn$3(m, 0, v)) * inverseDeterminant, determinant$3(setColumn$3(m, 1, v)) * inverseDeterminant);
-});
-/** @internal */
-const toRows$3 = (m) => [make$4(m.m00, m.m01), make$4(m.m10, m.m11)];
-/** @internal */
-const toColumns$3 = (m) => [make$4(m.m00, m.m10), make$4(m.m01, m.m11)];
-/** @internal */
-const rowVector$3 = dual(2, (m, row) => toRows$3(m)[toTwoDimensionalIndex(row)]);
-/** @internal */
-const columnVector$3 = dual(2, (m, column) => toColumns$3(m)[toTwoDimensionalIndex(column)]);
-/** @internal */
-const transpose$3 = (m) => fromColumns$3(...toRows$3(m));
-/** @internal */
-const reverseRows$3 = (m) => {
-	const [r0, r1] = toRows$3(m);
-	return fromRows$3(r1, r0);
-};
-/** @internal */
-const reverseColumns$3 = (m) => {
-	const [c0, c1] = toColumns$3(m);
-	return fromColumns$3(c1, c0);
-};
-//#endregion
-//#region src/matrix/matrix3x3.internal.ts
-const Matrix3x3TypeId = Symbol.for("curvy/matrix3x3");
-var Matrix3x3Impl = class extends Pipeable {
-	[Matrix3x3TypeId] = Matrix3x3TypeId;
-	m00;
-	m01;
-	m02;
-	m10;
-	m11;
-	m12;
-	m20;
-	m21;
-	m22;
-	constructor(m00 = 0, m01 = 0, m02 = 0, m10 = 0, m11 = 0, m12 = 0, m20 = 0, m21 = 0, m22 = 0) {
-		super();
-		this.m00 = m00;
-		this.m01 = m01;
-		this.m02 = m02;
-		this.m10 = m10;
-		this.m11 = m11;
-		this.m12 = m12;
-		this.m20 = m20;
-		this.m21 = m21;
-		this.m22 = m22;
-	}
-	get [Symbol.toStringTag]() {
-		return `Matrix3x3(${this.m00}, ${this.m01}, ${this.m02}, ${this.m10}, ${this.m11}, ${this.m12}, ${this.m20}, ${this.m21}, ${this.m22})`;
-	}
-	get [Symbol.for("nodejs.util.inspect.custom")]() {
-		return `Matrix3x3(${this.m00}, ${this.m01}, ${this.m02}, ${this.m10}, ${this.m11}, ${this.m12}, ${this.m20}, ${this.m21}, ${this.m22})`;
-	}
-	[Symbol.hasInstance](m) {
-		return isMatrix3x3(m);
-	}
-};
-/** @internal */
-const isMatrix3x3 = (m) => typeof m === "object" && m !== null && Matrix3x3TypeId in m;
-/** @internal */
-const equals$2 = dual(2, (a, b) => epsEquals(a.m00, b.m00) && epsEquals(a.m01, b.m01) && epsEquals(a.m02, b.m02) && epsEquals(a.m10, b.m10) && epsEquals(a.m11, b.m11) && epsEquals(a.m12, b.m12) && epsEquals(a.m20, b.m20) && epsEquals(a.m21, b.m21) && epsEquals(a.m22, b.m22));
-/** @internal */
-const make$2 = (m00 = 0, m01 = m00, m02 = m01, m10 = m02, m11 = m10, m12 = m11, m20 = m12, m21 = m20, m22 = m21) => {
-	return new Matrix3x3Impl(m00, m01, m02, m10, m11, m12, m20, m21, m22);
-};
-/** @internal */
-const fromRows$2 = (v0, v1, v2) => new Matrix3x3Impl(v0.x, v0.y, v0.z, v1.x, v1.y, v1.z, v2.x, v2.y, v2.z);
-/** @internal */
-const fromColumns$2 = (v0, v1, v2) => new Matrix3x3Impl(v0.x, v1.x, v2.x, v0.y, v1.y, v2.y, v0.z, v1.z, v2.z);
-/** @internal */
-const setRow$2 = dual(3, (m, row, v) => fromRows$2(...toRows$2(m).with(toThreeDimensionalIndex(row), v)));
-/** @internal */
-const setColumn$2 = dual(3, (m, column, v) => fromColumns$2(...toColumns$2(m).with(toThreeDimensionalIndex(column), v)));
-/** @internal */
-const determinant$2 = (m) => m.m00 * determinant$3(minor$2(m, 0, 0)) - m.m01 * determinant$3(minor$2(m, 0, 1)) + m.m02 * determinant$3(minor$2(m, 0, 2));
-/** @internal */
-const minor$2 = dual(3, (m, row, column) => {
-	const [v0, v1] = toRows$2(m).toSpliced(toThreeDimensionalIndex(row), 1);
-	const columnIndex = toThreeDimensionalIndex(column);
-	const [m00, m01] = components(v0).toSpliced(columnIndex, 1);
-	const [m10, m11] = components(v1).toSpliced(columnIndex, 1);
-	return make$3(m00, m01, m10, m11);
-});
-/** @internal */
-const vectorProductLeft$2 = dual(2, (m, v) => {
-	const [v0, v1, v2] = toRows$2(m);
-	return make$5(dot$1(v0, v), dot$1(v1, v), dot$1(v2, v));
-});
-/** @internal */
-const vectorProductRight$2 = dual(2, (m, v) => {
-	const [v0, v1, v2] = toColumns$2(m);
-	return make$5(dot$1(v, v0), dot$1(v, v1), dot$1(v, v2));
-});
-/** @internal */
-const solveSystem$2 = dual(2, (m, v) => {
-	const inverseDeterminant = 1 / determinant$2(m);
-	invariant(Number.isFinite(inverseDeterminant), "cannot solve system when coefficient matrix determinant is zero");
-	return make$5(determinant$2(setColumn$2(m, 0, v)) * inverseDeterminant, determinant$2(setColumn$2(m, 1, v)) * inverseDeterminant, determinant$2(setColumn$2(m, 2, v)) * inverseDeterminant);
-});
-/** @internal */
-const toRows$2 = (m) => [
-	make$5(m.m00, m.m01, m.m02),
-	make$5(m.m10, m.m11, m.m12),
-	make$5(m.m20, m.m21, m.m22)
-];
-/** @internal */
-const toColumns$2 = (m) => [
-	make$5(m.m00, m.m10, m.m20),
-	make$5(m.m01, m.m11, m.m21),
-	make$5(m.m02, m.m12, m.m22)
-];
-/** @internal */
-const rowVector$2 = dual(2, (m, row) => toRows$2(m)[toThreeDimensionalIndex(row)]);
-/** @internal */
-const columnVector$2 = dual(2, (m, column) => toColumns$2(m)[toThreeDimensionalIndex(column)]);
-/** @internal */
-const transpose$2 = (m) => fromColumns$2(...toRows$2(m));
-/** @internal */
-const reverseRows$2 = (m) => {
-	const [v0, v1, v2] = toRows$2(m);
-	return fromRows$2(v2, v1, v0);
-};
-/** @internal */
-const reverseColumns$2 = (m) => {
-	const [v0, v1, v2] = toColumns$2(m);
-	return fromColumns$2(v2, v1, v0);
-};
-//#endregion
+import { RELATIVE_TOLERANCE, coincident } from "../number.mjs";
+import { n as components, p as make$2, r as dot } from "./vector4.internal-DH5DzNYO.mjs";
+import { W as toFourDimensionalIndex, f as make$3, r as determinant$2 } from "./matrix3x3.internal-Cod-r7H3.mjs";
+import { c as one, s as none } from "./solution-BW0BBMXI.mjs";
 //#region src/matrix/matrix4x4.internal.ts
 const Matrix4x4TypeId = Symbol.for("curvy/matrix4x4");
 var Matrix4x4Impl = class extends Pipeable {
@@ -249,7 +56,7 @@ var Matrix4x4Impl = class extends Pipeable {
 /** @internal */
 const isMatrix4x4$1 = (m) => typeof m === "object" && m !== null && Matrix4x4TypeId in m;
 /** @internal */
-const equals$1 = dual(2, (a, b) => epsEquals(a.m00, b.m00) && epsEquals(a.m01, b.m01) && epsEquals(a.m02, b.m02) && epsEquals(a.m03, b.m03) && epsEquals(a.m10, b.m10) && epsEquals(a.m11, b.m11) && epsEquals(a.m12, b.m12) && epsEquals(a.m13, b.m13) && epsEquals(a.m20, b.m20) && epsEquals(a.m21, b.m21) && epsEquals(a.m22, b.m22) && epsEquals(a.m23, b.m23) && epsEquals(a.m30, b.m30) && epsEquals(a.m31, b.m31) && epsEquals(a.m32, b.m32) && epsEquals(a.m33, b.m33));
+const equals$1 = dual(2, (a, b) => coincident(a.m00, b.m00) && coincident(a.m01, b.m01) && coincident(a.m02, b.m02) && coincident(a.m03, b.m03) && coincident(a.m10, b.m10) && coincident(a.m11, b.m11) && coincident(a.m12, b.m12) && coincident(a.m13, b.m13) && coincident(a.m20, b.m20) && coincident(a.m21, b.m21) && coincident(a.m22, b.m22) && coincident(a.m23, b.m23) && coincident(a.m30, b.m30) && coincident(a.m31, b.m31) && coincident(a.m32, b.m32) && coincident(a.m33, b.m33));
 /**
 * The 4x4 identity matrix.
 * @internal
@@ -271,27 +78,32 @@ const determinant$1 = (m) => m.m00 * determinant$2(minor$1(m, 0, 0)) - m.m01 * d
 const minor$1 = dual(3, (m, row, column) => {
 	const [v0, v1, v2] = toRows$1(m).toSpliced(toFourDimensionalIndex(row), 1);
 	const columnIndex = toFourDimensionalIndex(column);
-	const [m00, m01, m02] = components$1(v0).toSpliced(columnIndex, 1);
-	const [m10, m11, m12] = components$1(v1).toSpliced(columnIndex, 1);
-	const [m20, m21, m22] = components$1(v2).toSpliced(columnIndex, 1);
-	return make$2(m00, m01, m02, m10, m11, m12, m20, m21, m22);
+	const [m00, m01, m02] = components(v0).toSpliced(columnIndex, 1);
+	const [m10, m11, m12] = components(v1).toSpliced(columnIndex, 1);
+	const [m20, m21, m22] = components(v2).toSpliced(columnIndex, 1);
+	return make$3(m00, m01, m02, m10, m11, m12, m20, m21, m22);
 });
 /** @internal */
 const vectorProductLeft$1 = dual(2, (m, v) => {
 	const [v0, v1, v2, v3] = toRows$1(m);
-	return make$6(dot$2(v0, v), dot$2(v1, v), dot$2(v2, v), dot$2(v3, v));
+	return make$2(dot(v0, v), dot(v1, v), dot(v2, v), dot(v3, v));
 });
 /** @internal */
 const vectorProductRight$1 = dual(2, (m, v) => {
 	const [v0, v1, v2, v3] = toColumns$1(m);
-	return make$6(dot$2(v, v0), dot$2(v, v1), dot$2(v, v2), dot$2(v, v3));
+	return make$2(dot(v, v0), dot(v, v1), dot(v, v2), dot(v, v3));
 });
 /** @internal */
 const multiply$1 = dual(2, (a, b) => new Matrix4x4Impl(a.m00 * b.m00 + a.m01 * b.m10 + a.m02 * b.m20 + a.m03 * b.m30, a.m00 * b.m01 + a.m01 * b.m11 + a.m02 * b.m21 + a.m03 * b.m31, a.m00 * b.m02 + a.m01 * b.m12 + a.m02 * b.m22 + a.m03 * b.m32, a.m00 * b.m03 + a.m01 * b.m13 + a.m02 * b.m23 + a.m03 * b.m33, a.m10 * b.m00 + a.m11 * b.m10 + a.m12 * b.m20 + a.m13 * b.m30, a.m10 * b.m01 + a.m11 * b.m11 + a.m12 * b.m21 + a.m13 * b.m31, a.m10 * b.m02 + a.m11 * b.m12 + a.m12 * b.m22 + a.m13 * b.m32, a.m10 * b.m03 + a.m11 * b.m13 + a.m12 * b.m23 + a.m13 * b.m33, a.m20 * b.m00 + a.m21 * b.m10 + a.m22 * b.m20 + a.m23 * b.m30, a.m20 * b.m01 + a.m21 * b.m11 + a.m22 * b.m21 + a.m23 * b.m31, a.m20 * b.m02 + a.m21 * b.m12 + a.m22 * b.m22 + a.m23 * b.m32, a.m20 * b.m03 + a.m21 * b.m13 + a.m22 * b.m23 + a.m23 * b.m33, a.m30 * b.m00 + a.m31 * b.m10 + a.m32 * b.m20 + a.m33 * b.m30, a.m30 * b.m01 + a.m31 * b.m11 + a.m32 * b.m21 + a.m33 * b.m31, a.m30 * b.m02 + a.m31 * b.m12 + a.m32 * b.m22 + a.m33 * b.m32, a.m30 * b.m03 + a.m31 * b.m13 + a.m32 * b.m23 + a.m33 * b.m33));
+const singularityThreshold = (m) => RELATIVE_TOLERANCE * Math.hypot(m.m00, m.m01, m.m02, m.m03) * Math.hypot(m.m10, m.m11, m.m12, m.m13) * Math.hypot(m.m20, m.m21, m.m22, m.m23) * Math.hypot(m.m30, m.m31, m.m32, m.m33);
 /** @internal */
-const inverse$1 = (m) => {
-	const det = determinant$1(m);
-	invariant(det !== 0, "cannot invert singular matrix");
+const isInvertible$1 = (m) => Math.abs(determinant$1(m)) > singularityThreshold(m);
+/** @internal */
+const asInvertible$1 = (m) => {
+	invariant(isInvertible$1(m), "matrix4x4 is not invertible");
+	return m;
+};
+const buildInverse = (m, det) => {
 	const inv = 1 / det;
 	const cof = (row, col) => {
 		return ((row + col) % 2 === 0 ? 1 : -1) * determinant$2(minor$1(m, row, col)) * inv;
@@ -299,24 +111,36 @@ const inverse$1 = (m) => {
 	return new Matrix4x4Impl(cof(0, 0), cof(1, 0), cof(2, 0), cof(3, 0), cof(0, 1), cof(1, 1), cof(2, 1), cof(3, 1), cof(0, 2), cof(1, 2), cof(2, 2), cof(3, 2), cof(0, 3), cof(1, 3), cof(2, 3), cof(3, 3));
 };
 /** @internal */
+const inverse$1 = (m) => {
+	const det = determinant$1(m);
+	if (Math.abs(det) <= singularityThreshold(m)) return none;
+	return one(buildInverse(m, det));
+};
+/** @internal */
+const inverseUnsafe$1 = (m) => {
+	const det = determinant$1(m);
+	invariant(Math.abs(det) > singularityThreshold(m), "cannot invert singular matrix");
+	return buildInverse(m, det);
+};
+/** @internal */
 const solveSystem$1 = dual(2, (m, v) => {
 	const inverseDeterminant = 1 / determinant$1(m);
 	invariant(Number.isFinite(inverseDeterminant), "cannot solve system when coefficient matrix determinant is zero");
-	return make$6(determinant$1(setColumn$1(m, 0, v)) * inverseDeterminant, determinant$1(setColumn$1(m, 1, v)) * inverseDeterminant, determinant$1(setColumn$1(m, 2, v)) * inverseDeterminant, determinant$1(setColumn$1(m, 3, v)) * inverseDeterminant);
+	return make$2(determinant$1(setColumn$1(m, 0, v)) * inverseDeterminant, determinant$1(setColumn$1(m, 1, v)) * inverseDeterminant, determinant$1(setColumn$1(m, 2, v)) * inverseDeterminant, determinant$1(setColumn$1(m, 3, v)) * inverseDeterminant);
 });
 /** @internal */
 const toRows$1 = (m) => [
-	make$6(m.m00, m.m01, m.m02, m.m03),
-	make$6(m.m10, m.m11, m.m12, m.m13),
-	make$6(m.m20, m.m21, m.m22, m.m23),
-	make$6(m.m30, m.m31, m.m32, m.m33)
+	make$2(m.m00, m.m01, m.m02, m.m03),
+	make$2(m.m10, m.m11, m.m12, m.m13),
+	make$2(m.m20, m.m21, m.m22, m.m23),
+	make$2(m.m30, m.m31, m.m32, m.m33)
 ];
 /** @internal */
 const toColumns$1 = (m) => [
-	make$6(m.m00, m.m10, m.m20, m.m30),
-	make$6(m.m01, m.m11, m.m21, m.m31),
-	make$6(m.m02, m.m12, m.m22, m.m32),
-	make$6(m.m03, m.m13, m.m23, m.m33)
+	make$2(m.m00, m.m10, m.m20, m.m30),
+	make$2(m.m01, m.m11, m.m21, m.m31),
+	make$2(m.m02, m.m12, m.m22, m.m32),
+	make$2(m.m03, m.m13, m.m23, m.m33)
 ];
 /** @internal */
 const rowVector$1 = dual(2, (m, row) => toRows$1(m)[toFourDimensionalIndex(row)]);
@@ -337,6 +161,7 @@ const reverseColumns$1 = (m) => {
 //#endregion
 //#region src/matrix/matrix4x4.ts
 var matrix4x4_exports = /* @__PURE__ */ __exportAll({
+	asInvertible: () => asInvertible,
 	columnVector: () => columnVector,
 	determinant: () => determinant,
 	equals: () => equals,
@@ -344,6 +169,8 @@ var matrix4x4_exports = /* @__PURE__ */ __exportAll({
 	fromRows: () => fromRows,
 	identity: () => identity,
 	inverse: () => inverse,
+	inverseUnsafe: () => inverseUnsafe,
+	isInvertible: () => isInvertible,
 	isMatrix4x4: () => isMatrix4x4,
 	make: () => make,
 	minor: () => minor,
@@ -440,16 +267,38 @@ const minor = minor$1;
 const vectorProductLeft = vectorProductLeft$1;
 const vectorProductRight = vectorProductRight$1;
 const multiply = multiply$1;
+const inverse = inverse$1;
 /**
-* Returns the inverse of a `Matrix4x4`.
-*
-* Throws when the matrix is singular (determinant is zero).
+* Returns the inverse of a `Matrix4x4`. Throws when the matrix is singular
+* (determinant approximately zero). Useful when you've already validated
+* invertibility out-of-band and want the unwrapped matrix directly; otherwise
+* prefer {@link inverse}.
 *
 * @param m - The matrix to invert.
 * @returns The inverse matrix.
-* @since 1.1.0
+* @throws If `m` is singular.
+* @since 2.0.0
 */
-const inverse = inverse$1;
+const inverseUnsafe = inverseUnsafe$1;
+/**
+* Type-narrowing predicate: refines a `Matrix4x4<T>` to
+* `Matrix4x4<T & Invertible>` when the matrix's determinant is non-zero
+* (within the default absolute tolerance).
+*
+* @param m - The matrix to check.
+* @returns `true` when `m` is invertible.
+* @since 2.0.0
+*/
+const isInvertible = isInvertible$1;
+/**
+* Asserts that the matrix is invertible, throwing on a singular matrix.
+*
+* @param m - The matrix to assert against.
+* @returns The same matrix, typed with the `Invertible` brand.
+* @throws When `m` is singular.
+* @since 2.0.0
+*/
+const asInvertible = asInvertible$1;
 const solveSystem = solveSystem$1;
 /**
 * Returns the rows of a `Matrix4x4` as an array of vectors.
@@ -494,6 +343,6 @@ const reverseRows = reverseRows$1;
 */
 const reverseColumns = reverseColumns$1;
 //#endregion
-export { isMatrix2x2 as A, transpose$3 as B, vectorProductLeft$2 as C, equals$3 as D, determinant$3 as E, setColumn$3 as F, vectorProductRight$3 as H, setRow$3 as I, solveSystem$3 as L, reverseColumns$3 as M, reverseRows$3 as N, fromColumns$3 as O, rowVector$3 as P, toColumns$3 as R, transpose$2 as S, columnVector$3 as T, vectorProductLeft$3 as V, setColumn$2 as _, vectorProductLeft as a, toColumns$2 as b, equals$2 as c, isMatrix3x3 as d, make$2 as f, rowVector$2 as g, reverseRows$2 as h, multiply as i, make$3 as j, fromRows$3 as k, fromColumns$2 as l, reverseColumns$2 as m, make as n, columnVector$2 as o, minor$2 as p, matrix4x4_exports as r, determinant$2 as s, inverse as t, fromRows$2 as u, setRow$2 as v, vectorProductRight$2 as w, toRows$2 as x, solveSystem$2 as y, toRows$3 as z };
+export { vectorProductLeft as a, multiply as i, make as n, matrix4x4_exports as r, inverseUnsafe as t };
 
-//# sourceMappingURL=matrix4x4-BWmf4lZM.mjs.map
+//# sourceMappingURL=matrix4x4-BrqgYZCD.mjs.map

package/dist/shared/matrix4x4-BrqgYZCD.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"matrix4x4-BrqgYZCD.mjs","names":["isMatrix4x4","equals","identity","make","fromRows","fromColumns","setRow","toRows","setColumn","toColumns","determinant","matrix3x3.determinant","minor","vector4.components","matrix3x3.make","vectorProductLeft","vector4.make","vector4.dot","vectorProductRight","multiply","isInvertible","asInvertible","inverse","Solution.none","Solution.one","inverseUnsafe","solveSystem","rowVector","columnVector","transpose","reverseRows","reverseColumns","internal.isMatrix4x4","internal.identity","internal.equals","internal.make","internal.fromRows","internal.fromColumns","internal.setRow","internal.setColumn","internal.determinant","internal.minor","internal.vectorProductLeft","internal.vectorProductRight","internal.multiply","internal.inverse","internal.inverseUnsafe","internal.isInvertible","internal.asInvertible","internal.solveSystem","internal.toRows","internal.toColumns","internal.rowVector","internal.columnVector","internal.transpose","internal.reverseRows","internal.reverseColumns"],"sources":["../../src/matrix/matrix4x4.internal.ts","../../src/matrix/matrix4x4.ts"],"sourcesContent":["import { toFourDimensionalIndex } from '../dimensions.ts'\nimport { dual, Pipeable } from '../utils.ts'\nimport { invariant } from '../utils.ts'\nimport { coincident, RELATIVE_TOLERANCE } from '../number.ts'\nimport * as Solution from '../solution/solution.ts'\nimport type { Vector4 } from '../vector/vector4.ts'\nimport * as vector4 from '../vector/vector4.internal.ts'\nimport type { Matrix3x3 } from './matrix3x3.ts'\nimport * as matrix3x3 from './matrix3x3.internal.ts'\nimport type { Matrix4x4, Matrix4x4Coordinate } from './matrix4x4.ts'\nimport type { Invertible } from './traits.ts'\nimport { MatrixTraits } from './traits.ts'\n\nexport const Matrix4x4TypeId: unique symbol = Symbol.for('curvy/matrix4x4')\nexport type Matrix4x4TypeId = typeof Matrix4x4TypeId\n\nclass Matrix4x4Impl extends Pipeable implements Matrix4x4<unknown> {\n  readonly [Matrix4x4TypeId]: Matrix4x4TypeId = Matrix4x4TypeId\n  declare readonly [MatrixTraits]: unknown\n\n  readonly m00: number\n  readonly m01: number\n  readonly m02: number\n  readonly m03: number\n\n  readonly m10: number\n  readonly m11: number\n  readonly m12: number\n  readonly m13: number\n\n  readonly m20: number\n  readonly m21: number\n  readonly m22: number\n  readonly m23: number\n\n  readonly m30: number\n  readonly m31: number\n  readonly m32: number\n  readonly m33: number\n\n  constructor(\n    m00 = 0,\n    m01 = m00,\n    m02 = m01,\n    m03 = m02,\n    m10 = m00,\n    m11 = m01,\n    m12 = m02,\n    m13 = m03,\n    m20 = m00,\n    m21 = m01,\n    m22 = m02,\n    m23 = m03,\n    m30 = m00,\n    m31 = m01,\n    m32 = m02,\n    m33 = m03,\n  ) {\n    super()\n\n    this.m00 = m00\n    this.m01 = m01\n    this.m02 = m02\n    this.m03 = m03\n    this.m10 = m10\n    this.m11 = m11\n    this.m12 = m12\n    this.m13 = m13\n    this.m20 = m20\n    this.m21 = m21\n    this.m22 = m22\n    this.m23 = m23\n    this.m30 = m30\n    this.m31 = m31\n    this.m32 = m32\n    this.m33 = m33\n  }\n\n  get [Symbol.toStringTag]() {\n    return `Matrix4x4(${this.m00}, ${this.m01}, ${this.m02}, ${this.m03}, ${this.m10}, ${this.m11}, ${this.m12}, ${this.m13}, ${this.m20}, ${this.m21}, ${this.m22}, ${this.m23}, ${this.m30}, ${this.m31}, ${this.m32}, ${this.m33})`\n  }\n\n  get [Symbol.for('nodejs.util.inspect.custom')]() {\n    return `Matrix4x4(${this.m00}, ${this.m01}, ${this.m02}, ${this.m03}, ${this.m10}, ${this.m11}, ${this.m12}, ${this.m13}, ${this.m20}, ${this.m21}, ${this.m22}, ${this.m23}, ${this.m30}, ${this.m31}, ${this.m32}, ${this.m33})`\n  }\n\n  [Symbol.hasInstance](m: unknown): m is Matrix4x4 {\n    return isMatrix4x4(m)\n  }\n}\n\n/** @internal */\nexport const isMatrix4x4 = (m: unknown): m is Matrix4x4 =>\n  typeof m === 'object' && m !== null && Matrix4x4TypeId in m\n\n/** @internal */\nexport const equals = dual<\n  (b: Matrix4x4) => (a: Matrix4x4) => boolean,\n  (a: Matrix4x4, b: Matrix4x4) => boolean\n>(\n  2,\n  (a: Matrix4x4, b: Matrix4x4) =>\n    coincident(a.m00, b.m00) &&\n    coincident(a.m01, b.m01) &&\n    coincident(a.m02, b.m02) &&\n    coincident(a.m03, b.m03) &&\n    coincident(a.m10, b.m10) &&\n    coincident(a.m11, b.m11) &&\n    coincident(a.m12, b.m12) &&\n    coincident(a.m13, b.m13) &&\n    coincident(a.m20, b.m20) &&\n    coincident(a.m21, b.m21) &&\n    coincident(a.m22, b.m22) &&\n    coincident(a.m23, b.m23) &&\n    coincident(a.m30, b.m30) &&\n    coincident(a.m31, b.m31) &&\n    coincident(a.m32, b.m32) &&\n    coincident(a.m33, b.m33),\n)\n\n/**\n * The 4x4 identity matrix.\n * @internal\n */\nexport const identity: Matrix4x4 = new Matrix4x4Impl(1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1)\n\n// first four arguments are the top row\n/** @internal */\nexport const make = (\n  m00 = 0,\n  m01 = m00,\n  m02 = m01,\n  m03 = m02,\n  m10 = m00,\n  m11 = m01,\n  m12 = m02,\n  m13 = m03,\n  m20 = m00,\n  m21 = m01,\n  m22 = m02,\n  m23 = m03,\n  m30 = m00,\n  m31 = m01,\n  m32 = m02,\n  m33 = m03,\n) =>\n  new Matrix4x4Impl(m00, m01, m02, m03, m10, m11, m12, m13, m20, m21, m22, m23, m30, m31, m32, m33)\n\n/** @internal */\nexport const fromRows = (v0: Vector4, v1: Vector4, v2: Vector4, v3: Vector4) =>\n  new Matrix4x4Impl(\n    v0.x,\n    v0.y,\n    v0.z,\n    v0.w,\n    v1.x,\n    v1.y,\n    v1.z,\n    v1.w,\n    v2.x,\n    v2.y,\n    v2.z,\n    v2.w,\n    v3.x,\n    v3.y,\n    v3.z,\n    v3.w,\n  )\n\n/** @internal */\nexport const fromColumns = (v0: Vector4, v1: Vector4, v2: Vector4, v3: Vector4) =>\n  new Matrix4x4Impl(\n    v0.x,\n    v1.x,\n    v2.x,\n    v3.x,\n    v0.y,\n    v1.y,\n    v2.y,\n    v3.y,\n    v0.z,\n    v1.z,\n    v2.z,\n    v3.z,\n    v0.w,\n    v1.w,\n    v2.w,\n    v3.w,\n  )\n\n/** @internal */\nexport const setRow = dual<\n  (row: Matrix4x4Coordinate, v: Vector4) => (m: Matrix4x4) => Matrix4x4,\n  (m: Matrix4x4, row: Matrix4x4Coordinate, v: Vector4) => Matrix4x4\n>(3, (m: Matrix4x4, row: Matrix4x4Coordinate, v: Vector4) =>\n  fromRows(\n    ...(toRows(m).with(toFourDimensionalIndex(row), v) as [Vector4, Vector4, Vector4, Vector4]),\n  ),\n)\n\n/** @internal */\nexport const setColumn = dual<\n  (column: Matrix4x4Coordinate, v: Vector4) => (m: Matrix4x4) => Matrix4x4,\n  (m: Matrix4x4, column: Matrix4x4Coordinate, v: Vector4) => Matrix4x4\n>(3, (m: Matrix4x4, column: Matrix4x4Coordinate, v: Vector4) =>\n  fromColumns(\n    ...(toColumns(m).with(toFourDimensionalIndex(column), v) as [\n      Vector4,\n      Vector4,\n      Vector4,\n      Vector4,\n    ]),\n  ),\n)\n\n/** @internal */\nexport const determinant = (m: Matrix4x4) =>\n  m.m00 * matrix3x3.determinant(minor(m, 0, 0)) -\n  m.m01 * matrix3x3.determinant(minor(m, 0, 1)) +\n  m.m02 * matrix3x3.determinant(minor(m, 0, 2)) -\n  m.m03 * matrix3x3.determinant(minor(m, 0, 3))\n\n/** @internal */\nexport const minor = dual<\n  (row: Matrix4x4Coordinate, column: Matrix4x4Coordinate) => (m: Matrix4x4) => Matrix3x3,\n  (m: Matrix4x4, row: Matrix4x4Coordinate, column: Matrix4x4Coordinate) => Matrix3x3\n>(3, (m: Matrix4x4, row: Matrix4x4Coordinate, column: Matrix4x4Coordinate) => {\n  const [v0, v1, v2] = toRows(m).toSpliced(toFourDimensionalIndex(row), 1) as [\n    Vector4,\n    Vector4,\n    Vector4,\n  ]\n  const columnIndex = toFourDimensionalIndex(column)\n  const [m00, m01, m02] = vector4.components(v0).toSpliced(columnIndex, 1) as [\n    number,\n    number,\n    number,\n  ]\n  const [m10, m11, m12] = vector4.components(v1).toSpliced(columnIndex, 1) as [\n    number,\n    number,\n    number,\n  ]\n  const [m20, m21, m22] = vector4.components(v2).toSpliced(columnIndex, 1) as [\n    number,\n    number,\n    number,\n  ]\n\n  return matrix3x3.make(m00, m01, m02, m10, m11, m12, m20, m21, m22)\n})\n\n/** @internal */\nexport const vectorProductLeft = dual<\n  (v: Vector4) => (m: Matrix4x4) => Vector4,\n  (m: Matrix4x4, v: Vector4) => Vector4\n>(2, (m: Matrix4x4, v: Vector4) => {\n  const [v0, v1, v2, v3] = toRows(m) as [Vector4, Vector4, Vector4, Vector4]\n  return vector4.make(\n    vector4.dot(v0, v),\n    vector4.dot(v1, v),\n    vector4.dot(v2, v),\n    vector4.dot(v3, v),\n  )\n})\n\n/** @internal */\nexport const vectorProductRight = dual<\n  (v: Vector4) => (m: Matrix4x4) => Vector4,\n  (m: Matrix4x4, v: Vector4) => Vector4\n>(2, (m: Matrix4x4, v: Vector4) => {\n  const [v0, v1, v2, v3] = toColumns(m) as [Vector4, Vector4, Vector4, Vector4]\n\n  return vector4.make(\n    vector4.dot(v, v0),\n    vector4.dot(v, v1),\n    vector4.dot(v, v2),\n    vector4.dot(v, v3),\n  )\n})\n\n/** @internal */\nexport const multiply = dual<\n  (b: Matrix4x4) => (a: Matrix4x4) => Matrix4x4,\n  (a: Matrix4x4, b: Matrix4x4) => Matrix4x4\n>(\n  2,\n  (a: Matrix4x4, b: Matrix4x4) =>\n    new Matrix4x4Impl(\n      a.m00 * b.m00 + a.m01 * b.m10 + a.m02 * b.m20 + a.m03 * b.m30,\n      a.m00 * b.m01 + a.m01 * b.m11 + a.m02 * b.m21 + a.m03 * b.m31,\n      a.m00 * b.m02 + a.m01 * b.m12 + a.m02 * b.m22 + a.m03 * b.m32,\n      a.m00 * b.m03 + a.m01 * b.m13 + a.m02 * b.m23 + a.m03 * b.m33,\n      a.m10 * b.m00 + a.m11 * b.m10 + a.m12 * b.m20 + a.m13 * b.m30,\n      a.m10 * b.m01 + a.m11 * b.m11 + a.m12 * b.m21 + a.m13 * b.m31,\n      a.m10 * b.m02 + a.m11 * b.m12 + a.m12 * b.m22 + a.m13 * b.m32,\n      a.m10 * b.m03 + a.m11 * b.m13 + a.m12 * b.m23 + a.m13 * b.m33,\n      a.m20 * b.m00 + a.m21 * b.m10 + a.m22 * b.m20 + a.m23 * b.m30,\n      a.m20 * b.m01 + a.m21 * b.m11 + a.m22 * b.m21 + a.m23 * b.m31,\n      a.m20 * b.m02 + a.m21 * b.m12 + a.m22 * b.m22 + a.m23 * b.m32,\n      a.m20 * b.m03 + a.m21 * b.m13 + a.m22 * b.m23 + a.m23 * b.m33,\n      a.m30 * b.m00 + a.m31 * b.m10 + a.m32 * b.m20 + a.m33 * b.m30,\n      a.m30 * b.m01 + a.m31 * b.m11 + a.m32 * b.m21 + a.m33 * b.m31,\n      a.m30 * b.m02 + a.m31 * b.m12 + a.m32 * b.m22 + a.m33 * b.m32,\n      a.m30 * b.m03 + a.m31 * b.m13 + a.m32 * b.m23 + a.m33 * b.m33,\n    ),\n)\n\n// Singularity threshold relative to the matrix's own scale, via Hadamard's\n// bound |det| ≤ Π row norms. See the Matrix3x3 counterpart for the rationale.\nconst singularityThreshold = (m: Matrix4x4): number =>\n  RELATIVE_TOLERANCE *\n  Math.hypot(m.m00, m.m01, m.m02, m.m03) *\n  Math.hypot(m.m10, m.m11, m.m12, m.m13) *\n  Math.hypot(m.m20, m.m21, m.m22, m.m23) *\n  Math.hypot(m.m30, m.m31, m.m32, m.m33)\n\n/** @internal */\nexport const isInvertible = <T>(m: Matrix4x4<T>): m is Matrix4x4<T & Invertible> =>\n  Math.abs(determinant(m)) > singularityThreshold(m)\n\n/** @internal */\nexport const asInvertible = <T>(m: Matrix4x4<T>): Matrix4x4<T & Invertible> => {\n  invariant(isInvertible(m), 'matrix4x4 is not invertible')\n  return m\n}\n\nconst buildInverse = (m: Matrix4x4, det: number): Matrix4x4 => {\n  const inv = 1 / det\n  // adjugate is the transpose of the cofactor matrix\n  const cof = (row: Matrix4x4Coordinate, col: Matrix4x4Coordinate) => {\n    const sign = ((row as number) + (col as number)) % 2 === 0 ? 1 : -1\n    return sign * matrix3x3.determinant(minor(m, row, col)) * inv\n  }\n\n  return new Matrix4x4Impl(\n    cof(0, 0),\n    cof(1, 0),\n    cof(2, 0),\n    cof(3, 0),\n    cof(0, 1),\n    cof(1, 1),\n    cof(2, 1),\n    cof(3, 1),\n    cof(0, 2),\n    cof(1, 2),\n    cof(2, 2),\n    cof(3, 2),\n    cof(0, 3),\n    cof(1, 3),\n    cof(2, 3),\n    cof(3, 3),\n  )\n}\n\n// On `Invertible`-branded matrices the empty branch is provably unreachable,\n// but TS can't see that — the cast at the public overload pairs the type-level\n// promise with the runtime brand check.\n/** @internal */\nexport const inverse = <T>(m: Matrix4x4<T>): Solution.AtMostOne<Matrix4x4<T>> => {\n  const det = determinant(m)\n  if (Math.abs(det) <= singularityThreshold(m)) {\n    return Solution.none\n  }\n  return Solution.one(buildInverse(m, det) as Matrix4x4<T>)\n}\n\n/** @internal */\nexport const inverseUnsafe = (m: Matrix4x4): Matrix4x4 => {\n  const det = determinant(m)\n  invariant(Math.abs(det) > singularityThreshold(m), 'cannot invert singular matrix')\n  return buildInverse(m, det)\n}\n\n/** @internal */\nexport const solveSystem = dual<\n  (v: Vector4) => (m: Matrix4x4) => Vector4,\n  (m: Matrix4x4, v: Vector4) => Vector4\n>(2, (m: Matrix4x4, v: Vector4) => {\n  const inverseDeterminant = 1 / determinant(m)\n\n  invariant(\n    Number.isFinite(inverseDeterminant),\n    'cannot solve system when coefficient matrix determinant is zero',\n  )\n\n  return vector4.make(\n    determinant(setColumn(m, 0, v)) * inverseDeterminant,\n    determinant(setColumn(m, 1, v)) * inverseDeterminant,\n    determinant(setColumn(m, 2, v)) * inverseDeterminant,\n    determinant(setColumn(m, 3, v)) * inverseDeterminant,\n  )\n})\n\n/** @internal */\nexport const toRows = (m: Matrix4x4) =>\n  [\n    vector4.make(m.m00, m.m01, m.m02, m.m03),\n    vector4.make(m.m10, m.m11, m.m12, m.m13),\n    vector4.make(m.m20, m.m21, m.m22, m.m23),\n    vector4.make(m.m30, m.m31, m.m32, m.m33),\n  ] as const\n\n/** @internal */\nexport const toColumns = (m: Matrix4x4) =>\n  [\n    vector4.make(m.m00, m.m10, m.m20, m.m30),\n    vector4.make(m.m01, m.m11, m.m21, m.m31),\n    vector4.make(m.m02, m.m12, m.m22, m.m32),\n    vector4.make(m.m03, m.m13, m.m23, m.m33),\n  ] as const\n\n/** @internal */\nexport const rowVector = dual<\n  (row: Matrix4x4Coordinate) => (m: Matrix4x4) => Vector4,\n  (m: Matrix4x4, row: Matrix4x4Coordinate) => Vector4\n>(2, (m: Matrix4x4, row: Matrix4x4Coordinate) => toRows(m)[toFourDimensionalIndex(row)])\n\n/** @internal */\nexport const columnVector = dual<\n  (column: Matrix4x4Coordinate) => (m: Matrix4x4) => Vector4,\n  (m: Matrix4x4, column: Matrix4x4Coordinate) => Vector4\n>(2, (m: Matrix4x4, column: Matrix4x4Coordinate) => toColumns(m)[toFourDimensionalIndex(column)])\n\n/** @internal */\nexport const transpose = (m: Matrix4x4) => fromColumns(...toRows(m)) as Matrix4x4\n\n/** @internal */\nexport const reverseRows = (m: Matrix4x4) => {\n  const [v0, v1, v2, v3] = toRows(m) as [Vector4, Vector4, Vector4, Vector4]\n  return fromRows(v3, v2, v1, v0)\n}\n\n/** @internal */\nexport const reverseColumns = (m: Matrix4x4) => {\n  const [v0, v1, v2, v3] = toColumns(m) as [Vector4, Vector4, Vector4, Vector4]\n  return fromColumns(v3, v2, v1, v0)\n}\n","import type { FourDimensionalComponent, FourDimensionalIndex } from '../dimensions.ts'\nimport type * as Solution from '../solution/solution.ts'\nimport type { Pipeable } from '../utils.ts'\nimport type { Vector4 } from '../vector/vector4.ts'\nimport type { Matrix3x3 } from './matrix3x3.ts'\nimport type { Matrix4x4TypeId } from './matrix4x4.internal.ts'\nimport * as internal from './matrix4x4.internal.ts'\nimport type { Invertible, MatrixTraits } from './traits.ts'\n\nexport type { Invertible } from './traits.ts'\n\n/**\n * A coordinate in a 4x4 matrix.\n *\n * @since 1.0.0\n */\nexport type Matrix4x4Coordinate = FourDimensionalIndex | FourDimensionalComponent\n\n/**\n * A 4x4 matrix.\n *\n * All fields are readonly and immutable, and all operations create new instances.\n *\n * The `Traits` type parameter is a phantom marker that accumulates trait\n * brands as the matrix is refined via `isInvertible` / `asInvertible`. The\n * runtime value carries no trait data — `Traits` only flows through the type\n * system to enable tighter return types on operations like {@link inverse}.\n *\n * @since 1.0.0\n */\nexport interface Matrix4x4<out Traits = unknown> extends Pipeable {\n  readonly [Matrix4x4TypeId]: Matrix4x4TypeId\n  readonly [MatrixTraits]: Traits\n\n  /**\n   * The value of the first row and first column.\n   */\n  readonly m00: number\n  /**\n   * The value of the first row and second column.\n   */\n  readonly m01: number\n  /**\n   * The value of the first row and third column.\n   */\n  readonly m02: number\n  /**\n   * The value of the first row and fourth column.\n   */\n  readonly m03: number\n  /**\n   * The value of the second row and first column.\n   */\n  readonly m10: number\n  /**\n   * The value of the second row and second column.\n   */\n  readonly m11: number\n  /**\n   * The value of the second row and third column.\n   */\n  readonly m12: number\n  /**\n   * The value of the second row and fourth column.\n   */\n  readonly m13: number\n  /**\n   * The value of the third row and first column.\n   */\n  readonly m20: number\n  /**\n   * The value of the third row and second column.\n   */\n  readonly m21: number\n  /**\n   * The value of the third row and third column.\n   */\n  readonly m22: number\n  /**\n   * The value of the third row and fourth column.\n   */\n  readonly m23: number\n  /**\n   * The value of the fourth row and first column.\n   */\n  readonly m30: number\n  /**\n   * The value of the fourth row and second column.\n   */\n  readonly m31: number\n  /**\n   * The value of the fourth row and third column.\n   */\n  readonly m32: number\n  /**\n   * The value of the fourth row and fourth column.\n   */\n  readonly m33: number\n}\n\n/**\n * Checks if a value is a `Matrix4x4`.\n *\n * @param m - The value to check.\n * @returns `true` if the value is a `Matrix4x4`, `false` otherwise.\n * @since 1.0.0\n */\nexport const isMatrix4x4: (m: unknown) => m is Matrix4x4 = internal.isMatrix4x4\n\n/**\n * The 4x4 identity matrix.\n *\n * @since 1.1.0\n */\nexport const identity: Matrix4x4 = internal.identity\n\nexport const equals: {\n  /**\n   * Checks if two `Matrix4x4` instances are approximately equal within the\n   * default absolute tolerance ({@link EPSILON}).\n   *\n   * @param a - The first matrix.\n   * @param b - The second matrix.\n   * @returns `true` when each pair of components is within tolerance.\n   * @since 1.1.0\n   */\n  (a: Matrix4x4, b: Matrix4x4): boolean\n  /**\n   * Checks if two `Matrix4x4` instances are approximately equal within the\n   * default absolute tolerance ({@link EPSILON}).\n   *\n   * @param b - The second matrix.\n   * @returns A function that takes the first matrix and returns the comparison result.\n   * @since 1.1.0\n   */\n  (b: Matrix4x4): (a: Matrix4x4) => boolean\n} = internal.equals\n\n/**\n * Creates a new `Matrix4x4` instance.\n *\n * @param m00 - The value of the first row and first column.\n * @param m01 - The value of the first row and second column.\n * @param m02 - The value of the first row and third column.\n * @param m03 - The value of the first row and fourth column.\n * @param m10 - The value of the second row and first column.\n * @param m11 - The value of the second row and second column.\n * @param m12 - The value of the second row and third column.\n * @param m13 - The value of the second row and fourth column.\n * @param m20 - The value of the third row and first column.\n * @param m21 - The value of the third row and second column.\n * @param m22 - The value of the third row and third column.\n * @param m23 - The value of the third row and fourth column.\n * @param m30 - The value of the fourth row and first column.\n * @param m31 - The value of the fourth row and second column.\n * @param m32 - The value of the fourth row and third column.\n * @param m33 - The value of the fourth row and fourth column.\n * @returns A new `Matrix4x4` instance.\n * @since 1.0.0\n */\nexport const make: (\n  m00?: number,\n  m01?: number,\n  m02?: number,\n  m03?: number,\n  m10?: number,\n  m11?: number,\n  m12?: number,\n  m13?: number,\n  m20?: number,\n  m21?: number,\n  m22?: number,\n  m23?: number,\n  m30?: number,\n  m31?: number,\n  m32?: number,\n  m33?: number,\n) => Matrix4x4 = internal.make\n\n/**\n * Creates a new `Matrix4x4` instance from four row vectors.\n *\n * @param v0 - The first row vector.\n * @param v1 - The second row vector.\n * @param v2 - The third row vector.\n * @param v3 - The fourth row vector.\n * @returns A new `Matrix4x4` instance.\n * @since 1.0.0\n */\nexport const fromRows: (v0: Vector4, v1: Vector4, v2: Vector4, v3: Vector4) => Matrix4x4 =\n  internal.fromRows\n\n/**\n * Creates a new `Matrix4x4` instance from four column vectors.\n *\n * @param v0 - The first column vector.\n * @param v1 - The second column vector.\n * @param v2 - The third column vector.\n * @param v3 - The fourth column vector.\n */\nexport const fromColumns: (v0: Vector4, v1: Vector4, v2: Vector4, v3: Vector4) => Matrix4x4 =\n  internal.fromColumns\n\nexport const setRow: {\n  /**\n   * Sets a row of a `Matrix4x4` to a new vector.\n   *\n   * @param m - The matrix to modify.\n   * @param row - The row to set.\n   * @param v - The new vector.\n   * @returns A new `Matrix4x4` instance with the specified row set to the new vector.\n   * @since 1.0.0\n   */\n  (m: Matrix4x4, row: Matrix4x4Coordinate, v: Vector4): Matrix4x4\n  /**\n   * Sets a row of a `Matrix4x4` to a new vector.\n   *\n   * @param row - The row to set.\n   * @param v - The new vector.\n   * @returns A function that takes a matrix and returns a new `Matrix4x4` instance with the specified row set to the new vector.\n   * @since 1.0.0\n   */\n  (row: Matrix4x4Coordinate, v: Vector4): (m: Matrix4x4) => Matrix4x4\n} = internal.setRow\n\nexport const setColumn: {\n  /**\n   * Sets a column of a `Matrix4x4` to a new vector.\n   *\n   * @param m - The matrix to modify.\n   * @param column - The column to set.\n   * @param v - The new vector.\n   * @returns A new `Matrix4x4` instance with the specified column set to the new vector.\n   * @since 1.0.0\n   */\n  (m: Matrix4x4, column: Matrix4x4Coordinate, v: Vector4): Matrix4x4\n  /**\n   * Sets a column of a `Matrix4x4` to a new vector.\n   *\n   * @param column - The column to set.\n   * @param v - The new vector.\n   * @returns A function that takes a matrix and returns a new `Matrix4x4` instance with the specified column set to the new vector.\n   * @since 1.0.0\n   */\n  (column: Matrix4x4Coordinate, v: Vector4): (m: Matrix4x4) => Matrix4x4\n} = internal.setColumn\n\n/**\n * Calculates the determinant of a `Matrix4x4`.\n *\n * @param m - The matrix to calculate the determinant of.\n * @returns The determinant of the matrix.\n * @since 1.0.0\n */\nexport const determinant: (m: Matrix4x4) => number = internal.determinant\n\n/**\n * Calculates the minor of a `Matrix4x4` at a given row and column.\n *\n * @param m - The matrix to calculate the minor of.\n * @param row - The row to exclude.\n * @param column - The column to exclude.\n * @returns The minor of the matrix at the given row and column.\n */\nexport const minor: (\n  m: Matrix4x4,\n  row: Matrix4x4Coordinate,\n  column: Matrix4x4Coordinate,\n) => Matrix3x3 = internal.minor\n\nexport const vectorProductLeft: {\n  /**\n   * Calculates the left vector product of a `Matrix4x4` and a `Vector4`.\n   *\n   * @example\n   * ```ts\n   * import * as Matrix4x4 from 'curvy/matrix4x4'\n   * import * as Vector4 from 'curvy/vector4'\n   *\n   * const m = Matrix4x4.make(1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16)\n   * const v = Vector4.make(17, 18, 19, 20)\n   *\n   * // Result:\n   * // x = 1 * 17 + 2 * 18 + 3 * 19 + 4 * 20\n   * // y = 5 * 17 + 6 * 18 + 7 * 19 + 8 * 20\n   * // z = 9 * 17 + 10 * 18 + 11 * 19 + 12 * 20\n   * // w = 13 * 17 + 14 * 18 + 15 * 19 + 16 * 20\n   * const result = Matrix4x4.vectorProductLeft(m, v)\n   * ```\n   * @param m - The matrix to multiply.\n   * @param v - The vector to multiply.\n   * @returns The resulting vector.\n   * @since 1.0.0\n   */\n  (m: Matrix4x4, v: Vector4): Vector4\n  /**\n   * Calculates the left vector product of a `Matrix4x4` and a `Vector4`.\n   *\n   * @example\n   * ```ts\n   * import * as Matrix4x4 from 'curvy/matrix4x4'\n   * import * as Vector4 from 'curvy/vector4'\n   *\n   * const m = Matrix4x4.make(1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16)\n   * const v = Vector4.make(17, 18, 19, 20)\n   *\n   * // Result:\n   * // x = 1 * 17 + 2 * 18 + 3 * 19 + 4 * 20\n   * // y = 5 * 17 + 6 * 18 + 7 * 19 + 8 * 20\n   * // z = 9 * 17 + 10 * 18 + 11 * 19 + 12 * 20\n   * // w = 13 * 17 + 14 * 18 + 15 * 19 + 16 * 20\n   * const result = Matrix4x4.vectorProductLeft(v)(m)\n   * ```\n   * @since 1.0.0\n   */\n  (v: Vector4): (m: Matrix4x4) => Vector4\n} = internal.vectorProductLeft\n\nexport const vectorProductRight: {\n  /**\n   * Calculates the right vector product of a `Matrix4x4` and a `Vector4`.\n   *\n   * @example\n   * ```ts\n   * import * as Matrix4x4 from 'curvy/matrix4x4'\n   * import * as Vector4 from 'curvy/vector4'\n   *\n   * const m = Matrix4x4.make(1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16)\n   * const v = Vector4.make(17, 18, 19, 20)\n   *\n   * // Result:\n   * // x = 1 * 17 + 5 * 18 + 9 * 19 + 13 * 20\n   * // y = 2 * 17 + 6 * 18 + 10 * 19 + 14 * 20\n   * // z = 3 * 17 + 7 * 18 + 11 * 19 + 15 * 20\n   * // w = 4 * 17 + 8 * 18 + 12 * 19 + 16 * 20\n   * const result = Matrix4x4.vectorProductRight(m, v)\n   * ```\n   * @since 1.0.0\n   */\n  (m: Matrix4x4, v: Vector4): Vector4\n  /**\n   * Calculates the right vector product of a `Matrix4x4` and a `Vector4`.\n   *\n   * @example\n   * ```ts\n   * import * as Matrix4x4 from 'curvy/matrix4x4'\n   * import * as Vector4 from 'curvy/vector4'\n   *\n   * const m = Matrix4x4.make(1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16)\n   * const v = Vector4.make(17, 18, 19, 20)\n   *\n   * // Result:\n   * // x = 1 * 17 + 5 * 18 + 9 * 19 + 13 * 20\n   * // y = 2 * 17 + 6 * 18 + 10 * 19 + 14 * 20\n   * // z = 3 * 17 + 7 * 18 + 11 * 19 + 15 * 20\n   * // w = 4 * 17 + 8 * 18 + 12 * 19 + 16 * 20\n   * const result = Matrix4x4.vectorProductRight(v)(m)\n   * ```\n   * @since 1.0.0\n   */\n  (v: Vector4): (m: Matrix4x4) => Vector4\n} = internal.vectorProductRight\n\nexport const multiply: {\n  /**\n   * Multiplies two `Matrix4x4` instances. Result is `a · b`.\n   *\n   * @param a - The left-hand matrix.\n   * @param b - The right-hand matrix.\n   * @returns The product matrix.\n   * @since 1.1.0\n   */\n  (a: Matrix4x4, b: Matrix4x4): Matrix4x4\n  /**\n   * Multiplies two `Matrix4x4` instances. Result is `a · b`.\n   *\n   * @param b - The right-hand matrix.\n   * @returns A function that takes the left-hand matrix and returns the product.\n   * @since 1.1.0\n   */\n  (b: Matrix4x4): (a: Matrix4x4) => Matrix4x4\n} = internal.multiply\n\n// The implementation always runs the same det/threshold branch. For\n// `Invertible`-branded matrices the empty branch is provably unreachable,\n// but TS can't see that — the cast pairs the type-level promise with the\n// runtime brand check.\nexport const inverse: {\n  /**\n   * Returns the inverse of an `Invertible`-branded `Matrix4x4`. Because the\n   * brand guarantees non-singularity, the result is always a single matrix —\n   * wrapped in `Solution.One`.\n   *\n   * @param m - The matrix to invert.\n   * @since 2.0.0\n   */\n  <T extends Invertible>(m: Matrix4x4<T>): Solution.One<Matrix4x4<T>>\n  /**\n   * Returns the inverse of a `Matrix4x4`. Returns `Solution.none` if the\n   * matrix is singular (determinant approximately zero). Use {@link asInvertible}\n   * or {@link isInvertible} to refine the type and tighten the return to\n   * `Solution.One`, or use {@link inverseUnsafe} if you want the throwing form.\n   *\n   * @param m - The matrix to invert.\n   * @since 2.0.0\n   */\n  <T>(m: Matrix4x4<T>): Solution.AtMostOne<Matrix4x4<T>>\n} = internal.inverse as never\n\n/**\n * Returns the inverse of a `Matrix4x4`. Throws when the matrix is singular\n * (determinant approximately zero). Useful when you've already validated\n * invertibility out-of-band and want the unwrapped matrix directly; otherwise\n * prefer {@link inverse}.\n *\n * @param m - The matrix to invert.\n * @returns The inverse matrix.\n * @throws If `m` is singular.\n * @since 2.0.0\n */\nexport const inverseUnsafe: (m: Matrix4x4) => Matrix4x4 = internal.inverseUnsafe\n\n/**\n * Type-narrowing predicate: refines a `Matrix4x4<T>` to\n * `Matrix4x4<T & Invertible>` when the matrix's determinant is non-zero\n * (within the default absolute tolerance).\n *\n * @param m - The matrix to check.\n * @returns `true` when `m` is invertible.\n * @since 2.0.0\n */\nexport const isInvertible: <T>(m: Matrix4x4<T>) => m is Matrix4x4<T & Invertible> =\n  internal.isInvertible\n\n/**\n * Asserts that the matrix is invertible, throwing on a singular matrix.\n *\n * @param m - The matrix to assert against.\n * @returns The same matrix, typed with the `Invertible` brand.\n * @throws When `m` is singular.\n * @since 2.0.0\n */\nexport const asInvertible: <T>(m: Matrix4x4<T>) => Matrix4x4<T & Invertible> = internal.asInvertible\n\nexport const solveSystem: {\n  /**\n   * Solves a system of linear equations represented by a `Matrix4x4` and a `Vector4`.\n   *\n   * @param m - The matrix representing the coefficients of the equations.\n   * @param v - The vector representing the constants of the equations.\n   * @returns The solution vector.\n   * @since 1.0.0\n   */\n  (m: Matrix4x4, v: Vector4): Vector4\n  /**\n   * Solves a system of linear equations represented by a `Matrix4x4` and a `Vector4`.\n   *\n   * @param v - The vector representing the constants of the equations.\n   * @returns A function that takes a matrix and returns the solution vector.\n   * @since 1.0.0\n   */\n  (v: Vector4): (m: Matrix4x4) => Vector4\n} = internal.solveSystem\n\n/**\n * Returns the rows of a `Matrix4x4` as an array of vectors.\n *\n * @param m - The matrix to convert.\n * @returns An array of vectors representing the rows of the matrix.\n * @since 1.0.0\n */\nexport const toRows: (m: Matrix4x4) => [Vector4, Vector4, Vector4, Vector4] = internal.toRows as (\n  m: Matrix4x4,\n) => [Vector4, Vector4, Vector4, Vector4]\n\n/**\n * Returns the columns of a `Matrix4x4` as an array of vectors.\n *\n * @param m - The matrix to convert.\n * @returns An array of vectors representing the columns of the matrix.\n * @since 1.0.0\n */\nexport const toColumns: (m: Matrix4x4) => [Vector4, Vector4, Vector4, Vector4] =\n  internal.toColumns as (m: Matrix4x4) => [Vector4, Vector4, Vector4, Vector4]\n\nexport const rowVector: {\n  /**\n   * Returns a row vector from a `Matrix4x4`.\n   *\n   * @param m - The matrix to get the row vector from.\n   * @param row - The row index.\n   * @returns The row vector.\n   * @since 1.0.0\n   */\n  (m: Matrix4x4, row: Matrix4x4Coordinate): Vector4\n  /**\n   * Returns a row vector from a `Matrix4x4`.\n   *\n   * @param row - The row index.\n   * @returns A function that takes a matrix and returns the row vector.\n   * @since 1.0.0\n   */\n  (row: Matrix4x4Coordinate): (m: Matrix4x4) => Vector4\n} = internal.rowVector\n\nexport const columnVector: {\n  /**\n   * Returns a column vector from a `Matrix4x4`.\n   *\n   * @param m - The matrix to get the column vector from.\n   * @param column - The column index.\n   * @returns The column vector.\n   * @since 1.0.0\n   */\n  (m: Matrix4x4, column: Matrix4x4Coordinate): Vector4\n  /**\n   * Returns a column vector from a `Matrix4x4`.\n   *\n   * @param column - The column index.\n   * @returns A function that takes a matrix and returns the column vector.\n   * @since 1.0.0\n   */\n  (column: Matrix4x4Coordinate): (m: Matrix4x4) => Vector4\n} = internal.columnVector\n\n/**\n * Transposes a `Matrix4x4`.\n *\n * @param m - The matrix to transpose.\n * @returns The transposed matrix.\n * @since 1.0.0\n */\nexport const transpose: (m: Matrix4x4) => Matrix4x4 = internal.transpose\n\n/**\n * Reverses the rows of a `Matrix4x4`.\n *\n * @param m - The matrix to reverse the rows of.\n * @returns The matrix with the rows reversed.\n * @since 1.0.0\n */\nexport const reverseRows: (m: Matrix4x4) => Matrix4x4 = internal.reverseRows\n\n/**\n * Reverses the columns of a `Matrix4x4`.\n *\n * @param m - The matrix to reverse the columns of.\n * @returns The matrix with the columns reversed.\n * @since 1.0.0\n */\nexport const reverseColumns: (m: Matrix4x4) => Matrix4x4 = internal.reverseColumns\n"],"mappings":";;;;;;;AAaA,MAAa,kBAAiC,OAAO,IAAI,kBAAkB;AAG3E,IAAM,gBAAN,cAA4B,SAAuC;CACjE,CAAU,mBAAoC;CAG9C;CACA;CACA;CACA;CAEA;CACA;CACA;CACA;CAEA;CACA;CACA;CACA;CAEA;CACA;CACA;CACA;CAEA,YACE,MAAM,GACN,MAAM,KACN,MAAM,KACN,MAAM,KACN,MAAM,KACN,MAAM,KACN,MAAM,KACN,MAAM,KACN,MAAM,KACN,MAAM,KACN,MAAM,KACN,MAAM,KACN,MAAM,KACN,MAAM,KACN,MAAM,KACN,MAAM,KACN;EACA,OAAO;EAEP,KAAK,MAAM;EACX,KAAK,MAAM;EACX,KAAK,MAAM;EACX,KAAK,MAAM;EACX,KAAK,MAAM;EACX,KAAK,MAAM;EACX,KAAK,MAAM;EACX,KAAK,MAAM;EACX,KAAK,MAAM;EACX,KAAK,MAAM;EACX,KAAK,MAAM;EACX,KAAK,MAAM;EACX,KAAK,MAAM;EACX,KAAK,MAAM;EACX,KAAK,MAAM;EACX,KAAK,MAAM;;CAGb,KAAK,OAAO,eAAe;EACzB,OAAO,aAAa,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK,IAAI;;CAGlO,KAAK,OAAO,IAAI,6BAA6B,IAAI;EAC/C,OAAO,aAAa,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK,IAAI;;CAGlO,CAAC,OAAO,aAAa,GAA4B;EAC/C,OAAOA,cAAY,EAAE;;;;AAKzB,MAAaA,iBAAe,MAC1B,OAAO,MAAM,YAAY,MAAM,QAAQ,mBAAmB;;AAG5D,MAAaC,WAAS,KAIpB,IACC,GAAc,MACb,WAAW,EAAE,KAAK,EAAE,IAAI,IACxB,WAAW,EAAE,KAAK,EAAE,IAAI,IACxB,WAAW,EAAE,KAAK,EAAE,IAAI,IACxB,WAAW,EAAE,KAAK,EAAE,IAAI,IACxB,WAAW,EAAE,KAAK,EAAE,IAAI,IACxB,WAAW,EAAE,KAAK,EAAE,IAAI,IACxB,WAAW,EAAE,KAAK,EAAE,IAAI,IACxB,WAAW,EAAE,KAAK,EAAE,IAAI,IACxB,WAAW,EAAE,KAAK,EAAE,IAAI,IACxB,WAAW,EAAE,KAAK,EAAE,IAAI,IACxB,WAAW,EAAE,KAAK,EAAE,IAAI,IACxB,WAAW,EAAE,KAAK,EAAE,IAAI,IACxB,WAAW,EAAE,KAAK,EAAE,IAAI,IACxB,WAAW,EAAE,KAAK,EAAE,IAAI,IACxB,WAAW,EAAE,KAAK,EAAE,IAAI,IACxB,WAAW,EAAE,KAAK,EAAE,IAAI,CAC3B;;;;;AAMD,MAAaC,aAAsB,IAAI,cAAc,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE;;AAIpG,MAAaC,UACX,MAAM,GACN,MAAM,KACN,MAAM,KACN,MAAM,KACN,MAAM,KACN,MAAM,KACN,MAAM,KACN,MAAM,KACN,MAAM,KACN,MAAM,KACN,MAAM,KACN,MAAM,KACN,MAAM,KACN,MAAM,KACN,MAAM,KACN,MAAM,QAEN,IAAI,cAAc,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,IAAI;;AAGnG,MAAaC,cAAY,IAAa,IAAa,IAAa,OAC9D,IAAI,cACF,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,EACJ;;AAGH,MAAaC,iBAAe,IAAa,IAAa,IAAa,OACjE,IAAI,cACF,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,EACJ;;AAGH,MAAaC,WAAS,KAGpB,IAAI,GAAc,KAA0B,MAC5CF,WACE,GAAIG,SAAO,EAAE,CAAC,KAAK,uBAAuB,IAAI,EAAE,EAAE,CACnD,CACF;;AAGD,MAAaC,cAAY,KAGvB,IAAI,GAAc,QAA6B,MAC/CH,cACE,GAAII,YAAU,EAAE,CAAC,KAAK,uBAAuB,OAAO,EAAE,EAAE,CAMzD,CACF;;AAGD,MAAaC,iBAAe,MAC1B,EAAE,MAAMC,cAAsBC,QAAM,GAAG,GAAG,EAAE,CAAC,GAC7C,EAAE,MAAMD,cAAsBC,QAAM,GAAG,GAAG,EAAE,CAAC,GAC7C,EAAE,MAAMD,cAAsBC,QAAM,GAAG,GAAG,EAAE,CAAC,GAC7C,EAAE,MAAMD,cAAsBC,QAAM,GAAG,GAAG,EAAE,CAAC;;AAG/C,MAAaA,UAAQ,KAGnB,IAAI,GAAc,KAA0B,WAAgC;CAC5E,MAAM,CAAC,IAAI,IAAI,MAAML,SAAO,EAAE,CAAC,UAAU,uBAAuB,IAAI,EAAE,EAAE;CAKxE,MAAM,cAAc,uBAAuB,OAAO;CAClD,MAAM,CAAC,KAAK,KAAK,OAAOM,WAAmB,GAAG,CAAC,UAAU,aAAa,EAAE;CAKxE,MAAM,CAAC,KAAK,KAAK,OAAOA,WAAmB,GAAG,CAAC,UAAU,aAAa,EAAE;CAKxE,MAAM,CAAC,KAAK,KAAK,OAAOA,WAAmB,GAAG,CAAC,UAAU,aAAa,EAAE;CAMxE,OAAOC,OAAe,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,IAAI;EAClE;;AAGF,MAAaC,sBAAoB,KAG/B,IAAI,GAAc,MAAe;CACjC,MAAM,CAAC,IAAI,IAAI,IAAI,MAAMR,SAAO,EAAE;CAClC,OAAOS,OACLC,IAAY,IAAI,EAAE,EAClBA,IAAY,IAAI,EAAE,EAClBA,IAAY,IAAI,EAAE,EAClBA,IAAY,IAAI,EAAE,CACnB;EACD;;AAGF,MAAaC,uBAAqB,KAGhC,IAAI,GAAc,MAAe;CACjC,MAAM,CAAC,IAAI,IAAI,IAAI,MAAMT,YAAU,EAAE;CAErC,OAAOO,OACLC,IAAY,GAAG,GAAG,EAClBA,IAAY,GAAG,GAAG,EAClBA,IAAY,GAAG,GAAG,EAClBA,IAAY,GAAG,GAAG,CACnB;EACD;;AAGF,MAAaE,aAAW,KAItB,IACC,GAAc,MACb,IAAI,cACF,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAC1D,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAC1D,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAC1D,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAC1D,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAC1D,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAC1D,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAC1D,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAC1D,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAC1D,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAC1D,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAC1D,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAC1D,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAC1D,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAC1D,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAC1D,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAC3D,CACJ;AAID,MAAM,wBAAwB,MAC5B,qBACA,KAAK,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,GACtC,KAAK,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,GACtC,KAAK,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,GACtC,KAAK,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI;;AAGxC,MAAaC,kBAAmB,MAC9B,KAAK,IAAIV,cAAY,EAAE,CAAC,GAAG,qBAAqB,EAAE;;AAGpD,MAAaW,kBAAmB,MAA+C;CAC7E,UAAUD,eAAa,EAAE,EAAE,8BAA8B;CACzD,OAAO;;AAGT,MAAM,gBAAgB,GAAc,QAA2B;CAC7D,MAAM,MAAM,IAAI;CAEhB,MAAM,OAAO,KAA0B,QAA6B;EAElE,SADe,MAAkB,OAAkB,MAAM,IAAI,IAAI,MACnDT,cAAsBC,QAAM,GAAG,KAAK,IAAI,CAAC,GAAG;;CAG5D,OAAO,IAAI,cACT,IAAI,GAAG,EAAE,EACT,IAAI,GAAG,EAAE,EACT,IAAI,GAAG,EAAE,EACT,IAAI,GAAG,EAAE,EACT,IAAI,GAAG,EAAE,EACT,IAAI,GAAG,EAAE,EACT,IAAI,GAAG,EAAE,EACT,IAAI,GAAG,EAAE,EACT,IAAI,GAAG,EAAE,EACT,IAAI,GAAG,EAAE,EACT,IAAI,GAAG,EAAE,EACT,IAAI,GAAG,EAAE,EACT,IAAI,GAAG,EAAE,EACT,IAAI,GAAG,EAAE,EACT,IAAI,GAAG,EAAE,EACT,IAAI,GAAG,EAAE,CACV;;;AAOH,MAAaU,aAAc,MAAsD;CAC/E,MAAM,MAAMZ,cAAY,EAAE;CAC1B,IAAI,KAAK,IAAI,IAAI,IAAI,qBAAqB,EAAE,EAC1C,OAAOa;CAET,OAAOC,IAAa,aAAa,GAAG,IAAI,CAAiB;;;AAI3D,MAAaC,mBAAiB,MAA4B;CACxD,MAAM,MAAMf,cAAY,EAAE;CAC1B,UAAU,KAAK,IAAI,IAAI,GAAG,qBAAqB,EAAE,EAAE,gCAAgC;CACnF,OAAO,aAAa,GAAG,IAAI;;;AAI7B,MAAagB,gBAAc,KAGzB,IAAI,GAAc,MAAe;CACjC,MAAM,qBAAqB,IAAIhB,cAAY,EAAE;CAE7C,UACE,OAAO,SAAS,mBAAmB,EACnC,kEACD;CAED,OAAOM,OACLN,cAAYF,YAAU,GAAG,GAAG,EAAE,CAAC,GAAG,oBAClCE,cAAYF,YAAU,GAAG,GAAG,EAAE,CAAC,GAAG,oBAClCE,cAAYF,YAAU,GAAG,GAAG,EAAE,CAAC,GAAG,oBAClCE,cAAYF,YAAU,GAAG,GAAG,EAAE,CAAC,GAAG,mBACnC;EACD;;AAGF,MAAaD,YAAU,MACrB;CACES,OAAa,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI;CACxCA,OAAa,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI;CACxCA,OAAa,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI;CACxCA,OAAa,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI;CACzC;;AAGH,MAAaP,eAAa,MACxB;CACEO,OAAa,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI;CACxCA,OAAa,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI;CACxCA,OAAa,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI;CACxCA,OAAa,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI;CACzC;;AAGH,MAAaW,cAAY,KAGvB,IAAI,GAAc,QAA6BpB,SAAO,EAAE,CAAC,uBAAuB,IAAI,EAAE;;AAGxF,MAAaqB,iBAAe,KAG1B,IAAI,GAAc,WAAgCnB,YAAU,EAAE,CAAC,uBAAuB,OAAO,EAAE;;AAGjG,MAAaoB,eAAa,MAAiBxB,cAAY,GAAGE,SAAO,EAAE,CAAC;;AAGpE,MAAauB,iBAAe,MAAiB;CAC3C,MAAM,CAAC,IAAI,IAAI,IAAI,MAAMvB,SAAO,EAAE;CAClC,OAAOH,WAAS,IAAI,IAAI,IAAI,GAAG;;;AAIjC,MAAa2B,oBAAkB,MAAiB;CAC9C,MAAM,CAAC,IAAI,IAAI,IAAI,MAAMtB,YAAU,EAAE;CACrC,OAAOJ,cAAY,IAAI,IAAI,IAAI,GAAG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACzUpC,MAAa,cAA8C2B;;;;;;AAO3D,MAAa,WAAsBC;AAEnC,MAAa,SAoBTC;;;;;;;;;;;;;;;;;;;;;;;AAwBJ,MAAa,OAiBIC;;;;;;;;;;;AAYjB,MAAa,WACXC;;;;;;;;;AAUF,MAAa,cACXC;AAEF,MAAa,SAoBTC;AAEJ,MAAa,YAoBTC;;;;;;;;AASJ,MAAa,cAAwCC;;;;;;;;;AAUrD,MAAa,QAIIC;AAEjB,MAAa,oBA8CTC;AAEJ,MAAa,qBA2CTC;AAEJ,MAAa,WAkBTC;AAMJ,MAAa,UAoBTC;;;;;;;;;;;;AAaJ,MAAa,gBAA6CC;;;;;;;;;;AAW1D,MAAa,eACXC;;;;;;;;;AAUF,MAAa,eAAkEC;AAE/E,MAAa,cAkBTC;;;;;;;;AASJ,MAAa,SAAiEC;;;;;;;;AAW9E,MAAa,YACXC;AAEF,MAAa,YAkBTC;AAEJ,MAAa,eAkBTC;;;;;;;;AASJ,MAAa,YAAyCC;;;;;;;;AAStD,MAAa,cAA2CC;;;;;;;;AASxD,MAAa,iBAA8CC"}

package/dist/shared/monotonicity-DNxBoC7F.mjs

@@ -0,0 +1,64 @@
+import { t as __exportAll } from "./chunk-25Hzd3z8.mjs";
+import "../number.mjs";
+//#region src/monotonicity/monotonicity.ts
+var monotonicity_exports = /* @__PURE__ */ __exportAll({
+	Constant: () => 0,
+	Decreasing: () => 2,
+	Increasing: () => 1,
+	None: () => 3,
+	fromComparison: () => fromComparison,
+	fromDerivativeRange: () => fromDerivativeRange,
+	isStrict: () => isStrict
+});
+/**
+* Type-narrowing predicate: refines a `Monotonicity` to `Increasing |
+* Decreasing` — the strict cases that admit a unique inverse.
+*
+* @param m - The monotonicity classification.
+* @returns `true` when `m` is `Increasing` or `Decreasing`.
+* @since 2.0.0
+*/
+const isStrict = (m) => m === 1 || m === 2;
+/**
+* Classifies the monotonicity of a function given its values at two interval
+* endpoints, when the function is known a priori to be monotonic on the
+* spanning interval (e.g. a linear polynomial).
+*
+* @param s0 - The function value at the start of the interval.
+* @param s1 - The function value at the end of the interval.
+* @returns The classification — `Increasing`, `Decreasing`, or `Constant`.
+* @since 2.0.0
+*/
+const fromComparison = (s0, s1) => s0 < s1 ? 1 : s0 > s1 ? 2 : 0;
+/**
+* Classifies monotonicity from the extreme values of a function's derivative
+* over an interval, tolerating rounding noise in the derivative.
+*
+* `min` and `max` must be the true range extremes of the derivative on the
+* interval (for a polynomial derivative: its values at the interval endpoints
+* and at any interior stationary point). Each bound sets its sign-coverage
+* bit only when it exceeds the tolerance, so a derivative that merely grazes
+* zero — or dips past it by an ulp-scale amount that construction arithmetic
+* cannot distinguish from zero — does not register as a crossing.
+*
+* The default tolerance is {@link RELATIVE_TOLERANCE} scaled by the larger
+* bound magnitude, making the classification invariant under scaling of the
+* input data. Derivative values are used rather than derivative *root
+* locations* because values are well-conditioned where roots are not: a root
+* computed from rounded coefficients can land on either side of an interval
+* boundary, while the value it corresponds to stays pinned near zero.
+*
+* @param min - The smallest derivative value attained on the interval.
+* @param max - The largest derivative value attained on the interval.
+* @param tolerance - Absolute threshold below which a derivative value is treated as zero. Defaults to `RELATIVE_TOLERANCE * max(|min|, |max|)`.
+* @returns The sign-coverage classification.
+* @since 2.0.0
+*/
+const fromDerivativeRange = (min, max, tolerance) => {
+	const t = tolerance ?? 1e-12 * Math.max(Math.abs(min), Math.abs(max));
+	return (max > t ? 1 : 0) | (min < -t ? 2 : 0);
+};
+//#endregion
+export { isStrict as n, monotonicity_exports as r, fromDerivativeRange as t };
+
+//# sourceMappingURL=monotonicity-DNxBoC7F.mjs.map

package/dist/shared/monotonicity-DNxBoC7F.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"monotonicity-DNxBoC7F.mjs","names":[],"sources":["../../src/monotonicity/monotonicity.ts"],"sourcesContent":["import { RELATIVE_TOLERANCE } from '../number.ts'\n\n/**\n * Classification of a function's monotonicity on an interval.\n *\n * Encoded as a 2-bit sign-coverage bitmask of the function's derivative:\n *   - bit 0 (`Increasing`) — derivative takes positive values\n *   - bit 1 (`Decreasing`) — derivative takes negative values\n *\n * The four states fall out of the encoding:\n *\n *   | value | name         | derivative on the interval        |\n *   |-------|--------------|-----------------------------------|\n *   |   `0` | `Constant`   | ≡ 0                               |\n *   |   `1` | `Increasing` | ≥ 0, with at least one `> 0`      |\n *   |   `2` | `Decreasing` | ≤ 0, with at least one `< 0`      |\n *   |   `3` | `None`       | crosses zero                      |\n *\n * The numeric encoding is principled, not arbitrary: the bitwise OR of two\n * adjacent subintervals' classifications gives the classification of their\n * union, which lets monotonicity be computed by recursive subdivision\n * without any custom combine logic.\n *\n * @since 2.0.0\n */\nexport type Monotonicity = 0 | 1 | 2 | 3\n\n/**\n * Subset of {@link Monotonicity} excluding the indeterminate `None` state.\n * Returned by classifiers operating on functions whose derivative cannot\n * change sign on the interval (e.g. linear polynomials, whose derivative is\n * constant).\n *\n * @since 2.0.0\n */\nexport type GuaranteedMonotonicity = 0 | 1 | 2\n\n/**\n * Derivative is identically zero on the interval. The function is constant.\n *\n * @since 2.0.0\n */\nexport const Constant = 0 as const\n\n/**\n * Derivative is non-negative on the interval with at least one strictly\n * positive sample. The function is strictly increasing.\n *\n * @since 2.0.0\n */\nexport const Increasing = 1 as const\n\n/**\n * Derivative is non-positive on the interval with at least one strictly\n * negative sample. The function is strictly decreasing.\n *\n * @since 2.0.0\n */\nexport const Decreasing = 2 as const\n\n/**\n * Derivative crosses zero on the interval. The function has at least one\n * interior extremum and is not monotonic in either direction.\n *\n * @since 2.0.0\n */\nexport const None = 3 as const\n\n/**\n * Type-narrowing predicate: refines a `Monotonicity` to `Increasing |\n * Decreasing` — the strict cases that admit a unique inverse.\n *\n * @param m - The monotonicity classification.\n * @returns `true` when `m` is `Increasing` or `Decreasing`.\n * @since 2.0.0\n */\nexport const isStrict = (m: Monotonicity): m is 1 | 2 => m === Increasing || m === Decreasing\n\n/**\n * Classifies the monotonicity of a function given its values at two interval\n * endpoints, when the function is known a priori to be monotonic on the\n * spanning interval (e.g. a linear polynomial).\n *\n * @param s0 - The function value at the start of the interval.\n * @param s1 - The function value at the end of the interval.\n * @returns The classification — `Increasing`, `Decreasing`, or `Constant`.\n * @since 2.0.0\n */\nexport const fromComparison = (s0: number, s1: number): GuaranteedMonotonicity =>\n  s0 < s1 ? Increasing : s0 > s1 ? Decreasing : Constant\n\n/**\n * Classifies monotonicity from the extreme values of a function's derivative\n * over an interval, tolerating rounding noise in the derivative.\n *\n * `min` and `max` must be the true range extremes of the derivative on the\n * interval (for a polynomial derivative: its values at the interval endpoints\n * and at any interior stationary point). Each bound sets its sign-coverage\n * bit only when it exceeds the tolerance, so a derivative that merely grazes\n * zero — or dips past it by an ulp-scale amount that construction arithmetic\n * cannot distinguish from zero — does not register as a crossing.\n *\n * The default tolerance is {@link RELATIVE_TOLERANCE} scaled by the larger\n * bound magnitude, making the classification invariant under scaling of the\n * input data. Derivative values are used rather than derivative *root\n * locations* because values are well-conditioned where roots are not: a root\n * computed from rounded coefficients can land on either side of an interval\n * boundary, while the value it corresponds to stays pinned near zero.\n *\n * @param min - The smallest derivative value attained on the interval.\n * @param max - The largest derivative value attained on the interval.\n * @param tolerance - Absolute threshold below which a derivative value is treated as zero. Defaults to `RELATIVE_TOLERANCE * max(|min|, |max|)`.\n * @returns The sign-coverage classification.\n * @since 2.0.0\n */\nexport const fromDerivativeRange = (min: number, max: number, tolerance?: number): Monotonicity => {\n  const t = tolerance ?? RELATIVE_TOLERANCE * Math.max(Math.abs(min), Math.abs(max))\n  return ((max > t ? Increasing : Constant) | (min < -t ? Decreasing : Constant)) as Monotonicity\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AA4EA,MAAa,YAAY,MAAgC,MAAA,KAAoB,MAAA;;;;;;;;;;;AAY7E,MAAa,kBAAkB,IAAY,OACzC,KAAK,KAAA,IAAkB,KAAK,KAAA,IAAA;;;;;;;;;;;;;;;;;;;;;;;;;AA0B9B,MAAa,uBAAuB,KAAa,KAAa,cAAqC;CACjG,MAAM,IAAI,aAAA,QAAkC,KAAK,IAAI,KAAK,IAAI,IAAI,EAAE,KAAK,IAAI,IAAI,CAAC;CAClF,QAAS,MAAM,IAAA,IAAA,MAA8B,MAAM,CAAC,IAAA,IAAA"}

package/dist/shared/{quadratic-DPrUsFCp.mjs → quadratic-BmMqkvxx.mjs}

@@ -1,5 +1,5 @@
 import { t as __exportAll } from "./chunk-25Hzd3z8.mjs";
-import { $ as equals$3, At as isLinearPolynomial$1, Bt as unitRange$2, Ct as domain$2, Dt as fromVector$2, Et as fromPoints$2, Ft as range$2, G as antiderivative$3, It as solve$2, J as asMonotonic$3, K as asDecreasing$3, Lt as solveInverse$2, Mt as length$2, Nt as make$2, Ot as isDecreasing$2, Pt as monotonicity$2, Q as domain$3, Rt as toInverseSolver$2, St as derivative$2, Tt as fromPointSlope$1, X as curvature$1, Y as coefficients$3, Z as derivative$3, _t as antiderivative$2, at as isMonotonic$3, bt as asMonotonic$2, ct as make$3, dt as roots$1, et as extreme$1, ft as solve$3, gt as unitRange$3, ht as toSolver$3, it as isIncreasing$3, jt as isMonotonic$2, kt as isIncreasing$2, lt as monotonicity$3, mt as toInverseSolver$3, nt as fromVector$3, ot as isQuadraticPolynomial$1, pt as solveInverse$3, q as asIncreasing$3, rt as isDecreasing$3, st as length$3, tt as fromPoints$3, ut as range$3, vt as asDecreasing$2, wt as equals$2, xt as coefficients$2, yt as asIncreasing$2, zt as toSolver$2 } from "./cubic-BL6dpuHh.mjs";
+import { $ as domain$3, At as isIncreasing$2, Bt as toSolver$2, Ct as derivative$2, Dt as fromPoints$2, Et as fromPointSlope$1, Ft as monotonicity$2, It as range$2, J as asIncreasing$3, K as antiderivative$3, Lt as solve$2, Mt as isMonotonic$2, Nt as length$2, Ot as fromVector$2, Pt as make$2, Q as derivative$3, Rt as solveInverse$2, St as coefficients$2, Tt as equals$2, Vt as unitRange$2, X as coefficients$3, Y as asMonotonic$3, Z as curvature$1, _t as unitRange$3, at as isIncreasing$3, bt as asIncreasing$2, ct as length$3, dt as range$3, et as equals$3, ft as roots$1, gt as toSolver$3, ht as toInverseSolver$3, it as isDecreasing$3, jt as isLinearPolynomial$1, kt as isDecreasing$2, lt as make$3, mt as solveInverse$3, nt as fromPoints$3, ot as isMonotonic$3, pt as solve$3, q as asDecreasing$3, rt as fromVector$3, st as isQuadraticPolynomial$1, tt as extreme$1, ut as monotonicity$3, vt as antiderivative$2, wt as domain$2, xt as asMonotonic$2, yt as asDecreasing$2, zt as toInverseSolver$2 } from "./cubic-BiGuAnZ0.mjs";
 //#region src/polynomial/linear.ts
 var linear_exports = /* @__PURE__ */ __exportAll({
 	antiderivative: () => antiderivative$1,
@@ -367,4 +367,4 @@ const curvature = curvature$1;
 //#endregion
 export { unitRange$1 as _, make as a, solveInverse as c, isIncreasing$1 as d, isMonotonic$1 as f, solveInverse$1 as g, solve$1 as h, isMonotonic as i, unitRange as l, make$1 as m, isDecreasing as n, quadratic_exports as o, linear_exports as p, isIncreasing as r, solve as s, derivative as t, isDecreasing$1 as u };
 
-//# sourceMappingURL=quadratic-DPrUsFCp.mjs.map
+//# sourceMappingURL=quadratic-BmMqkvxx.mjs.map