@tenphi/tasty 0.0.0-snapshot.09c74e2

package/dist/pipeline/parseStateKey.js.map

@@ -0,0 +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 { 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 { emitWarning } from './warnings';\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// Constants\n// ============================================================================\n\n/**\n * Maximum XOR operands before emitting a performance warning.\n * A ^ B ^ C ^ D = 8 OR branches (2^(n-1)), so chains above 4\n * risk exponential blowup in downstream processing.\n */\nconst MAX_XOR_CHAIN_LENGTH = 4;\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    let operandCount = 1;\n\n    while (this.current()?.type === 'XOR') {\n      this.advance();\n      const right = this.parseUnary();\n      operandCount++;\n\n      if (operandCount > MAX_XOR_CHAIN_LENGTH) {\n        emitWarning(\n          'XOR_CHAIN_TOO_LONG',\n          `XOR chain with ${operandCount} operands produces ${Math.pow(2, operandCount - 1)} OR branches. ` +\n            `Consider breaking into smaller expressions to avoid exponential growth.`,\n        );\n      }\n\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 parseInnerCondition(\n    raw: string,\n    prefixLen: number,\n    wrap: (inner: ConditionNode) => ConditionNode,\n  ): ConditionNode {\n    const content = raw.slice(prefixLen, -1);\n    if (!content.trim()) return trueCondition();\n    return wrap(parseStateKey(content, this.options));\n  }\n\n  private parseRootState(raw: string): ConditionNode {\n    return this.parseInnerCondition(raw, 6, (inner) =>\n      createRootCondition(inner, false, raw),\n    );\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);\n    if (!content.trim()) {\n      return trueCondition();\n    }\n\n    let condition = content.trim();\n    let direct = false;\n\n    const lastCommaIdx = condition.lastIndexOf(',');\n    if (lastCommaIdx !== -1) {\n      const afterComma = condition.slice(lastCommaIdx + 1).trim();\n      if (afterComma === '>') {\n        direct = true;\n        condition = condition.slice(0, lastCommaIdx).trim();\n      }\n    }\n\n    const innerCondition = parseStateKey(condition, this.options);\n    return createParentCondition(innerCondition, 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  private parseOwnState(raw: string): ConditionNode {\n    return this.parseInnerCondition(raw, 5, (inner) =>\n      createOwnCondition(inner, false, raw),\n    );\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// 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":";;;;;;;;;;;;;;;;;;AAgDA,MAAM,uBAAuB;AAgB7B,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;EAC5B,IAAI,eAAe;AAEnB,SAAO,KAAK,SAAS,EAAE,SAAS,OAAO;AACrC,QAAK,SAAS;GACd,MAAM,QAAQ,KAAK,YAAY;AAC/B;AAEA,OAAI,eAAe,qBACjB,aACE,sBACA,kBAAkB,aAAa,qBAAqB,KAAK,IAAI,GAAG,eAAe,EAAE,CAAC,uFAEnF;AAIH,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,oBACN,KACA,WACA,MACe;EACf,MAAM,UAAU,IAAI,MAAM,WAAW,GAAG;AACxC,MAAI,CAAC,QAAQ,MAAM,CAAE,QAAO,eAAe;AAC3C,SAAO,KAAK,cAAc,SAAS,KAAK,QAAQ,CAAC;;CAGnD,AAAQ,eAAe,KAA4B;AACjD,SAAO,KAAK,oBAAoB,KAAK,IAAI,UACvC,oBAAoB,OAAO,OAAO,IAAI,CACvC;;;;;;;;;;;CAYH,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;EAEb,MAAM,eAAe,UAAU,YAAY,IAAI;AAC/C,MAAI,iBAAiB,IAEnB;OADmB,UAAU,MAAM,eAAe,EAAE,CAAC,MAAM,KACxC,KAAK;AACtB,aAAS;AACT,gBAAY,UAAU,MAAM,GAAG,aAAa,CAAC,MAAM;;;AAKvD,SAAO,sBADgB,cAAc,WAAW,KAAK,QAAQ,EAChB,QAAQ,OAAO,IAAI;;;;;;;;;CAUlE,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;;CAGhE,AAAQ,cAAc,KAA4B;AAChD,SAAO,KAAK,oBAAoB,KAAK,IAAI,UACvC,mBAAmB,OAAO,OAAO,IAAI,CACtC;;;;;CAMH,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;;;;;AAUT,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

@@ -0,0 +1,516 @@
+import { Lru } from "../parser/lru.js";
+import { falseCondition, getConditionUniqueId, trueCondition } from "./conditions.js";
+
+//#region src/pipeline/simplify.ts
+/**
+* Condition Simplification Engine
+*
+* Simplifies condition trees by applying boolean algebra rules,
+* detecting contradictions, merging ranges, and deduplicating terms.
+*
+* This is critical for:
+* 1. Detecting invalid combinations (A & !A → FALSE)
+* 2. Reducing CSS output size
+* 3. Producing cleaner selectors
+*/
+const simplifyCache = new Lru(5e3);
+/**
+* Simplify a condition tree aggressively.
+*
+* This applies all possible simplification rules:
+* - Boolean algebra (identity, annihilator, idempotent, absorption)
+* - Contradiction detection (A & !A → FALSE)
+* - Tautology detection (A | !A → TRUE)
+* - Range intersection for numeric queries
+* - Attribute value conflict detection
+* - Deduplication and sorting
+*/
+function simplifyCondition(node) {
+	const key = getConditionUniqueId(node);
+	const cached = simplifyCache.get(key);
+	if (cached) return cached;
+	const result = simplifyInner(node);
+	simplifyCache.set(key, result);
+	return result;
+}
+function simplifyInner(node) {
+	if (node.kind === "true" || node.kind === "false") return node;
+	if (node.kind === "state") return node;
+	if (node.kind === "compound") {
+		const simplifiedChildren = node.children.map((c) => simplifyInner(c));
+		if (node.operator === "AND") return simplifyAnd(simplifiedChildren);
+		else return simplifyOr(simplifiedChildren);
+	}
+	return node;
+}
+function simplifyAnd(children) {
+	let terms = [];
+	for (const child of children) {
+		if (child.kind === "false") return falseCondition();
+		if (child.kind === "true") continue;
+		if (child.kind === "compound" && child.operator === "AND") terms.push(...child.children);
+		else terms.push(child);
+	}
+	if (terms.length === 0) return trueCondition();
+	if (terms.length === 1) return terms[0];
+	if (hasContradiction(terms)) return falseCondition();
+	if (hasRangeContradiction(terms)) return falseCondition();
+	if (hasAttributeConflict(terms)) return falseCondition();
+	if (hasContainerStyleConflict(terms)) return falseCondition();
+	terms = removeImpliedNegations(terms);
+	terms = deduplicateTerms(terms);
+	terms = mergeRanges(terms);
+	terms = sortTerms(terms);
+	terms = applyAbsorptionAnd(terms);
+	if (terms.length === 0) return trueCondition();
+	if (terms.length === 1) return terms[0];
+	return {
+		kind: "compound",
+		operator: "AND",
+		children: terms
+	};
+}
+function simplifyOr(children) {
+	let terms = [];
+	for (const child of children) {
+		if (child.kind === "true") return trueCondition();
+		if (child.kind === "false") continue;
+		if (child.kind === "compound" && child.operator === "OR") terms.push(...child.children);
+		else terms.push(child);
+	}
+	if (terms.length === 0) return falseCondition();
+	if (terms.length === 1) return terms[0];
+	if (hasTautology(terms)) return trueCondition();
+	terms = deduplicateTerms(terms);
+	terms = sortTerms(terms);
+	terms = applyAbsorptionOr(terms);
+	if (terms.length === 0) return falseCondition();
+	if (terms.length === 1) return terms[0];
+	return {
+		kind: "compound",
+		operator: "OR",
+		children: terms
+	};
+}
+/**
+* Check if any pair of terms has complementary negation (A and !A).
+* Used for both contradiction detection (in AND) and tautology detection (in OR),
+* since the underlying check is identical: the context determines the semantics.
+*/
+function hasComplementaryPair(terms) {
+	const uniqueIds = /* @__PURE__ */ new Set();
+	for (const term of terms) {
+		if (term.kind !== "state") continue;
+		const id = term.uniqueId;
+		const negatedId = term.negated ? id.slice(1) : `!${id}`;
+		if (uniqueIds.has(negatedId)) return true;
+		uniqueIds.add(id);
+	}
+	return false;
+}
+const hasContradiction = hasComplementaryPair;
+const hasTautology = hasComplementaryPair;
+/**
+* Check for range contradictions in media/container queries
+* e.g., @media(w < 400px) & @media(w > 800px) → FALSE
+*
+* Also handles negated conditions:
+* - Single-bound negations are inverted (not (w < 600px) → w >= 600px)
+* - Range negations create excluded ranges that are checked against positive bounds
+*/
+function hasRangeContradiction(terms) {
+	const mediaByDim = /* @__PURE__ */ new Map();
+	const containerByDim = /* @__PURE__ */ new Map();
+	for (const term of terms) {
+		if (term.kind !== "state") continue;
+		if (term.type === "media" && term.subtype === "dimension") {
+			const key = term.dimension || "width";
+			if (!mediaByDim.has(key)) mediaByDim.set(key, {
+				positive: [],
+				negated: []
+			});
+			const group = mediaByDim.get(key);
+			if (term.negated) group.negated.push(term);
+			else group.positive.push(term);
+		}
+		if (term.type === "container" && term.subtype === "dimension") {
+			const key = `${term.containerName || "_"}:${term.dimension || "width"}`;
+			if (!containerByDim.has(key)) containerByDim.set(key, {
+				positive: [],
+				negated: []
+			});
+			const group = containerByDim.get(key);
+			if (term.negated) group.negated.push(term);
+			else group.positive.push(term);
+		}
+	}
+	for (const group of mediaByDim.values()) if (rangesAreImpossibleWithNegations(group.positive, group.negated)) return true;
+	for (const group of containerByDim.values()) if (rangesAreImpossibleWithNegations(group.positive, group.negated)) return true;
+	return false;
+}
+/**
+* Check if conditions are impossible, including negated conditions.
+*
+* For negated single-bound conditions:
+*   not (w < 600px) → w >= 600px (inverted to lower bound)
+*   not (w >= 800px) → w < 800px (inverted to upper bound)
+*
+* For negated range conditions:
+*   not (400px <= w < 800px) → excludes [400, 800)
+*   If the effective bounds fall entirely within an excluded range, it's impossible.
+*/
+function rangesAreImpossibleWithNegations(positive, negated) {
+	const bounds = computeEffectiveBounds(positive);
+	const excludedRanges = [];
+	for (const cond of negated) {
+		const hasLower = cond.lowerBound?.valueNumeric != null;
+		const hasUpper = cond.upperBound?.valueNumeric != null;
+		if (hasLower && hasUpper) excludedRanges.push({
+			lower: cond.lowerBound.valueNumeric,
+			lowerInclusive: cond.lowerBound.inclusive,
+			upper: cond.upperBound.valueNumeric,
+			upperInclusive: cond.upperBound.inclusive
+		});
+		else if (hasUpper) {
+			const value = cond.upperBound.valueNumeric;
+			const inclusive = !cond.upperBound.inclusive;
+			if (bounds.lowerBound === null || value > bounds.lowerBound) {
+				bounds.lowerBound = value;
+				bounds.lowerInclusive = inclusive;
+			} else if (value === bounds.lowerBound && !inclusive) bounds.lowerInclusive = false;
+		} else if (hasLower) {
+			const value = cond.lowerBound.valueNumeric;
+			const inclusive = !cond.lowerBound.inclusive;
+			if (bounds.upperBound === null || value < bounds.upperBound) {
+				bounds.upperBound = value;
+				bounds.upperInclusive = inclusive;
+			} else if (value === bounds.upperBound && !inclusive) bounds.upperInclusive = false;
+		}
+	}
+	if (bounds.lowerBound !== null && bounds.upperBound !== null) {
+		if (bounds.lowerBound > bounds.upperBound) return true;
+		if (bounds.lowerBound === bounds.upperBound && (!bounds.lowerInclusive || !bounds.upperInclusive)) return true;
+	}
+	if (bounds.lowerBound !== null && bounds.upperBound !== null && excludedRanges.length > 0) {
+		for (const excluded of excludedRanges) if (boundsWithinExcludedRange(bounds, excluded)) return true;
+	}
+	return false;
+}
+/**
+* Compute effective bounds from positive (non-negated) conditions
+*/
+function computeEffectiveBounds(conditions) {
+	let lowerBound = null;
+	let lowerInclusive = false;
+	let upperBound = null;
+	let upperInclusive = false;
+	for (const cond of conditions) {
+		if (cond.lowerBound?.valueNumeric != null) {
+			const value = cond.lowerBound.valueNumeric;
+			const inclusive = cond.lowerBound.inclusive;
+			if (lowerBound === null || value > lowerBound) {
+				lowerBound = value;
+				lowerInclusive = inclusive;
+			} else if (value === lowerBound && !inclusive) lowerInclusive = false;
+		}
+		if (cond.upperBound?.valueNumeric != null) {
+			const value = cond.upperBound.valueNumeric;
+			const inclusive = cond.upperBound.inclusive;
+			if (upperBound === null || value < upperBound) {
+				upperBound = value;
+				upperInclusive = inclusive;
+			} else if (value === upperBound && !inclusive) upperInclusive = false;
+		}
+	}
+	return {
+		lowerBound,
+		lowerInclusive,
+		upperBound,
+		upperInclusive
+	};
+}
+/**
+* Check if effective bounds fall entirely within an excluded range.
+*
+* For example:
+*   Effective: [400, 800)
+*   Excluded:  [400, 800)
+*   → bounds fall entirely within excluded range → impossible
+*/
+function boundsWithinExcludedRange(bounds, excluded) {
+	if (bounds.lowerBound === null || bounds.upperBound === null) return false;
+	let lowerOk = false;
+	if (bounds.lowerBound > excluded.lower) lowerOk = true;
+	else if (bounds.lowerBound === excluded.lower) lowerOk = excluded.lowerInclusive || !bounds.lowerInclusive;
+	let upperOk = false;
+	if (bounds.upperBound < excluded.upper) upperOk = true;
+	else if (bounds.upperBound === excluded.upper) upperOk = excluded.upperInclusive || !bounds.upperInclusive;
+	return lowerOk && upperOk;
+}
+/**
+* Check for attribute value conflicts
+* e.g., [data-theme="dark"] & [data-theme="light"] → FALSE
+* e.g., [data-theme="dark"] & ![data-theme] → FALSE
+*/
+/**
+* Generic value-conflict checker for grouped conditions.
+*
+* Groups terms by a key, splits into positive/negated, then checks:
+*   1. Multiple distinct positive values → conflict
+*   2. Positive value + negated existence (value === undefined) → conflict
+*   3. Positive value + negated same value → conflict
+*/
+function hasGroupedValueConflict(terms, match, groupKey, getValue) {
+	const groups = /* @__PURE__ */ new Map();
+	for (const term of terms) {
+		const matched = match(term);
+		if (!matched) continue;
+		const key = groupKey(matched);
+		let group = groups.get(key);
+		if (!group) {
+			group = {
+				positive: [],
+				negated: []
+			};
+			groups.set(key, group);
+		}
+		if (matched.negated) group.negated.push(matched);
+		else group.positive.push(matched);
+	}
+	for (const [, group] of groups) {
+		const positiveValues = group.positive.map(getValue).filter((v) => v !== void 0);
+		if (new Set(positiveValues).size > 1) return true;
+		const hasPositiveValue = positiveValues.length > 0;
+		const hasNegatedExistence = group.negated.some((t) => getValue(t) === void 0);
+		if (hasPositiveValue && hasNegatedExistence) return true;
+		for (const pos of group.positive) {
+			const posVal = getValue(pos);
+			if (posVal !== void 0) {
+				for (const neg of group.negated) if (getValue(neg) === posVal) return true;
+			}
+		}
+	}
+	return false;
+}
+function hasAttributeConflict(terms) {
+	return hasGroupedValueConflict(terms, (t) => t.kind === "state" && t.type === "modifier" ? t : null, (t) => t.attribute, (t) => t.value);
+}
+function hasContainerStyleConflict(terms) {
+	return hasGroupedValueConflict(terms, (t) => t.kind === "state" && t.type === "container" && t.subtype === "style" ? t : null, (t) => `${t.containerName || "_"}:${t.property}`, (t) => t.propertyValue);
+}
+/**
+* Remove negations that are implied by positive terms.
+*
+* Key optimizations:
+* 1. style(--variant: danger) implies NOT style(--variant: success)
+*    → If we have style(--variant: danger) & not style(--variant: success),
+*      the negation is redundant and can be removed.
+*
+* 2. [data-theme="dark"] implies NOT [data-theme="light"]
+*    → Same logic for attribute selectors.
+*
+* This produces cleaner CSS:
+*   Before: @container style(--variant: danger) and (not style(--variant: success))
+*   After:  @container style(--variant: danger)
+*/
+/**
+* Collect positive values from terms and build a "is this negation implied?" check.
+*
+* A negation is implied (redundant) when a positive term for the same group
+* already pins a specific value, making "NOT other-value" obvious.
+* e.g. style(--variant: danger) implies NOT style(--variant: success).
+*/
+function buildImpliedNegationCheck(terms) {
+	const positiveValues = /* @__PURE__ */ new Map();
+	for (const term of terms) {
+		if (term.kind !== "state" || term.negated) continue;
+		if (term.type === "container" && term.subtype === "style") {
+			if (term.propertyValue !== void 0) positiveValues.set(`c:${term.containerName || "_"}:${term.property}`, term.propertyValue);
+		} else if (term.type === "modifier" && term.value !== void 0) positiveValues.set(`m:${term.attribute}`, term.value);
+	}
+	return (term) => {
+		if (term.kind !== "state" || !term.negated) return false;
+		if (term.type === "container" && term.subtype === "style") {
+			if (term.propertyValue === void 0) return false;
+			const pos = positiveValues.get(`c:${term.containerName || "_"}:${term.property}`);
+			return pos !== void 0 && term.propertyValue !== pos;
+		}
+		if (term.type === "modifier" && term.value !== void 0) {
+			const pos = positiveValues.get(`m:${term.attribute}`);
+			return pos !== void 0 && term.value !== pos;
+		}
+		return false;
+	};
+}
+function removeImpliedNegations(terms) {
+	const isImplied = buildImpliedNegationCheck(terms);
+	return terms.filter((t) => !isImplied(t));
+}
+function deduplicateTerms(terms) {
+	const seen = /* @__PURE__ */ new Set();
+	const result = [];
+	for (const term of terms) {
+		const id = getConditionUniqueId(term);
+		if (!seen.has(id)) {
+			seen.add(id);
+			result.push(term);
+		}
+	}
+	return result;
+}
+/**
+* Merge compatible range conditions
+* e.g., @media(w >= 400px) & @media(w <= 800px) → @media(400px <= w <= 800px)
+*/
+function mergeRanges(terms) {
+	const mediaByDim = /* @__PURE__ */ new Map();
+	const containerByDim = /* @__PURE__ */ new Map();
+	terms.forEach((term, index) => {
+		if (term.kind !== "state") return;
+		if (term.type === "media" && term.subtype === "dimension" && !term.negated) {
+			const key = term.dimension || "width";
+			if (!mediaByDim.has(key)) mediaByDim.set(key, {
+				conditions: [],
+				indices: []
+			});
+			const group = mediaByDim.get(key);
+			group.conditions.push(term);
+			group.indices.push(index);
+		}
+		if (term.type === "container" && term.subtype === "dimension" && !term.negated) {
+			const key = `${term.containerName || "_"}:${term.dimension || "width"}`;
+			if (!containerByDim.has(key)) containerByDim.set(key, {
+				conditions: [],
+				indices: []
+			});
+			const group = containerByDim.get(key);
+			group.conditions.push(term);
+			group.indices.push(index);
+		}
+	});
+	const indicesToRemove = /* @__PURE__ */ new Set();
+	const mergedTerms = [];
+	for (const [_dim, group] of mediaByDim) if (group.conditions.length > 1) {
+		const merged = mergeMediaRanges(group.conditions);
+		if (merged) {
+			group.indices.forEach((i) => indicesToRemove.add(i));
+			mergedTerms.push(merged);
+		}
+	}
+	for (const [, group] of containerByDim) if (group.conditions.length > 1) {
+		const merged = mergeContainerRanges(group.conditions);
+		if (merged) {
+			group.indices.forEach((i) => indicesToRemove.add(i));
+			mergedTerms.push(merged);
+		}
+	}
+	const result = [];
+	terms.forEach((term, index) => {
+		if (!indicesToRemove.has(index)) result.push(term);
+	});
+	result.push(...mergedTerms);
+	return result;
+}
+/**
+* Tighten bounds by picking the most restrictive lower and upper bounds
+* from a set of conditions that have lowerBound/upperBound fields.
+*/
+function tightenBounds(conditions) {
+	let lowerBound;
+	let upperBound;
+	for (const cond of conditions) {
+		if (cond.lowerBound) {
+			if (!lowerBound || (cond.lowerBound.valueNumeric ?? -Infinity) > (lowerBound.valueNumeric ?? -Infinity)) lowerBound = cond.lowerBound;
+		}
+		if (cond.upperBound) {
+			if (!upperBound || (cond.upperBound.valueNumeric ?? Infinity) < (upperBound.valueNumeric ?? Infinity)) upperBound = cond.upperBound;
+		}
+	}
+	return {
+		lowerBound,
+		upperBound
+	};
+}
+function appendBoundsToUniqueId(parts, lowerBound, upperBound) {
+	if (lowerBound) {
+		parts.push(lowerBound.inclusive ? ">=" : ">");
+		parts.push(lowerBound.value);
+	}
+	if (upperBound) {
+		parts.push(upperBound.inclusive ? "<=" : "<");
+		parts.push(upperBound.value);
+	}
+}
+function mergeDimensionRanges(conditions, idPrefix) {
+	if (conditions.length === 0) return null;
+	const { lowerBound, upperBound } = tightenBounds(conditions);
+	const base = conditions[0];
+	const parts = [...idPrefix];
+	appendBoundsToUniqueId(parts, lowerBound, upperBound);
+	return {
+		...base,
+		negated: false,
+		raw: buildMergedRaw(base.dimension || "width", lowerBound, upperBound),
+		uniqueId: parts.join(":"),
+		lowerBound,
+		upperBound
+	};
+}
+function mergeMediaRanges(conditions) {
+	return mergeDimensionRanges(conditions, [
+		"media",
+		"dim",
+		conditions[0]?.dimension ?? "width"
+	]);
+}
+function mergeContainerRanges(conditions) {
+	const base = conditions[0];
+	if (!base) return null;
+	return mergeDimensionRanges(conditions, [
+		"container",
+		"dim",
+		base.containerName || "_",
+		base.dimension ?? "width"
+	]);
+}
+function buildMergedRaw(dimension, lowerBound, upperBound) {
+	if (lowerBound && upperBound) {
+		const lowerOp = lowerBound.inclusive ? "<=" : "<";
+		const upperOp = upperBound.inclusive ? "<=" : "<";
+		return `@media(${lowerBound.value} ${lowerOp} ${dimension} ${upperOp} ${upperBound.value})`;
+	} else if (upperBound) return `@media(${dimension} ${upperBound.inclusive ? "<=" : "<"} ${upperBound.value})`;
+	else if (lowerBound) return `@media(${dimension} ${lowerBound.inclusive ? ">=" : ">"} ${lowerBound.value})`;
+	return "@media()";
+}
+function sortTerms(terms) {
+	const withIds = terms.map((t) => [getConditionUniqueId(t), t]);
+	withIds.sort((a, b) => a[0].localeCompare(b[0]));
+	return withIds.map(([, t]) => t);
+}
+/**
+* Apply the absorption law: removes compound terms that are absorbed by
+* a simple term already present.
+*
+* For AND context: A & (A | B) → A  (absorbs OR compounds)
+* For OR  context: A | (A & B) → A  (absorbs AND compounds)
+*/
+function applyAbsorption(terms, absorbedOperator) {
+	const simpleIds = /* @__PURE__ */ new Set();
+	for (const term of terms) if (term.kind !== "compound") simpleIds.add(getConditionUniqueId(term));
+	return terms.filter((term) => {
+		if (term.kind === "compound" && term.operator === absorbedOperator) {
+			for (const child of term.children) if (simpleIds.has(getConditionUniqueId(child))) return false;
+		}
+		return true;
+	});
+}
+function applyAbsorptionAnd(terms) {
+	return applyAbsorption(terms, "OR");
+}
+function applyAbsorptionOr(terms) {
+	return applyAbsorption(terms, "AND");
+}
+
+//#endregion
+export { simplifyCondition };
+//# sourceMappingURL=simplify.js.map