what-core 0.10.0 → 0.11.0

package/dist/chunk-5EQUBJWQ.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../src/render.js"],
+  "sourcesContent": ["// What Framework - Fine-Grained Rendering Primitives\n// Solid-style rendering: components run once, signals create individual DOM effects.\n// No VDOM diffing \u2014 direct DOM manipulation with surgical signal-driven updates.\n\nimport { effect, untrack, createRoot, _createItemScope, signal, memo, __DEV__ } from './reactive.js';\nimport { createDOM, disposeTree, getCurrentComponent, getComponentStack, _setSelectValue } from './dom.js';\nexport { effect, untrack };\n// Re-export memo for compiled output (branch memoization: the compiler emits\n// _$memo(() => cond) so conditional branches only re-create DOM when the\n// condition value actually changes, not on every dependency write).\nexport { memo };\n\n// --- Generic text insertion hook ---\n// External text engines (e.g., what-text) register a callback here via\n// _setTextInsertHook(). When null (default), zero cost \u2014 no module loaded,\n// no branch taken. The hook receives (parentElement, textString) on every\n// dynamic text insertion and update.\nlet _onTextInsert = null;\n\nexport function _setTextInsertHook(fn) {\n  _onTextInsert = typeof fn === 'function' ? fn : null;\n}\n\n// --- _$createComponent(Component, props, children) ---\n// Internal compiler target for component instantiation. The compiler emits calls\n// to this function instead of h() \u2014 keeping h() out of compiled output entirely.\n// Merges children into props and delegates to createDOM which calls createComponent.\n\nexport function _$createComponent(Component, props, children) {\n  if (children && children.length > 0) {\n    const mergedChildren = children.length === 1 ? children[0] : children;\n    // Mutate props in place when possible to avoid object spread allocation.\n    // Compiled output creates a fresh props object per call, so mutation is safe.\n    if (props) {\n      props.children = mergedChildren;\n    } else {\n      props = { children: mergedChildren };\n    }\n  }\n  // Build a VNode-like object and pass to createDOM which handles component execution\n  return createDOM({ tag: Component, props: props || {}, children: children || [], key: null, _vnode: true });\n}\n\n// --- URL Sanitization for DOM attributes ---\n// Rejects javascript:, data:, vbscript: protocols (case-insensitive, trimmed).\n\nconst URL_ATTRS = new Set(['href', 'src', 'action', 'formaction', 'formAction']);\n\nfunction isSafeUrl(url) {\n  if (typeof url !== 'string') return true; // non-string values are not URL-injection risks\n  const normalized = url.trim().replace(/[\\s\\x00-\\x1f]/g, '').toLowerCase();\n  if (normalized.startsWith('javascript:')) return false;\n  if (normalized.startsWith('data:')) return false;\n  if (normalized.startsWith('vbscript:')) return false;\n  return true;\n}\n\n// --- template(html) ---\n// Pre-parse HTML string into a <template> element. Returns a factory function\n// that clones the DOM tree via cloneNode(true) \u2014 2-5x faster than createElement chains.\n// INTERNAL: Used by the compiler. Not intended for direct use by application code.\n// Exported as both `template` (for compiler output) and `_template` (to signal internal use).\n\n// Table child elements that need special parent wrapping for innerHTML parsing.\n// Browsers auto-correct bare <tr>, <td>, etc. when orphaned \u2014 wrapping prevents silent drops.\nconst TABLE_WRAPPERS = {\n  tr:       { depth: 2, wrap: '<table><tbody>',        unwrap: '</tbody></table>' },\n  td:       { depth: 3, wrap: '<table><tbody><tr>',     unwrap: '</tr></tbody></table>' },\n  th:       { depth: 3, wrap: '<table><tbody><tr>',     unwrap: '</tr></tbody></table>' },\n  thead:    { depth: 1, wrap: '<table>',               unwrap: '</table>' },\n  tbody:    { depth: 1, wrap: '<table>',               unwrap: '</table>' },\n  tfoot:    { depth: 1, wrap: '<table>',               unwrap: '</table>' },\n  colgroup: { depth: 1, wrap: '<table>',               unwrap: '</table>' },\n  col:      { depth: 1, wrap: '<table>',               unwrap: '</table>' },\n  caption:  { depth: 1, wrap: '<table>',               unwrap: '</table>' },\n};\n\n// SVG element tags that must be created in an SVG namespace context.\nconst SVG_ELEMENTS = new Set([\n  'svg', 'path', 'circle', 'rect', 'line', 'polyline', 'polygon', 'ellipse',\n  'g', 'defs', 'use', 'text', 'tspan', 'foreignObject', 'clipPath', 'mask',\n  'pattern', 'linearGradient', 'radialGradient', 'stop', 'marker', 'symbol',\n  'image', 'animate', 'animateTransform', 'animateMotion', 'set',\n  'filter', 'feGaussianBlur', 'feOffset', 'feMerge', 'feMergeNode',\n  'feBlend', 'feColorMatrix', 'feComponentTransfer', 'feComposite',\n  'feConvolveMatrix', 'feDiffuseLighting', 'feDisplacementMap',\n  'feFlood', 'feImage', 'feMorphology', 'feSpecularLighting',\n  'feTile', 'feTurbulence', 'feDistantLight', 'fePointLight', 'feSpotLight',\n]);\n\nfunction getLeadingTag(html) {\n  const m = html.match(/^<([a-zA-Z][a-zA-Z0-9]*)/);\n  return m ? m[1] : '';\n}\n\n// Internal implementation \u2014 no warnings. Used by compiler via _$template.\nfunction _$templateImpl(html) {\n  const trimmed = html.trim();\n  const tag = getLeadingTag(trimmed);\n\n  // SVG namespace: parse inside an SVG container then extract\n  if (SVG_ELEMENTS.has(tag)) {\n    return svgTemplate(trimmed);\n  }\n\n  // Table element wrapping: parse inside proper table parent then extract\n  const tableInfo = TABLE_WRAPPERS[tag];\n  if (tableInfo) {\n    const t = document.createElement('template');\n    t.innerHTML = tableInfo.wrap + trimmed + tableInfo.unwrap;\n    // Pre-navigate to the target element once \u2014 avoids per-clone traversal.\n    let target = t.content.firstChild;\n    for (let i = 0; i < tableInfo.depth; i++) target = target.firstChild;\n    return () => target.cloneNode(true);\n  }\n\n  const t = document.createElement('template');\n  t.innerHTML = trimmed;\n  return () => t.content.firstChild.cloneNode(true);\n}\n\n// Public export \u2014 warns in dev mode that this is a compiler internal.\n// Application code should use JSX, which the compiler transforms into _$template calls.\nlet _templateWarned = false;\nexport function template(html) {\n  if (__DEV__ && !_templateWarned) {\n    _templateWarned = true;\n    console.warn(\n      '[what] template() is a compiler internal. Use JSX instead. ' +\n      'Direct calls with user input can lead to XSS vulnerabilities.'\n    );\n  }\n  return _$templateImpl(html);\n}\n\n// Compiler-internal alias \u2014 preferred name for compiled output (no warning)\nexport { _$templateImpl as _$template };\n\n// Legacy alias kept for backwards compat\nexport { template as _template };\n\n// --- svgTemplate(html) ---\n// Parse SVG content inside an SVG namespace container. Without this, innerHTML on a\n// <template> element creates HTML-namespace nodes, making SVG elements invisible.\n// If the HTML is a complete <svg> tag, it is parsed inside a temporary <div> so the\n// browser uses the correct SVG namespace. For inner SVG elements (path, circle, etc.),\n// they are wrapped in an <svg> container for parsing and then extracted.\n\nexport function svgTemplate(html) {\n  const trimmed = html.trim();\n  const tag = getLeadingTag(trimmed);\n\n  if (tag === 'svg') {\n    // Complete <svg> element \u2014 parse in a div (browsers handle the namespace)\n    const t = document.createElement('template');\n    t.innerHTML = trimmed;\n    return () => t.content.firstChild.cloneNode(true);\n  }\n\n  // Inner SVG element (path, circle, g, etc.) \u2014 wrap in <svg> for namespace context\n  const t = document.createElement('template');\n  t.innerHTML = `<svg xmlns=\"http://www.w3.org/2000/svg\">${trimmed}</svg>`;\n  return () => t.content.firstChild.firstChild.cloneNode(true);\n}\n\n// --- insert(parent, child, marker?) ---\n// Reactive child insertion. Handles all child types:\n// - string/number \u2192 text node\n// - function \u2192 effect that updates text node reactively\n// - DOM node \u2192 append directly\n// - array \u2192 insert each element\n\nexport function insert(parent, child, marker) {\n  // mapArray inserter: self-managing reactive list with its own effect\n  if (typeof child === 'function' && child._mapArray) {\n    return child(parent, marker || null);\n  }\n\n  if (typeof child === 'function') {\n    // Single-evaluation mount: child() is evaluated exactly ONCE at mount,\n    // inside the effect (so signal reads are tracked). The first run decides\n    // between the text fast path (direct textNode.data updates, zero\n    // allocations) and the general reconcile path. Previously the first\n    // evaluation happened outside the effect to pick the path, then the\n    // effect's first run re-evaluated child() \u2014 creating components twice\n    // on mount for non-text children. (SPRINT v0.11 C3)\n    const m = marker || null;\n    let current = null;\n    let textNode = null; // non-null while on the text fast path\n    let mounted = false;\n    effect(() => {\n      const val = child();\n      const vt = typeof val;\n      if (!mounted) {\n        // First run \u2014 mount\n        mounted = true;\n        if (vt === 'string' || vt === 'number') {\n          textNode = document.createTextNode(String(val));\n          if (m) parent.insertBefore(textNode, m);\n          else parent.appendChild(textNode);\n          if (_onTextInsert) _onTextInsert(parent, String(val));\n          current = textNode;\n        } else {\n          current = reconcileInsert(parent, val, null, m);\n        }\n        return;\n      }\n      if (textNode !== null && (vt === 'string' || vt === 'number')) {\n        // Fast path: still text \u2014 update data directly (no allocations)\n        const str = String(val);\n        if (textNode.data !== str) textNode.data = str;\n        if (_onTextInsert) _onTextInsert(parent, str);\n        return;\n      }\n      // Type changed (or never was text) \u2014 full reconcile\n      textNode = null;\n      current = reconcileInsert(parent, val, current, m);\n    });\n    return current;\n  }\n\n  // Static text: create text node directly, skip reconcileInsert overhead\n  if (typeof child === 'string' || typeof child === 'number') {\n    const textNode = document.createTextNode(String(child));\n    if (marker) parent.insertBefore(textNode, marker);\n    else parent.appendChild(textNode);\n    return textNode;\n  }\n\n  // Static DOM node: insert directly, skip reconcileInsert overhead\n  if (child != null && typeof child === 'object' && child.nodeType > 0) {\n    if (marker) parent.insertBefore(child, marker);\n    else parent.appendChild(child);\n    return child;\n  }\n\n  return reconcileInsert(parent, child, null, marker || null);\n}\n\nfunction isDomNode(value) {\n  if (!value || typeof value !== 'object') return false;\n  if (typeof Node !== 'undefined' && value instanceof Node) return true;\n  return typeof value.nodeType === 'number' && typeof value.nodeName === 'string';\n}\n\nfunction isVNode(value) {\n  return !!value && typeof value === 'object' && (value._vnode === true || 'tag' in value);\n}\n\n// Check if parent is an SVG element. Cached typeof check avoids repeated lookups.\nconst _hasSVGElement = typeof SVGElement !== 'undefined';\nfunction isSvgParent(parent) {\n  return _hasSVGElement\n    && parent instanceof SVGElement\n    && parent.tagName !== 'foreignObject';\n}\n\nfunction asNodeArray(value) {\n  if (value == null) return [];\n  return Array.isArray(value) ? value : [value];\n}\n\nfunction valuesToNodes(value, parent, out) {\n  if (value == null || typeof value === 'boolean') return out;\n\n  if (Array.isArray(value)) {\n    for (let i = 0; i < value.length; i++) {\n      valuesToNodes(value[i], parent, out);\n    }\n    return out;\n  }\n\n  // Resolve function values (reactive accessors passed through props)\n  if (typeof value === 'function') {\n    valuesToNodes(value(), parent, out);\n    return out;\n  }\n\n  if (typeof value === 'string' || typeof value === 'number') {\n    out.push(document.createTextNode(String(value)));\n    return out;\n  }\n\n  if (isDomNode(value)) {\n    // DocumentFragments lose their children on DOM insertion, making them\n    // untrackable for reconciliation. Flatten to child nodes instead.\n    if (value.nodeType === 11 && value.childNodes.length > 0) {\n      const children = Array.from(value.childNodes);\n      for (let i = 0; i < children.length; i++) {\n        out.push(children[i]);\n      }\n    } else {\n      out.push(value);\n    }\n    return out;\n  }\n\n  if (isVNode(value)) {\n    out.push(createDOM(value, parent, isSvgParent(parent)));\n    return out;\n  }\n\n  out.push(document.createTextNode(String(value)));\n  return out;\n}\n\nfunction sameNodeArray(a, b) {\n  if (a.length !== b.length) return false;\n  for (let i = 0; i < a.length; i++) {\n    if (a[i] !== b[i]) return false;\n  }\n  return true;\n}\n\nfunction reconcileInsert(parent, value, current, marker) {\n  // Guard: parent must be a node that supports child operations.\n  // This catches cases where a stale DOM reference (e.g., a comment node from\n  // shifted childNodes indices) is mistakenly passed as the parent.\n  if (!parent || typeof parent.insertBefore !== 'function') {\n    if (__DEV__) {\n      console.warn('[what] reconcileInsert called with invalid parent:', parent);\n    }\n    return current;\n  }\n\n  const targetMarker = marker || null;\n\n  if (value == null || typeof value === 'boolean') {\n    const oldNodes = asNodeArray(current);\n    for (let i = 0; i < oldNodes.length; i++) {\n      const oldNode = oldNodes[i];\n      if (oldNode.parentNode === parent) {\n        disposeTree(oldNode);\n        parent.removeChild(oldNode);\n      }\n    }\n    return null;\n  }\n\n  if ((typeof value === 'string' || typeof value === 'number')\n      && current && !Array.isArray(current) && current.nodeType === 3) {\n    const text = String(value);\n    if (current.data !== text) current.data = text;\n    return current;\n  }\n\n  // Fast path: single DOM node value with single current node \u2014 skip array allocations\n  if (typeof value === 'object' && value !== null && value.nodeType > 0 && !Array.isArray(value)) {\n    if (value === current) return current;\n    if (current && !Array.isArray(current) && current.nodeType > 0) {\n      // Replace single node with single node\n      if (current.parentNode === parent) {\n        disposeTree(current);\n        parent.replaceChild(value, current);\n      } else {\n        if (targetMarker) parent.insertBefore(value, targetMarker);\n        else parent.appendChild(value);\n      }\n      return value;\n    }\n  }\n\n  const newNodes = valuesToNodes(value, parent, []);\n  const oldNodes = asNodeArray(current);\n\n  if (sameNodeArray(oldNodes, newNodes)) {\n    return current;\n  }\n\n  // Remove old nodes not in the new set. For small arrays (typical case),\n  // linear scan is faster than Set allocation + hashing.\n  const newLen = newNodes.length;\n  for (let i = 0; i < oldNodes.length; i++) {\n    const oldNode = oldNodes[i];\n    if (oldNode.parentNode !== parent) continue;\n    let found = false;\n    for (let j = 0; j < newLen; j++) {\n      if (newNodes[j] === oldNode) { found = true; break; }\n    }\n    if (!found) {\n      disposeTree(oldNode);\n      parent.removeChild(oldNode);\n    }\n  }\n\n  let ref = targetMarker;\n  for (let i = newNodes.length - 1; i >= 0; i--) {\n    const node = newNodes[i];\n    if (node.parentNode !== parent || node.nextSibling !== ref) {\n      // Guard against stale ref from nested reconciliation\n      if (ref && ref.parentNode !== parent) ref = null;\n      if (ref) parent.insertBefore(node, ref);\n      else parent.appendChild(node);\n    }\n    ref = node;\n  }\n\n  if (newNodes.length === 0) return null;\n  return newNodes.length === 1 ? newNodes[0] : newNodes;\n}\n\n// --- mapArray(source, mapFn, options?) ---\n// Reactive list rendering with per-item scopes.\n// Unkeyed: tracks items by reference. Keyed: tracks by key function.\n// With key + raw: mapFn receives (item, index) \u2014 raw item value. Items identified by key for\n//   efficient DOM reuse/moves. Use when items have per-field signals (no wrapper needed).\n// With key (no raw): mapFn receives (itemAccessor, index) \u2014 accessor is a signal getter.\n//   When item reference changes but key persists, the signal updates in place.\n// Without key: mapFn receives (item, index) \u2014 raw item value. New reference = new row.\n\nexport function mapArray(source, mapFn, options) {\n  const keyFn = options?.key;\n  const raw = options?.raw || false;\n\n  const inserter = (parent, marker) => {\n    let items = [];\n    let mappedNodes = [];\n    let disposeFns = [];\n    // Keyed mode state: key \u2192 { itemSignal }. Null for raw/unkeyed modes.\n    let keyedState = keyFn && !raw ? new Map() : null;\n\n    const endMarker = document.createComment('/list');\n    parent.insertBefore(endMarker, marker || null);\n\n    effect(() => {\n      const newItems = source() || [];\n      if (keyFn) {\n        reconcileKeyed(parent, endMarker, items, newItems, mappedNodes, disposeFns, mapFn, keyFn, keyedState);\n      } else {\n        reconcileList(parent, endMarker, items, newItems, mappedNodes, disposeFns, mapFn);\n      }\n      // Save a snapshot of items for next diff. Use slice() to defend against\n      // in-place mutation, but skip for empty arrays (common clear case).\n      items = newItems.length > 0 ? newItems.slice() : newItems;\n    });\n\n    return endMarker;\n  };\n  inserter._mapArray = true;\n  return inserter;\n}\n\nfunction reconcileList(parent, endMarker, oldItems, newItems, mappedNodes, disposeFns, mapFn) {\n  const newLen = newItems.length;\n  const oldLen = oldItems.length;\n\n  if (newLen === 0) {\n    // Fast path: clear all \u2014 dispose reactive scopes first (handles effects/cleanups),\n    // then remove DOM nodes. createRoot disposal handles all tracked effects; we only\n    // need disposeTree for nodes with additional reactive bindings outside createRoot.\n    if (oldLen > 0) {\n      for (let i = 0; i < oldLen; i++) {\n        if (disposeFns[i]) disposeFns[i]();\n      }\n      for (let i = oldLen - 1; i >= 0; i--) {\n        const node = mappedNodes[i];\n        if (node) {\n          // disposeTree walks the subtree for nested component contexts\n          // (c:start comments) and reactive bindings that the item-scope\n          // dispose above does not cover. (AUDIT C5)\n          disposeTree(node);\n          if (node.parentNode === parent) parent.removeChild(node);\n        }\n      }\n      mappedNodes.length = 0;\n      disposeFns.length = 0;\n    }\n    return;\n  }\n\n  if (oldLen === 0) {\n    // Fast path: all new\n    const frag = document.createDocumentFragment();\n    for (let i = 0; i < newLen; i++) {\n      const item = newItems[i];\n      const node = _createItemScope(dispose => {\n        disposeFns[i] = dispose;\n        return mapFn(item, i);\n      });\n      mappedNodes[i] = node;\n      frag.appendChild(node);\n    }\n    parent.insertBefore(frag, endMarker);\n    return;\n  }\n\n  // --- Common prefix/suffix skip ---\n  let start = 0;\n  const minLen = Math.min(oldLen, newLen);\n  while (start < minLen && oldItems[start] === newItems[start]) start++;\n\n  // If everything matches and same length, nothing changed\n  if (start === oldLen && start === newLen) return;\n\n  let oldEnd = oldLen - 1;\n  let newEnd = newLen - 1;\n  while (oldEnd >= start && newEnd >= start && oldItems[oldEnd] === newItems[newEnd]) {\n    oldEnd--;\n    newEnd--;\n  }\n\n  // Copy prefix/suffix into output arrays\n  const newMapped = new Array(newLen);\n  const newDispose = new Array(newLen);\n  for (let i = 0; i < start; i++) {\n    newMapped[i] = mappedNodes[i];\n    newDispose[i] = disposeFns[i];\n  }\n  for (let i = newEnd + 1; i < newLen; i++) {\n    // Suffix items: same item, possibly different index offset\n    const oldI = oldEnd + 1 + (i - newEnd - 1);\n    newMapped[i] = mappedNodes[oldI];\n    newDispose[i] = disposeFns[oldI];\n  }\n\n  // Only reconcile the middle section: start..newEnd (new) vs start..oldEnd (old)\n  const midNewLen = newEnd - start + 1;\n  const midOldLen = oldEnd - start + 1;\n\n  if (midNewLen === 0) {\n    // Only removals in the middle\n    for (let i = start; i <= oldEnd; i++) {\n      disposeFns[i]?.();\n      if (mappedNodes[i]) disposeTree(mappedNodes[i]); // dispose nested component ctx (AUDIT C5)\n      if (mappedNodes[i]?.parentNode) mappedNodes[i].parentNode.removeChild(mappedNodes[i]);\n    }\n  } else if (midOldLen === 0) {\n    // Only insertions in the middle\n    const marker = start < newLen && newMapped[newEnd + 1] ? newMapped[newEnd + 1] : endMarker;\n    const frag = document.createDocumentFragment();\n    for (let i = start; i <= newEnd; i++) {\n      const item = newItems[i];\n      const idx = i;\n      newMapped[i] = _createItemScope(dispose => {\n        newDispose[idx] = dispose;\n        return mapFn(item, idx);\n      });\n      frag.appendChild(newMapped[i]);\n    }\n    parent.insertBefore(frag, marker);\n  } else {\n    // General case: reconcile middle section with LIS\n    _reconcileMiddle(parent, endMarker, oldItems, newItems, mappedNodes, disposeFns,\n                     mapFn, start, oldEnd, newEnd, newMapped, newDispose);\n  }\n\n  // Update arrays in place\n  mappedNodes.length = newLen;\n  disposeFns.length = newLen;\n  for (let i = 0; i < newLen; i++) {\n    mappedNodes[i] = newMapped[i];\n    disposeFns[i] = newDispose[i];\n  }\n}\n\nfunction _reconcileMiddle(parent, endMarker, oldItems, newItems, mappedNodes, disposeFns,\n                          mapFn, start, oldEnd, newEnd, newMapped, newDispose) {\n  // Build index map only for the middle section\n  const oldIdxMap = new Map();\n  for (let i = start; i <= oldEnd; i++) {\n    oldIdxMap.set(oldItems[i], i);\n  }\n\n  // Match old items to new positions, collect old indices for LIS\n  const midLen = newEnd - start + 1;\n  const oldIndices = new Int32Array(midLen); // -1 = new item\n  oldIndices.fill(-1);\n\n  for (let i = start; i <= newEnd; i++) {\n    const oldIdx = oldIdxMap.get(newItems[i]);\n    if (oldIdx !== undefined) {\n      oldIdxMap.delete(newItems[i]);\n      newMapped[i] = mappedNodes[oldIdx];\n      newDispose[i] = disposeFns[oldIdx];\n      oldIndices[i - start] = oldIdx;\n    }\n  }\n\n  // Dispose removed items\n  for (const [, oldIdx] of oldIdxMap) {\n    disposeFns[oldIdx]?.();\n    if (mappedNodes[oldIdx]) disposeTree(mappedNodes[oldIdx]); // dispose nested component ctx (AUDIT C5)\n    if (mappedNodes[oldIdx]?.parentNode) mappedNodes[oldIdx].parentNode.removeChild(mappedNodes[oldIdx]);\n  }\n\n  // Compute LIS on old indices of reused items\n  // Build the sequence of old indices for reused items only\n  const reusedCount = midLen - _countNeg1(oldIndices, midLen);\n\n  // Use a bitfield (via Uint8Array) to mark LIS positions \u2014 avoids Set overhead\n  const inLIS = new Uint8Array(midLen);\n\n  if (reusedCount > 1) {\n    const seq = new Int32Array(reusedCount);\n    const seqToMid = new Int32Array(reusedCount); // maps seq index \u2192 mid index\n    let k = 0;\n    for (let i = 0; i < midLen; i++) {\n      if (oldIndices[i] !== -1) {\n        seq[k] = oldIndices[i];\n        seqToMid[k] = i;\n        k++;\n      }\n    }\n    const lisResult = _lis(seq, reusedCount);\n    for (let i = 0; i < lisResult.length; i++) {\n      inLIS[seqToMid[lisResult[i]]] = 1;\n    }\n  } else if (reusedCount === 1) {\n    // Single reused item is trivially in LIS\n    for (let i = 0; i < midLen; i++) {\n      if (oldIndices[i] !== -1) { inLIS[i] = 1; break; }\n    }\n  }\n\n  // Create new items\n  for (let i = start; i <= newEnd; i++) {\n    if (!newMapped[i]) {\n      const item = newItems[i];\n      const idx = i;\n      newMapped[i] = _createItemScope(dispose => {\n        newDispose[idx] = dispose;\n        return mapFn(item, idx);\n      });\n    }\n  }\n\n  // Position: work backwards from the item after newEnd (suffix start or endMarker)\n  let nextSibling = newEnd + 1 < newMapped.length && newMapped[newEnd + 1]\n    ? newMapped[newEnd + 1] : endMarker;\n\n  for (let i = newEnd; i >= start; i--) {\n    const mi = i - start;\n    if (oldIndices[mi] === -1 || !inLIS[mi]) {\n      // New item or moved item \u2014 insert\n      // Guard against stale nextSibling from nested reconciliation\n      if (nextSibling && nextSibling.parentNode !== parent) nextSibling = endMarker;\n      parent.insertBefore(newMapped[i], nextSibling);\n    }\n    nextSibling = newMapped[i];\n  }\n}\n\nfunction _countNeg1(arr, len) {\n  let c = 0;\n  for (let i = 0; i < len; i++) if (arr[i] === -1) c++;\n  return c;\n}\n\n// Longest Increasing Subsequence \u2014 returns indices into the input array.\n// O(n log n) using patience sorting. Uses typed arrays for performance.\nfunction _lis(arr, len) {\n  if (len === 0) return [];\n  if (len === 1) return [0];\n\n  const tails = new Int32Array(len); // indices into arr\n  const predecessors = new Int32Array(len);\n  let tailLen = 1;\n  tails[0] = 0;\n  predecessors[0] = -1;\n\n  for (let i = 1; i < len; i++) {\n    if (arr[i] > arr[tails[tailLen - 1]]) {\n      predecessors[i] = tails[tailLen - 1];\n      tails[tailLen++] = i;\n    } else {\n      let lo = 0, hi = tailLen - 1;\n      while (lo < hi) {\n        const mid = (lo + hi) >> 1;\n        if (arr[tails[mid]] < arr[i]) lo = mid + 1;\n        else hi = mid;\n      }\n      tails[lo] = i;\n      predecessors[i] = lo > 0 ? tails[lo - 1] : -1;\n    }\n  }\n\n  const result = new Array(tailLen);\n  let k = tails[tailLen - 1];\n  for (let i = tailLen - 1; i >= 0; i--) {\n    result[i] = k;\n    k = predecessors[k];\n  }\n  return result;\n}\n\n// --- reconcileKeyed ---\n// Keyed reconciliation: tracks items by key function, not by reference.\n// When a key persists but its item reference changes, the item signal updates\n// in place \u2014 no DOM node destruction/creation. Only effects reading the\n// item accessor re-run (e.g., textContent update for changed label).\n//\n// Multi-node items: Components return DocumentFragments (c:start, content, c:end).\n// We track each item via a start-marker comment. Moving/removing an item moves\n// all nodes from its marker up to (but not including) the next item's marker.\n\nfunction _createItemMarker() {\n  return document.createComment('i');\n}\n\n// Collect all DOM nodes belonging to one item (from its marker to beforeEnd).\nfunction _collectItemNodes(marker, beforeEnd) {\n  const nodes = [];\n  let n = marker;\n  while (n && n !== beforeEnd) {\n    nodes.push(n);\n    n = n.nextSibling;\n  }\n  return nodes;\n}\n\n// Move all nodes for an item (starting at marker) before `ref` in `parent`.\nfunction _moveItem(parent, marker, beforeEnd, ref) {\n  let n = marker;\n  while (n && n !== beforeEnd) {\n    const next = n.nextSibling;\n    parent.insertBefore(n, ref);\n    n = next;\n  }\n}\n\n// Remove all nodes for an item from the DOM.\nfunction _removeItemNodes(parent, marker, beforeEnd) {\n  let n = marker;\n  while (n && n !== beforeEnd) {\n    const next = n.nextSibling;\n    // Always disposeTree: a component's context lives on its `c:start` comment\n    // (nodeType 8, via _commentCtxMap) which carries none of the gate flags\n    // below, so the old `_componentCtx || _dispose || _propEffects` guard\n    // leaked every component's effects/cleanups/onCleanup/listeners on removal.\n    // disposeTree is internally cheap-guarded and idempotent. (AUDIT C5)\n    disposeTree(n);\n    parent.removeChild(n);\n    n = next;\n  }\n}\n\n// Create a new item: wraps mapFn result in a marker + appends to target.\nfunction _createKeyedItem(target, item, idx, keyFn, keyedState, mapFn, mappedArr, disposeArr, signal_) {\n  let accessor;\n  if (keyedState) {\n    const key = keyFn(item);\n    const itemSig = signal_(item);\n    accessor = itemSig;\n    keyedState.set(key, { itemSig });\n  } else {\n    accessor = item;\n  }\n  const marker = _createItemMarker();\n  target.appendChild(marker);\n  const result = _createItemScope(dispose => {\n    disposeArr[idx] = dispose;\n    return mapFn(accessor, idx);\n  });\n  // result may be a DocumentFragment or a single node\n  target.appendChild(result);\n  mappedArr[idx] = marker;\n}\n\nfunction reconcileKeyed(parent, endMarker, oldItems, newItems, mappedNodes, disposeFns, mapFn, keyFn, keyedState) {\n  const newLen = newItems.length;\n  const oldLen = oldItems.length;\n\n  // --- Fast path: clear all ---\n  if (newLen === 0) {\n    if (oldLen > 0) {\n      for (let i = 0; i < oldLen; i++) {\n        if (disposeFns[i]) disposeFns[i]();\n      }\n      // Remove all nodes between first item marker and endMarker\n      if (mappedNodes[0]) {\n        _removeItemNodes(parent, mappedNodes[0], endMarker);\n      }\n      mappedNodes.length = 0;\n      disposeFns.length = 0;\n      if (keyedState) keyedState.clear();\n    }\n    return;\n  }\n\n  // --- Fast path: all new ---\n  if (oldLen === 0) {\n    const frag = document.createDocumentFragment();\n    for (let i = 0; i < newLen; i++) {\n      _createKeyedItem(frag, newItems[i], i, keyFn, keyedState, mapFn, mappedNodes, disposeFns, signal);\n    }\n    parent.insertBefore(frag, endMarker);\n    return;\n  }\n\n  // --- Common prefix: skip matching keys at the start ---\n  let start = 0;\n  const minLen = Math.min(oldLen, newLen);\n  while (start < minLen) {\n    if (oldItems[start] === newItems[start]) { start++; continue; }\n    const oldKey = keyFn(oldItems[start]);\n    const newKey = keyFn(newItems[start]);\n    if (oldKey !== newKey) break;\n    if (keyedState) keyedState.get(oldKey).itemSig.set(newItems[start]);\n    start++;\n  }\n\n  // --- Common suffix: skip matching keys at the end ---\n  let oldEnd = oldLen - 1;\n  let newEnd = newLen - 1;\n  while (oldEnd >= start && newEnd >= start) {\n    if (oldItems[oldEnd] === newItems[newEnd]) { oldEnd--; newEnd--; continue; }\n    const oldKey = keyFn(oldItems[oldEnd]);\n    const newKey = keyFn(newItems[newEnd]);\n    if (oldKey !== newKey) break;\n    if (keyedState) keyedState.get(oldKey).itemSig.set(newItems[newEnd]);\n    oldEnd--;\n    newEnd--;\n  }\n\n  if (start > oldEnd && start > newEnd) return;\n\n  const newMapped = new Array(newLen);\n  const newDispose = new Array(newLen);\n  for (let i = 0; i < start; i++) {\n    newMapped[i] = mappedNodes[i];\n    newDispose[i] = disposeFns[i];\n  }\n  for (let i = newEnd + 1; i < newLen; i++) {\n    const oldI = oldEnd + 1 + (i - newEnd - 1);\n    newMapped[i] = mappedNodes[oldI];\n    newDispose[i] = disposeFns[oldI];\n  }\n\n  const midNewLen = newEnd - start + 1;\n  const midOldLen = oldEnd - start + 1;\n\n  // --- Only additions in middle ---\n  if (midOldLen === 0) {\n    const ref = newEnd + 1 < newLen && newMapped[newEnd + 1] ? newMapped[newEnd + 1] : endMarker;\n    const frag = document.createDocumentFragment();\n    for (let i = start; i <= newEnd; i++) {\n      _createKeyedItem(frag, newItems[i], i, keyFn, keyedState, mapFn, newMapped, newDispose, signal);\n    }\n    parent.insertBefore(frag, ref);\n    _copyBack(mappedNodes, disposeFns, newMapped, newDispose, newLen);\n    return;\n  }\n\n  // --- Only removals in middle ---\n  if (midNewLen === 0) {\n    for (let i = start; i <= oldEnd; i++) {\n      disposeFns[i]?.();\n      // Compute the range boundary from the live DOM. Sibling markers in\n      // mappedNodes may have been detached by earlier iterations of this loop;\n      // walking the DOM finds the next surviving item marker (or endMarker).\n      const rangeEnd = _findNextMarkerAfter(parent, mappedNodes[i], mappedNodes, i, endMarker);\n      _removeItemNodes(parent, mappedNodes[i], rangeEnd);\n      if (keyedState) keyedState.delete(keyFn(oldItems[i]));\n    }\n    _copyBack(mappedNodes, disposeFns, newMapped, newDispose, newLen);\n    return;\n  }\n\n  // --- Fast paths for common small-move cases ---\n  // Detect swap (2 mismatches) or single-move (contiguous shift) cheaply\n  // before falling through to the expensive LIS + backward-walk general case.\n\n  if (midNewLen === midOldLen && midNewLen >= 2 && midNewLen <= Math.max(midOldLen, 200)) {\n    // Count positions where keys differ\n    let mismatchCount = 0;\n    let mm1 = -1, mm2 = -1; // first two mismatch indices (relative to start)\n    for (let i = 0; i < midNewLen && mismatchCount <= 4; i++) {\n      const oldKey = keyFn(oldItems[start + i]);\n      const newKey = keyFn(newItems[start + i]);\n      if (oldKey !== newKey) {\n        if (mismatchCount === 0) mm1 = i;\n        else if (mismatchCount === 1) mm2 = i;\n        mismatchCount++;\n      }\n    }\n\n    // --- Fast path A: Pure swap (exactly 2 key mismatches, keys exchanged) ---\n    if (mismatchCount === 2) {\n      const i1 = start + mm1, i2 = start + mm2;\n      const oldKey1 = keyFn(oldItems[i1]), oldKey2 = keyFn(oldItems[i2]);\n      const newKey1 = keyFn(newItems[i1]), newKey2 = keyFn(newItems[i2]);\n\n      if (oldKey1 === newKey2 && oldKey2 === newKey1) {\n        // Confirmed swap. Move item at i2's DOM position before item at i1's position,\n        // then move i1's nodes to where i2 was.\n        for (let i = 0; i < start; i++) {\n          newMapped[i] = mappedNodes[i];\n          newDispose[i] = disposeFns[i];\n        }\n        for (let i = start; i <= newEnd; i++) {\n          newMapped[i] = mappedNodes[i];\n          newDispose[i] = disposeFns[i];\n        }\n        for (let i = newEnd + 1; i < newLen; i++) {\n          const oldI = oldEnd + 1 + (i - newEnd - 1);\n          newMapped[i] = mappedNodes[oldI];\n          newDispose[i] = disposeFns[oldI];\n        }\n\n        // Swap mapped entries\n        const tmpM = newMapped[i1]; newMapped[i1] = newMapped[i2]; newMapped[i2] = tmpM;\n        const tmpD = newDispose[i1]; newDispose[i1] = newDispose[i2]; newDispose[i2] = tmpD;\n\n        // Update keyed state signals if item references differ\n        if (keyedState) {\n          if (newItems[i1] !== oldItems[i1]) {\n            const k = keyFn(newItems[i1]);\n            const entry = keyedState.get(k);\n            if (entry) entry.itemSig.set(newItems[i1]);\n          }\n          if (newItems[i2] !== oldItems[i2]) {\n            const k = keyFn(newItems[i2]);\n            const entry = keyedState.get(k);\n            if (entry) entry.itemSig.set(newItems[i2]);\n          }\n        }\n\n        // DOM moves: swap the two items' DOM ranges.\n        // Adjacent swaps need special handling because moving item2 before\n        // item1 invalidates the pre-computed end boundary for item1 (it was\n        // item2's marker, which has now moved). For adjacent items, a single\n        // _moveItem suffices. For non-adjacent items, we recompute end1 after\n        // the first move.\n        const isAdjacent = (i2 === i1 + 1) || (i1 === i2 + 1);\n        const lo = Math.min(i1, i2), hi = Math.max(i1, i2);\n\n        if (isAdjacent) {\n          // Adjacent: just move the later item's nodes before the earlier item's marker.\n          const endHi = _findNextMarkerAfter(parent, mappedNodes[hi], mappedNodes, hi, endMarker);\n          _moveItem(parent, mappedNodes[hi], endHi, mappedNodes[lo]);\n        } else {\n          // Non-adjacent: use a placeholder to remember i2's position, then\n          // recompute end1 after the first move (since DOM has changed).\n          const end2 = _findNextMarkerAfter(parent, mappedNodes[i2], mappedNodes, i2, endMarker);\n\n          const placeholder = document.createComment('tmp');\n          parent.insertBefore(placeholder, mappedNodes[i2]);\n\n          // Move i2's nodes to before i1's current position\n          _moveItem(parent, mappedNodes[i2], end2, mappedNodes[i1]);\n          // Recompute end1 \u2014 the DOM has changed, so the pre-move boundary is stale\n          const end1 = _findNextMarkerAfter(parent, mappedNodes[i1], mappedNodes, i1, endMarker);\n          // Move i1's nodes to where i2 was (before placeholder)\n          _moveItem(parent, mappedNodes[i1], end1, placeholder);\n          parent.removeChild(placeholder);\n        }\n\n        _copyBack(mappedNodes, disposeFns, newMapped, newDispose, newLen);\n        return;\n      }\n    }\n\n    // --- Fast path B: Single item relocated ---\n    // One item removed from position `from` and inserted at position `to`,\n    // everything between shifted by one.\n    if (mismatchCount >= 2 && mismatchCount <= midNewLen) {\n      // Try to detect single-move pattern:\n      // If we remove element at `from` in old and insert at `to` in new,\n      // the rest should match.\n      // Forward move: old[from] = new[to], old[from+1..to] = new[from..to-1]\n      // Backward move: old[from] = new[to], old[to..from-1] = new[to+1..from]\n\n      const fromRel = mm1; // first mismatch - the moved item was here in old OR went here in new\n      let movedKey = null;\n      let fromAbs = -1, toAbs = -1;\n      let isMove = false;\n\n      // Check forward move: item at old[start+fromRel] moved later\n      const candidateKey = keyFn(oldItems[start + fromRel]);\n      // Find where this key ended up in new\n      let destRel = -1;\n      for (let i = fromRel; i < midNewLen; i++) {\n        if (keyFn(newItems[start + i]) === candidateKey) { destRel = i; break; }\n      }\n      if (destRel > fromRel) {\n        // Verify: old[fromRel+1..destRel] should match new[fromRel..destRel-1]\n        let match = true;\n        for (let i = fromRel; i < destRel; i++) {\n          if (keyFn(oldItems[start + i + 1]) !== keyFn(newItems[start + i])) { match = false; break; }\n        }\n        if (match) {\n          // And everything after destRel should be the same\n          let afterMatch = true;\n          for (let i = destRel + 1; i < midNewLen; i++) {\n            if (keyFn(oldItems[start + i]) !== keyFn(newItems[start + i])) { afterMatch = false; break; }\n          }\n          if (afterMatch) {\n            isMove = true;\n            fromAbs = start + fromRel;\n            toAbs = start + destRel;\n            movedKey = candidateKey;\n          }\n        }\n      }\n\n      if (!isMove) {\n        // Check backward move: item from later in old moved to start+fromRel in new\n        const candidateKey2 = keyFn(newItems[start + fromRel]);\n        let srcRel = -1;\n        for (let i = fromRel; i < midOldLen; i++) {\n          if (keyFn(oldItems[start + i]) === candidateKey2) { srcRel = i; break; }\n        }\n        if (srcRel > fromRel) {\n          // Verify: old[fromRel..srcRel-1] should match new[fromRel+1..srcRel]\n          let match = true;\n          for (let i = fromRel; i < srcRel; i++) {\n            if (keyFn(oldItems[start + i]) !== keyFn(newItems[start + i + 1])) { match = false; break; }\n          }\n          if (match) {\n            let afterMatch = true;\n            for (let i = srcRel + 1; i < midNewLen; i++) {\n              if (keyFn(oldItems[start + i]) !== keyFn(newItems[start + i])) { afterMatch = false; break; }\n            }\n            if (afterMatch) {\n              isMove = true;\n              fromAbs = start + srcRel;\n              toAbs = start + fromRel;\n              movedKey = candidateKey2;\n            }\n          }\n        }\n      }\n\n      if (isMove) {\n        // Copy all mapped/dispose to new arrays\n        for (let i = start; i <= oldEnd; i++) {\n          newMapped[i] = mappedNodes[i];\n          newDispose[i] = disposeFns[i];\n        }\n\n        // Shift entries in newMapped/newDispose to reflect the move\n        const movedMarker = newMapped[fromAbs];\n        const movedDispose = newDispose[fromAbs];\n\n        if (fromAbs < toAbs) {\n          // Forward move: shift [from+1..to] left by 1\n          for (let i = fromAbs; i < toAbs; i++) {\n            newMapped[i] = newMapped[i + 1];\n            newDispose[i] = newDispose[i + 1];\n          }\n        } else {\n          // Backward move: shift [to..from-1] right by 1\n          for (let i = fromAbs; i > toAbs; i--) {\n            newMapped[i] = newMapped[i - 1];\n            newDispose[i] = newDispose[i - 1];\n          }\n        }\n        newMapped[toAbs] = movedMarker;\n        newDispose[toAbs] = movedDispose;\n\n        // Update keyed state signals for items whose references changed\n        if (keyedState) {\n          for (let i = start; i <= newEnd; i++) {\n            const key = keyFn(newItems[i]);\n            if (newItems[i] !== oldItems[i]) {\n              // Only look up oldItems[i] by key if index is in old range\n              const entry = keyedState.get(key);\n              if (entry) entry.itemSig.set(newItems[i]);\n            }\n          }\n        }\n\n        // Single DOM move: move the item's nodes to its new position\n        const movedEnd = _findNextMarkerAfter(parent, movedMarker, mappedNodes, fromAbs, endMarker);\n        // Find the reference node: the marker of the item that should come AFTER the moved item\n        let ref;\n        if (toAbs + 1 < newLen) {\n          ref = newMapped[toAbs + 1];\n        } else {\n          ref = endMarker;\n        }\n        // For suffix items, use the actual mapped marker\n        if (toAbs >= newEnd + 1 || (ref && ref.parentNode !== parent)) {\n          ref = endMarker;\n        }\n        _moveItem(parent, movedMarker, movedEnd, ref);\n\n        _copyBack(mappedNodes, disposeFns, newMapped, newDispose, newLen);\n        return;\n      }\n    }\n  }\n\n  // --- General case: reconcile middle section ---\n  const oldKeyMap = new Map();\n  for (let i = start; i <= oldEnd; i++) {\n    oldKeyMap.set(keyFn(oldItems[i]), i);\n  }\n\n  const oldIndices = new Int32Array(midNewLen);\n  oldIndices.fill(-1);\n\n  for (let i = start; i <= newEnd; i++) {\n    const key = keyFn(newItems[i]);\n    const oldIdx = oldKeyMap.get(key);\n    if (oldIdx !== undefined) {\n      oldKeyMap.delete(key);\n      newMapped[i] = mappedNodes[oldIdx];\n      newDispose[i] = disposeFns[oldIdx];\n      oldIndices[i - start] = oldIdx;\n      if (keyedState && newItems[i] !== oldItems[oldIdx]) {\n        keyedState.get(key).itemSig.set(newItems[i]);\n      }\n    }\n  }\n\n  // Dispose removed items (iterate in reverse to avoid shifting boundaries)\n  const removedIndices = [...oldKeyMap.values()].sort((a, b) => b - a);\n  for (const oldIdx of removedIndices) {\n    disposeFns[oldIdx]?.();\n    // Compute the range boundary from the live DOM. Adjacent removals can\n    // detach mappedNodes[oldIdx + 1] before we get here, so we cannot trust\n    // that reference \u2014 walk the DOM to find the next surviving item marker.\n    const rangeEnd = _findNextMarkerAfter(parent, mappedNodes[oldIdx], mappedNodes, oldIdx, endMarker);\n    _removeItemNodes(parent, mappedNodes[oldIdx], rangeEnd);\n    if (keyedState) keyedState.delete(keyFn(oldItems[oldIdx]));\n  }\n\n  // Create new items (into a detached fragment, then positioned below)\n  for (let i = start; i <= newEnd; i++) {\n    if (!newMapped[i]) {\n      const frag = document.createDocumentFragment();\n      _createKeyedItem(frag, newItems[i], i, keyFn, keyedState, mapFn, newMapped, newDispose, signal);\n      // Leave in frag for now \u2014 will be positioned in the move pass\n      newMapped[i]._frag = frag;\n    }\n  }\n\n  // Position using LIS\n  let reusedCount = 0;\n  let alreadySorted = true;\n  let lastOldIdx = -1;\n  for (let i = 0; i < midNewLen; i++) {\n    if (oldIndices[i] !== -1) {\n      reusedCount++;\n      if (oldIndices[i] <= lastOldIdx) alreadySorted = false;\n      lastOldIdx = oldIndices[i];\n    }\n  }\n\n  const inLIS = new Uint8Array(midNewLen);\n\n  if (alreadySorted) {\n    for (let i = 0; i < midNewLen; i++) {\n      if (oldIndices[i] !== -1) inLIS[i] = 1;\n    }\n  } else if (reusedCount > 1) {\n    const seq = new Int32Array(reusedCount);\n    const seqToMid = new Int32Array(reusedCount);\n    let k = 0;\n    for (let i = 0; i < midNewLen; i++) {\n      if (oldIndices[i] !== -1) {\n        seq[k] = oldIndices[i];\n        seqToMid[k] = i;\n        k++;\n      }\n    }\n    const lisResult = _lis(seq, reusedCount);\n    for (let i = 0; i < lisResult.length; i++) {\n      inLIS[seqToMid[lisResult[i]]] = 1;\n    }\n  } else if (reusedCount === 1) {\n    for (let i = 0; i < midNewLen; i++) {\n      if (oldIndices[i] !== -1) { inLIS[i] = 1; break; }\n    }\n  }\n\n  // Position: work backwards, move items not in LIS\n  // For existing items: move all nodes from marker to next-item boundary.\n  // For new items: insert from their detached fragment.\n  // We rebuild the output array to reflect final positions.\n  _copyBack(mappedNodes, disposeFns, newMapped, newDispose, newLen);\n\n  // Start ref at the first suffix item's marker (not endMarker) so moved items\n  // land before the suffix, not after it.\n  let ref = newEnd + 1 < newLen && mappedNodes[newEnd + 1]\n    ? mappedNodes[newEnd + 1] : endMarker;\n  for (let i = newEnd; i >= start; i--) {\n    const mi = i - start;\n    const marker = mappedNodes[i];\n\n    if (oldIndices[mi] === -1) {\n      // New item \u2014 insert from detached fragment\n      if (marker._frag) {\n        parent.insertBefore(marker._frag, ref);\n        delete marker._frag;\n      }\n    } else if (!inLIS[mi]) {\n      // Existing item not in LIS \u2014 move all its nodes\n      const nextItemMarker = _findNextMarkerAfter(parent, marker, mappedNodes, i, endMarker);\n      _moveItem(parent, marker, nextItemMarker, ref);\n    }\n    ref = marker;\n  }\n}\n\n// TODO(perf): cache item end boundary on marker if large keyed reorders show O(n\u00B2) hot paths.\n// Find the boundary end for an item's nodes in the current DOM.\n// Walks from the marker's nextSibling until we hit another item's marker or endMarker.\nfunction _findNextMarkerAfter(parent, marker, mappedNodes, idx, endMarker) {\n  // The item's nodes end at the next sibling that is either:\n  // - another item's marker comment (data === 'i')\n  // - the list endMarker (data === '/list')\n  let n = marker.nextSibling;\n  while (n && n !== endMarker) {\n    if (n.nodeType === 8 && n.data === 'i') return n;\n    n = n.nextSibling;\n  }\n  return endMarker;\n}\n\nfunction _copyBack(mappedNodes, disposeFns, newMapped, newDispose, newLen) {\n  mappedNodes.length = newLen;\n  disposeFns.length = newLen;\n  for (let i = 0; i < newLen; i++) {\n    mappedNodes[i] = newMapped[i];\n    disposeFns[i] = newDispose[i];\n  }\n}\n\n// --- spread(el, props) ---\n// Fine-grained prop effects. Function props create individual effects.\n// Event props use direct assignment.\n\nexport function spread(el, props) {\n  for (const key in props) {\n    const value = props[key];\n\n    if (key.startsWith('on') && key.length > 2) {\n      // Event handler \u2014 direct assignment. Use $$name for delegated events.\n      const event = key.slice(2).toLowerCase();\n      el.addEventListener(event, value);\n      continue;\n    }\n\n    if (typeof value === 'function' && !key.startsWith('on')) {\n      // Reactive prop \u2014 create micro-effect. The disposer must be registered\n      // on el._propEffects so disposeTree() (dom.js) tears it down when the\n      // element unmounts; otherwise the effect keeps firing on signal writes\n      // for a detached element. Mirror the setProp() pattern.\n      if (!el._propEffects) el._propEffects = {};\n      // If a previous spread/setProp already registered an effect for this\n      // key, dispose it first to avoid double-tracking.\n      if (el._propEffects[key]) {\n        try { el._propEffects[key](); } catch (e) { /* already disposed */ }\n      }\n      if (key === 'class' || key === 'className') {\n        el._propEffects[key] = effect(() => {\n          const cls = value() || '';\n          if (_hasSVGElement && el instanceof SVGElement) el.setAttribute('class', cls);\n          else el.className = cls;\n        });\n      } else if (key === 'style' && typeof value() === 'object') {\n        el._propEffects[key] = effect(() => {\n          const styles = value();\n          for (const prop in styles) {\n            el.style[prop] = styles[prop] ?? '';\n          }\n        });\n      } else {\n        el._propEffects[key] = effect(() => { setProp(el, key, value()); });\n      }\n    } else {\n      // Static prop\n      setProp(el, key, value);\n    }\n  }\n}\n\n// NOTE: this is the fine-grained-compiler path's setProp. A second\n// implementation lives in dom.js (h()/diff path). See the longer note above\n// the dom.js version. Key differences vs. dom.js setProp:\n//   - assumes events are handled by the compiler (delegation or direct\n//     addEventListener) \u2014 no el._events bookkeeping here.\n//   - sanitizes URL attributes (href/src) against javascript: protocol.\n//   - enforces innerHTML must be { __html: ... } \u2014 plain strings are warned.\n// Both share the el._propEffects[key] disposer convention so disposeTree()\n// can tear down reactive prop effects on unmount.\nexport function setProp(el, key, value) {\n  // Ref handling \u2014 assign element to ref object/callback (defense in depth)\n  if (key === 'ref') {\n    if (typeof value === 'function') value(el);\n    else if (value && typeof value === 'object') value.current = el;\n    return;\n  }\n\n  // Key prop \u2014 no-op, WhatFW has no virtual DOM (defense in depth, issue #6)\n  if (key === 'key') return;\n\n  // Reactive accessor: function values on non-event props are treated as\n  // reactive getters. Wrap in an effect so the prop auto-updates. Track the\n  // disposer on el._propEffects so disposeTree() tears it down on unmount \u2014\n  // mirrors the pattern in dom.js setProp / spread().\n  if (typeof value === 'function' && !key.startsWith('on')) {\n    if (!el._propEffects) el._propEffects = {};\n    if (el._propEffects[key]) {\n      try { el._propEffects[key](); } catch (e) { /* already disposed */ }\n    }\n    el._propEffects[key] = effect(() => setProp(el, key, value()));\n    return;\n  }\n\n  // Sanitize URL attributes \u2014 reject dangerous protocols\n  if (URL_ATTRS.has(key) || URL_ATTRS.has(key.toLowerCase())) {\n    if (!isSafeUrl(value)) {\n      if (typeof console !== 'undefined') {\n        console.warn(`[what] Blocked unsafe URL in \"${key}\" attribute: ${value}`);\n      }\n      return;\n    }\n  }\n\n  const isSvg = _hasSVGElement && el instanceof SVGElement;\n\n  if (key === 'class' || key === 'className') {\n    if (isSvg) {\n      el.setAttribute('class', value || '');\n    } else {\n      el.className = value || '';\n    }\n  } else if (key === 'dangerouslySetInnerHTML') {\n    const html = value?.__html ?? '';\n    if (typeof __DEV__ !== 'undefined' && __DEV__ && typeof html === 'string' && /(<script|onerror\\s*=|onload\\s*=|javascript:)/i.test(html)) {\n      console.warn('[what] dangerouslySetInnerHTML contains potential XSS vectors. Ensure content is sanitized.');\n    }\n    el.innerHTML = html;\n  } else if (key === 'innerHTML') {\n    if (value && typeof value === 'object' && '__html' in value) {\n      const html = value.__html ?? '';\n      if (typeof __DEV__ !== 'undefined' && __DEV__ && typeof html === 'string' && /(<script|onerror\\s*=|onload\\s*=|javascript:)/i.test(html)) {\n        console.warn('[what] dangerouslySetInnerHTML contains potential XSS vectors. Ensure content is sanitized.');\n      }\n      el.innerHTML = html;\n    } else {\n      if (typeof console !== 'undefined' && value != null && value !== '') {\n        console.warn(\n          '[what] Plain string innerHTML is not allowed. Use { __html: \"...\" } or dangerouslySetInnerHTML={{ __html: \"...\" }} instead.'\n        );\n      }\n    }\n  } else if (key === 'style') {\n    if (typeof value === 'string') {\n      el.style.cssText = value;\n    } else if (typeof value === 'object') {\n      for (const prop in value) {\n        el.style[prop] = value[prop] ?? '';\n      }\n    }\n  } else if (key.startsWith('data-') || key.startsWith('aria-')) {\n    el.setAttribute(key, value);\n  } else if (typeof value === 'boolean') {\n    if (value) el.setAttribute(key, '');\n    else el.removeAttribute(key);\n  } else if (isSvg) {\n    el.setAttribute(key, value);\n  } else if (key === 'value' && el.tagName === 'SELECT') {\n    _setSelectValue(el, value);\n  } else if (key in el) {\n    el[key] = value;\n  } else {\n    el.setAttribute(key, value);\n  }\n}\n\n// --- Specialized attribute setters (SPRINT v0.11 C2) ---\n// The compiler statically knows most attribute names, so it emits direct calls\n// to these monomorphic helpers instead of routing everything through the\n// generic setProp() dispatcher (which re-checks ref/key/url/class/style/...\n// string-compares on every reactive update). setProp() remains the target for\n// spreads, URL attributes (href/src/action \u2014 sanitization lives there) and any\n// name the compiler can't classify.\n\n// class / className \u2014 hottest dynamic attribute in real apps.\nexport function setClass(el, value) {\n  if (_hasSVGElement && el instanceof SVGElement) {\n    el.setAttribute('class', value || '');\n  } else {\n    el.className = value || '';\n  }\n}\n\n// style \u2014 string (cssText) or object form.\nexport function setStyle(el, value) {\n  if (typeof value === 'string') {\n    el.style.cssText = value;\n  } else if (value && typeof value === 'object') {\n    const style = el.style;\n    for (const prop in value) {\n      style[prop] = value[prop] ?? '';\n    }\n  } else if (value == null) {\n    el.style.cssText = '';\n  }\n}\n\n// Plain attribute set \u2014 used for data-*/aria-* (statically recognizable).\n// null/undefined removes the attribute (previously setProp stringified them\n// to \"null\"/\"undefined\" \u2014 removal is the correct semantic). Booleans are\n// stringified (\"true\"/\"false\") because aria-* boolean strings are meaningful.\nexport function setAttr(el, name, value) {\n  if (value == null) el.removeAttribute(name);\n  else el.setAttribute(name, value);\n}\n\n// value \u2014 controlled-input property set. <select> keeps multi/deferred-option\n// handling; other elements get a guarded property write (the !== guard avoids\n// resetting the caret position in focused inputs on unrelated re-runs).\nexport function setValue(el, value) {\n  if (el.tagName === 'SELECT') {\n    _setSelectValue(el, value);\n    return;\n  }\n  const str = value == null ? '' : String(value);\n  if (el.value !== str) el.value = str;\n}\n\n// --- delegateEvents(eventNames) ---\n// Event delegation: common events handled at document level.\n// Handlers stored as el.$$click, el.$$input, etc.\n// Single listener per event type on document \u2014 reduces listener count from N to 1.\n\nconst delegatedEvents = new Set();\n\nexport function delegateEvents(eventNames) {\n  for (const name of eventNames) {\n    if (delegatedEvents.has(name)) continue;\n    delegatedEvents.add(name);\n\n    document.addEventListener(name, (e) => {\n      let node = e.target;\n      const key = '$$' + name;\n\n      // Shim e.currentTarget so handlers see the element the (virtual) listener\n      // is attached to \u2014 not `document` \u2014 during the ancestor walk. Mirrors\n      // Solid's delegation shim. configurable so nested dispatch can redefine.\n      // (SPRINT v0.11 C9)\n      Object.defineProperty(e, 'currentTarget', {\n        configurable: true,\n        get() { return node || document; },\n      });\n\n      // Walk up the DOM tree looking for handlers\n      while (node) {\n        const handler = node[key];\n        if (handler) {\n          handler(e);\n          if (e.cancelBubble) return;\n        }\n        node = node.parentNode;\n      }\n    });\n  }\n}\n\n// --- addEventListener helper for non-delegated events ---\nexport function on(el, event, handler) {\n  el.addEventListener(event, handler);\n  return () => el.removeEventListener(event, handler);\n}\n\n// --- className helper for conditional classes ---\nexport function classList(el, classes) {\n  effect(() => {\n    for (const name in classes) {\n      const value = typeof classes[name] === 'function' ? classes[name]() : classes[name];\n      el.classList.toggle(name, !!value);\n    }\n  });\n}\n\n// =========================================================================\n// DOM Hydration\n// =========================================================================\n// Reuses server-rendered DOM instead of creating new nodes.\n// After hydration is complete, switches to normal rendering for updates.\n\nlet _isHydrating = false;\nlet _hydrationCursor = null;\n\nexport function isHydrating() {\n  return _isHydrating;\n}\n\n/**\n * hydrate(vnode, container)\n * Walk existing DOM nodes in `container`, match them against the vnode tree,\n * attach reactive bindings, and skip cloneNode. Once done, switch to normal rendering.\n */\nexport function hydrate(vnode, container) {\n  _isHydrating = true;\n  _hydrationCursor = { parent: container, index: 0 };\n\n  try {\n    const result = hydrateNode(vnode, container);\n    return result;\n  } finally {\n    _isHydrating = false;\n    _hydrationCursor = null;\n  }\n}\n\n/**\n * Claim the next DOM node from the hydration cursor.\n * Returns the existing DOM node or null if none available.\n */\nfunction claimNode(parent) {\n  const children = parent.childNodes;\n  while (_hydrationCursor.index < children.length) {\n    const node = children[_hydrationCursor.index];\n    // Skip hydration comment markers\n    if (node.nodeType === 8) { // Comment node\n      const text = node.textContent;\n      if (text === '$' || text === '/$' || text === '[]' || text === '/[]') {\n        _hydrationCursor.index++;\n        continue;\n      }\n    }\n    _hydrationCursor.index++;\n    return node;\n  }\n  return null;\n}\n\nfunction isDevMode() {\n  return typeof process !== 'undefined' && process.env?.NODE_ENV !== 'production';\n}\n\nfunction hydrateNode(vnode, parent) {\n  if (vnode == null || typeof vnode === 'boolean') {\n    return null;\n  }\n\n  // Text node\n  if (typeof vnode === 'string' || typeof vnode === 'number') {\n    const existing = claimNode(parent);\n    const text = String(vnode);\n\n    if (existing && existing.nodeType === 3) {\n      // Reuse text node \u2014 check for mismatch in dev\n      if (isDevMode() && existing.textContent !== text) {\n        console.warn(\n          `[what] Hydration mismatch: expected text \"${text}\", got \"${existing.textContent}\"`\n        );\n        existing.textContent = text;\n      }\n      return existing;\n    }\n\n    // Mismatch: expected text node, got element or nothing\n    if (isDevMode()) {\n      console.warn(\n        `[what] Hydration mismatch: expected text node \"${text}\", got ${existing ? existing.nodeName : 'nothing'}. Falling back to client render.`\n      );\n    }\n    const textNode = document.createTextNode(text);\n    if (existing) {\n      parent.replaceChild(textNode, existing);\n    } else {\n      parent.appendChild(textNode);\n    }\n    return textNode;\n  }\n\n  // Reactive function child \u2014 attach effect to existing node\n  if (typeof vnode === 'function') {\n    // Unwrap to get the initial value for hydration\n    const initialValue = vnode();\n    let current = hydrateNode(initialValue, parent);\n\n    // Set up reactive effect for future updates (normal rendering path)\n    effect(() => {\n      const value = vnode();\n      // After hydration, this runs as normal insert\n      if (!_isHydrating) {\n        current = reconcileInsert(parent, value, current, null);\n      }\n    });\n    return current;\n  }\n\n  // Array \u2014 hydrate each child\n  if (Array.isArray(vnode)) {\n    const nodes = [];\n    for (const child of vnode) {\n      const node = hydrateNode(child, parent);\n      if (node) nodes.push(node);\n    }\n    return nodes.length === 1 ? nodes[0] : nodes;\n  }\n\n  // VNode \u2014 component or element\n  if (typeof vnode === 'object' && vnode._vnode) {\n    // Component \u2014 route through component context so hooks work during hydration\n    if (typeof vnode.tag === 'function') {\n      const componentStack = getComponentStack();\n      const Component = vnode.tag;\n      const props = vnode.props || {};\n      const children = vnode.children || [];\n\n      // Set up component context (mirrors createComponent in dom.js)\n      const ctx = {\n        hooks: [],\n        hookIndex: 0,\n        effects: [],\n        cleanups: [],\n        mounted: false,\n        disposed: false,\n        Component,\n        _parentCtx: componentStack[componentStack.length - 1] || null,\n        _errorBoundary: null,\n      };\n\n      // Push context so hooks can access it\n      componentStack.push(ctx);\n\n      let result;\n      try {\n        const propsChildren = children.length === 0 ? undefined\n          : children.length === 1 ? children[0] : children;\n        result = Component({ ...props, children: propsChildren });\n      } catch (error) {\n        componentStack.pop();\n        console.error('[what] Error in component during hydration:', Component.name || 'Anonymous', error);\n        return null;\n      }\n\n      componentStack.pop();\n      ctx.mounted = true;\n\n      // Run onMount callbacks after hydration\n      if (ctx._mountCallbacks) {\n        queueMicrotask(() => {\n          if (ctx.disposed) return;\n          for (const fn of ctx._mountCallbacks) {\n            try { fn(); } catch (e) { console.error('[what] onMount error:', e); }\n          }\n        });\n      }\n\n      return hydrateNode(result, parent);\n    }\n\n    // Element \u2014 claim existing DOM element\n    const existing = claimNode(parent);\n    const expectedTag = vnode.tag.toUpperCase();\n\n    if (existing && existing.nodeType === 1 && existing.nodeName === expectedTag) {\n      // Match! Reuse this element. Apply props/bindings.\n      hydrateElementProps(existing, vnode.props || {});\n\n      // Hydrate children\n      const savedCursor = _hydrationCursor;\n      _hydrationCursor = { parent: existing, index: 0 };\n\n      const rawInner = vnode.props?.dangerouslySetInnerHTML?.__html;\n      if (rawInner == null) {\n        for (const child of vnode.children) {\n          hydrateNode(child, existing);\n        }\n      }\n\n      _hydrationCursor = savedCursor;\n      return existing;\n    }\n\n    // Mismatch \u2014 fall back to client render for this subtree\n    if (isDevMode()) {\n      console.warn(\n        `[what] Hydration mismatch: expected <${vnode.tag}>, got ${existing ? existing.nodeName : 'nothing'}. Falling back to client render.`\n      );\n    }\n\n    // Create the element from scratch\n    const newEl = document.createElement(vnode.tag);\n    for (const key in vnode.props || {}) {\n      if (key === 'children' || key === 'key') continue;\n      setProp(newEl, key, vnode.props[key]);\n    }\n    for (const child of vnode.children) {\n      reconcileInsert(newEl, child, null, null);\n    }\n    if (existing) {\n      parent.replaceChild(newEl, existing);\n    } else {\n      parent.appendChild(newEl);\n    }\n    return newEl;\n  }\n\n  // DOM node \u2014 use directly\n  if (isDomNode(vnode)) {\n    return vnode;\n  }\n\n  // Fallback \u2014 create text node\n  const textNode = document.createTextNode(String(vnode));\n  parent.appendChild(textNode);\n  return textNode;\n}\n\n/**\n * Apply props to an existing hydrated element.\n * Attaches event handlers and reactive bindings without re-creating the element.\n */\nfunction hydrateElementProps(el, props) {\n  for (const key in props) {\n    if (key === 'children' || key === 'key' || key === 'ref') continue;\n    if (key === 'dangerouslySetInnerHTML' || key === 'innerHTML') continue;\n\n    const value = props[key];\n\n    // Event handlers \u2014 always attach (they don't exist in SSR HTML)\n    if (key.startsWith('on') && key.length > 2) {\n      const event = key.slice(2).toLowerCase();\n      el.addEventListener(event, value);\n      continue;\n    }\n\n    // Delegated events ($$click etc.)\n    if (key.startsWith('$$')) {\n      el[key] = value;\n      continue;\n    }\n\n    // Reactive props \u2014 set up effects\n    if (typeof value === 'function' && !key.startsWith('on')) {\n      if (key === 'class' || key === 'className') {\n        effect(() => { el.className = value() || ''; });\n      } else if (key === 'style' && typeof value() === 'object') {\n        effect(() => {\n          const styles = value();\n          for (const prop in styles) {\n            el.style[prop] = styles[prop] ?? '';\n          }\n        });\n      } else {\n        effect(() => { setProp(el, key, value()); });\n      }\n      continue;\n    }\n\n    // Static props \u2014 skip attributes already set from SSR\n    // Only attach non-serializable props or ones that may differ\n    if (key === 'data-hk') continue;\n  }\n}\n"],
+  "mappings": ";;;;;;;;;;;;AAiBA,IAAI,gBAAgB;AAEb,SAAS,mBAAmB,IAAI;AACrC,kBAAgB,OAAO,OAAO,aAAa,KAAK;AAClD;AAOO,SAAS,kBAAkB,WAAW,OAAO,UAAU;AAC5D,MAAI,YAAY,SAAS,SAAS,GAAG;AACnC,UAAM,iBAAiB,SAAS,WAAW,IAAI,SAAS,CAAC,IAAI;AAG7D,QAAI,OAAO;AACT,YAAM,WAAW;AAAA,IACnB,OAAO;AACL,cAAQ,EAAE,UAAU,eAAe;AAAA,IACrC;AAAA,EACF;AAEA,SAAO,UAAU,EAAE,KAAK,WAAW,OAAO,SAAS,CAAC,GAAG,UAAU,YAAY,CAAC,GAAG,KAAK,MAAM,QAAQ,KAAK,CAAC;AAC5G;AAKA,IAAM,YAAY,oBAAI,IAAI,CAAC,QAAQ,OAAO,UAAU,cAAc,YAAY,CAAC;AAE/E,SAAS,UAAU,KAAK;AACtB,MAAI,OAAO,QAAQ,SAAU,QAAO;AACpC,QAAM,aAAa,IAAI,KAAK,EAAE,QAAQ,kBAAkB,EAAE,EAAE,YAAY;AACxE,MAAI,WAAW,WAAW,aAAa,EAAG,QAAO;AACjD,MAAI,WAAW,WAAW,OAAO,EAAG,QAAO;AAC3C,MAAI,WAAW,WAAW,WAAW,EAAG,QAAO;AAC/C,SAAO;AACT;AAUA,IAAM,iBAAiB;AAAA,EACrB,IAAU,EAAE,OAAO,GAAG,MAAM,kBAAyB,QAAQ,mBAAmB;AAAA,EAChF,IAAU,EAAE,OAAO,GAAG,MAAM,sBAA0B,QAAQ,wBAAwB;AAAA,EACtF,IAAU,EAAE,OAAO,GAAG,MAAM,sBAA0B,QAAQ,wBAAwB;AAAA,EACtF,OAAU,EAAE,OAAO,GAAG,MAAM,WAAyB,QAAQ,WAAW;AAAA,EACxE,OAAU,EAAE,OAAO,GAAG,MAAM,WAAyB,QAAQ,WAAW;AAAA,EACxE,OAAU,EAAE,OAAO,GAAG,MAAM,WAAyB,QAAQ,WAAW;AAAA,EACxE,UAAU,EAAE,OAAO,GAAG,MAAM,WAAyB,QAAQ,WAAW;AAAA,EACxE,KAAU,EAAE,OAAO,GAAG,MAAM,WAAyB,QAAQ,WAAW;AAAA,EACxE,SAAU,EAAE,OAAO,GAAG,MAAM,WAAyB,QAAQ,WAAW;AAC1E;AAGA,IAAM,eAAe,oBAAI,IAAI;AAAA,EAC3B;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAU;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAY;AAAA,EAAW;AAAA,EAChE;AAAA,EAAK;AAAA,EAAQ;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAiB;AAAA,EAAY;AAAA,EAClE;AAAA,EAAW;AAAA,EAAkB;AAAA,EAAkB;AAAA,EAAQ;AAAA,EAAU;AAAA,EACjE;AAAA,EAAS;AAAA,EAAW;AAAA,EAAoB;AAAA,EAAiB;AAAA,EACzD;AAAA,EAAU;AAAA,EAAkB;AAAA,EAAY;AAAA,EAAW;AAAA,EACnD;AAAA,EAAW;AAAA,EAAiB;AAAA,EAAuB;AAAA,EACnD;AAAA,EAAoB;AAAA,EAAqB;AAAA,EACzC;AAAA,EAAW;AAAA,EAAW;AAAA,EAAgB;AAAA,EACtC;AAAA,EAAU;AAAA,EAAgB;AAAA,EAAkB;AAAA,EAAgB;AAC9D,CAAC;AAED,SAAS,cAAc,MAAM;AAC3B,QAAM,IAAI,KAAK,MAAM,0BAA0B;AAC/C,SAAO,IAAI,EAAE,CAAC,IAAI;AACpB;AAGA,SAAS,eAAe,MAAM;AAC5B,QAAM,UAAU,KAAK,KAAK;AAC1B,QAAM,MAAM,cAAc,OAAO;AAGjC,MAAI,aAAa,IAAI,GAAG,GAAG;AACzB,WAAO,YAAY,OAAO;AAAA,EAC5B;AAGA,QAAM,YAAY,eAAe,GAAG;AACpC,MAAI,WAAW;AACb,UAAMA,KAAI,SAAS,cAAc,UAAU;AAC3C,IAAAA,GAAE,YAAY,UAAU,OAAO,UAAU,UAAU;AAEnD,QAAI,SAASA,GAAE,QAAQ;AACvB,aAAS,IAAI,GAAG,IAAI,UAAU,OAAO,IAAK,UAAS,OAAO;AAC1D,WAAO,MAAM,OAAO,UAAU,IAAI;AAAA,EACpC;AAEA,QAAM,IAAI,SAAS,cAAc,UAAU;AAC3C,IAAE,YAAY;AACd,SAAO,MAAM,EAAE,QAAQ,WAAW,UAAU,IAAI;AAClD;AAIA,IAAI,kBAAkB;AACf,SAAS,SAAS,MAAM;AAC7B,MAAI,WAAW,CAAC,iBAAiB;AAC/B,sBAAkB;AAClB,YAAQ;AAAA,MACN;AAAA,IAEF;AAAA,EACF;AACA,SAAO,eAAe,IAAI;AAC5B;AAeO,SAAS,YAAY,MAAM;AAChC,QAAM,UAAU,KAAK,KAAK;AAC1B,QAAM,MAAM,cAAc,OAAO;AAEjC,MAAI,QAAQ,OAAO;AAEjB,UAAMC,KAAI,SAAS,cAAc,UAAU;AAC3C,IAAAA,GAAE,YAAY;AACd,WAAO,MAAMA,GAAE,QAAQ,WAAW,UAAU,IAAI;AAAA,EAClD;AAGA,QAAM,IAAI,SAAS,cAAc,UAAU;AAC3C,IAAE,YAAY,2CAA2C,OAAO;AAChE,SAAO,MAAM,EAAE,QAAQ,WAAW,WAAW,UAAU,IAAI;AAC7D;AASO,SAAS,OAAO,QAAQ,OAAO,QAAQ;AAE5C,MAAI,OAAO,UAAU,cAAc,MAAM,WAAW;AAClD,WAAO,MAAM,QAAQ,UAAU,IAAI;AAAA,EACrC;AAEA,MAAI,OAAO,UAAU,YAAY;AAQ/B,UAAM,IAAI,UAAU;AACpB,QAAI,UAAU;AACd,QAAI,WAAW;AACf,QAAI,UAAU;AACd,WAAO,MAAM;AACX,YAAM,MAAM,MAAM;AAClB,YAAM,KAAK,OAAO;AAClB,UAAI,CAAC,SAAS;AAEZ,kBAAU;AACV,YAAI,OAAO,YAAY,OAAO,UAAU;AACtC,qBAAW,SAAS,eAAe,OAAO,GAAG,CAAC;AAC9C,cAAI,EAAG,QAAO,aAAa,UAAU,CAAC;AAAA,cACjC,QAAO,YAAY,QAAQ;AAChC,cAAI,cAAe,eAAc,QAAQ,OAAO,GAAG,CAAC;AACpD,oBAAU;AAAA,QACZ,OAAO;AACL,oBAAU,gBAAgB,QAAQ,KAAK,MAAM,CAAC;AAAA,QAChD;AACA;AAAA,MACF;AACA,UAAI,aAAa,SAAS,OAAO,YAAY,OAAO,WAAW;AAE7D,cAAM,MAAM,OAAO,GAAG;AACtB,YAAI,SAAS,SAAS,IAAK,UAAS,OAAO;AAC3C,YAAI,cAAe,eAAc,QAAQ,GAAG;AAC5C;AAAA,MACF;AAEA,iBAAW;AACX,gBAAU,gBAAgB,QAAQ,KAAK,SAAS,CAAC;AAAA,IACnD,CAAC;AACD,WAAO;AAAA,EACT;AAGA,MAAI,OAAO,UAAU,YAAY,OAAO,UAAU,UAAU;AAC1D,UAAM,WAAW,SAAS,eAAe,OAAO,KAAK,CAAC;AACtD,QAAI,OAAQ,QAAO,aAAa,UAAU,MAAM;AAAA,QAC3C,QAAO,YAAY,QAAQ;AAChC,WAAO;AAAA,EACT;AAGA,MAAI,SAAS,QAAQ,OAAO,UAAU,YAAY,MAAM,WAAW,GAAG;AACpE,QAAI,OAAQ,QAAO,aAAa,OAAO,MAAM;AAAA,QACxC,QAAO,YAAY,KAAK;AAC7B,WAAO;AAAA,EACT;AAEA,SAAO,gBAAgB,QAAQ,OAAO,MAAM,UAAU,IAAI;AAC5D;AAEA,SAAS,UAAU,OAAO;AACxB,MAAI,CAAC,SAAS,OAAO,UAAU,SAAU,QAAO;AAChD,MAAI,OAAO,SAAS,eAAe,iBAAiB,KAAM,QAAO;AACjE,SAAO,OAAO,MAAM,aAAa,YAAY,OAAO,MAAM,aAAa;AACzE;AAEA,SAAS,QAAQ,OAAO;AACtB,SAAO,CAAC,CAAC,SAAS,OAAO,UAAU,aAAa,MAAM,WAAW,QAAQ,SAAS;AACpF;AAGA,IAAM,iBAAiB,OAAO,eAAe;AAC7C,SAAS,YAAY,QAAQ;AAC3B,SAAO,kBACF,kBAAkB,cAClB,OAAO,YAAY;AAC1B;AAEA,SAAS,YAAY,OAAO;AAC1B,MAAI,SAAS,KAAM,QAAO,CAAC;AAC3B,SAAO,MAAM,QAAQ,KAAK,IAAI,QAAQ,CAAC,KAAK;AAC9C;AAEA,SAAS,cAAc,OAAO,QAAQ,KAAK;AACzC,MAAI,SAAS,QAAQ,OAAO,UAAU,UAAW,QAAO;AAExD,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,aAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,oBAAc,MAAM,CAAC,GAAG,QAAQ,GAAG;AAAA,IACrC;AACA,WAAO;AAAA,EACT;AAGA,MAAI,OAAO,UAAU,YAAY;AAC/B,kBAAc,MAAM,GAAG,QAAQ,GAAG;AAClC,WAAO;AAAA,EACT;AAEA,MAAI,OAAO,UAAU,YAAY,OAAO,UAAU,UAAU;AAC1D,QAAI,KAAK,SAAS,eAAe,OAAO,KAAK,CAAC,CAAC;AAC/C,WAAO;AAAA,EACT;AAEA,MAAI,UAAU,KAAK,GAAG;AAGpB,QAAI,MAAM,aAAa,MAAM,MAAM,WAAW,SAAS,GAAG;AACxD,YAAM,WAAW,MAAM,KAAK,MAAM,UAAU;AAC5C,eAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACxC,YAAI,KAAK,SAAS,CAAC,CAAC;AAAA,MACtB;AAAA,IACF,OAAO;AACL,UAAI,KAAK,KAAK;AAAA,IAChB;AACA,WAAO;AAAA,EACT;AAEA,MAAI,QAAQ,KAAK,GAAG;AAClB,QAAI,KAAK,UAAU,OAAO,QAAQ,YAAY,MAAM,CAAC,CAAC;AACtD,WAAO;AAAA,EACT;AAEA,MAAI,KAAK,SAAS,eAAe,OAAO,KAAK,CAAC,CAAC;AAC/C,SAAO;AACT;AAEA,SAAS,cAAc,GAAG,GAAG;AAC3B,MAAI,EAAE,WAAW,EAAE,OAAQ,QAAO;AAClC,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,QAAI,EAAE,CAAC,MAAM,EAAE,CAAC,EAAG,QAAO;AAAA,EAC5B;AACA,SAAO;AACT;AAEA,SAAS,gBAAgB,QAAQ,OAAO,SAAS,QAAQ;AAIvD,MAAI,CAAC,UAAU,OAAO,OAAO,iBAAiB,YAAY;AACxD,QAAI,SAAS;AACX,cAAQ,KAAK,sDAAsD,MAAM;AAAA,IAC3E;AACA,WAAO;AAAA,EACT;AAEA,QAAM,eAAe,UAAU;AAE/B,MAAI,SAAS,QAAQ,OAAO,UAAU,WAAW;AAC/C,UAAMC,YAAW,YAAY,OAAO;AACpC,aAAS,IAAI,GAAG,IAAIA,UAAS,QAAQ,KAAK;AACxC,YAAM,UAAUA,UAAS,CAAC;AAC1B,UAAI,QAAQ,eAAe,QAAQ;AACjC,oBAAY,OAAO;AACnB,eAAO,YAAY,OAAO;AAAA,MAC5B;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAEA,OAAK,OAAO,UAAU,YAAY,OAAO,UAAU,aAC5C,WAAW,CAAC,MAAM,QAAQ,OAAO,KAAK,QAAQ,aAAa,GAAG;AACnE,UAAM,OAAO,OAAO,KAAK;AACzB,QAAI,QAAQ,SAAS,KAAM,SAAQ,OAAO;AAC1C,WAAO;AAAA,EACT;AAGA,MAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,MAAM,WAAW,KAAK,CAAC,MAAM,QAAQ,KAAK,GAAG;AAC9F,QAAI,UAAU,QAAS,QAAO;AAC9B,QAAI,WAAW,CAAC,MAAM,QAAQ,OAAO,KAAK,QAAQ,WAAW,GAAG;AAE9D,UAAI,QAAQ,eAAe,QAAQ;AACjC,oBAAY,OAAO;AACnB,eAAO,aAAa,OAAO,OAAO;AAAA,MACpC,OAAO;AACL,YAAI,aAAc,QAAO,aAAa,OAAO,YAAY;AAAA,YACpD,QAAO,YAAY,KAAK;AAAA,MAC/B;AACA,aAAO;AAAA,IACT;AAAA,EACF;AAEA,QAAM,WAAW,cAAc,OAAO,QAAQ,CAAC,CAAC;AAChD,QAAM,WAAW,YAAY,OAAO;AAEpC,MAAI,cAAc,UAAU,QAAQ,GAAG;AACrC,WAAO;AAAA,EACT;AAIA,QAAM,SAAS,SAAS;AACxB,WAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACxC,UAAM,UAAU,SAAS,CAAC;AAC1B,QAAI,QAAQ,eAAe,OAAQ;AACnC,QAAI,QAAQ;AACZ,aAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,UAAI,SAAS,CAAC,MAAM,SAAS;AAAE,gBAAQ;AAAM;AAAA,MAAO;AAAA,IACtD;AACA,QAAI,CAAC,OAAO;AACV,kBAAY,OAAO;AACnB,aAAO,YAAY,OAAO;AAAA,IAC5B;AAAA,EACF;AAEA,MAAI,MAAM;AACV,WAAS,IAAI,SAAS,SAAS,GAAG,KAAK,GAAG,KAAK;AAC7C,UAAM,OAAO,SAAS,CAAC;AACvB,QAAI,KAAK,eAAe,UAAU,KAAK,gBAAgB,KAAK;AAE1D,UAAI,OAAO,IAAI,eAAe,OAAQ,OAAM;AAC5C,UAAI,IAAK,QAAO,aAAa,MAAM,GAAG;AAAA,UACjC,QAAO,YAAY,IAAI;AAAA,IAC9B;AACA,UAAM;AAAA,EACR;AAEA,MAAI,SAAS,WAAW,EAAG,QAAO;AAClC,SAAO,SAAS,WAAW,IAAI,SAAS,CAAC,IAAI;AAC/C;AAWO,SAAS,SAAS,QAAQ,OAAO,SAAS;AAC/C,QAAM,QAAQ,SAAS;AACvB,QAAM,MAAM,SAAS,OAAO;AAE5B,QAAM,WAAW,CAAC,QAAQ,WAAW;AACnC,QAAI,QAAQ,CAAC;AACb,QAAI,cAAc,CAAC;AACnB,QAAI,aAAa,CAAC;AAElB,QAAI,aAAa,SAAS,CAAC,MAAM,oBAAI,IAAI,IAAI;AAE7C,UAAM,YAAY,SAAS,cAAc,OAAO;AAChD,WAAO,aAAa,WAAW,UAAU,IAAI;AAE7C,WAAO,MAAM;AACX,YAAM,WAAW,OAAO,KAAK,CAAC;AAC9B,UAAI,OAAO;AACT,uBAAe,QAAQ,WAAW,OAAO,UAAU,aAAa,YAAY,OAAO,OAAO,UAAU;AAAA,MACtG,OAAO;AACL,sBAAc,QAAQ,WAAW,OAAO,UAAU,aAAa,YAAY,KAAK;AAAA,MAClF;AAGA,cAAQ,SAAS,SAAS,IAAI,SAAS,MAAM,IAAI;AAAA,IACnD,CAAC;AAED,WAAO;AAAA,EACT;AACA,WAAS,YAAY;AACrB,SAAO;AACT;AAEA,SAAS,cAAc,QAAQ,WAAW,UAAU,UAAU,aAAa,YAAY,OAAO;AAC5F,QAAM,SAAS,SAAS;AACxB,QAAM,SAAS,SAAS;AAExB,MAAI,WAAW,GAAG;AAIhB,QAAI,SAAS,GAAG;AACd,eAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,YAAI,WAAW,CAAC,EAAG,YAAW,CAAC,EAAE;AAAA,MACnC;AACA,eAAS,IAAI,SAAS,GAAG,KAAK,GAAG,KAAK;AACpC,cAAM,OAAO,YAAY,CAAC;AAC1B,YAAI,MAAM;AAIR,sBAAY,IAAI;AAChB,cAAI,KAAK,eAAe,OAAQ,QAAO,YAAY,IAAI;AAAA,QACzD;AAAA,MACF;AACA,kBAAY,SAAS;AACrB,iBAAW,SAAS;AAAA,IACtB;AACA;AAAA,EACF;AAEA,MAAI,WAAW,GAAG;AAEhB,UAAM,OAAO,SAAS,uBAAuB;AAC7C,aAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,YAAM,OAAO,SAAS,CAAC;AACvB,YAAM,OAAO,iBAAiB,aAAW;AACvC,mBAAW,CAAC,IAAI;AAChB,eAAO,MAAM,MAAM,CAAC;AAAA,MACtB,CAAC;AACD,kBAAY,CAAC,IAAI;AACjB,WAAK,YAAY,IAAI;AAAA,IACvB;AACA,WAAO,aAAa,MAAM,SAAS;AACnC;AAAA,EACF;AAGA,MAAI,QAAQ;AACZ,QAAM,SAAS,KAAK,IAAI,QAAQ,MAAM;AACtC,SAAO,QAAQ,UAAU,SAAS,KAAK,MAAM,SAAS,KAAK,EAAG;AAG9D,MAAI,UAAU,UAAU,UAAU,OAAQ;AAE1C,MAAI,SAAS,SAAS;AACtB,MAAI,SAAS,SAAS;AACtB,SAAO,UAAU,SAAS,UAAU,SAAS,SAAS,MAAM,MAAM,SAAS,MAAM,GAAG;AAClF;AACA;AAAA,EACF;AAGA,QAAM,YAAY,IAAI,MAAM,MAAM;AAClC,QAAM,aAAa,IAAI,MAAM,MAAM;AACnC,WAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC9B,cAAU,CAAC,IAAI,YAAY,CAAC;AAC5B,eAAW,CAAC,IAAI,WAAW,CAAC;AAAA,EAC9B;AACA,WAAS,IAAI,SAAS,GAAG,IAAI,QAAQ,KAAK;AAExC,UAAM,OAAO,SAAS,KAAK,IAAI,SAAS;AACxC,cAAU,CAAC,IAAI,YAAY,IAAI;AAC/B,eAAW,CAAC,IAAI,WAAW,IAAI;AAAA,EACjC;AAGA,QAAM,YAAY,SAAS,QAAQ;AACnC,QAAM,YAAY,SAAS,QAAQ;AAEnC,MAAI,cAAc,GAAG;AAEnB,aAAS,IAAI,OAAO,KAAK,QAAQ,KAAK;AACpC,iBAAW,CAAC,IAAI;AAChB,UAAI,YAAY,CAAC,EAAG,aAAY,YAAY,CAAC,CAAC;AAC9C,UAAI,YAAY,CAAC,GAAG,WAAY,aAAY,CAAC,EAAE,WAAW,YAAY,YAAY,CAAC,CAAC;AAAA,IACtF;AAAA,EACF,WAAW,cAAc,GAAG;AAE1B,UAAM,SAAS,QAAQ,UAAU,UAAU,SAAS,CAAC,IAAI,UAAU,SAAS,CAAC,IAAI;AACjF,UAAM,OAAO,SAAS,uBAAuB;AAC7C,aAAS,IAAI,OAAO,KAAK,QAAQ,KAAK;AACpC,YAAM,OAAO,SAAS,CAAC;AACvB,YAAM,MAAM;AACZ,gBAAU,CAAC,IAAI,iBAAiB,aAAW;AACzC,mBAAW,GAAG,IAAI;AAClB,eAAO,MAAM,MAAM,GAAG;AAAA,MACxB,CAAC;AACD,WAAK,YAAY,UAAU,CAAC,CAAC;AAAA,IAC/B;AACA,WAAO,aAAa,MAAM,MAAM;AAAA,EAClC,OAAO;AAEL;AAAA,MAAiB;AAAA,MAAQ;AAAA,MAAW;AAAA,MAAU;AAAA,MAAU;AAAA,MAAa;AAAA,MACpD;AAAA,MAAO;AAAA,MAAO;AAAA,MAAQ;AAAA,MAAQ;AAAA,MAAW;AAAA,IAAU;AAAA,EACtE;AAGA,cAAY,SAAS;AACrB,aAAW,SAAS;AACpB,WAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,gBAAY,CAAC,IAAI,UAAU,CAAC;AAC5B,eAAW,CAAC,IAAI,WAAW,CAAC;AAAA,EAC9B;AACF;AAEA,SAAS,iBAAiB,QAAQ,WAAW,UAAU,UAAU,aAAa,YACpD,OAAO,OAAO,QAAQ,QAAQ,WAAW,YAAY;AAE7E,QAAM,YAAY,oBAAI,IAAI;AAC1B,WAAS,IAAI,OAAO,KAAK,QAAQ,KAAK;AACpC,cAAU,IAAI,SAAS,CAAC,GAAG,CAAC;AAAA,EAC9B;AAGA,QAAM,SAAS,SAAS,QAAQ;AAChC,QAAM,aAAa,IAAI,WAAW,MAAM;AACxC,aAAW,KAAK,EAAE;AAElB,WAAS,IAAI,OAAO,KAAK,QAAQ,KAAK;AACpC,UAAM,SAAS,UAAU,IAAI,SAAS,CAAC,CAAC;AACxC,QAAI,WAAW,QAAW;AACxB,gBAAU,OAAO,SAAS,CAAC,CAAC;AAC5B,gBAAU,CAAC,IAAI,YAAY,MAAM;AACjC,iBAAW,CAAC,IAAI,WAAW,MAAM;AACjC,iBAAW,IAAI,KAAK,IAAI;AAAA,IAC1B;AAAA,EACF;AAGA,aAAW,CAAC,EAAE,MAAM,KAAK,WAAW;AAClC,eAAW,MAAM,IAAI;AACrB,QAAI,YAAY,MAAM,EAAG,aAAY,YAAY,MAAM,CAAC;AACxD,QAAI,YAAY,MAAM,GAAG,WAAY,aAAY,MAAM,EAAE,WAAW,YAAY,YAAY,MAAM,CAAC;AAAA,EACrG;AAIA,QAAM,cAAc,SAAS,WAAW,YAAY,MAAM;AAG1D,QAAM,QAAQ,IAAI,WAAW,MAAM;AAEnC,MAAI,cAAc,GAAG;AACnB,UAAM,MAAM,IAAI,WAAW,WAAW;AACtC,UAAM,WAAW,IAAI,WAAW,WAAW;AAC3C,QAAI,IAAI;AACR,aAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,UAAI,WAAW,CAAC,MAAM,IAAI;AACxB,YAAI,CAAC,IAAI,WAAW,CAAC;AACrB,iBAAS,CAAC,IAAI;AACd;AAAA,MACF;AAAA,IACF;AACA,UAAM,YAAY,KAAK,KAAK,WAAW;AACvC,aAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AACzC,YAAM,SAAS,UAAU,CAAC,CAAC,CAAC,IAAI;AAAA,IAClC;AAAA,EACF,WAAW,gBAAgB,GAAG;AAE5B,aAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,UAAI,WAAW,CAAC,MAAM,IAAI;AAAE,cAAM,CAAC,IAAI;AAAG;AAAA,MAAO;AAAA,IACnD;AAAA,EACF;AAGA,WAAS,IAAI,OAAO,KAAK,QAAQ,KAAK;AACpC,QAAI,CAAC,UAAU,CAAC,GAAG;AACjB,YAAM,OAAO,SAAS,CAAC;AACvB,YAAM,MAAM;AACZ,gBAAU,CAAC,IAAI,iBAAiB,aAAW;AACzC,mBAAW,GAAG,IAAI;AAClB,eAAO,MAAM,MAAM,GAAG;AAAA,MACxB,CAAC;AAAA,IACH;AAAA,EACF;AAGA,MAAI,cAAc,SAAS,IAAI,UAAU,UAAU,UAAU,SAAS,CAAC,IACnE,UAAU,SAAS,CAAC,IAAI;AAE5B,WAAS,IAAI,QAAQ,KAAK,OAAO,KAAK;AACpC,UAAM,KAAK,IAAI;AACf,QAAI,WAAW,EAAE,MAAM,MAAM,CAAC,MAAM,EAAE,GAAG;AAGvC,UAAI,eAAe,YAAY,eAAe,OAAQ,eAAc;AACpE,aAAO,aAAa,UAAU,CAAC,GAAG,WAAW;AAAA,IAC/C;AACA,kBAAc,UAAU,CAAC;AAAA,EAC3B;AACF;AAEA,SAAS,WAAW,KAAK,KAAK;AAC5B,MAAI,IAAI;AACR,WAAS,IAAI,GAAG,IAAI,KAAK,IAAK,KAAI,IAAI,CAAC,MAAM,GAAI;AACjD,SAAO;AACT;AAIA,SAAS,KAAK,KAAK,KAAK;AACtB,MAAI,QAAQ,EAAG,QAAO,CAAC;AACvB,MAAI,QAAQ,EAAG,QAAO,CAAC,CAAC;AAExB,QAAM,QAAQ,IAAI,WAAW,GAAG;AAChC,QAAM,eAAe,IAAI,WAAW,GAAG;AACvC,MAAI,UAAU;AACd,QAAM,CAAC,IAAI;AACX,eAAa,CAAC,IAAI;AAElB,WAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,QAAI,IAAI,CAAC,IAAI,IAAI,MAAM,UAAU,CAAC,CAAC,GAAG;AACpC,mBAAa,CAAC,IAAI,MAAM,UAAU,CAAC;AACnC,YAAM,SAAS,IAAI;AAAA,IACrB,OAAO;AACL,UAAI,KAAK,GAAG,KAAK,UAAU;AAC3B,aAAO,KAAK,IAAI;AACd,cAAM,MAAO,KAAK,MAAO;AACzB,YAAI,IAAI,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,EAAG,MAAK,MAAM;AAAA,YACpC,MAAK;AAAA,MACZ;AACA,YAAM,EAAE,IAAI;AACZ,mBAAa,CAAC,IAAI,KAAK,IAAI,MAAM,KAAK,CAAC,IAAI;AAAA,IAC7C;AAAA,EACF;AAEA,QAAM,SAAS,IAAI,MAAM,OAAO;AAChC,MAAI,IAAI,MAAM,UAAU,CAAC;AACzB,WAAS,IAAI,UAAU,GAAG,KAAK,GAAG,KAAK;AACrC,WAAO,CAAC,IAAI;AACZ,QAAI,aAAa,CAAC;AAAA,EACpB;AACA,SAAO;AACT;AAYA,SAAS,oBAAoB;AAC3B,SAAO,SAAS,cAAc,GAAG;AACnC;AAcA,SAAS,UAAU,QAAQ,QAAQ,WAAW,KAAK;AACjD,MAAI,IAAI;AACR,SAAO,KAAK,MAAM,WAAW;AAC3B,UAAM,OAAO,EAAE;AACf,WAAO,aAAa,GAAG,GAAG;AAC1B,QAAI;AAAA,EACN;AACF;AAGA,SAAS,iBAAiB,QAAQ,QAAQ,WAAW;AACnD,MAAI,IAAI;AACR,SAAO,KAAK,MAAM,WAAW;AAC3B,UAAM,OAAO,EAAE;AAMf,gBAAY,CAAC;AACb,WAAO,YAAY,CAAC;AACpB,QAAI;AAAA,EACN;AACF;AAGA,SAAS,iBAAiB,QAAQ,MAAM,KAAK,OAAO,YAAY,OAAO,WAAW,YAAY,SAAS;AACrG,MAAI;AACJ,MAAI,YAAY;AACd,UAAM,MAAM,MAAM,IAAI;AACtB,UAAM,UAAU,QAAQ,IAAI;AAC5B,eAAW;AACX,eAAW,IAAI,KAAK,EAAE,QAAQ,CAAC;AAAA,EACjC,OAAO;AACL,eAAW;AAAA,EACb;AACA,QAAM,SAAS,kBAAkB;AACjC,SAAO,YAAY,MAAM;AACzB,QAAM,SAAS,iBAAiB,aAAW;AACzC,eAAW,GAAG,IAAI;AAClB,WAAO,MAAM,UAAU,GAAG;AAAA,EAC5B,CAAC;AAED,SAAO,YAAY,MAAM;AACzB,YAAU,GAAG,IAAI;AACnB;AAEA,SAAS,eAAe,QAAQ,WAAW,UAAU,UAAU,aAAa,YAAY,OAAO,OAAO,YAAY;AAChH,QAAM,SAAS,SAAS;AACxB,QAAM,SAAS,SAAS;AAGxB,MAAI,WAAW,GAAG;AAChB,QAAI,SAAS,GAAG;AACd,eAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,YAAI,WAAW,CAAC,EAAG,YAAW,CAAC,EAAE;AAAA,MACnC;AAEA,UAAI,YAAY,CAAC,GAAG;AAClB,yBAAiB,QAAQ,YAAY,CAAC,GAAG,SAAS;AAAA,MACpD;AACA,kBAAY,SAAS;AACrB,iBAAW,SAAS;AACpB,UAAI,WAAY,YAAW,MAAM;AAAA,IACnC;AACA;AAAA,EACF;AAGA,MAAI,WAAW,GAAG;AAChB,UAAM,OAAO,SAAS,uBAAuB;AAC7C,aAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,uBAAiB,MAAM,SAAS,CAAC,GAAG,GAAG,OAAO,YAAY,OAAO,aAAa,YAAY,MAAM;AAAA,IAClG;AACA,WAAO,aAAa,MAAM,SAAS;AACnC;AAAA,EACF;AAGA,MAAI,QAAQ;AACZ,QAAM,SAAS,KAAK,IAAI,QAAQ,MAAM;AACtC,SAAO,QAAQ,QAAQ;AACrB,QAAI,SAAS,KAAK,MAAM,SAAS,KAAK,GAAG;AAAE;AAAS;AAAA,IAAU;AAC9D,UAAM,SAAS,MAAM,SAAS,KAAK,CAAC;AACpC,UAAM,SAAS,MAAM,SAAS,KAAK,CAAC;AACpC,QAAI,WAAW,OAAQ;AACvB,QAAI,WAAY,YAAW,IAAI,MAAM,EAAE,QAAQ,IAAI,SAAS,KAAK,CAAC;AAClE;AAAA,EACF;AAGA,MAAI,SAAS,SAAS;AACtB,MAAI,SAAS,SAAS;AACtB,SAAO,UAAU,SAAS,UAAU,OAAO;AACzC,QAAI,SAAS,MAAM,MAAM,SAAS,MAAM,GAAG;AAAE;AAAU;AAAU;AAAA,IAAU;AAC3E,UAAM,SAAS,MAAM,SAAS,MAAM,CAAC;AACrC,UAAM,SAAS,MAAM,SAAS,MAAM,CAAC;AACrC,QAAI,WAAW,OAAQ;AACvB,QAAI,WAAY,YAAW,IAAI,MAAM,EAAE,QAAQ,IAAI,SAAS,MAAM,CAAC;AACnE;AACA;AAAA,EACF;AAEA,MAAI,QAAQ,UAAU,QAAQ,OAAQ;AAEtC,QAAM,YAAY,IAAI,MAAM,MAAM;AAClC,QAAM,aAAa,IAAI,MAAM,MAAM;AACnC,WAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC9B,cAAU,CAAC,IAAI,YAAY,CAAC;AAC5B,eAAW,CAAC,IAAI,WAAW,CAAC;AAAA,EAC9B;AACA,WAAS,IAAI,SAAS,GAAG,IAAI,QAAQ,KAAK;AACxC,UAAM,OAAO,SAAS,KAAK,IAAI,SAAS;AACxC,cAAU,CAAC,IAAI,YAAY,IAAI;AAC/B,eAAW,CAAC,IAAI,WAAW,IAAI;AAAA,EACjC;AAEA,QAAM,YAAY,SAAS,QAAQ;AACnC,QAAM,YAAY,SAAS,QAAQ;AAGnC,MAAI,cAAc,GAAG;AACnB,UAAMC,OAAM,SAAS,IAAI,UAAU,UAAU,SAAS,CAAC,IAAI,UAAU,SAAS,CAAC,IAAI;AACnF,UAAM,OAAO,SAAS,uBAAuB;AAC7C,aAAS,IAAI,OAAO,KAAK,QAAQ,KAAK;AACpC,uBAAiB,MAAM,SAAS,CAAC,GAAG,GAAG,OAAO,YAAY,OAAO,WAAW,YAAY,MAAM;AAAA,IAChG;AACA,WAAO,aAAa,MAAMA,IAAG;AAC7B,cAAU,aAAa,YAAY,WAAW,YAAY,MAAM;AAChE;AAAA,EACF;AAGA,MAAI,cAAc,GAAG;AACnB,aAAS,IAAI,OAAO,KAAK,QAAQ,KAAK;AACpC,iBAAW,CAAC,IAAI;AAIhB,YAAM,WAAW,qBAAqB,QAAQ,YAAY,CAAC,GAAG,aAAa,GAAG,SAAS;AACvF,uBAAiB,QAAQ,YAAY,CAAC,GAAG,QAAQ;AACjD,UAAI,WAAY,YAAW,OAAO,MAAM,SAAS,CAAC,CAAC,CAAC;AAAA,IACtD;AACA,cAAU,aAAa,YAAY,WAAW,YAAY,MAAM;AAChE;AAAA,EACF;AAMA,MAAI,cAAc,aAAa,aAAa,KAAK,aAAa,KAAK,IAAI,WAAW,GAAG,GAAG;AAEtF,QAAI,gBAAgB;AACpB,QAAI,MAAM,IAAI,MAAM;AACpB,aAAS,IAAI,GAAG,IAAI,aAAa,iBAAiB,GAAG,KAAK;AACxD,YAAM,SAAS,MAAM,SAAS,QAAQ,CAAC,CAAC;AACxC,YAAM,SAAS,MAAM,SAAS,QAAQ,CAAC,CAAC;AACxC,UAAI,WAAW,QAAQ;AACrB,YAAI,kBAAkB,EAAG,OAAM;AAAA,iBACtB,kBAAkB,EAAG,OAAM;AACpC;AAAA,MACF;AAAA,IACF;AAGA,QAAI,kBAAkB,GAAG;AACvB,YAAM,KAAK,QAAQ,KAAK,KAAK,QAAQ;AACrC,YAAM,UAAU,MAAM,SAAS,EAAE,CAAC,GAAG,UAAU,MAAM,SAAS,EAAE,CAAC;AACjE,YAAM,UAAU,MAAM,SAAS,EAAE,CAAC,GAAG,UAAU,MAAM,SAAS,EAAE,CAAC;AAEjE,UAAI,YAAY,WAAW,YAAY,SAAS;AAG9C,iBAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC9B,oBAAU,CAAC,IAAI,YAAY,CAAC;AAC5B,qBAAW,CAAC,IAAI,WAAW,CAAC;AAAA,QAC9B;AACA,iBAAS,IAAI,OAAO,KAAK,QAAQ,KAAK;AACpC,oBAAU,CAAC,IAAI,YAAY,CAAC;AAC5B,qBAAW,CAAC,IAAI,WAAW,CAAC;AAAA,QAC9B;AACA,iBAAS,IAAI,SAAS,GAAG,IAAI,QAAQ,KAAK;AACxC,gBAAM,OAAO,SAAS,KAAK,IAAI,SAAS;AACxC,oBAAU,CAAC,IAAI,YAAY,IAAI;AAC/B,qBAAW,CAAC,IAAI,WAAW,IAAI;AAAA,QACjC;AAGA,cAAM,OAAO,UAAU,EAAE;AAAG,kBAAU,EAAE,IAAI,UAAU,EAAE;AAAG,kBAAU,EAAE,IAAI;AAC3E,cAAM,OAAO,WAAW,EAAE;AAAG,mBAAW,EAAE,IAAI,WAAW,EAAE;AAAG,mBAAW,EAAE,IAAI;AAG/E,YAAI,YAAY;AACd,cAAI,SAAS,EAAE,MAAM,SAAS,EAAE,GAAG;AACjC,kBAAM,IAAI,MAAM,SAAS,EAAE,CAAC;AAC5B,kBAAM,QAAQ,WAAW,IAAI,CAAC;AAC9B,gBAAI,MAAO,OAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;AAAA,UAC3C;AACA,cAAI,SAAS,EAAE,MAAM,SAAS,EAAE,GAAG;AACjC,kBAAM,IAAI,MAAM,SAAS,EAAE,CAAC;AAC5B,kBAAM,QAAQ,WAAW,IAAI,CAAC;AAC9B,gBAAI,MAAO,OAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;AAAA,UAC3C;AAAA,QACF;AAQA,cAAM,aAAc,OAAO,KAAK,KAAO,OAAO,KAAK;AACnD,cAAM,KAAK,KAAK,IAAI,IAAI,EAAE,GAAG,KAAK,KAAK,IAAI,IAAI,EAAE;AAEjD,YAAI,YAAY;AAEd,gBAAM,QAAQ,qBAAqB,QAAQ,YAAY,EAAE,GAAG,aAAa,IAAI,SAAS;AACtF,oBAAU,QAAQ,YAAY,EAAE,GAAG,OAAO,YAAY,EAAE,CAAC;AAAA,QAC3D,OAAO;AAGL,gBAAM,OAAO,qBAAqB,QAAQ,YAAY,EAAE,GAAG,aAAa,IAAI,SAAS;AAErF,gBAAM,cAAc,SAAS,cAAc,KAAK;AAChD,iBAAO,aAAa,aAAa,YAAY,EAAE,CAAC;AAGhD,oBAAU,QAAQ,YAAY,EAAE,GAAG,MAAM,YAAY,EAAE,CAAC;AAExD,gBAAM,OAAO,qBAAqB,QAAQ,YAAY,EAAE,GAAG,aAAa,IAAI,SAAS;AAErF,oBAAU,QAAQ,YAAY,EAAE,GAAG,MAAM,WAAW;AACpD,iBAAO,YAAY,WAAW;AAAA,QAChC;AAEA,kBAAU,aAAa,YAAY,WAAW,YAAY,MAAM;AAChE;AAAA,MACF;AAAA,IACF;AAKA,QAAI,iBAAiB,KAAK,iBAAiB,WAAW;AAOpD,YAAM,UAAU;AAChB,UAAI,WAAW;AACf,UAAI,UAAU,IAAI,QAAQ;AAC1B,UAAI,SAAS;AAGb,YAAM,eAAe,MAAM,SAAS,QAAQ,OAAO,CAAC;AAEpD,UAAI,UAAU;AACd,eAAS,IAAI,SAAS,IAAI,WAAW,KAAK;AACxC,YAAI,MAAM,SAAS,QAAQ,CAAC,CAAC,MAAM,cAAc;AAAE,oBAAU;AAAG;AAAA,QAAO;AAAA,MACzE;AACA,UAAI,UAAU,SAAS;AAErB,YAAI,QAAQ;AACZ,iBAAS,IAAI,SAAS,IAAI,SAAS,KAAK;AACtC,cAAI,MAAM,SAAS,QAAQ,IAAI,CAAC,CAAC,MAAM,MAAM,SAAS,QAAQ,CAAC,CAAC,GAAG;AAAE,oBAAQ;AAAO;AAAA,UAAO;AAAA,QAC7F;AACA,YAAI,OAAO;AAET,cAAI,aAAa;AACjB,mBAAS,IAAI,UAAU,GAAG,IAAI,WAAW,KAAK;AAC5C,gBAAI,MAAM,SAAS,QAAQ,CAAC,CAAC,MAAM,MAAM,SAAS,QAAQ,CAAC,CAAC,GAAG;AAAE,2BAAa;AAAO;AAAA,YAAO;AAAA,UAC9F;AACA,cAAI,YAAY;AACd,qBAAS;AACT,sBAAU,QAAQ;AAClB,oBAAQ,QAAQ;AAChB,uBAAW;AAAA,UACb;AAAA,QACF;AAAA,MACF;AAEA,UAAI,CAAC,QAAQ;AAEX,cAAM,gBAAgB,MAAM,SAAS,QAAQ,OAAO,CAAC;AACrD,YAAI,SAAS;AACb,iBAAS,IAAI,SAAS,IAAI,WAAW,KAAK;AACxC,cAAI,MAAM,SAAS,QAAQ,CAAC,CAAC,MAAM,eAAe;AAAE,qBAAS;AAAG;AAAA,UAAO;AAAA,QACzE;AACA,YAAI,SAAS,SAAS;AAEpB,cAAI,QAAQ;AACZ,mBAAS,IAAI,SAAS,IAAI,QAAQ,KAAK;AACrC,gBAAI,MAAM,SAAS,QAAQ,CAAC,CAAC,MAAM,MAAM,SAAS,QAAQ,IAAI,CAAC,CAAC,GAAG;AAAE,sBAAQ;AAAO;AAAA,YAAO;AAAA,UAC7F;AACA,cAAI,OAAO;AACT,gBAAI,aAAa;AACjB,qBAAS,IAAI,SAAS,GAAG,IAAI,WAAW,KAAK;AAC3C,kBAAI,MAAM,SAAS,QAAQ,CAAC,CAAC,MAAM,MAAM,SAAS,QAAQ,CAAC,CAAC,GAAG;AAAE,6BAAa;AAAO;AAAA,cAAO;AAAA,YAC9F;AACA,gBAAI,YAAY;AACd,uBAAS;AACT,wBAAU,QAAQ;AAClB,sBAAQ,QAAQ;AAChB,yBAAW;AAAA,YACb;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAEA,UAAI,QAAQ;AAEV,iBAAS,IAAI,OAAO,KAAK,QAAQ,KAAK;AACpC,oBAAU,CAAC,IAAI,YAAY,CAAC;AAC5B,qBAAW,CAAC,IAAI,WAAW,CAAC;AAAA,QAC9B;AAGA,cAAM,cAAc,UAAU,OAAO;AACrC,cAAM,eAAe,WAAW,OAAO;AAEvC,YAAI,UAAU,OAAO;AAEnB,mBAAS,IAAI,SAAS,IAAI,OAAO,KAAK;AACpC,sBAAU,CAAC,IAAI,UAAU,IAAI,CAAC;AAC9B,uBAAW,CAAC,IAAI,WAAW,IAAI,CAAC;AAAA,UAClC;AAAA,QACF,OAAO;AAEL,mBAAS,IAAI,SAAS,IAAI,OAAO,KAAK;AACpC,sBAAU,CAAC,IAAI,UAAU,IAAI,CAAC;AAC9B,uBAAW,CAAC,IAAI,WAAW,IAAI,CAAC;AAAA,UAClC;AAAA,QACF;AACA,kBAAU,KAAK,IAAI;AACnB,mBAAW,KAAK,IAAI;AAGpB,YAAI,YAAY;AACd,mBAAS,IAAI,OAAO,KAAK,QAAQ,KAAK;AACpC,kBAAM,MAAM,MAAM,SAAS,CAAC,CAAC;AAC7B,gBAAI,SAAS,CAAC,MAAM,SAAS,CAAC,GAAG;AAE/B,oBAAM,QAAQ,WAAW,IAAI,GAAG;AAChC,kBAAI,MAAO,OAAM,QAAQ,IAAI,SAAS,CAAC,CAAC;AAAA,YAC1C;AAAA,UACF;AAAA,QACF;AAGA,cAAM,WAAW,qBAAqB,QAAQ,aAAa,aAAa,SAAS,SAAS;AAE1F,YAAIA;AACJ,YAAI,QAAQ,IAAI,QAAQ;AACtB,UAAAA,OAAM,UAAU,QAAQ,CAAC;AAAA,QAC3B,OAAO;AACL,UAAAA,OAAM;AAAA,QACR;AAEA,YAAI,SAAS,SAAS,KAAMA,QAAOA,KAAI,eAAe,QAAS;AAC7D,UAAAA,OAAM;AAAA,QACR;AACA,kBAAU,QAAQ,aAAa,UAAUA,IAAG;AAE5C,kBAAU,aAAa,YAAY,WAAW,YAAY,MAAM;AAChE;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAGA,QAAM,YAAY,oBAAI,IAAI;AAC1B,WAAS,IAAI,OAAO,KAAK,QAAQ,KAAK;AACpC,cAAU,IAAI,MAAM,SAAS,CAAC,CAAC,GAAG,CAAC;AAAA,EACrC;AAEA,QAAM,aAAa,IAAI,WAAW,SAAS;AAC3C,aAAW,KAAK,EAAE;AAElB,WAAS,IAAI,OAAO,KAAK,QAAQ,KAAK;AACpC,UAAM,MAAM,MAAM,SAAS,CAAC,CAAC;AAC7B,UAAM,SAAS,UAAU,IAAI,GAAG;AAChC,QAAI,WAAW,QAAW;AACxB,gBAAU,OAAO,GAAG;AACpB,gBAAU,CAAC,IAAI,YAAY,MAAM;AACjC,iBAAW,CAAC,IAAI,WAAW,MAAM;AACjC,iBAAW,IAAI,KAAK,IAAI;AACxB,UAAI,cAAc,SAAS,CAAC,MAAM,SAAS,MAAM,GAAG;AAClD,mBAAW,IAAI,GAAG,EAAE,QAAQ,IAAI,SAAS,CAAC,CAAC;AAAA,MAC7C;AAAA,IACF;AAAA,EACF;AAGA,QAAM,iBAAiB,CAAC,GAAG,UAAU,OAAO,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AACnE,aAAW,UAAU,gBAAgB;AACnC,eAAW,MAAM,IAAI;AAIrB,UAAM,WAAW,qBAAqB,QAAQ,YAAY,MAAM,GAAG,aAAa,QAAQ,SAAS;AACjG,qBAAiB,QAAQ,YAAY,MAAM,GAAG,QAAQ;AACtD,QAAI,WAAY,YAAW,OAAO,MAAM,SAAS,MAAM,CAAC,CAAC;AAAA,EAC3D;AAGA,WAAS,IAAI,OAAO,KAAK,QAAQ,KAAK;AACpC,QAAI,CAAC,UAAU,CAAC,GAAG;AACjB,YAAM,OAAO,SAAS,uBAAuB;AAC7C,uBAAiB,MAAM,SAAS,CAAC,GAAG,GAAG,OAAO,YAAY,OAAO,WAAW,YAAY,MAAM;AAE9F,gBAAU,CAAC,EAAE,QAAQ;AAAA,IACvB;AAAA,EACF;AAGA,MAAI,cAAc;AAClB,MAAI,gBAAgB;AACpB,MAAI,aAAa;AACjB,WAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAClC,QAAI,WAAW,CAAC,MAAM,IAAI;AACxB;AACA,UAAI,WAAW,CAAC,KAAK,WAAY,iBAAgB;AACjD,mBAAa,WAAW,CAAC;AAAA,IAC3B;AAAA,EACF;AAEA,QAAM,QAAQ,IAAI,WAAW,SAAS;AAEtC,MAAI,eAAe;AACjB,aAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAClC,UAAI,WAAW,CAAC,MAAM,GAAI,OAAM,CAAC,IAAI;AAAA,IACvC;AAAA,EACF,WAAW,cAAc,GAAG;AAC1B,UAAM,MAAM,IAAI,WAAW,WAAW;AACtC,UAAM,WAAW,IAAI,WAAW,WAAW;AAC3C,QAAI,IAAI;AACR,aAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAClC,UAAI,WAAW,CAAC,MAAM,IAAI;AACxB,YAAI,CAAC,IAAI,WAAW,CAAC;AACrB,iBAAS,CAAC,IAAI;AACd;AAAA,MACF;AAAA,IACF;AACA,UAAM,YAAY,KAAK,KAAK,WAAW;AACvC,aAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AACzC,YAAM,SAAS,UAAU,CAAC,CAAC,CAAC,IAAI;AAAA,IAClC;AAAA,EACF,WAAW,gBAAgB,GAAG;AAC5B,aAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAClC,UAAI,WAAW,CAAC,MAAM,IAAI;AAAE,cAAM,CAAC,IAAI;AAAG;AAAA,MAAO;AAAA,IACnD;AAAA,EACF;AAMA,YAAU,aAAa,YAAY,WAAW,YAAY,MAAM;AAIhE,MAAI,MAAM,SAAS,IAAI,UAAU,YAAY,SAAS,CAAC,IACnD,YAAY,SAAS,CAAC,IAAI;AAC9B,WAAS,IAAI,QAAQ,KAAK,OAAO,KAAK;AACpC,UAAM,KAAK,IAAI;AACf,UAAM,SAAS,YAAY,CAAC;AAE5B,QAAI,WAAW,EAAE,MAAM,IAAI;AAEzB,UAAI,OAAO,OAAO;AAChB,eAAO,aAAa,OAAO,OAAO,GAAG;AACrC,eAAO,OAAO;AAAA,MAChB;AAAA,IACF,WAAW,CAAC,MAAM,EAAE,GAAG;AAErB,YAAM,iBAAiB,qBAAqB,QAAQ,QAAQ,aAAa,GAAG,SAAS;AACrF,gBAAU,QAAQ,QAAQ,gBAAgB,GAAG;AAAA,IAC/C;AACA,UAAM;AAAA,EACR;AACF;AAKA,SAAS,qBAAqB,QAAQ,QAAQ,aAAa,KAAK,WAAW;AAIzE,MAAI,IAAI,OAAO;AACf,SAAO,KAAK,MAAM,WAAW;AAC3B,QAAI,EAAE,aAAa,KAAK,EAAE,SAAS,IAAK,QAAO;AAC/C,QAAI,EAAE;AAAA,EACR;AACA,SAAO;AACT;AAEA,SAAS,UAAU,aAAa,YAAY,WAAW,YAAY,QAAQ;AACzE,cAAY,SAAS;AACrB,aAAW,SAAS;AACpB,WAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,gBAAY,CAAC,IAAI,UAAU,CAAC;AAC5B,eAAW,CAAC,IAAI,WAAW,CAAC;AAAA,EAC9B;AACF;AAMO,SAAS,OAAO,IAAI,OAAO;AAChC,aAAW,OAAO,OAAO;AACvB,UAAM,QAAQ,MAAM,GAAG;AAEvB,QAAI,IAAI,WAAW,IAAI,KAAK,IAAI,SAAS,GAAG;AAE1C,YAAM,QAAQ,IAAI,MAAM,CAAC,EAAE,YAAY;AACvC,SAAG,iBAAiB,OAAO,KAAK;AAChC;AAAA,IACF;AAEA,QAAI,OAAO,UAAU,cAAc,CAAC,IAAI,WAAW,IAAI,GAAG;AAKxD,UAAI,CAAC,GAAG,aAAc,IAAG,eAAe,CAAC;AAGzC,UAAI,GAAG,aAAa,GAAG,GAAG;AACxB,YAAI;AAAE,aAAG,aAAa,GAAG,EAAE;AAAA,QAAG,SAAS,GAAG;AAAA,QAAyB;AAAA,MACrE;AACA,UAAI,QAAQ,WAAW,QAAQ,aAAa;AAC1C,WAAG,aAAa,GAAG,IAAI,OAAO,MAAM;AAClC,gBAAM,MAAM,MAAM,KAAK;AACvB,cAAI,kBAAkB,cAAc,WAAY,IAAG,aAAa,SAAS,GAAG;AAAA,cACvE,IAAG,YAAY;AAAA,QACtB,CAAC;AAAA,MACH,WAAW,QAAQ,WAAW,OAAO,MAAM,MAAM,UAAU;AACzD,WAAG,aAAa,GAAG,IAAI,OAAO,MAAM;AAClC,gBAAM,SAAS,MAAM;AACrB,qBAAW,QAAQ,QAAQ;AACzB,eAAG,MAAM,IAAI,IAAI,OAAO,IAAI,KAAK;AAAA,UACnC;AAAA,QACF,CAAC;AAAA,MACH,OAAO;AACL,WAAG,aAAa,GAAG,IAAI,OAAO,MAAM;AAAE,kBAAQ,IAAI,KAAK,MAAM,CAAC;AAAA,QAAG,CAAC;AAAA,MACpE;AAAA,IACF,OAAO;AAEL,cAAQ,IAAI,KAAK,KAAK;AAAA,IACxB;AAAA,EACF;AACF;AAWO,SAAS,QAAQ,IAAI,KAAK,OAAO;AAEtC,MAAI,QAAQ,OAAO;AACjB,QAAI,OAAO,UAAU,WAAY,OAAM,EAAE;AAAA,aAChC,SAAS,OAAO,UAAU,SAAU,OAAM,UAAU;AAC7D;AAAA,EACF;AAGA,MAAI,QAAQ,MAAO;AAMnB,MAAI,OAAO,UAAU,cAAc,CAAC,IAAI,WAAW,IAAI,GAAG;AACxD,QAAI,CAAC,GAAG,aAAc,IAAG,eAAe,CAAC;AACzC,QAAI,GAAG,aAAa,GAAG,GAAG;AACxB,UAAI;AAAE,WAAG,aAAa,GAAG,EAAE;AAAA,MAAG,SAAS,GAAG;AAAA,MAAyB;AAAA,IACrE;AACA,OAAG,aAAa,GAAG,IAAI,OAAO,MAAM,QAAQ,IAAI,KAAK,MAAM,CAAC,CAAC;AAC7D;AAAA,EACF;AAGA,MAAI,UAAU,IAAI,GAAG,KAAK,UAAU,IAAI,IAAI,YAAY,CAAC,GAAG;AAC1D,QAAI,CAAC,UAAU,KAAK,GAAG;AACrB,UAAI,OAAO,YAAY,aAAa;AAClC,gBAAQ,KAAK,iCAAiC,GAAG,gBAAgB,KAAK,EAAE;AAAA,MAC1E;AACA;AAAA,IACF;AAAA,EACF;AAEA,QAAM,QAAQ,kBAAkB,cAAc;AAE9C,MAAI,QAAQ,WAAW,QAAQ,aAAa;AAC1C,QAAI,OAAO;AACT,SAAG,aAAa,SAAS,SAAS,EAAE;AAAA,IACtC,OAAO;AACL,SAAG,YAAY,SAAS;AAAA,IAC1B;AAAA,EACF,WAAW,QAAQ,2BAA2B;AAC5C,UAAM,OAAO,OAAO,UAAU;AAC9B,QAAI,OAAO,YAAY,eAAe,WAAW,OAAO,SAAS,YAAY,gDAAgD,KAAK,IAAI,GAAG;AACvI,cAAQ,KAAK,6FAA6F;AAAA,IAC5G;AACA,OAAG,YAAY;AAAA,EACjB,WAAW,QAAQ,aAAa;AAC9B,QAAI,SAAS,OAAO,UAAU,YAAY,YAAY,OAAO;AAC3D,YAAM,OAAO,MAAM,UAAU;AAC7B,UAAI,OAAO,YAAY,eAAe,WAAW,OAAO,SAAS,YAAY,gDAAgD,KAAK,IAAI,GAAG;AACvI,gBAAQ,KAAK,6FAA6F;AAAA,MAC5G;AACA,SAAG,YAAY;AAAA,IACjB,OAAO;AACL,UAAI,OAAO,YAAY,eAAe,SAAS,QAAQ,UAAU,IAAI;AACnE,gBAAQ;AAAA,UACN;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF,WAAW,QAAQ,SAAS;AAC1B,QAAI,OAAO,UAAU,UAAU;AAC7B,SAAG,MAAM,UAAU;AAAA,IACrB,WAAW,OAAO,UAAU,UAAU;AACpC,iBAAW,QAAQ,OAAO;AACxB,WAAG,MAAM,IAAI,IAAI,MAAM,IAAI,KAAK;AAAA,MAClC;AAAA,IACF;AAAA,EACF,WAAW,IAAI,WAAW,OAAO,KAAK,IAAI,WAAW,OAAO,GAAG;AAC7D,OAAG,aAAa,KAAK,KAAK;AAAA,EAC5B,WAAW,OAAO,UAAU,WAAW;AACrC,QAAI,MAAO,IAAG,aAAa,KAAK,EAAE;AAAA,QAC7B,IAAG,gBAAgB,GAAG;AAAA,EAC7B,WAAW,OAAO;AAChB,OAAG,aAAa,KAAK,KAAK;AAAA,EAC5B,WAAW,QAAQ,WAAW,GAAG,YAAY,UAAU;AACrD,oBAAgB,IAAI,KAAK;AAAA,EAC3B,WAAW,OAAO,IAAI;AACpB,OAAG,GAAG,IAAI;AAAA,EACZ,OAAO;AACL,OAAG,aAAa,KAAK,KAAK;AAAA,EAC5B;AACF;AAWO,SAAS,SAAS,IAAI,OAAO;AAClC,MAAI,kBAAkB,cAAc,YAAY;AAC9C,OAAG,aAAa,SAAS,SAAS,EAAE;AAAA,EACtC,OAAO;AACL,OAAG,YAAY,SAAS;AAAA,EAC1B;AACF;AAGO,SAAS,SAAS,IAAI,OAAO;AAClC,MAAI,OAAO,UAAU,UAAU;AAC7B,OAAG,MAAM,UAAU;AAAA,EACrB,WAAW,SAAS,OAAO,UAAU,UAAU;AAC7C,UAAM,QAAQ,GAAG;AACjB,eAAW,QAAQ,OAAO;AACxB,YAAM,IAAI,IAAI,MAAM,IAAI,KAAK;AAAA,IAC/B;AAAA,EACF,WAAW,SAAS,MAAM;AACxB,OAAG,MAAM,UAAU;AAAA,EACrB;AACF;AAMO,SAAS,QAAQ,IAAI,MAAM,OAAO;AACvC,MAAI,SAAS,KAAM,IAAG,gBAAgB,IAAI;AAAA,MACrC,IAAG,aAAa,MAAM,KAAK;AAClC;AAKO,SAAS,SAAS,IAAI,OAAO;AAClC,MAAI,GAAG,YAAY,UAAU;AAC3B,oBAAgB,IAAI,KAAK;AACzB;AAAA,EACF;AACA,QAAM,MAAM,SAAS,OAAO,KAAK,OAAO,KAAK;AAC7C,MAAI,GAAG,UAAU,IAAK,IAAG,QAAQ;AACnC;AAOA,IAAM,kBAAkB,oBAAI,IAAI;AAEzB,SAAS,eAAe,YAAY;AACzC,aAAW,QAAQ,YAAY;AAC7B,QAAI,gBAAgB,IAAI,IAAI,EAAG;AAC/B,oBAAgB,IAAI,IAAI;AAExB,aAAS,iBAAiB,MAAM,CAAC,MAAM;AACrC,UAAI,OAAO,EAAE;AACb,YAAM,MAAM,OAAO;AAMnB,aAAO,eAAe,GAAG,iBAAiB;AAAA,QACxC,cAAc;AAAA,QACd,MAAM;AAAE,iBAAO,QAAQ;AAAA,QAAU;AAAA,MACnC,CAAC;AAGD,aAAO,MAAM;AACX,cAAM,UAAU,KAAK,GAAG;AACxB,YAAI,SAAS;AACX,kBAAQ,CAAC;AACT,cAAI,EAAE,aAAc;AAAA,QACtB;AACA,eAAO,KAAK;AAAA,MACd;AAAA,IACF,CAAC;AAAA,EACH;AACF;AAGO,SAAS,GAAG,IAAI,OAAO,SAAS;AACrC,KAAG,iBAAiB,OAAO,OAAO;AAClC,SAAO,MAAM,GAAG,oBAAoB,OAAO,OAAO;AACpD;AAGO,SAAS,UAAU,IAAI,SAAS;AACrC,SAAO,MAAM;AACX,eAAW,QAAQ,SAAS;AAC1B,YAAM,QAAQ,OAAO,QAAQ,IAAI,MAAM,aAAa,QAAQ,IAAI,EAAE,IAAI,QAAQ,IAAI;AAClF,SAAG,UAAU,OAAO,MAAM,CAAC,CAAC,KAAK;AAAA,IACnC;AAAA,EACF,CAAC;AACH;AAQA,IAAI,eAAe;AACnB,IAAI,mBAAmB;AAEhB,SAAS,cAAc;AAC5B,SAAO;AACT;AAOO,SAAS,QAAQ,OAAO,WAAW;AACxC,iBAAe;AACf,qBAAmB,EAAE,QAAQ,WAAW,OAAO,EAAE;AAEjD,MAAI;AACF,UAAM,SAAS,YAAY,OAAO,SAAS;AAC3C,WAAO;AAAA,EACT,UAAE;AACA,mBAAe;AACf,uBAAmB;AAAA,EACrB;AACF;AAMA,SAAS,UAAU,QAAQ;AACzB,QAAM,WAAW,OAAO;AACxB,SAAO,iBAAiB,QAAQ,SAAS,QAAQ;AAC/C,UAAM,OAAO,SAAS,iBAAiB,KAAK;AAE5C,QAAI,KAAK,aAAa,GAAG;AACvB,YAAM,OAAO,KAAK;AAClB,UAAI,SAAS,OAAO,SAAS,QAAQ,SAAS,QAAQ,SAAS,OAAO;AACpE,yBAAiB;AACjB;AAAA,MACF;AAAA,IACF;AACA,qBAAiB;AACjB,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAEA,SAAS,YAAY;AACnB,SAAO,OAAO,YAAY,eAAe;AAC3C;AAEA,SAAS,YAAY,OAAO,QAAQ;AAClC,MAAI,SAAS,QAAQ,OAAO,UAAU,WAAW;AAC/C,WAAO;AAAA,EACT;AAGA,MAAI,OAAO,UAAU,YAAY,OAAO,UAAU,UAAU;AAC1D,UAAM,WAAW,UAAU,MAAM;AACjC,UAAM,OAAO,OAAO,KAAK;AAEzB,QAAI,YAAY,SAAS,aAAa,GAAG;AAEvC,UAAI,UAAU,KAAK,SAAS,gBAAgB,MAAM;AAChD,gBAAQ;AAAA,UACN,6CAA6C,IAAI,WAAW,SAAS,WAAW;AAAA,QAClF;AACA,iBAAS,cAAc;AAAA,MACzB;AACA,aAAO;AAAA,IACT;AAGA,QAAI,UAAU,GAAG;AACf,cAAQ;AAAA,QACN,kDAAkD,IAAI,UAAU,WAAW,SAAS,WAAW,SAAS;AAAA,MAC1G;AAAA,IACF;AACA,UAAMC,YAAW,SAAS,eAAe,IAAI;AAC7C,QAAI,UAAU;AACZ,aAAO,aAAaA,WAAU,QAAQ;AAAA,IACxC,OAAO;AACL,aAAO,YAAYA,SAAQ;AAAA,IAC7B;AACA,WAAOA;AAAA,EACT;AAGA,MAAI,OAAO,UAAU,YAAY;AAE/B,UAAM,eAAe,MAAM;AAC3B,QAAI,UAAU,YAAY,cAAc,MAAM;AAG9C,WAAO,MAAM;AACX,YAAM,QAAQ,MAAM;AAEpB,UAAI,CAAC,cAAc;AACjB,kBAAU,gBAAgB,QAAQ,OAAO,SAAS,IAAI;AAAA,MACxD;AAAA,IACF,CAAC;AACD,WAAO;AAAA,EACT;AAGA,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,UAAM,QAAQ,CAAC;AACf,eAAW,SAAS,OAAO;AACzB,YAAM,OAAO,YAAY,OAAO,MAAM;AACtC,UAAI,KAAM,OAAM,KAAK,IAAI;AAAA,IAC3B;AACA,WAAO,MAAM,WAAW,IAAI,MAAM,CAAC,IAAI;AAAA,EACzC;AAGA,MAAI,OAAO,UAAU,YAAY,MAAM,QAAQ;AAE7C,QAAI,OAAO,MAAM,QAAQ,YAAY;AACnC,YAAM,iBAAiB,kBAAkB;AACzC,YAAM,YAAY,MAAM;AACxB,YAAM,QAAQ,MAAM,SAAS,CAAC;AAC9B,YAAM,WAAW,MAAM,YAAY,CAAC;AAGpC,YAAM,MAAM;AAAA,QACV,OAAO,CAAC;AAAA,QACR,WAAW;AAAA,QACX,SAAS,CAAC;AAAA,QACV,UAAU,CAAC;AAAA,QACX,SAAS;AAAA,QACT,UAAU;AAAA,QACV;AAAA,QACA,YAAY,eAAe,eAAe,SAAS,CAAC,KAAK;AAAA,QACzD,gBAAgB;AAAA,MAClB;AAGA,qBAAe,KAAK,GAAG;AAEvB,UAAI;AACJ,UAAI;AACF,cAAM,gBAAgB,SAAS,WAAW,IAAI,SAC1C,SAAS,WAAW,IAAI,SAAS,CAAC,IAAI;AAC1C,iBAAS,UAAU,EAAE,GAAG,OAAO,UAAU,cAAc,CAAC;AAAA,MAC1D,SAAS,OAAO;AACd,uBAAe,IAAI;AACnB,gBAAQ,MAAM,+CAA+C,UAAU,QAAQ,aAAa,KAAK;AACjG,eAAO;AAAA,MACT;AAEA,qBAAe,IAAI;AACnB,UAAI,UAAU;AAGd,UAAI,IAAI,iBAAiB;AACvB,uBAAe,MAAM;AACnB,cAAI,IAAI,SAAU;AAClB,qBAAW,MAAM,IAAI,iBAAiB;AACpC,gBAAI;AAAE,iBAAG;AAAA,YAAG,SAAS,GAAG;AAAE,sBAAQ,MAAM,yBAAyB,CAAC;AAAA,YAAG;AAAA,UACvE;AAAA,QACF,CAAC;AAAA,MACH;AAEA,aAAO,YAAY,QAAQ,MAAM;AAAA,IACnC;AAGA,UAAM,WAAW,UAAU,MAAM;AACjC,UAAM,cAAc,MAAM,IAAI,YAAY;AAE1C,QAAI,YAAY,SAAS,aAAa,KAAK,SAAS,aAAa,aAAa;AAE5E,0BAAoB,UAAU,MAAM,SAAS,CAAC,CAAC;AAG/C,YAAM,cAAc;AACpB,yBAAmB,EAAE,QAAQ,UAAU,OAAO,EAAE;AAEhD,YAAM,WAAW,MAAM,OAAO,yBAAyB;AACvD,UAAI,YAAY,MAAM;AACpB,mBAAW,SAAS,MAAM,UAAU;AAClC,sBAAY,OAAO,QAAQ;AAAA,QAC7B;AAAA,MACF;AAEA,yBAAmB;AACnB,aAAO;AAAA,IACT;AAGA,QAAI,UAAU,GAAG;AACf,cAAQ;AAAA,QACN,wCAAwC,MAAM,GAAG,UAAU,WAAW,SAAS,WAAW,SAAS;AAAA,MACrG;AAAA,IACF;AAGA,UAAM,QAAQ,SAAS,cAAc,MAAM,GAAG;AAC9C,eAAW,OAAO,MAAM,SAAS,CAAC,GAAG;AACnC,UAAI,QAAQ,cAAc,QAAQ,MAAO;AACzC,cAAQ,OAAO,KAAK,MAAM,MAAM,GAAG,CAAC;AAAA,IACtC;AACA,eAAW,SAAS,MAAM,UAAU;AAClC,sBAAgB,OAAO,OAAO,MAAM,IAAI;AAAA,IAC1C;AACA,QAAI,UAAU;AACZ,aAAO,aAAa,OAAO,QAAQ;AAAA,IACrC,OAAO;AACL,aAAO,YAAY,KAAK;AAAA,IAC1B;AACA,WAAO;AAAA,EACT;AAGA,MAAI,UAAU,KAAK,GAAG;AACpB,WAAO;AAAA,EACT;AAGA,QAAM,WAAW,SAAS,eAAe,OAAO,KAAK,CAAC;AACtD,SAAO,YAAY,QAAQ;AAC3B,SAAO;AACT;AAMA,SAAS,oBAAoB,IAAI,OAAO;AACtC,aAAW,OAAO,OAAO;AACvB,QAAI,QAAQ,cAAc,QAAQ,SAAS,QAAQ,MAAO;AAC1D,QAAI,QAAQ,6BAA6B,QAAQ,YAAa;AAE9D,UAAM,QAAQ,MAAM,GAAG;AAGvB,QAAI,IAAI,WAAW,IAAI,KAAK,IAAI,SAAS,GAAG;AAC1C,YAAM,QAAQ,IAAI,MAAM,CAAC,EAAE,YAAY;AACvC,SAAG,iBAAiB,OAAO,KAAK;AAChC;AAAA,IACF;AAGA,QAAI,IAAI,WAAW,IAAI,GAAG;AACxB,SAAG,GAAG,IAAI;AACV;AAAA,IACF;AAGA,QAAI,OAAO,UAAU,cAAc,CAAC,IAAI,WAAW,IAAI,GAAG;AACxD,UAAI,QAAQ,WAAW,QAAQ,aAAa;AAC1C,eAAO,MAAM;AAAE,aAAG,YAAY,MAAM,KAAK;AAAA,QAAI,CAAC;AAAA,MAChD,WAAW,QAAQ,WAAW,OAAO,MAAM,MAAM,UAAU;AACzD,eAAO,MAAM;AACX,gBAAM,SAAS,MAAM;AACrB,qBAAW,QAAQ,QAAQ;AACzB,eAAG,MAAM,IAAI,IAAI,OAAO,IAAI,KAAK;AAAA,UACnC;AAAA,QACF,CAAC;AAAA,MACH,OAAO;AACL,eAAO,MAAM;AAAE,kBAAQ,IAAI,KAAK,MAAM,CAAC;AAAA,QAAG,CAAC;AAAA,MAC7C;AACA;AAAA,IACF;AAIA,QAAI,QAAQ,UAAW;AAAA,EACzB;AACF;",
+  "names": ["t", "t", "oldNodes", "ref", "textNode"]
+}

package/dist/chunk-6DAIK77K.min.js

@@ -0,0 +1,2 @@
+import{a as T}from"./chunk-O3SKPRTY.min.js";var u=!(typeof process<"u"),d=null;function Me(e){u&&(d=e)}var _=null,w=null,E=null,P=!1,D=0,b=[],j=!1,q=Symbol("needs_upstream"),B=null;function S(e,t){let n=e,r=new Set,s=null,o=0;function c(f){u&&P&&console.warn("[what] Signal.set() called inside a computed function. This may cause infinite loops. Use effect() instead."+(t?` (signal: ${t})`:""));let l=typeof f=="function"?f(n):f;n===l||n!==n&&l!==l||(n=l,s=null,u&&d&&d.onSignalUpdate(i),r.size>0&&ee(r))}function i(f){if(arguments.length===0){let l=_;return l!==null&&(l!==s||l._epoch!==o)&&(s=l,o=l._epoch,r.add(l),l.deps.push(r)),n}c(f)}return i.set=c,i.peek=()=>n,i.subscribe=f=>v(()=>f(i())),i._signal=!0,u&&(i._subs=r,t&&(i._debugName=t)),u&&d&&d.onSignalCreate(i),i}function Ae(e){let t,n=!0,r=new Set,s=null,o=0,c=V(()=>{let f=P;u&&(P=!0);try{t=e(),n=!1}finally{u&&(P=f)}},!0);c._level=1,c._computed=!0,c._computedSubs=r,r._owner=c,c._markDirty=()=>{n=!0},c._isDirty=()=>n;function i(){let f=_;return f!==null&&(f!==s||f._epoch!==o)&&(s=f,o=f._epoch,r.add(f),f.deps.push(r)),n&&X(c),t}return c._onNotify=()=>{n=!0,s=null,r.size>0&&ee(r)},i._signal=!0,i.peek=()=>(n&&X(c),t),i}function X(e){if(B!==null)throw B.push(e),q;let t=[e];B=t;try{for(;t.length>0;){let n=t[t.length-1];if(!n._isDirty||!n._isDirty()){t.pop();continue}let r=!1,s=n.deps;for(let o=0;o<s.length;o++){let c=s[o]._owner;c&&c._computed&&c._isDirty&&c._isDirty()&&(t.push(c),r=!0)}if(!r)try{let o=n.deps.length;$(n),n.deps.length!==o&&H(n),t.pop()}catch(o){if(o===q)n._markDirty();else throw o}}}finally{B=null}}function H(e){let t=0,n=e.deps;for(let r=0;r<n.length;r++){let s=n[r]._owner;if(s){let o=s._level;o>t&&(t=o)}}e._level=t+1}var ge=()=>{};function v(e,t){let n=V(e);n._level=1;let r=_;_=n;try{let o=n.fn();typeof o=="function"&&(n._cleanup=o)}finally{_=r}if(H(n),t?.stable&&(n._stable=!0),n.deps.length===0&&n._cleanup===null)return n.disposed=!0,u&&d&&d.onEffectDispose(n),ge;let s=()=>Z(n);return w&&w.disposals.push(s),s}function Te(e){D++;try{e()}finally{D--,D===0&&G()}}function V(e,t){let n={fn:e,deps:[],lazy:t||!1,_onNotify:null,disposed:!1,_pending:!1,_stable:!1,_level:0,_computed:!1,_computedSubs:null,_isDirty:null,_markDirty:null,_cleanup:null,_epoch:0};return u&&d&&d.onEffectCreate(n),n}function $(e){if(e.disposed)return;if(e._stable){if(e._cleanup){try{e._cleanup()}catch(s){u&&console.warn("[what] Error in effect cleanup:",s)}e._cleanup=null}let r=_;_=null;try{let s=e.fn();typeof s=="function"&&(e._cleanup=s)}catch(s){d?.onError&&d.onError(s,{type:"effect",effect:e}),u&&console.warn("[what] Error in stable effect:",s)}finally{_=r}u&&d?.onEffectRun&&d.onEffectRun(e);return}let t=e.deps.length===1?e.deps[0]:null;if(Y(e),e._cleanup){try{e._cleanup()}catch(r){u&&d?.onError&&d.onError(r,{type:"effect-cleanup",effect:e}),u&&console.warn("[what] Error in effect cleanup:",r)}e._cleanup=null}let n=_;_=e;try{let r=e.fn();typeof r=="function"&&(e._cleanup=r)}catch(r){throw r===q||u&&d?.onError&&d.onError(r,{type:"effect",effect:e}),r}finally{_=n}t!==null&&e.deps.length===1&&e.deps[0]===t&&!e._cleanup&&!e._pending&&(e._stable=!0),u&&d?.onEffectRun&&d.onEffectRun(e)}function Z(e){if(e.disposed=!0,u&&d&&d.onEffectDispose(e),Y(e),e._cleanup){try{e._cleanup()}catch(t){u&&console.warn("[what] Error in effect cleanup on dispose:",t)}e._cleanup=null}}function Y(e){let t=e.deps;for(let n=0;n<t.length;n++)t[n].delete(e);t.length=0,e._epoch++}var F=0,L=null,M=0;function Q(e){if(!e.disposed){if(e._onNotify)e._onNotify();else if(!e._pending)if(D===0&&e._stable){let t=_;_=null;try{let n=e.fn();if(typeof n=="function"){if(e._cleanup)try{e._cleanup()}catch{}e._cleanup=n}}catch(n){u&&d?.onError&&d.onError(n,{type:"effect",effect:e}),u&&console.warn("[what] Error in stable effect:",n)}finally{_=t}}else{e._pending=!0;let t=e._level,n=b.length;n>0&&b[n-1]._level>t&&(j=!0),b.push(e)}}}function ee(e){if(F===0){F=1;try{for(let t of e)Q(t);if(M>0){let t=0;for(;t<M;){let n=L[t];L[t]=null,t++;for(let r of n)Q(r)}M=0}}finally{F=0}D===0&&b.length>0&&ye()}else L===null&&(L=[]),M>=L.length?L.push(e):L[M]=e,M++}var I=!1;function ye(){I||(I=!0,queueMicrotask(()=>{I=!1,G()}))}var R=!1;function G(){if(!R){R=!0;try{let e=0;for(;b.length>0&&e<25;){let t=b;b=[],t.length>1&&j&&t.sort((n,r)=>n._level-r._level),j=!1;for(let n=0;n<t.length;n++){let r=t[n];if(r._pending=!1,!r.disposed&&!r._onNotify){let s=r.deps.length;try{$(r)}catch(o){if(o===q)throw o;u&&d?.onError&&d.onError(o,{type:"effect",effect:r});try{console.error("[what] Uncaught error in effect during update:",o)}catch{}continue}!r._computed&&r.deps.length!==s&&H(r)}}e++}if(e>=25){if(u){let n=b.slice(0,3).map(r=>r.fn?.name||r.fn?.toString().slice(0,60)||"(anonymous)");console.warn(`[what] Possible infinite effect loop detected (25 iterations). Likely cause: an effect writes to a signal it also reads, creating a cycle. Use untrack() to read signals without subscribing. Looping effects: ${n.join(", ")}`)}else console.warn("[what] Possible infinite effect loop detected");for(let t=0;t<b.length;t++)b[t]._pending=!1;b.length=0}}finally{R=!1}}}function De(e){let t,n=new Set,r=V(()=>{let o=e();if(!Object.is(t,o)){t=o;for(let c of n)if(!c.disposed){if(c._onNotify)c._onNotify();else if(!c._pending){c._pending=!0;let i=c._level,f=b.length;f>0&&b[f-1]._level>i&&(j=!0),b.push(c)}}}});r._level=1,$(r),H(r),n._owner=r,w&&w.disposals.push(()=>Z(r));function s(){return _&&(n.add(_),_.deps.push(n)),t}return s._signal=!0,s.peek=()=>t,s}function Oe(){if(R){u&&console.warn("[what] flushSync() called during an active flush (e.g., inside a component render or effect). This is a no-op to prevent infinite loops. Move flushSync() to an event handler or onMount callback.");return}if(_){u&&console.warn("[what] flushSync() called during effect execution. This is a no-op to prevent infinite loops. Move flushSync() to an event handler or onMount callback.");return}I=!1,G()}function K(e){let t=_;_=null;try{return e()}finally{_=t}}function Be(){return E}function Pe(e,t){let n=E,r=w;E=e,w=e;try{return t()}finally{E=n,w=r}}function Ie(e){let t=w,n=E,r={disposals:[],owner:E,children:[],_disposed:!1};E&&E.children.push(r),w=r,E=r;try{return e(()=>{if(!r._disposed){r._disposed=!0;for(let o=r.children.length-1;o>=0;o--)J(r.children[o]);r.children.length=0;for(let o=r.disposals.length-1;o>=0;o--)r.disposals[o]();if(r.disposals.length=0,r.owner){let o=r.owner.children.indexOf(r);o>=0&&r.owner.children.splice(o,1)}}})}finally{w=t,E=n}}function J(e){if(!e._disposed){e._disposed=!0;for(let t=e.children.length-1;t>=0;t--)J(e.children[t]);e.children.length=0;for(let t=e.disposals.length-1;t>=0;t--)e.disposals[t]();e.disposals.length=0}}function Re(e){let t=w,n=E,r={disposals:[],owner:null,children:[],_disposed:!1};w=r,E=r;try{return e(()=>{if(!r._disposed){r._disposed=!0;for(let o=r.children.length-1;o>=0;o--)J(r.children[o]);r.children.length=0;for(let o=r.disposals.length-1;o>=0;o--)r.disposals[o]();r.disposals.length=0}})}finally{w=t,E=n}}function je(e){w&&w.disposals.push(e)}if(u&&typeof WeakRef<"u"){let t={signals:new Set,effects:new Set,components:[]};d={__isPreinstallBuffer:!0,onSignalCreate(n){t.signals.size<2e3&&t.signals.add(new WeakRef(n))},onSignalUpdate(){},onEffectCreate(n){t.effects.size<2e3&&t.effects.add(new WeakRef(n))},onEffectDispose(){},onEffectRun(){},onError(){},onComponentMount(n){t.components.length<2e3&&t.components.push(n)},onComponentUnmount(){},__buffer:t}}function qe(){if(!u)return{signals:[],effects:[],components:[]};let e={signals:[],effects:[],components:[]},t=typeof U<"u"?U:null;if(!t)return e;for(let n of t.signals){let r=n.deref?.();r&&e.signals.push(r)}for(let n of t.effects){let r=n.deref?.();r&&e.effects.push(r)}for(let n of t.components)e.components.push(n);return e}var U=null;u&&d?.__isPreinstallBuffer&&(U=d.__buffer);function $e(e,t){let n=function(s){return e(s)};return n.displayName=`Memo(${e.name||"Anonymous"})`,n}var te=null;function ne(e){te=e}function Ge(e){let t=null,n=null,r=null,s=new Set;function o(c){if(r)throw r;if(t)return T(t,c);throw n||(n=e().then(i=>{t=i.default||i,s.forEach(f=>f()),s.clear()}).catch(i=>{r=i})),n}return o.displayName="Lazy",o._lazy=!0,o._onLoad=c=>{t?c():s.add(c)},o}function Ke({fallback:e,children:t}){let n=S(!1),r=new Set;return{tag:"__suspense",props:{boundary:{_suspense:!0,onSuspend(o){n.set(!0),r.add(o),o.finally(()=>{r.delete(o),r.size===0&&n.set(!1)})}},fallback:e,loading:n},children:Array.isArray(t)?t:[t],_vnode:!0}}function Je({fallback:e,children:t,onError:n}){let r=S(null);return{tag:"__errorBoundary",props:{errorState:r,handleError:c=>{if(r.set(c),n)try{n(c)}catch(i){console.error("Error in onError handler:",i)}},fallback:e,reset:()=>r.set(null)},children:Array.isArray(t)?t:[t],_vnode:!0}}function re(e,t){let n=t||te?.();for(;n;){if(n._errorBoundary)return n._errorBoundary(e),!0;n=n._parentCtx}return!1}function Xe({when:e,fallback:t=null,children:n}){return(typeof e=="function"?e():e)?n:t}function Qe({each:e,fallback:t=null,children:n}){let r=typeof e=="function"?e():e;if(!r||r.length===0)return t;let s=Array.isArray(n)?n[0]:n;return typeof s!="function"?(console.warn("[what] For: children must be a render function, e.g. <For each={items}>{(item) => ...}</For>"),t):r.map((o,c)=>{let i=s(o,c);return i&&typeof i=="object"&&i.key==null&&(o!=null&&typeof o=="object"?o.id!=null?i.key=o.id:o.key!=null&&(i.key=o.key):(typeof o=="string"||typeof o=="number")&&(i.key=o)),i})}function Ze({fallback:e=null,children:t}){let n=Array.isArray(t)?t:[t];for(let r of n)if(r&&r.tag===oe&&(typeof r.props.when=="function"?r.props.when():r.props.when))return r.children;return e}function oe({when:e,children:t}){return{tag:oe,props:{when:e},children:t,_vnode:!0}}function Ye({component:e,mode:t,mediaQuery:n,...r}){let s=T("div",{"data-island":e.name||"Island","data-hydrate":t}),o=S(null),c=S(!1);function i(){c()||(c.set(!0),o.set(T(e,r)))}function f(p){switch(t){case"load":queueMicrotask(i);break;case"idle":typeof requestIdleCallback<"u"?requestIdleCallback(i):setTimeout(i,200);break;case"visible":{let a=new IntersectionObserver(h=>{h[0].isIntersecting&&(a.disconnect(),i())});a.observe(p);break}case"interaction":{let a=()=>{p.removeEventListener("click",a),p.removeEventListener("focus",a),p.removeEventListener("mouseenter",a),i()};p.addEventListener("click",a,{once:!0}),p.addEventListener("focus",a,{once:!0}),p.addEventListener("mouseenter",a,{once:!0});break}case"media":{if(!n){i();break}let a=window.matchMedia(n);if(a.matches)queueMicrotask(i);else{let h=()=>{a.matches&&(a.removeEventListener("change",h),i())};a.addEventListener("change",h)}break}default:queueMicrotask(i)}}let l=p=>{p&&f(p)};return T("div",{"data-island":e.name||"Island","data-hydrate":t,ref:l},c()?o():null)}var se=!1;function nt(e,t,n){return se||(se=!0,console.warn("[what] each() is deprecated. Use the <For> component or Array.map() instead.")),!e||e.length===0?[]:e.map((r,s)=>{let o=t(r,s);return n&&o&&typeof o=="object"&&(o.key=n(r,s)),o})}function rt(...e){let t=[];for(let n of e)if(n){if(typeof n=="string")t.push(n);else if(typeof n=="object")for(let[r,s]of Object.entries(n))s&&t.push(r)}return t.join(" ")}function ot(e){return typeof e=="string"?e:Object.entries(e).filter(([,t])=>t!=null&&t!=="").map(([t,n])=>`${Ce(t)}:${n}`).join(";")}function Ce(e){return e.replace(/([A-Z])/g,"-$1").toLowerCase()}function st(e,t){let n;return(...r)=>{clearTimeout(n),n=setTimeout(()=>e(...r),t)}}function it(e,t){let n=0;return(...r)=>{let s=Date.now();s-n>=t&&(n=s,e(...r))}}var W=null;function ie(e){W=e}function ct(e){if(typeof window>"u")return S(!1);let t=window.matchMedia(e),n=S(t.matches),r=o=>n.set(o.matches);t.addEventListener("change",r);let s=W?.();return s&&(s._cleanupCallbacks=s._cleanupCallbacks||[],s._cleanupCallbacks.push(()=>t.removeEventListener("change",r))),n}function ft(e,t){let n;try{let i=localStorage.getItem(e);n=i!==null?JSON.parse(i):t}catch{n=t}let r=S(n),s=v(()=>{try{localStorage.setItem(e,JSON.stringify(r()))}catch(i){u&&console.warn("[what] localStorage write failed (quota exceeded?):",i)}}),o=null;typeof window<"u"&&(o=i=>{if(i.key===e&&i.newValue!==null)try{r.set(JSON.parse(i.newValue))}catch(f){u&&console.warn("[what] localStorage parse failed:",f)}},window.addEventListener("storage",o));let c=W?.();return c&&(c._cleanupCallbacks=c._cleanupCallbacks||[],c._cleanupCallbacks.push(()=>{s(),o&&window.removeEventListener("storage",o)})),r}function lt({target:e,children:t}){if(typeof document>"u")return null;let n=typeof e=="string"?document.querySelector(e):e;return n?{tag:"__portal",props:{container:n},children:Array.isArray(t)?t:[t],_vnode:!0}:null}function at(e,t){if(typeof document>"u")return;let n=s=>{let o=e.current||e;!o||o.contains(s.target)||t(s)};document.addEventListener("mousedown",n),document.addEventListener("touchstart",n);let r=W?.();r&&(r._cleanupCallbacks=r._cleanupCallbacks||[],r._cleanupCallbacks.push(()=>{document.removeEventListener("mousedown",n),document.removeEventListener("touchstart",n)}))}function ut(e,t){return{class:t?`${e}-enter ${e}-enter-active`:`${e}-leave ${e}-leave-active`}}var we=new Set(["svg","path","circle","rect","line","polyline","polygon","ellipse","g","defs","use","symbol","clipPath","mask","pattern","image","text","tspan","textPath","foreignObject","linearGradient","radialGradient","stop","marker","animate","animateTransform","animateMotion","set","filter","feBlend","feColorMatrix","feComponentTransfer","feComposite","feConvolveMatrix","feDiffuseLighting","feDisplacementMap","feFlood","feGaussianBlur","feImage","feMerge","feMergeNode","feMorphology","feOffset","feSpecularLighting","feTile","feTurbulence"]),be="http://www.w3.org/2000/svg",le=new Set,z=new WeakMap;function Ee(e){return!e||typeof e!="object"?!1:typeof Node<"u"&&e instanceof Node?!0:typeof e.nodeType=="number"&&typeof e.nodeName=="string"}function ce(e){return!!e&&typeof e=="object"&&(e._vnode===!0||"tag"in e)}function fe(e){if(!e.disposed){if(e.disposed=!0,e.cleanups)for(let t of e.cleanups)try{t()}catch(n){console.error("[what] cleanup error:",n)}if(e.effects)for(let t of e.effects)try{t()}catch{}if(e.hooks){for(let t of e.hooks)if(t&&typeof t.cleanup=="function")try{t.cleanup()}catch(n){console.error("[what] hook cleanup error:",n)}}if(e._cleanupCallbacks)for(let t of e._cleanupCallbacks)try{t()}catch(n){console.error("[what] onCleanup error:",n)}u&&d?.onComponentUnmount&&d.onComponentUnmount(e),le.delete(e)}}function N(e){if(!e)return;if(e._componentCtx&&fe(e._componentCtx),e.nodeType===8){let n=z.get(e);n&&fe(n)}if(e._dispose)try{e._dispose()}catch{}if(e._propEffects)for(let n in e._propEffects)try{e._propEffects[n]()}catch{}let t=e.childNodes;if(t&&t.length>0)for(let n=0;n<t.length;n++)N(t[n])}function yt(e,t){typeof t=="string"&&(t=document.querySelector(t)),N(t),t.textContent="";let n=k(e,t);return n&&t.appendChild(n),()=>{N(t),t.textContent=""}}function k(e,t,n){if(e==null||e===!1||e===!0)return document.createComment("");if(typeof e=="string"||typeof e=="number")return document.createTextNode(String(e));if(Ee(e))return e;if(typeof e=="function"){let r=document.createComment("fn"),s=document.createComment("/fn"),o=[],c=document.createDocumentFragment();c.appendChild(r),c.appendChild(s);let i=v(()=>{let f=e(),l=f==null||f===!1||f===!0?[]:Array.isArray(f)?f:[f],p=s.parentNode;if(p){for(let a of o)N(a),a.parentNode===p&&p.removeChild(a);o=[];for(let a of l){let h=k(a,p,t?._isSvg);if(h)if(h.nodeType===11){let C=Array.from(h.childNodes);p.insertBefore(h,s);for(let y of C)o.push(y)}else p.insertBefore(h,s),o.push(h)}}});return r._dispose=i,s._dispose=i,c}if(Array.isArray(e)){let r=document.createDocumentFragment();for(let s of e){let o=k(s,t,n);o&&r.appendChild(o)}return r}return ce(e)&&typeof e.tag=="function"?xe(e,t,n):ce(e)&&typeof e.tag=="string"?e.tag==="__errorBoundary"?ue(e,t):e.tag==="__suspense"?pe(e,t):e.tag==="__portal"?de(e,t):ve(e,t,n):document.createTextNode(String(e))}var Se={get(e,t){if(t!=="_sig"&&!(t==="__proto__"||t==="constructor"||t==="prototype"))return e._sig()[t]},has(e,t){return t==="_sig"?!1:t in e._sig()},ownKeys(e){return Reflect.ownKeys(e._sig())},getOwnPropertyDescriptor(e,t){if(t==="_sig")return;let n=e._sig();if(t in n)return{value:n[t],writable:!1,enumerable:!0,configurable:!0}},set(e,t){return!1}},m=[];function ae(){return m[m.length-1]}ne(ae);ie(ae);function Ct(){return m}function xe(e,t,n){let{tag:r,props:s,children:o}=e;if(typeof r=="function"&&(r.prototype?.isReactComponent||r.prototype?.render)){let g=r;r=function(me){return new g(me).render()},r.displayName=g.displayName||g.name||"ClassComponent"}if(r==="__errorBoundary"||e.tag==="__errorBoundary")return ue(e,t);if(r==="__suspense"||e.tag==="__suspense")return pe(e,t);if(r==="__portal"||e.tag==="__portal")return de(e,t);let c=m[m.length-1]||null,i=null;if(c&&(i=c._errorBoundary||null,!i)){let g=c._parentCtx;for(;g;){if(g._errorBoundary){i=g._errorBoundary;break}g=g._parentCtx}}let f={hooks:[],hookIndex:0,effects:[],cleanups:[],mounted:!1,disposed:!1,Component:r,_parentCtx:c,_errorBoundary:i},l=document.createComment("c:start"),p=document.createComment("c:end");z.set(l,f),f._startComment=l,f._endComment=p;let a=document.createDocumentFragment();a._componentCtx=f,f._wrapper=l,le.add(f),u&&d?.onComponentMount&&d.onComponentMount(f);let h=o.length===0?void 0:o.length===1?o[0]:o,C;h!==void 0?C=s?Object.assign({},s,{children:h}):{children:h}:C=s?Object.assign({},s):{};let y=S(C);f._propsSignal=y;let x=new Proxy({_sig:y},Se);m.push(f);let O;try{O=K(()=>r(x))}catch(g){if(m.pop(),!re(g,f))throw console.error("[what] Uncaught error in component:",r.name||"Anonymous",g),g;return a.appendChild(l),a.appendChild(p),a}m.pop(),f.mounted=!0,f._mountCallbacks&&queueMicrotask(()=>{if(!f.disposed)for(let g of f._mountCallbacks)try{g()}catch(A){console.error("[what] onMount error:",A)}}),a.appendChild(l);let _e=Array.isArray(O)?O:[O];for(let g of _e){let A=k(g,a,n);A&&a.appendChild(A)}return a.appendChild(p),a}function ue(e,t){let{errorState:n,handleError:r,fallback:s,reset:o}=e.props,c=e.children,i=document.createComment("eb:start"),f=document.createComment("eb:end"),l={hooks:[],hookIndex:0,effects:[],cleanups:[],mounted:!1,disposed:!1,_parentCtx:m[m.length-1]||null,_errorBoundary:r,_startComment:i,_endComment:f};z.set(i,l);let p=document.createDocumentFragment();p._componentCtx=l,p.appendChild(i),p.appendChild(f);let a=v(()=>{let h=n();if(m.push(l),i.parentNode)for(;i.nextSibling&&i.nextSibling!==f;){let y=i.nextSibling;N(y),y.parentNode.removeChild(y)}let C;h?C=typeof s=="function"?[s({error:h,reset:o})]:[s]:C=c,C=Array.isArray(C)?C:[C];for(let y of C){let x=k(y,t);x&&(f.parentNode?f.parentNode.insertBefore(x,f):p.insertBefore(x,f))}m.pop()});return l.effects.push(a),p}function pe(e,t){let{boundary:n,fallback:r,loading:s}=e.props,o=e.children,c=document.createComment("sb:start"),i=document.createComment("sb:end"),f={hooks:[],hookIndex:0,effects:[],cleanups:[],mounted:!1,disposed:!1,_parentCtx:m[m.length-1]||null,_startComment:c,_endComment:i};z.set(c,f);let l=document.createDocumentFragment();l._componentCtx=f,l.appendChild(c),l.appendChild(i);let p=v(()=>{let h=s()?[r]:o,C=Array.isArray(h)?h:[h];if(m.push(f),c.parentNode)for(;c.nextSibling&&c.nextSibling!==i;){let y=c.nextSibling;N(y),y.parentNode.removeChild(y)}for(let y of C){let x=k(y,t);x&&(i.parentNode?i.parentNode.insertBefore(x,i):l.insertBefore(x,i))}m.pop()});return f.effects.push(p),l}function de(e,t){let{container:n}=e.props,r=e.children;if(!n)return console.warn("[what] Portal: target container not found"),document.createComment("portal:empty");let s={hooks:[],hookIndex:0,effects:[],cleanups:[],mounted:!1,disposed:!1,_parentCtx:m[m.length-1]||null},o=document.createComment("portal");o._componentCtx=s;let c=[];for(let i of r){let f=k(i,n);f&&(n.appendChild(f),c.push(f))}return s._cleanupCallbacks=[()=>{for(let i of c)N(i),i.parentNode&&i.parentNode.removeChild(i)}],o}function ve(e,t,n){let{tag:r,props:s,children:o}=e,c=n||we.has(r),i=c?document.createElementNS(be,r):document.createElement(r);s&&ke(i,s,{},c);let f=c&&r!=="foreignObject";for(let l=0;l<o.length;l++){let p=k(o[l],i,f);p&&i.appendChild(p)}return i._vnode=e,i}function ke(e,t,n,r){if(t){for(let s in t)if(!(s==="key"||s==="children")){if(s==="ref"){let o=t.ref;typeof o=="function"?o(e):o&&(o.current=e);continue}he(e,s,t[s],r)}}}function Le(e,t){e.value=t,e.value!==String(t)&&queueMicrotask(()=>{e.value=t})}function he(e,t,n,r){if(typeof n=="function"&&!(t.startsWith("on")&&t.length>2)&&t!=="ref"){if(e._propEffects||(e._propEffects={}),e._propEffects[t])try{e._propEffects[t]()}catch{}e._propEffects[t]=v(()=>{let s=n();he(e,t,s,r)});return}if(t.startsWith("on")&&t.length>2){let s=t.slice(2),o=!1;s.endsWith("Capture")&&(s=s.slice(0,-7),o=!0);let c=s.toLowerCase(),i=o?c+"_capture":c,f=e._events?.[i];if(f&&f._original===n||(f&&e.removeEventListener(c,f,o),n==null))return;e._events||(e._events={});let l=a=>(a.nativeEvent||(a.nativeEvent=a),K(()=>l._handler(a)));l._handler=n,l._original=n,e._events[i]=l;let p=n._eventOpts;e.addEventListener(c,l,p||o||void 0);return}if(t==="className"||t==="class"){r?e.setAttribute("class",n||""):e.className=n||"";return}if(t==="style"){if(typeof n=="string")e.style.cssText=n,e._prevStyle=null;else if(typeof n=="object"){let s=e._prevStyle||{};for(let o in s)o in n||(e.style[o]="");for(let o in n)e.style[o]=n[o]??"";e._prevStyle={...n}}return}if(t==="dangerouslySetInnerHTML"){let s=n?.__html??"";u&&typeof s=="string"&&/(<script|onerror\s*=|onload\s*=|javascript:)/i.test(s)&&console.warn("[what] dangerouslySetInnerHTML contains potential XSS vectors. Ensure content is sanitized."),e.innerHTML=s;return}if(t==="innerHTML"){if(n==null)return;if(n&&typeof n=="object"&&"__html"in n){let s=n.__html??"";u&&typeof s=="string"&&/(<script|onerror\s*=|onload\s*=|javascript:)/i.test(s)&&console.warn("[what] dangerouslySetInnerHTML contains potential XSS vectors. Ensure content is sanitized."),e.innerHTML=s}else{u&&console.warn("[what] innerHTML received a raw string. This is a security risk (XSS). Use innerHTML={{ __html: trustedString }} or dangerouslySetInnerHTML={{ __html: trustedString }} instead.");return}return}if(typeof n=="boolean"){n?e.setAttribute(t,""):e.removeAttribute(t);return}if(t.startsWith("data-")||t.startsWith("aria-")){e.setAttribute(t,n);return}if(r){n===!1||n==null?e.removeAttribute(t):e.setAttribute(t,n===!0?"":String(n));return}if(t==="value"&&e.tagName==="SELECT"){Le(e,n);return}t in e?e[t]=n:e.setAttribute(t,n)}export{u as a,Me as b,S as c,Ae as d,v as e,Te as f,De as g,Oe as h,K as i,Be as j,Pe as k,Ie as l,Re as m,je as n,qe as o,$e as p,Ge as q,Ke as r,Je as s,Xe as t,Qe as u,Ze as v,oe as w,Ye as x,nt as y,rt as z,ot as A,st as B,it as C,ct as D,ft as E,lt as F,at as G,ut as H,N as I,yt as J,k as K,ae as L,Ct as M,Le as N};
+//# sourceMappingURL=chunk-6DAIK77K.min.js.map

package/dist/chunk-6DAIK77K.min.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../src/reactive.js", "../src/components.js", "../src/helpers.js", "../src/dom.js"],
+  "sourcesContent": ["// What Framework - Reactive Primitives\n// Signals + Effects: fine-grained reactivity without virtual DOM overhead\n//\n// Upgrades:\n// - Topological ordering: computed/effects sorted by _level to prevent diamond glitches\n// - Iterative computed evaluation: no recursion, handles 10K+ depth chains\n// - Ownership tree: createRoot children auto-dispose when parent disposes\n// - Performance: cached levels, lazy sort, fast-path notify, minimal allocation\n\n// Dev-mode flag \u2014 build tools can dead-code-eliminate when false\nexport const __DEV__ = typeof process !== 'undefined'\n  ? process.env?.NODE_ENV !== 'production'\n  : true;\n\n// DevTools hooks \u2014 set by what-devtools when installed.\n// These are no-ops in production (dead-code eliminated with __DEV__).\nexport let __devtools = null;\n\n/** @internal Install devtools hooks. Called by what-devtools. */\nexport function __setDevToolsHooks(hooks) {\n  if (__DEV__) __devtools = hooks;\n}\n\nlet currentEffect = null;\nlet currentRoot = null;\nlet currentOwner = null;  // Ownership tree: tracks current owner context\nlet insideComputed = false; // Track whether we're inside a computed() callback (dev-mode warning)\nlet batchDepth = 0;\nlet pendingEffects = [];\nlet pendingNeedSort = false;  // Track whether pendingEffects actually needs sorting\n\n// Instead of a WeakMap from subscriber Set \u2192 owning computed's inner effect,\n// we store the owner directly on the Set as ._owner (20x faster than WeakMap.get).\n// Signal subscriber Sets have ._owner = undefined (signals are level 0).\n\n// --- Iterative Computed Evaluation State ---\n// Uses a throw/catch trampoline to convert recursive computed evaluation\n// to iterative. When a computed fn() reads another dirty computed, instead\n// of recursing, we throw a sentinel that gets caught by the outer loop.\nconst NEEDS_UPSTREAM = Symbol('needs_upstream');\nlet iterativeEvalStack = null;  // array when inside evaluation loop, null otherwise\n\n// --- Signal ---\n// A reactive value. Reading inside an effect auto-tracks the dependency.\n// Writing triggers only the effects that depend on this signal.\n//\n// Performance: signal read is the hottest path in any signal-based framework.\n// Key optimizations:\n// - No rest args (...args) \u2014 uses arguments.length for zero-alloc read path\n// - Subscriber tracking uses lastTracked to skip redundant Set.add/Array.push\n//   when the same signal is read multiple times in one effect (common pattern)\n// - Write path uses === first (fast for primitives), falls back to Object.is\n//   only for NaN detection\n// - subs.size check avoids notify() call when no subscribers\n\nexport function signal(initial, debugName) {\n  let value = initial;\n  const subs = new Set();\n  // Track the last effect that subscribed \u2014 skip redundant tracking when the\n  // same effect reads this signal multiple times (common in template bindings).\n  // lastTrackedEpoch tracks the effect's cleanup epoch to detect stale caches.\n  let lastTracked = null;\n  let lastTrackedEpoch = 0;\n\n  // Shared write logic \u2014 inlined via _sigWrite closure to avoid per-call overhead\n  // while keeping the sig() function body minimal for V8 optimization.\n  function _sigWrite(next) {\n    if (__DEV__ && insideComputed) {\n      console.warn(\n        '[what] Signal.set() called inside a computed function. ' +\n        'This may cause infinite loops. Use effect() instead.' +\n        (debugName ? ` (signal: ${debugName})` : '')\n      );\n    }\n    const nextVal = typeof next === 'function' ? next(value) : next;\n    // Fast equality: === handles all primitives except NaN.\n    // Only fall through for the NaN !== NaN case.\n    if (value === nextVal || (value !== value && nextVal !== nextVal)) return;\n    value = nextVal;\n    // Invalidate lastTracked since value changed \u2014 any effect that reads\n    // this signal during re-run needs to re-track.\n    lastTracked = null;\n    if (__DEV__ && __devtools) __devtools.onSignalUpdate(sig);\n    if (subs.size > 0) notify(subs);\n  }\n\n  // Unified getter/setter: sig() reads, sig(newVal) writes\n  // Using arguments.length instead of rest args avoids array allocation on read\n  function sig(newVal) {\n    if (arguments.length === 0) {\n      // Read \u2014 hot path, keep minimal\n      const ce = currentEffect;\n      if (ce !== null) {\n        // Only track if this signal isn't already in the effect's deps.\n        // lastTracked is a fast cache for the common case (single effect reading\n        // this signal). It's reset to null on write and on cleanup epoch change.\n        if (ce !== lastTracked || ce._epoch !== lastTrackedEpoch) {\n          lastTracked = ce;\n          lastTrackedEpoch = ce._epoch;\n          subs.add(ce);\n          ce.deps.push(subs);\n        }\n      }\n      return value;\n    }\n    // Write via sig(newVal)\n    _sigWrite(newVal);\n  }\n\n  sig.set = _sigWrite;\n\n  sig.peek = () => value;\n\n  sig.subscribe = (fn) => {\n    return effect(() => fn(sig()));\n  };\n\n  sig._signal = true;\n  if (__DEV__) {\n    sig._subs = subs;\n    if (debugName) sig._debugName = debugName;\n  }\n\n  // Notify devtools of signal creation\n  if (__DEV__ && __devtools) __devtools.onSignalCreate(sig);\n\n  return sig;\n}\n\n// --- Computed ---\n// Derived signal. Lazy: only recomputes when a dependency changes AND it's read.\n// Topological level: max(dependency levels) + 1, computed from source signals (level 0).\n\nexport function computed(fn) {\n  let value, dirty = true;\n  const subs = new Set();\n  let lastTracked = null;\n  let lastTrackedEpoch = 0;\n\n  const inner = _createEffect(() => {\n    const prevInsideComputed = insideComputed;\n    if (__DEV__) insideComputed = true;\n    try {\n      value = fn();\n      dirty = false;\n    } finally {\n      if (__DEV__) insideComputed = prevInsideComputed;\n    }\n  }, true);\n\n  // Computed nodes start at level 1. Updated when graph structure changes.\n  inner._level = 1;\n  inner._computed = true;\n  inner._computedSubs = subs;\n\n  // Register this subscriber set as owned by this computed\n  subs._owner = inner;\n\n  // Store markDirty/isDirty closures on the inner effect for iterative eval\n  inner._markDirty = () => { dirty = true; };\n  inner._isDirty = () => dirty;\n\n  function read() {\n    const ce = currentEffect;\n    if (ce !== null) {\n      if (ce !== lastTracked || ce._epoch !== lastTrackedEpoch) {\n        lastTracked = ce;\n        lastTrackedEpoch = ce._epoch;\n        subs.add(ce);\n        ce.deps.push(subs);\n      }\n    }\n    if (dirty) _evaluateComputed(inner);\n    return value;\n  }\n\n  // When a dependency changes, mark dirty AND propagate to our subscribers.\n  inner._onNotify = () => {\n    dirty = true;\n    lastTracked = null; // Invalidate tracking cache on value change\n    if (subs.size > 0) notify(subs);\n  };\n\n  read._signal = true;\n  read.peek = () => {\n    if (dirty) _evaluateComputed(inner);\n    return value;\n  };\n\n  return read;\n}\n\n// --- Iterative Computed Evaluation ---\n//\n// Problem: A chain of N dirty computeds causes O(N) recursive calls:\n// C_N.read() \u2192 eval \u2192 fn() \u2192 C_{N-1}.read() \u2192 eval \u2192 fn() \u2192 ... \u2192 C_1.read() \u2192 eval \u2192 fn()\n// This overflows the stack at ~3500 depth.\n//\n// Solution: Throw/catch trampoline. The outermost _evaluateComputed manages a\n// stack (array). When a computed's fn() reads another dirty computed during\n// evaluation, _evaluateComputed throws NEEDS_UPSTREAM. The outer loop catches\n// this, adds the upstream to the stack, and processes from the bottom up.\n// This converts O(N) call depth to O(1) per computed (just the outermost loop).\n\nfunction _evaluateComputed(computedEffect) {\n  if (iterativeEvalStack !== null) {\n    // We're inside the outermost evaluation loop, and a computed's fn()\n    // is reading another dirty computed. Push it onto the stack and throw\n    // to abort the current fn() so the outer loop can process it first.\n    iterativeEvalStack.push(computedEffect);\n    throw NEEDS_UPSTREAM;\n  }\n\n  // Outermost call \u2014 enter the iterative evaluation loop.\n  // The stack grows as we discover dirty upstream computeds.\n  const stack = [computedEffect];\n  iterativeEvalStack = stack;\n\n  try {\n    while (stack.length > 0) {\n      const current = stack[stack.length - 1];\n\n      if (!current._isDirty || !current._isDirty()) {\n        // Already clean \u2014 pop and continue\n        stack.pop();\n        continue;\n      }\n\n      // Pre-scan known deps: if any are dirty computeds, push them onto\n      // the stack first (bottom-up). This avoids the O(N^2) worst case\n      // where throw/catch restarts from the top on each dirty upstream.\n      let pushedUpstream = false;\n      const deps = current.deps;\n      for (let i = 0; i < deps.length; i++) {\n        const depOwner = deps[i]._owner;\n        if (depOwner && depOwner._computed && depOwner._isDirty && depOwner._isDirty()) {\n          stack.push(depOwner);\n          pushedUpstream = true;\n        }\n      }\n      if (pushedUpstream) {\n        // Process dirty upstreams first before re-evaluating current\n        continue;\n      }\n\n      // All known deps are clean \u2014 evaluate. throw/catch is fallback\n      // for newly-discovered deps only.\n      try {\n        const prevDepsLen = current.deps.length;\n        _runEffect(current);\n        // Only recompute level when graph structure changes\n        if (current.deps.length !== prevDepsLen) {\n          _updateLevel(current);\n        }\n        stack.pop(); // Successfully evaluated\n      } catch (err) {\n        if (err === NEEDS_UPSTREAM) {\n          // A dirty upstream was discovered and pushed onto the stack.\n          // Re-mark this computed dirty since its fn() was aborted mid-execution.\n          current._markDirty();\n          // The upstream is now at stack[stack.length-1]. Loop continues.\n        } else {\n          throw err; // Re-throw real errors\n        }\n      }\n    }\n  } finally {\n    iterativeEvalStack = null;\n  }\n}\n\n// Update the topological level of a computed/effect based on its current dependencies.\nfunction _updateLevel(e) {\n  let maxDepLevel = 0;\n  const deps = e.deps;\n  for (let i = 0; i < deps.length; i++) {\n    const owner = deps[i]._owner;\n    if (owner) {\n      const depLevel = owner._level;\n      if (depLevel > maxDepLevel) maxDepLevel = depLevel;\n    }\n  }\n  e._level = maxDepLevel + 1;\n}\n\n// --- Effect ---\n// Runs a function, auto-tracking signal reads. Re-runs when deps change.\n// Returns a dispose function.\n\nconst _noopDispose = () => {};\n\nexport function effect(fn, opts) {\n  const e = _createEffect(fn);\n  e._level = 1;\n  // First run: skip cleanup (deps is empty), just run and track\n  const prev = currentEffect;\n  currentEffect = e;\n  try {\n    const result = e.fn();\n    if (typeof result === 'function') e._cleanup = result;\n  } finally {\n    currentEffect = prev;\n  }\n  // Compute level after first run based on actual dependencies (cached).\n  _updateLevel(e);\n  // Mark as stable after first run \u2014 subsequent re-runs skip cleanup/re-subscribe\n  if (opts?.stable) e._stable = true;\n\n  // Zero-dependency release (SPRINT v0.11 C4): an effect that tracked zero\n  // signals on its first run can never be notified again \u2014 re-tracking only\n  // happens during a re-run, and a re-run requires a notification from a\n  // subscribed signal. The compiler conservatively wraps destructured props /\n  // imported accessors in effects; when those turn out to be plain values the\n  // effect is one-shot. If it also registered no cleanup, release it now:\n  // no dispose closure, no owner registration, nothing retained.\n  // - Effects that returned a cleanup keep full registration so the cleanup\n  //   still runs on owner disposal.\n  // - onCleanup() callbacks register with currentRoot directly (not with the\n  //   effect), so they are unaffected by this release.\n  // - untrack()/peek() reads inside the fn produce zero deps by design \u2014 the\n  //   effect could never re-fire anyway, so releasing is safe.\n  if (e.deps.length === 0 && e._cleanup === null) {\n    e.disposed = true;\n    if (__DEV__ && __devtools) __devtools.onEffectDispose(e);\n    return _noopDispose;\n  }\n\n  const dispose = () => _disposeEffect(e);\n  // Register with current root for automatic cleanup\n  if (currentRoot) {\n    currentRoot.disposals.push(dispose);\n  }\n  return dispose;\n}\n\n// --- Batch ---\n// Group multiple signal writes; effects run once at the end.\n\nexport function batch(fn) {\n  batchDepth++;\n  try {\n    fn();\n  } finally {\n    batchDepth--;\n    if (batchDepth === 0) flush();\n  }\n}\n\n// --- Internals ---\n\nfunction _createEffect(fn, lazy) {\n  // Minimal object shape \u2014 computed() adds extra properties after creation.\n  // IMPORTANT: V8 optimizes objects with a consistent \"hidden class\" (shape).\n  // All properties must be declared upfront even if null \u2014 adding properties\n  // later causes shape transitions which deoptimize property access globally.\n  const e = {\n    fn,\n    deps: [],            // array of subscriber sets (cheaper than Set for typical 1-3 deps)\n    lazy: lazy || false,\n    _onNotify: null,\n    disposed: false,\n    _pending: false,\n    _stable: false,      // stable effects skip cleanup/re-subscribe on re-run\n    _level: 0,           // topological depth: signals=0, computed/effects=max(deps)+1\n    _computed: false,     // true for computed inner effects\n    _computedSubs: null,  // reference to the computed's subscriber set\n    _isDirty: null,       // function to check if computed is dirty (set by computed())\n    _markDirty: null,     // function to mark computed dirty (set by computed())\n    _cleanup: null,       // cleanup function returned by effect fn (declared upfront for shape)\n    _epoch: 0,           // incremented on cleanup \u2014 used by signal lastTracked cache\n  };\n  if (__DEV__ && __devtools) __devtools.onEffectCreate(e);\n  return e;\n}\n\nfunction _runEffect(e) {\n  if (e.disposed) return;\n\n  // Stable effect fast path: deps don't change, skip cleanup/re-subscribe.\n  // This is critical for performance: effects like `() => el.className = sig() ? 'a' : ''`\n  // always read the same signal(s). After auto-promotion, re-runs skip the O(deps)\n  // cleanup + re-subscribe cycle entirely.\n  if (e._stable) {\n    if (e._cleanup) {\n      try { e._cleanup(); } catch (err) {\n        if (__DEV__) console.warn('[what] Error in effect cleanup:', err);\n      }\n      e._cleanup = null;\n    }\n    const prev = currentEffect;\n    currentEffect = null; // Don't re-track deps (already subscribed)\n    try {\n      const result = e.fn();\n      if (typeof result === 'function') e._cleanup = result;\n    } catch (err) {\n      if (__devtools?.onError) __devtools.onError(err, { type: 'effect', effect: e });\n      if (__DEV__) console.warn('[what] Error in stable effect:', err);\n    } finally {\n      currentEffect = prev;\n    }\n    if (__DEV__ && __devtools?.onEffectRun) __devtools.onEffectRun(e);\n    return;\n  }\n\n  // Save the single dep for auto-stable detection (safe: 1-dep effects\n  // have deterministic dep sets \u2014 no conditional reads possible).\n  const singleDep = e.deps.length === 1 ? e.deps[0] : null;\n\n  cleanup(e);\n  // Run effect cleanup from previous run\n  if (e._cleanup) {\n    try { e._cleanup(); } catch (err) {\n      if (__DEV__ && __devtools?.onError) __devtools.onError(err, { type: 'effect-cleanup', effect: e });\n      if (__DEV__) console.warn('[what] Error in effect cleanup:', err);\n    }\n    e._cleanup = null;\n  }\n  const prev = currentEffect;\n  currentEffect = e;\n  try {\n    const result = e.fn();\n    // Capture cleanup function if returned\n    if (typeof result === 'function') {\n      e._cleanup = result;\n    }\n  } catch (err) {\n    if (err === NEEDS_UPSTREAM) throw err; // Iterative eval sentinel \u2014 not a real error\n    if (__DEV__ && __devtools?.onError) __devtools.onError(err, { type: 'effect', effect: e });\n    throw err;\n  } finally {\n    currentEffect = prev;\n  }\n\n  // Auto-promote to stable: effects with exactly 1 dep that remains the same\n  // after re-run have a fixed dependency graph. Skip cleanup/re-subscribe\n  // on future re-runs. This is safe because a single-dep effect can't have\n  // conditional signal reads that change which signal is tracked.\n  // Guard: don't promote self-triggering effects (those that write to the signal\n  // they read, causing re-queuing). Check e._pending to detect this.\n  if (singleDep !== null && e.deps.length === 1 && e.deps[0] === singleDep\n      && !e._cleanup && !e._pending) {\n    e._stable = true;\n  }\n\n  if (__DEV__ && __devtools?.onEffectRun) __devtools.onEffectRun(e);\n}\n\nfunction _disposeEffect(e) {\n  e.disposed = true;\n  if (__DEV__ && __devtools) __devtools.onEffectDispose(e);\n  cleanup(e);\n  // Run cleanup on dispose\n  if (e._cleanup) {\n    try { e._cleanup(); } catch (err) {\n      if (__DEV__) console.warn('[what] Error in effect cleanup on dispose:', err);\n    }\n    e._cleanup = null;\n  }\n}\n\nfunction cleanup(e) {\n  const deps = e.deps;\n  for (let i = 0; i < deps.length; i++) deps[i].delete(e);\n  deps.length = 0;\n  // Increment epoch so signals' lastTracked cache is invalidated.\n  // This ensures a signal will re-track this effect after cleanup.\n  e._epoch++;\n}\n\n// --- Notification ---\n// Iterative notification to prevent stack overflow on deep computed chains.\n// Uses a reusable queue to avoid per-call array allocation.\n// When notify() encounters _onNotify callbacks (from computeds), those may\n// call notify() recursively. The queue drains iteratively in the outermost call.\n\nlet notifyDepth = 0;        // Tracks recursive notify depth\nlet notifyQueue = null;     // Reusable queue, allocated on first recursive call\nlet notifyQueueLen = 0;     // Length of the queue\n\n// Process a single subscriber during notification.\n// Extracted to avoid code duplication between outer and queue drain paths.\nfunction _processSubscriber(e) {\n  if (e.disposed) return;\n  if (e._onNotify) {\n    // Computed subscriber: mark dirty and propagate.\n    // _onNotify may call notify() recursively \u2014 tracked by notifyDepth.\n    e._onNotify();\n  } else if (!e._pending) {\n    if (batchDepth === 0 && e._stable) {\n      // Inline execution for stable effects \u2014 no pending queue needed\n      const prev = currentEffect;\n      currentEffect = null;\n      try {\n        const result = e.fn();\n        if (typeof result === 'function') {\n          if (e._cleanup) try { e._cleanup(); } catch (err) { /* ignore */ }\n          e._cleanup = result;\n        }\n      } catch (err) {\n        if (__DEV__ && __devtools?.onError) __devtools.onError(err, { type: 'effect', effect: e });\n        if (__DEV__) console.warn('[what] Error in stable effect:', err);\n      } finally {\n        currentEffect = prev;\n      }\n    } else {\n      e._pending = true;\n      const level = e._level;\n      const len = pendingEffects.length;\n      if (len > 0 && pendingEffects[len - 1]._level > level) {\n        pendingNeedSort = true;\n      }\n      pendingEffects.push(e);\n    }\n  }\n}\n\nfunction notify(subs) {\n  // Fast path: no recursive notifications in progress \u2014 iterate directly.\n  // This avoids array allocation for the common case (signal \u2192 effects).\n  if (notifyDepth === 0) {\n    notifyDepth = 1;\n    try {\n      for (const e of subs) {\n        _processSubscriber(e);\n      }\n      // Drain any queued subscriber sets from recursive notify calls\n      if (notifyQueueLen > 0) {\n        let qi = 0;\n        while (qi < notifyQueueLen) {\n          const queuedSubs = notifyQueue[qi];\n          notifyQueue[qi] = null; // Allow GC\n          qi++;\n          for (const e of queuedSubs) {\n            _processSubscriber(e);\n          }\n        }\n        notifyQueueLen = 0;\n      }\n    } finally {\n      notifyDepth = 0;\n    }\n    if (batchDepth === 0 && pendingEffects.length > 0) scheduleMicrotask();\n  } else {\n    // Recursive call \u2014 queue the subscriber set for the outermost call to drain.\n    if (notifyQueue === null) notifyQueue = [];\n    if (notifyQueueLen >= notifyQueue.length) {\n      notifyQueue.push(subs);\n    } else {\n      notifyQueue[notifyQueueLen] = subs;\n    }\n    notifyQueueLen++;\n  }\n}\n\nlet microtaskScheduled = false;\nfunction scheduleMicrotask() {\n  if (!microtaskScheduled) {\n    microtaskScheduled = true;\n    queueMicrotask(() => {\n      microtaskScheduled = false;\n      flush();\n    });\n  }\n}\n\nlet isFlushing = false;\n\nfunction flush() {\n  // Re-entrancy guard: if flush() is called during an active flush (e.g., via\n  // flushSync() inside a component render or effect), skip to prevent infinite\n  // recursion. Pending effects will be picked up by the outer flush's while-loop.\n  if (isFlushing) return;\n  isFlushing = true;\n\n  try {\n    let iterations = 0;\n    while (pendingEffects.length > 0 && iterations < 25) {\n      const batch = pendingEffects;\n      pendingEffects = [];\n\n      // Topological sort: execute effects in level order (lowest first).\n      // Fast paths:\n      // 1. Single effect \u2014 no sort needed (most common case for microtask flush)\n      // 2. Already sorted \u2014 skip sort (common when effects added in level order)\n      // 3. Multiple effects at different levels \u2014 sort required\n      if (batch.length > 1 && pendingNeedSort) {\n        batch.sort((a, b) => a._level - b._level);\n      }\n      pendingNeedSort = false;\n\n      for (let i = 0; i < batch.length; i++) {\n        const e = batch[i];\n        e._pending = false;\n        if (!e.disposed && !e._onNotify) {\n          const prevDepsLen = e.deps.length;\n          // Isolate per-effect errors: one throwing effect must NOT abort the\n          // rest of the batch (which would drop queued effects and leave the\n          // graph half-updated). NEEDS_UPSTREAM is the iterative-eval sentinel\n          // and must still propagate. (AUDIT-2026-06-06 H8)\n          try {\n            _runEffect(e);\n          } catch (err) {\n            if (err === NEEDS_UPSTREAM) throw err;\n            if (__DEV__ && __devtools?.onError) __devtools.onError(err, { type: 'effect', effect: e });\n            // Surface in production too \u2014 an uncaught reactive-update error is a\n            // real bug; staying silent (as the old throw-out-of-flush did once it\n            // escaped) hides it. console.error never aborts the batch.\n            try { console.error('[what] Uncaught error in effect during update:', err); } catch { /* no console */ }\n            continue;\n          }\n          // Update level only if deps changed (graph structure change)\n          if (!e._computed && e.deps.length !== prevDepsLen) {\n            _updateLevel(e);\n          }\n        }\n      }\n      iterations++;\n    }\n    if (iterations >= 25) {\n      if (__DEV__) {\n        const remaining = pendingEffects.slice(0, 3);\n        const effectNames = remaining.map(e => e.fn?.name || e.fn?.toString().slice(0, 60) || '(anonymous)');\n        console.warn(\n          `[what] Possible infinite effect loop detected (25 iterations). ` +\n          `Likely cause: an effect writes to a signal it also reads, creating a cycle. ` +\n          `Use untrack() to read signals without subscribing. ` +\n          `Looping effects: ${effectNames.join(', ')}`\n        );\n      } else {\n        console.warn('[what] Possible infinite effect loop detected');\n      }\n      // Clear pending effects AFTER capturing debug info\n      for (let i = 0; i < pendingEffects.length; i++) pendingEffects[i]._pending = false;\n      pendingEffects.length = 0;\n    }\n  } finally {\n    isFlushing = false;\n  }\n}\n\n// --- Memo ---\n// Eager computed that only propagates when the value actually changes.\n// Fix: Instead of calling notify(subs) inline (which bypasses topological sort\n// and causes diamond-dependency glitches), push memo subscribers into\n// pendingEffects and let them go through the sorted flush() path.\nexport function memo(fn) {\n  let value;\n  const subs = new Set();\n\n  const e = _createEffect(() => {\n    const next = fn();\n    if (!Object.is(value, next)) {\n      value = next;\n      // Push subscribers into pendingEffects for topological flush\n      // instead of inline notify() which can cause diamond glitches\n      for (const sub of subs) {\n        if (sub.disposed) continue;\n        if (sub._onNotify) {\n          // Computed subscriber: mark dirty and propagate\n          sub._onNotify();\n        } else if (!sub._pending) {\n          sub._pending = true;\n          const level = sub._level;\n          const len = pendingEffects.length;\n          if (len > 0 && pendingEffects[len - 1]._level > level) {\n            pendingNeedSort = true;\n          }\n          pendingEffects.push(sub);\n        }\n      }\n    }\n  });\n\n  e._level = 1;\n\n  _runEffect(e);\n  _updateLevel(e);\n\n  // Register subscriber set owner for level tracking\n  subs._owner = e;\n\n  // Register with current root\n  if (currentRoot) {\n    currentRoot.disposals.push(() => _disposeEffect(e));\n  }\n\n  function read() {\n    if (currentEffect) {\n      subs.add(currentEffect);\n      currentEffect.deps.push(subs);\n    }\n    return value;\n  }\n\n  read._signal = true;\n  read.peek = () => value;\n  return read;\n}\n\n// --- flushSync ---\n// Force all pending effects to run synchronously. Use sparingly.\n// Calling during render or effect execution is a no-op (prevents infinite loops).\nexport function flushSync() {\n  if (isFlushing) {\n    // Re-entrant call \u2014 silently skip (Solid approach).\n    // This prevents infinite loops when flushSync() is called during component\n    // render or effect execution. Pending effects will be picked up by the\n    // outer flush's while-loop.\n    if (__DEV__) {\n      console.warn(\n        '[what] flushSync() called during an active flush (e.g., inside a component render or effect). ' +\n        'This is a no-op to prevent infinite loops. Move flushSync() to an event handler or onMount callback.'\n      );\n    }\n    return;\n  }\n  if (currentEffect) {\n    // Called inside an effect/render \u2014 skip with warning\n    if (__DEV__) {\n      console.warn(\n        '[what] flushSync() called during effect execution. ' +\n        'This is a no-op to prevent infinite loops. Move flushSync() to an event handler or onMount callback.'\n      );\n    }\n    return;\n  }\n  microtaskScheduled = false;\n  flush();\n}\n\n// --- Untrack ---\n// Read signals without subscribing\nexport function untrack(fn) {\n  const prev = currentEffect;\n  currentEffect = null;\n  try {\n    return fn();\n  } finally {\n    currentEffect = prev;\n  }\n}\n\n// --- getOwner / runWithOwner ---\n// Expose ownership context for advanced use cases (e.g., async operations\n// that need to register disposals with the correct owner).\n\nexport function getOwner() {\n  return currentOwner;\n}\n\nexport function runWithOwner(owner, fn) {\n  const prev = currentOwner;\n  const prevRoot = currentRoot;\n  currentOwner = owner;\n  currentRoot = owner;\n  try {\n    return fn();\n  } finally {\n    currentOwner = prev;\n    currentRoot = prevRoot;\n  }\n}\n\n// --- createRoot ---\n// Isolated reactive scope with ownership tree.\n// All effects created inside are tracked and disposed together.\n// Child createRoot scopes register with parent owner \u2014 disposing parent\n// automatically disposes all children (prevents orphaned subscriptions).\nexport function createRoot(fn) {\n  const prevRoot = currentRoot;\n  const prevOwner = currentOwner;\n  const root = {\n    disposals: [],\n    owner: currentOwner,     // parent owner for ownership tree\n    children: [],            // child roots (ownership tree)\n    _disposed: false,\n  };\n\n  // Register this root as a child of the parent owner\n  if (currentOwner) {\n    currentOwner.children.push(root);\n  }\n\n  currentRoot = root;\n  currentOwner = root;\n\n  try {\n    const dispose = () => {\n      if (root._disposed) return;\n      root._disposed = true;\n\n      // Dispose children first (depth-first, reverse order)\n      for (let i = root.children.length - 1; i >= 0; i--) {\n        _disposeRoot(root.children[i]);\n      }\n      root.children.length = 0;\n\n      // Dispose own effects (reverse order for LIFO cleanup)\n      for (let i = root.disposals.length - 1; i >= 0; i--) {\n        root.disposals[i]();\n      }\n      root.disposals.length = 0;\n\n      // Remove from parent's children list\n      if (root.owner) {\n        const idx = root.owner.children.indexOf(root);\n        if (idx >= 0) root.owner.children.splice(idx, 1);\n      }\n    };\n    return fn(dispose);\n  } finally {\n    currentRoot = prevRoot;\n    currentOwner = prevOwner;\n  }\n}\n\n// Internal: dispose a root and all its children\nfunction _disposeRoot(root) {\n  if (root._disposed) return;\n  root._disposed = true;\n\n  // Dispose children first\n  for (let i = root.children.length - 1; i >= 0; i--) {\n    _disposeRoot(root.children[i]);\n  }\n  root.children.length = 0;\n\n  // Dispose own effects\n  for (let i = root.disposals.length - 1; i >= 0; i--) {\n    root.disposals[i]();\n  }\n  root.disposals.length = 0;\n}\n\n// --- _createItemScope ---\n// Lightweight reactive scope for list items. Unlike createRoot, this does NOT\n// register with the parent ownership tree (saves ~40% allocation overhead).\n// Used by mapArray where disposal is managed explicitly by the list reconciler.\nexport function _createItemScope(fn) {\n  const prevRoot = currentRoot;\n  const prevOwner = currentOwner;\n  const scope = {\n    disposals: [],\n    owner: null,          // No parent registration\n    children: [],         // Kept for compat with effects that create sub-roots\n    _disposed: false,\n  };\n\n  currentRoot = scope;\n  currentOwner = scope;\n\n  try {\n    const dispose = () => {\n      if (scope._disposed) return;\n      scope._disposed = true;\n      // Dispose children\n      for (let i = scope.children.length - 1; i >= 0; i--) {\n        _disposeRoot(scope.children[i]);\n      }\n      scope.children.length = 0;\n      // Dispose own effects\n      for (let i = scope.disposals.length - 1; i >= 0; i--) {\n        scope.disposals[i]();\n      }\n      scope.disposals.length = 0;\n    };\n    return fn(dispose);\n  } finally {\n    currentRoot = prevRoot;\n    currentOwner = prevOwner;\n  }\n}\n\n// --- onCleanup ---\n// Register a cleanup function with the current owner/root.\n// Runs when the owner is disposed.\nexport function onCleanup(fn) {\n  if (currentRoot) {\n    currentRoot.disposals.push(fn);\n  }\n}\n\n// devtools: registry-iterator export for P1-9 \u2014\n// Late-install replay buffer. When installDevTools() runs AFTER signals or\n// effects have already been created (the canonical example: a module-scope\n// `export const todos = signal([], 'todos')` in store.js, imported before\n// the devtools entry point), those signals were invisible to what_signals.\n//\n// We install a placeholder __devtools that ONLY buffers creations into weak\n// refs. When the real devtools install via __setDevToolsHooks, they call\n// __drainPreinstallBuffer() to register every buffered primitive.\n//\n// Cost in production: __DEV__ is false \u2192 __devtools stays null, no buffering.\n// Cost in dev: one WeakRef per signal/effect created before install.\nif (__DEV__ && typeof WeakRef !== 'undefined') {\n  // Cap each buffer so an app that never installs devtools doesn't accumulate\n  // refs unbounded. 2k is far more than any realistic component/signal count\n  // needed before the devtools entry point runs; once devtools install, the\n  // buffer is drained and subsequent creations flow through the real hooks.\n  const PREINSTALL_CAP = 2000;\n  const buffer = { signals: new Set(), effects: new Set(), components: [] };\n  __devtools = {\n    __isPreinstallBuffer: true,\n    onSignalCreate(sig) {\n      if (buffer.signals.size < PREINSTALL_CAP) buffer.signals.add(new WeakRef(sig));\n    },\n    onSignalUpdate() {},\n    onEffectCreate(e) {\n      if (buffer.effects.size < PREINSTALL_CAP) buffer.effects.add(new WeakRef(e));\n    },\n    onEffectDispose() {},\n    onEffectRun() {},\n    onError() {},\n    onComponentMount(ctx) {\n      if (buffer.components.length < PREINSTALL_CAP) buffer.components.push(ctx);\n    },\n    onComponentUnmount() {},\n    __buffer: buffer,\n  };\n}\n\n/**\n * Drain the pre-install buffer. Called by the real devtools hooks after\n * __setDevToolsHooks replaces the placeholder. Returns arrays of live refs.\n */\nexport function __drainPreinstallBuffer() {\n  if (!__DEV__) return { signals: [], effects: [], components: [] };\n  // If the current __devtools is the real one (no __isPreinstallBuffer), the\n  // caller installed late and there is nothing to drain from this side.\n  const out = { signals: [], effects: [], components: [] };\n  const buf = (typeof __preinstallSnapshot !== 'undefined') ? __preinstallSnapshot : null;\n  if (!buf) return out;\n  for (const ref of buf.signals) { const v = ref.deref?.(); if (v) out.signals.push(v); }\n  for (const ref of buf.effects) { const v = ref.deref?.(); if (v) out.effects.push(v); }\n  for (const ctx of buf.components) out.components.push(ctx);\n  return out;\n}\n\n// Capture the placeholder buffer at module load so __drainPreinstallBuffer\n// can return it AFTER __setDevToolsHooks has replaced __devtools.\nlet __preinstallSnapshot = null;\nif (__DEV__ && __devtools?.__isPreinstallBuffer) {\n  __preinstallSnapshot = __devtools.__buffer;\n}\n", "// What Framework - Component Utilities\n// memo, lazy, Suspense, ErrorBoundary\n\nimport { h } from './h.js';\nimport { signal, effect, untrack, __DEV__ } from './reactive.js';\n\n// Legacy errorBoundaryStack removed \u2014 tree-based resolution via _parentCtx._errorBoundary\n// is now the only mechanism. See reportError() below.\n\n// --- memo ---\n// In the run-once model, components execute exactly once and never re-render.\n// Signals update the DOM directly via fine-grained effects. Therefore, memo()\n// is a no-op identity wrapper \u2014 there is no re-render to skip.\n// Kept for API compatibility with React-style code.\n\nexport function memo(Component, _areEqual) {\n  // No-op in run-once model \u2014 just return the component as-is\n  const MemoWrapper = function MemoWrapper(props) {\n    return Component(props);\n  };\n  MemoWrapper.displayName = `Memo(${Component.name || 'Anonymous'})`;\n  return MemoWrapper;\n}\n\n// Injected by dom.js\nlet _getCurrentComponent = null;\nexport function _injectGetCurrentComponent(fn) { _getCurrentComponent = fn; }\n\nexport function shallowEqual(a, b) {\n  if (a === b) return true;\n  const keysA = Object.keys(a);\n  const keysB = Object.keys(b);\n  if (keysA.length !== keysB.length) return false;\n  for (const key of keysA) {\n    if (!Object.is(a[key], b[key])) return false;\n  }\n  return true;\n}\n\n// --- lazy ---\n// Code-split a component. Returns a wrapper that loads on first render.\n\nexport function lazy(loader) {\n  let Component = null;\n  let loadPromise = null;\n  let loadError = null;\n  const listeners = new Set();\n\n  function LazyWrapper(props) {\n    if (loadError) throw loadError;\n    if (Component) return h(Component, props);\n\n    if (!loadPromise) {\n      loadPromise = loader()\n        .then(mod => {\n          Component = mod.default || mod;\n          // Notify all waiting instances\n          listeners.forEach(fn => fn());\n          listeners.clear();\n        })\n        .catch(err => { loadError = err; });\n    }\n\n    // Throw promise for Suspense to catch\n    throw loadPromise;\n  }\n\n  LazyWrapper.displayName = 'Lazy';\n  LazyWrapper._lazy = true;\n  LazyWrapper._onLoad = (fn) => {\n    if (Component) fn();\n    else listeners.add(fn);\n  };\n  return LazyWrapper;\n}\n\n// --- Suspense ---\n// Show fallback while children are loading (lazy components).\n// Works with lazy() and async components.\n\nexport function Suspense({ fallback, children }) {\n  const loading = signal(false);\n  const pendingPromises = new Set();\n\n  // Suspense boundary marker\n  const boundary = {\n    _suspense: true,\n    onSuspend(promise) {\n      loading.set(true);\n      pendingPromises.add(promise);\n      promise.finally(() => {\n        pendingPromises.delete(promise);\n        if (pendingPromises.size === 0) {\n          loading.set(false);\n        }\n      });\n    },\n  };\n\n  return {\n    tag: '__suspense',\n    props: { boundary, fallback, loading },\n    children: Array.isArray(children) ? children : [children],\n    _vnode: true,\n  };\n}\n\n// --- ErrorBoundary ---\n// Catch errors in children and show fallback.\n// Uses a signal to track error state so it works with reactive rendering.\n\nexport function ErrorBoundary({ fallback, children, onError }) {\n  const errorState = signal(null);\n\n  // Error handler that will be registered with the component tree\n  const handleError = (error) => {\n    errorState.set(error);\n    if (onError) {\n      try {\n        onError(error);\n      } catch (e) {\n        console.error('Error in onError handler:', e);\n      }\n    }\n  };\n\n  // Reset function to recover from error\n  const reset = () => errorState.set(null);\n\n  return {\n    tag: '__errorBoundary',\n    props: { errorState, handleError, fallback, reset },\n    children: Array.isArray(children) ? children : [children],\n    _vnode: true,\n  };\n}\n\n// Helper to report error to nearest boundary\n// Walks the component context tree (not a runtime stack) so async errors are caught\nexport function reportError(error, startCtx) {\n  // Walk up the _parentCtx chain to find the nearest _errorBoundary\n  let ctx = startCtx || _getCurrentComponent?.();\n  while (ctx) {\n    if (ctx._errorBoundary) {\n      ctx._errorBoundary(error);\n      return true;\n    }\n    ctx = ctx._parentCtx;\n  }\n  return false;\n}\n\n// _getCurrentComponent is already declared above and injected via _injectGetCurrentComponent\n\n// --- Show ---\n// Conditional rendering component. Cleaner than ternaries.\n\nexport function Show({ when, fallback = null, children }) {\n  // when can be a signal or a value\n  const condition = typeof when === 'function' ? when() : when;\n  return condition ? children : fallback;\n}\n\n// --- For ---\n// Efficient list rendering with keyed reconciliation.\n\nexport function For({ each, fallback = null, children }) {\n  const list = typeof each === 'function' ? each() : each;\n  if (!list || list.length === 0) return fallback;\n\n  // children should be a function (item, index) => vnode\n  const renderFn = Array.isArray(children) ? children[0] : children;\n  if (typeof renderFn !== 'function') {\n    console.warn('[what] For: children must be a render function, e.g. <For each={items}>{(item) => ...}</For>');\n    return fallback;\n  }\n\n  return list.map((item, index) => {\n    const vnode = renderFn(item, index);\n    // Auto-detect keys for efficient keyed reconciliation\n    if (vnode && typeof vnode === 'object' && vnode.key == null) {\n      if (item != null && typeof item === 'object') {\n        // Use item.id or item.key if available\n        if (item.id != null) vnode.key = item.id;\n        else if (item.key != null) vnode.key = item.key;\n      } else if (typeof item === 'string' || typeof item === 'number') {\n        // Primitive items can be their own key\n        vnode.key = item;\n      }\n    }\n    return vnode;\n  });\n}\n\n// --- Switch / Match ---\n// Multi-condition rendering (like switch statement).\n\nexport function Switch({ fallback = null, children }) {\n  const kids = Array.isArray(children) ? children : [children];\n\n  for (const child of kids) {\n    if (child && child.tag === Match) {\n      const condition = typeof child.props.when === 'function'\n        ? child.props.when()\n        : child.props.when;\n      if (condition) {\n        return child.children;\n      }\n    }\n  }\n\n  return fallback;\n}\n\nexport function Match({ when, children }) {\n  // Match is just a marker component, Switch handles the logic\n  return { tag: Match, props: { when }, children, _vnode: true };\n}\n\n// --- Island ---\n// Deferred hydration component for islands architecture.\n// Usage: h(Island, { component: Counter, mode: 'idle' })\n// The babel plugin compiles <Counter client:idle /> into this.\n\nexport function Island({ component: Component, mode, mediaQuery, ...props }) {\n  const placeholder = h('div', { 'data-island': Component.name || 'Island', 'data-hydrate': mode });\n\n  // We need to return a vnode that the reconciler can handle.\n  // The actual hydration scheduling happens after mount via an effect.\n  const wrapper = signal(null);\n  const hydrated = signal(false);\n\n  function doHydrate() {\n    if (hydrated()) return;\n    hydrated.set(true);\n    // Render the actual component\n    wrapper.set(h(Component, props));\n  }\n\n  // Schedule hydration based on mode\n  function scheduleHydration(el) {\n    switch (mode) {\n      case 'load':\n        queueMicrotask(doHydrate);\n        break;\n\n      case 'idle':\n        if (typeof requestIdleCallback !== 'undefined') {\n          requestIdleCallback(doHydrate);\n        } else {\n          setTimeout(doHydrate, 200);\n        }\n        break;\n\n      case 'visible': {\n        const observer = new IntersectionObserver((entries) => {\n          if (entries[0].isIntersecting) {\n            observer.disconnect();\n            doHydrate();\n          }\n        });\n        observer.observe(el);\n        break;\n      }\n\n      case 'interaction': {\n        const hydrate = () => {\n          el.removeEventListener('click', hydrate);\n          el.removeEventListener('focus', hydrate);\n          el.removeEventListener('mouseenter', hydrate);\n          doHydrate();\n        };\n        el.addEventListener('click', hydrate, { once: true });\n        el.addEventListener('focus', hydrate, { once: true });\n        el.addEventListener('mouseenter', hydrate, { once: true });\n        break;\n      }\n\n      case 'media': {\n        if (!mediaQuery) { doHydrate(); break; }\n        const mq = window.matchMedia(mediaQuery);\n        if (mq.matches) {\n          queueMicrotask(doHydrate);\n        } else {\n          const checkMedia = () => {\n            if (mq.matches) {\n              mq.removeEventListener('change', checkMedia);\n              doHydrate();\n            }\n          };\n          mq.addEventListener('change', checkMedia);\n        }\n        break;\n      }\n\n      default:\n        // Unknown mode, hydrate immediately\n        queueMicrotask(doHydrate);\n    }\n  }\n\n  // Use ref callback to get the DOM element and schedule hydration\n  const refCallback = (el) => {\n    if (el) scheduleHydration(el);\n  };\n\n  // Return: show placeholder until hydrated, then show the real component\n  return h('div', { 'data-island': Component.name || 'Island', 'data-hydrate': mode, ref: refCallback },\n    hydrated() ? wrapper() : null\n  );\n}\n", "// What Framework - Helpers & Utilities\n// Commonly needed patterns, zero overhead.\n\nimport { signal, effect, __DEV__ } from './reactive.js';\n\n// --- each(list, fn) --- [DEPRECATED: use <For> component or .map() instead]\n// Keyed list rendering. Optimized for reconciliation.\nlet _eachWarned = false;\nexport function each(list, fn, keyFn) {\n  if (!_eachWarned) {\n    _eachWarned = true;\n    console.warn('[what] each() is deprecated. Use the <For> component or Array.map() instead.');\n  }\n  if (!list || list.length === 0) return [];\n  return list.map((item, index) => {\n    const vnode = fn(item, index);\n    if (keyFn && vnode && typeof vnode === 'object') {\n      vnode.key = keyFn(item, index);\n    }\n    return vnode;\n  });\n}\n\n// --- cls(...args) ---\n// Conditional class names. Like clsx but tiny.\n// cls('base', condition && 'active', { hidden: isHidden, bold: isBold })\nexport function cls(...args) {\n  const classes = [];\n  for (const arg of args) {\n    if (!arg) continue;\n    if (typeof arg === 'string') {\n      classes.push(arg);\n    } else if (typeof arg === 'object') {\n      for (const [key, val] of Object.entries(arg)) {\n        if (val) classes.push(key);\n      }\n    }\n  }\n  return classes.join(' ');\n}\n\n// --- style(obj) ---\n// Convert a style object to a CSS string for SSR.\nexport function style(obj) {\n  if (typeof obj === 'string') return obj;\n  return Object.entries(obj)\n    .filter(([, v]) => v != null && v !== '')\n    .map(([k, v]) => `${camelToKebab(k)}:${v}`)\n    .join(';');\n}\n\nfunction camelToKebab(str) {\n  return str.replace(/([A-Z])/g, '-$1').toLowerCase();\n}\n\n// --- debounce ---\n// Debounced signal updates.\nexport function debounce(fn, ms) {\n  let timer;\n  return (...args) => {\n    clearTimeout(timer);\n    timer = setTimeout(() => fn(...args), ms);\n  };\n}\n\n// --- throttle ---\nexport function throttle(fn, ms) {\n  let last = 0;\n  return (...args) => {\n    const now = Date.now();\n    if (now - last >= ms) {\n      last = now;\n      fn(...args);\n    }\n  };\n}\n\n// Component context ref \u2014 injected by dom.js to avoid circular imports\nlet _getCurrentComponentRef = null;\nexport function _setComponentRef(fn) { _getCurrentComponentRef = fn; }\n\n// --- useMediaQuery ---\n// Reactive media query. Returns a signal. Cleans up listener on component unmount.\nexport function useMediaQuery(query) {\n  if (typeof window === 'undefined') return signal(false);\n  const mq = window.matchMedia(query);\n  const s = signal(mq.matches);\n  const handler = (e) => s.set(e.matches);\n  mq.addEventListener('change', handler);\n\n  // Register cleanup if inside a component context\n  const ctx = _getCurrentComponentRef?.();\n  if (ctx) {\n    ctx._cleanupCallbacks = ctx._cleanupCallbacks || [];\n    ctx._cleanupCallbacks.push(() => mq.removeEventListener('change', handler));\n  }\n\n  return s;\n}\n\n// --- useLocalStorage ---\n// Signal synced with localStorage. Cleans up listeners on component unmount.\nexport function useLocalStorage(key, initial) {\n  let stored;\n  try {\n    const raw = localStorage.getItem(key);\n    stored = raw !== null ? JSON.parse(raw) : initial;\n  } catch {\n    stored = initial;\n  }\n\n  const s = signal(stored);\n\n  // Sync to localStorage on changes\n  const dispose = effect(() => {\n    try {\n      localStorage.setItem(key, JSON.stringify(s()));\n    } catch (e) {\n      if (__DEV__) console.warn('[what] localStorage write failed (quota exceeded?):', e);\n    }\n  });\n\n  // Listen for changes from other tabs\n  let storageHandler = null;\n  if (typeof window !== 'undefined') {\n    storageHandler = (e) => {\n      if (e.key === key && e.newValue !== null) {\n        try { s.set(JSON.parse(e.newValue)); } catch (err) {\n          if (__DEV__) console.warn('[what] localStorage parse failed:', err);\n        }\n      }\n    };\n    window.addEventListener('storage', storageHandler);\n  }\n\n  // Register cleanup if inside a component context\n  const ctx = _getCurrentComponentRef?.();\n  if (ctx) {\n    ctx._cleanupCallbacks = ctx._cleanupCallbacks || [];\n    ctx._cleanupCallbacks.push(() => {\n      dispose();\n      if (storageHandler) window.removeEventListener('storage', storageHandler);\n    });\n  }\n\n  return s;\n}\n\n// --- portal ---\n// Render children into a different DOM container.\nexport function Portal({ target, children }) {\n  // In SSR, just return null (portals are client-only)\n  if (typeof document === 'undefined') return null;\n  const container = typeof target === 'string'\n    ? document.querySelector(target)\n    : target;\n  if (!container) return null;\n  // The DOM reconciler will mount children here\n  return { tag: '__portal', props: { container }, children: Array.isArray(children) ? children : [children], _vnode: true };\n}\n\n// --- useClickOutside ---\n// Detect clicks outside a ref'd element. Essential for dropdowns, modals, popovers.\nexport function useClickOutside(ref, handler) {\n  if (typeof document === 'undefined') return;\n\n  const listener = (e) => {\n    const el = ref.current || ref;\n    if (!el || el.contains(e.target)) return;\n    handler(e);\n  };\n\n  document.addEventListener('mousedown', listener);\n  document.addEventListener('touchstart', listener);\n\n  const ctx = _getCurrentComponentRef?.();\n  if (ctx) {\n    ctx._cleanupCallbacks = ctx._cleanupCallbacks || [];\n    ctx._cleanupCallbacks.push(() => {\n      document.removeEventListener('mousedown', listener);\n      document.removeEventListener('touchstart', listener);\n    });\n  }\n}\n\n// --- Transition helper ---\n// Animate elements in/out. Returns props to spread on the element.\nexport function transition(name, active) {\n  return {\n    class: active ? `${name}-enter ${name}-enter-active` : `${name}-leave ${name}-leave-active`,\n  };\n}\n", "// What Framework - Fine-Grained DOM Runtime\n// Components run ONCE. Signals create individual DOM effects.\n// No VDOM reconciler, no diffing \u2014 direct DOM manipulation driven by signals.\n\nimport { effect, batch, untrack, signal, __DEV__, __devtools } from './reactive.js';\nimport { reportError, _injectGetCurrentComponent, shallowEqual } from './components.js';\nimport { _setComponentRef } from './helpers.js';\n// SVG elements that need namespace\nconst SVG_ELEMENTS = new Set([\n  'svg', 'path', 'circle', 'rect', 'line', 'polyline', 'polygon', 'ellipse',\n  'g', 'defs', 'use', 'symbol', 'clipPath', 'mask', 'pattern', 'image',\n  'text', 'tspan', 'textPath', 'foreignObject', 'linearGradient', 'radialGradient', 'stop',\n  'marker', 'animate', 'animateTransform', 'animateMotion', 'set', 'filter',\n  'feBlend', 'feColorMatrix', 'feComponentTransfer', 'feComposite', 'feConvolveMatrix',\n  'feDiffuseLighting', 'feDisplacementMap', 'feFlood', 'feGaussianBlur', 'feImage',\n  'feMerge', 'feMergeNode', 'feMorphology', 'feOffset', 'feSpecularLighting',\n  'feTile', 'feTurbulence',\n]);\nconst SVG_NS = 'http://www.w3.org/2000/svg';\n\n// Track all mounted component contexts for disposal\nconst mountedComponents = new Set();\n\n// WeakMap: comment node \u2192 component context (for comment-node boundaries)\nconst _commentCtxMap = new WeakMap();\n\nfunction isDomNode(value) {\n  if (!value || typeof value !== 'object') return false;\n  if (typeof Node !== 'undefined' && value instanceof Node) return true;\n  return typeof value.nodeType === 'number' && typeof value.nodeName === 'string';\n}\n\nfunction isVNode(value) {\n  return !!value && typeof value === 'object' && (value._vnode === true || 'tag' in value);\n}\n\n// Dispose a component: run effect cleanups, hook cleanups, onCleanup callbacks\nfunction disposeComponent(ctx) {\n  if (ctx.disposed) return;\n  ctx.disposed = true;\n\n  // Run cleanup callbacks\n  if (ctx.cleanups) {\n    for (const cleanup of ctx.cleanups) {\n      try { cleanup(); } catch (e) { console.error('[what] cleanup error:', e); }\n    }\n  }\n\n  // Run effect disposals\n  if (ctx.effects) {\n    for (const dispose of ctx.effects) {\n      try { dispose(); } catch (e) { /* already disposed */ }\n    }\n  }\n\n  // Run hook cleanups (useEffect return values)\n  if (ctx.hooks) {\n    for (const hook of ctx.hooks) {\n      if (hook && typeof hook.cleanup === 'function') {\n        try { hook.cleanup(); } catch (e) { console.error('[what] hook cleanup error:', e); }\n      }\n    }\n  }\n\n  // Run onCleanup callbacks\n  if (ctx._cleanupCallbacks) {\n    for (const fn of ctx._cleanupCallbacks) {\n      try { fn(); } catch (e) { console.error('[what] onCleanup error:', e); }\n    }\n  }\n\n  if (__DEV__ && __devtools?.onComponentUnmount) __devtools.onComponentUnmount(ctx);\n  mountedComponents.delete(ctx);\n}\n\n// Dispose all components and reactive effects attached to a DOM subtree.\n// Performance: checks _componentCtx / _dispose / _propEffects before walking\n// children, and only checks _commentCtxMap for comment nodes (nodeType 8).\nexport function disposeTree(node) {\n  if (!node) return;\n  if (node._componentCtx) {\n    disposeComponent(node._componentCtx);\n  }\n  // Check comment node WeakMap for component context \u2014 only for comment nodes\n  if (node.nodeType === 8) {\n    const commentCtx = _commentCtxMap.get(node);\n    if (commentCtx) {\n      disposeComponent(commentCtx);\n    }\n  }\n  // Dispose reactive function child effects ({() => ...} wrappers)\n  if (node._dispose) {\n    try { node._dispose(); } catch (e) { /* already disposed */ }\n  }\n  // Dispose reactive prop effects (value: () => ..., class: () => ..., etc.)\n  if (node._propEffects) {\n    for (const key in node._propEffects) {\n      try { node._propEffects[key](); } catch (e) { /* already disposed */ }\n    }\n  }\n  // Recursively dispose children\n  const children = node.childNodes;\n  if (children && children.length > 0) {\n    for (let i = 0; i < children.length; i++) {\n      disposeTree(children[i]);\n    }\n  }\n}\n\n// Mount a component tree into a DOM container\nexport function mount(vnode, container) {\n  if (typeof container === 'string') {\n    container = document.querySelector(container);\n  }\n  disposeTree(container); // Clean up any previous mount\n  container.textContent = '';\n  const node = createDOM(vnode, container);\n  if (node) container.appendChild(node);\n  return () => {\n    disposeTree(container);\n    container.textContent = '';\n  };\n}\n\n// --- Create DOM from VNode ---\n\nexport function createDOM(vnode, parent, isSvg) {\n  // Null/false/true \u2192 placeholder comment (preserves child indices for reconciliation)\n  if (vnode == null || vnode === false || vnode === true) {\n    return document.createComment('');\n  }\n\n  // Text\n  if (typeof vnode === 'string' || typeof vnode === 'number') {\n    return document.createTextNode(String(vnode));\n  }\n\n  // DOM node passthrough (fine-grained components return real nodes)\n  if (isDomNode(vnode)) {\n    return vnode;\n  }\n\n  // Reactive function child \u2014 use comment markers (no wrapper element)\n  // to avoid polluting the DOM and breaking CSS selectors like :first-child.\n  if (typeof vnode === 'function') {\n    const startMarker = document.createComment('fn');\n    const endMarker = document.createComment('/fn');\n    let currentNodes = [];\n    // We need a parent to insert between markers. The caller (createElementFromVNode\n    // or createComponent) will appendChild both markers and the content. We return\n    // a document fragment containing start marker, then the effect will manage nodes\n    // between start and end markers once they're in the real DOM.\n    const frag = document.createDocumentFragment();\n    frag.appendChild(startMarker);\n    frag.appendChild(endMarker);\n\n    const dispose = effect(() => {\n      const val = vnode();\n      const vnodes = (val == null || val === false || val === true)\n        ? []\n        : Array.isArray(val) ? val : [val];\n\n      const realParent = endMarker.parentNode;\n      if (!realParent) return; // not mounted yet \u2014 first run handled below\n\n      // Remove old nodes between markers\n      for (const old of currentNodes) {\n        disposeTree(old);\n        if (old.parentNode === realParent) realParent.removeChild(old);\n      }\n      currentNodes = [];\n\n      // Add new nodes before endMarker\n      for (const v of vnodes) {\n        const node = createDOM(v, realParent, parent?._isSvg);\n        if (node) {\n          // If createDOM returned a DocumentFragment, track individual children\n          // since fragment nodes get absorbed into the DOM on insertion.\n          if (node.nodeType === 11 /* DOCUMENT_FRAGMENT_NODE */) {\n            const children = Array.from(node.childNodes);\n            realParent.insertBefore(node, endMarker);\n            for (const child of children) currentNodes.push(child);\n          } else {\n            realParent.insertBefore(node, endMarker);\n            currentNodes.push(node);\n          }\n        }\n      }\n    });\n\n    startMarker._dispose = dispose;\n    // Also store dispose on endMarker so disposeTree can find it from either marker\n    endMarker._dispose = dispose;\n    return frag;\n  }\n\n  // Array of vnodes\n  if (Array.isArray(vnode)) {\n    const frag = document.createDocumentFragment();\n    for (const child of vnode) {\n      const node = createDOM(child, parent, isSvg);\n      if (node) frag.appendChild(node);\n    }\n    return frag;\n  }\n\n  // VNode with component tag \u2014 component runs ONCE\n  if (isVNode(vnode) && typeof vnode.tag === 'function') {\n    return createComponent(vnode, parent, isSvg);\n  }\n\n  // VNode with special boundary tags \u2014 route to boundary handlers\n  if (isVNode(vnode) && typeof vnode.tag === 'string') {\n    if (vnode.tag === '__errorBoundary') return createErrorBoundary(vnode, parent);\n    if (vnode.tag === '__suspense') return createSuspenseBoundary(vnode, parent);\n    if (vnode.tag === '__portal') return createPortalDOM(vnode, parent);\n    return createElementFromVNode(vnode, parent, isSvg);\n  }\n\n  // Unknown \u2014 convert to text\n  return document.createTextNode(String(vnode));\n}\n\n// --- Component Rendering ---\n// Components run ONCE. Props are passed as a signal for reactive access.\n\n// Shared Proxy handler for reactive props \u2014 defined once, reused by all components.\n// The Proxy target must be a plain object (not a function) so that ownKeys\n// invariants are satisfied. The propsSignal is stored as target._sig.\nconst _propsProxyHandler = {\n  get(target, key) {\n    if (key === '_sig') return undefined; // hide internal property\n    if (key === '__proto__' || key === 'constructor' || key === 'prototype') return undefined;\n    return target._sig()[key];\n  },\n  has(target, key) {\n    if (key === '_sig') return false;\n    return key in target._sig();\n  },\n  ownKeys(target) {\n    return Reflect.ownKeys(target._sig());\n  },\n  getOwnPropertyDescriptor(target, key) {\n    if (key === '_sig') return undefined;\n    const current = target._sig();\n    if (key in current) {\n      return { value: current[key], writable: false, enumerable: true, configurable: true };\n    }\n    return undefined;\n  },\n  set(target, key) {\n    // Props are read-only from the component's perspective.\n    // Reject all writes \u2014 especially dangerous prototype-chain keys.\n    return false;\n  },\n};\n\nconst componentStack = [];\n\nexport function getCurrentComponent() {\n  return componentStack[componentStack.length - 1];\n}\n\n// Inject into components.js and helpers.js to avoid circular imports\n_injectGetCurrentComponent(getCurrentComponent);\n_setComponentRef(getCurrentComponent);\n\nexport function getComponentStack() {\n  return componentStack;\n}\n\nfunction createComponent(vnode, parent, isSvg) {\n  let { tag: Component, props, children } = vnode;\n\n  // Class component detection\n  if (typeof Component === 'function' &&\n      (Component.prototype?.isReactComponent || Component.prototype?.render)) {\n    const ClassComp = Component;\n    Component = function ClassComponentBridge(props) {\n      const instance = new ClassComp(props);\n      return instance.render();\n    };\n    Component.displayName = ClassComp.displayName || ClassComp.name || 'ClassComponent';\n  }\n\n  // Handle special boundary components\n  if (Component === '__errorBoundary' || vnode.tag === '__errorBoundary') {\n    return createErrorBoundary(vnode, parent);\n  }\n  if (Component === '__suspense' || vnode.tag === '__suspense') {\n    return createSuspenseBoundary(vnode, parent);\n  }\n  if (Component === '__portal' || vnode.tag === '__portal') {\n    return createPortalDOM(vnode, parent);\n  }\n\n  // Component context for hooks\n  // Error boundary lookup: walk the parent chain once, cache the result.\n  const parentCtx = componentStack[componentStack.length - 1] || null;\n  let errorBoundary = null;\n  if (parentCtx) {\n    // Fast path: if parent has an error boundary, use it directly\n    errorBoundary = parentCtx._errorBoundary || null;\n    if (!errorBoundary) {\n      let p = parentCtx._parentCtx;\n      while (p) {\n        if (p._errorBoundary) { errorBoundary = p._errorBoundary; break; }\n        p = p._parentCtx;\n      }\n    }\n  }\n  const ctx = {\n    hooks: [],\n    hookIndex: 0,\n    effects: [],\n    cleanups: [],\n    mounted: false,\n    disposed: false,\n    Component,\n    _parentCtx: parentCtx,\n    _errorBoundary: errorBoundary,\n  };\n\n  // Component boundaries: use comment nodes instead of <span style=\"display:contents\">\n  // to avoid DOM pollution, CSS selector breakage, and a11y issues.\n  const startComment = document.createComment('c:start');\n  const endComment = document.createComment('c:end');\n  _commentCtxMap.set(startComment, ctx);\n  ctx._startComment = startComment;\n  ctx._endComment = endComment;\n\n  // Fragment to hold comment boundaries + component output\n  const container = document.createDocumentFragment();\n  container._componentCtx = ctx;\n  ctx._wrapper = startComment; // Reference for context lookup\n\n  // Track for disposal\n  mountedComponents.add(ctx);\n  if (__DEV__ && __devtools?.onComponentMount) __devtools.onComponentMount(ctx);\n\n  // Props signal for reactive updates from parent\n  const propsChildren = children.length === 0 ? undefined : children.length === 1 ? children[0] : children;\n  // Merge children into props without spreading when possible\n  let mergedProps;\n  if (propsChildren !== undefined) {\n    mergedProps = props ? Object.assign({}, props, { children: propsChildren }) : { children: propsChildren };\n  } else {\n    mergedProps = props ? Object.assign({}, props) : {};\n  }\n  const propsSignal = signal(mergedProps);\n  ctx._propsSignal = propsSignal;\n\n  // Create a reactive props proxy: reading any prop inside an effect\n  // will auto-track the dependency on the propsSignal. This makes prop\n  // access reactive across re-renders without requiring the component\n  // to be re-executed.\n  // Reuse shared trap handlers to minimize per-component allocation.\n  // Store propsSignal on a plain object target (Proxy invariant: ownKeys must\n  // match non-configurable own properties of target; functions have 'prototype').\n  const reactiveProps = new Proxy({ _sig: propsSignal }, _propsProxyHandler);\n\n  // Component runs ONCE \u2014 not inside an effect.\n  // untrack() prevents the component's signal reads and effect creation\n  // from being captured by any parent effect (e.g., reconcileInsert).\n  // Without this, dynamically-rendered components leak their internal\n  // reactivity into the parent, causing infinite re-creation loops.\n  componentStack.push(ctx);\n\n  let result;\n  try {\n    result = untrack(() => Component(reactiveProps));\n  } catch (error) {\n    componentStack.pop();\n    if (!reportError(error, ctx)) {\n      console.error('[what] Uncaught error in component:', Component.name || 'Anonymous', error);\n      throw error;\n    }\n    // Return fragment with just comment boundaries on error\n    container.appendChild(startComment);\n    container.appendChild(endComment);\n    return container;\n  }\n\n  componentStack.pop();\n  ctx.mounted = true;\n\n  // Run onMount callbacks after DOM is ready\n  if (ctx._mountCallbacks) {\n    queueMicrotask(() => {\n      if (ctx.disposed) return;\n      for (const fn of ctx._mountCallbacks) {\n        try { fn(); } catch (e) { console.error('[what] onMount error:', e); }\n      }\n    });\n  }\n\n  // Build fragment: <!-- c:start --> [component output] <!-- c:end -->\n  container.appendChild(startComment);\n  const vnodes = Array.isArray(result) ? result : [result];\n  for (const v of vnodes) {\n    const node = createDOM(v, container, isSvg);\n    if (node) container.appendChild(node);\n  }\n  container.appendChild(endComment);\n\n  return container;\n}\n\n// Error boundary component handler\nfunction createErrorBoundary(vnode, parent) {\n  const { errorState, handleError, fallback, reset } = vnode.props;\n  const children = vnode.children;\n\n  // Use comment node boundaries instead of <span style=\"display:contents\">\n  // to avoid DOM pollution, CSS selector breakage, and a11y issues.\n  const startComment = document.createComment('eb:start');\n  const endComment = document.createComment('eb:end');\n\n  const boundaryCtx = {\n    hooks: [], hookIndex: 0, effects: [], cleanups: [],\n    mounted: false, disposed: false,\n    _parentCtx: componentStack[componentStack.length - 1] || null,\n    _errorBoundary: handleError,\n    _startComment: startComment,\n    _endComment: endComment,\n  };\n  _commentCtxMap.set(startComment, boundaryCtx);\n\n  const container = document.createDocumentFragment();\n  container._componentCtx = boundaryCtx;\n  container.appendChild(startComment);\n  container.appendChild(endComment);\n\n  const dispose = effect(() => {\n    const error = errorState();\n\n    componentStack.push(boundaryCtx);\n\n    // Remove old content between comment boundaries\n    if (startComment.parentNode) {\n      while (startComment.nextSibling && startComment.nextSibling !== endComment) {\n        const old = startComment.nextSibling;\n        disposeTree(old);\n        old.parentNode.removeChild(old);\n      }\n    }\n\n    let vnodes;\n    if (error) {\n      vnodes = typeof fallback === 'function' ? [fallback({ error, reset })] : [fallback];\n    } else {\n      vnodes = children;\n    }\n\n    vnodes = Array.isArray(vnodes) ? vnodes : [vnodes];\n\n    for (const v of vnodes) {\n      const node = createDOM(v, parent);\n      if (node) {\n        // Insert before endComment\n        if (endComment.parentNode) {\n          endComment.parentNode.insertBefore(node, endComment);\n        } else {\n          // Still in fragment before first mount\n          container.insertBefore(node, endComment);\n        }\n      }\n    }\n\n    componentStack.pop();\n  });\n\n  boundaryCtx.effects.push(dispose);\n  return container;\n}\n\n// Suspense boundary component handler\nfunction createSuspenseBoundary(vnode, parent) {\n  const { boundary, fallback, loading } = vnode.props;\n  const children = vnode.children;\n\n  // Use comment node boundaries instead of <span style=\"display:contents\">\n  // to avoid DOM pollution, CSS selector breakage, and a11y issues.\n  const startComment = document.createComment('sb:start');\n  const endComment = document.createComment('sb:end');\n\n  const boundaryCtx = {\n    hooks: [], hookIndex: 0, effects: [], cleanups: [],\n    mounted: false, disposed: false,\n    _parentCtx: componentStack[componentStack.length - 1] || null,\n    _startComment: startComment,\n    _endComment: endComment,\n  };\n  _commentCtxMap.set(startComment, boundaryCtx);\n\n  const container = document.createDocumentFragment();\n  container._componentCtx = boundaryCtx;\n  container.appendChild(startComment);\n  container.appendChild(endComment);\n\n  const dispose = effect(() => {\n    const isLoading = loading();\n    const vnodes = isLoading ? [fallback] : children;\n    const normalized = Array.isArray(vnodes) ? vnodes : [vnodes];\n\n    componentStack.push(boundaryCtx);\n\n    // Remove old content between comment boundaries\n    if (startComment.parentNode) {\n      while (startComment.nextSibling && startComment.nextSibling !== endComment) {\n        const old = startComment.nextSibling;\n        disposeTree(old);\n        old.parentNode.removeChild(old);\n      }\n    }\n\n    for (const v of normalized) {\n      const node = createDOM(v, parent);\n      if (node) {\n        // Insert before endComment\n        if (endComment.parentNode) {\n          endComment.parentNode.insertBefore(node, endComment);\n        } else {\n          // Still in fragment before first mount\n          container.insertBefore(node, endComment);\n        }\n      }\n    }\n\n    componentStack.pop();\n  });\n\n  boundaryCtx.effects.push(dispose);\n  return container;\n}\n\n// Portal component handler\nfunction createPortalDOM(vnode, parent) {\n  const { container } = vnode.props;\n  const children = vnode.children;\n\n  if (!container) {\n    console.warn('[what] Portal: target container not found');\n    return document.createComment('portal:empty');\n  }\n\n  const portalCtx = {\n    hooks: [], hookIndex: 0, effects: [], cleanups: [],\n    mounted: false, disposed: false,\n    _parentCtx: componentStack[componentStack.length - 1] || null,\n  };\n\n  const placeholder = document.createComment('portal');\n  placeholder._componentCtx = portalCtx;\n\n  const portalNodes = [];\n  for (const child of children) {\n    const node = createDOM(child, container);\n    if (node) {\n      container.appendChild(node);\n      portalNodes.push(node);\n    }\n  }\n\n  portalCtx._cleanupCallbacks = [() => {\n    for (const node of portalNodes) {\n      disposeTree(node);\n      if (node.parentNode) node.parentNode.removeChild(node);\n    }\n  }];\n\n  return placeholder;\n}\n\n// --- Create Element from VNode ---\n// For h()-based VNodes with string tags\n\nfunction createElementFromVNode(vnode, parent, isSvg) {\n  const { tag, props, children } = vnode;\n\n  const svgContext = isSvg || SVG_ELEMENTS.has(tag);\n  const el = svgContext\n    ? document.createElementNS(SVG_NS, tag)\n    : document.createElement(tag);\n\n  // Apply props\n  if (props) {\n    applyProps(el, props, {}, svgContext);\n  }\n\n  // Append children\n  const isSvgChildren = svgContext && tag !== 'foreignObject';\n  for (let i = 0; i < children.length; i++) {\n    const node = createDOM(children[i], el, isSvgChildren);\n    if (node) el.appendChild(node);\n  }\n\n  el._vnode = vnode;\n  return el;\n}\n\n// --- Prop Application ---\n// Only applied once for fine-grained (no diffing). Reactive props use effects.\n\nfunction applyProps(el, newProps, oldProps, isSvg) {\n  if (!newProps) return;\n\n  for (const key in newProps) {\n    if (key === 'key' || key === 'children') continue;\n\n    // Handle ref\n    if (key === 'ref') {\n      const ref = newProps.ref;\n      if (typeof ref === 'function') ref(el);\n      else if (ref) ref.current = el;\n      continue;\n    }\n\n    setProp(el, key, newProps[key], isSvg);\n  }\n}\n\n// <select> needs its value set after <option> children mount. Setting it\n// immediately can fail if the matching <option> isn't in the DOM yet; the\n// microtask retry fixes up after the options are appended.\nexport function _setSelectValue(el, value) {\n  el.value = value;\n  if (el.value !== String(value)) {\n    queueMicrotask(() => { el.value = value; });\n  }\n}\n\n// NOTE: there are intentionally TWO `setProp` implementations in this codebase:\n//   - dom.js setProp (this one) \u2014 h()/createDOM/diff-style path. Handles\n//     addEventListener bookkeeping (el._events with capture variants and the\n//     untrack wrapper), supports `isSvg` flag from the caller. Used by the\n//     legacy diff-driven update path.\n//   - render.js setProp \u2014 fine-grained-compiler output path. No event-handler\n//     bookkeeping (events go through delegation / direct addEventListener at\n//     compile time), but adds URL sanitization for href/src and the\n//     innerHTML `{__html}` enforcement that the compiler relies on.\n// Both share the `el._propEffects[key]` disposer convention. Do not merge\n// without consolidating the event/listener model \u2014 they have different callers.\nfunction setProp(el, key, value, isSvg) {\n  // Reactive function props \u2014 wrap in effect for fine-grained updates\n  if (typeof value === 'function' && !(key.startsWith('on') && key.length > 2) && key !== 'ref') {\n    if (!el._propEffects) el._propEffects = {};\n    if (el._propEffects[key]) {\n      try { el._propEffects[key](); } catch (e) { /* already disposed */ }\n    }\n    el._propEffects[key] = effect(() => {\n      const resolved = value();\n      setProp(el, key, resolved, isSvg);\n    });\n    return;\n  }\n\n  // Event handlers\n  if (key.startsWith('on') && key.length > 2) {\n    let eventName = key.slice(2);\n    let useCapture = false;\n    if (eventName.endsWith('Capture')) {\n      eventName = eventName.slice(0, -7);\n      useCapture = true;\n    }\n    const event = eventName.toLowerCase();\n    const storageKey = useCapture ? event + '_capture' : event;\n    const old = el._events?.[storageKey];\n    if (old && old._original === value) return;\n    if (old) el.removeEventListener(event, old, useCapture);\n    if (value == null) return;\n    if (!el._events) el._events = {};\n    // Single closure per event listener. Uses untrack to prevent accidental\n    // signal subscriptions inside event handlers.\n    const wrappedHandler = (e) => {\n      if (!e.nativeEvent) e.nativeEvent = e;\n      return untrack(() => wrappedHandler._handler(e));\n    };\n    wrappedHandler._handler = value;\n    wrappedHandler._original = value;\n    el._events[storageKey] = wrappedHandler;\n    const eventOpts = value._eventOpts;\n    el.addEventListener(event, wrappedHandler, eventOpts || useCapture || undefined);\n    return;\n  }\n\n  // className / class\n  if (key === 'className' || key === 'class') {\n    if (isSvg) {\n      el.setAttribute('class', value || '');\n    } else {\n      el.className = value || '';\n    }\n    return;\n  }\n\n  // Style\n  if (key === 'style') {\n    if (typeof value === 'string') {\n      el.style.cssText = value;\n      el._prevStyle = null;\n    } else if (typeof value === 'object') {\n      const oldStyle = el._prevStyle || {};\n      for (const prop in oldStyle) {\n        if (!(prop in value)) el.style[prop] = '';\n      }\n      for (const prop in value) {\n        el.style[prop] = value[prop] ?? '';\n      }\n      el._prevStyle = { ...value };\n    }\n    return;\n  }\n\n  // dangerouslySetInnerHTML\n  if (key === 'dangerouslySetInnerHTML') {\n    const html = value?.__html ?? '';\n    if (__DEV__ && typeof html === 'string' && /(<script|onerror\\s*=|onload\\s*=|javascript:)/i.test(html)) {\n      console.warn('[what] dangerouslySetInnerHTML contains potential XSS vectors. Ensure content is sanitized.');\n    }\n    el.innerHTML = html;\n    return;\n  }\n\n  // innerHTML \u2014 require { __html: ... } wrapper to prevent XSS\n  if (key === 'innerHTML') {\n    if (value == null) return; // null/undefined \u2014 do nothing\n    if (value && typeof value === 'object' && '__html' in value) {\n      const html = value.__html ?? '';\n      if (__DEV__ && typeof html === 'string' && /(<script|onerror\\s*=|onload\\s*=|javascript:)/i.test(html)) {\n        console.warn('[what] dangerouslySetInnerHTML contains potential XSS vectors. Ensure content is sanitized.');\n      }\n      el.innerHTML = html;\n    } else {\n      if (__DEV__) {\n        console.warn(\n          '[what] innerHTML received a raw string. This is a security risk (XSS). ' +\n          'Use innerHTML={{ __html: trustedString }} or dangerouslySetInnerHTML={{ __html: trustedString }} instead.'\n        );\n      }\n      // Refuse to set raw string innerHTML \u2014 prevent XSS\n      return;\n    }\n    return;\n  }\n\n  // Boolean attributes\n  if (typeof value === 'boolean') {\n    if (value) el.setAttribute(key, '');\n    else el.removeAttribute(key);\n    return;\n  }\n\n  // data-* and aria-*\n  if (key.startsWith('data-') || key.startsWith('aria-')) {\n    el.setAttribute(key, value);\n    return;\n  }\n\n  // SVG\n  if (isSvg) {\n    if (value === false || value == null) {\n      el.removeAttribute(key);\n    } else {\n      el.setAttribute(key, value === true ? '' : String(value));\n    }\n    return;\n  }\n\n  // <select> value must be set after <option> children are in the DOM\n  if (key === 'value' && el.tagName === 'SELECT') {\n    _setSelectValue(el, value);\n    return;\n  }\n\n  // Default: property if exists, otherwise attribute\n  if (key in el) {\n    el[key] = value;\n  } else {\n    el.setAttribute(key, value);\n  }\n}\n"],
+  "mappings": "4CAUO,IAAMA,EAAU,SAAO,QAAY,KAM/BC,EAAa,KAGjB,SAASC,GAAmBC,EAAO,CACpCH,IAASC,EAAaE,EAC5B,CAEA,IAAIC,EAAgB,KAChBC,EAAc,KACdC,EAAe,KACfC,EAAiB,GACjBC,EAAa,EACbC,EAAiB,CAAC,EAClBC,EAAkB,GAUhBC,EAAiB,OAAO,gBAAgB,EAC1CC,EAAqB,KAelB,SAASC,EAAOC,EAASC,EAAW,CACzC,IAAIC,EAAQF,EACNG,EAAO,IAAI,IAIbC,EAAc,KACdC,EAAmB,EAIvB,SAASC,EAAUC,EAAM,CACnBrB,GAAWO,GACb,QAAQ,KACN,+GAECQ,EAAY,aAAaA,CAAS,IAAM,GAC3C,EAEF,IAAMO,EAAU,OAAOD,GAAS,WAAaA,EAAKL,CAAK,EAAIK,EAGvDL,IAAUM,GAAYN,IAAUA,GAASM,IAAYA,IACzDN,EAAQM,EAGRJ,EAAc,KACVlB,GAAWC,GAAYA,EAAW,eAAesB,CAAG,EACpDN,EAAK,KAAO,GAAGO,GAAOP,CAAI,EAChC,CAIA,SAASM,EAAIE,EAAQ,CACnB,GAAI,UAAU,SAAW,EAAG,CAE1B,IAAMC,EAAKtB,EACX,OAAIsB,IAAO,OAILA,IAAOR,GAAeQ,EAAG,SAAWP,KACtCD,EAAcQ,EACdP,EAAmBO,EAAG,OACtBT,EAAK,IAAIS,CAAE,EACXA,EAAG,KAAK,KAAKT,CAAI,GAGdD,CACT,CAEAI,EAAUK,CAAM,CAClB,CAEA,OAAAF,EAAI,IAAMH,EAEVG,EAAI,KAAO,IAAMP,EAEjBO,EAAI,UAAaI,GACRC,EAAO,IAAMD,EAAGJ,EAAI,CAAC,CAAC,EAG/BA,EAAI,QAAU,GACVvB,IACFuB,EAAI,MAAQN,EACRF,IAAWQ,EAAI,WAAaR,IAI9Bf,GAAWC,GAAYA,EAAW,eAAesB,CAAG,EAEjDA,CACT,CAMO,SAASM,GAASF,EAAI,CAC3B,IAAIX,EAAOc,EAAQ,GACbb,EAAO,IAAI,IACbC,EAAc,KACdC,EAAmB,EAEjBY,EAAQC,EAAc,IAAM,CAChC,IAAMC,EAAqB1B,EACvBP,IAASO,EAAiB,IAC9B,GAAI,CACFS,EAAQW,EAAG,EACXG,EAAQ,EACV,QAAE,CACI9B,IAASO,EAAiB0B,EAChC,CACF,EAAG,EAAI,EAGPF,EAAM,OAAS,EACfA,EAAM,UAAY,GAClBA,EAAM,cAAgBd,EAGtBA,EAAK,OAASc,EAGdA,EAAM,WAAa,IAAM,CAAED,EAAQ,EAAM,EACzCC,EAAM,SAAW,IAAMD,EAEvB,SAASI,GAAO,CACd,IAAMR,EAAKtB,EACX,OAAIsB,IAAO,OACLA,IAAOR,GAAeQ,EAAG,SAAWP,KACtCD,EAAcQ,EACdP,EAAmBO,EAAG,OACtBT,EAAK,IAAIS,CAAE,EACXA,EAAG,KAAK,KAAKT,CAAI,GAGjBa,GAAOK,EAAkBJ,CAAK,EAC3Bf,CACT,CAGA,OAAAe,EAAM,UAAY,IAAM,CACtBD,EAAQ,GACRZ,EAAc,KACVD,EAAK,KAAO,GAAGO,GAAOP,CAAI,CAChC,EAEAiB,EAAK,QAAU,GACfA,EAAK,KAAO,KACNJ,GAAOK,EAAkBJ,CAAK,EAC3Bf,GAGFkB,CACT,CAcA,SAASC,EAAkBC,EAAgB,CACzC,GAAIxB,IAAuB,KAIzB,MAAAA,EAAmB,KAAKwB,CAAc,EAChCzB,EAKR,IAAM0B,EAAQ,CAACD,CAAc,EAC7BxB,EAAqByB,EAErB,GAAI,CACF,KAAOA,EAAM,OAAS,GAAG,CACvB,IAAMC,EAAUD,EAAMA,EAAM,OAAS,CAAC,EAEtC,GAAI,CAACC,EAAQ,UAAY,CAACA,EAAQ,SAAS,EAAG,CAE5CD,EAAM,IAAI,EACV,QACF,CAKA,IAAIE,EAAiB,GACfC,EAAOF,EAAQ,KACrB,QAASG,EAAI,EAAGA,EAAID,EAAK,OAAQC,IAAK,CACpC,IAAMC,EAAWF,EAAKC,CAAC,EAAE,OACrBC,GAAYA,EAAS,WAAaA,EAAS,UAAYA,EAAS,SAAS,IAC3EL,EAAM,KAAKK,CAAQ,EACnBH,EAAiB,GAErB,CACA,GAAI,CAAAA,EAOJ,GAAI,CACF,IAAMI,EAAcL,EAAQ,KAAK,OACjCM,EAAWN,CAAO,EAEdA,EAAQ,KAAK,SAAWK,GAC1BE,EAAaP,CAAO,EAEtBD,EAAM,IAAI,CACZ,OAASS,EAAK,CACZ,GAAIA,IAAQnC,EAGV2B,EAAQ,WAAW,MAGnB,OAAMQ,CAEV,CACF,CACF,QAAE,CACAlC,EAAqB,IACvB,CACF,CAGA,SAASiC,EAAa,EAAG,CACvB,IAAIE,EAAc,EACZP,EAAO,EAAE,KACf,QAASC,EAAI,EAAGA,EAAID,EAAK,OAAQC,IAAK,CACpC,IAAMO,EAAQR,EAAKC,CAAC,EAAE,OACtB,GAAIO,EAAO,CACT,IAAMC,EAAWD,EAAM,OACnBC,EAAWF,IAAaA,EAAcE,EAC5C,CACF,CACA,EAAE,OAASF,EAAc,CAC3B,CAMA,IAAMG,GAAe,IAAM,CAAC,EAErB,SAAStB,EAAOD,EAAIwB,EAAM,CAC/B,IAAMC,EAAIpB,EAAcL,CAAE,EAC1ByB,EAAE,OAAS,EAEX,IAAMC,EAAOjD,EACbA,EAAgBgD,EAChB,GAAI,CACF,IAAME,EAASF,EAAE,GAAG,EAChB,OAAOE,GAAW,aAAYF,EAAE,SAAWE,EACjD,QAAE,CACAlD,EAAgBiD,CAClB,CAmBA,GAjBAR,EAAaO,CAAC,EAEVD,GAAM,SAAQC,EAAE,QAAU,IAe1BA,EAAE,KAAK,SAAW,GAAKA,EAAE,WAAa,KACxC,OAAAA,EAAE,SAAW,GACTpD,GAAWC,GAAYA,EAAW,gBAAgBmD,CAAC,EAChDF,GAGT,IAAMK,EAAU,IAAMC,EAAeJ,CAAC,EAEtC,OAAI/C,GACFA,EAAY,UAAU,KAAKkD,CAAO,EAE7BA,CACT,CAKO,SAASE,GAAM9B,EAAI,CACxBnB,IACA,GAAI,CACFmB,EAAG,CACL,QAAE,CACAnB,IACIA,IAAe,GAAGkD,EAAM,CAC9B,CACF,CAIA,SAAS1B,EAAcL,EAAIgC,EAAM,CAK/B,IAAMP,EAAI,CACR,GAAAzB,EACA,KAAM,CAAC,EACP,KAAMgC,GAAQ,GACd,UAAW,KACX,SAAU,GACV,SAAU,GACV,QAAS,GACT,OAAQ,EACR,UAAW,GACX,cAAe,KACf,SAAU,KACV,WAAY,KACZ,SAAU,KACV,OAAQ,CACV,EACA,OAAI3D,GAAWC,GAAYA,EAAW,eAAemD,CAAC,EAC/CA,CACT,CAEA,SAASR,EAAW,EAAG,CACrB,GAAI,EAAE,SAAU,OAMhB,GAAI,EAAE,QAAS,CACb,GAAI,EAAE,SAAU,CACd,GAAI,CAAE,EAAE,SAAS,CAAG,OAASE,EAAK,CAC5B9C,GAAS,QAAQ,KAAK,kCAAmC8C,CAAG,CAClE,CACA,EAAE,SAAW,IACf,CACA,IAAMO,EAAOjD,EACbA,EAAgB,KAChB,GAAI,CACF,IAAMkD,EAAS,EAAE,GAAG,EAChB,OAAOA,GAAW,aAAY,EAAE,SAAWA,EACjD,OAASR,EAAK,CACR7C,GAAY,SAASA,EAAW,QAAQ6C,EAAK,CAAE,KAAM,SAAU,OAAQ,CAAE,CAAC,EAC1E9C,GAAS,QAAQ,KAAK,iCAAkC8C,CAAG,CACjE,QAAE,CACA1C,EAAgBiD,CAClB,CACIrD,GAAWC,GAAY,aAAaA,EAAW,YAAY,CAAC,EAChE,MACF,CAIA,IAAM2D,EAAY,EAAE,KAAK,SAAW,EAAI,EAAE,KAAK,CAAC,EAAI,KAIpD,GAFAC,EAAQ,CAAC,EAEL,EAAE,SAAU,CACd,GAAI,CAAE,EAAE,SAAS,CAAG,OAASf,EAAK,CAC5B9C,GAAWC,GAAY,SAASA,EAAW,QAAQ6C,EAAK,CAAE,KAAM,iBAAkB,OAAQ,CAAE,CAAC,EAC7F9C,GAAS,QAAQ,KAAK,kCAAmC8C,CAAG,CAClE,CACA,EAAE,SAAW,IACf,CACA,IAAMO,EAAOjD,EACbA,EAAgB,EAChB,GAAI,CACF,IAAMkD,EAAS,EAAE,GAAG,EAEhB,OAAOA,GAAW,aACpB,EAAE,SAAWA,EAEjB,OAASR,EAAK,CACZ,MAAIA,IAAQnC,GACRX,GAAWC,GAAY,SAASA,EAAW,QAAQ6C,EAAK,CAAE,KAAM,SAAU,OAAQ,CAAE,CAAC,EACnFA,CACR,QAAE,CACA1C,EAAgBiD,CAClB,CAQIO,IAAc,MAAQ,EAAE,KAAK,SAAW,GAAK,EAAE,KAAK,CAAC,IAAMA,GACxD,CAAC,EAAE,UAAY,CAAC,EAAE,WACvB,EAAE,QAAU,IAGV5D,GAAWC,GAAY,aAAaA,EAAW,YAAY,CAAC,CAClE,CAEA,SAASuD,EAAe,EAAG,CAKzB,GAJA,EAAE,SAAW,GACTxD,GAAWC,GAAYA,EAAW,gBAAgB,CAAC,EACvD4D,EAAQ,CAAC,EAEL,EAAE,SAAU,CACd,GAAI,CAAE,EAAE,SAAS,CAAG,OAASf,EAAK,CAC5B9C,GAAS,QAAQ,KAAK,6CAA8C8C,CAAG,CAC7E,CACA,EAAE,SAAW,IACf,CACF,CAEA,SAASe,EAAQ,EAAG,CAClB,IAAMrB,EAAO,EAAE,KACf,QAASC,EAAI,EAAGA,EAAID,EAAK,OAAQC,IAAKD,EAAKC,CAAC,EAAE,OAAO,CAAC,EACtDD,EAAK,OAAS,EAGd,EAAE,QACJ,CAQA,IAAIsB,EAAc,EACdC,EAAc,KACdC,EAAiB,EAIrB,SAASC,EAAmB,EAAG,CAC7B,GAAI,GAAE,UACN,GAAI,EAAE,UAGJ,EAAE,UAAU,UACH,CAAC,EAAE,SACZ,GAAIzD,IAAe,GAAK,EAAE,QAAS,CAEjC,IAAM6C,EAAOjD,EACbA,EAAgB,KAChB,GAAI,CACF,IAAMkD,EAAS,EAAE,GAAG,EACpB,GAAI,OAAOA,GAAW,WAAY,CAChC,GAAI,EAAE,SAAU,GAAI,CAAE,EAAE,SAAS,CAAG,MAAc,CAAe,CACjE,EAAE,SAAWA,CACf,CACF,OAASR,EAAK,CACR9C,GAAWC,GAAY,SAASA,EAAW,QAAQ6C,EAAK,CAAE,KAAM,SAAU,OAAQ,CAAE,CAAC,EACrF9C,GAAS,QAAQ,KAAK,iCAAkC8C,CAAG,CACjE,QAAE,CACA1C,EAAgBiD,CAClB,CACF,KAAO,CACL,EAAE,SAAW,GACb,IAAMa,EAAQ,EAAE,OACVC,EAAM1D,EAAe,OACvB0D,EAAM,GAAK1D,EAAe0D,EAAM,CAAC,EAAE,OAASD,IAC9CxD,EAAkB,IAEpBD,EAAe,KAAK,CAAC,CACvB,EAEJ,CAEA,SAASe,GAAOP,EAAM,CAGpB,GAAI6C,IAAgB,EAAG,CACrBA,EAAc,EACd,GAAI,CACF,QAAWV,KAAKnC,EACdgD,EAAmBb,CAAC,EAGtB,GAAIY,EAAiB,EAAG,CACtB,IAAII,EAAK,EACT,KAAOA,EAAKJ,GAAgB,CAC1B,IAAMK,EAAaN,EAAYK,CAAE,EACjCL,EAAYK,CAAE,EAAI,KAClBA,IACA,QAAWhB,KAAKiB,EACdJ,EAAmBb,CAAC,CAExB,CACAY,EAAiB,CACnB,CACF,QAAE,CACAF,EAAc,CAChB,CACItD,IAAe,GAAKC,EAAe,OAAS,GAAG6D,GAAkB,CACvE,MAEMP,IAAgB,OAAMA,EAAc,CAAC,GACrCC,GAAkBD,EAAY,OAChCA,EAAY,KAAK9C,CAAI,EAErB8C,EAAYC,CAAc,EAAI/C,EAEhC+C,GAEJ,CAEA,IAAIO,EAAqB,GACzB,SAASD,IAAoB,CACtBC,IACHA,EAAqB,GACrB,eAAe,IAAM,CACnBA,EAAqB,GACrBb,EAAM,CACR,CAAC,EAEL,CAEA,IAAIc,EAAa,GAEjB,SAASd,GAAQ,CAIf,GAAI,CAAAc,EACJ,CAAAA,EAAa,GAEb,GAAI,CACF,IAAIC,EAAa,EACjB,KAAOhE,EAAe,OAAS,GAAKgE,EAAa,IAAI,CACnD,IAAMhB,EAAQhD,EACdA,EAAiB,CAAC,EAOdgD,EAAM,OAAS,GAAK/C,GACtB+C,EAAM,KAAK,CAACiB,EAAGC,IAAMD,EAAE,OAASC,EAAE,MAAM,EAE1CjE,EAAkB,GAElB,QAAS+B,EAAI,EAAGA,EAAIgB,EAAM,OAAQhB,IAAK,CACrC,IAAMW,EAAIK,EAAMhB,CAAC,EAEjB,GADAW,EAAE,SAAW,GACT,CAACA,EAAE,UAAY,CAACA,EAAE,UAAW,CAC/B,IAAMT,EAAcS,EAAE,KAAK,OAK3B,GAAI,CACFR,EAAWQ,CAAC,CACd,OAASN,EAAK,CACZ,GAAIA,IAAQnC,EAAgB,MAAMmC,EAC9B9C,GAAWC,GAAY,SAASA,EAAW,QAAQ6C,EAAK,CAAE,KAAM,SAAU,OAAQM,CAAE,CAAC,EAIzF,GAAI,CAAE,QAAQ,MAAM,iDAAkDN,CAAG,CAAG,MAAQ,CAAmB,CACvG,QACF,CAEI,CAACM,EAAE,WAAaA,EAAE,KAAK,SAAWT,GACpCE,EAAaO,CAAC,CAElB,CACF,CACAqB,GACF,CACA,GAAIA,GAAc,GAAI,CACpB,GAAIzE,EAAS,CAEX,IAAM4E,EADYnE,EAAe,MAAM,EAAG,CAAC,EACb,IAAI2C,GAAKA,EAAE,IAAI,MAAQA,EAAE,IAAI,SAAS,EAAE,MAAM,EAAG,EAAE,GAAK,aAAa,EACnG,QAAQ,KACN,kNAGoBwB,EAAY,KAAK,IAAI,CAAC,EAC5C,CACF,MACE,QAAQ,KAAK,+CAA+C,EAG9D,QAASnC,EAAI,EAAGA,EAAIhC,EAAe,OAAQgC,IAAKhC,EAAegC,CAAC,EAAE,SAAW,GAC7EhC,EAAe,OAAS,CAC1B,CACF,QAAE,CACA+D,EAAa,EACf,EACF,CAOO,SAASK,GAAKlD,EAAI,CACvB,IAAIX,EACEC,EAAO,IAAI,IAEXmC,EAAIpB,EAAc,IAAM,CAC5B,IAAMX,EAAOM,EAAG,EAChB,GAAI,CAAC,OAAO,GAAGX,EAAOK,CAAI,EAAG,CAC3BL,EAAQK,EAGR,QAAWyD,KAAO7D,EAChB,GAAI,CAAA6D,EAAI,UACR,GAAIA,EAAI,UAENA,EAAI,UAAU,UACL,CAACA,EAAI,SAAU,CACxBA,EAAI,SAAW,GACf,IAAMZ,EAAQY,EAAI,OACZX,EAAM1D,EAAe,OACvB0D,EAAM,GAAK1D,EAAe0D,EAAM,CAAC,EAAE,OAASD,IAC9CxD,EAAkB,IAEpBD,EAAe,KAAKqE,CAAG,CACzB,EAEJ,CACF,CAAC,EAED1B,EAAE,OAAS,EAEXR,EAAWQ,CAAC,EACZP,EAAaO,CAAC,EAGdnC,EAAK,OAASmC,EAGV/C,GACFA,EAAY,UAAU,KAAK,IAAMmD,EAAeJ,CAAC,CAAC,EAGpD,SAASlB,GAAO,CACd,OAAI9B,IACFa,EAAK,IAAIb,CAAa,EACtBA,EAAc,KAAK,KAAKa,CAAI,GAEvBD,CACT,CAEA,OAAAkB,EAAK,QAAU,GACfA,EAAK,KAAO,IAAMlB,EACXkB,CACT,CAKO,SAAS6C,IAAY,CAC1B,GAAIP,EAAY,CAKVxE,GACF,QAAQ,KACN,oMAEF,EAEF,MACF,CACA,GAAII,EAAe,CAEbJ,GACF,QAAQ,KACN,yJAEF,EAEF,MACF,CACAuE,EAAqB,GACrBb,EAAM,CACR,CAIO,SAASsB,EAAQrD,EAAI,CAC1B,IAAM0B,EAAOjD,EACbA,EAAgB,KAChB,GAAI,CACF,OAAOuB,EAAG,CACZ,QAAE,CACAvB,EAAgBiD,CAClB,CACF,CAMO,SAAS4B,IAAW,CACzB,OAAO3E,CACT,CAEO,SAAS4E,GAAalC,EAAOrB,EAAI,CACtC,IAAM0B,EAAO/C,EACP6E,EAAW9E,EACjBC,EAAe0C,EACf3C,EAAc2C,EACd,GAAI,CACF,OAAOrB,EAAG,CACZ,QAAE,CACArB,EAAe+C,EACfhD,EAAc8E,CAChB,CACF,CAOO,SAASC,GAAWzD,EAAI,CAC7B,IAAMwD,EAAW9E,EACXgF,EAAY/E,EACZgF,EAAO,CACX,UAAW,CAAC,EACZ,MAAOhF,EACP,SAAU,CAAC,EACX,UAAW,EACb,EAGIA,GACFA,EAAa,SAAS,KAAKgF,CAAI,EAGjCjF,EAAciF,EACdhF,EAAegF,EAEf,GAAI,CAuBF,OAAO3D,EAtBS,IAAM,CACpB,GAAI,CAAA2D,EAAK,UACT,CAAAA,EAAK,UAAY,GAGjB,QAAS7C,EAAI6C,EAAK,SAAS,OAAS,EAAG7C,GAAK,EAAGA,IAC7C8C,EAAaD,EAAK,SAAS7C,CAAC,CAAC,EAE/B6C,EAAK,SAAS,OAAS,EAGvB,QAAS7C,EAAI6C,EAAK,UAAU,OAAS,EAAG7C,GAAK,EAAGA,IAC9C6C,EAAK,UAAU7C,CAAC,EAAE,EAKpB,GAHA6C,EAAK,UAAU,OAAS,EAGpBA,EAAK,MAAO,CACd,IAAME,EAAMF,EAAK,MAAM,SAAS,QAAQA,CAAI,EACxCE,GAAO,GAAGF,EAAK,MAAM,SAAS,OAAOE,EAAK,CAAC,CACjD,EACF,CACiB,CACnB,QAAE,CACAnF,EAAc8E,EACd7E,EAAe+E,CACjB,CACF,CAGA,SAASE,EAAaD,EAAM,CAC1B,GAAI,CAAAA,EAAK,UACT,CAAAA,EAAK,UAAY,GAGjB,QAAS7C,EAAI6C,EAAK,SAAS,OAAS,EAAG7C,GAAK,EAAGA,IAC7C8C,EAAaD,EAAK,SAAS7C,CAAC,CAAC,EAE/B6C,EAAK,SAAS,OAAS,EAGvB,QAAS7C,EAAI6C,EAAK,UAAU,OAAS,EAAG7C,GAAK,EAAGA,IAC9C6C,EAAK,UAAU7C,CAAC,EAAE,EAEpB6C,EAAK,UAAU,OAAS,EAC1B,CAMO,SAASG,GAAiB9D,EAAI,CACnC,IAAMwD,EAAW9E,EACXgF,EAAY/E,EACZoF,EAAQ,CACZ,UAAW,CAAC,EACZ,MAAO,KACP,SAAU,CAAC,EACX,UAAW,EACb,EAEArF,EAAcqF,EACdpF,EAAeoF,EAEf,GAAI,CAeF,OAAO/D,EAdS,IAAM,CACpB,GAAI,CAAA+D,EAAM,UACV,CAAAA,EAAM,UAAY,GAElB,QAASjD,EAAIiD,EAAM,SAAS,OAAS,EAAGjD,GAAK,EAAGA,IAC9C8C,EAAaG,EAAM,SAASjD,CAAC,CAAC,EAEhCiD,EAAM,SAAS,OAAS,EAExB,QAASjD,EAAIiD,EAAM,UAAU,OAAS,EAAGjD,GAAK,EAAGA,IAC/CiD,EAAM,UAAUjD,CAAC,EAAE,EAErBiD,EAAM,UAAU,OAAS,EAC3B,CACiB,CACnB,QAAE,CACArF,EAAc8E,EACd7E,EAAe+E,CACjB,CACF,CAKO,SAASM,GAAUhE,EAAI,CACxBtB,GACFA,EAAY,UAAU,KAAKsB,CAAE,CAEjC,CAcA,GAAI3B,GAAW,OAAO,QAAY,IAAa,CAM7C,IAAM4F,EAAS,CAAE,QAAS,IAAI,IAAO,QAAS,IAAI,IAAO,WAAY,CAAC,CAAE,EACxE3F,EAAa,CACX,qBAAsB,GACtB,eAAesB,EAAK,CACdqE,EAAO,QAAQ,KAAO,KAAgBA,EAAO,QAAQ,IAAI,IAAI,QAAQrE,CAAG,CAAC,CAC/E,EACA,gBAAiB,CAAC,EAClB,eAAe6B,EAAG,CACZwC,EAAO,QAAQ,KAAO,KAAgBA,EAAO,QAAQ,IAAI,IAAI,QAAQxC,CAAC,CAAC,CAC7E,EACA,iBAAkB,CAAC,EACnB,aAAc,CAAC,EACf,SAAU,CAAC,EACX,iBAAiByC,EAAK,CAChBD,EAAO,WAAW,OAAS,KAAgBA,EAAO,WAAW,KAAKC,CAAG,CAC3E,EACA,oBAAqB,CAAC,EACtB,SAAUD,CACZ,CACF,CAMO,SAASE,IAA0B,CACxC,GAAI,CAAC9F,EAAS,MAAO,CAAE,QAAS,CAAC,EAAG,QAAS,CAAC,EAAG,WAAY,CAAC,CAAE,EAGhE,IAAM+F,EAAM,CAAE,QAAS,CAAC,EAAG,QAAS,CAAC,EAAG,WAAY,CAAC,CAAE,EACjDC,EAAO,OAAOC,EAAyB,IAAeA,EAAuB,KACnF,GAAI,CAACD,EAAK,OAAOD,EACjB,QAAWG,KAAOF,EAAI,QAAS,CAAE,IAAMG,EAAID,EAAI,QAAQ,EAAOC,GAAGJ,EAAI,QAAQ,KAAKI,CAAC,CAAG,CACtF,QAAWD,KAAOF,EAAI,QAAS,CAAE,IAAMG,EAAID,EAAI,QAAQ,EAAOC,GAAGJ,EAAI,QAAQ,KAAKI,CAAC,CAAG,CACtF,QAAWN,KAAOG,EAAI,WAAYD,EAAI,WAAW,KAAKF,CAAG,EACzD,OAAOE,CACT,CAIA,IAAIE,EAAuB,KACvBjG,GAAWC,GAAY,uBACzBgG,EAAuBhG,EAAW,UC/5B7B,SAASmG,GAAKC,EAAWC,EAAW,CAEzC,IAAMC,EAAc,SAAqBC,EAAO,CAC9C,OAAOH,EAAUG,CAAK,CACxB,EACA,OAAAD,EAAY,YAAc,QAAQF,EAAU,MAAQ,WAAW,IACxDE,CACT,CAGA,IAAIE,GAAuB,KACpB,SAASC,GAA2BC,EAAI,CAAEF,GAAuBE,CAAI,CAgBrE,SAASC,GAAKC,EAAQ,CAC3B,IAAIC,EAAY,KACZC,EAAc,KACdC,EAAY,KACVC,EAAY,IAAI,IAEtB,SAASC,EAAYC,EAAO,CAC1B,GAAIH,EAAW,MAAMA,EACrB,GAAIF,EAAW,OAAOM,EAAEN,EAAWK,CAAK,EAExC,MAAKJ,IACHA,EAAcF,EAAO,EAClB,KAAKQ,GAAO,CACXP,EAAYO,EAAI,SAAWA,EAE3BJ,EAAU,QAAQK,GAAMA,EAAG,CAAC,EAC5BL,EAAU,MAAM,CAClB,CAAC,EACA,MAAMM,GAAO,CAAEP,EAAYO,CAAK,CAAC,GAIhCR,CACR,CAEA,OAAAG,EAAY,YAAc,OAC1BA,EAAY,MAAQ,GACpBA,EAAY,QAAWI,GAAO,CACxBR,EAAWQ,EAAG,EACbL,EAAU,IAAIK,CAAE,CACvB,EACOJ,CACT,CAMO,SAASM,GAAS,CAAE,SAAAC,EAAU,SAAAC,CAAS,EAAG,CAC/C,IAAMC,EAAUC,EAAO,EAAK,EACtBC,EAAkB,IAAI,IAiB5B,MAAO,CACL,IAAK,aACL,MAAO,CAAE,SAhBM,CACf,UAAW,GACX,UAAUC,EAAS,CACjBH,EAAQ,IAAI,EAAI,EAChBE,EAAgB,IAAIC,CAAO,EAC3BA,EAAQ,QAAQ,IAAM,CACpBD,EAAgB,OAAOC,CAAO,EAC1BD,EAAgB,OAAS,GAC3BF,EAAQ,IAAI,EAAK,CAErB,CAAC,CACH,CACF,EAIqB,SAAAF,EAAU,QAAAE,CAAQ,EACrC,SAAU,MAAM,QAAQD,CAAQ,EAAIA,EAAW,CAACA,CAAQ,EACxD,OAAQ,EACV,CACF,CAMO,SAASK,GAAc,CAAE,SAAAN,EAAU,SAAAC,EAAU,QAAAM,CAAQ,EAAG,CAC7D,IAAMC,EAAaL,EAAO,IAAI,EAiB9B,MAAO,CACL,IAAK,kBACL,MAAO,CAAE,WAAAK,EAAY,YAhBFC,GAAU,CAE7B,GADAD,EAAW,IAAIC,CAAK,EAChBF,EACF,GAAI,CACFA,EAAQE,CAAK,CACf,OAASC,EAAG,CACV,QAAQ,MAAM,4BAA6BA,CAAC,CAC9C,CAEJ,EAOoC,SAAAV,EAAU,MAJhC,IAAMQ,EAAW,IAAI,IAAI,CAIa,EAClD,SAAU,MAAM,QAAQP,CAAQ,EAAIA,EAAW,CAACA,CAAQ,EACxD,OAAQ,EACV,CACF,CAIO,SAASU,GAAYF,EAAOG,EAAU,CAE3C,IAAIC,EAAMD,GAAYE,KAAuB,EAC7C,KAAOD,GAAK,CACV,GAAIA,EAAI,eACN,OAAAA,EAAI,eAAeJ,CAAK,EACjB,GAETI,EAAMA,EAAI,UACZ,CACA,MAAO,EACT,CAOO,SAASE,GAAK,CAAE,KAAAC,EAAM,SAAAhB,EAAW,KAAM,SAAAC,CAAS,EAAG,CAGxD,OADkB,OAAOe,GAAS,WAAaA,EAAK,EAAIA,GACrCf,EAAWD,CAChC,CAKO,SAASiB,GAAI,CAAE,KAAAC,EAAM,SAAAlB,EAAW,KAAM,SAAAC,CAAS,EAAG,CACvD,IAAMkB,EAAO,OAAOD,GAAS,WAAaA,EAAK,EAAIA,EACnD,GAAI,CAACC,GAAQA,EAAK,SAAW,EAAG,OAAOnB,EAGvC,IAAMoB,EAAW,MAAM,QAAQnB,CAAQ,EAAIA,EAAS,CAAC,EAAIA,EACzD,OAAI,OAAOmB,GAAa,YACtB,QAAQ,KAAK,8FAA8F,EACpGpB,GAGFmB,EAAK,IAAI,CAACE,EAAMC,IAAU,CAC/B,IAAMC,EAAQH,EAASC,EAAMC,CAAK,EAElC,OAAIC,GAAS,OAAOA,GAAU,UAAYA,EAAM,KAAO,OACjDF,GAAQ,MAAQ,OAAOA,GAAS,SAE9BA,EAAK,IAAM,KAAME,EAAM,IAAMF,EAAK,GAC7BA,EAAK,KAAO,OAAME,EAAM,IAAMF,EAAK,MACnC,OAAOA,GAAS,UAAY,OAAOA,GAAS,YAErDE,EAAM,IAAMF,IAGTE,CACT,CAAC,CACH,CAKO,SAASC,GAAO,CAAE,SAAAxB,EAAW,KAAM,SAAAC,CAAS,EAAG,CACpD,IAAMwB,EAAO,MAAM,QAAQxB,CAAQ,EAAIA,EAAW,CAACA,CAAQ,EAE3D,QAAWyB,KAASD,EAClB,GAAIC,GAASA,EAAM,MAAQC,KACP,OAAOD,EAAM,MAAM,MAAS,WAC1CA,EAAM,MAAM,KAAK,EACjBA,EAAM,MAAM,MAEd,OAAOA,EAAM,SAKnB,OAAO1B,CACT,CAEO,SAAS2B,GAAM,CAAE,KAAAX,EAAM,SAAAf,CAAS,EAAG,CAExC,MAAO,CAAE,IAAK0B,GAAO,MAAO,CAAE,KAAAX,CAAK,EAAG,SAAAf,EAAU,OAAQ,EAAK,CAC/D,CAOO,SAAS2B,GAAO,CAAE,UAAWvC,EAAW,KAAAwC,EAAM,WAAAC,EAAY,GAAGpC,CAAM,EAAG,CAC3E,IAAMqC,EAAcpC,EAAE,MAAO,CAAE,cAAeN,EAAU,MAAQ,SAAU,eAAgBwC,CAAK,CAAC,EAI1FG,EAAU7B,EAAO,IAAI,EACrB8B,EAAW9B,EAAO,EAAK,EAE7B,SAAS+B,GAAY,CACfD,EAAS,IACbA,EAAS,IAAI,EAAI,EAEjBD,EAAQ,IAAIrC,EAAEN,EAAWK,CAAK,CAAC,EACjC,CAGA,SAASyC,EAAkBC,EAAI,CAC7B,OAAQP,EAAM,CACZ,IAAK,OACH,eAAeK,CAAS,EACxB,MAEF,IAAK,OACC,OAAO,oBAAwB,IACjC,oBAAoBA,CAAS,EAE7B,WAAWA,EAAW,GAAG,EAE3B,MAEF,IAAK,UAAW,CACd,IAAMG,EAAW,IAAI,qBAAsBC,GAAY,CACjDA,EAAQ,CAAC,EAAE,iBACbD,EAAS,WAAW,EACpBH,EAAU,EAEd,CAAC,EACDG,EAAS,QAAQD,CAAE,EACnB,KACF,CAEA,IAAK,cAAe,CAClB,IAAMG,EAAU,IAAM,CACpBH,EAAG,oBAAoB,QAASG,CAAO,EACvCH,EAAG,oBAAoB,QAASG,CAAO,EACvCH,EAAG,oBAAoB,aAAcG,CAAO,EAC5CL,EAAU,CACZ,EACAE,EAAG,iBAAiB,QAASG,EAAS,CAAE,KAAM,EAAK,CAAC,EACpDH,EAAG,iBAAiB,QAASG,EAAS,CAAE,KAAM,EAAK,CAAC,EACpDH,EAAG,iBAAiB,aAAcG,EAAS,CAAE,KAAM,EAAK,CAAC,EACzD,KACF,CAEA,IAAK,QAAS,CACZ,GAAI,CAACT,EAAY,CAAEI,EAAU,EAAG,KAAO,CACvC,IAAMM,EAAK,OAAO,WAAWV,CAAU,EACvC,GAAIU,EAAG,QACL,eAAeN,CAAS,MACnB,CACL,IAAMO,EAAa,IAAM,CACnBD,EAAG,UACLA,EAAG,oBAAoB,SAAUC,CAAU,EAC3CP,EAAU,EAEd,EACAM,EAAG,iBAAiB,SAAUC,CAAU,CAC1C,CACA,KACF,CAEA,QAEE,eAAeP,CAAS,CAC5B,CACF,CAGA,IAAMQ,EAAeN,GAAO,CACtBA,GAAID,EAAkBC,CAAE,CAC9B,EAGA,OAAOzC,EAAE,MAAO,CAAE,cAAeN,EAAU,MAAQ,SAAU,eAAgBwC,EAAM,IAAKa,CAAY,EAClGT,EAAS,EAAID,EAAQ,EAAI,IAC3B,CACF,CC/SA,IAAIW,GAAc,GACX,SAASC,GAAKC,EAAMC,EAAIC,EAAO,CAKpC,OAJKJ,KACHA,GAAc,GACd,QAAQ,KAAK,8EAA8E,GAEzF,CAACE,GAAQA,EAAK,SAAW,EAAU,CAAC,EACjCA,EAAK,IAAI,CAACG,EAAMC,IAAU,CAC/B,IAAMC,EAAQJ,EAAGE,EAAMC,CAAK,EAC5B,OAAIF,GAASG,GAAS,OAAOA,GAAU,WACrCA,EAAM,IAAMH,EAAMC,EAAMC,CAAK,GAExBC,CACT,CAAC,CACH,CAKO,SAASC,MAAOC,EAAM,CAC3B,IAAMC,EAAU,CAAC,EACjB,QAAWC,KAAOF,EAChB,GAAKE,GACL,GAAI,OAAOA,GAAQ,SACjBD,EAAQ,KAAKC,CAAG,UACP,OAAOA,GAAQ,SACxB,OAAW,CAACC,EAAKC,CAAG,IAAK,OAAO,QAAQF,CAAG,EACrCE,GAAKH,EAAQ,KAAKE,CAAG,EAI/B,OAAOF,EAAQ,KAAK,GAAG,CACzB,CAIO,SAASI,GAAMC,EAAK,CACzB,OAAI,OAAOA,GAAQ,SAAiBA,EAC7B,OAAO,QAAQA,CAAG,EACtB,OAAO,CAAC,CAAC,CAAEC,CAAC,IAAMA,GAAK,MAAQA,IAAM,EAAE,EACvC,IAAI,CAAC,CAACC,EAAGD,CAAC,IAAM,GAAGE,GAAaD,CAAC,CAAC,IAAID,CAAC,EAAE,EACzC,KAAK,GAAG,CACb,CAEA,SAASE,GAAaC,EAAK,CACzB,OAAOA,EAAI,QAAQ,WAAY,KAAK,EAAE,YAAY,CACpD,CAIO,SAASC,GAASjB,EAAIkB,EAAI,CAC/B,IAAIC,EACJ,MAAO,IAAIb,IAAS,CAClB,aAAaa,CAAK,EAClBA,EAAQ,WAAW,IAAMnB,EAAG,GAAGM,CAAI,EAAGY,CAAE,CAC1C,CACF,CAGO,SAASE,GAASpB,EAAIkB,EAAI,CAC/B,IAAIG,EAAO,EACX,MAAO,IAAIf,IAAS,CAClB,IAAMgB,EAAM,KAAK,IAAI,EACjBA,EAAMD,GAAQH,IAChBG,EAAOC,EACPtB,EAAG,GAAGM,CAAI,EAEd,CACF,CAGA,IAAIiB,EAA0B,KACvB,SAASC,GAAiBxB,EAAI,CAAEuB,EAA0BvB,CAAI,CAI9D,SAASyB,GAAcC,EAAO,CACnC,GAAI,OAAO,OAAW,IAAa,OAAOC,EAAO,EAAK,EACtD,IAAMC,EAAK,OAAO,WAAWF,CAAK,EAC5BG,EAAIF,EAAOC,EAAG,OAAO,EACrBE,EAAWC,GAAMF,EAAE,IAAIE,EAAE,OAAO,EACtCH,EAAG,iBAAiB,SAAUE,CAAO,EAGrC,IAAME,EAAMT,IAA0B,EACtC,OAAIS,IACFA,EAAI,kBAAoBA,EAAI,mBAAqB,CAAC,EAClDA,EAAI,kBAAkB,KAAK,IAAMJ,EAAG,oBAAoB,SAAUE,CAAO,CAAC,GAGrED,CACT,CAIO,SAASI,GAAgBxB,EAAKyB,EAAS,CAC5C,IAAIC,EACJ,GAAI,CACF,IAAMC,EAAM,aAAa,QAAQ3B,CAAG,EACpC0B,EAASC,IAAQ,KAAO,KAAK,MAAMA,CAAG,EAAIF,CAC5C,MAAQ,CACNC,EAASD,CACX,CAEA,IAAML,EAAIF,EAAOQ,CAAM,EAGjBE,EAAUC,EAAO,IAAM,CAC3B,GAAI,CACF,aAAa,QAAQ7B,EAAK,KAAK,UAAUoB,EAAE,CAAC,CAAC,CAC/C,OAASE,EAAG,CACNQ,GAAS,QAAQ,KAAK,sDAAuDR,CAAC,CACpF,CACF,CAAC,EAGGS,EAAiB,KACjB,OAAO,OAAW,MACpBA,EAAkBT,GAAM,CACtB,GAAIA,EAAE,MAAQtB,GAAOsB,EAAE,WAAa,KAClC,GAAI,CAAEF,EAAE,IAAI,KAAK,MAAME,EAAE,QAAQ,CAAC,CAAG,OAASU,EAAK,CAC7CF,GAAS,QAAQ,KAAK,oCAAqCE,CAAG,CACpE,CAEJ,EACA,OAAO,iBAAiB,UAAWD,CAAc,GAInD,IAAMR,EAAMT,IAA0B,EACtC,OAAIS,IACFA,EAAI,kBAAoBA,EAAI,mBAAqB,CAAC,EAClDA,EAAI,kBAAkB,KAAK,IAAM,CAC/BK,EAAQ,EACJG,GAAgB,OAAO,oBAAoB,UAAWA,CAAc,CAC1E,CAAC,GAGIX,CACT,CAIO,SAASa,GAAO,CAAE,OAAAC,EAAQ,SAAAC,CAAS,EAAG,CAE3C,GAAI,OAAO,SAAa,IAAa,OAAO,KAC5C,IAAMC,EAAY,OAAOF,GAAW,SAChC,SAAS,cAAcA,CAAM,EAC7BA,EACJ,OAAKE,EAEE,CAAE,IAAK,WAAY,MAAO,CAAE,UAAAA,CAAU,EAAG,SAAU,MAAM,QAAQD,CAAQ,EAAIA,EAAW,CAACA,CAAQ,EAAG,OAAQ,EAAK,EAFjG,IAGzB,CAIO,SAASE,GAAgBC,EAAKjB,EAAS,CAC5C,GAAI,OAAO,SAAa,IAAa,OAErC,IAAMkB,EAAYjB,GAAM,CACtB,IAAMkB,EAAKF,EAAI,SAAWA,EACtB,CAACE,GAAMA,EAAG,SAASlB,EAAE,MAAM,GAC/BD,EAAQC,CAAC,CACX,EAEA,SAAS,iBAAiB,YAAaiB,CAAQ,EAC/C,SAAS,iBAAiB,aAAcA,CAAQ,EAEhD,IAAMhB,EAAMT,IAA0B,EAClCS,IACFA,EAAI,kBAAoBA,EAAI,mBAAqB,CAAC,EAClDA,EAAI,kBAAkB,KAAK,IAAM,CAC/B,SAAS,oBAAoB,YAAagB,CAAQ,EAClD,SAAS,oBAAoB,aAAcA,CAAQ,CACrD,CAAC,EAEL,CAIO,SAASE,GAAWC,EAAMC,EAAQ,CACvC,MAAO,CACL,MAAOA,EAAS,GAAGD,CAAI,UAAUA,CAAI,gBAAkB,GAAGA,CAAI,UAAUA,CAAI,eAC9E,CACF,CCvLA,IAAME,GAAe,IAAI,IAAI,CAC3B,MAAO,OAAQ,SAAU,OAAQ,OAAQ,WAAY,UAAW,UAChE,IAAK,OAAQ,MAAO,SAAU,WAAY,OAAQ,UAAW,QAC7D,OAAQ,QAAS,WAAY,gBAAiB,iBAAkB,iBAAkB,OAClF,SAAU,UAAW,mBAAoB,gBAAiB,MAAO,SACjE,UAAW,gBAAiB,sBAAuB,cAAe,mBAClE,oBAAqB,oBAAqB,UAAW,iBAAkB,UACvE,UAAW,cAAe,eAAgB,WAAY,qBACtD,SAAU,cACZ,CAAC,EACKC,GAAS,6BAGTC,GAAoB,IAAI,IAGxBC,EAAiB,IAAI,QAE3B,SAASC,GAAUC,EAAO,CACxB,MAAI,CAACA,GAAS,OAAOA,GAAU,SAAiB,GAC5C,OAAO,KAAS,KAAeA,aAAiB,KAAa,GAC1D,OAAOA,EAAM,UAAa,UAAY,OAAOA,EAAM,UAAa,QACzE,CAEA,SAASC,GAAQD,EAAO,CACtB,MAAO,CAAC,CAACA,GAAS,OAAOA,GAAU,WAAaA,EAAM,SAAW,IAAQ,QAASA,EACpF,CAGA,SAASE,GAAiBC,EAAK,CAC7B,GAAI,CAAAA,EAAI,SAIR,IAHAA,EAAI,SAAW,GAGXA,EAAI,SACN,QAAWC,KAAWD,EAAI,SACxB,GAAI,CAAEC,EAAQ,CAAG,OAASC,EAAG,CAAE,QAAQ,MAAM,wBAAyBA,CAAC,CAAG,CAK9E,GAAIF,EAAI,QACN,QAAWG,KAAWH,EAAI,QACxB,GAAI,CAAEG,EAAQ,CAAG,MAAY,CAAyB,CAK1D,GAAIH,EAAI,OACN,QAAWI,KAAQJ,EAAI,MACrB,GAAII,GAAQ,OAAOA,EAAK,SAAY,WAClC,GAAI,CAAEA,EAAK,QAAQ,CAAG,OAASF,EAAG,CAAE,QAAQ,MAAM,6BAA8BA,CAAC,CAAG,EAM1F,GAAIF,EAAI,kBACN,QAAWK,KAAML,EAAI,kBACnB,GAAI,CAAEK,EAAG,CAAG,OAASH,EAAG,CAAE,QAAQ,MAAM,0BAA2BA,CAAC,CAAG,CAIvEI,GAAWC,GAAY,oBAAoBA,EAAW,mBAAmBP,CAAG,EAChFN,GAAkB,OAAOM,CAAG,EAC9B,CAKO,SAASQ,EAAYC,EAAM,CAChC,GAAI,CAACA,EAAM,OAKX,GAJIA,EAAK,eACPV,GAAiBU,EAAK,aAAa,EAGjCA,EAAK,WAAa,EAAG,CACvB,IAAMC,EAAaf,EAAe,IAAIc,CAAI,EACtCC,GACFX,GAAiBW,CAAU,CAE/B,CAEA,GAAID,EAAK,SACP,GAAI,CAAEA,EAAK,SAAS,CAAG,MAAY,CAAyB,CAG9D,GAAIA,EAAK,aACP,QAAWE,KAAOF,EAAK,aACrB,GAAI,CAAEA,EAAK,aAAaE,CAAG,EAAE,CAAG,MAAY,CAAyB,CAIzE,IAAMC,EAAWH,EAAK,WACtB,GAAIG,GAAYA,EAAS,OAAS,EAChC,QAASC,EAAI,EAAGA,EAAID,EAAS,OAAQC,IACnCL,EAAYI,EAASC,CAAC,CAAC,CAG7B,CAGO,SAASC,GAAMC,EAAOC,EAAW,CAClC,OAAOA,GAAc,WACvBA,EAAY,SAAS,cAAcA,CAAS,GAE9CR,EAAYQ,CAAS,EACrBA,EAAU,YAAc,GACxB,IAAMP,EAAOQ,EAAUF,EAAOC,CAAS,EACvC,OAAIP,GAAMO,EAAU,YAAYP,CAAI,EAC7B,IAAM,CACXD,EAAYQ,CAAS,EACrBA,EAAU,YAAc,EAC1B,CACF,CAIO,SAASC,EAAUF,EAAOG,EAAQC,EAAO,CAE9C,GAAIJ,GAAS,MAAQA,IAAU,IAASA,IAAU,GAChD,OAAO,SAAS,cAAc,EAAE,EAIlC,GAAI,OAAOA,GAAU,UAAY,OAAOA,GAAU,SAChD,OAAO,SAAS,eAAe,OAAOA,CAAK,CAAC,EAI9C,GAAInB,GAAUmB,CAAK,EACjB,OAAOA,EAKT,GAAI,OAAOA,GAAU,WAAY,CAC/B,IAAMK,EAAc,SAAS,cAAc,IAAI,EACzCC,EAAY,SAAS,cAAc,KAAK,EAC1CC,EAAe,CAAC,EAKdC,EAAO,SAAS,uBAAuB,EAC7CA,EAAK,YAAYH,CAAW,EAC5BG,EAAK,YAAYF,CAAS,EAE1B,IAAMlB,EAAUqB,EAAO,IAAM,CAC3B,IAAMC,EAAMV,EAAM,EACZW,EAAUD,GAAO,MAAQA,IAAQ,IAASA,IAAQ,GACpD,CAAC,EACD,MAAM,QAAQA,CAAG,EAAIA,EAAM,CAACA,CAAG,EAE7BE,EAAaN,EAAU,WAC7B,GAAKM,EAGL,SAAWC,KAAON,EAChBd,EAAYoB,CAAG,EACXA,EAAI,aAAeD,GAAYA,EAAW,YAAYC,CAAG,EAE/DN,EAAe,CAAC,EAGhB,QAAWO,KAAKH,EAAQ,CACtB,IAAMjB,EAAOQ,EAAUY,EAAGF,EAAYT,GAAQ,MAAM,EACpD,GAAIT,EAGF,GAAIA,EAAK,WAAa,GAAiC,CACrD,IAAMG,EAAW,MAAM,KAAKH,EAAK,UAAU,EAC3CkB,EAAW,aAAalB,EAAMY,CAAS,EACvC,QAAWS,KAASlB,EAAUU,EAAa,KAAKQ,CAAK,CACvD,MACEH,EAAW,aAAalB,EAAMY,CAAS,EACvCC,EAAa,KAAKb,CAAI,CAG5B,EACF,CAAC,EAED,OAAAW,EAAY,SAAWjB,EAEvBkB,EAAU,SAAWlB,EACdoB,CACT,CAGA,GAAI,MAAM,QAAQR,CAAK,EAAG,CACxB,IAAMQ,EAAO,SAAS,uBAAuB,EAC7C,QAAWO,KAASf,EAAO,CACzB,IAAMN,EAAOQ,EAAUa,EAAOZ,EAAQC,CAAK,EACvCV,GAAMc,EAAK,YAAYd,CAAI,CACjC,CACA,OAAOc,CACT,CAGA,OAAIzB,GAAQiB,CAAK,GAAK,OAAOA,EAAM,KAAQ,WAClCgB,GAAgBhB,EAAOG,EAAQC,CAAK,EAIzCrB,GAAQiB,CAAK,GAAK,OAAOA,EAAM,KAAQ,SACrCA,EAAM,MAAQ,kBAA0BiB,GAAoBjB,EAAOG,CAAM,EACzEH,EAAM,MAAQ,aAAqBkB,GAAuBlB,EAAOG,CAAM,EACvEH,EAAM,MAAQ,WAAmBmB,GAAgBnB,EAAOG,CAAM,EAC3DiB,GAAuBpB,EAAOG,EAAQC,CAAK,EAI7C,SAAS,eAAe,OAAOJ,CAAK,CAAC,CAC9C,CAQA,IAAMqB,GAAqB,CACzB,IAAIC,EAAQ1B,EAAK,CACf,GAAIA,IAAQ,QACR,EAAAA,IAAQ,aAAeA,IAAQ,eAAiBA,IAAQ,aAC5D,OAAO0B,EAAO,KAAK,EAAE1B,CAAG,CAC1B,EACA,IAAI0B,EAAQ1B,EAAK,CACf,OAAIA,IAAQ,OAAe,GACpBA,KAAO0B,EAAO,KAAK,CAC5B,EACA,QAAQA,EAAQ,CACd,OAAO,QAAQ,QAAQA,EAAO,KAAK,CAAC,CACtC,EACA,yBAAyBA,EAAQ1B,EAAK,CACpC,GAAIA,IAAQ,OAAQ,OACpB,IAAM2B,EAAUD,EAAO,KAAK,EAC5B,GAAI1B,KAAO2B,EACT,MAAO,CAAE,MAAOA,EAAQ3B,CAAG,EAAG,SAAU,GAAO,WAAY,GAAM,aAAc,EAAK,CAGxF,EACA,IAAI0B,EAAQ1B,EAAK,CAGf,MAAO,EACT,CACF,EAEM4B,EAAiB,CAAC,EAEjB,SAASC,IAAsB,CACpC,OAAOD,EAAeA,EAAe,OAAS,CAAC,CACjD,CAGAE,GAA2BD,EAAmB,EAC9CE,GAAiBF,EAAmB,EAE7B,SAASG,IAAoB,CAClC,OAAOJ,CACT,CAEA,SAASR,GAAgBhB,EAAOG,EAAQC,EAAO,CAC7C,GAAI,CAAE,IAAKyB,EAAW,MAAAC,EAAO,SAAAjC,CAAS,EAAIG,EAG1C,GAAI,OAAO6B,GAAc,aACpBA,EAAU,WAAW,kBAAoBA,EAAU,WAAW,QAAS,CAC1E,IAAME,EAAYF,EAClBA,EAAY,SAA8BC,GAAO,CAE/C,OADiB,IAAIC,EAAUD,EAAK,EACpB,OAAO,CACzB,EACAD,EAAU,YAAcE,EAAU,aAAeA,EAAU,MAAQ,gBACrE,CAGA,GAAIF,IAAc,mBAAqB7B,EAAM,MAAQ,kBACnD,OAAOiB,GAAoBjB,EAAOG,CAAM,EAE1C,GAAI0B,IAAc,cAAgB7B,EAAM,MAAQ,aAC9C,OAAOkB,GAAuBlB,EAAOG,CAAM,EAE7C,GAAI0B,IAAc,YAAc7B,EAAM,MAAQ,WAC5C,OAAOmB,GAAgBnB,EAAOG,CAAM,EAKtC,IAAM6B,EAAYR,EAAeA,EAAe,OAAS,CAAC,GAAK,KAC3DS,EAAgB,KACpB,GAAID,IAEFC,EAAgBD,EAAU,gBAAkB,KACxC,CAACC,GAAe,CAClB,IAAIC,EAAIF,EAAU,WAClB,KAAOE,GAAG,CACR,GAAIA,EAAE,eAAgB,CAAED,EAAgBC,EAAE,eAAgB,KAAO,CACjEA,EAAIA,EAAE,UACR,CACF,CAEF,IAAMjD,EAAM,CACV,MAAO,CAAC,EACR,UAAW,EACX,QAAS,CAAC,EACV,SAAU,CAAC,EACX,QAAS,GACT,SAAU,GACV,UAAA4C,EACA,WAAYG,EACZ,eAAgBC,CAClB,EAIME,EAAe,SAAS,cAAc,SAAS,EAC/CC,EAAa,SAAS,cAAc,OAAO,EACjDxD,EAAe,IAAIuD,EAAclD,CAAG,EACpCA,EAAI,cAAgBkD,EACpBlD,EAAI,YAAcmD,EAGlB,IAAMnC,EAAY,SAAS,uBAAuB,EAClDA,EAAU,cAAgBhB,EAC1BA,EAAI,SAAWkD,EAGfxD,GAAkB,IAAIM,CAAG,EACrBM,GAAWC,GAAY,kBAAkBA,EAAW,iBAAiBP,CAAG,EAG5E,IAAMoD,EAAgBxC,EAAS,SAAW,EAAI,OAAYA,EAAS,SAAW,EAAIA,EAAS,CAAC,EAAIA,EAE5FyC,EACAD,IAAkB,OACpBC,EAAcR,EAAQ,OAAO,OAAO,CAAC,EAAGA,EAAO,CAAE,SAAUO,CAAc,CAAC,EAAI,CAAE,SAAUA,CAAc,EAExGC,EAAcR,EAAQ,OAAO,OAAO,CAAC,EAAGA,CAAK,EAAI,CAAC,EAEpD,IAAMS,EAAcC,EAAOF,CAAW,EACtCrD,EAAI,aAAesD,EASnB,IAAME,EAAgB,IAAI,MAAM,CAAE,KAAMF,CAAY,EAAGlB,EAAkB,EAOzEG,EAAe,KAAKvC,CAAG,EAEvB,IAAIyD,EACJ,GAAI,CACFA,EAASC,EAAQ,IAAMd,EAAUY,CAAa,CAAC,CACjD,OAASG,EAAO,CAEd,GADApB,EAAe,IAAI,EACf,CAACqB,GAAYD,EAAO3D,CAAG,EACzB,cAAQ,MAAM,sCAAuC4C,EAAU,MAAQ,YAAae,CAAK,EACnFA,EAGR,OAAA3C,EAAU,YAAYkC,CAAY,EAClClC,EAAU,YAAYmC,CAAU,EACzBnC,CACT,CAEAuB,EAAe,IAAI,EACnBvC,EAAI,QAAU,GAGVA,EAAI,iBACN,eAAe,IAAM,CACnB,GAAI,CAAAA,EAAI,SACR,QAAWK,KAAML,EAAI,gBACnB,GAAI,CAAEK,EAAG,CAAG,OAASH,EAAG,CAAE,QAAQ,MAAM,wBAAyBA,CAAC,CAAG,CAEzE,CAAC,EAIHc,EAAU,YAAYkC,CAAY,EAClC,IAAMxB,GAAS,MAAM,QAAQ+B,CAAM,EAAIA,EAAS,CAACA,CAAM,EACvD,QAAW5B,KAAKH,GAAQ,CACtB,IAAMjB,EAAOQ,EAAUY,EAAGb,EAAWG,CAAK,EACtCV,GAAMO,EAAU,YAAYP,CAAI,CACtC,CACA,OAAAO,EAAU,YAAYmC,CAAU,EAEzBnC,CACT,CAGA,SAASgB,GAAoBjB,EAAOG,EAAQ,CAC1C,GAAM,CAAE,WAAA2C,EAAY,YAAAC,EAAa,SAAAC,EAAU,MAAAC,CAAM,EAAIjD,EAAM,MACrDH,EAAWG,EAAM,SAIjBmC,EAAe,SAAS,cAAc,UAAU,EAChDC,EAAa,SAAS,cAAc,QAAQ,EAE5Cc,EAAc,CAClB,MAAO,CAAC,EAAG,UAAW,EAAG,QAAS,CAAC,EAAG,SAAU,CAAC,EACjD,QAAS,GAAO,SAAU,GAC1B,WAAY1B,EAAeA,EAAe,OAAS,CAAC,GAAK,KACzD,eAAgBuB,EAChB,cAAeZ,EACf,YAAaC,CACf,EACAxD,EAAe,IAAIuD,EAAce,CAAW,EAE5C,IAAMjD,EAAY,SAAS,uBAAuB,EAClDA,EAAU,cAAgBiD,EAC1BjD,EAAU,YAAYkC,CAAY,EAClClC,EAAU,YAAYmC,CAAU,EAEhC,IAAMhD,EAAUqB,EAAO,IAAM,CAC3B,IAAMmC,EAAQE,EAAW,EAKzB,GAHAtB,EAAe,KAAK0B,CAAW,EAG3Bf,EAAa,WACf,KAAOA,EAAa,aAAeA,EAAa,cAAgBC,GAAY,CAC1E,IAAMvB,EAAMsB,EAAa,YACzB1C,EAAYoB,CAAG,EACfA,EAAI,WAAW,YAAYA,CAAG,CAChC,CAGF,IAAIF,EACAiC,EACFjC,EAAS,OAAOqC,GAAa,WAAa,CAACA,EAAS,CAAE,MAAAJ,EAAO,MAAAK,CAAM,CAAC,CAAC,EAAI,CAACD,CAAQ,EAElFrC,EAASd,EAGXc,EAAS,MAAM,QAAQA,CAAM,EAAIA,EAAS,CAACA,CAAM,EAEjD,QAAWG,KAAKH,EAAQ,CACtB,IAAMjB,EAAOQ,EAAUY,EAAGX,CAAM,EAC5BT,IAEE0C,EAAW,WACbA,EAAW,WAAW,aAAa1C,EAAM0C,CAAU,EAGnDnC,EAAU,aAAaP,EAAM0C,CAAU,EAG7C,CAEAZ,EAAe,IAAI,CACrB,CAAC,EAED,OAAA0B,EAAY,QAAQ,KAAK9D,CAAO,EACzBa,CACT,CAGA,SAASiB,GAAuBlB,EAAOG,EAAQ,CAC7C,GAAM,CAAE,SAAAgD,EAAU,SAAAH,EAAU,QAAAI,CAAQ,EAAIpD,EAAM,MACxCH,EAAWG,EAAM,SAIjBmC,EAAe,SAAS,cAAc,UAAU,EAChDC,EAAa,SAAS,cAAc,QAAQ,EAE5Cc,EAAc,CAClB,MAAO,CAAC,EAAG,UAAW,EAAG,QAAS,CAAC,EAAG,SAAU,CAAC,EACjD,QAAS,GAAO,SAAU,GAC1B,WAAY1B,EAAeA,EAAe,OAAS,CAAC,GAAK,KACzD,cAAeW,EACf,YAAaC,CACf,EACAxD,EAAe,IAAIuD,EAAce,CAAW,EAE5C,IAAMjD,EAAY,SAAS,uBAAuB,EAClDA,EAAU,cAAgBiD,EAC1BjD,EAAU,YAAYkC,CAAY,EAClClC,EAAU,YAAYmC,CAAU,EAEhC,IAAMhD,EAAUqB,EAAO,IAAM,CAE3B,IAAME,EADYyC,EAAQ,EACC,CAACJ,CAAQ,EAAInD,EAClCwD,EAAa,MAAM,QAAQ1C,CAAM,EAAIA,EAAS,CAACA,CAAM,EAK3D,GAHAa,EAAe,KAAK0B,CAAW,EAG3Bf,EAAa,WACf,KAAOA,EAAa,aAAeA,EAAa,cAAgBC,GAAY,CAC1E,IAAMvB,EAAMsB,EAAa,YACzB1C,EAAYoB,CAAG,EACfA,EAAI,WAAW,YAAYA,CAAG,CAChC,CAGF,QAAWC,KAAKuC,EAAY,CAC1B,IAAM3D,EAAOQ,EAAUY,EAAGX,CAAM,EAC5BT,IAEE0C,EAAW,WACbA,EAAW,WAAW,aAAa1C,EAAM0C,CAAU,EAGnDnC,EAAU,aAAaP,EAAM0C,CAAU,EAG7C,CAEAZ,EAAe,IAAI,CACrB,CAAC,EAED,OAAA0B,EAAY,QAAQ,KAAK9D,CAAO,EACzBa,CACT,CAGA,SAASkB,GAAgBnB,EAAOG,EAAQ,CACtC,GAAM,CAAE,UAAAF,CAAU,EAAID,EAAM,MACtBH,EAAWG,EAAM,SAEvB,GAAI,CAACC,EACH,eAAQ,KAAK,2CAA2C,EACjD,SAAS,cAAc,cAAc,EAG9C,IAAMqD,EAAY,CAChB,MAAO,CAAC,EAAG,UAAW,EAAG,QAAS,CAAC,EAAG,SAAU,CAAC,EACjD,QAAS,GAAO,SAAU,GAC1B,WAAY9B,EAAeA,EAAe,OAAS,CAAC,GAAK,IAC3D,EAEM+B,EAAc,SAAS,cAAc,QAAQ,EACnDA,EAAY,cAAgBD,EAE5B,IAAME,EAAc,CAAC,EACrB,QAAWzC,KAASlB,EAAU,CAC5B,IAAMH,EAAOQ,EAAUa,EAAOd,CAAS,EACnCP,IACFO,EAAU,YAAYP,CAAI,EAC1B8D,EAAY,KAAK9D,CAAI,EAEzB,CAEA,OAAA4D,EAAU,kBAAoB,CAAC,IAAM,CACnC,QAAW5D,KAAQ8D,EACjB/D,EAAYC,CAAI,EACZA,EAAK,YAAYA,EAAK,WAAW,YAAYA,CAAI,CAEzD,CAAC,EAEM6D,CACT,CAKA,SAASnC,GAAuBpB,EAAOG,EAAQC,EAAO,CACpD,GAAM,CAAE,IAAAqD,EAAK,MAAA3B,EAAO,SAAAjC,CAAS,EAAIG,EAE3B0D,EAAatD,GAAS3B,GAAa,IAAIgF,CAAG,EAC1CE,EAAKD,EACP,SAAS,gBAAgBhF,GAAQ+E,CAAG,EACpC,SAAS,cAAcA,CAAG,EAG1B3B,GACF8B,GAAWD,EAAI7B,EAAO,CAAC,EAAG4B,CAAU,EAItC,IAAMG,EAAgBH,GAAcD,IAAQ,gBAC5C,QAAS3D,EAAI,EAAGA,EAAID,EAAS,OAAQC,IAAK,CACxC,IAAMJ,EAAOQ,EAAUL,EAASC,CAAC,EAAG6D,EAAIE,CAAa,EACjDnE,GAAMiE,EAAG,YAAYjE,CAAI,CAC/B,CAEA,OAAAiE,EAAG,OAAS3D,EACL2D,CACT,CAKA,SAASC,GAAWD,EAAIG,EAAUC,EAAU3D,EAAO,CACjD,GAAK0D,GAEL,QAAWlE,KAAOkE,EAChB,GAAI,EAAAlE,IAAQ,OAASA,IAAQ,YAG7B,IAAIA,IAAQ,MAAO,CACjB,IAAMoE,EAAMF,EAAS,IACjB,OAAOE,GAAQ,WAAYA,EAAIL,CAAE,EAC5BK,IAAKA,EAAI,QAAUL,GAC5B,QACF,CAEAM,GAAQN,EAAI/D,EAAKkE,EAASlE,CAAG,EAAGQ,CAAK,GAEzC,CAKO,SAAS8D,GAAgBP,EAAI7E,EAAO,CACzC6E,EAAG,MAAQ7E,EACP6E,EAAG,QAAU,OAAO7E,CAAK,GAC3B,eAAe,IAAM,CAAE6E,EAAG,MAAQ7E,CAAO,CAAC,CAE9C,CAaA,SAASmF,GAAQN,EAAI/D,EAAKd,EAAOsB,EAAO,CAEtC,GAAI,OAAOtB,GAAU,YAAc,EAAEc,EAAI,WAAW,IAAI,GAAKA,EAAI,OAAS,IAAMA,IAAQ,MAAO,CAE7F,GADK+D,EAAG,eAAcA,EAAG,aAAe,CAAC,GACrCA,EAAG,aAAa/D,CAAG,EACrB,GAAI,CAAE+D,EAAG,aAAa/D,CAAG,EAAE,CAAG,MAAY,CAAyB,CAErE+D,EAAG,aAAa/D,CAAG,EAAIa,EAAO,IAAM,CAClC,IAAM0D,EAAWrF,EAAM,EACvBmF,GAAQN,EAAI/D,EAAKuE,EAAU/D,CAAK,CAClC,CAAC,EACD,MACF,CAGA,GAAIR,EAAI,WAAW,IAAI,GAAKA,EAAI,OAAS,EAAG,CAC1C,IAAIwE,EAAYxE,EAAI,MAAM,CAAC,EACvByE,EAAa,GACbD,EAAU,SAAS,SAAS,IAC9BA,EAAYA,EAAU,MAAM,EAAG,EAAE,EACjCC,EAAa,IAEf,IAAMC,EAAQF,EAAU,YAAY,EAC9BG,EAAaF,EAAaC,EAAQ,WAAaA,EAC/CzD,EAAM8C,EAAG,UAAUY,CAAU,EAGnC,GAFI1D,GAAOA,EAAI,YAAc/B,IACzB+B,GAAK8C,EAAG,oBAAoBW,EAAOzD,EAAKwD,CAAU,EAClDvF,GAAS,MAAM,OACd6E,EAAG,UAASA,EAAG,QAAU,CAAC,GAG/B,IAAMa,EAAkBrF,IACjBA,EAAE,cAAaA,EAAE,YAAcA,GAC7BwD,EAAQ,IAAM6B,EAAe,SAASrF,CAAC,CAAC,GAEjDqF,EAAe,SAAW1F,EAC1B0F,EAAe,UAAY1F,EAC3B6E,EAAG,QAAQY,CAAU,EAAIC,EACzB,IAAMC,EAAY3F,EAAM,WACxB6E,EAAG,iBAAiBW,EAAOE,EAAgBC,GAAaJ,GAAc,MAAS,EAC/E,MACF,CAGA,GAAIzE,IAAQ,aAAeA,IAAQ,QAAS,CACtCQ,EACFuD,EAAG,aAAa,QAAS7E,GAAS,EAAE,EAEpC6E,EAAG,UAAY7E,GAAS,GAE1B,MACF,CAGA,GAAIc,IAAQ,QAAS,CACnB,GAAI,OAAOd,GAAU,SACnB6E,EAAG,MAAM,QAAU7E,EACnB6E,EAAG,WAAa,aACP,OAAO7E,GAAU,SAAU,CACpC,IAAM4F,EAAWf,EAAG,YAAc,CAAC,EACnC,QAAWgB,KAAQD,EACXC,KAAQ7F,IAAQ6E,EAAG,MAAMgB,CAAI,EAAI,IAEzC,QAAWA,KAAQ7F,EACjB6E,EAAG,MAAMgB,CAAI,EAAI7F,EAAM6F,CAAI,GAAK,GAElChB,EAAG,WAAa,CAAE,GAAG7E,CAAM,CAC7B,CACA,MACF,CAGA,GAAIc,IAAQ,0BAA2B,CACrC,IAAMgF,EAAO9F,GAAO,QAAU,GAC1BS,GAAW,OAAOqF,GAAS,UAAY,gDAAgD,KAAKA,CAAI,GAClG,QAAQ,KAAK,6FAA6F,EAE5GjB,EAAG,UAAYiB,EACf,MACF,CAGA,GAAIhF,IAAQ,YAAa,CACvB,GAAId,GAAS,KAAM,OACnB,GAAIA,GAAS,OAAOA,GAAU,UAAY,WAAYA,EAAO,CAC3D,IAAM8F,EAAO9F,EAAM,QAAU,GACzBS,GAAW,OAAOqF,GAAS,UAAY,gDAAgD,KAAKA,CAAI,GAClG,QAAQ,KAAK,6FAA6F,EAE5GjB,EAAG,UAAYiB,CACjB,KAAO,CACDrF,GACF,QAAQ,KACN,kLAEF,EAGF,MACF,CACA,MACF,CAGA,GAAI,OAAOT,GAAU,UAAW,CAC1BA,EAAO6E,EAAG,aAAa/D,EAAK,EAAE,EAC7B+D,EAAG,gBAAgB/D,CAAG,EAC3B,MACF,CAGA,GAAIA,EAAI,WAAW,OAAO,GAAKA,EAAI,WAAW,OAAO,EAAG,CACtD+D,EAAG,aAAa/D,EAAKd,CAAK,EAC1B,MACF,CAGA,GAAIsB,EAAO,CACLtB,IAAU,IAASA,GAAS,KAC9B6E,EAAG,gBAAgB/D,CAAG,EAEtB+D,EAAG,aAAa/D,EAAKd,IAAU,GAAO,GAAK,OAAOA,CAAK,CAAC,EAE1D,MACF,CAGA,GAAIc,IAAQ,SAAW+D,EAAG,UAAY,SAAU,CAC9CO,GAAgBP,EAAI7E,CAAK,EACzB,MACF,CAGIc,KAAO+D,EACTA,EAAG/D,CAAG,EAAId,EAEV6E,EAAG,aAAa/D,EAAKd,CAAK,CAE9B",
+  "names": ["__DEV__", "__devtools", "__setDevToolsHooks", "hooks", "currentEffect", "currentRoot", "currentOwner", "insideComputed", "batchDepth", "pendingEffects", "pendingNeedSort", "NEEDS_UPSTREAM", "iterativeEvalStack", "signal", "initial", "debugName", "value", "subs", "lastTracked", "lastTrackedEpoch", "_sigWrite", "next", "nextVal", "sig", "notify", "newVal", "ce", "fn", "effect", "computed", "dirty", "inner", "_createEffect", "prevInsideComputed", "read", "_evaluateComputed", "computedEffect", "stack", "current", "pushedUpstream", "deps", "i", "depOwner", "prevDepsLen", "_runEffect", "_updateLevel", "err", "maxDepLevel", "owner", "depLevel", "_noopDispose", "opts", "e", "prev", "result", "dispose", "_disposeEffect", "batch", "flush", "lazy", "singleDep", "cleanup", "notifyDepth", "notifyQueue", "notifyQueueLen", "_processSubscriber", "level", "len", "qi", "queuedSubs", "scheduleMicrotask", "microtaskScheduled", "isFlushing", "iterations", "a", "b", "effectNames", "memo", "sub", "flushSync", "untrack", "getOwner", "runWithOwner", "prevRoot", "createRoot", "prevOwner", "root", "_disposeRoot", "idx", "_createItemScope", "scope", "onCleanup", "buffer", "ctx", "__drainPreinstallBuffer", "out", "buf", "__preinstallSnapshot", "ref", "v", "memo", "Component", "_areEqual", "MemoWrapper", "props", "_getCurrentComponent", "_injectGetCurrentComponent", "fn", "lazy", "loader", "Component", "loadPromise", "loadError", "listeners", "LazyWrapper", "props", "h", "mod", "fn", "err", "Suspense", "fallback", "children", "loading", "signal", "pendingPromises", "promise", "ErrorBoundary", "onError", "errorState", "error", "e", "reportError", "startCtx", "ctx", "_getCurrentComponent", "Show", "when", "For", "each", "list", "renderFn", "item", "index", "vnode", "Switch", "kids", "child", "Match", "Island", "mode", "mediaQuery", "placeholder", "wrapper", "hydrated", "doHydrate", "scheduleHydration", "el", "observer", "entries", "hydrate", "mq", "checkMedia", "refCallback", "_eachWarned", "each", "list", "fn", "keyFn", "item", "index", "vnode", "cls", "args", "classes", "arg", "key", "val", "style", "obj", "v", "k", "camelToKebab", "str", "debounce", "ms", "timer", "throttle", "last", "now", "_getCurrentComponentRef", "_setComponentRef", "useMediaQuery", "query", "signal", "mq", "s", "handler", "e", "ctx", "useLocalStorage", "initial", "stored", "raw", "dispose", "effect", "__DEV__", "storageHandler", "err", "Portal", "target", "children", "container", "useClickOutside", "ref", "listener", "el", "transition", "name", "active", "SVG_ELEMENTS", "SVG_NS", "mountedComponents", "_commentCtxMap", "isDomNode", "value", "isVNode", "disposeComponent", "ctx", "cleanup", "e", "dispose", "hook", "fn", "__DEV__", "__devtools", "disposeTree", "node", "commentCtx", "key", "children", "i", "mount", "vnode", "container", "createDOM", "parent", "isSvg", "startMarker", "endMarker", "currentNodes", "frag", "effect", "val", "vnodes", "realParent", "old", "v", "child", "createComponent", "createErrorBoundary", "createSuspenseBoundary", "createPortalDOM", "createElementFromVNode", "_propsProxyHandler", "target", "current", "componentStack", "getCurrentComponent", "_injectGetCurrentComponent", "_setComponentRef", "getComponentStack", "Component", "props", "ClassComp", "parentCtx", "errorBoundary", "p", "startComment", "endComment", "propsChildren", "mergedProps", "propsSignal", "signal", "reactiveProps", "result", "untrack", "error", "reportError", "errorState", "handleError", "fallback", "reset", "boundaryCtx", "boundary", "loading", "normalized", "portalCtx", "placeholder", "portalNodes", "tag", "svgContext", "el", "applyProps", "isSvgChildren", "newProps", "oldProps", "ref", "setProp", "_setSelectValue", "resolved", "eventName", "useCapture", "event", "storageKey", "wrappedHandler", "eventOpts", "oldStyle", "prop", "html"]
+}