@pandacss/transformer 2.0.0-beta.19 → 2.0.0-beta.20

package/dist/index.js

@@ -42,400 +42,207 @@ function getMergeKey(className, separator) {
   const propStart = lastColon + 1;
   const sepIdx = className.indexOf(separator, propStart);
   if (sepIdx < propStart + 1 || sepIdx >= end) return null;
-  const property = className.slice(propStart, sepIdx);
-  if (lastColon === -1) return property;
-  return `${className.slice(0, lastColon)}:${property}`;
+  return className.slice(0, sepIdx);
+}
+var CACHE_LIMIT = 2048;
+var CHAR_SPACE = 32;
+var CHAR_BANG = 33;
+var FIELDS = 4;
+function createCache(limit = CACHE_LIMIT) {
+  let size = 0;
+  let current = /* @__PURE__ */ new Map();
+  let previous = /* @__PURE__ */ new Map();
+  const set = (key, value) => {
+    current.set(key, value);
+    if (++size > limit) {
+      size = 0;
+      previous = current;
+      current = /* @__PURE__ */ new Map();
+    }
+  };
+  return {
+    get(key) {
+      let value = current.get(key);
+      if (value === void 0 && (value = previous.get(key)) !== void 0) set(key, value);
+      return value;
+    },
+    set
+  };
 }
