@cube-dev/ui-kit 0.114.0 → 0.115.0

package/dist/pipeline/simplify.js

@@ -0,0 +1,558 @@
+/** @license MIT | @cube-dev/ui-kit v0.115.0 | Cube Dev Team */
+import { Lru } from "../parser/lru.js";
+import { falseCondition, getConditionUniqueId, trueCondition } from "./conditions.js";
+
+//#region src/tasty/pipeline/simplify.ts
+/**
+* Condition Simplification Engine
+*
+* Simplifies condition trees by applying boolean algebra rules,
+* detecting contradictions, merging ranges, and deduplicating terms.
+*
+* This is critical for:
+* 1. Detecting invalid combinations (A & !A → FALSE)
+* 2. Reducing CSS output size
+* 3. Producing cleaner selectors
+*/
+const simplifyCache = new Lru(5e3);
+/**
+* Simplify a condition tree aggressively.
+*
+* This applies all possible simplification rules:
+* - Boolean algebra (identity, annihilator, idempotent, absorption)
+* - Contradiction detection (A & !A → FALSE)
+* - Tautology detection (A | !A → TRUE)
+* - Range intersection for numeric queries
+* - Attribute value conflict detection
+* - Deduplication and sorting
+*/
+function simplifyCondition(node) {
+	const key = getConditionUniqueId(node);
+	const cached = simplifyCache.get(key);
+	if (cached) return cached;
+	const result = simplifyInner(node);
+	simplifyCache.set(key, result);
+	return result;
+}
+function simplifyInner(node) {
+	if (node.kind === "true" || node.kind === "false") return node;
+	if (node.kind === "state") return node;
+	if (node.kind === "compound") {
+		const simplifiedChildren = node.children.map((c) => simplifyInner(c));
+		if (node.operator === "AND") return simplifyAnd(simplifiedChildren);
+		else return simplifyOr(simplifiedChildren);
+	}
+	return node;
+}
+function simplifyAnd(children) {
+	let terms = [];
+	for (const child of children) {
+		if (child.kind === "false") return falseCondition();
+		if (child.kind === "true") continue;
+		if (child.kind === "compound" && child.operator === "AND") terms.push(...child.children);
+		else terms.push(child);
+	}
+	if (terms.length === 0) return trueCondition();
+	if (terms.length === 1) return terms[0];
+	if (hasContradiction(terms)) return falseCondition();
+	if (hasRangeContradiction(terms)) return falseCondition();
+	if (hasAttributeConflict(terms)) return falseCondition();
+	if (hasContainerStyleConflict(terms)) return falseCondition();
+	terms = removeImpliedNegations(terms);
+	terms = deduplicateTerms(terms);
+	terms = mergeRanges(terms);
+	terms = sortTerms(terms);
+	terms = applyAbsorptionAnd(terms);
+	if (terms.length === 0) return trueCondition();
+	if (terms.length === 1) return terms[0];
+	return {
+		kind: "compound",
+		operator: "AND",
+		children: terms
+	};
+}
+function simplifyOr(children) {
+	let terms = [];
+	for (const child of children) {
+		if (child.kind === "true") return trueCondition();
+		if (child.kind === "false") continue;
+		if (child.kind === "compound" && child.operator === "OR") terms.push(...child.children);
+		else terms.push(child);
+	}
+	if (terms.length === 0) return falseCondition();
+	if (terms.length === 1) return terms[0];
+	if (hasTautology(terms)) return trueCondition();
+	terms = deduplicateTerms(terms);
+	terms = sortTerms(terms);
+	terms = applyAbsorptionOr(terms);
+	if (terms.length === 0) return falseCondition();
+	if (terms.length === 1) return terms[0];
+	return {
+		kind: "compound",
+		operator: "OR",
+		children: terms
+	};
+}
+/**
+* Check if any term contradicts another (A & !A)
+*/
+function hasContradiction(terms) {
+	const uniqueIds = /* @__PURE__ */ new Set();
+	for (const term of terms) {
+		if (term.kind !== "state") continue;
+		const id = term.uniqueId;
+		const negatedId = term.negated ? id.slice(1) : `!${id}`;
+		if (uniqueIds.has(negatedId)) return true;
+		uniqueIds.add(id);
+	}
+	return false;
+}
+/**
+* Check for tautologies (A | !A)
+*/
+function hasTautology(terms) {
+	const uniqueIds = /* @__PURE__ */ new Set();
+	for (const term of terms) {
+		if (term.kind !== "state") continue;
+		const id = term.uniqueId;
+		const negatedId = term.negated ? id.slice(1) : `!${id}`;
+		if (uniqueIds.has(negatedId)) return true;
+		uniqueIds.add(id);
+	}
+	return false;
+}
+/**
+* Check for range contradictions in media/container queries
+* e.g., @media(w < 400px) & @media(w > 800px) → FALSE
+*
+* Also handles negated conditions:
+* - Single-bound negations are inverted (not (w < 600px) → w >= 600px)
+* - Range negations create excluded ranges that are checked against positive bounds
+*/
+function hasRangeContradiction(terms) {
+	const mediaByDim = /* @__PURE__ */ new Map();
+	const containerByDim = /* @__PURE__ */ new Map();
+	for (const term of terms) {
+		if (term.kind !== "state") continue;
+		if (term.type === "media" && term.subtype === "dimension") {
+			const key = term.dimension || "width";
+			if (!mediaByDim.has(key)) mediaByDim.set(key, {
+				positive: [],
+				negated: []
+			});
+			const group = mediaByDim.get(key);
+			if (term.negated) group.negated.push(term);
+			else group.positive.push(term);
+		}
+		if (term.type === "container" && term.subtype === "dimension") {
+			const key = `${term.containerName || "_"}:${term.dimension || "width"}`;
+			if (!containerByDim.has(key)) containerByDim.set(key, {
+				positive: [],
+				negated: []
+			});
+			const group = containerByDim.get(key);
+			if (term.negated) group.negated.push(term);
+			else group.positive.push(term);
+		}
+	}
+	for (const group of mediaByDim.values()) if (rangesAreImpossibleWithNegations(group.positive, group.negated)) return true;
+	for (const group of containerByDim.values()) if (rangesAreImpossibleWithNegations(group.positive, group.negated)) return true;
+	return false;
+}
+/**
+* Check if conditions are impossible, including negated conditions.
+*
+* For negated single-bound conditions:
+*   not (w < 600px) → w >= 600px (inverted to lower bound)
+*   not (w >= 800px) → w < 800px (inverted to upper bound)
+*
+* For negated range conditions:
+*   not (400px <= w < 800px) → excludes [400, 800)
+*   If the effective bounds fall entirely within an excluded range, it's impossible.
+*/
+function rangesAreImpossibleWithNegations(positive, negated) {
+	const bounds = computeEffectiveBounds(positive);
+	const excludedRanges = [];
+	for (const cond of negated) {
+		const hasLower = cond.lowerBound?.valueNumeric != null;
+		const hasUpper = cond.upperBound?.valueNumeric != null;
+		if (hasLower && hasUpper) excludedRanges.push({
+			lower: cond.lowerBound.valueNumeric,
+			lowerInclusive: cond.lowerBound.inclusive,
+			upper: cond.upperBound.valueNumeric,
+			upperInclusive: cond.upperBound.inclusive
+		});
+		else if (hasUpper) {
+			const value = cond.upperBound.valueNumeric;
+			const inclusive = !cond.upperBound.inclusive;
+			if (bounds.lowerBound === null || value > bounds.lowerBound) {
+				bounds.lowerBound = value;
+				bounds.lowerInclusive = inclusive;
+			} else if (value === bounds.lowerBound && !inclusive) bounds.lowerInclusive = false;
+		} else if (hasLower) {
+			const value = cond.lowerBound.valueNumeric;
+			const inclusive = !cond.lowerBound.inclusive;
+			if (bounds.upperBound === null || value < bounds.upperBound) {
+				bounds.upperBound = value;
+				bounds.upperInclusive = inclusive;
+			} else if (value === bounds.upperBound && !inclusive) bounds.upperInclusive = false;
+		}
+	}
+	if (bounds.lowerBound !== null && bounds.upperBound !== null) {
+		if (bounds.lowerBound > bounds.upperBound) return true;
+		if (bounds.lowerBound === bounds.upperBound && (!bounds.lowerInclusive || !bounds.upperInclusive)) return true;
+	}
+	if (bounds.lowerBound !== null && bounds.upperBound !== null && excludedRanges.length > 0) {
+		for (const excluded of excludedRanges) if (boundsWithinExcludedRange(bounds, excluded)) return true;
+	}
+	return false;
+}
+/**
+* Compute effective bounds from positive (non-negated) conditions
+*/
+function computeEffectiveBounds(conditions) {
+	let lowerBound = null;
+	let lowerInclusive = false;
+	let upperBound = null;
+	let upperInclusive = false;
+	for (const cond of conditions) {
+		if (cond.lowerBound?.valueNumeric != null) {
+			const value = cond.lowerBound.valueNumeric;
+			const inclusive = cond.lowerBound.inclusive;
+			if (lowerBound === null || value > lowerBound) {
+				lowerBound = value;
+				lowerInclusive = inclusive;
+			} else if (value === lowerBound && !inclusive) lowerInclusive = false;
+		}
+		if (cond.upperBound?.valueNumeric != null) {
+			const value = cond.upperBound.valueNumeric;
+			const inclusive = cond.upperBound.inclusive;
+			if (upperBound === null || value < upperBound) {
+				upperBound = value;
+				upperInclusive = inclusive;
+			} else if (value === upperBound && !inclusive) upperInclusive = false;
+		}
+	}
+	return {
+		lowerBound,
+		lowerInclusive,
+		upperBound,
+		upperInclusive
+	};
+}
+/**
+* Check if effective bounds fall entirely within an excluded range.
+*
+* For example:
+*   Effective: [400, 800)
+*   Excluded:  [400, 800)
+*   → bounds fall entirely within excluded range → impossible
+*/
+function boundsWithinExcludedRange(bounds, excluded) {
+	if (bounds.lowerBound === null || bounds.upperBound === null) return false;
+	let lowerOk = false;
+	if (bounds.lowerBound > excluded.lower) lowerOk = true;
+	else if (bounds.lowerBound === excluded.lower) lowerOk = excluded.lowerInclusive || !bounds.lowerInclusive;
+	let upperOk = false;
+	if (bounds.upperBound < excluded.upper) upperOk = true;
+	else if (bounds.upperBound === excluded.upper) upperOk = excluded.upperInclusive || !bounds.upperInclusive;
+	return lowerOk && upperOk;
+}
+/**
+* Check for attribute value conflicts
+* e.g., [data-theme="dark"] & [data-theme="light"] → FALSE
+* e.g., [data-theme="dark"] & ![data-theme] → FALSE
+*/
+function hasAttributeConflict(terms) {
+	const modifiersByAttr = /* @__PURE__ */ new Map();
+	for (const term of terms) {
+		if (term.kind !== "state" || term.type !== "modifier") continue;
+		const attr = term.attribute;
+		if (!modifiersByAttr.has(attr)) modifiersByAttr.set(attr, {
+			positive: [],
+			negated: []
+		});
+		const group = modifiersByAttr.get(attr);
+		if (term.negated) group.negated.push(term);
+		else group.positive.push(term);
+	}
+	for (const [attr, group] of modifiersByAttr) {
+		const positiveValues = group.positive.filter((m) => m.value !== void 0).map((m) => m.value);
+		if (new Set(positiveValues).size > 1) return true;
+		const hasPositiveValue = group.positive.some((m) => m.value !== void 0);
+		const hasNegatedBoolean = group.negated.some((m) => m.value === void 0);
+		if (hasPositiveValue && hasNegatedBoolean) return true;
+		for (const pos of group.positive) if (pos.value !== void 0) {
+			for (const neg of group.negated) if (neg.value === pos.value) return true;
+		}
+	}
+	return false;
+}
+/**
+* Check for container style query conflicts
+* e.g., style(--variant: danger) & style(--variant: success) → FALSE
+* e.g., style(--variant: danger) & not style(--variant) → FALSE
+*/
+function hasContainerStyleConflict(terms) {
+	const styleByProp = /* @__PURE__ */ new Map();
+	for (const term of terms) {
+		if (term.kind !== "state" || term.type !== "container" || term.subtype !== "style") continue;
+		const key = `${term.containerName || "_"}:${term.property}`;
+		if (!styleByProp.has(key)) styleByProp.set(key, {
+			positive: [],
+			negated: []
+		});
+		const group = styleByProp.get(key);
+		if (term.negated) group.negated.push(term);
+		else group.positive.push(term);
+	}
+	for (const [, group] of styleByProp) {
+		const positiveValues = group.positive.filter((c) => c.propertyValue !== void 0).map((c) => c.propertyValue);
+		if (new Set(positiveValues).size > 1) return true;
+		const hasPositiveValue = group.positive.some((c) => c.propertyValue !== void 0);
+		const hasNegatedExistence = group.negated.some((c) => c.propertyValue === void 0);
+		if (hasPositiveValue && hasNegatedExistence) return true;
+		for (const pos of group.positive) if (pos.propertyValue !== void 0) {
+			for (const neg of group.negated) if (neg.propertyValue === pos.propertyValue) return true;
+		}
+	}
+	return false;
+}
+/**
+* Remove negations that are implied by positive terms.
+*
+* Key optimizations:
+* 1. style(--variant: danger) implies NOT style(--variant: success)
+*    → If we have style(--variant: danger) & not style(--variant: success),
+*      the negation is redundant and can be removed.
+*
+* 2. [data-theme="dark"] implies NOT [data-theme="light"]
+*    → Same logic for attribute selectors.
+*
+* This produces cleaner CSS:
+*   Before: @container style(--variant: danger) and (not style(--variant: success))
+*   After:  @container style(--variant: danger)
+*/
+function removeImpliedNegations(terms) {
+	const positiveContainerStyles = /* @__PURE__ */ new Map();
+	const positiveModifiers = /* @__PURE__ */ new Map();
+	for (const term of terms) {
+		if (term.kind !== "state" || term.negated) continue;
+		if (term.type === "container" && term.subtype === "style") {
+			const key = `${term.containerName || "_"}:${term.property}`;
+			if (term.propertyValue !== void 0) positiveContainerStyles.set(key, term.propertyValue);
+		}
+		if (term.type === "modifier" && term.value !== void 0) positiveModifiers.set(term.attribute, term.value);
+	}
+	return terms.filter((term) => {
+		if (term.kind !== "state" || !term.negated) return true;
+		if (term.type === "container" && term.subtype === "style") {
+			const key = `${term.containerName || "_"}:${term.property}`;
+			const positiveValue = positiveContainerStyles.get(key);
+			if (positiveValue !== void 0) {
+				if (term.propertyValue === void 0) return true;
+				if (term.propertyValue !== positiveValue) return false;
+			}
+		}
+		if (term.type === "modifier") {
+			const positiveValue = positiveModifiers.get(term.attribute);
+			if (positiveValue !== void 0 && term.value !== void 0) {
+				if (term.value !== positiveValue) return false;
+			}
+		}
+		return true;
+	});
+}
+function deduplicateTerms(terms) {
+	const seen = /* @__PURE__ */ new Set();
+	const result = [];
+	for (const term of terms) {
+		const id = getConditionUniqueId(term);
+		if (!seen.has(id)) {
+			seen.add(id);
+			result.push(term);
+		}
+	}
+	return result;
+}
+/**
+* Merge compatible range conditions
+* e.g., @media(w >= 400px) & @media(w <= 800px) → @media(400px <= w <= 800px)
+*/
+function mergeRanges(terms) {
+	const mediaByDim = /* @__PURE__ */ new Map();
+	const containerByDim = /* @__PURE__ */ new Map();
+	terms.forEach((term, index) => {
+		if (term.kind !== "state") return;
+		if (term.type === "media" && term.subtype === "dimension" && !term.negated) {
+			const key = term.dimension || "width";
+			if (!mediaByDim.has(key)) mediaByDim.set(key, {
+				conditions: [],
+				indices: []
+			});
+			const group = mediaByDim.get(key);
+			group.conditions.push(term);
+			group.indices.push(index);
+		}
+		if (term.type === "container" && term.subtype === "dimension" && !term.negated) {
+			const key = `${term.containerName || "_"}:${term.dimension || "width"}`;
+			if (!containerByDim.has(key)) containerByDim.set(key, {
+				conditions: [],
+				indices: []
+			});
+			const group = containerByDim.get(key);
+			group.conditions.push(term);
+			group.indices.push(index);
+		}
+	});
+	const indicesToRemove = /* @__PURE__ */ new Set();
+	const mergedTerms = [];
+	for (const [dim, group] of mediaByDim) if (group.conditions.length > 1) {
+		const merged = mergeMediaRanges(group.conditions);
+		if (merged) {
+			group.indices.forEach((i) => indicesToRemove.add(i));
+			mergedTerms.push(merged);
+		}
+	}
+	for (const [, group] of containerByDim) if (group.conditions.length > 1) {
+		const merged = mergeContainerRanges(group.conditions);
+		if (merged) {
+			group.indices.forEach((i) => indicesToRemove.add(i));
+			mergedTerms.push(merged);
+		}
+	}
+	const result = [];
+	terms.forEach((term, index) => {
+		if (!indicesToRemove.has(index)) result.push(term);
+	});
+	result.push(...mergedTerms);
+	return result;
+}
+function mergeMediaRanges(conditions) {
+	if (conditions.length === 0) return null;
+	let lowerBound;
+	let upperBound;
+	for (const cond of conditions) {
+		if (cond.lowerBound) {
+			if (!lowerBound || (cond.lowerBound.valueNumeric ?? -Infinity) > (lowerBound.valueNumeric ?? -Infinity)) lowerBound = cond.lowerBound;
+		}
+		if (cond.upperBound) {
+			if (!upperBound || (cond.upperBound.valueNumeric ?? Infinity) < (upperBound.valueNumeric ?? Infinity)) upperBound = cond.upperBound;
+		}
+	}
+	const base = conditions[0];
+	const merged = {
+		kind: "state",
+		type: "media",
+		subtype: "dimension",
+		negated: false,
+		raw: buildMergedRaw(base.dimension || "width", lowerBound, upperBound),
+		uniqueId: "",
+		dimension: base.dimension,
+		lowerBound,
+		upperBound
+	};
+	const parts = [
+		"media",
+		"dim",
+		merged.dimension
+	];
+	if (lowerBound) {
+		parts.push(lowerBound.inclusive ? ">=" : ">");
+		parts.push(lowerBound.value);
+	}
+	if (upperBound) {
+		parts.push(upperBound.inclusive ? "<=" : "<");
+		parts.push(upperBound.value);
+	}
+	merged.uniqueId = parts.join(":");
+	return merged;
+}
+function mergeContainerRanges(conditions) {
+	if (conditions.length === 0) return null;
+	let lowerBound;
+	let upperBound;
+	for (const cond of conditions) {
+		if (cond.lowerBound) {
+			if (!lowerBound || (cond.lowerBound.valueNumeric ?? -Infinity) > (lowerBound.valueNumeric ?? -Infinity)) lowerBound = cond.lowerBound;
+		}
+		if (cond.upperBound) {
+			if (!upperBound || (cond.upperBound.valueNumeric ?? Infinity) < (upperBound.valueNumeric ?? Infinity)) upperBound = cond.upperBound;
+		}
+	}
+	const base = conditions[0];
+	const merged = {
+		kind: "state",
+		type: "container",
+		subtype: "dimension",
+		negated: false,
+		raw: buildMergedRaw(base.dimension || "width", lowerBound, upperBound),
+		uniqueId: "",
+		containerName: base.containerName,
+		dimension: base.dimension,
+		lowerBound,
+		upperBound
+	};
+	const parts = [
+		"container",
+		"dim",
+		merged.containerName || "_",
+		merged.dimension
+	];
+	if (lowerBound) {
+		parts.push(lowerBound.inclusive ? ">=" : ">");
+		parts.push(lowerBound.value);
+	}
+	if (upperBound) {
+		parts.push(upperBound.inclusive ? "<=" : "<");
+		parts.push(upperBound.value);
+	}
+	merged.uniqueId = parts.join(":");
+	return merged;
+}
+function buildMergedRaw(dimension, lowerBound, upperBound) {
+	if (lowerBound && upperBound) {
+		const lowerOp = lowerBound.inclusive ? "<=" : "<";
+		const upperOp = upperBound.inclusive ? "<=" : "<";
+		return `@media(${lowerBound.value} ${lowerOp} ${dimension} ${upperOp} ${upperBound.value})`;
+	} else if (upperBound) return `@media(${dimension} ${upperBound.inclusive ? "<=" : "<"} ${upperBound.value})`;
+	else if (lowerBound) return `@media(${dimension} ${lowerBound.inclusive ? ">=" : ">"} ${lowerBound.value})`;
+	return "@media()";
+}
+function sortTerms(terms) {
+	return [...terms].sort((a, b) => {
+		const idA = getConditionUniqueId(a);
+		const idB = getConditionUniqueId(b);
+		return idA.localeCompare(idB);
+	});
+}
+/**
+* Apply absorption law for AND: A & (A | B) → A
+*/
+function applyAbsorptionAnd(terms) {
+	const simpleIds = /* @__PURE__ */ new Set();
+	for (const term of terms) if (term.kind !== "compound") simpleIds.add(getConditionUniqueId(term));
+	return terms.filter((term) => {
+		if (term.kind === "compound" && term.operator === "OR") {
+			for (const child of term.children) if (simpleIds.has(getConditionUniqueId(child))) return false;
+		}
+		return true;
+	});
+}
+/**
+* Apply absorption law for OR: A | (A & B) → A
+*/
+function applyAbsorptionOr(terms) {
+	const simpleIds = /* @__PURE__ */ new Set();
+	for (const term of terms) if (term.kind !== "compound") simpleIds.add(getConditionUniqueId(term));
+	return terms.filter((term) => {
+		if (term.kind === "compound" && term.operator === "AND") {
+			for (const child of term.children) if (simpleIds.has(getConditionUniqueId(child))) return false;
+		}
+		return true;
+	});
+}
+
+//#endregion
+export { simplifyCondition };
+//# sourceMappingURL=simplify.js.map

