@pie-element/math-inline 13.0.8-next.20261103123052 → 13.0.8-next.20261104122226

package/dist/browser/author/index.js

@@ -37862,7 +37862,7 @@ var LL = class extends z.Component {
 	}
 }, eR = Object.freeze({
 	name: "@pie-element/math-inline",
-	version: "13.0.8-next.20261103123052"
+	version: "13.0.8-next.20261104122226"
 });
 //#endregion
 export { $L as default, eR as piePackage };

package/dist/browser/controller/index.js

@@ -91,7 +91,7 @@ var m = {
 	Object.defineProperty(e, "__esModule", { value: !0 }), e.logger = void 0, e.logger = (e) => () => {};
 })), v = /* @__PURE__ */ r(((e) => {
 	Object.defineProperty(e, "__esModule", { value: !0 });
-	var t = _().logger("mv:lexer");
+	var t = (0, _().logger)("mv:lexer");
 	e.default = class {
 		constructor(e, t = "\\s") {
 			this.input = "", this.location = 0, this.whitespace = RegExp(`^(${t})+`), this.rules = e.map((e) => {
@@ -180,7 +180,7 @@ var m = {
 		intersect: !0
 	};
 	function n(r) {
-		var i = t.get_tree(r);
+		var i = (0, t.get_tree)(r);
 		if (!Array.isArray(i)) return i;
 		var a = i[0], o = i.slice(1);
 		if (o = o.map(function(e, t) {
@@ -192,11 +192,11 @@ var m = {
 		return [a].concat(o);
 	}
 	e.flatten = n, e.unflattenRight = function(n) {
-		var r = t.get_tree(n);
+		var r = (0, t.get_tree)(n);
 		if (!Array.isArray(r)) return r;
 		var i = r[0], a = r.slice(1);
 		if (a = a.map(function(t, n) {
-			return e.unflattenRight(t);
+			return (0, e.unflattenRight)(t);
 		}), a.length > 2 && e.is_associative[i]) {
 			for (var o = [
 				i,
@@ -211,11 +211,11 @@ var m = {
 		}
 		return [i].concat(a);
 	}, e.unflattenLeft = function(n) {
-		var r = t.get_tree(n);
+		var r = (0, t.get_tree)(n);
 		if (!Array.isArray(r)) return r;
 		var i = r[0], a = r.slice(1);
 		if (a = a.map(function(t, n) {
-			return e.unflattenLeft(t);
+			return (0, e.unflattenLeft)(t);
 		}), a.length > 2 && e.is_associative[i]) {
 			for (var o = [
 				i,
@@ -233,7 +233,7 @@ var m = {
 		if (!Array.isArray(t)) return [];
 		var n = t[0], r = t.slice(1);
 		return e.is_associative[n] ? r.reduce(function(t, r) {
-			return Array.isArray(r) && r[0] === n ? t.concat(e.allChildren(r)) : t.concat([r]);
+			return Array.isArray(r) && r[0] === n ? t.concat((0, e.allChildren)(r)) : t.concat([r]);
 		}, []) : r;
 	};
 })), x = /* @__PURE__ */ r(((e, t, n) => {
@@ -242,7 +242,7 @@ var m = {
 	};
 	Object.defineProperty(e, "__esModule", { value: !0 }), e.LatexToAst = e.DEFAULT_OPTS = e.latex_rules = e.whitespace_rule = void 0;
 	var i = g(), a = r(v()), o = b();
-	_().logger("mv:latex-to-ast"), e.whitespace_rule = "\\s|\\\\,|\\\\!|\\\\ |\\\\>|\\\\;|\\\\:|\\\\quad\\b|\\\\qquad\\b";
+	(0, _().logger)("mv:latex-to-ast"), e.whitespace_rule = "\\s|\\\\,|\\\\!|\\\\ |\\\\>|\\\\;|\\\\:|\\\\quad\\b|\\\\qquad\\b";
 	var s = "(E[+\\-]?[0-9]+\\s*($|(?=\\,|&|\\||\\\\\\||\\)|\\}|\\\\}|\\]|\\\\\\\\|\\\\end)))?";
 	e.latex_rules = [
 		["(mm|cm|km|ft|yd|mi|mmi|li|rd|angstrom|mil|mL|ml|L|m3|in3|ft3|pt|qt|gal|bbl){1}", "UNIT"],
@@ -546,7 +546,7 @@ var m = {
 			this.lexer.set_input(e), this.advance();
 			var n = this.statement_list(t);
 			if (this.token.token_type !== "EOF") throw new i.ParseError("Invalid location of '" + this.token.original_text + "'", this.lexer.location);
-			return o.flatten(n);
+			return (0, o.flatten)(n);
 		}
 		statement_list(e) {
 			for (var t = [this.statement(e)]; this.token.token_type === ",";) this.advance(), t.push(this.statement(e));
@@ -828,8 +828,8 @@ var m = {
 				} else a = t;
 				this.advance();
 			} else if (this.token.token_type === "INFINITY") a = Infinity, this.advance();
-			else if (this.token.token_type === "deg") a = ["*", 355 / 20340], this.advance();
-			else if (this.token.token_type === "grad") a = ["*", 355 / 22600], this.advance();
+			else if (this.token.token_type === "deg") a = ["*", Math.PI / 180], this.advance();
+			else if (this.token.token_type === "grad") a = ["*", Math.PI / 200], this.advance();
 			else if (this.token.token_type === "UNIT") a = ["unit", this.token.token_text], this.advance();
 			else if (this.token.token_type === "SQRT") {
 				this.advance();
@@ -37002,10 +37002,10 @@ var ke = /* @__PURE__ */ r(((e) => {
 })), __ = /* @__PURE__ */ r(((e) => {
 	Object.defineProperty(e, "__esModule", { value: !0 }), e.replacer = e.parse = e.mathjs = void 0;
 	var t = g_();
-	e.mathjs = t.create(t.all, { number: "Fraction" }), e.parse = e.mathjs.parse, e.replacer = e.mathjs.replacer;
+	e.mathjs = (0, t.create)(t.all, { number: "Fraction" }), e.parse = e.mathjs.parse, e.replacer = e.mathjs.replacer;
 })), v_ = /* @__PURE__ */ r(((e) => {
 	Object.defineProperty(e, "__esModule", { value: !0 }), e.AstToMathJs = void 0;
-	var t = __(), n = _().logger("mv:ast-to-math"), r = t.mathjs, i = {
+	var t = __(), n = (0, _().logger)("mv:ast-to-math"), r = t.mathjs, i = {
 		"+": function(e) {
 			return new r.OperatorNode("+", "add", e);
 		},
@@ -37174,7 +37174,7 @@ var ke = /* @__PURE__ */ r(((e) => {
 	};
 })), y_ = /* @__PURE__ */ r(((e) => {
 	Object.defineProperty(e, "__esModule", { value: !0 }), e.sort = e.sortRelationalNode = e.flattenNode = void 0;
-	var t = _(), n = __().mathjs, r = t.logger("mv:node-sort"), i = (e, t) => {
+	var t = _(), n = __().mathjs, r = (0, t.logger)("mv:node-sort"), i = (e, t) => {
 		if (r("[compareNodes]: a:", e.toString(), e.type), r("[compareNodes]: b:", t.toString(), t.type), e.isSymbolNode && t.isSymbolNode) return e.name.localeCompare(t.name);
 		if (e.isConstantNode && t.isConstantNode) return r("a.value", e.value), r("b.value", t.value), e.value - t.value;
 		if (e.isConstantNode && !t.isConstantNode) return -1;
@@ -37239,15 +37239,15 @@ var ke = /* @__PURE__ */ r(((e) => {
 				let e = n.some((e) => t.conditionals.includes(e)) && a.some((e) => t.conditionals.includes(e));
 				t.conditionals.includes("equal") ? t.params.sort(i) : e && t.params ? i(t.params[0], t.params[t.params.length - 1]) > -1 && t.params.reverse() : t.conditionals = t.conditionals.map((e) => (e === "smaller" ? (s = !0, e = "larger") : e === "smallerEq" && (s = !0, e = "largerEq"), e));
 			}
-			return t.params && s && (t.conditionals.reverse(), t.params.reverse()), o && o.type === "RelationalNode" && t.args && (t = e.sort(t)), t;
+			return t.params && s && (t.conditionals.reverse(), t.params.reverse()), o && o.type === "RelationalNode" && t.args && (t = (0, e.sort)(t)), t;
 		});
 	}, e.sort = (t) => {
 		let n = t;
-		return t.type === "RelationalNode" ? e.sortRelationalNode(t) : (t.isOperatorNode && t.fn === "smaller" && (t.op = ">", t.fn = "larger", t.args = t.args.reverse()), t.isOperatorNode && t.fn === "smallerEq" && (t.op = ">=", t.fn = "largerEq", t.args = t.args.reverse()), t.isFunctionNode && t.fn.name.match("=|NE|≃|≈|≈|≉|~|≃|≁|≅|≆") && (t.args = t.args.sort(i)), t.isOperatorNode && (t.fn == "larger" || t.fn == "largerEq" || t.fn == "equal" || t.fn == "unequal") && (t.args = t.args.map(e.sort), (t.fn === "equal" || t.fn === "unequal") && (t.args = t.args.sort(i))), t.isArrayNode ? (t.items = t.items.sort(i), t) : (n = e.flattenNode(t).transform(a), n));
+		return t.type === "RelationalNode" ? (0, e.sortRelationalNode)(t) : (t.isOperatorNode && t.fn === "smaller" && (t.op = ">", t.fn = "larger", t.args = t.args.reverse()), t.isOperatorNode && t.fn === "smallerEq" && (t.op = ">=", t.fn = "largerEq", t.args = t.args.reverse()), t.isFunctionNode && t.fn.name.match("=|NE|≃|≈|≈|≉|~|≃|≁|≅|≆") && (t.args = t.args.sort(i)), t.isOperatorNode && (t.fn == "larger" || t.fn == "largerEq" || t.fn == "equal" || t.fn == "unequal") && (t.args = t.args.map(e.sort), (t.fn === "equal" || t.fn === "unequal") && (t.args = t.args.sort(i))), t.isArrayNode ? (t.items = t.items.sort(i), t) : (n = (0, e.flattenNode)(t).transform(a), n));
 	};
 })), b_ = /* @__PURE__ */ r(((e) => {
-	Object.defineProperty(e, "__esModule", { value: !0 }), e.equationsHaveTheSameVariables = e.solveLinearEquation = e.solveQuadraticEquation = e.setXToOne = e.getCoefficients = e.getVariables = e.transformEqualityInExpression = e.areNumericallyEquivalent = e.hasSymbolicExponent = e.expressionsCanBeCompared = void 0;
-	var t = __(), n = C_(), { simplify: r } = t.mathjs, i = t.mathjs, a = [
+	Object.defineProperty(e, "__esModule", { value: !0 }), e.equationsHaveTheSameVariables = e.solveLinearEquation = e.solveQuadraticEquation = e.getCoefficients = e.getVariables = e.transformEqualityInExpression = e.areEquationsNumericallyEquivalent = e.areNumericallyEquivalent = e.getSamplePoints = e.hasSymbolicExponent = e.expressionsCanBeCompared = void 0;
+	var t = __(), n = g_(), r = C_(), { simplify: i } = t.mathjs, a = t.mathjs, o = (0, n.create)(n.all), s = [
 		{
 			l: "-((n1)*(n2))",
 			r: "(n1)*(n2)"
@@ -37268,7 +37268,7 @@ var ke = /* @__PURE__ */ r(((e) => {
 			l: "(n1+n2)*n3/n4",
 			r: "(n1*n3)/n4+(n2*n3)/n4"
 		}
-	], o = (e) => Math.round(e * 0x9184e72a000) / 0x9184e72a000;
+	], c = (e) => Math.round(e * 0x9184e72a000) / 0x9184e72a000;
 	e.expressionsCanBeCompared = (e, t) => {
 		let n = !0, r = !1, i = !1, a = !1;
 		return e.traverse(function(e, t, i) {
@@ -37281,72 +37281,122 @@ var ke = /* @__PURE__ */ r(((e) => {
 		return e.traverse((e) => {
 			e.isOperatorNode && e.op === "^" && !e.args[1]?.isConstantNode && (t = !0);
 		}), t;
-	}, e.areNumericallyEquivalent = (e, t, n, r = 1e-10) => {
-		let a = i.compile(e.toString()), o = i.compile(t.toString());
-		return [
-			1,
-			2,
-			3,
-			4,
-			5
-		].every((e) => {
-			let t = n.reduce((t, n) => (t[n] = e, t), {});
+	};
+	var l = (e) => () => {
+		e = e + 1831565813 | 0;
+		let t = Math.imul(e ^ e >>> 15, 1 | e);
+		return t = t + Math.imul(t ^ t >>> 7, 61 | t) ^ t, ((t ^ t >>> 14) >>> 0) / 4294967296;
+	};
+	e.getSamplePoints = (e, t = 12) => {
+		let n = l(443);
+		return Array.from({ length: t }, () => e.reduce((e, t) => {
+			let r = .5 + 4 * n();
+			return e[t] = n() < .5 ? -r : r, e;
+		}, {}));
+	};
+	var u = (e, t) => {
+		let n;
+		try {
+			n = o.compile(e.toString());
+		} catch {
+			return t.map(() => NaN);
+		}
+		return t.map((e) => {
 			try {
-				let e = a.evaluate(t), n = o.evaluate(t);
-				return Math.abs(e - n) < r;
+				let t = n.evaluate(Object.assign({}, e));
+				return typeof t == "number" ? t : NaN;
 			} catch {
-				return !1;
+				return NaN;
+			}
+		});
+	}, d = (e, t, n) => Math.abs(e - t) <= n * Math.max(1, Math.abs(e), Math.abs(t));
+	e.areNumericallyEquivalent = (t, n, r, i = 1e-10) => {
+		let a = (0, e.getSamplePoints)(r), o = u(t, a), s = u(n, a);
+		return o.filter((e, t) => Number.isFinite(e) && Number.isFinite(s[t])).length >= 3 && o.every((e, t) => !Number.isFinite(e) || !Number.isFinite(s[t]) || d(e, s[t], i));
+	};
+	var f = (e, t) => e.reduce((e, n) => e.reduce((e, r) => e.concat(Array.from({ length: 2 * t + 1 }, (e, i) => Object.assign(Object.assign({}, r), { [n]: i - t }))), []), [{}]), p = (t, n, r, { allowVariableFactor: i = !1, positiveOnly: a = !1 } = {}) => {
+		let o = 1e-9, s = (0, e.getSamplePoints)(r), c = u(t, s), l = u(n, s), p = [];
+		for (let e = 0; e < s.length; e++) {
+			let t = c[e], n = l[e];
+			if (!Number.isFinite(t) || !Number.isFinite(n)) continue;
+			let r = Math.abs(t) < o, i = Math.abs(n) < o;
+			if (!(r && i)) {
+				if (r || i) return !1;
+				p.push({
+					point: s[e],
+					ratio: t / n
+				});
 			}
+		}
+		return p.length < 3 ? !1 : (i ? f(r, 2).filter((e) => !a || Object.values(e).every((e) => e % 2 == 0)) : [{}]).some((e) => {
+			let t = p.map(({ point: t, ratio: n }) => Object.keys(e).reduce((n, r) => n / t[r] ** +e[r], n));
+			return (!a || t[0] > 0) && t.every((e) => d(e, t[0], o));
 		});
-	}, e.transformEqualityInExpression = (e) => n.simplify(new i.OperatorNode("-", "subtract", e.args)), e.getVariables = (e) => {
+	}, m = 4, h = 60, g = (e) => {
+		let t = 0, n = !1;
+		return e.traverse((e) => {
+			t++, n ||= e.isOperatorNode && e.op === "^" && e.args[1]?.isConstantNode && Math.abs(Number(e.args[1].value)) > m;
+		}), n || t > h;
+	}, _ = (e) => {
+		if (!g(e)) try {
+			let { numerator: t, denominator: n } = o.rationalize(e.toString(), {}, !0);
+			return n ? t : void 0;
+		} catch {
+			return;
+		}
+	};
+	e.areEquationsNumericallyEquivalent = (e, t, n, r = {}) => {
+		if (p(e, t, n, r)) return !0;
+		if (r.positiveOnly) return !1;
+		let i = _(e), a = _(t);
+		return (i !== void 0 || a !== void 0) && p(i || e, a || t, n, r);
+	}, e.transformEqualityInExpression = (e) => (0, r.simplify)(new a.OperatorNode("-", "subtract", e.args)), e.getVariables = (e) => {
 		let t = [];
 		return e.traverse(function(e, n, r) {
 			e.isSymbolNode && e?.name.length === 1 && !t.includes(e.name) && t.push(e.name);
 		}), t.sort();
 	}, e.getCoefficients = (e, t) => {
 		try {
-			let t = i.rationalize(e, {}, !0).coefficients;
+			let t = a.rationalize(e, {}, !0).coefficients;
 			return t.every((e) => e < 0) ? t.map((e) => Math.abs(e)) : t;
 		} catch {
-			t || a.push({
+			t || s.push({
 				l: "-(n)",
 				r: "n"
-			}), e = r(e, a);
+			}), e = i(e, s);
 			try {
-				return i.rationalize(e, {}, !0).coefficients;
+				return a.rationalize(e, {}, !0).coefficients;
 			} catch {}
 		}
 		return [1, 0];
-	}, e.setXToOne = (e, t) => e.transform(function(e, n, r) {
-		return e.isSymbolNode && e.name === t ? new i.ConstantNode(1) : e;
-	}), e.solveQuadraticEquation = (e) => {
-		let [t, n, r] = e, a = n * n - 4 * r * t, s, c;
+	}, e.solveQuadraticEquation = (e) => {
+		let [t, n, r] = e, i = n * n - 4 * r * t, o, s;
 		try {
-			s = i.compile(i.fraction(-n + i.sqrt(a)) / (2 * r));
+			o = a.compile(a.fraction(-n + a.sqrt(i)) / (2 * r));
 		} catch {
-			s = i.compile("(-b+sqrt(discriminant))/(2*a)");
+			o = a.compile("(-b+sqrt(discriminant))/(2*a)");
 		}
 		try {
-			c = i.compile(i.fraction(-n - i.sqrt(a)) / (2 * r));
+			s = a.compile(a.fraction(-n - a.sqrt(i)) / (2 * r));
 		} catch {
-			c = i.compile("(-b-sqrt(discriminant))/(2*a)");
+			s = a.compile("(-b-sqrt(discriminant))/(2*a)");
 		}
-		let l = s.evaluate({
-			discriminant: a,
+		let l = o.evaluate({
+			discriminant: i,
 			a: r,
 			b: n
-		}), u = c.evaluate({
-			discriminant: a,
+		}), u = s.evaluate({
+			discriminant: i,
 			a: r,
 			b: n
 		});
 		return l.im ? [{
-			re: o(l.re),
-			im: o(l.im)
+			re: c(l.re),
+			im: c(l.im)
 		}, {
-			re: o(u.re),
-			im: o(u.im)
-		}] : (l = o(l), u = o(u), [{
+			re: c(u.re),
+			im: c(u.im)
+		}] : (l = c(l), u = c(u), [{
 			re: l,
 			im: 0
 		}, {
@@ -37359,7 +37409,7 @@ var ke = /* @__PURE__ */ r(((e) => {
 			if (e.length === 3 && e[0] === 0 && (e = e.splice(1, 2)), e.length === 2) {
 				if (e[0] === 0 && e[1] === 0) return Infinity;
 				if (e[0] === 0) return 0;
-				t = o(i.divide(e[0], -1 * e[1]));
+				t = c(a.divide(e[0], -1 * e[1]));
 			}
 			return t;
 		}
@@ -37369,29 +37419,27 @@ var ke = /* @__PURE__ */ r(((e) => {
 	var t = __(), n = b_(), r = t.mathjs, i = (e, t) => Array.isArray(e) && Array.isArray(t) && e.length === t.length && e.every((e, n) => e === t[n]);
 	e.compareEquations = (e, t, a) => {
 		let o = !1;
-		if (n.expressionsCanBeCompared(e, t)) {
-			let s = n.transformEqualityInExpression(e), c = n.transformEqualityInExpression(t);
+		if ((0, n.expressionsCanBeCompared)(e, t)) {
+			let s = (0, n.transformEqualityInExpression)(e), c = (0, n.transformEqualityInExpression)(t);
 			if (s.equals(c)) return !0;
-			let l = n.getVariables(s), u = n.getVariables(c);
-			if (!n.equationsHaveTheSameVariables(l, u)) return !1;
+			let l = (0, n.getVariables)(s), u = (0, n.getVariables)(c);
+			if (!(0, n.equationsHaveTheSameVariables)(l, u)) return !1;
 			let d, f;
-			if (n.hasSymbolicExponent(s) || n.hasSymbolicExponent(c)) return n.areNumericallyEquivalent(s, c, l);
+			if ((0, n.hasSymbolicExponent)(s) || (0, n.hasSymbolicExponent)(c)) return (0, n.areNumericallyEquivalent)(s, c, l);
 			if (l.length === 1) {
-				if (d = n.getCoefficients(s, a), f = n.getCoefficients(c, a), i(d, f)) return !0;
+				if (d = (0, n.getCoefficients)(s, a), f = (0, n.getCoefficients)(c, a), i(d, f)) return !0;
 				if (d.length === 3 && f.length === 3 && !a && d[0] !== 0 || d.length === 4 && d[0] === 0 && f[0] === 0) {
 					d[0] === 0 && (d = d.splice(1, 3), f = f.splice(1, 3));
-					let e = n.solveQuadraticEquation(d), t = n.solveQuadraticEquation(f), i = r.complex(e), a = r.complex(t);
+					let e = (0, n.solveQuadraticEquation)(d), t = (0, n.solveQuadraticEquation)(f), i = r.complex(e), a = r.complex(t);
 					return e[0].im === 0 && e[1].im === 0 ? i[0].equals(a[0]) && i[1].equals(a[1]) || i[0].equals(a[1]) && i[1].equals(a[0]) : e[0].re === t[0].re && e[1].re === t[1].re && e[0].im.toFixed(13) === t[0].im.toFixed(13) && e[1].im.toFixed(13) === t[1].im.toFixed(13);
 				}
-				let e = n.solveLinearEquation(d);
-				o = e === n.solveLinearEquation(f) && e !== void 0;
-			}
-			if (l.length === 2) {
-				let e = l[0], t = n.setXToOne(s, e);
-				d = n.getCoefficients(t, a);
-				let r = n.setXToOne(c, e);
-				f = n.getCoefficients(r, a), o = n.solveLinearEquation(d) === n.solveLinearEquation(f);
+				let e = (0, n.solveLinearEquation)(d), t = (0, n.solveLinearEquation)(f);
+				if (o = e === t && e !== void 0, !a && (e === void 0 || t === void 0)) return (0, n.areEquationsNumericallyEquivalent)(s, c, l);
 			}
+			if (l.length === 2) return (0, n.areEquationsNumericallyEquivalent)(s, c, l, {
+				allowVariableFactor: !0,
+				positiveOnly: a
+			});
 			if (o && a) return !(r.isPositive(d[0]) && r.isNegative(d[1]) && r.isNegative(f[0]) && r.isPositive(f[1]) || r.isNegative(d[0]) && r.isPositive(d[1]) && r.isPositive(f[0]) && r.isNegative(f[1]));
 		}
 		return o;
@@ -37412,24 +37460,24 @@ var ke = /* @__PURE__ */ r(((e) => {
 		left: new r.OperatorNode(i(e.conditionals[0]), e.conditionals[0], [e.params[0], e.params[1]]),
 		right: new r.OperatorNode(i(e.conditionals[1]), e.conditionals[1], [e.params[1], e.params[2]])
 	}), e.getLimit = (e, t) => {
-		let r = n.transformEqualityInExpression(e.right), i = n.transformEqualityInExpression(e.left), a = n.solveLinearEquation(n.getCoefficients(r, !0)), o = n.solveLinearEquation(n.getCoefficients(i, !0));
+		let r = (0, n.transformEqualityInExpression)(e.right), i = (0, n.transformEqualityInExpression)(e.left), a = (0, n.solveLinearEquation)((0, n.getCoefficients)(r, !0)), o = (0, n.solveLinearEquation)((0, n.getCoefficients)(i, !0));
 		return t === "inferior" ? Math.min(a, o) : Math.max(a, o);
 	}, e.compareCompoundInequations = (t, r) => {
-		if (!n.expressionsCanBeCompared(t, r)) return !1;
-		let i = n.getVariables(t), a = n.getVariables(r);
-		if (!n.equationsHaveTheSameVariables(i, a) && i?.length === 1) return !1;
-		let o = e.splitInequality(t), s = e.splitInequality(r), c = {
-			min: e.getLimit(o, "inferior"),
-			max: e.getLimit(o, "superior")
+		if (!(0, n.expressionsCanBeCompared)(t, r)) return !1;
+		let i = (0, n.getVariables)(t), a = (0, n.getVariables)(r);
+		if (!(0, n.equationsHaveTheSameVariables)(i, a) && i?.length === 1) return !1;
+		let o = (0, e.splitInequality)(t), s = (0, e.splitInequality)(r), c = {
+			min: (0, e.getLimit)(o, "inferior"),
+			max: (0, e.getLimit)(o, "superior")
 		}, l = {
-			min: e.getLimit(s, "inferior"),
-			max: e.getLimit(s, "superior")
+			min: (0, e.getLimit)(s, "inferior"),
+			max: (0, e.getLimit)(s, "superior")
 		};
 		return c.min === l.min && c.max === l.max;
 	};
 })), C_ = /* @__PURE__ */ r(((e) => {
 	Object.defineProperty(e, "__esModule", { value: !0 }), e.isMathEqual = e.simplify = void 0;
-	var t = _(), n = __(), r = y_(), i = x_(), a = S_(), o = n.mathjs, s = t.logger("mv:symbolic"), c = 1497258.191621251, l = -1497258.191621251, { simplify: u, rationalize: d } = n.mathjs, f = [
+	var t = _(), n = __(), r = g_(), i = y_(), a = x_(), o = S_(), s = n.mathjs, c = (0, t.logger)("mv:symbolic"), l = 1e-9, u = (0, r.create)(r.all), d = 1e-13, f = 1e-14, { simplify: p, rationalize: m } = n.mathjs, h = [
 		{
 			l: "n1^(1/n2)",
 			r: "nthRoot(n1, n2)"
@@ -37572,43 +37620,101 @@ var ke = /* @__PURE__ */ r(((e) => {
 			r: "1/n"
 		}
 	];
-	e.simplify = (e) => u(e, f.concat(u.rules));
-	var p = (t) => {
-		let n = t, i = !0, a = !1, u = !1, f = !1, p = !1;
-		if (n.traverse(function(t, n, r) {
-			t.isArrayNode && (u = !0, t.items = t.items.map((t) => e.simplify(t))), t.isSymbolNode && (f ||= t.name === "pi", p ||= t.name === "f^{-1}");
-		}), n.args && (n.args = n.args.map((t) => {
+	e.simplify = (e) => p(e, h.concat(p.rules));
+	var g = (e, t) => {
+		let n = !1;
+		return e.traverse((e, r) => {
+			n ||= e.isSymbolNode && r !== "fn" && t(e.name);
+		}), n;
+	}, v = (e) => {
+		if (!g(e, (e) => e !== "pi" && e !== "Infinity")) try {
+			let t = u.evaluate(e.toString());
+			return typeof t == "number" ? t : void 0;
+		} catch {
+			return;
+		}
+	}, y = (e) => {
+		let t = v(e);
+		if (t === void 0 || !isFinite(t)) return;
+		let n = t / (Math.PI / 2), r = Math.round(n);
+		return Math.abs(n - r) <= l * Math.max(1, Math.abs(r)) ? r : void 0;
+	}, b = (e) => {
+		let t = !1, n = e.transform((e) => {
+			if (!e.isFunctionNode || e.args?.length !== 1) return e;
+			let n = y(e.args[0]);
+			if (n === void 0) return e;
+			let r = Math.abs(n) % 2 == 1, i = e;
+			switch (e.fn.name) {
+				case "sin":
+					i = r ? e : new s.ConstantNode(0);
+					break;
+				case "cos":
+					i = r ? new s.ConstantNode(0) : e;
+					break;
+				case "tan":
+					i = r ? new s.SymbolNode("Infinity") : new s.ConstantNode(0);
+					break;
+				case "cot":
+					i = r ? new s.ConstantNode(0) : new s.SymbolNode("Infinity");
+					break;
+				case "sec":
+					i = r ? new s.SymbolNode("Infinity") : e;
+					break;
+				case "csc": i = r ? e : new s.SymbolNode("Infinity");
+			}
+			return t ||= i !== e, i;
+		});
+		return {
+			r: t ? n : e,
+			changed: t
+		};
+	}, x = (t) => {
+		let n = b(t), r = n.r, a = n.changed ? v(r) : void 0, o = a !== void 0 && (!isFinite(a) || g(r, (e) => e === "Infinity")) ? a : void 0, l = !0, u = !1, d = !1, f = !1, p = !1;
+		if (r.traverse(function(t, n, r) {
+			t.isArrayNode && (d = !0, t.items = t.items.map((t) => (0, e.simplify)(t))), t.isSymbolNode && (f ||= t.name === "pi", p ||= t.name === "f^{-1}");
+		}), r.args && (r.args = r.args.map((t) => {
 			if (!t.isFunctionNode && !t.isArrayNode && !p && !f) try {
-				t = e.simplify(t);
+				t = (0, e.simplify)(t);
 			} catch {}
-			return a ||= t.isFunctionNode, i &&= !!t.isConstantNode, t;
-		}), (a || p) && (n.args = n.args.map((t) => {
+			return u ||= t.isFunctionNode, l &&= !!t.isConstantNode, t;
+		}), (u || p) && (r.args = r.args.map((t) => {
 			if (!t.isFunctionNode && !t.isArrayNode) try {
-				t = d(e.simplify(t), {}, !0).expression;
+				t = m((0, e.simplify)(t), {}, !0).expression;
 			} catch {}
 			return t;
-		}))), n.fn !== "equal") try {
-			i = !1, n = d(n, {}, !0).expression;
+		}))), r.fn !== "equal") try {
+			l = !1, r = m(r, {}, !0).expression;
 		} catch {}
-		if (n.conditionals && n.params && (n.params = n.params.map((t) => r.sort(e.simplify(t)))), !u && !i) try {
-			n = e.simplify(n);
+		if (r.conditionals && r.params && (r.params = r.params.map((t) => (0, i.sort)((0, e.simplify)(t)))), !d && !l) try {
+			r = (0, e.simplify)(r);
 		} catch {}
-		return s("[normalize] input: ", t.toString(), "output: ", n.toString()), (n.toString() === "Infinity" || +n.toString() >= c || +n.toString() <= l) && (n = new o.SymbolNode("Infinity")), n.value ? n.value = new o.Fraction(Math.round(n.value * 1e4) / 1e4) : n.fn === "unaryMinus" && (n.args[0].value = new o.Fraction(Math.round(n.args[0].value * 1e4) / 1e4), n = e.simplify(n)), n;
-	};
+		return c("[normalize] input: ", t.toString(), "output: ", r.toString()), o !== void 0 && (r = isNaN(o) ? new s.SymbolNode("NaN") : isFinite(o) ? new s.ConstantNode(o) : new s.SymbolNode("Infinity")), r.toString() === "Infinity" && (r = new s.SymbolNode("Infinity")), r;
+	}, S = (e) => {
+		if (!(e.filter((e) => e.isSymbolNode).length > 0)) try {
+			let t = e.evaluate();
+			if (typeof t == "boolean") return;
+			let n = +t;
+			return Number.isFinite(n) ? n : void 0;
+		} catch {
+			return;
+		}
+	}, C = (e, t) => Math.abs(e - t) < f + d * Math.max(Math.abs(e), Math.abs(t)), w = (e) => e?.isSymbolNode && e.name === "NaN";
 	e.isMathEqual = (e, t) => {
-		let n, c;
+		let n, r;
 		if (e?.isUnit && t?.isUnit) try {
-			return o.equal(e, t);
+			return s.equal(e, t);
 		} catch (n) {
-			return s("[isMathEqual] Error comparing units:", (e?.toString)?.call(e), (t?.toString)?.call(t), n), !1;
+			return c("[isMathEqual] Error comparing units:", (e?.toString)?.call(e), (t?.toString)?.call(t), n), !1;
 		}
-		if (e?.isUnit || t?.isUnit) return s("[isMathEqual] Mismatched unit comparison:", (e?.toString)?.call(e), (t?.toString)?.call(t)), !1;
-		n = e.conditionals ? p(e) : r.sort(p(e)), c = t.conditionals ? p(t) : r.sort(p(t)), s("[isMathEqual]", n.toString(), "==?", c.toString());
-		let l = r.sort(e).equals(r.sort(t)), u = n.toTex().trim() === c.toTex().trim() || n.equals(c) || l;
+		if (e?.isUnit || t?.isUnit) return c("[isMathEqual] Mismatched unit comparison:", (e?.toString)?.call(e), (t?.toString)?.call(t)), !1;
+		if (n = e.conditionals ? x(e) : (0, i.sort)(x(e)), r = t.conditionals ? x(t) : (0, i.sort)(x(t)), c("[isMathEqual]", n.toString(), "==?", r.toString()), w(n) || w(r)) return !1;
+		let l = (0, i.sort)(e).equals((0, i.sort)(t)), u = n.toTex().trim() === r.toTex().trim() || n.equals(r) || l;
 		if (u) return !0;
-		if (n.fn === "equal" && c.fn === "equal") return i.compareEquations(n, c, !1);
-		if (n.fn === "larger" && c.fn === "larger" || n.fn === "largerEq" && c.fn === "largerEq") return n.fn = "equal", c.fn = "equal", n.op = "=", c.op = "=", i.compareEquations(n, c, !0);
-		if (n?.conditionals?.length === c?.conditionals?.length && n?.conditionals?.length === 2 && (n?.conditionals)?.toString() === (c?.conditionals)?.toString()) {
+		let d = S(n), f = S(r);
+		if (d !== void 0 && f !== void 0) return C(d, f);
+		if (n.fn === "equal" && r.fn === "equal") return (0, a.compareEquations)(n, r, !1);
+		if (n.fn === "larger" && r.fn === "larger" || n.fn === "largerEq" && r.fn === "largerEq") return n.fn = "equal", r.fn = "equal", n.op = "=", r.op = "=", (0, a.compareEquations)(n, r, !0);
+		if (n?.conditionals?.length === r?.conditionals?.length && n?.conditionals?.length === 2 && (n?.conditionals)?.toString() === (r?.conditionals)?.toString()) {
 			let e = [
 				"smaller",
 				"smallerEq",
@@ -37616,26 +37722,26 @@ var ke = /* @__PURE__ */ r(((e) => {
 				"largerEq",
 				"equal",
 				"unequal"
-			], t = e.some((e) => n.conditionals.includes(e)), r = e.some((e) => c.conditionals.includes(e));
-			if (t && r) return a.compareCompoundInequations(n, c);
+			], t = e.some((e) => n.conditionals.includes(e)), i = e.some((e) => r.conditionals.includes(e));
+			if (t && i) return (0, o.compareCompoundInequations)(n, r);
 		}
 		return u;
 	};
 })), w_ = /* @__PURE__ */ r(((e) => {
 	Object.defineProperty(e, "__esModule", { value: !0 }), e.isMathEqual = void 0;
 	var t = __(), n = _(), r = y_(), { simplify: i } = t.mathjs;
-	n.logger("mv:literal");
+	(0, n.logger)("mv:literal");
 	var a = {
 		l: "tzn(n1, n2)",
 		r: "n1"
 	};
-	e.isMathEqual = (e, t, n) => (n && n.allowTrailingZeros && (e = i(e, [a]), t = i(t, [a])), n && n.ignoreOrder && (e = r.sort(e), t = r.sort(t)), e.equals(t));
+	e.isMathEqual = (e, t, n) => (n && n.allowTrailingZeros && (e = i(e, [a]), t = i(t, [a])), n && n.ignoreOrder && (e = (0, r.sort)(e), t = (0, r.sort)(t)), e.equals(t));
 })), T_ = /* @__PURE__ */ r(((e, t, n) => {
 	var r = n && n.__importDefault || function(e) {
 		return e && e.__esModule ? e : { default: e };
 	};
 	Object.defineProperty(e, "__esModule", { value: !0 }), e.differenceIsTooGreat = void 0;
-	var a = r(i()).default("difference");
+	var a = (0, r(i()).default)("difference");
 	e.differenceIsTooGreat = (e, t) => {
 		let n = Math.min(e.toString().length, t.toString().length), r = Math.max(e.toString().length, t.toString().length), i = 1 / n * 100 + 10 + 17, o = r - n;
 		return a("a:", e.toString(), "b:", t.toString(), "limit:", i, "diff:", o), o > i;
@@ -37648,14 +37754,14 @@ var ke = /* @__PURE__ */ r(((e) => {
 		if (!e || !t) return !1;
 		if (e === t || n.mode === "symbolic" && c(e) && c(t) && parseFloat(e) === parseFloat(t)) return !0;
 		let l = o.convert(e), u = o.convert(t);
-		if (a.differenceIsTooGreat(l, u)) return !1;
+		if ((0, a.differenceIsTooGreat)(l, u)) return !1;
 		let d = s.convert(l), f = s.convert(u);
-		return n.mode === "literal" ? i.isMathEqual(d, f, n.literal) : r.isMathEqual(d, f);
+		return n.mode === "literal" ? (0, i.isMathEqual)(d, f, n.literal) : (0, r.isMathEqual)(d, f);
 	};
 })), D_ = /* @__PURE__ */ t((/* @__PURE__ */ r(((e) => {
 	Object.defineProperty(e, "__esModule", { value: !0 }), e.latexEqual = void 0;
 	var t = E_();
-	e.latexEqual = (e, n, r) => t.latexEqual(e, n, r);
+	e.latexEqual = (e, n, r) => (0, t.latexEqual)(e, n, r);
 })))(), 1), O_ = /[\u061C\u200E\u200F\u202A-\u202E\u2066-\u2069\u0640]/g, k_ = /[\uFB50-\uFDFF\uFE70-\uFEFC]+/g, A_ = /\p{Nd}/u, j_ = /(?![0-9])\p{Nd}/gu, M_ = /\u066B/g, N_ = /\u066C/g, P_ = /[\u0622\u0623\u0625\u0671]/g, F_ = /[\u064B-\u065F\u0670]/g, I_ = /* @__PURE__ */ new Map(), L_ = (e) => {
 	let t = I_.get(e);
 	if (t !== void 0) return t;
@@ -37850,7 +37956,7 @@ var Q_ = (e, t, n) => {
 	return o(s) || (c.responsesErrors = s), c;
 }, lv = Object.freeze({
 	name: "@pie-element/math-inline",
-	version: "13.0.8-next.20261103123052"
+	version: "13.0.8-next.20261104122226"
 });
 //#endregion
 export { ov as createCorrectResponseSession, Z_ as createDefaultModel, Q_ as getLogTrace, tv as model, ev as normalize, $_ as outcome, lv as piePackage, cv as validate };