@tenphi/tasty 0.0.0-snapshot.d2dcdeb → 0.0.0-snapshot.d47af4f

package/dist/pipeline/simplify.js

@@ -1,5 +1,5 @@
 import { Lru } from "../parser/lru.js";
-import { falseCondition, getConditionUniqueId, trueCondition } from "./conditions.js";
+import { and, falseCondition, getConditionUniqueId, not, or, trueCondition } from "./conditions.js";
 //#region src/pipeline/simplify.ts
 /**
 * Condition Simplification Engine
@@ -61,6 +61,7 @@ function simplifyAnd(children) {
 	terms = mergeRanges(terms);
 	terms = sortTerms(terms);
 	terms = applyAbsorptionAnd(terms);
+	terms = applyConsensusAnd(terms);
 	if (terms.length === 0) return trueCondition();
 	if (terms.length === 1) return terms[0];
 	return {
@@ -83,6 +84,7 @@ function simplifyOr(children) {
 	terms = deduplicateTerms(terms);
 	terms = sortTerms(terms);
 	terms = applyAbsorptionOr(terms);
+	terms = applyComplementaryFactoring(terms);
 	if (terms.length === 0) return falseCondition();
 	if (terms.length === 1) return terms[0];
 	return {
@@ -481,6 +483,83 @@ function buildMergedRaw(dimension, lowerBound, upperBound) {
 	else if (lowerBound) return `@media(${dimension} ${lowerBound.inclusive ? ">=" : ">"} ${lowerBound.value})`;
 	return "@media()";
 }
+/**
+* Apply complementary factoring: (A & B) | (A & !B) → A
+*
+* Finds pairs of AND compounds that share all children except one,
+* where the differing child is complementary (X vs !X).
+* Replaces the pair with the common terms.
+*
+* This is applied iteratively until no more reductions are possible,
+* since factoring can expose further simplification opportunities.
+*/
+function applyComplementaryFactoring(terms) {
+	let changed = true;
+	while (changed) {
+		changed = false;
+		for (let i = 0; i < terms.length; i++) {
+			const a = terms[i];
+			if (a.kind !== "compound" || a.operator !== "AND") continue;
+			for (let j = i + 1; j < terms.length; j++) {
+				const b = terms[j];
+				if (b.kind !== "compound" || b.operator !== "AND") continue;
+				const factored = tryFactorPair(a.children, b.children);
+				if (factored) {
+					const replacement = simplifyInner(factored);
+					terms = [
+						...terms.slice(0, i),
+						...terms.slice(i + 1, j),
+						...terms.slice(j + 1),
+						replacement
+					];
+					changed = true;
+					break;
+				}
+			}
+			if (changed) break;
+		}
+	}
+	return terms;
+}
+/**
+* Try to factor two AND children lists.
+*
+* Extracts the common children (by uniqueId). If the remaining
+* (non-common) parts of each side OR to TRUE, the common part alone
+* is sufficient: `(common & restA) | (common & restB) → common`
+* when `restA | restB → TRUE`.
+*
+* Also handles the simpler case where exactly one child is
+* complementary: `[A, B, C]` and `[A, !B, C]` → `AND(A, C)`.
+*/
+function tryFactorPair(aChildren, bChildren) {
+	const aIds = aChildren.map((c) => getConditionUniqueId(c));
+	const bIds = bChildren.map((c) => getConditionUniqueId(c));
+	const bIdSet = new Set(bIds);
+	const aIdSet = new Set(aIds);
+	const commonIndicesA = [];
+	const restIndicesA = [];
+	for (let i = 0; i < aIds.length; i++) if (bIdSet.has(aIds[i])) commonIndicesA.push(i);
+	else restIndicesA.push(i);
+	const restIndicesB = [];
+	for (let i = 0; i < bIds.length; i++) if (!aIdSet.has(bIds[i])) restIndicesB.push(i);
+	if (commonIndicesA.length === 0) return null;
+	if (restIndicesA.length === 0 && restIndicesB.length === 0) return null;
+	const restA = restIndicesA.length === 0 ? trueCondition() : restIndicesA.length === 1 ? aChildren[restIndicesA[0]] : and(...restIndicesA.map((i) => aChildren[i]));
+	const restB = restIndicesB.length === 0 ? trueCondition() : restIndicesB.length === 1 ? bChildren[restIndicesB[0]] : and(...restIndicesB.map((i) => bChildren[i]));
+	if (simplifyInner({
+		kind: "compound",
+		operator: "OR",
+		children: [restA, restB]
+	}).kind !== "true") {
+		const simplifiedRestB = simplifyInner(restB);
+		if (getConditionUniqueId(simplifyInner(not(restA))) !== getConditionUniqueId(simplifiedRestB)) return null;
+	}
+	const common = commonIndicesA.map((i) => aChildren[i]);
+	if (common.length === 0) return trueCondition();
+	if (common.length === 1) return common[0];
+	return and(...common);
+}
 function sortTerms(terms) {
 	const withIds = terms.map((t) => [getConditionUniqueId(t), t]);
 	withIds.sort((a, b) => a[0].localeCompare(b[0]));
@@ -488,17 +567,38 @@ function sortTerms(terms) {
 }
 /**
 * Apply the absorption law: removes compound terms that are absorbed by
-* a simple term already present.
+* another term already present (simple or compound).
 *
 * For AND context: A & (A | B) → A  (absorbs OR compounds)
 * For OR  context: A | (A & B) → A  (absorbs AND compounds)
+*
+* After flattening, a compound A = OR(X, Y) becomes [X, Y, ...] in the
+* outer OR. A child AND(A, B) = AND(OR(X, Y), B) still references the
+* original un-flattened compound. We reconstruct possible compound
+* absorbers from the flattened terms so absorption works across nesting.
 */
 function applyAbsorption(terms, absorbedOperator) {
-	const simpleIds = /* @__PURE__ */ new Set();
-	for (const term of terms) if (term.kind !== "compound") simpleIds.add(getConditionUniqueId(term));
+	const absorberIds = /* @__PURE__ */ new Set();
+	for (const term of terms) absorberIds.add(getConditionUniqueId(term));
+	let changed = true;
+	while (changed) {
+		changed = false;
+		for (const term of terms) {
+			if (term.kind !== "compound" || term.operator !== absorbedOperator) continue;
+			for (const child of term.children) {
+				if (child.kind !== "compound") continue;
+				const childId = getConditionUniqueId(child);
+				if (absorberIds.has(childId)) continue;
+				if (child.children.every((c) => absorberIds.has(getConditionUniqueId(c)))) {
+					absorberIds.add(childId);
+					changed = true;
+				}
+			}
+		}
+	}
 	return terms.filter((term) => {
 		if (term.kind === "compound" && term.operator === absorbedOperator) {
-			for (const child of term.children) if (simpleIds.has(getConditionUniqueId(child))) return false;
+			for (const child of term.children) if (absorberIds.has(getConditionUniqueId(child))) return false;
 		}
 		return true;
 	});
@@ -509,6 +609,81 @@ function applyAbsorptionAnd(terms) {
 function applyAbsorptionOr(terms) {
 	return applyAbsorption(terms, "AND");
 }
+/**
+* Apply the consensus/resolution rule for AND:
+*   (A | B) & (A | !B) → A
+*
+* This is the dual of complementary factoring in OR context:
+*   (A & B) | (A & !B) → A
+*
+* Extracts common children from two OR terms. If the remaining
+* parts of each side AND to FALSE, the common part alone is
+* sufficient.
+*/
+function applyConsensusAnd(terms) {
+	let changed = true;
+	while (changed) {
+		changed = false;
+		for (let i = 0; i < terms.length; i++) {
+			const a = terms[i];
+			if (a.kind !== "compound" || a.operator !== "OR") continue;
+			for (let j = i + 1; j < terms.length; j++) {
+				const b = terms[j];
+				if (b.kind !== "compound" || b.operator !== "OR") continue;
+				const resolved = tryResolvePair(a.children, b.children);
+				if (resolved) {
+					const replacement = simplifyInner(resolved);
+					terms = [
+						...terms.slice(0, i),
+						...terms.slice(i + 1, j),
+						...terms.slice(j + 1),
+						replacement
+					];
+					changed = true;
+					break;
+				}
+			}
+			if (changed) break;
+		}
+	}
+	return terms;
+}
+/**
+* Try to resolve two OR children lists.
+*
+* Extracts common children (by uniqueId). If the remaining
+* (non-common) parts AND to FALSE, the common part alone
+* is sufficient: `(common | restA) & (common | restB) → common`
+* when `restA & restB → FALSE`.
+*/
+function tryResolvePair(aChildren, bChildren) {
+	const aIds = aChildren.map((c) => getConditionUniqueId(c));
+	const bIds = bChildren.map((c) => getConditionUniqueId(c));
+	const bIdSet = new Set(bIds);
+	const aIdSet = new Set(aIds);
+	const commonIndicesA = [];
+	const restIndicesA = [];
+	for (let i = 0; i < aIds.length; i++) if (bIdSet.has(aIds[i])) commonIndicesA.push(i);
+	else restIndicesA.push(i);
+	const restIndicesB = [];
+	for (let i = 0; i < bIds.length; i++) if (!aIdSet.has(bIds[i])) restIndicesB.push(i);
+	if (commonIndicesA.length === 0) return null;
+	if (restIndicesA.length === 0 && restIndicesB.length === 0) return null;
+	const restA = restIndicesA.length === 0 ? falseCondition() : restIndicesA.length === 1 ? aChildren[restIndicesA[0]] : or(...restIndicesA.map((i) => aChildren[i]));
+	const restB = restIndicesB.length === 0 ? falseCondition() : restIndicesB.length === 1 ? bChildren[restIndicesB[0]] : or(...restIndicesB.map((i) => bChildren[i]));
+	if (simplifyInner({
+		kind: "compound",
+		operator: "AND",
+		children: [restA, restB]
+	}).kind !== "false") {
+		const simplifiedRestB = simplifyInner(restB);
+		if (getConditionUniqueId(simplifyInner(not(restA))) !== getConditionUniqueId(simplifiedRestB)) return null;
+	}
+	const common = commonIndicesA.map((i) => aChildren[i]);
+	if (common.length === 0) return falseCondition();
+	if (common.length === 1) return common[0];
+	return or(...common);
+}
 //#endregion
 export { simplifyCondition };
 

package/dist/pipeline/simplify.js.map

@@ -1 +1 @@
-{"version":3,"file":"simplify.js","names":[],"sources":["../../src/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 type {\n  ConditionNode,\n  ContainerCondition,\n  MediaCondition,\n  ModifierCondition,\n  NumericBound,\n} from './conditions';\nimport {\n  falseCondition,\n  getConditionUniqueId,\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 pair of terms has complementary negation (A and !A).\n * Used for both contradiction detection (in AND) and tautology detection (in OR),\n * since the underlying check is identical: the context determines the semantics.\n */\nfunction hasComplementaryPair(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\nconst hasContradiction = hasComplementaryPair;\nconst hasTautology = hasComplementaryPair;\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 */\n/**\n * Generic value-conflict checker for grouped conditions.\n *\n * Groups terms by a key, splits into positive/negated, then checks:\n *   1. Multiple distinct positive values → conflict\n *   2. Positive value + negated existence (value === undefined) → conflict\n *   3. Positive value + negated same value → conflict\n */\nfunction hasGroupedValueConflict<T extends { negated: boolean }>(\n  terms: ConditionNode[],\n  match: (term: ConditionNode) => T | null,\n  groupKey: (term: T) => string,\n  getValue: (term: T) => string | undefined,\n): boolean {\n  const groups = new Map<string, { positive: T[]; negated: T[] }>();\n\n  for (const term of terms) {\n    const matched = match(term);\n    if (!matched) continue;\n\n    const key = groupKey(matched);\n    let group = groups.get(key);\n    if (!group) {\n      group = { positive: [], negated: [] };\n      groups.set(key, group);\n    }\n\n    if (matched.negated) {\n      group.negated.push(matched);\n    } else {\n      group.positive.push(matched);\n    }\n  }\n\n  for (const [, group] of groups) {\n    const positiveValues = group.positive\n      .map(getValue)\n      .filter((v) => v !== undefined);\n    if (new Set(positiveValues).size > 1) return true;\n\n    const hasPositiveValue = positiveValues.length > 0;\n    const hasNegatedExistence = group.negated.some(\n      (t) => getValue(t) === undefined,\n    );\n    if (hasPositiveValue && hasNegatedExistence) return true;\n\n    for (const pos of group.positive) {\n      const posVal = getValue(pos);\n      if (posVal !== undefined) {\n        for (const neg of group.negated) {\n          if (getValue(neg) === posVal) return true;\n        }\n      }\n    }\n  }\n\n  return false;\n}\n\nfunction hasAttributeConflict(terms: ConditionNode[]): boolean {\n  return hasGroupedValueConflict<ModifierCondition>(\n    terms,\n    (t) => (t.kind === 'state' && t.type === 'modifier' ? t : null),\n    (t) => t.attribute,\n    (t) => t.value,\n  );\n}\n\nfunction hasContainerStyleConflict(terms: ConditionNode[]): boolean {\n  return hasGroupedValueConflict<ContainerCondition>(\n    terms,\n    (t) =>\n      t.kind === 'state' && t.type === 'container' && t.subtype === 'style'\n        ? t\n        : null,\n    (t) => `${t.containerName || '_'}:${t.property}`,\n    (t) => t.propertyValue,\n  );\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 */\n/**\n * Collect positive values from terms and build a \"is this negation implied?\" check.\n *\n * A negation is implied (redundant) when a positive term for the same group\n * already pins a specific value, making \"NOT other-value\" obvious.\n * e.g. style(--variant: danger) implies NOT style(--variant: success).\n */\nfunction buildImpliedNegationCheck(\n  terms: ConditionNode[],\n): (term: ConditionNode) => boolean {\n  const positiveValues = new Map<string, string>();\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      if (term.propertyValue !== undefined) {\n        positiveValues.set(\n          `c:${term.containerName || '_'}:${term.property}`,\n          term.propertyValue,\n        );\n      }\n    } else if (term.type === 'modifier' && term.value !== undefined) {\n      positiveValues.set(`m:${term.attribute}`, term.value);\n    }\n  }\n\n  return (term: ConditionNode): boolean => {\n    if (term.kind !== 'state' || !term.negated) return false;\n\n    if (term.type === 'container' && term.subtype === 'style') {\n      if (term.propertyValue === undefined) return false;\n      const pos = positiveValues.get(\n        `c:${term.containerName || '_'}:${term.property}`,\n      );\n      return pos !== undefined && term.propertyValue !== pos;\n    }\n\n    if (term.type === 'modifier' && term.value !== undefined) {\n      const pos = positiveValues.get(`m:${term.attribute}`);\n      return pos !== undefined && term.value !== pos;\n    }\n\n    return false;\n  };\n}\n\nfunction removeImpliedNegations(terms: ConditionNode[]): ConditionNode[] {\n  const isImplied = buildImpliedNegationCheck(terms);\n  return terms.filter((t) => !isImplied(t));\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\n/**\n * Tighten bounds by picking the most restrictive lower and upper bounds\n * from a set of conditions that have lowerBound/upperBound fields.\n */\nfunction tightenBounds(\n  conditions: { lowerBound?: NumericBound; upperBound?: NumericBound }[],\n): { lowerBound?: NumericBound; upperBound?: NumericBound } {\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  return { lowerBound, upperBound };\n}\n\nfunction appendBoundsToUniqueId(\n  parts: string[],\n  lowerBound?: NumericBound,\n  upperBound?: NumericBound,\n): void {\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}\n\nfunction mergeDimensionRanges<T extends MediaCondition | ContainerCondition>(\n  conditions: T[],\n  idPrefix: string[],\n): T | null {\n  if (conditions.length === 0) return null;\n\n  const { lowerBound, upperBound } = tightenBounds(conditions);\n  const base = conditions[0];\n\n  const parts = [...idPrefix];\n  appendBoundsToUniqueId(parts, lowerBound, upperBound);\n\n  return {\n    ...base,\n    negated: false,\n    raw: buildMergedRaw(base.dimension || 'width', lowerBound, upperBound),\n    uniqueId: parts.join(':'),\n    lowerBound,\n    upperBound,\n  };\n}\n\nfunction mergeMediaRanges(conditions: MediaCondition[]): MediaCondition | null {\n  const dim = conditions[0]?.dimension ?? 'width';\n  return mergeDimensionRanges(conditions, ['media', 'dim', dim]);\n}\n\nfunction mergeContainerRanges(\n  conditions: ContainerCondition[],\n): ContainerCondition | null {\n  const base = conditions[0];\n  if (!base) return null;\n  const name = base.containerName || '_';\n  const dim = base.dimension ?? 'width';\n  return mergeDimensionRanges(conditions, ['container', 'dim', name, dim]);\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  const withIds = terms.map((t) => [getConditionUniqueId(t), t] as const);\n  withIds.sort((a, b) => a[0].localeCompare(b[0]));\n  return withIds.map(([, t]) => t);\n}\n\n// ============================================================================\n// Absorption\n// ============================================================================\n\n/**\n * Apply the absorption law: removes compound terms that are absorbed by\n * a simple term already present.\n *\n * For AND context: A & (A | B) → A  (absorbs OR compounds)\n * For OR  context: A | (A & B) → A  (absorbs AND compounds)\n */\nfunction applyAbsorption(\n  terms: ConditionNode[],\n  absorbedOperator: 'OR' | 'AND',\n): ConditionNode[] {\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  return terms.filter((term) => {\n    if (term.kind === 'compound' && term.operator === absorbedOperator) {\n      for (const child of term.children) {\n        if (simpleIds.has(getConditionUniqueId(child))) {\n          return false;\n        }\n      }\n    }\n    return true;\n  });\n}\n\nfunction applyAbsorptionAnd(terms: ConditionNode[]): ConditionNode[] {\n  return applyAbsorption(terms, 'OR');\n}\n\nfunction applyAbsorptionOr(terms: ConditionNode[]): ConditionNode[] {\n  return applyAbsorption(terms, 'AND');\n}\n"],"mappings":";;;;;;;;;;;;;;AA+BA,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;;;;;;;AAYH,SAAS,qBAAqB,OAAiC;CAC7D,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;;AAGT,MAAM,mBAAmB;AACzB,MAAM,eAAe;;;;;;;;;AAkCrB,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;OAEnB,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;;;;;;;;;;;;;;;AAoBpB,SAAS,wBACP,OACA,OACA,UACA,UACS;CACT,MAAM,yBAAS,IAAI,KAA8C;AAEjE,MAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,UAAU,MAAM,KAAK;AAC3B,MAAI,CAAC,QAAS;EAEd,MAAM,MAAM,SAAS,QAAQ;EAC7B,IAAI,QAAQ,OAAO,IAAI,IAAI;AAC3B,MAAI,CAAC,OAAO;AACV,WAAQ;IAAE,UAAU,EAAE;IAAE,SAAS,EAAE;IAAE;AACrC,UAAO,IAAI,KAAK,MAAM;;AAGxB,MAAI,QAAQ,QACV,OAAM,QAAQ,KAAK,QAAQ;MAE3B,OAAM,SAAS,KAAK,QAAQ;;AAIhC,MAAK,MAAM,GAAG,UAAU,QAAQ;EAC9B,MAAM,iBAAiB,MAAM,SAC1B,IAAI,SAAS,CACb,QAAQ,MAAM,MAAM,KAAA,EAAU;AACjC,MAAI,IAAI,IAAI,eAAe,CAAC,OAAO,EAAG,QAAO;EAE7C,MAAM,mBAAmB,eAAe,SAAS;EACjD,MAAM,sBAAsB,MAAM,QAAQ,MACvC,MAAM,SAAS,EAAE,KAAK,KAAA,EACxB;AACD,MAAI,oBAAoB,oBAAqB,QAAO;AAEpD,OAAK,MAAM,OAAO,MAAM,UAAU;GAChC,MAAM,SAAS,SAAS,IAAI;AAC5B,OAAI,WAAW,KAAA;SACR,MAAM,OAAO,MAAM,QACtB,KAAI,SAAS,IAAI,KAAK,OAAQ,QAAO;;;;AAM7C,QAAO;;AAGT,SAAS,qBAAqB,OAAiC;AAC7D,QAAO,wBACL,QACC,MAAO,EAAE,SAAS,WAAW,EAAE,SAAS,aAAa,IAAI,OACzD,MAAM,EAAE,YACR,MAAM,EAAE,MACV;;AAGH,SAAS,0BAA0B,OAAiC;AAClE,QAAO,wBACL,QACC,MACC,EAAE,SAAS,WAAW,EAAE,SAAS,eAAe,EAAE,YAAY,UAC1D,IACA,OACL,MAAM,GAAG,EAAE,iBAAiB,IAAI,GAAG,EAAE,aACrC,MAAM,EAAE,cACV;;;;;;;;;;;;;;;;;;;;;;;;AA6BH,SAAS,0BACP,OACkC;CAClC,MAAM,iCAAiB,IAAI,KAAqB;AAEhD,MAAK,MAAM,QAAQ,OAAO;AACxB,MAAI,KAAK,SAAS,WAAW,KAAK,QAAS;AAE3C,MAAI,KAAK,SAAS,eAAe,KAAK,YAAY;OAC5C,KAAK,kBAAkB,KAAA,EACzB,gBAAe,IACb,KAAK,KAAK,iBAAiB,IAAI,GAAG,KAAK,YACvC,KAAK,cACN;aAEM,KAAK,SAAS,cAAc,KAAK,UAAU,KAAA,EACpD,gBAAe,IAAI,KAAK,KAAK,aAAa,KAAK,MAAM;;AAIzD,SAAQ,SAAiC;AACvC,MAAI,KAAK,SAAS,WAAW,CAAC,KAAK,QAAS,QAAO;AAEnD,MAAI,KAAK,SAAS,eAAe,KAAK,YAAY,SAAS;AACzD,OAAI,KAAK,kBAAkB,KAAA,EAAW,QAAO;GAC7C,MAAM,MAAM,eAAe,IACzB,KAAK,KAAK,iBAAiB,IAAI,GAAG,KAAK,WACxC;AACD,UAAO,QAAQ,KAAA,KAAa,KAAK,kBAAkB;;AAGrD,MAAI,KAAK,SAAS,cAAc,KAAK,UAAU,KAAA,GAAW;GACxD,MAAM,MAAM,eAAe,IAAI,KAAK,KAAK,YAAY;AACrD,UAAO,QAAQ,KAAA,KAAa,KAAK,UAAU;;AAG7C,SAAO;;;AAIX,SAAS,uBAAuB,OAAyC;CACvE,MAAM,YAAY,0BAA0B,MAAM;AAClD,QAAO,MAAM,QAAQ,MAAM,CAAC,UAAU,EAAE,CAAC;;AAO3C,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,MAAM,UAAU,WAC1B,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;;;;;;AAOT,SAAS,cACP,YAC0D;CAC1D,IAAI;CACJ,IAAI;AAEJ,MAAK,MAAM,QAAQ,YAAY;AAC7B,MAAI,KAAK;OAEL,CAAC,eACA,KAAK,WAAW,gBAAgB,cAC9B,WAAW,gBAAgB,WAE9B,cAAa,KAAK;;AAGtB,MAAI,KAAK;OAEL,CAAC,eACA,KAAK,WAAW,gBAAgB,aAC9B,WAAW,gBAAgB,UAE9B,cAAa,KAAK;;;AAKxB,QAAO;EAAE;EAAY;EAAY;;AAGnC,SAAS,uBACP,OACA,YACA,YACM;AACN,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;;;AAIhC,SAAS,qBACP,YACA,UACU;AACV,KAAI,WAAW,WAAW,EAAG,QAAO;CAEpC,MAAM,EAAE,YAAY,eAAe,cAAc,WAAW;CAC5D,MAAM,OAAO,WAAW;CAExB,MAAM,QAAQ,CAAC,GAAG,SAAS;AAC3B,wBAAuB,OAAO,YAAY,WAAW;AAErD,QAAO;EACL,GAAG;EACH,SAAS;EACT,KAAK,eAAe,KAAK,aAAa,SAAS,YAAY,WAAW;EACtE,UAAU,MAAM,KAAK,IAAI;EACzB;EACA;EACD;;AAGH,SAAS,iBAAiB,YAAqD;AAE7E,QAAO,qBAAqB,YAAY;EAAC;EAAS;EADtC,WAAW,IAAI,aAAa;EACqB,CAAC;;AAGhE,SAAS,qBACP,YAC2B;CAC3B,MAAM,OAAO,WAAW;AACxB,KAAI,CAAC,KAAM,QAAO;AAGlB,QAAO,qBAAqB,YAAY;EAAC;EAAa;EAFzC,KAAK,iBAAiB;EACvB,KAAK,aAAa;EACyC,CAAC;;AAG1E,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;CAC1D,MAAM,UAAU,MAAM,KAAK,MAAM,CAAC,qBAAqB,EAAE,EAAE,EAAE,CAAU;AACvE,SAAQ,MAAM,GAAG,MAAM,EAAE,GAAG,cAAc,EAAE,GAAG,CAAC;AAChD,QAAO,QAAQ,KAAK,GAAG,OAAO,EAAE;;;;;;;;;AAclC,SAAS,gBACP,OACA,kBACiB;CACjB,MAAM,4BAAY,IAAI,KAAa;AACnC,MAAK,MAAM,QAAQ,MACjB,KAAI,KAAK,SAAS,WAChB,WAAU,IAAI,qBAAqB,KAAK,CAAC;AAI7C,QAAO,MAAM,QAAQ,SAAS;AAC5B,MAAI,KAAK,SAAS,cAAc,KAAK,aAAa;QAC3C,MAAM,SAAS,KAAK,SACvB,KAAI,UAAU,IAAI,qBAAqB,MAAM,CAAC,CAC5C,QAAO;;AAIb,SAAO;GACP;;AAGJ,SAAS,mBAAmB,OAAyC;AACnE,QAAO,gBAAgB,OAAO,KAAK;;AAGrC,SAAS,kBAAkB,OAAyC;AAClE,QAAO,gBAAgB,OAAO,MAAM"}
+{"version":3,"file":"simplify.js","names":[],"sources":["../../src/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 type {\n  ConditionNode,\n  ContainerCondition,\n  MediaCondition,\n  ModifierCondition,\n  NumericBound,\n} from './conditions';\nimport {\n  and,\n  falseCondition,\n  getConditionUniqueId,\n  not,\n  or,\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  // Apply consensus/resolution: (A | B) & (A | !B) → A\n  terms = applyConsensusAnd(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  // Apply complementary factoring: (A & B) | (A & !B) → A\n  terms = applyComplementaryFactoring(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 pair of terms has complementary negation (A and !A).\n * Used for both contradiction detection (in AND) and tautology detection (in OR),\n * since the underlying check is identical: the context determines the semantics.\n */\nfunction hasComplementaryPair(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\nconst hasContradiction = hasComplementaryPair;\nconst hasTautology = hasComplementaryPair;\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 */\n/**\n * Generic value-conflict checker for grouped conditions.\n *\n * Groups terms by a key, splits into positive/negated, then checks:\n *   1. Multiple distinct positive values → conflict\n *   2. Positive value + negated existence (value === undefined) → conflict\n *   3. Positive value + negated same value → conflict\n */\nfunction hasGroupedValueConflict<T extends { negated: boolean }>(\n  terms: ConditionNode[],\n  match: (term: ConditionNode) => T | null,\n  groupKey: (term: T) => string,\n  getValue: (term: T) => string | undefined,\n): boolean {\n  const groups = new Map<string, { positive: T[]; negated: T[] }>();\n\n  for (const term of terms) {\n    const matched = match(term);\n    if (!matched) continue;\n\n    const key = groupKey(matched);\n    let group = groups.get(key);\n    if (!group) {\n      group = { positive: [], negated: [] };\n      groups.set(key, group);\n    }\n\n    if (matched.negated) {\n      group.negated.push(matched);\n    } else {\n      group.positive.push(matched);\n    }\n  }\n\n  for (const [, group] of groups) {\n    const positiveValues = group.positive\n      .map(getValue)\n      .filter((v) => v !== undefined);\n    if (new Set(positiveValues).size > 1) return true;\n\n    const hasPositiveValue = positiveValues.length > 0;\n    const hasNegatedExistence = group.negated.some(\n      (t) => getValue(t) === undefined,\n    );\n    if (hasPositiveValue && hasNegatedExistence) return true;\n\n    for (const pos of group.positive) {\n      const posVal = getValue(pos);\n      if (posVal !== undefined) {\n        for (const neg of group.negated) {\n          if (getValue(neg) === posVal) return true;\n        }\n      }\n    }\n  }\n\n  return false;\n}\n\nfunction hasAttributeConflict(terms: ConditionNode[]): boolean {\n  return hasGroupedValueConflict<ModifierCondition>(\n    terms,\n    (t) => (t.kind === 'state' && t.type === 'modifier' ? t : null),\n    (t) => t.attribute,\n    (t) => t.value,\n  );\n}\n\nfunction hasContainerStyleConflict(terms: ConditionNode[]): boolean {\n  return hasGroupedValueConflict<ContainerCondition>(\n    terms,\n    (t) =>\n      t.kind === 'state' && t.type === 'container' && t.subtype === 'style'\n        ? t\n        : null,\n    (t) => `${t.containerName || '_'}:${t.property}`,\n    (t) => t.propertyValue,\n  );\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 */\n/**\n * Collect positive values from terms and build a \"is this negation implied?\" check.\n *\n * A negation is implied (redundant) when a positive term for the same group\n * already pins a specific value, making \"NOT other-value\" obvious.\n * e.g. style(--variant: danger) implies NOT style(--variant: success).\n */\nfunction buildImpliedNegationCheck(\n  terms: ConditionNode[],\n): (term: ConditionNode) => boolean {\n  const positiveValues = new Map<string, string>();\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      if (term.propertyValue !== undefined) {\n        positiveValues.set(\n          `c:${term.containerName || '_'}:${term.property}`,\n          term.propertyValue,\n        );\n      }\n    } else if (term.type === 'modifier' && term.value !== undefined) {\n      positiveValues.set(`m:${term.attribute}`, term.value);\n    }\n  }\n\n  return (term: ConditionNode): boolean => {\n    if (term.kind !== 'state' || !term.negated) return false;\n\n    if (term.type === 'container' && term.subtype === 'style') {\n      if (term.propertyValue === undefined) return false;\n      const pos = positiveValues.get(\n        `c:${term.containerName || '_'}:${term.property}`,\n      );\n      return pos !== undefined && term.propertyValue !== pos;\n    }\n\n    if (term.type === 'modifier' && term.value !== undefined) {\n      const pos = positiveValues.get(`m:${term.attribute}`);\n      return pos !== undefined && term.value !== pos;\n    }\n\n    return false;\n  };\n}\n\nfunction removeImpliedNegations(terms: ConditionNode[]): ConditionNode[] {\n  const isImplied = buildImpliedNegationCheck(terms);\n  return terms.filter((t) => !isImplied(t));\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\n/**\n * Tighten bounds by picking the most restrictive lower and upper bounds\n * from a set of conditions that have lowerBound/upperBound fields.\n */\nfunction tightenBounds(\n  conditions: { lowerBound?: NumericBound; upperBound?: NumericBound }[],\n): { lowerBound?: NumericBound; upperBound?: NumericBound } {\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  return { lowerBound, upperBound };\n}\n\nfunction appendBoundsToUniqueId(\n  parts: string[],\n  lowerBound?: NumericBound,\n  upperBound?: NumericBound,\n): void {\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}\n\nfunction mergeDimensionRanges<T extends MediaCondition | ContainerCondition>(\n  conditions: T[],\n  idPrefix: string[],\n): T | null {\n  if (conditions.length === 0) return null;\n\n  const { lowerBound, upperBound } = tightenBounds(conditions);\n  const base = conditions[0];\n\n  const parts = [...idPrefix];\n  appendBoundsToUniqueId(parts, lowerBound, upperBound);\n\n  return {\n    ...base,\n    negated: false,\n    raw: buildMergedRaw(base.dimension || 'width', lowerBound, upperBound),\n    uniqueId: parts.join(':'),\n    lowerBound,\n    upperBound,\n  };\n}\n\nfunction mergeMediaRanges(conditions: MediaCondition[]): MediaCondition | null {\n  const dim = conditions[0]?.dimension ?? 'width';\n  return mergeDimensionRanges(conditions, ['media', 'dim', dim]);\n}\n\nfunction mergeContainerRanges(\n  conditions: ContainerCondition[],\n): ContainerCondition | null {\n  const base = conditions[0];\n  if (!base) return null;\n  const name = base.containerName || '_';\n  const dim = base.dimension ?? 'width';\n  return mergeDimensionRanges(conditions, ['container', 'dim', name, dim]);\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// Complementary Factoring\n// ============================================================================\n\n/**\n * Apply complementary factoring: (A & B) | (A & !B) → A\n *\n * Finds pairs of AND compounds that share all children except one,\n * where the differing child is complementary (X vs !X).\n * Replaces the pair with the common terms.\n *\n * This is applied iteratively until no more reductions are possible,\n * since factoring can expose further simplification opportunities.\n */\nfunction applyComplementaryFactoring(terms: ConditionNode[]): ConditionNode[] {\n  let changed = true;\n\n  while (changed) {\n    changed = false;\n\n    for (let i = 0; i < terms.length; i++) {\n      const a = terms[i];\n      if (a.kind !== 'compound' || a.operator !== 'AND') continue;\n\n      for (let j = i + 1; j < terms.length; j++) {\n        const b = terms[j];\n        if (b.kind !== 'compound' || b.operator !== 'AND') continue;\n\n        const factored = tryFactorPair(a.children, b.children);\n        if (factored) {\n          const replacement = simplifyInner(factored);\n          terms = [\n            ...terms.slice(0, i),\n            ...terms.slice(i + 1, j),\n            ...terms.slice(j + 1),\n            replacement,\n          ];\n          changed = true;\n          break;\n        }\n      }\n\n      if (changed) break;\n    }\n  }\n\n  return terms;\n}\n\n/**\n * Try to factor two AND children lists.\n *\n * Extracts the common children (by uniqueId). If the remaining\n * (non-common) parts of each side OR to TRUE, the common part alone\n * is sufficient: `(common & restA) | (common & restB) → common`\n * when `restA | restB → TRUE`.\n *\n * Also handles the simpler case where exactly one child is\n * complementary: `[A, B, C]` and `[A, !B, C]` → `AND(A, C)`.\n */\nfunction tryFactorPair(\n  aChildren: ConditionNode[],\n  bChildren: ConditionNode[],\n): ConditionNode | null {\n  const aIds = aChildren.map((c) => getConditionUniqueId(c));\n  const bIds = bChildren.map((c) => getConditionUniqueId(c));\n\n  const bIdSet = new Set(bIds);\n  const aIdSet = new Set(aIds);\n\n  // Extract common children (present in both by uniqueId)\n  const commonIndicesA: number[] = [];\n  const restIndicesA: number[] = [];\n  for (let i = 0; i < aIds.length; i++) {\n    if (bIdSet.has(aIds[i])) {\n      commonIndicesA.push(i);\n    } else {\n      restIndicesA.push(i);\n    }\n  }\n\n  const restIndicesB: number[] = [];\n  for (let i = 0; i < bIds.length; i++) {\n    if (!aIdSet.has(bIds[i])) {\n      restIndicesB.push(i);\n    }\n  }\n\n  // Must have at least one common child and differing parts on both sides\n  if (commonIndicesA.length === 0) return null;\n  if (restIndicesA.length === 0 && restIndicesB.length === 0) return null;\n\n  // Build the \"rest\" conditions for each side\n  const restA =\n    restIndicesA.length === 0\n      ? trueCondition()\n      : restIndicesA.length === 1\n        ? aChildren[restIndicesA[0]]\n        : and(...restIndicesA.map((i) => aChildren[i]));\n\n  const restB =\n    restIndicesB.length === 0\n      ? trueCondition()\n      : restIndicesB.length === 1\n        ? bChildren[restIndicesB[0]]\n        : and(...restIndicesB.map((i) => bChildren[i]));\n\n  // Check if restA | restB simplifies to TRUE\n  const combined = simplifyInner({\n    kind: 'compound',\n    operator: 'OR',\n    children: [restA, restB],\n  });\n\n  if (combined.kind !== 'true') {\n    // Direct complement check for compound conditions.\n    // hasTautology only detects leaf-level A/!A pairs, so compound\n    // complements like @hc / !@hc (which expand via De Morgan into\n    // structurally different trees) are missed. Compare the simplified\n    // negation of one rest against the simplified other rest instead.\n    const simplifiedRestB = simplifyInner(restB);\n    const negRestA = simplifyInner(not(restA));\n\n    if (\n      getConditionUniqueId(negRestA) !== getConditionUniqueId(simplifiedRestB)\n    ) {\n      return null;\n    }\n  }\n\n  // restA | restB = TRUE → (common & restA) | (common & restB) = common\n  const common = commonIndicesA.map((i) => aChildren[i]);\n\n  if (common.length === 0) {\n    return trueCondition();\n  }\n  if (common.length === 1) {\n    return common[0];\n  }\n  return and(...common);\n}\n\n// ============================================================================\n// Sorting\n// ============================================================================\n\nfunction sortTerms(terms: ConditionNode[]): ConditionNode[] {\n  const withIds = terms.map((t) => [getConditionUniqueId(t), t] as const);\n  withIds.sort((a, b) => a[0].localeCompare(b[0]));\n  return withIds.map(([, t]) => t);\n}\n\n// ============================================================================\n// Absorption\n// ============================================================================\n\n/**\n * Apply the absorption law: removes compound terms that are absorbed by\n * another term already present (simple or compound).\n *\n * For AND context: A & (A | B) → A  (absorbs OR compounds)\n * For OR  context: A | (A & B) → A  (absorbs AND compounds)\n *\n * After flattening, a compound A = OR(X, Y) becomes [X, Y, ...] in the\n * outer OR. A child AND(A, B) = AND(OR(X, Y), B) still references the\n * original un-flattened compound. We reconstruct possible compound\n * absorbers from the flattened terms so absorption works across nesting.\n */\nfunction applyAbsorption(\n  terms: ConditionNode[],\n  absorbedOperator: 'OR' | 'AND',\n): ConditionNode[] {\n  // Collect IDs of ALL top-level terms as potential absorbers.\n  const absorberIds = new Set<string>();\n  for (const term of terms) {\n    absorberIds.add(getConditionUniqueId(term));\n  }\n\n  // Reconstruct compound absorbers: if all children of a compound node\n  // (found inside an absorbable term) are themselves absorbers, then\n  // that compound is also an absorber. This handles the case where\n  // A = OR(X, Y) was flattened into [X, Y, ...] at the top level,\n  // but appears un-flattened as a child of AND(A, B).\n  let changed = true;\n  while (changed) {\n    changed = false;\n    for (const term of terms) {\n      if (term.kind !== 'compound' || term.operator !== absorbedOperator) {\n        continue;\n      }\n      for (const child of term.children) {\n        if (child.kind !== 'compound') continue;\n        const childId = getConditionUniqueId(child);\n        if (absorberIds.has(childId)) continue;\n        if (\n          child.children.every((c) => absorberIds.has(getConditionUniqueId(c)))\n        ) {\n          absorberIds.add(childId);\n          changed = true;\n        }\n      }\n    }\n  }\n\n  return terms.filter((term) => {\n    if (term.kind === 'compound' && term.operator === absorbedOperator) {\n      for (const child of term.children) {\n        if (absorberIds.has(getConditionUniqueId(child))) {\n          return false;\n        }\n      }\n    }\n    return true;\n  });\n}\n\nfunction applyAbsorptionAnd(terms: ConditionNode[]): ConditionNode[] {\n  return applyAbsorption(terms, 'OR');\n}\n\nfunction applyAbsorptionOr(terms: ConditionNode[]): ConditionNode[] {\n  return applyAbsorption(terms, 'AND');\n}\n\n// ============================================================================\n// Consensus / Resolution (AND dual of complementary factoring)\n// ============================================================================\n\n/**\n * Apply the consensus/resolution rule for AND:\n *   (A | B) & (A | !B) → A\n *\n * This is the dual of complementary factoring in OR context:\n *   (A & B) | (A & !B) → A\n *\n * Extracts common children from two OR terms. If the remaining\n * parts of each side AND to FALSE, the common part alone is\n * sufficient.\n */\nfunction applyConsensusAnd(terms: ConditionNode[]): ConditionNode[] {\n  let changed = true;\n\n  while (changed) {\n    changed = false;\n\n    for (let i = 0; i < terms.length; i++) {\n      const a = terms[i];\n      if (a.kind !== 'compound' || a.operator !== 'OR') continue;\n\n      for (let j = i + 1; j < terms.length; j++) {\n        const b = terms[j];\n        if (b.kind !== 'compound' || b.operator !== 'OR') continue;\n\n        const resolved = tryResolvePair(a.children, b.children);\n        if (resolved) {\n          const replacement = simplifyInner(resolved);\n          terms = [\n            ...terms.slice(0, i),\n            ...terms.slice(i + 1, j),\n            ...terms.slice(j + 1),\n            replacement,\n          ];\n          changed = true;\n          break;\n        }\n      }\n\n      if (changed) break;\n    }\n  }\n\n  return terms;\n}\n\n/**\n * Try to resolve two OR children lists.\n *\n * Extracts common children (by uniqueId). If the remaining\n * (non-common) parts AND to FALSE, the common part alone\n * is sufficient: `(common | restA) & (common | restB) → common`\n * when `restA & restB → FALSE`.\n */\nfunction tryResolvePair(\n  aChildren: ConditionNode[],\n  bChildren: ConditionNode[],\n): ConditionNode | null {\n  const aIds = aChildren.map((c) => getConditionUniqueId(c));\n  const bIds = bChildren.map((c) => getConditionUniqueId(c));\n\n  const bIdSet = new Set(bIds);\n  const aIdSet = new Set(aIds);\n\n  const commonIndicesA: number[] = [];\n  const restIndicesA: number[] = [];\n  for (let i = 0; i < aIds.length; i++) {\n    if (bIdSet.has(aIds[i])) {\n      commonIndicesA.push(i);\n    } else {\n      restIndicesA.push(i);\n    }\n  }\n\n  const restIndicesB: number[] = [];\n  for (let i = 0; i < bIds.length; i++) {\n    if (!aIdSet.has(bIds[i])) {\n      restIndicesB.push(i);\n    }\n  }\n\n  if (commonIndicesA.length === 0) return null;\n  if (restIndicesA.length === 0 && restIndicesB.length === 0) return null;\n\n  const restA =\n    restIndicesA.length === 0\n      ? falseCondition()\n      : restIndicesA.length === 1\n        ? aChildren[restIndicesA[0]]\n        : or(...restIndicesA.map((i) => aChildren[i]));\n\n  const restB =\n    restIndicesB.length === 0\n      ? falseCondition()\n      : restIndicesB.length === 1\n        ? bChildren[restIndicesB[0]]\n        : or(...restIndicesB.map((i) => bChildren[i]));\n\n  // Check if restA & restB simplifies to FALSE\n  const combined = simplifyInner({\n    kind: 'compound',\n    operator: 'AND',\n    children: [restA, restB],\n  });\n\n  if (combined.kind !== 'false') {\n    // Direct complement check for compound conditions\n    const simplifiedRestB = simplifyInner(restB);\n    const negRestA = simplifyInner(not(restA));\n\n    if (\n      getConditionUniqueId(negRestA) !== getConditionUniqueId(simplifiedRestB)\n    ) {\n      return null;\n    }\n  }\n\n  // restA & restB = FALSE → (common | restA) & (common | restB) = common\n  const common = commonIndicesA.map((i) => aChildren[i]);\n\n  if (common.length === 0) {\n    return falseCondition();\n  }\n  if (common.length === 1) {\n    return common[0];\n  }\n  return or(...common);\n}\n"],"mappings":";;;;;;;;;;;;;;AAkCA,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;AAGjC,SAAQ,kBAAkB,MAAM;AAEhC,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;AAGhC,SAAQ,4BAA4B,MAAM;AAE1C,KAAI,MAAM,WAAW,EACnB,QAAO,gBAAgB;AAEzB,KAAI,MAAM,WAAW,EACnB,QAAO,MAAM;AAGf,QAAO;EACL,MAAM;EACN,UAAU;EACV,UAAU;EACX;;;;;;;AAYH,SAAS,qBAAqB,OAAiC;CAC7D,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;;AAGT,MAAM,mBAAmB;AACzB,MAAM,eAAe;;;;;;;;;AAkCrB,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;OAEnB,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;;;;;;;;;;;;;;;AAoBpB,SAAS,wBACP,OACA,OACA,UACA,UACS;CACT,MAAM,yBAAS,IAAI,KAA8C;AAEjE,MAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,UAAU,MAAM,KAAK;AAC3B,MAAI,CAAC,QAAS;EAEd,MAAM,MAAM,SAAS,QAAQ;EAC7B,IAAI,QAAQ,OAAO,IAAI,IAAI;AAC3B,MAAI,CAAC,OAAO;AACV,WAAQ;IAAE,UAAU,EAAE;IAAE,SAAS,EAAE;IAAE;AACrC,UAAO,IAAI,KAAK,MAAM;;AAGxB,MAAI,QAAQ,QACV,OAAM,QAAQ,KAAK,QAAQ;MAE3B,OAAM,SAAS,KAAK,QAAQ;;AAIhC,MAAK,MAAM,GAAG,UAAU,QAAQ;EAC9B,MAAM,iBAAiB,MAAM,SAC1B,IAAI,SAAS,CACb,QAAQ,MAAM,MAAM,KAAA,EAAU;AACjC,MAAI,IAAI,IAAI,eAAe,CAAC,OAAO,EAAG,QAAO;EAE7C,MAAM,mBAAmB,eAAe,SAAS;EACjD,MAAM,sBAAsB,MAAM,QAAQ,MACvC,MAAM,SAAS,EAAE,KAAK,KAAA,EACxB;AACD,MAAI,oBAAoB,oBAAqB,QAAO;AAEpD,OAAK,MAAM,OAAO,MAAM,UAAU;GAChC,MAAM,SAAS,SAAS,IAAI;AAC5B,OAAI,WAAW,KAAA;SACR,MAAM,OAAO,MAAM,QACtB,KAAI,SAAS,IAAI,KAAK,OAAQ,QAAO;;;;AAM7C,QAAO;;AAGT,SAAS,qBAAqB,OAAiC;AAC7D,QAAO,wBACL,QACC,MAAO,EAAE,SAAS,WAAW,EAAE,SAAS,aAAa,IAAI,OACzD,MAAM,EAAE,YACR,MAAM,EAAE,MACV;;AAGH,SAAS,0BAA0B,OAAiC;AAClE,QAAO,wBACL,QACC,MACC,EAAE,SAAS,WAAW,EAAE,SAAS,eAAe,EAAE,YAAY,UAC1D,IACA,OACL,MAAM,GAAG,EAAE,iBAAiB,IAAI,GAAG,EAAE,aACrC,MAAM,EAAE,cACV;;;;;;;;;;;;;;;;;;;;;;;;AA6BH,SAAS,0BACP,OACkC;CAClC,MAAM,iCAAiB,IAAI,KAAqB;AAEhD,MAAK,MAAM,QAAQ,OAAO;AACxB,MAAI,KAAK,SAAS,WAAW,KAAK,QAAS;AAE3C,MAAI,KAAK,SAAS,eAAe,KAAK,YAAY;OAC5C,KAAK,kBAAkB,KAAA,EACzB,gBAAe,IACb,KAAK,KAAK,iBAAiB,IAAI,GAAG,KAAK,YACvC,KAAK,cACN;aAEM,KAAK,SAAS,cAAc,KAAK,UAAU,KAAA,EACpD,gBAAe,IAAI,KAAK,KAAK,aAAa,KAAK,MAAM;;AAIzD,SAAQ,SAAiC;AACvC,MAAI,KAAK,SAAS,WAAW,CAAC,KAAK,QAAS,QAAO;AAEnD,MAAI,KAAK,SAAS,eAAe,KAAK,YAAY,SAAS;AACzD,OAAI,KAAK,kBAAkB,KAAA,EAAW,QAAO;GAC7C,MAAM,MAAM,eAAe,IACzB,KAAK,KAAK,iBAAiB,IAAI,GAAG,KAAK,WACxC;AACD,UAAO,QAAQ,KAAA,KAAa,KAAK,kBAAkB;;AAGrD,MAAI,KAAK,SAAS,cAAc,KAAK,UAAU,KAAA,GAAW;GACxD,MAAM,MAAM,eAAe,IAAI,KAAK,KAAK,YAAY;AACrD,UAAO,QAAQ,KAAA,KAAa,KAAK,UAAU;;AAG7C,SAAO;;;AAIX,SAAS,uBAAuB,OAAyC;CACvE,MAAM,YAAY,0BAA0B,MAAM;AAClD,QAAO,MAAM,QAAQ,MAAM,CAAC,UAAU,EAAE,CAAC;;AAO3C,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,MAAM,UAAU,WAC1B,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;;;;;;AAOT,SAAS,cACP,YAC0D;CAC1D,IAAI;CACJ,IAAI;AAEJ,MAAK,MAAM,QAAQ,YAAY;AAC7B,MAAI,KAAK;OAEL,CAAC,eACA,KAAK,WAAW,gBAAgB,cAC9B,WAAW,gBAAgB,WAE9B,cAAa,KAAK;;AAGtB,MAAI,KAAK;OAEL,CAAC,eACA,KAAK,WAAW,gBAAgB,aAC9B,WAAW,gBAAgB,UAE9B,cAAa,KAAK;;;AAKxB,QAAO;EAAE;EAAY;EAAY;;AAGnC,SAAS,uBACP,OACA,YACA,YACM;AACN,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;;;AAIhC,SAAS,qBACP,YACA,UACU;AACV,KAAI,WAAW,WAAW,EAAG,QAAO;CAEpC,MAAM,EAAE,YAAY,eAAe,cAAc,WAAW;CAC5D,MAAM,OAAO,WAAW;CAExB,MAAM,QAAQ,CAAC,GAAG,SAAS;AAC3B,wBAAuB,OAAO,YAAY,WAAW;AAErD,QAAO;EACL,GAAG;EACH,SAAS;EACT,KAAK,eAAe,KAAK,aAAa,SAAS,YAAY,WAAW;EACtE,UAAU,MAAM,KAAK,IAAI;EACzB;EACA;EACD;;AAGH,SAAS,iBAAiB,YAAqD;AAE7E,QAAO,qBAAqB,YAAY;EAAC;EAAS;EADtC,WAAW,IAAI,aAAa;EACqB,CAAC;;AAGhE,SAAS,qBACP,YAC2B;CAC3B,MAAM,OAAO,WAAW;AACxB,KAAI,CAAC,KAAM,QAAO;AAGlB,QAAO,qBAAqB,YAAY;EAAC;EAAa;EAFzC,KAAK,iBAAiB;EACvB,KAAK,aAAa;EACyC,CAAC;;AAG1E,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;;;;;;;;;;;;AAiBT,SAAS,4BAA4B,OAAyC;CAC5E,IAAI,UAAU;AAEd,QAAO,SAAS;AACd,YAAU;AAEV,OAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;GACrC,MAAM,IAAI,MAAM;AAChB,OAAI,EAAE,SAAS,cAAc,EAAE,aAAa,MAAO;AAEnD,QAAK,IAAI,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;IACzC,MAAM,IAAI,MAAM;AAChB,QAAI,EAAE,SAAS,cAAc,EAAE,aAAa,MAAO;IAEnD,MAAM,WAAW,cAAc,EAAE,UAAU,EAAE,SAAS;AACtD,QAAI,UAAU;KACZ,MAAM,cAAc,cAAc,SAAS;AAC3C,aAAQ;MACN,GAAG,MAAM,MAAM,GAAG,EAAE;MACpB,GAAG,MAAM,MAAM,IAAI,GAAG,EAAE;MACxB,GAAG,MAAM,MAAM,IAAI,EAAE;MACrB;MACD;AACD,eAAU;AACV;;;AAIJ,OAAI,QAAS;;;AAIjB,QAAO;;;;;;;;;;;;;AAcT,SAAS,cACP,WACA,WACsB;CACtB,MAAM,OAAO,UAAU,KAAK,MAAM,qBAAqB,EAAE,CAAC;CAC1D,MAAM,OAAO,UAAU,KAAK,MAAM,qBAAqB,EAAE,CAAC;CAE1D,MAAM,SAAS,IAAI,IAAI,KAAK;CAC5B,MAAM,SAAS,IAAI,IAAI,KAAK;CAG5B,MAAM,iBAA2B,EAAE;CACnC,MAAM,eAAyB,EAAE;AACjC,MAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,IAC/B,KAAI,OAAO,IAAI,KAAK,GAAG,CACrB,gBAAe,KAAK,EAAE;KAEtB,cAAa,KAAK,EAAE;CAIxB,MAAM,eAAyB,EAAE;AACjC,MAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,IAC/B,KAAI,CAAC,OAAO,IAAI,KAAK,GAAG,CACtB,cAAa,KAAK,EAAE;AAKxB,KAAI,eAAe,WAAW,EAAG,QAAO;AACxC,KAAI,aAAa,WAAW,KAAK,aAAa,WAAW,EAAG,QAAO;CAGnE,MAAM,QACJ,aAAa,WAAW,IACpB,eAAe,GACf,aAAa,WAAW,IACtB,UAAU,aAAa,MACvB,IAAI,GAAG,aAAa,KAAK,MAAM,UAAU,GAAG,CAAC;CAErD,MAAM,QACJ,aAAa,WAAW,IACpB,eAAe,GACf,aAAa,WAAW,IACtB,UAAU,aAAa,MACvB,IAAI,GAAG,aAAa,KAAK,MAAM,UAAU,GAAG,CAAC;AASrD,KANiB,cAAc;EAC7B,MAAM;EACN,UAAU;EACV,UAAU,CAAC,OAAO,MAAM;EACzB,CAAC,CAEW,SAAS,QAAQ;EAM5B,MAAM,kBAAkB,cAAc,MAAM;AAG5C,MACE,qBAHe,cAAc,IAAI,MAAM,CAAC,CAGV,KAAK,qBAAqB,gBAAgB,CAExE,QAAO;;CAKX,MAAM,SAAS,eAAe,KAAK,MAAM,UAAU,GAAG;AAEtD,KAAI,OAAO,WAAW,EACpB,QAAO,eAAe;AAExB,KAAI,OAAO,WAAW,EACpB,QAAO,OAAO;AAEhB,QAAO,IAAI,GAAG,OAAO;;AAOvB,SAAS,UAAU,OAAyC;CAC1D,MAAM,UAAU,MAAM,KAAK,MAAM,CAAC,qBAAqB,EAAE,EAAE,EAAE,CAAU;AACvE,SAAQ,MAAM,GAAG,MAAM,EAAE,GAAG,cAAc,EAAE,GAAG,CAAC;AAChD,QAAO,QAAQ,KAAK,GAAG,OAAO,EAAE;;;;;;;;;;;;;;AAmBlC,SAAS,gBACP,OACA,kBACiB;CAEjB,MAAM,8BAAc,IAAI,KAAa;AACrC,MAAK,MAAM,QAAQ,MACjB,aAAY,IAAI,qBAAqB,KAAK,CAAC;CAQ7C,IAAI,UAAU;AACd,QAAO,SAAS;AACd,YAAU;AACV,OAAK,MAAM,QAAQ,OAAO;AACxB,OAAI,KAAK,SAAS,cAAc,KAAK,aAAa,iBAChD;AAEF,QAAK,MAAM,SAAS,KAAK,UAAU;AACjC,QAAI,MAAM,SAAS,WAAY;IAC/B,MAAM,UAAU,qBAAqB,MAAM;AAC3C,QAAI,YAAY,IAAI,QAAQ,CAAE;AAC9B,QACE,MAAM,SAAS,OAAO,MAAM,YAAY,IAAI,qBAAqB,EAAE,CAAC,CAAC,EACrE;AACA,iBAAY,IAAI,QAAQ;AACxB,eAAU;;;;;AAMlB,QAAO,MAAM,QAAQ,SAAS;AAC5B,MAAI,KAAK,SAAS,cAAc,KAAK,aAAa;QAC3C,MAAM,SAAS,KAAK,SACvB,KAAI,YAAY,IAAI,qBAAqB,MAAM,CAAC,CAC9C,QAAO;;AAIb,SAAO;GACP;;AAGJ,SAAS,mBAAmB,OAAyC;AACnE,QAAO,gBAAgB,OAAO,KAAK;;AAGrC,SAAS,kBAAkB,OAAyC;AAClE,QAAO,gBAAgB,OAAO,MAAM;;;;;;;;;;;;;AAkBtC,SAAS,kBAAkB,OAAyC;CAClE,IAAI,UAAU;AAEd,QAAO,SAAS;AACd,YAAU;AAEV,OAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;GACrC,MAAM,IAAI,MAAM;AAChB,OAAI,EAAE,SAAS,cAAc,EAAE,aAAa,KAAM;AAElD,QAAK,IAAI,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;IACzC,MAAM,IAAI,MAAM;AAChB,QAAI,EAAE,SAAS,cAAc,EAAE,aAAa,KAAM;IAElD,MAAM,WAAW,eAAe,EAAE,UAAU,EAAE,SAAS;AACvD,QAAI,UAAU;KACZ,MAAM,cAAc,cAAc,SAAS;AAC3C,aAAQ;MACN,GAAG,MAAM,MAAM,GAAG,EAAE;MACpB,GAAG,MAAM,MAAM,IAAI,GAAG,EAAE;MACxB,GAAG,MAAM,MAAM,IAAI,EAAE;MACrB;MACD;AACD,eAAU;AACV;;;AAIJ,OAAI,QAAS;;;AAIjB,QAAO;;;;;;;;;;AAWT,SAAS,eACP,WACA,WACsB;CACtB,MAAM,OAAO,UAAU,KAAK,MAAM,qBAAqB,EAAE,CAAC;CAC1D,MAAM,OAAO,UAAU,KAAK,MAAM,qBAAqB,EAAE,CAAC;CAE1D,MAAM,SAAS,IAAI,IAAI,KAAK;CAC5B,MAAM,SAAS,IAAI,IAAI,KAAK;CAE5B,MAAM,iBAA2B,EAAE;CACnC,MAAM,eAAyB,EAAE;AACjC,MAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,IAC/B,KAAI,OAAO,IAAI,KAAK,GAAG,CACrB,gBAAe,KAAK,EAAE;KAEtB,cAAa,KAAK,EAAE;CAIxB,MAAM,eAAyB,EAAE;AACjC,MAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,IAC/B,KAAI,CAAC,OAAO,IAAI,KAAK,GAAG,CACtB,cAAa,KAAK,EAAE;AAIxB,KAAI,eAAe,WAAW,EAAG,QAAO;AACxC,KAAI,aAAa,WAAW,KAAK,aAAa,WAAW,EAAG,QAAO;CAEnE,MAAM,QACJ,aAAa,WAAW,IACpB,gBAAgB,GAChB,aAAa,WAAW,IACtB,UAAU,aAAa,MACvB,GAAG,GAAG,aAAa,KAAK,MAAM,UAAU,GAAG,CAAC;CAEpD,MAAM,QACJ,aAAa,WAAW,IACpB,gBAAgB,GAChB,aAAa,WAAW,IACtB,UAAU,aAAa,MACvB,GAAG,GAAG,aAAa,KAAK,MAAM,UAAU,GAAG,CAAC;AASpD,KANiB,cAAc;EAC7B,MAAM;EACN,UAAU;EACV,UAAU,CAAC,OAAO,MAAM;EACzB,CAAC,CAEW,SAAS,SAAS;EAE7B,MAAM,kBAAkB,cAAc,MAAM;AAG5C,MACE,qBAHe,cAAc,IAAI,MAAM,CAAC,CAGV,KAAK,qBAAqB,gBAAgB,CAExE,QAAO;;CAKX,MAAM,SAAS,eAAe,KAAK,MAAM,UAAU,GAAG;AAEtD,KAAI,OAAO,WAAW,EACpB,QAAO,gBAAgB;AAEzB,KAAI,OAAO,WAAW,EACpB,QAAO,OAAO;AAEhB,QAAO,GAAG,GAAG,OAAO"}

package/dist/ssr/collector.d.ts

@@ -24,6 +24,10 @@ declare class ServerStyleCollector {
    * Collect internal @property rules and :root token defaults.
    * Mirrors markStylesGenerated() from the client-side injector.
    * Called automatically on first chunk collection; idempotent.
+   *
+   * Internals are always emitted here — the RSC path deliberately
+   * defers to SSR so that tokens appear exactly once per page in
+   * <style data-tasty-ssr> (avoiding duplication of large token sets).
    */
   collectInternals(): void;
   /**

package/dist/ssr/collector.js

@@ -4,8 +4,8 @@ import { formatCounterStyleRule } from "../counter-style/index.js";
 import { renderStyles } from "../pipeline/index.js";
 import { getEffectiveProperties, getGlobalConfigTokens, getGlobalCounterStyle, getGlobalFontFace, getGlobalStyles } from "../config.js";
 import { formatPropertyCSS } from "./format-property.js";
-import { formatGlobalRules } from "./format-global-rules.js";
 import { formatRules } from "./format-rules.js";
+import { formatGlobalRules } from "./format-global-rules.js";
 //#region src/ssr/collector.ts
 /**
 * ServerStyleCollector — server-safe style collector for SSR.
@@ -44,6 +44,10 @@ var ServerStyleCollector = class {
 	* Collect internal @property rules and :root token defaults.
 	* Mirrors markStylesGenerated() from the client-side injector.
 	* Called automatically on first chunk collection; idempotent.
+	*
+	* Internals are always emitted here — the RSC path deliberately
+	* defers to SSR so that tokens appear exactly once per page in
+	* <style data-tasty-ssr> (avoiding duplication of large token sets).
 	*/
 	collectInternals() {
 		if (this.internalsCollected) return;
@@ -60,16 +64,6 @@ var ServerStyleCollector = class {
 				if (css) this.collectGlobalStyles("__global:tokens", css);
 			}
 		}
-		const globalStyles = getGlobalStyles();
-		if (globalStyles) {
-			for (const [selector, styles] of Object.entries(globalStyles)) if (Object.keys(styles).length > 0) {
-				const rules = renderStyles(styles, selector);
-				if (rules.length > 0) {
-					const css = formatGlobalRules(rules);
-					if (css) this.collectGlobalStyles(`__global:styles:${selector}`, css);
-				}
-			}
-		}
 		const globalFF = getGlobalFontFace();
 		if (globalFF) for (const [family, input] of Object.entries(globalFF)) {
 			const descriptors = Array.isArray(input) ? input : [input];
@@ -84,6 +78,16 @@ var ServerStyleCollector = class {
 			const css = formatCounterStyleRule(name, descriptors);
 			this.collectCounterStyle(name, css);
 		}
+		const globalStyles = getGlobalStyles();
+		if (globalStyles) {
+			for (const [selector, styles] of Object.entries(globalStyles)) if (Object.keys(styles).length > 0) {
+				const rules = renderStyles(styles, selector);
+				if (rules.length > 0) {
+					const css = formatGlobalRules(rules);
+					if (css) this.collectGlobalStyles(`__global:styles:${selector}`, css);
+				}
+			}
+		}
 	}
 	/**
 	* Allocate a className for a cache key, server-side.

package/dist/ssr/collector.js.map

@@ -1 +1 @@
-{"version":3,"file":"collector.js","names":[],"sources":["../../src/ssr/collector.ts"],"sourcesContent":["/**\n * ServerStyleCollector — server-safe style collector for SSR.\n *\n * Accumulates CSS rules and cache metadata during server rendering.\n * This is the server-side counterpart to StyleInjector: it allocates\n * hash-based class names (`t${hash}`), formats CSS rules into text,\n * and tracks rendered class names for lightweight client transfer.\n *\n * One instance is created per HTTP request. Concurrent requests\n * each get their own collector (via AsyncLocalStorage or React context).\n */\n\nimport {\n  getEffectiveProperties,\n  getGlobalStyles,\n  getGlobalCounterStyle,\n  getGlobalFontFace,\n  getGlobalConfigTokens,\n} from '../config';\nimport { formatCounterStyleRule } from '../counter-style';\nimport { fontFaceContentHash, formatFontFaceRule } from '../font-face';\nimport { renderStyles } from '../pipeline';\nimport type { StyleResult } from '../pipeline';\nimport { hashString } from '../utils/hash';\nimport { formatPropertyCSS } from './format-property';\nimport { formatGlobalRules } from './format-global-rules';\nimport { formatRules } from './format-rules';\n\nfunction generateClassName(cacheKey: string): string {\n  return `t${hashString(cacheKey)}`;\n}\n\nexport class ServerStyleCollector {\n  private chunks = new Map<string, string>();\n  private cacheKeyToClassName = new Map<string, string>();\n  private flushedKeys = new Set<string>();\n  private propertyRules = new Map<string, string>();\n  private flushedPropertyKeys = new Set<string>();\n  private keyframeRules = new Map<string, string>();\n  private flushedKeyframeKeys = new Set<string>();\n  private globalStyles = new Map<string, string>();\n  private flushedGlobalKeys = new Set<string>();\n  private rawCSS = new Map<string, string>();\n  private flushedRawKeys = new Set<string>();\n  private fontFaceRules = new Map<string, string>();\n  private flushedFontFaceKeys = new Set<string>();\n  private counterStyleRules = new Map<string, string>();\n  private flushedCounterStyleKeys = new Set<string>();\n  private keyframesCounter = 0;\n  private counterStyleCounter = 0;\n  private internalsCollected = false;\n\n  /**\n   * Collect internal @property rules and :root token defaults.\n   * Mirrors markStylesGenerated() from the client-side injector.\n   * Called automatically on first chunk collection; idempotent.\n   */\n  collectInternals(): void {\n    if (this.internalsCollected) return;\n    this.internalsCollected = true;\n\n    for (const [token, definition] of Object.entries(\n      getEffectiveProperties(),\n    )) {\n      const css = formatPropertyCSS(token, definition);\n      if (css) {\n        this.collectProperty(`__prop:${token}`, css);\n      }\n    }\n\n    // Inject configured tokens as :root CSS custom properties\n    const tokenStyles = getGlobalConfigTokens();\n    if (tokenStyles && Object.keys(tokenStyles).length > 0) {\n      const tokenRules = renderStyles(tokenStyles, ':root') as StyleResult[];\n      if (tokenRules.length > 0) {\n        const css = formatGlobalRules(tokenRules);\n        if (css) {\n          this.collectGlobalStyles('__global:tokens', css);\n        }\n      }\n    }\n\n    // Inject configured global styles\n    const globalStyles = getGlobalStyles();\n    if (globalStyles) {\n      for (const [selector, styles] of Object.entries(globalStyles)) {\n        if (Object.keys(styles).length > 0) {\n          const rules = renderStyles(styles, selector) as StyleResult[];\n          if (rules.length > 0) {\n            const css = formatGlobalRules(rules);\n            if (css) {\n              this.collectGlobalStyles(`__global:styles:${selector}`, css);\n            }\n          }\n        }\n      }\n    }\n\n    // Inject global @font-face rules (mirrors markStylesGenerated)\n    const globalFF = getGlobalFontFace();\n    if (globalFF) {\n      for (const [family, input] of Object.entries(globalFF)) {\n        const descriptors = Array.isArray(input) ? input : [input];\n        for (const desc of descriptors) {\n          const hash = fontFaceContentHash(family, desc);\n          const css = formatFontFaceRule(family, desc);\n          this.collectFontFace(hash, css);\n        }\n      }\n    }\n\n    // Inject global @counter-style rules (mirrors markStylesGenerated)\n    const globalCS = getGlobalCounterStyle();\n    if (globalCS) {\n      for (const [name, descriptors] of Object.entries(globalCS)) {\n        const css = formatCounterStyleRule(name, descriptors);\n        this.collectCounterStyle(name, css);\n      }\n    }\n  }\n\n  /**\n   * Allocate a className for a cache key, server-side.\n   * Mirrors StyleInjector.allocateClassName but without DOM access.\n   */\n  allocateClassName(cacheKey: string): {\n    className: string;\n    isNewAllocation: boolean;\n  } {\n    const existing = this.cacheKeyToClassName.get(cacheKey);\n    if (existing) {\n      return { className: existing, isNewAllocation: false };\n    }\n\n    const className = generateClassName(cacheKey);\n    this.cacheKeyToClassName.set(cacheKey, className);\n\n    return { className, isNewAllocation: true };\n  }\n\n  /**\n   * Record CSS rules for a chunk.\n   * Called by useStyles during server render.\n   */\n  collectChunk(\n    cacheKey: string,\n    className: string,\n    rules: StyleResult[],\n  ): void {\n    if (this.chunks.has(cacheKey)) return;\n    const css = formatRules(rules, className);\n    if (css) {\n      this.chunks.set(cacheKey, css);\n    }\n  }\n\n  /**\n   * Record a @property rule. Deduplicated by name.\n   */\n  collectProperty(name: string, css: string): void {\n    if (!this.propertyRules.has(name)) {\n      this.propertyRules.set(name, css);\n    }\n  }\n\n  /**\n   * Record a @keyframes rule. Deduplicated by name.\n   */\n  collectKeyframes(name: string, css: string): void {\n    if (!this.keyframeRules.has(name)) {\n      this.keyframeRules.set(name, css);\n    }\n  }\n\n  /**\n   * Allocate a keyframe name for SSR. Uses provided name or generates one.\n   */\n  allocateKeyframeName(providedName?: string): string {\n    return providedName ?? `k${this.keyframesCounter++}`;\n  }\n\n  /**\n   * Record a @font-face rule. Deduplicated by key (content hash).\n   */\n  collectFontFace(key: string, css: string): void {\n    if (!this.fontFaceRules.has(key)) {\n      this.fontFaceRules.set(key, css);\n    }\n  }\n\n  /**\n   * Record a @counter-style rule. Deduplicated by name.\n   */\n  collectCounterStyle(name: string, css: string): void {\n    if (!this.counterStyleRules.has(name)) {\n      this.counterStyleRules.set(name, css);\n    }\n  }\n\n  /**\n   * Allocate a counter-style name for SSR. Uses provided name or generates one.\n   */\n  allocateCounterStyleName(providedName?: string): string {\n    return providedName ?? `cs${this.counterStyleCounter++}`;\n  }\n\n  /**\n   * Record global styles (from useGlobalStyles). Deduplicated by key.\n   */\n  collectGlobalStyles(key: string, css: string): void {\n    if (!this.globalStyles.has(key)) {\n      this.globalStyles.set(key, css);\n    }\n  }\n\n  /**\n   * Record raw CSS text (from useRawCSS). Deduplicated by key.\n   */\n  collectRawCSS(key: string, css: string): void {\n    if (!this.rawCSS.has(key)) {\n      this.rawCSS.set(key, css);\n    }\n  }\n\n  /**\n   * Extract all CSS collected so far as a single string.\n   * Includes @property and @keyframes rules.\n   * Used for non-streaming SSR (renderToString).\n   */\n  getCSS(): string {\n    const parts: string[] = [];\n\n    for (const css of this.propertyRules.values()) {\n      parts.push(css);\n    }\n\n    for (const css of this.fontFaceRules.values()) {\n      parts.push(css);\n    }\n\n    for (const css of this.counterStyleRules.values()) {\n      parts.push(css);\n    }\n\n    for (const css of this.rawCSS.values()) {\n      parts.push(css);\n    }\n\n    for (const css of this.globalStyles.values()) {\n      parts.push(css);\n    }\n\n    for (const css of this.chunks.values()) {\n      parts.push(css);\n    }\n\n    for (const css of this.keyframeRules.values()) {\n      parts.push(css);\n    }\n\n    return parts.join('\\n');\n  }\n\n  /**\n   * Flush only newly collected CSS since the last flush.\n   * Used for streaming SSR (renderToPipeableStream + useServerInsertedHTML).\n   */\n  flushCSS(): string {\n    const parts: string[] = [];\n\n    for (const [name, css] of this.propertyRules) {\n      if (!this.flushedPropertyKeys.has(name)) {\n        parts.push(css);\n        this.flushedPropertyKeys.add(name);\n      }\n    }\n\n    for (const [key, css] of this.fontFaceRules) {\n      if (!this.flushedFontFaceKeys.has(key)) {\n        parts.push(css);\n        this.flushedFontFaceKeys.add(key);\n      }\n    }\n\n    for (const [key, css] of this.counterStyleRules) {\n      if (!this.flushedCounterStyleKeys.has(key)) {\n        parts.push(css);\n        this.flushedCounterStyleKeys.add(key);\n      }\n    }\n\n    for (const [key, css] of this.rawCSS) {\n      if (!this.flushedRawKeys.has(key)) {\n        parts.push(css);\n        this.flushedRawKeys.add(key);\n      }\n    }\n\n    for (const [key, css] of this.globalStyles) {\n      if (!this.flushedGlobalKeys.has(key)) {\n        parts.push(css);\n        this.flushedGlobalKeys.add(key);\n      }\n    }\n\n    for (const [key, css] of this.chunks) {\n      if (!this.flushedKeys.has(key)) {\n        parts.push(css);\n        this.flushedKeys.add(key);\n      }\n    }\n\n    for (const [name, css] of this.keyframeRules) {\n      if (!this.flushedKeyframeKeys.has(name)) {\n        parts.push(css);\n        this.flushedKeyframeKeys.add(name);\n      }\n    }\n\n    return parts.join('\\n');\n  }\n\n  private flushedClassNames = new Set<string>();\n\n  /**\n   * Return class names rendered since the last call (for streaming).\n   * Used to emit lightweight class-list scripts for client hydration.\n   */\n  getRenderedClassNames(): string[] {\n    const names: string[] = [];\n    for (const className of this.cacheKeyToClassName.values()) {\n      if (!this.flushedClassNames.has(className)) {\n        this.flushedClassNames.add(className);\n        names.push(className);\n      }\n    }\n    return names;\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AA4BA,SAAS,kBAAkB,UAA0B;AACnD,QAAO,IAAI,WAAW,SAAS;;AAGjC,IAAa,uBAAb,MAAkC;CAChC,yBAAiB,IAAI,KAAqB;CAC1C,sCAA8B,IAAI,KAAqB;CACvD,8BAAsB,IAAI,KAAa;CACvC,gCAAwB,IAAI,KAAqB;CACjD,sCAA8B,IAAI,KAAa;CAC/C,gCAAwB,IAAI,KAAqB;CACjD,sCAA8B,IAAI,KAAa;CAC/C,+BAAuB,IAAI,KAAqB;CAChD,oCAA4B,IAAI,KAAa;CAC7C,yBAAiB,IAAI,KAAqB;CAC1C,iCAAyB,IAAI,KAAa;CAC1C,gCAAwB,IAAI,KAAqB;CACjD,sCAA8B,IAAI,KAAa;CAC/C,oCAA4B,IAAI,KAAqB;CACrD,0CAAkC,IAAI,KAAa;CACnD,mBAA2B;CAC3B,sBAA8B;CAC9B,qBAA6B;;;;;;CAO7B,mBAAyB;AACvB,MAAI,KAAK,mBAAoB;AAC7B,OAAK,qBAAqB;AAE1B,OAAK,MAAM,CAAC,OAAO,eAAe,OAAO,QACvC,wBAAwB,CACzB,EAAE;GACD,MAAM,MAAM,kBAAkB,OAAO,WAAW;AAChD,OAAI,IACF,MAAK,gBAAgB,UAAU,SAAS,IAAI;;EAKhD,MAAM,cAAc,uBAAuB;AAC3C,MAAI,eAAe,OAAO,KAAK,YAAY,CAAC,SAAS,GAAG;GACtD,MAAM,aAAa,aAAa,aAAa,QAAQ;AACrD,OAAI,WAAW,SAAS,GAAG;IACzB,MAAM,MAAM,kBAAkB,WAAW;AACzC,QAAI,IACF,MAAK,oBAAoB,mBAAmB,IAAI;;;EAMtD,MAAM,eAAe,iBAAiB;AACtC,MAAI;QACG,MAAM,CAAC,UAAU,WAAW,OAAO,QAAQ,aAAa,CAC3D,KAAI,OAAO,KAAK,OAAO,CAAC,SAAS,GAAG;IAClC,MAAM,QAAQ,aAAa,QAAQ,SAAS;AAC5C,QAAI,MAAM,SAAS,GAAG;KACpB,MAAM,MAAM,kBAAkB,MAAM;AACpC,SAAI,IACF,MAAK,oBAAoB,mBAAmB,YAAY,IAAI;;;;EAQtE,MAAM,WAAW,mBAAmB;AACpC,MAAI,SACF,MAAK,MAAM,CAAC,QAAQ,UAAU,OAAO,QAAQ,SAAS,EAAE;GACtD,MAAM,cAAc,MAAM,QAAQ,MAAM,GAAG,QAAQ,CAAC,MAAM;AAC1D,QAAK,MAAM,QAAQ,aAAa;IAC9B,MAAM,OAAO,oBAAoB,QAAQ,KAAK;IAC9C,MAAM,MAAM,mBAAmB,QAAQ,KAAK;AAC5C,SAAK,gBAAgB,MAAM,IAAI;;;EAMrC,MAAM,WAAW,uBAAuB;AACxC,MAAI,SACF,MAAK,MAAM,CAAC,MAAM,gBAAgB,OAAO,QAAQ,SAAS,EAAE;GAC1D,MAAM,MAAM,uBAAuB,MAAM,YAAY;AACrD,QAAK,oBAAoB,MAAM,IAAI;;;;;;;CASzC,kBAAkB,UAGhB;EACA,MAAM,WAAW,KAAK,oBAAoB,IAAI,SAAS;AACvD,MAAI,SACF,QAAO;GAAE,WAAW;GAAU,iBAAiB;GAAO;EAGxD,MAAM,YAAY,kBAAkB,SAAS;AAC7C,OAAK,oBAAoB,IAAI,UAAU,UAAU;AAEjD,SAAO;GAAE;GAAW,iBAAiB;GAAM;;;;;;CAO7C,aACE,UACA,WACA,OACM;AACN,MAAI,KAAK,OAAO,IAAI,SAAS,CAAE;EAC/B,MAAM,MAAM,YAAY,OAAO,UAAU;AACzC,MAAI,IACF,MAAK,OAAO,IAAI,UAAU,IAAI;;;;;CAOlC,gBAAgB,MAAc,KAAmB;AAC/C,MAAI,CAAC,KAAK,cAAc,IAAI,KAAK,CAC/B,MAAK,cAAc,IAAI,MAAM,IAAI;;;;;CAOrC,iBAAiB,MAAc,KAAmB;AAChD,MAAI,CAAC,KAAK,cAAc,IAAI,KAAK,CAC/B,MAAK,cAAc,IAAI,MAAM,IAAI;;;;;CAOrC,qBAAqB,cAA+B;AAClD,SAAO,gBAAgB,IAAI,KAAK;;;;;CAMlC,gBAAgB,KAAa,KAAmB;AAC9C,MAAI,CAAC,KAAK,cAAc,IAAI,IAAI,CAC9B,MAAK,cAAc,IAAI,KAAK,IAAI;;;;;CAOpC,oBAAoB,MAAc,KAAmB;AACnD,MAAI,CAAC,KAAK,kBAAkB,IAAI,KAAK,CACnC,MAAK,kBAAkB,IAAI,MAAM,IAAI;;;;;CAOzC,yBAAyB,cAA+B;AACtD,SAAO,gBAAgB,KAAK,KAAK;;;;;CAMnC,oBAAoB,KAAa,KAAmB;AAClD,MAAI,CAAC,KAAK,aAAa,IAAI,IAAI,CAC7B,MAAK,aAAa,IAAI,KAAK,IAAI;;;;;CAOnC,cAAc,KAAa,KAAmB;AAC5C,MAAI,CAAC,KAAK,OAAO,IAAI,IAAI,CACvB,MAAK,OAAO,IAAI,KAAK,IAAI;;;;;;;CAS7B,SAAiB;EACf,MAAM,QAAkB,EAAE;AAE1B,OAAK,MAAM,OAAO,KAAK,cAAc,QAAQ,CAC3C,OAAM,KAAK,IAAI;AAGjB,OAAK,MAAM,OAAO,KAAK,cAAc,QAAQ,CAC3C,OAAM,KAAK,IAAI;AAGjB,OAAK,MAAM,OAAO,KAAK,kBAAkB,QAAQ,CAC/C,OAAM,KAAK,IAAI;AAGjB,OAAK,MAAM,OAAO,KAAK,OAAO,QAAQ,CACpC,OAAM,KAAK,IAAI;AAGjB,OAAK,MAAM,OAAO,KAAK,aAAa,QAAQ,CAC1C,OAAM,KAAK,IAAI;AAGjB,OAAK,MAAM,OAAO,KAAK,OAAO,QAAQ,CACpC,OAAM,KAAK,IAAI;AAGjB,OAAK,MAAM,OAAO,KAAK,cAAc,QAAQ,CAC3C,OAAM,KAAK,IAAI;AAGjB,SAAO,MAAM,KAAK,KAAK;;;;;;CAOzB,WAAmB;EACjB,MAAM,QAAkB,EAAE;AAE1B,OAAK,MAAM,CAAC,MAAM,QAAQ,KAAK,cAC7B,KAAI,CAAC,KAAK,oBAAoB,IAAI,KAAK,EAAE;AACvC,SAAM,KAAK,IAAI;AACf,QAAK,oBAAoB,IAAI,KAAK;;AAItC,OAAK,MAAM,CAAC,KAAK,QAAQ,KAAK,cAC5B,KAAI,CAAC,KAAK,oBAAoB,IAAI,IAAI,EAAE;AACtC,SAAM,KAAK,IAAI;AACf,QAAK,oBAAoB,IAAI,IAAI;;AAIrC,OAAK,MAAM,CAAC,KAAK,QAAQ,KAAK,kBAC5B,KAAI,CAAC,KAAK,wBAAwB,IAAI,IAAI,EAAE;AAC1C,SAAM,KAAK,IAAI;AACf,QAAK,wBAAwB,IAAI,IAAI;;AAIzC,OAAK,MAAM,CAAC,KAAK,QAAQ,KAAK,OAC5B,KAAI,CAAC,KAAK,eAAe,IAAI,IAAI,EAAE;AACjC,SAAM,KAAK,IAAI;AACf,QAAK,eAAe,IAAI,IAAI;;AAIhC,OAAK,MAAM,CAAC,KAAK,QAAQ,KAAK,aAC5B,KAAI,CAAC,KAAK,kBAAkB,IAAI,IAAI,EAAE;AACpC,SAAM,KAAK,IAAI;AACf,QAAK,kBAAkB,IAAI,IAAI;;AAInC,OAAK,MAAM,CAAC,KAAK,QAAQ,KAAK,OAC5B,KAAI,CAAC,KAAK,YAAY,IAAI,IAAI,EAAE;AAC9B,SAAM,KAAK,IAAI;AACf,QAAK,YAAY,IAAI,IAAI;;AAI7B,OAAK,MAAM,CAAC,MAAM,QAAQ,KAAK,cAC7B,KAAI,CAAC,KAAK,oBAAoB,IAAI,KAAK,EAAE;AACvC,SAAM,KAAK,IAAI;AACf,QAAK,oBAAoB,IAAI,KAAK;;AAItC,SAAO,MAAM,KAAK,KAAK;;CAGzB,oCAA4B,IAAI,KAAa;;;;;CAM7C,wBAAkC;EAChC,MAAM,QAAkB,EAAE;AAC1B,OAAK,MAAM,aAAa,KAAK,oBAAoB,QAAQ,CACvD,KAAI,CAAC,KAAK,kBAAkB,IAAI,UAAU,EAAE;AAC1C,QAAK,kBAAkB,IAAI,UAAU;AACrC,SAAM,KAAK,UAAU;;AAGzB,SAAO"}
+{"version":3,"file":"collector.js","names":[],"sources":["../../src/ssr/collector.ts"],"sourcesContent":["/**\n * ServerStyleCollector — server-safe style collector for SSR.\n *\n * Accumulates CSS rules and cache metadata during server rendering.\n * This is the server-side counterpart to StyleInjector: it allocates\n * hash-based class names (`t${hash}`), formats CSS rules into text,\n * and tracks rendered class names for lightweight client transfer.\n *\n * One instance is created per HTTP request. Concurrent requests\n * each get their own collector (via AsyncLocalStorage or React context).\n */\n\nimport {\n  getEffectiveProperties,\n  getGlobalStyles,\n  getGlobalCounterStyle,\n  getGlobalFontFace,\n  getGlobalConfigTokens,\n} from '../config';\nimport { formatCounterStyleRule } from '../counter-style';\nimport { fontFaceContentHash, formatFontFaceRule } from '../font-face';\nimport { renderStyles } from '../pipeline';\nimport type { StyleResult } from '../pipeline';\nimport { hashString } from '../utils/hash';\nimport { formatPropertyCSS } from './format-property';\nimport { formatGlobalRules } from './format-global-rules';\nimport { formatRules } from './format-rules';\n\nfunction generateClassName(cacheKey: string): string {\n  return `t${hashString(cacheKey)}`;\n}\n\nexport class ServerStyleCollector {\n  private chunks = new Map<string, string>();\n  private cacheKeyToClassName = new Map<string, string>();\n  private flushedKeys = new Set<string>();\n  private propertyRules = new Map<string, string>();\n  private flushedPropertyKeys = new Set<string>();\n  private keyframeRules = new Map<string, string>();\n  private flushedKeyframeKeys = new Set<string>();\n  private globalStyles = new Map<string, string>();\n  private flushedGlobalKeys = new Set<string>();\n  private rawCSS = new Map<string, string>();\n  private flushedRawKeys = new Set<string>();\n  private fontFaceRules = new Map<string, string>();\n  private flushedFontFaceKeys = new Set<string>();\n  private counterStyleRules = new Map<string, string>();\n  private flushedCounterStyleKeys = new Set<string>();\n  private keyframesCounter = 0;\n  private counterStyleCounter = 0;\n  private internalsCollected = false;\n\n  /**\n   * Collect internal @property rules and :root token defaults.\n   * Mirrors markStylesGenerated() from the client-side injector.\n   * Called automatically on first chunk collection; idempotent.\n   *\n   * Internals are always emitted here — the RSC path deliberately\n   * defers to SSR so that tokens appear exactly once per page in\n   * <style data-tasty-ssr> (avoiding duplication of large token sets).\n   */\n  collectInternals(): void {\n    if (this.internalsCollected) return;\n    this.internalsCollected = true;\n\n    for (const [token, definition] of Object.entries(\n      getEffectiveProperties(),\n    )) {\n      const css = formatPropertyCSS(token, definition);\n      if (css) {\n        this.collectProperty(`__prop:${token}`, css);\n      }\n    }\n\n    const tokenStyles = getGlobalConfigTokens();\n    if (tokenStyles && Object.keys(tokenStyles).length > 0) {\n      const tokenRules = renderStyles(tokenStyles, ':root') as StyleResult[];\n      if (tokenRules.length > 0) {\n        const css = formatGlobalRules(tokenRules);\n        if (css) {\n          this.collectGlobalStyles('__global:tokens', css);\n        }\n      }\n    }\n\n    const globalFF = getGlobalFontFace();\n    if (globalFF) {\n      for (const [family, input] of Object.entries(globalFF)) {\n        const descriptors = Array.isArray(input) ? input : [input];\n        for (const desc of descriptors) {\n          const hash = fontFaceContentHash(family, desc);\n          const css = formatFontFaceRule(family, desc);\n          this.collectFontFace(hash, css);\n        }\n      }\n    }\n\n    const globalCS = getGlobalCounterStyle();\n    if (globalCS) {\n      for (const [name, descriptors] of Object.entries(globalCS)) {\n        const css = formatCounterStyleRule(name, descriptors);\n        this.collectCounterStyle(name, css);\n      }\n    }\n\n    const globalStyles = getGlobalStyles();\n    if (globalStyles) {\n      for (const [selector, styles] of Object.entries(globalStyles)) {\n        if (Object.keys(styles).length > 0) {\n          const rules = renderStyles(styles, selector) as StyleResult[];\n          if (rules.length > 0) {\n            const css = formatGlobalRules(rules);\n            if (css) {\n              this.collectGlobalStyles(`__global:styles:${selector}`, css);\n            }\n          }\n        }\n      }\n    }\n  }\n\n  /**\n   * Allocate a className for a cache key, server-side.\n   * Mirrors StyleInjector.allocateClassName but without DOM access.\n   */\n  allocateClassName(cacheKey: string): {\n    className: string;\n    isNewAllocation: boolean;\n  } {\n    const existing = this.cacheKeyToClassName.get(cacheKey);\n    if (existing) {\n      return { className: existing, isNewAllocation: false };\n    }\n\n    const className = generateClassName(cacheKey);\n    this.cacheKeyToClassName.set(cacheKey, className);\n\n    return { className, isNewAllocation: true };\n  }\n\n  /**\n   * Record CSS rules for a chunk.\n   * Called by useStyles during server render.\n   */\n  collectChunk(\n    cacheKey: string,\n    className: string,\n    rules: StyleResult[],\n  ): void {\n    if (this.chunks.has(cacheKey)) return;\n    const css = formatRules(rules, className);\n    if (css) {\n      this.chunks.set(cacheKey, css);\n    }\n  }\n\n  /**\n   * Record a @property rule. Deduplicated by name.\n   */\n  collectProperty(name: string, css: string): void {\n    if (!this.propertyRules.has(name)) {\n      this.propertyRules.set(name, css);\n    }\n  }\n\n  /**\n   * Record a @keyframes rule. Deduplicated by name.\n   */\n  collectKeyframes(name: string, css: string): void {\n    if (!this.keyframeRules.has(name)) {\n      this.keyframeRules.set(name, css);\n    }\n  }\n\n  /**\n   * Allocate a keyframe name for SSR. Uses provided name or generates one.\n   */\n  allocateKeyframeName(providedName?: string): string {\n    return providedName ?? `k${this.keyframesCounter++}`;\n  }\n\n  /**\n   * Record a @font-face rule. Deduplicated by key (content hash).\n   */\n  collectFontFace(key: string, css: string): void {\n    if (!this.fontFaceRules.has(key)) {\n      this.fontFaceRules.set(key, css);\n    }\n  }\n\n  /**\n   * Record a @counter-style rule. Deduplicated by name.\n   */\n  collectCounterStyle(name: string, css: string): void {\n    if (!this.counterStyleRules.has(name)) {\n      this.counterStyleRules.set(name, css);\n    }\n  }\n\n  /**\n   * Allocate a counter-style name for SSR. Uses provided name or generates one.\n   */\n  allocateCounterStyleName(providedName?: string): string {\n    return providedName ?? `cs${this.counterStyleCounter++}`;\n  }\n\n  /**\n   * Record global styles (from useGlobalStyles). Deduplicated by key.\n   */\n  collectGlobalStyles(key: string, css: string): void {\n    if (!this.globalStyles.has(key)) {\n      this.globalStyles.set(key, css);\n    }\n  }\n\n  /**\n   * Record raw CSS text (from useRawCSS). Deduplicated by key.\n   */\n  collectRawCSS(key: string, css: string): void {\n    if (!this.rawCSS.has(key)) {\n      this.rawCSS.set(key, css);\n    }\n  }\n\n  /**\n   * Extract all CSS collected so far as a single string.\n   * Includes @property and @keyframes rules.\n   * Used for non-streaming SSR (renderToString).\n   */\n  getCSS(): string {\n    const parts: string[] = [];\n\n    for (const css of this.propertyRules.values()) {\n      parts.push(css);\n    }\n\n    for (const css of this.fontFaceRules.values()) {\n      parts.push(css);\n    }\n\n    for (const css of this.counterStyleRules.values()) {\n      parts.push(css);\n    }\n\n    for (const css of this.rawCSS.values()) {\n      parts.push(css);\n    }\n\n    for (const css of this.globalStyles.values()) {\n      parts.push(css);\n    }\n\n    for (const css of this.chunks.values()) {\n      parts.push(css);\n    }\n\n    for (const css of this.keyframeRules.values()) {\n      parts.push(css);\n    }\n\n    return parts.join('\\n');\n  }\n\n  /**\n   * Flush only newly collected CSS since the last flush.\n   * Used for streaming SSR (renderToPipeableStream + useServerInsertedHTML).\n   */\n  flushCSS(): string {\n    const parts: string[] = [];\n\n    for (const [name, css] of this.propertyRules) {\n      if (!this.flushedPropertyKeys.has(name)) {\n        parts.push(css);\n        this.flushedPropertyKeys.add(name);\n      }\n    }\n\n    for (const [key, css] of this.fontFaceRules) {\n      if (!this.flushedFontFaceKeys.has(key)) {\n        parts.push(css);\n        this.flushedFontFaceKeys.add(key);\n      }\n    }\n\n    for (const [key, css] of this.counterStyleRules) {\n      if (!this.flushedCounterStyleKeys.has(key)) {\n        parts.push(css);\n        this.flushedCounterStyleKeys.add(key);\n      }\n    }\n\n    for (const [key, css] of this.rawCSS) {\n      if (!this.flushedRawKeys.has(key)) {\n        parts.push(css);\n        this.flushedRawKeys.add(key);\n      }\n    }\n\n    for (const [key, css] of this.globalStyles) {\n      if (!this.flushedGlobalKeys.has(key)) {\n        parts.push(css);\n        this.flushedGlobalKeys.add(key);\n      }\n    }\n\n    for (const [key, css] of this.chunks) {\n      if (!this.flushedKeys.has(key)) {\n        parts.push(css);\n        this.flushedKeys.add(key);\n      }\n    }\n\n    for (const [name, css] of this.keyframeRules) {\n      if (!this.flushedKeyframeKeys.has(name)) {\n        parts.push(css);\n        this.flushedKeyframeKeys.add(name);\n      }\n    }\n\n    return parts.join('\\n');\n  }\n\n  private flushedClassNames = new Set<string>();\n\n  /**\n   * Return class names rendered since the last call (for streaming).\n   * Used to emit lightweight class-list scripts for client hydration.\n   */\n  getRenderedClassNames(): string[] {\n    const names: string[] = [];\n    for (const className of this.cacheKeyToClassName.values()) {\n      if (!this.flushedClassNames.has(className)) {\n        this.flushedClassNames.add(className);\n        names.push(className);\n      }\n    }\n    return names;\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AA4BA,SAAS,kBAAkB,UAA0B;AACnD,QAAO,IAAI,WAAW,SAAS;;AAGjC,IAAa,uBAAb,MAAkC;CAChC,yBAAiB,IAAI,KAAqB;CAC1C,sCAA8B,IAAI,KAAqB;CACvD,8BAAsB,IAAI,KAAa;CACvC,gCAAwB,IAAI,KAAqB;CACjD,sCAA8B,IAAI,KAAa;CAC/C,gCAAwB,IAAI,KAAqB;CACjD,sCAA8B,IAAI,KAAa;CAC/C,+BAAuB,IAAI,KAAqB;CAChD,oCAA4B,IAAI,KAAa;CAC7C,yBAAiB,IAAI,KAAqB;CAC1C,iCAAyB,IAAI,KAAa;CAC1C,gCAAwB,IAAI,KAAqB;CACjD,sCAA8B,IAAI,KAAa;CAC/C,oCAA4B,IAAI,KAAqB;CACrD,0CAAkC,IAAI,KAAa;CACnD,mBAA2B;CAC3B,sBAA8B;CAC9B,qBAA6B;;;;;;;;;;CAW7B,mBAAyB;AACvB,MAAI,KAAK,mBAAoB;AAC7B,OAAK,qBAAqB;AAE1B,OAAK,MAAM,CAAC,OAAO,eAAe,OAAO,QACvC,wBAAwB,CACzB,EAAE;GACD,MAAM,MAAM,kBAAkB,OAAO,WAAW;AAChD,OAAI,IACF,MAAK,gBAAgB,UAAU,SAAS,IAAI;;EAIhD,MAAM,cAAc,uBAAuB;AAC3C,MAAI,eAAe,OAAO,KAAK,YAAY,CAAC,SAAS,GAAG;GACtD,MAAM,aAAa,aAAa,aAAa,QAAQ;AACrD,OAAI,WAAW,SAAS,GAAG;IACzB,MAAM,MAAM,kBAAkB,WAAW;AACzC,QAAI,IACF,MAAK,oBAAoB,mBAAmB,IAAI;;;EAKtD,MAAM,WAAW,mBAAmB;AACpC,MAAI,SACF,MAAK,MAAM,CAAC,QAAQ,UAAU,OAAO,QAAQ,SAAS,EAAE;GACtD,MAAM,cAAc,MAAM,QAAQ,MAAM,GAAG,QAAQ,CAAC,MAAM;AAC1D,QAAK,MAAM,QAAQ,aAAa;IAC9B,MAAM,OAAO,oBAAoB,QAAQ,KAAK;IAC9C,MAAM,MAAM,mBAAmB,QAAQ,KAAK;AAC5C,SAAK,gBAAgB,MAAM,IAAI;;;EAKrC,MAAM,WAAW,uBAAuB;AACxC,MAAI,SACF,MAAK,MAAM,CAAC,MAAM,gBAAgB,OAAO,QAAQ,SAAS,EAAE;GAC1D,MAAM,MAAM,uBAAuB,MAAM,YAAY;AACrD,QAAK,oBAAoB,MAAM,IAAI;;EAIvC,MAAM,eAAe,iBAAiB;AACtC,MAAI;QACG,MAAM,CAAC,UAAU,WAAW,OAAO,QAAQ,aAAa,CAC3D,KAAI,OAAO,KAAK,OAAO,CAAC,SAAS,GAAG;IAClC,MAAM,QAAQ,aAAa,QAAQ,SAAS;AAC5C,QAAI,MAAM,SAAS,GAAG;KACpB,MAAM,MAAM,kBAAkB,MAAM;AACpC,SAAI,IACF,MAAK,oBAAoB,mBAAmB,YAAY,IAAI;;;;;;;;;CAYxE,kBAAkB,UAGhB;EACA,MAAM,WAAW,KAAK,oBAAoB,IAAI,SAAS;AACvD,MAAI,SACF,QAAO;GAAE,WAAW;GAAU,iBAAiB;GAAO;EAGxD,MAAM,YAAY,kBAAkB,SAAS;AAC7C,OAAK,oBAAoB,IAAI,UAAU,UAAU;AAEjD,SAAO;GAAE;GAAW,iBAAiB;GAAM;;;;;;CAO7C,aACE,UACA,WACA,OACM;AACN,MAAI,KAAK,OAAO,IAAI,SAAS,CAAE;EAC/B,MAAM,MAAM,YAAY,OAAO,UAAU;AACzC,MAAI,IACF,MAAK,OAAO,IAAI,UAAU,IAAI;;;;;CAOlC,gBAAgB,MAAc,KAAmB;AAC/C,MAAI,CAAC,KAAK,cAAc,IAAI,KAAK,CAC/B,MAAK,cAAc,IAAI,MAAM,IAAI;;;;;CAOrC,iBAAiB,MAAc,KAAmB;AAChD,MAAI,CAAC,KAAK,cAAc,IAAI,KAAK,CAC/B,MAAK,cAAc,IAAI,MAAM,IAAI;;;;;CAOrC,qBAAqB,cAA+B;AAClD,SAAO,gBAAgB,IAAI,KAAK;;;;;CAMlC,gBAAgB,KAAa,KAAmB;AAC9C,MAAI,CAAC,KAAK,cAAc,IAAI,IAAI,CAC9B,MAAK,cAAc,IAAI,KAAK,IAAI;;;;;CAOpC,oBAAoB,MAAc,KAAmB;AACnD,MAAI,CAAC,KAAK,kBAAkB,IAAI,KAAK,CACnC,MAAK,kBAAkB,IAAI,MAAM,IAAI;;;;;CAOzC,yBAAyB,cAA+B;AACtD,SAAO,gBAAgB,KAAK,KAAK;;;;;CAMnC,oBAAoB,KAAa,KAAmB;AAClD,MAAI,CAAC,KAAK,aAAa,IAAI,IAAI,CAC7B,MAAK,aAAa,IAAI,KAAK,IAAI;;;;;CAOnC,cAAc,KAAa,KAAmB;AAC5C,MAAI,CAAC,KAAK,OAAO,IAAI,IAAI,CACvB,MAAK,OAAO,IAAI,KAAK,IAAI;;;;;;;CAS7B,SAAiB;EACf,MAAM,QAAkB,EAAE;AAE1B,OAAK,MAAM,OAAO,KAAK,cAAc,QAAQ,CAC3C,OAAM,KAAK,IAAI;AAGjB,OAAK,MAAM,OAAO,KAAK,cAAc,QAAQ,CAC3C,OAAM,KAAK,IAAI;AAGjB,OAAK,MAAM,OAAO,KAAK,kBAAkB,QAAQ,CAC/C,OAAM,KAAK,IAAI;AAGjB,OAAK,MAAM,OAAO,KAAK,OAAO,QAAQ,CACpC,OAAM,KAAK,IAAI;AAGjB,OAAK,MAAM,OAAO,KAAK,aAAa,QAAQ,CAC1C,OAAM,KAAK,IAAI;AAGjB,OAAK,MAAM,OAAO,KAAK,OAAO,QAAQ,CACpC,OAAM,KAAK,IAAI;AAGjB,OAAK,MAAM,OAAO,KAAK,cAAc,QAAQ,CAC3C,OAAM,KAAK,IAAI;AAGjB,SAAO,MAAM,KAAK,KAAK;;;;;;CAOzB,WAAmB;EACjB,MAAM,QAAkB,EAAE;AAE1B,OAAK,MAAM,CAAC,MAAM,QAAQ,KAAK,cAC7B,KAAI,CAAC,KAAK,oBAAoB,IAAI,KAAK,EAAE;AACvC,SAAM,KAAK,IAAI;AACf,QAAK,oBAAoB,IAAI,KAAK;;AAItC,OAAK,MAAM,CAAC,KAAK,QAAQ,KAAK,cAC5B,KAAI,CAAC,KAAK,oBAAoB,IAAI,IAAI,EAAE;AACtC,SAAM,KAAK,IAAI;AACf,QAAK,oBAAoB,IAAI,IAAI;;AAIrC,OAAK,MAAM,CAAC,KAAK,QAAQ,KAAK,kBAC5B,KAAI,CAAC,KAAK,wBAAwB,IAAI,IAAI,EAAE;AAC1C,SAAM,KAAK,IAAI;AACf,QAAK,wBAAwB,IAAI,IAAI;;AAIzC,OAAK,MAAM,CAAC,KAAK,QAAQ,KAAK,OAC5B,KAAI,CAAC,KAAK,eAAe,IAAI,IAAI,EAAE;AACjC,SAAM,KAAK,IAAI;AACf,QAAK,eAAe,IAAI,IAAI;;AAIhC,OAAK,MAAM,CAAC,KAAK,QAAQ,KAAK,aAC5B,KAAI,CAAC,KAAK,kBAAkB,IAAI,IAAI,EAAE;AACpC,SAAM,KAAK,IAAI;AACf,QAAK,kBAAkB,IAAI,IAAI;;AAInC,OAAK,MAAM,CAAC,KAAK,QAAQ,KAAK,OAC5B,KAAI,CAAC,KAAK,YAAY,IAAI,IAAI,EAAE;AAC9B,SAAM,KAAK,IAAI;AACf,QAAK,YAAY,IAAI,IAAI;;AAI7B,OAAK,MAAM,CAAC,MAAM,QAAQ,KAAK,cAC7B,KAAI,CAAC,KAAK,oBAAoB,IAAI,KAAK,EAAE;AACvC,SAAM,KAAK,IAAI;AACf,QAAK,oBAAoB,IAAI,KAAK;;AAItC,SAAO,MAAM,KAAK,KAAK;;CAGzB,oCAA4B,IAAI,KAAa;;;;;CAM7C,wBAAkC;EAChC,MAAM,QAAkB,EAAE;AAC1B,OAAK,MAAM,aAAa,KAAK,oBAAoB,QAAQ,CACvD,KAAI,CAAC,KAAK,kBAAkB,IAAI,UAAU,EAAE;AAC1C,QAAK,kBAAkB,IAAI,UAAU;AACrC,SAAM,KAAK,UAAU;;AAGzB,SAAO"}