@cube-dev/ui-kit 0.114.0 → 0.116.0

package/dist/tasty/pipeline/simplify.js.map

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

package/dist/tasty/plugins/index.d.ts

@@ -0,0 +1,3 @@
+
+import { TastyPlugin, TastyPluginFactory } from "./types.js";
+import { okhslFunc, okhslPlugin } from "./okhsl-plugin.js";

package/dist/tasty/plugins/okhsl-plugin.d.ts

@@ -0,0 +1,36 @@
+
+import { StyleDetails } from "../parser/types.js";
+import { TastyPluginFactory } from "./types.js";
+
+//#region src/tasty/plugins/okhsl-plugin.d.ts
+/**
+ * The okhsl function handler for tasty parser.
+ * Receives parsed style groups and returns an RGB color string.
+ */
+declare const okhslFunc: (groups: StyleDetails[]) => string;
+/**
+ * OKHSL Plugin for Tasty.
+ *
+ * Adds support for the `okhsl()` color function in tasty styles.
+ *
+ * @example
+ * ```ts
+ * import { configure } from '@cube-dev/ui-kit';
+ * import { okhslPlugin } from '@cube-dev/ui-kit/tasty/plugins';
+ *
+ * configure({
+ *   plugins: [okhslPlugin()],
+ * });
+ *
+ * // Now you can use okhsl in styles:
+ * const Box = tasty({
+ *   styles: {
+ *     fill: 'okhsl(240 50% 50%)',
+ *   },
+ * });
+ * ```
+ */
+declare const okhslPlugin: TastyPluginFactory;
+//#endregion
+export { okhslFunc, okhslPlugin };
+//# sourceMappingURL=okhsl-plugin.d.ts.map

package/dist/tasty/plugins/okhsl-plugin.js

