pimath 0.2.10 → 0.2.12

package/dist/pimath.js

@@ -1,21 +1,28 @@
+//#region src/errors.ts
+var e = class extends Error {
+	constructor(e, t) {
+		super(e, t), this.name = new.target.name;
+	}
+}, t = class extends e {}, n = class extends e {}, r = class extends e {}, i = class extends e {}, a = class extends e {}, o = class extends e {}, s = class extends e {};
+//#endregion
 //#region src/numeric.ts
-function e(e) {
-	let t = n(e), r = [], i, a;
-	for (; t.length > 0;) i = t.shift() ?? 1, a = (t.length > 0 ? t.pop() : +i) ?? 1, r.push([i, a]);
-	return r;
+function c(e) {
+	let t = u(e), n = [], r, i;
+	for (; t.length > 0;) r = t.shift() ?? 1, i = (t.length > 0 ? t.pop() : +r) ?? 1, n.push([r, i]);
+	return n;
 }
-function t(...e) {
-	let t = r(...e);
+function l(...e) {
+	let t = d(...e);
 	return e.map((e) => e / t);
 }
-function n(e) {
+function u(e) {
 	let t = Math.abs(e), n = Math.sqrt(t), r = [];
 	for (let i = 1; i <= n; i++) e % i === 0 && (r.push(i), r.push(t / i));
 	return r.sort(function(e, t) {
 		return e - t;
 	}), [...new Set(r)];
 }
-function r(...e) {
+function d(...e) {
 	let t = function(e, n) {
 		return isNaN(e) || isNaN(n) ? NaN : n === 0 ? e : e === 0 ? n : t(n, e % n);
 	}, n = 1, r = 2;
@@ -25,19 +32,19 @@ function r(...e) {
 	for (r = 2; r < e.length && (n = t(n, e[r]), n !== 1); r++);
 	return Math.abs(n);
 }
-function i(...e) {
+function f(...e) {
 	return e.reduce(function(e, t) {
-		return Math.abs(e * t / r(e, t));
+		return Math.abs(e * t / d(e, t));
 	});
 }
-function a(e, t = 3) {
+function ee(e, t = 3) {
 	return +e.toFixed(t);
 }
-function o(e) {
+function te(e) {
 	if (Number.isSafeInteger(e) || e.toString().split(".")[0].length < 10) return 0;
-	throw Error("Periodic value: Not implemented yet");
+	throw new a("Periodic value: Not implemented yet");
 }
-function s(e) {
+function ne(e) {
 	let t = [
 		2,
 		3,
@@ -1271,7 +1278,7 @@ function s(e) {
 	];
 	return e === void 0 ? t : t.slice(0, Math.min(t.length, e));
 }
-function c(e, t) {
+function re(e, t) {
 	let n = [], r = t === !0 ? +e : e ** 2;
 	for (let t = 0; t <= e; t++) for (let i = 0; i <= e; i++) t ** 2 + i ** 2 === r && n.push([
 		t,
@@ -1280,11 +1287,11 @@ function c(e, t) {
 	]);
 	return n;
 }
-function l(e, t = 2) {
+function ie(e, t = 2) {
 	let n = Math.round(Number(`${e}e${t}`));
 	return Number(`${n}e-${t}`);
 }
-function u(e, t) {
+function ae(e, t) {
 	let n = Math.floor(e ** (1 / t)), r = e;
 	for (; n > 1;) {
 		let e = n ** +t;
@@ -1293,21 +1300,21 @@ function u(e, t) {
 	}
 	return 1;
 }
-var d = {
-	decompose: e,
-	dividers: n,
-	divideNumbersByGCD: t,
-	gcd: r,
-	lcm: i,
-	numberCorrection: a,
-	periodic: o,
-	primes: s,
-	pythagoreanTripletsWithTarget: c,
-	round: l,
-	greatestPower: u
-}, f = /* @__PURE__ */ function(e) {
+var p = {
+	decompose: c,
+	dividers: u,
+	divideNumbersByGCD: l,
+	gcd: d,
+	lcm: f,
+	numberCorrection: ee,
+	periodic: te,
+	primes: ne,
+	pythagoreanTripletsWithTarget: re,
+	round: ie,
+	greatestPower: ae
+}, oe = /* @__PURE__ */ function(e) {
 	return e.frac = "frac", e.dfrac = "dfrac", e.tfrac = "tfrac", e;
-}({}), p = class e {
+}({}), m = class e {
 	#e = 1;
 	#t = 3;
 	#n = !0;
@@ -1370,7 +1377,7 @@ var d = {
 		return n && r.reverse(), r;
 	};
 	static toSameDenominateur(...t) {
-		let n = t.map((t) => new e(t)), r = d.lcm(...n.map((e) => e.denominator));
+		let n = t.map((t) => new e(t)), r = p.lcm(...n.map((e) => e.denominator));
 		return n.forEach((e) => e.amplify(r / e.denominator)), n;
 	}
 	static unique = (t) => {
@@ -1392,7 +1399,7 @@ var d = {
 		return this.reduce();
 	};
 	amplify = (e) => {
-		if (!Number.isSafeInteger(e)) throw Error("The amplification factor must be a safe integer.");
+		if (!Number.isSafeInteger(e)) throw new i("The amplification factor must be a safe integer.");
 		return this.#r *= e, this.#e *= e, this;
 	};
 	compare = (t, n) => {
@@ -1442,17 +1449,17 @@ var d = {
 	fromNumber(e) {
 		if (Number.isSafeInteger(e)) return this.#r = e, this.#e = 1, this.#n = !0, this;
 		let [, t] = e.toString().split("."), n = t ? t.length : 0, r = 10 ** n;
-		return this.#r = e * r, this.#e = r, this.#r = d.numberCorrection(this.#r), this.#e = d.numberCorrection(this.#e), this.reduce(), this.#n = n < 10, this;
+		return this.#r = e * r, this.#e = r, this.#r = p.numberCorrection(this.#r), this.#e = p.numberCorrection(this.#e), this.reduce(), this.#n = n < 10, this;
 	}
 	fromNumbers(e, t) {
 		return Number.isSafeInteger(e) && Number.isSafeInteger(t) ? (this.#r = e, this.#e = t, this.#n = !0, this) : this.fromNumber(e / t);
 	}
 	fromPeriodic(e, t) {
 		let [, n] = e.toString().split(/[.,]/), r = n ? n.length : 0;
-		if (!Number.isSafeInteger(t) || t <= 0) throw Error("The periodic length must be a positive integer.");
-		if (t > r) throw Error(`The periodic length (${t}) cannot exceed the number of decimal digits (${r}).`);
-		let i = 10 ** r;
-		return this.#r = +e * i - Math.floor(e * 10 ** (r - t)), this.#e = i - 10 ** (r - t), this.#n = !0, this;
+		if (!Number.isSafeInteger(t) || t <= 0) throw new i("The periodic length must be a positive integer.");
+		if (t > r) throw new i(`The periodic length (${t}) cannot exceed the number of decimal digits (${r}).`);
+		let a = 10 ** r;
+		return this.#r = +e * a - Math.floor(e * 10 ** (r - t)), this.#e = a - 10 ** (r - t), this.#n = !0, this;
 	}
 	fromString(e) {
 		let t = e.split("/").map(Number);
@@ -1481,7 +1488,7 @@ var d = {
 	isOne = () => this.#r === 1 && this.#e === 1;
 	isPositive = () => this.sign() === 1;
 	isRational = () => this.exact && !this.isRelative();
-	isReduced = () => Math.abs(d.gcd(this.#r, this.#e)) === 1;
+	isReduced = () => Math.abs(p.gcd(this.#r, this.#e)) === 1;
 	isRelative = () => this.exact && this.clone().reduce().denominator === 1;
 	isSquare = () => Math.sqrt(this.#r) % 1 == 0 && Math.sqrt(this.#e) % 1 == 0;
 	isStrictlyNegative = () => this.value < 0;
@@ -1509,17 +1516,17 @@ var d = {
 		return a === r && o === i ? (this.#r = a, this.#e = o) : (this.#r = r / i, this.#e = 1, this.exact = !1), this;
 	};
 	reduce = () => {
-		let e = d.gcd(this.#r, this.#e);
+		let e = p.gcd(this.#r, this.#e);
 		return this.#r /= e, this.#e /= e, this.#e < 0 && (this.#e = -this.#e, this.#r = -this.#r), this;
 	};
 	root = (e) => {
 		if (e === 0) return this;
-		if (!Number.isSafeInteger(e)) throw Error("The root must be an integer.");
-		if (e < 0 && this.inverse(), this.isNegative() && e % 2 == 0) throw Error("The root of a negative number must be odd.");
+		if (!Number.isSafeInteger(e)) throw new i("The root must be an integer.");
+		if (e < 0 && this.inverse(), this.isNegative() && e % 2 == 0) throw new r("The root of a negative number must be odd.");
 		let t = this.sign();
 		this.abs(), this.reduce();
-		let n = Math.floor(this.#r ** +Math.abs(1 / e)), r = Math.floor(this.#e ** +Math.abs(1 / e));
-		return this.#r **= +Math.abs(1 / e), this.#e **= +Math.abs(1 / e), (n !== this.#r || r !== this.#e) && (this.#r /= this.#e, this.#e = 1, this.exact = !1), this.multiply(t), this;
+		let n = Math.floor(this.#r ** +Math.abs(1 / e)), a = Math.floor(this.#e ** +Math.abs(1 / e));
+		return this.#r **= +Math.abs(1 / e), this.#e **= +Math.abs(1 / e), (n !== this.#r || a !== this.#e) && (this.#r /= this.#e, this.#e = 1, this.exact = !1), this.multiply(t), this;
 	};
 	sign = () => this.#r * this.#e >= 0 ? 1 : -1;
 	sqrt = () => this.root(2);
@@ -1541,7 +1548,7 @@ var d = {
 };
 //#endregion
 //#region src/helpers.ts
-function m(e, t = !0) {
+function se(e, t = !0) {
 	return t ? `\\left( ${e} \\right)` : `(${e})`;
 }
 function h(e) {
@@ -1554,13 +1561,13 @@ function g(e, t, n, r, i) {
 	return e.map((e, a) => r !== void 0 && a < r || i !== void 0 && a > i ? e : e === t ? n : e);
 }
 function _(e, t) {
-	if (t.length !== 1) throw Error(`splitChar must be a single character, got: "${t}"`);
-	let n = 0, r = 0, i = [];
-	for (let a = 0; a < e.length; a++) {
-		let o = e[a];
-		o === "(" ? n++ : o === ")" ? n-- : o === t && n === 0 && (i.push(e.substring(r, a)), r = a + 1);
+	if (t.length !== 1) throw new i(`splitChar must be a single character, got: "${t}"`);
+	let n = 0, r = 0, a = [];
+	for (let i = 0; i < e.length; i++) {
+		let o = e[i];
+		o === "(" ? n++ : o === ")" ? n-- : o === t && n === 0 && (a.push(e.substring(r, i)), r = i + 1);
 	}
-	return i.push(e.substring(r)), i;
+	return a.push(e.substring(r)), a;
 }
 //#endregion
 //#region src/coefficients/root.ts
@@ -1570,16 +1577,16 @@ var v = class e {
 	#n;
 	#r = !1;
 	constructor(e) {
-		return this.#t = 2, this.#e = new p().zero(), this.#n = new p().zero(), e && this.parse(e), this;
+		return this.#t = 2, this.#e = new m().zero(), this.#n = new m().zero(), e && this.parse(e), this;
 	}
 	parse(t) {
 		if (t instanceof e) return this.index = t.index, this.radical = t.radical.clone(), this.factor = t.factor.clone(), this;
-		if (t instanceof p) return this.index = 2, this.factor = t.clone(), this.radical.one(), this;
+		if (t instanceof m) return this.index = 2, this.factor = t.clone(), this.radical.one(), this;
 		if (typeof t == "string") {
 			if (t.includes("sqrt")) return this.#s(t);
 			if (t.includes("root")) return this.#o(t);
 		}
-		return this.index = 2, this.factor = new p(t), this.radical.one(), this;
+		return this.index = 2, this.factor = new m(t), this.radical.one(), this;
 	}
 	clone() {
 		return new e().from(this.index, this.radical, this.factor);
@@ -1599,7 +1606,7 @@ var v = class e {
 	add(t) {
 		this.reduce();
 		let n = new e(t).reduce();
-		if (this.index !== n.index || !this.radical.isEqual(n.radical)) throw Error("Add can only be done with two same index and radical");
+		if (this.index !== n.index || !this.radical.isEqual(n.radical)) throw new r("Add can only be done with two same index and radical");
 		return this.factor.add(n.factor), this;
 	}
 	divide(t) {
@@ -1612,7 +1619,7 @@ var v = class e {
 		this.#e = e;
 	}
 	from(e, t, n) {
-		return this.index = e, this.radical = new p(t), this.factor = n ? new p(n) : new p().one(), this;
+		return this.index = e, this.radical = new m(t), this.factor = n ? new m(n) : new m().one(), this;
 	}
 	group() {
 		return this.radical.multiply(this.factor.pow(this.index)), this.factor.one(), this;
@@ -1621,11 +1628,11 @@ var v = class e {
 		return this.#t;
 	}
 	set index(e) {
-		if (!Number.isSafeInteger(e) || e <= 0) throw Error("Index must be a strictly positive integer.");
+		if (!Number.isSafeInteger(e) || e <= 0) throw new i("Index must be a strictly positive integer.");
 		this.#t = e;
 	}
 	get indexAsPow() {
-		return new p(this.index).inverse();
+		return new m(this.index).inverse();
 	}
 	inverse() {
 		return this.factor.inverse(), this.radical.inverse(), this;
@@ -1650,7 +1657,7 @@ var v = class e {
 			let e = this.indexAsPow.add(n.indexAsPow).reduce();
 			return this.index = e.denominator, this.radical = this.radical.pow(e.numerator), this;
 		}
-		throw Error("Multiply can only be done if radical or index as equals.");
+		throw new r("Multiply can only be done if radical or index as equals.");
 	}
 	one() {
 		return this.radical.one(), this.factor.one(), this;
@@ -1660,7 +1667,7 @@ var v = class e {
 	}
 	pow(e) {
 		this.factor.pow(e);
-		let t = d.gcd(this.index, e);
+		let t = p.gcd(this.index, e);
 		return this.index /= t, this.radical.pow(e / t), this;
 	}
 	get radical() {
@@ -1674,7 +1681,7 @@ var v = class e {
 			let e = this.radical.denominator;
 			this.radical.denominator = 1, this.radical.numerator *= e, this.factor.divide(e);
 		}
-		let e = d.greatestPower(this.radical.value, this.index);
+		let e = p.greatestPower(this.radical.value, this.index);
 		return this.factor.multiply(e ** (1 / this.index)), this.radical.divide(e), this;
 	}
 	root(e) {
@@ -1688,7 +1695,7 @@ var v = class e {
 		return this.add(n.opposite());
 	}
 	get value() {
-		return d.numberCorrection(this.factor.value * this.radical.value ** (1 / this.index));
+		return p.numberCorrection(this.factor.value * this.radical.value ** (1 / this.index));
 	}
 	get withSign() {
 		return this.#r = !0, this;
@@ -1708,14 +1715,14 @@ var v = class e {
 		return r.length === 0 ? null : r.join(" ");
 	}
 	#o(e) {
-		let t = /^(.*?)root\((\d+)\)\(?([^)]+)/.exec(e);
-		if (!t) throw Error(`Invalid root format: "${e}"`);
-		let [, n, r, i] = t;
-		return this.index = +r, this.radical = new p(i), this.factor = n === "" ? new p().one() : new p(n.trim()), this;
+		let n = /^(.*?)root\((\d+)\)\(?([^)]+)/.exec(e);
+		if (!n) throw new t(`Invalid root format: "${e}"`);
+		let [, r, i, a] = n;
+		return this.index = +i, this.radical = new m(a), this.factor = r === "" ? new m().one() : new m(r.trim()), this;
 	}
 	#s(e) {
 		let [t, n] = e.split("sqrt");
-		return this.index = 2, this.radical = new p(h(n)), this.factor = t === "" ? new p().one() : new p(t), this;
+		return this.index = 2, this.radical = new m(h(n)), this.factor = t === "" ? new m().one() : new m(t), this;
 	}
 }, y = class e {
 	#e;
@@ -1726,13 +1733,13 @@ var v = class e {
 	#a;
 	#o;
 	constructor() {
-		this.#o = "x", this.#n = !1, this.#t = null, this.#a = null, this.#r = new p().zero(), this.#i = new v(), this.#e = 1;
+		this.#o = "x", this.#n = !1, this.#t = null, this.#a = null, this.#r = new m().zero(), this.#i = new v(), this.#e = 1;
 	}
 	get tex() {
 		if (this.#a) return this.#a;
 		if (this.#i.isZero()) return this.#r.tex;
 		if (this.#r.isZero()) return this.#i.tex;
-		let [e] = p.toSameDenominateur(this.#r, this.#i.factor), t = this.#i.clone().multiply(e.denominator).reduce(), n = `${e.numerator} ${t.withSign.tex}`;
+		let [e] = m.toSameDenominateur(this.#r, this.#i.factor), t = this.#i.clone().multiply(e.denominator).reduce(), n = `${e.numerator} ${t.withSign.tex}`;
 		return e.denominator === 1 ? n : `\\frac{ ${n} }{ ${e.denominator} }`;
 	}
 	set tex(e) {
@@ -1742,7 +1749,7 @@ var v = class e {
 		if (this.#t) return this.#t;
 		if (this.#i.isZero()) return this.#r.display;
 		if (this.#r.isZero()) return this.#i.display;
-		let [e] = p.toSameDenominateur(this.#r, this.#i.factor), t = this.#i.clone().multiply(e.denominator).reduce(), n = `${e.numerator}${t.withSign.display}`;
+		let [e] = m.toSameDenominateur(this.#r, this.#i.factor), t = this.#i.clone().multiply(e.denominator).reduce(), n = `${e.numerator}${t.withSign.display}`;
 		return e.denominator === 1 ? n : `(${n})/${e.denominator}`;
 	}
 	set display(e) {
@@ -1751,7 +1758,7 @@ var v = class e {
 	static fromFraction(t) {
 		let n = new e();
 		n.setExact();
-		let r = new p(t);
+		let r = new m(t);
 		return n.display = r.display, n.tex = r.tex, n.fraction = r, n.root = new v(), n;
 	}
 	static fromQuadratic(t, n, r) {
@@ -1759,7 +1766,7 @@ var v = class e {
 			t,
 			n,
 			r
-		].map((e) => new p(e)), s = a.clone().pow(2).subtract(i.clone().multiply(o).multiply(4));
+		].map((e) => new m(e)), s = a.clone().pow(2).subtract(i.clone().multiply(o).multiply(4));
 		if (s.isNegative()) return [];
 		if (s.isSquare()) {
 			let t = s.sqrt(), n = a.clone().opposite().subtract(t).divide(i.clone().multiply(2)), r = a.clone().opposite().add(t).divide(i.clone().multiply(2));
@@ -1812,11 +1819,11 @@ var v = class e {
 	set variable(e) {
 		e !== void 0 && (this.#o = e);
 	}
-}, ee = class {
+}, ce = class {
 	#e;
 	#t;
 	constructor(e) {
-		e instanceof M || e instanceof A ? this.#e = new M(e) : this.#e = new M().fromPolynom(e), this.#t = this.#e.getRoots();
+		this.#e = e instanceof R || e instanceof P ? new R(e) : new R().fromPolynom(e), this.#t = this.#e.getRoots();
 	}
 	get fx() {
 		return this.#e;
@@ -1854,15 +1861,15 @@ var v = class e {
 		return r.degree().isZero() ? n : r.degree().value <= 2 ? n.concat(new e(r.clone()).solve()) : (this._ = 0, n.concat(this.#a(r)).sort((e, t) => e.value - t.value));
 	}
 	solveAsCardan() {
-		if (this.#t.degree().value !== 3) throw Error("The equation is not cubic.");
+		if (this.#t.degree().value !== 3) throw new r("The equation is not cubic.");
 		return this.#u();
 	}
 	#r(e, t) {
 		let n = new y();
-		return n.exact = !1, n.tex = t?.tex ?? null, n.display = t?.display ?? null, n.fraction = new p(e), n.fraction.exact = !1, n.variable = this.#n, n;
+		return n.exact = !1, n.tex = t?.tex ?? null, n.display = t?.display ?? null, n.fraction = new m(e), n.fraction.exact = !1, n.variable = this.#n, n;
 	}
 	#i(e) {
-		return e instanceof p && !e.exact ? this.#r(e.value) : y.fromFraction(e);
+		return e instanceof m && !e.exact ? this.#r(e.value) : y.fromFraction(e);
 	}
 	#a(e) {
 		let t = [], n = e.degree().value, [r, ...i] = e.getCoefficients(), a = 2 + Math.max(...i.map((e) => e.value / r.value)), o = this.#s(e, a, 100);
@@ -1890,7 +1897,7 @@ var v = class e {
 	#s(e, t, n) {
 		let r = [], i = 2 * t / n;
 		for (let n = -t; n <= t; n += i) {
-			let t = d.numberCorrection(n);
+			let t = p.numberCorrection(n);
 			r.push({
 				x: t,
 				fx: e.evaluate(t, !0)
@@ -1915,9 +1922,9 @@ var v = class e {
 			let e = t.monoms.reduce((e, t) => t.degree().value < e.degree().value ? t : e), r = e.coefficient;
 			e.clone().divide(r), t.divide(e);
 		}
-		let o = d.dividers(i.value), s = d.dividers(a.value), c = [];
+		let o = p.dividers(i.value), s = p.dividers(a.value), c = [];
 		for (let e of o) for (let t of s) {
-			let n = new p(t, e);
+			let n = new m(t, e);
 			c.find((e) => e.value === n.value) || (c.push(n.clone()), c.push(n.opposite().clone()));
 		}
 		c.forEach((e) => {
@@ -1976,19 +1983,27 @@ var v = class e {
 	}
 	#p(e, t, n) {
 		let r = e.clone().multiply(2), i = new y();
-		i.fraction = t.clone().opposite().divide(r.clone()), i.root.radical = n.clone(), i.root.factor = new p().one().divide(r.clone()), i.exact = !0;
+		i.fraction = t.clone().opposite().divide(r.clone()), i.root.radical = n.clone(), i.root.factor = new m().one().divide(r.clone()), i.exact = !0;
 		let a = new y();
-		return a.fraction = t.clone().opposite().divide(r.clone()), a.root.radical = n.clone(), a.root.factor = new p().one().divide(r.clone()).opposite(), a.exact = !0, [i, a].sort((e, t) => e.value - t.value);
+		return a.fraction = t.clone().opposite().divide(r.clone()), a.root.radical = n.clone(), a.root.factor = new m().one().divide(r.clone()).opposite(), a.exact = !0, [i, a].sort((e, t) => e.value - t.value);
 	}
-}, x = {
+}, le = class extends Error {
+	constructor(e, t) {
+		super(e, t), this.name = new.target.name;
+	}
+}, x = class extends le {}, S = class extends le {}, ue = class extends S {}, C = {
 	pi: Math.PI,
 	e: Math.exp(1)
-}, S = /* @__PURE__ */ ((e) => (e.VARIABLE = "variable", e.COEFFICIENT = "coefficient", e.OPERATION = "operation", e.CONSTANT = "constant", e.FUNCTION = "function", e.FUNCTION_ARGUMENT = "function-argument", e.MONOM = "monom", e.LEFT_PARENTHESIS = "(", e.RIGHT_PARENTHESIS = ")", e))(S || {}), C = /* @__PURE__ */ ((e) => (e.EXPRESSION = "expression", e.POLYNOM = "polynom", e.SET = "set", e.NUMERIC = "numeric", e))(C || {});
-function te(e, t) {
-	if (e.length <= 1) return e;
-	let n = Object.keys(t).filter((e) => t[e].type === S.FUNCTION).map((e) => e);
+}, w = /* @__PURE__ */ function(e) {
+	return e.VARIABLE = "variable", e.COEFFICIENT = "coefficient", e.OPERATION = "operation", e.CONSTANT = "constant", e.FUNCTION = "function", e.FUNCTION_ARGUMENT = "function-argument", e.MONOM = "monom", e.LEFT_PARENTHESIS = "(", e.RIGHT_PARENTHESIS = ")", e;
+}({}), T = /* @__PURE__ */ function(e) {
+	return e.EXPRESSION = "expression", e.POLYNOM = "polynom", e.SET = "set", e.NUMERIC = "numeric", e;
+}({});
+function de(e, t) {
+	if (e = e.replace(/\s+/g, ""), e.length <= 1) return e;
+	let n = Object.keys(t).filter((e) => t[e].type === w.FUNCTION).map((e) => e);
 	n.sort((e, t) => t.length - e.length);
-	let r = RegExp(`^(${n.join("|")})\\(`), i = Object.keys(x);
+	let r = RegExp(`^(${n.join("|")})\\(`), i = Object.keys(C);
 	i.sort((e, t) => t.length - e.length);
 	let a = RegExp(`^(${i.join("|")})`), o = /^(\d+(\.\d+)?)/, s = "", c, l, u;
 	for (n.forEach((t) => {
@@ -1997,224 +2012,174 @@ function te(e, t) {
 			e = e.replaceAll(n, `${t}($1)`);
 		}
 	}); e.length > 0;) {
-		if (c = l, u = void 0, n.length > 0 && r.exec(e)) {
+		c = l, u = void 0;
+		let t = n.find((t) => e.startsWith(t));
+		if (t !== void 0 && e[t.length] !== "(") throw new x(`Function "${t}" must be followed by parentheses`);
+		if (n.length > 0 && r.exec(e)) {
 			let t = n.find((t) => e.startsWith(t));
-			t && (u = t + "(", e = e.slice(t.length + 1), l = S.FUNCTION);
+			t && (u = t + "(", e = e.slice(t.length + 1), l = w.FUNCTION);
 		} else if (i.length > 0 && a.exec(e)) {
 			let t = i.find((t) => e.startsWith(t));
-			t && (u = t, e = e.slice(t.length), l = S.CONSTANT);
+			t && (u = t, e = e.slice(t.length), l = w.CONSTANT);
 		} else if (o.exec(e)) {
 			let t = o.exec(e);
-			t && (u = t[0], e = e.slice(t[0].length), l = S.COEFFICIENT);
+			t && (u = t[0], e = e.slice(t[0].length), l = w.COEFFICIENT);
 		} else switch (u = e[0], e = e.slice(1), u) {
 			case "(":
-				l = S.LEFT_PARENTHESIS;
+				l = w.LEFT_PARENTHESIS;
 				break;
 			case ")":
-				l = S.RIGHT_PARENTHESIS;
+				l = w.RIGHT_PARENTHESIS;
 				break;
 			case ",":
-				l = S.FUNCTION_ARGUMENT;
+				l = w.FUNCTION_ARGUMENT;
 				break;
 			case "+":
 			case "-":
 			case "*":
 			case "/":
 			case "^":
-				l = S.OPERATION;
+			case "%":
+				l = w.OPERATION;
 				break;
-			default: l = S.VARIABLE;
+			default: l = w.VARIABLE;
 		}
 		if (u === void 0 || l === void 0) throw Error("The token is undefined");
-		s += ne(c, l), s += u;
+		s += fe(c, l), s += u;
 	}
 	return s;
 }
-function ne(e, t) {
-	return e === void 0 || e === S.OPERATION || t === S.OPERATION || e === S.LEFT_PARENTHESIS || e === S.FUNCTION || e === S.FUNCTION_ARGUMENT || t === S.RIGHT_PARENTHESIS || t === S.FUNCTION_ARGUMENT ? "" : "*";
+function fe(e, t) {
+	return e === void 0 || e === w.OPERATION || t === w.OPERATION || e === w.LEFT_PARENTHESIS || e === w.FUNCTION || e === w.FUNCTION_ARGUMENT || t === w.RIGHT_PARENTHESIS || t === w.FUNCTION_ARGUMENT ? "" : "*";
 }
-var re = {
+var pe = {
 	"^": {
 		precedence: 4,
 		associative: "right",
-		type: S.OPERATION
+		type: w.OPERATION
 	},
 	"*": {
 		precedence: 3,
 		associative: "left",
-		type: S.OPERATION
+		type: w.OPERATION
 	},
 	"/": {
 		precedence: 3,
 		associative: "left",
-		type: S.OPERATION
+		type: w.OPERATION
 	},
 	"+": {
 		precedence: 2,
 		associative: "left",
-		type: S.OPERATION
+		type: w.OPERATION
 	},
 	"-": {
 		precedence: 2,
 		associative: "left",
-		type: S.OPERATION
-	}
-}, ie = {
-	"^": {
-		precedence: 4,
-		associative: "right",
-		type: S.OPERATION
+		type: w.OPERATION
 	},
-	"*": {
+	"%": {
 		precedence: 3,
 		associative: "left",
-		type: S.OPERATION
+		type: w.OPERATION
 	},
-	"/": {
+	"&": {
 		precedence: 3,
 		associative: "left",
-		type: S.OPERATION
-	},
-	"+": {
-		precedence: 2,
-		associative: "left",
-		type: S.OPERATION
+		type: w.OPERATION
 	},
-	"-": {
-		precedence: 2,
+	"|": {
+		precedence: 3,
 		associative: "left",
-		type: S.OPERATION
+		type: w.OPERATION
 	},
-	"%": {
-		precedence: 3,
+	"!": {
+		precedence: 4,
 		associative: "right",
-		type: S.OPERATION
+		type: w.OPERATION
 	},
 	sin: {
 		precedence: 4,
 		associative: "right",
-		type: S.FUNCTION
+		type: w.FUNCTION,
+		arity: 1
 	},
 	cos: {
 		precedence: 4,
 		associative: "right",
-		type: S.FUNCTION
+		type: w.FUNCTION,
+		arity: 1
 	},
 	tan: {
 		precedence: 4,
 		associative: "right",
-		type: S.FUNCTION
-	},
-	sqrt: {
-		precedence: 4,
-		associative: "right",
-		type: S.FUNCTION
-	},
-	nthrt: {
-		precedence: 4,
-		associative: "right",
-		type: S.FUNCTION
-	},
-	",": {
-		precedence: 2,
-		associative: "left",
-		type: S.FUNCTION_ARGUMENT
-	}
-}, ae = {
-	"^": {
-		precedence: 4,
-		associative: "right",
-		type: S.OPERATION
-	},
-	"*": {
-		precedence: 3,
-		associative: "left",
-		type: S.OPERATION
-	},
-	"/": {
-		precedence: 3,
-		associative: "left",
-		type: S.OPERATION
-	},
-	"+": {
-		precedence: 2,
-		associative: "left",
-		type: S.OPERATION
-	},
-	"-": {
-		precedence: 2,
-		associative: "left",
-		type: S.OPERATION
-	},
-	"%": {
-		precedence: 3,
-		associative: "right",
-		type: S.OPERATION
+		type: w.FUNCTION,
+		arity: 1
 	},
-	sin: {
+	asin: {
 		precedence: 4,
 		associative: "right",
-		type: S.FUNCTION
+		type: w.FUNCTION,
+		arity: 1
 	},
-	cos: {
+	acos: {
 		precedence: 4,
 		associative: "right",
-		type: S.FUNCTION
+		type: w.FUNCTION,
+		arity: 1
 	},
-	tan: {
+	atan: {
 		precedence: 4,
 		associative: "right",
-		type: S.FUNCTION
+		type: w.FUNCTION,
+		arity: 1
 	},
 	sqrt: {
 		precedence: 4,
 		associative: "right",
-		type: S.FUNCTION
+		type: w.FUNCTION,
+		arity: 1
 	},
 	nthrt: {
 		precedence: 4,
 		associative: "right",
-		type: S.FUNCTION
+		type: w.FUNCTION,
+		arity: 2
 	},
 	ln: {
 		precedence: 4,
 		associative: "right",
-		type: S.FUNCTION
+		type: w.FUNCTION,
+		arity: 1
 	},
 	log: {
 		precedence: 4,
 		associative: "right",
-		type: S.FUNCTION
-	}
-}, oe = {
-	"&": {
-		precedence: 3,
-		associative: "left",
-		type: S.OPERATION
-	},
-	"|": {
-		precedence: 3,
-		associative: "left",
-		type: S.OPERATION
+		type: w.FUNCTION,
+		arity: 1
 	},
-	"!": {
+	logn: {
 		precedence: 4,
 		associative: "right",
-		type: S.OPERATION
-	},
-	"-": {
-		precedence: 2,
-		associative: "left",
-		type: S.OPERATION
+		type: w.FUNCTION,
+		arity: 2
 	}
-}, w = class {
+};
+function E(...e) {
+	let t = {};
+	for (let n of e) t[n] = pe[n];
+	return t;
+}
+var me = {};
+for (let [e, t] of Object.entries(pe)) t.type === w.FUNCTION && (me[e] = t.arity ?? 1);
+var he = E("^", "*", "/", "+", "-"), D = E("^", "*", "/", "+", "-", "%", "sin", "cos", "tan", "asin", "acos", "atan", "sqrt", "nthrt", "ln", "log", "logn"), ge = D, _e = E("&", "|", "!", "-"), O = class {
 	#e;
 	#t = [];
 	#n = {};
 	#r = [];
 	#i;
 	constructor(e) {
-		this.#e = typeof e > "u" ? C.POLYNOM : e, this.tokenConfigInitialization();
+		this.#e = e === void 0 ? T.POLYNOM : e, this.tokenConfigInitialization();
 	}
 	get rpn() {
 		return this.#t;
@@ -2223,211 +2188,216 @@ var re = {
 		return this.#t.map((e) => e.token);
 	}
 	tokenConfigInitialization() {
-		return this.#e === C.SET ? (this.#n = oe, this.#i = !1) : this.#e === C.NUMERIC ? (this.#n = ae, this.#i = !0) : this.#e === C.EXPRESSION ? (this.#n = ie, this.#i = !0) : (this.#n = re, this.#i = !0), this.#r = Object.keys(this.#n).sort((e, t) => t.length - e.length), this.#n;
+		return this.#e === T.SET ? (this.#n = _e, this.#i = !1) : this.#e === T.NUMERIC ? (this.#n = D, this.#i = !0) : this.#e === T.EXPRESSION ? (this.#n = ge, this.#i = !0) : (this.#n = he, this.#i = !0), this.#r = Object.keys(this.#n).sort((e, t) => t.length - e.length), this.#n;
 	}
 	NextToken(e, t) {
 		let n, r;
-		if (n = "", r = void 0, e[t] === "(") n = "(", r = S.LEFT_PARENTHESIS;
-		else if (e[t] === ")") n = ")", r = S.RIGHT_PARENTHESIS;
-		else if (e[t] === ",") n = ",", r = S.FUNCTION_ARGUMENT;
+		if (n = "", r = void 0, e[t] === "(") n = "(", r = w.LEFT_PARENTHESIS;
+		else if (e[t] === ")") n = ")", r = w.RIGHT_PARENTHESIS;
+		else if (e[t] === ",") n = ",", r = w.FUNCTION_ARGUMENT;
 		else {
 			for (let i of this.#r) if (e.substring(t, t + i.length) === i) {
 				n += i, r = this.#n[i].type;
 				break;
 			}
-			for (let i in x) if (e.substring(t, t + i.length) === i) {
-				n += i, r = S.CONSTANT;
+			for (let i in C) if (e.substring(t, t + i.length) === i) {
+				n += i, r = w.CONSTANT;
 				break;
 			}
 			if (n === "") if (/[0-9.]/.exec(e[t])) {
 				let i = /^([0-9.]+)/.exec(e.substring(t));
-				n = i ? i[0] : "", r = S.COEFFICIENT;
+				n = i ? i[0] : "", r = w.COEFFICIENT;
 			} else if (/[a-zA-Z]/.exec(e[t])) {
 				let i = /^([a-zA-Z])/.exec(e.substring(t));
-				n = i ? i[0] : "", r = S.VARIABLE;
-			} else console.log("Unidentified token", e[t], e, t), n = e[t], r = S.MONOM;
+				n = i ? i[0] : "", r = w.VARIABLE;
+			} else throw new x(`Unknown token "${e[t]}" at position ${t} in "${e}"`);
 		}
-		if (r === void 0) throw Error(`Token type is undefined for token ${n}`);
-		return [
-			n,
-			t + n.length,
-			r
-		];
+		if (r === void 0) throw new x(`Token type is undefined for token ${n}`);
+		return {
+			token: n,
+			nextPos: t + n.length,
+			type: r
+		};
 	}
 	parse(e, t) {
-		let n = [], r = [], i = "", a = 0, o;
-		(t ?? this.#i) && (e = te(e, this.#n));
-		let s = 50, c;
-		for (; a < e.length;) {
-			if (s--, s === 0) {
-				console.log("SECURITY LEVEL 1 EXIT");
-				break;
-			}
-			switch ([i, a, o] = this.NextToken(e, a), o) {
-				case S.MONOM:
-				case S.COEFFICIENT:
-				case S.VARIABLE:
-				case S.CONSTANT:
+		let n = [], r = [], i = 0;
+		for ((t ?? this.#i) && (e = de(e, this.#n)); i < e.length;) {
+			let t = i, { token: a, nextPos: o, type: s } = this.NextToken(e, i);
+			if (i = o, i <= t) throw new x(`Parser stalled at position ${t} in "${e}"`);
+			switch (s) {
+				case w.COEFFICIENT:
+				case w.VARIABLE:
+				case w.CONSTANT:
 					n.push({
-						token: i,
-						tokenType: o
+						token: a,
+						tokenType: s
 					});
 					break;
-				case S.OPERATION:
+				case w.OPERATION:
 					if (r.length > 0) {
 						let e = r[r.length - 1];
-						for (c = 50; e.token in this.#n && (this.#n[i].associative === "left" && this.#n[i].precedence <= this.#n[e.token].precedence || this.#n[i].associative === "right" && this.#n[i].precedence < this.#n[e.token].precedence);) {
-							if (c--, c === 0) {
-								console.log("SECURITY LEVEL 2 OPERATION EXIT");
-								break;
-							}
-							if (n.push(r.pop() ?? {
-								token: "",
-								tokenType: S.OPERATION
-							}), r.length === 0) break;
-							e = r[r.length - 1];
-						}
+						for (; e.token in this.#n && (this.#n[a].associative === "left" && this.#n[a].precedence <= this.#n[e.token].precedence || this.#n[a].associative === "right" && this.#n[a].precedence < this.#n[e.token].precedence) && (n.push(r.pop() ?? {
+							token: "",
+							tokenType: w.OPERATION
+						}), r.length !== 0);) e = r[r.length - 1];
 					}
 					r.push({
-						token: i,
-						tokenType: o
+						token: a,
+						tokenType: s
 					});
 					break;
-				case S.FUNCTION_ARGUMENT:
-					for (c = 50; r[r.length - 1].token !== "(" && r.length > 0;) {
-						if (c--, c === 0) {
-							console.log("SECURITY LEVEL 2 FUNCTION ARGUMENT EXIT");
-							break;
-						}
-						n.push(r.pop() ?? {
-							token: i,
-							tokenType: o
-						});
-					}
+				case w.FUNCTION_ARGUMENT:
+					for (; r.length > 0 && r[r.length - 1].token !== "(";) n.push(r.pop() ?? {
+						token: a,
+						tokenType: s
+					});
+					if (r.length === 0) throw new x(`Misplaced argument separator ',' in "${e}"`);
 					break;
-				case S.LEFT_PARENTHESIS:
+				case w.LEFT_PARENTHESIS:
 					r.push({
-						token: i,
-						tokenType: o
-					}), e[a] === "-" && n.push({
+						token: a,
+						tokenType: s
+					}), e[i] === "-" && n.push({
 						token: "0",
-						tokenType: S.COEFFICIENT
+						tokenType: w.COEFFICIENT
 					});
 					break;
-				case S.RIGHT_PARENTHESIS:
-					for (c = 50; r[r.length - 1].token !== "(" && r.length > 1;) {
-						if (c--, c === 0) {
-							console.log("SECURITY LEVEL 2 CLOSING PARENTHESIS EXIT");
-							break;
-						}
-						n.push(r.pop() ?? {
-							token: i,
-							tokenType: o
-						});
-					}
+				case w.RIGHT_PARENTHESIS:
+					for (; r.length > 0 && r[r.length - 1].token !== "(";) n.push(r.pop() ?? {
+						token: a,
+						tokenType: s
+					});
+					if (r.length === 0) throw new x(`Mismatched parentheses (unexpected ')') in "${e}"`);
 					r.pop();
 					break;
-				case S.FUNCTION:
+				case w.FUNCTION:
 					r.push({
-						token: i,
-						tokenType: o
+						token: a,
+						tokenType: s
 					});
 					break;
-				default: throw Error(`Token type ${i} is not handled`);
+				default: throw new x(`Token type ${a} is not handled`);
 			}
 		}
+		if (r.some((e) => e.token === "(")) throw new x(`Mismatched parentheses (unclosed '(') in "${e}"`);
 		return this.#t = n.concat(r.reverse()), this;
 	}
-}, T = class {
+}, k = class {
 	_rpn;
 	_expression;
-	_isValid;
 	constructor(e, t) {
 		this._expression = e;
 		try {
-			this._rpn = new w(C.NUMERIC).parse(e, t).rpn;
+			this._rpn = new O(T.NUMERIC).parse(e, t).rpn;
 		} catch (t) {
-			throw this._rpn = null, this._isValid = !1, console.warn(t), /* @__PURE__ */ Error(`There was a problem parsing: ${e}`);
+			throw new x(`There was a problem parsing: ${e}`, { cause: t });
 		}
 	}
 	get rpn() {
-		return this._rpn ?? [];
-	}
-	get isValid() {
-		if (this._isValid === void 0) try {
-			this.evaluate({ x: 2 });
-		} catch {
-			this._isValid = !1;
-		}
-		return this._isValid ?? !1;
-	}
-	set isValid(e) {
-		this._isValid = e;
+		return this._rpn;
 	}
 	get expression() {
 		return this._expression;
 	}
+	get variables() {
+		let e = /* @__PURE__ */ new Set();
+		for (let t of this._rpn) t.tokenType === w.VARIABLE && e.add(t.token);
+		return [...e];
+	}
+	isValid(e) {
+		return this._isStructurallyValid() ? this.variables.every((t) => e !== void 0 && Object.hasOwn(e, t)) : !1;
+	}
+	_isStructurallyValid() {
+		let e = 0;
+		for (let t of this._rpn) switch (t.tokenType) {
+			case w.COEFFICIENT:
+			case w.VARIABLE:
+			case w.CONSTANT:
+				e += 1;
+				break;
+			case w.OPERATION:
+				if (e < 2) return !1;
+				--e;
+				break;
+			case w.FUNCTION: {
+				let n = me[t.token] ?? 1;
+				if (e < n) return !1;
+				e += 1 - n;
+				break;
+			}
+			default: return !1;
+		}
+		return e === 1;
+	}
 	evaluate(e) {
 		let t = [];
-		if (this._rpn === null) return this._isValid = !1, 0;
-		this._isValid = !0;
-		for (let n of this._rpn) if (n.tokenType === S.COEFFICIENT) if (!isNaN(+n.token)) t.push(+n.token);
-		else {
-			let e = n.token.split("/");
-			if (e.length !== 2) throw this._isValid = !1, /* @__PURE__ */ Error("This coefficient is not a fraction");
-			t.push(e[0] / +e[1]);
-		}
-		else if (n.tokenType === S.VARIABLE && e !== void 0) Object.hasOwn(e, n.token) && t.push(+e[n.token]);
-		else if (n.tokenType === S.CONSTANT) t.push(x[n.token]);
-		else if (n.tokenType === S.OPERATION) {
+		for (let n of this._rpn) if (n.tokenType === w.COEFFICIENT) t.push(+n.token);
+		else if (n.tokenType === w.VARIABLE) {
+			if (e === void 0 || !Object.hasOwn(e, n.token)) throw new ue(`Missing value for variable "${n.token}"`);
+			t.push(e[n.token]);
+		} else if (n.tokenType === w.CONSTANT) t.push(C[n.token]);
+		else if (n.tokenType === w.OPERATION) {
 			if (n.token === "*") {
 				let e = t.pop(), n = t.pop();
-				if (n === void 0 || e === void 0) throw this._isValid = !1, /* @__PURE__ */ Error(`The multiplication factors ${n ?? "a"} or ${e ?? "b"} are not defined`);
+				if (n === void 0 || e === void 0) throw new S(`The multiplication factors ${n ?? "a"} or ${e ?? "b"} are not defined`);
 				t.push(n * e);
 			} else if (n.token === "/") {
 				let e = t.pop(), n = t.pop();
-				if (n === void 0 || e === void 0) throw this._isValid = !1, /* @__PURE__ */ Error(`The division values ${n ?? "a"} or ${e ?? "b"} are not defined`);
+				if (n === void 0 || e === void 0) throw new S(`The division values ${n ?? "a"} or ${e ?? "b"} are not defined`);
 				t.push(n / e);
 			} else if (n.token === "+") {
 				let e = t.pop(), n = t.pop();
-				if (n === void 0 || e === void 0) throw this._isValid = !1, /* @__PURE__ */ Error(`The addition values ${n ?? "a"} or ${e ?? "b"} are not defined`);
-				t.push(+n + +e);
+				if (n === void 0 || e === void 0) throw new S(`The addition values ${n ?? "a"} or ${e ?? "b"} are not defined`);
+				t.push(n + e);
 			} else if (n.token === "-") {
 				let e = t.pop(), n = t.pop() ?? 0;
-				if (e === void 0) throw this._isValid = !1, /* @__PURE__ */ Error("The subtraction value b is  not defined");
+				if (e === void 0) throw new S("The subtraction value b is  not defined");
 				t.push(n - e);
+			} else if (n.token === "%") {
+				let e = t.pop(), n = t.pop();
+				if (n === void 0 || e === void 0) throw new S(`The modulo values ${n ?? "a"} or ${e ?? "b"} are not defined`);
+				t.push(n % e);
 			} else if (n.token === "^") {
 				let e = t.pop(), n = t.pop();
-				if (n === void 0 || e === void 0) throw this._isValid = !1, /* @__PURE__ */ Error(`The base value ${n ?? "a"} or exponent ${e ?? "b"} are not defined`);
+				if (n === void 0 || e === void 0) throw new S(`The base value ${n ?? "a"} or exponent ${e ?? "b"} are not defined`);
 				t.push(n ** +e);
 			}
-		} else if (n.tokenType === S.FUNCTION) {
+		} else if (n.tokenType === w.FUNCTION) {
 			let e = t.pop();
-			if (e === void 0) throw this._isValid = !1, /* @__PURE__ */ Error(`The parameters for ${n.token} is not defined`);
+			if (e === void 0) throw new S(`The parameters for ${n.token} is not defined`);
 			if (n.token === "sin") t.push(Math.sin(e));
 			else if (n.token === "cos") t.push(Math.cos(e));
 			else if (n.token === "tan") t.push(Math.tan(e));
+			else if (n.token === "asin") t.push(Math.asin(e));
+			else if (n.token === "acos") t.push(Math.acos(e));
+			else if (n.token === "atan") t.push(Math.atan(e));
 			else if (n.token === "sqrt") t.push(Math.sqrt(e));
 			else if (n.token === "nthrt") {
 				let n = t.pop();
-				if (n === void 0) throw this._isValid = !1, /* @__PURE__ */ Error("The nthrt function requires two parameters");
+				if (n === void 0) throw new S("The nthrt function requires two parameters");
 				e % 2 == 0 && n < 0 ? t.push(NaN) : t.push((n < 0 ? -1 : 1) * Math.abs(n) ** (1 / e));
-			} else n.token === "ln" ? t.push(Math.log(e)) : n.token === "log" && t.push(Math.log10(e));
+			} else if (n.token === "ln") t.push(Math.log(e));
+			else if (n.token === "log") t.push(Math.log10(e));
+			else if (n.token === "logn") {
+				let n = t.pop();
+				if (n === void 0) throw new S("The logn function requires two parameters");
+				e <= 0 || e === 1 || n <= 0 ? t.push(NaN) : t.push(Math.log(n) / Math.log(e));
+			}
 		}
 		if (t.length === 1) return this._numberCorrection(t[0]);
-		throw Error(`There was a problem parsing: ${this._expression}`);
+		throw new S(`There was a problem parsing: ${this._expression}`);
 	}
 	_numberCorrection(e, t = 8) {
 		return +e.toFixed(t);
 	}
-}, E = class e {
+}, A = class e {
 	#e;
 	#t;
 	constructor(e) {
-		return this.#e = new p().zero(), this.#t = {}, e !== void 0 && this.parse(e), this;
+		return this.#e = new m().zero(), this.#t = {}, e !== void 0 && this.parse(e), this;
 	}
 	parse(t) {
-		return this.#e = new p(), this.#t = {}, t instanceof e ? (this.#e = t.#e.clone(), this.#n(t), this) : t instanceof p ? (this.#e = t.clone(), this) : typeof t == "number" ? (this.#e = new p(t), this) : (isNaN(Number(t)) ? this.#s(t) : this.#e = new p(Number(t)), this);
+		return this.#e = new m(), this.#t = {}, t instanceof e ? (this.#e = t.#e.clone(), this.#n(t), this) : t instanceof m ? (this.#e = t.clone(), this) : typeof t == "number" ? (this.#e = new m(t), this) : (isNaN(Number(t)) ? this.#s(t) : this.#e = new m(Number(t)), this);
 	}
 	clone = () => {
 		let t = new e();
@@ -2444,10 +2414,10 @@ var re = {
 	static gcd = (...t) => {
 		for (let n of t) if (n.containsRationalPower()) return new e().zero();
 		let n = new e();
-		n.coefficient = new p(d.gcd(...t.map((e) => e.coefficient.numerator)), d.lcm(...t.map((e) => e.coefficient.denominator))).reduce();
+		n.coefficient = new m(p.gcd(...t.map((e) => e.coefficient.numerator)), p.lcm(...t.map((e) => e.coefficient.denominator))).reduce();
 		for (let e of t) {
 			for (let t in n.literal) t in e.literal || n.removeVariable(t);
-			for (let t in e.literal) !n.hasVariable(t) && e.literal[t].isStrictlyPositive() ? n.literal[t] = e.literal[t].clone() : n.literal[t] = new p(Math.min(e.literal[t].value, n.literal[t].value));
+			for (let t in e.literal) !n.hasVariable(t) && e.literal[t].isStrictlyPositive() ? n.literal[t] = e.literal[t].clone() : n.literal[t] = new m(Math.min(e.literal[t].value, n.literal[t].value));
 		}
 		return n;
 	};
@@ -2460,7 +2430,7 @@ var re = {
 		for (let n of t) {
 			let t = n instanceof e ? n : new e(n);
 			if (this.isSameAs(t)) this.isZero() && this.#n(t), this.#e.add(t.coefficient);
-			else throw Error("Add monom: " + this.display + " is not similar with " + t.display);
+			else throw new r("Add monom: " + this.display + " is not similar with " + t.display);
 		}
 		return this;
 	};
@@ -2468,15 +2438,16 @@ var re = {
 		return this.#e;
 	}
 	set coefficient(e) {
-		this.#e = new p(e);
+		this.#e = new m(e);
 	}
 	containsRationalPower = () => Object.values(this.#t).some((e) => e.isRational());
-	degree = (e) => this.variables.length === 0 ? new p().zero() : e === void 0 ? Object.values(this.#t).reduce((e, t) => e.clone().add(t)) : this.hasVariable(e) ? this.#t[e].clone() : new p().zero();
+	degree = (e) => this.variables.length === 0 ? new m().zero() : e === void 0 ? Object.values(this.#t).reduce((e, t) => e.clone().add(t)) : this.hasVariable(e) ? this.#t[e].clone() : new m().zero();
 	derivative = (t = "x") => {
 		if (this.hasVariable(t)) {
 			let e = this.#t[t].clone(), n = this.clone();
-			return n.#t[t].subtract(1), n.#e.multiply(new p(e.clone())), n;
-		} else return new e().zero();
+			return n.#t[t].subtract(1), n.#e.multiply(new m(e.clone())), n;
+		}
+		return new e().zero();
 	};
 	divide = (...t) => {
 		for (let n of t) {
@@ -2488,42 +2459,42 @@ var re = {
 	};
 	get dividers() {
 		if (!this.coefficient.isRelative() || this.containsRationalPower() || this.coefficient.numerator > 1e6) return [this.clone()];
-		let t = d.dividers(Math.abs(this.coefficient.numerator)), n = [];
+		let t = p.dividers(Math.abs(this.coefficient.numerator)), n = [];
 		for (let e in this.literal) n = this.#a(n, e);
 		let r = [];
 		if (n.length > 0 && t.length > 0) for (let i of t) for (let t of n) {
 			let n = new e();
-			n.coefficient = new p(i), n.literal = t, r.push(n);
+			n.coefficient = new m(i), n.literal = t, r.push(n);
 		}
 		else if (t.length === 0) for (let t of n) {
 			let n = new e();
-			n.coefficient = new p().one(), n.literal = t, r.push(n);
+			n.coefficient = new m().one(), n.literal = t, r.push(n);
 		}
 		else for (let n of t) {
 			let t = new e();
-			t.coefficient = new p(n), r.push(t);
+			t.coefficient = new m(n), r.push(t);
 		}
 		return r.length === 0 ? [new e().one()] : r;
 	}
 	evaluate = (e, t) => {
 		if (t === !0) {
-			if (e instanceof p) return this.#r(e.value);
+			if (e instanceof m) return this.#r(e.value);
 			if (typeof e == "number") return this.#r(e);
 			if (typeof e == "object") {
 				let t = {};
-				for (let n in e) t[n] = new p(e[n]).value;
+				for (let n in e) t[n] = new m(e[n]).value;
 				return this.#r(t);
 			}
 		}
 		let n = this.coefficient.clone();
-		if (typeof e == "number" || e instanceof p) {
+		if (typeof e == "number" || e instanceof m) {
 			let t = {};
-			return t[this.variables[0]] = new p(e), this.evaluate(t);
+			return t[this.variables[0]] = new m(e), this.evaluate(t);
 		}
 		if (typeof e == "object") {
 			if (this.variables.length === 0) return this.coefficient;
 			for (let t in this.#t) {
-				let r = new p(e[t]);
+				let r = new m(e[t]);
 				n.multiply(r.pow(this.#t[t]));
 			}
 		}
@@ -2569,8 +2540,8 @@ var re = {
 		this.#t = e;
 	}
 	set literalStr(e) {
-		for (let t of [...e.matchAll(/([a-z])\^([+-]?[0-9]+)/g)]) t[1] in this.#t || (this.#t[t[1]] = new p().zero()), this.#t[t[1]].add(+t[2]);
-		for (let t of [...e.matchAll(/([a-z](?!\^))/g)]) t[1] in this.#t || (this.#t[t[1]] = new p().zero()), this.#t[t[1]].add(1);
+		for (let t of [...e.matchAll(/([a-z])\^([+-]?[0-9]+)/g)]) t[1] in this.#t || (this.#t[t[1]] = new m().zero()), this.#t[t[1]].add(+t[2]);
+		for (let t of [...e.matchAll(/([a-z](?!\^))/g)]) t[1] in this.#t || (this.#t[t[1]] = new m().zero()), this.#t[t[1]].add(1);
 	}
 	multiply = (...t) => {
 		for (let n of t) {
@@ -2580,7 +2551,7 @@ var re = {
 		}
 		return this;
 	};
-	one = () => (this.#e = new p().one(), this.#t = {}, this);
+	one = () => (this.#e = new m().one(), this.#t = {}, this);
 	opposite = () => (this.#e.opposite(), this);
 	get plotFunction() {
 		return this.#i("plot");
@@ -2592,7 +2563,7 @@ var re = {
 	};
 	primitive = (e = "x") => {
 		let t = this.clone(), n;
-		return t.hasVariable(e) ? (n = t.degree(e).clone().add(1), t.coefficient = t.coefficient.clone().divide(n), t.setLetter(e, n)) : (t.coefficient.isZero() && (t.coefficient = new p().one()), t.setLetter(e, 1)), t;
+		return t.hasVariable(e) ? (n = t.degree(e).clone().add(1), t.coefficient = t.coefficient.clone().divide(n), t.setLetter(e, n)) : (t.coefficient.isZero() && (t.coefficient = new m().one()), t.setLetter(e, 1)), t;
 	};
 	reduce = () => {
 		this.coefficient.reduce();
@@ -2603,9 +2574,9 @@ var re = {
 		delete this.#t[e];
 	}
 	root = () => {
-		throw Error("Method not implemented.");
+		throw new a("Method not implemented.");
 	};
-	setLetter = (e, t) => t instanceof p ? this.hasVariable(e) && t.isZero() ? (this.removeVariable(e), this) : (this.#t[e] = t.clone(), this) : this.setLetter(e, new p(t));
+	setLetter = (e, t) => t instanceof m ? this.hasVariable(e) && t.isZero() ? (this.removeVariable(e), this) : (this.#t[e] = t.clone(), this) : this.setLetter(e, new m(t));
 	sqrt = () => {
 		if (this.isSquare()) {
 			this.#e.sqrt();
@@ -2617,7 +2588,7 @@ var re = {
 		for (let n of t) {
 			let t = n instanceof e ? n : new e(n);
 			if (this.isSameAs(t)) this.isZero() && this.#n(t), this.#e.add(t.clone().coefficient.opposite());
-			else throw Error("Subtract: Is not similar: " + t.display);
+			else throw new r("Subtract: Is not similar: " + t.display);
 		}
 		return this;
 	};
@@ -2627,7 +2598,7 @@ var re = {
 			n.isZero() || e.push(t);
 		}), e.sort(), e;
 	}
-	zero = () => (this.#e = new p().zero(), this.#t = {}, this);
+	zero = () => (this.#e = new m().zero(), this.#t = {}, this);
 	#n(e) {
 		for (let t in e.literal) this.#t[t] = e.literal[t].clone();
 	}
@@ -2637,15 +2608,15 @@ var re = {
 			let t = {}, n = this.variables[0];
 			return t[n] = e, this.#r(t);
 		}
-		if (e instanceof p) {
+		if (e instanceof m) {
 			let t = {};
-			return t[this.variables[0]] = new p(e).value, this.#r(t);
+			return t[this.variables[0]] = new m(e).value, this.#r(t);
 		}
 		if (typeof e == "object") {
 			if (this.variables.length === 0) return this.coefficient.value;
 			for (let n in this.#t) {
 				let r = e[n];
-				r instanceof p ? t *= r.value ** this.#t[n].value : t *= r ** this.#t[n].value;
+				r instanceof m ? t *= r.value ** this.#t[n].value : t *= r ** this.#t[n].value;
 			}
 		}
 		return t;
@@ -2660,21 +2631,21 @@ var re = {
 		let n = [];
 		for (let r = 0; r <= this.literal[t].value; r++) if (e.length === 0) {
 			let e = {};
-			e[t] = new p(r), n.push(e);
+			e[t] = new m(r), n.push(e);
 		} else for (let i of e) {
 			let e = {};
 			for (let t in i) e[t] = i[t];
-			e[t] = new p(r), n.push(e);
+			e[t] = new m(r), n.push(e);
 		}
 		return n;
 	}
 	#o = (t, n) => {
 		let r, i, a, o, s;
-		if (n.tokenType === S.COEFFICIENT) t.push(new e(new p(n.token)));
-		else if (n.tokenType === S.VARIABLE) {
+		if (n.tokenType === w.COEFFICIENT) t.push(new e(new m(n.token)));
+		else if (n.tokenType === w.VARIABLE) {
 			let r = new e().one();
 			r.setLetter(n.token, 1), t.push(r.clone());
-		} else if (n.tokenType === S.OPERATION) switch (n.token) {
+		} else if (n.tokenType === w.OPERATION) switch (n.token) {
 			case "-":
 				i = t.pop() ?? new e().zero(), r = t.pop() ?? new e().zero(), t.push(r.subtract(i));
 				break;
@@ -2684,26 +2655,31 @@ var re = {
 			case "/":
 				i = t.pop() ?? new e().one(), r = t.pop() ?? new e().one(), t.push(r.divide(i));
 				break;
-			case "^":
-				s = t.pop()?.coefficient ?? new p().one(), a = t.pop() ?? new e().one(), o = a.variables[0], o && a.setLetter(o, s), t.push(a);
-				break;
+			case "^": s = t.pop()?.coefficient ?? new m().one(), a = t.pop() ?? new e().one(), o = a.variables[0], o && a.setLetter(o, s), t.push(a);
 		}
 	};
 	#s = (e) => {
-		let t = new w().parse(e).rpn, n = [];
-		if (t.length === 0) return this.zero(), this;
-		if (t.length === 1) {
-			let e = t[0];
-			return this.one(), e.tokenType === S.COEFFICIENT ? this.coefficient = new p(e.token) : e.tokenType === S.VARIABLE && this.setLetter(e.token, 1), this;
-		} else for (let e of t) this.#o(n, e);
-		return this.one(), this.multiply(n[0]), this;
+		let n;
+		try {
+			n = new O().parse(e);
+		} catch (n) {
+			throw new t(`Cannot parse "${e}" as a Monom`, { cause: n });
+		}
+		let r = n.rpn, i = [];
+		if (r.length === 0) return this.zero(), this;
+		if (r.length === 1) {
+			let e = r[0];
+			return this.one(), e.tokenType === w.COEFFICIENT ? this.coefficient = new m(e.token) : e.tokenType === w.VARIABLE && this.setLetter(e.token, 1), this;
+		}
+		for (let e of r) this.#o(i, e);
+		return this.one(), this.multiply(i[0]), this;
 	};
 };
 //#endregion
 //#region src/algebra/operations.ts
-function D(e, t) {
-	if (!Number.isSafeInteger(t)) throw Error("Can only raise item by an integer");
-	if (t < 0) throw Error("Can only raise item by a positive integer");
+function j(e, t) {
+	if (!Number.isSafeInteger(t)) throw new i("Can only raise item by an integer");
+	if (t < 0) throw new i("Can only raise item by a positive integer");
 	if (t === 0) return e.one();
 	let n = e.clone();
 	for (let r = 1; r < t; r++) e.multiply(n);
@@ -2711,7 +2687,7 @@ function D(e, t) {
 }
 //#endregion
 //#region src/algebra/polynom.ts
-var O = class e {
+var M = class e {
 	#e = "x";
 	#t;
 	#n;
@@ -2722,9 +2698,9 @@ var O = class e {
 	}
 	parse(t, ...n) {
 		if (this.#n = [], this.#t = [], this.#u(), typeof t == "string") return this.#h(t, ...n);
-		if ((typeof t == "number" || t instanceof p || t instanceof E) && n.length === 0) this.#n.push(new E(t));
-		else if (t instanceof E && n.length > 0) this.#n.push(new E(t)), n.forEach((e) => {
-			this.#n.push(new E(e));
+		if ((typeof t == "number" || t instanceof m || t instanceof A) && n.length === 0) this.#n.push(new A(t));
+		else if (t instanceof A && n.length > 0) this.#n.push(new A(t)), n.forEach((e) => {
+			this.#n.push(new A(e));
 		});
 		else if (t instanceof e) for (let e of t.monoms) this.#n.push(e.clone());
 		return this;
@@ -2748,21 +2724,21 @@ var O = class e {
 		}), n;
 	}
 	add(...t) {
-		for (let n of t) n instanceof e ? this.#n = this.#n.concat(n.monoms.map((e) => e.clone())) : n instanceof E ? this.#n.push(n.clone()) : typeof n == "number" && Number.isSafeInteger(n) ? this.#n.push(new E(n.toString())) : this.#n.push(new E(n));
+		for (let n of t) n instanceof e ? this.#n = this.#n.concat(n.monoms.map((e) => e.clone())) : n instanceof A ? this.#n.push(n.clone()) : typeof n == "number" && Number.isSafeInteger(n) ? this.#n.push(new A(n.toString())) : this.#n.push(new A(n));
 		return this.reduce();
 	}
 	commonMonom() {
-		let e = new E().one();
-		e.coefficient = new p(this.gcdNumerator(), this.gcdDenominator());
+		let e = new A().one();
+		e.coefficient = new m(this.gcdNumerator(), this.gcdDenominator());
 		for (let t of this.variables) {
 			e.setLetter(t, this.degree(t));
-			for (let n of this.#n) if (e.setLetter(t, p.min(n.degree(t), e.degree(t))), e.degree(t).isZero()) break;
+			for (let n of this.#n) if (e.setLetter(t, m.min(n.degree(t), e.degree(t))), e.degree(t).isZero()) break;
 		}
 		return e;
 	}
 	degree(e) {
-		let t = new p().zero();
-		for (let n of this.#n) t = p.max(n.degree(e).value, t);
+		let t = new m().zero();
+		for (let n of this.#n) t = m.max(n.degree(e).value, t);
 		return t;
 	}
 	derivative(t) {
@@ -2771,9 +2747,9 @@ var O = class e {
 		return n.reduce();
 	}
 	divide(t) {
-		if (t instanceof p) return this.#o(t);
+		if (t instanceof m) return this.#o(t);
 		if (typeof t == "number" && Number.isSafeInteger(t)) return this.#s(t);
-		if (t instanceof E) return this.divide(new e(t));
+		if (t instanceof A) return this.divide(new e(t));
 		if (t instanceof e) {
 			if (t.monoms.length === 1 && t.variables.length === 0) return this.#o(t.monoms[0].coefficient);
 			{
@@ -2781,28 +2757,28 @@ var O = class e {
 				if (n.isZero()) return this.#n = e.monoms, this.#u(), this;
 			}
 		} else if (typeof t == "string") return this.divide(new e(t));
-		throw Error(`Cannot divide by ${t}`);
+		throw new r(`Cannot divide by ${t}`);
 	}
 	empty() {
 		return this.#n = [], this.#u(), this;
 	}
 	euclidean(t) {
-		let n = t.variables[0], r = new e().zero(), i = this.clone().reorder(n);
+		let n = t.variables[0], i = new e().zero(), a = this.clone().reorder(n);
 		if (t.variables.length === 0) return {
 			quotient: this.clone().divide(t).reduce(),
 			reminder: new e().zero()
 		};
-		if (!this.degree(n).isNatural() || !t.degree(n).isNatural()) throw Error("Euclidean division requires integer degrees");
-		let a = t.monomByDegree(void 0, n), o = t.degree(n), s, c = this.degree(n).value - o.value + 1;
-		for (; i.degree(n).isGeq(o) && c > 0 && (c--, s = i.monomByDegree(void 0, n).clone().divide(a), !(!s.isZero() && (r.add(s), i.subtract(t.clone().multiply(s)).reduce(), s.degree(n).isZero()))););
-		return r.reduce(), i.reduce(), {
-			quotient: r,
-			reminder: i
+		if (!this.degree(n).isNatural() || !t.degree(n).isNatural()) throw new r("Euclidean division requires integer degrees");
+		let o = t.monomByDegree(void 0, n), s = t.degree(n), c, l = this.degree(n).value - s.value + 1;
+		for (; a.degree(n).isGeq(s) && l > 0 && (l--, c = a.monomByDegree(void 0, n).clone().divide(o), !(!c.isZero() && (i.add(c), a.subtract(t.clone().multiply(c)).reduce(), c.degree(n).isZero()))););
+		return i.reduce(), a.reduce(), {
+			quotient: i,
+			reminder: a
 		};
 	}
 	evaluate(e, t) {
 		if (t) return this.#c(e);
-		let n = new p().zero();
+		let n = new m().zero();
 		return this.#n.forEach((r) => {
 			n.add(r.evaluate(e, t));
 		}), n;
@@ -2828,19 +2804,19 @@ var O = class e {
 		this.#n = [];
 		let t = this.#e ?? "x";
 		return e.reverse().forEach((e, n) => {
-			let r = new E();
-			r.coefficient = new p(e), r.setLetter(t, n), this.#n.push(r);
+			let r = new A();
+			r.coefficient = new m(e), r.setLetter(t, n), this.#n.push(r);
 		}), this.#u(), this.reorder();
 	}
 	gcdDenominator() {
-		return d.gcd(...this.getDenominators());
+		return p.gcd(...this.getDenominators());
 	}
 	gcdNumerator() {
-		return d.gcd(...this.getNumerators());
+		return p.gcd(...this.getNumerators());
 	}
 	getCoefficients() {
-		if (!this.degree().isNatural()) throw Error("getCoefficients() requires a polynomial with integer degrees");
-		let e = this.clone().reorder(), t = this.degree().value + 1, n = Array.from({ length: t }, () => new p(0));
+		if (!this.degree().isNatural()) throw new r("getCoefficients() requires a polynomial with integer degrees");
+		let e = this.clone().reorder(), t = this.degree().value + 1, n = Array.from({ length: t }, () => new m(0));
 		return e.monoms.forEach((e) => {
 			let r = t - e.degree().value - 1;
 			n[r] = e.coefficient.clone();
@@ -2864,24 +2840,21 @@ var O = class e {
 	}
 	integrate(e, t, n = "x") {
 		let r = this.primitive(n), i = {}, a = {};
-		return i[n] = new p(e), a[n] = new p(t), r.evaluate(a).subtract(r.evaluate(i));
+		return i[n] = new m(e), a[n] = new m(t), r.evaluate(a).subtract(r.evaluate(i));
 	}
 	inverse() {}
 	isDeveloped(t) {
-		let n, r = t.replaceAll(/\^\(([-0-9/]+)\)/g, "$1");
-		if (r.includes("(") || r.includes(")")) return !1;
-		try {
-			n = new e(t);
-		} catch {
-			return !1;
-		}
-		return !!this.isEqual(n);
+		let n = t.replaceAll(/\^\(([-0-9/]+)\)/g, "$1");
+		if (n.includes("(") || n.includes(")")) return !1;
+		let r = new e(t);
+		return !!this.isEqual(r);
 	}
 	isDividableBy(e) {
 		if (e.degree().isOne()) {
 			let t = e.getZeroes()[0];
 			return t.exact ? this.evaluate(t.fraction).isZero() : !1;
-		} else {
+		}
+		{
 			let { reminder: t } = this.euclidean(e);
 			return t.isZero();
 		}
@@ -2905,33 +2878,33 @@ var O = class e {
 		return this.#n.length === 1 && this.#n[0].coefficient.isZero() || this.#n.length === 0;
 	}
 	lcmDenominator() {
-		return d.lcm(...this.getDenominators());
+		return p.lcm(...this.getDenominators());
 	}
 	lcmNumerator() {
-		return d.lcm(...this.getNumerators());
+		return p.lcm(...this.getNumerators());
 	}
 	get length() {
 		return this.#n.length;
 	}
 	limitTo(e, t) {
-		let n = new p(e);
+		let n = new m(e);
 		if (n.isFinite()) {
 			let e = t ?? this.variables[0] ?? "x";
 			return this.evaluate({ [e]: n });
 		}
 		let r = this.monomByDegree(void 0, t), i = r.coefficient.sign(), a = r.degree(t);
-		return a.isZero() ? r.coefficient.clone() : a.isStrictlyPositive() ? n.isPositive() ? i === 1 ? new p().infinite() : new p().infinite().opposite() : (a.value % 2 == 0 ? i : -i) === 1 ? new p().infinite() : new p().infinite().opposite() : new p().zero();
+		return a.isZero() ? r.coefficient.clone() : a.isStrictlyPositive() ? n.isPositive() ? i === 1 ? new m().infinite() : new m().infinite().opposite() : (a.value % 2 == 0 ? i : -i) === 1 ? new m().infinite() : new m().infinite().opposite() : new m().zero();
 	}
 	monomByDegree(e, t) {
 		if (e === void 0) return this.monomByDegree(this.degree(t), t);
 		let n = this.clone().reduce();
 		for (let r of n.#n) if (r.degree(t).isEqual(e)) return r.clone();
-		return new E().zero();
+		return new A().zero();
 	}
 	monomByLetter(e) {
 		let t = this.clone().reduce();
 		for (let n of t.#n) if (n.hasVariable(e)) return n.clone();
-		return new E().zero();
+		return new A().zero();
 	}
 	get monoms() {
 		return this.#n;
@@ -2947,22 +2920,22 @@ var O = class e {
 	}
 	multiply(t) {
 		if (t instanceof e) return this.#m(t);
-		if (t instanceof p) return this.#d(t);
-		if (t instanceof E) return this.#p(t);
+		if (t instanceof m) return this.#d(t);
+		if (t instanceof A) return this.#p(t);
 		if (Number.isSafeInteger(t) && typeof t == "number") return this.#f(t);
 		if (typeof t == "string") try {
-			let e = new p(t);
+			let e = new m(t);
 			return this.#d(e);
-		} catch {
-			throw Error("Cannot multiply by this value.");
+		} catch (e) {
+			throw new r("Cannot multiply by this value.", { cause: e });
 		}
-		throw Error(`Cannot multiply by this value: ${t}`);
+		throw new r(`Cannot multiply by this value: ${t}`);
 	}
 	get numberOfVars() {
 		return this.variables.length;
 	}
 	one() {
-		return this.#n = [], this.#n.push(new E().one()), this.#u(), this;
+		return this.#n = [], this.#n.push(new A().one()), this.#u(), this;
 	}
 	opposite() {
 		return this.#n = this.#n.map((e) => e.opposite()), this.#u(), this;
@@ -2971,7 +2944,7 @@ var O = class e {
 		return this.#l("tex", !1, !1, !0);
 	}
 	pow(e) {
-		return D(this, e).reduce();
+		return j(this, e).reduce();
 	}
 	primitive(t) {
 		let n = new e();
@@ -2981,7 +2954,7 @@ var O = class e {
 	reduce() {
 		let e = 0;
 		for (; e < this.#n.length;) {
-			for (let t = e + 1; t < this.#n.length; t++) this.#n[e].isSameAs(this.#n[t]) && (this.#n[e].add(this.#n[t]), this.#n.splice(t, 1), this.#n[e].isZero() && (this.#n[e] = new E().zero()), t--);
+			for (let t = e + 1; t < this.#n.length; t++) this.#n[e].isSameAs(this.#n[t]) && (this.#n[e].add(this.#n[t]), this.#n.splice(t, 1), this.#n[e].isZero() && (this.#n[e] = new A().zero()), t--);
 			e++;
 		}
 		this.#n = this.#n.filter((e) => !e.coefficient.isZero());
@@ -3001,16 +2974,16 @@ var O = class e {
 		}), this;
 	}
 	replaceBy(t, n) {
-		let r, i = new e().zero();
-		for (let e of this.monoms) if (!e.hasVariable(t) || e.literal[t].isZero()) i.add(e.clone());
+		let i, a = new e().zero();
+		for (let e of this.monoms) if (!e.hasVariable(t) || e.literal[t].isZero()) a.add(e.clone());
 		else {
-			if (r = e.literal[t].clone(), e.removeVariable(t), r.isStrictlyNegative()) throw Error(`Cannot replace variable "${t}" with negative power in a Polynom`);
-			i.add(n.clone().pow(r.numerator).multiply(e));
+			if (i = e.literal[t].clone(), e.removeVariable(t), i.isStrictlyNegative()) throw new r(`Cannot replace variable "${t}" with negative power in a Polynom`);
+			a.add(n.clone().pow(i.numerator).multiply(e));
 		}
-		return this.#n = i.reduce().monoms, this.#u(), this;
+		return this.#n = a.reduce().monoms, this.#u(), this;
 	}
 	root() {
-		throw Error("Cannot take the root from a polynom");
+		throw new r("Cannot take the root from a polynom");
 	}
 	get roots() {
 		return this.#i ? this.#r : this.getZeroes();
@@ -3022,10 +2995,10 @@ var O = class e {
 		return this.#e = e, this;
 	}
 	sqrt() {
-		throw Error("Cannot take the square root from a polynom");
+		throw new r("Cannot take the square root from a polynom");
 	}
 	subtract(...t) {
-		for (let n of t) n instanceof e ? this.add(n.clone().opposite()) : n instanceof E ? this.#n.push(n.clone().opposite()) : this.#n.push(new E(n).opposite());
+		for (let n of t) n instanceof e ? this.add(n.clone().opposite()) : n instanceof A ? this.#n.push(n.clone().opposite()) : this.#n.push(new A(n).opposite());
 		return this.reduce();
 	}
 	tableOfSigns() {
@@ -3052,7 +3025,7 @@ var O = class e {
 		return [...new Set(this.#n.flatMap((e) => e.variables))].sort();
 	}
 	zero() {
-		return this.#n = [], this.#n.push(new E().zero()), this.#u(), this;
+		return this.#n = [], this.#n.push(new A().zero()), this.#u(), this;
 	}
 	get zeroes() {
 		return this.getZeroes();
@@ -3071,7 +3044,7 @@ var O = class e {
 		return this.#u(), this;
 	}
 	#s(e) {
-		let t = new p(e);
+		let t = new m(e);
 		for (let e of this.#n) e.coefficient.divide(t);
 		return this.#u(), this;
 	}
@@ -3098,7 +3071,7 @@ var O = class e {
 		return this.reduce();
 	}
 	#f(e) {
-		return this.#d(new p(e));
+		return this.#d(new m(e));
 	}
 	#p(e) {
 		for (let t of this.#n) t.multiply(e);
@@ -3106,97 +3079,105 @@ var O = class e {
 	}
 	#m(e) {
 		let t = [];
-		for (let n of this.#n) for (let r of e.monoms) t.push(E.xMultiply(n, r));
+		for (let n of this.#n) for (let r of e.monoms) t.push(A.xMultiply(n, r));
 		return this.#n = t, this.reduce();
 	}
 	#h(e, ...t) {
 		if (t.length === 0) {
 			if (e !== "" && !isNaN(Number(e))) {
 				this.empty();
-				let t = new E(Number(e));
+				let t = new A(Number(e));
 				return this.add(t), this;
 			}
 			return this.#_(e);
-		} else if (/^[a-z]+$/.test(e)) {
+		}
+		if (/^[a-z]+$/.test(e)) {
 			this.empty();
-			let n = t.map((e) => new p(e));
+			let n = t.map((e) => new m(e));
 			if (e.length > 1) {
 				let t = e.split("");
-				if (n.length > t.length + 1) throw Error(`Too many values: ${t.length} letters but ${n.length} values provided`);
+				if (n.length > t.length + 1) throw new i(`Too many values: ${t.length} letters but ${n.length} values provided`);
 				let r = 0;
 				for (let e of n) {
-					let n = new E();
+					let n = new A();
 					n.coefficient = e.clone(), n.literalStr = t[r] ?? "", this.add(n), r++;
 				}
 			} else {
 				let t = n.length - 1;
 				for (let r of n) {
-					let n = new E();
+					let n = new A();
 					n.coefficient = r.clone(), n.literalStr = `${e}^${t}`, this.add(n), t--;
 				}
 			}
 			return this;
-		} else return this.zero();
+		}
+		return this.zero();
 	}
-	#g(t, n) {
-		switch (n.tokenType) {
-			case S.COEFFICIENT:
-				t.push(new e(n.token));
+	#g(n, i) {
+		switch (i.tokenType) {
+			case w.COEFFICIENT:
+				n.push(new e(i.token));
 				break;
-			case S.VARIABLE:
-				t.push(new e().add(new E(n.token)));
+			case w.VARIABLE:
+				n.push(new e().add(new A(i.token)));
 				break;
-			case S.CONSTANT: throw Error("Unsupported CONSTANT token in Polynom parser");
-			case S.OPERATION:
-				if (t.length >= 2) {
-					let e = t.pop(), r = t.pop();
-					if (r === void 0 || e === void 0) throw Error("Unexpected undefined operand in Polynom parser stack");
-					if (n.token === "+") t.push(r.add(e));
-					else if (n.token === "-") t.push(r.subtract(e));
-					else if (n.token === "*") t.push(r.multiply(e));
-					else if (n.token === "/") {
-						if (e.degree().isStrictlyPositive()) throw Error("Cannot divide a Polynom by another Polynom of degree > 0");
-						t.push(r.divide(e.monoms[0].coefficient));
-					} else if (n.token === "^") {
-						if (e.degree().isStrictlyPositive()) throw Error("Cannot elevate a polynom with another polynom !");
-						if (e.monoms[0].coefficient.isRelative()) t.push(r.pow(e.monoms[0].coefficient.value));
-						else if (r.monoms.length === 1 && r.monoms[0].coefficient.isOne()) {
-							for (let t in r.monoms[0].literal) r.monoms[0].literal[t].multiply(e.monoms[0].coefficient);
-							t.push(r);
-						} else throw Error("Cannot raise a multi-monom Polynom to a fractional power");
+			case w.CONSTANT: throw new t("Unsupported CONSTANT token in Polynom parser");
+			case w.OPERATION:
+				if (n.length >= 2) {
+					let e = n.pop(), a = n.pop();
+					if (a === void 0 || e === void 0) throw new t("Unexpected undefined operand in Polynom parser stack");
+					if (i.token === "+") n.push(a.add(e));
+					else if (i.token === "-") n.push(a.subtract(e));
+					else if (i.token === "*") n.push(a.multiply(e));
+					else if (i.token === "/") {
+						if (e.degree().isStrictlyPositive()) throw new r("Cannot divide a Polynom by another Polynom of degree > 0");
+						n.push(a.divide(e.monoms[0].coefficient));
+					} else if (i.token === "^") {
+						if (e.degree().isStrictlyPositive()) throw new r("Cannot elevate a polynom with another polynom !");
+						if (e.monoms[0].coefficient.isRelative()) n.push(a.pow(e.monoms[0].coefficient.value));
+						else if (a.monoms.length === 1 && a.monoms[0].coefficient.isOne()) {
+							for (let t in a.monoms[0].literal) a.monoms[0].literal[t].multiply(e.monoms[0].coefficient);
+							n.push(a);
+						} else throw new r("Cannot raise a multi-monom Polynom to a fractional power");
 					}
-				} else if (n.token === "-") {
-					let e = t.pop();
-					e && t.push(e.opposite());
-				} else throw Error("Error parsing the polynom");
+				} else if (i.token === "-") {
+					let e = n.pop();
+					e && n.push(e.opposite());
+				} else throw new t("Error parsing the polynom");
 				break;
-			case S.MONOM: throw Error("Unexpected MONOM token in polynom parser");
-			case S.FUNCTION: throw Error(`Unsupported function token "${n.token}" in polynom parser`);
+			case w.MONOM: throw new t("Unexpected MONOM token in polynom parser");
+			case w.FUNCTION: throw new t(`Unsupported function token "${i.token}" in polynom parser`);
 		}
 	}
 	#_(e) {
-		let t = new w().parse(e).rpn;
+		let n;
+		try {
+			n = new O().parse(e);
+		} catch (n) {
+			throw new t(`Cannot parse "${e}" as a Polynom`, { cause: n });
+		}
+		let r = n.rpn;
 		this.zero();
-		let n = [];
-		for (let e of t) this.#g(n, e);
-		return n.length === 1 && this.add(n[0]), this.reorder();
+		let i = [];
+		for (let e of r) this.#g(i, e);
+		return i.length === 1 && this.add(i[0]), this.reorder();
 	}
-}, k = class e {
+}, N = class e {
 	#e;
 	#t;
 	#n;
 	constructor(t, n, r) {
-		if (this.#e = new O().zero(), this.#t = new O().zero(), this.#n = "=", t !== void 0 && n === void 0) {
+		if (this.#e = new M().zero(), this.#t = new M().zero(), this.#n = "=", t !== void 0 && n === void 0) {
 			if (t instanceof e) return t.clone();
 			typeof t == "string" && this.parse(t);
-		} else t !== void 0 && n !== void 0 && (this.left = new O(t), this.right = new O(n));
+		} else t !== void 0 && n !== void 0 && (this.left = new M(t), this.right = new M(n));
 		return r !== void 0 && (this.sign = r), this;
 	}
 	parse = (e) => {
-		let t = this.#r(e);
-		if (t === !1) throw Error("The equation is not valid (no sign found)");
-		let n = e.split(t);
-		return this.create(new O(n[0]), new O(n[1]), this.#i(t));
+		let n = this.#r(e);
+		if (n === !1) throw new t("The equation is not valid (no sign found)");
+		let r = e.split(n);
+		return this.create(new M(r[0]), new M(r[1]), this.#i(n));
 	};
 	clone = () => new e(this.#e.clone(), this.#t.clone(), this.#n);
 	get tex() {
@@ -3209,19 +3190,19 @@ var O = class e {
 		return e.includes("=") || e.includes("<") || e.includes(">") || e.includes("<=") || e.includes(">=");
 	}
 	static makeSolutionsUnique(e, t) {
-		let n = [], r = e.filter((e) => n.includes(e.tex) ? !1 : (n.push(e.tex), !0));
+		let n = [], r = e.filter((e) => !n.includes(e.tex) && (n.push(e.tex), !0));
 		return t === !0 && r.sort((e, t) => e.value - t.value), r;
 	}
 	add(t) {
 		if (t instanceof e) return this.#e.add(t.left), this.#t.add(t.right), this;
 		if (typeof t == "string" && !e.isEquationString(t)) return this.add(new e(t));
-		let n = new O(t);
+		let n = new M(t);
 		return this.#e.add(n), this.#t.add(n), this;
 	}
 	create = (e, t, n) => (this.#e = e, this.#t = t, this.#n = this.#i(n ?? "="), this);
-	degree = (e) => p.max(this.#e.degree(e), this.#t.degree(e));
+	degree = (e) => m.max(this.#e.degree(e), this.#t.degree(e));
 	divide = (e) => {
-		let t = new p(e);
+		let t = new m(e);
 		return t.isZero() ? this : this.multiply(t.inverse());
 	};
 	evaluate(e, t) {
@@ -3261,7 +3242,7 @@ var O = class e {
 	letters = () => [.../* @__PURE__ */ new Set([...this.#e.variables, ...this.#t.variables])];
 	moveLeft = () => (this.#e.subtract(this.#t), this.#t.zero(), this);
 	multiply = (e) => {
-		let t = new p(e);
+		let t = new m(e);
 		return this.#e.multiply(t), this.#t.multiply(t), this.#n !== "=" && t.sign() === -1 && this.#a(), this;
 	};
 	get numberOfVars() {
@@ -3294,7 +3275,7 @@ var O = class e {
 	get signAsTex() {
 		return this.#n === ">=" ? "\\geq" : this.#n === "<=" ? "\\leq" : this.#n;
 	}
-	simplify = () => (this.multiply(d.lcm(...this.#e.getDenominators(), ...this.#t.getDenominators())), this.divide(d.gcd(...this.#e.getNumerators(), ...this.#t.getNumerators())), this);
+	simplify = () => (this.multiply(p.lcm(...this.#e.getDenominators(), ...this.#t.getDenominators())), this.divide(p.gcd(...this.#e.getNumerators(), ...this.#t.getNumerators())), this);
 	solve = () => new b(this.clone()).solve();
 	split() {
 		return [this.#e.clone(), this.#t.clone()];
@@ -3302,7 +3283,7 @@ var O = class e {
 	subtract(t) {
 		if (t instanceof e) return this.#e.subtract(t.left), this.#t.subtract(t.right), this;
 		if (typeof t == "string" && !e.isEquationString(t)) return this.subtract(new e(t));
-		let n = new O(t);
+		let n = new M(t);
 		return this.#e.subtract(n), this.#t.subtract(n), this;
 	}
 	test = (e) => this.left.evaluate(e).isEqual(this.right.evaluate(e));
@@ -3319,34 +3300,34 @@ var O = class e {
 		if (e.includes("=<")) return "=<";
 		if (e.includes("<")) return "<";
 		if (e.includes("=")) return "=";
-		throw Error("The equation is not valid (no sign found)");
+		throw new t("The equation is not valid (no sign found)");
 	};
 	#i = (e) => e === void 0 ? "=" : e.includes("geq") || e.includes(">=") || e.includes("=>") ? ">=" : e.includes(">") ? ">" : e.includes("leq") || e.includes("<=") || e.includes("=<") ? "<=" : e.includes("<") ? "<" : "=";
 	#a = () => this.#n === "=" ? this : this.#n.includes("<") ? (this.#n.replace("<", ">"), this) : (this.#n.includes(">") && this.#n.replace(">", "<"), this);
-}, A = class e {
+}, P = class e {
 	#e;
 	#t;
 	#n;
 	#r = !1;
 	constructor(t, n) {
-		return t instanceof e ? (this.#t = t.polynom.clone(), this.#n = t.power.clone(), n !== void 0 && this.#n.multiply(new p(n))) : t === void 0 ? (this.#t = new O(), this.#n = new p(1)) : (this.#t = new O(t), this.#n = new p(n ?? 1)), this.#e = 1, this;
+		return t instanceof e ? (this.#t = t.polynom.clone(), this.#n = t.power.clone(), n !== void 0 && this.#n.multiply(new m(n))) : t === void 0 ? (this.#t = new M(), this.#n = new m(1)) : (this.#t = new M(t), this.#n = new m(n ?? 1)), this.#e = 1, this;
 	}
 	parse() {
-		throw Error("Method not implemented.");
+		throw new a("Method not implemented.");
 	}
 	clone() {
 		return new e(this);
 	}
 	get tex() {
 		let e = this.power.numerator, t = this.power.denominator, n, r;
-		return this.#e === 0 && t > 1 ? (n = `\\sqrt${t === 2 ? "" : `[ ${t} ]`}{ ${this.polynom.tex} }`, r = e === 1 ? "" : `^{ ${e} }`) : (n = this.#r && this.power.isOne() ? this.polynom.tex : m(this.polynom.tex), r = t === 1 && e === 1 ? "" : `^{ ${this.power.tex} }`), n = `${n}${r}`, this.#e === 0 && e < 0 && (n = `\\frac{ 1 }{ ${n} }`), n;
+		return this.#e === 0 && t > 1 ? (n = `\\sqrt${t === 2 ? "" : `[ ${t} ]`}{ ${this.polynom.tex} }`, r = e === 1 ? "" : `^{ ${e} }`) : (n = this.#r && this.power.isOne() ? this.polynom.tex : se(this.polynom.tex), r = t === 1 && e === 1 ? "" : `^{ ${this.power.tex} }`), n = `${n}${r}`, this.#e === 0 && e < 0 && (n = `\\frac{ 1 }{ ${n} }`), n;
 	}
 	get display() {
 		let e = this.power.numerator, t = this.power.denominator, n, r;
-		return this.#e === 0 && t > 1 ? (n = `${t === 2 ? "sqrt" : `root(${t})`}(${this.polynom.display})`, r = e === 1 ? "" : `^(${e})`) : (n = this.#r && this.power.isOne() ? this.polynom.display : m(this.polynom.display, !1), r = t === 1 && e === 1 ? "" : `^(${this.power.display})`), n = `${n}${r}`, this.#e === 0 && e < 0 && (n = `1/(${n})`), n;
+		return this.#e === 0 && t > 1 ? (n = `${t === 2 ? "sqrt" : `root(${t})`}(${this.polynom.display})`, r = e === 1 ? "" : `^(${e})`) : (n = this.#r && this.power.isOne() ? this.polynom.display : se(this.polynom.display, !1), r = t === 1 && e === 1 ? "" : `^(${this.power.display})`), n = `${n}${r}`, this.#e === 0 && e < 0 && (n = `1/(${n})`), n;
 	}
 	add() {
-		throw Error("Adding two factors is not possible");
+		throw new r("Adding two factors is not possible");
 	}
 	get asSingle() {
 		return this.#r = !0, this;
@@ -3363,19 +3344,19 @@ var O = class e {
 	}
 	develop() {
 		if (this.power.isNatural()) return this.polynom.clone().pow(this.power.value);
-		throw Error("The power must be a natural number");
+		throw new r("The power must be a natural number");
 	}
 	divide(t) {
 		if (t instanceof e && this.isSameAs(t)) return this.power.subtract(t.power), this;
-		let n = new O(t);
+		let n = new M(t);
 		if (this.isSameAs(n)) return this.power.subtract(1), this;
-		throw Error("The two factors must be the same");
+		throw new r("The two factors must be the same");
 	}
 	evaluate(e, t) {
 		return t ? this.polynom.evaluate(e, !0) ** this.power.value : this.polynom.evaluate(e).pow(this.power);
 	}
 	fromPolynom(e) {
-		return this.#t = new O(e), this.#n = new p(1), this;
+		return this.#t = new M(e), this.#n = new m(1), this;
 	}
 	hasVariable(e) {
 		return this.polynom.hasVariable(e);
@@ -3391,7 +3372,7 @@ var O = class e {
 	}
 	isSameAs(t) {
 		let n;
-		return n = t instanceof e ? t.polynom : t instanceof O ? t : new O(t), this.polynom.isEqual(n);
+		return n = t instanceof e ? t.polynom : t instanceof M ? t : new M(t), this.polynom.isEqual(n);
 	}
 	isZero() {
 		return this.polynom.isZero();
@@ -3400,15 +3381,15 @@ var O = class e {
 		let n = new e(t);
 		if (this.polynom.monoms.length === 1 && this.power.isOne() && n.polynom.monoms.length === 1 && this.power.isOne()) return this.polynom.multiply(n.polynom), this;
 		if (t instanceof e && this.isSameAs(t)) return this.power.add(t.power), this;
-		let r = new O(t);
-		if (this.isSameAs(r)) return this.power.add(1), this;
-		throw Error("The two factors must be the same");
+		let i = new M(t);
+		if (this.isSameAs(i)) return this.power.add(1), this;
+		throw new r("The two factors must be the same");
 	}
 	one() {
 		return this.#t.one(), this.#n.one(), this;
 	}
 	opposite() {
-		throw Error("Method not implemented.");
+		throw new a("Method not implemented.");
 	}
 	get polynom() {
 		return this.#t;
@@ -3423,13 +3404,13 @@ var O = class e {
 		return this.#n;
 	}
 	set power(e) {
-		this.#n = new p(e);
+		this.#n = new m(e);
 	}
 	primitive() {
-		throw Error("Method not implemented.");
+		throw new a("Method not implemented.");
 	}
 	reduce() {
-		throw Error("Method not implemented.");
+		throw new a("Method not implemented.");
 	}
 	root(e) {
 		return this.power.divide(e), this;
@@ -3438,7 +3419,7 @@ var O = class e {
 		return this.root(2);
 	}
 	subtract() {
-		throw Error("Subtracting two factors is not possible");
+		throw new r("Subtracting two factors is not possible");
 	}
 	tableOfSigns() {
 		let e = this.power.clone().reduce(), t = this.polynom.tableOfSigns();
@@ -3470,19 +3451,19 @@ var O = class e {
 		let r = n ? 1 : -1, i = [];
 		for (let n of t.matchAll(/\(([^)]+)\)(?:\^(-?[0-9]+(?:\/[0-9]+)?|\(-?[0-9]+(?:\/[0-9]+)?\)))?|([^(]+)/g)) if (n[1] !== void 0) {
 			let t = (n[2] ?? "1").replace(/[()]/g, "");
-			i.push(new e(new O(n[1]), new p(t).multiply(r)));
-		} else n[3]?.trim() && i.push(new e(new O(n[3].trim()), new p(r)));
+			i.push(new e(new M(n[1]), new m(t).multiply(r)));
+		} else n[3]?.trim() && i.push(new e(new M(n[3].trim()), new m(r)));
 		return i;
 	}
-}, j = /* @__PURE__ */ function(e) {
+}, F = /* @__PURE__ */ function(e) {
 	return e[e.ROOT = 0] = "ROOT", e[e.POWER = 1] = "POWER", e;
-}({}), se = class e {
+}({}), I = class e {
 	#e;
 	#t;
 	constructor(...e) {
 		return this.#e = [], this.#t = [], e.length > 0 && this.parse(...e), this;
 	}
-	parse = (...e) => (this.#e = e.map((e) => new k(e)), this.#n(), this);
+	parse = (...e) => (this.#e = e.map((e) => new N(e)), this.#n(), this);
 	clone = () => new e().parse(...this.#e.map((e) => e.clone()));
 	get tex() {
 		let e = this.clone().reorder();
@@ -3491,11 +3472,11 @@ var O = class e {
 	get display() {
 		return this.tex + "as display";
 	}
-	static fromMatrix(t, n = "xyz") {
-		let r = t[0].length;
-		if (t.some((e) => e.length !== r)) throw Error("All rows must have the same number of columns");
-		let i = n.split("").splice(0, r - 1);
-		return new e(...t.map((e) => new k(new O(i.join(""), ...e), 0)));
+	static fromMatrix(t, r = "xyz") {
+		let i = t[0].length;
+		if (t.some((e) => e.length !== i)) throw new n("All rows must have the same number of columns");
+		let a = r.split("").splice(0, i - 1);
+		return new e(...t.map((e) => new N(new M(a.join(""), ...e), 0)));
 	}
 	static solutionAsDisplay(e) {
 		return `(${e.map((e) => e.display).join(";")})`;
@@ -3503,15 +3484,15 @@ var O = class e {
 	static solutionAsTex(e) {
 		return `\\left( ${e.map((e) => e.tex).join(" ; ")} \\right)`;
 	}
-	add(t, n) {
+	add(t, r) {
 		if (t instanceof e) {
 			let e = t.equations.length;
-			if (e !== this.#e.length) throw Error("The number of equations must be the same");
+			if (e !== this.#e.length) throw new n("The number of equations must be the same");
 			for (let n = 0; n < e; n++) this.#e[n].add(t.equations[n]);
 		} else {
-			if (n === void 0 || n < 0 || n >= this.#e.length) throw Error("Index out of range");
-			let e = new k(t);
-			this.#e[n].add(e);
+			if (r === void 0 || r < 0 || r >= this.#e.length) throw new o("Index out of range");
+			let e = new N(t);
+			this.#e[r].add(e);
 		}
 		return this;
 	}
@@ -3533,7 +3514,7 @@ var O = class e {
 		return t !== void 0 && t.length > 0 && (o = t[0].length), `\\left\\{\\begin{array}{${"r".repeat(i.length)}cl ${"|l".repeat(o)}}${a.join("\\\\ ")}\\end{array}\\right.`;
 	};
 	degree(e) {
-		return p.max(...this.#e.map((t) => t.degree(e)));
+		return m.max(...this.#e.map((t) => t.degree(e)));
 	}
 	get equations() {
 		return this.#e;
@@ -3542,7 +3523,7 @@ var O = class e {
 		this.#e = e, this.#n();
 	}
 	evaluate(e, t) {
-		throw Error("Method not implemented.");
+		throw new a("Method not implemented.");
 	}
 	hasVariable(e) {
 		return this.#t.includes(e);
@@ -3562,11 +3543,11 @@ var O = class e {
 	}
 	multiply(e, t) {
 		if (Array.isArray(e)) {
-			if (e.length !== this.#e.length) throw Error("The number of values must be the same as the number of equations");
+			if (e.length !== this.#e.length) throw new n("The number of values must be the same as the number of equations");
 			for (let t = 0; t < e.length; t++) this.#e[t].multiply(e[t]);
 			return this;
 		}
-		if (t === void 0 || t < 0 || t >= this.#e.length) throw Error("Index out of range");
+		if (t === void 0 || t < 0 || t >= this.#e.length) throw new o("Index out of range");
 		return this.#e[t].multiply(e), this;
 	}
 	reduce() {
@@ -3579,13 +3560,13 @@ var O = class e {
 	solve() {
 		let [e, t] = this.matrix, n = e.map((e, n) => [...e, t[n]]);
 		for (let t = 0; t < e.length; t++) {
-			let r = n[t][t].clone();
-			if (r.isZero()) {
+			let i = n[t][t].clone();
+			if (i.isZero()) {
 				let e = n.find((e, n) => n > t && !e[t].isZero());
-				if (e) n[t].forEach((t, n) => t.add(e[n])), r = n[t][t].clone();
-				else throw Error("Unsolvable...");
+				if (e) n[t].forEach((t, n) => t.add(e[n])), i = n[t][t].clone();
+				else throw new r("Unsolvable...");
 			}
-			n[t] = n[t].map((e) => e.divide(r));
+			n[t] = n[t].map((e) => e.divide(i));
 			for (let r = 0; r < e.length; r++) {
 				if (r === t) continue;
 				let e = n[r][t].clone().opposite();
@@ -3599,7 +3580,7 @@ var O = class e {
 		let t = [], n = this.equations.map((t) => t.left.monomByLetter(e).coefficient.value);
 		return n.forEach((e, r) => {
 			for (let i = r + 1; i < n.length; i++) {
-				let a = d.lcm(e, n[i]), o = e < 0 ? -1 : 1;
+				let a = p.lcm(e, n[i]), o = e < 0 ? -1 : 1;
 				t.push([{
 					id: r,
 					factor: o * a / e
@@ -3610,15 +3591,15 @@ var O = class e {
 			}
 		}), t.sort((e, t) => Math.abs(e[0].factor) + Math.abs(e[1].factor) - (Math.abs(t[0].factor) + Math.abs(t[1].factor)));
 	}
-	subtract(t, n) {
+	subtract(t, r) {
 		if (t instanceof e) {
 			let e = t.equations.length;
-			if (e !== this.#e.length) throw Error("The number of equations must be the same");
+			if (e !== this.#e.length) throw new n("The number of equations must be the same");
 			for (let n = 0; n < e; n++) this.#e[n].subtract(t.equations[n]);
 		} else {
-			if (n === void 0 || n < 0 || n >= this.#e.length) throw Error("Index out of range");
-			let e = new k(t);
-			this.#e[n].subtract(e);
+			if (r === void 0 || r < 0 || r >= this.#e.length) throw new o("Index out of range");
+			let e = new N(t);
+			this.#e[r].subtract(e);
 		}
 		return this;
 	}
@@ -3652,12 +3633,19 @@ var O = class e {
 			n.variable = e, t.push(n);
 		}), t);
 	}
-}, ce = class {
+}, L = class {
 	#e;
 	constructor(e) {
 		return this.#e = [], e !== void 0 && this.parse(e), this;
 	}
-	parse = (e) => (this.#e = new w(C.SET).parse(e).rpn, this);
+	parse = (e) => {
+		try {
+			this.#e = new O(T.SET).parse(e).rpn;
+		} catch (n) {
+			throw new t(`Cannot parse "${e}" as a LogicalSet`, { cause: n });
+		}
+		return this;
+	};
 	get tex() {
 		let e = [];
 		for (let t of this.#e) if (t.tokenType === "variable") e.push(t);
@@ -3689,15 +3677,13 @@ var O = class e {
 					}));
 				}
 				break;
-			case "!":
-				if (e.length >= 1) {
-					let t = e.pop();
-					t && e.push({
-						token: `\\overline{ ${t.token} }`,
-						tokenType: "variable"
-					});
-				}
-				break;
+			case "!": if (e.length >= 1) {
+				let t = e.pop();
+				t && e.push({
+					token: `\\overline{ ${t.token} }`,
+					tokenType: "variable"
+				});
+			}
 		}
 		return e[0].token;
 	}
@@ -3800,24 +3786,23 @@ var O = class e {
 					t && e && n.push(new Set([...t].filter((t) => !e.has(t))));
 				}
 				break;
-			case "!":
-				if (n.length >= 1) {
-					let e = n.pop();
-					e && n.push(new Set([...r].filter((t) => !e.has(t))));
-				}
-				break;
+			case "!": if (n.length >= 1) {
+				let e = n.pop();
+				e && n.push(new Set([...r].filter((t) => !e.has(t))));
+			}
 		}
 		return [...n[0]].sort();
 	}
-}, M = class e {
-	#e = j.POWER;
+}, R = class e {
+	#e = F.POWER;
 	#t = [];
 	constructor(...e) {
 		return this.parse(...e), this;
 	}
 	parse(...t) {
 		return this.#t = [], t.length === 0 || t.forEach((t) => {
-			t instanceof e ? this.#t.push(...t.factors.map((e) => e.clone())) : this.#t.push(new A(t));
+			if (typeof t == "string") return this.fromString(t);
+			t instanceof e ? this.#t.push(...t.factors.map((e) => e.clone())) : this.#t.push(new P(t));
 		}), this;
 	}
 	clone() {
@@ -3832,16 +3817,16 @@ var O = class e {
 		return t.length === 0 ? e.length === 1 ? e[0].asSingle.display : e.map((e, t) => t === 0 && e.polynom.monoms.length === 1 ? e.asSingle.display : e.display).join("") : `(${e.length === 1 ? e[0].asSingle.display : e.map((e) => e.display).join("")})/(${t.length === 1 ? t[0].asSingle.display : t.map((e) => e.display).join("")})`;
 	}
 	static #n(t, n) {
-		let r = N(t), i = N(n), a = Object.keys(r).filter((e) => Object.hasOwn(i, e)).map((e) => {
-			let t = r[e].reduce((e, t) => e.add(t.power), new p("0")), n = i[e].reduce((e, t) => e.add(t.power), new p("0"));
-			return new A(e, p.min(t, n));
+		let r = z(t), i = z(n), a = Object.keys(r).filter((e) => Object.hasOwn(i, e)).map((e) => {
+			let t = r[e].reduce((e, t) => e.add(t.power), new m("0")), n = i[e].reduce((e, t) => e.add(t.power), new m("0"));
+			return new P(e, m.min(t, n));
 		});
 		return new e(...a);
 	}
 	static #r(t, n) {
-		let r = N(t), i = N(n), a = [.../* @__PURE__ */ new Set([...Object.keys(r), ...Object.keys(i)])].map((e) => {
-			let t = Object.hasOwn(r, e) ? r[e].reduce((e, t) => e.add(t.power), new p("0")) : new p(0), n = Object.hasOwn(i, e) ? i[e].reduce((e, t) => e.add(t.power), new p("0")) : new p(0);
-			return new A(e, p.max(t, n));
+		let r = z(t), i = z(n), a = [.../* @__PURE__ */ new Set([...Object.keys(r), ...Object.keys(i)])].map((e) => {
+			let t = Object.hasOwn(r, e) ? r[e].reduce((e, t) => e.add(t.power), new m("0")) : new m(0), n = Object.hasOwn(i, e) ? i[e].reduce((e, t) => e.add(t.power), new m("0")) : new m(0);
+			return new P(e, m.max(t, n));
 		});
 		return new e(...a);
 	}
@@ -3866,17 +3851,17 @@ var O = class e {
 				e.multiply(t.clone().divide(r[n]));
 			}), i = t;
 		}
-		let a = e.gcd(...n), o = new O(0).add(...n.map((e) => e.divide(a).reduce().develop().factors[0].polynom)).reduce();
-		return this.#t = [...a.factors, new A(o)], i && this.divide(i), this.#t = this.#t.filter((e) => !e.power.isZero()), this;
+		let a = e.gcd(...n), o = new M(0).add(...n.map((e) => e.divide(a).reduce().develop().factors[0].polynom)).reduce();
+		return this.#t = [...a.factors, new P(o)], i && this.divide(i), this.#t = this.#t.filter((e) => !e.power.isZero()), this;
 	}
 	get asPower() {
-		return this.#e = j.POWER, this;
+		return this.#e = F.POWER, this;
 	}
 	get asRoot() {
-		return this.#e = j.ROOT, this;
+		return this.#e = F.ROOT, this;
 	}
 	degree(e) {
-		return this.#t.reduce((t, n) => t.add(n.degree(e)), new p("0"));
+		return this.#t.reduce((t, n) => t.add(n.degree(e)), new m("0"));
 	}
 	get denominator() {
 		return new e(...this.#t.filter((e) => e.power.isNegative()).map((e) => e.clone().inverse()));
@@ -3892,7 +3877,7 @@ var O = class e {
 		return r !== void 0 && (this.#t = r.factors), this.add(...t);
 	}
 	develop() {
-		let t = new O("1"), n = new O("1");
+		let t = new M("1"), n = new M("1");
 		return this.numerator.factors.forEach((e) => {
 			t.multiply(e.develop());
 		}), this.denominator.factors.forEach((e) => {
@@ -3903,7 +3888,7 @@ var O = class e {
 		return this.#t = this.#t.concat(e.clone().factors.map((e) => e.inverse())), this;
 	}
 	evaluate(e, t) {
-		return t ? this.#t.reduce((n, r) => n * r.evaluate(e, t), 1) : this.#t.reduce((t, n) => t.multiply(n.evaluate(e)), new p("1"));
+		return t ? this.#t.reduce((n, r) => n * r.evaluate(e, t), 1) : this.#t.reduce((t, n) => t.multiply(n.evaluate(e)), new m("1"));
 	}
 	factorize(t) {
 		let n = [];
@@ -3911,7 +3896,7 @@ var O = class e {
 			let r = e.polynom.factorize(t);
 			if (r.length > 1) {
 				let t = e.power.clone();
-				n.push(...r.map((e) => new A(e, t)));
+				n.push(...r.map((e) => new P(e, t)));
 			} else n.push(e.clone());
 		});
 		let r = new e(...n), i = r.numerator.reduce(), a = r.denominator.reduce();
@@ -3924,20 +3909,20 @@ var O = class e {
 		this.#t = e;
 	}
 	fromPolynom(e, t) {
-		if (this.#t = [new A(new O(e))], t) {
-			let e = new O(t);
+		if (this.#t = [new P(new M(e))], t) {
+			let e = new M(t);
 			if (e.isOne()) return this;
-			if (e.isZero()) throw Error("Cannot divide by zero");
-			this.#t.push(new A(e, -1));
+			if (e.isZero()) throw new r("Cannot divide by zero");
+			this.#t.push(new P(e, -1));
 		}
 		return this;
 	}
 	fromString(e) {
 		this.#t = [];
-		let [t, ...n] = _(e, "/");
-		if (t === "") throw Error("Parsing a PolyFactor from a string requires a numerator");
-		if (n.length > 1) throw Error("Parsing a PolyFactor from a string only allows max one signe \"/\"");
-		return n.length === 0 ? this.#t = A.factorsFromString(h(t), !0) : this.#t = [...A.factorsFromString(h(t), !0), ...A.factorsFromString(h(n[0]), !1)], this;
+		let [n, ...r] = _(e, "/");
+		if (n === "") throw new t("Parsing a PolyFactor from a string requires a numerator");
+		if (r.length > 1) throw new t("Parsing a PolyFactor from a string only allows max one signe \"/\"");
+		return this.#t = r.length === 0 ? P.factorsFromString(h(n), !0) : [...P.factorsFromString(h(n), !0), ...P.factorsFromString(h(r[0]), !1)], this;
 	}
 	getRoots() {
 		return [];
@@ -3962,36 +3947,37 @@ var O = class e {
 	isZero() {
 		return this.#t.every((e) => e.isZero());
 	}
-	multiply(...e) {
-		return e.forEach((e) => {
-			this.#t = this.#t.concat(e.clone().factors);
+	multiply(...t) {
+		return t.forEach((t) => {
+			let n = new e(t);
+			this.#t = this.#t.concat(n.factors);
 		}), this;
 	}
 	get numerator() {
 		return new e(...this.#t.filter((e) => e.power.isPositive()));
 	}
 	one() {
-		return this.#t = [new A("1", "1")], this;
+		return this.#t = [new P("1", "1")], this;
 	}
 	opposite() {
 		let e = this.#t.findIndex((e) => e.display === "(-1)");
-		return e >= 0 ? this.#t.splice(e, 1) : this.#t.push(new A("-1", "1")), this;
+		return e >= 0 ? this.#t.splice(e, 1) : this.#t.push(new P("-1", "1")), this;
 	}
 	pow(e) {
 		return this.#t = this.#t.map((t) => t.pow(e)), this;
 	}
 	primitive() {
-		throw Error("Method not implemented.");
+		throw new a("Method not implemented.");
 	}
 	reduce() {
-		let e = N(this);
+		let e = z(this);
 		this.#t = Object.values(e).map((e) => {
 			let t = e[0].polynom;
-			return new A(t, e.reduce((e, t) => e.add(t.power), new p("0")).reduce());
+			return new P(t, e.reduce((e, t) => e.add(t.power), new m("0")).reduce());
 		}).filter((e) => !e.power.isZero());
-		let t = new A(1), n = new A(1), r = this.#t.filter((e) => e.polynom.monoms.length === 1 && e.power.isRelative());
+		let t = new P(1), n = new P(1), r = this.#t.filter((e) => e.polynom.monoms.length === 1 && e.power.isRelative());
 		return r.length > 0 && (r.forEach((e) => {
-			e.power.isPositive() ? t.multiply(new A(e.polynom.clone().pow(e.power.value))) : n.multiply(new A(e.polynom.clone().pow(-e.power.value)));
+			e.power.isPositive() ? t.multiply(new P(e.polynom.clone().pow(e.power.value))) : n.multiply(new P(e.polynom.clone().pow(-e.power.value)));
 		}), this.#t = this.#t.filter((e) => !(e.polynom.monoms.length === 1 && e.power.isRelative())), n.polynom.isOne() || this.#t.push(n.inverse()), t.polynom.isOne() || this.#t.push(t)), this;
 	}
 	root(e) {
@@ -4015,7 +4001,7 @@ var O = class e {
 	}
 	tableOfSigns() {
 		let e = this.getZeroes(), t = e.map((e) => e.value), n = this.factorize().factors.map((e) => ({
-			factor: new A(e),
+			factor: new P(e),
 			...e.tableOfSigns()
 		}));
 		return n.forEach((n) => {
@@ -4038,9 +4024,7 @@ var O = class e {
 					case "h":
 						e[n] = "h";
 						break;
-					case "-":
-						e[n] = e[n] === "h" ? "h" : e[n] === "-" ? "+" : "-";
-						break;
+					case "-": e[n] = e[n] === "h" ? "h" : e[n] === "-" ? "+" : "-";
 				}
 			}), e), []),
 			roots: e,
@@ -4051,18 +4035,18 @@ var O = class e {
 		return this.#t.reduce((e, t) => e.concat(t.variables), []);
 	}
 	zero() {
-		return this.#t = [new A("0", "1")], this;
+		return this.#t = [new P("0", "1")], this;
 	}
 	#i() {
 		let e, t = [];
-		return this.#e === j.ROOT ? (e = this.numerator.factors, t = this.denominator.factors) : e = this.#t, e.length === 0 && (e = [new A("1")]), {
+		return this.#e === F.ROOT ? (e = this.numerator.factors, t = this.denominator.factors) : e = this.#t, e.length === 0 && (e = [new P("1")]), {
 			num: e,
 			den: t
 		};
 	}
 };
-function N(e) {
-	let t = new p().one(), n = new p().one(), r = e.factors.reduce((e, r) => {
+function z(e) {
+	let t = new m().one(), n = new m().one(), r = e.factors.reduce((e, r) => {
 		if (r.polynom.degree().isZero() && r.power.isRelative()) {
 			let i = r.polynom.monoms[0].coefficient.pow(r.power.clone().abs());
 			return r.power.isPositive() ? t.multiply(i) : n.multiply(i), e;
@@ -4070,11 +4054,11 @@ function N(e) {
 		let i = r.polynom.display;
 		return Object.hasOwn(e, i) ? e[i].push(r) : e[i] = [r], e;
 	}, {}), { numerator: i, denominator: a } = t.divide(n).reduce();
-	return i !== 1 && (r[i.toString()] = [new A(i, 1)]), a !== 1 && (r[a.toString()] = [new A(a, -1)]), r;
+	return i !== 1 && (r[i.toString()] = [new P(i, 1)]), a !== 1 && (r[a.toString()] = [new P(a, -1)]), r;
 }
 //#endregion
 //#region src/algebra/matrix.ts
-var le = class e {
+var ve = class e {
 	#e = null;
 	#t = 0;
 	#n = [];
@@ -4114,7 +4098,7 @@ var le = class e {
 		return this.#e = null, t;
 	}
 	add(e) {
-		if (!this.canBeAdded(e)) throw Error("Cannot add a matrix with different dimensions.");
+		if (!this.canBeAdded(e)) throw new n("Cannot add a matrix with different dimensions.");
 		return this.forEach((t, n, r) => {
 			t.add(e.values[n][r]);
 		}), this;
@@ -4139,7 +4123,7 @@ var le = class e {
 		return this.dimension.cols === e.dimension.rows;
 	}
 	characteristic_polynom(t) {
-		return t ??= "k", this.clone().subtract(new e(this.dimension.rows).one().multiply(new O(t))).determinant();
+		return t ??= "k", this.clone().subtract(new e(this.dimension.rows).one().multiply(new M(t))).determinant();
 	}
 	cofactor(e, t) {
 		let n = this.clone();
@@ -4148,14 +4132,14 @@ var le = class e {
 		}), n.determinant().multiply((-1) ** (e + t));
 	}
 	get cols() {
-		let e = Array.from({ length: this.dimension.cols }, () => Array.from({ length: this.dimension.rows }, () => new O()));
+		let e = Array.from({ length: this.dimension.cols }, () => Array.from({ length: this.dimension.rows }, () => new M()));
 		return this.forEach((t, n, r) => {
 			e[r][n] = t;
 		}), e;
 	}
 	determinant() {
-		if (!this.isSquare()) throw Error("Matrix is not square");
-		let e = new O();
+		if (!this.isSquare()) throw new n("Matrix is not square");
+		let e = new M();
 		return this.#n.length === 1 ? this.#n[0][0].clone() : (this.values[0].forEach((t, n) => {
 			let r = this.cofactor(0, n);
 			e.add(t.clone().multiply(r));
@@ -4178,36 +4162,36 @@ var le = class e {
 		});
 	}
 	fromDimensions(e, t) {
-		return this.#n = Array.from({ length: e }, () => Array.from({ length: t }, () => new O())), this;
+		return this.#n = Array.from({ length: e }, () => Array.from({ length: t }, () => new M())), this;
 	}
 	fromString(e) {
 		if (e.startsWith("((") && e.endsWith("))")) return this.fromString(e.substring(1, e.length - 1));
 		let t = e.split("),(");
-		return this.#n = t.map((e, n) => n === 0 ? e.substring(1).split(",") : n === t.length - 1 ? e.substring(0, e.length - 1).split(",") : e.split(",")).map((e) => e.map((e) => new O(e))), this;
+		return this.#n = t.map((e, n) => n === 0 ? e.substring(1).split(",") : n === t.length - 1 ? e.substring(0, e.length - 1).split(",") : e.split(",")).map((e) => e.map((e) => new M(e))), this;
 	}
 	fromValues(e) {
 		this.#n = [];
 		let t = e[0].length;
-		if (e.some((e) => e.length !== t)) throw Error("Each line must be the same length");
+		if (e.some((e) => e.length !== t)) throw new n("Each line must be the same length");
 		return e.forEach((e) => {
 			let t = [];
 			e.forEach((e) => {
-				t.push(new O(e));
+				t.push(new M(e));
 			}), this.#n.push(t);
 		}), this;
 	}
 	fromVectors(...e) {
 		this.#n = [];
 		let t = e[0].dimension;
-		if (e.some((e) => e.dimension !== t)) throw Error("Each vectors must be the same dimension");
+		if (e.some((e) => e.dimension !== t)) throw new n("Each vectors must be the same dimension");
 		return this.fromDimensions(e[0].dimension, e.length), e.forEach((e, t) => {
 			e.array.forEach((e, n) => {
-				this.#n[n][t] = new O(e);
+				this.#n[n][t] = new M(e);
 			});
 		}), this;
 	}
 	inverse() {
-		if (!this.canBeInverted()) throw Error("The matrix cannot be inverted.");
+		if (!this.canBeInverted()) throw new r("The matrix cannot be inverted.");
 		let t = new e().fromDimensions(this.dimension.rows, this.dimension.cols);
 		t.forEach((e, n, r) => {
 			t.setValue(n, r, this.cofactor(n, r));
@@ -4242,14 +4226,14 @@ var le = class e {
 	}
 	multiply(t) {
 		if (t instanceof e) {
-			if (!this.canBeMultiplied(t)) throw Error("Cannot multiply a matrix with incompatibles dimensions");
-			let n = new e(this.dimension.rows, t.dimension.cols);
-			return n.forEach((e, r, i) => {
-				let a = this.rows[r], o = t.cols[i], s = new O();
+			if (!this.canBeMultiplied(t)) throw new n("Cannot multiply a matrix with incompatibles dimensions");
+			let r = new e(this.dimension.rows, t.dimension.cols);
+			return r.forEach((e, n, i) => {
+				let a = this.rows[n], o = t.cols[i], s = new M();
 				a.forEach((e, t) => {
 					s.add(e.clone().multiply(o[t]));
-				}), n.setValue(r, i, s);
-			}), this.#n = n.values, this;
+				}), r.setValue(n, i, s);
+			}), this.#n = r.values, this;
 		}
 		return this.forEach((e, n, r) => {
 			this.setValue(n, r, e.multiply(t));
@@ -4275,21 +4259,21 @@ var le = class e {
 		return this.#t = 4, this;
 	}
 	pow(e) {
-		return D(this, e);
+		return j(this, e);
 	}
 	reduce() {
-		throw Error("Not yet implemented");
+		throw new a("Not yet implemented");
 	}
 	get rows() {
 		return this.#n;
 	}
 	setValue(e, t, n) {
 		let { rows: r, cols: i } = this.dimension;
-		if (e < 0 || e >= r || t < 0 || t >= i) throw Error(`${e}x${t} is out of range (${r}x${i})`);
-		return this.#n[e][t] = new O(n), this;
+		if (e < 0 || e >= r || t < 0 || t >= i) throw new o(`${e}x${t} is out of range (${r}x${i})`);
+		return this.#n[e][t] = new M(n), this;
 	}
 	subtract(e) {
-		if (!this.canBeAdded(e)) throw Error("Cannot subtract a matrix with different dimensions.");
+		if (!this.canBeAdded(e)) throw new n("Cannot subtract a matrix with different dimensions.");
 		return this.forEach((t, n, r) => {
 			t.subtract(e.values[n][r]);
 		}), this;
@@ -4311,29 +4295,29 @@ var le = class e {
 };
 //#endregion
 //#region src/geometry/geomMath.ts
-function ue(e, t) {
+function ye(e, t) {
 	return e.dimension === t.dimension && e.array.every((e, n) => t.array[n].isEqual(e));
 }
-function de(e, t) {
+function be(e, t) {
 	if (e.dimension !== t.dimension) return !1;
 	let n = t.array[0].value / e.array[0].value;
 	return e.array.every((e, r) => t.array[r].value === e.value * n);
 }
-function P(e, t) {
-	return e.dimension === t.dimension ? e.array.reduce((e, n, r) => e.add(n.clone().multiply(t.array[r])), new p(0)) : new p().invalid();
+function xe(e, t) {
+	return e.dimension === t.dimension ? e.array.reduce((e, n, r) => e.add(n.clone().multiply(t.array[r])), new m(0)) : new m().invalid();
 }
-function fe(...e) {
-	if (e.some((t) => t.dimension !== e[0].dimension)) throw Error("All vectors must have the same dimension");
-	if (e[0].dimension !== e.length) throw Error(`The determinant of dimension ${e[0].dimension} must have the same number of vectors (${e.length} given)`);
+function Se(...e) {
+	if (e.some((t) => t.dimension !== e[0].dimension)) throw new n("All vectors must have the same dimension");
+	if (e[0].dimension !== e.length) throw new n(`The determinant of dimension ${e[0].dimension} must have the same number of vectors (${e.length} given)`);
 	return e[0].dimension === 2 ? e[0].array[0].clone().multiply(e[1].array[1]).subtract(e[0].array[1].clone().multiply(e[1].array[0])) : e[0].array[0].clone().multiply(e[1].array[1].clone().multiply(e[2].array[2]).subtract(e[1].array[2].clone().multiply(e[2].array[1]))).subtract(e[0].array[1].clone().multiply(e[1].array[0].clone().multiply(e[2].array[2]).subtract(e[1].array[2].clone().multiply(e[2].array[0])))).add(e[0].array[2].clone().multiply(e[1].array[0].clone().multiply(e[2].array[1]).subtract(e[1].array[1].clone().multiply(e[2].array[0]))));
 }
 //#endregion
 //#region src/geometry/TupleN.ts
-var F = class {
+var B = class {
 	#e = [];
 	#t;
 	constructor(...e) {
-		this.#e = e.map((e) => new p(e));
+		this.#e = e.map((e) => new m(e));
 	}
 	copy() {
 		return this.#e.map((e) => e.clone());
@@ -4350,7 +4334,7 @@ var F = class {
 	fromString(e) {
 		e.startsWith("(") && (e = e.substring(1)), e.endsWith(")") && (e = e.substring(0, e.length - 1));
 		let t = e.split(/[,;\s]/g).filter((e) => e.trim() !== "");
-		return t.length < 2 || (this.#e = t.map((e) => new p(e))), this;
+		return t.length < 2 || (this.#e = t.map((e) => new m(e))), this;
 	}
 	get onChange() {
 		return this.#t;
@@ -4359,46 +4343,46 @@ var F = class {
 		this.#t = e;
 	}
 	setDimension(e = 2) {
-		if (e < 2) throw Error("Dimension must be at least 2");
+		if (e < 2) throw new n("Dimension must be at least 2");
 		if (e < this.dimension) this.#e = this.#e.slice(0, e);
-		else if (e > this.dimension) for (let t = this.dimension; t < e; t++) this.#e.push(new p(0));
+		else if (e > this.dimension) for (let t = this.dimension; t < e; t++) this.#e.push(new m(0));
 		return this;
 	}
 	get x() {
 		return this.#e[0];
 	}
 	set x(e) {
-		this.#e[0] = new p(e), this.#t?.();
+		this.#e[0] = new m(e), this.#t?.();
 	}
 	get y() {
 		return this.#e[1];
 	}
 	set y(e) {
-		this.#e[1] = new p(e), this.#t?.();
+		this.#e[1] = new m(e), this.#t?.();
 	}
 	get z() {
-		if (this.dimension < 3) throw Error("Vector is not 3D");
+		if (this.dimension < 3) throw new n("Vector is not 3D");
 		return this.#e[2];
 	}
 	set z(e) {
-		if (this.dimension < 3) throw Error("Vector is not 3D");
-		this.#e[2] = new p(e), this.#t?.();
+		if (this.dimension < 3) throw new n("Vector is not 3D");
+		this.#e[2] = new m(e), this.#t?.();
 	}
 	zero = () => (this.#e.forEach((e) => e.zero()), this.#t?.(), this);
-}, I = class e extends F {
+}, V = class e extends B {
 	constructor(...e) {
 		super(), e.length > 0 && this.parse(...e);
 	}
-	parse(...t) {
-		if (t.length === 1) {
-			if (t[0] instanceof F) return this.array = t[0].copy(), this;
-			if (typeof t[0] == "string") return this.fromString(t[0]), this;
+	parse(...n) {
+		if (n.length === 1) {
+			if (n[0] instanceof B) return this.array = n[0].copy(), this;
+			if (typeof n[0] == "string") return this.fromString(n[0]), this;
 		}
-		if (t.length > 1) {
-			if (t.some((t) => t instanceof e)) throw Error("Creating a point with  multiple argument requires an input fraction");
-			let n = t.map((e) => new p(e));
-			if (n.some((e) => e.isNaN())) throw Error("The given values are not a valid point string (a,b): ");
-			this.array = n;
+		if (n.length > 1) {
+			if (n.some((t) => t instanceof e)) throw new i("Creating a point with  multiple argument requires an input fraction");
+			let r = n.map((e) => new m(e));
+			if (r.some((e) => e.isNaN())) throw new t("The given values are not a valid point string (a,b): ");
+			this.array = r;
 		}
 		return this;
 	}
@@ -4412,8 +4396,8 @@ var F = class {
 		return `(${this.array.map((e) => e.display).join(";")})`;
 	}
 	distanceTo(e) {
-		if (this.dimension !== e.dimension) throw Error("The two points must have the same dimensions.");
-		let t = this.array.map((t, n) => e.array[n].clone().subtract(t)).reduce((e, t) => e.add(t.clone().pow(2)), new p(0));
+		if (this.dimension !== e.dimension) throw new n("The two points must have the same dimensions.");
+		let t = this.array.map((t, n) => e.array[n].clone().subtract(t)).reduce((e, t) => e.add(t.clone().pow(2)), new m(0));
 		return new v().from(2, t).reduce();
 	}
 	isEqual(e) {
@@ -4423,30 +4407,30 @@ var F = class {
 		return this.isEqual(new e(t, n));
 	}
 	middleOf(e, t) {
-		if (e.dimension !== t.dimension) throw Error("Vectors must be the same dimension");
+		if (e.dimension !== t.dimension) throw new n("Vectors must be the same dimension");
 		return this.array = [], e.array.forEach((e, n) => {
 			this.array.push(e.clone().add(t.array[n]).divide(2));
 		}), this;
 	}
-}, L = class e extends F {
+}, H = class e extends B {
 	constructor(...e) {
 		return super(), e.length > 0 && this.parse(...e), this;
 	}
 	parse(...e) {
-		if (e.length === 0) throw Error("Invalid value");
+		if (e.length === 0) throw new i("Invalid value");
 		if (e.length === 1) {
-			if (e[0] instanceof F) return this.array = e[0].copy(), this;
+			if (e[0] instanceof B) return this.array = e[0].copy(), this;
 			if (typeof e[0] == "string") return this.fromString(e[0]);
-			throw Error("Invalid value");
+			throw new i("Invalid value");
 		}
 		if (e.length === 2) {
-			let [t, n] = e;
-			if (t instanceof F && n instanceof F) {
-				if (t.dimension !== n.dimension) throw Error("Vectors must have the same dimension");
-				return this.array = n.array.map((e, n) => e.clone().subtract(t.array[n])), this;
+			let [t, r] = e;
+			if (t instanceof B && r instanceof B) {
+				if (t.dimension !== r.dimension) throw new n("Vectors must have the same dimension");
+				return this.array = r.array.map((e, n) => e.clone().subtract(t.array[n])), this;
 			}
 		}
-		return this.array = e.map((e) => new p(e)), this;
+		return this.array = e.map((e) => new m(e)), this;
 	}
 	clone() {
 		return new e(...this.copy());
@@ -4469,16 +4453,16 @@ var F = class {
 		return t && (r = Math.abs(r)), (n ? 1 : 180 / Math.PI) * Math.acos(r / (this.norm * e.norm));
 	};
 	cross(t) {
-		if (this.dimension !== 3 || t.dimension !== 3) throw Error("Cross product can only be determined in 3D");
+		if (this.dimension !== 3 || t.dimension !== 3) throw new n("Cross product can only be determined in 3D");
 		return new e(this.y.clone().multiply(t.z).subtract(this.z.clone().multiply(t.y)), this.z.clone().multiply(t.x).subtract(this.x.clone().multiply(t.z)), this.x.clone().multiply(t.y).subtract(this.y.clone().multiply(t.x)));
 	}
-	divideByScalar = (e) => this.multiplyByScalar(new p(e).inverse());
-	dot = (e) => P(this, e);
+	divideByScalar = (e) => this.multiplyByScalar(new m(e).inverse());
+	dot = (e) => xe(this, e);
 	fromString(e) {
 		return e.startsWith("((") && e.endsWith("))") ? super.fromString(e.slice(1, -1)) : super.fromString(e);
 	}
-	isColinearTo = (e) => de(this, e);
-	isEqual = (e) => ue(this, e);
+	isColinearTo = (e) => be(this, e);
+	isEqual = (e) => ye(this, e);
 	isNormalTo = (e) => this.dot(e).isZero();
 	get isNull() {
 		return this.array.every((e) => e.isZero());
@@ -4490,25 +4474,25 @@ var F = class {
 		return this.array.every((e) => e.isZero());
 	}
 	multiplyByScalar = (e) => {
-		let t = new p(e);
+		let t = new m(e);
 		return this.array.forEach((e) => e.multiply(t)), this;
 	};
 	get norm() {
 		return Math.sqrt(this.normSquare.value);
 	}
 	get normSquare() {
-		return this.array.reduce((e, t) => e.add(t.clone().pow(2)), new p(0));
+		return this.array.reduce((e, t) => e.add(t.clone().pow(2)), new m(0));
 	}
 	normal = () => {
-		if (this.dimension >= 3) throw Error("Normal vector can only be determined in 2D");
+		if (this.dimension >= 3) throw new n("Normal vector can only be determined in 2D");
 		let e = this.x.clone().opposite(), t = this.y.clone();
 		return this.array[0] = t, this.array[1] = e, this;
 	};
 	one = () => (this.zero(), this.x.one(), this);
 	opposite = () => (this.array.forEach((e) => e.opposite()), this);
 	simplify = () => {
-		let e = d.lcm(...this.array.map((e) => e.denominator)), t = d.gcd(...this.array.map((e) => e.numerator));
-		return this.multiplyByScalar(new p(e, t)), this.x.isNegative() && this.opposite(), this;
+		let e = p.lcm(...this.array.map((e) => e.denominator)), t = p.gcd(...this.array.map((e) => e.numerator));
+		return this.multiplyByScalar(new m(e, t)), this.x.isNegative() && this.opposite(), this;
 	};
 	subtract = (e) => this.add(e.clone().opposite());
 	translate(...e) {
@@ -4518,43 +4502,43 @@ var F = class {
 		let e = this.norm;
 		return e === 0 ? this : this.divideByScalar(e);
 	};
-}, R = /* @__PURE__ */ function(e) {
+}, U = /* @__PURE__ */ function(e) {
 	return e.None = "none", e.Parallel = "parallel", e.Perpendicular = "perpendicular", e.Tangent = "tangent", e;
-}({}), z = /* @__PURE__ */ function(e) {
+}({}), Ce = /* @__PURE__ */ function(e) {
 	return e.None = "none", e.Parallel = "parallel", e.Perpendicular = "perpendicular", e.Tangent = "tangent", e;
 }({});
 //#endregion
 //#region src/randomization/rndHelpers.ts
-function B(e = .5) {
+function we(e = .5) {
 	return Math.random() < e;
 }
-function V(e, t, n) {
-	if (t === void 0) return e >= 0 ? V(0, e) : V(e, 0);
+function W(e, t, n) {
+	if (t === void 0) return e >= 0 ? W(0, e) : W(e, 0);
 	if (e === t) return e;
 	if (n === void 0) return Math.floor(Math.random() * (t - e + 1) + e);
-	if (Math.abs(t - e) <= n.length) throw Error("The number of excluded values is too high.");
-	let r = V(e, t);
-	for (; n.includes(r);) r = V(e, t);
+	if (Math.abs(t - e) <= n.length) throw new i("The number of excluded values is too high.");
+	let r = W(e, t);
+	for (; n.includes(r);) r = W(e, t);
 	return r;
 }
-function H(e, t) {
-	return t === !1 ? B() ? V(1, e) : -V(1, e) : V(-e, e);
+function G(e, t) {
+	return t === !1 ? we() ? W(1, e) : -W(1, e) : W(-e, e);
 }
-function pe(e, t) {
-	let n = d.pythagoreanTripletsWithTarget(e).filter((e) => t === !0 || !e.includes(0));
-	return n.length === 0 ? null : U(n);
+function Te(e, t) {
+	let n = p.pythagoreanTripletsWithTarget(e).filter((e) => t === !0 || !e.includes(0));
+	return n.length === 0 ? null : K(n);
 }
-function me(e) {
-	let t = d.primes();
-	return e !== void 0 && (t = t.filter((t) => t < e)), U(t);
+function Ee(e) {
+	let t = p.primes();
+	return e !== void 0 && (t = t.filter((t) => t < e)), K(t);
 }
-function he(e, t) {
-	return t === void 0 && (t = 1), e.length <= 0 ? Object.values(e) : W(e).slice(0, t);
+function De(e, t) {
+	return t === void 0 && (t = 1), e.length <= 0 ? Object.values(e) : Oe(e).slice(0, t);
 }
-function U(e) {
-	return e.length === 0 ? null : e[V(0, e.length - 1)];
+function K(e) {
+	return e.length === 0 ? null : e[W(0, e.length - 1)];
 }
-function W(e) {
+function Oe(e) {
 	let t = Object.values(e);
 	for (let e = t.length - 1; e > 0; e--) {
 		let n = Math.floor(Math.random() * (e + 1)), r = t[e];
@@ -4564,9 +4548,9 @@ function W(e) {
 }
 //#endregion
 //#region src/geometry/line.ts
-var G = class e {
-	static PARALLEL = R.Parallel;
-	static PERPENDICULAR = R.Perpendicular;
+var q = class e {
+	static PARALLEL = U.Parallel;
+	static PERPENDICULAR = U.Perpendicular;
 	#e;
 	#t;
 	#n;
@@ -4574,36 +4558,36 @@ var G = class e {
 	#i;
 	#a = 1;
 	constructor(...e) {
-		return this.#t = new p().zero(), this.#n = new p().zero(), this.#r = new p().zero(), this.#e = new L(), this.#i = "lr", e.length > 0 && this.parse(...e), this;
-	}
-	parse = (...t) => {
-		if (t.length === 0) return this;
-		if (t.length === 1) {
-			if (t[0] instanceof e) return this.fromCoefficient(t[0].a, t[0].b, t[0].c);
-			if (t[0] instanceof k) return this.fromEquation(t[0]);
-			if (typeof t[0] == "string") try {
-				let e = new k(t[0]);
+		return this.#t = new m().zero(), this.#n = new m().zero(), this.#r = new m().zero(), this.#e = new H(), this.#i = "lr", e.length > 0 && this.parse(...e), this;
+	}
+	parse = (...n) => {
+		if (n.length === 0) return this;
+		if (n.length === 1) {
+			if (n[0] instanceof e) return this.fromCoefficient(n[0].a, n[0].b, n[0].c);
+			if (n[0] instanceof N) return this.fromEquation(n[0]);
+			if (typeof n[0] == "string") try {
+				let e = new N(n[0]);
 				return this.parse(e);
 			} catch (e) {
-				return console.warn(e), this;
+				throw new t(`Cannot parse "${n[0]}" as a Line`, { cause: e });
 			}
 		}
-		if (t.length === 2) {
-			if (t[0] instanceof I && t[1] instanceof I) return this.fromPoints(t[0], t[1]);
-			if (t[0] instanceof I && t[1] instanceof L) return this.fromPointAndDirection(t[0], t[1]);
+		if (n.length === 2) {
+			if (n[0] instanceof V && n[1] instanceof V) return this.fromPoints(n[0], n[1]);
+			if (n[0] instanceof V && n[1] instanceof H) return this.fromPointAndDirection(n[0], n[1]);
 		}
-		return t.length === 3 && t.every((e) => p.isFraction(e)) ? this.fromCoefficient(t[0], t[1], t[2]) : (console.warn("Something wrong happened while creating the line"), console.warn(t), this);
+		return n.length === 3 && n.every((e) => m.isFraction(e)) ? this.fromCoefficient(n[0], n[1], n[2]) : (console.warn("Something wrong happened while creating the line"), console.warn(n), this);
 	};
 	clone = () => new e().fromCoefficient(this.#t, this.#n, this.#r);
 	get tex() {
 		let e = this.#a;
 		switch (this.#a = 1, e) {
 			case 0: return this.getEquation().reorder().tex;
-			case 2: return this.slope.isInfinity() ? "x=" + this.OA.x.tex : "y=" + new O().parse("x", this.slope, this.height).tex;
+			case 2: return this.slope.isInfinity() ? "x=" + this.OA.x.tex : "y=" + new M().parse("x", this.slope, this.height).tex;
 			case 3:
 			case 4: {
 				let t = this.d.clone().simplify();
-				return e === 3 ? `${L.asTex("x", "y")} = ${L.asTex(this.#e.x.tex, this.#e.y.tex)} + k\\cdot ${L.asTex(t.x.tex, t.y.tex)}` : `\\left\\{\\begin{aligned}\n\tx &= ${new O(this.#e.x).add(new E(t.x).multiply(new E("k"))).reorder("k", !0).tex}\\\\\n\ty &= ${new O(this.#e.y).add(new E(t.y).multiply(new E("k"))).reorder("k", !0).tex}\n\\end{aligned}\\right.`;
+				return e === 3 ? `${H.asTex("x", "y")} = ${H.asTex(this.#e.x.tex, this.#e.y.tex)} + k\\cdot ${H.asTex(t.x.tex, t.y.tex)}` : `\\left\\{\\begin{aligned}\n\tx &= ${new M(this.#e.x).add(new A(t.x).multiply(new A("k"))).reorder("k", !0).tex}\\\\\n\ty &= ${new M(this.#e.y).add(new A(t.y).multiply(new A("k"))).reorder("k", !0).tex}\n\\end{aligned}\\right.`;
 			}
 			default: {
 				let e = this.getEquation();
@@ -4615,13 +4599,13 @@ var G = class e {
 		let e = this.#a;
 		switch (this.#a = 1, e) {
 			case 0: return this.getEquation().reorder().display;
-			case 2: return this.slope.isInfinity() ? "x=" + this.OA.x.display : "y=" + new O().parse("x", this.slope, this.height).display;
+			case 2: return this.slope.isInfinity() ? "x=" + this.OA.x.display : "y=" + new M().parse("x", this.slope, this.height).display;
 			case 3: {
 				let e = this.d.clone().simplify();
 				return `((x,y))=((${this.#e.x.display},${this.#e.y.display}))+k((${e.x.display},${e.y.display}))`;
 			}
 			case 4: {
-				let e = this.d.clone().simplify(), t = new O(this.#e.x).add(new E(e.x).multiply(new E("k"))).reorder("k", !0), n = new O(this.#e.y).add(new E(e.y).multiply(new E("k"))).reorder("k", !0);
+				let e = this.d.clone().simplify(), t = new M(this.#e.x).add(new A(e.x).multiply(new A("k"))).reorder("k", !0), n = new M(this.#e.y).add(new A(e.y).multiply(new A("k"))).reorder("k", !0);
 				return `{(x,=,${t.display}),(y,=,${n.display}):}`;
 			}
 			default: {
@@ -4674,7 +4658,7 @@ var G = class e {
 		return this.#t.isZero() || (t = this.#t.isOne() ? "x" : this.#t.clone().opposite().isOne() ? "-x" : this.#t.value.toFixed(e) + "x"), this.#n.isZero() || (this.#n.isPositive() && (t += "+"), t += this.#n.value.toFixed(e) + "y"), this.#r.isZero() || (this.#r.isPositive() && (t += "+"), t += this.#r.value.toFixed(e)), t + "=0";
 	}
 	get d() {
-		let e = new L(this.#n.clone(), this.#t.clone().opposite());
+		let e = new H(this.#n.clone(), this.#t.clone().opposite());
 		return (this.#i === "lr" && e.x.isNegative() || this.#i === "rl" && e.x.isPositive()) && e.opposite(), e;
 	}
 	set d(e) {
@@ -4688,19 +4672,19 @@ var G = class e {
 		return n.isZero() ? new v(0) : new v().from(2, n.inverse(), t).reduce();
 	}
 	fromCoefficient(e, t, n) {
-		this.#t = new p(e), this.#n = new p(t), this.#r = new p(n);
+		this.#t = new m(e), this.#n = new m(t), this.#r = new m(n);
 		let r = [
 			this.#t,
 			this.#n,
 			this.#r
-		].every((e) => e.exact) ? d.lcm(this.#t.denominator, this.#n.denominator, this.#r.denominator) : 1;
-		if (r > 1 && (this.#t.multiply(r).reduce(), this.#n.multiply(r).reduce(), this.#r.multiply(r).reduce()), this.#n.isZero()) return this.#e = new L(this.#r.clone().divide(this.#t).opposite(), 0), this;
+		].every((e) => e.exact) ? p.lcm(this.#t.denominator, this.#n.denominator, this.#r.denominator) : 1;
+		if (r > 1 && (this.#t.multiply(r).reduce(), this.#n.multiply(r).reduce(), this.#r.multiply(r).reduce()), this.#n.isZero()) return this.#e = new H(this.#r.clone().divide(this.#t).opposite(), 0), this;
 		for (let e = 0; e < this.#n.value; e++) {
 			let t = this.#t.clone().divide(this.#n).multiply(e).subtract(this.#r.clone().divide(this.#n)).reduce();
-			if (this.#e = new L(e, t), t.isRelative()) return this;
+			if (this.#e = new H(e, t), t.isRelative()) return this;
 		}
 		let i = this.#r.clone().divide(this.#n).opposite().reduce();
-		return this.#e = new L(0, i), this;
+		return this.#e = new H(0, i), this;
 	}
 	fromEquation(e) {
 		e.reorder(!0);
@@ -4718,23 +4702,23 @@ var G = class e {
 	fromPointAndDirection(e, t) {
 		return this.#i = t.x.isPositive() ? "lr" : "rl", this.fromPointAndNormal(e, t.clone().normal());
 	}
-	fromPointAndLine(e, t, n = R.Parallel) {
-		return n === R.Perpendicular ? this.fromPointAndNormal(e, t.director) : this.fromPointAndNormal(e, t.normal);
+	fromPointAndLine(e, t, n = U.Parallel) {
+		return n === U.Perpendicular ? this.fromPointAndNormal(e, t.director) : this.fromPointAndNormal(e, t.normal);
 	}
-	fromPointAndNormal = (e, t) => t.isZero() ? (console.warn("Normal vector is null."), this) : (this.fromCoefficient(t.x, t.y, e.x.clone().multiply(t.x).add(e.y.clone().multiply(t.y)).opposite()), this.#e = new L(e.clone()), this);
+	fromPointAndNormal = (e, t) => t.isZero() ? (console.warn("Normal vector is null."), this) : (this.fromCoefficient(t.x, t.y, e.x.clone().multiply(t.x).add(e.y.clone().multiply(t.y)).opposite()), this.#e = new H(e.clone()), this);
 	fromPoints(e, t) {
-		return this.fromPointAndNormal(e, new L(e, t).normal());
+		return this.fromPointAndNormal(e, new H(e, t).normal());
 	}
 	getEquation() {
-		return new k(new O().parse("xy", this.#t, this.#n, this.#r), new O("0")).simplify();
+		return new N(new M().parse("xy", this.#t, this.#n, this.#r), new M("0")).simplify();
 	}
 	getValueAtX = (e) => {
-		let t = this.getEquation().isolate("y"), n = new p(e);
-		return t instanceof k ? t.right.evaluate({ x: n }) : new p().invalid();
+		let t = this.getEquation().isolate("y"), n = new m(e);
+		return t instanceof N ? t.right.evaluate({ x: n }) : new m().invalid();
 	};
 	getValueAtY = (e) => {
-		let t = this.getEquation().isolate("x"), n = new p(e);
-		return t instanceof k ? t.right.evaluate({ y: n }) : new p().invalid();
+		let t = this.getEquation().isolate("x"), n = new m(e);
+		return t instanceof N ? t.right.evaluate({ y: n }) : new m().invalid();
 	};
 	get height() {
 		return this.#r.clone().opposite().divide(this.#n);
@@ -4744,8 +4728,8 @@ var G = class e {
 		return r.hasIntersection ? r.point.x.value >= Math.min(t.x.value, n.x.value) && r.point.x.value <= Math.max(t.x.value, n.x.value) && r.point.y.value >= Math.min(t.y.value, n.y.value) && r.point.y.value <= Math.max(t.y.value, n.y.value) : !1;
 	}
 	intersection = (e) => {
-		let t = new I(), n = !1, r = !1;
-		return this.#n.isZero() || e.b.isZero(), this.isParallelTo(e) ? (t.x = new p().invalid(), t.y = new p().invalid(), n = !0) : this.isSameAs(e) ? (t.x = new p().invalid(), t.y = new p().invalid(), r = !0) : (t.x = this.#n.clone().multiply(e.c).subtract(this.#r.clone().multiply(e.b)).divide(this.#t.clone().multiply(e.b).subtract(this.#n.clone().multiply(e.a))), t.y = this.#t.clone().multiply(e.c).subtract(this.#r.clone().multiply(e.a)).divide(this.#n.clone().multiply(e.a).subtract(this.#t.clone().multiply(e.b)))), {
+		let t = new V(), n = !1, r = !1;
+		return this.#n.isZero() || e.b.isZero(), this.isParallelTo(e) ? (t.x = new m().invalid(), t.y = new m().invalid(), n = !0) : this.isSameAs(e) ? (t.x = new m().invalid(), t.y = new m().invalid(), r = !0) : (t.x = this.#n.clone().multiply(e.c).subtract(this.#r.clone().multiply(e.b)).divide(this.#t.clone().multiply(e.b).subtract(this.#n.clone().multiply(e.a))), t.y = this.#t.clone().multiply(e.c).subtract(this.#r.clone().multiply(e.a)).divide(this.#n.clone().multiply(e.a).subtract(this.#t.clone().multiply(e.b)))), {
 			point: t,
 			hasIntersection: !(n || r),
 			isParallel: n,
@@ -4766,25 +4750,25 @@ var G = class e {
 		return this.d.normal();
 	}
 	get normal() {
-		return new L(this.#t, this.#n);
+		return new H(this.#t, this.#n);
 	}
 	randomNearPoint = (e) => {
 		let t = this.randomPoint(e), n = 10;
-		for (; this.isOnLine(t) && n > 0;) t.x.add(H(1, !1)), t.y.add(H(1, !1)), n--;
+		for (; this.isOnLine(t) && n > 0;) t.x.add(G(1, !1)), t.y.add(G(1, !1)), n--;
 		return t;
 	};
-	randomPoint = (e) => new I(this.d.clone().multiplyByScalar(H(e === void 0 || e <= 1 ? 3 : e, !1)).add(this.#e));
+	randomPoint = (e) => new V(this.d.clone().multiplyByScalar(G(e === void 0 || e <= 1 ? 3 : e, !1)).add(this.#e));
 	simplify = () => {
-		let e = d.lcm(this.#t.denominator, this.#n.denominator, this.#r.denominator), t = d.gcd(this.#t.numerator, this.#n.numerator, this.#r.numerator);
+		let e = p.lcm(this.#t.denominator, this.#n.denominator, this.#r.denominator), t = p.gcd(this.#t.numerator, this.#n.numerator, this.#r.numerator);
 		return this.fromCoefficient(this.#t.clone().multiply(e).divide(t), this.#n.clone().multiply(e).divide(t), this.#r.clone().multiply(e).divide(t)), this;
 	};
 	get slope() {
 		return this.#t.clone().opposite().divide(this.#n);
 	}
-}, K = class e {
-	#e = new I();
-	#t = new I();
-	#n = new I();
+}, J = class e {
+	#e = new V();
+	#t = new V();
+	#n = new V();
 	#r = !1;
 	#i = null;
 	#a = !0;
@@ -4805,12 +4789,12 @@ var G = class e {
 				let [e, n, r] = t;
 				return this.fromLines(e, n, r);
 			}
-			if (t.every((e) => e instanceof G)) return this.fromLines(t[0], t[1], t[2]);
-			if (t.every((e) => e instanceof I)) return this.fromPoints(t[0], t[1], t[2]);
+			if (t.every((e) => e instanceof q)) return this.fromLines(t[0], t[1], t[2]);
+			if (t.every((e) => e instanceof V)) return this.fromPoints(t[0], t[1], t[2]);
 		}
 		if (t.length === 6) {
-			let e = t.map((e) => new p(e));
-			if (e.some((e) => e.isNaN())) throw Error("One of the values is not a valid number");
+			let e = t.map((e) => new m(e));
+			if (e.some((e) => e.isNaN())) throw new i("One of the values is not a valid number");
 			return this.fromCoordinates(e[0], e[1], e[2], e[3], e[4], e[5]);
 		}
 		return this;
@@ -4862,10 +4846,10 @@ var G = class e {
 		return this.#a = !0, this;
 	}
 	fromCoordinates(e, t, n, r, i, a) {
-		return this.fromPoints(new I(e, t), new I(n, r), new I(i, a));
+		return this.fromPoints(new V(e, t), new V(n, r), new V(i, a));
 	}
 	fromLines(e, t, n) {
-		let r = new G(e).clone(), i = new G(t).clone(), a = new G(n).clone(), o = r.intersection(i);
+		let r = new q(e).clone(), i = new q(t).clone(), a = new q(n).clone(), o = r.intersection(i);
 		if (o.hasIntersection) this.#t = o.point;
 		else return this.#r = !1, this;
 		if (o = i.intersection(a), o.hasIntersection) this.#n = o.point;
@@ -4908,7 +4892,7 @@ var G = class e {
 	}
 	getHeights() {
 		if (!this.#o.heights) {
-			let e = new G().fromPointAndNormal(this.#e, new L(this.#t, this.#n)), t = new G().fromPointAndNormal(this.#t, new L(this.#e, this.#n)), n = new G().fromPointAndNormal(this.#n, new L(this.#e, this.#t)), r = e.intersection(t).point;
+			let e = new q().fromPointAndNormal(this.#e, new H(this.#t, this.#n)), t = new q().fromPointAndNormal(this.#t, new H(this.#e, this.#n)), n = new q().fromPointAndNormal(this.#n, new H(this.#e, this.#t)), r = e.intersection(t).point;
 			this.#o.heights = {
 				A: e,
 				B: t,
@@ -4921,7 +4905,7 @@ var G = class e {
 	getMedians() {
 		let e = this.getMiddles();
 		if (!this.#o.medians) {
-			let t = new G().fromPoints(this.#e, e.BC), n = new G().fromPoints(this.#t, e.AC), r = new G().fromPoints(this.#n, e.AB), i = t.intersection(n).point;
+			let t = new q().fromPoints(this.#e, e.BC), n = new q().fromPoints(this.#t, e.AC), r = new q().fromPoints(this.#n, e.AB), i = t.intersection(n).point;
 			this.#o.medians = {
 				A: t,
 				B: n,
@@ -4934,7 +4918,7 @@ var G = class e {
 	getMediators() {
 		let e = this.getMiddles();
 		if (!this.#o.mediators) {
-			let t = new G().fromPointAndNormal(e.BC, new L(this.#t, this.#n)), n = new G().fromPointAndNormal(e.AC, new L(this.#e, this.#n)), r = new G().fromPointAndNormal(e.AB, new L(this.#e, this.#t)), i = t.intersection(n).point;
+			let t = new q().fromPointAndNormal(e.BC, new H(this.#t, this.#n)), n = new q().fromPointAndNormal(e.AC, new H(this.#e, this.#n)), r = new q().fromPointAndNormal(e.AB, new H(this.#e, this.#t)), i = t.intersection(n).point;
 			this.#o.mediators = {
 				a: t,
 				b: n,
@@ -4946,9 +4930,9 @@ var G = class e {
 	}
 	getMiddles() {
 		return {
-			AB: new I().middleOf(this.#e, this.#t),
-			AC: new I().middleOf(this.#e, this.#n),
-			BC: new I().middleOf(this.#t, this.#n)
+			AB: new V().middleOf(this.#e, this.#t),
+			AC: new V().middleOf(this.#e, this.#n),
+			BC: new V().middleOf(this.#t, this.#n)
 		};
 	}
 	getPoints() {
@@ -4987,9 +4971,9 @@ var G = class e {
 	}
 	get lines() {
 		return this.#i === null && (this.#i = {
-			AB: new G(this.#e, this.#t),
-			BC: new G(this.#t, this.#n),
-			AC: new G(this.#e, this.#n)
+			AB: new q(this.#e, this.#t),
+			BC: new q(this.#t, this.#n),
+			AC: new q(this.#e, this.#n)
 		}), this.#i;
 	}
 	medianA() {
@@ -5014,14 +4998,14 @@ var G = class e {
 		}, this;
 	}
 	#s(e, t = !0) {
-		let n = this.lines, r = new L(), i = new L(), a = new I();
-		if (e === "A" ? (a = this.A.clone(), r = n.AB.clone().d, i = n.AC.clone().d) : e === "B" ? (a = this.B.clone(), r = n.AB.clone().d.opposite(), i = n.BC.clone().d) : e === "C" && (a = this.C.clone(), r = n.BC.clone().d.opposite(), i = n.AC.clone().d.opposite()), r === void 0 || i === void 0) throw Error(`The point ${e} does not exist`);
-		let o = t ? r.unit().add(i.unit()) : r.unit().subtract(i.unit());
-		return new G().fromPointAndDirection(a, o);
+		let n = this.lines, r = new H(), i = new H(), a = new V();
+		if (e === "A" ? (a = this.A.clone(), r = n.AB.clone().d, i = n.AC.clone().d) : e === "B" ? (a = this.B.clone(), r = n.AB.clone().d.opposite(), i = n.BC.clone().d) : e === "C" && (a = this.C.clone(), r = n.BC.clone().d.opposite(), i = n.AC.clone().d.opposite()), r === void 0 || i === void 0) throw new o(`The point ${e} does not exist`);
+		let s = t ? r.unit().add(i.unit()) : r.unit().subtract(i.unit());
+		return new q().fromPointAndDirection(a, s);
 	}
 	#c(e, t, n) {
 		let r = (t ** 2 + n ** 2 - e ** 2) / (2 * t * n);
-		return this.#a ? Math.acos(r) : d.numberCorrection(Math.acos(r) * 180 / Math.PI);
+		return this.#a ? Math.acos(r) : p.numberCorrection(Math.acos(r) * 180 / Math.PI);
 	}
 	#l = (e) => {
 		switch (e.toUpperCase()) {
@@ -5031,8 +5015,8 @@ var G = class e {
 		}
 		return this.#e;
 	};
-	#u = (e, t) => new L(this.#l(e), this.#l(t));
-}, q = class e {
+	#u = (e, t) => new H(this.#l(e), this.#l(t));
+}, Y = class e {
 	#e = null;
 	#t = null;
 	#n = 1;
@@ -5041,7 +5025,7 @@ var G = class e {
 		e.length > 0 && this.parse(...e);
 	}
 	parse(...t) {
-		return typeof t[0] == "string" ? this.fromString(t[0]) : t[0] instanceof k ? this.fromEquation(t[0]) : t[0] instanceof e ? this.copy(t[0]) : t.length === 2 && t[0] instanceof I && t[1] instanceof I ? this.fromCenterPoint(t[0], t[1]) : t.length >= 2 && t[0] instanceof I && (t[1] instanceof p || typeof t[1] == "number") ? this.fromCenterRadius(t[0], t[1], typeof t[2] == "boolean" && t[2]) : this;
+		return typeof t[0] == "string" ? this.fromString(t[0]) : t[0] instanceof N ? this.fromEquation(t[0]) : t[0] instanceof e ? this.copy(t[0]) : t.length === 2 && t[0] instanceof V && t[1] instanceof V ? this.fromCenterPoint(t[0], t[1]) : t.length >= 2 && t[0] instanceof V && (t[1] instanceof m || typeof t[1] == "number") ? this.fromCenterRadius(t[0], t[1], typeof t[2] == "boolean" && t[2]) : this;
 	}
 	clone() {
 		return new e().fromCenterRadius(this.center.clone(), this.squareRadius.clone(), !0);
@@ -5066,36 +5050,36 @@ var G = class e {
 		return this.#n = 1, this;
 	}
 	get center() {
-		return this.#e ?? new I();
+		return this.#e ?? new V();
 	}
 	get equation() {
-		return this.#t?.clone() ?? new k("0=0");
+		return this.#t?.clone() ?? new N("0=0");
 	}
 	fromCenterPoint(e, t) {
-		return this.#e = e.clone(), this.#r = new L(this.#e, t).normSquare, this.#i(), this;
+		return this.#e = e.clone(), this.#r = new H(this.#e, t).normSquare, this.#i(), this;
 	}
 	fromCenterRadius(e, t, n) {
-		return this.#e = e.clone(), n ? this.#r = new p(t) : this.#r = new p(t).pow(2), this.#i(), this;
+		return this.#e = e.clone(), this.#r = n ? new m(t) : new m(t).pow(2), this.#i(), this;
 	}
 	fromEquation(e) {
 		if (e.moveLeft(), e.degree("x").value === 2 && e.degree("y").value === 2) {
 			let t = e.left.monomByDegree(2, "x"), n = e.left.monomByDegree(2, "y"), r, i, a;
-			if (t.coefficient.isEqual(n.coefficient)) return e.divide(t.coefficient), r = e.left.monomByDegree(1, "x"), i = e.left.monomByDegree(1, "y"), a = e.left.monomByDegree(0), this.#e = new I(r.coefficient.clone().divide(2).opposite(), i.coefficient.clone().divide(2).opposite()), this.#r = a.coefficient.clone().opposite().add(this.#e.x.clone().pow(2)).add(this.#e.y.clone().pow(2)), this.#i(), this;
+			if (t.coefficient.isEqual(n.coefficient)) return e.divide(t.coefficient), r = e.left.monomByDegree(1, "x"), i = e.left.monomByDegree(1, "y"), a = e.left.monomByDegree(0), this.#e = new V(r.coefficient.clone().divide(2).opposite(), i.coefficient.clone().divide(2).opposite()), this.#r = a.coefficient.clone().opposite().add(this.#e.x.clone().pow(2)).add(this.#e.y.clone().pow(2)), this.#i(), this;
 			this.#a();
 		}
 		return this;
 	}
 	fromPoints(e, t, n) {
-		let r = new K(e, t, n);
+		let r = new J(e, t, n);
 		if (!r.isValid || !r.remarquables) return this.#a(), this;
 		let i = r.getMediators().c.clone(), a = r.getMediators().b.clone();
 		return this.fromCenterPoint(i.intersection(a).point, e);
 	}
 	fromString(e) {
-		return this.fromEquation(new k(e));
+		return this.fromEquation(new N(e));
 	}
 	getPointsOnCircle() {
-		let e = d.pythagoreanTripletsWithTarget(this.squareRadius.value, !0), t = [];
+		let e = p.pythagoreanTripletsWithTarget(this.squareRadius.value, !0), t = [];
 		return e.forEach((e) => {
 			for (let n of [
 				[1, 1],
@@ -5104,7 +5088,7 @@ var G = class e {
 				[1, -1]
 			]) {
 				let r = this.center.x.clone().add(n[0] * e[0]), i = this.center.y.clone().add(n[1] * e[1]);
-				t.every((e) => !e.isEqualXY(r, i)) && t.push(new I(r, i));
+				t.every((e) => !e.isEqualXY(r, i)) && t.push(new V(r, i));
 			}
 		}), t;
 	}
@@ -5121,10 +5105,10 @@ var G = class e {
 		if (s.length === 0) return [];
 		if (s.length === 1) {
 			let e = r.add(n.clone().multiplyByScalar(s[0].fraction));
-			return [new I(e.x, e.y)];
+			return [new V(e.x, e.y)];
 		}
 		let c = s[0].exact ? r.clone().add(n.clone().multiplyByScalar(s[0].fraction)) : r.clone().add(n.clone().multiplyByScalar(s[0].value)), l = s[1].exact ? r.clone().add(n.clone().multiplyByScalar(s[1].fraction)) : r.clone().add(n.clone().multiplyByScalar(s[1].value));
-		return [new I(c.x, c.y), new I(l.x, l.y)].sort((e, t) => n.x.isZero() ? n.y.isPositive() ? e.y.value - t.y.value : t.y.value - e.y.value : n.x.isPositive() ? e.x.value - t.x.value : t.x.value - e.x.value);
+		return [new V(c.x, c.y), new V(l.x, l.y)].sort((e, t) => n.x.isZero() ? n.y.isPositive() ? e.y.value - t.y.value : t.y.value - e.y.value : n.x.isPositive() ? e.x.value - t.x.value : t.x.value - e.x.value);
 	}
 	get radius() {
 		return new v().from(2, this.#r ?? 0);
@@ -5135,57 +5119,57 @@ var G = class e {
 		return t - n > 1e-10 ? 0 : Math.abs(t - n) < 1e-10 ? 1 : 2;
 	}
 	setRadius(e, t) {
-		return t ? this.#r = new p(e) : this.#r = new p(e).pow(2), this.#i(), this;
+		return this.#r = t ? new m(e) : new m(e).pow(2), this.#i(), this;
 	}
 	get squareRadius() {
-		return this.#r?.clone() ?? new p(-1);
+		return this.#r?.clone() ?? new m(-1);
 	}
-	tangents = (e) => e instanceof p ? this.#c(e) : this.isPointOnCircle(e) ? this.#o(e) : this.#e !== null && this.#e.distanceTo(e).value > this.radius.value ? this.#s(e) : [];
+	tangents = (e) => e instanceof m ? this.#c(e) : this.isPointOnCircle(e) ? this.#o(e) : this.#e !== null && this.#e.distanceTo(e).value > this.radius.value ? this.#s(e) : [];
 	#i() {
-		this.#t = new k(new O(`(x-(${this.center.x.display}))^2+(y-(${this.center.y.display}))^2`), new O(this.squareRadius.display)).moveLeft();
+		this.#t = new N(new M(`(x-(${this.center.x.display}))^2+(y-(${this.center.y.display}))^2`), new M(this.squareRadius.display)).moveLeft();
 	}
 	#a() {
 		this.#e = null, this.#r = null, this.#t = null;
 	}
 	#o = (e) => {
-		let t = new L(this.center, e);
-		return [new G().fromPointAndNormal(e, t)];
+		let t = new H(this.center, e);
+		return [new q().fromPointAndNormal(e, t)];
 	};
 	#s = (e) => {
-		let t = this.center.x.clone().subtract(e.x), n = this.center.y.clone().subtract(e.y), r = new O("x"), i = new O("x^2+1");
-		return r.multiply(t).subtract(n).pow(2), i.multiply(this.squareRadius), new k(r, i).solve().map((t) => {
-			let n, r = new k("y", "x");
-			return t.exact ? (n = e.x.clone().opposite().multiply(t.fraction).add(e.y), r.right.multiply(t.fraction).add(n)) : (n = e.x.clone().opposite().multiply(t.value).add(e.y), r.right.multiply(t.value).add(n)), new G(r);
+		let t = this.center.x.clone().subtract(e.x), n = this.center.y.clone().subtract(e.y), r = new M("x"), i = new M("x^2+1");
+		return r.multiply(t).subtract(n).pow(2), i.multiply(this.squareRadius), new N(r, i).solve().map((t) => {
+			let n, r = new N("y", "x");
+			return t.exact ? (n = e.x.clone().opposite().multiply(t.fraction).add(e.y), r.right.multiply(t.fraction).add(n)) : (n = e.x.clone().opposite().multiply(t.value).add(e.y), r.right.multiply(t.value).add(n)), new q(r);
 		});
 	};
 	#c = (e) => {
 		let t = e.numerator, n = -e.denominator, r = this.center.x.clone(), i = this.center.y.clone(), a = this.squareRadius.clone().multiply(e.numerator ** 2 + e.denominator ** 2), o = r.clone().multiply(t).opposite().subtract(i.clone().multiply(n)).add(a.clone().sqrt()), s = r.clone().multiply(t).opposite().subtract(i.clone().multiply(n)).subtract(a.clone().sqrt());
-		return [new G(t, n, o), new G(t, n, s)];
+		return [new q(t, n, o), new q(t, n, s)];
 	};
-}, J = class e {
-	static PARALLEL = z.Parallel;
-	static PERPENDICULAR = z.Perpendicular;
-	#e = new I();
-	#t = new L();
+}, X = class e {
+	static PARALLEL = Ce.Parallel;
+	static PERPENDICULAR = Ce.Perpendicular;
+	#e = new V();
+	#t = new H();
 	constructor(e, t) {
-		return this.#e = e.clone(), this.#t = t instanceof I ? new L(e, t) : t.clone(), this;
+		return this.#e = e.clone(), this.#t = t instanceof V ? new H(e, t) : t.clone(), this;
 	}
 	clone = () => (this.#t = this.#t.clone(), this.#e = this.#e.clone(), this);
 	get tex() {
 		return {
-			parametric: `${L.asTex("x", "y", "z")} = ${L.asTex(this.#e.x.tex, this.#e.y.tex, this.#e.z.tex)} + k\\cdot ${L.asTex(this.#t.x.tex, this.#t.y.tex, this.#t.z.tex)}`,
+			parametric: `${H.asTex("x", "y", "z")} = ${H.asTex(this.#e.x.tex, this.#e.y.tex, this.#e.z.tex)} + k\\cdot ${H.asTex(this.#t.x.tex, this.#t.y.tex, this.#t.z.tex)}`,
 			system: `\\left\\{\\begin{aligned}
-    x &= ${new O(this.#e.x).add(new E(this.#t.x).multiply(new E("k"))).reorder("k", !0).tex}\\\\ 
-    y &= ${new O(this.#e.y).add(new E(this.#t.y).multiply(new E("k"))).reorder("k", !0).tex}\\\\
-    z &= ${new O(this.#e.z).add(new E(this.#t.z).multiply(new E("k"))).reorder("k", !0).tex}
+    x &= ${new M(this.#e.x).add(new A(this.#t.x).multiply(new A("k"))).reorder("k", !0).tex}\\\\ 
+    y &= ${new M(this.#e.y).add(new A(this.#t.y).multiply(new A("k"))).reorder("k", !0).tex}\\\\
+    z &= ${new M(this.#e.z).add(new A(this.#t.z).multiply(new A("k"))).reorder("k", !0).tex}
 \\end{aligned}\\right.`,
-			cartesian: `\\frac{ ${new O("x", 1, this.#e.x.clone().opposite()).tex} }{ ${this.direction.x.tex} } = \\frac{ ${new O("y", 1, this.#e.y.clone().opposite()).tex} }{ ${this.direction.y.tex} } = \\frac{ ${new O("z", 1, this.#e.z.clone().opposite()).tex} }{ ${this.direction.z.tex} }`
+			cartesian: `\\frac{ ${new M("x", 1, this.#e.x.clone().opposite()).tex} }{ ${this.direction.x.tex} } = \\frac{ ${new M("y", 1, this.#e.y.clone().opposite()).tex} }{ ${this.direction.y.tex} } = \\frac{ ${new M("z", 1, this.#e.z.clone().opposite()).tex} }{ ${this.direction.z.tex} }`
 		};
 	}
 	get display() {
 		let e = this.#e.x.display, t = this.#e.y.display, n = this.#e.z.display, r = this.direction.simplify(), i = r.x.display, a = r.y.display, o = r.z.display;
 		return {
-			parametric: `${L.asDisplay("x", "y", "z")} = ${L.asDisplay(this.#e.x.display, this.#e.y.display, this.#e.z.display)} + k\\cdot ${L.asDisplay(this.#t.x.display, this.#t.y.display, this.#t.z.display)}`,
+			parametric: `${H.asDisplay("x", "y", "z")} = ${H.asDisplay(this.#e.x.display, this.#e.y.display, this.#e.z.display)} + k\\cdot ${H.asDisplay(this.#t.x.display, this.#t.y.display, this.#t.z.display)}`,
 			system: "",
 			cartesian: `(x-${e})/${i} = (y-${t})/${a} = (z-${n})/${o}`
 		};
@@ -5206,7 +5190,7 @@ var G = class e {
 		return this.#t.clone();
 	}
 	distanceTo(e) {
-		let t = new L(this.#e, e), n = this.direction, r = this.direction.normSquare, i = t.cross(n).normSquare.clone().divide(r), a = i.clone().sqrt();
+		let t = new H(this.#e, e), n = this.direction, r = this.direction.normSquare, i = t.cross(n).normSquare.clone().divide(r), a = i.clone().sqrt();
 		return {
 			value: Math.sqrt(i.value),
 			fraction: i.clone().sqrt(),
@@ -5218,34 +5202,34 @@ var G = class e {
 		return r.hasIntersection ? r.point.x.value >= Math.min(t.x.value, n.x.value) && r.point.x.value <= Math.max(t.x.value, n.x.value) && r.point.y.value >= Math.min(t.y.value, n.y.value) && r.point.y.value <= Math.max(t.y.value, n.y.value) && r.point.z.value >= Math.min(t.z.value, n.z.value) && r.point.z.value <= Math.max(t.z.value, n.z.value) : !1;
 	}
 	intersection = (e) => {
-		throw Error("Method not implemented.");
+		throw new a("Method not implemented.");
 	};
 	isOnLine = (e) => !1;
 	isParallelTo = (e) => {
-		throw Error("Method not implemented.");
+		throw new a("Method not implemented.");
 	};
 	isPerpendicularTo = (e) => {
-		throw Error("Method not implemented.");
+		throw new a("Method not implemented.");
 	};
 	isSameAs = (e) => {
-		throw Error("Method not implemented.");
+		throw new a("Method not implemented.");
 	};
 	isVertical = () => {
-		throw Error("Method not implemented.");
+		throw new a("Method not implemented.");
 	};
 	get point() {
 		return this.#e.clone();
 	}
 	randomPoint = (e = 5) => {
-		let t = this.#e.clone(), n = new p(H(e, !1));
-		return new I(t.x.clone().add(this.#t.x.clone().multiply(n)), t.y.clone().add(this.#t.y.clone().multiply(n)), t.z.clone().add(this.#t.z.clone().multiply(n)));
+		let t = this.#e.clone(), n = new m(G(e, !1));
+		return new V(t.x.clone().add(this.#t.x.clone().multiply(n)), t.y.clone().add(this.#t.y.clone().multiply(n)), t.z.clone().add(this.#t.z.clone().multiply(n)));
 	};
 	simplify = () => {
-		throw Error("Method not implemented.");
+		throw new a("Method not implemented.");
 	};
-}, ge = class e {
-	#e = new L(0, 0, 1);
-	#t = new I(0, 0, 0);
+}, ke = class e {
+	#e = new H(0, 0, 1);
+	#t = new V(0, 0, 0);
 	constructor(e) {
 		return e && this.parse(e), this;
 	}
@@ -5262,37 +5246,37 @@ var G = class e {
 		}
 		if (e.equation) {
 			let t = e.equation.moveLeft().reduce().left, n = t.monomByLetter("x").coefficient, r = t.monomByLetter("y").coefficient, i = t.monomByLetter("z").coefficient, a = t.monomByDegree(0).coefficient;
-			this.normal = new L(n, r, i), n.isNotZero() ? this.point = new I(a.clone().divide(n).opposite(), 0, 0) : r.isNotZero() ? this.point = new I(0, a.clone().divide(r).opposite(), 0) : this.point = new I(0, 0, a.clone().divide(i).opposite());
+			this.normal = new H(n, r, i), this.point = n.isNotZero() ? new V(a.clone().divide(n).opposite(), 0, 0) : r.isNotZero() ? new V(0, a.clone().divide(r).opposite(), 0) : new V(0, 0, a.clone().divide(i).opposite());
 			return;
 		}
-		if (e.points?.length === 3 && e.points.every((e) => e instanceof L)) {
-			let t = e.points[0], n = e.points[1], r = e.points[2], i = new L(t, n), a = new L(t, r);
+		if (e.points?.length === 3 && e.points.every((e) => e instanceof H)) {
+			let t = e.points[0], n = e.points[1], r = e.points[2], i = new H(t, n), a = new H(t, r);
 			this.normal = i.cross(a), this.point = t;
 			return;
 		}
 		if (e.coefficients?.length === 4) {
 			let [t, n, r, i] = e.coefficients;
-			this.normal = new L(t, n, r), this.point = new I(0, 0, -i);
+			this.normal = new H(t, n, r), this.point = new V(0, 0, -i);
 			return;
 		}
 	}
 	get tex() {
-		return new k(new O("xyz", this.a, this.b, this.c, this.d), new O(0)).reduce().tex;
+		return new N(new M("xyz", this.a, this.b, this.c, this.d), new M(0)).reduce().tex;
 	}
 	get display() {
-		return new k(new O("xyz", this.a, this.b, this.c, this.d), new O(0)).reduce().display;
+		return new N(new M("xyz", this.a, this.b, this.c, this.d), new M(0)).reduce().display;
 	}
 	get a() {
 		return this.#e.x;
 	}
-	angle(t, n, r) {
-		if (t instanceof e) return this.normal.angle(t.normal, n, r);
-		let i;
-		if (t instanceof L) {
-			if (t.dimension !== 3) throw Error("Vector is not 3D");
-			i = t;
-		} else i = t.direction;
-		return (r ? Math.PI / 2 : 90) - this.normal.angle(i, !0, r);
+	angle(t, r, i) {
+		if (t instanceof e) return this.normal.angle(t.normal, r, i);
+		let a;
+		if (t instanceof H) {
+			if (t.dimension !== 3) throw new n("Vector is not 3D");
+			a = t;
+		} else a = t.direction;
+		return (i ? Math.PI / 2 : 90) - this.normal.angle(a, !0, i);
 	}
 	get b() {
 		return this.#e.y;
@@ -5308,10 +5292,10 @@ var G = class e {
 	}
 	intersectWithLine(e) {
 		let { point: t, direction: n } = e, r = this.normal.dot(t).add(this.d).divide(this.normal.dot(n).opposite());
-		return new I(new L(t).add(n.clone().multiplyByScalar(r)));
+		return new V(new H(t).add(n.clone().multiplyByScalar(r)));
 	}
 	intersectWithPlane(e) {
-		throw this.normal.cross(e.normal), new I(0, 0, 0), Error("Intersection with plane  not yet implemented !");
+		throw this.normal.cross(e.normal), new V(0, 0, 0), new a("Intersection with plane  not yet implemented !");
 	}
 	isPointOnPlane(e) {
 		return this.normal.dot(e).add(this.d).isZero();
@@ -5320,44 +5304,44 @@ var G = class e {
 		return this.#e;
 	}
 	set normal(e) {
-		this.#e = new L(e);
+		this.#e = new H(e);
 	}
 	get point() {
 		return this.#t;
 	}
 	set point(e) {
-		this.#t = new I(e);
+		this.#t = new V(e);
 	}
-}, _e = /* @__PURE__ */ function(e) {
+}, Ae = /* @__PURE__ */ function(e) {
 	return e[e.INTERIOR = 0] = "INTERIOR", e[e.EXTERIOR = 1] = "EXTERIOR", e[e.SECANT = 2] = "SECANT", e[e.TANGENT_INSIDE = 3] = "TANGENT_INSIDE", e[e.TANGENT_OUTSIDE = 4] = "TANGENT_OUTSIDE", e[e.SUPERPOSED = 5] = "SUPERPOSED", e[e.CONCENTRIC = 6] = "CONCENTRIC", e;
-}({}), ve = class {
+}({}), je = class {
 	#e = void 0;
 	#t = void 0;
 	#n = void 0;
 	#r = 1;
 	constructor(e, t) {
-		return e && t && (this.#e = e, this.#t = new p(t).clone().pow(2), this.#a()), this;
+		return e && t && (this.#e = e, this.#t = new m(t).clone().pow(2), this.#a()), this;
 	}
 	fromEquation(e) {
-		let t = new k(e).moveLeft().reduce(), n = [
+		let t = new N(e).moveLeft().reduce(), n = [
 			"x",
 			"y",
 			"z"
 		];
 		if (n.some((e) => t.degree(e).value !== 2)) return this.makeUndefined();
 		let r = t.left.monomByDegree(2, "x").coefficient;
-		return n.some((e) => t.left.monomByDegree(2, e).coefficient.isNotEqual(r)) ? this.makeUndefined() : (this.#e = new I(t.left.monomByDegree(1, "x").coefficient.clone().opposite().divide(2), t.left.monomByDegree(1, "y").coefficient.clone().opposite().divide(2), t.left.monomByDegree(1, "z").coefficient.clone().opposite().divide(2)), this.#t = t.left.monomByDegree(0).coefficient.clone().opposite().add(this.#e.x.clone().pow(2)).add(this.#e.y.clone().pow(2)).add(this.#e.z.clone().pow(2)), this.#a(), this);
+		return n.some((e) => t.left.monomByDegree(2, e).coefficient.isNotEqual(r)) ? this.makeUndefined() : (this.#e = new V(t.left.monomByDegree(1, "x").coefficient.clone().opposite().divide(2), t.left.monomByDegree(1, "y").coefficient.clone().opposite().divide(2), t.left.monomByDegree(1, "z").coefficient.clone().opposite().divide(2)), this.#t = t.left.monomByDegree(0).coefficient.clone().opposite().add(this.#e.x.clone().pow(2)).add(this.#e.y.clone().pow(2)).add(this.#e.z.clone().pow(2)), this.#a(), this);
 	}
 	get center() {
-		if (this.#e === void 0) throw Error("Sphere3 is undefined");
+		if (this.#e === void 0) throw new s("Sphere3 is undefined");
 		return this.#e;
 	}
 	get squareRadius() {
-		if (this.#t === void 0) throw Error("Sphere3 is undefined");
+		if (this.#t === void 0) throw new s("Sphere3 is undefined");
 		return this.#t;
 	}
 	get radius() {
-		if (this.#t === void 0) throw Error("Sphere3 is undefined");
+		if (this.#t === void 0) throw new s("Sphere3 is undefined");
 		return this.#t.isSquare() ? {
 			tex: this.#t.clone().sqrt().tex,
 			display: this.#t.clone().sqrt().display,
@@ -5369,7 +5353,7 @@ var G = class e {
 		};
 	}
 	get equation() {
-		if (this.#n === void 0) throw Error("Sphere3 is undefined");
+		if (this.#n === void 0) throw new s("Sphere3 is undefined");
 		return this.#n;
 	}
 	makeUndefined() {
@@ -5388,7 +5372,7 @@ var G = class e {
 		return this.#i(!1);
 	}
 	#i = (e) => {
-		if (this.#n === void 0) throw Error("Sphere3 is undefined");
+		if (this.#n === void 0) throw new s("Sphere3 is undefined");
 		if (this.#r === 0) return e ? this.#n.tex : this.#n.display;
 		let t = [];
 		return [
@@ -5398,15 +5382,15 @@ var G = class e {
 		].forEach((n) => {
 			if (this.center[n].isZero()) t.push(`${n}^2`);
 			else {
-				let r = new O(n).subtract(this.center[n]);
+				let r = new M(n).subtract(this.center[n]);
 				t.push(e ? `\\(${r.tex}\\)^2` : `(${r.display})^2`);
 			}
 		}), t.join("+") + "=" + (e ? this.squareRadius.tex : this.squareRadius.display);
 	};
 	#a() {
-		this.#n = new k(new O("x").subtract(this.center.x).pow(2).add(new O("y").subtract(this.center.y).pow(2)).add(new O("z").subtract(this.center.z).pow(2)), new O(this.squareRadius)).reduce();
+		this.#n = new N(new M("x").subtract(this.center.x).pow(2).add(new M("y").subtract(this.center.y).pow(2)).add(new M("z").subtract(this.center.z).pow(2)), new M(this.squareRadius)).reduce();
 	}
-	static RELATIVE_POSITION = _e;
+	static RELATIVE_POSITION = Ae;
 	relativePosition = (e) => {
 		let t = this.center.distanceTo(e.center).value, n = this.radius.value, r = e.radius.value;
 		return t > n + r ? 1 : t === n + r ? 4 : t === 0 ? n === r ? 5 : 6 : t === Math.abs(n - r) ? 3 : t < Math.abs(n - r) ? 0 : 2;
@@ -5419,38 +5403,38 @@ var G = class e {
 };
 //#endregion
 //#region src/randomization/coefficient/rndFraction.ts
-function Y(e) {
+function Z(e) {
 	let t = Object.assign({
 		negative: !0,
 		max: 10,
 		reduced: !0,
 		zero: !0,
 		natural: !1
-	}, e), n = new p();
-	if (t.negative ? n.numerator = H(t.max, t.zero) : n.numerator = V(+!t.zero, t.max), t.natural) n.denominator = 1;
+	}, e), n = new m();
+	if (n.numerator = t.negative ? G(t.max, t.zero) : W(+!t.zero, t.max), t.natural) n.denominator = 1;
 	else {
 		let e = 0;
-		for (; n.isRelative() && e < 10;) n.denominator = V(1, t.max), e++;
+		for (; n.isRelative() && e < 10;) n.denominator = W(1, t.max), e++;
 	}
 	return t.reduced ? n.reduce() : n;
 }
 //#endregion
 //#region src/randomization/algebra/rndMonom.ts
-function ye(e) {
+function Me(e) {
 	let t = Object.assign({
 		letters: "x",
 		degree: 2,
 		fraction: !0,
 		zero: !1
-	}, e), n = new E();
-	if (n.coefficient = Y(Object.assign({}, {
+	}, e), n = new A();
+	if (n.coefficient = Z(Object.assign({}, {
 		zero: t.zero,
 		reduced: !0,
 		natural: t.fraction === !1
 	}, typeof t.fraction == "boolean" ? {} : t.fraction)), t.letters.length > 1) {
 		for (let e of t.letters.split("")) n.setLetter(e, 0);
 		for (let e = 0; e < t.degree; e++) {
-			let e = U(t.letters.split(""));
+			let e = K(t.letters.split(""));
 			n.setLetter(e, n.degree(e).clone().add(1));
 		}
 	} else n.setLetter(t.letters, t.degree);
@@ -5458,7 +5442,7 @@ function ye(e) {
 }
 //#endregion
 //#region src/randomization/algebra/rndPolynom.ts
-var X = {
+var Ne = {
 	letters: "x",
 	degree: 2,
 	fraction: !1,
@@ -5470,36 +5454,36 @@ var X = {
 	commonConstant: !1,
 	positive: !0
 };
-function Z(e) {
-	let t = Object.assign({}, X, e);
-	if (t.factorable) return be(t);
-	let n = new O().empty(), r, i = t.degree ?? 2;
-	for (let e = i; e >= 0; e--) r = ye({
+function Q(e) {
+	let t = Object.assign({}, Ne, e);
+	if (t.factorable) return Pe(t);
+	let n = new M().empty(), r, i = t.degree ?? 2;
+	for (let e = i; e >= 0; e--) r = Me({
 		letters: t.letters,
 		degree: e,
 		fraction: t.fraction,
 		zero: e !== i && t.allowNullMonom
 	}), t.unit && i === e && r.coefficient.one(), n.add(r);
 	if (t.positive && n.monomByDegree().coefficient.isNegative() && n.opposite(), t.numberOfMonoms && t.numberOfMonoms > 0 && t.numberOfMonoms < n.length) for (; n.length > t.numberOfMonoms;) {
-		let e = V(1, n.length - 1);
+		let e = W(1, n.length - 1);
 		n.monoms.splice(e, 1);
 	}
 	return n.reduce();
 }
-function be(e) {
-	let t = Object.assign(X, e), n = { ...t };
+function Pe(e) {
+	let t = Object.assign(Ne, e), n = { ...t };
 	n.degree = 1, n.factorable = !1;
 	let r = [], i = t.degree ?? 2;
-	for (; r.length < i;) r.push(Z(n));
+	for (; r.length < i;) r.push(Q(n));
 	if (e?.commonConstant !== !1) {
-		let t = H(10, !1);
-		e?.commonConstant === !0 && (t === 1 || t === -1) && (t *= V(2, 5)), t !== 1 && t !== -1 && r.unshift(new O(t));
+		let t = G(10, !1);
+		e?.commonConstant === !0 && (t === 1 || t === -1) && (t *= W(2, 5)), t !== 1 && t !== -1 && r.unshift(new M(t));
 	}
-	return O.xMultiply(...r);
+	return M.xMultiply(...r);
 }
 //#endregion
 //#region src/randomization/algebra/rndEquation.ts
-function xe(e) {
+function Fe(e) {
 	let t = Object.assign({
 		letters: "x",
 		degree: 1,
@@ -5516,9 +5500,9 @@ function xe(e) {
 			nothing: !1,
 			everything: !1
 		}
-	}, e), n = new O().one();
+	}, e), n = new M().one();
 	for (let e = 0; e < t.degree; e++) {
-		let e = Z({
+		let e = Q({
 			degree: 1,
 			unit: t.unit,
 			fraction: t.fraction,
@@ -5527,28 +5511,28 @@ function xe(e) {
 		});
 		n.multiply(e);
 	}
-	return new k(n, 0);
+	return new N(n, 0);
 }
 //#endregion
 //#region src/randomization/geometry/rndPoint.ts
-function Q(e) {
+function $(e) {
 	let t = Object.assign({
 		axis: !0,
 		fraction: !1,
 		max: 10,
 		quadrant: null
-	}, e), n = t.axis === "x", r = t.axis === "y", i = t.fraction ? Y({
+	}, e), n = t.axis === "x", r = t.axis === "y", i = t.fraction ? Z({
 		max: t.max,
 		zero: n
-	}) : new p(H(t.max, n)), a = t.fraction ? Y({
+	}) : new m(G(t.max, n)), a = t.fraction ? Z({
 		max: t.max,
 		zero: r
-	}) : new p(H(t.max, r));
-	return Number(t.quadrant) === 1 && (i.abs(), a.abs()), Number(t.quadrant) === 2 && (i.isPositive() && i.opposite(), a.isNegative() && a.opposite()), Number(t.quadrant) === 3 && (i.isPositive() && i.opposite(), a.isPositive() && a.opposite()), Number(t.quadrant) === 4 && (i.isNegative() && i.opposite(), a.isPositive() && a.opposite()), new I(i, a);
+	}) : new m(G(t.max, r));
+	return Number(t.quadrant) === 1 && (i.abs(), a.abs()), Number(t.quadrant) === 2 && (i.isPositive() && i.opposite(), a.isNegative() && a.opposite()), Number(t.quadrant) === 3 && (i.isPositive() && i.opposite(), a.isPositive() && a.opposite()), Number(t.quadrant) === 4 && (i.isNegative() && i.opposite(), a.isPositive() && a.opposite()), new V(i, a);
 }
 //#endregion
 //#region src/randomization/geometry/rndCircle.ts
-function Se(e) {
+function Ie(e) {
 	let t = Object.assign({
 		center: {
 			x: {
@@ -5561,82 +5545,92 @@ function Se(e) {
 			}
 		},
 		pointsOnCircle: 8
-	}, e), n = Q(t.center), r, i;
-	return t.pointsOnCircle === 8 ? (r = V(1, 3), i = r ** 2 + (r + 1) ** 2) : i = V(1, 20), new q(n, i, !0);
+	}, e), n = $(t.center), r, i;
+	return t.pointsOnCircle === 8 ? (r = W(1, 3), i = r ** 2 + (r + 1) ** 2) : i = W(1, 20), new Y(n, i, !0);
 }
 //#endregion
 //#region src/randomization/geometry/rndLine.ts
-function Ce(e) {
+function Le(e) {
 	let t = Object.assign({ A: {
-		x: H(10),
-		y: H(10)
-	} }, e), n = new L(0, 0);
-	for (; n.isNull;) n.x = H(10, t.allow?.vertical ?? !0), n.y = H(10, t.allow?.horizontal ?? !0);
-	return t.slope === 1 ? n.x.sign() !== n.y.sign() && n.y.opposite() : t.slope === -1 && n.x.sign() !== n.y.sign() && n.y.opposite(), new G().fromPointAndDirection(new L(t.A.x, t.A.y), n);
+		x: G(10),
+		y: G(10)
+	} }, e), n = new H(0, 0);
+	for (; n.isNull;) n.x = G(10, t.allow?.vertical ?? !0), n.y = G(10, t.allow?.horizontal ?? !0);
+	return t.slope === 1 ? n.x.sign() !== n.y.sign() && n.y.opposite() : t.slope === -1 && n.x.sign() !== n.y.sign() && n.y.opposite(), new q().fromPointAndDirection(new H(t.A.x, t.A.y), n);
 }
 //#endregion
 //#region src/randomization/geometry/rndLine3.ts
-function we(e) {
+function Re(e) {
 	let t = Object.assign({
 		A: {
-			x: H(10),
-			y: H(10),
-			z: H(10)
+			x: G(10),
+			y: G(10),
+			z: G(10)
 		},
 		direction: {
-			x: H(10),
-			y: H(10),
-			z: H(10)
+			x: G(10),
+			y: G(10),
+			z: G(10)
 		}
 	}, e);
-	return new J(new I(t.A.x, t.A.y, t.A.z), new L(t.direction.x, t.direction.y, t.direction.z));
+	return new X(new V(t.A.x, t.A.y, t.A.z), new H(t.direction.x, t.direction.y, t.direction.z));
 }
 //#endregion
 //#region src/randomization/random.ts
-var $ = {
-	equation: (e) => xe(e),
-	polynom: (e) => Z(e),
-	monom: (e) => ye(e),
-	fraction: (e) => Y(e),
-	number: (e, t, n) => V(e, t, n),
-	numberSym: (e, t) => H(e, t),
-	prime: (e) => me(e),
-	triplet: (e, t) => pe(e, t),
-	bool: (e) => B(e),
-	array: (e, t) => he(e, t),
-	item: (e) => U(e),
-	shuffle: (e) => W(e),
-	line: (e) => Ce(e),
-	line3: (e) => we(e),
-	vector: (e) => new L(Q(e)),
-	point: (e) => Q(e),
-	circle: (e) => Se(e)
-}, Te = {
-	Numeric: d,
-	Fraction: p,
+var ze = {
+	equation: (e) => Fe(e),
+	polynom: (e) => Q(e),
+	monom: (e) => Me(e),
+	fraction: (e) => Z(e),
+	number: (e, t, n) => W(e, t, n),
+	numberSym: (e, t) => G(e, t),
+	prime: (e) => Ee(e),
+	triplet: (e, t) => Te(e, t),
+	bool: (e) => we(e),
+	array: (e, t) => De(e, t),
+	item: (e) => K(e),
+	shuffle: (e) => Oe(e),
+	line: (e) => Le(e),
+	line3: (e) => Re(e),
+	vector: (e) => new H($(e)),
+	point: (e) => $(e),
+	circle: (e) => Ie(e)
+}, Be = {
+	Numeric: p,
+	Fraction: m,
 	Root: v,
-	Monom: E,
-	Polynom: O,
-	Equation: k,
-	Matrix: le,
-	LinearSystem: se,
-	Factor: A,
-	PolyFactor: M,
-	LogicalSet: ce,
-	Random: $,
+	Monom: A,
+	Polynom: M,
+	Equation: N,
+	Matrix: ve,
+	LinearSystem: I,
+	Factor: P,
+	PolyFactor: R,
+	LogicalSet: L,
+	Random: ze,
 	Geometry: {
-		Vector: L,
-		Point: I,
-		Line: G,
-		Triangle: K,
-		Circle: q,
-		Line3: J,
-		Plane3: ge,
-		Sphere3: ve
+		Vector: H,
+		Point: V,
+		Line: q,
+		Triangle: J,
+		Circle: Y,
+		Line3: X,
+		Plane3: ke,
+		Sphere3: je
+	},
+	Errors: {
+		PiMathError: e,
+		ParseError: t,
+		DimensionError: n,
+		MathError: r,
+		InvalidArgumentError: i,
+		NotImplementedError: a,
+		IndexError: o,
+		StateError: s
 	},
-	NumExp: T
+	NumExp: k
 };
 //#endregion
-export { q as Circle, k as Equation, b as EquationSolver, j as FACTOR_DISPLAY, f as FRAC_TYPE, A as Factor, p as Fraction, G as Line, J as Line3, se as LinearSystem, ce as LogicalSet, le as Matrix, E as Monom, T as NumExp, d as Numeric, ge as Plane3, I as Point, M as PolyFactor, O as Polynom, $ as Random, v as Root, _e as SPHERE3_RELATIVE_POSITION, y as Solution, ve as Sphere3, ee as TableOfSigns, K as Triangle, L as Vector, de as areVectorsColinears, ue as areVectorsEquals, Te as default, fe as determinantFromVectors, P as dotProduct };
+export { Y as Circle, n as DimensionError, N as Equation, b as EquationSolver, F as FACTOR_DISPLAY, oe as FRAC_TYPE, P as Factor, m as Fraction, o as IndexError, i as InvalidArgumentError, q as Line, X as Line3, I as LinearSystem, L as LogicalSet, r as MathError, ve as Matrix, A as Monom, a as NotImplementedError, k as NumExp, p as Numeric, t as ParseError, e as PiMathError, ke as Plane3, V as Point, R as PolyFactor, M as Polynom, ze as Random, v as Root, Ae as SPHERE3_RELATIVE_POSITION, y as Solution, je as Sphere3, s as StateError, ce as TableOfSigns, J as Triangle, H as Vector, be as areVectorsColinears, ye as areVectorsEquals, Be as default, Se as determinantFromVectors, xe as dotProduct };
 
 //# sourceMappingURL=pimath.js.map