@tenphi/tasty 0.1.2 → 0.2.0

package/dist/pipeline/parseStateKey.js.map

@@ -1 +1 @@
-{"version":3,"file":"parseStateKey.js","names":[],"sources":["../../src/pipeline/parseStateKey.ts"],"sourcesContent":["/**\n * State Key Parser\n *\n * Parses state notation strings (like 'hovered & !disabled', '@media(w < 768px)')\n * into ConditionNode trees for processing in the pipeline.\n */\n\nimport { Lru } from '../parser/lru';\nimport type {\n  StateParserContext} from '../states';\nimport {\n  expandDimensionShorthands,\n  expandTastyUnits,\n  findTopLevelComma,\n  resolvePredefinedState\n} from '../states';\nimport { camelToKebab } from '../utils/case-converter';\n\nimport type {\n  ConditionNode,\n  NumericBound} from './conditions';\nimport {\n  and,\n  createContainerDimensionCondition,\n  createContainerRawCondition,\n  createContainerStyleCondition,\n  createMediaDimensionCondition,\n  createMediaFeatureCondition,\n  createMediaTypeCondition,\n  createModifierCondition,\n  createOwnCondition,\n  createPseudoCondition,\n  createRootCondition,\n  createStartingCondition,\n  createSupportsCondition,\n  not,\n  or,\n  trueCondition,\n} from './conditions';\n\n// ============================================================================\n// Types\n// ============================================================================\n\nexport interface ParseStateKeyOptions {\n  context?: StateParserContext;\n  isSubElement?: boolean;\n}\n\n// ============================================================================\n// Caching\n// ============================================================================\n\n// Cache for parsed state keys (key -> ConditionNode)\nconst parseCache = new Lru<string, ConditionNode>(5000);\n\n// ============================================================================\n// Tokenizer Patterns\n// ============================================================================\n\n/**\n * Pattern for tokenizing state notation.\n * Matches: operators, parentheses, @-prefixed states, value mods, boolean mods,\n * pseudo-classes, class selectors, and attribute selectors.\n *\n * Note: For @supports and @(...) container queries we need to handle nested parentheses\n * like @supports($, :has(*)) or @(scroll-state(stuck: top)).\n * We use a pattern that allows one level of nesting: [^()]*(?:\\([^)]*\\))?[^)]*\n */\nconst STATE_TOKEN_PATTERN =\n  /([&|!^])|([()])|(@media:[a-z]+)|(@media\\([^)]+\\))|(@supports\\([^()]*(?:\\([^)]*\\))?[^)]*\\))|(@root\\([^)]+\\))|(@own\\([^)]+\\))|(@\\([^()]*(?:\\([^)]*\\))?[^)]*\\))|(@starting)|(@[A-Za-z][A-Za-z0-9-]*)|([a-z][a-z0-9-]*(?:\\^=|\\$=|\\*=|=)(?:\"[^\"]*\"|'[^']*'|[^\\s&|!^()]+))|([a-z][a-z0-9-]+)|(:[-a-z][a-z0-9-]*(?:\\([^)]+\\))?)|(\\.[a-z][a-z0-9-]+)|(\\[[^\\]]+\\])/gi;\n\n// ============================================================================\n// Token Types\n// ============================================================================\n\ntype TokenType = 'AND' | 'OR' | 'NOT' | 'XOR' | 'LPAREN' | 'RPAREN' | 'STATE';\n\ninterface Token {\n  type: TokenType;\n  value: string;\n  raw: string;\n}\n\n// ============================================================================\n// Tokenizer\n// ============================================================================\n\n/**\n * Tokenize a state notation string\n */\nfunction tokenize(stateKey: string): Token[] {\n  const tokens: Token[] = [];\n  let match: RegExpExecArray | null;\n\n  // Replace commas with | outside of parentheses (for compatibility)\n  const normalized = replaceCommasOutsideParens(stateKey);\n\n  STATE_TOKEN_PATTERN.lastIndex = 0;\n  while ((match = STATE_TOKEN_PATTERN.exec(normalized)) !== null) {\n    const fullMatch = match[0];\n\n    if (match[1]) {\n      // Operator: &, |, !, ^\n      switch (fullMatch) {\n        case '&':\n          tokens.push({ type: 'AND', value: '&', raw: fullMatch });\n          break;\n        case '|':\n          tokens.push({ type: 'OR', value: '|', raw: fullMatch });\n          break;\n        case '!':\n          tokens.push({ type: 'NOT', value: '!', raw: fullMatch });\n          break;\n        case '^':\n          tokens.push({ type: 'XOR', value: '^', raw: fullMatch });\n          break;\n      }\n    } else if (match[2]) {\n      // Parenthesis\n      if (fullMatch === '(') {\n        tokens.push({ type: 'LPAREN', value: '(', raw: fullMatch });\n      } else {\n        tokens.push({ type: 'RPAREN', value: ')', raw: fullMatch });\n      }\n    } else {\n      // State token (all other capture groups)\n      tokens.push({ type: 'STATE', value: fullMatch, raw: fullMatch });\n    }\n  }\n\n  return tokens;\n}\n\n/**\n * Replace commas with | only outside of parentheses\n */\nfunction replaceCommasOutsideParens(str: string): string {\n  let result = '';\n  let depth = 0;\n\n  for (const char of str) {\n    if (char === '(') {\n      depth++;\n      result += char;\n    } else if (char === ')') {\n      depth--;\n      result += char;\n    } else if (char === ',' && depth === 0) {\n      result += '|';\n    } else {\n      result += char;\n    }\n  }\n\n  return result;\n}\n\n// ============================================================================\n// Recursive Descent Parser\n// ============================================================================\n\n/**\n * Parser state\n */\nclass Parser {\n  private tokens: Token[];\n  private pos = 0;\n  private options: ParseStateKeyOptions;\n\n  constructor(tokens: Token[], options: ParseStateKeyOptions) {\n    this.tokens = tokens;\n    this.options = options;\n  }\n\n  parse(): ConditionNode {\n    if (this.tokens.length === 0) {\n      return trueCondition();\n    }\n    const result = this.parseExpression();\n    return result;\n  }\n\n  private current(): Token | undefined {\n    return this.tokens[this.pos];\n  }\n\n  private advance(): Token | undefined {\n    return this.tokens[this.pos++];\n  }\n\n  private match(type: TokenType): boolean {\n    if (this.current()?.type === type) {\n      this.advance();\n      return true;\n    }\n    return false;\n  }\n\n  /**\n   * Parse expression with operator precedence:\n   * ! (NOT) > ^ (XOR) > | (OR) > & (AND)\n   */\n  private parseExpression(): ConditionNode {\n    return this.parseAnd();\n  }\n\n  private parseAnd(): ConditionNode {\n    let left = this.parseOr();\n\n    while (this.current()?.type === 'AND') {\n      this.advance();\n      const right = this.parseOr();\n      left = and(left, right);\n    }\n\n    return left;\n  }\n\n  private parseOr(): ConditionNode {\n    let left = this.parseXor();\n\n    while (this.current()?.type === 'OR') {\n      this.advance();\n      const right = this.parseXor();\n      left = or(left, right);\n    }\n\n    return left;\n  }\n\n  private parseXor(): ConditionNode {\n    let left = this.parseUnary();\n\n    while (this.current()?.type === 'XOR') {\n      this.advance();\n      const right = this.parseUnary();\n      // XOR: (A & !B) | (!A & B)\n      left = or(and(left, not(right)), and(not(left), right));\n    }\n\n    return left;\n  }\n\n  private parseUnary(): ConditionNode {\n    if (this.match('NOT')) {\n      const operand = this.parseUnary();\n      return not(operand);\n    }\n    return this.parsePrimary();\n  }\n\n  private parsePrimary(): ConditionNode {\n    // Handle parentheses\n    if (this.match('LPAREN')) {\n      const expr = this.parseExpression();\n      this.match('RPAREN'); // Consume closing paren (lenient if missing)\n      return expr;\n    }\n\n    // Handle state tokens\n    const token = this.current();\n    if (token?.type === 'STATE') {\n      this.advance();\n      return this.parseStateToken(token.value);\n    }\n\n    // Fallback for empty/invalid - return TRUE\n    return trueCondition();\n  }\n\n  /**\n   * Parse a state token into a ConditionNode\n   */\n  private parseStateToken(value: string): ConditionNode {\n    // @starting\n    if (value === '@starting') {\n      return createStartingCondition(false, value);\n    }\n\n    // @media:type (e.g., @media:print)\n    if (value.startsWith('@media:')) {\n      const mediaType = value.slice(7) as 'print' | 'screen' | 'all' | 'speech';\n      return createMediaTypeCondition(mediaType, false, value);\n    }\n\n    // @media(...) - media query\n    if (value.startsWith('@media(')) {\n      return this.parseMediaQuery(value);\n    }\n\n    // @supports(...) - feature/selector support query\n    if (value.startsWith('@supports(')) {\n      return this.parseSupportsQuery(value);\n    }\n\n    // @root(...) - root state\n    if (value.startsWith('@root(')) {\n      return this.parseRootState(value);\n    }\n\n    // @own(...) - own state (sub-element)\n    if (value.startsWith('@own(')) {\n      return this.parseOwnState(value);\n    }\n\n    // @(...) - container query\n    if (value.startsWith('@(')) {\n      return this.parseContainerQuery(value);\n    }\n\n    // @name - predefined state\n    if (value.startsWith('@') && /^@[A-Za-z][A-Za-z0-9-]*$/.test(value)) {\n      return this.parsePredefinedState(value);\n    }\n\n    // Pseudo-class (e.g., :hover, :focus-visible, :nth-child(2n))\n    if (value.startsWith(':')) {\n      return createPseudoCondition(value, false, value);\n    }\n\n    // Class selector (e.g., .active)\n    if (value.startsWith('.')) {\n      return createPseudoCondition(value, false, value);\n    }\n\n    // Attribute selector (e.g., [disabled], [data-state=\"active\"])\n    if (value.startsWith('[')) {\n      return createPseudoCondition(value, false, value);\n    }\n\n    // Value modifier (e.g., theme=danger, size=large)\n    if (value.includes('=')) {\n      return this.parseValueModifier(value);\n    }\n\n    // Boolean modifier (e.g., hovered, disabled)\n    return this.parseBooleanModifier(value);\n  }\n\n  /**\n   * Parse @media(...) query\n   */\n  private parseMediaQuery(raw: string): ConditionNode {\n    const content = raw.slice(7, -1); // Remove '@media(' and ')'\n    if (!content.trim()) {\n      return trueCondition();\n    }\n\n    // Expand shorthands and units\n    let condition = expandDimensionShorthands(content);\n    condition = expandTastyUnits(condition);\n\n    // Check for feature queries (contains ':' but not dimension comparison)\n    if (\n      condition.includes(':') &&\n      !condition.includes('<') &&\n      !condition.includes('>') &&\n      !condition.includes('=')\n    ) {\n      // Feature query: @media(prefers-contrast: high)\n      const colonIdx = condition.indexOf(':');\n      const feature = condition.slice(0, colonIdx).trim();\n      const featureValue = condition.slice(colonIdx + 1).trim();\n      return createMediaFeatureCondition(feature, featureValue, false, raw);\n    }\n\n    // Boolean feature query: @media(prefers-reduced-motion)\n    if (\n      !condition.includes('<') &&\n      !condition.includes('>') &&\n      !condition.includes('=')\n    ) {\n      return createMediaFeatureCondition(\n        condition.trim(),\n        undefined,\n        false,\n        raw,\n      );\n    }\n\n    // Dimension query - parse bounds\n    const { dimension, lowerBound, upperBound } =\n      this.parseDimensionCondition(condition);\n\n    if (!dimension) {\n      // Fallback for unparseable - treat as pseudo\n      return createPseudoCondition(raw, false, raw);\n    }\n\n    return createMediaDimensionCondition(\n      dimension as 'width' | 'height',\n      lowerBound,\n      upperBound,\n      false,\n      raw,\n    );\n  }\n\n  /**\n   * Parse dimension condition string (e.g., \"width < 768px\", \"600px <= width < 1200px\")\n   */\n  private parseDimensionCondition(condition: string): {\n    dimension?: string;\n    lowerBound?: NumericBound;\n    upperBound?: NumericBound;\n  } {\n    // Range syntax: \"600px <= width < 1200px\"\n    const rangeMatch = condition.match(\n      /^(.+?)\\s*(<=|<)\\s*(width|height|inline-size|block-size)\\s*(<=|<)\\s*(.+)$/,\n    );\n    if (rangeMatch) {\n      const [, lowerValue, lowerOp, dimension, upperOp, upperValue] =\n        rangeMatch;\n      return {\n        dimension,\n        lowerBound: {\n          value: lowerValue.trim(),\n          valueNumeric: parseNumericValue(lowerValue.trim()),\n          inclusive: lowerOp === '<=',\n        },\n        upperBound: {\n          value: upperValue.trim(),\n          valueNumeric: parseNumericValue(upperValue.trim()),\n          inclusive: upperOp === '<=',\n        },\n      };\n    }\n\n    // Simple comparison: \"width < 768px\"\n    const simpleMatch = condition.match(\n      /^(width|height|inline-size|block-size)\\s*(<=|>=|<|>|=)\\s*(.+)$/,\n    );\n    if (simpleMatch) {\n      const [, dimension, operator, value] = simpleMatch;\n      const numeric = parseNumericValue(value.trim());\n\n      if (operator === '<' || operator === '<=') {\n        return {\n          dimension,\n          upperBound: {\n            value: value.trim(),\n            valueNumeric: numeric,\n            inclusive: operator === '<=',\n          },\n        };\n      } else if (operator === '>' || operator === '>=') {\n        return {\n          dimension,\n          lowerBound: {\n            value: value.trim(),\n            valueNumeric: numeric,\n            inclusive: operator === '>=',\n          },\n        };\n      } else if (operator === '=') {\n        // Exact match: both bounds are the same and inclusive\n        return {\n          dimension,\n          lowerBound: {\n            value: value.trim(),\n            valueNumeric: numeric,\n            inclusive: true,\n          },\n          upperBound: {\n            value: value.trim(),\n            valueNumeric: numeric,\n            inclusive: true,\n          },\n        };\n      }\n    }\n\n    // Reversed: \"768px > width\"\n    const reversedMatch = condition.match(\n      /^(.+?)\\s*(<=|>=|<|>|=)\\s*(width|height|inline-size|block-size)$/,\n    );\n    if (reversedMatch) {\n      const [, value, operator, dimension] = reversedMatch;\n      const numeric = parseNumericValue(value.trim());\n\n      // Reverse the operator\n      if (operator === '<' || operator === '<=') {\n        return {\n          dimension,\n          lowerBound: {\n            value: value.trim(),\n            valueNumeric: numeric,\n            inclusive: operator === '<=',\n          },\n        };\n      } else if (operator === '>' || operator === '>=') {\n        return {\n          dimension,\n          upperBound: {\n            value: value.trim(),\n            valueNumeric: numeric,\n            inclusive: operator === '>=',\n          },\n        };\n      }\n    }\n\n    return {};\n  }\n\n  /**\n   * Parse @root(...) state\n   */\n  private parseRootState(raw: string): ConditionNode {\n    const content = raw.slice(6, -1); // Remove '@root(' and ')'\n    if (!content.trim()) {\n      return trueCondition();\n    }\n\n    // Build selector from condition\n    const selector = buildRootSelector(content);\n    return createRootCondition(selector, false, raw);\n  }\n\n  /**\n   * Parse @supports(...) query\n   *\n   * Syntax:\n   *   @supports(display: grid)     → @supports (display: grid)\n   *   @supports($, :has(*))        → @supports selector(:has(*))\n   */\n  private parseSupportsQuery(raw: string): ConditionNode {\n    const content = raw.slice(10, -1); // Remove '@supports(' and ')'\n    if (!content.trim()) {\n      return trueCondition();\n    }\n\n    // Check for selector syntax: @supports($, :has(*))\n    if (content.startsWith('$,')) {\n      const selector = content.slice(2).trim(); // Remove '$,' prefix\n      return createSupportsCondition('selector', selector, false, raw);\n    }\n\n    // Feature syntax: @supports(display: grid)\n    return createSupportsCondition('feature', content, false, raw);\n  }\n\n  /**\n   * Parse @own(...) state\n   */\n  private parseOwnState(raw: string): ConditionNode {\n    const content = raw.slice(5, -1); // Remove '@own(' and ')'\n    if (!content.trim()) {\n      return trueCondition();\n    }\n\n    // Parse the inner condition recursively\n    const innerCondition = parseStateKey(content, this.options);\n    return createOwnCondition(innerCondition, false, raw);\n  }\n\n  /**\n   * Parse @(...) container query\n   */\n  private parseContainerQuery(raw: string): ConditionNode {\n    const content = raw.slice(2, -1); // Remove '@(' and ')'\n    if (!content.trim()) {\n      return trueCondition();\n    }\n\n    // Check for named container: @(layout, w < 600px)\n    // Use parentheses-aware comma search so inner commas (e.g., scroll-state(a, b)) are skipped\n    const commaIdx = findTopLevelComma(content);\n    let containerName: string | undefined;\n    let condition: string;\n\n    if (commaIdx !== -1) {\n      containerName = content.slice(0, commaIdx).trim();\n      condition = content.slice(commaIdx + 1).trim();\n    } else {\n      condition = content.trim();\n    }\n\n    // Check for style query shorthand: @($variant=primary)\n    if (condition.startsWith('$')) {\n      const styleQuery = condition.slice(1); // Remove '$'\n      const eqIdx = styleQuery.indexOf('=');\n\n      if (eqIdx === -1) {\n        // Existence check: @($variant)\n        return createContainerStyleCondition(\n          styleQuery,\n          undefined,\n          containerName,\n          false,\n          raw,\n        );\n      }\n\n      const property = styleQuery.slice(0, eqIdx).trim();\n      let propertyValue = styleQuery.slice(eqIdx + 1).trim();\n\n      // Remove quotes if present\n      if (\n        (propertyValue.startsWith('\"') && propertyValue.endsWith('\"')) ||\n        (propertyValue.startsWith(\"'\") && propertyValue.endsWith(\"'\"))\n      ) {\n        propertyValue = propertyValue.slice(1, -1);\n      }\n\n      return createContainerStyleCondition(\n        property,\n        propertyValue,\n        containerName,\n        false,\n        raw,\n      );\n    }\n\n    // Check for function-like syntax: scroll-state(...), style(...), etc.\n    // Passes the condition through to CSS verbatim.\n    if (/^[a-zA-Z][\\w-]*\\s*\\(/.test(condition)) {\n      return createContainerRawCondition(condition, containerName, false, raw);\n    }\n\n    // Dimension query\n    let expandedCondition = expandDimensionShorthands(condition);\n    expandedCondition = expandTastyUnits(expandedCondition);\n\n    const { dimension, lowerBound, upperBound } =\n      this.parseDimensionCondition(expandedCondition);\n\n    if (!dimension) {\n      // Fallback\n      return createPseudoCondition(raw, false, raw);\n    }\n\n    return createContainerDimensionCondition(\n      dimension as 'width' | 'height',\n      lowerBound,\n      upperBound,\n      containerName,\n      false,\n      raw,\n    );\n  }\n\n  /**\n   * Parse predefined state (@mobile, @dark, etc.)\n   */\n  private parsePredefinedState(raw: string): ConditionNode {\n    const ctx = this.options.context;\n    if (!ctx) {\n      // No context - can't resolve predefined states\n      return createPseudoCondition(raw, false, raw);\n    }\n\n    const resolved = resolvePredefinedState(raw, ctx);\n    if (!resolved) {\n      // Undefined predefined state - treat as modifier\n      return createModifierCondition(\n        `data-${camelToKebab(raw.slice(1))}`,\n        undefined,\n        '=',\n        false,\n        raw,\n      );\n    }\n\n    // Parse the resolved value recursively\n    return parseStateKey(resolved, this.options);\n  }\n\n  /**\n   * Parse value modifier (e.g., theme=danger, size^=sm)\n   */\n  private parseValueModifier(raw: string): ConditionNode {\n    // Match operators: =, ^=, $=, *=\n    const opMatch = raw.match(/^([a-z][a-z0-9-]*)(\\^=|\\$=|\\*=|=)(.+)$/i);\n    if (!opMatch) {\n      return createModifierCondition(\n        `data-${camelToKebab(raw)}`,\n        undefined,\n        '=',\n        false,\n        raw,\n      );\n    }\n\n    const [, key, operator, value] = opMatch;\n    let cleanValue = value;\n\n    // Remove quotes if present\n    if (\n      (cleanValue.startsWith('\"') && cleanValue.endsWith('\"')) ||\n      (cleanValue.startsWith(\"'\") && cleanValue.endsWith(\"'\"))\n    ) {\n      cleanValue = cleanValue.slice(1, -1);\n    }\n\n    return createModifierCondition(\n      `data-${camelToKebab(key)}`,\n      cleanValue,\n      operator as '=' | '^=' | '$=' | '*=',\n      false,\n      raw,\n    );\n  }\n\n  /**\n   * Parse boolean modifier (e.g., hovered, disabled)\n   */\n  private parseBooleanModifier(raw: string): ConditionNode {\n    return createModifierCondition(\n      `data-${camelToKebab(raw)}`,\n      undefined,\n      '=',\n      false,\n      raw,\n    );\n  }\n}\n\n// ============================================================================\n// Helper Functions\n// ============================================================================\n\n/**\n * Parse a numeric value from a CSS value string\n */\nfunction parseNumericValue(value: string): number | null {\n  const match = value.match(/^(\\d+(?:\\.\\d+)?)(px|em|rem|vh|vw|%)?$/);\n  if (match) {\n    return parseFloat(match[1]);\n  }\n  return null;\n}\n\n/**\n * Build a root state selector from a condition string\n */\nfunction buildRootSelector(condition: string): string {\n  // Handle class selector: .className\n  if (condition.startsWith('.')) {\n    return condition;\n  }\n\n  // Handle attribute selector: [attr]\n  if (condition.startsWith('[')) {\n    return condition;\n  }\n\n  // Handle value mod: theme=dark\n  if (condition.includes('=')) {\n    const [key, value] = condition.split('=');\n    return `[data-${camelToKebab(key.trim())}=\"${value.trim()}\"]`;\n  }\n\n  // Boolean mod: camelCase -> [data-camel-case]\n  return `[data-${camelToKebab(condition)}]`;\n}\n\n// ============================================================================\n// Main Export\n// ============================================================================\n\n/**\n * Parse a state key string into a ConditionNode\n */\nexport function parseStateKey(\n  stateKey: string,\n  options: ParseStateKeyOptions = {},\n): ConditionNode {\n  // Handle empty/default state\n  if (!stateKey || !stateKey.trim()) {\n    return trueCondition();\n  }\n\n  const trimmed = stateKey.trim();\n\n  // Build cache key including local predefined states (they affect parsing)\n  // Global predefined states are set once at initialization and don't change\n  const ctx = options.context;\n  const localStatesKey =\n    ctx && Object.keys(ctx.localPredefinedStates).length > 0\n      ? JSON.stringify(ctx.localPredefinedStates)\n      : '';\n  const cacheKey = JSON.stringify([\n    trimmed,\n    options.isSubElement,\n    localStatesKey,\n  ]);\n\n  // Check cache\n  const cached = parseCache.get(cacheKey);\n  if (cached) {\n    return cached;\n  }\n\n  // Tokenize and parse\n  const tokens = tokenize(trimmed);\n  const parser = new Parser(tokens, options);\n  const result = parser.parse();\n\n  // Cache result\n  parseCache.set(cacheKey, result);\n\n  return result;\n}\n\n/**\n * Clear the parse cache (for testing)\n */\nexport function clearParseCache(): void {\n  parseCache.clear();\n}\n"],"mappings":";;;;;;;;;;;;AAsDA,MAAM,aAAa,IAAI,IAA2B,IAAK;;;;;;;;;;AAevD,MAAM,sBACJ;;;;AAqBF,SAAS,SAAS,UAA2B;CAC3C,MAAM,SAAkB,EAAE;CAC1B,IAAI;CAGJ,MAAM,aAAa,2BAA2B,SAAS;AAEvD,qBAAoB,YAAY;AAChC,SAAQ,QAAQ,oBAAoB,KAAK,WAAW,MAAM,MAAM;EAC9D,MAAM,YAAY,MAAM;AAExB,MAAI,MAAM,GAER,SAAQ,WAAR;GACE,KAAK;AACH,WAAO,KAAK;KAAE,MAAM;KAAO,OAAO;KAAK,KAAK;KAAW,CAAC;AACxD;GACF,KAAK;AACH,WAAO,KAAK;KAAE,MAAM;KAAM,OAAO;KAAK,KAAK;KAAW,CAAC;AACvD;GACF,KAAK;AACH,WAAO,KAAK;KAAE,MAAM;KAAO,OAAO;KAAK,KAAK;KAAW,CAAC;AACxD;GACF,KAAK;AACH,WAAO,KAAK;KAAE,MAAM;KAAO,OAAO;KAAK,KAAK;KAAW,CAAC;AACxD;;WAEK,MAAM,GAEf,KAAI,cAAc,IAChB,QAAO,KAAK;GAAE,MAAM;GAAU,OAAO;GAAK,KAAK;GAAW,CAAC;MAE3D,QAAO,KAAK;GAAE,MAAM;GAAU,OAAO;GAAK,KAAK;GAAW,CAAC;MAI7D,QAAO,KAAK;GAAE,MAAM;GAAS,OAAO;GAAW,KAAK;GAAW,CAAC;;AAIpE,QAAO;;;;;AAMT,SAAS,2BAA2B,KAAqB;CACvD,IAAI,SAAS;CACb,IAAI,QAAQ;AAEZ,MAAK,MAAM,QAAQ,IACjB,KAAI,SAAS,KAAK;AAChB;AACA,YAAU;YACD,SAAS,KAAK;AACvB;AACA,YAAU;YACD,SAAS,OAAO,UAAU,EACnC,WAAU;KAEV,WAAU;AAId,QAAO;;;;;AAUT,IAAM,SAAN,MAAa;CACX,AAAQ;CACR,AAAQ,MAAM;CACd,AAAQ;CAER,YAAY,QAAiB,SAA+B;AAC1D,OAAK,SAAS;AACd,OAAK,UAAU;;CAGjB,QAAuB;AACrB,MAAI,KAAK,OAAO,WAAW,EACzB,QAAO,eAAe;AAGxB,SADe,KAAK,iBAAiB;;CAIvC,AAAQ,UAA6B;AACnC,SAAO,KAAK,OAAO,KAAK;;CAG1B,AAAQ,UAA6B;AACnC,SAAO,KAAK,OAAO,KAAK;;CAG1B,AAAQ,MAAM,MAA0B;AACtC,MAAI,KAAK,SAAS,EAAE,SAAS,MAAM;AACjC,QAAK,SAAS;AACd,UAAO;;AAET,SAAO;;;;;;CAOT,AAAQ,kBAAiC;AACvC,SAAO,KAAK,UAAU;;CAGxB,AAAQ,WAA0B;EAChC,IAAI,OAAO,KAAK,SAAS;AAEzB,SAAO,KAAK,SAAS,EAAE,SAAS,OAAO;AACrC,QAAK,SAAS;GACd,MAAM,QAAQ,KAAK,SAAS;AAC5B,UAAO,IAAI,MAAM,MAAM;;AAGzB,SAAO;;CAGT,AAAQ,UAAyB;EAC/B,IAAI,OAAO,KAAK,UAAU;AAE1B,SAAO,KAAK,SAAS,EAAE,SAAS,MAAM;AACpC,QAAK,SAAS;GACd,MAAM,QAAQ,KAAK,UAAU;AAC7B,UAAO,GAAG,MAAM,MAAM;;AAGxB,SAAO;;CAGT,AAAQ,WAA0B;EAChC,IAAI,OAAO,KAAK,YAAY;AAE5B,SAAO,KAAK,SAAS,EAAE,SAAS,OAAO;AACrC,QAAK,SAAS;GACd,MAAM,QAAQ,KAAK,YAAY;AAE/B,UAAO,GAAG,IAAI,MAAM,IAAI,MAAM,CAAC,EAAE,IAAI,IAAI,KAAK,EAAE,MAAM,CAAC;;AAGzD,SAAO;;CAGT,AAAQ,aAA4B;AAClC,MAAI,KAAK,MAAM,MAAM,CAEnB,QAAO,IADS,KAAK,YAAY,CACd;AAErB,SAAO,KAAK,cAAc;;CAG5B,AAAQ,eAA8B;AAEpC,MAAI,KAAK,MAAM,SAAS,EAAE;GACxB,MAAM,OAAO,KAAK,iBAAiB;AACnC,QAAK,MAAM,SAAS;AACpB,UAAO;;EAIT,MAAM,QAAQ,KAAK,SAAS;AAC5B,MAAI,OAAO,SAAS,SAAS;AAC3B,QAAK,SAAS;AACd,UAAO,KAAK,gBAAgB,MAAM,MAAM;;AAI1C,SAAO,eAAe;;;;;CAMxB,AAAQ,gBAAgB,OAA8B;AAEpD,MAAI,UAAU,YACZ,QAAO,wBAAwB,OAAO,MAAM;AAI9C,MAAI,MAAM,WAAW,UAAU,CAE7B,QAAO,yBADW,MAAM,MAAM,EAAE,EACW,OAAO,MAAM;AAI1D,MAAI,MAAM,WAAW,UAAU,CAC7B,QAAO,KAAK,gBAAgB,MAAM;AAIpC,MAAI,MAAM,WAAW,aAAa,CAChC,QAAO,KAAK,mBAAmB,MAAM;AAIvC,MAAI,MAAM,WAAW,SAAS,CAC5B,QAAO,KAAK,eAAe,MAAM;AAInC,MAAI,MAAM,WAAW,QAAQ,CAC3B,QAAO,KAAK,cAAc,MAAM;AAIlC,MAAI,MAAM,WAAW,KAAK,CACxB,QAAO,KAAK,oBAAoB,MAAM;AAIxC,MAAI,MAAM,WAAW,IAAI,IAAI,2BAA2B,KAAK,MAAM,CACjE,QAAO,KAAK,qBAAqB,MAAM;AAIzC,MAAI,MAAM,WAAW,IAAI,CACvB,QAAO,sBAAsB,OAAO,OAAO,MAAM;AAInD,MAAI,MAAM,WAAW,IAAI,CACvB,QAAO,sBAAsB,OAAO,OAAO,MAAM;AAInD,MAAI,MAAM,WAAW,IAAI,CACvB,QAAO,sBAAsB,OAAO,OAAO,MAAM;AAInD,MAAI,MAAM,SAAS,IAAI,CACrB,QAAO,KAAK,mBAAmB,MAAM;AAIvC,SAAO,KAAK,qBAAqB,MAAM;;;;;CAMzC,AAAQ,gBAAgB,KAA4B;EAClD,MAAM,UAAU,IAAI,MAAM,GAAG,GAAG;AAChC,MAAI,CAAC,QAAQ,MAAM,CACjB,QAAO,eAAe;EAIxB,IAAI,YAAY,0BAA0B,QAAQ;AAClD,cAAY,iBAAiB,UAAU;AAGvC,MACE,UAAU,SAAS,IAAI,IACvB,CAAC,UAAU,SAAS,IAAI,IACxB,CAAC,UAAU,SAAS,IAAI,IACxB,CAAC,UAAU,SAAS,IAAI,EACxB;GAEA,MAAM,WAAW,UAAU,QAAQ,IAAI;AAGvC,UAAO,4BAFS,UAAU,MAAM,GAAG,SAAS,CAAC,MAAM,EAC9B,UAAU,MAAM,WAAW,EAAE,CAAC,MAAM,EACC,OAAO,IAAI;;AAIvE,MACE,CAAC,UAAU,SAAS,IAAI,IACxB,CAAC,UAAU,SAAS,IAAI,IACxB,CAAC,UAAU,SAAS,IAAI,CAExB,QAAO,4BACL,UAAU,MAAM,EAChB,QACA,OACA,IACD;EAIH,MAAM,EAAE,WAAW,YAAY,eAC7B,KAAK,wBAAwB,UAAU;AAEzC,MAAI,CAAC,UAEH,QAAO,sBAAsB,KAAK,OAAO,IAAI;AAG/C,SAAO,8BACL,WACA,YACA,YACA,OACA,IACD;;;;;CAMH,AAAQ,wBAAwB,WAI9B;EAEA,MAAM,aAAa,UAAU,MAC3B,2EACD;AACD,MAAI,YAAY;GACd,MAAM,GAAG,YAAY,SAAS,WAAW,SAAS,cAChD;AACF,UAAO;IACL;IACA,YAAY;KACV,OAAO,WAAW,MAAM;KACxB,cAAc,kBAAkB,WAAW,MAAM,CAAC;KAClD,WAAW,YAAY;KACxB;IACD,YAAY;KACV,OAAO,WAAW,MAAM;KACxB,cAAc,kBAAkB,WAAW,MAAM,CAAC;KAClD,WAAW,YAAY;KACxB;IACF;;EAIH,MAAM,cAAc,UAAU,MAC5B,iEACD;AACD,MAAI,aAAa;GACf,MAAM,GAAG,WAAW,UAAU,SAAS;GACvC,MAAM,UAAU,kBAAkB,MAAM,MAAM,CAAC;AAE/C,OAAI,aAAa,OAAO,aAAa,KACnC,QAAO;IACL;IACA,YAAY;KACV,OAAO,MAAM,MAAM;KACnB,cAAc;KACd,WAAW,aAAa;KACzB;IACF;YACQ,aAAa,OAAO,aAAa,KAC1C,QAAO;IACL;IACA,YAAY;KACV,OAAO,MAAM,MAAM;KACnB,cAAc;KACd,WAAW,aAAa;KACzB;IACF;YACQ,aAAa,IAEtB,QAAO;IACL;IACA,YAAY;KACV,OAAO,MAAM,MAAM;KACnB,cAAc;KACd,WAAW;KACZ;IACD,YAAY;KACV,OAAO,MAAM,MAAM;KACnB,cAAc;KACd,WAAW;KACZ;IACF;;EAKL,MAAM,gBAAgB,UAAU,MAC9B,kEACD;AACD,MAAI,eAAe;GACjB,MAAM,GAAG,OAAO,UAAU,aAAa;GACvC,MAAM,UAAU,kBAAkB,MAAM,MAAM,CAAC;AAG/C,OAAI,aAAa,OAAO,aAAa,KACnC,QAAO;IACL;IACA,YAAY;KACV,OAAO,MAAM,MAAM;KACnB,cAAc;KACd,WAAW,aAAa;KACzB;IACF;YACQ,aAAa,OAAO,aAAa,KAC1C,QAAO;IACL;IACA,YAAY;KACV,OAAO,MAAM,MAAM;KACnB,cAAc;KACd,WAAW,aAAa;KACzB;IACF;;AAIL,SAAO,EAAE;;;;;CAMX,AAAQ,eAAe,KAA4B;EACjD,MAAM,UAAU,IAAI,MAAM,GAAG,GAAG;AAChC,MAAI,CAAC,QAAQ,MAAM,CACjB,QAAO,eAAe;AAKxB,SAAO,oBADU,kBAAkB,QAAQ,EACN,OAAO,IAAI;;;;;;;;;CAUlD,AAAQ,mBAAmB,KAA4B;EACrD,MAAM,UAAU,IAAI,MAAM,IAAI,GAAG;AACjC,MAAI,CAAC,QAAQ,MAAM,CACjB,QAAO,eAAe;AAIxB,MAAI,QAAQ,WAAW,KAAK,CAE1B,QAAO,wBAAwB,YADd,QAAQ,MAAM,EAAE,CAAC,MAAM,EACa,OAAO,IAAI;AAIlE,SAAO,wBAAwB,WAAW,SAAS,OAAO,IAAI;;;;;CAMhE,AAAQ,cAAc,KAA4B;EAChD,MAAM,UAAU,IAAI,MAAM,GAAG,GAAG;AAChC,MAAI,CAAC,QAAQ,MAAM,CACjB,QAAO,eAAe;AAKxB,SAAO,mBADgB,cAAc,SAAS,KAAK,QAAQ,EACjB,OAAO,IAAI;;;;;CAMvD,AAAQ,oBAAoB,KAA4B;EACtD,MAAM,UAAU,IAAI,MAAM,GAAG,GAAG;AAChC,MAAI,CAAC,QAAQ,MAAM,CACjB,QAAO,eAAe;EAKxB,MAAM,WAAW,kBAAkB,QAAQ;EAC3C,IAAI;EACJ,IAAI;AAEJ,MAAI,aAAa,IAAI;AACnB,mBAAgB,QAAQ,MAAM,GAAG,SAAS,CAAC,MAAM;AACjD,eAAY,QAAQ,MAAM,WAAW,EAAE,CAAC,MAAM;QAE9C,aAAY,QAAQ,MAAM;AAI5B,MAAI,UAAU,WAAW,IAAI,EAAE;GAC7B,MAAM,aAAa,UAAU,MAAM,EAAE;GACrC,MAAM,QAAQ,WAAW,QAAQ,IAAI;AAErC,OAAI,UAAU,GAEZ,QAAO,8BACL,YACA,QACA,eACA,OACA,IACD;GAGH,MAAM,WAAW,WAAW,MAAM,GAAG,MAAM,CAAC,MAAM;GAClD,IAAI,gBAAgB,WAAW,MAAM,QAAQ,EAAE,CAAC,MAAM;AAGtD,OACG,cAAc,WAAW,KAAI,IAAI,cAAc,SAAS,KAAI,IAC5D,cAAc,WAAW,IAAI,IAAI,cAAc,SAAS,IAAI,CAE7D,iBAAgB,cAAc,MAAM,GAAG,GAAG;AAG5C,UAAO,8BACL,UACA,eACA,eACA,OACA,IACD;;AAKH,MAAI,uBAAuB,KAAK,UAAU,CACxC,QAAO,4BAA4B,WAAW,eAAe,OAAO,IAAI;EAI1E,IAAI,oBAAoB,0BAA0B,UAAU;AAC5D,sBAAoB,iBAAiB,kBAAkB;EAEvD,MAAM,EAAE,WAAW,YAAY,eAC7B,KAAK,wBAAwB,kBAAkB;AAEjD,MAAI,CAAC,UAEH,QAAO,sBAAsB,KAAK,OAAO,IAAI;AAG/C,SAAO,kCACL,WACA,YACA,YACA,eACA,OACA,IACD;;;;;CAMH,AAAQ,qBAAqB,KAA4B;EACvD,MAAM,MAAM,KAAK,QAAQ;AACzB,MAAI,CAAC,IAEH,QAAO,sBAAsB,KAAK,OAAO,IAAI;EAG/C,MAAM,WAAW,uBAAuB,KAAK,IAAI;AACjD,MAAI,CAAC,SAEH,QAAO,wBACL,QAAQ,aAAa,IAAI,MAAM,EAAE,CAAC,IAClC,QACA,KACA,OACA,IACD;AAIH,SAAO,cAAc,UAAU,KAAK,QAAQ;;;;;CAM9C,AAAQ,mBAAmB,KAA4B;EAErD,MAAM,UAAU,IAAI,MAAM,0CAA0C;AACpE,MAAI,CAAC,QACH,QAAO,wBACL,QAAQ,aAAa,IAAI,IACzB,QACA,KACA,OACA,IACD;EAGH,MAAM,GAAG,KAAK,UAAU,SAAS;EACjC,IAAI,aAAa;AAGjB,MACG,WAAW,WAAW,KAAI,IAAI,WAAW,SAAS,KAAI,IACtD,WAAW,WAAW,IAAI,IAAI,WAAW,SAAS,IAAI,CAEvD,cAAa,WAAW,MAAM,GAAG,GAAG;AAGtC,SAAO,wBACL,QAAQ,aAAa,IAAI,IACzB,YACA,UACA,OACA,IACD;;;;;CAMH,AAAQ,qBAAqB,KAA4B;AACvD,SAAO,wBACL,QAAQ,aAAa,IAAI,IACzB,QACA,KACA,OACA,IACD;;;;;;AAWL,SAAS,kBAAkB,OAA8B;CACvD,MAAM,QAAQ,MAAM,MAAM,wCAAwC;AAClE,KAAI,MACF,QAAO,WAAW,MAAM,GAAG;AAE7B,QAAO;;;;;AAMT,SAAS,kBAAkB,WAA2B;AAEpD,KAAI,UAAU,WAAW,IAAI,CAC3B,QAAO;AAIT,KAAI,UAAU,WAAW,IAAI,CAC3B,QAAO;AAIT,KAAI,UAAU,SAAS,IAAI,EAAE;EAC3B,MAAM,CAAC,KAAK,SAAS,UAAU,MAAM,IAAI;AACzC,SAAO,SAAS,aAAa,IAAI,MAAM,CAAC,CAAC,IAAI,MAAM,MAAM,CAAC;;AAI5D,QAAO,SAAS,aAAa,UAAU,CAAC;;;;;AAU1C,SAAgB,cACd,UACA,UAAgC,EAAE,EACnB;AAEf,KAAI,CAAC,YAAY,CAAC,SAAS,MAAM,CAC/B,QAAO,eAAe;CAGxB,MAAM,UAAU,SAAS,MAAM;CAI/B,MAAM,MAAM,QAAQ;CACpB,MAAM,iBACJ,OAAO,OAAO,KAAK,IAAI,sBAAsB,CAAC,SAAS,IACnD,KAAK,UAAU,IAAI,sBAAsB,GACzC;CACN,MAAM,WAAW,KAAK,UAAU;EAC9B;EACA,QAAQ;EACR;EACD,CAAC;CAGF,MAAM,SAAS,WAAW,IAAI,SAAS;AACvC,KAAI,OACF,QAAO;CAMT,MAAM,SADS,IAAI,OADJ,SAAS,QAAQ,EACE,QAAQ,CACpB,OAAO;AAG7B,YAAW,IAAI,UAAU,OAAO;AAEhC,QAAO"}
+{"version":3,"file":"parseStateKey.js","names":[],"sources":["../../src/pipeline/parseStateKey.ts"],"sourcesContent":["/**\n * State Key Parser\n *\n * Parses state notation strings (like 'hovered & !disabled', '@media(w < 768px)')\n * into ConditionNode trees for processing in the pipeline.\n */\n\nimport { Lru } from '../parser/lru';\nimport type { StateParserContext } from '../states';\nimport {\n  expandDimensionShorthands,\n  expandTastyUnits,\n  findTopLevelComma,\n  resolvePredefinedState,\n} from '../states';\nimport { camelToKebab } from '../utils/case-converter';\n\nimport type { ConditionNode, NumericBound } from './conditions';\nimport {\n  and,\n  createContainerDimensionCondition,\n  createContainerRawCondition,\n  createContainerStyleCondition,\n  createMediaDimensionCondition,\n  createMediaFeatureCondition,\n  createMediaTypeCondition,\n  createModifierCondition,\n  createOwnCondition,\n  createParentCondition,\n  createPseudoCondition,\n  createRootCondition,\n  createStartingCondition,\n  createSupportsCondition,\n  not,\n  or,\n  trueCondition,\n} from './conditions';\n\n// ============================================================================\n// Types\n// ============================================================================\n\nexport interface ParseStateKeyOptions {\n  context?: StateParserContext;\n  isSubElement?: boolean;\n}\n\n// ============================================================================\n// Caching\n// ============================================================================\n\n// Cache for parsed state keys (key -> ConditionNode)\nconst parseCache = new Lru<string, ConditionNode>(5000);\n\n// ============================================================================\n// Tokenizer Patterns\n// ============================================================================\n\n/**\n * Pattern for tokenizing state notation.\n * Matches: operators, parentheses, @-prefixed states, value mods, boolean mods,\n * pseudo-classes, class selectors, and attribute selectors.\n *\n * Note: For @supports and @(...) container queries we need to handle nested parentheses\n * like @supports($, :has(*)) or @(scroll-state(stuck: top)).\n * We use a pattern that allows one level of nesting: [^()]*(?:\\([^)]*\\))?[^)]*\n */\nconst STATE_TOKEN_PATTERN =\n  /([&|!^])|([()])|(@media:[a-z]+)|(@media\\([^)]+\\))|(@supports\\([^()]*(?:\\([^)]*\\))?[^)]*\\))|(@root\\([^)]+\\))|(@parent\\([^)]+\\))|(@own\\([^)]+\\))|(@\\([^()]*(?:\\([^)]*\\))?[^)]*\\))|(@starting)|(@[A-Za-z][A-Za-z0-9-]*)|([a-z][a-z0-9-]*(?:\\^=|\\$=|\\*=|=)(?:\"[^\"]*\"|'[^']*'|[^\\s&|!^()]+))|([a-z][a-z0-9-]+)|(:[-a-z][a-z0-9-]*(?:\\([^)]+\\))?)|(\\.[a-z][a-z0-9-]+)|(\\[[^\\]]+\\])/gi;\n\n// ============================================================================\n// Token Types\n// ============================================================================\n\ntype TokenType = 'AND' | 'OR' | 'NOT' | 'XOR' | 'LPAREN' | 'RPAREN' | 'STATE';\n\ninterface Token {\n  type: TokenType;\n  value: string;\n  raw: string;\n}\n\n// ============================================================================\n// Tokenizer\n// ============================================================================\n\n/**\n * Tokenize a state notation string\n */\nfunction tokenize(stateKey: string): Token[] {\n  const tokens: Token[] = [];\n  let match: RegExpExecArray | null;\n\n  // Replace commas with | outside of parentheses (for compatibility)\n  const normalized = replaceCommasOutsideParens(stateKey);\n\n  STATE_TOKEN_PATTERN.lastIndex = 0;\n  while ((match = STATE_TOKEN_PATTERN.exec(normalized)) !== null) {\n    const fullMatch = match[0];\n\n    if (match[1]) {\n      // Operator: &, |, !, ^\n      switch (fullMatch) {\n        case '&':\n          tokens.push({ type: 'AND', value: '&', raw: fullMatch });\n          break;\n        case '|':\n          tokens.push({ type: 'OR', value: '|', raw: fullMatch });\n          break;\n        case '!':\n          tokens.push({ type: 'NOT', value: '!', raw: fullMatch });\n          break;\n        case '^':\n          tokens.push({ type: 'XOR', value: '^', raw: fullMatch });\n          break;\n      }\n    } else if (match[2]) {\n      // Parenthesis\n      if (fullMatch === '(') {\n        tokens.push({ type: 'LPAREN', value: '(', raw: fullMatch });\n      } else {\n        tokens.push({ type: 'RPAREN', value: ')', raw: fullMatch });\n      }\n    } else {\n      // State token (all other capture groups)\n      tokens.push({ type: 'STATE', value: fullMatch, raw: fullMatch });\n    }\n  }\n\n  return tokens;\n}\n\n/**\n * Replace commas with | only outside of parentheses\n */\nfunction replaceCommasOutsideParens(str: string): string {\n  let result = '';\n  let depth = 0;\n\n  for (const char of str) {\n    if (char === '(') {\n      depth++;\n      result += char;\n    } else if (char === ')') {\n      depth--;\n      result += char;\n    } else if (char === ',' && depth === 0) {\n      result += '|';\n    } else {\n      result += char;\n    }\n  }\n\n  return result;\n}\n\n// ============================================================================\n// Recursive Descent Parser\n// ============================================================================\n\n/**\n * Parser state\n */\nclass Parser {\n  private tokens: Token[];\n  private pos = 0;\n  private options: ParseStateKeyOptions;\n\n  constructor(tokens: Token[], options: ParseStateKeyOptions) {\n    this.tokens = tokens;\n    this.options = options;\n  }\n\n  parse(): ConditionNode {\n    if (this.tokens.length === 0) {\n      return trueCondition();\n    }\n    const result = this.parseExpression();\n    return result;\n  }\n\n  private current(): Token | undefined {\n    return this.tokens[this.pos];\n  }\n\n  private advance(): Token | undefined {\n    return this.tokens[this.pos++];\n  }\n\n  private match(type: TokenType): boolean {\n    if (this.current()?.type === type) {\n      this.advance();\n      return true;\n    }\n    return false;\n  }\n\n  /**\n   * Parse expression with operator precedence:\n   * ! (NOT) > ^ (XOR) > | (OR) > & (AND)\n   */\n  private parseExpression(): ConditionNode {\n    return this.parseAnd();\n  }\n\n  private parseAnd(): ConditionNode {\n    let left = this.parseOr();\n\n    while (this.current()?.type === 'AND') {\n      this.advance();\n      const right = this.parseOr();\n      left = and(left, right);\n    }\n\n    return left;\n  }\n\n  private parseOr(): ConditionNode {\n    let left = this.parseXor();\n\n    while (this.current()?.type === 'OR') {\n      this.advance();\n      const right = this.parseXor();\n      left = or(left, right);\n    }\n\n    return left;\n  }\n\n  private parseXor(): ConditionNode {\n    let left = this.parseUnary();\n\n    while (this.current()?.type === 'XOR') {\n      this.advance();\n      const right = this.parseUnary();\n      // XOR: (A & !B) | (!A & B)\n      left = or(and(left, not(right)), and(not(left), right));\n    }\n\n    return left;\n  }\n\n  private parseUnary(): ConditionNode {\n    if (this.match('NOT')) {\n      const operand = this.parseUnary();\n      return not(operand);\n    }\n    return this.parsePrimary();\n  }\n\n  private parsePrimary(): ConditionNode {\n    // Handle parentheses\n    if (this.match('LPAREN')) {\n      const expr = this.parseExpression();\n      this.match('RPAREN'); // Consume closing paren (lenient if missing)\n      return expr;\n    }\n\n    // Handle state tokens\n    const token = this.current();\n    if (token?.type === 'STATE') {\n      this.advance();\n      return this.parseStateToken(token.value);\n    }\n\n    // Fallback for empty/invalid - return TRUE\n    return trueCondition();\n  }\n\n  /**\n   * Parse a state token into a ConditionNode\n   */\n  private parseStateToken(value: string): ConditionNode {\n    // @starting\n    if (value === '@starting') {\n      return createStartingCondition(false, value);\n    }\n\n    // @media:type (e.g., @media:print)\n    if (value.startsWith('@media:')) {\n      const mediaType = value.slice(7) as 'print' | 'screen' | 'all' | 'speech';\n      return createMediaTypeCondition(mediaType, false, value);\n    }\n\n    // @media(...) - media query\n    if (value.startsWith('@media(')) {\n      return this.parseMediaQuery(value);\n    }\n\n    // @supports(...) - feature/selector support query\n    if (value.startsWith('@supports(')) {\n      return this.parseSupportsQuery(value);\n    }\n\n    // @root(...) - root state\n    if (value.startsWith('@root(')) {\n      return this.parseRootState(value);\n    }\n\n    // @parent(...) - parent element state\n    if (value.startsWith('@parent(')) {\n      return this.parseParentState(value);\n    }\n\n    // @own(...) - own state (sub-element)\n    if (value.startsWith('@own(')) {\n      return this.parseOwnState(value);\n    }\n\n    // @(...) - container query\n    if (value.startsWith('@(')) {\n      return this.parseContainerQuery(value);\n    }\n\n    // @name - predefined state\n    if (value.startsWith('@') && /^@[A-Za-z][A-Za-z0-9-]*$/.test(value)) {\n      return this.parsePredefinedState(value);\n    }\n\n    // Pseudo-class (e.g., :hover, :focus-visible, :nth-child(2n))\n    if (value.startsWith(':')) {\n      return createPseudoCondition(value, false, value);\n    }\n\n    // Class selector (e.g., .active)\n    if (value.startsWith('.')) {\n      return createPseudoCondition(value, false, value);\n    }\n\n    // Attribute selector (e.g., [disabled], [data-state=\"active\"])\n    if (value.startsWith('[')) {\n      return createPseudoCondition(value, false, value);\n    }\n\n    // Value modifier (e.g., theme=danger, size=large)\n    if (value.includes('=')) {\n      return this.parseValueModifier(value);\n    }\n\n    // Boolean modifier (e.g., hovered, disabled)\n    return this.parseBooleanModifier(value);\n  }\n\n  /**\n   * Parse @media(...) query\n   */\n  private parseMediaQuery(raw: string): ConditionNode {\n    const content = raw.slice(7, -1); // Remove '@media(' and ')'\n    if (!content.trim()) {\n      return trueCondition();\n    }\n\n    // Expand shorthands and units\n    let condition = expandDimensionShorthands(content);\n    condition = expandTastyUnits(condition);\n\n    // Check for feature queries (contains ':' but not dimension comparison)\n    if (\n      condition.includes(':') &&\n      !condition.includes('<') &&\n      !condition.includes('>') &&\n      !condition.includes('=')\n    ) {\n      // Feature query: @media(prefers-contrast: high)\n      const colonIdx = condition.indexOf(':');\n      const feature = condition.slice(0, colonIdx).trim();\n      const featureValue = condition.slice(colonIdx + 1).trim();\n      return createMediaFeatureCondition(feature, featureValue, false, raw);\n    }\n\n    // Boolean feature query: @media(prefers-reduced-motion)\n    if (\n      !condition.includes('<') &&\n      !condition.includes('>') &&\n      !condition.includes('=')\n    ) {\n      return createMediaFeatureCondition(\n        condition.trim(),\n        undefined,\n        false,\n        raw,\n      );\n    }\n\n    // Dimension query - parse bounds\n    const { dimension, lowerBound, upperBound } =\n      this.parseDimensionCondition(condition);\n\n    if (!dimension) {\n      // Fallback for unparseable - treat as pseudo\n      return createPseudoCondition(raw, false, raw);\n    }\n\n    return createMediaDimensionCondition(\n      dimension as 'width' | 'height',\n      lowerBound,\n      upperBound,\n      false,\n      raw,\n    );\n  }\n\n  /**\n   * Parse dimension condition string (e.g., \"width < 768px\", \"600px <= width < 1200px\")\n   */\n  private parseDimensionCondition(condition: string): {\n    dimension?: string;\n    lowerBound?: NumericBound;\n    upperBound?: NumericBound;\n  } {\n    // Range syntax: \"600px <= width < 1200px\"\n    const rangeMatch = condition.match(\n      /^(.+?)\\s*(<=|<)\\s*(width|height|inline-size|block-size)\\s*(<=|<)\\s*(.+)$/,\n    );\n    if (rangeMatch) {\n      const [, lowerValue, lowerOp, dimension, upperOp, upperValue] =\n        rangeMatch;\n      return {\n        dimension,\n        lowerBound: {\n          value: lowerValue.trim(),\n          valueNumeric: parseNumericValue(lowerValue.trim()),\n          inclusive: lowerOp === '<=',\n        },\n        upperBound: {\n          value: upperValue.trim(),\n          valueNumeric: parseNumericValue(upperValue.trim()),\n          inclusive: upperOp === '<=',\n        },\n      };\n    }\n\n    // Simple comparison: \"width < 768px\"\n    const simpleMatch = condition.match(\n      /^(width|height|inline-size|block-size)\\s*(<=|>=|<|>|=)\\s*(.+)$/,\n    );\n    if (simpleMatch) {\n      const [, dimension, operator, value] = simpleMatch;\n      const numeric = parseNumericValue(value.trim());\n\n      if (operator === '<' || operator === '<=') {\n        return {\n          dimension,\n          upperBound: {\n            value: value.trim(),\n            valueNumeric: numeric,\n            inclusive: operator === '<=',\n          },\n        };\n      } else if (operator === '>' || operator === '>=') {\n        return {\n          dimension,\n          lowerBound: {\n            value: value.trim(),\n            valueNumeric: numeric,\n            inclusive: operator === '>=',\n          },\n        };\n      } else if (operator === '=') {\n        // Exact match: both bounds are the same and inclusive\n        return {\n          dimension,\n          lowerBound: {\n            value: value.trim(),\n            valueNumeric: numeric,\n            inclusive: true,\n          },\n          upperBound: {\n            value: value.trim(),\n            valueNumeric: numeric,\n            inclusive: true,\n          },\n        };\n      }\n    }\n\n    // Reversed: \"768px > width\"\n    const reversedMatch = condition.match(\n      /^(.+?)\\s*(<=|>=|<|>|=)\\s*(width|height|inline-size|block-size)$/,\n    );\n    if (reversedMatch) {\n      const [, value, operator, dimension] = reversedMatch;\n      const numeric = parseNumericValue(value.trim());\n\n      // Reverse the operator\n      if (operator === '<' || operator === '<=') {\n        return {\n          dimension,\n          lowerBound: {\n            value: value.trim(),\n            valueNumeric: numeric,\n            inclusive: operator === '<=',\n          },\n        };\n      } else if (operator === '>' || operator === '>=') {\n        return {\n          dimension,\n          upperBound: {\n            value: value.trim(),\n            valueNumeric: numeric,\n            inclusive: operator === '>=',\n          },\n        };\n      }\n    }\n\n    return {};\n  }\n\n  /**\n   * Parse @root(...) state\n   */\n  private parseRootState(raw: string): ConditionNode {\n    const content = raw.slice(6, -1); // Remove '@root(' and ')'\n    if (!content.trim()) {\n      return trueCondition();\n    }\n\n    // Build selector from condition\n    const selector = buildRootSelector(content);\n    return createRootCondition(selector, false, raw);\n  }\n\n  /**\n   * Parse @parent(...) state\n   *\n   * Syntax:\n   *   @parent(hovered)      → :is([data-hovered] *)\n   *   @parent(theme=dark)   → :is([data-theme=\"dark\"] *)\n   *   @parent(hovered >)    → :is([data-hovered] > *)  (direct parent)\n   *   @parent(.my-class)    → :is(.my-class *)\n   */\n  private parseParentState(raw: string): ConditionNode {\n    const content = raw.slice(8, -1); // Remove '@parent(' and ')'\n    if (!content.trim()) {\n      return trueCondition();\n    }\n\n    let condition = content.trim();\n    let direct = false;\n\n    // Detect trailing > for direct parent mode\n    if (condition.endsWith('>')) {\n      direct = true;\n      condition = condition.slice(0, -1).trim();\n    }\n\n    const selector = buildRootSelector(condition);\n    return createParentCondition(selector, direct, false, raw);\n  }\n\n  /**\n   * Parse @supports(...) query\n   *\n   * Syntax:\n   *   @supports(display: grid)     → @supports (display: grid)\n   *   @supports($, :has(*))        → @supports selector(:has(*))\n   */\n  private parseSupportsQuery(raw: string): ConditionNode {\n    const content = raw.slice(10, -1); // Remove '@supports(' and ')'\n    if (!content.trim()) {\n      return trueCondition();\n    }\n\n    // Check for selector syntax: @supports($, :has(*))\n    if (content.startsWith('$,')) {\n      const selector = content.slice(2).trim(); // Remove '$,' prefix\n      return createSupportsCondition('selector', selector, false, raw);\n    }\n\n    // Feature syntax: @supports(display: grid)\n    return createSupportsCondition('feature', content, false, raw);\n  }\n\n  /**\n   * Parse @own(...) state\n   */\n  private parseOwnState(raw: string): ConditionNode {\n    const content = raw.slice(5, -1); // Remove '@own(' and ')'\n    if (!content.trim()) {\n      return trueCondition();\n    }\n\n    // Parse the inner condition recursively\n    const innerCondition = parseStateKey(content, this.options);\n    return createOwnCondition(innerCondition, false, raw);\n  }\n\n  /**\n   * Parse @(...) container query\n   */\n  private parseContainerQuery(raw: string): ConditionNode {\n    const content = raw.slice(2, -1); // Remove '@(' and ')'\n    if (!content.trim()) {\n      return trueCondition();\n    }\n\n    // Check for named container: @(layout, w < 600px)\n    // Use parentheses-aware comma search so inner commas (e.g., scroll-state(a, b)) are skipped\n    const commaIdx = findTopLevelComma(content);\n    let containerName: string | undefined;\n    let condition: string;\n\n    if (commaIdx !== -1) {\n      containerName = content.slice(0, commaIdx).trim();\n      condition = content.slice(commaIdx + 1).trim();\n    } else {\n      condition = content.trim();\n    }\n\n    // Check for style query shorthand: @($variant=primary)\n    if (condition.startsWith('$')) {\n      const styleQuery = condition.slice(1); // Remove '$'\n      const eqIdx = styleQuery.indexOf('=');\n\n      if (eqIdx === -1) {\n        // Existence check: @($variant)\n        return createContainerStyleCondition(\n          styleQuery,\n          undefined,\n          containerName,\n          false,\n          raw,\n        );\n      }\n\n      const property = styleQuery.slice(0, eqIdx).trim();\n      let propertyValue = styleQuery.slice(eqIdx + 1).trim();\n\n      // Remove quotes if present\n      if (\n        (propertyValue.startsWith('\"') && propertyValue.endsWith('\"')) ||\n        (propertyValue.startsWith(\"'\") && propertyValue.endsWith(\"'\"))\n      ) {\n        propertyValue = propertyValue.slice(1, -1);\n      }\n\n      return createContainerStyleCondition(\n        property,\n        propertyValue,\n        containerName,\n        false,\n        raw,\n      );\n    }\n\n    // Check for function-like syntax: scroll-state(...), style(...), etc.\n    // Passes the condition through to CSS verbatim.\n    if (/^[a-zA-Z][\\w-]*\\s*\\(/.test(condition)) {\n      return createContainerRawCondition(condition, containerName, false, raw);\n    }\n\n    // Dimension query\n    let expandedCondition = expandDimensionShorthands(condition);\n    expandedCondition = expandTastyUnits(expandedCondition);\n\n    const { dimension, lowerBound, upperBound } =\n      this.parseDimensionCondition(expandedCondition);\n\n    if (!dimension) {\n      // Fallback\n      return createPseudoCondition(raw, false, raw);\n    }\n\n    return createContainerDimensionCondition(\n      dimension as 'width' | 'height',\n      lowerBound,\n      upperBound,\n      containerName,\n      false,\n      raw,\n    );\n  }\n\n  /**\n   * Parse predefined state (@mobile, @dark, etc.)\n   */\n  private parsePredefinedState(raw: string): ConditionNode {\n    const ctx = this.options.context;\n    if (!ctx) {\n      // No context - can't resolve predefined states\n      return createPseudoCondition(raw, false, raw);\n    }\n\n    const resolved = resolvePredefinedState(raw, ctx);\n    if (!resolved) {\n      // Undefined predefined state - treat as modifier\n      return createModifierCondition(\n        `data-${camelToKebab(raw.slice(1))}`,\n        undefined,\n        '=',\n        false,\n        raw,\n      );\n    }\n\n    // Parse the resolved value recursively\n    return parseStateKey(resolved, this.options);\n  }\n\n  /**\n   * Parse value modifier (e.g., theme=danger, size^=sm)\n   */\n  private parseValueModifier(raw: string): ConditionNode {\n    // Match operators: =, ^=, $=, *=\n    const opMatch = raw.match(/^([a-z][a-z0-9-]*)(\\^=|\\$=|\\*=|=)(.+)$/i);\n    if (!opMatch) {\n      return createModifierCondition(\n        `data-${camelToKebab(raw)}`,\n        undefined,\n        '=',\n        false,\n        raw,\n      );\n    }\n\n    const [, key, operator, value] = opMatch;\n    let cleanValue = value;\n\n    // Remove quotes if present\n    if (\n      (cleanValue.startsWith('\"') && cleanValue.endsWith('\"')) ||\n      (cleanValue.startsWith(\"'\") && cleanValue.endsWith(\"'\"))\n    ) {\n      cleanValue = cleanValue.slice(1, -1);\n    }\n\n    return createModifierCondition(\n      `data-${camelToKebab(key)}`,\n      cleanValue,\n      operator as '=' | '^=' | '$=' | '*=',\n      false,\n      raw,\n    );\n  }\n\n  /**\n   * Parse boolean modifier (e.g., hovered, disabled)\n   */\n  private parseBooleanModifier(raw: string): ConditionNode {\n    return createModifierCondition(\n      `data-${camelToKebab(raw)}`,\n      undefined,\n      '=',\n      false,\n      raw,\n    );\n  }\n}\n\n// ============================================================================\n// Helper Functions\n// ============================================================================\n\n/**\n * Parse a numeric value from a CSS value string\n */\nfunction parseNumericValue(value: string): number | null {\n  const match = value.match(/^(\\d+(?:\\.\\d+)?)(px|em|rem|vh|vw|%)?$/);\n  if (match) {\n    return parseFloat(match[1]);\n  }\n  return null;\n}\n\n/**\n * Build a root state selector from a condition string\n */\nfunction buildRootSelector(condition: string): string {\n  // Handle class selector: .className\n  if (condition.startsWith('.')) {\n    return condition;\n  }\n\n  // Handle attribute selector: [attr]\n  if (condition.startsWith('[')) {\n    return condition;\n  }\n\n  // Handle value mod: theme=dark\n  if (condition.includes('=')) {\n    const [key, value] = condition.split('=');\n    return `[data-${camelToKebab(key.trim())}=\"${value.trim()}\"]`;\n  }\n\n  // Boolean mod: camelCase -> [data-camel-case]\n  return `[data-${camelToKebab(condition)}]`;\n}\n\n// ============================================================================\n// Main Export\n// ============================================================================\n\n/**\n * Parse a state key string into a ConditionNode\n */\nexport function parseStateKey(\n  stateKey: string,\n  options: ParseStateKeyOptions = {},\n): ConditionNode {\n  // Handle empty/default state\n  if (!stateKey || !stateKey.trim()) {\n    return trueCondition();\n  }\n\n  const trimmed = stateKey.trim();\n\n  // Build cache key including local predefined states (they affect parsing)\n  // Global predefined states are set once at initialization and don't change\n  const ctx = options.context;\n  const localStatesKey =\n    ctx && Object.keys(ctx.localPredefinedStates).length > 0\n      ? JSON.stringify(ctx.localPredefinedStates)\n      : '';\n  const cacheKey = JSON.stringify([\n    trimmed,\n    options.isSubElement,\n    localStatesKey,\n  ]);\n\n  // Check cache\n  const cached = parseCache.get(cacheKey);\n  if (cached) {\n    return cached;\n  }\n\n  // Tokenize and parse\n  const tokens = tokenize(trimmed);\n  const parser = new Parser(tokens, options);\n  const result = parser.parse();\n\n  // Cache result\n  parseCache.set(cacheKey, result);\n\n  return result;\n}\n\n/**\n * Clear the parse cache (for testing)\n */\nexport function clearParseCache(): void {\n  parseCache.clear();\n}\n"],"mappings":";;;;;;;;;;;;AAoDA,MAAM,aAAa,IAAI,IAA2B,IAAK;;;;;;;;;;AAevD,MAAM,sBACJ;;;;AAqBF,SAAS,SAAS,UAA2B;CAC3C,MAAM,SAAkB,EAAE;CAC1B,IAAI;CAGJ,MAAM,aAAa,2BAA2B,SAAS;AAEvD,qBAAoB,YAAY;AAChC,SAAQ,QAAQ,oBAAoB,KAAK,WAAW,MAAM,MAAM;EAC9D,MAAM,YAAY,MAAM;AAExB,MAAI,MAAM,GAER,SAAQ,WAAR;GACE,KAAK;AACH,WAAO,KAAK;KAAE,MAAM;KAAO,OAAO;KAAK,KAAK;KAAW,CAAC;AACxD;GACF,KAAK;AACH,WAAO,KAAK;KAAE,MAAM;KAAM,OAAO;KAAK,KAAK;KAAW,CAAC;AACvD;GACF,KAAK;AACH,WAAO,KAAK;KAAE,MAAM;KAAO,OAAO;KAAK,KAAK;KAAW,CAAC;AACxD;GACF,KAAK;AACH,WAAO,KAAK;KAAE,MAAM;KAAO,OAAO;KAAK,KAAK;KAAW,CAAC;AACxD;;WAEK,MAAM,GAEf,KAAI,cAAc,IAChB,QAAO,KAAK;GAAE,MAAM;GAAU,OAAO;GAAK,KAAK;GAAW,CAAC;MAE3D,QAAO,KAAK;GAAE,MAAM;GAAU,OAAO;GAAK,KAAK;GAAW,CAAC;MAI7D,QAAO,KAAK;GAAE,MAAM;GAAS,OAAO;GAAW,KAAK;GAAW,CAAC;;AAIpE,QAAO;;;;;AAMT,SAAS,2BAA2B,KAAqB;CACvD,IAAI,SAAS;CACb,IAAI,QAAQ;AAEZ,MAAK,MAAM,QAAQ,IACjB,KAAI,SAAS,KAAK;AAChB;AACA,YAAU;YACD,SAAS,KAAK;AACvB;AACA,YAAU;YACD,SAAS,OAAO,UAAU,EACnC,WAAU;KAEV,WAAU;AAId,QAAO;;;;;AAUT,IAAM,SAAN,MAAa;CACX,AAAQ;CACR,AAAQ,MAAM;CACd,AAAQ;CAER,YAAY,QAAiB,SAA+B;AAC1D,OAAK,SAAS;AACd,OAAK,UAAU;;CAGjB,QAAuB;AACrB,MAAI,KAAK,OAAO,WAAW,EACzB,QAAO,eAAe;AAGxB,SADe,KAAK,iBAAiB;;CAIvC,AAAQ,UAA6B;AACnC,SAAO,KAAK,OAAO,KAAK;;CAG1B,AAAQ,UAA6B;AACnC,SAAO,KAAK,OAAO,KAAK;;CAG1B,AAAQ,MAAM,MAA0B;AACtC,MAAI,KAAK,SAAS,EAAE,SAAS,MAAM;AACjC,QAAK,SAAS;AACd,UAAO;;AAET,SAAO;;;;;;CAOT,AAAQ,kBAAiC;AACvC,SAAO,KAAK,UAAU;;CAGxB,AAAQ,WAA0B;EAChC,IAAI,OAAO,KAAK,SAAS;AAEzB,SAAO,KAAK,SAAS,EAAE,SAAS,OAAO;AACrC,QAAK,SAAS;GACd,MAAM,QAAQ,KAAK,SAAS;AAC5B,UAAO,IAAI,MAAM,MAAM;;AAGzB,SAAO;;CAGT,AAAQ,UAAyB;EAC/B,IAAI,OAAO,KAAK,UAAU;AAE1B,SAAO,KAAK,SAAS,EAAE,SAAS,MAAM;AACpC,QAAK,SAAS;GACd,MAAM,QAAQ,KAAK,UAAU;AAC7B,UAAO,GAAG,MAAM,MAAM;;AAGxB,SAAO;;CAGT,AAAQ,WAA0B;EAChC,IAAI,OAAO,KAAK,YAAY;AAE5B,SAAO,KAAK,SAAS,EAAE,SAAS,OAAO;AACrC,QAAK,SAAS;GACd,MAAM,QAAQ,KAAK,YAAY;AAE/B,UAAO,GAAG,IAAI,MAAM,IAAI,MAAM,CAAC,EAAE,IAAI,IAAI,KAAK,EAAE,MAAM,CAAC;;AAGzD,SAAO;;CAGT,AAAQ,aAA4B;AAClC,MAAI,KAAK,MAAM,MAAM,CAEnB,QAAO,IADS,KAAK,YAAY,CACd;AAErB,SAAO,KAAK,cAAc;;CAG5B,AAAQ,eAA8B;AAEpC,MAAI,KAAK,MAAM,SAAS,EAAE;GACxB,MAAM,OAAO,KAAK,iBAAiB;AACnC,QAAK,MAAM,SAAS;AACpB,UAAO;;EAIT,MAAM,QAAQ,KAAK,SAAS;AAC5B,MAAI,OAAO,SAAS,SAAS;AAC3B,QAAK,SAAS;AACd,UAAO,KAAK,gBAAgB,MAAM,MAAM;;AAI1C,SAAO,eAAe;;;;;CAMxB,AAAQ,gBAAgB,OAA8B;AAEpD,MAAI,UAAU,YACZ,QAAO,wBAAwB,OAAO,MAAM;AAI9C,MAAI,MAAM,WAAW,UAAU,CAE7B,QAAO,yBADW,MAAM,MAAM,EAAE,EACW,OAAO,MAAM;AAI1D,MAAI,MAAM,WAAW,UAAU,CAC7B,QAAO,KAAK,gBAAgB,MAAM;AAIpC,MAAI,MAAM,WAAW,aAAa,CAChC,QAAO,KAAK,mBAAmB,MAAM;AAIvC,MAAI,MAAM,WAAW,SAAS,CAC5B,QAAO,KAAK,eAAe,MAAM;AAInC,MAAI,MAAM,WAAW,WAAW,CAC9B,QAAO,KAAK,iBAAiB,MAAM;AAIrC,MAAI,MAAM,WAAW,QAAQ,CAC3B,QAAO,KAAK,cAAc,MAAM;AAIlC,MAAI,MAAM,WAAW,KAAK,CACxB,QAAO,KAAK,oBAAoB,MAAM;AAIxC,MAAI,MAAM,WAAW,IAAI,IAAI,2BAA2B,KAAK,MAAM,CACjE,QAAO,KAAK,qBAAqB,MAAM;AAIzC,MAAI,MAAM,WAAW,IAAI,CACvB,QAAO,sBAAsB,OAAO,OAAO,MAAM;AAInD,MAAI,MAAM,WAAW,IAAI,CACvB,QAAO,sBAAsB,OAAO,OAAO,MAAM;AAInD,MAAI,MAAM,WAAW,IAAI,CACvB,QAAO,sBAAsB,OAAO,OAAO,MAAM;AAInD,MAAI,MAAM,SAAS,IAAI,CACrB,QAAO,KAAK,mBAAmB,MAAM;AAIvC,SAAO,KAAK,qBAAqB,MAAM;;;;;CAMzC,AAAQ,gBAAgB,KAA4B;EAClD,MAAM,UAAU,IAAI,MAAM,GAAG,GAAG;AAChC,MAAI,CAAC,QAAQ,MAAM,CACjB,QAAO,eAAe;EAIxB,IAAI,YAAY,0BAA0B,QAAQ;AAClD,cAAY,iBAAiB,UAAU;AAGvC,MACE,UAAU,SAAS,IAAI,IACvB,CAAC,UAAU,SAAS,IAAI,IACxB,CAAC,UAAU,SAAS,IAAI,IACxB,CAAC,UAAU,SAAS,IAAI,EACxB;GAEA,MAAM,WAAW,UAAU,QAAQ,IAAI;AAGvC,UAAO,4BAFS,UAAU,MAAM,GAAG,SAAS,CAAC,MAAM,EAC9B,UAAU,MAAM,WAAW,EAAE,CAAC,MAAM,EACC,OAAO,IAAI;;AAIvE,MACE,CAAC,UAAU,SAAS,IAAI,IACxB,CAAC,UAAU,SAAS,IAAI,IACxB,CAAC,UAAU,SAAS,IAAI,CAExB,QAAO,4BACL,UAAU,MAAM,EAChB,QACA,OACA,IACD;EAIH,MAAM,EAAE,WAAW,YAAY,eAC7B,KAAK,wBAAwB,UAAU;AAEzC,MAAI,CAAC,UAEH,QAAO,sBAAsB,KAAK,OAAO,IAAI;AAG/C,SAAO,8BACL,WACA,YACA,YACA,OACA,IACD;;;;;CAMH,AAAQ,wBAAwB,WAI9B;EAEA,MAAM,aAAa,UAAU,MAC3B,2EACD;AACD,MAAI,YAAY;GACd,MAAM,GAAG,YAAY,SAAS,WAAW,SAAS,cAChD;AACF,UAAO;IACL;IACA,YAAY;KACV,OAAO,WAAW,MAAM;KACxB,cAAc,kBAAkB,WAAW,MAAM,CAAC;KAClD,WAAW,YAAY;KACxB;IACD,YAAY;KACV,OAAO,WAAW,MAAM;KACxB,cAAc,kBAAkB,WAAW,MAAM,CAAC;KAClD,WAAW,YAAY;KACxB;IACF;;EAIH,MAAM,cAAc,UAAU,MAC5B,iEACD;AACD,MAAI,aAAa;GACf,MAAM,GAAG,WAAW,UAAU,SAAS;GACvC,MAAM,UAAU,kBAAkB,MAAM,MAAM,CAAC;AAE/C,OAAI,aAAa,OAAO,aAAa,KACnC,QAAO;IACL;IACA,YAAY;KACV,OAAO,MAAM,MAAM;KACnB,cAAc;KACd,WAAW,aAAa;KACzB;IACF;YACQ,aAAa,OAAO,aAAa,KAC1C,QAAO;IACL;IACA,YAAY;KACV,OAAO,MAAM,MAAM;KACnB,cAAc;KACd,WAAW,aAAa;KACzB;IACF;YACQ,aAAa,IAEtB,QAAO;IACL;IACA,YAAY;KACV,OAAO,MAAM,MAAM;KACnB,cAAc;KACd,WAAW;KACZ;IACD,YAAY;KACV,OAAO,MAAM,MAAM;KACnB,cAAc;KACd,WAAW;KACZ;IACF;;EAKL,MAAM,gBAAgB,UAAU,MAC9B,kEACD;AACD,MAAI,eAAe;GACjB,MAAM,GAAG,OAAO,UAAU,aAAa;GACvC,MAAM,UAAU,kBAAkB,MAAM,MAAM,CAAC;AAG/C,OAAI,aAAa,OAAO,aAAa,KACnC,QAAO;IACL;IACA,YAAY;KACV,OAAO,MAAM,MAAM;KACnB,cAAc;KACd,WAAW,aAAa;KACzB;IACF;YACQ,aAAa,OAAO,aAAa,KAC1C,QAAO;IACL;IACA,YAAY;KACV,OAAO,MAAM,MAAM;KACnB,cAAc;KACd,WAAW,aAAa;KACzB;IACF;;AAIL,SAAO,EAAE;;;;;CAMX,AAAQ,eAAe,KAA4B;EACjD,MAAM,UAAU,IAAI,MAAM,GAAG,GAAG;AAChC,MAAI,CAAC,QAAQ,MAAM,CACjB,QAAO,eAAe;AAKxB,SAAO,oBADU,kBAAkB,QAAQ,EACN,OAAO,IAAI;;;;;;;;;;;CAYlD,AAAQ,iBAAiB,KAA4B;EACnD,MAAM,UAAU,IAAI,MAAM,GAAG,GAAG;AAChC,MAAI,CAAC,QAAQ,MAAM,CACjB,QAAO,eAAe;EAGxB,IAAI,YAAY,QAAQ,MAAM;EAC9B,IAAI,SAAS;AAGb,MAAI,UAAU,SAAS,IAAI,EAAE;AAC3B,YAAS;AACT,eAAY,UAAU,MAAM,GAAG,GAAG,CAAC,MAAM;;AAI3C,SAAO,sBADU,kBAAkB,UAAU,EACN,QAAQ,OAAO,IAAI;;;;;;;;;CAU5D,AAAQ,mBAAmB,KAA4B;EACrD,MAAM,UAAU,IAAI,MAAM,IAAI,GAAG;AACjC,MAAI,CAAC,QAAQ,MAAM,CACjB,QAAO,eAAe;AAIxB,MAAI,QAAQ,WAAW,KAAK,CAE1B,QAAO,wBAAwB,YADd,QAAQ,MAAM,EAAE,CAAC,MAAM,EACa,OAAO,IAAI;AAIlE,SAAO,wBAAwB,WAAW,SAAS,OAAO,IAAI;;;;;CAMhE,AAAQ,cAAc,KAA4B;EAChD,MAAM,UAAU,IAAI,MAAM,GAAG,GAAG;AAChC,MAAI,CAAC,QAAQ,MAAM,CACjB,QAAO,eAAe;AAKxB,SAAO,mBADgB,cAAc,SAAS,KAAK,QAAQ,EACjB,OAAO,IAAI;;;;;CAMvD,AAAQ,oBAAoB,KAA4B;EACtD,MAAM,UAAU,IAAI,MAAM,GAAG,GAAG;AAChC,MAAI,CAAC,QAAQ,MAAM,CACjB,QAAO,eAAe;EAKxB,MAAM,WAAW,kBAAkB,QAAQ;EAC3C,IAAI;EACJ,IAAI;AAEJ,MAAI,aAAa,IAAI;AACnB,mBAAgB,QAAQ,MAAM,GAAG,SAAS,CAAC,MAAM;AACjD,eAAY,QAAQ,MAAM,WAAW,EAAE,CAAC,MAAM;QAE9C,aAAY,QAAQ,MAAM;AAI5B,MAAI,UAAU,WAAW,IAAI,EAAE;GAC7B,MAAM,aAAa,UAAU,MAAM,EAAE;GACrC,MAAM,QAAQ,WAAW,QAAQ,IAAI;AAErC,OAAI,UAAU,GAEZ,QAAO,8BACL,YACA,QACA,eACA,OACA,IACD;GAGH,MAAM,WAAW,WAAW,MAAM,GAAG,MAAM,CAAC,MAAM;GAClD,IAAI,gBAAgB,WAAW,MAAM,QAAQ,EAAE,CAAC,MAAM;AAGtD,OACG,cAAc,WAAW,KAAI,IAAI,cAAc,SAAS,KAAI,IAC5D,cAAc,WAAW,IAAI,IAAI,cAAc,SAAS,IAAI,CAE7D,iBAAgB,cAAc,MAAM,GAAG,GAAG;AAG5C,UAAO,8BACL,UACA,eACA,eACA,OACA,IACD;;AAKH,MAAI,uBAAuB,KAAK,UAAU,CACxC,QAAO,4BAA4B,WAAW,eAAe,OAAO,IAAI;EAI1E,IAAI,oBAAoB,0BAA0B,UAAU;AAC5D,sBAAoB,iBAAiB,kBAAkB;EAEvD,MAAM,EAAE,WAAW,YAAY,eAC7B,KAAK,wBAAwB,kBAAkB;AAEjD,MAAI,CAAC,UAEH,QAAO,sBAAsB,KAAK,OAAO,IAAI;AAG/C,SAAO,kCACL,WACA,YACA,YACA,eACA,OACA,IACD;;;;;CAMH,AAAQ,qBAAqB,KAA4B;EACvD,MAAM,MAAM,KAAK,QAAQ;AACzB,MAAI,CAAC,IAEH,QAAO,sBAAsB,KAAK,OAAO,IAAI;EAG/C,MAAM,WAAW,uBAAuB,KAAK,IAAI;AACjD,MAAI,CAAC,SAEH,QAAO,wBACL,QAAQ,aAAa,IAAI,MAAM,EAAE,CAAC,IAClC,QACA,KACA,OACA,IACD;AAIH,SAAO,cAAc,UAAU,KAAK,QAAQ;;;;;CAM9C,AAAQ,mBAAmB,KAA4B;EAErD,MAAM,UAAU,IAAI,MAAM,0CAA0C;AACpE,MAAI,CAAC,QACH,QAAO,wBACL,QAAQ,aAAa,IAAI,IACzB,QACA,KACA,OACA,IACD;EAGH,MAAM,GAAG,KAAK,UAAU,SAAS;EACjC,IAAI,aAAa;AAGjB,MACG,WAAW,WAAW,KAAI,IAAI,WAAW,SAAS,KAAI,IACtD,WAAW,WAAW,IAAI,IAAI,WAAW,SAAS,IAAI,CAEvD,cAAa,WAAW,MAAM,GAAG,GAAG;AAGtC,SAAO,wBACL,QAAQ,aAAa,IAAI,IACzB,YACA,UACA,OACA,IACD;;;;;CAMH,AAAQ,qBAAqB,KAA4B;AACvD,SAAO,wBACL,QAAQ,aAAa,IAAI,IACzB,QACA,KACA,OACA,IACD;;;;;;AAWL,SAAS,kBAAkB,OAA8B;CACvD,MAAM,QAAQ,MAAM,MAAM,wCAAwC;AAClE,KAAI,MACF,QAAO,WAAW,MAAM,GAAG;AAE7B,QAAO;;;;;AAMT,SAAS,kBAAkB,WAA2B;AAEpD,KAAI,UAAU,WAAW,IAAI,CAC3B,QAAO;AAIT,KAAI,UAAU,WAAW,IAAI,CAC3B,QAAO;AAIT,KAAI,UAAU,SAAS,IAAI,EAAE;EAC3B,MAAM,CAAC,KAAK,SAAS,UAAU,MAAM,IAAI;AACzC,SAAO,SAAS,aAAa,IAAI,MAAM,CAAC,CAAC,IAAI,MAAM,MAAM,CAAC;;AAI5D,QAAO,SAAS,aAAa,UAAU,CAAC;;;;;AAU1C,SAAgB,cACd,UACA,UAAgC,EAAE,EACnB;AAEf,KAAI,CAAC,YAAY,CAAC,SAAS,MAAM,CAC/B,QAAO,eAAe;CAGxB,MAAM,UAAU,SAAS,MAAM;CAI/B,MAAM,MAAM,QAAQ;CACpB,MAAM,iBACJ,OAAO,OAAO,KAAK,IAAI,sBAAsB,CAAC,SAAS,IACnD,KAAK,UAAU,IAAI,sBAAsB,GACzC;CACN,MAAM,WAAW,KAAK,UAAU;EAC9B;EACA,QAAQ;EACR;EACD,CAAC;CAGF,MAAM,SAAS,WAAW,IAAI,SAAS;AACvC,KAAI,OACF,QAAO;CAMT,MAAM,SADS,IAAI,OADJ,SAAS,QAAQ,EACE,QAAQ,CACpB,OAAO;AAG7B,YAAW,IAAI,UAAU,OAAO;AAEhC,QAAO"}

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