@@ -0,0 +1,370 @@
+/** @license MIT | @cube-dev/ui-kit v0.116.0 | Cube Dev Team */
+import { Lru } from "../parser/lru.js";
+
+//#region src/tasty/plugins/okhsl-plugin.ts
+/**
+* OKHSL Plugin for Tasty
+*
+* Converts OKHSL color syntax to RGB notation.
+* Supports angle units: deg, turn, rad, or unitless (degrees).
+*
+* Examples:
+*   okhsl(240.5 50% 50%)
+*   okhsl(240.5deg 50% 50%)
+*   okhsl(0.25turn 50% 50%)
+*   okhsl(1.57rad 50% 50%)
+*
+* Conversion math inlined from @texel/color to avoid external dependencies.
+*/
+const conversionCache = new Lru(500);
+const OKLab_to_LMS_M = [
+	[
+		1,
+		.3963377773761749,
+		.2158037573099136
+	],
+	[
+		1,
+		-.1055613458156586,
+		-.0638541728258133
+	],
+	[
+		1,
+		-.0894841775298119,
+		-1.2914855480194092
+	]
+];
+const LMS_to_linear_sRGB_M = [
+	[
+		4.076741636075959,
+		-3.307711539258062,
+		.2309699031821041
+	],
+	[
+		-1.2684379732850313,
+		2.6097573492876878,
+		-.3413193760026569
+	],
+	[
+		-.004196076138675526,
+		-.703418617935936,
+		1.7076146940746113
+	]
+];
+const OKLab_to_linear_sRGB_coefficients = [
+	[[-1.8817030993265873, -.8093650129914302], [
+		1.19086277,
+		1.76576728,
+		.59662641,
+		.75515197,
+		.56771245
+	]],
+	[[1.8144407988010998, -1.194452667805235], [
+		.73956515,
+		-.45954404,
+		.08285427,
+		.12541073,
+		-.14503204
+	]],
+	[[.13110757611180954, 1.813339709266608], [
+		1.35733652,
+		-.00915799,
+		-1.1513021,
+		-.50559606,
+		.00692167
+	]]
+];
+const TAU = 2 * Math.PI;
+const clamp = (value, min, max) => Math.max(Math.min(value, max), min);
+const constrainAngle = (angle) => (angle % 360 + 360) % 360;
+const sRGBLinearToGamma = (val) => {
+	const sign = val < 0 ? -1 : 1;
+	const abs = Math.abs(val);
+	return abs > .0031308 ? sign * (1.055 * Math.pow(abs, 1 / 2.4) - .055) : 12.92 * val;
+};
+const dot3 = (a, b) => a[0] * b[0] + a[1] * b[1] + a[2] * b[2];
+const transform = (input, matrix) => [
+	dot3(input, matrix[0]),
+	dot3(input, matrix[1]),
+	dot3(input, matrix[2])
+];
+const cubed3 = (lms) => [
+	lms[0] * lms[0] * lms[0],
+	lms[1] * lms[1] * lms[1],
+	lms[2] * lms[2] * lms[2]
+];
+const OKLabToLinearSRGB = (lab) => {
+	return transform(cubed3(transform(lab, OKLab_to_LMS_M)), LMS_to_linear_sRGB_M);
+};
+const K1 = .206;
+const K2 = .03;
+const K3 = (1 + K1) / (1 + K2);
+const toeInv = (x) => (x ** 2 + K1 * x) / (K3 * (x + K2));
+const dotXY = (a, b) => a[0] * b[0] + a[1] * b[1];
+const computeMaxSaturationOKLC = (a, b) => {
+	const okCoeff = OKLab_to_linear_sRGB_coefficients;
+	const lmsToRgb = LMS_to_linear_sRGB_M;
+	const tmp2 = [a, b];
+	const tmp3 = [
+		0,
+		a,
+		b
+	];
+	let chnlCoeff;
+	let chnlLMS;
+	if (dotXY(okCoeff[0][0], tmp2) > 1) {
+		chnlCoeff = okCoeff[0][1];
+		chnlLMS = lmsToRgb[0];
+	} else if (dotXY(okCoeff[1][0], tmp2) > 1) {
+		chnlCoeff = okCoeff[1][1];
+		chnlLMS = lmsToRgb[1];
+	} else {
+		chnlCoeff = okCoeff[2][1];
+		chnlLMS = lmsToRgb[2];
+	}
+	const [k0, k1, k2, k3, k4] = chnlCoeff;
+	const [wl, wm, ws] = chnlLMS;
+	let sat = k0 + k1 * a + k2 * b + k3 * (a * a) + k4 * a * b;
+	const dotYZ = (mat, vec) => mat[1] * vec[1] + mat[2] * vec[2];
+	const kl = dotYZ(OKLab_to_LMS_M[0], tmp3);
+	const km = dotYZ(OKLab_to_LMS_M[1], tmp3);
+	const ks = dotYZ(OKLab_to_LMS_M[2], tmp3);
+	let l_ = 1 + sat * kl;
+	let m_ = 1 + sat * km;
+	let s_ = 1 + sat * ks;
+	const l = l_ * l_ * l_;
+	const m = m_ * m_ * m_;
+	const s = s_ * s_ * s_;
+	const lds = 3 * kl * (l_ * l_);
+	const mds = 3 * km * (m_ * m_);
+	const sds = 3 * ks * (s_ * s_);
+	const lds2 = 6 * (kl * kl) * l_;
+	const mds2 = 6 * (km * km) * m_;
+	const sds2 = 6 * (ks * ks) * s_;
+	const f = wl * l + wm * m + ws * s;
+	const f1 = wl * lds + wm * mds + ws * sds;
+	const f2 = wl * lds2 + wm * mds2 + ws * sds2;
+	sat = sat - f * f1 / (f1 * f1 - .5 * f * f2);
+	return sat;
+};
+const findCuspOKLCH = (a, b) => {
+	const S_cusp = computeMaxSaturationOKLC(a, b);
+	const rgb_at_max = OKLabToLinearSRGB([
+		1,
+		S_cusp * a,
+		S_cusp * b
+	]);
+	const L_cusp = Math.cbrt(1 / Math.max(Math.max(rgb_at_max[0], rgb_at_max[1]), Math.max(rgb_at_max[2], 0)));
+	return [L_cusp, L_cusp * S_cusp];
+};
+const findGamutIntersectionOKLCH = (a, b, l1, c1, l0, cusp) => {
+	const lmsToRgb = LMS_to_linear_sRGB_M;
+	const tmp3 = [
+		0,
+		a,
+		b
+	];
+	const floatMax = Number.MAX_VALUE;
+	let t;
+	const dotYZ = (mat, vec) => mat[1] * vec[1] + mat[2] * vec[2];
+	const dotXYZ = (vec, x, y, z) => vec[0] * x + vec[1] * y + vec[2] * z;
+	if ((l1 - l0) * cusp[1] - (cusp[0] - l0) * c1 <= 0) {
+		const denom = c1 * cusp[0] + cusp[1] * (l0 - l1);
+		t = denom === 0 ? 0 : cusp[1] * l0 / denom;
+	} else {
+		const denom = c1 * (cusp[0] - 1) + cusp[1] * (l0 - l1);
+		t = denom === 0 ? 0 : cusp[1] * (l0 - 1) / denom;
+		const dl = l1 - l0;
+		const dc = c1;
+		const kl = dotYZ(OKLab_to_LMS_M[0], tmp3);
+		const km = dotYZ(OKLab_to_LMS_M[1], tmp3);
+		const ks = dotYZ(OKLab_to_LMS_M[2], tmp3);
+		const ldt_ = dl + dc * kl;
+		const mdt_ = dl + dc * km;
+		const sdt_ = dl + dc * ks;
+		const L = l0 * (1 - t) + t * l1;
+		const C = t * c1;
+		const l_ = L + C * kl;
+		const m_ = L + C * km;
+		const s_ = L + C * ks;
+		const l = l_ * l_ * l_;
+		const m = m_ * m_ * m_;
+		const s = s_ * s_ * s_;
+		const ldt = 3 * ldt_ * l_ * l_;
+		const mdt = 3 * mdt_ * m_ * m_;
+		const sdt = 3 * sdt_ * s_ * s_;
+		const ldt2 = 6 * ldt_ * ldt_ * l_;
+		const mdt2 = 6 * mdt_ * mdt_ * m_;
+		const sdt2 = 6 * sdt_ * sdt_ * s_;
+		const r_ = dotXYZ(lmsToRgb[0], l, m, s) - 1;
+		const r1 = dotXYZ(lmsToRgb[0], ldt, mdt, sdt);
+		const r2 = dotXYZ(lmsToRgb[0], ldt2, mdt2, sdt2);
+		const ur = r1 / (r1 * r1 - .5 * r_ * r2);
+		let tr = -r_ * ur;
+		const g_ = dotXYZ(lmsToRgb[1], l, m, s) - 1;
+		const g1 = dotXYZ(lmsToRgb[1], ldt, mdt, sdt);
+		const g2 = dotXYZ(lmsToRgb[1], ldt2, mdt2, sdt2);
+		const ug = g1 / (g1 * g1 - .5 * g_ * g2);
+		let tg = -g_ * ug;
+		const b_ = dotXYZ(lmsToRgb[2], l, m, s) - 1;
+		const b1 = dotXYZ(lmsToRgb[2], ldt, mdt, sdt);
+		const b2 = dotXYZ(lmsToRgb[2], ldt2, mdt2, sdt2);
+		const ub = b1 / (b1 * b1 - .5 * b_ * b2);
+		let tb = -b_ * ub;
+		tr = ur >= 0 ? tr : floatMax;
+		tg = ug >= 0 ? tg : floatMax;
+		tb = ub >= 0 ? tb : floatMax;
+		t += Math.min(tr, Math.min(tg, tb));
+	}
+	return t;
+};
+const computeSt = (cusp) => {
+	const l = cusp[0];
+	const c = cusp[1];
+	return [c / l, c / (1 - l)];
+};
+const computeStMid = (a, b) => {
+	return [.11516993 + 1 / (7.4477897 + 4.1590124 * b + a * (-2.19557347 + 1.75198401 * b + a * (-2.13704948 - 10.02301043 * b + a * (-4.24894561 + 5.38770819 * b + 4.69891013 * a)))), .11239642 + 1 / (1.6132032 - .68124379 * b + a * (.40370612 + .90148123 * b + a * (-.27087943 + .6122399 * b + a * (.00299215 - .45399568 * b - .14661872 * a))))];
+};
+const getCs = (L, a, b, cusp) => {
+	const cMax = findGamutIntersectionOKLCH(a, b, L, 1, L, cusp);
+	const stMax = computeSt(cusp);
+	const k = cMax / Math.min(L * stMax[0], (1 - L) * stMax[1]);
+	const stMid = computeStMid(a, b);
+	let ca = L * stMid[0];
+	let cb = (1 - L) * stMid[1];
+	const cMid = .9 * k * Math.sqrt(Math.sqrt(1 / (1 / ca ** 4 + 1 / cb ** 4)));
+	ca = L * .4;
+	cb = (1 - L) * .8;
+	return [
+		Math.sqrt(1 / (1 / ca ** 2 + 1 / cb ** 2)),
+		cMid,
+		cMax
+	];
+};
+const OKHSLToOKLab = (hsl) => {
+	let h = hsl[0];
+	const s = hsl[1];
+	const l = hsl[2];
+	let L = toeInv(l);
+	let a = 0;
+	let b = 0;
+	h = constrainAngle(h) / 360;
+	if (L !== 0 && L !== 1 && s !== 0) {
+		const a_ = Math.cos(TAU * h);
+		const b_ = Math.sin(TAU * h);
+		const [c0, cMid, cMax] = getCs(L, a_, b_, findCuspOKLCH(a_, b_));
+		const mid = .8;
+		const midInv = 1.25;
+		let t, k0, k1, k2;
+		if (s < mid) {
+			t = midInv * s;
+			k0 = 0;
+			k1 = mid * c0;
+			k2 = 1 - k1 / cMid;
+		} else {
+			t = 5 * (s - .8);
+			k0 = cMid;
+			k1 = .2 * cMid ** 2 * 1.25 ** 2 / c0;
+			k2 = 1 - k1 / (cMax - cMid);
+		}
+		const c = k0 + t * k1 / (1 - k2 * t);
+		a = c * a_;
+		b = c * b_;
+	}
+	return [
+		L,
+		a,
+		b
+	];
+};
+const okhslToSRGB = (h, s, l) => {
+	const linearRGB = OKLabToLinearSRGB(OKHSLToOKLab([
+		h,
+		s,
+		l
+	]));
+	return [
+		clamp(sRGBLinearToGamma(linearRGB[0]), 0, 1),
+		clamp(sRGBLinearToGamma(linearRGB[1]), 0, 1),
+		clamp(sRGBLinearToGamma(linearRGB[2]), 0, 1)
+	];
+};
+/**
+* Parse an angle value with optional unit.
+* Supports: deg, turn, rad, or unitless (treated as degrees).
+*/
+const parseAngle = (value) => {
+	const match = value.match(/^([+-]?\d*\.?\d+)(deg|turn|rad)?$/);
+	if (!match) return 0;
+	const num = parseFloat(match[1]);
+	switch (match[2]) {
+		case "turn": return num * 360;
+		case "rad": return num * 180 / Math.PI;
+		default: return num;
+	}
+};
+/**
+* Parse a percentage value (e.g., "50%") to a 0-1 range.
+*/
+const parsePercentage = (value) => {
+	const match = value.match(/^([+-]?\d*\.?\d+)%?$/);
+	if (!match) return 0;
+	const num = parseFloat(match[1]);
+	return value.includes("%") ? num / 100 : num;
+};
+/**
+* The okhsl function handler for tasty parser.
+* Receives parsed style groups and returns an RGB color string.
+*/
+const okhslFunc = (groups) => {
+	if (groups.length === 0 || groups[0].all.length < 3) {
+		console.warn("[okhsl] Expected 3 values (H S L), got:", groups);
+		return "rgb(0% 0% 0%)";
+	}
+	const tokens = groups[0].all;
+	const cacheKey = tokens.slice(0, 3).join(" ");
+	const cached = conversionCache.get(cacheKey);
+	if (cached) return cached;
+	const h = parseAngle(tokens[0]);
+	const s = parsePercentage(tokens[1]);
+	const l = parsePercentage(tokens[2]);
+	const [r, g, b] = okhslToSRGB(h, clamp(s, 0, 1), clamp(l, 0, 1));
+	const format = (n) => {
+		const pct = n * 100;
+		return parseFloat(pct.toFixed(1)).toString() + "%";
+	};
+	const result = `rgb(${format(r)} ${format(g)} ${format(b)})`;
+	conversionCache.set(cacheKey, result);
+	return result;
+};
+/**
+* OKHSL Plugin for Tasty.
+*
+* Adds support for the `okhsl()` color function in tasty styles.
+*
+* @example
+* ```ts
+* import { configure } from '@cube-dev/ui-kit';
+* import { okhslPlugin } from '@cube-dev/ui-kit/tasty/plugins';
+*
+* configure({
+*   plugins: [okhslPlugin()],
+* });
+*
+* // Now you can use okhsl in styles:
+* const Box = tasty({
+*   styles: {
+*     fill: 'okhsl(240 50% 50%)',
+*   },
+* });
+* ```
+*/
+const okhslPlugin = () => ({
+	name: "okhsl",
+	funcs: { okhsl: okhslFunc }
+});
+
+//#endregion
+export { okhslFunc, okhslPlugin };
+//# sourceMappingURL=okhsl-plugin.js.map