package/dist/pipeline/simplify.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"simplify.js","names":[],"sources":["../../src/tasty/pipeline/simplify.ts"],"sourcesContent":["/**\n * Condition Simplification Engine\n *\n * Simplifies condition trees by applying boolean algebra rules,\n * detecting contradictions, merging ranges, and deduplicating terms.\n *\n * This is critical for:\n * 1. Detecting invalid combinations (A & !A → FALSE)\n * 2. Reducing CSS output size\n * 3. Producing cleaner selectors\n */\n\nimport { Lru } from '../parser/lru';\n\nimport {\n  and,\n  ConditionNode,\n  ContainerCondition,\n  falseCondition,\n  getConditionUniqueId,\n  MediaCondition,\n  ModifierCondition,\n  not,\n  NumericBound,\n  or,\n  StateCondition,\n  trueCondition,\n} from './conditions';\n\n// ============================================================================\n// Caching\n// ============================================================================\n\nconst simplifyCache = new Lru<string, ConditionNode>(5000);\n\n// ============================================================================\n// Main Simplify Function\n// ============================================================================\n\n/**\n * Simplify a condition tree aggressively.\n *\n * This applies all possible simplification rules:\n * - Boolean algebra (identity, annihilator, idempotent, absorption)\n * - Contradiction detection (A & !A → FALSE)\n * - Tautology detection (A | !A → TRUE)\n * - Range intersection for numeric queries\n * - Attribute value conflict detection\n * - Deduplication and sorting\n */\nexport function simplifyCondition(node: ConditionNode): ConditionNode {\n  // Check cache\n  const key = getConditionUniqueId(node);\n  const cached = simplifyCache.get(key);\n  if (cached) {\n    return cached;\n  }\n\n  const result = simplifyInner(node);\n\n  // Cache result\n  simplifyCache.set(key, result);\n\n  return result;\n}\n\n/**\n * Clear the simplify cache (for testing)\n */\nexport function clearSimplifyCache(): void {\n  simplifyCache.clear();\n}\n\n// ============================================================================\n// Inner Simplification\n// ============================================================================\n\nfunction simplifyInner(node: ConditionNode): ConditionNode {\n  // Base cases\n  if (node.kind === 'true' || node.kind === 'false') {\n    return node;\n  }\n\n  // State conditions - return as-is (they're already leaf nodes)\n  if (node.kind === 'state') {\n    return node;\n  }\n\n  // Compound conditions - recursively simplify\n  if (node.kind === 'compound') {\n    // First, recursively simplify all children\n    const simplifiedChildren = node.children.map((c) => simplifyInner(c));\n\n    // Then apply compound-specific simplifications\n    if (node.operator === 'AND') {\n      return simplifyAnd(simplifiedChildren);\n    } else {\n      return simplifyOr(simplifiedChildren);\n    }\n  }\n\n  return node;\n}\n\n// ============================================================================\n// AND Simplification\n// ============================================================================\n\nfunction simplifyAnd(children: ConditionNode[]): ConditionNode {\n  let terms: ConditionNode[] = [];\n\n  // Flatten nested ANDs and handle TRUE/FALSE\n  for (const child of children) {\n    if (child.kind === 'false') {\n      // AND with FALSE → FALSE\n      return falseCondition();\n    }\n    if (child.kind === 'true') {\n      // AND with TRUE → skip (identity)\n      continue;\n    }\n    if (child.kind === 'compound' && child.operator === 'AND') {\n      // Flatten nested AND\n      terms.push(...child.children);\n    } else {\n      terms.push(child);\n    }\n  }\n\n  // Empty → TRUE\n  if (terms.length === 0) {\n    return trueCondition();\n  }\n\n  // Single term → return it\n  if (terms.length === 1) {\n    return terms[0];\n  }\n\n  // Check for contradictions\n  if (hasContradiction(terms)) {\n    return falseCondition();\n  }\n\n  // Check for range contradictions in media/container queries\n  if (hasRangeContradiction(terms)) {\n    return falseCondition();\n  }\n\n  // Check for attribute value conflicts\n  if (hasAttributeConflict(terms)) {\n    return falseCondition();\n  }\n\n  // Check for container style query conflicts\n  if (hasContainerStyleConflict(terms)) {\n    return falseCondition();\n  }\n\n  // Remove redundant negations implied by positive terms\n  // e.g., style(--variant: danger) implies NOT style(--variant: success)\n  // and style(--variant: danger) implies style(--variant) (existence)\n  terms = removeImpliedNegations(terms);\n\n  // Deduplicate (by uniqueId)\n  terms = deduplicateTerms(terms);\n\n  // Try to merge numeric ranges\n  terms = mergeRanges(terms);\n\n  // Sort for canonical form\n  terms = sortTerms(terms);\n\n  // Apply absorption: A & (A | B) → A\n  terms = applyAbsorptionAnd(terms);\n\n  if (terms.length === 0) {\n    return trueCondition();\n  }\n  if (terms.length === 1) {\n    return terms[0];\n  }\n\n  return {\n    kind: 'compound',\n    operator: 'AND',\n    children: terms,\n  };\n}\n\n// ============================================================================\n// OR Simplification\n// ============================================================================\n\nfunction simplifyOr(children: ConditionNode[]): ConditionNode {\n  let terms: ConditionNode[] = [];\n\n  // Flatten nested ORs and handle TRUE/FALSE\n  for (const child of children) {\n    if (child.kind === 'true') {\n      // OR with TRUE → TRUE\n      return trueCondition();\n    }\n    if (child.kind === 'false') {\n      // OR with FALSE → skip (identity)\n      continue;\n    }\n    if (child.kind === 'compound' && child.operator === 'OR') {\n      // Flatten nested OR\n      terms.push(...child.children);\n    } else {\n      terms.push(child);\n    }\n  }\n\n  // Empty → FALSE\n  if (terms.length === 0) {\n    return falseCondition();\n  }\n\n  // Single term → return it\n  if (terms.length === 1) {\n    return terms[0];\n  }\n\n  // Check for tautologies (A | !A)\n  if (hasTautology(terms)) {\n    return trueCondition();\n  }\n\n  // Deduplicate\n  terms = deduplicateTerms(terms);\n\n  // Sort for canonical form\n  terms = sortTerms(terms);\n\n  // Apply absorption: A | (A & B) → A\n  terms = applyAbsorptionOr(terms);\n\n  if (terms.length === 0) {\n    return falseCondition();\n  }\n  if (terms.length === 1) {\n    return terms[0];\n  }\n\n  return {\n    kind: 'compound',\n    operator: 'OR',\n    children: terms,\n  };\n}\n\n// ============================================================================\n// Contradiction Detection\n// ============================================================================\n\n/**\n * Check if any term contradicts another (A & !A)\n */\nfunction hasContradiction(terms: ConditionNode[]): boolean {\n  const uniqueIds = new Set<string>();\n\n  for (const term of terms) {\n    if (term.kind !== 'state') continue;\n\n    const id = term.uniqueId;\n    // Check if negation exists\n    const negatedId = term.negated ? id.slice(1) : `!${id}`;\n\n    if (uniqueIds.has(negatedId)) {\n      return true;\n    }\n    uniqueIds.add(id);\n  }\n\n  return false;\n}\n\n/**\n * Check for tautologies (A | !A)\n */\nfunction hasTautology(terms: ConditionNode[]): boolean {\n  const uniqueIds = new Set<string>();\n\n  for (const term of terms) {\n    if (term.kind !== 'state') continue;\n\n    const id = term.uniqueId;\n    const negatedId = term.negated ? id.slice(1) : `!${id}`;\n\n    if (uniqueIds.has(negatedId)) {\n      return true;\n    }\n    uniqueIds.add(id);\n  }\n\n  return false;\n}\n\n// ============================================================================\n// Range Contradiction Detection\n// ============================================================================\n\n/**\n * Effective bounds computed from conditions (including negated single-bound conditions)\n */\ninterface EffectiveBounds {\n  lowerBound: number | null;\n  lowerInclusive: boolean;\n  upperBound: number | null;\n  upperInclusive: boolean;\n}\n\n/**\n * Excluded range from a negated range condition\n */\ninterface ExcludedRange {\n  lower: number;\n  lowerInclusive: boolean;\n  upper: number;\n  upperInclusive: boolean;\n}\n\n/**\n * Check for range contradictions in media/container queries\n * e.g., @media(w < 400px) & @media(w > 800px) → FALSE\n *\n * Also handles negated conditions:\n * - Single-bound negations are inverted (not (w < 600px) → w >= 600px)\n * - Range negations create excluded ranges that are checked against positive bounds\n */\nfunction hasRangeContradiction(terms: ConditionNode[]): boolean {\n  // Group by dimension, separating positive and negated conditions\n  const mediaByDim = new Map<\n    string,\n    { positive: MediaCondition[]; negated: MediaCondition[] }\n  >();\n  const containerByDim = new Map<\n    string,\n    { positive: ContainerCondition[]; negated: ContainerCondition[] }\n  >();\n\n  for (const term of terms) {\n    if (term.kind !== 'state') continue;\n\n    if (term.type === 'media' && term.subtype === 'dimension') {\n      const key = term.dimension || 'width';\n      if (!mediaByDim.has(key)) {\n        mediaByDim.set(key, { positive: [], negated: [] });\n      }\n      const group = mediaByDim.get(key)!;\n      if (term.negated) {\n        group.negated.push(term);\n      } else {\n        group.positive.push(term);\n      }\n    }\n\n    if (term.type === 'container' && term.subtype === 'dimension') {\n      const key = `${term.containerName || '_'}:${term.dimension || 'width'}`;\n      if (!containerByDim.has(key)) {\n        containerByDim.set(key, { positive: [], negated: [] });\n      }\n      const group = containerByDim.get(key)!;\n      if (term.negated) {\n        group.negated.push(term);\n      } else {\n        group.positive.push(term);\n      }\n    }\n  }\n\n  // Check each dimension group for impossible ranges\n  for (const group of mediaByDim.values()) {\n    if (rangesAreImpossibleWithNegations(group.positive, group.negated)) {\n      return true;\n    }\n  }\n\n  for (const group of containerByDim.values()) {\n    if (rangesAreImpossibleWithNegations(group.positive, group.negated)) {\n      return true;\n    }\n  }\n\n  return false;\n}\n\n/**\n * Check if conditions are impossible, including negated conditions.\n *\n * For negated single-bound conditions:\n *   not (w < 600px) → w >= 600px (inverted to lower bound)\n *   not (w >= 800px) → w < 800px (inverted to upper bound)\n *\n * For negated range conditions:\n *   not (400px <= w < 800px) → excludes [400, 800)\n *   If the effective bounds fall entirely within an excluded range, it's impossible.\n */\nfunction rangesAreImpossibleWithNegations(\n  positive: (MediaCondition | ContainerCondition)[],\n  negated: (MediaCondition | ContainerCondition)[],\n): boolean {\n  // Start with bounds from positive conditions\n  const bounds = computeEffectiveBounds(positive);\n\n  // Apply inverted bounds from single-bound negated conditions\n  // and collect excluded ranges from range negated conditions\n  const excludedRanges: ExcludedRange[] = [];\n\n  for (const cond of negated) {\n    const hasLower = cond.lowerBound?.valueNumeric != null;\n    const hasUpper = cond.upperBound?.valueNumeric != null;\n\n    if (hasLower && hasUpper) {\n      // Range negation: not (lower <= w < upper) excludes [lower, upper)\n      excludedRanges.push({\n        lower: cond.lowerBound!.valueNumeric!,\n        lowerInclusive: cond.lowerBound!.inclusive,\n        upper: cond.upperBound!.valueNumeric!,\n        upperInclusive: cond.upperBound!.inclusive,\n      });\n    } else if (hasUpper) {\n      // not (w < upper) → w >= upper (becomes lower bound)\n      // not (w <= upper) → w > upper (becomes lower bound, exclusive)\n      const value = cond.upperBound!.valueNumeric!;\n      const inclusive = !cond.upperBound!.inclusive; // flip inclusivity\n\n      if (bounds.lowerBound === null || value > bounds.lowerBound) {\n        bounds.lowerBound = value;\n        bounds.lowerInclusive = inclusive;\n      } else if (value === bounds.lowerBound && !inclusive) {\n        bounds.lowerInclusive = false;\n      }\n    } else if (hasLower) {\n      // not (w >= lower) → w < lower (becomes upper bound)\n      // not (w > lower) → w <= lower (becomes upper bound, inclusive)\n      const value = cond.lowerBound!.valueNumeric!;\n      const inclusive = !cond.lowerBound!.inclusive; // flip inclusivity\n\n      if (bounds.upperBound === null || value < bounds.upperBound) {\n        bounds.upperBound = value;\n        bounds.upperInclusive = inclusive;\n      } else if (value === bounds.upperBound && !inclusive) {\n        bounds.upperInclusive = false;\n      }\n    }\n  }\n\n  // Check if effective bounds are impossible on their own\n  if (bounds.lowerBound !== null && bounds.upperBound !== null) {\n    if (bounds.lowerBound > bounds.upperBound) {\n      return true;\n    }\n    if (\n      bounds.lowerBound === bounds.upperBound &&\n      (!bounds.lowerInclusive || !bounds.upperInclusive)\n    ) {\n      return true;\n    }\n  }\n\n  // Check if effective bounds fall entirely within any excluded range\n  if (\n    bounds.lowerBound !== null &&\n    bounds.upperBound !== null &&\n    excludedRanges.length > 0\n  ) {\n    for (const excluded of excludedRanges) {\n      if (boundsWithinExcludedRange(bounds, excluded)) {\n        return true;\n      }\n    }\n  }\n\n  return false;\n}\n\n/**\n * Compute effective bounds from positive (non-negated) conditions\n */\nfunction computeEffectiveBounds(\n  conditions: (MediaCondition | ContainerCondition)[],\n): EffectiveBounds {\n  let lowerBound: number | null = null;\n  let lowerInclusive = false;\n  let upperBound: number | null = null;\n  let upperInclusive = false;\n\n  for (const cond of conditions) {\n    if (cond.lowerBound?.valueNumeric != null) {\n      const value = cond.lowerBound.valueNumeric;\n      const inclusive = cond.lowerBound.inclusive;\n\n      if (lowerBound === null || value > lowerBound) {\n        lowerBound = value;\n        lowerInclusive = inclusive;\n      } else if (value === lowerBound && !inclusive) {\n        lowerInclusive = false;\n      }\n    }\n\n    if (cond.upperBound?.valueNumeric != null) {\n      const value = cond.upperBound.valueNumeric;\n      const inclusive = cond.upperBound.inclusive;\n\n      if (upperBound === null || value < upperBound) {\n        upperBound = value;\n        upperInclusive = inclusive;\n      } else if (value === upperBound && !inclusive) {\n        upperInclusive = false;\n      }\n    }\n  }\n\n  return { lowerBound, lowerInclusive, upperBound, upperInclusive };\n}\n\n/**\n * Check if effective bounds fall entirely within an excluded range.\n *\n * For example:\n *   Effective: [400, 800)\n *   Excluded:  [400, 800)\n *   → bounds fall entirely within excluded range → impossible\n */\nfunction boundsWithinExcludedRange(\n  bounds: EffectiveBounds,\n  excluded: ExcludedRange,\n): boolean {\n  if (bounds.lowerBound === null || bounds.upperBound === null) {\n    return false;\n  }\n\n  // Check if bounds.lower >= excluded.lower\n  let lowerOk = false;\n  if (bounds.lowerBound > excluded.lower) {\n    lowerOk = true;\n  } else if (bounds.lowerBound === excluded.lower) {\n    // If excluded includes lower, and bounds includes or excludes lower, it's within\n    // If excluded excludes lower, bounds must also exclude it to be within\n    lowerOk = excluded.lowerInclusive || !bounds.lowerInclusive;\n  }\n\n  // Check if bounds.upper <= excluded.upper\n  let upperOk = false;\n  if (bounds.upperBound < excluded.upper) {\n    upperOk = true;\n  } else if (bounds.upperBound === excluded.upper) {\n    // If excluded includes upper, and bounds includes or excludes upper, it's within\n    // If excluded excludes upper, bounds must also exclude it to be within\n    upperOk = excluded.upperInclusive || !bounds.upperInclusive;\n  }\n\n  return lowerOk && upperOk;\n}\n\n// ============================================================================\n// Attribute Conflict Detection\n// ============================================================================\n\n/**\n * Check for attribute value conflicts\n * e.g., [data-theme=\"dark\"] & [data-theme=\"light\"] → FALSE\n * e.g., [data-theme=\"dark\"] & ![data-theme] → FALSE\n */\nfunction hasAttributeConflict(terms: ConditionNode[]): boolean {\n  // Group modifiers by attribute\n  const modifiersByAttr = new Map<\n    string,\n    { positive: ModifierCondition[]; negated: ModifierCondition[] }\n  >();\n\n  for (const term of terms) {\n    if (term.kind !== 'state' || term.type !== 'modifier') continue;\n\n    const attr = term.attribute;\n    if (!modifiersByAttr.has(attr)) {\n      modifiersByAttr.set(attr, { positive: [], negated: [] });\n    }\n\n    const group = modifiersByAttr.get(attr)!;\n    if (term.negated) {\n      group.negated.push(term);\n    } else {\n      group.positive.push(term);\n    }\n  }\n\n  // Check each attribute for conflicts\n  for (const [attr, group] of modifiersByAttr) {\n    // Multiple different values for same attribute in positive → conflict\n    const positiveValues = group.positive\n      .filter((m) => m.value !== undefined)\n      .map((m) => m.value);\n    const uniquePositiveValues = new Set(positiveValues);\n    if (uniquePositiveValues.size > 1) {\n      return true;\n    }\n\n    // Positive value + negated boolean for same attribute → conflict\n    // e.g., [data-theme=\"dark\"] & ![data-theme]\n    const hasPositiveValue = group.positive.some((m) => m.value !== undefined);\n    const hasNegatedBoolean = group.negated.some((m) => m.value === undefined);\n    if (hasPositiveValue && hasNegatedBoolean) {\n      return true;\n    }\n\n    // Positive boolean + negated value (same value) → tautology not conflict\n    // But positive value + negated same value → conflict\n    for (const pos of group.positive) {\n      if (pos.value !== undefined) {\n        for (const neg of group.negated) {\n          if (neg.value === pos.value) {\n            return true; // [data-x=\"y\"] & ![data-x=\"y\"]\n          }\n        }\n      }\n    }\n  }\n\n  return false;\n}\n\n// ============================================================================\n// Container Style Query Conflict Detection\n// ============================================================================\n\n/**\n * Check for container style query conflicts\n * e.g., style(--variant: danger) & style(--variant: success) → FALSE\n * e.g., style(--variant: danger) & not style(--variant) → FALSE\n */\nfunction hasContainerStyleConflict(terms: ConditionNode[]): boolean {\n  // Group container style queries by property (and container name)\n  const styleByProp = new Map<\n    string,\n    { positive: ContainerCondition[]; negated: ContainerCondition[] }\n  >();\n\n  for (const term of terms) {\n    if (\n      term.kind !== 'state' ||\n      term.type !== 'container' ||\n      term.subtype !== 'style'\n    )\n      continue;\n\n    const key = `${term.containerName || '_'}:${term.property}`;\n    if (!styleByProp.has(key)) {\n      styleByProp.set(key, { positive: [], negated: [] });\n    }\n\n    const group = styleByProp.get(key)!;\n    if (term.negated) {\n      group.negated.push(term);\n    } else {\n      group.positive.push(term);\n    }\n  }\n\n  // Check each property for conflicts\n  for (const [, group] of styleByProp) {\n    // Multiple different values for same property in positive → conflict\n    // e.g., style(--variant: danger) & style(--variant: success)\n    const positiveValues = group.positive\n      .filter((c) => c.propertyValue !== undefined)\n      .map((c) => c.propertyValue);\n    const uniquePositiveValues = new Set(positiveValues);\n    if (uniquePositiveValues.size > 1) {\n      return true;\n    }\n\n    // Positive value + negated existence → conflict\n    // e.g., style(--variant: danger) & not style(--variant)\n    const hasPositiveValue = group.positive.some(\n      (c) => c.propertyValue !== undefined,\n    );\n    const hasNegatedExistence = group.negated.some(\n      (c) => c.propertyValue === undefined,\n    );\n    if (hasPositiveValue && hasNegatedExistence) {\n      return true;\n    }\n\n    // Positive value + negated same value → conflict\n    // e.g., style(--variant: danger) & not style(--variant: danger)\n    for (const pos of group.positive) {\n      if (pos.propertyValue !== undefined) {\n        for (const neg of group.negated) {\n          if (neg.propertyValue === pos.propertyValue) {\n            return true;\n          }\n        }\n      }\n    }\n  }\n\n  return false;\n}\n\n// ============================================================================\n// Implied Negation Removal\n// ============================================================================\n\n/**\n * Remove negations that are implied by positive terms.\n *\n * Key optimizations:\n * 1. style(--variant: danger) implies NOT style(--variant: success)\n *    → If we have style(--variant: danger) & not style(--variant: success),\n *      the negation is redundant and can be removed.\n *\n * 2. [data-theme=\"dark\"] implies NOT [data-theme=\"light\"]\n *    → Same logic for attribute selectors.\n *\n * This produces cleaner CSS:\n *   Before: @container style(--variant: danger) and (not style(--variant: success))\n *   After:  @container style(--variant: danger)\n */\nfunction removeImpliedNegations(terms: ConditionNode[]): ConditionNode[] {\n  // Build sets of positive container style properties with specific values\n  const positiveContainerStyles = new Map<string, string | undefined>();\n  // key: \"containerName:property\", value: propertyValue (or undefined for existence)\n\n  // Build sets of positive modifier attributes with specific values\n  const positiveModifiers = new Map<string, string | undefined>();\n  // key: \"attribute\", value: value (or undefined for boolean)\n\n  for (const term of terms) {\n    if (term.kind !== 'state' || term.negated) continue;\n\n    if (term.type === 'container' && term.subtype === 'style') {\n      const key = `${term.containerName || '_'}:${term.property}`;\n      // Only track if we have a specific value (not just existence check)\n      if (term.propertyValue !== undefined) {\n        positiveContainerStyles.set(key, term.propertyValue);\n      }\n    }\n\n    if (term.type === 'modifier' && term.value !== undefined) {\n      positiveModifiers.set(term.attribute, term.value);\n    }\n  }\n\n  // Filter out redundant negations\n  return terms.filter((term) => {\n    if (term.kind !== 'state' || !term.negated) return true;\n\n    // Check container style negations\n    if (term.type === 'container' && term.subtype === 'style') {\n      const key = `${term.containerName || '_'}:${term.property}`;\n      const positiveValue = positiveContainerStyles.get(key);\n\n      if (positiveValue !== undefined) {\n        // We have a positive style(--prop: X) for this property\n\n        if (term.propertyValue === undefined) {\n          // Negating existence: not style(--prop)\n          // But we have style(--prop: X), which implies existence → contradiction\n          // This should have been caught by hasContainerStyleConflict\n          return true;\n        }\n\n        if (term.propertyValue !== positiveValue) {\n          // Negating a different value: not style(--prop: Y)\n          // We have style(--prop: X), which implies not style(--prop: Y)\n          // → This negation is redundant!\n          return false;\n        }\n      }\n    }\n\n    // Check modifier negations\n    if (term.type === 'modifier') {\n      const positiveValue = positiveModifiers.get(term.attribute);\n\n      if (positiveValue !== undefined && term.value !== undefined) {\n        // We have [attr=\"X\"] and this is not [attr=\"Y\"]\n        if (term.value !== positiveValue) {\n          // [attr=\"X\"] implies not [attr=\"Y\"] → redundant\n          return false;\n        }\n      }\n    }\n\n    return true;\n  });\n}\n\n// ============================================================================\n// Deduplication\n// ============================================================================\n\nfunction deduplicateTerms(terms: ConditionNode[]): ConditionNode[] {\n  const seen = new Set<string>();\n  const result: ConditionNode[] = [];\n\n  for (const term of terms) {\n    const id = getConditionUniqueId(term);\n    if (!seen.has(id)) {\n      seen.add(id);\n      result.push(term);\n    }\n  }\n\n  return result;\n}\n\n// ============================================================================\n// Range Merging\n// ============================================================================\n\n/**\n * Merge compatible range conditions\n * e.g., @media(w >= 400px) & @media(w <= 800px) → @media(400px <= w <= 800px)\n */\nfunction mergeRanges(terms: ConditionNode[]): ConditionNode[] {\n  // Group media conditions by dimension\n  const mediaByDim = new Map<\n    string,\n    { conditions: MediaCondition[]; indices: number[] }\n  >();\n  const containerByDim = new Map<\n    string,\n    { conditions: ContainerCondition[]; indices: number[] }\n  >();\n\n  terms.forEach((term, index) => {\n    if (term.kind !== 'state') return;\n\n    if (\n      term.type === 'media' &&\n      term.subtype === 'dimension' &&\n      !term.negated\n    ) {\n      const key = term.dimension || 'width';\n      if (!mediaByDim.has(key)) {\n        mediaByDim.set(key, { conditions: [], indices: [] });\n      }\n      const group = mediaByDim.get(key)!;\n      group.conditions.push(term);\n      group.indices.push(index);\n    }\n\n    if (\n      term.type === 'container' &&\n      term.subtype === 'dimension' &&\n      !term.negated\n    ) {\n      const key = `${term.containerName || '_'}:${term.dimension || 'width'}`;\n      if (!containerByDim.has(key)) {\n        containerByDim.set(key, { conditions: [], indices: [] });\n      }\n      const group = containerByDim.get(key)!;\n      group.conditions.push(term);\n      group.indices.push(index);\n    }\n  });\n\n  // Track indices to remove\n  const indicesToRemove = new Set<number>();\n  const mergedTerms: ConditionNode[] = [];\n\n  // Merge media conditions\n  for (const [dim, group] of mediaByDim) {\n    if (group.conditions.length > 1) {\n      const merged = mergeMediaRanges(group.conditions);\n      if (merged) {\n        group.indices.forEach((i) => indicesToRemove.add(i));\n        mergedTerms.push(merged);\n      }\n    }\n  }\n\n  // Merge container conditions\n  for (const [, group] of containerByDim) {\n    if (group.conditions.length > 1) {\n      const merged = mergeContainerRanges(group.conditions);\n      if (merged) {\n        group.indices.forEach((i) => indicesToRemove.add(i));\n        mergedTerms.push(merged);\n      }\n    }\n  }\n\n  // Build result\n  const result: ConditionNode[] = [];\n  terms.forEach((term, index) => {\n    if (!indicesToRemove.has(index)) {\n      result.push(term);\n    }\n  });\n  result.push(...mergedTerms);\n\n  return result;\n}\n\nfunction mergeMediaRanges(conditions: MediaCondition[]): MediaCondition | null {\n  if (conditions.length === 0) return null;\n\n  let lowerBound: NumericBound | undefined;\n  let upperBound: NumericBound | undefined;\n\n  for (const cond of conditions) {\n    if (cond.lowerBound) {\n      if (\n        !lowerBound ||\n        (cond.lowerBound.valueNumeric ?? -Infinity) >\n          (lowerBound.valueNumeric ?? -Infinity)\n      ) {\n        lowerBound = cond.lowerBound;\n      }\n    }\n    if (cond.upperBound) {\n      if (\n        !upperBound ||\n        (cond.upperBound.valueNumeric ?? Infinity) <\n          (upperBound.valueNumeric ?? Infinity)\n      ) {\n        upperBound = cond.upperBound;\n      }\n    }\n  }\n\n  const base = conditions[0];\n\n  // Build a merged condition\n  const merged: MediaCondition = {\n    kind: 'state',\n    type: 'media',\n    subtype: 'dimension',\n    negated: false,\n    raw: buildMergedRaw(base.dimension || 'width', lowerBound, upperBound),\n    uniqueId: '', // Will be recalculated\n    dimension: base.dimension,\n    lowerBound,\n    upperBound,\n  };\n\n  // Recalculate uniqueId\n  const parts = ['media', 'dim', merged.dimension];\n  if (lowerBound) {\n    parts.push(lowerBound.inclusive ? '>=' : '>');\n    parts.push(lowerBound.value);\n  }\n  if (upperBound) {\n    parts.push(upperBound.inclusive ? '<=' : '<');\n    parts.push(upperBound.value);\n  }\n  merged.uniqueId = parts.join(':');\n\n  return merged;\n}\n\nfunction mergeContainerRanges(\n  conditions: ContainerCondition[],\n): ContainerCondition | null {\n  if (conditions.length === 0) return null;\n\n  let lowerBound: NumericBound | undefined;\n  let upperBound: NumericBound | undefined;\n\n  for (const cond of conditions) {\n    if (cond.lowerBound) {\n      if (\n        !lowerBound ||\n        (cond.lowerBound.valueNumeric ?? -Infinity) >\n          (lowerBound.valueNumeric ?? -Infinity)\n      ) {\n        lowerBound = cond.lowerBound;\n      }\n    }\n    if (cond.upperBound) {\n      if (\n        !upperBound ||\n        (cond.upperBound.valueNumeric ?? Infinity) <\n          (upperBound.valueNumeric ?? Infinity)\n      ) {\n        upperBound = cond.upperBound;\n      }\n    }\n  }\n\n  const base = conditions[0];\n\n  const merged: ContainerCondition = {\n    kind: 'state',\n    type: 'container',\n    subtype: 'dimension',\n    negated: false,\n    raw: buildMergedRaw(base.dimension || 'width', lowerBound, upperBound),\n    uniqueId: '', // Will be recalculated\n    containerName: base.containerName,\n    dimension: base.dimension,\n    lowerBound,\n    upperBound,\n  };\n\n  // Recalculate uniqueId\n  const name = merged.containerName || '_';\n  const parts = ['container', 'dim', name, merged.dimension];\n  if (lowerBound) {\n    parts.push(lowerBound.inclusive ? '>=' : '>');\n    parts.push(lowerBound.value);\n  }\n  if (upperBound) {\n    parts.push(upperBound.inclusive ? '<=' : '<');\n    parts.push(upperBound.value);\n  }\n  merged.uniqueId = parts.join(':');\n\n  return merged;\n}\n\nfunction buildMergedRaw(\n  dimension: string,\n  lowerBound?: NumericBound,\n  upperBound?: NumericBound,\n): string {\n  if (lowerBound && upperBound) {\n    const lowerOp = lowerBound.inclusive ? '<=' : '<';\n    const upperOp = upperBound.inclusive ? '<=' : '<';\n    return `@media(${lowerBound.value} ${lowerOp} ${dimension} ${upperOp} ${upperBound.value})`;\n  } else if (upperBound) {\n    const op = upperBound.inclusive ? '<=' : '<';\n    return `@media(${dimension} ${op} ${upperBound.value})`;\n  } else if (lowerBound) {\n    const op = lowerBound.inclusive ? '>=' : '>';\n    return `@media(${dimension} ${op} ${lowerBound.value})`;\n  }\n  return '@media()';\n}\n\n// ============================================================================\n// Sorting\n// ============================================================================\n\nfunction sortTerms(terms: ConditionNode[]): ConditionNode[] {\n  return [...terms].sort((a, b) => {\n    const idA = getConditionUniqueId(a);\n    const idB = getConditionUniqueId(b);\n    return idA.localeCompare(idB);\n  });\n}\n\n// ============================================================================\n// Absorption\n// ============================================================================\n\n/**\n * Apply absorption law for AND: A & (A | B) → A\n */\nfunction applyAbsorptionAnd(terms: ConditionNode[]): ConditionNode[] {\n  // Collect all unique IDs of simple terms\n  const simpleIds = new Set<string>();\n  for (const term of terms) {\n    if (term.kind !== 'compound') {\n      simpleIds.add(getConditionUniqueId(term));\n    }\n  }\n\n  // Filter out OR terms that are absorbed\n  return terms.filter((term) => {\n    if (term.kind === 'compound' && term.operator === 'OR') {\n      // If any child of this OR is in simpleIds, absorb the whole OR\n      for (const child of term.children) {\n        if (simpleIds.has(getConditionUniqueId(child))) {\n          return false; // Absorb\n        }\n      }\n    }\n    return true;\n  });\n}\n\n/**\n * Apply absorption law for OR: A | (A & B) → A\n */\nfunction applyAbsorptionOr(terms: ConditionNode[]): ConditionNode[] {\n  // Collect all unique IDs of simple terms\n  const simpleIds = new Set<string>();\n  for (const term of terms) {\n    if (term.kind !== 'compound') {\n      simpleIds.add(getConditionUniqueId(term));\n    }\n  }\n\n  // Filter out AND terms that are absorbed\n  return terms.filter((term) => {\n    if (term.kind === 'compound' && term.operator === 'AND') {\n      // If any child of this AND is in simpleIds, absorb the whole AND\n      for (const child of term.children) {\n        if (simpleIds.has(getConditionUniqueId(child))) {\n          return false; // Absorb\n        }\n      }\n    }\n    return true;\n  });\n}\n"],"mappings":";;;;;;;;;;;;;;;;AAiCA,MAAM,gBAAgB,IAAI,IAA2B,IAAK;;;;;;;;;;;;AAiB1D,SAAgB,kBAAkB,MAAoC;CAEpE,MAAM,MAAM,qBAAqB,KAAK;CACtC,MAAM,SAAS,cAAc,IAAI,IAAI;AACrC,KAAI,OACF,QAAO;CAGT,MAAM,SAAS,cAAc,KAAK;AAGlC,eAAc,IAAI,KAAK,OAAO;AAE9B,QAAO;;AAcT,SAAS,cAAc,MAAoC;AAEzD,KAAI,KAAK,SAAS,UAAU,KAAK,SAAS,QACxC,QAAO;AAIT,KAAI,KAAK,SAAS,QAChB,QAAO;AAIT,KAAI,KAAK,SAAS,YAAY;EAE5B,MAAM,qBAAqB,KAAK,SAAS,KAAK,MAAM,cAAc,EAAE,CAAC;AAGrE,MAAI,KAAK,aAAa,MACpB,QAAO,YAAY,mBAAmB;MAEtC,QAAO,WAAW,mBAAmB;;AAIzC,QAAO;;AAOT,SAAS,YAAY,UAA0C;CAC7D,IAAI,QAAyB,EAAE;AAG/B,MAAK,MAAM,SAAS,UAAU;AAC5B,MAAI,MAAM,SAAS,QAEjB,QAAO,gBAAgB;AAEzB,MAAI,MAAM,SAAS,OAEjB;AAEF,MAAI,MAAM,SAAS,cAAc,MAAM,aAAa,MAElD,OAAM,KAAK,GAAG,MAAM,SAAS;MAE7B,OAAM,KAAK,MAAM;;AAKrB,KAAI,MAAM,WAAW,EACnB,QAAO,eAAe;AAIxB,KAAI,MAAM,WAAW,EACnB,QAAO,MAAM;AAIf,KAAI,iBAAiB,MAAM,CACzB,QAAO,gBAAgB;AAIzB,KAAI,sBAAsB,MAAM,CAC9B,QAAO,gBAAgB;AAIzB,KAAI,qBAAqB,MAAM,CAC7B,QAAO,gBAAgB;AAIzB,KAAI,0BAA0B,MAAM,CAClC,QAAO,gBAAgB;AAMzB,SAAQ,uBAAuB,MAAM;AAGrC,SAAQ,iBAAiB,MAAM;AAG/B,SAAQ,YAAY,MAAM;AAG1B,SAAQ,UAAU,MAAM;AAGxB,SAAQ,mBAAmB,MAAM;AAEjC,KAAI,MAAM,WAAW,EACnB,QAAO,eAAe;AAExB,KAAI,MAAM,WAAW,EACnB,QAAO,MAAM;AAGf,QAAO;EACL,MAAM;EACN,UAAU;EACV,UAAU;EACX;;AAOH,SAAS,WAAW,UAA0C;CAC5D,IAAI,QAAyB,EAAE;AAG/B,MAAK,MAAM,SAAS,UAAU;AAC5B,MAAI,MAAM,SAAS,OAEjB,QAAO,eAAe;AAExB,MAAI,MAAM,SAAS,QAEjB;AAEF,MAAI,MAAM,SAAS,cAAc,MAAM,aAAa,KAElD,OAAM,KAAK,GAAG,MAAM,SAAS;MAE7B,OAAM,KAAK,MAAM;;AAKrB,KAAI,MAAM,WAAW,EACnB,QAAO,gBAAgB;AAIzB,KAAI,MAAM,WAAW,EACnB,QAAO,MAAM;AAIf,KAAI,aAAa,MAAM,CACrB,QAAO,eAAe;AAIxB,SAAQ,iBAAiB,MAAM;AAG/B,SAAQ,UAAU,MAAM;AAGxB,SAAQ,kBAAkB,MAAM;AAEhC,KAAI,MAAM,WAAW,EACnB,QAAO,gBAAgB;AAEzB,KAAI,MAAM,WAAW,EACnB,QAAO,MAAM;AAGf,QAAO;EACL,MAAM;EACN,UAAU;EACV,UAAU;EACX;;;;;AAUH,SAAS,iBAAiB,OAAiC;CACzD,MAAM,4BAAY,IAAI,KAAa;AAEnC,MAAK,MAAM,QAAQ,OAAO;AACxB,MAAI,KAAK,SAAS,QAAS;EAE3B,MAAM,KAAK,KAAK;EAEhB,MAAM,YAAY,KAAK,UAAU,GAAG,MAAM,EAAE,GAAG,IAAI;AAEnD,MAAI,UAAU,IAAI,UAAU,CAC1B,QAAO;AAET,YAAU,IAAI,GAAG;;AAGnB,QAAO;;;;;AAMT,SAAS,aAAa,OAAiC;CACrD,MAAM,4BAAY,IAAI,KAAa;AAEnC,MAAK,MAAM,QAAQ,OAAO;AACxB,MAAI,KAAK,SAAS,QAAS;EAE3B,MAAM,KAAK,KAAK;EAChB,MAAM,YAAY,KAAK,UAAU,GAAG,MAAM,EAAE,GAAG,IAAI;AAEnD,MAAI,UAAU,IAAI,UAAU,CAC1B,QAAO;AAET,YAAU,IAAI,GAAG;;AAGnB,QAAO;;;;;;;;;;AAmCT,SAAS,sBAAsB,OAAiC;CAE9D,MAAM,6BAAa,IAAI,KAGpB;CACH,MAAM,iCAAiB,IAAI,KAGxB;AAEH,MAAK,MAAM,QAAQ,OAAO;AACxB,MAAI,KAAK,SAAS,QAAS;AAE3B,MAAI,KAAK,SAAS,WAAW,KAAK,YAAY,aAAa;GACzD,MAAM,MAAM,KAAK,aAAa;AAC9B,OAAI,CAAC,WAAW,IAAI,IAAI,CACtB,YAAW,IAAI,KAAK;IAAE,UAAU,EAAE;IAAE,SAAS,EAAE;IAAE,CAAC;GAEpD,MAAM,QAAQ,WAAW,IAAI,IAAI;AACjC,OAAI,KAAK,QACP,OAAM,QAAQ,KAAK,KAAK;OAExB,OAAM,SAAS,KAAK,KAAK;;AAI7B,MAAI,KAAK,SAAS,eAAe,KAAK,YAAY,aAAa;GAC7D,MAAM,MAAM,GAAG,KAAK,iBAAiB,IAAI,GAAG,KAAK,aAAa;AAC9D,OAAI,CAAC,eAAe,IAAI,IAAI,CAC1B,gBAAe,IAAI,KAAK;IAAE,UAAU,EAAE;IAAE,SAAS,EAAE;IAAE,CAAC;GAExD,MAAM,QAAQ,eAAe,IAAI,IAAI;AACrC,OAAI,KAAK,QACP,OAAM,QAAQ,KAAK,KAAK;OAExB,OAAM,SAAS,KAAK,KAAK;;;AAM/B,MAAK,MAAM,SAAS,WAAW,QAAQ,CACrC,KAAI,iCAAiC,MAAM,UAAU,MAAM,QAAQ,CACjE,QAAO;AAIX,MAAK,MAAM,SAAS,eAAe,QAAQ,CACzC,KAAI,iCAAiC,MAAM,UAAU,MAAM,QAAQ,CACjE,QAAO;AAIX,QAAO;;;;;;;;;;;;;AAcT,SAAS,iCACP,UACA,SACS;CAET,MAAM,SAAS,uBAAuB,SAAS;CAI/C,MAAM,iBAAkC,EAAE;AAE1C,MAAK,MAAM,QAAQ,SAAS;EAC1B,MAAM,WAAW,KAAK,YAAY,gBAAgB;EAClD,MAAM,WAAW,KAAK,YAAY,gBAAgB;AAElD,MAAI,YAAY,SAEd,gBAAe,KAAK;GAClB,OAAO,KAAK,WAAY;GACxB,gBAAgB,KAAK,WAAY;GACjC,OAAO,KAAK,WAAY;GACxB,gBAAgB,KAAK,WAAY;GAClC,CAAC;WACO,UAAU;GAGnB,MAAM,QAAQ,KAAK,WAAY;GAC/B,MAAM,YAAY,CAAC,KAAK,WAAY;AAEpC,OAAI,OAAO,eAAe,QAAQ,QAAQ,OAAO,YAAY;AAC3D,WAAO,aAAa;AACpB,WAAO,iBAAiB;cACf,UAAU,OAAO,cAAc,CAAC,UACzC,QAAO,iBAAiB;aAEjB,UAAU;GAGnB,MAAM,QAAQ,KAAK,WAAY;GAC/B,MAAM,YAAY,CAAC,KAAK,WAAY;AAEpC,OAAI,OAAO,eAAe,QAAQ,QAAQ,OAAO,YAAY;AAC3D,WAAO,aAAa;AACpB,WAAO,iBAAiB;cACf,UAAU,OAAO,cAAc,CAAC,UACzC,QAAO,iBAAiB;;;AAM9B,KAAI,OAAO,eAAe,QAAQ,OAAO,eAAe,MAAM;AAC5D,MAAI,OAAO,aAAa,OAAO,WAC7B,QAAO;AAET,MACE,OAAO,eAAe,OAAO,eAC5B,CAAC,OAAO,kBAAkB,CAAC,OAAO,gBAEnC,QAAO;;AAKX,KACE,OAAO,eAAe,QACtB,OAAO,eAAe,QACtB,eAAe,SAAS,GAExB;OAAK,MAAM,YAAY,eACrB,KAAI,0BAA0B,QAAQ,SAAS,CAC7C,QAAO;;AAKb,QAAO;;;;;AAMT,SAAS,uBACP,YACiB;CACjB,IAAI,aAA4B;CAChC,IAAI,iBAAiB;CACrB,IAAI,aAA4B;CAChC,IAAI,iBAAiB;AAErB,MAAK,MAAM,QAAQ,YAAY;AAC7B,MAAI,KAAK,YAAY,gBAAgB,MAAM;GACzC,MAAM,QAAQ,KAAK,WAAW;GAC9B,MAAM,YAAY,KAAK,WAAW;AAElC,OAAI,eAAe,QAAQ,QAAQ,YAAY;AAC7C,iBAAa;AACb,qBAAiB;cACR,UAAU,cAAc,CAAC,UAClC,kBAAiB;;AAIrB,MAAI,KAAK,YAAY,gBAAgB,MAAM;GACzC,MAAM,QAAQ,KAAK,WAAW;GAC9B,MAAM,YAAY,KAAK,WAAW;AAElC,OAAI,eAAe,QAAQ,QAAQ,YAAY;AAC7C,iBAAa;AACb,qBAAiB;cACR,UAAU,cAAc,CAAC,UAClC,kBAAiB;;;AAKvB,QAAO;EAAE;EAAY;EAAgB;EAAY;EAAgB;;;;;;;;;;AAWnE,SAAS,0BACP,QACA,UACS;AACT,KAAI,OAAO,eAAe,QAAQ,OAAO,eAAe,KACtD,QAAO;CAIT,IAAI,UAAU;AACd,KAAI,OAAO,aAAa,SAAS,MAC/B,WAAU;UACD,OAAO,eAAe,SAAS,MAGxC,WAAU,SAAS,kBAAkB,CAAC,OAAO;CAI/C,IAAI,UAAU;AACd,KAAI,OAAO,aAAa,SAAS,MAC/B,WAAU;UACD,OAAO,eAAe,SAAS,MAGxC,WAAU,SAAS,kBAAkB,CAAC,OAAO;AAG/C,QAAO,WAAW;;;;;;;AAYpB,SAAS,qBAAqB,OAAiC;CAE7D,MAAM,kCAAkB,IAAI,KAGzB;AAEH,MAAK,MAAM,QAAQ,OAAO;AACxB,MAAI,KAAK,SAAS,WAAW,KAAK,SAAS,WAAY;EAEvD,MAAM,OAAO,KAAK;AAClB,MAAI,CAAC,gBAAgB,IAAI,KAAK,CAC5B,iBAAgB,IAAI,MAAM;GAAE,UAAU,EAAE;GAAE,SAAS,EAAE;GAAE,CAAC;EAG1D,MAAM,QAAQ,gBAAgB,IAAI,KAAK;AACvC,MAAI,KAAK,QACP,OAAM,QAAQ,KAAK,KAAK;MAExB,OAAM,SAAS,KAAK,KAAK;;AAK7B,MAAK,MAAM,CAAC,MAAM,UAAU,iBAAiB;EAE3C,MAAM,iBAAiB,MAAM,SAC1B,QAAQ,MAAM,EAAE,UAAU,OAAU,CACpC,KAAK,MAAM,EAAE,MAAM;AAEtB,MAD6B,IAAI,IAAI,eAAe,CAC3B,OAAO,EAC9B,QAAO;EAKT,MAAM,mBAAmB,MAAM,SAAS,MAAM,MAAM,EAAE,UAAU,OAAU;EAC1E,MAAM,oBAAoB,MAAM,QAAQ,MAAM,MAAM,EAAE,UAAU,OAAU;AAC1E,MAAI,oBAAoB,kBACtB,QAAO;AAKT,OAAK,MAAM,OAAO,MAAM,SACtB,KAAI,IAAI,UAAU,QAChB;QAAK,MAAM,OAAO,MAAM,QACtB,KAAI,IAAI,UAAU,IAAI,MACpB,QAAO;;;AAOjB,QAAO;;;;;;;AAYT,SAAS,0BAA0B,OAAiC;CAElE,MAAM,8BAAc,IAAI,KAGrB;AAEH,MAAK,MAAM,QAAQ,OAAO;AACxB,MACE,KAAK,SAAS,WACd,KAAK,SAAS,eACd,KAAK,YAAY,QAEjB;EAEF,MAAM,MAAM,GAAG,KAAK,iBAAiB,IAAI,GAAG,KAAK;AACjD,MAAI,CAAC,YAAY,IAAI,IAAI,CACvB,aAAY,IAAI,KAAK;GAAE,UAAU,EAAE;GAAE,SAAS,EAAE;GAAE,CAAC;EAGrD,MAAM,QAAQ,YAAY,IAAI,IAAI;AAClC,MAAI,KAAK,QACP,OAAM,QAAQ,KAAK,KAAK;MAExB,OAAM,SAAS,KAAK,KAAK;;AAK7B,MAAK,MAAM,GAAG,UAAU,aAAa;EAGnC,MAAM,iBAAiB,MAAM,SAC1B,QAAQ,MAAM,EAAE,kBAAkB,OAAU,CAC5C,KAAK,MAAM,EAAE,cAAc;AAE9B,MAD6B,IAAI,IAAI,eAAe,CAC3B,OAAO,EAC9B,QAAO;EAKT,MAAM,mBAAmB,MAAM,SAAS,MACrC,MAAM,EAAE,kBAAkB,OAC5B;EACD,MAAM,sBAAsB,MAAM,QAAQ,MACvC,MAAM,EAAE,kBAAkB,OAC5B;AACD,MAAI,oBAAoB,oBACtB,QAAO;AAKT,OAAK,MAAM,OAAO,MAAM,SACtB,KAAI,IAAI,kBAAkB,QACxB;QAAK,MAAM,OAAO,MAAM,QACtB,KAAI,IAAI,kBAAkB,IAAI,cAC5B,QAAO;;;AAOjB,QAAO;;;;;;;;;;;;;;;;;AAsBT,SAAS,uBAAuB,OAAyC;CAEvE,MAAM,0CAA0B,IAAI,KAAiC;CAIrE,MAAM,oCAAoB,IAAI,KAAiC;AAG/D,MAAK,MAAM,QAAQ,OAAO;AACxB,MAAI,KAAK,SAAS,WAAW,KAAK,QAAS;AAE3C,MAAI,KAAK,SAAS,eAAe,KAAK,YAAY,SAAS;GACzD,MAAM,MAAM,GAAG,KAAK,iBAAiB,IAAI,GAAG,KAAK;AAEjD,OAAI,KAAK,kBAAkB,OACzB,yBAAwB,IAAI,KAAK,KAAK,cAAc;;AAIxD,MAAI,KAAK,SAAS,cAAc,KAAK,UAAU,OAC7C,mBAAkB,IAAI,KAAK,WAAW,KAAK,MAAM;;AAKrD,QAAO,MAAM,QAAQ,SAAS;AAC5B,MAAI,KAAK,SAAS,WAAW,CAAC,KAAK,QAAS,QAAO;AAGnD,MAAI,KAAK,SAAS,eAAe,KAAK,YAAY,SAAS;GACzD,MAAM,MAAM,GAAG,KAAK,iBAAiB,IAAI,GAAG,KAAK;GACjD,MAAM,gBAAgB,wBAAwB,IAAI,IAAI;AAEtD,OAAI,kBAAkB,QAAW;AAG/B,QAAI,KAAK,kBAAkB,OAIzB,QAAO;AAGT,QAAI,KAAK,kBAAkB,cAIzB,QAAO;;;AAMb,MAAI,KAAK,SAAS,YAAY;GAC5B,MAAM,gBAAgB,kBAAkB,IAAI,KAAK,UAAU;AAE3D,OAAI,kBAAkB,UAAa,KAAK,UAAU,QAEhD;QAAI,KAAK,UAAU,cAEjB,QAAO;;;AAKb,SAAO;GACP;;AAOJ,SAAS,iBAAiB,OAAyC;CACjE,MAAM,uBAAO,IAAI,KAAa;CAC9B,MAAM,SAA0B,EAAE;AAElC,MAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,KAAK,qBAAqB,KAAK;AACrC,MAAI,CAAC,KAAK,IAAI,GAAG,EAAE;AACjB,QAAK,IAAI,GAAG;AACZ,UAAO,KAAK,KAAK;;;AAIrB,QAAO;;;;;;AAWT,SAAS,YAAY,OAAyC;CAE5D,MAAM,6BAAa,IAAI,KAGpB;CACH,MAAM,iCAAiB,IAAI,KAGxB;AAEH,OAAM,SAAS,MAAM,UAAU;AAC7B,MAAI,KAAK,SAAS,QAAS;AAE3B,MACE,KAAK,SAAS,WACd,KAAK,YAAY,eACjB,CAAC,KAAK,SACN;GACA,MAAM,MAAM,KAAK,aAAa;AAC9B,OAAI,CAAC,WAAW,IAAI,IAAI,CACtB,YAAW,IAAI,KAAK;IAAE,YAAY,EAAE;IAAE,SAAS,EAAE;IAAE,CAAC;GAEtD,MAAM,QAAQ,WAAW,IAAI,IAAI;AACjC,SAAM,WAAW,KAAK,KAAK;AAC3B,SAAM,QAAQ,KAAK,MAAM;;AAG3B,MACE,KAAK,SAAS,eACd,KAAK,YAAY,eACjB,CAAC,KAAK,SACN;GACA,MAAM,MAAM,GAAG,KAAK,iBAAiB,IAAI,GAAG,KAAK,aAAa;AAC9D,OAAI,CAAC,eAAe,IAAI,IAAI,CAC1B,gBAAe,IAAI,KAAK;IAAE,YAAY,EAAE;IAAE,SAAS,EAAE;IAAE,CAAC;GAE1D,MAAM,QAAQ,eAAe,IAAI,IAAI;AACrC,SAAM,WAAW,KAAK,KAAK;AAC3B,SAAM,QAAQ,KAAK,MAAM;;GAE3B;CAGF,MAAM,kCAAkB,IAAI,KAAa;CACzC,MAAM,cAA+B,EAAE;AAGvC,MAAK,MAAM,CAAC,KAAK,UAAU,WACzB,KAAI,MAAM,WAAW,SAAS,GAAG;EAC/B,MAAM,SAAS,iBAAiB,MAAM,WAAW;AACjD,MAAI,QAAQ;AACV,SAAM,QAAQ,SAAS,MAAM,gBAAgB,IAAI,EAAE,CAAC;AACpD,eAAY,KAAK,OAAO;;;AAM9B,MAAK,MAAM,GAAG,UAAU,eACtB,KAAI,MAAM,WAAW,SAAS,GAAG;EAC/B,MAAM,SAAS,qBAAqB,MAAM,WAAW;AACrD,MAAI,QAAQ;AACV,SAAM,QAAQ,SAAS,MAAM,gBAAgB,IAAI,EAAE,CAAC;AACpD,eAAY,KAAK,OAAO;;;CAM9B,MAAM,SAA0B,EAAE;AAClC,OAAM,SAAS,MAAM,UAAU;AAC7B,MAAI,CAAC,gBAAgB,IAAI,MAAM,CAC7B,QAAO,KAAK,KAAK;GAEnB;AACF,QAAO,KAAK,GAAG,YAAY;AAE3B,QAAO;;AAGT,SAAS,iBAAiB,YAAqD;AAC7E,KAAI,WAAW,WAAW,EAAG,QAAO;CAEpC,IAAI;CACJ,IAAI;AAEJ,MAAK,MAAM,QAAQ,YAAY;AAC7B,MAAI,KAAK,YACP;OACE,CAAC,eACA,KAAK,WAAW,gBAAgB,cAC9B,WAAW,gBAAgB,WAE9B,cAAa,KAAK;;AAGtB,MAAI,KAAK,YACP;OACE,CAAC,eACA,KAAK,WAAW,gBAAgB,aAC9B,WAAW,gBAAgB,UAE9B,cAAa,KAAK;;;CAKxB,MAAM,OAAO,WAAW;CAGxB,MAAM,SAAyB;EAC7B,MAAM;EACN,MAAM;EACN,SAAS;EACT,SAAS;EACT,KAAK,eAAe,KAAK,aAAa,SAAS,YAAY,WAAW;EACtE,UAAU;EACV,WAAW,KAAK;EAChB;EACA;EACD;CAGD,MAAM,QAAQ;EAAC;EAAS;EAAO,OAAO;EAAU;AAChD,KAAI,YAAY;AACd,QAAM,KAAK,WAAW,YAAY,OAAO,IAAI;AAC7C,QAAM,KAAK,WAAW,MAAM;;AAE9B,KAAI,YAAY;AACd,QAAM,KAAK,WAAW,YAAY,OAAO,IAAI;AAC7C,QAAM,KAAK,WAAW,MAAM;;AAE9B,QAAO,WAAW,MAAM,KAAK,IAAI;AAEjC,QAAO;;AAGT,SAAS,qBACP,YAC2B;AAC3B,KAAI,WAAW,WAAW,EAAG,QAAO;CAEpC,IAAI;CACJ,IAAI;AAEJ,MAAK,MAAM,QAAQ,YAAY;AAC7B,MAAI,KAAK,YACP;OACE,CAAC,eACA,KAAK,WAAW,gBAAgB,cAC9B,WAAW,gBAAgB,WAE9B,cAAa,KAAK;;AAGtB,MAAI,KAAK,YACP;OACE,CAAC,eACA,KAAK,WAAW,gBAAgB,aAC9B,WAAW,gBAAgB,UAE9B,cAAa,KAAK;;;CAKxB,MAAM,OAAO,WAAW;CAExB,MAAM,SAA6B;EACjC,MAAM;EACN,MAAM;EACN,SAAS;EACT,SAAS;EACT,KAAK,eAAe,KAAK,aAAa,SAAS,YAAY,WAAW;EACtE,UAAU;EACV,eAAe,KAAK;EACpB,WAAW,KAAK;EAChB;EACA;EACD;CAID,MAAM,QAAQ;EAAC;EAAa;EADf,OAAO,iBAAiB;EACI,OAAO;EAAU;AAC1D,KAAI,YAAY;AACd,QAAM,KAAK,WAAW,YAAY,OAAO,IAAI;AAC7C,QAAM,KAAK,WAAW,MAAM;;AAE9B,KAAI,YAAY;AACd,QAAM,KAAK,WAAW,YAAY,OAAO,IAAI;AAC7C,QAAM,KAAK,WAAW,MAAM;;AAE9B,QAAO,WAAW,MAAM,KAAK,IAAI;AAEjC,QAAO;;AAGT,SAAS,eACP,WACA,YACA,YACQ;AACR,KAAI,cAAc,YAAY;EAC5B,MAAM,UAAU,WAAW,YAAY,OAAO;EAC9C,MAAM,UAAU,WAAW,YAAY,OAAO;AAC9C,SAAO,UAAU,WAAW,MAAM,GAAG,QAAQ,GAAG,UAAU,GAAG,QAAQ,GAAG,WAAW,MAAM;YAChF,WAET,QAAO,UAAU,UAAU,GADhB,WAAW,YAAY,OAAO,IACR,GAAG,WAAW,MAAM;UAC5C,WAET,QAAO,UAAU,UAAU,GADhB,WAAW,YAAY,OAAO,IACR,GAAG,WAAW,MAAM;AAEvD,QAAO;;AAOT,SAAS,UAAU,OAAyC;AAC1D,QAAO,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,MAAM;EAC/B,MAAM,MAAM,qBAAqB,EAAE;EACnC,MAAM,MAAM,qBAAqB,EAAE;AACnC,SAAO,IAAI,cAAc,IAAI;GAC7B;;;;;AAUJ,SAAS,mBAAmB,OAAyC;CAEnE,MAAM,4BAAY,IAAI,KAAa;AACnC,MAAK,MAAM,QAAQ,MACjB,KAAI,KAAK,SAAS,WAChB,WAAU,IAAI,qBAAqB,KAAK,CAAC;AAK7C,QAAO,MAAM,QAAQ,SAAS;AAC5B,MAAI,KAAK,SAAS,cAAc,KAAK,aAAa,MAEhD;QAAK,MAAM,SAAS,KAAK,SACvB,KAAI,UAAU,IAAI,qBAAqB,MAAM,CAAC,CAC5C,QAAO;;AAIb,SAAO;GACP;;;;;AAMJ,SAAS,kBAAkB,OAAyC;CAElE,MAAM,4BAAY,IAAI,KAAa;AACnC,MAAK,MAAM,QAAQ,MACjB,KAAI,KAAK,SAAS,WAChB,WAAU,IAAI,qBAAqB,KAAK,CAAC;AAK7C,QAAO,MAAM,QAAQ,SAAS;AAC5B,MAAI,KAAK,SAAS,cAAc,KAAK,aAAa,OAEhD;QAAK,MAAM,SAAS,KAAK,SACvB,KAAI,UAAU,IAAI,qBAAqB,MAAM,CAAC,CAC5C,QAAO;;AAIb,SAAO;GACP"}