@weapp-tailwindcss/postcss 3.3.8 → 3.3.9

package/dist/{directives-Cr-gZPUc.js → directives-DMB7AQE_.js}

@@ -1,4 +1,4 @@
-import { ParseError as ParseError$1, a as a$1, isToken, isTokenCloseParen, isTokenColon, isTokenComma, isTokenComment, isTokenDelim, isTokenDimension, isTokenEOF, isTokenFunction, isTokenHash, isTokenIdent, isTokenNumber, isTokenNumeric, isTokenOpenCurly, isTokenOpenParen, isTokenOpenSquare, isTokenPercentage, isTokenSemicolon, isTokenWhiteSpaceOrComment, isTokenWhitespace, mirrorVariant, mirrorVariantType, mutateUnit, parseCssImportSpecifier, stringify, tokenize, tokenizer, u as u$1 } from "./resolve-D-FbFBpF.js";
+import { ParseError as ParseError$1, a as a$1, isToken, isTokenCloseParen, isTokenColon, isTokenComma, isTokenComment, isTokenDelim, isTokenDimension, isTokenEOF, isTokenFunction, isTokenHash, isTokenIdent, isTokenNumber, isTokenNumeric, isTokenOpenCurly, isTokenOpenParen, isTokenOpenSquare, isTokenPercentage, isTokenSemicolon, isTokenWhiteSpaceOrComment, isTokenWhitespace, mirrorVariant, mirrorVariantType, mutateUnit, parseCssImportSpecifier, stringify, tokenize, tokenizer, u as u$1 } from "./resolve-Cb3XkcFk.js";
 import { postcss as postcss$1 } from "./postcss-runtime-i5rHe_mj.js";
 import { internalCssSelectorReplacer } from "./shared-CfQUwapA.js";
 import postcssCalc from "@weapp-tailwindcss/postcss-calc";
@@ -702,7 +702,7 @@ function hasUnsupportedModernColorFunction(value) {
 	return hasUnsupported;
 }
 //#endregion