package/dist/tasty/plugins/okhsl-plugin.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"okhsl-plugin.js","names":[],"sources":["../../../src/tasty/plugins/okhsl-plugin.ts"],"sourcesContent":["/**\n * OKHSL Plugin for Tasty\n *\n * Converts OKHSL color syntax to RGB notation.\n * Supports angle units: deg, turn, rad, or unitless (degrees).\n *\n * Examples:\n *   okhsl(240.5 50% 50%)\n *   okhsl(240.5deg 50% 50%)\n *   okhsl(0.25turn 50% 50%)\n *   okhsl(1.57rad 50% 50%)\n *\n * Conversion math inlined from @texel/color to avoid external dependencies.\n */\n\nimport { Lru } from '../parser/lru';\n\nimport type { StyleDetails } from '../parser/types';\nimport type { TastyPlugin, TastyPluginFactory } from './types';\n\n// Cache for OKHSL to RGB conversions\nconst conversionCache = new Lru<string, string>(500);\n\n// ============================================================================\n// Conversion Matrices (from texel-color)\n// ============================================================================\n\nconst OKLab_to_LMS_M: [number, number, number][] = [\n  [1.0, 0.3963377773761749, 0.2158037573099136],\n  [1.0, -0.1055613458156586, -0.0638541728258133],\n  [1.0, -0.0894841775298119, -1.2914855480194092],\n];\n\nconst LMS_to_linear_sRGB_M: [number, number, number][] = [\n  [4.076741636075959, -3.307711539258062, 0.2309699031821041],\n  [-1.2684379732850313, 2.6097573492876878, -0.3413193760026569],\n  [-0.004196076138675526, -0.703418617935936, 1.7076146940746113],\n];\n\nconst OKLab_to_linear_sRGB_coefficients: [\n  [[number, number], number[]],\n  [[number, number], number[]],\n  [[number, number], number[]],\n] = [\n  [\n    [-1.8817030993265873, -0.8093650129914302],\n    [1.19086277, 1.76576728, 0.59662641, 0.75515197, 0.56771245],\n  ],\n  [\n    [1.8144407988010998, -1.194452667805235],\n    [0.73956515, -0.45954404, 0.08285427, 0.12541073, -0.14503204],\n  ],\n  [\n    [0.13110757611180954, 1.813339709266608],\n    [1.35733652, -0.00915799, -1.1513021, -0.50559606, 0.00692167],\n  ],\n];\n\n// ============================================================================\n// Math Utilities\n// ============================================================================\n\nconst TAU = 2 * Math.PI;\n\nconst clamp = (value: number, min: number, max: number): number =>\n  Math.max(Math.min(value, max), min);\n\nconst constrainAngle = (angle: number): number => ((angle % 360) + 360) % 360;\n\nconst copySign = (to: number, from: number): number =>\n  Math.sign(to) === Math.sign(from) ? to : -to;\n\nconst spow = (base: number, exp: number): number =>\n  copySign(Math.abs(base) ** exp, base);\n\n// ============================================================================\n// sRGB Gamma Conversion\n// ============================================================================\n\nconst sRGBLinearToGamma = (val: number): number => {\n  const sign = val < 0 ? -1 : 1;\n  const abs = Math.abs(val);\n  return abs > 0.0031308\n    ? sign * (1.055 * Math.pow(abs, 1 / 2.4) - 0.055)\n    : 12.92 * val;\n};\n\n// ============================================================================\n// Matrix Operations\n// ============================================================================\n\ntype Vec3 = [number, number, number];\n\nconst dot3 = (a: Vec3, b: Vec3): number =>\n  a[0] * b[0] + a[1] * b[1] + a[2] * b[2];\n\nconst transform = (input: Vec3, matrix: Vec3[]): Vec3 => [\n  dot3(input, matrix[0]),\n  dot3(input, matrix[1]),\n  dot3(input, matrix[2]),\n];\n\nconst cubed3 = (lms: Vec3): Vec3 => [\n  lms[0] * lms[0] * lms[0],\n  lms[1] * lms[1] * lms[1],\n  lms[2] * lms[2] * lms[2],\n];\n\n// ============================================================================\n// OKLab Conversion\n// ============================================================================\n\nconst OKLabToLinearSRGB = (lab: Vec3): Vec3 => {\n  const lms = transform(lab, OKLab_to_LMS_M);\n  const cubedLms = cubed3(lms);\n  return transform(cubedLms, LMS_to_linear_sRGB_M);\n};\n\n// ============================================================================\n// OKHSL to OKLab Conversion (from texel-color)\n// ============================================================================\n\nconst K1 = 0.206;\nconst K2 = 0.03;\nconst K3 = (1.0 + K1) / (1.0 + K2);\n\nconst toe = (x: number): number =>\n  0.5 *\n  (K3 * x - K1 + Math.sqrt((K3 * x - K1) * (K3 * x - K1) + 4 * K2 * K3 * x));\n\nconst toeInv = (x: number): number => (x ** 2 + K1 * x) / (K3 * (x + K2));\n\nconst dotXY = (a: [number, number], b: [number, number]): number =>\n  a[0] * b[0] + a[1] * b[1];\n\nconst computeMaxSaturationOKLC = (a: number, b: number): number => {\n  const okCoeff = OKLab_to_linear_sRGB_coefficients;\n  const lmsToRgb = LMS_to_linear_sRGB_M;\n  const tmp2: [number, number] = [a, b];\n  const tmp3: Vec3 = [0, a, b];\n\n  let chnlCoeff: number[];\n  let chnlLMS: Vec3;\n\n  if (dotXY(okCoeff[0][0], tmp2) > 1) {\n    chnlCoeff = okCoeff[0][1];\n    chnlLMS = lmsToRgb[0];\n  } else if (dotXY(okCoeff[1][0], tmp2) > 1) {\n    chnlCoeff = okCoeff[1][1];\n    chnlLMS = lmsToRgb[1];\n  } else {\n    chnlCoeff = okCoeff[2][1];\n    chnlLMS = lmsToRgb[2];\n  }\n\n  const [k0, k1, k2, k3, k4] = chnlCoeff;\n  const [wl, wm, ws] = chnlLMS;\n\n  let sat = k0 + k1 * a + k2 * b + k3 * (a * a) + k4 * a * b;\n\n  const dotYZ = (mat: Vec3, vec: Vec3): number =>\n    mat[1] * vec[1] + mat[2] * vec[2];\n\n  const kl = dotYZ(OKLab_to_LMS_M[0], tmp3);\n  const km = dotYZ(OKLab_to_LMS_M[1], tmp3);\n  const ks = dotYZ(OKLab_to_LMS_M[2], tmp3);\n\n  let l_ = 1.0 + sat * kl;\n  let m_ = 1.0 + sat * km;\n  let s_ = 1.0 + sat * ks;\n\n  const l = l_ * l_ * l_;\n  const m = m_ * m_ * m_;\n  const s = s_ * s_ * s_;\n\n  const lds = 3.0 * kl * (l_ * l_);\n  const mds = 3.0 * km * (m_ * m_);\n  const sds = 3.0 * ks * (s_ * s_);\n\n  const lds2 = 6.0 * (kl * kl) * l_;\n  const mds2 = 6.0 * (km * km) * m_;\n  const sds2 = 6.0 * (ks * ks) * s_;\n\n  const f = wl * l + wm * m + ws * s;\n  const f1 = wl * lds + wm * mds + ws * sds;\n  const f2 = wl * lds2 + wm * mds2 + ws * sds2;\n\n  sat = sat - (f * f1) / (f1 * f1 - 0.5 * f * f2);\n\n  return sat;\n};\n\nconst findCuspOKLCH = (a: number, b: number): [number, number] => {\n  const lmsToRgb = LMS_to_linear_sRGB_M;\n  const S_cusp = computeMaxSaturationOKLC(a, b);\n\n  const lab: Vec3 = [1, S_cusp * a, S_cusp * b];\n  const rgb_at_max = OKLabToLinearSRGB(lab);\n\n  const L_cusp = Math.cbrt(\n    1 /\n      Math.max(\n        Math.max(rgb_at_max[0], rgb_at_max[1]),\n        Math.max(rgb_at_max[2], 0.0),\n      ),\n  );\n  const C_cusp = L_cusp * S_cusp;\n\n  return [L_cusp, C_cusp];\n};\n\nconst findGamutIntersectionOKLCH = (\n  a: number,\n  b: number,\n  l1: number,\n  c1: number,\n  l0: number,\n  cusp: [number, number],\n): number => {\n  const lmsToRgb = LMS_to_linear_sRGB_M;\n  const tmp3: Vec3 = [0, a, b];\n  const floatMax = Number.MAX_VALUE;\n\n  let t: number;\n\n  const dotYZ = (mat: Vec3, vec: Vec3): number =>\n    mat[1] * vec[1] + mat[2] * vec[2];\n  const dotXYZ = (vec: Vec3, x: number, y: number, z: number): number =>\n    vec[0] * x + vec[1] * y + vec[2] * z;\n\n  if ((l1 - l0) * cusp[1] - (cusp[0] - l0) * c1 <= 0.0) {\n    const denom = c1 * cusp[0] + cusp[1] * (l0 - l1);\n    t = denom === 0 ? 0 : (cusp[1] * l0) / denom;\n  } else {\n    const denom = c1 * (cusp[0] - 1.0) + cusp[1] * (l0 - l1);\n    t = denom === 0 ? 0 : (cusp[1] * (l0 - 1.0)) / denom;\n\n    const dl = l1 - l0;\n    const dc = c1;\n\n    const kl = dotYZ(OKLab_to_LMS_M[0], tmp3);\n    const km = dotYZ(OKLab_to_LMS_M[1], tmp3);\n    const ks = dotYZ(OKLab_to_LMS_M[2], tmp3);\n\n    const ldt_ = dl + dc * kl;\n    const mdt_ = dl + dc * km;\n    const sdt_ = dl + dc * ks;\n\n    const L = l0 * (1.0 - t) + t * l1;\n    const C = t * c1;\n\n    const l_ = L + C * kl;\n    const m_ = L + C * km;\n    const s_ = L + C * ks;\n\n    const l = l_ * l_ * l_;\n    const m = m_ * m_ * m_;\n    const s = s_ * s_ * s_;\n\n    const ldt = 3 * ldt_ * l_ * l_;\n    const mdt = 3 * mdt_ * m_ * m_;\n    const sdt = 3 * sdt_ * s_ * s_;\n\n    const ldt2 = 6 * ldt_ * ldt_ * l_;\n    const mdt2 = 6 * mdt_ * mdt_ * m_;\n    const sdt2 = 6 * sdt_ * sdt_ * s_;\n\n    const r_ = dotXYZ(lmsToRgb[0], l, m, s) - 1;\n    const r1 = dotXYZ(lmsToRgb[0], ldt, mdt, sdt);\n    const r2 = dotXYZ(lmsToRgb[0], ldt2, mdt2, sdt2);\n\n    const ur = r1 / (r1 * r1 - 0.5 * r_ * r2);\n    let tr = -r_ * ur;\n\n    const g_ = dotXYZ(lmsToRgb[1], l, m, s) - 1;\n    const g1 = dotXYZ(lmsToRgb[1], ldt, mdt, sdt);\n    const g2 = dotXYZ(lmsToRgb[1], ldt2, mdt2, sdt2);\n\n    const ug = g1 / (g1 * g1 - 0.5 * g_ * g2);\n    let tg = -g_ * ug;\n\n    const b_ = dotXYZ(lmsToRgb[2], l, m, s) - 1;\n    const b1 = dotXYZ(lmsToRgb[2], ldt, mdt, sdt);\n    const b2 = dotXYZ(lmsToRgb[2], ldt2, mdt2, sdt2);\n\n    const ub = b1 / (b1 * b1 - 0.5 * b_ * b2);\n    let tb = -b_ * ub;\n\n    tr = ur >= 0.0 ? tr : floatMax;\n    tg = ug >= 0.0 ? tg : floatMax;\n    tb = ub >= 0.0 ? tb : floatMax;\n\n    t += Math.min(tr, Math.min(tg, tb));\n  }\n\n  return t;\n};\n\nconst computeSt = (cusp: [number, number]): [number, number] => {\n  const l = cusp[0];\n  const c = cusp[1];\n  return [c / l, c / (1 - l)];\n};\n\nconst computeStMid = (a: number, b: number): [number, number] => {\n  const s =\n    0.11516993 +\n    1.0 /\n      (7.4477897 +\n        4.1590124 * b +\n        a *\n          (-2.19557347 +\n            1.75198401 * b +\n            a *\n              (-2.13704948 -\n                10.02301043 * b +\n                a * (-4.24894561 + 5.38770819 * b + 4.69891013 * a))));\n\n  const t =\n    0.11239642 +\n    1.0 /\n      (1.6132032 -\n        0.68124379 * b +\n        a *\n          (0.40370612 +\n            0.90148123 * b +\n            a *\n              (-0.27087943 +\n                0.6122399 * b +\n                a * (0.00299215 - 0.45399568 * b - 0.14661872 * a))));\n\n  return [s, t];\n};\n\nconst getCs = (\n  L: number,\n  a: number,\n  b: number,\n  cusp: [number, number],\n): [number, number, number] => {\n  const cMax = findGamutIntersectionOKLCH(a, b, L, 1, L, cusp);\n  const stMax = computeSt(cusp);\n\n  const k = cMax / Math.min(L * stMax[0], (1 - L) * stMax[1]);\n\n  const stMid = computeStMid(a, b);\n\n  let ca = L * stMid[0];\n  let cb = (1.0 - L) * stMid[1];\n  const cMid =\n    0.9 * k * Math.sqrt(Math.sqrt(1.0 / (1.0 / ca ** 4 + 1.0 / cb ** 4)));\n\n  ca = L * 0.4;\n  cb = (1.0 - L) * 0.8;\n  const c0 = Math.sqrt(1.0 / (1.0 / ca ** 2 + 1.0 / cb ** 2));\n\n  return [c0, cMid, cMax];\n};\n\nconst OKHSLToOKLab = (hsl: Vec3): Vec3 => {\n  let h = hsl[0];\n  const s = hsl[1];\n  const l = hsl[2];\n\n  let L = toeInv(l);\n  let a = 0;\n  let b = 0;\n\n  h = constrainAngle(h) / 360.0;\n\n  if (L !== 0.0 && L !== 1.0 && s !== 0) {\n    const a_ = Math.cos(TAU * h);\n    const b_ = Math.sin(TAU * h);\n\n    const cusp = findCuspOKLCH(a_, b_);\n    const Cs = getCs(L, a_, b_, cusp);\n    const [c0, cMid, cMax] = Cs;\n\n    const mid = 0.8;\n    const midInv = 1.25;\n    let t: number, k0: number, k1: number, k2: number;\n\n    if (s < mid) {\n      t = midInv * s;\n      k0 = 0.0;\n      k1 = mid * c0;\n      k2 = 1.0 - k1 / cMid;\n    } else {\n      t = 5 * (s - 0.8);\n      k0 = cMid;\n      k1 = (0.2 * cMid ** 2 * 1.25 ** 2) / c0;\n      k2 = 1.0 - k1 / (cMax - cMid);\n    }\n\n    const c = k0 + (t * k1) / (1.0 - k2 * t);\n\n    a = c * a_;\n    b = c * b_;\n  }\n\n  return [L, a, b];\n};\n\n// ============================================================================\n// OKHSL to sRGB Conversion\n// ============================================================================\n\nconst okhslToSRGB = (h: number, s: number, l: number): Vec3 => {\n  // h: 0-360, s: 0-1, l: 0-1\n  const oklab = OKHSLToOKLab([h, s, l]);\n  const linearRGB = OKLabToLinearSRGB(oklab);\n\n  // Apply gamma correction and clamp\n  return [\n    clamp(sRGBLinearToGamma(linearRGB[0]), 0, 1),\n    clamp(sRGBLinearToGamma(linearRGB[1]), 0, 1),\n    clamp(sRGBLinearToGamma(linearRGB[2]), 0, 1),\n  ];\n};\n\n// ============================================================================\n// Parsing Utilities\n// ============================================================================\n\n/**\n * Parse an angle value with optional unit.\n * Supports: deg, turn, rad, or unitless (treated as degrees).\n */\nconst parseAngle = (value: string): number => {\n  const match = value.match(/^([+-]?\\d*\\.?\\d+)(deg|turn|rad)?$/);\n  if (!match) return 0;\n\n  const num = parseFloat(match[1]);\n  const unit = match[2];\n\n  switch (unit) {\n    case 'turn':\n      return num * 360;\n    case 'rad':\n      return (num * 180) / Math.PI;\n    case 'deg':\n    default:\n      return num;\n  }\n};\n\n/**\n * Parse a percentage value (e.g., \"50%\") to a 0-1 range.\n */\nconst parsePercentage = (value: string): number => {\n  const match = value.match(/^([+-]?\\d*\\.?\\d+)%?$/);\n  if (!match) return 0;\n\n  const num = parseFloat(match[1]);\n  // If the value includes %, divide by 100, otherwise assume 0-1 range\n  return value.includes('%') ? num / 100 : num;\n};\n\n// ============================================================================\n// Plugin Implementation\n// ============================================================================\n\n/**\n * The okhsl function handler for tasty parser.\n * Receives parsed style groups and returns an RGB color string.\n */\nconst okhslFunc = (groups: StyleDetails[]): string => {\n  // We expect a single group with 3 values: H, S, L\n  if (groups.length === 0 || groups[0].all.length < 3) {\n    console.warn('[okhsl] Expected 3 values (H S L), got:', groups);\n    return 'rgb(0% 0% 0%)';\n  }\n\n  const tokens = groups[0].all;\n\n  // Create cache key from input tokens\n  const cacheKey = tokens.slice(0, 3).join(' ');\n  const cached = conversionCache.get(cacheKey);\n  if (cached) return cached;\n\n  const h = parseAngle(tokens[0]);\n  const s = parsePercentage(tokens[1]);\n  const l = parsePercentage(tokens[2]);\n\n  const [r, g, b] = okhslToSRGB(h, clamp(s, 0, 1), clamp(l, 0, 1));\n\n  // Return as rgb() with percentage syntax for best compatibility\n  const format = (n: number): string => {\n    const pct = n * 100;\n    return parseFloat(pct.toFixed(1)).toString() + '%';\n  };\n  const result = `rgb(${format(r)} ${format(g)} ${format(b)})`;\n\n  conversionCache.set(cacheKey, result);\n  return result;\n};\n\n/**\n * OKHSL Plugin for Tasty.\n *\n * Adds support for the `okhsl()` color function in tasty styles.\n *\n * @example\n * ```ts\n * import { configure } from '@cube-dev/ui-kit';\n * import { okhslPlugin } from '@cube-dev/ui-kit/tasty/plugins';\n *\n * configure({\n *   plugins: [okhslPlugin()],\n * });\n *\n * // Now you can use okhsl in styles:\n * const Box = tasty({\n *   styles: {\n *     fill: 'okhsl(240 50% 50%)',\n *   },\n * });\n * ```\n */\nexport const okhslPlugin: TastyPluginFactory = (): TastyPlugin => ({\n  name: 'okhsl',\n  funcs: {\n    okhsl: okhslFunc,\n  },\n});\n\n// Export the raw function for direct use if needed\nexport { okhslFunc };\n"],"mappings":";;;;;;;;;;;;;;;;;;AAqBA,MAAM,kBAAkB,IAAI,IAAoB,IAAI;AAMpD,MAAM,iBAA6C;CACjD;EAAC;EAAK;EAAoB;EAAmB;CAC7C;EAAC;EAAK;EAAqB;EAAoB;CAC/C;EAAC;EAAK;EAAqB;EAAoB;CAChD;AAED,MAAM,uBAAmD;CACvD;EAAC;EAAmB;EAAoB;EAAmB;CAC3D;EAAC;EAAqB;EAAoB;EAAoB;CAC9D;EAAC;EAAuB;EAAoB;EAAmB;CAChE;AAED,MAAM,oCAIF;CACF,CACE,CAAC,qBAAqB,mBAAoB,EAC1C;EAAC;EAAY;EAAY;EAAY;EAAY;EAAW,CAC7D;CACD,CACE,CAAC,oBAAoB,mBAAmB,EACxC;EAAC;EAAY;EAAa;EAAY;EAAY;EAAY,CAC/D;CACD,CACE,CAAC,oBAAqB,kBAAkB,EACxC;EAAC;EAAY;EAAa;EAAY;EAAa;EAAW,CAC/D;CACF;AAMD,MAAM,MAAM,IAAI,KAAK;AAErB,MAAM,SAAS,OAAe,KAAa,QACzC,KAAK,IAAI,KAAK,IAAI,OAAO,IAAI,EAAE,IAAI;AAErC,MAAM,kBAAkB,WAA4B,QAAQ,MAAO,OAAO;AAY1E,MAAM,qBAAqB,QAAwB;CACjD,MAAM,OAAO,MAAM,IAAI,KAAK;CAC5B,MAAM,MAAM,KAAK,IAAI,IAAI;AACzB,QAAO,MAAM,WACT,QAAQ,QAAQ,KAAK,IAAI,KAAK,IAAI,IAAI,GAAG,QACzC,QAAQ;;AASd,MAAM,QAAQ,GAAS,MACrB,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE;AAEvC,MAAM,aAAa,OAAa,WAAyB;CACvD,KAAK,OAAO,OAAO,GAAG;CACtB,KAAK,OAAO,OAAO,GAAG;CACtB,KAAK,OAAO,OAAO,GAAG;CACvB;AAED,MAAM,UAAU,QAAoB;CAClC,IAAI,KAAK,IAAI,KAAK,IAAI;CACtB,IAAI,KAAK,IAAI,KAAK,IAAI;CACtB,IAAI,KAAK,IAAI,KAAK,IAAI;CACvB;AAMD,MAAM,qBAAqB,QAAoB;AAG7C,QAAO,UADU,OADL,UAAU,KAAK,eAAe,CACd,EACD,qBAAqB;;AAOlD,MAAM,KAAK;AACX,MAAM,KAAK;AACX,MAAM,MAAM,IAAM,OAAO,IAAM;AAM/B,MAAM,UAAU,OAAuB,KAAK,IAAI,KAAK,MAAM,MAAM,IAAI;AAErE,MAAM,SAAS,GAAqB,MAClC,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE;AAEzB,MAAM,4BAA4B,GAAW,MAAsB;CACjE,MAAM,UAAU;CAChB,MAAM,WAAW;CACjB,MAAM,OAAyB,CAAC,GAAG,EAAE;CACrC,MAAM,OAAa;EAAC;EAAG;EAAG;EAAE;CAE5B,IAAI;CACJ,IAAI;AAEJ,KAAI,MAAM,QAAQ,GAAG,IAAI,KAAK,GAAG,GAAG;AAClC,cAAY,QAAQ,GAAG;AACvB,YAAU,SAAS;YACV,MAAM,QAAQ,GAAG,IAAI,KAAK,GAAG,GAAG;AACzC,cAAY,QAAQ,GAAG;AACvB,YAAU,SAAS;QACd;AACL,cAAY,QAAQ,GAAG;AACvB,YAAU,SAAS;;CAGrB,MAAM,CAAC,IAAI,IAAI,IAAI,IAAI,MAAM;CAC7B,MAAM,CAAC,IAAI,IAAI,MAAM;CAErB,IAAI,MAAM,KAAK,KAAK,IAAI,KAAK,IAAI,MAAM,IAAI,KAAK,KAAK,IAAI;CAEzD,MAAM,SAAS,KAAW,QACxB,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI;CAEjC,MAAM,KAAK,MAAM,eAAe,IAAI,KAAK;CACzC,MAAM,KAAK,MAAM,eAAe,IAAI,KAAK;CACzC,MAAM,KAAK,MAAM,eAAe,IAAI,KAAK;CAEzC,IAAI,KAAK,IAAM,MAAM;CACrB,IAAI,KAAK,IAAM,MAAM;CACrB,IAAI,KAAK,IAAM,MAAM;CAErB,MAAM,IAAI,KAAK,KAAK;CACpB,MAAM,IAAI,KAAK,KAAK;CACpB,MAAM,IAAI,KAAK,KAAK;CAEpB,MAAM,MAAM,IAAM,MAAM,KAAK;CAC7B,MAAM,MAAM,IAAM,MAAM,KAAK;CAC7B,MAAM,MAAM,IAAM,MAAM,KAAK;CAE7B,MAAM,OAAO,KAAO,KAAK,MAAM;CAC/B,MAAM,OAAO,KAAO,KAAK,MAAM;CAC/B,MAAM,OAAO,KAAO,KAAK,MAAM;CAE/B,MAAM,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK;CACjC,MAAM,KAAK,KAAK,MAAM,KAAK,MAAM,KAAK;CACtC,MAAM,KAAK,KAAK,OAAO,KAAK,OAAO,KAAK;AAExC,OAAM,MAAO,IAAI,MAAO,KAAK,KAAK,KAAM,IAAI;AAE5C,QAAO;;AAGT,MAAM,iBAAiB,GAAW,MAAgC;CAEhE,MAAM,SAAS,yBAAyB,GAAG,EAAE;CAG7C,MAAM,aAAa,kBADD;EAAC;EAAG,SAAS;EAAG,SAAS;EAAE,CACJ;CAEzC,MAAM,SAAS,KAAK,KAClB,IACE,KAAK,IACH,KAAK,IAAI,WAAW,IAAI,WAAW,GAAG,EACtC,KAAK,IAAI,WAAW,IAAI,EAAI,CAC7B,CACJ;AAGD,QAAO,CAAC,QAFO,SAAS,OAED;;AAGzB,MAAM,8BACJ,GACA,GACA,IACA,IACA,IACA,SACW;CACX,MAAM,WAAW;CACjB,MAAM,OAAa;EAAC;EAAG;EAAG;EAAE;CAC5B,MAAM,WAAW,OAAO;CAExB,IAAI;CAEJ,MAAM,SAAS,KAAW,QACxB,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI;CACjC,MAAM,UAAU,KAAW,GAAW,GAAW,MAC/C,IAAI,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK;AAErC,MAAK,KAAK,MAAM,KAAK,MAAM,KAAK,KAAK,MAAM,MAAM,GAAK;EACpD,MAAM,QAAQ,KAAK,KAAK,KAAK,KAAK,MAAM,KAAK;AAC7C,MAAI,UAAU,IAAI,IAAK,KAAK,KAAK,KAAM;QAClC;EACL,MAAM,QAAQ,MAAM,KAAK,KAAK,KAAO,KAAK,MAAM,KAAK;AACrD,MAAI,UAAU,IAAI,IAAK,KAAK,MAAM,KAAK,KAAQ;EAE/C,MAAM,KAAK,KAAK;EAChB,MAAM,KAAK;EAEX,MAAM,KAAK,MAAM,eAAe,IAAI,KAAK;EACzC,MAAM,KAAK,MAAM,eAAe,IAAI,KAAK;EACzC,MAAM,KAAK,MAAM,eAAe,IAAI,KAAK;EAEzC,MAAM,OAAO,KAAK,KAAK;EACvB,MAAM,OAAO,KAAK,KAAK;EACvB,MAAM,OAAO,KAAK,KAAK;EAEvB,MAAM,IAAI,MAAM,IAAM,KAAK,IAAI;EAC/B,MAAM,IAAI,IAAI;EAEd,MAAM,KAAK,IAAI,IAAI;EACnB,MAAM,KAAK,IAAI,IAAI;EACnB,MAAM,KAAK,IAAI,IAAI;EAEnB,MAAM,IAAI,KAAK,KAAK;EACpB,MAAM,IAAI,KAAK,KAAK;EACpB,MAAM,IAAI,KAAK,KAAK;EAEpB,MAAM,MAAM,IAAI,OAAO,KAAK;EAC5B,MAAM,MAAM,IAAI,OAAO,KAAK;EAC5B,MAAM,MAAM,IAAI,OAAO,KAAK;EAE5B,MAAM,OAAO,IAAI,OAAO,OAAO;EAC/B,MAAM,OAAO,IAAI,OAAO,OAAO;EAC/B,MAAM,OAAO,IAAI,OAAO,OAAO;EAE/B,MAAM,KAAK,OAAO,SAAS,IAAI,GAAG,GAAG,EAAE,GAAG;EAC1C,MAAM,KAAK,OAAO,SAAS,IAAI,KAAK,KAAK,IAAI;EAC7C,MAAM,KAAK,OAAO,SAAS,IAAI,MAAM,MAAM,KAAK;EAEhD,MAAM,KAAK,MAAM,KAAK,KAAK,KAAM,KAAK;EACtC,IAAI,KAAK,CAAC,KAAK;EAEf,MAAM,KAAK,OAAO,SAAS,IAAI,GAAG,GAAG,EAAE,GAAG;EAC1C,MAAM,KAAK,OAAO,SAAS,IAAI,KAAK,KAAK,IAAI;EAC7C,MAAM,KAAK,OAAO,SAAS,IAAI,MAAM,MAAM,KAAK;EAEhD,MAAM,KAAK,MAAM,KAAK,KAAK,KAAM,KAAK;EACtC,IAAI,KAAK,CAAC,KAAK;EAEf,MAAM,KAAK,OAAO,SAAS,IAAI,GAAG,GAAG,EAAE,GAAG;EAC1C,MAAM,KAAK,OAAO,SAAS,IAAI,KAAK,KAAK,IAAI;EAC7C,MAAM,KAAK,OAAO,SAAS,IAAI,MAAM,MAAM,KAAK;EAEhD,MAAM,KAAK,MAAM,KAAK,KAAK,KAAM,KAAK;EACtC,IAAI,KAAK,CAAC,KAAK;AAEf,OAAK,MAAM,IAAM,KAAK;AACtB,OAAK,MAAM,IAAM,KAAK;AACtB,OAAK,MAAM,IAAM,KAAK;AAEtB,OAAK,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,GAAG,CAAC;;AAGrC,QAAO;;AAGT,MAAM,aAAa,SAA6C;CAC9D,MAAM,IAAI,KAAK;CACf,MAAM,IAAI,KAAK;AACf,QAAO,CAAC,IAAI,GAAG,KAAK,IAAI,GAAG;;AAG7B,MAAM,gBAAgB,GAAW,MAAgC;AA2B/D,QAAO,CAzBL,YACA,KACG,YACC,YAAY,IACZ,KACG,cACC,aAAa,IACb,KACG,cACC,cAAc,IACd,KAAK,cAAc,aAAa,IAAI,aAAa,OAG7D,YACA,KACG,YACC,YAAa,IACb,KACG,YACC,YAAa,IACb,KACG,aACC,WAAY,IACZ,KAAK,YAAa,YAAa,IAAI,YAAa,MAEjD;;AAGf,MAAM,SACJ,GACA,GACA,GACA,SAC6B;CAC7B,MAAM,OAAO,2BAA2B,GAAG,GAAG,GAAG,GAAG,GAAG,KAAK;CAC5D,MAAM,QAAQ,UAAU,KAAK;CAE7B,MAAM,IAAI,OAAO,KAAK,IAAI,IAAI,MAAM,KAAK,IAAI,KAAK,MAAM,GAAG;CAE3D,MAAM,QAAQ,aAAa,GAAG,EAAE;CAEhC,IAAI,KAAK,IAAI,MAAM;CACnB,IAAI,MAAM,IAAM,KAAK,MAAM;CAC3B,MAAM,OACJ,KAAM,IAAI,KAAK,KAAK,KAAK,KAAK,KAAO,IAAM,MAAM,IAAI,IAAM,MAAM,GAAG,CAAC;AAEvE,MAAK,IAAI;AACT,OAAM,IAAM,KAAK;AAGjB,QAAO;EAFI,KAAK,KAAK,KAAO,IAAM,MAAM,IAAI,IAAM,MAAM,GAAG;EAE/C;EAAM;EAAK;;AAGzB,MAAM,gBAAgB,QAAoB;CACxC,IAAI,IAAI,IAAI;CACZ,MAAM,IAAI,IAAI;CACd,MAAM,IAAI,IAAI;CAEd,IAAI,IAAI,OAAO,EAAE;CACjB,IAAI,IAAI;CACR,IAAI,IAAI;AAER,KAAI,eAAe,EAAE,GAAG;AAExB,KAAI,MAAM,KAAO,MAAM,KAAO,MAAM,GAAG;EACrC,MAAM,KAAK,KAAK,IAAI,MAAM,EAAE;EAC5B,MAAM,KAAK,KAAK,IAAI,MAAM,EAAE;EAI5B,MAAM,CAAC,IAAI,MAAM,QADN,MAAM,GAAG,IAAI,IADX,cAAc,IAAI,GAAG,CACD;EAGjC,MAAM,MAAM;EACZ,MAAM,SAAS;EACf,IAAI,GAAW,IAAY,IAAY;AAEvC,MAAI,IAAI,KAAK;AACX,OAAI,SAAS;AACb,QAAK;AACL,QAAK,MAAM;AACX,QAAK,IAAM,KAAK;SACX;AACL,OAAI,KAAK,IAAI;AACb,QAAK;AACL,QAAM,KAAM,QAAQ,IAAI,QAAQ,IAAK;AACrC,QAAK,IAAM,MAAM,OAAO;;EAG1B,MAAM,IAAI,KAAM,IAAI,MAAO,IAAM,KAAK;AAEtC,MAAI,IAAI;AACR,MAAI,IAAI;;AAGV,QAAO;EAAC;EAAG;EAAG;EAAE;;AAOlB,MAAM,eAAe,GAAW,GAAW,MAAoB;CAG7D,MAAM,YAAY,kBADJ,aAAa;EAAC;EAAG;EAAG;EAAE,CAAC,CACK;AAG1C,QAAO;EACL,MAAM,kBAAkB,UAAU,GAAG,EAAE,GAAG,EAAE;EAC5C,MAAM,kBAAkB,UAAU,GAAG,EAAE,GAAG,EAAE;EAC5C,MAAM,kBAAkB,UAAU,GAAG,EAAE,GAAG,EAAE;EAC7C;;;;;;AAWH,MAAM,cAAc,UAA0B;CAC5C,MAAM,QAAQ,MAAM,MAAM,oCAAoC;AAC9D,KAAI,CAAC,MAAO,QAAO;CAEnB,MAAM,MAAM,WAAW,MAAM,GAAG;AAGhC,SAFa,MAAM,IAEnB;EACE,KAAK,OACH,QAAO,MAAM;EACf,KAAK,MACH,QAAQ,MAAM,MAAO,KAAK;EAE5B,QACE,QAAO;;;;;;AAOb,MAAM,mBAAmB,UAA0B;CACjD,MAAM,QAAQ,MAAM,MAAM,uBAAuB;AACjD,KAAI,CAAC,MAAO,QAAO;CAEnB,MAAM,MAAM,WAAW,MAAM,GAAG;AAEhC,QAAO,MAAM,SAAS,IAAI,GAAG,MAAM,MAAM;;;;;;AAW3C,MAAM,aAAa,WAAmC;AAEpD,KAAI,OAAO,WAAW,KAAK,OAAO,GAAG,IAAI,SAAS,GAAG;AACnD,UAAQ,KAAK,2CAA2C,OAAO;AAC/D,SAAO;;CAGT,MAAM,SAAS,OAAO,GAAG;CAGzB,MAAM,WAAW,OAAO,MAAM,GAAG,EAAE,CAAC,KAAK,IAAI;CAC7C,MAAM,SAAS,gBAAgB,IAAI,SAAS;AAC5C,KAAI,OAAQ,QAAO;CAEnB,MAAM,IAAI,WAAW,OAAO,GAAG;CAC/B,MAAM,IAAI,gBAAgB,OAAO,GAAG;CACpC,MAAM,IAAI,gBAAgB,OAAO,GAAG;CAEpC,MAAM,CAAC,GAAG,GAAG,KAAK,YAAY,GAAG,MAAM,GAAG,GAAG,EAAE,EAAE,MAAM,GAAG,GAAG,EAAE,CAAC;CAGhE,MAAM,UAAU,MAAsB;EACpC,MAAM,MAAM,IAAI;AAChB,SAAO,WAAW,IAAI,QAAQ,EAAE,CAAC,CAAC,UAAU,GAAG;;CAEjD,MAAM,SAAS,OAAO,OAAO,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC;AAE1D,iBAAgB,IAAI,UAAU,OAAO;AACrC,QAAO;;;;;;;;;;;;;;;;;;;;;;;;AAyBT,MAAa,qBAAsD;CACjE,MAAM;CACN,OAAO,EACL,OAAO,WACR;CACF"}