package/dist/states/index.d.ts

@@ -5,7 +5,7 @@ import "../styles/types.js";
  * Parsed advanced state information
  */
 interface ParsedAdvancedState {
-  type: 'media' | 'container' | 'root' | 'own' | 'starting' | 'predefined' | 'modifier';
+  type: 'media' | 'container' | 'root' | 'parent' | 'own' | 'starting' | 'predefined' | 'modifier';
   condition: string;
   containerName?: string;
   raw: string;

package/dist/states/index.js

@@ -18,6 +18,7 @@ const BUILTIN_STATES = new Set([
 const RESERVED_PREFIXES = [
 	"@media",
 	"@root",
+	"@parent",
 	"@own",
 	"@(",
 	"@starting",
@@ -56,7 +57,7 @@ function setGlobalPredefinedStates(states) {
 			warnOnce(`reserved-state:${name}`, `[Tasty] Cannot define predefined state '${name}'. This name is reserved for built-in functionality.`);
 			continue;
 		}
-		if (name === "@media" || name === "@root" || name === "@own" || name.startsWith("@(")) {
+		if (name === "@media" || name === "@root" || name === "@parent" || name === "@own" || name.startsWith("@(")) {
 			warnOnce(`reserved-prefix:${name}`, `[Tasty] Cannot define predefined state '${name}'. This prefix is reserved for built-in functionality.`);
 			continue;
 		}
@@ -102,6 +103,7 @@ function isPredefinedStateRef(stateKey) {
 	for (const prefix of RESERVED_PREFIXES) if (stateKey === prefix || stateKey.startsWith(prefix)) {
 		if (stateKey === "@media" || stateKey.startsWith("@media(") || stateKey.startsWith("@media:")) return false;
 		if (stateKey === "@root" || stateKey.startsWith("@root(")) return false;
+		if (stateKey === "@parent" || stateKey.startsWith("@parent(")) return false;
 		if (stateKey === "@own" || stateKey.startsWith("@own(")) return false;
 		if (stateKey.startsWith("@(")) return false;
 	}
@@ -118,7 +120,7 @@ function extractLocalPredefinedStates(styles) {
 	for (const [key, value] of Object.entries(styles)) if (key.startsWith("@") && typeof value === "string") {
 		if (!/^@[A-Za-z][A-Za-z0-9-]*$/.test(key)) continue;
 		if (BUILTIN_STATES.has(key)) continue;
-		if (key === "@media" || key === "@root" || key === "@own" || key.startsWith("@(")) continue;
+		if (key === "@media" || key === "@root" || key === "@parent" || key === "@own" || key.startsWith("@(")) continue;
 		const crossRefs = extractPredefinedStateRefs(value);
 		if (crossRefs.length > 0) {
 			warnOnce(`local-cross-ref:${key}`, `[Tasty] Predefined state '${key}' references another predefined state '${crossRefs[0]}'.\nPredefined states cannot reference each other. Use the full definition instead.`);
@@ -245,6 +247,31 @@ function parseAdvancedState(stateKey, ctx) {
 			raw
 		};
 	}
+	if (stateKey.startsWith("@parent(")) {
+		const endParen = findMatchingParen(stateKey, 7);
+		if (endParen === -1) {
+			warnOnce(`unclosed-parent:${stateKey}`, `[Tasty] Unclosed parent state '${stateKey}'. Missing closing parenthesis.`);
+			return {
+				type: "modifier",
+				condition: stateKey,
+				raw
+			};
+		}
+		const condition = stateKey.slice(8, endParen);
+		if (!condition.trim()) {
+			warnOnce(`empty-parent:${stateKey}`, `[Tasty] Empty parent state condition '${stateKey}'.`);
+			return {
+				type: "modifier",
+				condition: stateKey,
+				raw
+			};
+		}
+		return {
+			type: "parent",
+			condition,
+			raw
+		};
+	}
 	if (stateKey.startsWith("@own(")) {
 		const endParen = findMatchingParen(stateKey, 4);
 		if (endParen === -1) {