-//#region ../../node_modules/.pnpm/@csstools+color-helpers@6.1.1/node_modules/@csstools/color-helpers/dist/index.mjs
+//#region ../../node_modules/.pnpm/@csstools+color-helpers@6.1.2/node_modules/@csstools/color-helpers/dist/index.mjs
 function multiplyMatrices(_, t) {
 	return [
 		_[0] * t[0] + _[1] * t[1] + _[2] * t[2],
@@ -1236,10 +1236,10 @@ const h = [
 		lin_ProPhoto_channel(_[2])
 	];
 }
-const f$1 = 16 / 512;
+const f = 16 / 512;
 function lin_ProPhoto_channel(_) {
 	const t = _ < 0 ? -1 : 1, n = Math.abs(_);
-	return n <= f$1 ? _ / 16 : t * Math.pow(n, 1.8);
+	return n <= f ? _ / 16 : t * Math.pow(n, 1.8);
 }
 const m = [
 	.7977666449006423,
@@ -2370,54 +2370,60 @@ function contrast_ratio_wcag_2_1(_, t) {
 	return (Math.max(n, o) + .05) / (Math.min(n, o) + .05);
 }
 //#endregion
-//#region ../../node_modules/.pnpm/@csstools+css-parser-algorithms@4.0.0_@csstools+css-tokenizer@4.0.1/node_modules/@csstools/css-parser-algorithms/dist/index.mjs
-var f;
+//#region ../../node_modules/.pnpm/@csstools+css-parser-algorithms@4.0.1_@csstools+css-tokenizer@4.0.2/node_modules/@csstools/css-parser-algorithms/dist/index.mjs
+var k$1;
 function walkerIndexGenerator(e) {
-	let n = e.slice();
-	return (e, t, o) => {
-		let s = -1;
-		for (let i = n.indexOf(t); i < n.length && (s = e.indexOf(n[i]), -1 === s || s < o); i++);
-		return -1 === s || s === o && t === e[o] && (s++, s >= e.length) ? -1 : (n = e.slice(), s);
+	let n, t = e.slice(), o = -1;
+	return (e, s, i) => {
+		if (e === n && e.length === o && e[i] === s) {
+			o = e.length;
+			const n = i + 1;
+			return n < e.length ? n : -1;
+		}
+		let r = -1;
+		for (let n = t.indexOf(s); n < t.length && (r = e.indexOf(t[n]), -1 === r || r < i); n++);
+		return -1 === r || r === i && s === e[i] && (r++, r >= e.length) ? (n = e, o = e.length, -1) : (t = e.slice(), n = e, o = e.length, r);
 	};
 }
-function consumeComponentValue(e, n) {
-	const t = n[0];
-	if (isTokenOpenParen(t) || isTokenOpenCurly(t) || isTokenOpenSquare(t)) {
-		const t = consumeSimpleBlock(e, n);
+(function(e) {
+	e.Function = "function", e.SimpleBlock = "simple-block", e.Whitespace = "whitespace", e.Comment = "comment", e.Token = "token";
+})(k$1 || (k$1 = {}));
+const N = 512;
+function consumeComponentValue(e, n, t = 0, o = 0) {
+	const s = n[t];
+	if (isTokenOpenParen(s) || isTokenOpenCurly(s) || isTokenOpenSquare(s)) {
+		const s = consumeSimpleBlock(e, n, t, o);
 		return {
-			advance: t.advance,
-			node: t.node
+			advance: s.advance,
+			node: s.node
 		};
 	}
-	if (isTokenFunction(t)) {
-		const t = consumeFunction(e, n);
+	if (isTokenFunction(s)) {
+		const s = consumeFunction(e, n, t, o);
 		return {
-			advance: t.advance,
-			node: t.node
+			advance: s.advance,
+			node: s.node
 		};
 	}
-	if (isTokenWhitespace(t)) {
-		const t = consumeWhitespace(e, n);
+	if (isTokenWhitespace(s)) {
+		const o = consumeWhitespace(e, n, t);
 		return {
-			advance: t.advance,
-			node: t.node
+			advance: o.advance,
+			node: o.node
 		};
 	}
-	if (isTokenComment(t)) {
-		const t = consumeComment(e, n);
+	if (isTokenComment(s)) {
+		const o = consumeComment(e, n, t);
 		return {
-			advance: t.advance,
-			node: t.node
+			advance: o.advance,
+			node: o.node
 		};
 	}
 	return {
 		advance: 1,
-		node: new TokenNode(t)
+		node: new TokenNode(s)
 	};
 }
-(function(e) {
-	e.Function = "function", e.SimpleBlock = "simple-block", e.Whitespace = "whitespace", e.Comment = "comment", e.Token = "token";
-})(f || (f = {}));
 var ContainerNodeBaseClass = class {
 	value = [];
 	indexOf(e) {
@@ -2442,11 +2448,11 @@ var ContainerNodeBaseClass = class {
 		}
 	}
 	walk(e, n) {
-		0 !== this.value.length && this.forEach((n, t) => !1 !== e(n, t) && (!("walk" in n.node) || !this.value.includes(n.node) || !1 !== n.node.walk(e, n.state)) && void 0, n);
+		0 !== this.value.length && this.forEach((n, t) => !1 !== e(n, t) && (!("walk" in n.node) || !("number" == typeof t && this.value[t] === n.node || this.value.includes(n.node)) || !1 !== n.node.walk(e, n.state)) && void 0, n);
 	}
 };
 var FunctionNode = class FunctionNode extends ContainerNodeBaseClass {
-	type = f.Function;
+	type = k$1.Function;
 	name;
 	endToken;
 	constructor(e, n, t) {
@@ -2472,8 +2478,8 @@ var FunctionNode = class FunctionNode extends ContainerNodeBaseClass {
 		];
 	}
 	toString() {
-		const e = this.value.map((e) => isToken(e) ? stringify(e) : e.toString()).join("");
-		return stringify(this.name) + e + stringify(this.endToken);
+		const n = this.value.map((n) => isToken(n) ? stringify(n) : n.toString()).join("");
+		return stringify(this.name) + n + stringify(this.endToken);
 	}
 	toJSON() {
 		return {
@@ -2487,33 +2493,35 @@ var FunctionNode = class FunctionNode extends ContainerNodeBaseClass {
 		return FunctionNode.isFunctionNode(this);
 	}
 	static isFunctionNode(e) {
-		return !!e && e instanceof FunctionNode && e.type === f.Function;
+		return !!e && e instanceof FunctionNode && e.type === k$1.Function;
 	}
 };
-function consumeFunction(n, t) {
-	const o = [];
-	let s = 1;
+function consumeFunction(e, t, o, s) {
+	if (s >= N) throw new Error("Maximum nesting depth of 512 exceeded, reduce the complexity of your stylesheet.");
+	const i = [];
+	let r = o + 1;
 	for (;;) {
-		const i = t[s];
-		if (!i || isTokenEOF(i)) return n.onParseError(new ParseError$1("Unexpected EOF while consuming a function.", t[0][2], t[t.length - 1][3], ["5.4.9. Consume a function", "Unexpected EOF"])), {
-			advance: t.length,
-			node: new FunctionNode(t[0], i, o)
+		const a = t[r];
+		if (!a || isTokenEOF(a)) return e.onParseError(new ParseError$1("Unexpected EOF while consuming a function.", t[o][2], t[t.length - 1][3], ["5.4.9. Consume a function", "Unexpected EOF"])), {
+			advance: t.length - o,
+			node: new FunctionNode(t[o], a, i)
 		};
-		if (isTokenCloseParen(i)) return {
-			advance: s + 1,
-			node: new FunctionNode(t[0], i, o)
+		if (isTokenCloseParen(a)) return {
+			advance: r - o + 1,
+			node: new FunctionNode(t[o], a, i)
 		};
-		if (isTokenWhiteSpaceOrComment(i)) {
-			const e = consumeAllCommentsAndWhitespace(n, t.slice(s));
-			s += e.advance, o.push(...e.nodes);
+		if (isTokenWhiteSpaceOrComment(a)) {
+			const n = consumeAllCommentsAndWhitespace(e, t, r);
+			r += n.advance;
+			for (let e = 0; e < n.nodes.length; e++) i.push(n.nodes[e]);
 			continue;
 		}
-		const r = consumeComponentValue(n, t.slice(s));
-		s += r.advance, o.push(r.node);
+		const c = consumeComponentValue(e, t, r, s + 1);
+		r += c.advance, i.push(c.node);
 	}
 }
 var SimpleBlockNode = class SimpleBlockNode extends ContainerNodeBaseClass {
-	type = f.SimpleBlock;
+	type = k$1.SimpleBlock;
 	startToken;
 	endToken;
 	constructor(e, n, t) {
@@ -2533,8 +2541,8 @@ var SimpleBlockNode = class SimpleBlockNode extends ContainerNodeBaseClass {
 		];
 	}
 	toString() {
-		const e = this.value.map((e) => isToken(e) ? stringify(e) : e.toString()).join("");
-		return stringify(this.startToken) + e + stringify(this.endToken);
+		const n = this.value.map((n) => isToken(n) ? stringify(n) : n.toString()).join("");
+		return stringify(this.startToken) + n + stringify(this.endToken);
 	}
 	toJSON() {
 		return {
@@ -2548,35 +2556,37 @@ var SimpleBlockNode = class SimpleBlockNode extends ContainerNodeBaseClass {
 		return SimpleBlockNode.isSimpleBlockNode(this);
 	}
 	static isSimpleBlockNode(e) {
-		return !!e && e instanceof SimpleBlockNode && e.type === f.SimpleBlock;
+		return !!e && e instanceof SimpleBlockNode && e.type === k$1.SimpleBlock;
 	}
 };
-function consumeSimpleBlock(n, t) {
-	const o = mirrorVariantType(t[0][0]);
-	if (!o) throw new Error("Failed to parse, a mirror variant must exist for all block open tokens.");
-	const s = [];
-	let i = 1;
+function consumeSimpleBlock(e, t, o, s) {
+	if (s >= N) throw new Error("Maximum nesting depth of 512 exceeded, reduce the complexity of your stylesheet.");
+	const i = mirrorVariantType(t[o][0]);
+	if (!i) throw new Error("Failed to parse, a mirror variant must exist for all block open tokens.");
+	const r = [];
+	let a = o + 1;
 	for (;;) {
-		const r = t[i];
-		if (!r || isTokenEOF(r)) return n.onParseError(new ParseError$1("Unexpected EOF while consuming a simple block.", t[0][2], t[t.length - 1][3], ["5.4.8. Consume a simple block", "Unexpected EOF"])), {
-			advance: t.length,
-			node: new SimpleBlockNode(t[0], r, s)
+		const c = t[a];
+		if (!c || isTokenEOF(c)) return e.onParseError(new ParseError$1("Unexpected EOF while consuming a simple block.", t[o][2], t[t.length - 1][3], ["5.4.8. Consume a simple block", "Unexpected EOF"])), {
+			advance: t.length - o,
+			node: new SimpleBlockNode(t[o], c, r)
 		};
-		if (r[0] === o) return {
-			advance: i + 1,
-			node: new SimpleBlockNode(t[0], r, s)
+		if (c[0] === i) return {
+			advance: a - o + 1,
+			node: new SimpleBlockNode(t[o], c, r)
 		};
-		if (isTokenWhiteSpaceOrComment(r)) {
-			const e = consumeAllCommentsAndWhitespace(n, t.slice(i));
-			i += e.advance, s.push(...e.nodes);
+		if (isTokenWhiteSpaceOrComment(c)) {
+			const n = consumeAllCommentsAndWhitespace(e, t, a);
+			a += n.advance;
+			for (let e = 0; e < n.nodes.length; e++) r.push(n.nodes[e]);
 			continue;
 		}
-		const a = consumeComponentValue(n, t.slice(i));
-		i += a.advance, s.push(a.node);
+		const u = consumeComponentValue(e, t, a, s + 1);
+		a += u.advance, r.push(u.node);
 	}
 }
 var WhitespaceNode = class WhitespaceNode {
-	type = f.Whitespace;
+	type = k$1.Whitespace;
 	value;
 	constructor(e) {
 		this.value = e;
@@ -2585,7 +2595,7 @@ var WhitespaceNode = class WhitespaceNode {
 		return this.value;
 	}
 	toString() {
-		return stringify(...this.value);
+		return stringify(this.value);
 	}
 	toJSON() {
 		return {
@@ -2597,22 +2607,22 @@ var WhitespaceNode = class WhitespaceNode {
 		return WhitespaceNode.isWhitespaceNode(this);
 	}
 	static isWhitespaceNode(e) {
-		return !!e && e instanceof WhitespaceNode && e.type === f.Whitespace;
+		return !!e && e instanceof WhitespaceNode && e.type === k$1.Whitespace;
 	}
 };
-function consumeWhitespace(e, n) {
-	let t = 0;
+function consumeWhitespace(e, n, t) {
+	let o = t;
 	for (;;) {
-		const e = n[t];
+		const e = n[o];
 		if (!isTokenWhitespace(e)) return {
-			advance: t,
-			node: new WhitespaceNode(n.slice(0, t))
+			advance: o - t,
+			node: new WhitespaceNode(n.slice(t, o))
 		};
-		t++;
+		o++;
 	}
 }
 var CommentNode = class CommentNode {
-	type = f.Comment;
+	type = k$1.Comment;
 	value;
 	constructor(e) {
 		this.value = e;
@@ -2633,33 +2643,33 @@ var CommentNode = class CommentNode {
 		return CommentNode.isCommentNode(this);
 	}
 	static isCommentNode(e) {
-		return !!e && e instanceof CommentNode && e.type === f.Comment;
+		return !!e && e instanceof CommentNode && e.type === k$1.Comment;
 	}
 };
-function consumeComment(e, n) {
+function consumeComment(e, n, t) {
 	return {
 		advance: 1,
-		node: new CommentNode(n[0])
+		node: new CommentNode(n[t])
 	};
 }
-function consumeAllCommentsAndWhitespace(e, n) {
-	const t = [];
-	let o = 0;
+function consumeAllCommentsAndWhitespace(e, n, t) {
+	const o = [];
+	let s = t;
 	for (;;) {
-		if (isTokenWhitespace(n[o])) {
-			const e = consumeWhitespace(0, n.slice(o));
-			o += e.advance, t.push(e.node);
+		if (isTokenWhitespace(n[s])) {
+			const e = consumeWhitespace(0, n, s);
+			s += e.advance, o.push(e.node);
 			continue;
 		}
-		if (!isTokenComment(n[o])) return {
-			advance: o,
-			nodes: t
+		if (!isTokenComment(n[s])) return {
+			advance: s - t,
+			nodes: o
 		};
-		t.push(new CommentNode(n[o])), o++;
+		o.push(new CommentNode(n[s])), s++;
 	}
 }
 var TokenNode = class TokenNode {
-	type = f.Token;
+	type = k$1.Token;
 	value;
 	constructor(e) {
 		this.value = e;
@@ -2680,11 +2690,12 @@ var TokenNode = class TokenNode {
 		return TokenNode.isTokenNode(this);
 	}
 	static isTokenNode(e) {
-		return !!e && e instanceof TokenNode && e.type === f.Token;
+		return !!e && e instanceof TokenNode && e.type === k$1.Token;
 	}
 };
-function parseComponentValue(t, o) {
-	const s = { onParseError: o?.onParseError ?? (() => {}) }, i = [...t];
+function parseComponentValue(e, o) {
+	const s = { onParseError: o?.onParseError ?? (() => {}) }, i = [...e];
+	if (0 === i.length) return;
 	isTokenEOF(i[i.length - 1]) || i.push([
 		u$1.EOF,
 		"",
@@ -2694,7 +2705,7 @@ function parseComponentValue(t, o) {
 	]);
 	const r = consumeComponentValue(s, i);
 	if (isTokenEOF(i[Math.min(r.advance, i.length - 1)])) return r.node;
-	s.onParseError(new ParseError$1("Expected EOF after parsing a component value.", t[0][2], t[t.length - 1][3], ["5.3.9. Parse a component value", "Expected EOF"]));
+	s.onParseError(new ParseError$1("Expected EOF after parsing a component value.", e[0][2], e[e.length - 1][3], ["5.3.9. Parse a component value", "Expected EOF"]));
 }
 function forEach(e, n, t) {
 	if (0 === e.length) return;
@@ -2712,7 +2723,7 @@ function forEach(e, n, t) {
 	}
 }
 function walk(e, n, t) {
-	0 !== e.length && forEach(e, (t, o) => !1 !== n(t, o) && (!("walk" in t.node) || !e.includes(t.node) || !1 !== t.node.walk(n, t.state)) && void 0, t);
+	0 !== e.length && forEach(e, (t, o) => !1 !== n(t, o) && (!("walk" in t.node) || !("number" == typeof o && e[o] === t.node || e.includes(t.node)) || !1 !== t.node.walk(n, t.state)) && void 0, t);
 }
 function replaceComponentValues$1(e, n) {
 	for (let t = 0; t < e.length; t++) walk(e[t], (e, t) => {
@@ -2751,7 +2762,7 @@ function sourceIndices(e) {
 	return t && o ? [t[2], o[3]] : [0, 0];
 }
 //#endregion
-//#region ../../node_modules/.pnpm/@csstools+css-calc@3.4.0_@csstools+css-parser-algorithms@4.0.0_@csstools+css-tokenizer@_2890c6a65aa9b6b5d7856150ce77fa7e/node_modules/@csstools/css-calc/dist/index.mjs
+//#region ../../node_modules/.pnpm/@csstools+css-calc@3.4.1_@csstools+css-parser-algorithms@4.0.1_@csstools+css-tokenizer@_c27b91014f1d16725d86a05c76dde1c4/node_modules/@csstools/css-calc/dist/index.mjs
 var ParseError = class extends Error {
 	sourceStart;
 	sourceEnd;
@@ -2765,15 +2776,15 @@ var ParseErrorWithComponentValues = class extends ParseError {
 		super(n, ...sourceIndices(t)), this.componentValues = t;
 	}
 };
-const I = {
+const S = {
 	UnexpectedAdditionOfDimensionOrPercentageWithNumber: "Unexpected addition of a dimension or percentage with a number.",
 	UnexpectedSubtractionOfDimensionOrPercentageWithNumber: "Unexpected subtraction of a dimension or percentage with a number."
 };
-const x = /[A-Z]/g;
+const y = /[A-Z]/g;
 function toLowerCaseAZ$1(e) {
-	return e.replace(x, (e) => String.fromCharCode(e.charCodeAt(0) + 32));
+	return e.replace(y, (e) => String.fromCharCode(e.charCodeAt(0) + 32));
 }
-const M = {
+const I = {
 	cm: "px",
 	in: "px",
 	mm: "px",
@@ -2790,7 +2801,7 @@ const M = {
 	hz: "hz",
 	khz: "hz"
 };
-const T = /* @__PURE__ */ new Map([
+const x = /* @__PURE__ */ new Map([
 	["cm", (e) => e],
 	["mm", (e) => 10 * e],
 	["q", (e) => 40 * e],
@@ -2799,20 +2810,20 @@ const T = /* @__PURE__ */ new Map([
 	["pt", (e) => e / 2.54 * 72],
 	["px", (e) => e / 2.54 * 96]
 ]);
-const P = /* @__PURE__ */ new Map([
+const M = /* @__PURE__ */ new Map([
 	["deg", (e) => e],
 	["grad", (e) => e / .9],
 	["rad", (e) => e / 180 * Math.PI],
 	["turn", (e) => e / 360]
 ]);
-const k = /* @__PURE__ */ new Map([
+const T = /* @__PURE__ */ new Map([
 	["deg", (e) => .9 * e],
 	["grad", (e) => e],
 	["rad", (e) => .9 * e / 180 * Math.PI],
 	["turn", (e) => .9 * e / 360]
 ]);
-const W = /* @__PURE__ */ new Map([["hz", (e) => e], ["khz", (e) => e / 1e3]]);
-const O = /* @__PURE__ */ new Map([
+const P = /* @__PURE__ */ new Map([["hz", (e) => e], ["khz", (e) => e / 1e3]]);
+const k = /* @__PURE__ */ new Map([
 	["cm", (e) => 2.54 * e],
 	["mm", (e) => 25.4 * e],
 	["q", (e) => 25.4 * e * 4],
@@ -2821,8 +2832,8 @@ const O = /* @__PURE__ */ new Map([
 	["pt", (e) => 72 * e],
 	["px", (e) => 96 * e]
 ]);
-const U = /* @__PURE__ */ new Map([["hz", (e) => 1e3 * e], ["khz", (e) => e]]);
-const L = /* @__PURE__ */ new Map([
+const W = /* @__PURE__ */ new Map([["hz", (e) => 1e3 * e], ["khz", (e) => e]]);
+const O = /* @__PURE__ */ new Map([
 	["cm", (e) => e / 10],
 	["mm", (e) => e],
 	["q", (e) => 4 * e],
@@ -2831,8 +2842,8 @@ const L = /* @__PURE__ */ new Map([
 	["pt", (e) => e / 25.4 * 72],
 	["px", (e) => e / 25.4 * 96]
 ]);
-const $ = /* @__PURE__ */ new Map([["ms", (e) => e], ["s", (e) => e / 1e3]]);
-const V = /* @__PURE__ */ new Map([
+const U = /* @__PURE__ */ new Map([["ms", (e) => e], ["s", (e) => e / 1e3]]);
+const L = /* @__PURE__ */ new Map([
 	["cm", (e) => e / 6 * 2.54],
 	["mm", (e) => e / 6 * 25.4],
 	["q", (e) => e / 6 * 25.4 * 4],
@@ -2841,7 +2852,7 @@ const V = /* @__PURE__ */ new Map([
 	["pt", (e) => e / 6 * 72],
 	["px", (e) => e / 6 * 96]
 ]);
-const Z = /* @__PURE__ */ new Map([
+const $ = /* @__PURE__ */ new Map([
 	["cm", (e) => e / 72 * 2.54],
 	["mm", (e) => e / 72 * 25.4],
 	["q", (e) => e / 72 * 25.4 * 4],
@@ -2850,7 +2861,7 @@ const Z = /* @__PURE__ */ new Map([
 	["pt", (e) => e],
 	["px", (e) => e / 72 * 96]
 ]);
-const z = /* @__PURE__ */ new Map([
+const V = /* @__PURE__ */ new Map([
 	["cm", (e) => e / 96 * 2.54],
 	["mm", (e) => e / 96 * 25.4],
 	["q", (e) => e / 96 * 25.4 * 4],
@@ -2859,7 +2870,7 @@ const z = /* @__PURE__ */ new Map([
 	["pt", (e) => e / 96 * 72],
 	["px", (e) => e]
 ]);
-const q = /* @__PURE__ */ new Map([
+const Z = /* @__PURE__ */ new Map([
 	["cm", (e) => e / 4 / 10],
 	["mm", (e) => e / 4],
 	["q", (e) => e],
@@ -2868,123 +2879,123 @@ const q = /* @__PURE__ */ new Map([
 	["pt", (e) => e / 4 / 25.4 * 72],
 	["px", (e) => e / 4 / 25.4 * 96]
 ]);
-const G = /* @__PURE__ */ new Map([
+const z = /* @__PURE__ */ new Map([
 	["deg", (e) => 180 * e / Math.PI],
 	["grad", (e) => 180 * e / Math.PI / .9],
 	["rad", (e) => e],
 	["turn", (e) => 180 * e / Math.PI / 360]
 ]);
-const R = /* @__PURE__ */ new Map([["ms", (e) => 1e3 * e], ["s", (e) => e]]);
-const j = /* @__PURE__ */ new Map([
+const q = /* @__PURE__ */ new Map([["ms", (e) => 1e3 * e], ["s", (e) => e]]);
+const R = /* @__PURE__ */ new Map([
 	["deg", (e) => 360 * e],
 	["grad", (e) => 360 * e / .9],
 	["rad", (e) => 360 * e / 180 * Math.PI],
 	["turn", (e) => e]
 ]);
-const Y = /* @__PURE__ */ new Map([
-	["cm", T],
-	["mm", L],
-	["q", q],
-	["in", O],
-	["pc", V],
-	["pt", Z],
-	["px", z],
-	["ms", $],
-	["s", R],
-	["deg", P],
-	["grad", k],
-	["rad", G],
-	["turn", j],
-	["hz", W],
-	["khz", U]
+const G = /* @__PURE__ */ new Map([
+	["cm", x],
+	["mm", O],
+	["q", Z],
+	["in", k],
+	["pc", L],
+	["pt", $],
+	["px", V],
+	["ms", U],
+	["s", q],
+	["deg", M],
+	["grad", T],
+	["rad", z],
+	["turn", R],
+	["hz", P],
+	["khz", W]
 ]);
 function convertUnit(e, n) {
 	if (!isTokenDimension(e)) return n;
 	if (!isTokenDimension(n)) return n;
 	const t = toLowerCaseAZ$1(e[4].unit), r = toLowerCaseAZ$1(n[4].unit);
 	if (t === r) return n;
-	const a = Y.get(r);
-	if (!a) return n;
-	const u = a.get(t);
+	const u = G.get(r);
 	if (!u) return n;
-	const o = u(n[4].value), i = [
+	const a = u.get(t);
+	if (!a) return n;
+	const i = a(n[4].value), o = [
 		u$1.Dimension,
 		"",
 		n[2],
 		n[3],
 		{
 			...n[4],
-			signCharacter: o < 0 ? "-" : void 0,
-			type: Number.isInteger(o) ? a$1.Integer : a$1.Number,
-			value: o
+			signCharacter: i < 0 ? "-" : void 0,
+			type: Number.isInteger(i) ? a$1.Integer : a$1.Number,
+			value: i
 		}
 	];
-	return mutateUnit(i, e[4].unit), i;
+	return mutateUnit(o, e[4].unit), o;
 }
 function toCanonicalUnit(e) {
 	if (!isTokenDimension(e)) return e;
-	const n = toLowerCaseAZ$1(e[4].unit), t = M[n];
+	const n = toLowerCaseAZ$1(e[4].unit), t = I[n];
 	if (n === t) return e;
-	const r = Y.get(n);
+	const r = G.get(n);
 	if (!r) return e;
-	const a = r.get(t);
-	if (!a) return e;
-	const u = a(e[4].value), o = [
+	const u = r.get(t);
+	if (!u) return e;
+	const a = u(e[4].value), i = [
 		u$1.Dimension,
 		"",
 		e[2],
 		e[3],
 		{
 			...e[4],
-			signCharacter: u < 0 ? "-" : void 0,
-			type: Number.isInteger(u) ? a$1.Integer : a$1.Number,
-			value: u
+			signCharacter: a < 0 ? "-" : void 0,
+			type: Number.isInteger(a) ? a$1.Integer : a$1.Number,
+			value: a
 		}
 	];
-	return mutateUnit(o, t), o;
+	return mutateUnit(i, t), i;
 }
 function addition(e, t) {
 	if (2 !== e.length) return -1;
 	const r = e[0].value;
-	let a = e[1].value;
-	if (isTokenNumber(r) && isTokenNumber(a)) {
-		const e = r[4].value + a[4].value;
+	let u = e[1].value;
+	if (isTokenNumber(r) && isTokenNumber(u)) {
+		const e = r[4].value + u[4].value;
 		return new TokenNode([
 			u$1.Number,
 			e.toString(),
 			r[2],
-			a[3],
+			u[3],
 			{
 				value: e,
-				type: r[4].type === a$1.Integer && a[4].type === a$1.Integer ? a$1.Integer : a$1.Number
+				type: r[4].type === a$1.Integer && u[4].type === a$1.Integer ? a$1.Integer : a$1.Number
 			}
 		]);
 	}
-	if (isTokenPercentage(r) && isTokenPercentage(a)) {
-		const e = r[4].value + a[4].value;
+	if (isTokenPercentage(r) && isTokenPercentage(u)) {
+		const e = r[4].value + u[4].value;
 		return new TokenNode([
 			u$1.Percentage,
 			e.toString() + "%",
 			r[2],
-			a[3],
+			u[3],
 			{ value: e }
 		]);
 	}
-	if (isTokenDimension(r) && isTokenDimension(a) && (a = convertUnit(r, a), toLowerCaseAZ$1(r[4].unit) === toLowerCaseAZ$1(a[4].unit))) {
-		const e = r[4].value + a[4].value;
+	if (isTokenDimension(r) && isTokenDimension(u) && (u = convertUnit(r, u), toLowerCaseAZ$1(r[4].unit) === toLowerCaseAZ$1(u[4].unit))) {
+		const e = r[4].value + u[4].value;
 		return new TokenNode([
 			u$1.Dimension,
 			e.toString() + r[4].unit,
 			r[2],
-			a[3],
+			u[3],
 			{
 				value: e,
-				type: r[4].type === a$1.Integer && a[4].type === a$1.Integer ? a$1.Integer : a$1.Number,
+				type: r[4].type === a$1.Integer && u[4].type === a$1.Integer ? a$1.Integer : a$1.Number,
 				unit: r[4].unit
 			}
 		]);
 	}
-	return (isTokenNumber(r) && (isTokenDimension(a) || isTokenPercentage(a)) || isTokenNumber(a) && (isTokenDimension(r) || isTokenPercentage(r))) && t.onParseError?.(new ParseErrorWithComponentValues(I.UnexpectedAdditionOfDimensionOrPercentageWithNumber, e)), -1;
+	return (isTokenNumber(r) && (isTokenDimension(u) || isTokenPercentage(u)) || isTokenNumber(u) && (isTokenDimension(r) || isTokenPercentage(r))) && t.onParseError?.(new ParseErrorWithComponentValues(S.UnexpectedAdditionOfDimensionOrPercentageWithNumber, e)), -1;
 }
 function division(e) {
 	if (2 !== e.length) return -1;
@@ -3033,18 +3044,36 @@ function isCalculation(e) {
 }
 function solve(e, n) {
 	if (-1 === e) return -1;
-	const r = [];
-	for (let a = 0; a < e.inputs.length; a++) {
-		const u = e.inputs[a];
-		if (isTokenNode(u)) {
-			r.push(u);
+	const r = [{
+		calculation: e,
+		inputs: [],
+		index: 0
+	}];
+	let u = -1;
+	for (; r.length;) {
+		const e = r[r.length - 1];
+		if (e.index < e.calculation.inputs.length) {
+			const n = e.calculation.inputs[e.index];
+			if (e.index++, isTokenNode(n)) {
+				e.inputs.push(n);
+				continue;
+			}
+			r.push({
+				calculation: n,
+				inputs: [],
+				index: 0
+			});
 			continue;
 		}
-		const o = solve(u, n);
-		if (-1 === o) return -1;
-		r.push(o);
+		const a = e.calculation.operation(e.inputs, n);
+		if (r.pop(), -1 === a) return -1;
+		if (!r.length) {
+			u = a;
+			break;
+		}
+		r[r.length - 1].inputs.push(a);
 	}
-	return e.operation(r, n);
+	return u;
 }
 function multiplication(e) {
 	if (2 !== e.length) return -1;
@@ -3113,19 +3142,19 @@ function multiplication(e) {
 	return -1;
 }
 function resolveGlobalsAndConstants(e, r) {
-	for (let a = 0; a < e.length; a++) {
-		const u = e[a];
-		if (!isTokenNode(u)) continue;
-		const o = u.value;
-		if (!isTokenIdent(o)) continue;
-		const i = toLowerCaseAZ$1(o[4].value);
-		switch (i) {
+	for (let u = 0; u < e.length; u++) {
+		const a = e[u];
+		if (!isTokenNode(a)) continue;
+		const i = a.value;
+		if (!isTokenIdent(i)) continue;
+		const o = toLowerCaseAZ$1(i[4].value);
+		switch (o) {
 			case "e":
-				e.splice(a, 1, new TokenNode([
+				e.splice(u, 1, new TokenNode([
 					u$1.Number,
 					Math.E.toString(),
-					o[2],
-					o[3],
+					i[2],
+					i[3],
 					{
 						value: Math.E,
 						type: a$1.Number
@@ -3133,11 +3162,11 @@ function resolveGlobalsAndConstants(e, r) {
 				]));
 				break;
 			case "pi":
-				e.splice(a, 1, new TokenNode([
+				e.splice(u, 1, new TokenNode([
 					u$1.Number,
 					Math.PI.toString(),
-					o[2],
-					o[3],
+					i[2],
+					i[3],
 					{
 						value: Math.PI,
 						type: a$1.Number
@@ -3145,11 +3174,11 @@ function resolveGlobalsAndConstants(e, r) {
 				]));
 				break;
 			case "infinity":
-				e.splice(a, 1, new TokenNode([
+				e.splice(u, 1, new TokenNode([
 					u$1.Number,
 					"infinity",
-					o[2],
-					o[3],
+					i[2],
+					i[3],
 					{
 						value: 1 / 0,
 						type: a$1.Number
@@ -3157,11 +3186,11 @@ function resolveGlobalsAndConstants(e, r) {
 				]));
 				break;
 			case "-infinity":
-				e.splice(a, 1, new TokenNode([
+				e.splice(u, 1, new TokenNode([
 					u$1.Number,
 					"-infinity",
-					o[2],
-					o[3],
+					i[2],
+					i[3],
 					{
 						value: -1 / 0,
 						type: a$1.Number
@@ -3169,20 +3198,20 @@ function resolveGlobalsAndConstants(e, r) {
 				]));
 				break;
 			case "nan":
-				e.splice(a, 1, new TokenNode([
+				e.splice(u, 1, new TokenNode([
 					u$1.Number,
 					"NaN",
-					o[2],
-					o[3],
+					i[2],
+					i[3],
 					{
 						value: NaN,
 						type: a$1.Number
 					}
 				]));
 				break;
-			default: if (r.has(i)) {
-				const t = r.get(i);
-				e.splice(a, 1, new TokenNode(t));
+			default: if (r.has(o)) {
+				const t = r.get(o);
+				e.splice(u, 1, new TokenNode(t));
 			}
 		}
 	}
@@ -3197,13 +3226,13 @@ function resultToCalculation(e, n, t) {
 	return isTokenDimension(n) ? dimensionToCalculation(e, n[4].unit, t) : isTokenPercentage(n) ? percentageToCalculation(e, t) : isTokenNumber(n) ? numberToCalculation(e, t) : -1;
 }
 function dimensionToCalculation(e, t, r) {
-	const a = e.tokens();
+	const u = e.tokens();
 	return {
 		inputs: [new TokenNode([
 			u$1.Dimension,
 			r.toString() + t,
-			a[0][2],
-			a[a.length - 1][3],
+			u[0][2],
+			u[u.length - 1][3],
 			{
 				value: r,
 				type: Number.isInteger(r) ? a$1.Integer : a$1.Number,
@@ -3268,9 +3297,9 @@ function arrayOfSameNumeric(e) {
 	if (isTokenDimension(n)) {
 		const t = toLowerCaseAZ$1(n[4].unit);
 		for (let r = 1; r < e.length; r++) {
-			const a = e[r];
-			if (n[0] !== a[0]) return !1;
-			if (t !== toLowerCaseAZ$1(a[4].unit)) return !1;
+			const u = e[r];
+			if (n[0] !== u[0]) return !1;
+			if (t !== toLowerCaseAZ$1(u[4].unit)) return !1;
 		}
 		return !0;
 	}
@@ -3286,26 +3315,28 @@ function twoOfSameNumeric(e, n) {
 function solveATan2(e, n, t) {
 	const r = n.value;
 	if (!isDimensionOrNumber(r)) return -1;
-	const a = convertUnit(r, t.value);
-	if (!twoOfSameNumeric(r, a)) return -1;
-	return dimensionToCalculation(e, "rad", Math.atan2(r[4].value, a[4].value));
+	const u = convertUnit(r, t.value);
+	if (!twoOfSameNumeric(r, u)) return -1;
+	return dimensionToCalculation(e, "rad", Math.atan2(r[4].value, u[4].value));
 }
 function solveAbs(e, n, t) {
 	const r = n.value;
 	if (!isTokenNumeric(r)) return -1;
+	if (Number.isNaN(r[4].value)) return resultToCalculation(e, r, NaN);
 	if (!t.rawPercentages && isTokenPercentage(r)) return -1;
 	return resultToCalculation(e, r, Math.abs(r[4].value));
 }
-function solveClamp(e, n, r, a, u) {
-	if (!isTokenNode(n) || !isTokenNode(r) || !isTokenNode(a)) return -1;
-	const o = n.value;
-	if (!isTokenNumeric(o)) return -1;
-	if (!u.rawPercentages && isTokenPercentage(o)) return -1;
-	const i = convertUnit(o, r.value);
-	if (!twoOfSameNumeric(o, i)) return -1;
-	const l = convertUnit(o, a.value);
-	if (!twoOfSameNumeric(o, l)) return -1;
-	return resultToCalculation(e, o, Math.max(o[4].value, Math.min(i[4].value, l[4].value)));
+function solveClamp(e, n, r, u, a) {
+	if (!isTokenNode(n) || !isTokenNode(r) || !isTokenNode(u)) return -1;
+	const i = n.value;
+	if (!isTokenNumeric(i)) return -1;
+	const o = convertUnit(i, r.value);
+	if (!twoOfSameNumeric(i, o)) return -1;
+	const l = convertUnit(i, u.value);
+	if (!twoOfSameNumeric(i, l)) return -1;
+	if (Number.isNaN(i[4].value) || Number.isNaN(o[4].value) || Number.isNaN(l[4].value)) return resultToCalculation(e, i, NaN);
+	if (!a.rawPercentages && isTokenPercentage(i)) return -1;
+	return resultToCalculation(e, i, Math.max(i[4].value, Math.min(o[4].value, l[4].value)));
 }
 function solveCos(e, n) {
 	const t = n.value;
@@ -3314,13 +3345,13 @@ function solveCos(e, n) {
 	if (isTokenDimension(t)) switch (t[4].unit.toLowerCase()) {
 		case "rad": break;
 		case "deg":
-			r = P.get("rad")(t[4].value);
+			r = M.get("rad")(t[4].value);
 			break;
 		case "grad":
-			r = k.get("rad")(t[4].value);
+			r = T.get("rad")(t[4].value);
 			break;
 		case "turn":
-			r = j.get("rad")(t[4].value);
+			r = R.get("rad")(t[4].value);
 			break;
 		default: return -1;
 	}
@@ -3333,59 +3364,64 @@ function solveExp(e, n) {
 }
 function solveHypot(e, n, r) {
 	if (!n.every(isTokenNode)) return -1;
-	const a = n[0].value;
-	if (!isTokenNumeric(a)) return -1;
-	if (!r.rawPercentages && isTokenPercentage(a)) return -1;
-	const u = n.map((e) => convertUnit(a, e.value));
-	if (!arrayOfSameNumeric(u)) return -1;
-	const o = u.map((e) => e[4].value);
-	return resultToCalculation(e, a, Math.hypot(...o));
+	const u = n[0].value;
+	if (!isTokenNumeric(u)) return -1;
+	const a = n.map((e) => convertUnit(u, e.value));
+	if (!arrayOfSameNumeric(a)) return -1;
+	if (a.some((e) => Number.isNaN(e[4].value))) return resultToCalculation(e, u, NaN);
+	if (!r.rawPercentages && isTokenPercentage(u)) return -1;
+	const i = a.map((e) => e[4].value);
+	if (i.some(Number.isNaN)) return resultToCalculation(e, u, NaN);
+	return resultToCalculation(e, u, Math.hypot(...i));
 }
 function solveMax(e, n, r) {
 	if (!n.every(isTokenNode)) return -1;
-	const a = n[0].value;
-	if (!isTokenNumeric(a)) return -1;
-	if (!r.rawPercentages && isTokenPercentage(a)) return -1;
-	const u = n.map((e) => convertUnit(a, e.value));
-	if (!arrayOfSameNumeric(u)) return -1;
-	const o = u.map((e) => e[4].value);
-	return resultToCalculation(e, a, Math.max(...o));
+	const u = n[0].value;
+	if (!isTokenNumeric(u)) return -1;
+	const a = n.map((e) => convertUnit(u, e.value));
+	if (!arrayOfSameNumeric(a)) return -1;
+	if (a.some((e) => Number.isNaN(e[4].value))) return resultToCalculation(e, u, NaN);
+	if (!r.rawPercentages && isTokenPercentage(u)) return -1;
+	const i = a.map((e) => e[4].value);
+	return resultToCalculation(e, u, Math.max(...i));
 }
 function solveMin(e, n, r) {
 	if (!n.every(isTokenNode)) return -1;
-	const a = n[0].value;
-	if (!isTokenNumeric(a)) return -1;
-	if (!r.rawPercentages && isTokenPercentage(a)) return -1;
-	const u = n.map((e) => convertUnit(a, e.value));
-	if (!arrayOfSameNumeric(u)) return -1;
-	const o = u.map((e) => e[4].value);
-	return resultToCalculation(e, a, Math.min(...o));
+	const u = n[0].value;
+	if (!isTokenNumeric(u)) return -1;
+	const a = n.map((e) => convertUnit(u, e.value));
+	if (!arrayOfSameNumeric(a)) return -1;
+	if (a.some((e) => Number.isNaN(e[4].value))) return resultToCalculation(e, u, NaN);
+	if (!r.rawPercentages && isTokenPercentage(u)) return -1;
+	const i = a.map((e) => e[4].value);
+	return resultToCalculation(e, u, Math.min(...i));
 }
 function solveMod(e, n, t) {
 	const r = n.value;
 	if (!isTokenNumeric(r)) return -1;
-	const a = convertUnit(r, t.value);
-	if (!twoOfSameNumeric(r, a)) return -1;
-	let u;
-	return u = 0 === a[4].value ? NaN : Number.isFinite(r[4].value) && (Number.isFinite(a[4].value) || (a[4].value !== Number.POSITIVE_INFINITY || r[4].value !== Number.NEGATIVE_INFINITY && !Object.is(0 * r[4].value, -0)) && (a[4].value !== Number.NEGATIVE_INFINITY || r[4].value !== Number.POSITIVE_INFINITY && !Object.is(0 * r[4].value, 0))) ? Number.isFinite(a[4].value) ? (r[4].value % a[4].value + a[4].value) % a[4].value : r[4].value : NaN, resultToCalculation(e, r, u);
+	const u = convertUnit(r, t.value);
+	if (!twoOfSameNumeric(r, u)) return -1;
+	let a;
+	return a = Number.isNaN(r[4].value) || Number.isNaN(u[4].value) || 0 === u[4].value ? NaN : Number.isFinite(r[4].value) && (Number.isFinite(u[4].value) || (u[4].value !== Number.POSITIVE_INFINITY || r[4].value !== Number.NEGATIVE_INFINITY && !Object.is(0 * r[4].value, -0)) && (u[4].value !== Number.NEGATIVE_INFINITY || r[4].value !== Number.POSITIVE_INFINITY && !Object.is(0 * r[4].value, 0))) ? Number.isFinite(u[4].value) ? (r[4].value % u[4].value + u[4].value) % u[4].value : r[4].value : NaN, resultToCalculation(e, r, a);
 }
 function solvePow(e, n, t) {
-	const r = n.value, a = t.value;
+	const r = n.value, u = t.value;
 	if (!isTokenNumber(r)) return -1;
-	if (!twoOfSameNumeric(r, a)) return -1;
-	return numberToCalculation(e, Math.pow(r[4].value, a[4].value));
+	if (!twoOfSameNumeric(r, u)) return -1;
+	if (Number.isNaN(r[4].value) || Number.isNaN(u[4].value)) return numberToCalculation(e, NaN);
+	return numberToCalculation(e, Math.pow(r[4].value, u[4].value));
 }
 function solveRem(e, n, t) {
 	const r = n.value;
 	if (!isTokenNumeric(r)) return -1;
-	const a = convertUnit(r, t.value);
-	if (!twoOfSameNumeric(r, a)) return -1;
-	let u;
-	return u = 0 === a[4].value ? NaN : Number.isFinite(r[4].value) ? Number.isFinite(a[4].value) ? r[4].value % a[4].value : r[4].value : NaN, resultToCalculation(e, r, u);
+	const u = convertUnit(r, t.value);
+	if (!twoOfSameNumeric(r, u)) return -1;
+	let a;
+	return a = Number.isNaN(r[4].value) || Number.isNaN(u[4].value) || 0 === u[4].value ? NaN : Number.isFinite(r[4].value) ? Number.isFinite(u[4].value) ? r[4].value % u[4].value : r[4].value : NaN, resultToCalculation(e, r, a);
 }
 function snapAsBorderWidth(e, n, t) {
 	if (!isTokenDimension(n)) return -1;
-	const r = t.devicePixelLength ?? 1, a = [
+	const r = t.devicePixelLength ?? 1, u = [
 		u$1.Dimension,
 		`${r}px`,
 		n[2],
@@ -3395,67 +3431,69 @@ function snapAsBorderWidth(e, n, t) {
 			type: a$1.Integer,
 			unit: "px"
 		}
-	], u = convertUnit(a, n);
-	if (!twoOfSameNumeric(u, a)) return -1;
-	if (Number.isInteger(u[4].value / r)) return resultToCalculation(e, n, n[4].value);
-	if (u[4].value > 0) {
-		if (u[4].value < r) return resultToCalculation(e, n, convertUnit(n, a)[4].value);
-		const t = Math.floor(u[4].value / a[4].value) * a[4].value;
-		return u[4].value = t, resultToCalculation(e, n, convertUnit(n, u)[4].value);
+	], a = convertUnit(u, n);
+	if (!twoOfSameNumeric(a, u)) return -1;
+	if (Number.isInteger(a[4].value / r)) return resultToCalculation(e, n, n[4].value);
+	if (a[4].value > 0) {
+		if (a[4].value < r) return resultToCalculation(e, n, convertUnit(n, u)[4].value);
+		const t = Math.floor(a[4].value / u[4].value) * u[4].value;
+		return a[4].value = t, resultToCalculation(e, n, convertUnit(n, a)[4].value);
 	}
-	if (Math.abs(u[4].value) < r) return resultToCalculation(e, n, -1 * convertUnit(n, a)[4].value);
-	const o = Math.ceil(u[4].value / a[4].value) * a[4].value;
-	return u[4].value = o, resultToCalculation(e, n, convertUnit(n, u)[4].value);
+	if (Math.abs(a[4].value) < r) return resultToCalculation(e, n, -1 * convertUnit(n, u)[4].value);
+	const i = Math.ceil(a[4].value / u[4].value) * u[4].value;
+	return a[4].value = i, resultToCalculation(e, n, convertUnit(n, a)[4].value);
 }
-function solveRound(e, n, t, r, a) {
-	const u = t.value;
-	if (!isTokenNumeric(u)) return -1;
-	if ("line-width" === n && !isTokenDimension(u)) return -1;
-	if (!a.rawPercentages && isTokenPercentage(u)) return -1;
-	const o = convertUnit(u, r.value);
-	if (!twoOfSameNumeric(u, o)) return -1;
-	let i;
-	if (0 === o[4].value) i = NaN;
-	else if (Number.isFinite(u[4].value) || Number.isFinite(o[4].value)) if (!Number.isFinite(u[4].value) && Number.isFinite(o[4].value)) i = u[4].value;
-	else if (Number.isFinite(u[4].value) && !Number.isFinite(o[4].value)) switch (n) {
+function solveRound(e, n, t, r, u) {
+	const a = t.value;
+	if (!isTokenNumeric(a)) return -1;
+	if ("line-width" === n && !isTokenDimension(a)) return -1;
+	const i = convertUnit(a, r.value);
+	if (!twoOfSameNumeric(a, i)) return -1;
+	if (Number.isNaN(a[4].value) || Number.isNaN(i[4].value)) return resultToCalculation(e, a, NaN);
+	if (!u.rawPercentages && isTokenPercentage(a)) return -1;
+	let o;
+	if (0 === i[4].value) o = NaN;
+	else if (Number.isFinite(a[4].value) || Number.isFinite(i[4].value)) if (!Number.isFinite(a[4].value) && Number.isFinite(i[4].value)) o = a[4].value;
+	else if (Number.isFinite(a[4].value) && !Number.isFinite(i[4].value)) switch (n) {
 		case "down":
-			i = u[4].value < 0 ? -1 / 0 : Object.is(-0, 0 * u[4].value) ? -0 : 0;
+			o = a[4].value < 0 ? -1 / 0 : Object.is(-0, 0 * a[4].value) ? -0 : 0;
 			break;
 		case "up":
-			i = u[4].value > 0 ? 1 / 0 : Object.is(0, 0 * u[4].value) ? 0 : -0;
+			o = a[4].value > 0 ? 1 / 0 : Object.is(0, 0 * a[4].value) ? 0 : -0;
 			break;
-		default: i = Object.is(0, 0 * u[4].value) ? 0 : -0;
+		default: o = Object.is(0, 0 * a[4].value) ? 0 : -0;
 	}
 	else switch (n) {
 		case "down":
-			i = Math.floor(u[4].value / o[4].value) * o[4].value;
+			o = (i[4].value > 0 ? Math.floor : Math.ceil)(a[4].value / i[4].value) * i[4].value;
 			break;
 		case "up":
-			i = Math.ceil(u[4].value / o[4].value) * o[4].value;
+			o = (i[4].value > 0 ? Math.ceil : Math.floor)(a[4].value / i[4].value) * i[4].value;
 			break;
 		case "to-zero":
-			i = Math.trunc(u[4].value / o[4].value) * o[4].value;
+			o = Math.trunc(a[4].value / i[4].value) * i[4].value;
 			break;
 		default: {
-			let t = Math.floor(u[4].value / o[4].value) * o[4].value, r = Math.ceil(u[4].value / o[4].value) * o[4].value;
+			let t = Math.floor(a[4].value / i[4].value) * i[4].value, r = Math.ceil(a[4].value / i[4].value) * i[4].value;
 			if (t > r) {
 				const e = t;
 				t = r, r = e;
 			}
-			const l = Math.abs(u[4].value - t), c = Math.abs(u[4].value - r);
-			if (i = "line-width" === n && u[4].value >= 0 && (0 === r || 0 === t) ? 0 !== r ? r : t : l === c ? r : l < c ? t : r, "line-width" === n) {
-				const n = solve(resultToCalculation(e, u, i), a);
-				return -1 === n ? -1 : snapAsBorderWidth(e, n.value, a);
+			const l = Math.abs(a[4].value - t), c = Math.abs(a[4].value - r);
+			if (o = "line-width" !== n || 0 !== r && 0 !== t ? l === c ? r : l < c ? t : r : 0 !== r ? r : t, "line-width" === n) {
+				const n = solve(resultToCalculation(e, a, o), u);
+				return -1 === n ? -1 : snapAsBorderWidth(e, n.value, u);
 			}
 			break;
 		}
 	}
-	else i = NaN;
-	return resultToCalculation(e, u, i);
+	else o = NaN;
+	return resultToCalculation(e, a, o);
 }
 function solveSign(e, n, t) {
 	const r = n.value;
 	if (!isTokenNumeric(r)) return -1;
+	if (Number.isNaN(r[4].value)) return numberToCalculation(e, NaN);
 	if (!t.rawPercentages && isTokenPercentage(r)) return -1;
 	return numberToCalculation(e, Math.sign(r[4].value));
 }
@@ -3466,13 +3504,13 @@ function solveSin(e, n) {
 	if (isTokenDimension(t)) switch (toLowerCaseAZ$1(t[4].unit)) {
 		case "rad": break;
 		case "deg":
-			r = P.get("rad")(t[4].value);
+			r = M.get("rad")(t[4].value);
 			break;
 		case "grad":
-			r = k.get("rad")(t[4].value);
+			r = T.get("rad")(t[4].value);
 			break;
 		case "turn":
-			r = j.get("rad")(t[4].value);
+			r = R.get("rad")(t[4].value);
 			break;
 		default: return -1;
 	}
@@ -3487,154 +3525,165 @@ function solveTan(e, n) {
 	const t = n.value;
 	if (!isDimensionOrNumber(t)) return -1;
 	const r = t[4].value;
-	let a = 0, u = t[4].value;
+	let u = 0, a = t[4].value;
 	if (isTokenDimension(t)) switch (toLowerCaseAZ$1(t[4].unit)) {
 		case "rad":
-			a = G.get("deg")(r);
+			u = z.get("deg")(r);
 			break;
 		case "deg":
-			a = r, u = P.get("rad")(r);
+			u = r, a = M.get("rad")(r);
 			break;
 		case "grad":
-			a = k.get("deg")(r), u = k.get("rad")(r);
+			u = T.get("deg")(r), a = T.get("rad")(r);
 			break;
 		case "turn":
-			a = j.get("deg")(r), u = j.get("rad")(r);
+			u = R.get("deg")(r), a = R.get("rad")(r);
 			break;
 		default: return -1;
 	}
-	const o = a / 90;
-	return u = a % 90 == 0 && o % 2 != 0 ? o > 0 ? 1 / 0 : -1 / 0 : Math.tan(u), numberToCalculation(e, u);
+	const i = u / 90;
+	return a = u % 90 == 0 && i % 2 != 0 ? (i % 4 + 4) % 4 == 1 ? 1 / 0 : -1 / 0 : Math.tan(a), numberToCalculation(e, a);
 }
 function subtraction(e, t) {
 	if (2 !== e.length) return -1;
 	const r = e[0].value;
-	let a = e[1].value;
-	if (isTokenNumber(r) && isTokenNumber(a)) {
-		const e = r[4].value - a[4].value;
+	let u = e[1].value;
+	if (isTokenNumber(r) && isTokenNumber(u)) {
+		const e = r[4].value - u[4].value;
 		return new TokenNode([
 			u$1.Number,
 			e.toString(),
 			r[2],
-			a[3],
+			u[3],
 			{
 				value: e,
-				type: r[4].type === a$1.Integer && a[4].type === a$1.Integer ? a$1.Integer : a$1.Number
+				type: r[4].type === a$1.Integer && u[4].type === a$1.Integer ? a$1.Integer : a$1.Number
 			}
 		]);
 	}
-	if (isTokenPercentage(r) && isTokenPercentage(a)) {
-		const e = r[4].value - a[4].value;
+	if (isTokenPercentage(r) && isTokenPercentage(u)) {
+		const e = r[4].value - u[4].value;
 		return new TokenNode([
 			u$1.Percentage,
 			e.toString() + "%",
 			r[2],
-			a[3],
+			u[3],
 			{ value: e }
 		]);
 	}
-	if (isTokenDimension(r) && isTokenDimension(a) && (a = convertUnit(r, a), toLowerCaseAZ$1(r[4].unit) === toLowerCaseAZ$1(a[4].unit))) {
-		const e = r[4].value - a[4].value;
+	if (isTokenDimension(r) && isTokenDimension(u) && (u = convertUnit(r, u), toLowerCaseAZ$1(r[4].unit) === toLowerCaseAZ$1(u[4].unit))) {
+		const e = r[4].value - u[4].value;
 		return new TokenNode([
 			u$1.Dimension,
 			e.toString() + r[4].unit,
 			r[2],
-			a[3],
+			u[3],
 			{
 				value: e,
-				type: r[4].type === a$1.Integer && a[4].type === a$1.Integer ? a$1.Integer : a$1.Number,
+				type: r[4].type === a$1.Integer && u[4].type === a$1.Integer ? a$1.Integer : a$1.Number,
 				unit: r[4].unit
 			}
 		]);
 	}
-	return (isTokenNumber(r) && (isTokenDimension(a) || isTokenPercentage(a)) || isTokenNumber(a) && (isTokenDimension(r) || isTokenPercentage(r))) && t.onParseError?.(new ParseErrorWithComponentValues(I.UnexpectedSubtractionOfDimensionOrPercentageWithNumber, e)), -1;
+	return (isTokenNumber(r) && (isTokenDimension(u) || isTokenPercentage(u)) || isTokenNumber(u) && (isTokenDimension(r) || isTokenPercentage(r))) && t.onParseError?.(new ParseErrorWithComponentValues(S.UnexpectedSubtractionOfDimensionOrPercentageWithNumber, e)), -1;
 }
 function solveLog(e, n) {
 	if (1 === n.length) {
 		const r = n[0];
 		if (!r || !isTokenNode(r)) return -1;
-		const a = r.value;
-		if (!isTokenNumber(a)) return -1;
-		return numberToCalculation(e, Math.log(a[4].value));
+		const u = r.value;
+		if (!isTokenNumber(u)) return -1;
+		return numberToCalculation(e, Math.log(u[4].value));
 	}
 	if (2 === n.length) {
 		const r = n[0];
 		if (!r || !isTokenNode(r)) return -1;
-		const a = r.value;
-		if (!isTokenNumber(a)) return -1;
-		const u = n[1];
-		if (!u || !isTokenNode(u)) return -1;
-		const o = u.value;
-		if (!isTokenNumber(o)) return -1;
-		return numberToCalculation(e, Math.log(a[4].value) / Math.log(o[4].value));
+		const u = r.value;
+		if (!isTokenNumber(u)) return -1;
+		const a = n[1];
+		if (!a || !isTokenNode(a)) return -1;
+		const i = a.value;
+		if (!isTokenNumber(i)) return -1;
+		if (Number.isNaN(u[4].value) || Number.isNaN(i[4].value)) return numberToCalculation(e, NaN);
+		if (1 === i[4].value || i[4].value <= 0) return numberToCalculation(e, NaN);
+		if (1 === u[4].value) return numberToCalculation(e, 0);
+		return numberToCalculation(e, Math.log(u[4].value) / Math.log(i[4].value));
 	}
 	return -1;
 }
-const _ = /^none$/i;
+const j = /^none$/i;
 function isNone(e) {
 	if (Array.isArray(e)) {
-		const n = e.filter((e) => !(isWhitespaceNode(e) && isCommentNode(e)));
+		const n = e.filter((e) => !isWhiteSpaceOrCommentNode(e));
 		return 1 === n.length && isNone(n[0]);
 	}
 	if (!isTokenNode(e)) return !1;
 	const n = e.value;
-	return !!isTokenIdent(n) && _.test(n[4].value);
-}
-const H = String.fromCodePoint(0);
-function solveRandom(e, n, t, r, a, u) {
-	if (-1 === n.fixed && !u.randomCaching) return -1;
-	u.randomCaching || (u.randomCaching = {
-		propertyName: "",
-		propertyN: 0,
-		elementID: "",
-		documentID: ""
-	}), u.randomCaching && !u.randomCaching.propertyN && (u.randomCaching.propertyN = 0);
-	const o = t.value;
-	if (!isTokenNumeric(o)) return -1;
-	const i = convertUnit(o, r.value);
-	if (!twoOfSameNumeric(o, i)) return -1;
+	return !!isTokenIdent(n) && j.test(n[4].value);
+}
+function patchPrecision(e, n = 13) {
+	if (-1 === e) return -1;
+	if (n <= 0) return e;
+	if (isFunctionNode(e)) return e;
+	const t = e.value;
+	if (!isTokenNumeric(t)) return e;
+	if (shouldSkipPrecisionRounding(t[4].value)) return e;
+	const r = roundToPrecision(t[4].value, n).toString();
+	return isTokenNumber(t) ? t[1] = r : isTokenPercentage(t) ? t[1] = r + "%" : isTokenDimension(t) && (t[1] = r + t[4].unit), e;
+}
+function shouldSkipPrecisionRounding(e) {
+	if (!Number.isFinite(e) || 0 === e) return !0;
+	if (Number.isInteger(e)) return !0;
+	const n = e.toString();
+	return n.includes("e") || n.includes("E");
+}
+function roundToPrecision(e, n = 13) {
+	return shouldSkipPrecisionRounding(e) ? e : Number(e.toFixed(n));
+}
+const Y = String.fromCodePoint(0);
+function solveRandom(e, n, t, r, u, a) {
+	if (-1 === n.fixed && !a.randomCaching) return -1;
+	const i = t.value;
+	if (!isTokenNumeric(i)) return -1;
+	const o = convertUnit(i, r.value);
+	if (!twoOfSameNumeric(i, o)) return -1;
 	let l = null;
-	if (a && (l = convertUnit(o, a.value), !twoOfSameNumeric(o, l))) return -1;
-	if (!Number.isFinite(o[4].value)) return resultToCalculation(e, o, NaN);
-	if (!Number.isFinite(i[4].value)) return resultToCalculation(e, o, NaN);
-	if (!Number.isFinite(i[4].value - o[4].value)) return resultToCalculation(e, o, NaN);
-	if (l && !Number.isFinite(l[4].value)) return resultToCalculation(e, o, o[4].value);
-	const c = -1 === n.fixed ? sfc32(crc32([
+	if (u && (l = convertUnit(i, u.value), !twoOfSameNumeric(i, l))) return -1;
+	if (Number.isNaN(i[4].value) || Number.isNaN(o[4].value)) return resultToCalculation(e, i, NaN);
+	if (!Number.isFinite(i[4].value)) return resultToCalculation(e, i, i[4].value);
+	if (!Number.isFinite(o[4].value) || !Number.isFinite(o[4].value - i[4].value)) return resultToCalculation(e, i, NaN);
+	if (l) {
+		if (Number.isNaN(l[4].value)) return resultToCalculation(e, i, NaN);
+		if (!Number.isFinite(l[4].value)) return resultToCalculation(e, i, i[4].value);
+	}
+	const c = -1 !== n.fixed ? () => n.fixed : (a.randomCaching.propertyN || (a.randomCaching.propertyN = 0), sfc32(crc32([
 		n.dashedIdent ? n.dashedIdent : "",
-		n.elementScoped ? u.randomCaching.elementID : "",
-		n.propertyScoped || n.propertyIndexScoped ? u.randomCaching.propertyName : "",
-		n.propertyIndexScoped ? u.randomCaching.propertyN : "",
-		u.randomCaching.documentID
-	].join(H))) : () => n.fixed;
-	let s = o[4].value, v = i[4].value;
-	if (s > v && ([s, v] = [v, s]), l && (l[4].value <= 0 || Math.abs(s - v) / l[4].value > 1e10) && (l = null), l) {
-		const n = Math.max(l[4].value / 1e3, 1e-9), t = [s];
-		let r = 0;
-		for (;;) {
-			r += l[4].value;
-			const e = s + r;
-			if (!(e + n < v)) {
-				t.push(v);
-				break;
-			}
-			if (t.push(e), e + l[4].value - n > v) break;
-		}
-		const a = c();
-		return resultToCalculation(e, o, Number(t[Math.floor(t.length * a)].toFixed(5)));
-	}
-	const f = c();
-	return resultToCalculation(e, o, Number((f * (v - s) + s).toFixed(5)));
+		n.elementScoped ? a.randomCaching.elementID : "",
+		n.propertyScoped || n.propertyIndexScoped ? a.randomCaching.propertyName : "",
+		n.propertyIndexScoped ? a.randomCaching.propertyN : "",
+		a.randomCaching.documentID
+	].join(Y)))), s = i[4].value;
+	let v = o[4].value;
+	if (v < s && (v = s), l && (l[4].value <= 0 || Math.abs(s - v) / l[4].value > 1e10) && (l = null), l) {
+		const n = l[4].value, t = Math.max(n / 1e3, 1e-9);
+		let r = Math.floor((v - s) / n);
+		Math.abs(s + r * n - v) >= t && Math.abs(s + (r + 1) * n - v) < t && (r += 1);
+		const u = Math.floor(c() * (r + 1));
+		let a = s + u * n;
+		return u === r && Math.abs(a - v) < t && (a = v), resultToCalculation(e, i, roundToPrecision(a, 5));
+	}
+	return resultToCalculation(e, i, roundToPrecision(c() * (v - s) + s, 5));
 }
 function sfc32(e = .34944106645296036, n = .19228640875738723, t = .8784393832007205, r = .04850964319275053) {
 	return () => {
-		const a = ((e |= 0) + (n |= 0) | 0) + (r |= 0) | 0;
-		return r = r + 1 | 0, e = n ^ n >>> 9, n = (t |= 0) + (t << 3) | 0, t = (t = t << 21 | t >>> 11) + a | 0, (a >>> 0) / 4294967296;
+		const u = ((e |= 0) + (n |= 0) | 0) + (r |= 0) | 0;
+		return r = r + 1 | 0, e = n ^ n >>> 9, n = (t |= 0) + (t << 3) | 0, t = (t = t << 21 | t >>> 11) + u | 0, (u >>> 0) / 4294967296;
 	};
 }
 function crc32(e) {
 	let n, t, r = 0;
 	r ^= -1;
-	for (let a = 0, u = e.length; a < u; a++) t = 255 & (r ^ e.charCodeAt(a)), n = Number("0x" + "00000000 77073096 EE0E612C 990951BA 076DC419 706AF48F E963A535 9E6495A3 0EDB8832 79DCB8A4 E0D5E91E 97D2D988 09B64C2B 7EB17CBD E7B82D07 90BF1D91 1DB71064 6AB020F2 F3B97148 84BE41DE 1ADAD47D 6DDDE4EB F4D4B551 83D385C7 136C9856 646BA8C0 FD62F97A 8A65C9EC 14015C4F 63066CD9 FA0F3D63 8D080DF5 3B6E20C8 4C69105E D56041E4 A2677172 3C03E4D1 4B04D447 D20D85FD A50AB56B 35B5A8FA 42B2986C DBBBC9D6 ACBCF940 32D86CE3 45DF5C75 DCD60DCF ABD13D59 26D930AC 51DE003A C8D75180 BFD06116 21B4F4B5 56B3C423 CFBA9599 B8BDA50F 2802B89E 5F058808 C60CD9B2 B10BE924 2F6F7C87 58684C11 C1611DAB B6662D3D 76DC4190 01DB7106 98D220BC EFD5102A 71B18589 06B6B51F 9FBFE4A5 E8B8D433 7807C9A2 0F00F934 9609A88E E10E9818 7F6A0DBB 086D3D2D 91646C97 E6635C01 6B6B51F4 1C6C6162 856530D8 F262004E 6C0695ED 1B01A57B 8208F4C1 F50FC457 65B0D9C6 12B7E950 8BBEB8EA FCB9887C 62DD1DDF 15DA2D49 8CD37CF3 FBD44C65 4DB26158 3AB551CE A3BC0074 D4BB30E2 4ADFA541 3DD895D7 A4D1C46D D3D6F4FB 4369E96A 346ED9FC AD678846 DA60B8D0 44042D73 33031DE5 AA0A4C5F DD0D7CC9 5005713C 270241AA BE0B1010 C90C2086 5768B525 206F85B3 B966D409 CE61E49F 5EDEF90E 29D9C998 B0D09822 C7D7A8B4 59B33D17 2EB40D81 B7BD5C3B C0BA6CAD EDB88320 9ABFB3B6 03B6E20C 74B1D29A EAD54739 9DD277AF 04DB2615 73DC1683 E3630B12 94643B84 0D6D6A3E 7A6A5AA8 E40ECF0B 9309FF9D 0A00AE27 7D079EB1 F00F9344 8708A3D2 1E01F268 6906C2FE F762575D 806567CB 196C3671 6E6B06E7 FED41B76 89D32BE0 10DA7A5A 67DD4ACC F9B9DF6F 8EBEEFF9 17B7BE43 60B08ED5 D6D6A3E8 A1D1937E 38D8C2C4 4FDFF252 D1BB67F1 A6BC5767 3FB506DD 48B2364B D80D2BDA AF0A1B4C 36034AF6 41047A60 DF60EFC3 A867DF55 316E8EEF 4669BE79 CB61B38C BC66831A 256FD2A0 5268E236 CC0C7795 BB0B4703 220216B9 5505262F C5BA3BBE B2BD0B28 2BB45A92 5CB36A04 C2D7FFA7 B5D0CF31 2CD99E8B 5BDEAE1D 9B64C2B0 EC63F226 756AA39C 026D930A 9C0906A9 EB0E363F 72076785 05005713 95BF4A82 E2B87A14 7BB12BAE 0CB61B38 92D28E9B E5D5BE0D 7CDCEFB7 0BDBDF21 86D3D2D4 F1D4E242 68DDB3F8 1FDA836E 81BE16CD F6B9265B 6FB077E1 18B74777 88085AE6 FF0F6A70 66063BCA 11010B5C 8F659EFF F862AE69 616BFFD3 166CCF45 A00AE278 D70DD2EE 4E048354 3903B3C2 A7672661 D06016F7 4969474D 3E6E77DB AED16A4A D9D65ADC 40DF0B66 37D83BF0 A9BCAE53 DEBB9EC5 47B2CF7F 30B5FFE9 BDBDF21C CABAC28A 53B39330 24B4A3A6 BAD03605 CDD70693 54DE5729 23D967BF B3667A2E C4614AB8 5D681B02 2A6F2B94 B40BBE37 C30C8EA1 5A05DF1B 2D02EF8D".substring(9 * t, 9 * t + 8)), r = r >>> 8 ^ n;
+	for (let u = 0, a = e.length; u < a; u++) t = 255 & (r ^ e.charCodeAt(u)), n = Number("0x" + "00000000 77073096 EE0E612C 990951BA 076DC419 706AF48F E963A535 9E6495A3 0EDB8832 79DCB8A4 E0D5E91E 97D2D988 09B64C2B 7EB17CBD E7B82D07 90BF1D91 1DB71064 6AB020F2 F3B97148 84BE41DE 1ADAD47D 6DDDE4EB F4D4B551 83D385C7 136C9856 646BA8C0 FD62F97A 8A65C9EC 14015C4F 63066CD9 FA0F3D63 8D080DF5 3B6E20C8 4C69105E D56041E4 A2677172 3C03E4D1 4B04D447 D20D85FD A50AB56B 35B5A8FA 42B2986C DBBBC9D6 ACBCF940 32D86CE3 45DF5C75 DCD60DCF ABD13D59 26D930AC 51DE003A C8D75180 BFD06116 21B4F4B5 56B3C423 CFBA9599 B8BDA50F 2802B89E 5F058808 C60CD9B2 B10BE924 2F6F7C87 58684C11 C1611DAB B6662D3D 76DC4190 01DB7106 98D220BC EFD5102A 71B18589 06B6B51F 9FBFE4A5 E8B8D433 7807C9A2 0F00F934 9609A88E E10E9818 7F6A0DBB 086D3D2D 91646C97 E6635C01 6B6B51F4 1C6C6162 856530D8 F262004E 6C0695ED 1B01A57B 8208F4C1 F50FC457 65B0D9C6 12B7E950 8BBEB8EA FCB9887C 62DD1DDF 15DA2D49 8CD37CF3 FBD44C65 4DB26158 3AB551CE A3BC0074 D4BB30E2 4ADFA541 3DD895D7 A4D1C46D D3D6F4FB 4369E96A 346ED9FC AD678846 DA60B8D0 44042D73 33031DE5 AA0A4C5F DD0D7CC9 5005713C 270241AA BE0B1010 C90C2086 5768B525 206F85B3 B966D409 CE61E49F 5EDEF90E 29D9C998 B0D09822 C7D7A8B4 59B33D17 2EB40D81 B7BD5C3B C0BA6CAD EDB88320 9ABFB3B6 03B6E20C 74B1D29A EAD54739 9DD277AF 04DB2615 73DC1683 E3630B12 94643B84 0D6D6A3E 7A6A5AA8 E40ECF0B 9309FF9D 0A00AE27 7D079EB1 F00F9344 8708A3D2 1E01F268 6906C2FE F762575D 806567CB 196C3671 6E6B06E7 FED41B76 89D32BE0 10DA7A5A 67DD4ACC F9B9DF6F 8EBEEFF9 17B7BE43 60B08ED5 D6D6A3E8 A1D1937E 38D8C2C4 4FDFF252 D1BB67F1 A6BC5767 3FB506DD 48B2364B D80D2BDA AF0A1B4C 36034AF6 41047A60 DF60EFC3 A867DF55 316E8EEF 4669BE79 CB61B38C BC66831A 256FD2A0 5268E236 CC0C7795 BB0B4703 220216B9 5505262F C5BA3BBE B2BD0B28 2BB45A92 5CB36A04 C2D7FFA7 B5D0CF31 2CD99E8B 5BDEAE1D 9B64C2B0 EC63F226 756AA39C 026D930A 9C0906A9 EB0E363F 72076785 05005713 95BF4A82 E2B87A14 7BB12BAE 0CB61B38 92D28E9B E5D5BE0D 7CDCEFB7 0BDBDF21 86D3D2D4 F1D4E242 68DDB3F8 1FDA836E 81BE16CD F6B9265B 6FB077E1 18B74777 88085AE6 FF0F6A70 66063BCA 11010B5C 8F659EFF F862AE69 616BFFD3 166CCF45 A00AE278 D70DD2EE 4E048354 3903B3C2 A7672661 D06016F7 4969474D 3E6E77DB AED16A4A D9D65ADC 40DF0B66 37D83BF0 A9BCAE53 DEBB9EC5 47B2CF7F 30B5FFE9 BDBDF21C CABAC28A 53B39330 24B4A3A6 BAD03605 CDD70693 54DE5729 23D967BF B3667A2E C4614AB8 5D681B02 2A6F2B94 B40BBE37 C30C8EA1 5A05DF1B 2D02EF8D".substring(9 * t, 9 * t + 8)), r = r >>> 8 ^ n;
 	return (-1 ^ r) >>> 0;
 }
 function solveCalcMix(e, n) {
@@ -3645,27 +3694,27 @@ function solveCalcMix(e, n) {
 		percentage: e.percentage
 	}));
 	if (!arrayOfSameNumeric(r.map((e) => e.calcSum))) return -1;
-	const { items: a } = normalizeMixPercentages$1(r, !1), u = a.map((e) => e.calcSum[4].value * e.percentage / 100);
-	let o = 0;
-	for (let e = 0; e < u.length; e++) o += u[e];
-	return resultToCalculation(e, t, o);
+	const { items: u } = normalizeMixPercentages$1(r, !1), a = u.map((e) => e.calcSum[4].value * e.percentage / 100);
+	let i = 0;
+	for (let e = 0; e < a.length; e++) i += a[e];
+	return resultToCalculation(e, t, i);
 }
 function normalizeMixPercentages$1(e, n = !1) {
 	let t = 0, r = 0;
 	for (const n of e) n.percentage && (t += n.percentage), !1 === n.percentage && r++;
 	t = Math.min(100, t);
 	for (const n of e) !1 === n.percentage && (n.percentage = (100 - t) / r);
-	const a = e.slice();
-	let u = 0;
-	for (const e of a) u += e.percentage;
-	if (u > 100 || u > 0 && n) for (const e of a) e.percentage = e.percentage * (100 / u);
-	let o = 0;
-	return u < 100 && (o = 100 - u), {
-		items: a,
-		leftover: o
+	const u = e.slice();
+	let a = 0;
+	for (const e of u) a += e.percentage;
+	if (a > 100 || a > 0 && n) for (const e of u) e.percentage = e.percentage * (100 / a);
+	let i = 0;
+	return a < 100 && (i = 100 - a), {
+		items: u,
+		leftover: i
 	};
 }
-const J = /* @__PURE__ */ new Map([
+const _ = /* @__PURE__ */ new Map([
 	["abs", function abs(e, n, t) {
 		return singleNodeSolver(e, n, t, solveAbs);
 	}],
@@ -3687,16 +3736,16 @@ const J = /* @__PURE__ */ new Map([
 		if (-1 === r) return -1;
 		return solveCalcMix(e, r);
 	}],
-	["clamp", function clamp(r, a, o) {
-		const i = resolveGlobalsAndConstants([...r.value.filter((e) => !isWhiteSpaceOrCommentNode(e))], a), c = [], s = [], v = [];
+	["clamp", function clamp(u, a, o) {
+		const l = resolveGlobalsAndConstants([...u.value.filter((e) => !isWhiteSpaceOrCommentNode(e))], a), c = [], s = [], f = [];
 		{
 			let e = c;
-			for (let n = 0; n < i.length; n++) {
-				const r = i[n];
+			for (let n = 0; n < l.length; n++) {
+				const r = l[n];
 				if (isTokenNode(r) && isTokenComma(r.value)) {
-					if (e === v) return -1;
+					if (e === f) return -1;
 					if (e === s) {
-						e = v;
+						e = f;
 						continue;
 					}
 					if (e === c) {
@@ -3708,45 +3757,45 @@ const J = /* @__PURE__ */ new Map([
 				e.push(r);
 			}
 		}
-		const f = isNone(c), m = isNone(v);
-		if (f && m) return calc$1(calcWrapper(r, s), a, o);
-		const d = solve(calc$1(calcWrapper(r, s), a, o), o);
+		const p = isNone(c), m = isNone(f);
+		if (p && m) return calc$1(calcWrapper(u, s), a, o);
+		const d = solve(calc$1(calcWrapper(u, s), a, o), o);
 		if (-1 === d) return -1;
-		if (f) {
-			const t = solve(calc$1(calcWrapper(r, v), a, o), o);
-			return -1 === t ? -1 : solveMin((C = r, g = d, D = t, new FunctionNode([
+		if (p) {
+			const t = solve(calc$1(calcWrapper(u, f), a, o), o);
+			return -1 === t ? -1 : solveMin((N = u, C = d, g = t, new FunctionNode([
 				u$1.Function,
 				"min(",
-				C.name[2],
-				C.name[3],
+				N.name[2],
+				N.name[3],
 				{ value: "min" }
 			], [
 				u$1.CloseParen,
 				")",
-				C.endToken[2],
-				C.endToken[3],
+				N.endToken[2],
+				N.endToken[3],
 				void 0
 			], [
-				g,
+				C,
 				new TokenNode([
 					u$1.Comma,
 					",",
-					...sourceIndices(g),
+					...sourceIndices(C),
 					void 0
 				]),
-				D
+				g
 			])), [d, t], o);
 		}
 		if (m) {
-			const e = solve(calc$1(calcWrapper(r, c), a, o), o);
-			return -1 === e ? -1 : solveMax(maxWrapper(r, e, d), [e, d], o);
+			const e = solve(calc$1(calcWrapper(u, c), a, o), o);
+			return -1 === e ? -1 : solveMax(maxWrapper(u, e, d), [e, d], o);
 		}
-		var C, g, D;
-		const h = solve(calc$1(calcWrapper(r, c), a, o), o);
+		var N, C, g;
+		const h = solve(calc$1(calcWrapper(u, c), a, o), o);
 		if (-1 === h) return -1;
-		const N = solve(calc$1(calcWrapper(r, v), a, o), o);
-		if (-1 === N) return -1;
-		return solveClamp(r, h, d, N, o);
+		const b = solve(calc$1(calcWrapper(u, f), a, o), o);
+		if (-1 === b) return -1;
+		return solveClamp(u, h, d, b, o);
 	}],
 	["cos", function cos(e, n, t) {
 		return singleNodeSolver(e, n, t, solveCos);
@@ -3773,37 +3822,37 @@ const J = /* @__PURE__ */ new Map([
 		return twoCommaSeparatedNodesSolver(e, n, t, solvePow);
 	}],
 	["random", function random(e, n, t) {
-		const r = parseRandomValueSharing(e, e.value.filter((e) => !isWhiteSpaceOrCommentNode(e)), n, t);
-		if (-1 === r) return -1;
-		const [a, o] = r, i = variadicArguments(e, o, n, t);
-		if (-1 === i) return -1;
-		const [l, c, s] = i;
+		const u = parseRandomValueSharing(e, e.value.filter((e) => !isWhiteSpaceOrCommentNode(e)), n, t);
+		if (-1 === u) return -1;
+		const [a, i] = u, o = variadicArguments(e, i, n, t);
+		if (-1 === o) return -1;
+		const [l, c, s] = o;
 		if (!l || !c) return -1;
 		return solveRandom(e, a, l, c, s, t);
 	}],
 	["rem", function rem(e, n, t) {
 		return twoCommaSeparatedNodesSolver(e, n, t, solveRem);
 	}],
-	["round", function round(e, r, a) {
-		const o = resolveGlobalsAndConstants([...e.value.filter((e) => !isWhiteSpaceOrCommentNode(e))], r);
-		let i = "", l = !1;
-		const c = [], s = [];
+	["round", function round(e, u, a) {
+		const i = resolveGlobalsAndConstants([...e.value.filter((e) => !isWhiteSpaceOrCommentNode(e))], u);
+		let o = "", l = !1;
+		const c = [], p = [];
 		{
 			let e = c;
-			for (let n = 0; n < o.length; n++) {
-				const r = o[n];
-				if (!i && 0 === c.length && 0 === s.length && isTokenNode(r) && isTokenIdent(r.value)) {
+			for (let n = 0; n < i.length; n++) {
+				const r = i[n];
+				if (!o && 0 === c.length && 0 === p.length && isTokenNode(r) && isTokenIdent(r.value)) {
 					const e = r.value[4].value.toLowerCase();
-					if (K.has(e)) {
-						i = e;
+					if (J.has(e)) {
+						o = e;
 						continue;
 					}
 				}
 				if (isTokenNode(r) && isTokenComma(r.value)) {
-					if (e === s) return -1;
-					if (e === c && i && 0 === c.length) continue;
+					if (e === p) return -1;
+					if (e === c && o && 0 === c.length) continue;
 					if (e === c) {
-						l = !0, e = s;
+						l = !0, e = p;
 						continue;
 					}
 					return -1;
@@ -3811,39 +3860,39 @@ const J = /* @__PURE__ */ new Map([
 				e.push(r);
 			}
 		}
-		const v = solve(calc$1(calcWrapper(e, c), r, a), a);
-		if (-1 === v) return -1;
-		if ("line-width" === i) {
+		const m = solve(calc$1(calcWrapper(e, c), u, a), a);
+		if (-1 === m) return -1;
+		if ("line-width" === o) {
 			const e = convertUnit([
 				u$1.Dimension,
 				"1px",
-				v.value[2],
-				v.value[3],
+				m.value[2],
+				m.value[3],
 				{
 					value: 1,
 					type: a$1.Integer,
 					unit: "px"
 				}
-			], v.value);
+			], m.value);
 			if (!isTokenDimension(e) || "px" !== e[4].unit) return -1;
 		}
-		if (!l && 0 === s.length) {
-			if ("line-width" === i) return snapAsBorderWidth(e, v.value, a);
-			s.push(new TokenNode([
+		if (!l && 0 === p.length) {
+			if ("line-width" === o) return snapAsBorderWidth(e, m.value, a);
+			p.push(new TokenNode([
 				u$1.Number,
 				"1",
-				v.value[2],
-				v.value[3],
+				m.value[2],
+				m.value[3],
 				{
 					value: 1,
 					type: a$1.Integer
 				}
 			]));
 		}
-		const d = solve(calc$1(calcWrapper(e, s), r, a), a);
+		const d = solve(calc$1(calcWrapper(e, p), u, a), a);
 		if (-1 === d) return -1;
-		i || (i = "nearest");
-		return solveRound(e, i, v, d, a);
+		o || (o = "nearest");
+		return solveRound(e, o, m, d, a);
 	}],
 	["sign", function sign(e, n, t) {
 		return singleNodeSolver(e, n, t, solveSign);
@@ -3858,39 +3907,41 @@ const J = /* @__PURE__ */ new Map([
 		return singleNodeSolver(e, n, t, solveTan);
 	}]
 ]);
-function calc$1(e, n, r) {
-	const a = resolveGlobalsAndConstants([...e.value.filter((e) => !isWhiteSpaceOrCommentNode(e))], n);
-	if (1 === a.length && isTokenNode(a[0])) return {
-		inputs: [a[0]],
+const H = 5e4;
+function calc$1(e, n, i) {
+	const o = resolveGlobalsAndConstants([...e.value.filter((e) => !isWhiteSpaceOrCommentNode(e))], n);
+	if (o.length > H) throw new Error(`Maximum number of nodes in a math function (${H}) exceeded, reduce the complexity of your expression`);
+	if (1 === o.length && isTokenNode(o[0])) return {
+		inputs: [o[0]],
 		operation: unary
 	};
 	let l = 0;
-	for (; l < a.length;) {
-		const e = a[l];
+	for (; l < o.length;) {
+		const e = o[l];
 		if (isSimpleBlockNode(e) && isTokenOpenParen(e.startToken)) {
-			const t = calc$1(e, n, r);
+			const t = calc$1(e, n, i);
 			if (-1 === t) return -1;
-			a.splice(l, 1, t);
+			o.splice(l, 1, t);
 			continue;
 		}
 		if (isFunctionNode(e)) {
-			const t = J.get(e.getName().toLowerCase());
+			const t = _.get(e.getName().toLowerCase());
 			if (!t) return -1;
-			const u = t(e, n, r);
-			if (-1 === u) return -1;
-			a.splice(l, 1, u);
+			const r = t(e, n, i);
+			if (-1 === r) return -1;
+			o.splice(l, 1, r);
 			continue;
 		}
 		l++;
 	}
-	if (l = 0, 1 === a.length && isCalculation(a[0])) return a[0];
-	for (; l < a.length;) {
-		const e = a[l];
+	if (l = 0, 1 === o.length && isCalculation(o[0])) return o[0];
+	for (; l < o.length;) {
+		const e = o[l];
 		if (!e || !isTokenNode(e) && !isCalculation(e)) {
 			l++;
 			continue;
 		}
-		const n = a[l + 1];
+		const n = o[l + 1];
 		if (!n || !isTokenNode(n)) {
 			l++;
 			continue;
@@ -3900,24 +3951,24 @@ function calc$1(e, n, r) {
 			l++;
 			continue;
 		}
-		const u = a[l + 2];
+		const u = o[l + 2];
 		if (!u || !isTokenNode(u) && !isCalculation(u)) return -1;
-		"*" !== r[4].value ? "/" !== r[4].value ? l++ : a.splice(l, 3, {
+		"*" !== r[4].value ? "/" !== r[4].value ? l++ : o.splice(l, 3, {
 			inputs: [e, u],
 			operation: division
-		}) : a.splice(l, 3, {
+		}) : o.splice(l, 3, {
 			inputs: [e, u],
 			operation: multiplication
 		});
 	}
-	if (l = 0, 1 === a.length && isCalculation(a[0])) return a[0];
-	for (; l < a.length;) {
-		const e = a[l];
+	if (l = 0, 1 === o.length && isCalculation(o[0])) return o[0];
+	for (; l < o.length;) {
+		const e = o[l];
 		if (!e || !isTokenNode(e) && !isCalculation(e)) {
 			l++;
 			continue;
 		}
-		const n = a[l + 1];
+		const n = o[l + 1];
 		if (!n || !isTokenNode(n)) {
 			l++;
 			continue;
@@ -3927,42 +3978,42 @@ function calc$1(e, n, r) {
 			l++;
 			continue;
 		}
-		const u = a[l + 2];
+		const u = o[l + 2];
 		if (!u || !isTokenNode(u) && !isCalculation(u)) return -1;
-		"+" !== r[4].value ? "-" !== r[4].value ? l++ : a.splice(l, 3, {
+		"+" !== r[4].value ? "-" !== r[4].value ? l++ : o.splice(l, 3, {
 			inputs: [e, u],
 			operation: subtraction
-		}) : a.splice(l, 3, {
+		}) : o.splice(l, 3, {
 			inputs: [e, u],
 			operation: addition
 		});
 	}
-	return 1 === a.length && isCalculation(a[0]) ? a[0] : -1;
+	return 1 === o.length && isCalculation(o[0]) ? o[0] : -1;
 }
 function singleNodeSolver(e, n, t, r) {
-	const a = singleArgument(e, n, t);
-	return -1 === a ? -1 : r(e, a, t);
+	const u = singleArgument(e, n, t);
+	return -1 === u ? -1 : r(e, u, t);
 }
 function singleArgument(e, n, t) {
 	const a = solve(calc$1(calcWrapper(e, resolveGlobalsAndConstants([...e.value.filter((e) => !isWhiteSpaceOrCommentNode(e))], n)), n, t), t);
 	return -1 === a ? -1 : a;
 }
 function twoCommaSeparatedNodesSolver(e, n, t, r) {
-	const a = twoCommaSeparatedArguments(e, n, t);
-	if (-1 === a) return -1;
-	const [u, o] = a;
-	return r(e, u, o, t);
+	const u = twoCommaSeparatedArguments(e, n, t);
+	if (-1 === u) return -1;
+	const [a, i] = u;
+	return r(e, a, i, t);
 }
-function twoCommaSeparatedArguments(e, n, r) {
-	const a = resolveGlobalsAndConstants([...e.value.filter((e) => !isWhiteSpaceOrCommentNode(e))], n), o = [], i = [];
+function twoCommaSeparatedArguments(e, n, u) {
+	const a = resolveGlobalsAndConstants([...e.value.filter((e) => !isWhiteSpaceOrCommentNode(e))], n), i = [], o = [];
 	{
-		let e = o;
+		let e = i;
 		for (let n = 0; n < a.length; n++) {
 			const r = a[n];
 			if (isTokenNode(r) && isTokenComma(r.value)) {
-				if (e === i) return -1;
-				if (e === o) {
-					e = i;
+				if (e === o) return -1;
+				if (e === i) {
+					e = o;
 					continue;
 				}
 				return -1;
@@ -3970,55 +4021,55 @@ function twoCommaSeparatedArguments(e, n, r) {
 			e.push(r);
 		}
 	}
-	const l = solve(calc$1(calcWrapper(e, o), n, r), r);
+	const l = solve(calc$1(calcWrapper(e, i), n, u), u);
 	if (-1 === l) return -1;
-	const c = solve(calc$1(calcWrapper(e, i), n, r), r);
+	const c = solve(calc$1(calcWrapper(e, o), n, u), u);
 	return -1 === c ? -1 : [l, c];
 }
 function variadicNodesSolver(e, n, t, r) {
-	const a = variadicArguments(e, e.value, n, t);
-	return -1 === a ? -1 : r(e, a, t);
+	const u = variadicArguments(e, e.value, n, t);
+	return -1 === u ? -1 : r(e, u, t);
 }
-function variadicArguments(e, n, r, a) {
-	const o = resolveGlobalsAndConstants([...n.filter((e) => !isWhiteSpaceOrCommentNode(e))], r), i = [];
+function variadicArguments(e, n, u, a) {
+	const i = resolveGlobalsAndConstants([...n.filter((e) => !isWhiteSpaceOrCommentNode(e))], u), o = [];
 	{
 		const n = [];
-		let u = [];
-		for (let e = 0; e < o.length; e++) {
-			const r = o[e];
-			isTokenNode(r) && isTokenComma(r.value) ? (n.push(u), u = []) : u.push(r);
+		let r = [];
+		for (let e = 0; e < i.length; e++) {
+			const u = i[e];
+			isTokenNode(u) && isTokenComma(u.value) ? (n.push(r), r = []) : r.push(u);
 		}
-		n.push(u);
+		n.push(r);
 		for (let t = 0; t < n.length; t++) {
 			if (0 === n[t].length) return -1;
-			const u = solve(calc$1(calcWrapper(e, n[t]), r, a), a);
-			if (-1 === u) return -1;
-			i.push(u);
+			const r = solve(calc$1(calcWrapper(e, n[t]), u, a), a);
+			if (-1 === r) return -1;
+			o.push(r);
 		}
 	}
-	return i;
+	return o;
 }
-function variadicArgumentsCalcMix(e, n, r, a) {
-	const o = resolveGlobalsAndConstants([...n.filter((e) => !isWhiteSpaceOrCommentNode(e))], r), i = [];
+function variadicArgumentsCalcMix(e, n, u, a) {
+	const i = resolveGlobalsAndConstants([...n.filter((e) => !isWhiteSpaceOrCommentNode(e))], u), o = [];
 	{
 		const n = [];
 		let l = [];
-		for (let e = 0; e < o.length; e++) {
-			const r = o[e];
+		for (let e = 0; e < i.length; e++) {
+			const r = i[e];
 			isTokenNode(r) && isTokenComma(r.value) ? (n.push(l), l = []) : l.push(r);
 		}
 		n.push(l);
-		for (let o = 0; o < n.length; o++) {
-			if (0 === n[o].length) return -1;
+		for (let i = 0; i < n.length; i++) {
+			if (0 === n[i].length) return -1;
 			let l = -1, c = !1;
-			for (let i = n[o].length - 1; i >= 0; i--) {
-				if (isWhiteSpaceOrCommentNode(n[o][i])) continue;
-				if (l = solve(calc$1(calcWrapper(e, n[o].slice(0, i + 1)), r, a), a), -1 === l) continue;
-				const s = n[o].slice(i + 1).filter((e) => !isWhiteSpaceOrCommentNode(e));
+			for (let o = n[i].length - 1; o >= 0; o--) {
+				if (isWhiteSpaceOrCommentNode(n[i][o])) continue;
+				if (l = solve(calc$1(calcWrapper(e, n[i].slice(0, o + 1)), u, a), a), -1 === l) continue;
+				const s = n[i].slice(o + 1).filter((e) => !isWhiteSpaceOrCommentNode(e));
 				if (s.length) if (1 === s.length && isTokenNode(s[0]) && isTokenPercentage(s[0].value)) {
 					if (c = s[0].value[4].value, c < 0 || c > 100) return -1;
 				} else {
-					const n = solve(calc$1(calcWrapper(e, s), r, a), a);
+					const n = solve(calc$1(calcWrapper(e, s), u, a), a);
 					if (-1 === n) return -1;
 					if (!isTokenPercentage(n.value)) return -1;
 					c = n.value[4].value, c = Math.min(100, Math.max(0, c));
@@ -4026,70 +4077,70 @@ function variadicArgumentsCalcMix(e, n, r, a) {
 				break;
 			}
 			if (-1 === l) return -1;
-			i.push({
+			o.push({
 				calcSum: l,
 				percentage: c
 			});
 		}
 	}
-	return i;
+	return o;
 }
-const K = /* @__PURE__ */ new Set([
+const J = /* @__PURE__ */ new Set([
 	"nearest",
 	"line-width",
 	"up",
 	"down",
 	"to-zero"
 ]);
-function parseRandomValueSharing(e, n, r, a) {
-	const u = {
+function parseRandomValueSharing(e, n, r, u) {
+	const a = {
 		dashedIdent: "",
 		fixed: -1,
 		elementScoped: !1,
 		propertyScoped: !1,
 		propertyIndexScoped: !1
 	};
-	let o = !1;
-	const i = n[0];
-	if (!isTokenNode(i) || !isTokenIdent(i.value)) return [u, n];
-	for (let i = 0; i < n.length; i++) {
-		const l = n[i];
+	let i = !1;
+	const o = n[0];
+	if (!isTokenNode(o) || !isTokenIdent(o.value)) return [a, n];
+	for (let o = 0; o < n.length; o++) {
+		const l = n[o];
 		if (!isTokenNode(l)) return -1;
-		if (isTokenComma(l.value)) return [u, n.slice(i + 1)];
+		if (isTokenComma(l.value)) return [a, n.slice(o + 1)];
 		if (!isTokenIdent(l.value)) return -1;
 		const c = l.value[4].value.toLowerCase();
 		if ("element-scoped" !== c) if ("property-scoped" !== c) if ("property-index-scoped" !== c) {
 			if ("fixed" === c) {
-				if (-1 !== u.fixed || o || u.dashedIdent || u.elementScoped || u.propertyScoped || u.propertyIndexScoped) return -1;
-				i++;
-				const t = n[i];
+				if (-1 !== a.fixed || i || a.dashedIdent || a.elementScoped || a.propertyScoped || a.propertyIndexScoped) return -1;
+				o++;
+				const t = n[o];
 				if (!t) return -1;
-				const l = solve(calc$1(calcWrapper(e, [t]), r, a), a);
+				const l = solve(calc$1(calcWrapper(e, [t]), r, u), u);
 				if (-1 === l) return -1;
 				if (!isTokenNumber(l.value)) return -1;
 				if (l.value[4].value < 0 || l.value[4].value > 1) return -1;
-				u.fixed = Math.max(0, Math.min(l.value[4].value, 1 - 1e-9));
+				a.fixed = Math.max(0, Math.min(l.value[4].value, 1 - Number.EPSILON / 2));
 				continue;
 			}
 			if ("auto" !== c) {
-				if (!c.startsWith("--")) return -1;
-				if (-1 !== u.fixed || o || u.dashedIdent) return -1;
-				u.dashedIdent = c;
+				if (!c.startsWith("--")) return 0 === o ? [a, n] : -1;
+				if (-1 !== a.fixed || i || a.dashedIdent) return -1;
+				a.dashedIdent = c;
 			} else {
-				if (-1 !== u.fixed || o || u.dashedIdent || u.elementScoped || u.propertyScoped || u.propertyIndexScoped) return -1;
-				u.elementScoped = !0, u.propertyIndexScoped = !0, o = !0;
+				if (-1 !== a.fixed || i || a.dashedIdent || a.elementScoped || a.propertyScoped || a.propertyIndexScoped) return -1;
+				a.elementScoped = !0, a.propertyIndexScoped = !0, i = !0;
 			}
 		} else {
-			if (-1 !== u.fixed || o || u.propertyScoped || u.propertyIndexScoped) return -1;
-			u.propertyIndexScoped = !0;
+			if (-1 !== a.fixed || i || a.propertyScoped || a.propertyIndexScoped) return -1;
+			a.propertyIndexScoped = !0;
 		}
 		else {
-			if (-1 !== u.fixed || o || u.propertyScoped || u.propertyIndexScoped) return -1;
-			u.propertyScoped = !0;
+			if (-1 !== a.fixed || i || a.propertyScoped || a.propertyIndexScoped) return -1;
+			a.propertyScoped = !0;
 		}
 		else {
-			if (-1 !== u.fixed || o || u.elementScoped) return -1;
-			u.elementScoped = !0;
+			if (-1 !== a.fixed || i || a.elementScoped) return -1;
+			a.elementScoped = !0;
 		}
 	}
 	return -1;
@@ -4109,7 +4160,7 @@ function calcWrapper(e, n) {
 		void 0
 	], n);
 }
-function maxWrapper(t, r, a) {
+function maxWrapper(t, r, u) {
 	return new FunctionNode([
 		u$1.Function,
 		"max(",
@@ -4130,7 +4181,7 @@ function maxWrapper(t, r, a) {
 			...sourceIndices(r),
 			void 0
 		]),
-		a
+		u
 	]);
 }
 function patchNaN(e) {
@@ -4390,16 +4441,6 @@ function patchMinusZero(e) {
 	const n = e.value;
 	return isTokenNumeric(n) && Object.is(-0, n[4].value) ? ("-0" === n[1] || (isTokenPercentage(n) ? n[1] = "-0%" : isTokenDimension(n) ? n[1] = "-0" + n[4].unit : n[1] = "-0"), e) : e;
 }
-function patchPrecision(e, n = 13) {
-	if (-1 === e) return -1;
-	if (n <= 0) return e;
-	if (isFunctionNode(e)) return e;
-	const t = e.value;
-	if (!isTokenNumeric(t)) return e;
-	if (Number.isInteger(t[4].value)) return e;
-	const r = Number(t[4].value.toFixed(n)).toString();
-	return isTokenNumber(t) ? t[1] = r : isTokenPercentage(t) ? t[1] = r + "%" : isTokenDimension(t) && (t[1] = r + t[4].unit), e;
-}
 function patchCanonicalUnit(e) {
 	return -1 === e ? -1 : isFunctionNode(e) ? e : isTokenDimension(e.value) ? (e.value = toCanonicalUnit(e.value), e) : e;
 }
@@ -4412,10 +4453,10 @@ function tokenizeGlobals(e) {
 	if (!e) return n;
 	for (const [t, r] of e) if (isToken(r)) n.set(t, r);
 	else if ("string" == typeof r) {
-		const e = tokenizer({ css: r }), a = e.nextToken();
+		const e = tokenizer({ css: r }), u = e.nextToken();
 		if (e.nextToken(), !e.endOfFile()) continue;
-		if (!isTokenNumeric(a)) continue;
-		n.set(t, a);
+		if (!isTokenNumeric(u)) continue;
+		n.set(t, u);
 		continue;
 	}
 	return n;
@@ -4424,40 +4465,40 @@ function calcFromComponentValues(e, n) {
 	const t = tokenizeGlobals(n?.globals);
 	return replaceComponentValues(e, (e) => {
 		if (!isFunctionNode(e)) return;
-		const r = J.get(e.getName().toLowerCase());
+		const r = _.get(e.getName().toLowerCase());
 		if (!r) return;
 		const a = patchCalcResult(solve(r(e, t, n ?? {}), n ?? {}), n);
 		return -1 !== a ? n?.calcWrapper ? calcWrapper(e, [a]) : a : void 0;
 	});
 }
-function replaceComponentValues(n, r) {
+function replaceComponentValues(n, u) {
 	for (let a = 0; a < n.length; a++) {
-		const o = n[a];
-		walk(o, (n, a) => {
+		const i = n[a];
+		walk(i, (n, a) => {
 			if ("number" != typeof a) return;
-			const o = r(n.node);
-			if (!o) return;
-			const i = [o], l = n.parent.value[a - 1];
-			isTokenNode(l) && isTokenDelim(l.value) && ("-" === l.value[4].value || "+" === l.value[4].value) && i.splice(0, 0, new WhitespaceNode([[
+			const i = u(n.node);
+			if (!i) return;
+			const l = [i], c = n.parent.value[a - 1];
+			isTokenNode(c) && isTokenDelim(c.value) && ("-" === c.value[4].value || "+" === c.value[4].value) && l.splice(0, 0, new WhitespaceNode([[
 				u$1.Whitespace,
 				" ",
 				...sourceIndices(n.node),
 				void 0
 			]]));
 			const s = n.parent.value[a + 1];
-			!s || isWhiteSpaceOrCommentNode(s) || isTokenNode(s) && (isTokenComma(s.value) || isTokenColon(s.value) || isTokenSemicolon(s.value) || isTokenDelim(s.value) && "-" !== s.value[4].value && "+" !== s.value[4].value) || i.push(new WhitespaceNode([[
+			!s || isWhiteSpaceOrCommentNode(s) || isTokenNode(s) && (isTokenComma(s.value) || isTokenColon(s.value) || isTokenSemicolon(s.value) || isTokenDelim(s.value) && "-" !== s.value[4].value && "+" !== s.value[4].value) || l.push(new WhitespaceNode([[
 				u$1.Whitespace,
 				" ",
 				...sourceIndices(n.node),
 				void 0
-			]])), n.parent.value.splice(a, 1, ...i);
+			]])), n.parent.value.splice(a, 1, ...l);
 		});
 	}
 	return n;
 }
-const Q = new Set(J.keys());
+const K = new Set(_.keys());
 //#endregion
-//#region ../../node_modules/.pnpm/@csstools+css-color-parser@4.2.3_@csstools+css-parser-algorithms@4.0.0_@csstools+css-to_0211899857d0b31ddb20171e5feaa18a/node_modules/@csstools/css-color-parser/dist/index.mjs
+//#region ../../node_modules/.pnpm/@csstools+css-color-parser@4.2.4_@csstools+css-parser-algorithms@4.0.1_@csstools+css-to_3cec8fdb911b5b73345a3ccb5bd79466/node_modules/@csstools/css-color-parser/dist/index.mjs
 var xe;
 var De;
 function normalize(e, n, a, o) {
@@ -5048,7 +5089,7 @@ function color$1(e, n) {
 					p.syntaxFlags.add(De.HasVariableAlpha), b.push(v);
 					continue;
 				}
-				if (!Q.has(toLowerCaseAZ(v.getName()))) return !1;
+				if (!K.has(toLowerCaseAZ(v.getName()))) return !1;
 				const [[e]] = calcFromComponentValues([[v]], {
 					censorIntoStandardRepresentableValues: !0,
 					globals: h,
@@ -5196,7 +5237,7 @@ function colorMixComponents(e, n) {
 					}
 				}
 				if (!t) {
-					if (isFunctionNode(i) && Q.has(toLowerCaseAZ(i.getName()))) {
+					if (isFunctionNode(i) && K.has(toLowerCaseAZ(i.getName()))) {
 						if ([[i]] = calcFromComponentValues([[i]], {
 							censorIntoStandardRepresentableValues: !0,
 							precision: -1,
@@ -5620,7 +5661,7 @@ function threeChannelLegacySyntax(e, n, a, o) {
 					h.syntaxFlags.add(De.HasVariableAlpha), N.push(a);
 					continue;
 				}
-				if (!Q.has(a.getName().toLowerCase())) return !1;
+				if (!K.has(a.getName().toLowerCase())) return !1;
 				const [[e]] = calcFromComponentValues([[a]], {
 					censorIntoStandardRepresentableValues: !0,
 					precision: -1,
@@ -5685,7 +5726,7 @@ function threeChannelSpaceSeparated(e, n, o, s, c) {
 					v.syntaxFlags.add(De.HasVariableAlpha), f.push(r);
 					continue;
 				}
-				if (!Q.has(r.getName().toLowerCase())) return !1;
+				if (!K.has(r.getName().toLowerCase())) return !1;
 				const [[e]] = calcFromComponentValues([[r]], {
 					censorIntoStandardRepresentableValues: !0,
 					globals: p,
@@ -6154,7 +6195,7 @@ function alpha(e, n) {
 		if (isWhitespaceNode(m) || isCommentNode(m)) for (; isWhitespaceNode(e.value[N + 1]) || isCommentNode(e.value[N + 1]);) N++;
 		else if (u && !c && !i && isTokenNode(m) && isTokenDelim(m.value) && "/" === m.value[4].value) c = !0;
 		else {
-			if (isFunctionNode(m) && Q.has(toLowerCaseAZ(m.getName()))) {
+			if (isFunctionNode(m) && K.has(toLowerCaseAZ(m.getName()))) {
 				const [[e]] = calcFromComponentValues([[m]], {
 					censorIntoStandardRepresentableValues: !0,
 					globals: s,
@@ -7713,13 +7754,16 @@ function collectThemeVariableRule(root, options = {}) {
 			if (isDisplayP3Declaration(decl)) return;
 			if (decl.prop.startsWith("--tw-")) return;
 			if (!shouldPreserveContentInit && isEmptyTwContentDeclaration(decl)) return;
-			declarations.set(decl.prop, decl.clone());
+			const values = declarations.get(decl.prop) ?? [];
+			const previous = values.at(-1);
+			if (!previous || previous.value !== decl.value || previous.important !== decl.important) values.push(decl.clone());
+			declarations.set(decl.prop, values);
 		});
 	}
 	for (const rule of themeRules) rule.remove();
 	if (declarations.size === 0) return;
 	const rule = postcss.rule({ selector: normalizeMiniProgramThemeScopeSelector(options.cssSelectorReplacement?.root) });
-	for (const decl of declarations.values()) rule.append(decl);
+	for (const decl of declarations.values()) rule.append(...decl);
 	return rule;
 }
 //#endregion