package/dist/tasty/plugins/types.d.ts

@@ -0,0 +1,72 @@
+
+import { StyleDetails, UnitHandler } from "../parser/types.js";
+import { StyleHandlerDefinition } from "../utils/styles.js";
+import { RecipeStyles } from "../styles/types.js";
+
+//#region src/tasty/plugins/types.d.ts
+/**
+ * A tasty plugin that extends the style system with custom functions, units, states, or handlers.
+ */
+interface TastyPlugin {
+  /** Unique name for the plugin (used for debugging and conflict detection) */
+  name: string;
+  /** Custom functions that transform parsed style groups into CSS values */
+  funcs?: Record<string, (groups: StyleDetails[]) => string>;
+  /** Custom units that transform numeric values (e.g., `2x` → `calc(2 * var(--gap))`) */
+  units?: Record<string, string | UnitHandler>;
+  /** Custom state aliases (e.g., `'@mobile': '@media(w < 768px)'`) */
+  states?: Record<string, string>;
+  /**
+   * Custom style handlers that transform style properties into CSS declarations.
+   * Handlers replace built-in handlers for the same style name.
+   * @example
+   * ```ts
+   * handlers: {
+   *   // Simple handler - lookup style inferred from key
+   *   fill: ({ fill }) => fill ? { 'background-color': fill } : undefined,
+   *   // Multi-property handler
+   *   spacing: [['gap', 'padding'], ({ gap, padding }) => ({ ... })],
+   * }
+   * ```
+   */
+  handlers?: Record<string, StyleHandlerDefinition>;
+  /** Predefined tokens replaced during style parsing (`$name` or `#name`) */
+  tokens?: {
+    [key: `$${string}` | `#${string}`]: string | number;
+  };
+  /**
+   * Predefined style recipes -- named style bundles that can be applied via `recipe` style property.
+   * Recipe values are flat tasty styles (no sub-element keys).
+   * @example
+   * ```ts
+   * recipes: {
+   *   card: { padding: '4x', fill: '#surface', radius: '1r', border: true },
+   *   elevated: { shadow: '2x 2x 4x #shadow' },
+   * }
+   * ```
+   */
+  recipes?: Record<string, RecipeStyles>;
+}
+/**
+ * A factory function that creates a TastyPlugin.
+ * Can optionally accept configuration options.
+ *
+ * @example
+ * ```ts
+ * // Plugin without options
+ * const okhslPlugin: TastyPluginFactory = () => ({
+ *   name: 'okhsl',
+ *   funcs: { okhsl: okhslFunc },
+ * });
+ *
+ * // Plugin with options
+ * const debugPlugin: TastyPluginFactory<{ verbose: boolean }> = (options) => ({
+ *   name: 'debug',
+ *   funcs: { debug: createDebugFunc(options.verbose) },
+ * });
+ * ```
+ */
+type TastyPluginFactory<TOptions = void> = TOptions extends void ? () => TastyPlugin : (options: TOptions) => TastyPlugin;
+//#endregion
+export { TastyPlugin, TastyPluginFactory };
+//# sourceMappingURL=types.d.ts.map