-function flattenParts(parts, out) {
-  for (const part of parts) {
-    if (!part) continue;
-    if (Array.isArray(part)) {
-      flattenParts(part, out);
+function scanPart(part, separator, out, offset) {
+  let count = 0;
+  let clean = part.length > 0;
+  let start = 0;
+  for (let i = 0; i <= part.length; i++) {
+    const code = i === part.length ? CHAR_SPACE : part.charCodeAt(i);
+    if (code !== CHAR_SPACE && (code < 9 || code > 13)) continue;
+    if (code !== CHAR_SPACE || i === start) clean = false;
+    if (i === start) {
+      start = i + 1;
       continue;
     }
-    if (part === "") continue;
-    out.push(part);
-  }
-}
-function mergeClassStrings(separator, classes) {
-  const seen = /* @__PURE__ */ new Map();
-  const order = [];
-  let id = 0;
-  for (const cls of classes) {
-    let tokenStart = 0;
-    for (let i = 0; i <= cls.length; i++) {
-      if (i !== cls.length && cls.charCodeAt(i) !== 32) continue;
-      if (i === tokenStart) {
-        tokenStart = i + 1;
-        continue;
-      }
-      const token = cls.slice(tokenStart, i);
-      tokenStart = i + 1;
-      const key = getMergeKey(token, separator);
-      if (key !== null) {
-        if (!seen.has(key)) order.push(key);
-        seen.set(key, token);
-      } else {
-        const uniqueKey = `__${id++}`;
-        order.push(uniqueKey);
-        seen.set(uniqueKey, token);
-      }
+    const at = offset + count * FIELDS;
+    count++;
+    out[at] = start;
+    out[at + 1] = i;
+    out[at + 2] = -1;
+    let end = i;
+    if (part.charCodeAt(end - 1) === CHAR_BANG) end--;
+    let depth = 0;
+    let propStart = start;
+    for (let c = start; c < end; c++) {
+      const code2 = part.charCodeAt(c);
+      if (code2 === CHAR_OPEN_BRACKET) depth++;
+      else if (code2 === CHAR_CLOSE_BRACKET) depth--;
+      else if (code2 === CHAR_COLON && depth === 0) propStart = c + 1;
     }
+    const sep = part.indexOf(separator, propStart);
+    if (sep > propStart && sep < end) {
+      let hash = 2166136261;
+      for (let c = start; c < sep; c++) hash = Math.imul(hash ^ part.charCodeAt(c), 16777619);
+      out[at + 2] = sep;
+      out[at + 3] = hash;
+    }
+    start = i + 1;
   }
-  if (order.length === 0) return "";
-  if (order.length === 1) return seen.get(order[0]);
-  let str = seen.get(order[0]);
-  for (let i = 1; i < order.length; i++) {
-    str += ` ${seen.get(order[i])}`;
-  }
-  return str;
+  return clean ? count : -count;
 }
 function createCx(options = {}) {
   const separator = options.separator ?? bakedSeparator;
-  return function cx2(...parts) {
-    if (parts.length === 1) {
-      const only = parts[0];
-      if (typeof only === "string") return only;
-      if (!only) return "";
-    }
-    const flat = [];
-    flattenParts(parts, flat);
-    if (flat.length === 0) return "";
-    if (flat.length === 1) return flat[0];
-    return mergeClassStrings(separator, flat);
-  };
-}
-var cx = createCx();
-
-// src/runtime/internal/css.ts
-function css(...styles) {
-  return cx(...styles);
-}
-
-// src/runtime/internal/shared.ts
-function withDefaults(defaults, props) {
-  const out = { ...defaults };
-  for (const key in props) {
-    if (props[key] !== void 0) out[key] = props[key];
-  }
-  return out;
-}
-function splitVariantProps(props, variantKeySet) {
-  const rest = {};
-  const variantProps = {};
-  for (const key in props) {
-    if (variantKeySet.has(key)) variantProps[key] = props[key];
-    else rest[key] = props[key];
-  }
-  return [rest, variantProps];
-}
-function toVariantMap(variants) {
-  const map = {};
-  for (const key in variants) map[key] = Object.keys(variants[key] ?? {});
-  return map;
-}
-function compoundMatches(compound, variants) {
-  for (const key in compound) {
-    if (key === "css" || key === "className" || key === "classNames") continue;
-    const expected = compound[key];
-    const actual = variants[key];
-    if (Array.isArray(expected)) {
-      if (!expected.includes(actual)) return false;
-    } else if (actual !== expected) {
-      return false;
-    }
-  }
-  return true;
-}
-function variantClass(variants, key, value) {
-  if (value == null) return void 0;
-  const cls = variants[key]?.[value];
-  return typeof cls === "string" && cls ? cls : void 0;
-}
-function memoProps(resolve) {
-  const cache = /* @__PURE__ */ new Map();
-  let lastKey = "";
-  let lastValue;
-  let hasLast = false;
-  return (props = {}) => {
-    let key = "";
-    for (const k in props) {
-      const value = props[k];
-      if (value !== void 0) key += `${k}:${String(value)}|`;
-    }
-    if (hasLast && key === lastKey) return lastValue;
-    const hit = cache.get(key);
-    if (hit !== void 0) {
-      lastKey = key;
-      lastValue = hit;
-      hasLast = true;
-      return hit;
-    }
-    const out = resolve(props);
-    cache.set(key, out);
-    if (cache.size > 500) cache.delete(cache.keys().next().value);
-    lastKey = key;
-    lastValue = out;
-    hasLast = true;
-    return out;
-  };
-}
-function joinClasses(parts) {
-  if (parts.length === 0) return "";
-  if (parts.length === 1) return parts[0];
-  return cx(...parts);
-}
-function isBooleanBranch(branch) {
-  if (!branch) return false;
-  const keys = Object.keys(branch);
-  return keys.length === 1 && keys[0] === "true" && typeof branch.true === "string";
-}
-function booleanKeys(variants, keys, defaults, hasCompounds) {
-  if (hasCompounds || keys.length === 0 || keys.length > 12) return void 0;
-  for (const key of keys) {
-    if (!isBooleanBranch(variants[key])) return void 0;
+  const scanned = createCache();
+  const seenOnce = createCache(512);
+  const parts = [];
+  let tokens = new Int32Array(64 * FIELDS);
+  let tokenPart = new Int32Array(64);
+  let winner = new Int32Array(64);
+  let tableSize = 128;
+  let table = new Int32Array(tableSize);
+  let stamps = new Int32Array(tableSize);
+  let stamp = 0;
+  function collect(value) {
+    if (!value) return;
+    if (typeof value === "string") parts.push(value);
+    else for (let i = 0; i < value.length; i++) collect(value[i]);
   }
-  for (const key in defaults) {
-    if (!keys.includes(key)) return void 0;
-    const value = defaults[key];
-    if (value !== true && value !== false && value !== "true" && value !== "false") return void 0;
+  function reserve(tokenCount) {
+    if (tokenCount <= tokenPart.length) return;
+    let size = tokenPart.length;
+    while (size < tokenCount) size *= 2;
+    const grow = (from, length) => {
+      const next = new Int32Array(length);
+      next.set(from);
+      return next;
+    };
+    tokens = grow(tokens, size * FIELDS);
+    tokenPart = grow(tokenPart, size);
+    winner = grow(winner, size);
   }
-  return keys;
-}
-function selectsTrue(value) {
-  return value === true || value === "true";
-}
-function booleanBitset(base, variants, keys, defaults, hasCompounds) {
-  const boolKeys = booleanKeys(variants, keys, defaults, hasCompounds);
-  if (!boolKeys) return void 0;
-  const n = boolKeys.length;
-  let defaultMask = 0;
-  for (let i = 0; i < n; i++) {
-    if (selectsTrue(defaults[boolKeys[i]])) defaultMask |= 1 << i;
-  }
-  const table = new Array(1 << n);
-  const build = (mask) => {
-    const parts = [];
-    if (base) parts.push(base);
-    for (let i = 0; i < n; i++) {
-      if (mask & 1 << i) parts.push(variants[boolKeys[i]].true);
-    }
-    return joinClasses(parts);
-  };
-  return (props = {}) => {
-    let mask = defaultMask;
-    for (let i = 0; i < n; i++) {
-      const value = props[boolKeys[i]];
-      if (value === void 0) continue;
-      if (selectsTrue(value)) mask |= 1 << i;
-      else mask &= ~(1 << i);
-    }
-    return table[mask] ??= build(mask);
-  };
-}
-var MAX_VARIANT_STATES = 4096;
-function optionIndex(options) {
-  const index = /* @__PURE__ */ new Map();
-  for (let i = 0; i < options.length; i++) {
-    const option = options[i];
-    const slot = i + 1;
-    index.set(option, slot);
-    if (option === "true") index.set(true, slot);
-    else if (option === "false") index.set(false, slot);
-    else {
-      const numeric = Number(option);
-      if (option !== "" && !Number.isNaN(numeric)) index.set(numeric, slot);
+  function sameKey(a, b) {
+    const aStart = tokens[a * FIELDS];
+    const bStart = tokens[b * FIELDS];
+    const length = tokens[a * FIELDS + 2] - aStart;
+    if (tokens[b * FIELDS + 2] - bStart !== length) return false;
+    const left = parts[tokenPart[a]];
+    const right = parts[tokenPart[b]];
+    for (let i = 0; i < length; i++) {
+      if (left.charCodeAt(aStart + i) !== right.charCodeAt(bStart + i)) return false;
     }
+    return true;
   }
-  return index;
-}
-function variantTable(base, variants, keys, defaults, hasCompounds) {
-  if (hasCompounds || keys.length === 0) return void 0;
-  const slots = [];
-  let states = 1;
-  for (const key of keys) {
-    const options = Object.keys(variants[key] ?? {});
-    if (options.length === 0) return void 0;
-    slots.push({ key, options, index: optionIndex(options), radix: options.length + 1, stride: states });
-    states *= options.length + 1;
-    if (states > MAX_VARIANT_STATES) return void 0;
-  }
-  let defaultState = 0;
-  for (const key in defaults) {
-    const slot = slots.find((candidate) => candidate.key === key);
-    if (!slot) return void 0;
-    const chosen = slot.index.get(defaults[key]);
-    if (chosen === void 0) return void 0;
-    defaultState += chosen * slot.stride;
-  }
-  const table = new Array(states);
-  const build = (state) => {
-    const parts = [];
-    if (base) parts.push(base);
-    for (const slot of slots) {
-      const chosen = Math.floor(state / slot.stride) % slot.radix;
-      if (chosen === 0) continue;
-      const cls = variants[slot.key][slot.options[chosen - 1]];
-      if (cls) parts.push(cls);
+  function merge() {
+    let count = 0;
+    let clean = true;
+    for (let p = 0; p < parts.length; p++) {
+      const part = parts[p];
+      const cached = scanned.get(part);
+      let partCount;
+      if (cached !== void 0) {
+        partCount = cached[0];
+        reserve(count + Math.abs(partCount));
+        const base = count * FIELDS;
+        for (let i = 1; i < cached.length; i++) tokens[base + i - 1] = cached[i];
+      } else {
+        reserve(count + part.length);
+        partCount = scanPart(part, separator, tokens, count * FIELDS);
+        if (seenOnce.get(part) === void 0) seenOnce.set(part, true);
+        else {
+          const record = new Int32Array(1 + Math.abs(partCount) * FIELDS);
+          record[0] = partCount;
+          record.set(tokens.subarray(count * FIELDS, (count + Math.abs(partCount)) * FIELDS), 1);
+          scanned.set(part, record);
+        }
+      }
+      if (partCount <= 0) clean = false;
+      const end = count + Math.abs(partCount);
+      for (; count < end; count++) tokenPart[count] = p;
     }
-    return joinClasses(parts);
-  };
-  return (props = {}) => {
-    let state = defaultState;
-    for (let i = 0; i < slots.length; i++) {
-      const slot = slots[i];
-      const value = props[slot.key];
-      if (value === void 0) continue;
-      const chosen = slot.index.get(value) ?? 0;
-      const current = Math.floor(state / slot.stride) % slot.radix;
-      state += (chosen - current) * slot.stride;
+    if (count * 2 > tableSize) {
+      while (count * 2 > tableSize) tableSize *= 2;
+      table = new Int32Array(tableSize);
+      stamps = new Int32Array(tableSize);
+      stamp = 0;
     }
-    return table[state] ??= build(state);
-  };
-}
-
-// src/runtime/internal/cva.ts
-function unionKeys(other, own) {
-  const keys = [...other];
-  for (const key of own) {
-    if (!keys.includes(key)) keys.push(key);
-  }
-  return keys;
-}
-function cva(config) {
-  const base = config.base ?? "";
-  const variants = config.variants ?? {};
-  const defaultVariants = config.defaultVariants ?? {};
-  const compoundVariants = config.compoundVariants ?? [];
-  const variantKeys = Object.keys(variants);
-  const variantKeySet = new Set(variantKeys);
-  const hasDefaults = Object.keys(defaultVariants).length > 0;
-  const hasCompounds = compoundVariants.length > 0;
-  const resolve = (props = {}) => {
-    const computed = hasDefaults ? withDefaults(defaultVariants, props) : props;
-    const parts = [];
-    if (base) parts.push(base);
-    for (const key of variantKeys) {
-      const cls = variantClass(variants, key, computed[key]);
-      if (cls) parts.push(cls);
+    if (++stamp === 2147483647) {
+      stamp = 1;
+      stamps.fill(0);
     }
-    if (hasCompounds) {
-      for (const compound of compoundVariants) {
-        if (!compoundMatches(compound, computed)) continue;
-        const cls = compound.className ?? compound.css;
-        if (typeof cls === "string" && cls) parts.push(cls);
+    const mask = tableSize - 1;
+    let replaced = false;
+    for (let t = 0; t < count; t++) {
+      winner[t] = t;
+      if (tokens[t * FIELDS + 2] < 0) continue;
+      const hash = tokens[t * FIELDS + 3];
+      let slot = hash & mask;
+      let owner = -1;
+      while (stamps[slot] === stamp) {
+        const candidate = table[slot];
+        if (tokens[candidate * FIELDS + 3] === hash && sameKey(candidate, t)) {
+          owner = candidate;
+          break;
+        }
+        slot = slot + 1 & mask;
       }
-    }
-    return joinClasses(parts);
-  };
-  const cvaFn = booleanBitset(base, variants, variantKeys, defaultVariants, hasCompounds) ?? variantTable(base, variants, variantKeys, defaultVariants, hasCompounds) ?? memoProps(resolve);
-  const merge = (other) => {
-    const override = other.config;
-    const overrideVariants = override.variants ?? {};
-    const mergedVariants = {};
-    for (const key of unionKeys(other.variantKeys, variantKeys)) {
-      const group = { ...variants[key] };
-      const theirs = overrideVariants[key] ?? {};
-      for (const option in theirs) {
-        const mine = group[option];
-        group[option] = mine ? cx(mine, theirs[option]) : theirs[option];
+      if (owner === -1) {
+        stamps[slot] = stamp;
+        table[slot] = t;
+      } else {
+        winner[owner] = t;
+        winner[t] = -1;
+        replaced = true;
       }
-      mergedVariants[key] = group;
     }
-    return cva({
-      base: cx(base, override.base),
-      variants: mergedVariants,
-      defaultVariants: { ...defaultVariants, ...override.defaultVariants },
-      compoundVariants: [...compoundVariants, ...override.compoundVariants ?? []]
-    });
-  };
-  return Object.assign(cvaFn, {
-    __cva__: true,
-    variantKeys,
-    variantMap: toVariantMap(variants),
-    raw: resolve,
-    merge,
-    config,
-    getVariantProps: (props) => withDefaults(defaultVariants, props),
-    splitVariantProps: (props) => splitVariantProps(props, variantKeySet)
-  });
-}
-
-// src/runtime/internal/sva.ts
-function variantsForSlot(variants, slot) {
-  if (!variants) return void 0;
-  const out = {};
-  for (const key in variants) {
-    const options = {};
-    for (const option in variants[key]) {
-      const value = variants[key][option];
-      const cls = typeof value === "string" ? value : value?.[slot];
-      if (cls) options[option] = cls;
+    if (!replaced && clean) {
+      let joined = parts[0];
+      for (let p = 1; p < parts.length; p++) joined += " " + parts[p];
+      return joined;
     }
-    out[key] = options;
-  }
-  return out;
-}
-function compoundsForSlot(compounds, slot) {
-  if (!compounds?.length) return void 0;
-  const out = [];
-  for (const compound of compounds) {
-    const next = {};
-    for (const key in compound) {
-      if (key === "css" || key === "className" || key === "classNames") continue;
-      next[key] = compound[key];
+    let result = "";
+    for (let t = 0; t < count; t++) {
+      const w = winner[t];
+      if (w === -1) continue;
+      const piece = parts[tokenPart[w]].slice(tokens[w * FIELDS], tokens[w * FIELDS + 1]);
+      result = result ? result + " " + piece : piece;
     }
-    const css2 = compound.css;
-    if (typeof css2 === "string") next.css = css2;
-    else if (css2 && typeof css2 === "object" && slot in css2) next.css = css2[slot];
-    const className = compound.classNames?.[slot] ?? compound.className;
-    if (className) next.className = className;
-    if (next.css || next.className) out.push(next);
-  }
-  return out.length ? out : void 0;
-}
-function sva(config) {
-  const slots = config.slots ?? Object.keys(config.base ?? {});
-  const defaultVariants = config.defaultVariants ?? {};
-  const variantKeys = Object.keys(config.variants ?? {});
-  const variantKeySet = new Set(variantKeys);
-  const slotFns = slots.map((slot) => {
-    let base = config.base?.[slot];
-    if (config.className?.[slot]) base = cx(base, config.className[slot]);
-    return [
-      slot,
-      cva({
-        base,
-        variants: variantsForSlot(config.variants, slot),
-        defaultVariants: config.defaultVariants,
-        compoundVariants: compoundsForSlot(config.compoundVariants, slot)
-      })
-    ];
-  });
-  const resolve = (props = {}) => {
-    const result = {};
-    for (const [slot, fn] of slotFns) result[slot] = fn(props);
-    return result;
-  };
-  const raw = (props = {}) => {
-    const result = {};
-    for (const [slot, fn] of slotFns) result[slot] = fn.raw(props);
     return result;
+  }
+  return function cx2(...args) {
+    parts.length = 0;
+    for (let i = 0; i < args.length; i++) collect(args[i]);
+    const count = parts.length;
+    if (count === 0) return "";
+    if (count === 1) return parts[0];
+    return merge();
   };
-  return Object.assign(memoProps(resolve), {
-    __cva__: false,
-    raw,
-    config,
-    variantMap: Object.fromEntries(variantKeys.map((key) => [key, Object.keys(config.variants?.[key] ?? {})])),
-    variantKeys,
-    classNameMap: config.className ?? {},
-    getVariantProps: (props) => withDefaults(defaultVariants, props),
-    splitVariantProps: (props) => splitVariantProps(props, variantKeySet)
-  });
+}
+var cx = /* @__PURE__ */ createCx();
+
+// src/runtime/internal/css.ts
+function css(...styles) {
+  return cx(...styles);
 }
 
 // src/runtime/internal/source.ts
-var internalCssSource = 'var D="__PANDA_CX_SEPARATOR__";function w(n,r){let t=n.length;if(t>0&&n.charCodeAt(t-1)===33&&(t-=1),t===0)return null;let e=0,s=-1;for(let i=0;i<t;i++){let d=n.charCodeAt(i);d===91?e++:d===93?e--:d===58&&e===0&&(s=i)}let o=s+1,a=n.indexOf(r,o);if(a<o+1||a>=t)return null;let l=n.slice(o,a);return s===-1?l:`${n.slice(0,s)}:${l}`}function S(n,r){for(let t of n)if(t){if(Array.isArray(t)){S(t,r);continue}t!==""&&r.push(t)}}function H(n,r){let t=new Map,e=[],s=0;for(let a of r){let l=0;for(let i=0;i<=a.length;i++){if(i!==a.length&&a.charCodeAt(i)!==32)continue;if(i===l){l=i+1;continue}let d=a.slice(l,i);l=i+1;let u=w(d,n);if(u!==null)t.has(u)||e.push(u),t.set(u,d);else{let c=`__${s++}`;e.push(c),t.set(c,d)}}}if(e.length===0)return"";if(e.length===1)return t.get(e[0]);let o=t.get(e[0]);for(let a=1;a<e.length;a++)o+=` ${t.get(e[a])}`;return o}function M(n={}){let r=n.separator??D;return function(...e){if(e.length===1){let o=e[0];if(typeof o=="string")return o;if(!o)return""}let s=[];return S(e,s),s.length===0?"":s.length===1?s[0]:H(r,s)}}var V=M();function P(...n){return V(...n)}function y(n,r){let t={...n};for(let e in r)r[e]!==void 0&&(t[e]=r[e]);return t}function k(n,r){let t={},e={};for(let s in n)r.has(s)?e[s]=n[s]:t[s]=n[s];return[t,e]}function N(n){let r={};for(let t in n)r[t]=Object.keys(n[t]??{});return r}function T(n,r){for(let t in n){if(t==="css"||t==="className"||t==="classNames")continue;let e=n[t],s=r[t];if(Array.isArray(e)){if(!e.includes(s))return!1}else if(s!==e)return!1}return!0}function K(n,r,t){if(t==null)return;let e=n[r]?.[t];return typeof e=="string"&&e?e:void 0}function x(n){let r=new Map,t="",e,s=!1;return(o={})=>{let a="";for(let d in o){let u=o[d];u!==void 0&&(a+=`${d}:${String(u)}|`)}if(s&&a===t)return e;let l=r.get(a);if(l!==void 0)return t=a,e=l,s=!0,l;let i=n(o);return r.set(a,i),r.size>500&&r.delete(r.keys().next().value),t=a,e=i,s=!0,i}}function _(n){return n.length===0?"":n.length===1?n[0]:V(...n)}function L(n){if(!n)return!1;let r=Object.keys(n);return r.length===1&&r[0]==="true"&&typeof n.true=="string"}function $(n,r,t,e){if(!(e||r.length===0||r.length>12)){for(let s of r)if(!L(n[s]))return;for(let s in t){if(!r.includes(s))return;let o=t[s];if(o!==!0&&o!==!1&&o!=="true"&&o!=="false")return}return r}}function O(n){return n===!0||n==="true"}function E(n,r,t,e,s){let o=$(r,t,e,s);if(!o)return;let a=o.length,l=0;for(let u=0;u<a;u++)O(e[o[u]])&&(l|=1<<u);let i=new Array(1<<a),d=u=>{let c=[];n&&c.push(n);for(let f=0;f<a;f++)u&1<<f&&c.push(r[o[f]].true);return _(c)};return(u={})=>{let c=l;for(let f=0;f<a;f++){let g=u[o[f]];g!==void 0&&(O(g)?c|=1<<f:c&=~(1<<f))}return i[c]??=d(c)}}var X=4096;function F(n){let r=new Map;for(let t=0;t<n.length;t++){let e=n[t],s=t+1;if(r.set(e,s),e==="true")r.set(!0,s);else if(e==="false")r.set(!1,s);else{let o=Number(e);e!==""&&!Number.isNaN(o)&&r.set(o,s)}}return r}function j(n,r,t,e,s){if(s||t.length===0)return;let o=[],a=1;for(let u of t){let c=Object.keys(r[u]??{});if(c.length===0||(o.push({key:u,options:c,index:F(c),radix:c.length+1,stride:a}),a*=c.length+1,a>X))return}let l=0;for(let u in e){let c=o.find(g=>g.key===u);if(!c)return;let f=c.index.get(e[u]);if(f===void 0)return;l+=f*c.stride}let i=new Array(a),d=u=>{let c=[];n&&c.push(n);for(let f of o){let g=Math.floor(u/f.stride)%f.radix;if(g===0)continue;let p=r[f.key][f.options[g-1]];p&&c.push(p)}return _(c)};return(u={})=>{let c=l;for(let f=0;f<o.length;f++){let g=o[f],p=u[g.key];if(p===void 0)continue;let C=g.index.get(p)??0,m=Math.floor(c/g.stride)%g.radix;c+=(C-m)*g.stride}return i[c]??=d(c)}}function I(n,r){let t=[...n];for(let e of r)t.includes(e)||t.push(e);return t}function R(n){let r=n.base??"",t=n.variants??{},e=n.defaultVariants??{},s=n.compoundVariants??[],o=Object.keys(t),a=new Set(o),l=Object.keys(e).length>0,i=s.length>0,d=(f={})=>{let g=l?y(e,f):f,p=[];r&&p.push(r);for(let C of o){let m=K(t,C,g[C]);m&&p.push(m)}if(i)for(let C of s){if(!T(C,g))continue;let m=C.className??C.css;typeof m=="string"&&m&&p.push(m)}return _(p)},u=E(r,t,o,e,i)??j(r,t,o,e,i)??x(d),c=f=>{let g=f.config,p=g.variants??{},C={};for(let m of I(f.variantKeys,o)){let b={...t[m]},v=p[m]??{};for(let h in v){let A=b[h];b[h]=A?V(A,v[h]):v[h]}C[m]=b}return R({base:V(r,g.base),variants:C,defaultVariants:{...e,...g.defaultVariants},compoundVariants:[...s,...g.compoundVariants??[]]})};return Object.assign(u,{__cva__:!0,variantKeys:o,variantMap:N(t),raw:d,merge:c,config:n,getVariantProps:f=>y(e,f),splitVariantProps:f=>k(f,a)})}function q(n,r){if(!n)return;let t={};for(let e in n){let s={};for(let o in n[e]){let a=n[e][o],l=typeof a=="string"?a:a?.[r];l&&(s[o]=l)}t[e]=s}return t}function z(n,r){if(!n?.length)return;let t=[];for(let e of n){let s={};for(let l in e)l==="css"||l==="className"||l==="classNames"||(s[l]=e[l]);let o=e.css;typeof o=="string"?s.css=o:o&&typeof o=="object"&&r in o&&(s.css=o[r]);let a=e.classNames?.[r]??e.className;a&&(s.className=a),(s.css||s.className)&&t.push(s)}return t.length?t:void 0}function B(n){let r=n.slots??Object.keys(n.base??{}),t=n.defaultVariants??{},e=Object.keys(n.variants??{}),s=new Set(e),o=r.map(i=>{let d=n.base?.[i];return n.className?.[i]&&(d=V(d,n.className[i])),[i,R({base:d,variants:q(n.variants,i),defaultVariants:n.defaultVariants,compoundVariants:z(n.compoundVariants,i)})]}),a=(i={})=>{let d={};for(let[u,c]of o)d[u]=c(i);return d},l=(i={})=>{let d={};for(let[u,c]of o)d[u]=c.raw(i);return d};return Object.assign(x(a),{__cva__:!1,raw:l,config:n,variantMap:Object.fromEntries(e.map(i=>[i,Object.keys(n.variants?.[i]??{})])),variantKeys:e,classNameMap:n.className??{},getVariantProps:i=>y(t,i),splitVariantProps:i=>k(i,s)})}export{P as css,R as cva,V as cx,B as sva};\n';
+var internalCssSource = '// src/runtime/internal/cx.ts\nvar z = "__PANDA_CX_SEPARATOR__";\nvar X = 2048, M = 32, G = 33, m = 4;\nfunction H(e = X) {\n  let o = 0, t = /* @__PURE__ */ new Map(), s = /* @__PURE__ */ new Map(), r = (i, n) => {\n    t.set(i, n), ++o > e && (o = 0, s = t, t = /* @__PURE__ */ new Map());\n  };\n  return {\n    get(i) {\n      let n = t.get(i);\n      return n === void 0 && (n = s.get(i)) !== void 0 && r(i, n), n;\n    },\n    set: r\n  };\n}\nfunction W(e, o, t, s) {\n  let r = 0, i = e.length > 0, n = 0;\n  for (let l = 0; l <= e.length; l++) {\n    let a = l === e.length ? M : e.charCodeAt(l);\n    if (a !== M && (a < 9 || a > 13)) continue;\n    if ((a !== M || l === n) && (i = !1), l === n) {\n      n = l + 1;\n      continue;\n    }\n    let C = s + r * m;\n    r++, t[C] = n, t[C + 1] = l, t[C + 2] = -1;\n    let h = l;\n    e.charCodeAt(h - 1) === G && h--;\n    let u = 0, _ = n;\n    for (let R = n; R < h; R++) {\n      let g = e.charCodeAt(R);\n      g === 91 ? u++ : g === 93 ? u-- : g === 58 && u === 0 && (_ = R + 1);\n    }\n    let p = e.indexOf(o, _);\n    if (p > _ && p < h) {\n      let R = 2166136261;\n      for (let g = n; g < p; g++) R = Math.imul(R ^ e.charCodeAt(g), 16777619);\n      t[C + 2] = p, t[C + 3] = R;\n    }\n    n = l + 1;\n  }\n  return i ? r : -r;\n}\nfunction K(e = {}) {\n  let o = e.separator ?? z, t = H(), s = H(512), r = [], i = new Int32Array(64 * m), n = new Int32Array(64), l = new Int32Array(64), a = 128, C = new Int32Array(a), h = new Int32Array(a), u = 0;\n  function _(c) {\n    if (c)\n      if (typeof c == "string") r.push(c);\n      else for (let f = 0; f < c.length; f++) _(c[f]);\n  }\n  function p(c) {\n    if (c <= n.length) return;\n    let f = n.length;\n    for (; f < c; ) f *= 2;\n    let w = (P, x) => {\n      let d = new Int32Array(x);\n      return d.set(P), d;\n    };\n    i = w(i, f * m), n = w(n, f), l = w(l, f);\n  }\n  function R(c, f) {\n    let w = i[c * m], P = i[f * m], x = i[c * m + 2] - w;\n    if (i[f * m + 2] - P !== x) return !1;\n    let d = r[n[c]], A = r[n[f]];\n    for (let y = 0; y < x; y++)\n      if (d.charCodeAt(w + y) !== A.charCodeAt(P + y)) return !1;\n    return !0;\n  }\n  function g() {\n    let c = 0, f = !0;\n    for (let d = 0; d < r.length; d++) {\n      let A = r[d], y = t.get(A), S;\n      if (y !== void 0) {\n        S = y[0], p(c + Math.abs(S));\n        let T = c * m;\n        for (let V = 1; V < y.length; V++) i[T + V - 1] = y[V];\n      } else if (p(c + A.length), S = W(A, o, i, c * m), s.get(A) === void 0) s.set(A, !0);\n      else {\n        let T = new Int32Array(1 + Math.abs(S) * m);\n        T[0] = S, T.set(i.subarray(c * m, (c + Math.abs(S)) * m), 1), t.set(A, T);\n      }\n      S <= 0 && (f = !1);\n      let O = c + Math.abs(S);\n      for (; c < O; c++) n[c] = d;\n    }\n    if (c * 2 > a) {\n      for (; c * 2 > a; ) a *= 2;\n      C = new Int32Array(a), h = new Int32Array(a), u = 0;\n    }\n    ++u === 2147483647 && (u = 1, h.fill(0));\n    let w = a - 1, P = !1;\n    for (let d = 0; d < c; d++) {\n      if (l[d] = d, i[d * m + 2] < 0) continue;\n      let A = i[d * m + 3], y = A & w, S = -1;\n      for (; h[y] === u; ) {\n        let O = C[y];\n        if (i[O * m + 3] === A && R(O, d)) {\n          S = O;\n          break;\n        }\n        y = y + 1 & w;\n      }\n      S === -1 ? (h[y] = u, C[y] = d) : (l[S] = d, l[d] = -1, P = !0);\n    }\n    if (!P && f) {\n      let d = r[0];\n      for (let A = 1; A < r.length; A++) d += " " + r[A];\n      return d;\n    }\n    let x = "";\n    for (let d = 0; d < c; d++) {\n      let A = l[d];\n      if (A === -1) continue;\n      let y = r[n[A]].slice(i[A * m], i[A * m + 1]);\n      x = x ? x + " " + y : y;\n    }\n    return x;\n  }\n  return function(...f) {\n    r.length = 0;\n    for (let P = 0; P < f.length; P++) _(f[P]);\n    let w = r.length;\n    return w === 0 ? "" : w === 1 ? r[0] : g();\n  };\n}\nvar b = /* @__PURE__ */ K();\n\n// src/runtime/internal/css.ts\nfunction N(...e) {\n  return b(...e);\n}\n\n// src/runtime/internal/memo.ts\nvar B = (e) => e !== null && (typeof e == "object" || typeof e == "function"), F = ["true", "false", "null"];\nfunction q(e, o, t, s) {\n  let r = 1, i = [], n = [], l = [], a = [], C = o.map((_) => {\n    let p = /* @__PURE__ */ Object.create(null), R = 1;\n    for (let g of t[_]) p[g] = R++;\n    if (s)\n      n.push(R++), l.push(R++), a.push(R++);\n    else {\n      for (let g of F) p[g] ??= R++;\n      n.push(p.true), l.push(p.false), a.push(p.null);\n    }\n    return i.push(R), r *= R, p;\n  });\n  if (r > 256) return null;\n  let h = new Array(r), u;\n  return (_) => {\n    if (_ == null) return u === void 0 ? u = e() : u;\n    let p = 0;\n    for (let g = 0; g < o.length; g++) {\n      let c = _[o[g]], f = 0;\n      if (c === !0) f = n[g];\n      else if (c === !1) f = l[g];\n      else if (c === null) f = a[g];\n      else if (typeof c == "string") f = C[g][c];\n      else if (c !== void 0) {\n        if (s || B(c)) return e(_);\n        f = C[g][String(c)];\n      }\n      if (f === void 0) return e(_);\n      p = p * i[g] + f;\n    }\n    let R = h[p];\n    return R === void 0 && (h[p] = R = e(_)), R;\n  };\n}\nfunction J(e, o) {\n  let t = o.length, s = new Array(16 * t), r = new Array(16), i = 0, n = 0, l;\n  return (a) => {\n    if (a == null) return l === void 0 ? l = e() : l;\n    e: for (let u = 0; u < i; u++) {\n      let _ = u * t;\n      for (let p = 0; p < t; p++)\n        if (a[o[p]] !== s[_ + p]) continue e;\n      return r[u];\n    }\n    for (let u = 0; u < t; u++)\n      if (B(a[o[u]])) return e(a);\n    let C = e(a), h = n * t;\n    for (let u = 0; u < t; u++) s[h + u] = a[o[u]];\n    return r[n] = C, n === i && i++, n = (n + 1) % 16, C;\n  };\n}\nfunction k(e, o, t) {\n  let s = Object.keys(o);\n  return s.length === 0 ? e : q(e, s, o, !!t) ?? J(e, s);\n}\n\n// src/runtime/internal/shared.ts\nfunction E(e, o) {\n  let t = { ...e };\n  for (let s in o)\n    o[s] !== void 0 && (t[s] = o[s]);\n  return t;\n}\nfunction j(e, o) {\n  for (let t in e) {\n    if (t === "css" || t === "className" || t === "classNames") continue;\n    let s = e[t], r = o[t];\n    if (Array.isArray(s)) {\n      if (!s.includes(r)) return !1;\n    } else if (r !== s)\n      return !1;\n  }\n  return !0;\n}\n\n// src/runtime/internal/recipe.ts\nvar D = (e) => e != null && typeof e == "object" && !Array.isArray(e);\nfunction I(...e) {\n  let o = {};\n  for (let t of e)\n    if (D(t))\n      for (let s in t) {\n        let r = t[s];\n        o[s] = D(r) ? I(o[s], r) : r;\n      }\n  return o;\n}\nfunction v(e, o, t = (s) => s) {\n  let s = E(e.defaultVariants ?? {}, o), r = e.variants ?? {}, i = [t(e.base)];\n  for (let n in s) i.push(t(r[n]?.[s[n]]));\n  for (let n of e.compoundVariants ?? [])\n    j(n, s) && i.push(t(n.css));\n  return I(...i);\n}\nfunction Q(e, o) {\n  let t = {};\n  for (let s of e.slots ?? Object.keys(e.base ?? {}))\n    t[s] = v(e, o, (r) => r?.[s]);\n  return t;\n}\nfunction U(e, o) {\n  let t = { ...e.config?.defaultVariants, ...o.config?.defaultVariants }, s = [.../* @__PURE__ */ new Set([...e.variantKeys ?? [], ...o.variantKeys ?? []])], r = (n = {}) => E(t, n), i = L(\n    (n) => {\n      let l = r(n);\n      return b(e(l), o(l));\n    },\n    // Compounds from either side rule out the coercing table memo.\n    {\n      defaultVariants: t,\n      compoundVariants: [...e.config?.compoundVariants ?? [], ...o.config?.compoundVariants ?? []]\n    },\n    s,\n    { ...e.variantMap, ...o.variantMap }\n  );\n  return i.raw = (n) => {\n    let l = r(n);\n    return I(e.raw(l), o.raw(l));\n  }, i;\n}\nfunction L(e, o, t, s, r) {\n  let i = o, n = i.defaultVariants ?? {}, l = k(e, s, i.compoundVariants?.length);\n  return Object.assign(l, {\n    __cva__: !r,\n    variantKeys: t,\n    variantMap: s,\n    ...r && { classNameMap: r },\n    config: o,\n    raw: (a = {}) => r ? Q(i, a) : v(i, a),\n    // The styled factory passes its own `cva`, so chains merge exactly like styled-system.\n    merge: (a, C) => C ? C(o).merge(a) : U(l, a),\n    getVariantProps: (a = {}) => E(n, a),\n    splitVariantProps: (a) => {\n      let C = {}, h = {};\n      for (let u in a) (t.includes(u) ? C : h)[u] = a[u];\n      return [C, h];\n    }\n  });\n}\nexport {\n  L as attachRecipe,\n  N as css,\n  b as cx,\n  k as memoRecipe\n};\n';
 
 // src/runtime/internal/load.ts
 var CX_SEPARATOR_PLACEHOLDER = "__PANDA_CX_SEPARATOR__";
@@ -637,7 +444,6 @@ export {
   createPandaSourcePluginHooks,
   createSourceTransformer,
   css,
-  cva,
   cx,
   src_default as default,
   esbuild,
@@ -653,7 +459,6 @@ export {
   runSourceTransform,
   shouldTransform,
   splitClassName,
-  sva,
   transformSource,
   vite,
   webpack