@tanstack/redact 0.0.8 → 0.0.10

package/dist/dom/dispatcher.js

@@ -39,7 +39,11 @@ function depsEqual(a, b) {
   }
   return true;
 }
+var DISPATCHER = makeDispatcherImpl();
 function makeDispatcher() {
+  return DISPATCHER;
+}
+function makeDispatcherImpl() {
   return {
     useState(initial) {
       return this.useReducer(

package/dist/dom/dispatcher.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../src/dom/dispatcher.ts"],
-  "sourcesContent": ["import type { Hook, Fiber, FiberRoot, Effect } from '../core'\nimport { ReactSharedInternals, REACT_CONTEXT_TYPE } from '../react'\nimport { scheduleUpdate, enqueueEffect, readContext } from './reconcile'\n\nfunction getCurrentFiber(): Fiber {\n  const f = ReactSharedInternals.currentFiber\n  if (!f) throw new Error('Hook called outside a function component render.')\n  return f\n}\n\nfunction nextHook(): Hook {\n  const fiber = getCurrentFiber()\n  const idx = ReactSharedInternals.hookIndex++\n\n  let prev = ReactSharedInternals.currentHook\n\n  if (idx === 0) {\n    if (fiber.hooks) {\n      ReactSharedInternals.currentHook = fiber.hooks\n      return fiber.hooks\n    }\n    const h: Hook = { state: undefined, queue: undefined, deps: undefined, cleanup: undefined, next: null }\n    fiber.hooks = h\n    ReactSharedInternals.currentHook = h\n    return h\n  }\n\n  if (prev && prev.next) {\n    ReactSharedInternals.currentHook = prev.next\n    return prev.next\n  }\n\n  const h: Hook = { state: undefined, queue: undefined, deps: undefined, cleanup: undefined, next: null }\n  if (prev) prev.next = h\n  else fiber.hooks = h\n  ReactSharedInternals.currentHook = h\n  return h\n}\n\nfunction depsEqual(\n  a: ReadonlyArray<unknown> | undefined,\n  b: ReadonlyArray<unknown> | undefined,\n): boolean {\n  if (a === b) return true\n  if (!a || !b) return false\n  if (a.length !== b.length) return false\n  for (let i = 0; i < a.length; i++) {\n    if (!Object.is(a[i], b[i])) return false\n  }\n  return true\n}\n\nexport function makeDispatcher() {\n  return {\n    useState<S>(initial: S | (() => S)) {\n      return this.useReducer<S, S | ((p: S) => S)>(\n        basicReducer as any,\n        typeof initial === 'function' ? (initial as () => S)() : initial,\n      )\n    },\n\n    useReducer<S, A>(reducer: (s: S, a: A) => S, initialArg: any, init?: (a: any) => S) {\n      const hook = nextHook()\n      const fiber = getCurrentFiber()\n      if (hook.queue === undefined) {\n        hook.state = init ? init(initialArg) : initialArg\n        const queue: any = { reducer }\n        const dispatch = (action: A) => {\n          const currentState = hook.state as S\n          const next = queue.reducer(currentState, action)\n          if (!Object.is(next, currentState)) {\n            hook.state = next\n            scheduleUpdate(fiber)\n          }\n        }\n        queue.dispatch = dispatch\n        hook.queue = queue\n      } else {\n        hook.queue.reducer = reducer\n      }\n      return [hook.state, hook.queue.dispatch] as [S, (a: A) => void]\n    },\n\n    useEffect(create: () => any, deps?: ReadonlyArray<unknown>) {\n      const hook = nextHook()\n      const fiber = getCurrentFiber()\n      const prevDeps = hook.deps\n      if (prevDeps !== undefined && depsEqual(prevDeps, deps)) return\n      hook.deps = deps\n      const effect: Effect = {\n        tag: 'effect',\n        create: () => {\n          // Run the prior cleanup INSIDE the effect run, not during the\n          // dispatch/render phase. If render A \u2192 B \u2192 C all happen back-to-\n          // back before the passive microtask drains, dispatch-time cleanup\n          // only fires once (between A\u2192B) and effects B + C both run fresh,\n          // leaving two side-effects (e.g. two plot SVGs) in the DOM. Doing\n          // it here, at effect-run time, means every new create first tears\n          // down whatever cleanup is currently live on the hook.\n          if (hook.cleanup) {\n            try { hook.cleanup() } catch {}\n            // The prior cleanup was also pushed onto fiber.cleanups; remove\n            // it so unmount doesn't double-call it.\n            if (fiber.cleanups) {\n              const i = fiber.cleanups.indexOf(hook.cleanup)\n              if (i >= 0) fiber.cleanups.splice(i, 1)\n            }\n            hook.cleanup = null\n          }\n          const c = create()\n          hook.cleanup = typeof c === 'function' ? c : null\n          return hook.cleanup\n        },\n        destroy: undefined,\n        deps,\n      }\n      enqueueEffect(fiber, effect)\n    },\n\n    useLayoutEffect(create: () => any, deps?: ReadonlyArray<unknown>) {\n      const hook = nextHook()\n      const fiber = getCurrentFiber()\n      const prevDeps = hook.deps\n      if (prevDeps !== undefined && depsEqual(prevDeps, deps)) return\n      hook.deps = deps\n      const effect: Effect = {\n        tag: 'layout',\n        create: () => {\n          // Mirror useEffect: tear down the prior cleanup at run time so\n          // coalesced renders don't leak side-effects.\n          if (hook.cleanup) {\n            try { hook.cleanup() } catch {}\n            if (fiber.cleanups) {\n              const i = fiber.cleanups.indexOf(hook.cleanup)\n              if (i >= 0) fiber.cleanups.splice(i, 1)\n            }\n            hook.cleanup = null\n          }\n          const c = create()\n          hook.cleanup = typeof c === 'function' ? c : null\n          return hook.cleanup\n        },\n        destroy: undefined,\n        deps,\n      }\n      enqueueEffect(fiber, effect)\n    },\n\n    useInsertionEffect(create: () => any, deps?: ReadonlyArray<unknown>) {\n      return this.useLayoutEffect(create, deps)\n    },\n\n    useRef<T>(initial: T) {\n      const hook = nextHook()\n      if (hook.state === undefined) hook.state = { current: initial }\n      return hook.state as { current: T }\n    },\n\n    useMemo<T>(factory: () => T, deps?: ReadonlyArray<unknown>) {\n      const hook = nextHook()\n      if (hook.deps !== undefined && depsEqual(hook.deps, deps)) {\n        return hook.state as T\n      }\n      const value = factory()\n      hook.state = value\n      hook.deps = deps\n      return value\n    },\n\n    useCallback<T extends Function>(fn: T, deps?: ReadonlyArray<unknown>): T {\n      return this.useMemo(() => fn, deps) as T\n    },\n\n    useContext<T>(ctx: any): T {\n      const fiber = getCurrentFiber()\n      return readContext(fiber, ctx)\n    },\n\n    useImperativeHandle<T>(ref: any, factory: () => T, deps?: ReadonlyArray<unknown>) {\n      const hook = nextHook()\n      if (hook.deps !== undefined && depsEqual(hook.deps, deps)) return\n      hook.deps = deps\n      const value = factory()\n      if (ref) {\n        if (typeof ref === 'function') ref(value)\n        else ref.current = value\n      }\n    },\n\n    useDebugValue<T>(_value: T, _formatter?: (v: T) => any): void {\n      // noop\n    },\n\n    useId(): string {\n      const hook = nextHook()\n      if (hook.state === undefined) {\n        const fiber = getCurrentFiber()\n        const root = findRootFromFiber(fiber)\n        hook.state = (root?.identifierPrefix ?? ':r') + (idCounter++).toString(36)\n      }\n      return hook.state as string\n    },\n\n    useTransition(): [boolean, (fn: () => void) => void] {\n      return [false, (fn: () => void) => fn()]\n    },\n\n    useDeferredValue<T>(v: T): T {\n      return v\n    },\n\n    useSyncExternalStore<T>(\n      subscribe: (cb: () => void) => () => void,\n      getSnapshot: () => T,\n      getServerSnapshot?: () => T,\n    ): T {\n      const fiber = getCurrentFiber()\n      const hook = nextHook()\n\n      // During hydration, use the server snapshot (if provided) so the tree\n      // matches the SSR output. Components like TanStack Router's ClientOnly\n      // rely on this: they render `false` on server, `true` on client \u2014 and\n      // if we return `true` during hydration, client and server diverge and\n      // the tree mounts fresh next to the SSR fallback DOM.\n      const root = fiber.root ?? findRootFromFiber(fiber)\n      const isHydrating = Boolean(root?.hydrating)\n      const value =\n        isHydrating && getServerSnapshot ? getServerSnapshot() : getSnapshot()\n      hook.state = value\n\n      if (hook.cleanup == null) {\n        const forceUpdate = () => {\n          let next: T\n          try {\n            next = getSnapshot()\n          } catch {\n            scheduleUpdate(fiber)\n            return\n          }\n          if (!Object.is(hook.state, next)) {\n            hook.state = next\n            scheduleUpdate(fiber)\n          }\n        }\n        const unsubscribe = subscribe(forceUpdate)\n        hook.cleanup = unsubscribe\n        // Register with fiber so unmountFiber runs it. Without this, the store\n        // keeps holding forceUpdate and every store update schedules an already-\n        // unmounted fiber \u2014 its rerender walks stale .parent pointers and mounts\n        // zombie DOM into the old parent.\n        if (typeof unsubscribe === 'function') {\n          fiber.cleanups ||= []\n          fiber.cleanups.push(unsubscribe)\n        }\n\n        // If we served the server snapshot, run a post-hydration check so\n        // components like `useHydrated()` flip from false \u2192 true after the\n        // initial render commits. Queued late so hydration finishes first.\n        if (isHydrating && getServerSnapshot) {\n          queueMicrotask(() => queueMicrotask(forceUpdate))\n        }\n      }\n      return value\n    },\n\n    use<T>(resource: any): T {\n      if (resource == null) throw new Error('use() received null or undefined')\n      if (resource.$$typeof === REACT_CONTEXT_TYPE) {\n        return readContext(getCurrentFiber(), resource)\n      }\n      if (typeof resource.then === 'function') {\n        const thenable = resource\n        switch (thenable.status) {\n          case 'fulfilled':\n            return thenable.value\n          case 'rejected':\n            throw thenable.reason\n          default: {\n            if (thenable.status === undefined) {\n              thenable.status = 'pending'\n              thenable.then(\n                (v: any) => {\n                  if (thenable.status === 'pending') {\n                    thenable.status = 'fulfilled'\n                    thenable.value = v\n                  }\n                },\n                (e: any) => {\n                  if (thenable.status === 'pending') {\n                    thenable.status = 'rejected'\n                    thenable.reason = e\n                  }\n                },\n              )\n            }\n            throw thenable\n          }\n        }\n      }\n      throw new Error('use() expected a Promise or Context')\n    },\n  }\n}\n\nfunction basicReducer<S>(state: S, action: S | ((p: S) => S)): S {\n  return typeof action === 'function' ? (action as (p: S) => S)(state) : action\n}\n\nlet idCounter = 0\n\nfunction findRootFromFiber(fiber: Fiber): FiberRoot | null {\n  let f: Fiber | null = fiber\n  while (f) {\n    if (f.root) return f.root\n    f = f.parent\n  }\n  return null\n}\n"],
-  "mappings": ";AACA,SAAS,sBAAsB,0BAA0B;AACzD,SAAS,gBAAgB,eAAe,mBAAmB;AAE3D,SAAS,kBAAyB;AAChC,QAAM,IAAI,qBAAqB;AAC/B,MAAI,CAAC,EAAG,OAAM,IAAI,MAAM,kDAAkD;AAC1E,SAAO;AACT;AAEA,SAAS,WAAiB;AACxB,QAAM,QAAQ,gBAAgB;AAC9B,QAAM,MAAM,qBAAqB;AAEjC,MAAI,OAAO,qBAAqB;AAEhC,MAAI,QAAQ,GAAG;AACb,QAAI,MAAM,OAAO;AACf,2BAAqB,cAAc,MAAM;AACzC,aAAO,MAAM;AAAA,IACf;AACA,UAAMA,KAAU,EAAE,OAAO,QAAW,OAAO,QAAW,MAAM,QAAW,SAAS,QAAW,MAAM,KAAK;AACtG,UAAM,QAAQA;AACd,yBAAqB,cAAcA;AACnC,WAAOA;AAAA,EACT;AAEA,MAAI,QAAQ,KAAK,MAAM;AACrB,yBAAqB,cAAc,KAAK;AACxC,WAAO,KAAK;AAAA,EACd;AAEA,QAAM,IAAU,EAAE,OAAO,QAAW,OAAO,QAAW,MAAM,QAAW,SAAS,QAAW,MAAM,KAAK;AACtG,MAAI,KAAM,MAAK,OAAO;AAAA,MACjB,OAAM,QAAQ;AACnB,uBAAqB,cAAc;AACnC,SAAO;AACT;AAEA,SAAS,UACP,GACA,GACS;AACT,MAAI,MAAM,EAAG,QAAO;AACpB,MAAI,CAAC,KAAK,CAAC,EAAG,QAAO;AACrB,MAAI,EAAE,WAAW,EAAE,OAAQ,QAAO;AAClC,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,QAAI,CAAC,OAAO,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,EAAG,QAAO;AAAA,EACrC;AACA,SAAO;AACT;AAEO,SAAS,iBAAiB;AAC/B,SAAO;AAAA,IACL,SAAY,SAAwB;AAClC,aAAO,KAAK;AAAA,QACV;AAAA,QACA,OAAO,YAAY,aAAc,QAAoB,IAAI;AAAA,MAC3D;AAAA,IACF;AAAA,IAEA,WAAiB,SAA4B,YAAiB,MAAsB;AAClF,YAAM,OAAO,SAAS;AACtB,YAAM,QAAQ,gBAAgB;AAC9B,UAAI,KAAK,UAAU,QAAW;AAC5B,aAAK,QAAQ,OAAO,KAAK,UAAU,IAAI;AACvC,cAAM,QAAa,EAAE,QAAQ;AAC7B,cAAM,WAAW,CAAC,WAAc;AAC9B,gBAAM,eAAe,KAAK;AAC1B,gBAAM,OAAO,MAAM,QAAQ,cAAc,MAAM;AAC/C,cAAI,CAAC,OAAO,GAAG,MAAM,YAAY,GAAG;AAClC,iBAAK,QAAQ;AACb,2BAAe,KAAK;AAAA,UACtB;AAAA,QACF;AACA,cAAM,WAAW;AACjB,aAAK,QAAQ;AAAA,MACf,OAAO;AACL,aAAK,MAAM,UAAU;AAAA,MACvB;AACA,aAAO,CAAC,KAAK,OAAO,KAAK,MAAM,QAAQ;AAAA,IACzC;AAAA,IAEA,UAAU,QAAmB,MAA+B;AAC1D,YAAM,OAAO,SAAS;AACtB,YAAM,QAAQ,gBAAgB;AAC9B,YAAM,WAAW,KAAK;AACtB,UAAI,aAAa,UAAa,UAAU,UAAU,IAAI,EAAG;AACzD,WAAK,OAAO;AACZ,YAAM,SAAiB;AAAA,QACrB,KAAK;AAAA,QACL,QAAQ,MAAM;AAQZ,cAAI,KAAK,SAAS;AAChB,gBAAI;AAAE,mBAAK,QAAQ;AAAA,YAAE,QAAQ;AAAA,YAAC;AAG9B,gBAAI,MAAM,UAAU;AAClB,oBAAM,IAAI,MAAM,SAAS,QAAQ,KAAK,OAAO;AAC7C,kBAAI,KAAK,EAAG,OAAM,SAAS,OAAO,GAAG,CAAC;AAAA,YACxC;AACA,iBAAK,UAAU;AAAA,UACjB;AACA,gBAAM,IAAI,OAAO;AACjB,eAAK,UAAU,OAAO,MAAM,aAAa,IAAI;AAC7C,iBAAO,KAAK;AAAA,QACd;AAAA,QACA,SAAS;AAAA,QACT;AAAA,MACF;AACA,oBAAc,OAAO,MAAM;AAAA,IAC7B;AAAA,IAEA,gBAAgB,QAAmB,MAA+B;AAChE,YAAM,OAAO,SAAS;AACtB,YAAM,QAAQ,gBAAgB;AAC9B,YAAM,WAAW,KAAK;AACtB,UAAI,aAAa,UAAa,UAAU,UAAU,IAAI,EAAG;AACzD,WAAK,OAAO;AACZ,YAAM,SAAiB;AAAA,QACrB,KAAK;AAAA,QACL,QAAQ,MAAM;AAGZ,cAAI,KAAK,SAAS;AAChB,gBAAI;AAAE,mBAAK,QAAQ;AAAA,YAAE,QAAQ;AAAA,YAAC;AAC9B,gBAAI,MAAM,UAAU;AAClB,oBAAM,IAAI,MAAM,SAAS,QAAQ,KAAK,OAAO;AAC7C,kBAAI,KAAK,EAAG,OAAM,SAAS,OAAO,GAAG,CAAC;AAAA,YACxC;AACA,iBAAK,UAAU;AAAA,UACjB;AACA,gBAAM,IAAI,OAAO;AACjB,eAAK,UAAU,OAAO,MAAM,aAAa,IAAI;AAC7C,iBAAO,KAAK;AAAA,QACd;AAAA,QACA,SAAS;AAAA,QACT;AAAA,MACF;AACA,oBAAc,OAAO,MAAM;AAAA,IAC7B;AAAA,IAEA,mBAAmB,QAAmB,MAA+B;AACnE,aAAO,KAAK,gBAAgB,QAAQ,IAAI;AAAA,IAC1C;AAAA,IAEA,OAAU,SAAY;AACpB,YAAM,OAAO,SAAS;AACtB,UAAI,KAAK,UAAU,OAAW,MAAK,QAAQ,EAAE,SAAS,QAAQ;AAC9D,aAAO,KAAK;AAAA,IACd;AAAA,IAEA,QAAW,SAAkB,MAA+B;AAC1D,YAAM,OAAO,SAAS;AACtB,UAAI,KAAK,SAAS,UAAa,UAAU,KAAK,MAAM,IAAI,GAAG;AACzD,eAAO,KAAK;AAAA,MACd;AACA,YAAM,QAAQ,QAAQ;AACtB,WAAK,QAAQ;AACb,WAAK,OAAO;AACZ,aAAO;AAAA,IACT;AAAA,IAEA,YAAgC,IAAO,MAAkC;AACvE,aAAO,KAAK,QAAQ,MAAM,IAAI,IAAI;AAAA,IACpC;AAAA,IAEA,WAAc,KAAa;AACzB,YAAM,QAAQ,gBAAgB;AAC9B,aAAO,YAAY,OAAO,GAAG;AAAA,IAC/B;AAAA,IAEA,oBAAuB,KAAU,SAAkB,MAA+B;AAChF,YAAM,OAAO,SAAS;AACtB,UAAI,KAAK,SAAS,UAAa,UAAU,KAAK,MAAM,IAAI,EAAG;AAC3D,WAAK,OAAO;AACZ,YAAM,QAAQ,QAAQ;AACtB,UAAI,KAAK;AACP,YAAI,OAAO,QAAQ,WAAY,KAAI,KAAK;AAAA,YACnC,KAAI,UAAU;AAAA,MACrB;AAAA,IACF;AAAA,IAEA,cAAiB,QAAW,YAAkC;AAAA,IAE9D;AAAA,IAEA,QAAgB;AACd,YAAM,OAAO,SAAS;AACtB,UAAI,KAAK,UAAU,QAAW;AAC5B,cAAM,QAAQ,gBAAgB;AAC9B,cAAM,OAAO,kBAAkB,KAAK;AACpC,aAAK,SAAS,MAAM,oBAAoB,SAAS,aAAa,SAAS,EAAE;AAAA,MAC3E;AACA,aAAO,KAAK;AAAA,IACd;AAAA,IAEA,gBAAqD;AACnD,aAAO,CAAC,OAAO,CAAC,OAAmB,GAAG,CAAC;AAAA,IACzC;AAAA,IAEA,iBAAoB,GAAS;AAC3B,aAAO;AAAA,IACT;AAAA,IAEA,qBACE,WACA,aACA,mBACG;AACH,YAAM,QAAQ,gBAAgB;AAC9B,YAAM,OAAO,SAAS;AAOtB,YAAM,OAAO,MAAM,QAAQ,kBAAkB,KAAK;AAClD,YAAM,cAAc,QAAQ,MAAM,SAAS;AAC3C,YAAM,QACJ,eAAe,oBAAoB,kBAAkB,IAAI,YAAY;AACvE,WAAK,QAAQ;AAEb,UAAI,KAAK,WAAW,MAAM;AACxB,cAAM,cAAc,MAAM;AACxB,cAAI;AACJ,cAAI;AACF,mBAAO,YAAY;AAAA,UACrB,QAAQ;AACN,2BAAe,KAAK;AACpB;AAAA,UACF;AACA,cAAI,CAAC,OAAO,GAAG,KAAK,OAAO,IAAI,GAAG;AAChC,iBAAK,QAAQ;AACb,2BAAe,KAAK;AAAA,UACtB;AAAA,QACF;AACA,cAAM,cAAc,UAAU,WAAW;AACzC,aAAK,UAAU;AAKf,YAAI,OAAO,gBAAgB,YAAY;AACrC,gBAAM,aAAa,CAAC;AACpB,gBAAM,SAAS,KAAK,WAAW;AAAA,QACjC;AAKA,YAAI,eAAe,mBAAmB;AACpC,yBAAe,MAAM,eAAe,WAAW,CAAC;AAAA,QAClD;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAAA,IAEA,IAAO,UAAkB;AACvB,UAAI,YAAY,KAAM,OAAM,IAAI,MAAM,kCAAkC;AACxE,UAAI,SAAS,aAAa,oBAAoB;AAC5C,eAAO,YAAY,gBAAgB,GAAG,QAAQ;AAAA,MAChD;AACA,UAAI,OAAO,SAAS,SAAS,YAAY;AACvC,cAAM,WAAW;AACjB,gBAAQ,SAAS,QAAQ;AAAA,UACvB,KAAK;AACH,mBAAO,SAAS;AAAA,UAClB,KAAK;AACH,kBAAM,SAAS;AAAA,UACjB,SAAS;AACP,gBAAI,SAAS,WAAW,QAAW;AACjC,uBAAS,SAAS;AAClB,uBAAS;AAAA,gBACP,CAAC,MAAW;AACV,sBAAI,SAAS,WAAW,WAAW;AACjC,6BAAS,SAAS;AAClB,6BAAS,QAAQ;AAAA,kBACnB;AAAA,gBACF;AAAA,gBACA,CAAC,MAAW;AACV,sBAAI,SAAS,WAAW,WAAW;AACjC,6BAAS,SAAS;AAClB,6BAAS,SAAS;AAAA,kBACpB;AAAA,gBACF;AAAA,cACF;AAAA,YACF;AACA,kBAAM;AAAA,UACR;AAAA,QACF;AAAA,MACF;AACA,YAAM,IAAI,MAAM,qCAAqC;AAAA,IACvD;AAAA,EACF;AACF;AAEA,SAAS,aAAgB,OAAU,QAA8B;AAC/D,SAAO,OAAO,WAAW,aAAc,OAAuB,KAAK,IAAI;AACzE;AAEA,IAAI,YAAY;AAEhB,SAAS,kBAAkB,OAAgC;AACzD,MAAI,IAAkB;AACtB,SAAO,GAAG;AACR,QAAI,EAAE,KAAM,QAAO,EAAE;AACrB,QAAI,EAAE;AAAA,EACR;AACA,SAAO;AACT;",
+  "sourcesContent": ["import type { Hook, Fiber, FiberRoot, Effect } from '../core'\nimport { ReactSharedInternals, REACT_CONTEXT_TYPE } from '../react'\nimport { scheduleUpdate, enqueueEffect, readContext } from './reconcile'\n\nfunction getCurrentFiber(): Fiber {\n  const f = ReactSharedInternals.currentFiber\n  if (!f) throw new Error('Hook called outside a function component render.')\n  return f\n}\n\nfunction nextHook(): Hook {\n  const fiber = getCurrentFiber()\n  const idx = ReactSharedInternals.hookIndex++\n\n  let prev = ReactSharedInternals.currentHook\n\n  if (idx === 0) {\n    if (fiber.hooks) {\n      ReactSharedInternals.currentHook = fiber.hooks\n      return fiber.hooks\n    }\n    const h: Hook = { state: undefined, queue: undefined, deps: undefined, cleanup: undefined, next: null }\n    fiber.hooks = h\n    ReactSharedInternals.currentHook = h\n    return h\n  }\n\n  if (prev && prev.next) {\n    ReactSharedInternals.currentHook = prev.next\n    return prev.next\n  }\n\n  const h: Hook = { state: undefined, queue: undefined, deps: undefined, cleanup: undefined, next: null }\n  if (prev) prev.next = h\n  else fiber.hooks = h\n  ReactSharedInternals.currentHook = h\n  return h\n}\n\nfunction depsEqual(\n  a: ReadonlyArray<unknown> | undefined,\n  b: ReadonlyArray<unknown> | undefined,\n): boolean {\n  if (a === b) return true\n  if (!a || !b) return false\n  if (a.length !== b.length) return false\n  for (let i = 0; i < a.length; i++) {\n    if (!Object.is(a[i], b[i])) return false\n  }\n  return true\n}\n\n// Singleton \u2014 every method reads render context via ReactSharedInternals,\n// and per-hook closures live on the hook itself, so nothing is render-local\n// to capture. Allocating a fresh wrapper + 17 method closures per function-\n// component render was pure GC pressure.\nconst DISPATCHER = makeDispatcherImpl()\n\nexport function makeDispatcher() {\n  return DISPATCHER\n}\n\nfunction makeDispatcherImpl() {\n  return {\n    useState<S>(initial: S | (() => S)) {\n      return this.useReducer<S, S | ((p: S) => S)>(\n        basicReducer as any,\n        typeof initial === 'function' ? (initial as () => S)() : initial,\n      )\n    },\n\n    useReducer<S, A>(reducer: (s: S, a: A) => S, initialArg: any, init?: (a: any) => S) {\n      const hook = nextHook()\n      const fiber = getCurrentFiber()\n      if (hook.queue === undefined) {\n        hook.state = init ? init(initialArg) : initialArg\n        const queue: any = { reducer }\n        const dispatch = (action: A) => {\n          const currentState = hook.state as S\n          const next = queue.reducer(currentState, action)\n          if (!Object.is(next, currentState)) {\n            hook.state = next\n            scheduleUpdate(fiber)\n          }\n        }\n        queue.dispatch = dispatch\n        hook.queue = queue\n      } else {\n        hook.queue.reducer = reducer\n      }\n      return [hook.state, hook.queue.dispatch] as [S, (a: A) => void]\n    },\n\n    useEffect(create: () => any, deps?: ReadonlyArray<unknown>) {\n      const hook = nextHook()\n      const fiber = getCurrentFiber()\n      const prevDeps = hook.deps\n      if (prevDeps !== undefined && depsEqual(prevDeps, deps)) return\n      hook.deps = deps\n      const effect: Effect = {\n        tag: 'effect',\n        create: () => {\n          // Run the prior cleanup INSIDE the effect run, not during the\n          // dispatch/render phase. If render A \u2192 B \u2192 C all happen back-to-\n          // back before the passive microtask drains, dispatch-time cleanup\n          // only fires once (between A\u2192B) and effects B + C both run fresh,\n          // leaving two side-effects (e.g. two plot SVGs) in the DOM. Doing\n          // it here, at effect-run time, means every new create first tears\n          // down whatever cleanup is currently live on the hook.\n          if (hook.cleanup) {\n            try { hook.cleanup() } catch {}\n            // The prior cleanup was also pushed onto fiber.cleanups; remove\n            // it so unmount doesn't double-call it.\n            if (fiber.cleanups) {\n              const i = fiber.cleanups.indexOf(hook.cleanup)\n              if (i >= 0) fiber.cleanups.splice(i, 1)\n            }\n            hook.cleanup = null\n          }\n          const c = create()\n          hook.cleanup = typeof c === 'function' ? c : null\n          return hook.cleanup\n        },\n        destroy: undefined,\n        deps,\n      }\n      enqueueEffect(fiber, effect)\n    },\n\n    useLayoutEffect(create: () => any, deps?: ReadonlyArray<unknown>) {\n      const hook = nextHook()\n      const fiber = getCurrentFiber()\n      const prevDeps = hook.deps\n      if (prevDeps !== undefined && depsEqual(prevDeps, deps)) return\n      hook.deps = deps\n      const effect: Effect = {\n        tag: 'layout',\n        create: () => {\n          // Mirror useEffect: tear down the prior cleanup at run time so\n          // coalesced renders don't leak side-effects.\n          if (hook.cleanup) {\n            try { hook.cleanup() } catch {}\n            if (fiber.cleanups) {\n              const i = fiber.cleanups.indexOf(hook.cleanup)\n              if (i >= 0) fiber.cleanups.splice(i, 1)\n            }\n            hook.cleanup = null\n          }\n          const c = create()\n          hook.cleanup = typeof c === 'function' ? c : null\n          return hook.cleanup\n        },\n        destroy: undefined,\n        deps,\n      }\n      enqueueEffect(fiber, effect)\n    },\n\n    useInsertionEffect(create: () => any, deps?: ReadonlyArray<unknown>) {\n      return this.useLayoutEffect(create, deps)\n    },\n\n    useRef<T>(initial: T) {\n      const hook = nextHook()\n      if (hook.state === undefined) hook.state = { current: initial }\n      return hook.state as { current: T }\n    },\n\n    useMemo<T>(factory: () => T, deps?: ReadonlyArray<unknown>) {\n      const hook = nextHook()\n      if (hook.deps !== undefined && depsEqual(hook.deps, deps)) {\n        return hook.state as T\n      }\n      const value = factory()\n      hook.state = value\n      hook.deps = deps\n      return value\n    },\n\n    useCallback<T extends Function>(fn: T, deps?: ReadonlyArray<unknown>): T {\n      return this.useMemo(() => fn, deps) as T\n    },\n\n    useContext<T>(ctx: any): T {\n      const fiber = getCurrentFiber()\n      return readContext(fiber, ctx)\n    },\n\n    useImperativeHandle<T>(ref: any, factory: () => T, deps?: ReadonlyArray<unknown>) {\n      const hook = nextHook()\n      if (hook.deps !== undefined && depsEqual(hook.deps, deps)) return\n      hook.deps = deps\n      const value = factory()\n      if (ref) {\n        if (typeof ref === 'function') ref(value)\n        else ref.current = value\n      }\n    },\n\n    useDebugValue<T>(_value: T, _formatter?: (v: T) => any): void {\n      // noop\n    },\n\n    useId(): string {\n      const hook = nextHook()\n      if (hook.state === undefined) {\n        const fiber = getCurrentFiber()\n        const root = findRootFromFiber(fiber)\n        hook.state = (root?.identifierPrefix ?? ':r') + (idCounter++).toString(36)\n      }\n      return hook.state as string\n    },\n\n    useTransition(): [boolean, (fn: () => void) => void] {\n      return [false, (fn: () => void) => fn()]\n    },\n\n    useDeferredValue<T>(v: T): T {\n      return v\n    },\n\n    useSyncExternalStore<T>(\n      subscribe: (cb: () => void) => () => void,\n      getSnapshot: () => T,\n      getServerSnapshot?: () => T,\n    ): T {\n      const fiber = getCurrentFiber()\n      const hook = nextHook()\n\n      // During hydration, use the server snapshot (if provided) so the tree\n      // matches the SSR output. Components like TanStack Router's ClientOnly\n      // rely on this: they render `false` on server, `true` on client \u2014 and\n      // if we return `true` during hydration, client and server diverge and\n      // the tree mounts fresh next to the SSR fallback DOM.\n      const root = fiber.root ?? findRootFromFiber(fiber)\n      const isHydrating = Boolean(root?.hydrating)\n      const value =\n        isHydrating && getServerSnapshot ? getServerSnapshot() : getSnapshot()\n      hook.state = value\n\n      if (hook.cleanup == null) {\n        const forceUpdate = () => {\n          let next: T\n          try {\n            next = getSnapshot()\n          } catch {\n            scheduleUpdate(fiber)\n            return\n          }\n          if (!Object.is(hook.state, next)) {\n            hook.state = next\n            scheduleUpdate(fiber)\n          }\n        }\n        const unsubscribe = subscribe(forceUpdate)\n        hook.cleanup = unsubscribe\n        // Register with fiber so unmountFiber runs it. Without this, the store\n        // keeps holding forceUpdate and every store update schedules an already-\n        // unmounted fiber \u2014 its rerender walks stale .parent pointers and mounts\n        // zombie DOM into the old parent.\n        if (typeof unsubscribe === 'function') {\n          fiber.cleanups ||= []\n          fiber.cleanups.push(unsubscribe)\n        }\n\n        // If we served the server snapshot, run a post-hydration check so\n        // components like `useHydrated()` flip from false \u2192 true after the\n        // initial render commits. Queued late so hydration finishes first.\n        if (isHydrating && getServerSnapshot) {\n          queueMicrotask(() => queueMicrotask(forceUpdate))\n        }\n      }\n      return value\n    },\n\n    use<T>(resource: any): T {\n      if (resource == null) throw new Error('use() received null or undefined')\n      if (resource.$$typeof === REACT_CONTEXT_TYPE) {\n        return readContext(getCurrentFiber(), resource)\n      }\n      if (typeof resource.then === 'function') {\n        const thenable = resource\n        switch (thenable.status) {\n          case 'fulfilled':\n            return thenable.value\n          case 'rejected':\n            throw thenable.reason\n          default: {\n            if (thenable.status === undefined) {\n              thenable.status = 'pending'\n              thenable.then(\n                (v: any) => {\n                  if (thenable.status === 'pending') {\n                    thenable.status = 'fulfilled'\n                    thenable.value = v\n                  }\n                },\n                (e: any) => {\n                  if (thenable.status === 'pending') {\n                    thenable.status = 'rejected'\n                    thenable.reason = e\n                  }\n                },\n              )\n            }\n            throw thenable\n          }\n        }\n      }\n      throw new Error('use() expected a Promise or Context')\n    },\n  }\n}\n\nfunction basicReducer<S>(state: S, action: S | ((p: S) => S)): S {\n  return typeof action === 'function' ? (action as (p: S) => S)(state) : action\n}\n\nlet idCounter = 0\n\nfunction findRootFromFiber(fiber: Fiber): FiberRoot | null {\n  let f: Fiber | null = fiber\n  while (f) {\n    if (f.root) return f.root\n    f = f.parent\n  }\n  return null\n}\n"],
+  "mappings": ";AACA,SAAS,sBAAsB,0BAA0B;AACzD,SAAS,gBAAgB,eAAe,mBAAmB;AAE3D,SAAS,kBAAyB;AAChC,QAAM,IAAI,qBAAqB;AAC/B,MAAI,CAAC,EAAG,OAAM,IAAI,MAAM,kDAAkD;AAC1E,SAAO;AACT;AAEA,SAAS,WAAiB;AACxB,QAAM,QAAQ,gBAAgB;AAC9B,QAAM,MAAM,qBAAqB;AAEjC,MAAI,OAAO,qBAAqB;AAEhC,MAAI,QAAQ,GAAG;AACb,QAAI,MAAM,OAAO;AACf,2BAAqB,cAAc,MAAM;AACzC,aAAO,MAAM;AAAA,IACf;AACA,UAAMA,KAAU,EAAE,OAAO,QAAW,OAAO,QAAW,MAAM,QAAW,SAAS,QAAW,MAAM,KAAK;AACtG,UAAM,QAAQA;AACd,yBAAqB,cAAcA;AACnC,WAAOA;AAAA,EACT;AAEA,MAAI,QAAQ,KAAK,MAAM;AACrB,yBAAqB,cAAc,KAAK;AACxC,WAAO,KAAK;AAAA,EACd;AAEA,QAAM,IAAU,EAAE,OAAO,QAAW,OAAO,QAAW,MAAM,QAAW,SAAS,QAAW,MAAM,KAAK;AACtG,MAAI,KAAM,MAAK,OAAO;AAAA,MACjB,OAAM,QAAQ;AACnB,uBAAqB,cAAc;AACnC,SAAO;AACT;AAEA,SAAS,UACP,GACA,GACS;AACT,MAAI,MAAM,EAAG,QAAO;AACpB,MAAI,CAAC,KAAK,CAAC,EAAG,QAAO;AACrB,MAAI,EAAE,WAAW,EAAE,OAAQ,QAAO;AAClC,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,QAAI,CAAC,OAAO,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,EAAG,QAAO;AAAA,EACrC;AACA,SAAO;AACT;AAMA,IAAM,aAAa,mBAAmB;AAE/B,SAAS,iBAAiB;AAC/B,SAAO;AACT;AAEA,SAAS,qBAAqB;AAC5B,SAAO;AAAA,IACL,SAAY,SAAwB;AAClC,aAAO,KAAK;AAAA,QACV;AAAA,QACA,OAAO,YAAY,aAAc,QAAoB,IAAI;AAAA,MAC3D;AAAA,IACF;AAAA,IAEA,WAAiB,SAA4B,YAAiB,MAAsB;AAClF,YAAM,OAAO,SAAS;AACtB,YAAM,QAAQ,gBAAgB;AAC9B,UAAI,KAAK,UAAU,QAAW;AAC5B,aAAK,QAAQ,OAAO,KAAK,UAAU,IAAI;AACvC,cAAM,QAAa,EAAE,QAAQ;AAC7B,cAAM,WAAW,CAAC,WAAc;AAC9B,gBAAM,eAAe,KAAK;AAC1B,gBAAM,OAAO,MAAM,QAAQ,cAAc,MAAM;AAC/C,cAAI,CAAC,OAAO,GAAG,MAAM,YAAY,GAAG;AAClC,iBAAK,QAAQ;AACb,2BAAe,KAAK;AAAA,UACtB;AAAA,QACF;AACA,cAAM,WAAW;AACjB,aAAK,QAAQ;AAAA,MACf,OAAO;AACL,aAAK,MAAM,UAAU;AAAA,MACvB;AACA,aAAO,CAAC,KAAK,OAAO,KAAK,MAAM,QAAQ;AAAA,IACzC;AAAA,IAEA,UAAU,QAAmB,MAA+B;AAC1D,YAAM,OAAO,SAAS;AACtB,YAAM,QAAQ,gBAAgB;AAC9B,YAAM,WAAW,KAAK;AACtB,UAAI,aAAa,UAAa,UAAU,UAAU,IAAI,EAAG;AACzD,WAAK,OAAO;AACZ,YAAM,SAAiB;AAAA,QACrB,KAAK;AAAA,QACL,QAAQ,MAAM;AAQZ,cAAI,KAAK,SAAS;AAChB,gBAAI;AAAE,mBAAK,QAAQ;AAAA,YAAE,QAAQ;AAAA,YAAC;AAG9B,gBAAI,MAAM,UAAU;AAClB,oBAAM,IAAI,MAAM,SAAS,QAAQ,KAAK,OAAO;AAC7C,kBAAI,KAAK,EAAG,OAAM,SAAS,OAAO,GAAG,CAAC;AAAA,YACxC;AACA,iBAAK,UAAU;AAAA,UACjB;AACA,gBAAM,IAAI,OAAO;AACjB,eAAK,UAAU,OAAO,MAAM,aAAa,IAAI;AAC7C,iBAAO,KAAK;AAAA,QACd;AAAA,QACA,SAAS;AAAA,QACT;AAAA,MACF;AACA,oBAAc,OAAO,MAAM;AAAA,IAC7B;AAAA,IAEA,gBAAgB,QAAmB,MAA+B;AAChE,YAAM,OAAO,SAAS;AACtB,YAAM,QAAQ,gBAAgB;AAC9B,YAAM,WAAW,KAAK;AACtB,UAAI,aAAa,UAAa,UAAU,UAAU,IAAI,EAAG;AACzD,WAAK,OAAO;AACZ,YAAM,SAAiB;AAAA,QACrB,KAAK;AAAA,QACL,QAAQ,MAAM;AAGZ,cAAI,KAAK,SAAS;AAChB,gBAAI;AAAE,mBAAK,QAAQ;AAAA,YAAE,QAAQ;AAAA,YAAC;AAC9B,gBAAI,MAAM,UAAU;AAClB,oBAAM,IAAI,MAAM,SAAS,QAAQ,KAAK,OAAO;AAC7C,kBAAI,KAAK,EAAG,OAAM,SAAS,OAAO,GAAG,CAAC;AAAA,YACxC;AACA,iBAAK,UAAU;AAAA,UACjB;AACA,gBAAM,IAAI,OAAO;AACjB,eAAK,UAAU,OAAO,MAAM,aAAa,IAAI;AAC7C,iBAAO,KAAK;AAAA,QACd;AAAA,QACA,SAAS;AAAA,QACT;AAAA,MACF;AACA,oBAAc,OAAO,MAAM;AAAA,IAC7B;AAAA,IAEA,mBAAmB,QAAmB,MAA+B;AACnE,aAAO,KAAK,gBAAgB,QAAQ,IAAI;AAAA,IAC1C;AAAA,IAEA,OAAU,SAAY;AACpB,YAAM,OAAO,SAAS;AACtB,UAAI,KAAK,UAAU,OAAW,MAAK,QAAQ,EAAE,SAAS,QAAQ;AAC9D,aAAO,KAAK;AAAA,IACd;AAAA,IAEA,QAAW,SAAkB,MAA+B;AAC1D,YAAM,OAAO,SAAS;AACtB,UAAI,KAAK,SAAS,UAAa,UAAU,KAAK,MAAM,IAAI,GAAG;AACzD,eAAO,KAAK;AAAA,MACd;AACA,YAAM,QAAQ,QAAQ;AACtB,WAAK,QAAQ;AACb,WAAK,OAAO;AACZ,aAAO;AAAA,IACT;AAAA,IAEA,YAAgC,IAAO,MAAkC;AACvE,aAAO,KAAK,QAAQ,MAAM,IAAI,IAAI;AAAA,IACpC;AAAA,IAEA,WAAc,KAAa;AACzB,YAAM,QAAQ,gBAAgB;AAC9B,aAAO,YAAY,OAAO,GAAG;AAAA,IAC/B;AAAA,IAEA,oBAAuB,KAAU,SAAkB,MAA+B;AAChF,YAAM,OAAO,SAAS;AACtB,UAAI,KAAK,SAAS,UAAa,UAAU,KAAK,MAAM,IAAI,EAAG;AAC3D,WAAK,OAAO;AACZ,YAAM,QAAQ,QAAQ;AACtB,UAAI,KAAK;AACP,YAAI,OAAO,QAAQ,WAAY,KAAI,KAAK;AAAA,YACnC,KAAI,UAAU;AAAA,MACrB;AAAA,IACF;AAAA,IAEA,cAAiB,QAAW,YAAkC;AAAA,IAE9D;AAAA,IAEA,QAAgB;AACd,YAAM,OAAO,SAAS;AACtB,UAAI,KAAK,UAAU,QAAW;AAC5B,cAAM,QAAQ,gBAAgB;AAC9B,cAAM,OAAO,kBAAkB,KAAK;AACpC,aAAK,SAAS,MAAM,oBAAoB,SAAS,aAAa,SAAS,EAAE;AAAA,MAC3E;AACA,aAAO,KAAK;AAAA,IACd;AAAA,IAEA,gBAAqD;AACnD,aAAO,CAAC,OAAO,CAAC,OAAmB,GAAG,CAAC;AAAA,IACzC;AAAA,IAEA,iBAAoB,GAAS;AAC3B,aAAO;AAAA,IACT;AAAA,IAEA,qBACE,WACA,aACA,mBACG;AACH,YAAM,QAAQ,gBAAgB;AAC9B,YAAM,OAAO,SAAS;AAOtB,YAAM,OAAO,MAAM,QAAQ,kBAAkB,KAAK;AAClD,YAAM,cAAc,QAAQ,MAAM,SAAS;AAC3C,YAAM,QACJ,eAAe,oBAAoB,kBAAkB,IAAI,YAAY;AACvE,WAAK,QAAQ;AAEb,UAAI,KAAK,WAAW,MAAM;AACxB,cAAM,cAAc,MAAM;AACxB,cAAI;AACJ,cAAI;AACF,mBAAO,YAAY;AAAA,UACrB,QAAQ;AACN,2BAAe,KAAK;AACpB;AAAA,UACF;AACA,cAAI,CAAC,OAAO,GAAG,KAAK,OAAO,IAAI,GAAG;AAChC,iBAAK,QAAQ;AACb,2BAAe,KAAK;AAAA,UACtB;AAAA,QACF;AACA,cAAM,cAAc,UAAU,WAAW;AACzC,aAAK,UAAU;AAKf,YAAI,OAAO,gBAAgB,YAAY;AACrC,gBAAM,aAAa,CAAC;AACpB,gBAAM,SAAS,KAAK,WAAW;AAAA,QACjC;AAKA,YAAI,eAAe,mBAAmB;AACpC,yBAAe,MAAM,eAAe,WAAW,CAAC;AAAA,QAClD;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAAA,IAEA,IAAO,UAAkB;AACvB,UAAI,YAAY,KAAM,OAAM,IAAI,MAAM,kCAAkC;AACxE,UAAI,SAAS,aAAa,oBAAoB;AAC5C,eAAO,YAAY,gBAAgB,GAAG,QAAQ;AAAA,MAChD;AACA,UAAI,OAAO,SAAS,SAAS,YAAY;AACvC,cAAM,WAAW;AACjB,gBAAQ,SAAS,QAAQ;AAAA,UACvB,KAAK;AACH,mBAAO,SAAS;AAAA,UAClB,KAAK;AACH,kBAAM,SAAS;AAAA,UACjB,SAAS;AACP,gBAAI,SAAS,WAAW,QAAW;AACjC,uBAAS,SAAS;AAClB,uBAAS;AAAA,gBACP,CAAC,MAAW;AACV,sBAAI,SAAS,WAAW,WAAW;AACjC,6BAAS,SAAS;AAClB,6BAAS,QAAQ;AAAA,kBACnB;AAAA,gBACF;AAAA,gBACA,CAAC,MAAW;AACV,sBAAI,SAAS,WAAW,WAAW;AACjC,6BAAS,SAAS;AAClB,6BAAS,SAAS;AAAA,kBACpB;AAAA,gBACF;AAAA,cACF;AAAA,YACF;AACA,kBAAM;AAAA,UACR;AAAA,QACF;AAAA,MACF;AACA,YAAM,IAAI,MAAM,qCAAqC;AAAA,IACvD;AAAA,EACF;AACF;AAEA,SAAS,aAAgB,OAAU,QAA8B;AAC/D,SAAO,OAAO,WAAW,aAAc,OAAuB,KAAK,IAAI;AACzE;AAEA,IAAI,YAAY;AAEhB,SAAS,kBAAkB,OAAgC;AACzD,MAAI,IAAkB;AACtB,SAAO,GAAG;AACR,QAAI,EAAE,KAAM,QAAO,EAAE;AACrB,QAAI,EAAE;AAAA,EACR;AACA,SAAO;AACT;",
   "names": ["h"]
 }

package/dist/dom/reconcile.d.ts

@@ -4,10 +4,7 @@ export declare function flushSyncWork(fn: () => void): void;
 export declare function batchedUpdates<T>(fn: () => T): T;
 export declare function findRoot(fiber: Fiber): FiberRoot | null;
 export declare function renderRoot(root: FiberRoot, children: ReactNode): void;
-type TextChild = {
-    _text: string;
-};
-type NormalizedChild = ReactElement | TextChild | null;
+type NormalizedChild = ReactElement | string | null;
 export declare function childrenToArray(children: ReactNode): NormalizedChild[];
 /**
  * Reconcile a parent fiber's child list against new normalized children.

package/dist/dom/reconcile.js

@@ -141,7 +141,7 @@ function rerenderFiber(fiber, root) {
   }
 }
 function isTextChild(child) {
-  return child.$$typeof === void 0;
+  return typeof child === "string";
 }
 function childrenToArray(children) {
   const out = [];
@@ -150,9 +150,13 @@ function childrenToArray(children) {
 }
 function pushChildren(node, out) {
   if (node == null || typeof node === "boolean") return;
-  if (typeof node === "string" || typeof node === "number") {
+  if (typeof node === "string") {
     if (node === "") return;
-    out.push({ _text: "" + node });
+    out.push(node);
+    return;
+  }
+  if (typeof node === "number") {
+    out.push("" + node);
     return;
   }
   if (Array.isArray(node)) {
@@ -192,7 +196,7 @@ function fiberFromChild(child, parent) {
   if (!child) return createFiber(FiberTag.Fragment, null, null);
   if (isTextChild(child)) {
     const f2 = createFiber(FiberTag.Text, null, null);
-    f2.pendingProps = child._text;
+    f2.pendingProps = child;
     f2.parent = parent;
     return f2;
   }
@@ -220,6 +224,50 @@ function fiberFromChild(child, parent) {
   return f;
 }
 function reconcileChildren(parent, newChildren, domParent, anchor) {
+  if (!currentRoot?.hydrating) {
+    let f = parent.child;
+    let ok = true;
+    for (let i = 0; i < newChildren.length; i++) {
+      const child = newChildren[i];
+      if (child == null || !f || f.key != null) {
+        ok = false;
+        break;
+      }
+      if (typeof child === "string") {
+        if (f.tag !== FiberTag.Text) {
+          ok = false;
+          break;
+        }
+        f.pendingProps = child;
+      } else {
+        if (child.key != null) {
+          ok = false;
+          break;
+        }
+        if (f.type !== child.type) {
+          ok = false;
+          break;
+        }
+        f.pendingProps = child.props;
+        f.ref = child.ref ?? null;
+      }
+      f = f.sibling;
+    }
+    if (ok && f === null) {
+      for (let r = parent.child; r; r = r.sibling) {
+        let a = anchor;
+        for (let s = r.sibling; s; s = s.sibling) {
+          const d = firstDomNode(s);
+          if (d && d.parentNode === domParent) {
+            a = d;
+            break;
+          }
+        }
+        renderFiber(r, domParent, a);
+      }
+      return;
+    }
+  }
   const existing = collectChildren(parent);
   const keyed = /* @__PURE__ */ new Map();
   for (const f of existing) {
@@ -271,7 +319,7 @@ function reconcileChildren(parent, newChildren, domParent, anchor) {
       claimed.add(match);
       fiber = match;
       if (isTextChild(child)) {
-        fiber.pendingProps = child._text;
+        fiber.pendingProps = child;
       } else {
         fiber.type = child.type;
         fiber.pendingProps = child.props;
@@ -419,13 +467,14 @@ function renderFiber(fiber, domParent, anchor) {
 }
 function renderText(fiber, domParent, anchor) {
   const text = fiber.pendingProps;
+  if (fiber.dom && fiber.memoizedProps === text) return;
   if (!fiber.dom) {
     const hydrated = currentRoot?.hydrating ? adoptTextDom(fiber, fiber.parent, text) : false;
     if (!hydrated) {
       fiber.dom = document.createTextNode(text);
       insertInto(domParent, fiber.dom, anchor);
     }
-  } else if (fiber.dom.data !== text) {
+  } else {
     ;
     fiber.dom.data = text;
   }
@@ -454,21 +503,30 @@ function renderHost(fiber, domParent, anchor) {
       insertInto(domParent, fiber.dom, anchor);
     }
     attachRef(fiber, fiber.dom);
-  } else {
+  } else if (prev !== props) {
     const el = fiber.dom;
-    for (const k in prev) {
-      if (!(k in props)) setProp(el, k, void 0, prev[k], isSvg);
-    }
+    let deferredEvents = null;
     for (const k in props) {
       if (isSelect && (k === "value" || k === "defaultValue")) continue;
-      if (isEventProp(k)) continue;
+      if (isEventProp(k)) {
+        if (prev[k] !== props[k]) {
+          deferredEvents ||= [];
+          deferredEvents.push(k);
+        }
+        continue;
+      }
       if (prev[k] !== props[k]) setProp(el, k, props[k], prev[k], isSvg);
     }
-    for (const k in props) {
-      if (!isEventProp(k)) continue;
-      if (prev[k] !== props[k]) setProp(el, k, props[k], prev[k], isSvg);
+    for (const k in prev) {
+      if (!(k in props)) setProp(el, k, void 0, prev[k], isSvg);
+    }
+    if (deferredEvents) {
+      for (let i = 0; i < deferredEvents.length; i++) {
+        const k = deferredEvents[i];
+        setProp(el, k, props[k], prev[k], isSvg);
+      }
     }
-    if (prev !== props) syncRefIfChanged(fiber, fiber.dom);
+    syncRefIfChanged(fiber, fiber.dom);
   }
   reconcileChildren(fiber, childrenToArray(props.children), fiber.dom, null);
   if (currentRoot?.hydrating) {

package/dist/dom/reconcile.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../src/dom/reconcile.ts"],
-  "sourcesContent": ["import {\n  FiberTag,\n  FiberFlag,\n  createFiber,\n  REACT_ELEMENT_TYPE,\n  REACT_LEGACY_ELEMENT_TYPE,\n  REACT_FRAGMENT_TYPE,\n  type Fiber,\n  type FiberRoot,\n  type ReactElement,\n  type ReactNode,\n  type Hook,\n  type Effect,\n} from '../core'\nimport {\n  ReactSharedInternals,\n  REACT_LAZY_TYPE,\n  REACT_STRICT_MODE_TYPE,\n  REACT_PROFILER_TYPE,\n} from '../react'\nimport { createHostNode, setProp } from './dom'\nimport { makeDispatcher } from './dispatcher'\nimport {\n  adoptHostDom,\n  adoptTextDom,\n  tryConsumeBoundary,\n  advanceCursorPast,\n  setHydrationCursor,\n  getHydrationCursor,\n  clearHydrationCursor,\n  HydrationCursor,\n  findHostParent as findHydrationHost,\n} from './features/hydration'\n\n// ---------------------------------------------------------------------------\n// Render scheduling\n// ---------------------------------------------------------------------------\n\nlet currentRoot: FiberRoot | null = null\nlet flushing = false\nlet isBatching = false\nconst pendingRoots = new Set<FiberRoot>()\n\n// Set by rerenderFiber to identify the exact memo-tagged fiber whose INTERNAL\n// state (hook update, useSyncExternalStore notification) triggered this render\n// pass. renderMemo checks this to bypass its prop-equality gate for that fiber.\n// Without the bypass, a memo bail would swallow state changes: React's memo is\n// only a parent-triggered gate \u2014 state-driven rerenders must always run the\n// inner function. Router-adjacent components (Outlet, Match, MatchInner) are\n// all memo-wrapped and subscribe to stores; missing this bypass breaks nav\n// content updates even though the URL changes.\nlet forceRerenderingFiber: Fiber | null = null\n\nexport function scheduleUpdate(fiber: Fiber): void {\n  // Drop updates scheduled on already-unmounted fibers. Subscribers (router,\n  // query, any external store) can fire after unmount if their cleanup was\n  // missed, and letting those reach rerenderFiber mounts zombie DOM into the\n  // old .parent's DOM (which stays reachable via the stale pointer).\n  if (fiber.unmounted) return\n  const root = findRoot(fiber)\n  if (!root) return\n  root.pending.add(fiber)\n  fiber.dirty = true\n  pendingRoots.add(root)\n  if (isBatching) return\n  if (!root.scheduled) {\n    root.scheduled = true\n    queueMicrotask(flushPending)\n  }\n}\n\nexport function flushSyncWork(fn: () => void): void {\n  const wasBatching = isBatching\n  isBatching = true\n  try {\n    fn()\n  } finally {\n    isBatching = wasBatching\n  }\n  flushPending()\n}\n\nexport function batchedUpdates<T>(fn: () => T): T {\n  const wasBatching = isBatching\n  isBatching = true\n  try {\n    return fn()\n  } finally {\n    isBatching = wasBatching\n    if (!wasBatching) flushPending()\n  }\n}\n\nfunction flushPending(): void {\n  if (flushing) return\n  flushing = true\n  try {\n    let guard = 0\n    while (pendingRoots.size > 0) {\n      if (++guard > 50) {\n        throw new Error('flushPending exceeded 50 iterations \u2014 suspected infinite update loop.')\n      }\n      const roots = [...pendingRoots]\n      pendingRoots.clear()\n      for (const root of roots) {\n        root.scheduled = false\n        // Render each pending fiber from shallowest first so an ancestor's\n        // cascade reaches descendants before we try to render them directly.\n        // Descendants rendered via cascade still have `dirty=true` (only\n        // rerenderFiber clears it); when we later reach them in this loop,\n        // rerenderFiber's own `if (!dirty) return` is our short-circuit. We\n        // previously filtered descendants of dirty ancestors here, but that\n        // loses updates whenever an ancestor's render doesn't actually reach\n        // the descendant \u2014 e.g. React.memo bailing on equal props. Keep all\n        // dirty fibers and let rerenderFiber de-dupe via its dirty check.\n        const pending = [...root.pending]\n        root.pending.clear()\n        pending.sort((a, b) => fiberDepth(a) - fiberDepth(b))\n        for (const fiber of pending) {\n          rerenderFiber(fiber, root)\n        }\n        runEffects(root)\n      }\n    }\n  } finally {\n    flushing = false\n  }\n}\n\nfunction fiberDepth(fiber: Fiber): number {\n  let d = 0\n  let p: Fiber | null = fiber.parent\n  while (p) {\n    d++\n    p = p.parent\n  }\n  return d\n}\n\nexport function findRoot(fiber: Fiber): FiberRoot | null {\n  let f: Fiber | null = fiber\n  while (f) {\n    if (f.root) return f.root\n    f = f.parent\n  }\n  return null\n}\n\n// ---------------------------------------------------------------------------\n// Entry points (called by createRoot)\n// ---------------------------------------------------------------------------\n\nexport function renderRoot(root: FiberRoot, children: ReactNode): void {\n  const rootFiber = root.current\n  rootFiber.pendingProps = { children }\n  currentRoot = root\n  try {\n    reconcileChildren(rootFiber, childrenToArray(children), root.container as Node, null)\n    rootFiber.memoizedProps = rootFiber.pendingProps\n    rootFiber.dirty = false\n  } finally {\n    currentRoot = null\n  }\n  runEffects(root)\n}\n\nfunction rerenderFiber(fiber: Fiber, root: FiberRoot): void {\n  if (!fiber.dirty) return\n  // Skip fibers that were unmounted between scheduling and flush. Without this,\n  // the flush loop re-enters a zombie fiber whose .parent is still set; its\n  // render mounts fresh DOM into the old parent's still-attached DOM (since\n  // unmountFiber only clears fiber.child, not fiber.parent). Visible as route\n  // content from a previous location staying on screen after nav, because a\n  // pending rerender on the old route's LibraryLandingPage (unmounted during\n  // Outlet's shallow-first render) still fires from root.pending.\n  if (fiber.unmounted) return\n  // Clear BEFORE rendering so a scheduleUpdate() triggered mid-render (e.g.\n  // error boundary catching a descendant throw) marks us dirty for the next\n  // flush iteration instead of being wiped out when render() completes.\n  fiber.dirty = false\n  currentRoot = root\n  // If this rerender is resuming a hydration that was deferred by a suspension,\n  // re-activate hydration mode for its duration so descendants adopt DOM\n  // instead of re-creating it.\n  const resumeHydration =\n    fiber.memoizedState && (fiber.memoizedState as any)._pendingHydration === true\n  const prevHydrating = root.hydrating\n  if (resumeHydration) {\n    delete (fiber.memoizedState as any)._pendingHydration\n    root.hydrating = true\n  }\n  const prevForcing = forceRerenderingFiber\n  forceRerenderingFiber = fiber\n  try {\n    renderFiber(fiber, getHostParent(fiber), getAnchor(fiber))\n  } finally {\n    forceRerenderingFiber = prevForcing\n    if (resumeHydration) {\n      root.hydrating = prevHydrating\n      // Deferred hydration completed \u2014 detach the preserved cursor so future\n      // updates (post-hydration state changes) don't try to adopt stale DOM.\n      clearHydrationCursor(fiber)\n    }\n    currentRoot = null\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Element \u2192 children normalization\n// ---------------------------------------------------------------------------\n\ntype TextChild = { _text: string }\ntype NormalizedChild = ReactElement | TextChild | null\n\n// NEVER use `'_text' in child` to distinguish text wrappers from elements.\n// TanStack's RSC renderable proxies (createRscProxy with renderable: true) are\n// Proxy wrappers around real React elements whose `has` trap returns `true`\n// for ANY string key \u2014 so `'_text' in rscProxy` is TRUE even though the proxy\n// is an element. That misidentification set a Text fiber's `pendingProps` to\n// `child._text` (another chained RSC proxy), which then rendered as\n// `[object Object]` when createTextNode stringified the element. React\n// elements always carry `$$typeof`; our text wrapper never does \u2014 so the\n// presence of `$$typeof` is the invariant we rely on.\nfunction isTextChild(child: Exclude<NormalizedChild, null>): child is TextChild {\n  return (child as any).$$typeof === undefined\n}\n\nexport function childrenToArray(children: ReactNode): NormalizedChild[] {\n  const out: NormalizedChild[] = []\n  pushChildren(children, out)\n  return out\n}\n\nfunction pushChildren(node: ReactNode, out: NormalizedChild[]): void {\n  if (node == null || typeof node === 'boolean') return\n  if (typeof node === 'string' || typeof node === 'number') {\n    // Empty strings render no text node (matches React + the `<!-- -->`\n    // separator elision on the SSR side so server/client agree).\n    if (node === '') return\n    out.push({ _text: '' + node })\n    return\n  }\n  if (Array.isArray(node)) {\n    for (let i = 0; i < node.length; i++) pushChildren(node[i], out)\n    return\n  }\n  if (isIterable(node)) {\n    for (const item of node as Iterable<ReactNode>) pushChildren(item, out)\n    return\n  }\n  if (typeof node === 'object') {\n    const t = (node as any).$$typeof\n    if (ACCEPTED_ELEMENT_MARKERS.has(t)) {\n      out.push(node as ReactElement)\n      return\n    }\n    // Raw React.lazy as a child. RSC Flight encodes 'use client' components\n    // (CodeBlock, CodeExplorer, etc.) as bare Lazy objects in the tree, not\n    // wrapped in REACT_ELEMENT_TYPE. Dropping them made code snippets\n    // disappear from docs pages. The RSC decoder pre-awaits payloads via\n    // `awaitLazyElements`, so by render time the status is 'fulfilled' and\n    // `_init()` returns the resolved element synchronously.\n    if (t === REACT_LAZY_TYPE) {\n      const lazy = node as any\n      const resolved = lazy._init(lazy._payload)\n      pushChildren(resolved, out)\n      return\n    }\n  }\n}\n\nfunction isIterable(obj: any): boolean {\n  return obj != null && typeof obj !== 'string' && typeof obj[Symbol.iterator] === 'function'\n}\n\nfunction getKeyOf(child: NormalizedChild, index: number): string {\n  if (!child) return 'n' + index\n  if (isTextChild(child)) return '$t' + index\n  if (child.key != null) return 'k' + child.key\n  return 'i' + index\n}\n\nfunction sameType(fiber: Fiber, child: NormalizedChild): boolean {\n  if (!child) return false\n  if (isTextChild(child)) return fiber.tag === FiberTag.Text\n  return fiber.type === child.type && sameKey(fiber.key, child.key)\n}\n\nfunction sameKey(a: string | null, b: string | null | undefined): boolean {\n  return (a ?? null) === (b ?? null)\n}\n\n// ---------------------------------------------------------------------------\n// Fiber creation\n// ---------------------------------------------------------------------------\n\nfunction fiberFromChild(child: NormalizedChild, parent: Fiber): Fiber {\n  if (!child) return createFiber(FiberTag.Fragment, null, null)\n  if (isTextChild(child)) {\n    const f = createFiber(FiberTag.Text, null, null)\n    f.pendingProps = child._text\n    f.parent = parent\n    return f\n  }\n  const type = child.type\n  let tag: FiberTag = FiberTag.Host\n  const marker = type && (type as any).$$typeof\n  if (typeof type === 'string') tag = FiberTag.Host\n  else if (type === REACT_FRAGMENT_TYPE) tag = FiberTag.Fragment\n  else if (type === REACT_STRICT_MODE_TYPE || type === REACT_PROFILER_TYPE) tag = FiberTag.Fragment\n  else {\n    // Feature-registered type matchers (Portal, future extractions). Features\n    // that carry the symbol as element.type directly (rather than wrapping in\n    // REACT_ELEMENT_TYPE) match here by type identity.\n    let matched: FiberTag | null = null\n    for (const m of TYPE_MATCHERS) {\n      matched = m(type, marker)\n      if (matched !== null) break\n    }\n    if (matched !== null) tag = matched\n    else if (typeof type === 'function') {\n      tag = type.prototype && type.prototype.isReactComponent ? FiberTag.Class : FiberTag.Function\n    }\n  }\n  const f = createFiber(tag, type, child.key ?? null)\n  f.ref = (child as any).ref ?? null\n  f.pendingProps = child.props\n  f.parent = parent\n  return f\n}\n\n// ---------------------------------------------------------------------------\n// Reconciliation\n// ---------------------------------------------------------------------------\n\n/**\n * Reconcile a parent fiber's child list against new normalized children.\n * Mutates parent.child and the sibling chain.\n * Mounts new host DOM into `domParent` before `anchor` (or appends if anchor === null).\n */\nexport function reconcileChildren(\n  parent: Fiber,\n  newChildren: NormalizedChild[],\n  domParent: Node,\n  anchor: Node | null,\n): void {\n  const existing = collectChildren(parent)\n  const keyed = new Map<string, Fiber>()\n  for (const f of existing) {\n    if (f.key != null) keyed.set('k' + f.key, f)\n  }\n\n  let prevNewFiber: Fiber | null = null\n  const claimed = new Set<Fiber>()\n  let structurallyChanged = false\n  // Budget-guided positional matching. We walk `existing` (unkeyed only) with a\n  // single cursor `existingIdx` and, on a type mismatch, choose insert vs delete\n  // based on the remaining length delta (`budget`):\n  //   budget > 0: more new than old remain \u2192 treat slot as an INSERTION: keep\n  //               the old cursor and create a fresh fiber for new[i].\n  //   budget < 0: more old than new remain \u2192 treat slot as a DELETION: advance\n  //               the old cursor past the mismatched fiber (it'll be unmounted\n  //               in the unclaimed pass) and retry.\n  //   budget == 0: equal remaining \u2192 treat as REPLACE by preferring delete\n  //               until budget flips positive or we hit a match.\n  // This avoids greedy forward scans that steal a later same-type fiber for a\n  // newly inserted leading sibling (e.g. smallMenu flipping null \u2192 <div>\n  // stealing the content <div>'s fiber and tearing down the drawer fragment).\n  let existingIdx = 0\n  let unkeyedOld = 0\n  for (const f of existing) if (f.key == null) unkeyedOld++\n  let unkeyedNew = 0\n  for (const c of newChildren) if (c != null) unkeyedNew++\n  let budget = unkeyedNew - unkeyedOld\n\n  // Pass 1 (this loop): match against existing fibers and build the sibling\n  // chain. Pass 2 (after the loop) renders each fiber with the correct\n  // per-child anchor \u2014 the firstDomNode of its next still-mounted sibling,\n  // or the parent's own anchor for the rightmost. Without per-child anchors\n  // a child whose render output type changes from no-DOM (Portal, null) to\n  // an in-flow host gets appended to the end of domParent (every child\n  // would otherwise share the parent's anchor) and never moves before its\n  // later siblings. Hit by the t3code Sidebar swap from a portal-rendering\n  // <Sheet> to a <div data-slot=sidebar> when isMobile flips during a\n  // Provider re-render.\n  for (let i = 0; i < newChildren.length; i++) {\n    const child = newChildren[i]\n    if (child == null) continue\n\n    let match: Fiber | null = null\n\n    // key-based match\n    if (child && typeof child === 'object' && !isTextChild(child) && (child as ReactElement).key != null) {\n      const k = 'k' + (child as ReactElement).key\n      const m = keyed.get(k)\n      if (m && m.type === (child as ReactElement).type) {\n        match = m\n        keyed.delete(k)\n      }\n    }\n\n    if (!match) {\n      while (existingIdx < existing.length) {\n        const cand = existing[existingIdx]!\n        if (claimed.has(cand) || cand.key != null) {\n          existingIdx++\n          continue\n        }\n        if (sameType(cand, child)) {\n          match = cand\n          existingIdx++\n          break\n        }\n        // Type mismatch at the cursor. Resolve via budget.\n        if (budget > 0) {\n          // Insertion: leave cand in place, create new for child.\n          break\n        }\n        // Deletion (or replace-as-delete-first): advance past cand. It remains\n        // unclaimed and will be unmounted at the end.\n        existingIdx++\n        budget++\n      }\n    }\n\n    // Detect reorder: matched fiber is not at its original position\n    if (match && existing[i] !== match) structurallyChanged = true\n\n    let fiber: Fiber\n    if (match) {\n      claimed.add(match)\n      fiber = match\n      if (isTextChild(child!)) {\n        fiber.pendingProps = child._text\n      } else {\n        fiber.type = (child as ReactElement).type\n        fiber.pendingProps = (child as ReactElement).props\n        fiber.ref = (child as any).ref ?? null\n      }\n    } else {\n      fiber = fiberFromChild(child, parent)\n      structurallyChanged = true\n      if (budget > 0) budget--\n    }\n\n    fiber.parent = parent\n    fiber.sibling = null\n    if (prevNewFiber) prevNewFiber.sibling = fiber\n    else parent.child = fiber\n    prevNewFiber = fiber\n  }\n\n  // Pass 2: walk the sibling chain we just built and render each fiber\n  // forward with the correct per-child anchor. During hydration the cursor\n  // walks DOM forward and each renderFiber adopts the next existing node,\n  // so per-child anchors are moot \u2014 fall back to the parent's anchor.\n  const hydrating = !!currentRoot?.hydrating\n  for (let f: Fiber | null = parent.child; f; f = f.sibling) {\n    let a = anchor\n    if (!hydrating) {\n      // Find the firstDomNode of the next still-mounted sibling, if any.\n      for (let s: Fiber | null = f.sibling; s; s = s.sibling) {\n        const d = firstDomNode(s)\n        if (d && d.parentNode === domParent) { a = d; break }\n      }\n    }\n    renderFiber(f, domParent, a)\n  }\n\n  if (!prevNewFiber) parent.child = null\n  else prevNewFiber.sibling = null\n\n  // Head content is additive \u2014 server may inject metadata/stylesheets (Vite\n  // dev styles, Sentry, analytics) that aren't in the React tree. Unmounting\n  // them on every reconcile thrashes styles and causes flash of unstyled\n  // content. Keep existing head children that weren't matched this pass.\n  const parentIsHeadHost =\n    parent.tag === FiberTag.Host &&\n    typeof parent.type === 'string' &&\n    (parent.type as string).toLowerCase() === 'head'\n\n  if (!parentIsHeadHost) {\n    // Unmount unclaimed\n    for (const f of existing) {\n      if (!claimed.has(f)) {\n        unmountFiber(f, domParent)\n        structurallyChanged = true\n      }\n    }\n    // Leftover keyed\n    for (const f of keyed.values()) {\n      if (!claimed.has(f)) {\n        unmountFiber(f, domParent)\n        structurallyChanged = true\n      }\n    }\n  }\n\n  // During hydration, DOM is already in document order from the cursor-driven\n  // adoption walk. Running placeChildrenInOrder here would reappend nodes to\n  // the end of domParent when the true anchor (often an end marker comment)\n  // isn't reflected in `anchor`. Skip it in hydration mode.\n  //\n  // For <head>, skip always \u2014 HeadContent re-renders routinely (route match\n  // changes, providers updating), and reordering every <link>/<style>/<meta>\n  // on each re-render causes stylesheet flash and re-download. Head element\n  // ordering is semantically fluid; the browser doesn't care about exact\n  // order within <head>.\n  const parentIsHead =\n    (domParent as Element).nodeType === 1 &&\n    (domParent as Element).tagName.toLowerCase() === 'head'\n  if (structurallyChanged && !currentRoot?.hydrating && !parentIsHead) {\n    placeChildrenInOrder(parent, domParent, anchor)\n  }\n}\n\nfunction placeChildrenInOrder(parent: Fiber, domParent: Node, anchor: Node | null): void {\n  const doms: Node[] = []\n  let c = parent.child\n  while (c) {\n    collectHostDoms(c, doms)\n    c = c.sibling\n  }\n\n  // Pre-check: if our fiber-owned DOM is already in document order within\n  // domParent AND the trailing anchor matches, no reorder is needed. This is\n  // the common case on stable re-renders, and avoids detaching/re-attaching\n  // subtrees (which cancels CSS animations and triggers layout).\n  if (doms.length > 0) {\n    let current: Node | null = doms[0]!\n    let inOrder = current.parentNode === domParent\n    for (let i = 1; inOrder && i < doms.length; i++) {\n      current = current!.nextSibling\n      // Skip foreign nodes (SSR-injected scripts, dev-styles) between owned\n      // fiber DOMs \u2014 they should stay where they are.\n      while (current && !doms.includes(current as Node)) {\n        current = current.nextSibling\n      }\n      if (current !== doms[i]) inOrder = false\n    }\n    // Also verify the LAST dom's next sibling lines up with `anchor`. A\n    // single-dom collection (or correctly-internally-ordered doms) can sit\n    // at the WRONG absolute position in domParent and still pass the\n    // relative-order check above. This happens when a fiber's render output\n    // changes from no-DOM (e.g. a Portal-using <Sheet>, or null) to an\n    // in-flow host element: the new host is appended to the end of\n    // domParent (because the parent reconcileChildren loop hands every\n    // child the same anchor \u2014 typically null), and without this trailing\n    // check it would never get moved before its later siblings.\n    if (inOrder) {\n      let last: Node | null = doms[doms.length - 1]!.nextSibling\n      while (last && !doms.includes(last as Node) && last !== anchor) {\n        last = last.nextSibling\n      }\n      if (last !== anchor) inOrder = false\n    }\n    if (inOrder) return\n  }\n\n  // Reverse-iterate, anchoring each node before the one that should follow it.\n  // This works because by the time we're placing doms[i], doms[i+1] is already\n  // in its final slot. Forward iteration is buggy: insertBefore(doms[i],\n  // doms[i+1]) pulls doms[i] forward past any nodes that SHOULD move behind\n  // it, leaving those nodes mis-anchored (app-starter Analyze/Lucky swap, npm\n  // stats library dropdown reorder \u2014 both reported by users).\n  //\n  // Concrete example: start=[A, R, L], target=[A, L, R]. Forward pass gives\n  // [L, A, R] (wrong). Reverse pass moves R to end, then L and A are already\n  // correct \u2014 1 move, matches target.\n  //\n  // Skip nodes already in their target position so CSS transitions on stable\n  // siblings aren't cancelled (e.g. drawer slide animation).\n  for (let i = doms.length - 1; i >= 0; i--) {\n    const d = doms[i]!\n    const targetNext: Node | null = i + 1 < doms.length ? doms[i + 1]! : anchor\n    if (d.parentNode !== domParent || d.nextSibling !== targetNext) {\n      domParent.insertBefore(d, targetNext)\n    }\n  }\n}\n\nfunction collectHostDoms(fiber: Fiber, out: Node[]): void {\n  if (fiber.tag === FiberTag.Host || fiber.tag === FiberTag.Text) {\n    if (fiber.dom) out.push(fiber.dom)\n    return\n  }\n  if (fiber.tag === FiberTag.Portal) return\n  let c = fiber.child\n  while (c) {\n    collectHostDoms(c, out)\n    c = c.sibling\n  }\n}\n\nfunction collectChildren(parent: Fiber): Fiber[] {\n  const out: Fiber[] = []\n  let c = parent.child\n  while (c) {\n    out.push(c)\n    c = c.sibling\n  }\n  return out\n}\n\n// ---------------------------------------------------------------------------\n// Rendering per fiber tag\n// ---------------------------------------------------------------------------\n\nexport type RenderFn = (fiber: Fiber, domParent: Node, anchor: Node | null) => void\nexport type TypeMatcher = (type: any, marker: any) => FiberTag | null\n\n// Mutable renderer registry indexed by FiberTag. Feature modules install their\n// renderer via registerRenderer(); unregistered features render as no-ops. The\n// initial registrations below rely on function-declaration hoisting \u2014 every\n// render* function is declared with `function` later in this file.\nconst RENDERERS: Array<RenderFn | undefined> = new Array(13)\n\n// Element-marker allowlist for child normalization (pushChildren). Core-always\n// markers are seeded here; features add their own via registerElementMarker.\nconst ACCEPTED_ELEMENT_MARKERS = new Set<symbol>([\n  REACT_ELEMENT_TYPE as symbol,\n  REACT_LEGACY_ELEMENT_TYPE as symbol,\n])\n\n// Type-to-tag matchers tried in registration order from fiberFromChild's\n// fallback branch. Features register here for element types that aren't\n// marker-based (e.g. Portal, where element.type IS the symbol).\nconst TYPE_MATCHERS: TypeMatcher[] = []\n\nexport function registerRenderer(tag: FiberTag, fn: RenderFn): void {\n  RENDERERS[tag] = fn\n}\n\nexport function registerTypeMatcher(m: TypeMatcher): void {\n  TYPE_MATCHERS.push(m)\n}\n\nexport function registerElementMarker(sym: symbol): void {\n  ACCEPTED_ELEMENT_MARKERS.add(sym)\n}\n\n// Accessor + scoped setter for the module-level `currentRoot`. Feature modules\n// need these to participate in the render loop (e.g. Suspense re-hydration\n// must temporarily set the root while rebuilding a boundary subtree).\nexport function getCurrentRoot(): FiberRoot | null {\n  return currentRoot\n}\n\nexport function withCurrentRoot<T>(root: FiberRoot | null, fn: () => T): T {\n  const prev = currentRoot\n  currentRoot = root\n  try {\n    return fn()\n  } finally {\n    currentRoot = prev\n  }\n}\n\n// The memo feature uses this to bypass its prop-equality gate on state-driven\n// rerenders of the memoized fiber itself (hook update / subscribed store),\n// where props haven't changed by definition.\nexport function getForceRerenderingFiber(): Fiber | null {\n  return forceRerenderingFiber\n}\n\nregisterRenderer(FiberTag.Text, renderText)\nregisterRenderer(FiberTag.Host, renderHost)\nregisterRenderer(FiberTag.Function, renderFunction)\nregisterRenderer(FiberTag.Fragment, renderFragment)\n\nexport function renderFiber(fiber: Fiber, domParent: Node, anchor: Node | null): void {\n  const fn = RENDERERS[fiber.tag]\n  if (fn) fn(fiber, domParent, anchor)\n}\n\nfunction renderText(fiber: Fiber, domParent: Node, anchor: Node | null): void {\n  const text = fiber.pendingProps as string\n  if (!fiber.dom) {\n    const hydrated = currentRoot?.hydrating ? adoptTextDom(fiber, fiber.parent!, text) : false\n    if (!hydrated) {\n      fiber.dom = document.createTextNode(text)\n      insertInto(domParent, fiber.dom, anchor)\n    }\n  } else if ((fiber.dom as Text).data !== text) {\n    ;(fiber.dom as Text).data = text\n  }\n  fiber.memoizedProps = text\n  // dirty cleared at rerender start; leaving true lets mid-render schedule persist\n}\n\nfunction renderHost(fiber: Fiber, domParent: Node, anchor: Node | null): void {\n  const props = fiber.pendingProps ?? {}\n  const prev = fiber.memoizedProps ?? {}\n  const type = fiber.type as string\n  const isSvg = type === 'svg' || (domParent as Element).namespaceURI === 'http://www.w3.org/2000/svg'\n\n  // <select value> must be applied AFTER children mount \u2014 setting `.value`\n  // on a `<select>` with no matching `<option>` yet resets it to empty. Same\n  // for `defaultValue` on first mount. Stash and replay.\n  const isSelect = type === 'select'\n  const deferredSelectValue =\n    isSelect && (props.value !== undefined || props.defaultValue !== undefined)\n      ? props.value !== undefined ? props.value : props.defaultValue\n      : undefined\n\n  if (!fiber.dom) {\n    const hydrated = currentRoot?.hydrating ? adoptHostDom(fiber, fiber.parent!) : false\n    if (!hydrated) {\n      fiber.dom = createHostNode(type, isSvg)\n      // Two passes so form-control attributes (notably <input type>) are in\n      // place before event handlers attach. setEventHandler reads the\n      // element's runtime state to decide the DOM event name (e.g. onChange\n      // \u2192 `input` vs `change`); binding before `type` is applied would\n      // attach to the wrong event for checkbox/radio/file inputs.\n      for (const k in props) {\n        if (isSelect && (k === 'value' || k === 'defaultValue')) continue\n        if (isEventProp(k)) continue\n        setProp(fiber.dom as Element, k, props[k], undefined, isSvg)\n      }\n      for (const k in props) {\n        if (!isEventProp(k)) continue\n        setProp(fiber.dom as Element, k, props[k], undefined, isSvg)\n      }\n      insertInto(domParent, fiber.dom, anchor)\n    }\n    attachRef(fiber, fiber.dom)\n  } else {\n    const el = fiber.dom as Element\n    for (const k in prev) {\n      if (!(k in props)) setProp(el, k, undefined, prev[k], isSvg)\n    }\n    // Non-event props first for the same reason as above: a `type` change\n    // must land before we ask setEventHandler to resolve the DOM event for\n    // `onChange`.\n    for (const k in props) {\n      if (isSelect && (k === 'value' || k === 'defaultValue')) continue\n      if (isEventProp(k)) continue\n      if (prev[k] !== props[k]) setProp(el, k, props[k], prev[k], isSvg)\n    }\n    for (const k in props) {\n      if (!isEventProp(k)) continue\n      if (prev[k] !== props[k]) setProp(el, k, props[k], prev[k], isSvg)\n    }\n    if (prev !== props) syncRefIfChanged(fiber, fiber.dom)\n  }\n\n  // Children go into this DOM node\n  reconcileChildren(fiber, childrenToArray(props.children), fiber.dom!, null)\n\n  // During hydration, if after reconciling all client-expected children we\n  // still have server DOM left in the cursor for this host, that's a\n  // structural mismatch (server produced more than client wants). Report.\n  // <head>/<html> are position-insensitive \u2014 leftover here is normal\n  // (Vite dev-style injections, SSR-only scripts, etc.).\n  if (currentRoot?.hydrating) {\n    const parentTag = (fiber.type as string).toLowerCase()\n    if (parentTag !== 'head' && parentTag !== 'html') {\n      const cursor = getHydrationCursor(fiber)\n      if (cursor) {\n        const leftover = cursor.remaining().filter(\n          (n) => n.nodeType === 1 || n.nodeType === 3,\n        )\n        if (leftover.length > 0 && currentRoot.onRecoverableError) {\n          currentRoot.onRecoverableError(\n            new Error(\n              `Hydration mismatch: server rendered ${leftover.length} extra ` +\n                `${leftover.length === 1 ? 'node' : 'nodes'} inside <${parentTag}> ` +\n                `that the client tree did not.`,\n            ),\n          )\n          for (const n of leftover) n.parentNode?.removeChild(n)\n        }\n      }\n    }\n  }\n\n  // Apply <select> value after options are mounted.\n  if (isSelect && deferredSelectValue !== undefined) {\n    const select = fiber.dom as HTMLSelectElement\n    if (Array.isArray(deferredSelectValue)) {\n      const asStrings = deferredSelectValue.map((v) => '' + v)\n      for (const opt of Array.from(select.options)) {\n        opt.selected = asStrings.includes(opt.value)\n      }\n    } else {\n      select.value = '' + deferredSelectValue\n    }\n  }\n\n  fiber.memoizedProps = props\n  // dirty cleared at rerender start; leaving true lets mid-render schedule persist\n}\n\nfunction renderFunction(fiber: Fiber, domParent: Node, anchor: Node | null): void {\n  const prevDispatcher = ReactSharedInternals.H\n  const prevFiber = ReactSharedInternals.currentFiber\n  const prevHook = ReactSharedInternals.currentHook\n  const prevIndex = ReactSharedInternals.hookIndex\n\n  ReactSharedInternals.H = makeDispatcher()\n  ReactSharedInternals.currentFiber = fiber\n  ReactSharedInternals.currentHook = null\n  ReactSharedInternals.hookIndex = 0\n\n  let rendered: ReactNode\n  let deferredForHydration = false\n  try {\n    rendered = (fiber.type as Function)(fiber.pendingProps ?? {})\n  } catch (e: any) {\n    if (isThenable(e)) {\n      if (currentRoot?.hydrating) {\n        // Suspension during initial hydration. Leave the existing DOM alone\n        // and preserve the in-scope hydration cursor on THIS fiber so it\n        // survives the synchronous endHydration() that fires when the initial\n        // hydrateRoot() call returns. When the promise settles, the fiber\n        // re-renders (see rerenderFiber) with hydration re-activated and its\n        // descendants adopt DOM instead of creating new nodes.\n        const hostParent = findHydrationHost(fiber)\n        const inheritedCursor = getHydrationCursor(hostParent)\n        if (inheritedCursor) {\n          setHydrationCursor(fiber, inheritedCursor)\n        }\n        fiber.memoizedState = {\n          ...(fiber.memoizedState ?? {}),\n          _pendingHydration: true,\n        }\n        // Mirror renderLazy's guard: mark the nearest Suspense ancestor as\n        // awaiting hydration-resume, so any re-render of that Suspense (e.g.\n        // rehydrateBoundary fired by $RC, or an unrelated state update from a\n        // sibling) doesn't re-enter `tryChildren`, re-throw, and flip Suspense\n        // into its suspended+pending path \u2014 which would unmount our deferred\n        // subtree and remount a fallback on top of the SSR content. By\n        // pinning the Suspense to a \"hydration-suspended\" no-op until our\n        // resume fires, the deferred re-render owns the adoption pass.\n        let sus: Fiber | null = fiber.parent\n        while (sus && sus.tag !== FiberTag.Suspense) sus = sus.parent\n        if (sus && sus.memoizedState) {\n          ;(sus.memoizedState as any)._awaitingLazyHydration = true\n        }\n        const clearAwait = () => {\n          if (sus && sus.memoizedState) {\n            ;(sus.memoizedState as any)._awaitingLazyHydration = false\n          }\n          scheduleUpdate(fiber)\n        }\n        e.then(clearAwait, clearAwait)\n        deferredForHydration = true\n      } else {\n        CAPABILITIES.handleSuspended(fiber, e)\n        rendered = null\n      }\n    } else {\n      handleErrorInRender(fiber, e)\n      return\n    }\n  } finally {\n    ReactSharedInternals.H = prevDispatcher\n    ReactSharedInternals.currentFiber = prevFiber\n    ReactSharedInternals.currentHook = prevHook\n    ReactSharedInternals.hookIndex = prevIndex\n  }\n\n  if (deferredForHydration) return\n\n  reconcileChildren(fiber, childrenToArray(rendered), domParent, anchor)\n  fiber.memoizedProps = fiber.pendingProps\n  // dirty cleared at rerender start; leaving true lets mid-render schedule persist\n}\n\nfunction hasAncestorHydrationCursor(_fiber: Fiber): boolean {\n  // Reserved for future per-Suspense-boundary hydration deferral. For now the\n  // top-level hydration path is all we need to special-case.\n  return false\n}\n\nfunction renderFragment(fiber: Fiber, domParent: Node, anchor: Node | null): void {\n  const props = fiber.pendingProps ?? {}\n  reconcileChildren(fiber, childrenToArray(props.children), domParent, anchor)\n  fiber.memoizedProps = props\n  // dirty cleared at rerender start; leaving true lets mid-render schedule persist\n}\n\n// ---------------------------------------------------------------------------\n// Error handling + default Suspense capability\n// ---------------------------------------------------------------------------\n\n// Default handler when the Suspense feature isn't installed: just schedule\n// a re-render when the thrown thenable settles. No boundary walk, no\n// fallback swap \u2014 children render empty during the pending window.\nfunction defaultHandleSuspended(fiber: Fiber, thenable: Promise<any>): void {\n  thenable.then(\n    () => scheduleUpdate(fiber),\n    () => scheduleUpdate(fiber),\n  )\n}\n\n// ---------------------------------------------------------------------------\n// Capability hooks \u2014 cross-cutting behaviors that features override.\n// Defaults here preserve today's behavior so the indirection is transparent\n// when all features are loaded. A feature's full-module can install its own\n// implementation via installCapability(); stubs leave the default in place,\n// where the default may intentionally degrade (e.g. a no-Context build's\n// readContext never walks the tree because no Provider fibers exist).\n// ---------------------------------------------------------------------------\n\nexport interface Capabilities {\n  handleSuspended: (fiber: Fiber, thenable: Promise<any>) => void\n  readContext: (fiber: Fiber, ctx: any) => any\n}\n\nconst CAPABILITIES: Capabilities = {\n  handleSuspended: defaultHandleSuspended,\n  readContext: defaultReadContext,\n}\n\nexport function installCapability<K extends keyof Capabilities>(\n  name: K,\n  fn: Capabilities[K],\n): void {\n  CAPABILITIES[name] = fn\n}\n\n// Wrapper for features that catch thrown thenables inside their render\n// functions. Delegates to the installed Suspense capability.\nexport function handleSuspended(fiber: Fiber, thenable: Promise<any>): void {\n  CAPABILITIES.handleSuspended(fiber, thenable)\n}\n\nexport function handleErrorInRender(fiber: Fiber, err: any): void {\n  // Bubble to nearest class boundary with getDerivedStateFromError / componentDidCatch\n  let f: Fiber | null = fiber.parent\n  while (f) {\n    if (f.tag === FiberTag.Class) {\n      const Ctor = f.type as any\n      const instance = f.stateNode\n      if (Ctor.getDerivedStateFromError) {\n        const update = Ctor.getDerivedStateFromError(err)\n        instance.state = { ...instance.state, ...update }\n      }\n      if (instance.componentDidCatch) {\n        try {\n          instance.componentDidCatch(err, { componentStack: '' })\n        } catch {}\n      }\n      scheduleUpdate(f)\n      return\n    }\n    f = f.parent\n  }\n  // No boundary \u2014 report to root\n  if (currentRoot?.onUncaughtError) currentRoot.onUncaughtError(err)\n  else throw err\n}\n\nexport function isThenable(x: any): x is Promise<any> {\n  return x != null && typeof x.then === 'function'\n}\n\n// ---------------------------------------------------------------------------\n// Unmount\n// ---------------------------------------------------------------------------\n\nfunction unmountFiber(fiber: Fiber, domParent: Node): void {\n  fiber.unmounted = true\n  // Recurse first\n  let c = fiber.child\n  while (c) {\n    const next = c.sibling\n    unmountFiber(c, fiber.tag === FiberTag.Host ? fiber.dom! : domParent)\n    c = next\n  }\n  fiber.child = null\n\n  // Run cleanups (effects + layout effects)\n  if (fiber.cleanups) {\n    for (const cleanup of fiber.cleanups) {\n      try {\n        cleanup()\n      } catch (e) {\n        if (currentRoot?.onRecoverableError) currentRoot.onRecoverableError(e)\n      }\n    }\n    fiber.cleanups = null\n  }\n\n  if (fiber.tag === FiberTag.Class && fiber.stateNode?.componentWillUnmount) {\n    try {\n      fiber.stateNode.componentWillUnmount()\n    } catch (e) {\n      if (currentRoot?.onRecoverableError) currentRoot.onRecoverableError(e)\n    }\n    fiber.stateNode._fiber = null\n    fiber.stateNode._enqueueUpdate = null\n    fiber.stateNode._forceUpdate = null\n  }\n\n  // Detach ref\n  if (fiber.ref) detachRef(fiber.ref)\n\n  // Remove DOM if host\n  if (fiber.tag === FiberTag.Host && fiber.dom && fiber.dom.parentNode) {\n    fiber.dom.parentNode.removeChild(fiber.dom)\n  } else if (fiber.tag === FiberTag.Text && fiber.dom && fiber.dom.parentNode) {\n    fiber.dom.parentNode.removeChild(fiber.dom)\n  }\n}\n\nexport function unmountAllChildren(parent: Fiber, domParent: Node): void {\n  let c = parent.child\n  while (c) {\n    const next = c.sibling\n    unmountFiber(c, domParent)\n    c = next\n  }\n  parent.child = null\n}\n\n// ---------------------------------------------------------------------------\n// DOM navigation helpers\n// ---------------------------------------------------------------------------\n\nfunction insertInto(parent: Node, node: Node, anchor: Node | null): void {\n  // Anchor may have been removed or moved since it was computed (mutations\n  // from unmount, boundary reveal, user code, HMR). If it's no longer a child\n  // of `parent`, fall back to append \u2014 trying to insertBefore a non-child\n  // throws NotFoundError and dev-loops the reconciler.\n  if (anchor && anchor.parentNode === parent) {\n    parent.insertBefore(node, anchor)\n  } else {\n    parent.appendChild(node)\n  }\n}\n\nfunction getHostParent(fiber: Fiber): Node {\n  let p = fiber.parent\n  while (p) {\n    if (p.tag === FiberTag.Host) return p.dom!\n    if (p.tag === FiberTag.Root)\n      return (p.stateNode as Node) || (p.dom as Node) || (p.root?.container as Node)\n    if (p.tag === FiberTag.Portal) {\n      // Portal renders its children into the `container` prop, not into any\n      // DOM element the portal fiber \"owns\". Read the container from the\n      // portal's own props so a rerenderFiber triggered on a descendant\n      // (e.g. a Floating-UI-positioned popper in a Radix Portal) finds its\n      // host parent \u2014 otherwise getHostParent returns undefined and the\n      // next renderHost crashes reading `.namespaceURI` on undefined.\n      const props = (p.pendingProps ?? p.memoizedProps) as { container?: Element } | null\n      return (props?.container as Node) || (p.stateNode as Node) || (p.dom as Node) || (p.root?.container as Node)\n    }\n    p = p.parent\n  }\n  throw new Error('No host parent found.')\n}\n\nfunction getAnchor(fiber: Fiber): Node | null {\n  // Return the first DOM node that comes after this fiber within the host parent\n  let f: Fiber | null = fiber.sibling\n  while (f) {\n    const d = firstDomNode(f)\n    if (d) return d\n    f = f.sibling\n  }\n  // Ascend\n  let p = fiber.parent\n  while (p && p.tag !== FiberTag.Host && p.tag !== FiberTag.Root && p.tag !== FiberTag.Portal) {\n    if (p.sibling) {\n      const d = firstDomNode(p.sibling)\n      if (d) return d\n    }\n    p = p.parent\n  }\n  return null\n}\n\nfunction firstDomNode(fiber: Fiber): Node | null {\n  if (fiber.tag === FiberTag.Host || fiber.tag === FiberTag.Text) return fiber.dom\n  let c = fiber.child\n  while (c) {\n    const d = firstDomNode(c)\n    if (d) return d\n    c = c.sibling\n  }\n  return null\n}\n\n// ---------------------------------------------------------------------------\n// Context read \u2014 exported for dispatcher.ts (useContext, use()). Delegates to\n// the installed capability so the Context feature can override with a walking\n// implementation that finds the nearest Provider fiber. When the feature is\n// stubbed, the default here returns ctx._currentValue \u2014 correct because no\n// Provider fibers exist in the tree (Provider element \u2192 Fragment via the\n// stub's type matcher).\n// ---------------------------------------------------------------------------\n\nexport function readContext(fiber: Fiber, ctx: any): any {\n  return CAPABILITIES.readContext(fiber, ctx)\n}\n\nfunction defaultReadContext(_fiber: Fiber, ctx: any): any {\n  return ctx._currentValue\n}\n\n// ---------------------------------------------------------------------------\n// Refs\n// ---------------------------------------------------------------------------\n\nfunction attachRef(fiber: Fiber, value: any): void {\n  const ref = fiber.ref ?? (fiber.pendingProps?.ref ?? null)\n  if (!ref) return\n  if (typeof ref === 'function') {\n    // Match React's commit-phase semantics: callback refs run after render\n    // (during the layout/commit phase), not during render. Calling them\n    // synchronously here breaks libraries that assert no event handlers run\n    // during render (e.g. base-ui's useStableCallback trampoline).\n    scheduleLifecycle(fiber, () => {\n      const cleanup = ref(value)\n      fiber.cleanups ||= []\n      fiber.cleanups.push(typeof cleanup === 'function' ? cleanup : () => ref(null))\n    })\n  } else {\n    ref.current = value\n  }\n}\n\nfunction syncRefIfChanged(fiber: Fiber, value: any): void {\n  const ref = fiber.ref ?? (fiber.pendingProps?.ref ?? null)\n  if (!ref) return\n  if (typeof ref === 'object' && ref.current !== value) ref.current = value\n}\n\nfunction detachRef(ref: any): void {\n  // Function refs are handled via fiber.cleanups (queued in attachRef during\n  // the commit phase): the cleanup either invokes the user-returned cleanup\n  // fn or calls ref(null). Calling ref(null) here would double-fire it.\n  if (ref && typeof ref === 'object') {\n    ref.current = null\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Effects\n// ---------------------------------------------------------------------------\n\nconst pendingEffects: Array<{ fiber: Fiber; effect: Effect }> = []\nconst pendingLayoutEffects: Array<{ fiber: Fiber; effect: Effect }> = []\nconst pendingLifecycles: Array<{ fiber: Fiber; fn: () => void }> = []\n\nexport function enqueueEffect(fiber: Fiber, effect: Effect): void {\n  if (effect.tag === 'layout' || effect.tag === 'insertion') {\n    pendingLayoutEffects.push({ fiber, effect })\n  } else {\n    pendingEffects.push({ fiber, effect })\n  }\n}\n\nexport function scheduleLifecycle(fiber: Fiber, fn: () => void): void {\n  pendingLifecycles.push({ fiber, fn })\n}\n\nexport function runEffects(root: FiberRoot): void {\n  // Layout effects synchronously\n  while (pendingLayoutEffects.length) {\n    const { fiber, effect } = pendingLayoutEffects.shift()!\n    runEffect(fiber, effect, root)\n  }\n  // Then lifecycles\n  while (pendingLifecycles.length) {\n    const { fn } = pendingLifecycles.shift()!\n    try {\n      fn()\n    } catch (e) {\n      if (root.onCaughtError) root.onCaughtError(e)\n    }\n  }\n  // Passive effects on microtask\n  if (pendingEffects.length) {\n    const batch = pendingEffects.splice(0)\n    queueMicrotask(() => {\n      for (const { fiber, effect } of batch) runEffect(fiber, effect, root)\n    })\n  }\n}\n\nfunction runEffect(fiber: Fiber, effect: Effect, root: FiberRoot): void {\n  try {\n    const cleanup = effect.create()\n    effect.destroy = typeof cleanup === 'function' ? cleanup : undefined\n    if (effect.destroy) {\n      fiber.cleanups ||= []\n      fiber.cleanups.push(effect.destroy)\n    }\n  } catch (e) {\n    if (root.onCaughtError) root.onCaughtError(e)\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Utilities\n// ---------------------------------------------------------------------------\n\nfunction isEventProp(name: string): boolean {\n  return (\n    name.length > 2 &&\n    name.charCodeAt(0) === 111 /* o */ &&\n    name.charCodeAt(1) === 110 /* n */ &&\n    name.charCodeAt(2) >= 65 /* 'A'-ish: any uppercase start (onClick, onChange, \u2026) */\n  )\n}\n\n"],
-  "mappings": ";AAAA;AAAA,EACE;AAAA,EAEA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OAOK;AACP;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OACK;AACP,SAAS,gBAAgB,eAAe;AACxC,SAAS,sBAAsB;AAC/B;AAAA,EACE;AAAA,EACA;AAAA,EAGA;AAAA,EACA;AAAA,EACA;AAAA,EAEA,kBAAkB;AAAA,OACb;AAMP,IAAI,cAAgC;AACpC,IAAI,WAAW;AACf,IAAI,aAAa;AACjB,IAAM,eAAe,oBAAI,IAAe;AAUxC,IAAI,wBAAsC;AAEnC,SAAS,eAAe,OAAoB;AAKjD,MAAI,MAAM,UAAW;AACrB,QAAM,OAAO,SAAS,KAAK;AAC3B,MAAI,CAAC,KAAM;AACX,OAAK,QAAQ,IAAI,KAAK;AACtB,QAAM,QAAQ;AACd,eAAa,IAAI,IAAI;AACrB,MAAI,WAAY;AAChB,MAAI,CAAC,KAAK,WAAW;AACnB,SAAK,YAAY;AACjB,mBAAe,YAAY;AAAA,EAC7B;AACF;AAEO,SAAS,cAAc,IAAsB;AAClD,QAAM,cAAc;AACpB,eAAa;AACb,MAAI;AACF,OAAG;AAAA,EACL,UAAE;AACA,iBAAa;AAAA,EACf;AACA,eAAa;AACf;AAEO,SAAS,eAAkB,IAAgB;AAChD,QAAM,cAAc;AACpB,eAAa;AACb,MAAI;AACF,WAAO,GAAG;AAAA,EACZ,UAAE;AACA,iBAAa;AACb,QAAI,CAAC,YAAa,cAAa;AAAA,EACjC;AACF;AAEA,SAAS,eAAqB;AAC5B,MAAI,SAAU;AACd,aAAW;AACX,MAAI;AACF,QAAI,QAAQ;AACZ,WAAO,aAAa,OAAO,GAAG;AAC5B,UAAI,EAAE,QAAQ,IAAI;AAChB,cAAM,IAAI,MAAM,4EAAuE;AAAA,MACzF;AACA,YAAM,QAAQ,CAAC,GAAG,YAAY;AAC9B,mBAAa,MAAM;AACnB,iBAAW,QAAQ,OAAO;AACxB,aAAK,YAAY;AAUjB,cAAM,UAAU,CAAC,GAAG,KAAK,OAAO;AAChC,aAAK,QAAQ,MAAM;AACnB,gBAAQ,KAAK,CAAC,GAAG,MAAM,WAAW,CAAC,IAAI,WAAW,CAAC,CAAC;AACpD,mBAAW,SAAS,SAAS;AAC3B,wBAAc,OAAO,IAAI;AAAA,QAC3B;AACA,mBAAW,IAAI;AAAA,MACjB;AAAA,IACF;AAAA,EACF,UAAE;AACA,eAAW;AAAA,EACb;AACF;AAEA,SAAS,WAAW,OAAsB;AACxC,MAAI,IAAI;AACR,MAAI,IAAkB,MAAM;AAC5B,SAAO,GAAG;AACR;AACA,QAAI,EAAE;AAAA,EACR;AACA,SAAO;AACT;AAEO,SAAS,SAAS,OAAgC;AACvD,MAAI,IAAkB;AACtB,SAAO,GAAG;AACR,QAAI,EAAE,KAAM,QAAO,EAAE;AACrB,QAAI,EAAE;AAAA,EACR;AACA,SAAO;AACT;AAMO,SAAS,WAAW,MAAiB,UAA2B;AACrE,QAAM,YAAY,KAAK;AACvB,YAAU,eAAe,EAAE,SAAS;AACpC,gBAAc;AACd,MAAI;AACF,sBAAkB,WAAW,gBAAgB,QAAQ,GAAG,KAAK,WAAmB,IAAI;AACpF,cAAU,gBAAgB,UAAU;AACpC,cAAU,QAAQ;AAAA,EACpB,UAAE;AACA,kBAAc;AAAA,EAChB;AACA,aAAW,IAAI;AACjB;AAEA,SAAS,cAAc,OAAc,MAAuB;AAC1D,MAAI,CAAC,MAAM,MAAO;AAQlB,MAAI,MAAM,UAAW;AAIrB,QAAM,QAAQ;AACd,gBAAc;AAId,QAAM,kBACJ,MAAM,iBAAkB,MAAM,cAAsB,sBAAsB;AAC5E,QAAM,gBAAgB,KAAK;AAC3B,MAAI,iBAAiB;AACnB,WAAQ,MAAM,cAAsB;AACpC,SAAK,YAAY;AAAA,EACnB;AACA,QAAM,cAAc;AACpB,0BAAwB;AACxB,MAAI;AACF,gBAAY,OAAO,cAAc,KAAK,GAAG,UAAU,KAAK,CAAC;AAAA,EAC3D,UAAE;AACA,4BAAwB;AACxB,QAAI,iBAAiB;AACnB,WAAK,YAAY;AAGjB,2BAAqB,KAAK;AAAA,IAC5B;AACA,kBAAc;AAAA,EAChB;AACF;AAkBA,SAAS,YAAY,OAA2D;AAC9E,SAAQ,MAAc,aAAa;AACrC;AAEO,SAAS,gBAAgB,UAAwC;AACtE,QAAM,MAAyB,CAAC;AAChC,eAAa,UAAU,GAAG;AAC1B,SAAO;AACT;AAEA,SAAS,aAAa,MAAiB,KAA8B;AACnE,MAAI,QAAQ,QAAQ,OAAO,SAAS,UAAW;AAC/C,MAAI,OAAO,SAAS,YAAY,OAAO,SAAS,UAAU;AAGxD,QAAI,SAAS,GAAI;AACjB,QAAI,KAAK,EAAE,OAAO,KAAK,KAAK,CAAC;AAC7B;AAAA,EACF;AACA,MAAI,MAAM,QAAQ,IAAI,GAAG;AACvB,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,IAAK,cAAa,KAAK,CAAC,GAAG,GAAG;AAC/D;AAAA,EACF;AACA,MAAI,WAAW,IAAI,GAAG;AACpB,eAAW,QAAQ,KAA6B,cAAa,MAAM,GAAG;AACtE;AAAA,EACF;AACA,MAAI,OAAO,SAAS,UAAU;AAC5B,UAAM,IAAK,KAAa;AACxB,QAAI,yBAAyB,IAAI,CAAC,GAAG;AACnC,UAAI,KAAK,IAAoB;AAC7B;AAAA,IACF;AAOA,QAAI,MAAM,iBAAiB;AACzB,YAAM,OAAO;AACb,YAAM,WAAW,KAAK,MAAM,KAAK,QAAQ;AACzC,mBAAa,UAAU,GAAG;AAC1B;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,WAAW,KAAmB;AACrC,SAAO,OAAO,QAAQ,OAAO,QAAQ,YAAY,OAAO,IAAI,OAAO,QAAQ,MAAM;AACnF;AASA,SAAS,SAAS,OAAc,OAAiC;AAC/D,MAAI,CAAC,MAAO,QAAO;AACnB,MAAI,YAAY,KAAK,EAAG,QAAO,MAAM,QAAQ,SAAS;AACtD,SAAO,MAAM,SAAS,MAAM,QAAQ,QAAQ,MAAM,KAAK,MAAM,GAAG;AAClE;AAEA,SAAS,QAAQ,GAAkB,GAAuC;AACxE,UAAQ,KAAK,WAAW,KAAK;AAC/B;AAMA,SAAS,eAAe,OAAwB,QAAsB;AACpE,MAAI,CAAC,MAAO,QAAO,YAAY,SAAS,UAAU,MAAM,IAAI;AAC5D,MAAI,YAAY,KAAK,GAAG;AACtB,UAAMA,KAAI,YAAY,SAAS,MAAM,MAAM,IAAI;AAC/C,IAAAA,GAAE,eAAe,MAAM;AACvB,IAAAA,GAAE,SAAS;AACX,WAAOA;AAAA,EACT;AACA,QAAM,OAAO,MAAM;AACnB,MAAI,MAAgB,SAAS;AAC7B,QAAM,SAAS,QAAS,KAAa;AACrC,MAAI,OAAO,SAAS,SAAU,OAAM,SAAS;AAAA,WACpC,SAAS,oBAAqB,OAAM,SAAS;AAAA,WAC7C,SAAS,0BAA0B,SAAS,oBAAqB,OAAM,SAAS;AAAA,OACpF;AAIH,QAAI,UAA2B;AAC/B,eAAW,KAAK,eAAe;AAC7B,gBAAU,EAAE,MAAM,MAAM;AACxB,UAAI,YAAY,KAAM;AAAA,IACxB;AACA,QAAI,YAAY,KAAM,OAAM;AAAA,aACnB,OAAO,SAAS,YAAY;AACnC,YAAM,KAAK,aAAa,KAAK,UAAU,mBAAmB,SAAS,QAAQ,SAAS;AAAA,IACtF;AAAA,EACF;AACA,QAAM,IAAI,YAAY,KAAK,MAAM,MAAM,OAAO,IAAI;AAClD,IAAE,MAAO,MAAc,OAAO;AAC9B,IAAE,eAAe,MAAM;AACvB,IAAE,SAAS;AACX,SAAO;AACT;AAWO,SAAS,kBACd,QACA,aACA,WACA,QACM;AACN,QAAM,WAAW,gBAAgB,MAAM;AACvC,QAAM,QAAQ,oBAAI,IAAmB;AACrC,aAAW,KAAK,UAAU;AACxB,QAAI,EAAE,OAAO,KAAM,OAAM,IAAI,MAAM,EAAE,KAAK,CAAC;AAAA,EAC7C;AAEA,MAAI,eAA6B;AACjC,QAAM,UAAU,oBAAI,IAAW;AAC/B,MAAI,sBAAsB;AAc1B,MAAI,cAAc;AAClB,MAAI,aAAa;AACjB,aAAW,KAAK,SAAU,KAAI,EAAE,OAAO,KAAM;AAC7C,MAAI,aAAa;AACjB,aAAW,KAAK,YAAa,KAAI,KAAK,KAAM;AAC5C,MAAI,SAAS,aAAa;AAY1B,WAAS,IAAI,GAAG,IAAI,YAAY,QAAQ,KAAK;AAC3C,UAAM,QAAQ,YAAY,CAAC;AAC3B,QAAI,SAAS,KAAM;AAEnB,QAAI,QAAsB;AAG1B,QAAI,SAAS,OAAO,UAAU,YAAY,CAAC,YAAY,KAAK,KAAM,MAAuB,OAAO,MAAM;AACpG,YAAM,IAAI,MAAO,MAAuB;AACxC,YAAM,IAAI,MAAM,IAAI,CAAC;AACrB,UAAI,KAAK,EAAE,SAAU,MAAuB,MAAM;AAChD,gBAAQ;AACR,cAAM,OAAO,CAAC;AAAA,MAChB;AAAA,IACF;AAEA,QAAI,CAAC,OAAO;AACV,aAAO,cAAc,SAAS,QAAQ;AACpC,cAAM,OAAO,SAAS,WAAW;AACjC,YAAI,QAAQ,IAAI,IAAI,KAAK,KAAK,OAAO,MAAM;AACzC;AACA;AAAA,QACF;AACA,YAAI,SAAS,MAAM,KAAK,GAAG;AACzB,kBAAQ;AACR;AACA;AAAA,QACF;AAEA,YAAI,SAAS,GAAG;AAEd;AAAA,QACF;AAGA;AACA;AAAA,MACF;AAAA,IACF;AAGA,QAAI,SAAS,SAAS,CAAC,MAAM,MAAO,uBAAsB;AAE1D,QAAI;AACJ,QAAI,OAAO;AACT,cAAQ,IAAI,KAAK;AACjB,cAAQ;AACR,UAAI,YAAY,KAAM,GAAG;AACvB,cAAM,eAAe,MAAM;AAAA,MAC7B,OAAO;AACL,cAAM,OAAQ,MAAuB;AACrC,cAAM,eAAgB,MAAuB;AAC7C,cAAM,MAAO,MAAc,OAAO;AAAA,MACpC;AAAA,IACF,OAAO;AACL,cAAQ,eAAe,OAAO,MAAM;AACpC,4BAAsB;AACtB,UAAI,SAAS,EAAG;AAAA,IAClB;AAEA,UAAM,SAAS;AACf,UAAM,UAAU;AAChB,QAAI,aAAc,cAAa,UAAU;AAAA,QACpC,QAAO,QAAQ;AACpB,mBAAe;AAAA,EACjB;AAMA,QAAM,YAAY,CAAC,CAAC,aAAa;AACjC,WAAS,IAAkB,OAAO,OAAO,GAAG,IAAI,EAAE,SAAS;AACzD,QAAI,IAAI;AACR,QAAI,CAAC,WAAW;AAEd,eAAS,IAAkB,EAAE,SAAS,GAAG,IAAI,EAAE,SAAS;AACtD,cAAM,IAAI,aAAa,CAAC;AACxB,YAAI,KAAK,EAAE,eAAe,WAAW;AAAE,cAAI;AAAG;AAAA,QAAM;AAAA,MACtD;AAAA,IACF;AACA,gBAAY,GAAG,WAAW,CAAC;AAAA,EAC7B;AAEA,MAAI,CAAC,aAAc,QAAO,QAAQ;AAAA,MAC7B,cAAa,UAAU;AAM5B,QAAM,mBACJ,OAAO,QAAQ,SAAS,QACxB,OAAO,OAAO,SAAS,YACtB,OAAO,KAAgB,YAAY,MAAM;AAE5C,MAAI,CAAC,kBAAkB;AAErB,eAAW,KAAK,UAAU;AACxB,UAAI,CAAC,QAAQ,IAAI,CAAC,GAAG;AACnB,qBAAa,GAAG,SAAS;AACzB,8BAAsB;AAAA,MACxB;AAAA,IACF;AAEA,eAAW,KAAK,MAAM,OAAO,GAAG;AAC9B,UAAI,CAAC,QAAQ,IAAI,CAAC,GAAG;AACnB,qBAAa,GAAG,SAAS;AACzB,8BAAsB;AAAA,MACxB;AAAA,IACF;AAAA,EACF;AAYA,QAAM,eACH,UAAsB,aAAa,KACnC,UAAsB,QAAQ,YAAY,MAAM;AACnD,MAAI,uBAAuB,CAAC,aAAa,aAAa,CAAC,cAAc;AACnE,yBAAqB,QAAQ,WAAW,MAAM;AAAA,EAChD;AACF;AAEA,SAAS,qBAAqB,QAAe,WAAiB,QAA2B;AACvF,QAAM,OAAe,CAAC;AACtB,MAAI,IAAI,OAAO;AACf,SAAO,GAAG;AACR,oBAAgB,GAAG,IAAI;AACvB,QAAI,EAAE;AAAA,EACR;AAMA,MAAI,KAAK,SAAS,GAAG;AACnB,QAAI,UAAuB,KAAK,CAAC;AACjC,QAAI,UAAU,QAAQ,eAAe;AACrC,aAAS,IAAI,GAAG,WAAW,IAAI,KAAK,QAAQ,KAAK;AAC/C,gBAAU,QAAS;AAGnB,aAAO,WAAW,CAAC,KAAK,SAAS,OAAe,GAAG;AACjD,kBAAU,QAAQ;AAAA,MACpB;AACA,UAAI,YAAY,KAAK,CAAC,EAAG,WAAU;AAAA,IACrC;AAUA,QAAI,SAAS;AACX,UAAI,OAAoB,KAAK,KAAK,SAAS,CAAC,EAAG;AAC/C,aAAO,QAAQ,CAAC,KAAK,SAAS,IAAY,KAAK,SAAS,QAAQ;AAC9D,eAAO,KAAK;AAAA,MACd;AACA,UAAI,SAAS,OAAQ,WAAU;AAAA,IACjC;AACA,QAAI,QAAS;AAAA,EACf;AAeA,WAAS,IAAI,KAAK,SAAS,GAAG,KAAK,GAAG,KAAK;AACzC,UAAM,IAAI,KAAK,CAAC;AAChB,UAAM,aAA0B,IAAI,IAAI,KAAK,SAAS,KAAK,IAAI,CAAC,IAAK;AACrE,QAAI,EAAE,eAAe,aAAa,EAAE,gBAAgB,YAAY;AAC9D,gBAAU,aAAa,GAAG,UAAU;AAAA,IACtC;AAAA,EACF;AACF;AAEA,SAAS,gBAAgB,OAAc,KAAmB;AACxD,MAAI,MAAM,QAAQ,SAAS,QAAQ,MAAM,QAAQ,SAAS,MAAM;AAC9D,QAAI,MAAM,IAAK,KAAI,KAAK,MAAM,GAAG;AACjC;AAAA,EACF;AACA,MAAI,MAAM,QAAQ,SAAS,OAAQ;AACnC,MAAI,IAAI,MAAM;AACd,SAAO,GAAG;AACR,oBAAgB,GAAG,GAAG;AACtB,QAAI,EAAE;AAAA,EACR;AACF;AAEA,SAAS,gBAAgB,QAAwB;AAC/C,QAAM,MAAe,CAAC;AACtB,MAAI,IAAI,OAAO;AACf,SAAO,GAAG;AACR,QAAI,KAAK,CAAC;AACV,QAAI,EAAE;AAAA,EACR;AACA,SAAO;AACT;AAaA,IAAM,YAAyC,IAAI,MAAM,EAAE;AAI3D,IAAM,2BAA2B,oBAAI,IAAY;AAAA,EAC/C;AAAA,EACA;AACF,CAAC;AAKD,IAAM,gBAA+B,CAAC;AAE/B,SAAS,iBAAiB,KAAe,IAAoB;AAClE,YAAU,GAAG,IAAI;AACnB;AAEO,SAAS,oBAAoB,GAAsB;AACxD,gBAAc,KAAK,CAAC;AACtB;AAEO,SAAS,sBAAsB,KAAmB;AACvD,2BAAyB,IAAI,GAAG;AAClC;AAKO,SAAS,iBAAmC;AACjD,SAAO;AACT;AAEO,SAAS,gBAAmB,MAAwB,IAAgB;AACzE,QAAM,OAAO;AACb,gBAAc;AACd,MAAI;AACF,WAAO,GAAG;AAAA,EACZ,UAAE;AACA,kBAAc;AAAA,EAChB;AACF;AAKO,SAAS,2BAAyC;AACvD,SAAO;AACT;AAEA,iBAAiB,SAAS,MAAM,UAAU;AAC1C,iBAAiB,SAAS,MAAM,UAAU;AAC1C,iBAAiB,SAAS,UAAU,cAAc;AAClD,iBAAiB,SAAS,UAAU,cAAc;AAE3C,SAAS,YAAY,OAAc,WAAiB,QAA2B;AACpF,QAAM,KAAK,UAAU,MAAM,GAAG;AAC9B,MAAI,GAAI,IAAG,OAAO,WAAW,MAAM;AACrC;AAEA,SAAS,WAAW,OAAc,WAAiB,QAA2B;AAC5E,QAAM,OAAO,MAAM;AACnB,MAAI,CAAC,MAAM,KAAK;AACd,UAAM,WAAW,aAAa,YAAY,aAAa,OAAO,MAAM,QAAS,IAAI,IAAI;AACrF,QAAI,CAAC,UAAU;AACb,YAAM,MAAM,SAAS,eAAe,IAAI;AACxC,iBAAW,WAAW,MAAM,KAAK,MAAM;AAAA,IACzC;AAAA,EACF,WAAY,MAAM,IAAa,SAAS,MAAM;AAC5C;AAAC,IAAC,MAAM,IAAa,OAAO;AAAA,EAC9B;AACA,QAAM,gBAAgB;AAExB;AAEA,SAAS,WAAW,OAAc,WAAiB,QAA2B;AAC5E,QAAM,QAAQ,MAAM,gBAAgB,CAAC;AACrC,QAAM,OAAO,MAAM,iBAAiB,CAAC;AACrC,QAAM,OAAO,MAAM;AACnB,QAAM,QAAQ,SAAS,SAAU,UAAsB,iBAAiB;AAKxE,QAAM,WAAW,SAAS;AAC1B,QAAM,sBACJ,aAAa,MAAM,UAAU,UAAa,MAAM,iBAAiB,UAC7D,MAAM,UAAU,SAAY,MAAM,QAAQ,MAAM,eAChD;AAEN,MAAI,CAAC,MAAM,KAAK;AACd,UAAM,WAAW,aAAa,YAAY,aAAa,OAAO,MAAM,MAAO,IAAI;AAC/E,QAAI,CAAC,UAAU;AACb,YAAM,MAAM,eAAe,MAAM,KAAK;AAMtC,iBAAW,KAAK,OAAO;AACrB,YAAI,aAAa,MAAM,WAAW,MAAM,gBAAiB;AACzD,YAAI,YAAY,CAAC,EAAG;AACpB,gBAAQ,MAAM,KAAgB,GAAG,MAAM,CAAC,GAAG,QAAW,KAAK;AAAA,MAC7D;AACA,iBAAW,KAAK,OAAO;AACrB,YAAI,CAAC,YAAY,CAAC,EAAG;AACrB,gBAAQ,MAAM,KAAgB,GAAG,MAAM,CAAC,GAAG,QAAW,KAAK;AAAA,MAC7D;AACA,iBAAW,WAAW,MAAM,KAAK,MAAM;AAAA,IACzC;AACA,cAAU,OAAO,MAAM,GAAG;AAAA,EAC5B,OAAO;AACL,UAAM,KAAK,MAAM;AACjB,eAAW,KAAK,MAAM;AACpB,UAAI,EAAE,KAAK,OAAQ,SAAQ,IAAI,GAAG,QAAW,KAAK,CAAC,GAAG,KAAK;AAAA,IAC7D;AAIA,eAAW,KAAK,OAAO;AACrB,UAAI,aAAa,MAAM,WAAW,MAAM,gBAAiB;AACzD,UAAI,YAAY,CAAC,EAAG;AACpB,UAAI,KAAK,CAAC,MAAM,MAAM,CAAC,EAAG,SAAQ,IAAI,GAAG,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK;AAAA,IACnE;AACA,eAAW,KAAK,OAAO;AACrB,UAAI,CAAC,YAAY,CAAC,EAAG;AACrB,UAAI,KAAK,CAAC,MAAM,MAAM,CAAC,EAAG,SAAQ,IAAI,GAAG,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK;AAAA,IACnE;AACA,QAAI,SAAS,MAAO,kBAAiB,OAAO,MAAM,GAAG;AAAA,EACvD;AAGA,oBAAkB,OAAO,gBAAgB,MAAM,QAAQ,GAAG,MAAM,KAAM,IAAI;AAO1E,MAAI,aAAa,WAAW;AAC1B,UAAM,YAAa,MAAM,KAAgB,YAAY;AACrD,QAAI,cAAc,UAAU,cAAc,QAAQ;AAChD,YAAM,SAAS,mBAAmB,KAAK;AACvC,UAAI,QAAQ;AACV,cAAM,WAAW,OAAO,UAAU,EAAE;AAAA,UAClC,CAAC,MAAM,EAAE,aAAa,KAAK,EAAE,aAAa;AAAA,QAC5C;AACA,YAAI,SAAS,SAAS,KAAK,YAAY,oBAAoB;AACzD,sBAAY;AAAA,YACV,IAAI;AAAA,cACF,uCAAuC,SAAS,MAAM,UACjD,SAAS,WAAW,IAAI,SAAS,OAAO,YAAY,SAAS;AAAA,YAEpE;AAAA,UACF;AACA,qBAAW,KAAK,SAAU,GAAE,YAAY,YAAY,CAAC;AAAA,QACvD;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAGA,MAAI,YAAY,wBAAwB,QAAW;AACjD,UAAM,SAAS,MAAM;AACrB,QAAI,MAAM,QAAQ,mBAAmB,GAAG;AACtC,YAAM,YAAY,oBAAoB,IAAI,CAAC,MAAM,KAAK,CAAC;AACvD,iBAAW,OAAO,MAAM,KAAK,OAAO,OAAO,GAAG;AAC5C,YAAI,WAAW,UAAU,SAAS,IAAI,KAAK;AAAA,MAC7C;AAAA,IACF,OAAO;AACL,aAAO,QAAQ,KAAK;AAAA,IACtB;AAAA,EACF;AAEA,QAAM,gBAAgB;AAExB;AAEA,SAAS,eAAe,OAAc,WAAiB,QAA2B;AAChF,QAAM,iBAAiB,qBAAqB;AAC5C,QAAM,YAAY,qBAAqB;AACvC,QAAM,WAAW,qBAAqB;AACtC,QAAM,YAAY,qBAAqB;AAEvC,uBAAqB,IAAI,eAAe;AACxC,uBAAqB,eAAe;AACpC,uBAAqB,cAAc;AACnC,uBAAqB,YAAY;AAEjC,MAAI;AACJ,MAAI,uBAAuB;AAC3B,MAAI;AACF,eAAY,MAAM,KAAkB,MAAM,gBAAgB,CAAC,CAAC;AAAA,EAC9D,SAAS,GAAQ;AACf,QAAI,WAAW,CAAC,GAAG;AACjB,UAAI,aAAa,WAAW;AAO1B,cAAM,aAAa,kBAAkB,KAAK;AAC1C,cAAM,kBAAkB,mBAAmB,UAAU;AACrD,YAAI,iBAAiB;AACnB,6BAAmB,OAAO,eAAe;AAAA,QAC3C;AACA,cAAM,gBAAgB;AAAA,UACpB,GAAI,MAAM,iBAAiB,CAAC;AAAA,UAC5B,mBAAmB;AAAA,QACrB;AASA,YAAI,MAAoB,MAAM;AAC9B,eAAO,OAAO,IAAI,QAAQ,SAAS,SAAU,OAAM,IAAI;AACvD,YAAI,OAAO,IAAI,eAAe;AAC5B;AAAC,UAAC,IAAI,cAAsB,yBAAyB;AAAA,QACvD;AACA,cAAM,aAAa,MAAM;AACvB,cAAI,OAAO,IAAI,eAAe;AAC5B;AAAC,YAAC,IAAI,cAAsB,yBAAyB;AAAA,UACvD;AACA,yBAAe,KAAK;AAAA,QACtB;AACA,UAAE,KAAK,YAAY,UAAU;AAC7B,+BAAuB;AAAA,MACzB,OAAO;AACL,qBAAa,gBAAgB,OAAO,CAAC;AACrC,mBAAW;AAAA,MACb;AAAA,IACF,OAAO;AACL,0BAAoB,OAAO,CAAC;AAC5B;AAAA,IACF;AAAA,EACF,UAAE;AACA,yBAAqB,IAAI;AACzB,yBAAqB,eAAe;AACpC,yBAAqB,cAAc;AACnC,yBAAqB,YAAY;AAAA,EACnC;AAEA,MAAI,qBAAsB;AAE1B,oBAAkB,OAAO,gBAAgB,QAAQ,GAAG,WAAW,MAAM;AACrE,QAAM,gBAAgB,MAAM;AAE9B;AAQA,SAAS,eAAe,OAAc,WAAiB,QAA2B;AAChF,QAAM,QAAQ,MAAM,gBAAgB,CAAC;AACrC,oBAAkB,OAAO,gBAAgB,MAAM,QAAQ,GAAG,WAAW,MAAM;AAC3E,QAAM,gBAAgB;AAExB;AASA,SAAS,uBAAuB,OAAc,UAA8B;AAC1E,WAAS;AAAA,IACP,MAAM,eAAe,KAAK;AAAA,IAC1B,MAAM,eAAe,KAAK;AAAA,EAC5B;AACF;AAgBA,IAAM,eAA6B;AAAA,EACjC,iBAAiB;AAAA,EACjB,aAAa;AACf;AAEO,SAAS,kBACd,MACA,IACM;AACN,eAAa,IAAI,IAAI;AACvB;AAIO,SAAS,gBAAgB,OAAc,UAA8B;AAC1E,eAAa,gBAAgB,OAAO,QAAQ;AAC9C;AAEO,SAAS,oBAAoB,OAAc,KAAgB;AAEhE,MAAI,IAAkB,MAAM;AAC5B,SAAO,GAAG;AACR,QAAI,EAAE,QAAQ,SAAS,OAAO;AAC5B,YAAM,OAAO,EAAE;AACf,YAAM,WAAW,EAAE;AACnB,UAAI,KAAK,0BAA0B;AACjC,cAAM,SAAS,KAAK,yBAAyB,GAAG;AAChD,iBAAS,QAAQ,EAAE,GAAG,SAAS,OAAO,GAAG,OAAO;AAAA,MAClD;AACA,UAAI,SAAS,mBAAmB;AAC9B,YAAI;AACF,mBAAS,kBAAkB,KAAK,EAAE,gBAAgB,GAAG,CAAC;AAAA,QACxD,QAAQ;AAAA,QAAC;AAAA,MACX;AACA,qBAAe,CAAC;AAChB;AAAA,IACF;AACA,QAAI,EAAE;AAAA,EACR;AAEA,MAAI,aAAa,gBAAiB,aAAY,gBAAgB,GAAG;AAAA,MAC5D,OAAM;AACb;AAEO,SAAS,WAAW,GAA2B;AACpD,SAAO,KAAK,QAAQ,OAAO,EAAE,SAAS;AACxC;AAMA,SAAS,aAAa,OAAc,WAAuB;AACzD,QAAM,YAAY;AAElB,MAAI,IAAI,MAAM;AACd,SAAO,GAAG;AACR,UAAM,OAAO,EAAE;AACf,iBAAa,GAAG,MAAM,QAAQ,SAAS,OAAO,MAAM,MAAO,SAAS;AACpE,QAAI;AAAA,EACN;AACA,QAAM,QAAQ;AAGd,MAAI,MAAM,UAAU;AAClB,eAAW,WAAW,MAAM,UAAU;AACpC,UAAI;AACF,gBAAQ;AAAA,MACV,SAAS,GAAG;AACV,YAAI,aAAa,mBAAoB,aAAY,mBAAmB,CAAC;AAAA,MACvE;AAAA,IACF;AACA,UAAM,WAAW;AAAA,EACnB;AAEA,MAAI,MAAM,QAAQ,SAAS,SAAS,MAAM,WAAW,sBAAsB;AACzE,QAAI;AACF,YAAM,UAAU,qBAAqB;AAAA,IACvC,SAAS,GAAG;AACV,UAAI,aAAa,mBAAoB,aAAY,mBAAmB,CAAC;AAAA,IACvE;AACA,UAAM,UAAU,SAAS;AACzB,UAAM,UAAU,iBAAiB;AACjC,UAAM,UAAU,eAAe;AAAA,EACjC;AAGA,MAAI,MAAM,IAAK,WAAU,MAAM,GAAG;AAGlC,MAAI,MAAM,QAAQ,SAAS,QAAQ,MAAM,OAAO,MAAM,IAAI,YAAY;AACpE,UAAM,IAAI,WAAW,YAAY,MAAM,GAAG;AAAA,EAC5C,WAAW,MAAM,QAAQ,SAAS,QAAQ,MAAM,OAAO,MAAM,IAAI,YAAY;AAC3E,UAAM,IAAI,WAAW,YAAY,MAAM,GAAG;AAAA,EAC5C;AACF;AAEO,SAAS,mBAAmB,QAAe,WAAuB;AACvE,MAAI,IAAI,OAAO;AACf,SAAO,GAAG;AACR,UAAM,OAAO,EAAE;AACf,iBAAa,GAAG,SAAS;AACzB,QAAI;AAAA,EACN;AACA,SAAO,QAAQ;AACjB;AAMA,SAAS,WAAW,QAAc,MAAY,QAA2B;AAKvE,MAAI,UAAU,OAAO,eAAe,QAAQ;AAC1C,WAAO,aAAa,MAAM,MAAM;AAAA,EAClC,OAAO;AACL,WAAO,YAAY,IAAI;AAAA,EACzB;AACF;AAEA,SAAS,cAAc,OAAoB;AACzC,MAAI,IAAI,MAAM;AACd,SAAO,GAAG;AACR,QAAI,EAAE,QAAQ,SAAS,KAAM,QAAO,EAAE;AACtC,QAAI,EAAE,QAAQ,SAAS;AACrB,aAAQ,EAAE,aAAuB,EAAE,OAAiB,EAAE,MAAM;AAC9D,QAAI,EAAE,QAAQ,SAAS,QAAQ;AAO7B,YAAM,QAAS,EAAE,gBAAgB,EAAE;AACnC,aAAQ,OAAO,aAAuB,EAAE,aAAuB,EAAE,OAAiB,EAAE,MAAM;AAAA,IAC5F;AACA,QAAI,EAAE;AAAA,EACR;AACA,QAAM,IAAI,MAAM,uBAAuB;AACzC;AAEA,SAAS,UAAU,OAA2B;AAE5C,MAAI,IAAkB,MAAM;AAC5B,SAAO,GAAG;AACR,UAAM,IAAI,aAAa,CAAC;AACxB,QAAI,EAAG,QAAO;AACd,QAAI,EAAE;AAAA,EACR;AAEA,MAAI,IAAI,MAAM;AACd,SAAO,KAAK,EAAE,QAAQ,SAAS,QAAQ,EAAE,QAAQ,SAAS,QAAQ,EAAE,QAAQ,SAAS,QAAQ;AAC3F,QAAI,EAAE,SAAS;AACb,YAAM,IAAI,aAAa,EAAE,OAAO;AAChC,UAAI,EAAG,QAAO;AAAA,IAChB;AACA,QAAI,EAAE;AAAA,EACR;AACA,SAAO;AACT;AAEA,SAAS,aAAa,OAA2B;AAC/C,MAAI,MAAM,QAAQ,SAAS,QAAQ,MAAM,QAAQ,SAAS,KAAM,QAAO,MAAM;AAC7E,MAAI,IAAI,MAAM;AACd,SAAO,GAAG;AACR,UAAM,IAAI,aAAa,CAAC;AACxB,QAAI,EAAG,QAAO;AACd,QAAI,EAAE;AAAA,EACR;AACA,SAAO;AACT;AAWO,SAAS,YAAY,OAAc,KAAe;AACvD,SAAO,aAAa,YAAY,OAAO,GAAG;AAC5C;AAEA,SAAS,mBAAmB,QAAe,KAAe;AACxD,SAAO,IAAI;AACb;AAMA,SAAS,UAAU,OAAc,OAAkB;AACjD,QAAM,MAAM,MAAM,QAAQ,MAAM,cAAc,OAAO;AACrD,MAAI,CAAC,IAAK;AACV,MAAI,OAAO,QAAQ,YAAY;AAK7B,sBAAkB,OAAO,MAAM;AAC7B,YAAM,UAAU,IAAI,KAAK;AACzB,YAAM,aAAa,CAAC;AACpB,YAAM,SAAS,KAAK,OAAO,YAAY,aAAa,UAAU,MAAM,IAAI,IAAI,CAAC;AAAA,IAC/E,CAAC;AAAA,EACH,OAAO;AACL,QAAI,UAAU;AAAA,EAChB;AACF;AAEA,SAAS,iBAAiB,OAAc,OAAkB;AACxD,QAAM,MAAM,MAAM,QAAQ,MAAM,cAAc,OAAO;AACrD,MAAI,CAAC,IAAK;AACV,MAAI,OAAO,QAAQ,YAAY,IAAI,YAAY,MAAO,KAAI,UAAU;AACtE;AAEA,SAAS,UAAU,KAAgB;AAIjC,MAAI,OAAO,OAAO,QAAQ,UAAU;AAClC,QAAI,UAAU;AAAA,EAChB;AACF;AAMA,IAAM,iBAA0D,CAAC;AACjE,IAAM,uBAAgE,CAAC;AACvE,IAAM,oBAA6D,CAAC;AAE7D,SAAS,cAAc,OAAc,QAAsB;AAChE,MAAI,OAAO,QAAQ,YAAY,OAAO,QAAQ,aAAa;AACzD,yBAAqB,KAAK,EAAE,OAAO,OAAO,CAAC;AAAA,EAC7C,OAAO;AACL,mBAAe,KAAK,EAAE,OAAO,OAAO,CAAC;AAAA,EACvC;AACF;AAEO,SAAS,kBAAkB,OAAc,IAAsB;AACpE,oBAAkB,KAAK,EAAE,OAAO,GAAG,CAAC;AACtC;AAEO,SAAS,WAAW,MAAuB;AAEhD,SAAO,qBAAqB,QAAQ;AAClC,UAAM,EAAE,OAAO,OAAO,IAAI,qBAAqB,MAAM;AACrD,cAAU,OAAO,QAAQ,IAAI;AAAA,EAC/B;AAEA,SAAO,kBAAkB,QAAQ;AAC/B,UAAM,EAAE,GAAG,IAAI,kBAAkB,MAAM;AACvC,QAAI;AACF,SAAG;AAAA,IACL,SAAS,GAAG;AACV,UAAI,KAAK,cAAe,MAAK,cAAc,CAAC;AAAA,IAC9C;AAAA,EACF;AAEA,MAAI,eAAe,QAAQ;AACzB,UAAM,QAAQ,eAAe,OAAO,CAAC;AACrC,mBAAe,MAAM;AACnB,iBAAW,EAAE,OAAO,OAAO,KAAK,MAAO,WAAU,OAAO,QAAQ,IAAI;AAAA,IACtE,CAAC;AAAA,EACH;AACF;AAEA,SAAS,UAAU,OAAc,QAAgB,MAAuB;AACtE,MAAI;AACF,UAAM,UAAU,OAAO,OAAO;AAC9B,WAAO,UAAU,OAAO,YAAY,aAAa,UAAU;AAC3D,QAAI,OAAO,SAAS;AAClB,YAAM,aAAa,CAAC;AACpB,YAAM,SAAS,KAAK,OAAO,OAAO;AAAA,IACpC;AAAA,EACF,SAAS,GAAG;AACV,QAAI,KAAK,cAAe,MAAK,cAAc,CAAC;AAAA,EAC9C;AACF;AAMA,SAAS,YAAY,MAAuB;AAC1C,SACE,KAAK,SAAS,KACd,KAAK,WAAW,CAAC,MAAM,OACvB,KAAK,WAAW,CAAC,MAAM,OACvB,KAAK,WAAW,CAAC,KAAK;AAE1B;",
+  "sourcesContent": ["import {\n  FiberTag,\n  FiberFlag,\n  createFiber,\n  REACT_ELEMENT_TYPE,\n  REACT_LEGACY_ELEMENT_TYPE,\n  REACT_FRAGMENT_TYPE,\n  type Fiber,\n  type FiberRoot,\n  type ReactElement,\n  type ReactNode,\n  type Hook,\n  type Effect,\n} from '../core'\nimport {\n  ReactSharedInternals,\n  REACT_LAZY_TYPE,\n  REACT_STRICT_MODE_TYPE,\n  REACT_PROFILER_TYPE,\n} from '../react'\nimport { createHostNode, setProp } from './dom'\nimport { makeDispatcher } from './dispatcher'\nimport {\n  adoptHostDom,\n  adoptTextDom,\n  tryConsumeBoundary,\n  advanceCursorPast,\n  setHydrationCursor,\n  getHydrationCursor,\n  clearHydrationCursor,\n  HydrationCursor,\n  findHostParent as findHydrationHost,\n} from './features/hydration'\n\n// ---------------------------------------------------------------------------\n// Render scheduling\n// ---------------------------------------------------------------------------\n\nlet currentRoot: FiberRoot | null = null\nlet flushing = false\nlet isBatching = false\nconst pendingRoots = new Set<FiberRoot>()\n\n// Set by rerenderFiber to identify the exact memo-tagged fiber whose INTERNAL\n// state (hook update, useSyncExternalStore notification) triggered this render\n// pass. renderMemo checks this to bypass its prop-equality gate for that fiber.\n// Without the bypass, a memo bail would swallow state changes: React's memo is\n// only a parent-triggered gate \u2014 state-driven rerenders must always run the\n// inner function. Router-adjacent components (Outlet, Match, MatchInner) are\n// all memo-wrapped and subscribe to stores; missing this bypass breaks nav\n// content updates even though the URL changes.\nlet forceRerenderingFiber: Fiber | null = null\n\nexport function scheduleUpdate(fiber: Fiber): void {\n  // Drop updates scheduled on already-unmounted fibers. Subscribers (router,\n  // query, any external store) can fire after unmount if their cleanup was\n  // missed, and letting those reach rerenderFiber mounts zombie DOM into the\n  // old .parent's DOM (which stays reachable via the stale pointer).\n  if (fiber.unmounted) return\n  const root = findRoot(fiber)\n  if (!root) return\n  root.pending.add(fiber)\n  fiber.dirty = true\n  pendingRoots.add(root)\n  if (isBatching) return\n  if (!root.scheduled) {\n    root.scheduled = true\n    queueMicrotask(flushPending)\n  }\n}\n\nexport function flushSyncWork(fn: () => void): void {\n  const wasBatching = isBatching\n  isBatching = true\n  try {\n    fn()\n  } finally {\n    isBatching = wasBatching\n  }\n  flushPending()\n}\n\nexport function batchedUpdates<T>(fn: () => T): T {\n  const wasBatching = isBatching\n  isBatching = true\n  try {\n    return fn()\n  } finally {\n    isBatching = wasBatching\n    if (!wasBatching) flushPending()\n  }\n}\n\nfunction flushPending(): void {\n  if (flushing) return\n  flushing = true\n  try {\n    let guard = 0\n    while (pendingRoots.size > 0) {\n      if (++guard > 50) {\n        throw new Error('flushPending exceeded 50 iterations \u2014 suspected infinite update loop.')\n      }\n      const roots = [...pendingRoots]\n      pendingRoots.clear()\n      for (const root of roots) {\n        root.scheduled = false\n        // Render each pending fiber from shallowest first so an ancestor's\n        // cascade reaches descendants before we try to render them directly.\n        // Descendants rendered via cascade still have `dirty=true` (only\n        // rerenderFiber clears it); when we later reach them in this loop,\n        // rerenderFiber's own `if (!dirty) return` is our short-circuit. We\n        // previously filtered descendants of dirty ancestors here, but that\n        // loses updates whenever an ancestor's render doesn't actually reach\n        // the descendant \u2014 e.g. React.memo bailing on equal props. Keep all\n        // dirty fibers and let rerenderFiber de-dupe via its dirty check.\n        const pending = [...root.pending]\n        root.pending.clear()\n        pending.sort((a, b) => fiberDepth(a) - fiberDepth(b))\n        for (const fiber of pending) {\n          rerenderFiber(fiber, root)\n        }\n        runEffects(root)\n      }\n    }\n  } finally {\n    flushing = false\n  }\n}\n\nfunction fiberDepth(fiber: Fiber): number {\n  let d = 0\n  let p: Fiber | null = fiber.parent\n  while (p) {\n    d++\n    p = p.parent\n  }\n  return d\n}\n\nexport function findRoot(fiber: Fiber): FiberRoot | null {\n  let f: Fiber | null = fiber\n  while (f) {\n    if (f.root) return f.root\n    f = f.parent\n  }\n  return null\n}\n\n// ---------------------------------------------------------------------------\n// Entry points (called by createRoot)\n// ---------------------------------------------------------------------------\n\nexport function renderRoot(root: FiberRoot, children: ReactNode): void {\n  const rootFiber = root.current\n  rootFiber.pendingProps = { children }\n  currentRoot = root\n  try {\n    reconcileChildren(rootFiber, childrenToArray(children), root.container as Node, null)\n    rootFiber.memoizedProps = rootFiber.pendingProps\n    rootFiber.dirty = false\n  } finally {\n    currentRoot = null\n  }\n  runEffects(root)\n}\n\nfunction rerenderFiber(fiber: Fiber, root: FiberRoot): void {\n  if (!fiber.dirty) return\n  // Skip fibers that were unmounted between scheduling and flush. Without this,\n  // the flush loop re-enters a zombie fiber whose .parent is still set; its\n  // render mounts fresh DOM into the old parent's still-attached DOM (since\n  // unmountFiber only clears fiber.child, not fiber.parent). Visible as route\n  // content from a previous location staying on screen after nav, because a\n  // pending rerender on the old route's LibraryLandingPage (unmounted during\n  // Outlet's shallow-first render) still fires from root.pending.\n  if (fiber.unmounted) return\n  // Clear BEFORE rendering so a scheduleUpdate() triggered mid-render (e.g.\n  // error boundary catching a descendant throw) marks us dirty for the next\n  // flush iteration instead of being wiped out when render() completes.\n  fiber.dirty = false\n  currentRoot = root\n  // If this rerender is resuming a hydration that was deferred by a suspension,\n  // re-activate hydration mode for its duration so descendants adopt DOM\n  // instead of re-creating it.\n  const resumeHydration =\n    fiber.memoizedState && (fiber.memoizedState as any)._pendingHydration === true\n  const prevHydrating = root.hydrating\n  if (resumeHydration) {\n    delete (fiber.memoizedState as any)._pendingHydration\n    root.hydrating = true\n  }\n  const prevForcing = forceRerenderingFiber\n  forceRerenderingFiber = fiber\n  try {\n    renderFiber(fiber, getHostParent(fiber), getAnchor(fiber))\n  } finally {\n    forceRerenderingFiber = prevForcing\n    if (resumeHydration) {\n      root.hydrating = prevHydrating\n      // Deferred hydration completed \u2014 detach the preserved cursor so future\n      // updates (post-hydration state changes) don't try to adopt stale DOM.\n      clearHydrationCursor(fiber)\n    }\n    currentRoot = null\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Element \u2192 children normalization\n// ---------------------------------------------------------------------------\n\n// Text children pass through as raw strings \u2014 no wrapper. The previous\n// `{_text: string}` shape allocated tens of thousands of objects per\n// stable-list re-render and dominated minor-GC pressure. `typeof === 'string'`\n// is also robust to RSC renderable proxies (which have `has` traps that\n// would fool a `'_text' in child` predicate but can't fool `typeof`).\ntype NormalizedChild = ReactElement | string | null\n\nfunction isTextChild(child: Exclude<NormalizedChild, null>): child is string {\n  return typeof child === 'string'\n}\n\nexport function childrenToArray(children: ReactNode): NormalizedChild[] {\n  const out: NormalizedChild[] = []\n  pushChildren(children, out)\n  return out\n}\n\nfunction pushChildren(node: ReactNode, out: NormalizedChild[]): void {\n  if (node == null || typeof node === 'boolean') return\n  if (typeof node === 'string') {\n    // Empty strings render no text node (matches React + the `<!-- -->`\n    // separator elision on the SSR side so server/client agree).\n    if (node === '') return\n    out.push(node)\n    return\n  }\n  if (typeof node === 'number') {\n    out.push('' + node)\n    return\n  }\n  if (Array.isArray(node)) {\n    for (let i = 0; i < node.length; i++) pushChildren(node[i], out)\n    return\n  }\n  if (isIterable(node)) {\n    for (const item of node as Iterable<ReactNode>) pushChildren(item, out)\n    return\n  }\n  if (typeof node === 'object') {\n    const t = (node as any).$$typeof\n    if (ACCEPTED_ELEMENT_MARKERS.has(t)) {\n      out.push(node as ReactElement)\n      return\n    }\n    // Raw React.lazy as a child. RSC Flight encodes 'use client' components\n    // (CodeBlock, CodeExplorer, etc.) as bare Lazy objects in the tree, not\n    // wrapped in REACT_ELEMENT_TYPE. Dropping them made code snippets\n    // disappear from docs pages. The RSC decoder pre-awaits payloads via\n    // `awaitLazyElements`, so by render time the status is 'fulfilled' and\n    // `_init()` returns the resolved element synchronously.\n    if (t === REACT_LAZY_TYPE) {\n      const lazy = node as any\n      const resolved = lazy._init(lazy._payload)\n      pushChildren(resolved, out)\n      return\n    }\n  }\n}\n\nfunction isIterable(obj: any): boolean {\n  return obj != null && typeof obj !== 'string' && typeof obj[Symbol.iterator] === 'function'\n}\n\nfunction getKeyOf(child: NormalizedChild, index: number): string {\n  if (!child) return 'n' + index\n  if (isTextChild(child)) return '$t' + index\n  if (child.key != null) return 'k' + child.key\n  return 'i' + index\n}\n\nfunction sameType(fiber: Fiber, child: NormalizedChild): boolean {\n  if (!child) return false\n  if (isTextChild(child)) return fiber.tag === FiberTag.Text\n  return fiber.type === child.type && sameKey(fiber.key, child.key)\n}\n\nfunction sameKey(a: string | null, b: string | null | undefined): boolean {\n  return (a ?? null) === (b ?? null)\n}\n\n// ---------------------------------------------------------------------------\n// Fiber creation\n// ---------------------------------------------------------------------------\n\nfunction fiberFromChild(child: NormalizedChild, parent: Fiber): Fiber {\n  if (!child) return createFiber(FiberTag.Fragment, null, null)\n  if (isTextChild(child)) {\n    const f = createFiber(FiberTag.Text, null, null)\n    f.pendingProps = child\n    f.parent = parent\n    return f\n  }\n  const type = child.type\n  let tag: FiberTag = FiberTag.Host\n  const marker = type && (type as any).$$typeof\n  if (typeof type === 'string') tag = FiberTag.Host\n  else if (type === REACT_FRAGMENT_TYPE) tag = FiberTag.Fragment\n  else if (type === REACT_STRICT_MODE_TYPE || type === REACT_PROFILER_TYPE) tag = FiberTag.Fragment\n  else {\n    // Feature-registered type matchers (Portal, future extractions). Features\n    // that carry the symbol as element.type directly (rather than wrapping in\n    // REACT_ELEMENT_TYPE) match here by type identity.\n    let matched: FiberTag | null = null\n    for (const m of TYPE_MATCHERS) {\n      matched = m(type, marker)\n      if (matched !== null) break\n    }\n    if (matched !== null) tag = matched\n    else if (typeof type === 'function') {\n      tag = type.prototype && type.prototype.isReactComponent ? FiberTag.Class : FiberTag.Function\n    }\n  }\n  const f = createFiber(tag, type, child.key ?? null)\n  f.ref = (child as any).ref ?? null\n  f.pendingProps = child.props\n  f.parent = parent\n  return f\n}\n\n// ---------------------------------------------------------------------------\n// Reconciliation\n// ---------------------------------------------------------------------------\n\n/**\n * Reconcile a parent fiber's child list against new normalized children.\n * Mutates parent.child and the sibling chain.\n * Mounts new host DOM into `domParent` before `anchor` (or appends if anchor === null).\n */\nexport function reconcileChildren(\n  parent: Fiber,\n  newChildren: NormalizedChild[],\n  domParent: Node,\n  anchor: Node | null,\n): void {\n  // Fast path: unkeyed positional steady-state. Walk the existing sibling\n  // chain and newChildren in lockstep, validating AND committing in one pass.\n  // On any divergence we fall back to the slow path, which rebuilds the\n  // sibling chain anyway \u2014 partial pendingProps writes are idempotent.\n  // Skips the Map / Set / existing-array allocation entirely.\n  if (!currentRoot?.hydrating) {\n    let f: Fiber | null = parent.child\n    let ok = true\n    for (let i = 0; i < newChildren.length; i++) {\n      const child = newChildren[i]\n      if (child == null || !f || f.key != null) { ok = false; break }\n      if (typeof child === 'string') {\n        if (f.tag !== FiberTag.Text) { ok = false; break }\n        f.pendingProps = child\n      } else {\n        if ((child as ReactElement).key != null) { ok = false; break }\n        if (f.type !== (child as ReactElement).type) { ok = false; break }\n        f.pendingProps = (child as ReactElement).props\n        f.ref = (child as any).ref ?? null\n      }\n      f = f.sibling\n    }\n    if (ok && f === null) {\n      // Pass 2: render forward with per-child anchors. Identical to the slow\n      // path's pass 2.\n      for (let r: Fiber | null = parent.child; r; r = r.sibling) {\n        let a = anchor\n        for (let s: Fiber | null = r.sibling; s; s = s.sibling) {\n          const d = firstDomNode(s)\n          if (d && d.parentNode === domParent) { a = d; break }\n        }\n        renderFiber(r, domParent, a)\n      }\n      return\n    }\n  }\n\n  const existing = collectChildren(parent)\n  const keyed = new Map<string, Fiber>()\n  for (const f of existing) {\n    if (f.key != null) keyed.set('k' + f.key, f)\n  }\n\n  let prevNewFiber: Fiber | null = null\n  const claimed = new Set<Fiber>()\n  let structurallyChanged = false\n  // Budget-guided positional matching. We walk `existing` (unkeyed only) with a\n  // single cursor `existingIdx` and, on a type mismatch, choose insert vs delete\n  // based on the remaining length delta (`budget`):\n  //   budget > 0: more new than old remain \u2192 treat slot as an INSERTION: keep\n  //               the old cursor and create a fresh fiber for new[i].\n  //   budget < 0: more old than new remain \u2192 treat slot as a DELETION: advance\n  //               the old cursor past the mismatched fiber (it'll be unmounted\n  //               in the unclaimed pass) and retry.\n  //   budget == 0: equal remaining \u2192 treat as REPLACE by preferring delete\n  //               until budget flips positive or we hit a match.\n  // This avoids greedy forward scans that steal a later same-type fiber for a\n  // newly inserted leading sibling (e.g. smallMenu flipping null \u2192 <div>\n  // stealing the content <div>'s fiber and tearing down the drawer fragment).\n  let existingIdx = 0\n  let unkeyedOld = 0\n  for (const f of existing) if (f.key == null) unkeyedOld++\n  let unkeyedNew = 0\n  for (const c of newChildren) if (c != null) unkeyedNew++\n  let budget = unkeyedNew - unkeyedOld\n\n  // Pass 1 (this loop): match against existing fibers and build the sibling\n  // chain. Pass 2 (after the loop) renders each fiber with the correct\n  // per-child anchor \u2014 the firstDomNode of its next still-mounted sibling,\n  // or the parent's own anchor for the rightmost. Without per-child anchors\n  // a child whose render output type changes from no-DOM (Portal, null) to\n  // an in-flow host gets appended to the end of domParent (every child\n  // would otherwise share the parent's anchor) and never moves before its\n  // later siblings. Hit by the t3code Sidebar swap from a portal-rendering\n  // <Sheet> to a <div data-slot=sidebar> when isMobile flips during a\n  // Provider re-render.\n  for (let i = 0; i < newChildren.length; i++) {\n    const child = newChildren[i]\n    if (child == null) continue\n\n    let match: Fiber | null = null\n\n    // key-based match\n    if (child && typeof child === 'object' && !isTextChild(child) && (child as ReactElement).key != null) {\n      const k = 'k' + (child as ReactElement).key\n      const m = keyed.get(k)\n      if (m && m.type === (child as ReactElement).type) {\n        match = m\n        keyed.delete(k)\n      }\n    }\n\n    if (!match) {\n      while (existingIdx < existing.length) {\n        const cand = existing[existingIdx]!\n        if (claimed.has(cand) || cand.key != null) {\n          existingIdx++\n          continue\n        }\n        if (sameType(cand, child)) {\n          match = cand\n          existingIdx++\n          break\n        }\n        // Type mismatch at the cursor. Resolve via budget.\n        if (budget > 0) {\n          // Insertion: leave cand in place, create new for child.\n          break\n        }\n        // Deletion (or replace-as-delete-first): advance past cand. It remains\n        // unclaimed and will be unmounted at the end.\n        existingIdx++\n        budget++\n      }\n    }\n\n    // Detect reorder: matched fiber is not at its original position\n    if (match && existing[i] !== match) structurallyChanged = true\n\n    let fiber: Fiber\n    if (match) {\n      claimed.add(match)\n      fiber = match\n      if (isTextChild(child!)) {\n        fiber.pendingProps = child\n      } else {\n        fiber.type = (child as ReactElement).type\n        fiber.pendingProps = (child as ReactElement).props\n        fiber.ref = (child as any).ref ?? null\n      }\n    } else {\n      fiber = fiberFromChild(child, parent)\n      structurallyChanged = true\n      if (budget > 0) budget--\n    }\n\n    fiber.parent = parent\n    fiber.sibling = null\n    if (prevNewFiber) prevNewFiber.sibling = fiber\n    else parent.child = fiber\n    prevNewFiber = fiber\n  }\n\n  // Pass 2: walk the sibling chain we just built and render each fiber\n  // forward with the correct per-child anchor. During hydration the cursor\n  // walks DOM forward and each renderFiber adopts the next existing node,\n  // so per-child anchors are moot \u2014 fall back to the parent's anchor.\n  const hydrating = !!currentRoot?.hydrating\n  for (let f: Fiber | null = parent.child; f; f = f.sibling) {\n    let a = anchor\n    if (!hydrating) {\n      // Find the firstDomNode of the next still-mounted sibling, if any.\n      for (let s: Fiber | null = f.sibling; s; s = s.sibling) {\n        const d = firstDomNode(s)\n        if (d && d.parentNode === domParent) { a = d; break }\n      }\n    }\n    renderFiber(f, domParent, a)\n  }\n\n  if (!prevNewFiber) parent.child = null\n  else prevNewFiber.sibling = null\n\n  // Head content is additive \u2014 server may inject metadata/stylesheets (Vite\n  // dev styles, Sentry, analytics) that aren't in the React tree. Unmounting\n  // them on every reconcile thrashes styles and causes flash of unstyled\n  // content. Keep existing head children that weren't matched this pass.\n  const parentIsHeadHost =\n    parent.tag === FiberTag.Host &&\n    typeof parent.type === 'string' &&\n    (parent.type as string).toLowerCase() === 'head'\n\n  if (!parentIsHeadHost) {\n    // Unmount unclaimed\n    for (const f of existing) {\n      if (!claimed.has(f)) {\n        unmountFiber(f, domParent)\n        structurallyChanged = true\n      }\n    }\n    // Leftover keyed\n    for (const f of keyed.values()) {\n      if (!claimed.has(f)) {\n        unmountFiber(f, domParent)\n        structurallyChanged = true\n      }\n    }\n  }\n\n  // During hydration, DOM is already in document order from the cursor-driven\n  // adoption walk. Running placeChildrenInOrder here would reappend nodes to\n  // the end of domParent when the true anchor (often an end marker comment)\n  // isn't reflected in `anchor`. Skip it in hydration mode.\n  //\n  // For <head>, skip always \u2014 HeadContent re-renders routinely (route match\n  // changes, providers updating), and reordering every <link>/<style>/<meta>\n  // on each re-render causes stylesheet flash and re-download. Head element\n  // ordering is semantically fluid; the browser doesn't care about exact\n  // order within <head>.\n  const parentIsHead =\n    (domParent as Element).nodeType === 1 &&\n    (domParent as Element).tagName.toLowerCase() === 'head'\n  if (structurallyChanged && !currentRoot?.hydrating && !parentIsHead) {\n    placeChildrenInOrder(parent, domParent, anchor)\n  }\n}\n\nfunction placeChildrenInOrder(parent: Fiber, domParent: Node, anchor: Node | null): void {\n  const doms: Node[] = []\n  let c = parent.child\n  while (c) {\n    collectHostDoms(c, doms)\n    c = c.sibling\n  }\n\n  // Pre-check: if our fiber-owned DOM is already in document order within\n  // domParent AND the trailing anchor matches, no reorder is needed. This is\n  // the common case on stable re-renders, and avoids detaching/re-attaching\n  // subtrees (which cancels CSS animations and triggers layout).\n  if (doms.length > 0) {\n    let current: Node | null = doms[0]!\n    let inOrder = current.parentNode === domParent\n    for (let i = 1; inOrder && i < doms.length; i++) {\n      current = current!.nextSibling\n      // Skip foreign nodes (SSR-injected scripts, dev-styles) between owned\n      // fiber DOMs \u2014 they should stay where they are.\n      while (current && !doms.includes(current as Node)) {\n        current = current.nextSibling\n      }\n      if (current !== doms[i]) inOrder = false\n    }\n    // Also verify the LAST dom's next sibling lines up with `anchor`. A\n    // single-dom collection (or correctly-internally-ordered doms) can sit\n    // at the WRONG absolute position in domParent and still pass the\n    // relative-order check above. This happens when a fiber's render output\n    // changes from no-DOM (e.g. a Portal-using <Sheet>, or null) to an\n    // in-flow host element: the new host is appended to the end of\n    // domParent (because the parent reconcileChildren loop hands every\n    // child the same anchor \u2014 typically null), and without this trailing\n    // check it would never get moved before its later siblings.\n    if (inOrder) {\n      let last: Node | null = doms[doms.length - 1]!.nextSibling\n      while (last && !doms.includes(last as Node) && last !== anchor) {\n        last = last.nextSibling\n      }\n      if (last !== anchor) inOrder = false\n    }\n    if (inOrder) return\n  }\n\n  // Reverse-iterate, anchoring each node before the one that should follow it.\n  // This works because by the time we're placing doms[i], doms[i+1] is already\n  // in its final slot. Forward iteration is buggy: insertBefore(doms[i],\n  // doms[i+1]) pulls doms[i] forward past any nodes that SHOULD move behind\n  // it, leaving those nodes mis-anchored (app-starter Analyze/Lucky swap, npm\n  // stats library dropdown reorder \u2014 both reported by users).\n  //\n  // Concrete example: start=[A, R, L], target=[A, L, R]. Forward pass gives\n  // [L, A, R] (wrong). Reverse pass moves R to end, then L and A are already\n  // correct \u2014 1 move, matches target.\n  //\n  // Skip nodes already in their target position so CSS transitions on stable\n  // siblings aren't cancelled (e.g. drawer slide animation).\n  for (let i = doms.length - 1; i >= 0; i--) {\n    const d = doms[i]!\n    const targetNext: Node | null = i + 1 < doms.length ? doms[i + 1]! : anchor\n    if (d.parentNode !== domParent || d.nextSibling !== targetNext) {\n      domParent.insertBefore(d, targetNext)\n    }\n  }\n}\n\nfunction collectHostDoms(fiber: Fiber, out: Node[]): void {\n  if (fiber.tag === FiberTag.Host || fiber.tag === FiberTag.Text) {\n    if (fiber.dom) out.push(fiber.dom)\n    return\n  }\n  if (fiber.tag === FiberTag.Portal) return\n  let c = fiber.child\n  while (c) {\n    collectHostDoms(c, out)\n    c = c.sibling\n  }\n}\n\nfunction collectChildren(parent: Fiber): Fiber[] {\n  const out: Fiber[] = []\n  let c = parent.child\n  while (c) {\n    out.push(c)\n    c = c.sibling\n  }\n  return out\n}\n\n// ---------------------------------------------------------------------------\n// Rendering per fiber tag\n// ---------------------------------------------------------------------------\n\nexport type RenderFn = (fiber: Fiber, domParent: Node, anchor: Node | null) => void\nexport type TypeMatcher = (type: any, marker: any) => FiberTag | null\n\n// Mutable renderer registry indexed by FiberTag. Feature modules install their\n// renderer via registerRenderer(); unregistered features render as no-ops. The\n// initial registrations below rely on function-declaration hoisting \u2014 every\n// render* function is declared with `function` later in this file.\nconst RENDERERS: Array<RenderFn | undefined> = new Array(13)\n\n// Element-marker allowlist for child normalization (pushChildren). Core-always\n// markers are seeded here; features add their own via registerElementMarker.\nconst ACCEPTED_ELEMENT_MARKERS = new Set<symbol>([\n  REACT_ELEMENT_TYPE as symbol,\n  REACT_LEGACY_ELEMENT_TYPE as symbol,\n])\n\n// Type-to-tag matchers tried in registration order from fiberFromChild's\n// fallback branch. Features register here for element types that aren't\n// marker-based (e.g. Portal, where element.type IS the symbol).\nconst TYPE_MATCHERS: TypeMatcher[] = []\n\nexport function registerRenderer(tag: FiberTag, fn: RenderFn): void {\n  RENDERERS[tag] = fn\n}\n\nexport function registerTypeMatcher(m: TypeMatcher): void {\n  TYPE_MATCHERS.push(m)\n}\n\nexport function registerElementMarker(sym: symbol): void {\n  ACCEPTED_ELEMENT_MARKERS.add(sym)\n}\n\n// Accessor + scoped setter for the module-level `currentRoot`. Feature modules\n// need these to participate in the render loop (e.g. Suspense re-hydration\n// must temporarily set the root while rebuilding a boundary subtree).\nexport function getCurrentRoot(): FiberRoot | null {\n  return currentRoot\n}\n\nexport function withCurrentRoot<T>(root: FiberRoot | null, fn: () => T): T {\n  const prev = currentRoot\n  currentRoot = root\n  try {\n    return fn()\n  } finally {\n    currentRoot = prev\n  }\n}\n\n// The memo feature uses this to bypass its prop-equality gate on state-driven\n// rerenders of the memoized fiber itself (hook update / subscribed store),\n// where props haven't changed by definition.\nexport function getForceRerenderingFiber(): Fiber | null {\n  return forceRerenderingFiber\n}\n\nregisterRenderer(FiberTag.Text, renderText)\nregisterRenderer(FiberTag.Host, renderHost)\nregisterRenderer(FiberTag.Function, renderFunction)\nregisterRenderer(FiberTag.Fragment, renderFragment)\n\nexport function renderFiber(fiber: Fiber, domParent: Node, anchor: Node | null): void {\n  const fn = RENDERERS[fiber.tag]\n  if (fn) fn(fiber, domParent, anchor)\n}\n\nfunction renderText(fiber: Fiber, domParent: Node, anchor: Node | null): void {\n  const text = fiber.pendingProps as string\n  // Identity-unchanged fast path: skip the native Text.data write entirely.\n  if (fiber.dom && fiber.memoizedProps === text) return\n  if (!fiber.dom) {\n    const hydrated = currentRoot?.hydrating ? adoptTextDom(fiber, fiber.parent!, text) : false\n    if (!hydrated) {\n      fiber.dom = document.createTextNode(text)\n      insertInto(domParent, fiber.dom, anchor)\n    }\n  } else {\n    // Past the fast path, and adoptTextDom already realigned `.data` on\n    // hydration \u2014 `.data !== text` here is guaranteed, so write directly.\n    ;(fiber.dom as Text).data = text\n  }\n  fiber.memoizedProps = text\n  // dirty cleared at rerender start; leaving true lets mid-render schedule persist\n}\n\nfunction renderHost(fiber: Fiber, domParent: Node, anchor: Node | null): void {\n  const props = fiber.pendingProps ?? {}\n  const prev = fiber.memoizedProps ?? {}\n  const type = fiber.type as string\n  const isSvg = type === 'svg' || (domParent as Element).namespaceURI === 'http://www.w3.org/2000/svg'\n\n  // <select value> must be applied AFTER children mount \u2014 setting `.value`\n  // on a `<select>` with no matching `<option>` yet resets it to empty. Same\n  // for `defaultValue` on first mount. Stash and replay.\n  const isSelect = type === 'select'\n  const deferredSelectValue =\n    isSelect && (props.value !== undefined || props.defaultValue !== undefined)\n      ? props.value !== undefined ? props.value : props.defaultValue\n      : undefined\n\n  if (!fiber.dom) {\n    const hydrated = currentRoot?.hydrating ? adoptHostDom(fiber, fiber.parent!) : false\n    if (!hydrated) {\n      fiber.dom = createHostNode(type, isSvg)\n      // Two passes so form-control attributes (notably <input type>) are in\n      // place before event handlers attach. setEventHandler reads the\n      // element's runtime state to decide the DOM event name (e.g. onChange\n      // \u2192 `input` vs `change`); binding before `type` is applied would\n      // attach to the wrong event for checkbox/radio/file inputs.\n      for (const k in props) {\n        if (isSelect && (k === 'value' || k === 'defaultValue')) continue\n        if (isEventProp(k)) continue\n        setProp(fiber.dom as Element, k, props[k], undefined, isSvg)\n      }\n      for (const k in props) {\n        if (!isEventProp(k)) continue\n        setProp(fiber.dom as Element, k, props[k], undefined, isSvg)\n      }\n      insertInto(domParent, fiber.dom, anchor)\n    }\n    attachRef(fiber, fiber.dom)\n  } else if (prev !== props) {\n    const el = fiber.dom as Element\n    // Single-pass diff. Defer changed event props into a small array so the\n    // `type-before-events` invariant the mount path needs (setEventHandler\n    // reads `el.type` to resolve onChange\u2192input vs change) still holds when\n    // a render flips both `type` and an event handler in the same pass.\n    // The vast majority of host updates have no events at all (e.g. data-*\n    // attributes flipping on a stable list), so the deferred array stays\n    // null and we collapse to one for-in over `props`.\n    let deferredEvents: string[] | null = null\n    for (const k in props) {\n      if (isSelect && (k === 'value' || k === 'defaultValue')) continue\n      if (isEventProp(k)) {\n        if (prev[k] !== props[k]) {\n          deferredEvents ||= []\n          deferredEvents.push(k)\n        }\n        continue\n      }\n      if (prev[k] !== props[k]) setProp(el, k, props[k], prev[k], isSvg)\n    }\n    // Removals \u2014 keys present in prev but not in props.\n    for (const k in prev) {\n      if (!(k in props)) setProp(el, k, undefined, prev[k], isSvg)\n    }\n    if (deferredEvents) {\n      for (let i = 0; i < deferredEvents.length; i++) {\n        const k = deferredEvents[i]!\n        setProp(el, k, props[k], prev[k], isSvg)\n      }\n    }\n    syncRefIfChanged(fiber, fiber.dom)\n  }\n\n  // Children go into this DOM node\n  reconcileChildren(fiber, childrenToArray(props.children), fiber.dom!, null)\n\n  // During hydration, if after reconciling all client-expected children we\n  // still have server DOM left in the cursor for this host, that's a\n  // structural mismatch (server produced more than client wants). Report.\n  // <head>/<html> are position-insensitive \u2014 leftover here is normal\n  // (Vite dev-style injections, SSR-only scripts, etc.).\n  if (currentRoot?.hydrating) {\n    const parentTag = (fiber.type as string).toLowerCase()\n    if (parentTag !== 'head' && parentTag !== 'html') {\n      const cursor = getHydrationCursor(fiber)\n      if (cursor) {\n        const leftover = cursor.remaining().filter(\n          (n) => n.nodeType === 1 || n.nodeType === 3,\n        )\n        if (leftover.length > 0 && currentRoot.onRecoverableError) {\n          currentRoot.onRecoverableError(\n            new Error(\n              `Hydration mismatch: server rendered ${leftover.length} extra ` +\n                `${leftover.length === 1 ? 'node' : 'nodes'} inside <${parentTag}> ` +\n                `that the client tree did not.`,\n            ),\n          )\n          for (const n of leftover) n.parentNode?.removeChild(n)\n        }\n      }\n    }\n  }\n\n  // Apply <select> value after options are mounted.\n  if (isSelect && deferredSelectValue !== undefined) {\n    const select = fiber.dom as HTMLSelectElement\n    if (Array.isArray(deferredSelectValue)) {\n      const asStrings = deferredSelectValue.map((v) => '' + v)\n      for (const opt of Array.from(select.options)) {\n        opt.selected = asStrings.includes(opt.value)\n      }\n    } else {\n      select.value = '' + deferredSelectValue\n    }\n  }\n\n  fiber.memoizedProps = props\n  // dirty cleared at rerender start; leaving true lets mid-render schedule persist\n}\n\nfunction renderFunction(fiber: Fiber, domParent: Node, anchor: Node | null): void {\n  const prevDispatcher = ReactSharedInternals.H\n  const prevFiber = ReactSharedInternals.currentFiber\n  const prevHook = ReactSharedInternals.currentHook\n  const prevIndex = ReactSharedInternals.hookIndex\n\n  ReactSharedInternals.H = makeDispatcher()\n  ReactSharedInternals.currentFiber = fiber\n  ReactSharedInternals.currentHook = null\n  ReactSharedInternals.hookIndex = 0\n\n  let rendered: ReactNode\n  let deferredForHydration = false\n  try {\n    rendered = (fiber.type as Function)(fiber.pendingProps ?? {})\n  } catch (e: any) {\n    if (isThenable(e)) {\n      if (currentRoot?.hydrating) {\n        // Suspension during initial hydration. Leave the existing DOM alone\n        // and preserve the in-scope hydration cursor on THIS fiber so it\n        // survives the synchronous endHydration() that fires when the initial\n        // hydrateRoot() call returns. When the promise settles, the fiber\n        // re-renders (see rerenderFiber) with hydration re-activated and its\n        // descendants adopt DOM instead of creating new nodes.\n        const hostParent = findHydrationHost(fiber)\n        const inheritedCursor = getHydrationCursor(hostParent)\n        if (inheritedCursor) {\n          setHydrationCursor(fiber, inheritedCursor)\n        }\n        fiber.memoizedState = {\n          ...(fiber.memoizedState ?? {}),\n          _pendingHydration: true,\n        }\n        // Mirror renderLazy's guard: mark the nearest Suspense ancestor as\n        // awaiting hydration-resume, so any re-render of that Suspense (e.g.\n        // rehydrateBoundary fired by $RC, or an unrelated state update from a\n        // sibling) doesn't re-enter `tryChildren`, re-throw, and flip Suspense\n        // into its suspended+pending path \u2014 which would unmount our deferred\n        // subtree and remount a fallback on top of the SSR content. By\n        // pinning the Suspense to a \"hydration-suspended\" no-op until our\n        // resume fires, the deferred re-render owns the adoption pass.\n        let sus: Fiber | null = fiber.parent\n        while (sus && sus.tag !== FiberTag.Suspense) sus = sus.parent\n        if (sus && sus.memoizedState) {\n          ;(sus.memoizedState as any)._awaitingLazyHydration = true\n        }\n        const clearAwait = () => {\n          if (sus && sus.memoizedState) {\n            ;(sus.memoizedState as any)._awaitingLazyHydration = false\n          }\n          scheduleUpdate(fiber)\n        }\n        e.then(clearAwait, clearAwait)\n        deferredForHydration = true\n      } else {\n        CAPABILITIES.handleSuspended(fiber, e)\n        rendered = null\n      }\n    } else {\n      handleErrorInRender(fiber, e)\n      return\n    }\n  } finally {\n    ReactSharedInternals.H = prevDispatcher\n    ReactSharedInternals.currentFiber = prevFiber\n    ReactSharedInternals.currentHook = prevHook\n    ReactSharedInternals.hookIndex = prevIndex\n  }\n\n  if (deferredForHydration) return\n\n  reconcileChildren(fiber, childrenToArray(rendered), domParent, anchor)\n  fiber.memoizedProps = fiber.pendingProps\n  // dirty cleared at rerender start; leaving true lets mid-render schedule persist\n}\n\nfunction hasAncestorHydrationCursor(_fiber: Fiber): boolean {\n  // Reserved for future per-Suspense-boundary hydration deferral. For now the\n  // top-level hydration path is all we need to special-case.\n  return false\n}\n\nfunction renderFragment(fiber: Fiber, domParent: Node, anchor: Node | null): void {\n  const props = fiber.pendingProps ?? {}\n  reconcileChildren(fiber, childrenToArray(props.children), domParent, anchor)\n  fiber.memoizedProps = props\n  // dirty cleared at rerender start; leaving true lets mid-render schedule persist\n}\n\n// ---------------------------------------------------------------------------\n// Error handling + default Suspense capability\n// ---------------------------------------------------------------------------\n\n// Default handler when the Suspense feature isn't installed: just schedule\n// a re-render when the thrown thenable settles. No boundary walk, no\n// fallback swap \u2014 children render empty during the pending window.\nfunction defaultHandleSuspended(fiber: Fiber, thenable: Promise<any>): void {\n  thenable.then(\n    () => scheduleUpdate(fiber),\n    () => scheduleUpdate(fiber),\n  )\n}\n\n// ---------------------------------------------------------------------------\n// Capability hooks \u2014 cross-cutting behaviors that features override.\n// Defaults here preserve today's behavior so the indirection is transparent\n// when all features are loaded. A feature's full-module can install its own\n// implementation via installCapability(); stubs leave the default in place,\n// where the default may intentionally degrade (e.g. a no-Context build's\n// readContext never walks the tree because no Provider fibers exist).\n// ---------------------------------------------------------------------------\n\nexport interface Capabilities {\n  handleSuspended: (fiber: Fiber, thenable: Promise<any>) => void\n  readContext: (fiber: Fiber, ctx: any) => any\n}\n\nconst CAPABILITIES: Capabilities = {\n  handleSuspended: defaultHandleSuspended,\n  readContext: defaultReadContext,\n}\n\nexport function installCapability<K extends keyof Capabilities>(\n  name: K,\n  fn: Capabilities[K],\n): void {\n  CAPABILITIES[name] = fn\n}\n\n// Wrapper for features that catch thrown thenables inside their render\n// functions. Delegates to the installed Suspense capability.\nexport function handleSuspended(fiber: Fiber, thenable: Promise<any>): void {\n  CAPABILITIES.handleSuspended(fiber, thenable)\n}\n\nexport function handleErrorInRender(fiber: Fiber, err: any): void {\n  // Bubble to nearest class boundary with getDerivedStateFromError / componentDidCatch\n  let f: Fiber | null = fiber.parent\n  while (f) {\n    if (f.tag === FiberTag.Class) {\n      const Ctor = f.type as any\n      const instance = f.stateNode\n      if (Ctor.getDerivedStateFromError) {\n        const update = Ctor.getDerivedStateFromError(err)\n        instance.state = { ...instance.state, ...update }\n      }\n      if (instance.componentDidCatch) {\n        try {\n          instance.componentDidCatch(err, { componentStack: '' })\n        } catch {}\n      }\n      scheduleUpdate(f)\n      return\n    }\n    f = f.parent\n  }\n  // No boundary \u2014 report to root\n  if (currentRoot?.onUncaughtError) currentRoot.onUncaughtError(err)\n  else throw err\n}\n\nexport function isThenable(x: any): x is Promise<any> {\n  return x != null && typeof x.then === 'function'\n}\n\n// ---------------------------------------------------------------------------\n// Unmount\n// ---------------------------------------------------------------------------\n\nfunction unmountFiber(fiber: Fiber, domParent: Node): void {\n  fiber.unmounted = true\n  // Recurse first\n  let c = fiber.child\n  while (c) {\n    const next = c.sibling\n    unmountFiber(c, fiber.tag === FiberTag.Host ? fiber.dom! : domParent)\n    c = next\n  }\n  fiber.child = null\n\n  // Run cleanups (effects + layout effects)\n  if (fiber.cleanups) {\n    for (const cleanup of fiber.cleanups) {\n      try {\n        cleanup()\n      } catch (e) {\n        if (currentRoot?.onRecoverableError) currentRoot.onRecoverableError(e)\n      }\n    }\n    fiber.cleanups = null\n  }\n\n  if (fiber.tag === FiberTag.Class && fiber.stateNode?.componentWillUnmount) {\n    try {\n      fiber.stateNode.componentWillUnmount()\n    } catch (e) {\n      if (currentRoot?.onRecoverableError) currentRoot.onRecoverableError(e)\n    }\n    fiber.stateNode._fiber = null\n    fiber.stateNode._enqueueUpdate = null\n    fiber.stateNode._forceUpdate = null\n  }\n\n  // Detach ref\n  if (fiber.ref) detachRef(fiber.ref)\n\n  // Remove DOM if host\n  if (fiber.tag === FiberTag.Host && fiber.dom && fiber.dom.parentNode) {\n    fiber.dom.parentNode.removeChild(fiber.dom)\n  } else if (fiber.tag === FiberTag.Text && fiber.dom && fiber.dom.parentNode) {\n    fiber.dom.parentNode.removeChild(fiber.dom)\n  }\n}\n\nexport function unmountAllChildren(parent: Fiber, domParent: Node): void {\n  let c = parent.child\n  while (c) {\n    const next = c.sibling\n    unmountFiber(c, domParent)\n    c = next\n  }\n  parent.child = null\n}\n\n// ---------------------------------------------------------------------------\n// DOM navigation helpers\n// ---------------------------------------------------------------------------\n\nfunction insertInto(parent: Node, node: Node, anchor: Node | null): void {\n  // Anchor may have been removed or moved since it was computed (mutations\n  // from unmount, boundary reveal, user code, HMR). If it's no longer a child\n  // of `parent`, fall back to append \u2014 trying to insertBefore a non-child\n  // throws NotFoundError and dev-loops the reconciler.\n  if (anchor && anchor.parentNode === parent) {\n    parent.insertBefore(node, anchor)\n  } else {\n    parent.appendChild(node)\n  }\n}\n\nfunction getHostParent(fiber: Fiber): Node {\n  let p = fiber.parent\n  while (p) {\n    if (p.tag === FiberTag.Host) return p.dom!\n    if (p.tag === FiberTag.Root)\n      return (p.stateNode as Node) || (p.dom as Node) || (p.root?.container as Node)\n    if (p.tag === FiberTag.Portal) {\n      // Portal renders its children into the `container` prop, not into any\n      // DOM element the portal fiber \"owns\". Read the container from the\n      // portal's own props so a rerenderFiber triggered on a descendant\n      // (e.g. a Floating-UI-positioned popper in a Radix Portal) finds its\n      // host parent \u2014 otherwise getHostParent returns undefined and the\n      // next renderHost crashes reading `.namespaceURI` on undefined.\n      const props = (p.pendingProps ?? p.memoizedProps) as { container?: Element } | null\n      return (props?.container as Node) || (p.stateNode as Node) || (p.dom as Node) || (p.root?.container as Node)\n    }\n    p = p.parent\n  }\n  throw new Error('No host parent found.')\n}\n\nfunction getAnchor(fiber: Fiber): Node | null {\n  // Return the first DOM node that comes after this fiber within the host parent\n  let f: Fiber | null = fiber.sibling\n  while (f) {\n    const d = firstDomNode(f)\n    if (d) return d\n    f = f.sibling\n  }\n  // Ascend\n  let p = fiber.parent\n  while (p && p.tag !== FiberTag.Host && p.tag !== FiberTag.Root && p.tag !== FiberTag.Portal) {\n    if (p.sibling) {\n      const d = firstDomNode(p.sibling)\n      if (d) return d\n    }\n    p = p.parent\n  }\n  return null\n}\n\nfunction firstDomNode(fiber: Fiber): Node | null {\n  if (fiber.tag === FiberTag.Host || fiber.tag === FiberTag.Text) return fiber.dom\n  let c = fiber.child\n  while (c) {\n    const d = firstDomNode(c)\n    if (d) return d\n    c = c.sibling\n  }\n  return null\n}\n\n// ---------------------------------------------------------------------------\n// Context read \u2014 exported for dispatcher.ts (useContext, use()). Delegates to\n// the installed capability so the Context feature can override with a walking\n// implementation that finds the nearest Provider fiber. When the feature is\n// stubbed, the default here returns ctx._currentValue \u2014 correct because no\n// Provider fibers exist in the tree (Provider element \u2192 Fragment via the\n// stub's type matcher).\n// ---------------------------------------------------------------------------\n\nexport function readContext(fiber: Fiber, ctx: any): any {\n  return CAPABILITIES.readContext(fiber, ctx)\n}\n\nfunction defaultReadContext(_fiber: Fiber, ctx: any): any {\n  return ctx._currentValue\n}\n\n// ---------------------------------------------------------------------------\n// Refs\n// ---------------------------------------------------------------------------\n\nfunction attachRef(fiber: Fiber, value: any): void {\n  const ref = fiber.ref ?? (fiber.pendingProps?.ref ?? null)\n  if (!ref) return\n  if (typeof ref === 'function') {\n    // Match React's commit-phase semantics: callback refs run after render\n    // (during the layout/commit phase), not during render. Calling them\n    // synchronously here breaks libraries that assert no event handlers run\n    // during render (e.g. base-ui's useStableCallback trampoline).\n    scheduleLifecycle(fiber, () => {\n      const cleanup = ref(value)\n      fiber.cleanups ||= []\n      fiber.cleanups.push(typeof cleanup === 'function' ? cleanup : () => ref(null))\n    })\n  } else {\n    ref.current = value\n  }\n}\n\nfunction syncRefIfChanged(fiber: Fiber, value: any): void {\n  const ref = fiber.ref ?? (fiber.pendingProps?.ref ?? null)\n  if (!ref) return\n  if (typeof ref === 'object' && ref.current !== value) ref.current = value\n}\n\nfunction detachRef(ref: any): void {\n  // Function refs are handled via fiber.cleanups (queued in attachRef during\n  // the commit phase): the cleanup either invokes the user-returned cleanup\n  // fn or calls ref(null). Calling ref(null) here would double-fire it.\n  if (ref && typeof ref === 'object') {\n    ref.current = null\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Effects\n// ---------------------------------------------------------------------------\n\nconst pendingEffects: Array<{ fiber: Fiber; effect: Effect }> = []\nconst pendingLayoutEffects: Array<{ fiber: Fiber; effect: Effect }> = []\nconst pendingLifecycles: Array<{ fiber: Fiber; fn: () => void }> = []\n\nexport function enqueueEffect(fiber: Fiber, effect: Effect): void {\n  if (effect.tag === 'layout' || effect.tag === 'insertion') {\n    pendingLayoutEffects.push({ fiber, effect })\n  } else {\n    pendingEffects.push({ fiber, effect })\n  }\n}\n\nexport function scheduleLifecycle(fiber: Fiber, fn: () => void): void {\n  pendingLifecycles.push({ fiber, fn })\n}\n\nexport function runEffects(root: FiberRoot): void {\n  // Layout effects synchronously\n  while (pendingLayoutEffects.length) {\n    const { fiber, effect } = pendingLayoutEffects.shift()!\n    runEffect(fiber, effect, root)\n  }\n  // Then lifecycles\n  while (pendingLifecycles.length) {\n    const { fn } = pendingLifecycles.shift()!\n    try {\n      fn()\n    } catch (e) {\n      if (root.onCaughtError) root.onCaughtError(e)\n    }\n  }\n  // Passive effects on microtask\n  if (pendingEffects.length) {\n    const batch = pendingEffects.splice(0)\n    queueMicrotask(() => {\n      for (const { fiber, effect } of batch) runEffect(fiber, effect, root)\n    })\n  }\n}\n\nfunction runEffect(fiber: Fiber, effect: Effect, root: FiberRoot): void {\n  try {\n    const cleanup = effect.create()\n    effect.destroy = typeof cleanup === 'function' ? cleanup : undefined\n    if (effect.destroy) {\n      fiber.cleanups ||= []\n      fiber.cleanups.push(effect.destroy)\n    }\n  } catch (e) {\n    if (root.onCaughtError) root.onCaughtError(e)\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Utilities\n// ---------------------------------------------------------------------------\n\nfunction isEventProp(name: string): boolean {\n  return (\n    name.length > 2 &&\n    name.charCodeAt(0) === 111 /* o */ &&\n    name.charCodeAt(1) === 110 /* n */ &&\n    name.charCodeAt(2) >= 65 /* 'A'-ish: any uppercase start (onClick, onChange, \u2026) */\n  )\n}\n\n"],
+  "mappings": ";AAAA;AAAA,EACE;AAAA,EAEA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OAOK;AACP;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OACK;AACP,SAAS,gBAAgB,eAAe;AACxC,SAAS,sBAAsB;AAC/B;AAAA,EACE;AAAA,EACA;AAAA,EAGA;AAAA,EACA;AAAA,EACA;AAAA,EAEA,kBAAkB;AAAA,OACb;AAMP,IAAI,cAAgC;AACpC,IAAI,WAAW;AACf,IAAI,aAAa;AACjB,IAAM,eAAe,oBAAI,IAAe;AAUxC,IAAI,wBAAsC;AAEnC,SAAS,eAAe,OAAoB;AAKjD,MAAI,MAAM,UAAW;AACrB,QAAM,OAAO,SAAS,KAAK;AAC3B,MAAI,CAAC,KAAM;AACX,OAAK,QAAQ,IAAI,KAAK;AACtB,QAAM,QAAQ;AACd,eAAa,IAAI,IAAI;AACrB,MAAI,WAAY;AAChB,MAAI,CAAC,KAAK,WAAW;AACnB,SAAK,YAAY;AACjB,mBAAe,YAAY;AAAA,EAC7B;AACF;AAEO,SAAS,cAAc,IAAsB;AAClD,QAAM,cAAc;AACpB,eAAa;AACb,MAAI;AACF,OAAG;AAAA,EACL,UAAE;AACA,iBAAa;AAAA,EACf;AACA,eAAa;AACf;AAEO,SAAS,eAAkB,IAAgB;AAChD,QAAM,cAAc;AACpB,eAAa;AACb,MAAI;AACF,WAAO,GAAG;AAAA,EACZ,UAAE;AACA,iBAAa;AACb,QAAI,CAAC,YAAa,cAAa;AAAA,EACjC;AACF;AAEA,SAAS,eAAqB;AAC5B,MAAI,SAAU;AACd,aAAW;AACX,MAAI;AACF,QAAI,QAAQ;AACZ,WAAO,aAAa,OAAO,GAAG;AAC5B,UAAI,EAAE,QAAQ,IAAI;AAChB,cAAM,IAAI,MAAM,4EAAuE;AAAA,MACzF;AACA,YAAM,QAAQ,CAAC,GAAG,YAAY;AAC9B,mBAAa,MAAM;AACnB,iBAAW,QAAQ,OAAO;AACxB,aAAK,YAAY;AAUjB,cAAM,UAAU,CAAC,GAAG,KAAK,OAAO;AAChC,aAAK,QAAQ,MAAM;AACnB,gBAAQ,KAAK,CAAC,GAAG,MAAM,WAAW,CAAC,IAAI,WAAW,CAAC,CAAC;AACpD,mBAAW,SAAS,SAAS;AAC3B,wBAAc,OAAO,IAAI;AAAA,QAC3B;AACA,mBAAW,IAAI;AAAA,MACjB;AAAA,IACF;AAAA,EACF,UAAE;AACA,eAAW;AAAA,EACb;AACF;AAEA,SAAS,WAAW,OAAsB;AACxC,MAAI,IAAI;AACR,MAAI,IAAkB,MAAM;AAC5B,SAAO,GAAG;AACR;AACA,QAAI,EAAE;AAAA,EACR;AACA,SAAO;AACT;AAEO,SAAS,SAAS,OAAgC;AACvD,MAAI,IAAkB;AACtB,SAAO,GAAG;AACR,QAAI,EAAE,KAAM,QAAO,EAAE;AACrB,QAAI,EAAE;AAAA,EACR;AACA,SAAO;AACT;AAMO,SAAS,WAAW,MAAiB,UAA2B;AACrE,QAAM,YAAY,KAAK;AACvB,YAAU,eAAe,EAAE,SAAS;AACpC,gBAAc;AACd,MAAI;AACF,sBAAkB,WAAW,gBAAgB,QAAQ,GAAG,KAAK,WAAmB,IAAI;AACpF,cAAU,gBAAgB,UAAU;AACpC,cAAU,QAAQ;AAAA,EACpB,UAAE;AACA,kBAAc;AAAA,EAChB;AACA,aAAW,IAAI;AACjB;AAEA,SAAS,cAAc,OAAc,MAAuB;AAC1D,MAAI,CAAC,MAAM,MAAO;AAQlB,MAAI,MAAM,UAAW;AAIrB,QAAM,QAAQ;AACd,gBAAc;AAId,QAAM,kBACJ,MAAM,iBAAkB,MAAM,cAAsB,sBAAsB;AAC5E,QAAM,gBAAgB,KAAK;AAC3B,MAAI,iBAAiB;AACnB,WAAQ,MAAM,cAAsB;AACpC,SAAK,YAAY;AAAA,EACnB;AACA,QAAM,cAAc;AACpB,0BAAwB;AACxB,MAAI;AACF,gBAAY,OAAO,cAAc,KAAK,GAAG,UAAU,KAAK,CAAC;AAAA,EAC3D,UAAE;AACA,4BAAwB;AACxB,QAAI,iBAAiB;AACnB,WAAK,YAAY;AAGjB,2BAAqB,KAAK;AAAA,IAC5B;AACA,kBAAc;AAAA,EAChB;AACF;AAaA,SAAS,YAAY,OAAwD;AAC3E,SAAO,OAAO,UAAU;AAC1B;AAEO,SAAS,gBAAgB,UAAwC;AACtE,QAAM,MAAyB,CAAC;AAChC,eAAa,UAAU,GAAG;AAC1B,SAAO;AACT;AAEA,SAAS,aAAa,MAAiB,KAA8B;AACnE,MAAI,QAAQ,QAAQ,OAAO,SAAS,UAAW;AAC/C,MAAI,OAAO,SAAS,UAAU;AAG5B,QAAI,SAAS,GAAI;AACjB,QAAI,KAAK,IAAI;AACb;AAAA,EACF;AACA,MAAI,OAAO,SAAS,UAAU;AAC5B,QAAI,KAAK,KAAK,IAAI;AAClB;AAAA,EACF;AACA,MAAI,MAAM,QAAQ,IAAI,GAAG;AACvB,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,IAAK,cAAa,KAAK,CAAC,GAAG,GAAG;AAC/D;AAAA,EACF;AACA,MAAI,WAAW,IAAI,GAAG;AACpB,eAAW,QAAQ,KAA6B,cAAa,MAAM,GAAG;AACtE;AAAA,EACF;AACA,MAAI,OAAO,SAAS,UAAU;AAC5B,UAAM,IAAK,KAAa;AACxB,QAAI,yBAAyB,IAAI,CAAC,GAAG;AACnC,UAAI,KAAK,IAAoB;AAC7B;AAAA,IACF;AAOA,QAAI,MAAM,iBAAiB;AACzB,YAAM,OAAO;AACb,YAAM,WAAW,KAAK,MAAM,KAAK,QAAQ;AACzC,mBAAa,UAAU,GAAG;AAC1B;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,WAAW,KAAmB;AACrC,SAAO,OAAO,QAAQ,OAAO,QAAQ,YAAY,OAAO,IAAI,OAAO,QAAQ,MAAM;AACnF;AASA,SAAS,SAAS,OAAc,OAAiC;AAC/D,MAAI,CAAC,MAAO,QAAO;AACnB,MAAI,YAAY,KAAK,EAAG,QAAO,MAAM,QAAQ,SAAS;AACtD,SAAO,MAAM,SAAS,MAAM,QAAQ,QAAQ,MAAM,KAAK,MAAM,GAAG;AAClE;AAEA,SAAS,QAAQ,GAAkB,GAAuC;AACxE,UAAQ,KAAK,WAAW,KAAK;AAC/B;AAMA,SAAS,eAAe,OAAwB,QAAsB;AACpE,MAAI,CAAC,MAAO,QAAO,YAAY,SAAS,UAAU,MAAM,IAAI;AAC5D,MAAI,YAAY,KAAK,GAAG;AACtB,UAAMA,KAAI,YAAY,SAAS,MAAM,MAAM,IAAI;AAC/C,IAAAA,GAAE,eAAe;AACjB,IAAAA,GAAE,SAAS;AACX,WAAOA;AAAA,EACT;AACA,QAAM,OAAO,MAAM;AACnB,MAAI,MAAgB,SAAS;AAC7B,QAAM,SAAS,QAAS,KAAa;AACrC,MAAI,OAAO,SAAS,SAAU,OAAM,SAAS;AAAA,WACpC,SAAS,oBAAqB,OAAM,SAAS;AAAA,WAC7C,SAAS,0BAA0B,SAAS,oBAAqB,OAAM,SAAS;AAAA,OACpF;AAIH,QAAI,UAA2B;AAC/B,eAAW,KAAK,eAAe;AAC7B,gBAAU,EAAE,MAAM,MAAM;AACxB,UAAI,YAAY,KAAM;AAAA,IACxB;AACA,QAAI,YAAY,KAAM,OAAM;AAAA,aACnB,OAAO,SAAS,YAAY;AACnC,YAAM,KAAK,aAAa,KAAK,UAAU,mBAAmB,SAAS,QAAQ,SAAS;AAAA,IACtF;AAAA,EACF;AACA,QAAM,IAAI,YAAY,KAAK,MAAM,MAAM,OAAO,IAAI;AAClD,IAAE,MAAO,MAAc,OAAO;AAC9B,IAAE,eAAe,MAAM;AACvB,IAAE,SAAS;AACX,SAAO;AACT;AAWO,SAAS,kBACd,QACA,aACA,WACA,QACM;AAMN,MAAI,CAAC,aAAa,WAAW;AAC3B,QAAI,IAAkB,OAAO;AAC7B,QAAI,KAAK;AACT,aAAS,IAAI,GAAG,IAAI,YAAY,QAAQ,KAAK;AAC3C,YAAM,QAAQ,YAAY,CAAC;AAC3B,UAAI,SAAS,QAAQ,CAAC,KAAK,EAAE,OAAO,MAAM;AAAE,aAAK;AAAO;AAAA,MAAM;AAC9D,UAAI,OAAO,UAAU,UAAU;AAC7B,YAAI,EAAE,QAAQ,SAAS,MAAM;AAAE,eAAK;AAAO;AAAA,QAAM;AACjD,UAAE,eAAe;AAAA,MACnB,OAAO;AACL,YAAK,MAAuB,OAAO,MAAM;AAAE,eAAK;AAAO;AAAA,QAAM;AAC7D,YAAI,EAAE,SAAU,MAAuB,MAAM;AAAE,eAAK;AAAO;AAAA,QAAM;AACjE,UAAE,eAAgB,MAAuB;AACzC,UAAE,MAAO,MAAc,OAAO;AAAA,MAChC;AACA,UAAI,EAAE;AAAA,IACR;AACA,QAAI,MAAM,MAAM,MAAM;AAGpB,eAAS,IAAkB,OAAO,OAAO,GAAG,IAAI,EAAE,SAAS;AACzD,YAAI,IAAI;AACR,iBAAS,IAAkB,EAAE,SAAS,GAAG,IAAI,EAAE,SAAS;AACtD,gBAAM,IAAI,aAAa,CAAC;AACxB,cAAI,KAAK,EAAE,eAAe,WAAW;AAAE,gBAAI;AAAG;AAAA,UAAM;AAAA,QACtD;AACA,oBAAY,GAAG,WAAW,CAAC;AAAA,MAC7B;AACA;AAAA,IACF;AAAA,EACF;AAEA,QAAM,WAAW,gBAAgB,MAAM;AACvC,QAAM,QAAQ,oBAAI,IAAmB;AACrC,aAAW,KAAK,UAAU;AACxB,QAAI,EAAE,OAAO,KAAM,OAAM,IAAI,MAAM,EAAE,KAAK,CAAC;AAAA,EAC7C;AAEA,MAAI,eAA6B;AACjC,QAAM,UAAU,oBAAI,IAAW;AAC/B,MAAI,sBAAsB;AAc1B,MAAI,cAAc;AAClB,MAAI,aAAa;AACjB,aAAW,KAAK,SAAU,KAAI,EAAE,OAAO,KAAM;AAC7C,MAAI,aAAa;AACjB,aAAW,KAAK,YAAa,KAAI,KAAK,KAAM;AAC5C,MAAI,SAAS,aAAa;AAY1B,WAAS,IAAI,GAAG,IAAI,YAAY,QAAQ,KAAK;AAC3C,UAAM,QAAQ,YAAY,CAAC;AAC3B,QAAI,SAAS,KAAM;AAEnB,QAAI,QAAsB;AAG1B,QAAI,SAAS,OAAO,UAAU,YAAY,CAAC,YAAY,KAAK,KAAM,MAAuB,OAAO,MAAM;AACpG,YAAM,IAAI,MAAO,MAAuB;AACxC,YAAM,IAAI,MAAM,IAAI,CAAC;AACrB,UAAI,KAAK,EAAE,SAAU,MAAuB,MAAM;AAChD,gBAAQ;AACR,cAAM,OAAO,CAAC;AAAA,MAChB;AAAA,IACF;AAEA,QAAI,CAAC,OAAO;AACV,aAAO,cAAc,SAAS,QAAQ;AACpC,cAAM,OAAO,SAAS,WAAW;AACjC,YAAI,QAAQ,IAAI,IAAI,KAAK,KAAK,OAAO,MAAM;AACzC;AACA;AAAA,QACF;AACA,YAAI,SAAS,MAAM,KAAK,GAAG;AACzB,kBAAQ;AACR;AACA;AAAA,QACF;AAEA,YAAI,SAAS,GAAG;AAEd;AAAA,QACF;AAGA;AACA;AAAA,MACF;AAAA,IACF;AAGA,QAAI,SAAS,SAAS,CAAC,MAAM,MAAO,uBAAsB;AAE1D,QAAI;AACJ,QAAI,OAAO;AACT,cAAQ,IAAI,KAAK;AACjB,cAAQ;AACR,UAAI,YAAY,KAAM,GAAG;AACvB,cAAM,eAAe;AAAA,MACvB,OAAO;AACL,cAAM,OAAQ,MAAuB;AACrC,cAAM,eAAgB,MAAuB;AAC7C,cAAM,MAAO,MAAc,OAAO;AAAA,MACpC;AAAA,IACF,OAAO;AACL,cAAQ,eAAe,OAAO,MAAM;AACpC,4BAAsB;AACtB,UAAI,SAAS,EAAG;AAAA,IAClB;AAEA,UAAM,SAAS;AACf,UAAM,UAAU;AAChB,QAAI,aAAc,cAAa,UAAU;AAAA,QACpC,QAAO,QAAQ;AACpB,mBAAe;AAAA,EACjB;AAMA,QAAM,YAAY,CAAC,CAAC,aAAa;AACjC,WAAS,IAAkB,OAAO,OAAO,GAAG,IAAI,EAAE,SAAS;AACzD,QAAI,IAAI;AACR,QAAI,CAAC,WAAW;AAEd,eAAS,IAAkB,EAAE,SAAS,GAAG,IAAI,EAAE,SAAS;AACtD,cAAM,IAAI,aAAa,CAAC;AACxB,YAAI,KAAK,EAAE,eAAe,WAAW;AAAE,cAAI;AAAG;AAAA,QAAM;AAAA,MACtD;AAAA,IACF;AACA,gBAAY,GAAG,WAAW,CAAC;AAAA,EAC7B;AAEA,MAAI,CAAC,aAAc,QAAO,QAAQ;AAAA,MAC7B,cAAa,UAAU;AAM5B,QAAM,mBACJ,OAAO,QAAQ,SAAS,QACxB,OAAO,OAAO,SAAS,YACtB,OAAO,KAAgB,YAAY,MAAM;AAE5C,MAAI,CAAC,kBAAkB;AAErB,eAAW,KAAK,UAAU;AACxB,UAAI,CAAC,QAAQ,IAAI,CAAC,GAAG;AACnB,qBAAa,GAAG,SAAS;AACzB,8BAAsB;AAAA,MACxB;AAAA,IACF;AAEA,eAAW,KAAK,MAAM,OAAO,GAAG;AAC9B,UAAI,CAAC,QAAQ,IAAI,CAAC,GAAG;AACnB,qBAAa,GAAG,SAAS;AACzB,8BAAsB;AAAA,MACxB;AAAA,IACF;AAAA,EACF;AAYA,QAAM,eACH,UAAsB,aAAa,KACnC,UAAsB,QAAQ,YAAY,MAAM;AACnD,MAAI,uBAAuB,CAAC,aAAa,aAAa,CAAC,cAAc;AACnE,yBAAqB,QAAQ,WAAW,MAAM;AAAA,EAChD;AACF;AAEA,SAAS,qBAAqB,QAAe,WAAiB,QAA2B;AACvF,QAAM,OAAe,CAAC;AACtB,MAAI,IAAI,OAAO;AACf,SAAO,GAAG;AACR,oBAAgB,GAAG,IAAI;AACvB,QAAI,EAAE;AAAA,EACR;AAMA,MAAI,KAAK,SAAS,GAAG;AACnB,QAAI,UAAuB,KAAK,CAAC;AACjC,QAAI,UAAU,QAAQ,eAAe;AACrC,aAAS,IAAI,GAAG,WAAW,IAAI,KAAK,QAAQ,KAAK;AAC/C,gBAAU,QAAS;AAGnB,aAAO,WAAW,CAAC,KAAK,SAAS,OAAe,GAAG;AACjD,kBAAU,QAAQ;AAAA,MACpB;AACA,UAAI,YAAY,KAAK,CAAC,EAAG,WAAU;AAAA,IACrC;AAUA,QAAI,SAAS;AACX,UAAI,OAAoB,KAAK,KAAK,SAAS,CAAC,EAAG;AAC/C,aAAO,QAAQ,CAAC,KAAK,SAAS,IAAY,KAAK,SAAS,QAAQ;AAC9D,eAAO,KAAK;AAAA,MACd;AACA,UAAI,SAAS,OAAQ,WAAU;AAAA,IACjC;AACA,QAAI,QAAS;AAAA,EACf;AAeA,WAAS,IAAI,KAAK,SAAS,GAAG,KAAK,GAAG,KAAK;AACzC,UAAM,IAAI,KAAK,CAAC;AAChB,UAAM,aAA0B,IAAI,IAAI,KAAK,SAAS,KAAK,IAAI,CAAC,IAAK;AACrE,QAAI,EAAE,eAAe,aAAa,EAAE,gBAAgB,YAAY;AAC9D,gBAAU,aAAa,GAAG,UAAU;AAAA,IACtC;AAAA,EACF;AACF;AAEA,SAAS,gBAAgB,OAAc,KAAmB;AACxD,MAAI,MAAM,QAAQ,SAAS,QAAQ,MAAM,QAAQ,SAAS,MAAM;AAC9D,QAAI,MAAM,IAAK,KAAI,KAAK,MAAM,GAAG;AACjC;AAAA,EACF;AACA,MAAI,MAAM,QAAQ,SAAS,OAAQ;AACnC,MAAI,IAAI,MAAM;AACd,SAAO,GAAG;AACR,oBAAgB,GAAG,GAAG;AACtB,QAAI,EAAE;AAAA,EACR;AACF;AAEA,SAAS,gBAAgB,QAAwB;AAC/C,QAAM,MAAe,CAAC;AACtB,MAAI,IAAI,OAAO;AACf,SAAO,GAAG;AACR,QAAI,KAAK,CAAC;AACV,QAAI,EAAE;AAAA,EACR;AACA,SAAO;AACT;AAaA,IAAM,YAAyC,IAAI,MAAM,EAAE;AAI3D,IAAM,2BAA2B,oBAAI,IAAY;AAAA,EAC/C;AAAA,EACA;AACF,CAAC;AAKD,IAAM,gBAA+B,CAAC;AAE/B,SAAS,iBAAiB,KAAe,IAAoB;AAClE,YAAU,GAAG,IAAI;AACnB;AAEO,SAAS,oBAAoB,GAAsB;AACxD,gBAAc,KAAK,CAAC;AACtB;AAEO,SAAS,sBAAsB,KAAmB;AACvD,2BAAyB,IAAI,GAAG;AAClC;AAKO,SAAS,iBAAmC;AACjD,SAAO;AACT;AAEO,SAAS,gBAAmB,MAAwB,IAAgB;AACzE,QAAM,OAAO;AACb,gBAAc;AACd,MAAI;AACF,WAAO,GAAG;AAAA,EACZ,UAAE;AACA,kBAAc;AAAA,EAChB;AACF;AAKO,SAAS,2BAAyC;AACvD,SAAO;AACT;AAEA,iBAAiB,SAAS,MAAM,UAAU;AAC1C,iBAAiB,SAAS,MAAM,UAAU;AAC1C,iBAAiB,SAAS,UAAU,cAAc;AAClD,iBAAiB,SAAS,UAAU,cAAc;AAE3C,SAAS,YAAY,OAAc,WAAiB,QAA2B;AACpF,QAAM,KAAK,UAAU,MAAM,GAAG;AAC9B,MAAI,GAAI,IAAG,OAAO,WAAW,MAAM;AACrC;AAEA,SAAS,WAAW,OAAc,WAAiB,QAA2B;AAC5E,QAAM,OAAO,MAAM;AAEnB,MAAI,MAAM,OAAO,MAAM,kBAAkB,KAAM;AAC/C,MAAI,CAAC,MAAM,KAAK;AACd,UAAM,WAAW,aAAa,YAAY,aAAa,OAAO,MAAM,QAAS,IAAI,IAAI;AACrF,QAAI,CAAC,UAAU;AACb,YAAM,MAAM,SAAS,eAAe,IAAI;AACxC,iBAAW,WAAW,MAAM,KAAK,MAAM;AAAA,IACzC;AAAA,EACF,OAAO;AAGL;AAAC,IAAC,MAAM,IAAa,OAAO;AAAA,EAC9B;AACA,QAAM,gBAAgB;AAExB;AAEA,SAAS,WAAW,OAAc,WAAiB,QAA2B;AAC5E,QAAM,QAAQ,MAAM,gBAAgB,CAAC;AACrC,QAAM,OAAO,MAAM,iBAAiB,CAAC;AACrC,QAAM,OAAO,MAAM;AACnB,QAAM,QAAQ,SAAS,SAAU,UAAsB,iBAAiB;AAKxE,QAAM,WAAW,SAAS;AAC1B,QAAM,sBACJ,aAAa,MAAM,UAAU,UAAa,MAAM,iBAAiB,UAC7D,MAAM,UAAU,SAAY,MAAM,QAAQ,MAAM,eAChD;AAEN,MAAI,CAAC,MAAM,KAAK;AACd,UAAM,WAAW,aAAa,YAAY,aAAa,OAAO,MAAM,MAAO,IAAI;AAC/E,QAAI,CAAC,UAAU;AACb,YAAM,MAAM,eAAe,MAAM,KAAK;AAMtC,iBAAW,KAAK,OAAO;AACrB,YAAI,aAAa,MAAM,WAAW,MAAM,gBAAiB;AACzD,YAAI,YAAY,CAAC,EAAG;AACpB,gBAAQ,MAAM,KAAgB,GAAG,MAAM,CAAC,GAAG,QAAW,KAAK;AAAA,MAC7D;AACA,iBAAW,KAAK,OAAO;AACrB,YAAI,CAAC,YAAY,CAAC,EAAG;AACrB,gBAAQ,MAAM,KAAgB,GAAG,MAAM,CAAC,GAAG,QAAW,KAAK;AAAA,MAC7D;AACA,iBAAW,WAAW,MAAM,KAAK,MAAM;AAAA,IACzC;AACA,cAAU,OAAO,MAAM,GAAG;AAAA,EAC5B,WAAW,SAAS,OAAO;AACzB,UAAM,KAAK,MAAM;AAQjB,QAAI,iBAAkC;AACtC,eAAW,KAAK,OAAO;AACrB,UAAI,aAAa,MAAM,WAAW,MAAM,gBAAiB;AACzD,UAAI,YAAY,CAAC,GAAG;AAClB,YAAI,KAAK,CAAC,MAAM,MAAM,CAAC,GAAG;AACxB,6BAAmB,CAAC;AACpB,yBAAe,KAAK,CAAC;AAAA,QACvB;AACA;AAAA,MACF;AACA,UAAI,KAAK,CAAC,MAAM,MAAM,CAAC,EAAG,SAAQ,IAAI,GAAG,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK;AAAA,IACnE;AAEA,eAAW,KAAK,MAAM;AACpB,UAAI,EAAE,KAAK,OAAQ,SAAQ,IAAI,GAAG,QAAW,KAAK,CAAC,GAAG,KAAK;AAAA,IAC7D;AACA,QAAI,gBAAgB;AAClB,eAAS,IAAI,GAAG,IAAI,eAAe,QAAQ,KAAK;AAC9C,cAAM,IAAI,eAAe,CAAC;AAC1B,gBAAQ,IAAI,GAAG,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK;AAAA,MACzC;AAAA,IACF;AACA,qBAAiB,OAAO,MAAM,GAAG;AAAA,EACnC;AAGA,oBAAkB,OAAO,gBAAgB,MAAM,QAAQ,GAAG,MAAM,KAAM,IAAI;AAO1E,MAAI,aAAa,WAAW;AAC1B,UAAM,YAAa,MAAM,KAAgB,YAAY;AACrD,QAAI,cAAc,UAAU,cAAc,QAAQ;AAChD,YAAM,SAAS,mBAAmB,KAAK;AACvC,UAAI,QAAQ;AACV,cAAM,WAAW,OAAO,UAAU,EAAE;AAAA,UAClC,CAAC,MAAM,EAAE,aAAa,KAAK,EAAE,aAAa;AAAA,QAC5C;AACA,YAAI,SAAS,SAAS,KAAK,YAAY,oBAAoB;AACzD,sBAAY;AAAA,YACV,IAAI;AAAA,cACF,uCAAuC,SAAS,MAAM,UACjD,SAAS,WAAW,IAAI,SAAS,OAAO,YAAY,SAAS;AAAA,YAEpE;AAAA,UACF;AACA,qBAAW,KAAK,SAAU,GAAE,YAAY,YAAY,CAAC;AAAA,QACvD;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAGA,MAAI,YAAY,wBAAwB,QAAW;AACjD,UAAM,SAAS,MAAM;AACrB,QAAI,MAAM,QAAQ,mBAAmB,GAAG;AACtC,YAAM,YAAY,oBAAoB,IAAI,CAAC,MAAM,KAAK,CAAC;AACvD,iBAAW,OAAO,MAAM,KAAK,OAAO,OAAO,GAAG;AAC5C,YAAI,WAAW,UAAU,SAAS,IAAI,KAAK;AAAA,MAC7C;AAAA,IACF,OAAO;AACL,aAAO,QAAQ,KAAK;AAAA,IACtB;AAAA,EACF;AAEA,QAAM,gBAAgB;AAExB;AAEA,SAAS,eAAe,OAAc,WAAiB,QAA2B;AAChF,QAAM,iBAAiB,qBAAqB;AAC5C,QAAM,YAAY,qBAAqB;AACvC,QAAM,WAAW,qBAAqB;AACtC,QAAM,YAAY,qBAAqB;AAEvC,uBAAqB,IAAI,eAAe;AACxC,uBAAqB,eAAe;AACpC,uBAAqB,cAAc;AACnC,uBAAqB,YAAY;AAEjC,MAAI;AACJ,MAAI,uBAAuB;AAC3B,MAAI;AACF,eAAY,MAAM,KAAkB,MAAM,gBAAgB,CAAC,CAAC;AAAA,EAC9D,SAAS,GAAQ;AACf,QAAI,WAAW,CAAC,GAAG;AACjB,UAAI,aAAa,WAAW;AAO1B,cAAM,aAAa,kBAAkB,KAAK;AAC1C,cAAM,kBAAkB,mBAAmB,UAAU;AACrD,YAAI,iBAAiB;AACnB,6BAAmB,OAAO,eAAe;AAAA,QAC3C;AACA,cAAM,gBAAgB;AAAA,UACpB,GAAI,MAAM,iBAAiB,CAAC;AAAA,UAC5B,mBAAmB;AAAA,QACrB;AASA,YAAI,MAAoB,MAAM;AAC9B,eAAO,OAAO,IAAI,QAAQ,SAAS,SAAU,OAAM,IAAI;AACvD,YAAI,OAAO,IAAI,eAAe;AAC5B;AAAC,UAAC,IAAI,cAAsB,yBAAyB;AAAA,QACvD;AACA,cAAM,aAAa,MAAM;AACvB,cAAI,OAAO,IAAI,eAAe;AAC5B;AAAC,YAAC,IAAI,cAAsB,yBAAyB;AAAA,UACvD;AACA,yBAAe,KAAK;AAAA,QACtB;AACA,UAAE,KAAK,YAAY,UAAU;AAC7B,+BAAuB;AAAA,MACzB,OAAO;AACL,qBAAa,gBAAgB,OAAO,CAAC;AACrC,mBAAW;AAAA,MACb;AAAA,IACF,OAAO;AACL,0BAAoB,OAAO,CAAC;AAC5B;AAAA,IACF;AAAA,EACF,UAAE;AACA,yBAAqB,IAAI;AACzB,yBAAqB,eAAe;AACpC,yBAAqB,cAAc;AACnC,yBAAqB,YAAY;AAAA,EACnC;AAEA,MAAI,qBAAsB;AAE1B,oBAAkB,OAAO,gBAAgB,QAAQ,GAAG,WAAW,MAAM;AACrE,QAAM,gBAAgB,MAAM;AAE9B;AAQA,SAAS,eAAe,OAAc,WAAiB,QAA2B;AAChF,QAAM,QAAQ,MAAM,gBAAgB,CAAC;AACrC,oBAAkB,OAAO,gBAAgB,MAAM,QAAQ,GAAG,WAAW,MAAM;AAC3E,QAAM,gBAAgB;AAExB;AASA,SAAS,uBAAuB,OAAc,UAA8B;AAC1E,WAAS;AAAA,IACP,MAAM,eAAe,KAAK;AAAA,IAC1B,MAAM,eAAe,KAAK;AAAA,EAC5B;AACF;AAgBA,IAAM,eAA6B;AAAA,EACjC,iBAAiB;AAAA,EACjB,aAAa;AACf;AAEO,SAAS,kBACd,MACA,IACM;AACN,eAAa,IAAI,IAAI;AACvB;AAIO,SAAS,gBAAgB,OAAc,UAA8B;AAC1E,eAAa,gBAAgB,OAAO,QAAQ;AAC9C;AAEO,SAAS,oBAAoB,OAAc,KAAgB;AAEhE,MAAI,IAAkB,MAAM;AAC5B,SAAO,GAAG;AACR,QAAI,EAAE,QAAQ,SAAS,OAAO;AAC5B,YAAM,OAAO,EAAE;AACf,YAAM,WAAW,EAAE;AACnB,UAAI,KAAK,0BAA0B;AACjC,cAAM,SAAS,KAAK,yBAAyB,GAAG;AAChD,iBAAS,QAAQ,EAAE,GAAG,SAAS,OAAO,GAAG,OAAO;AAAA,MAClD;AACA,UAAI,SAAS,mBAAmB;AAC9B,YAAI;AACF,mBAAS,kBAAkB,KAAK,EAAE,gBAAgB,GAAG,CAAC;AAAA,QACxD,QAAQ;AAAA,QAAC;AAAA,MACX;AACA,qBAAe,CAAC;AAChB;AAAA,IACF;AACA,QAAI,EAAE;AAAA,EACR;AAEA,MAAI,aAAa,gBAAiB,aAAY,gBAAgB,GAAG;AAAA,MAC5D,OAAM;AACb;AAEO,SAAS,WAAW,GAA2B;AACpD,SAAO,KAAK,QAAQ,OAAO,EAAE,SAAS;AACxC;AAMA,SAAS,aAAa,OAAc,WAAuB;AACzD,QAAM,YAAY;AAElB,MAAI,IAAI,MAAM;AACd,SAAO,GAAG;AACR,UAAM,OAAO,EAAE;AACf,iBAAa,GAAG,MAAM,QAAQ,SAAS,OAAO,MAAM,MAAO,SAAS;AACpE,QAAI;AAAA,EACN;AACA,QAAM,QAAQ;AAGd,MAAI,MAAM,UAAU;AAClB,eAAW,WAAW,MAAM,UAAU;AACpC,UAAI;AACF,gBAAQ;AAAA,MACV,SAAS,GAAG;AACV,YAAI,aAAa,mBAAoB,aAAY,mBAAmB,CAAC;AAAA,MACvE;AAAA,IACF;AACA,UAAM,WAAW;AAAA,EACnB;AAEA,MAAI,MAAM,QAAQ,SAAS,SAAS,MAAM,WAAW,sBAAsB;AACzE,QAAI;AACF,YAAM,UAAU,qBAAqB;AAAA,IACvC,SAAS,GAAG;AACV,UAAI,aAAa,mBAAoB,aAAY,mBAAmB,CAAC;AAAA,IACvE;AACA,UAAM,UAAU,SAAS;AACzB,UAAM,UAAU,iBAAiB;AACjC,UAAM,UAAU,eAAe;AAAA,EACjC;AAGA,MAAI,MAAM,IAAK,WAAU,MAAM,GAAG;AAGlC,MAAI,MAAM,QAAQ,SAAS,QAAQ,MAAM,OAAO,MAAM,IAAI,YAAY;AACpE,UAAM,IAAI,WAAW,YAAY,MAAM,GAAG;AAAA,EAC5C,WAAW,MAAM,QAAQ,SAAS,QAAQ,MAAM,OAAO,MAAM,IAAI,YAAY;AAC3E,UAAM,IAAI,WAAW,YAAY,MAAM,GAAG;AAAA,EAC5C;AACF;AAEO,SAAS,mBAAmB,QAAe,WAAuB;AACvE,MAAI,IAAI,OAAO;AACf,SAAO,GAAG;AACR,UAAM,OAAO,EAAE;AACf,iBAAa,GAAG,SAAS;AACzB,QAAI;AAAA,EACN;AACA,SAAO,QAAQ;AACjB;AAMA,SAAS,WAAW,QAAc,MAAY,QAA2B;AAKvE,MAAI,UAAU,OAAO,eAAe,QAAQ;AAC1C,WAAO,aAAa,MAAM,MAAM;AAAA,EAClC,OAAO;AACL,WAAO,YAAY,IAAI;AAAA,EACzB;AACF;AAEA,SAAS,cAAc,OAAoB;AACzC,MAAI,IAAI,MAAM;AACd,SAAO,GAAG;AACR,QAAI,EAAE,QAAQ,SAAS,KAAM,QAAO,EAAE;AACtC,QAAI,EAAE,QAAQ,SAAS;AACrB,aAAQ,EAAE,aAAuB,EAAE,OAAiB,EAAE,MAAM;AAC9D,QAAI,EAAE,QAAQ,SAAS,QAAQ;AAO7B,YAAM,QAAS,EAAE,gBAAgB,EAAE;AACnC,aAAQ,OAAO,aAAuB,EAAE,aAAuB,EAAE,OAAiB,EAAE,MAAM;AAAA,IAC5F;AACA,QAAI,EAAE;AAAA,EACR;AACA,QAAM,IAAI,MAAM,uBAAuB;AACzC;AAEA,SAAS,UAAU,OAA2B;AAE5C,MAAI,IAAkB,MAAM;AAC5B,SAAO,GAAG;AACR,UAAM,IAAI,aAAa,CAAC;AACxB,QAAI,EAAG,QAAO;AACd,QAAI,EAAE;AAAA,EACR;AAEA,MAAI,IAAI,MAAM;AACd,SAAO,KAAK,EAAE,QAAQ,SAAS,QAAQ,EAAE,QAAQ,SAAS,QAAQ,EAAE,QAAQ,SAAS,QAAQ;AAC3F,QAAI,EAAE,SAAS;AACb,YAAM,IAAI,aAAa,EAAE,OAAO;AAChC,UAAI,EAAG,QAAO;AAAA,IAChB;AACA,QAAI,EAAE;AAAA,EACR;AACA,SAAO;AACT;AAEA,SAAS,aAAa,OAA2B;AAC/C,MAAI,MAAM,QAAQ,SAAS,QAAQ,MAAM,QAAQ,SAAS,KAAM,QAAO,MAAM;AAC7E,MAAI,IAAI,MAAM;AACd,SAAO,GAAG;AACR,UAAM,IAAI,aAAa,CAAC;AACxB,QAAI,EAAG,QAAO;AACd,QAAI,EAAE;AAAA,EACR;AACA,SAAO;AACT;AAWO,SAAS,YAAY,OAAc,KAAe;AACvD,SAAO,aAAa,YAAY,OAAO,GAAG;AAC5C;AAEA,SAAS,mBAAmB,QAAe,KAAe;AACxD,SAAO,IAAI;AACb;AAMA,SAAS,UAAU,OAAc,OAAkB;AACjD,QAAM,MAAM,MAAM,QAAQ,MAAM,cAAc,OAAO;AACrD,MAAI,CAAC,IAAK;AACV,MAAI,OAAO,QAAQ,YAAY;AAK7B,sBAAkB,OAAO,MAAM;AAC7B,YAAM,UAAU,IAAI,KAAK;AACzB,YAAM,aAAa,CAAC;AACpB,YAAM,SAAS,KAAK,OAAO,YAAY,aAAa,UAAU,MAAM,IAAI,IAAI,CAAC;AAAA,IAC/E,CAAC;AAAA,EACH,OAAO;AACL,QAAI,UAAU;AAAA,EAChB;AACF;AAEA,SAAS,iBAAiB,OAAc,OAAkB;AACxD,QAAM,MAAM,MAAM,QAAQ,MAAM,cAAc,OAAO;AACrD,MAAI,CAAC,IAAK;AACV,MAAI,OAAO,QAAQ,YAAY,IAAI,YAAY,MAAO,KAAI,UAAU;AACtE;AAEA,SAAS,UAAU,KAAgB;AAIjC,MAAI,OAAO,OAAO,QAAQ,UAAU;AAClC,QAAI,UAAU;AAAA,EAChB;AACF;AAMA,IAAM,iBAA0D,CAAC;AACjE,IAAM,uBAAgE,CAAC;AACvE,IAAM,oBAA6D,CAAC;AAE7D,SAAS,cAAc,OAAc,QAAsB;AAChE,MAAI,OAAO,QAAQ,YAAY,OAAO,QAAQ,aAAa;AACzD,yBAAqB,KAAK,EAAE,OAAO,OAAO,CAAC;AAAA,EAC7C,OAAO;AACL,mBAAe,KAAK,EAAE,OAAO,OAAO,CAAC;AAAA,EACvC;AACF;AAEO,SAAS,kBAAkB,OAAc,IAAsB;AACpE,oBAAkB,KAAK,EAAE,OAAO,GAAG,CAAC;AACtC;AAEO,SAAS,WAAW,MAAuB;AAEhD,SAAO,qBAAqB,QAAQ;AAClC,UAAM,EAAE,OAAO,OAAO,IAAI,qBAAqB,MAAM;AACrD,cAAU,OAAO,QAAQ,IAAI;AAAA,EAC/B;AAEA,SAAO,kBAAkB,QAAQ;AAC/B,UAAM,EAAE,GAAG,IAAI,kBAAkB,MAAM;AACvC,QAAI;AACF,SAAG;AAAA,IACL,SAAS,GAAG;AACV,UAAI,KAAK,cAAe,MAAK,cAAc,CAAC;AAAA,IAC9C;AAAA,EACF;AAEA,MAAI,eAAe,QAAQ;AACzB,UAAM,QAAQ,eAAe,OAAO,CAAC;AACrC,mBAAe,MAAM;AACnB,iBAAW,EAAE,OAAO,OAAO,KAAK,MAAO,WAAU,OAAO,QAAQ,IAAI;AAAA,IACtE,CAAC;AAAA,EACH;AACF;AAEA,SAAS,UAAU,OAAc,QAAgB,MAAuB;AACtE,MAAI;AACF,UAAM,UAAU,OAAO,OAAO;AAC9B,WAAO,UAAU,OAAO,YAAY,aAAa,UAAU;AAC3D,QAAI,OAAO,SAAS;AAClB,YAAM,aAAa,CAAC;AACpB,YAAM,SAAS,KAAK,OAAO,OAAO;AAAA,IACpC;AAAA,EACF,SAAS,GAAG;AACV,QAAI,KAAK,cAAe,MAAK,cAAc,CAAC;AAAA,EAC9C;AACF;AAMA,SAAS,YAAY,MAAuB;AAC1C,SACE,KAAK,SAAS,KACd,KAAK,WAAW,CAAC,MAAM,OACvB,KAAK,WAAW,CAAC,MAAM,OACvB,KAAK,WAAW,CAAC,KAAK;AAE1B;",
   "names": ["f"]
 }

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@tanstack/redact",
-  "version": "0.0.8",
+  "version": "0.0.10",
   "description": "React, redacted. A minimal React-API-compatible drop-in replacement.",
   "type": "module",
   "main": "./dist/react/index.js",
@@ -78,10 +78,10 @@
       "optional": true
     }
   },
-  "publishConfig": {
-    "access": "public"
-  },
   "scripts": {
     "build": "echo done-by-root-build"
+  },
+  "publishConfig": {
+    "access": "public"
   }
-}
+}

package/src/dom/dispatcher.ts

@@ -50,7 +50,17 @@ function depsEqual(
   return true
 }
 
+// Singleton — every method reads render context via ReactSharedInternals,
+// and per-hook closures live on the hook itself, so nothing is render-local
+// to capture. Allocating a fresh wrapper + 17 method closures per function-
+// component render was pure GC pressure.
+const DISPATCHER = makeDispatcherImpl()
+
 export function makeDispatcher() {
+  return DISPATCHER
+}
+
+function makeDispatcherImpl() {
   return {
     useState<S>(initial: S | (() => S)) {
       return this.useReducer<S, S | ((p: S) => S)>(

package/src/dom/reconcile.ts

@@ -209,20 +209,15 @@ function rerenderFiber(fiber: Fiber, root: FiberRoot): void {
 // Element → children normalization
 // ---------------------------------------------------------------------------
 
-type TextChild = { _text: string }
-type NormalizedChild = ReactElement | TextChild | null
-
-// NEVER use `'_text' in child` to distinguish text wrappers from elements.
-// TanStack's RSC renderable proxies (createRscProxy with renderable: true) are
-// Proxy wrappers around real React elements whose `has` trap returns `true`
-// for ANY string key — so `'_text' in rscProxy` is TRUE even though the proxy
-// is an element. That misidentification set a Text fiber's `pendingProps` to
-// `child._text` (another chained RSC proxy), which then rendered as
-// `[object Object]` when createTextNode stringified the element. React
-// elements always carry `$$typeof`; our text wrapper never does — so the
-// presence of `$$typeof` is the invariant we rely on.
-function isTextChild(child: Exclude<NormalizedChild, null>): child is TextChild {
-  return (child as any).$$typeof === undefined
+// Text children pass through as raw strings — no wrapper. The previous
+// `{_text: string}` shape allocated tens of thousands of objects per
+// stable-list re-render and dominated minor-GC pressure. `typeof === 'string'`
+// is also robust to RSC renderable proxies (which have `has` traps that
+// would fool a `'_text' in child` predicate but can't fool `typeof`).
+type NormalizedChild = ReactElement | string | null
+
+function isTextChild(child: Exclude<NormalizedChild, null>): child is string {
+  return typeof child === 'string'
 }
 
 export function childrenToArray(children: ReactNode): NormalizedChild[] {
@@ -233,11 +228,15 @@ export function childrenToArray(children: ReactNode): NormalizedChild[] {
 
 function pushChildren(node: ReactNode, out: NormalizedChild[]): void {
   if (node == null || typeof node === 'boolean') return
-  if (typeof node === 'string' || typeof node === 'number') {
+  if (typeof node === 'string') {
     // Empty strings render no text node (matches React + the `<!-- -->`
     // separator elision on the SSR side so server/client agree).
     if (node === '') return
-    out.push({ _text: '' + node })
+    out.push(node)
+    return
+  }
+  if (typeof node === 'number') {
+    out.push('' + node)
     return
   }
   if (Array.isArray(node)) {
@@ -298,7 +297,7 @@ function fiberFromChild(child: NormalizedChild, parent: Fiber): Fiber {
   if (!child) return createFiber(FiberTag.Fragment, null, null)
   if (isTextChild(child)) {
     const f = createFiber(FiberTag.Text, null, null)
-    f.pendingProps = child._text
+    f.pendingProps = child
     f.parent = parent
     return f
   }
@@ -344,6 +343,43 @@ export function reconcileChildren(
   domParent: Node,
   anchor: Node | null,
 ): void {
+  // Fast path: unkeyed positional steady-state. Walk the existing sibling
+  // chain and newChildren in lockstep, validating AND committing in one pass.
+  // On any divergence we fall back to the slow path, which rebuilds the
+  // sibling chain anyway — partial pendingProps writes are idempotent.
+  // Skips the Map / Set / existing-array allocation entirely.
+  if (!currentRoot?.hydrating) {
+    let f: Fiber | null = parent.child
+    let ok = true
+    for (let i = 0; i < newChildren.length; i++) {
+      const child = newChildren[i]
+      if (child == null || !f || f.key != null) { ok = false; break }
+      if (typeof child === 'string') {
+        if (f.tag !== FiberTag.Text) { ok = false; break }
+        f.pendingProps = child
+      } else {
+        if ((child as ReactElement).key != null) { ok = false; break }
+        if (f.type !== (child as ReactElement).type) { ok = false; break }
+        f.pendingProps = (child as ReactElement).props
+        f.ref = (child as any).ref ?? null
+      }
+      f = f.sibling
+    }
+    if (ok && f === null) {
+      // Pass 2: render forward with per-child anchors. Identical to the slow
+      // path's pass 2.
+      for (let r: Fiber | null = parent.child; r; r = r.sibling) {
+        let a = anchor
+        for (let s: Fiber | null = r.sibling; s; s = s.sibling) {
+          const d = firstDomNode(s)
+          if (d && d.parentNode === domParent) { a = d; break }
+        }
+        renderFiber(r, domParent, a)
+      }
+      return
+    }
+  }
+
   const existing = collectChildren(parent)
   const keyed = new Map<string, Fiber>()
   for (const f of existing) {
@@ -431,7 +467,7 @@ export function reconcileChildren(
       claimed.add(match)
       fiber = match
       if (isTextChild(child!)) {
-        fiber.pendingProps = child._text
+        fiber.pendingProps = child
       } else {
         fiber.type = (child as ReactElement).type
         fiber.pendingProps = (child as ReactElement).props
@@ -675,13 +711,17 @@ export function renderFiber(fiber: Fiber, domParent: Node, anchor: Node | null):
 
 function renderText(fiber: Fiber, domParent: Node, anchor: Node | null): void {
   const text = fiber.pendingProps as string
+  // Identity-unchanged fast path: skip the native Text.data write entirely.
+  if (fiber.dom && fiber.memoizedProps === text) return
   if (!fiber.dom) {
     const hydrated = currentRoot?.hydrating ? adoptTextDom(fiber, fiber.parent!, text) : false
     if (!hydrated) {
       fiber.dom = document.createTextNode(text)
       insertInto(domParent, fiber.dom, anchor)
     }
-  } else if ((fiber.dom as Text).data !== text) {
+  } else {
+    // Past the fast path, and adoptTextDom already realigned `.data` on
+    // hydration — `.data !== text` here is guaranteed, so write directly.
     ;(fiber.dom as Text).data = text
   }
   fiber.memoizedProps = text
@@ -724,24 +764,38 @@ function renderHost(fiber: Fiber, domParent: Node, anchor: Node | null): void {
       insertInto(domParent, fiber.dom, anchor)
     }
     attachRef(fiber, fiber.dom)
-  } else {
+  } else if (prev !== props) {
     const el = fiber.dom as Element
-    for (const k in prev) {
-      if (!(k in props)) setProp(el, k, undefined, prev[k], isSvg)
-    }
-    // Non-event props first for the same reason as above: a `type` change
-    // must land before we ask setEventHandler to resolve the DOM event for
-    // `onChange`.
+    // Single-pass diff. Defer changed event props into a small array so the
+    // `type-before-events` invariant the mount path needs (setEventHandler
+    // reads `el.type` to resolve onChange→input vs change) still holds when
+    // a render flips both `type` and an event handler in the same pass.
+    // The vast majority of host updates have no events at all (e.g. data-*
+    // attributes flipping on a stable list), so the deferred array stays
+    // null and we collapse to one for-in over `props`.
+    let deferredEvents: string[] | null = null
     for (const k in props) {
       if (isSelect && (k === 'value' || k === 'defaultValue')) continue
-      if (isEventProp(k)) continue
+      if (isEventProp(k)) {
+        if (prev[k] !== props[k]) {
+          deferredEvents ||= []
+          deferredEvents.push(k)
+        }
+        continue
+      }
       if (prev[k] !== props[k]) setProp(el, k, props[k], prev[k], isSvg)
     }
-    for (const k in props) {
-      if (!isEventProp(k)) continue
-      if (prev[k] !== props[k]) setProp(el, k, props[k], prev[k], isSvg)
+    // Removals — keys present in prev but not in props.
+    for (const k in prev) {
+      if (!(k in props)) setProp(el, k, undefined, prev[k], isSvg)
+    }
+    if (deferredEvents) {
+      for (let i = 0; i < deferredEvents.length; i++) {
+        const k = deferredEvents[i]!
+        setProp(el, k, props[k], prev[k], isSvg)
+      }
     }
-    if (prev !== props) syncRefIfChanged(fiber, fiber.dom)
+    syncRefIfChanged(fiber, fiber.dom)
   }
 
   // Children go into this DOM node