@solidjs/signals 2.0.0-beta.17 → 2.0.0-beta.19

package/dist/prod.js

@@ -1,4406 +0,0 @@
-class NotReadyError extends Error {
-  source;
-  constructor(e) {
-    super();
-    this.source = e;
-  }
-}
-class StatusError extends Error {
-  source;
-  constructor(e, t) {
-    super(t instanceof Error ? t.message : String(t), { cause: t });
-    this.source = e;
-  }
-}
-function unwrapStatusError(e) {
-  return e instanceof StatusError ? e.cause : e;
-}
-class NoOwnerError extends Error {
-  constructor() {
-    super("");
-  }
-}
-class ContextNotFoundError extends Error {
-  constructor() {
-    super("");
-  }
-}
-const REACTIVE_NONE = 0;
-const REACTIVE_CHECK = 1 << 0;
-const REACTIVE_DIRTY = 1 << 1;
-const REACTIVE_RECOMPUTING_DEPS = 1 << 2;
-const REACTIVE_IN_HEAP = 1 << 3;
-const REACTIVE_IN_HEAP_HEIGHT = 1 << 4;
-const REACTIVE_ZOMBIE = 1 << 5;
-const REACTIVE_DISPOSED = 1 << 6;
-const REACTIVE_OPTIMISTIC_DIRTY = 1 << 7;
-const REACTIVE_SNAPSHOT_STALE = 1 << 8;
-const REACTIVE_LAZY = 1 << 9;
-const REACTIVE_MANUAL_WRITE = 1 << 10;
-const CONFIG_OWNED_WRITE = 1 << 0;
-const CONFIG_NO_SNAPSHOT = 1 << 1;
-const CONFIG_TRANSPARENT = 1 << 2;
-const CONFIG_IN_SNAPSHOT_SCOPE = 1 << 3;
-const CONFIG_CHILDREN_FORBIDDEN = 1 << 4;
-const CONFIG_AUTO_DISPOSE = 1 << 5;
-const CONFIG_SYNC = 1 << 6;
-const STATUS_PENDING = 1 << 0;
-const STATUS_ERROR = 1 << 1;
-const STATUS_UNINITIALIZED = 1 << 2;
-const EFFECT_RENDER = 1;
-const EFFECT_USER = 2;
-const EFFECT_TRACKED = 3;
-const NOT_PENDING = {};
-const NO_SNAPSHOT = {};
-const STORE_SNAPSHOT_PROPS = "sp";
-const SUPPORTS_PROXY = typeof Proxy === "function";
-const defaultContext = {};
-const $REFRESH = Symbol("refresh");
-const DEV$1 = undefined;
-function devCheckActiveOverrides(e) {
-  return;
-}
-function devCheckFlushStart() {
-  return;
-}
-typeof globalThis !== "undefined" && !!globalThis.process?.env?.COMPANION_CENSUS;
-function devCensusCompanions(e) {
-  return;
-}
-function devCheckQuiescent(e) {
-  return;
-}
-const signalLanes = new WeakMap();
-const activeLanes = new Set();
-function getOrCreateLane(e) {
-  let t = signalLanes.get(e);
-  if (t) {
-    return findLane(t);
-  }
-  const n = e.t;
-  const i = n?.i ? findLane(n.i) : null;
-  t = { o: e, u: new Set(), l: [[], []], T: null, S: activeTransition, _: i };
-  signalLanes.set(e, t);
-  activeLanes.add(t);
-  return t;
-}
-function findLane(e) {
-  while (e.T) e = e.T;
-  return e;
-}
-function mergeLanes(e, t) {
-  e = findLane(e);
-  t = findLane(t);
-  if (e === t) return e;
-  t.T = e;
-  for (const n of t.u) e.u.add(n);
-  t.u.clear();
-  e.l[0].push(...t.l[0]);
-  e.l[1].push(...t.l[1]);
-  t.l[0].length = 0;
-  t.l[1].length = 0;
-  return e;
-}
-function resolveLane(e) {
-  const t = e.i;
-  if (!t) return undefined;
-  const n = findLane(t);
-  if (activeLanes.has(n)) return n;
-  e.i = undefined;
-  return undefined;
-}
-function resolveTransition(e) {
-  return resolveLane(e)?.S ?? e.S;
-}
-function hasActiveOverride(e) {
-  return !!(e.O !== undefined && e.O !== NOT_PENDING);
-}
-function assignOrMergeLane(e, t) {
-  const n = findLane(t);
-  const i = e.i;
-  if (i) {
-    if (i.T) {
-      e.i = t;
-      return;
-    }
-    const r = findLane(i);
-    if (activeLanes.has(r)) {
-      if (r !== n && !hasActiveOverride(e)) {
-        if (n._ && findLane(n._) === r) {
-          e.i = t;
-        } else if (r._ && findLane(r._) === n);
-        else mergeLanes(n, r);
-      }
-      return;
-    }
-  }
-  e.i = t;
-}
-const transitions = new Set();
-const dirtyQueue = { R: new Array(2e3).fill(undefined), p: false, I: 0, h: 0 };
-const zombieQueue = { R: new Array(2e3).fill(undefined), p: false, I: 0, h: 0 };
-let clock = 0;
-let activeTransition = null;
-let scheduled = false;
-let halted = false;
-let haltNotified = false;
-let syncDepth = 0;
-let projectionWriteActive = false;
-let stashedOptimisticReads = null;
-const transientStoreNodes = new Set();
-function registerTransientStoreNode(e) {
-  transientStoreNodes.add(e);
-}
-function canUseSimpleSyncFlush(e) {
-  return (
-    transitions.size === 0 &&
-    activeLanes.size === 0 &&
-    e.A.length === 0 &&
-    e.N.length === 0 &&
-    e.C.size === 0 &&
-    transientStoreNodes.size === 0
-  );
-}
-function sweepTransientStoreNodes() {
-  if (transientStoreNodes.size === 0) return;
-  for (const e of transientStoreNodes) {
-    if (e.P !== null) {
-      transientStoreNodes.delete(e);
-      continue;
-    }
-    if (e.D !== NOT_PENDING) continue;
-    if (e.O !== undefined && e.O !== NOT_PENDING) continue;
-    transientStoreNodes.delete(e);
-    e.m?.();
-  }
-}
-function enforceLoadingBoundary(e) {}
-function shouldReadStashedOptimisticValue(e) {
-  return !!stashedOptimisticReads?.has(e);
-}
-function runLaneEffects(e) {
-  for (const t of activeLanes) {
-    if (t.T || t.u.size > 0) continue;
-    const n = t.l[e - 1];
-    if (n.length) {
-      t.l[e - 1] = [];
-      runQueue(n, e);
-    }
-  }
-}
-function queueStashedOptimisticEffects(e) {
-  for (let t = e.P; t !== null; t = t.L) {
-    const e = t.U;
-    if (!e.V) continue;
-    if (e.V === EFFECT_TRACKED) {
-      if (!e.G) {
-        e.G = true;
-        e.F.enqueue(EFFECT_USER, e.k);
-      }
-      continue;
-    }
-    const n = e.W & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue;
-    if (n.I > e.H) n.I = e.H;
-    insertIntoHeap(e, n);
-  }
-}
-function setProjectionWriteActive(e) {
-  projectionWriteActive = e;
-}
-function mergeTransitionState(e, t) {
-  t.M = e;
-  e.j.push(...t.j);
-  for (const n of activeLanes) if (n.S === t) n.S = e;
-  e.N.push(...t.N);
-  for (const n of t.C) e.C.add(n);
-  for (const [n, i] of t.$) {
-    let t = e.$.get(n);
-    if (!t) e.$.set(n, (t = new Set()));
-    for (const e of i) t.add(e);
-  }
-  for (const n of t.K) e.K.add(n);
-}
-function resolveOptimisticNodes(e) {
-  const t = e.length;
-  for (let n = 0; n < t; n++) {
-    const t = e[n];
-    t.i = undefined;
-    if (!(t.Y & STATUS_PENDING)) t.Y &= ~STATUS_UNINITIALIZED;
-    const i = t.O;
-    t.O = NOT_PENDING;
-    if (i !== NOT_PENDING && t.Z !== i) insertSubs(t, true);
-    t.S = null;
-  }
-  for (let n = 0; n < t; n++) {
-    const t = e[n];
-    if (t.B || t.q) snapCompanionsToState(t);
-    const i = t.t;
-    if (i && (i.B === t || i.q === t)) snapCompanionsToState(i);
-  }
-  e.splice(0, t);
-}
-function cleanupCompletedLanes(e) {
-  for (const t of activeLanes) {
-    const n = e ? t.S === e : !t.S;
-    if (!n) continue;
-    if (!t.T) {
-      if (t.l[0].length) runQueue(t.l[0], EFFECT_RENDER);
-      if (t.l[1].length) runQueue(t.l[1], EFFECT_USER);
-    }
-    if (t.o.i === t) t.o.i = undefined;
-    t.u.clear();
-    t.l[0].length = 0;
-    t.l[1].length = 0;
-    activeLanes.delete(t);
-    signalLanes.delete(t.o);
-  }
-}
-function schedule() {
-  if (halted) {
-    notifyHalted();
-    return;
-  }
-  if (scheduled) return;
-  scheduled = true;
-  if (!syncDepth && !globalQueue.X && !projectionWriteActive) queueMicrotask(flush);
-}
-function haltReactivity() {
-  if (halted) return;
-  halted = true;
-  let e = "[REACTIVITY_HALTED] An uncaught error halted the reactive system.";
-  console.error(e);
-}
-function notifyHalted() {
-  if (haltNotified) return;
-  haltNotified = true;
-  console.error("[REACTIVITY_HALTED] Update ignored.");
-}
-function resetErrorHalt() {
-  halted = false;
-  haltNotified = false;
-}
-class Queue {
-  J = null;
-  ee = [[], []];
-  A = [];
-  created = clock;
-  addChild(e) {
-    this.A.push(e);
-    e.J = this;
-  }
-  removeChild(e) {
-    const t = this.A.indexOf(e);
-    if (t >= 0) {
-      this.A.splice(t, 1);
-      e.J = null;
-    }
-  }
-  notify(e, t, n, i) {
-    if (this.J) return this.J.notify(e, t, n, i);
-    return false;
-  }
-  run(e) {
-    if (this.ee[e - 1].length) {
-      const t = this.ee[e - 1];
-      this.ee[e - 1] = [];
-      runQueue(t, e);
-    }
-    for (let t = 0; t < this.A.length; t++) this.A[t].run?.(e);
-  }
-  enqueue(e, t) {
-    if (e) {
-      if (currentOptimisticLane) {
-        const n = findLane(currentOptimisticLane);
-        n.l[e - 1].push(t);
-      } else {
-        this.ee[e - 1].push(t);
-      }
-    }
-    schedule();
-  }
-  stashQueues(e) {
-    e.ee[0].push(...this.ee[0]);
-    e.ee[1].push(...this.ee[1]);
-    this.ee = [[], []];
-    for (let t = 0; t < this.A.length; t++) {
-      let n = this.A[t];
-      let i = e.A[t];
-      if (!i) {
-        i = { ee: [[], []], A: [] };
-        e.A[t] = i;
-      }
-      n.stashQueues(i);
-    }
-  }
-  restoreQueues(e) {
-    this.ee[0].push(...e.ee[0]);
-    this.ee[1].push(...e.ee[1]);
-    for (let t = 0; t < e.A.length; t++) {
-      const n = e.A[t];
-      let i = this.A[t];
-      if (i) i.restoreQueues(n);
-    }
-  }
-}
-class GlobalQueue extends Queue {
-  X = false;
-  te = null;
-  ne = [];
-  N = [];
-  C = new Set();
-  static ie;
-  static re;
-  static oe;
-  static se = null;
-  flush() {
-    if (this.X) return;
-    this.X = true;
-    try {
-      if (false);
-      runHeap(dirtyQueue, GlobalQueue.ie);
-      if (activeTransition) {
-        const e = transitionComplete(activeTransition);
-        if (!e) {
-          const e = activeTransition;
-          runHeap(zombieQueue, GlobalQueue.ie);
-          this.te = null;
-          this.ne = [];
-          this.N = [];
-          this.C = new Set();
-          runLaneEffects(EFFECT_RENDER);
-          runLaneEffects(EFFECT_USER);
-          this.stashQueues(e.ue);
-          clock++;
-          scheduled = dirtyQueue.h >= dirtyQueue.I;
-          reassignPendingTransition(e.ne);
-          activeTransition = null;
-          if (!e.j.length && !e.$.size && e.N.length) {
-            stashedOptimisticReads = new Set();
-            for (let t = 0; t < e.N.length; t++) {
-              const n = e.N[t];
-              if (n.ce || n.le & CONFIG_OWNED_WRITE) continue;
-              stashedOptimisticReads.add(n);
-              queueStashedOptimisticEffects(n);
-            }
-          }
-          try {
-            finalizePureQueue(null, true);
-          } finally {
-            stashedOptimisticReads = null;
-          }
-          return;
-        }
-        this.ne !== activeTransition.ne && this.ne.push(...activeTransition.ne);
-        this.restoreQueues(activeTransition.ue);
-        transitions.delete(activeTransition);
-        const t = activeTransition;
-        activeTransition = null;
-        reassignPendingTransition(this.ne);
-        finalizePureQueue(t);
-      } else {
-        if (canUseSimpleSyncFlush(this)) {
-          commitPendingNodes();
-          if (dirtyQueue.h >= dirtyQueue.I) {
-            runHeap(dirtyQueue, GlobalQueue.ie);
-            commitPendingNodes();
-          }
-        } else {
-          if (transitions.size) runHeap(zombieQueue, GlobalQueue.ie);
-          finalizePureQueue();
-        }
-      }
-      clock++;
-      scheduled = dirtyQueue.h >= dirtyQueue.I;
-      activeLanes.size && runLaneEffects(EFFECT_RENDER);
-      this.run(EFFECT_RENDER);
-      activeLanes.size && runLaneEffects(EFFECT_USER);
-      this.run(EFFECT_USER);
-      if (false);
-      if (
-        false &&
-        !scheduled &&
-        !activeTransition &&
-        transitions.size === 0 &&
-        activeLanes.size === 0
-      );
-      if (false);
-    } finally {
-      this.X = false;
-    }
-  }
-  notify(e, t, n, i) {
-    if (t & STATUS_PENDING) {
-      if (n & STATUS_PENDING) {
-        const t = i !== undefined ? i : e.ae;
-        if (activeTransition && t) {
-          const n = t.source;
-          let i = activeTransition.$.get(n);
-          if (!i) activeTransition.$.set(n, (i = new Set()));
-          const r = i.size;
-          i.add(e);
-          if (i.size !== r) schedule();
-        }
-      }
-      return true;
-    }
-    return false;
-  }
-  initTransition(e) {
-    if (e) e = currentTransition(e);
-    if (e && e === activeTransition) return;
-    if (!e && activeTransition && activeTransition.fe === clock) return;
-    if (!activeTransition) {
-      activeTransition = e ?? {
-        fe: clock,
-        ne: [],
-        $: new Map(),
-        N: [],
-        C: new Set(),
-        j: [],
-        ue: { ee: [[], []], A: [] },
-        M: false,
-        K: new Set()
-      };
-    } else if (e) {
-      const t = activeTransition;
-      mergeTransitionState(e, t);
-      transitions.delete(t);
-      activeTransition = e;
-    }
-    transitions.add(activeTransition);
-    activeTransition.fe = clock;
-    if (this.te !== null) {
-      this.te.S = activeTransition;
-      activeTransition.ne.push(this.te);
-      this.te = null;
-    }
-    if (this.ne !== activeTransition.ne) {
-      for (let e = 0; e < this.ne.length; e++) {
-        const t = this.ne[e];
-        t.S = activeTransition;
-        activeTransition.ne.push(t);
-      }
-      this.ne = activeTransition.ne;
-    }
-    if (this.N !== activeTransition.N) {
-      for (let e = 0; e < this.N.length; e++) {
-        const t = this.N[e];
-        t.S = activeTransition;
-        activeTransition.N.push(t);
-      }
-      this.N = activeTransition.N;
-    }
-    for (const e of activeLanes) {
-      if (!e.S) e.S = activeTransition;
-    }
-    if (this.C !== activeTransition.C) {
-      for (const e of this.C) activeTransition.C.add(e);
-      this.C = activeTransition.C;
-    }
-  }
-}
-function queuePendingNode(e) {
-  if (activeTransition) {
-    globalQueue.ne.push(e);
-    return;
-  }
-  if (globalQueue.te === null && globalQueue.ne.length === 0) {
-    globalQueue.te = e;
-    return;
-  }
-  if (globalQueue.te !== null) {
-    globalQueue.ne.push(globalQueue.te);
-    globalQueue.te = null;
-  }
-  globalQueue.ne.push(e);
-}
-function insertSubs(e, t = false) {
-  const n = e.i || currentOptimisticLane;
-  const i = e.Ee !== undefined;
-  for (let r = e.P; r !== null; r = r.L) {
-    if (i && r.U.le & CONFIG_IN_SNAPSHOT_SCOPE) {
-      r.U.W |= REACTIVE_SNAPSHOT_STALE;
-      continue;
-    }
-    if (t && n) {
-      r.U.W |= REACTIVE_OPTIMISTIC_DIRTY;
-      assignOrMergeLane(r.U, n);
-    } else if (t) {
-      r.U.W |= REACTIVE_OPTIMISTIC_DIRTY;
-      r.U.i = undefined;
-    }
-    const e = r.U;
-    if (e.V === EFFECT_TRACKED) {
-      if (!e.G) {
-        e.G = true;
-        e.F.enqueue(EFFECT_USER, e.k);
-      }
-      continue;
-    }
-    const o = r.U.W & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue;
-    if (o.I > r.U.H) o.I = r.U.H;
-    insertIntoHeap(r.U, o);
-  }
-}
-function commitPendingNode(e) {
-  const t = e;
-  if (!t.ce) {
-    if (e.D !== NOT_PENDING) {
-      e.Z = e.D;
-      e.D = NOT_PENDING;
-    }
-    if (e.B || e.q) snapCompanionsToState(e);
-    return;
-  }
-  if (e.D !== NOT_PENDING) {
-    e.Z = e.D;
-    e.D = NOT_PENDING;
-    if (e.V && e.V !== EFFECT_TRACKED) e.G = true;
-  }
-  t.W &= ~REACTIVE_MANUAL_WRITE;
-  if (!(t.Y & STATUS_PENDING)) t.Y &= ~STATUS_UNINITIALIZED;
-  if (t.de !== null || t.Te !== null) GlobalQueue.re(t, false, true);
-  if (e.B || e.q) snapCompanionsToState(e);
-}
-function commitPendingNodes() {
-  if (globalQueue.te !== null) {
-    commitPendingNode(globalQueue.te);
-    globalQueue.te = null;
-  }
-  const e = globalQueue.ne;
-  for (let t = 0; t < e.length; t++) {
-    commitPendingNode(e[t]);
-  }
-  e.length = 0;
-}
-function finalizePureQueue(e = null, t = false) {
-  const n = !t;
-  if (n) commitPendingNodes();
-  if (!t && globalQueue.A.length) checkBoundaryChildren(globalQueue);
-  const i = dirtyQueue.h >= dirtyQueue.I;
-  if (i) runHeap(dirtyQueue, GlobalQueue.ie);
-  if (n) {
-    if (i) commitPendingNodes();
-    resolveOptimisticNodes(e ? e.N : globalQueue.N);
-    if (e && e.K.size) {
-      for (const t of e.K) {
-        if (t.W & REACTIVE_DISPOSED) continue;
-        if (t.V === EFFECT_TRACKED) {
-          if (!t.G) {
-            t.G = true;
-            t.F.enqueue(EFFECT_USER, t.k);
-          }
-          continue;
-        }
-        const e = t.W & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue;
-        if (e.I > t.H) e.I = t.H;
-        insertIntoHeap(t, e);
-      }
-      e.K.clear();
-    }
-    const t = e ? e.C : globalQueue.C;
-    if (GlobalQueue.se && t.size) {
-      for (const e of t) {
-        GlobalQueue.se(e);
-      }
-      t.clear();
-      schedule();
-    }
-    sweepTransientStoreNodes();
-    cleanupCompletedLanes(e);
-  }
-}
-function checkBoundaryChildren(e) {
-  for (const t of e.A) {
-    t.checkSources?.();
-    checkBoundaryChildren(t);
-  }
-}
-function trackOptimisticStore(e) {
-  globalQueue.C.add(e);
-  schedule();
-}
-function reassignPendingTransition(e) {
-  for (let t = 0; t < e.length; t++) {
-    e[t].S = activeTransition;
-  }
-}
-const globalQueue = new GlobalQueue();
-function flush(e) {
-  if (e) {
-    syncDepth++;
-    try {
-      return e();
-    } finally {
-      try {
-        flush();
-      } finally {
-        syncDepth--;
-      }
-    }
-  }
-  if (globalQueue.X) {
-    return;
-  }
-  if (halted) return;
-  while (scheduled || activeTransition) {
-    globalQueue.flush();
-  }
-}
-function runQueue(e, t) {
-  for (let n = 0; n < e.length; n++) e[n](t);
-}
-function reporterBlocksSource(e, t) {
-  if (e.W & (REACTIVE_ZOMBIE | REACTIVE_DISPOSED)) return false;
-  if (e.Se === t || e._e?.has(t)) return true;
-  for (let n = e.Oe; n; n = n.Re) {
-    let e = n.pe;
-    while (e) {
-      if (e === t || e.Ie === t) return true;
-      e = e.t;
-    }
-  }
-  return !!(e.Y & STATUS_PENDING && e.ae instanceof NotReadyError && e.ae.source === t);
-}
-function transitionComplete(e) {
-  if (e.M) return true;
-  if (e.j.length) return false;
-  let t = true;
-  for (const [n, i] of e.$) {
-    let r = false;
-    for (const e of i) {
-      if (reporterBlocksSource(e, n)) {
-        r = true;
-        break;
-      }
-      i.delete(e);
-    }
-    if (!r) e.$.delete(n);
-    else if (n.Y & STATUS_PENDING && n.ae?.source === n) {
-      t = false;
-      break;
-    }
-  }
-  if (t) {
-    for (let n = 0; n < e.N.length; n++) {
-      const i = e.N[n];
-      if (
-        hasActiveOverride(i) &&
-        "Y" in i &&
-        i.Y & STATUS_PENDING &&
-        i.ae instanceof NotReadyError
-      ) {
-        t = false;
-        break;
-      }
-    }
-  }
-  t && (e.M = true);
-  return t;
-}
-function currentTransition(e) {
-  while (e.M && typeof e.M === "object") e = e.M;
-  return e;
-}
-function setActiveTransition(e) {
-  activeTransition = e;
-}
-function runInTransition(e, t) {
-  const n = activeTransition;
-  try {
-    activeTransition = currentTransition(e);
-    return t();
-  } finally {
-    activeTransition = n;
-  }
-}
-function actualInsertIntoHeap(e, t) {
-  const n = (e.J?.he ? e.J.Ae?.H : e.J?.H) ?? -1;
-  if (n >= e.H) e.H = n + 1;
-  const i = e.H;
-  const r = t.R[i];
-  if (r === undefined) t.R[i] = e;
-  else {
-    const t = r.Ne;
-    t.Ce = e;
-    e.Ne = t;
-    r.Ne = e;
-  }
-  if (i > t.h) t.h = i;
-}
-function insertIntoHeap(e, t) {
-  let n = e.W;
-  if (n & (REACTIVE_IN_HEAP | REACTIVE_RECOMPUTING_DEPS | REACTIVE_MANUAL_WRITE)) return;
-  if (n & REACTIVE_CHECK) {
-    e.W = (n & -4) | REACTIVE_DIRTY | REACTIVE_IN_HEAP;
-  } else e.W = n | REACTIVE_IN_HEAP;
-  if (!(n & REACTIVE_IN_HEAP_HEIGHT)) actualInsertIntoHeap(e, t);
-}
-function insertIntoHeapHeight(e, t) {
-  let n = e.W;
-  if (
-    n &
-    (REACTIVE_IN_HEAP | REACTIVE_RECOMPUTING_DEPS | REACTIVE_IN_HEAP_HEIGHT | REACTIVE_MANUAL_WRITE)
-  )
-    return;
-  e.W = n | REACTIVE_IN_HEAP_HEIGHT;
-  actualInsertIntoHeap(e, t);
-}
-function deleteFromHeap(e, t) {
-  const n = e.W;
-  if (!(n & (REACTIVE_IN_HEAP | REACTIVE_IN_HEAP_HEIGHT))) return;
-  e.W = n & -25;
-  const i = e.H;
-  if (e.Ne === e) t.R[i] = undefined;
-  else {
-    const n = e.Ce;
-    const r = t.R[i];
-    const o = n ?? r;
-    if (e === r) t.R[i] = n;
-    else e.Ne.Ce = n;
-    o.Ne = e.Ne;
-  }
-  e.Ne = e;
-  e.Ce = undefined;
-}
-function markHeap(e) {
-  if (e.p) return;
-  e.p = true;
-  for (let t = 0; t <= e.h; t++) {
-    for (let n = e.R[t]; n !== undefined; n = n.Ce) {
-      if (n.W & REACTIVE_IN_HEAP) markNode(n);
-    }
-  }
-}
-function markNode(e, t = REACTIVE_DIRTY) {
-  const n = e.W;
-  if ((n & (REACTIVE_CHECK | REACTIVE_DIRTY)) >= t) return;
-  e.W = (n & -4) | t;
-  for (let t = e.P; t !== null; t = t.L) {
-    markNode(t.U, REACTIVE_CHECK);
-  }
-  if (e.ye !== null) {
-    for (let t = e.ye; t !== null; t = t.Pe) {
-      for (let e = t.P; e !== null; e = e.L) {
-        markNode(e.U, REACTIVE_CHECK);
-      }
-    }
-  }
-}
-function runHeap(e, t) {
-  e.p = false;
-  for (e.I = 0; e.I <= e.h; e.I++) {
-    let n = e.R[e.I];
-    while (n !== undefined) {
-      if (n.W & REACTIVE_IN_HEAP) t(n);
-      else adjustHeight(n, e);
-      n = e.R[e.I];
-    }
-  }
-  e.h = 0;
-}
-function adjustHeight(e, t) {
-  deleteFromHeap(e, t);
-  let n = e.H;
-  for (let t = e.Oe; t; t = t.Re) {
-    const e = t.pe;
-    const i = e.Ie || e;
-    if (i.ce && i.H >= n) n = i.H + 1;
-  }
-  if (e.H !== n) {
-    e.H = n;
-    for (let t = e.P; t !== null; t = t.L) {
-      insertIntoHeapHeight(t.U, t.U.W & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
-    }
-  }
-}
-const PENDING_OWNER = {};
-function markDisposal(e) {
-  let t = e.ge;
-  while (t) {
-    const e = t.W;
-    t.W = e | REACTIVE_ZOMBIE;
-    if (e & (REACTIVE_IN_HEAP | REACTIVE_IN_HEAP_HEIGHT)) {
-      deleteFromHeap(t, e & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
-      if (e & REACTIVE_IN_HEAP) insertIntoHeap(t, zombieQueue);
-      else insertIntoHeapHeight(t, zombieQueue);
-    }
-    markDisposal(t);
-    t = t.De;
-  }
-}
-function dispose(e) {
-  let t = e.Oe;
-  while (t !== null) {
-    t = unlinkSubs(t);
-  }
-  e.Oe = null;
-  e.me = null;
-  disposeChildren(e, true);
-}
-function disposeChildren(e, t = false, n) {
-  const i = e.W;
-  if (i & REACTIVE_DISPOSED) return;
-  if (t) {
-    e.W = i | REACTIVE_DISPOSED;
-    const t = e;
-    if (t.B || t.q) snapCompanionsToState(t);
-  }
-  if (t && e.ce) e.be = null;
-  let r = n ? e.de : e.ge;
-  while (r) {
-    const e = r.De;
-    if (r.Oe) {
-      const e = r;
-      deleteFromHeap(e, e.W & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
-      let t = e.Oe;
-      do {
-        t = unlinkSubs(t);
-      } while (t !== null);
-      e.Oe = null;
-      e.me = null;
-    }
-    disposeChildren(r, true);
-    r = e;
-  }
-  if (n) {
-    e.de = null;
-  } else {
-    e.ge = null;
-    e.ve = 0;
-  }
-  if (t && !n && !(i & REACTIVE_ZOMBIE) && e.J !== null && !(e.J.W & REACTIVE_DISPOSED)) {
-    const t = e.we;
-    const n = e.De;
-    if (t !== null) t.De = n;
-    else e.J.ge = n;
-    if (n !== null) n.we = t;
-    e.we = null;
-  }
-  runDisposal(e, n);
-  if (t && e.Le) {
-    const t = e.Le;
-    e.Le = undefined;
-    t();
-  }
-}
-function runDisposal(e, t) {
-  let n = t ? e.Te : e.Ue;
-  if (!n) return;
-  if (Array.isArray(n)) {
-    for (let e = 0; e < n.length; e++) {
-      const t = n[e];
-      t.call(t);
-    }
-  } else {
-    n.call(n);
-  }
-  t ? (e.Te = null) : (e.Ue = null);
-}
-function childId(e, t) {
-  let n = e;
-  while (n.le & CONFIG_TRANSPARENT && n.J) n = n.J;
-  if (n.id != null) return formatId(n.id, t ? n.ve++ : n.ve);
-  throw new Error("Cannot get child id from owner without an id");
-}
-function getNextChildId(e) {
-  return childId(e, true);
-}
-function peekNextChildId(e) {
-  return childId(e, false);
-}
-function formatId(e, t) {
-  const n = t.toString(36),
-    i = n.length - 1;
-  return e + (i ? String.fromCharCode(64 + i) : "") + n;
-}
-function getObserver() {
-  if (pendingCheckActive || latestReadActive) return PENDING_OWNER;
-  return tracking ? context : null;
-}
-function getOwner() {
-  return context;
-}
-function cleanup(e) {
-  if (!context) return e;
-  if (!context.Ue) context.Ue = e;
-  else if (Array.isArray(context.Ue)) context.Ue.push(e);
-  else context.Ue = [context.Ue, e];
-  return e;
-}
-function isDisposed(e) {
-  return !!(e.W & (REACTIVE_DISPOSED | REACTIVE_ZOMBIE));
-}
-function disposeRootSelf(e = true) {
-  disposeChildren(this, e);
-}
-function createOwner(e) {
-  const t = context;
-  const n = e?.transparent ?? false;
-  const i = {
-    id: e?.id ?? (n ? t?.id : t?.id != null ? getNextChildId(t) : undefined),
-    le: n ? CONFIG_TRANSPARENT : 0,
-    he: true,
-    Ae: t?.he ? t.Ae : t,
-    ge: null,
-    De: null,
-    we: null,
-    Ue: null,
-    F: t?.F ?? globalQueue,
-    Ve: t?.Ve || defaultContext,
-    ve: 0,
-    Te: null,
-    de: null,
-    J: t,
-    dispose: disposeRootSelf
-  };
-  if (t) {
-    const e = t.ge;
-    if (e === null) {
-      t.ge = i;
-    } else {
-      i.De = e;
-      e.we = i;
-      t.ge = i;
-    }
-  }
-  return i;
-}
-function createRoot(e, t) {
-  const n = createOwner(t);
-  return runWithOwner(n, () => e(() => n.dispose()));
-}
-function unlinkSubs(e) {
-  const t = e.pe;
-  const n = e.Re;
-  const i = e.L;
-  const r = e.Ge;
-  if (i !== null) i.Ge = r;
-  else t.Fe = r;
-  if (r !== null) r.L = i;
-  else {
-    t.P = i;
-    if (i === null) {
-      t.m?.();
-      const e = t;
-      e.ce && e.le & CONFIG_AUTO_DISPOSE && !(e.W & REACTIVE_ZOMBIE) && unobserved(e);
-    }
-  }
-  return n;
-}
-function trimStaleDeps(e) {
-  const t = e.me;
-  let n = t !== null ? t.Re : e.Oe;
-  if (n !== null) {
-    do {
-      n = unlinkSubs(n);
-    } while (n !== null);
-    if (t !== null) t.Re = null;
-    else e.Oe = null;
-  }
-}
-function unobserved(e) {
-  deleteFromHeap(e, e.W & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
-  let t = e.Oe;
-  while (t !== null) {
-    t = unlinkSubs(t);
-  }
-  e.Oe = null;
-  e.me = null;
-  disposeChildren(e, true);
-}
-function link(e, t, n = false) {
-  const i = t.me;
-  if (i !== null && i.pe === e) {
-    i.ke = n;
-    return;
-  }
-  let r = null;
-  const o = t.W & REACTIVE_RECOMPUTING_DEPS;
-  if (o) {
-    r = i !== null ? i.Re : t.Oe;
-    if (r !== null && r.pe === e) {
-      r.We = t.He;
-      t.me = r;
-      r.ke = n;
-      return;
-    }
-  }
-  const s = e.Fe;
-  if (s !== null && s.U === t && (!o || s.We === t.He)) {
-    s.ke = n;
-    return;
-  }
-  const u = (t.me = e.Fe = { pe: e, U: t, Re: r, Ge: s, L: null, We: t.He, ke: n });
-  if (i !== null) i.Re = u;
-  else t.Oe = u;
-  if (s !== null) s.L = u;
-  else e.P = u;
-}
-function addPendingSource(e, t) {
-  if (e.Se === t || e._e?.has(t)) return false;
-  if (!e.Se) {
-    e.Se = t;
-    return true;
-  }
-  if (!e._e) {
-    e._e = new Set([e.Se, t]);
-  } else {
-    e._e.add(t);
-  }
-  e.Se = undefined;
-  return true;
-}
-function removePendingSource(e, t) {
-  if (e.Se) {
-    if (e.Se !== t) return false;
-    e.Se = undefined;
-    return true;
-  }
-  if (!e._e?.delete(t)) return false;
-  if (e._e.size === 1) {
-    e.Se = e._e.values().next().value;
-    e._e = undefined;
-  } else if (e._e.size === 0) {
-    e._e = undefined;
-  }
-  return true;
-}
-function clearPendingSources(e) {
-  e.Se = undefined;
-  e._e?.clear();
-  e._e = undefined;
-}
-function setPendingError(e, t, n) {
-  if (!t) {
-    e.ae = null;
-    return;
-  }
-  if (n instanceof NotReadyError && n.source === t) {
-    e.ae = n;
-    return;
-  }
-  const i = e.ae;
-  if (!(i instanceof NotReadyError) || i.source !== t) {
-    e.ae = new NotReadyError(t);
-  }
-}
-function forEachDependent(e, t) {
-  for (let n = e.P; n !== null; n = n.L) t(n.U, n);
-  for (let n = e.ye; n !== null; n = n.Pe) {
-    for (let e = n.P; e !== null; e = e.L) t(e.U, e);
-  }
-}
-function enqueueForRerun(e) {
-  if (e.V === EFFECT_TRACKED) {
-    const t = e;
-    if (!t.G) {
-      t.G = true;
-      t.F.enqueue(EFFECT_USER, t.k);
-    }
-  } else {
-    const t = e.W & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue;
-    if (t.I > e.H) t.I = e.H;
-    insertIntoHeap(e, t);
-  }
-}
-function settlePendingSource(e) {
-  let t = false;
-  const n = new Set();
-  const settle = i => {
-    if (n.has(i) || !removePendingSource(i, e)) return;
-    n.add(i);
-    i.fe = clock;
-    const r = i.Se ?? i._e?.values().next().value;
-    if (r) {
-      setPendingError(i, r);
-      updatePendingSignal(i);
-    } else {
-      i.Y &= ~STATUS_PENDING;
-      setPendingError(i);
-      updatePendingSignal(i);
-      if (i.Me) {
-        enqueueForRerun(i);
-        t = true;
-      }
-      i.Me = false;
-    }
-    forEachDependent(i, settle);
-  };
-  forEachDependent(e, settle);
-  if (t) schedule();
-}
-function isThenable(e) {
-  return e != null && typeof e === "object" && typeof e.then === "function";
-}
-function handleAsync(e, t, n) {
-  let i = false;
-  let r = false;
-  if (typeof t === "object" && t !== null) {
-    untrack(() => {
-      i = t[Symbol.asyncIterator];
-      r = !i && isThenable(t);
-    });
-  }
-  if (!r && !i) {
-    e.be = null;
-    return t;
-  }
-  e.be = t;
-  let o;
-  const handleError = n => {
-    if (e.be !== t) return;
-    globalQueue.initTransition(resolveTransition(e));
-    notifyStatus(e, n instanceof NotReadyError ? STATUS_PENDING : STATUS_ERROR, n);
-    e.fe = clock;
-  };
-  const asyncWrite = (i, r) => {
-    if (e.be !== t) return;
-    if (e.W & (REACTIVE_DIRTY | REACTIVE_OPTIMISTIC_DIRTY)) return;
-    globalQueue.initTransition(resolveTransition(e));
-    const o = !!(e.Y & STATUS_UNINITIALIZED);
-    trimStaleDeps(e);
-    clearStatus(e);
-    const s = resolveLane(e);
-    if (s) s.u.delete(e);
-    if (n) {
-      n(i);
-      if (o) clearStatus(e, true);
-    } else if (e.O !== undefined) {
-      if (e.D === NOT_PENDING) queuePendingNode(e);
-      e.D = i;
-      syncCompanions(e, i);
-      if (!hasActiveOverride(e)) insertSubs(e);
-      e.fe = clock;
-    } else if (s) {
-      const t = e.V;
-      const n = e.Z;
-      const r = e.xe;
-      try {
-        if ((!t && o) || !r || !r(i, n)) {
-          e.Z = i;
-          e.fe = clock;
-          syncCompanions(e, i);
-          insertSubs(e, true);
-        }
-      } catch (t) {
-        notifyStatus(e, STATUS_ERROR, t);
-      }
-    } else {
-      try {
-        setSignal(e, () => i);
-      } catch (t) {
-        notifyStatus(e, STATUS_ERROR, t);
-      }
-    }
-    settlePendingSource(e);
-    schedule();
-    flush();
-    r?.();
-  };
-  if (r) {
-    let n = false,
-      i = false,
-      r,
-      s = true;
-    t.then(
-      e => {
-        if (s) {
-          o = e;
-          n = true;
-        } else asyncWrite(e);
-      },
-      e => {
-        if (s) {
-          r = e;
-          i = true;
-        } else handleError(e);
-      }
-    );
-    s = false;
-    if (i) {
-      handleError(r);
-      throw r;
-    } else if (!n) {
-      globalQueue.initTransition(resolveTransition(e));
-      throw new NotReadyError(context);
-    }
-  }
-  if (i) {
-    const n = t[Symbol.asyncIterator]();
-    let i = false;
-    let r = false;
-    let s = true;
-    cleanup(() => {
-      if (r) return;
-      r = true;
-      try {
-        const e = n.return?.();
-        if (isThenable(e)) e.then(undefined, () => {});
-      } catch {}
-    });
-    const iterate = () => {
-      let u,
-        c,
-        l = false,
-        a = false,
-        f = true;
-      n.next().then(
-        n => {
-          if (f) {
-            u = n;
-            l = true;
-            if (n.done) r = true;
-          } else if (e.be !== t) {
-            return;
-          } else if (!n.done) {
-            i = true;
-            asyncWrite(n.value, iterate);
-          } else {
-            r = true;
-            if (i) {
-              schedule();
-              flush();
-            } else {
-              asyncWrite(undefined);
-            }
-          }
-        },
-        n => {
-          if (f) {
-            c = n;
-            a = true;
-          } else if (e.be === t) {
-            r = true;
-            handleError(n);
-          }
-        }
-      );
-      f = false;
-      if (a) {
-        r = true;
-        handleError(c);
-        if (s) throw c;
-        return true;
-      }
-      if (l && !u.done) {
-        o = u.value;
-        i = true;
-        return iterate();
-      }
-      return l && u.done;
-    };
-    const u = iterate();
-    s = false;
-    if (!i && !u) {
-      globalQueue.initTransition(resolveTransition(e));
-      throw new NotReadyError(context);
-    }
-  }
-  return o;
-}
-function clearStatus(e, t = false) {
-  if (e.Se || e._e) clearPendingSources(e);
-  if (e.Me) e.Me = false;
-  e.Y = t ? 0 : e.Y & STATUS_UNINITIALIZED;
-  if (e.ae) setPendingError(e);
-  if (e.B || e.q) updatePendingSignal(e);
-  if (e.ye) updateChildCompanions(e);
-  if (e.Qe) e.Qe();
-}
-function notifyStatus(e, t, n, i, r) {
-  if (t === STATUS_ERROR && !(n instanceof StatusError) && !(n instanceof NotReadyError))
-    n = new StatusError(e, n);
-  const o = t === STATUS_PENDING && n instanceof NotReadyError ? n.source : undefined;
-  const s = o === e;
-  const u = t === STATUS_PENDING && e.O !== undefined && !s;
-  const c = u && hasActiveOverride(e);
-  if (!i) {
-    if (t === STATUS_PENDING && o) {
-      addPendingSource(e, o);
-      e.Y = STATUS_PENDING | (e.Y & STATUS_UNINITIALIZED);
-      setPendingError(e, o, n);
-    } else {
-      clearPendingSources(e);
-      e.Y = t | (t !== STATUS_ERROR ? e.Y & STATUS_UNINITIALIZED : 0);
-      e.ae = n;
-    }
-    updatePendingSignal(e);
-    if (e.ye) updateChildCompanions(e);
-  }
-  if (r && !i) {
-    assignOrMergeLane(e, r);
-  }
-  const l = i || c;
-  const a = i || u ? undefined : r;
-  if (e.Qe) {
-    if (i && t === STATUS_PENDING) {
-      return;
-    }
-    if (l) {
-      e.Qe(t, n);
-    } else {
-      e.Qe();
-    }
-    return;
-  }
-  forEachDependent(e, (e, i) => {
-    e.fe = clock;
-    if (
-      (t === STATUS_PENDING && o && e.Se !== o && !e._e?.has(o)) ||
-      (t !== STATUS_PENDING && (e.ae !== n || e.Se || e._e))
-    ) {
-      if (i.ke && t !== STATUS_PENDING && !(n instanceof NotReadyError)) {
-        enqueueForRerun(e);
-        schedule();
-        return;
-      }
-      if (!l && !e.S) queuePendingNode(e);
-      notifyStatus(e, t, n, l, a);
-    }
-  });
-}
-let externalSourceConfig = null;
-function enableExternalSource(e) {
-  const { factory: t, untrack: n = e => e() } = e;
-  if (externalSourceConfig) {
-    const { factory: e, untrack: i } = externalSourceConfig;
-    externalSourceConfig = {
-      factory: (n, i) => {
-        const r = e(n, i);
-        const o = t(e => r.track(e), i);
-        return {
-          track: e => o.track(e),
-          dispose() {
-            o.dispose();
-            r.dispose();
-          }
-        };
-      },
-      untrack: e => i(() => n(e))
-    };
-  } else {
-    externalSourceConfig = { factory: t, untrack: n };
-  }
-}
-GlobalQueue.ie = recompute;
-GlobalQueue.re = disposeChildren;
-let tracking = false;
-let stale = false;
-let pendingCheckActive = false;
-let latestReadActive = false;
-let context = null;
-let currentOptimisticLane = null;
-let pendingProbe = null;
-let snapshotCaptureActive = false;
-let snapshotSources = null;
-function ownerInSnapshotScope(e) {
-  while (e) {
-    if (e.je) return true;
-    e = e.J;
-  }
-  return false;
-}
-function setSnapshotCapture(e) {
-  snapshotCaptureActive = e;
-  if (e && !snapshotSources) snapshotSources = new Set();
-}
-function markSnapshotScope(e) {
-  e.je = true;
-}
-function releaseSnapshotScope(e) {
-  e.je = false;
-  releaseSubtree(e);
-  schedule();
-}
-function releaseSubtree(e) {
-  let t = e.ge;
-  while (t) {
-    if (t.je) {
-      t = t.De;
-      continue;
-    }
-    if (t.ce) {
-      const e = t;
-      e.le &= ~CONFIG_IN_SNAPSHOT_SCOPE;
-      if (e.W & REACTIVE_SNAPSHOT_STALE) {
-        e.W &= ~REACTIVE_SNAPSHOT_STALE;
-        e.W |= REACTIVE_DIRTY;
-        if (dirtyQueue.I > e.H) dirtyQueue.I = e.H;
-        insertIntoHeap(e, dirtyQueue);
-      }
-    }
-    releaseSubtree(t);
-    t = t.De;
-  }
-}
-function clearSnapshots() {
-  if (snapshotSources) {
-    for (const e of snapshotSources) {
-      delete e.Ee;
-      delete e[STORE_SNAPSHOT_PROPS];
-    }
-    snapshotSources = null;
-  }
-  snapshotCaptureActive = false;
-}
-function recompute(e, t = false) {
-  const n = e.V;
-  if (!t) {
-    if (e.S && (!n || activeTransition) && activeTransition !== e.S)
-      globalQueue.initTransition(e.S);
-    deleteFromHeap(e, e.W & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
-    e.be = null;
-    if (e.S || n === EFFECT_TRACKED) disposeChildren(e);
-    else if (e.ge !== null || e.Ue !== null) {
-      markDisposal(e);
-      e.Te = e.Ue;
-      e.de = e.ge;
-      e.Ue = null;
-      e.ge = null;
-      e.ve = 0;
-    } else;
-  }
-  let i = !!(e.W & REACTIVE_OPTIMISTIC_DIRTY);
-  const r = e.O !== undefined && e.O !== NOT_PENDING;
-  !!(e.Y & STATUS_PENDING);
-  const o = !!(e.Y & STATUS_UNINITIALIZED);
-  const s = context;
-  context = e;
-  e.me = null;
-  e.He++;
-  e.W = REACTIVE_RECOMPUTING_DEPS;
-  e.fe = clock;
-  let u = e.D === NOT_PENDING ? e.Z : e.D;
-  let c = e.H;
-  let l = tracking;
-  let a = currentOptimisticLane;
-  tracking = true;
-  if (i) {
-    const t = resolveLane(e);
-    if (t) currentOptimisticLane = t;
-  } else if (activeTransition && !t && activeTransition.N.length) {
-    for (let t = e.Oe; t; t = t.Re) {
-      const n = t.pe;
-      if (n.W & REACTIVE_OPTIMISTIC_DIRTY) {
-        const t = resolveLane(n);
-        if (t) {
-          i = true;
-          currentOptimisticLane = t;
-          e.W |= REACTIVE_OPTIMISTIC_DIRTY;
-          assignOrMergeLane(e, t);
-          break;
-        }
-      }
-    }
-  }
-  const f = n && n !== EFFECT_USER;
-  const E = stale;
-  if (f) stale = true;
-  try {
-    if (!false && e.le & CONFIG_SYNC) {
-      u = e.ce(u);
-      e.be = null;
-    } else {
-      const t = e.be;
-      const n = e.ce(u);
-      const i = typeof n === "object" && n !== null;
-      const r = e.be !== t;
-      u = r || !i ? n : handleAsync(e, n);
-      if (!r && !i) e.be = null;
-    }
-    clearStatus(e, t);
-    if (e.i) {
-      const t = resolveLane(e);
-      if (t) {
-        t.u.delete(e);
-        updatePendingSignal(t.o);
-      }
-    }
-  } catch (t) {
-    if (t instanceof NotReadyError && currentOptimisticLane) {
-      const t = findLane(currentOptimisticLane);
-      if (t.o !== e) {
-        t.u.add(e);
-        e.i = t;
-        updatePendingSignal(t.o);
-      }
-    }
-    if (t instanceof NotReadyError) e.Me = true;
-    notifyStatus(
-      e,
-      t instanceof NotReadyError ? STATUS_PENDING : STATUS_ERROR,
-      t,
-      undefined,
-      t instanceof NotReadyError ? e.i : undefined
-    );
-  } finally {
-    tracking = l;
-    if (f) stale = E;
-    e.W = REACTIVE_NONE | (t ? e.W & REACTIVE_SNAPSHOT_STALE : 0);
-    context = s;
-  }
-  if (!e.ae) {
-    trimStaleDeps(e);
-    const s = r ? e.O : e.D === NOT_PENDING ? e.Z : e.D;
-    let l = false;
-    try {
-      l = (!n && o) || !e.xe || !e.xe(s, u);
-    } catch (t) {
-      notifyStatus(e, STATUS_ERROR, t);
-    }
-    if (n && l) {
-      e.G = !e.ae;
-      if (!t) e.F.enqueue(n, (e.$e ??= GlobalQueue.oe.bind(null, e)));
-    }
-    if (e.ae);
-    else if (l) {
-      const o = r ? e.O : undefined;
-      if (t || (n && activeTransition !== e.S) || i) {
-        e.Z = u;
-        if (r && i) {
-          e.O = u;
-          e.D = NOT_PENDING;
-        }
-      } else {
-        e.D = u;
-        if (activeTransition || e.S) syncCompanions(e, u);
-      }
-      if (!r || i || e.O !== o) insertSubs(e, i || r);
-    } else if (r) {
-      if (e.D === NOT_PENDING) queuePendingNode(e);
-      e.D = u;
-    } else if (e.H != c) {
-      for (let t = e.P; t !== null; t = t.L) {
-        insertIntoHeapHeight(t.U, t.U.W & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
-      }
-    }
-  }
-  currentOptimisticLane = a;
-  const d =
-    e.D !== NOT_PENDING ||
-    e.de !== null ||
-    e.Te !== null ||
-    !!(e.Y & (STATUS_PENDING | STATUS_UNINITIALIZED));
-  d && (!t || e.Y & STATUS_PENDING) && (!e.S || r) && queuePendingNode(e);
-  e.S && n && activeTransition !== e.S && runInTransition(e.S, () => recompute(e));
-}
-function updateIfNecessary(e) {
-  if (e.W & REACTIVE_CHECK) {
-    for (let t = e.Oe; t; t = t.Re) {
-      const n = t.pe;
-      const i = n.Ie || n;
-      if (i.ce) {
-        updateIfNecessary(i);
-      }
-      if (e.W & REACTIVE_DIRTY) {
-        break;
-      }
-    }
-  }
-  if (e.W & (REACTIVE_DIRTY | REACTIVE_OPTIMISTIC_DIRTY) || (e.ae && e.fe < clock && !e.be)) {
-    recompute(e);
-  }
-  e.W = e.W & (REACTIVE_SNAPSHOT_STALE | REACTIVE_IN_HEAP | REACTIVE_IN_HEAP_HEIGHT);
-}
-function computed(e, t) {
-  const n = t?.transparent ?? false;
-  const i = {
-    id: t?.id ?? (n ? context?.id : context?.id != null ? getNextChildId(context) : undefined),
-    le:
-      (n ? CONFIG_TRANSPARENT : 0) |
-      (t?.ownedWrite ? CONFIG_OWNED_WRITE : 0) |
-      (!context || t?.lazy ? CONFIG_AUTO_DISPOSE : 0) |
-      (t?.sync ? CONFIG_SYNC : 0) |
-      (t?.Ke ? CONFIG_NO_SNAPSHOT : 0) |
-      (snapshotCaptureActive && ownerInSnapshotScope(context) ? CONFIG_IN_SNAPSHOT_SCOPE : 0),
-    xe: t?.equals != null ? t.equals : isEqual,
-    m: t?.unobserved,
-    Ue: null,
-    F: context?.F ?? globalQueue,
-    Ve: context?.Ve ?? defaultContext,
-    ve: 0,
-    ce: e,
-    Z: undefined,
-    H: 0,
-    ye: null,
-    Ce: undefined,
-    Ne: null,
-    Oe: null,
-    me: null,
-    He: 0,
-    P: null,
-    Fe: null,
-    J: context,
-    De: null,
-    we: null,
-    ge: null,
-    W: t?.lazy ? REACTIVE_LAZY : REACTIVE_NONE,
-    Y: STATUS_UNINITIALIZED,
-    fe: clock,
-    D: NOT_PENDING,
-    Te: null,
-    de: null,
-    be: null,
-    S: null
-  };
-  setupComputedNode(i, t);
-  return i;
-}
-function createEffectNode(e, t, n, i, r, o) {
-  const s = o?.transparent ?? false;
-  const u = {
-    id: o?.id ?? (s ? context?.id : context?.id != null ? getNextChildId(context) : undefined),
-    le:
-      (s ? CONFIG_TRANSPARENT : 0) |
-      (o?.ownedWrite ? CONFIG_OWNED_WRITE : 0) |
-      (o?.sync ? CONFIG_SYNC : 0) |
-      (snapshotCaptureActive && ownerInSnapshotScope(context) ? CONFIG_IN_SNAPSHOT_SCOPE : 0),
-    xe: false,
-    m: o?.unobserved,
-    Ue: null,
-    F: context?.F ?? globalQueue,
-    Ve: context?.Ve ?? defaultContext,
-    ve: 0,
-    ce: e,
-    Z: undefined,
-    H: 0,
-    ye: null,
-    Ce: undefined,
-    Ne: null,
-    Oe: null,
-    me: null,
-    He: 0,
-    P: null,
-    Fe: null,
-    J: context,
-    De: null,
-    we: null,
-    ge: null,
-    W: REACTIVE_LAZY,
-    Y: STATUS_UNINITIALIZED,
-    fe: clock,
-    D: NOT_PENDING,
-    Te: null,
-    de: null,
-    be: null,
-    S: null,
-    G: false,
-    Ye: undefined,
-    Ze: t,
-    Be: n,
-    Le: undefined,
-    V: i,
-    Qe: r
-  };
-  setupComputedNode(u, lazyOptions);
-  return u;
-}
-const lazyOptions = { lazy: true };
-function setupComputedNode(e, t) {
-  e.Ne = e;
-  const n = context?.he ? context.Ae : context;
-  if (context) {
-    const t = context.ge;
-    if (t === null) {
-      context.ge = e;
-    } else {
-      e.De = t;
-      t.we = e;
-      context.ge = e;
-    }
-  }
-  if (n) e.H = n.H + 1;
-  if (externalSourceConfig) {
-    const t = signal(undefined, { equals: false, ownedWrite: true });
-    const n = externalSourceConfig.factory(e.ce, () => {
-      setSignal(t, undefined);
-    });
-    cleanup(() => n.dispose());
-    e.ce = e => {
-      read(t);
-      return n.track(e);
-    };
-  }
-  !t?.lazy && recompute(e, true);
-  if (snapshotCaptureActive && !t?.lazy) {
-    if (!(e.Y & STATUS_PENDING) && !(e.le & CONFIG_NO_SNAPSHOT)) {
-      e.Ee = e.Z === undefined ? NO_SNAPSHOT : e.Z;
-      snapshotSources.add(e);
-    }
-  }
-}
-function signal(e, t, n = null) {
-  const i = {
-    xe: t?.equals != null ? t.equals : isEqual,
-    le: (t?.ownedWrite ? CONFIG_OWNED_WRITE : 0) | (t?.Ke ? CONFIG_NO_SNAPSHOT : 0),
-    m: t?.unobserved,
-    Z: e,
-    P: null,
-    Fe: null,
-    fe: clock,
-    Ie: n,
-    Pe: n?.ye || null,
-    D: NOT_PENDING
-  };
-  n && (n.ye = i);
-  if (snapshotCaptureActive && !(i.le & CONFIG_NO_SNAPSHOT) && !((n?.Y ?? 0) & STATUS_PENDING)) {
-    i.Ee = e === undefined ? NO_SNAPSHOT : e;
-    snapshotSources.add(i);
-  }
-  return i;
-}
-function optimisticSignal(e, t) {
-  const n = signal(e, t);
-  n.O = NOT_PENDING;
-  return n;
-}
-function optimisticComputed(e, t) {
-  const n = computed(e, t);
-  n.O = NOT_PENDING;
-  return n;
-}
-function isEqual(e, t) {
-  return e === t;
-}
-function untrack(e, t) {
-  if (!externalSourceConfig && !tracking && true) return e();
-  const n = tracking;
-  tracking = false;
-  try {
-    if (externalSourceConfig) return externalSourceConfig.untrack(e);
-    return e();
-  } finally {
-    tracking = n;
-  }
-}
-function prepareComputed(e, t) {
-  if (e.W & REACTIVE_LAZY) {
-    e.W &= ~REACTIVE_LAZY;
-    recompute(e, true);
-  } else if (e.W & REACTIVE_DISPOSED) {
-    recompute(e, true);
-  } else if (t) {
-    updateIfNecessary(e);
-  }
-}
-function read(e) {
-  if (latestReadActive) {
-    const t = getLatestValueComputed(e);
-    const n = latestReadActive;
-    latestReadActive = false;
-    const i = e.O !== undefined && e.O !== NOT_PENDING ? e.O : e.Z;
-    let r;
-    try {
-      r = read(t);
-    } catch (t) {
-      if (t instanceof NotReadyError && (!context || !(e.Y & STATUS_UNINITIALIZED))) return i;
-      throw t;
-    } finally {
-      latestReadActive = n;
-    }
-    if (t.Y & STATUS_PENDING) return i;
-    if (stale && currentOptimisticLane && t.i) {
-      const e = findLane(t.i);
-      const n = findLane(currentOptimisticLane);
-      if (e !== n && e.u.size > 0) {
-        return i;
-      }
-    }
-    return r;
-  }
-  let t = context;
-  if (t?.he) t = t.Ae;
-  const n = e;
-  const i = e.Ie;
-  const r = i || e;
-  if (pendingCheckActive) {
-    pendingCheckActive = false;
-    if (typeof n.ce === "function") prepareComputed(e, true);
-    if (t && r.Y & STATUS_PENDING && r.Y & STATUS_UNINITIALIZED) {
-      if (tracking && e !== t) link(e, t);
-      pendingCheckActive = true;
-      throw r.ae;
-    }
-    collectPendingSources(e);
-    if (i) collectPendingSources(i);
-    pendingCheckActive = true;
-  } else if (typeof n.ce === "function") {
-    prepareComputed(e, false);
-  }
-  if (
-    !n.ce &&
-    r === e &&
-    e.O === undefined &&
-    e.Ee === undefined &&
-    activeTransition === null &&
-    currentOptimisticLane === null &&
-    !snapshotCaptureActive &&
-    true
-  ) {
-    if (t && tracking) link(e, t);
-    return !t || e.D === NOT_PENDING ? e.Z : e.D;
-  }
-  if (t && tracking) {
-    link(e, t, pendingCheckActive);
-    if (r.ce) {
-      const n = e.W & REACTIVE_ZOMBIE;
-      if (r.H >= (n ? zombieQueue.I : dirtyQueue.I)) {
-        markNode(t);
-        markHeap(n ? zombieQueue : dirtyQueue);
-        updateIfNecessary(r);
-      }
-      const i = r.H;
-      if (i >= t.H && e.J !== t) {
-        t.H = i + 1;
-      }
-    }
-  }
-  if (r.Y & STATUS_PENDING) {
-    if (t && !(stale && r.S && activeTransition !== r.S)) {
-      if (currentOptimisticLane) {
-        const n = r.i;
-        const i = findLane(currentOptimisticLane);
-        if (n && findLane(n) === i && !hasActiveOverride(r)) {
-          if (!tracking && e !== t) link(e, t);
-          throw r.ae;
-        }
-      } else {
-        if (!tracking && e !== t) link(e, t);
-        throw r.ae;
-      }
-    } else if (t && r !== e && r.Y & STATUS_UNINITIALIZED) {
-      if (!tracking && e !== t) link(e, t);
-      throw r.ae;
-    } else if (!t && r.Y & STATUS_UNINITIALIZED) {
-      throw r.ae;
-    }
-  }
-  if (e.ce && e.Y & STATUS_ERROR) {
-    if (tracking && !pendingCheckActive && e.fe < clock) {
-      recompute(e);
-      return read(e);
-    } else throw e.ae;
-  }
-  if (snapshotCaptureActive && t && t.le & CONFIG_IN_SNAPSHOT_SCOPE) {
-    const n = e.Ee;
-    if (n !== undefined) {
-      const i = n === NO_SNAPSHOT ? undefined : n;
-      const r = e.D !== NOT_PENDING ? e.D : e.Z;
-      if (r !== i) t.W |= REACTIVE_SNAPSHOT_STALE;
-      return i;
-    }
-  }
-  if (e.O !== undefined && e.O !== NOT_PENDING) {
-    if (t && stale && shouldReadStashedOptimisticValue(e)) return e.Z;
-    return e.O;
-  }
-  if (
-    activeTransition !== null &&
-    currentOptimisticLane !== null &&
-    !latestReadActive &&
-    e.D !== NOT_PENDING &&
-    (r === e || !!(r.W & REACTIVE_MANUAL_WRITE)) &&
-    !e.ce &&
-    t
-  ) {
-    activeTransition.K.add(t);
-    return e.Z;
-  }
-  const o =
-    !t ||
-    (currentOptimisticLane !== null &&
-      (e.O !== undefined || e.i || (r === e && stale && t.t !== e) || !!(r.Y & STATUS_PENDING))) ||
-    e.D === NOT_PENDING ||
-    (stale && e.S && activeTransition !== e.S)
-      ? e.Z
-      : e.D;
-  if (pendingCheckActive && pendingProbe !== null && e.D !== NOT_PENDING && o === e.D)
-    pendingProbe.freshReads.add(e);
-  if (
-    !t &&
-    r === e &&
-    typeof n.ce === "function" &&
-    e.le & CONFIG_AUTO_DISPOSE &&
-    !(r.Y & STATUS_PENDING) &&
-    !e.P
-  ) {
-    unobserved(e);
-  }
-  return o;
-}
-function setSignal(e, t) {
-  if (e.S && activeTransition !== e.S) globalQueue.initTransition(e.S);
-  const n = e.O !== undefined && !projectionWriteActive;
-  const i = e.O !== undefined && e.O !== NOT_PENDING;
-  const r = n ? (i ? e.O : e.Z) : e.D === NOT_PENDING ? e.Z : e.D;
-  if (typeof t === "function") t = t(r);
-  const o = !!(e.Y & STATUS_UNINITIALIZED) || !e.xe || !e.xe(r, t);
-  if (!o) {
-    if (n && i) {
-      const t = resolveTransition(e);
-      if (t && activeTransition !== t) globalQueue.initTransition(t);
-    }
-    return t;
-  }
-  if (n) {
-    const n = e.O === NOT_PENDING;
-    if (!n) globalQueue.initTransition(resolveTransition(e));
-    if (n) globalQueue.N.push(e);
-    const i = getOrCreateLane(e);
-    e.i = i;
-    e.O = t;
-  } else {
-    if (e.D === NOT_PENDING) queuePendingNode(e);
-    e.D = t;
-  }
-  syncCompanions(e, t);
-  e.fe = clock;
-  insertSubs(e, n);
-  schedule();
-  return t;
-}
-function suppressComputedRecompute(e) {
-  deleteFromHeap(e, e.W & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
-  if (!(e.W & REACTIVE_MANUAL_WRITE) && e.D === NOT_PENDING) {
-    queuePendingNode(e);
-    schedule();
-  }
-  e.W = (e.W & -4) | REACTIVE_MANUAL_WRITE;
-}
-function setMemo(e, t) {
-  const n = setSignal(e, t);
-  suppressComputedRecompute(e);
-  return n;
-}
-function runWithOwner(e, t) {
-  const n = context;
-  const i = tracking;
-  context = e;
-  tracking = false;
-  try {
-    return t();
-  } finally {
-    context = n;
-    tracking = i;
-  }
-}
-function getPendingSignal(e) {
-  if (!e.B) {
-    e.B = optimisticSignal(false, { ownedWrite: true });
-    e.B.t = e;
-    if (computePendingState(e)) setSignal(e.B, true);
-  }
-  return e.B;
-}
-function collectPendingSources(e) {
-  if (!pendingProbe) return;
-  pendingProbe.sources.add(e);
-  const t = e.Ie || e;
-  if (t !== e) pendingProbe.sources.add(t);
-}
-function computePendingState(e) {
-  const t = e;
-  if (t.W & REACTIVE_DISPOSED) return false;
-  const n = e.Ie;
-  if ((n || t).qe) return false;
-  if (e.t) {
-    const t = e.t;
-    if (hasActiveOverride(t)) return false;
-    const n = t.Ie || t;
-    if (n.qe) return false;
-    return !!(n.Y & STATUS_PENDING && !(n.Y & STATUS_UNINITIALIZED));
-  }
-  if (hasActiveOverride(e)) return false;
-  if (n && e.D !== NOT_PENDING) {
-    return !!(n.W & REACTIVE_MANUAL_WRITE) || (!n.be && !(n.Y & STATUS_PENDING));
-  }
-  if (e.D !== NOT_PENDING && !(t.Y & STATUS_UNINITIALIZED)) return true;
-  return !!(t.Y & STATUS_PENDING && !(t.Y & STATUS_UNINITIALIZED));
-}
-function syncCompanions(e, t) {
-  if (e.B) updatePendingSignal(e);
-  if (e.q) setSignal(e.q, t);
-}
-function updatePendingSignal(e) {
-  if (e.B) {
-    setSignal(e.B, computePendingState(e));
-  }
-  if (e.q) updatePendingSignal(e.q);
-}
-function updateChildCompanions(e) {
-  for (let t = e.ye; t !== null; t = t.Pe) {
-    if (t.B || t.q) updatePendingSignal(t);
-  }
-}
-function snapCompanionsToState(e) {
-  const t = e.B;
-  if (t && (t.O === undefined || t.O === NOT_PENDING)) {
-    const n = computePendingState(e);
-    if (t.Z !== n || t.D !== NOT_PENDING) {
-      t.Z = n;
-      t.D = NOT_PENDING;
-      t.fe = clock;
-      insertSubs(t);
-      schedule();
-    }
-  }
-  const n = e.q;
-  if (n && !(n.W & REACTIVE_DISPOSED)) {
-    if (
-      (n.O === undefined || n.O === NOT_PENDING) &&
-      n.D === NOT_PENDING &&
-      !Object.is(n.Z, e.Z) &&
-      !(n.W & (REACTIVE_DIRTY | REACTIVE_CHECK))
-    ) {
-      n.W |= REACTIVE_DIRTY;
-      insertIntoHeap(n, n.W & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
-      insertSubs(n);
-      schedule();
-    }
-    snapCompanionsToState(n);
-  }
-}
-function getLatestValueComputed(e) {
-  if (!e.q) {
-    const t = latestReadActive;
-    latestReadActive = false;
-    const n = pendingCheckActive;
-    pendingCheckActive = false;
-    const i = context;
-    context = null;
-    e.q = optimisticComputed(() => read(e));
-    e.q.t = e;
-    context = i;
-    pendingCheckActive = n;
-    latestReadActive = t;
-  }
-  return e.q;
-}
-function staleValues(e, t = true) {
-  const n = stale;
-  stale = t;
-  try {
-    return e();
-  } finally {
-    stale = n;
-  }
-}
-function latest(e) {
-  const t = latestReadActive;
-  latestReadActive = true;
-  try {
-    return e();
-  } finally {
-    latestReadActive = t;
-  }
-}
-function isPending(e) {
-  const t = pendingCheckActive;
-  const n = pendingProbe;
-  pendingCheckActive = true;
-  const i = (pendingProbe = { found: false, sources: new Set(), freshReads: new Set() });
-  const collectPending = () => {
-    pendingCheckActive = false;
-    try {
-      i.sources.forEach(e => {
-        if (read(getPendingSignal(e)) && !i.freshReads.has(e)) i.found = true;
-      });
-    } finally {
-      pendingCheckActive = true;
-    }
-  };
-  try {
-    e();
-    collectPending();
-    return i.found;
-  } catch (e) {
-    collectPending();
-    if (e instanceof NotReadyError) {
-      if (i.found && !(e.source?.Y & STATUS_UNINITIALIZED)) return true;
-      if (context) throw e;
-    }
-    return i.found;
-  } finally {
-    pendingCheckActive = t;
-    pendingProbe = n;
-  }
-}
-function refresh(e) {
-  const t = e?.[$REFRESH];
-  if (!t) {
-    return;
-  }
-  if (typeof t.ce === "function" && !(t.W & (REACTIVE_DISPOSED | REACTIVE_MANUAL_WRITE))) {
-    t.W = (t.W & ~REACTIVE_CHECK) | REACTIVE_DIRTY;
-    insertIntoHeap(t, t.W & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
-    schedule();
-  }
-}
-function createContext(e, t) {
-  return { id: Symbol(t), defaultValue: e };
-}
-function getContext(e, t = getOwner()) {
-  if (!t) {
-    throw new NoOwnerError();
-  }
-  const n = hasContext(e, t) ? t.Ve[e.id] : e.defaultValue;
-  if (isUndefined(n)) {
-    throw new ContextNotFoundError();
-  }
-  return n;
-}
-function setContext(e, t, n = getOwner()) {
-  if (!n) {
-    throw new NoOwnerError();
-  }
-  n.Ve = { ...n.Ve, [e.id]: isUndefined(t) ? e.defaultValue : t };
-}
-function hasContext(e, t) {
-  return !isUndefined(t?.Ve[e.id]);
-}
-function isUndefined(e) {
-  return typeof e === "undefined";
-}
-function effect(e, t, n, i) {
-  const r = !!i?.user;
-  const o = createEffectNode(e, t, n, r ? EFFECT_USER : EFFECT_RENDER, notifyEffectStatus, i);
-  recompute(o, true);
-  !i?.defer &&
-    (o.V === EFFECT_USER || i?.schedule ? o.F.enqueue(o.V, runEffect.bind(null, o)) : runEffect(o));
-}
-function notifyEffectStatus(e, t) {
-  const n = e !== undefined ? e : this.Y;
-  const i = t !== undefined ? t : this.ae;
-  if (n & STATUS_ERROR) {
-    this.F.notify(this, STATUS_PENDING, 0);
-    if (this.V === EFFECT_USER) {
-      if (this.Y & STATUS_ERROR) {
-        this.G = true;
-        this.F.enqueue(this.V, (this.$e ??= runEffect.bind(null, this)));
-      }
-      return;
-    }
-    if (!this.F.notify(this, STATUS_ERROR, STATUS_ERROR)) {
-      haltReactivity();
-      throw i;
-    }
-  } else if (this.V === EFFECT_RENDER) {
-    this.F.notify(this, STATUS_PENDING | STATUS_ERROR, n, i);
-  }
-}
-function runEffect(e) {
-  if (!e.G || e.W & REACTIVE_DISPOSED) return;
-  if (e.Y & STATUS_ERROR && e.V === EFFECT_USER) {
-    const t = unwrapStatusError(e.ae);
-    e.Ye = e.Z;
-    e.G = false;
-    try {
-      e.Be
-        ? e.Be(t, () => {
-            const t = e.Le;
-            e.Le = undefined;
-            t?.();
-          })
-        : console.error(t);
-    } catch (t) {
-      if (!e.F.notify(e, STATUS_ERROR, STATUS_ERROR)) {
-        haltReactivity();
-        throw t;
-      }
-    }
-    return;
-  }
-  const t = e.Le;
-  e.Le = undefined;
-  try {
-    t?.();
-    const n = e.Ze(e.Z, e.Ye);
-    if (false && n !== undefined && typeof n !== "function");
-    e.Le = n;
-  } catch (t) {
-    e.ae = new StatusError(e, t);
-    e.Y |= STATUS_ERROR;
-    if (!e.F.notify(e, STATUS_ERROR, STATUS_ERROR)) {
-      haltReactivity();
-      throw t;
-    }
-  } finally {
-    e.Ye = e.Z;
-    e.G = false;
-  }
-}
-GlobalQueue.oe = runEffect;
-function trackedEffect(e, t) {
-  const run = () => {
-    if (!n.G || n.W & REACTIVE_DISPOSED) return;
-    try {
-      n.G = false;
-      recompute(n);
-    } finally {
-    }
-  };
-  const n = computed(
-    () => {
-      const t = n.Le;
-      n.Le = undefined;
-      t?.();
-      const i = staleValues(e);
-      n.Le = i;
-    },
-    { ...t, lazy: true }
-  );
-  n.Le = undefined;
-  n.le = (n.le & ~CONFIG_AUTO_DISPOSE) | CONFIG_CHILDREN_FORBIDDEN;
-  n.G = true;
-  n.V = EFFECT_TRACKED;
-  n.Qe = (e, t) => {
-    const i = e !== undefined ? e : n.Y;
-    if (i & STATUS_ERROR) {
-      n.F.notify(n, STATUS_PENDING, 0);
-      const e = t !== undefined ? t : n.ae;
-      if (!n.F.notify(n, STATUS_ERROR, STATUS_ERROR)) {
-        haltReactivity();
-        throw e;
-      }
-    }
-  };
-  n.k = run;
-  n.F.enqueue(EFFECT_USER, run);
-}
-function restoreTransition(e, t) {
-  globalQueue.initTransition(e);
-  const n = t();
-  flush();
-  return n;
-}
-function action(e) {
-  return (...t) =>
-    new Promise((n, i) => {
-      const r = e(...t);
-      globalQueue.initTransition();
-      let o = activeTransition;
-      o.j.push(r);
-      const done = (e, t, s = false) => {
-        o = currentTransition(o);
-        const u = o.j.indexOf(r);
-        if (u >= 0) o.j.splice(u, 1);
-        setActiveTransition(o);
-        schedule();
-        s ? i(t) : n(e);
-      };
-      const step = (e, t) => {
-        let n;
-        try {
-          n = t ? r.throw(e) : r.next(e);
-        } catch (e) {
-          return done(undefined, e, true);
-        }
-        if (isThenable(n)) return void n.then(run, e => done(undefined, e, true));
-        run(n);
-      };
-      const run = e => {
-        if (e.done) return done(e.value);
-        if (isThenable(e.value))
-          return void e.value.then(
-            e => restoreTransition(o, () => step(e)),
-            e => restoreTransition(o, () => step(e, true))
-          );
-        restoreTransition(o, () => step(e.value));
-      };
-      step();
-    });
-}
-function onCleanup(e) {
-  return cleanup(e);
-}
-function accessor(e) {
-  const t = read.bind(null, e);
-  t[$REFRESH] = e;
-  return t;
-}
-function createSignal(e, t) {
-  if (typeof e === "function") {
-    const n = computed(e, t);
-    n.le &= ~CONFIG_AUTO_DISPOSE;
-    return [accessor(n), setMemo.bind(null, n)];
-  }
-  const n = signal(e, t);
-  return [accessor(n), setSignal.bind(null, n)];
-}
-function createMemo(e, t) {
-  return accessor(computed(e, t));
-}
-function createEffect(e, t, n) {
-  effect(e, t.effect || t, t.error, { user: true, ...n });
-}
-function createRenderEffect(e, t, n) {
-  effect(e, t, undefined, n);
-}
-function createTrackedEffect(e, t) {
-  trackedEffect(e, t);
-}
-function createReaction(e, t) {
-  let n = undefined;
-  cleanup(() => n?.());
-  const i = getOwner();
-  let r;
-  return o => {
-    if (r) {
-      dispose(r);
-      r = undefined;
-    }
-    runWithOwner(i, () => {
-      effect(
-        () => (o(), (r = getOwner())),
-        t => {
-          r = undefined;
-          n?.();
-          const i = (e.effect || e)?.();
-          if (false && i !== undefined && typeof i !== "function");
-          n = i;
-          dispose(t);
-        },
-        e.error,
-        { ...(false ? { ...t, name: t?.name ?? "effect" } : t), user: true, defer: true }
-      );
-    });
-  };
-}
-function resolve(e) {
-  return new Promise((t, n) => {
-    createRoot(i => {
-      effect(
-        e,
-        e => {
-          t(e);
-          i();
-        },
-        e => {
-          n(e);
-          i();
-        },
-        { user: true }
-      );
-    });
-  });
-}
-function createOptimistic(e, t) {
-  if (typeof e === "function") {
-    const n = optimisticComputed(e, t);
-    n.le &= ~CONFIG_AUTO_DISPOSE;
-    return [accessor(n), setSignal.bind(null, n)];
-  }
-  const n = optimisticSignal(e, t);
-  return [accessor(n), setSignal.bind(null, n)];
-}
-function onSettled(e) {
-  const t = getOwner();
-  t && !(t.le & CONFIG_CHILDREN_FORBIDDEN)
-    ? createTrackedEffect(() => untrack(e), undefined)
-    : globalQueue.enqueue(EFFECT_USER, () => {
-        e();
-      });
-}
-function nodeKeys(e) {
-  const t = Object.keys(e);
-  if (symbolKeyedRecords.has(e)) {
-    const n = Object.getOwnPropertySymbols(e);
-    for (let e = 0, i = n.length; e < i; e++) {
-      if (n[e] !== $TRACK) t.push(n[e]);
-    }
-  }
-  return t;
-}
-function unwrap(e) {
-  if (e === null || typeof e !== "object") return e;
-  return e[$TARGET]?.[STORE_VALUE] ?? e;
-}
-function getOverrideValue(e, t, n, i) {
-  if (i && n in i) return i[n];
-  return t && n in t ? t[n] : e[n];
-}
-function addEnumSymbols(e, t, n) {
-  for (let i = 0, r = t.length; i < r; i++) {
-    if (Object.prototype.propertyIsEnumerable.call(e, t[i])) n.add(t[i]);
-  }
-}
-function getAllKeys(e, t, n) {
-  const i = getKeys(e, t);
-  const r = Object.keys(n);
-  const o = e[$TARGET]
-    ? untrack(() => Object.getOwnPropertySymbols(e))
-    : Object.getOwnPropertySymbols(e);
-  const s = Object.getOwnPropertySymbols(n);
-  if (o.length === 0 && s.length === 0) {
-    if (i.length === r.length) {
-      let e = true;
-      for (let t = 0; t < i.length; t++) {
-        if (i[t] !== r[t]) {
-          e = false;
-          break;
-        }
-      }
-      if (e) return i;
-    }
-    const e = new Set(i);
-    for (let t = 0; t < r.length; t++) e.add(r[t]);
-    return Array.from(e);
-  }
-  const u = new Set(i);
-  addEnumSymbols(e, o, u);
-  if (t) {
-    for (const e of Reflect.ownKeys(t)) {
-      t[e] === $DELETED ? u.delete(e) : u.add(e);
-    }
-  }
-  for (let e = 0; e < r.length; e++) u.add(r[e]);
-  addEnumSymbols(n, s, u);
-  return Array.from(u);
-}
-function wrapValue(e, t) {
-  return isWrappable(e) ? wrap(e, t) : e;
-}
-function itemKey(e, t) {
-  return isWrappable(e) ? t(e) : e;
-}
-function keyedMatch(e, t, n) {
-  return e === t || (isWrappable(e) && isWrappable(t) && n(e) === n(t));
-}
-function syncArrayNodeMembership(e, t) {
-  let n = e[STORE_NODE];
-  if (n) {
-    const e = nodeKeys(n);
-    for (let i = 0, r = e.length; i < r; i++) {
-      const r = e[i];
-      r in t || setSignal(n[r], undefined);
-    }
-  }
-  if ((n = e[STORE_HAS])) {
-    const e = nodeKeys(n);
-    for (let i = 0, r = e.length; i < r; i++) {
-      const r = e[i];
-      setSignal(n[r], r in t);
-    }
-  }
-}
-function applyArrayItem(e, t, n, i, r) {
-  if (isWrappable(e) && isWrappable(t)) {
-    const o = wrap(t, n);
-    i && setSignal(i, o);
-    applyState(e, o, r);
-  } else i && setSignal(i, wrapValue(e, n));
-}
-function applyState(e, t, n) {
-  e = unwrap(e);
-  const i = t?.[$TARGET];
-  if (!i) return;
-  if (i[STORE_OVERRIDE] || i[STORE_OPTIMISTIC_OVERRIDE]) {
-    applyStateSlow(e, i, n);
-  } else {
-    applyStateFast(e, i, n);
-  }
-}
-function applyStateFast(e, t, n) {
-  const i = t[STORE_VALUE];
-  if (e === i) return;
-  const r = t[STORE_NODE];
-  (t[STORE_LOOKUP] || storeLookup).set(e, t[$PROXY]);
-  t[STORE_VALUE] = e;
-  if (Array.isArray(i)) {
-    let o = false;
-    const s = i.length;
-    if (e.length && s && isWrappable(e[0]) && n(e[0]) != null) {
-      let u, c, l, a, f, E, d, T;
-      for (l = 0, a = Math.min(s, e.length); l < a && keyedMatch((E = i[l]), e[l], n); l++) {
-        isWrappable(E) && isWrappable(e[l]) && applyState(e[l], wrap(E, t), n);
-      }
-      const S = new Array(e.length),
-        _ = new Map();
-      for (
-        a = s - 1, f = e.length - 1;
-        a >= l && f >= l && keyedMatch((E = i[a]), e[f], n);
-        a--, f--
-      ) {
-        S[f] = E;
-      }
-      if (l > f || l > a) {
-        for (c = l; c <= f; c++) {
-          o = true;
-          r?.[c] && setSignal(r[c], wrapValue(e[c], t));
-        }
-        for (; c < e.length; c++) {
-          o = true;
-          applyArrayItem(e[c], S[c], t, r?.[c], n);
-        }
-        syncArrayNodeMembership(t, e);
-        (o || s !== e.length) && notifySelf(t);
-        s !== e.length && r?.length && setSignal(r.length, e.length);
-        return;
-      }
-      d = new Array(f + 1);
-      for (c = f; c >= l; c--) {
-        E = e[c];
-        T = itemKey(E, n);
-        u = _.get(T);
-        d[c] = u === undefined ? -1 : u;
-        _.set(T, c);
-      }
-      for (u = l; u <= a; u++) {
-        E = i[u];
-        T = itemKey(E, n);
-        c = _.get(T);
-        if (c !== undefined && c !== -1) {
-          S[c] = E;
-          c = d[c];
-          _.set(T, c);
-        }
-      }
-      for (c = l; c < e.length; c++) {
-        if (c in S) {
-          applyArrayItem(e[c], S[c], t, r?.[c], n);
-        } else r?.[c] && setSignal(r[c], wrapValue(e[c], t));
-      }
-      if (l < e.length) o = true;
-    } else if (e.length) {
-      for (let s = 0, u = e.length; s < u; s++) {
-        const u = i[s];
-        if (isWrappable(u) && isWrappable(e[s])) applyState(e[s], wrap(u, t), n);
-        else {
-          if (u !== e[s]) o = true;
-          r?.[s] && setSignal(r[s], wrapValue(e[s], t));
-        }
-      }
-    }
-    syncArrayNodeMembership(t, e);
-    if (s !== e.length) {
-      o = true;
-      r?.length && setSignal(r.length, e.length);
-    }
-    o && notifySelf(t);
-    return;
-  }
-  let o = t[STORE_NODE];
-  if (o) {
-    const r = o[$TRACK];
-    const s = r ? getAllKeys(i, undefined, e) : nodeKeys(o);
-    for (let u = 0, c = s.length; u < c; u++) {
-      const c = s[u];
-      const l = o[c];
-      const a = unwrap(i[c]);
-      let f = unwrap(e[c]);
-      if (a === f) continue;
-      if (
-        !a ||
-        !isWrappable(a) ||
-        !isWrappable(f) ||
-        Array.isArray(a) !== Array.isArray(f) ||
-        (n(a) != null && n(a) !== n(f))
-      ) {
-        r && setSignal(r, void 0);
-        l && setSignal(l, isWrappable(f) ? wrap(f, t) : f);
-      } else applyState(f, wrap(a, t), n);
-    }
-  }
-  if ((o = t[STORE_HAS])) {
-    const t = nodeKeys(o);
-    for (let n = 0, i = t.length; n < i; n++) {
-      const i = t[n];
-      setSignal(o[i], i in e);
-    }
-  }
-}
-function applyStateSlow(e, t, n) {
-  const i = t[STORE_VALUE];
-  const r = t[STORE_OVERRIDE];
-  const o = t[STORE_OPTIMISTIC_OVERRIDE];
-  let s = t[STORE_NODE];
-  (t[STORE_LOOKUP] || storeLookup).set(e, t[$PROXY]);
-  t[STORE_VALUE] = e;
-  t[STORE_OVERRIDE] = undefined;
-  if (Array.isArray(i)) {
-    let u = false;
-    const c = getOverrideValue(i, r, "length", o);
-    if (e.length && c && isWrappable(e[0]) && n(e[0]) != null) {
-      let l, a, f, E, d, T, S, _;
-      for (
-        f = 0, E = Math.min(c, e.length);
-        f < E && keyedMatch((T = getOverrideValue(i, r, f, o)), e[f], n);
-        f++
-      ) {
-        isWrappable(T) && isWrappable(e[f]) && applyState(e[f], wrap(T, t), n);
-      }
-      const O = new Array(e.length),
-        R = new Map();
-      for (
-        E = c - 1, d = e.length - 1;
-        E >= f && d >= f && keyedMatch((T = getOverrideValue(i, r, E, o)), e[d], n);
-        E--, d--
-      ) {
-        O[d] = T;
-      }
-      if (f > d || f > E) {
-        for (a = f; a <= d; a++) {
-          u = true;
-          s?.[a] && setSignal(s[a], wrapValue(e[a], t));
-        }
-        for (; a < e.length; a++) {
-          u = true;
-          applyArrayItem(e[a], O[a], t, s?.[a], n);
-        }
-        const i = e.length;
-        syncArrayNodeMembership(t, e);
-        (u || c !== i) && notifySelf(t);
-        c !== i && s?.length && setSignal(s.length, i);
-        return;
-      }
-      S = new Array(d + 1);
-      for (a = d; a >= f; a--) {
-        T = e[a];
-        _ = itemKey(T, n);
-        l = R.get(_);
-        S[a] = l === undefined ? -1 : l;
-        R.set(_, a);
-      }
-      for (l = f; l <= E; l++) {
-        T = getOverrideValue(i, r, l, o);
-        _ = itemKey(T, n);
-        a = R.get(_);
-        if (a !== undefined && a !== -1) {
-          O[a] = T;
-          a = S[a];
-          R.set(_, a);
-        }
-      }
-      for (a = f; a < e.length; a++) {
-        if (a in O) {
-          applyArrayItem(e[a], O[a], t, s?.[a], n);
-        } else s?.[a] && setSignal(s[a], wrapValue(e[a], t));
-      }
-      if (f < e.length) u = true;
-    } else if (e.length) {
-      for (let c = 0, l = e.length; c < l; c++) {
-        const l = getOverrideValue(i, r, c, o);
-        if (isWrappable(l) && isWrappable(e[c])) applyState(e[c], wrap(l, t), n);
-        else {
-          if (l !== e[c]) u = true;
-          s?.[c] && setSignal(s[c], wrapValue(e[c], t));
-        }
-      }
-    }
-    const l = e.length;
-    syncArrayNodeMembership(t, e);
-    if (c !== l) {
-      u = true;
-      s?.length && setSignal(s.length, l);
-    }
-    u && notifySelf(t);
-    return;
-  }
-  if (s) {
-    const u = s[$TRACK];
-    const c = u ? getAllKeys(i, r, e) : nodeKeys(s);
-    for (let l = 0, a = c.length; l < a; l++) {
-      const a = c[l];
-      const f = s[a];
-      const E = unwrap(getOverrideValue(i, r, a, o));
-      let d = unwrap(e[a]);
-      if (E === d) continue;
-      if (
-        !E ||
-        !isWrappable(E) ||
-        !isWrappable(d) ||
-        Array.isArray(E) !== Array.isArray(d) ||
-        (n(E) != null && n(E) !== n(d))
-      ) {
-        u && setSignal(u, void 0);
-        f && setSignal(f, isWrappable(d) ? wrap(d, t) : d);
-      } else applyState(d, wrap(E, t), n);
-    }
-  }
-  if ((s = t[STORE_HAS])) {
-    const t = nodeKeys(s);
-    for (let n = 0, i = t.length; n < i; n++) {
-      const i = t[n];
-      setSignal(s[i], i in e);
-    }
-  }
-}
-function reconcile(e, t) {
-  return n => {
-    if (n == null) throw new Error("Cannot reconcile null or undefined state");
-    const i = typeof t === "string" ? e => e[t] : t;
-    const r = i(n);
-    if (r !== undefined && i(e) !== r)
-      throw new Error("Cannot reconcile states with different identity");
-    applyState(e, n, i);
-  };
-}
-function createProjectionInternal(e, t, n) {
-  let i;
-  const r = new WeakMap();
-  const wrapper = e => {
-    e[STORE_WRAP] = wrapProjection;
-    e[STORE_LOOKUP] = r;
-    Object.defineProperty(e, STORE_FIREWALL, {
-      get() {
-        return i;
-      },
-      configurable: true
-    });
-  };
-  const wrapProjection = e => {
-    if (r.has(e)) return r.get(e);
-    if (e[$TARGET]?.[STORE_WRAP] === wrapProjection) return e;
-    const t = createStoreProxy(e, storeTraps, wrapper);
-    r.set(e, t);
-    return t;
-  };
-  const o = wrapProjection(t);
-  i = computed(() => {
-    if (!i) i = getOwner();
-    runProjectionComputed(o, e, n?.key || "id");
-  }, undefined);
-  i.le &= ~CONFIG_AUTO_DISPOSE;
-  return { store: o, node: i };
-}
-function createProjection(e, t, n) {
-  return createProjectionInternal(e, t, n).store;
-}
-function runProjectionComputed(e, t, n, i, r) {
-  const o = getOwner();
-  let s = false;
-  let u;
-  const c = new Proxy(
-    e,
-    createWriteTraps(() => !s || o.be === u, r)
-  );
-  storeSetter(c, r => {
-    u = t(r);
-    s = true;
-    const commit = t => {
-      if (t === r || t === undefined) return;
-      const write = () => storeSetter(e, reconcile(t, n));
-      i ? i(write) : write();
-    };
-    commit(handleAsync(o, u, commit));
-  });
-  return o;
-}
-function createWriteTraps(e, t) {
-  const n = {
-    get(e, t) {
-      let i;
-      setWriteOverride(true);
-      setProjectionWriteActive(true);
-      try {
-        i = e[t];
-      } finally {
-        setWriteOverride(false);
-        setProjectionWriteActive(false);
-      }
-      if (t === $TARGET) return i;
-      return typeof i === "object" && i !== null ? new Proxy(i, n) : i;
-    },
-    has(e, t) {
-      let n;
-      setWriteOverride(true);
-      setProjectionWriteActive(true);
-      try {
-        n = t in e;
-      } finally {
-        setWriteOverride(false);
-        setProjectionWriteActive(false);
-      }
-      return n;
-    },
-    set(n, i, r) {
-      if (e && !e()) return true;
-      setWriteOverride(true);
-      setProjectionWriteActive(true);
-      try {
-        n[i] = r;
-        t?.();
-      } finally {
-        setWriteOverride(false);
-        setProjectionWriteActive(false);
-      }
-      return true;
-    },
-    deleteProperty(n, i) {
-      if (e && !e()) return true;
-      setWriteOverride(true);
-      setProjectionWriteActive(true);
-      try {
-        delete n[i];
-        t?.();
-      } finally {
-        setWriteOverride(false);
-        setProjectionWriteActive(false);
-      }
-      return true;
-    }
-  };
-  return n;
-}
-const $TRACK = Symbol(0),
-  $TARGET = Symbol(0),
-  $PROXY = Symbol(0),
-  $DELETED = Symbol(0);
-const STORE_VALUE = "v",
-  STORE_OVERRIDE = "o",
-  STORE_OPTIMISTIC_OVERRIDE = "x",
-  STORE_NODE = "n",
-  STORE_HAS = "h",
-  STORE_CUSTOM_PROTO = "c",
-  STORE_WRAP = "w",
-  STORE_LOOKUP = "l",
-  STORE_FIREWALL = "f",
-  STORE_OPTIMISTIC = "p",
-  STORE_MASKED = "m";
-const STORE_SELF_PENDING = Symbol(0);
-function createStoreProxy(e, t = storeTraps, n) {
-  let i;
-  if (Array.isArray(e)) {
-    i = [];
-    i.v = e;
-  } else {
-    i = { v: e };
-    const t = e?.[$TARGET]?.[STORE_VALUE] ?? e;
-    const n = Object.getPrototypeOf(t);
-    if (n !== null && n !== Object.prototype) {
-      i[STORE_CUSTOM_PROTO] = true;
-    }
-  }
-  n && n(i);
-  return (i[$PROXY] = new Proxy(i, t));
-}
-const storeLookup = new WeakMap();
-const symbolKeyedRecords = new WeakSet();
-function wrap(e, t) {
-  if (t?.[STORE_WRAP]) return t[STORE_WRAP](e, t);
-  let n = e[$PROXY] || storeLookup.get(e);
-  if (!n) storeLookup.set(e, (n = createStoreProxy(e)));
-  return n;
-}
-function isWrappable(e) {
-  if (e == null || typeof e !== "object" || Object.isFrozen(e)) return false;
-  return typeof Node === "undefined" || !(e instanceof Node);
-}
-let writeOverride = false;
-function setWriteOverride(e) {
-  writeOverride = e;
-}
-function writeOnly(e) {
-  return writeOverride || !!Writing?.has(e);
-}
-function unwrapStoreValue(e, t, n) {
-  const i = e?.[$TARGET] || n?.get(e)?.[$TARGET];
-  if (!i) return e;
-  const r = i[STORE_OVERRIDE];
-  if (!r) return i[STORE_VALUE];
-  if (!t) t = new Map();
-  if (t.has(e)) return t.get(e);
-  const o = i[STORE_VALUE];
-  const s = Array.isArray(o);
-  const u = s ? [] : Object.create(Object.getPrototypeOf(o));
-  t.set(e, u);
-  n = i[STORE_LOOKUP] ?? storeLookup;
-  for (const e of getKeys(o, r)) {
-    if (s && e === "length") continue;
-    const i = e in r ? r[e] : o[e];
-    if (i !== $DELETED) u[e] = unwrapStoreValue(i, t, n);
-  }
-  if (s) u.length = r.length ?? o.length;
-  return u;
-}
-function isPrototypePollutionKey$1(e) {
-  return e === "__proto__" || e === "constructor" || e === "prototype";
-}
-function ownEnumerableKeys(e) {
-  return Reflect.ownKeys(e).filter(t => Object.prototype.propertyIsEnumerable.call(e, t));
-}
-function getOverlayLayer(e, t) {
-  const n = e[STORE_OPTIMISTIC_OVERRIDE];
-  if (n && t in n) return n;
-  const i = e[STORE_OVERRIDE];
-  if (i && t in i) return i;
-  return undefined;
-}
-function visibleNodeValue(e) {
-  return e.O !== undefined && e.O !== NOT_PENDING ? e.O : e.D !== NOT_PENDING ? e.D : e.Z;
-}
-function hasOwnStoreProperty(e, t) {
-  const n = getOverlayLayer(e, t);
-  if (n) return n[t] !== $DELETED;
-  return Object.prototype.hasOwnProperty.call(unwrapStoreValue(e[STORE_VALUE]), t);
-}
-function hasInheritedAccessor(e, t) {
-  let n = Object.getPrototypeOf(e);
-  while (n && n !== Object.prototype) {
-    const e = Reflect.getOwnPropertyDescriptor(n, t);
-    if (e) return !!e.get;
-    n = Object.getPrototypeOf(n);
-  }
-  return false;
-}
-function getNodes(e, t) {
-  let n = e[t];
-  if (!n) e[t] = n = Object.create(null);
-  return n;
-}
-function getNode(e, t, n, i, r = isEqual, o, s) {
-  if (e[t]) return e[t];
-  const u = signal(
-    n,
-    {
-      equals: r,
-      unobserved() {
-        if (e[t] === u) {
-          delete e[t];
-          if (typeof t === "symbol" && t !== $TRACK && symbolKeyedRecords.has(e)) {
-            const t = Object.getOwnPropertySymbols(e);
-            let n = false;
-            for (let e = 0, i = t.length; e < i; e++) {
-              if (t[e] !== $TRACK) {
-                n = true;
-                break;
-              }
-            }
-            if (!n) symbolKeyedRecords.delete(e);
-          }
-        }
-      }
-    },
-    i
-  );
-  if (o) {
-    u.O = NOT_PENDING;
-  }
-  if (s && t in s) {
-    const e = s[t];
-    u.Ee = e === undefined ? NO_SNAPSHOT : e;
-    snapshotSources?.add(u);
-  }
-  if (typeof t === "symbol" && t !== $TRACK) symbolKeyedRecords.add(e);
-  return (e[t] = u);
-}
-function trackSelf(e, t = $TRACK) {
-  if (!getObserver()) return;
-  read(
-    getNode(getNodes(e, STORE_NODE), t, undefined, e[STORE_FIREWALL], false, e[STORE_OPTIMISTIC])
-  );
-  if (
-    t === $TRACK &&
-    !e[STORE_OVERRIDE] &&
-    !e[STORE_OPTIMISTIC_OVERRIDE] &&
-    e[STORE_VALUE][$TARGET]
-  )
-    e[STORE_VALUE][$TRACK];
-}
-function notifySelf(e) {
-  const t = e[STORE_NODE]?.[$TRACK];
-  t && setSignal(t, e[STORE_OPTIMISTIC] && !projectionWriteActive ? STORE_SELF_PENDING : undefined);
-}
-function getKeys(e, t, n = true) {
-  const i = e[$TARGET]
-    ? untrack(() => (n ? Object.keys(e) : Reflect.ownKeys(e)))
-    : n
-      ? Object.keys(e)
-      : Reflect.ownKeys(e);
-  if (!t) return i;
-  const r = new Set(i);
-  const o = Reflect.ownKeys(t);
-  for (const e of o) {
-    if (t[e] !== $DELETED) r.add(e);
-    else r.delete(e);
-  }
-  return Array.from(r);
-}
-function getPropertyDescriptor(e, t, n) {
-  if (t && n in t) {
-    if (t[n] === $DELETED) return void 0;
-    const i = Reflect.getOwnPropertyDescriptor(t, n);
-    if (i?.get || i?.set) return i;
-    const r = Reflect.getOwnPropertyDescriptor(e, n);
-    if (!r) return i;
-    if (r.get || r.set) return r;
-    r.value = t[n];
-    return r;
-  }
-  return Reflect.getOwnPropertyDescriptor(e, n);
-}
-function maskStoreTarget(e, t) {
-  const n = e[STORE_FIREWALL];
-  if (!n) return;
-  if (!!e[STORE_MASKED] === t) return;
-  e[STORE_MASKED] = t;
-  const i = (n.qe = (n.qe || 0) + (t ? 1 : -1));
-  if ((t && i === 1) || (!t && i === 0)) {
-    updatePendingSignal(n);
-    updateChildCompanions(n);
-  }
-}
-function prepareStoreWrite(e, t, n) {
-  if (e[STORE_OPTIMISTIC]) {
-    const t = e[STORE_FIREWALL];
-    if (t?.S) {
-      globalQueue.initTransition(t.S);
-    }
-  }
-  const i = e[STORE_VALUE];
-  const r = i[n];
-  if (
-    snapshotCaptureActive &&
-    typeof n !== "symbol" &&
-    !((e[STORE_FIREWALL]?.Y ?? 0) & STATUS_PENDING)
-  ) {
-    if (!e[STORE_SNAPSHOT_PROPS]) {
-      e[STORE_SNAPSHOT_PROPS] = Object.create(null);
-      snapshotSources?.add(e);
-    }
-    if (!(n in e[STORE_SNAPSHOT_PROPS])) {
-      e[STORE_SNAPSHOT_PROPS][n] = r;
-    }
-  }
-  const o = e[STORE_OPTIMISTIC] && !projectionWriteActive;
-  const s = o ? STORE_OPTIMISTIC_OVERRIDE : STORE_OVERRIDE;
-  return { base: r, overrideKey: s, state: i };
-}
-function armOptimisticStoreWrite(e, t) {
-  if (e[STORE_OPTIMISTIC] && !projectionWriteActive) {
-    trackOptimisticStore(t);
-    maskStoreTarget(e, true);
-  }
-}
-function upsertStoreNode(e, t, n, i, r) {
-  if (t[n]) return t[n];
-  const o = isWrappable(i) ? wrap(i, e) : i;
-  const s = getNode(t, n, o, e[STORE_FIREWALL], isEqual, e[STORE_OPTIMISTIC], r);
-  registerTransientStoreNode(s);
-  return s;
-}
-function notifyStoreProperty(e, t, n, i, r, o) {
-  const s = projectionWriteActive || e[STORE_OPTIMISTIC];
-  const u = n !== "delete";
-  const c = e[STORE_HAS]?.[t];
-  if (c) {
-    setSignal(c, u);
-  } else if (!s && n !== "invalidate" && o !== u) {
-    const n = upsertStoreNode(e, getNodes(e, STORE_HAS), t, o);
-    setSignal(n, u);
-  }
-  const l = getNodes(e, STORE_NODE);
-  if (n === "set") {
-    if (l[t]) {
-      setSignal(l[t], () => (isWrappable(i) ? wrap(i, e) : i));
-    } else if (!s) {
-      const n = upsertStoreNode(e, l, t, r, e[STORE_SNAPSHOT_PROPS]);
-      setSignal(n, () => (isWrappable(i) ? wrap(i, e) : i));
-    }
-  } else if (n === "invalidate") {
-    if (l[t]) {
-      setSignal(l[t], {});
-      delete l[t];
-    }
-  } else {
-    if (l[t]) {
-      setSignal(l[t], undefined);
-    } else if (!s) {
-      const n = upsertStoreNode(e, l, t, r, e[STORE_SNAPSHOT_PROPS]);
-      setSignal(n, undefined);
-    }
-  }
-  notifySelf(e);
-}
-let Writing = null;
-const storeTraps = {
-  get(e, t, n) {
-    if (t === $TARGET) return e;
-    if (t === $PROXY) return n;
-    if (t === $REFRESH) return e[STORE_FIREWALL];
-    if (t === $TRACK) {
-      trackSelf(e);
-      return n;
-    }
-    const i = getObserver() === e[STORE_FIREWALL];
-    const r = getNodes(e, STORE_NODE);
-    const o = i ? undefined : r[t];
-    const s = e[STORE_VALUE];
-    if (
-      !o &&
-      !e[STORE_OVERRIDE] &&
-      !e[STORE_OPTIMISTIC_OVERRIDE] &&
-      !e[STORE_CUSTOM_PROTO] &&
-      !e[STORE_OPTIMISTIC] &&
-      !e[STORE_SNAPSHOT_PROPS] &&
-      !s[$TARGET] &&
-      !(t in s) &&
-      getObserver() &&
-      !i &&
-      !writeOnly(n)
-    ) {
-      return read(getNode(r, t, undefined, e[STORE_FIREWALL]));
-    }
-    const u = getOverlayLayer(e, t);
-    const c = !!u;
-    const l = !!e[STORE_VALUE][$TARGET];
-    const a = u ?? e[STORE_VALUE];
-    if (!o) {
-      const i = Object.getOwnPropertyDescriptor(a, t);
-      if (i && i.get) return i.get.call(n);
-      if (!i && !c && e[STORE_CUSTOM_PROTO]) {
-        const e = unwrapStoreValue(a);
-        if (hasInheritedAccessor(e, t)) {
-          return Reflect.get(a, t, n);
-        }
-      }
-    }
-    if (writeOnly(n)) {
-      if (isPrototypePollutionKey$1(t) && !hasOwnStoreProperty(e, t)) return undefined;
-      let n = o && (c || !l) ? visibleNodeValue(o) : a[t];
-      n === $DELETED && (n = undefined);
-      if (!isWrappable(n)) return n;
-      const i = wrap(n, e);
-      Writing?.add(i);
-      return i;
-    }
-    let f = o ? (c || !l ? read(r[t]) : (read(r[t]), a[t])) : a[t];
-    f === $DELETED && (f = undefined);
-    if (!o) {
-      if (!c && typeof f === "function" && !Object.prototype.hasOwnProperty.call(a, t)) {
-        let t;
-        return !Array.isArray(e[STORE_VALUE]) &&
-          (t = Object.getPrototypeOf(e[STORE_VALUE])) &&
-          t !== Object.prototype
-          ? f.bind(a)
-          : f;
-      } else if (getObserver() && !i) {
-        return read(
-          getNode(
-            r,
-            t,
-            isWrappable(f) ? wrap(f, e) : f,
-            e[STORE_FIREWALL],
-            isEqual,
-            e[STORE_OPTIMISTIC],
-            e[STORE_SNAPSHOT_PROPS]
-          )
-        );
-      }
-    }
-    return isWrappable(f) ? wrap(f, e) : f;
-  },
-  has(e, t) {
-    if (t === $PROXY || t === $TRACK || t === "__proto__") return true;
-    const n = getOverlayLayer(e, t);
-    const i = n ? n[t] !== $DELETED : t in e[STORE_VALUE];
-    if (writeOnly(e[$PROXY]) || getObserver() === e[STORE_FIREWALL]) return i;
-    const r = getNodes(e, STORE_HAS);
-    if (r[t]) return read(r[t]);
-    if (getObserver()) {
-      return read(getNode(r, t, i, e[STORE_FIREWALL], isEqual, e[STORE_OPTIMISTIC]));
-    }
-    return i;
-  },
-  set(e, t, n) {
-    if (t === "__proto__") return true;
-    const i = e[$PROXY];
-    if (writeOnly(i)) {
-      untrack(() => {
-        const { base: r, overrideKey: o, state: s } = prepareStoreWrite(e, i, t);
-        const u = getOverlayLayer(e, t);
-        const c = u ? u[t] : r;
-        const l = u ? u[t] !== $DELETED : t in e[STORE_VALUE];
-        const a = unwrapStoreValue(n);
-        const f = typeof t === "string" ? Number(t) : -1;
-        const E =
-          Array.isArray(s) && Number.isInteger(f) && f >= 0 && f < 4294967295 && String(f) === t;
-        const d = E ? f + 1 : 0;
-        const T = E && (getOverlayLayer(e, "length") ?? s).length;
-        const S = E && d > T ? d : undefined;
-        if (c === a && S === undefined) return true;
-        armOptimisticStoreWrite(e, i);
-        if (a !== undefined && a === r && S === undefined) delete e[o]?.[t];
-        else {
-          const n = e[o] || (e[o] = Object.create(null));
-          n[t] = a;
-          if (S !== undefined) n.length = S;
-        }
-        notifyStoreProperty(e, t, "set", a, c, l);
-        if (
-          Array.isArray(s) &&
-          t === "length" &&
-          typeof a === "number" &&
-          typeof c === "number" &&
-          a < c
-        ) {
-          const t = e[o] || (e[o] = Object.create(null));
-          for (let n = a; n < c; n++) {
-            if (t[n] === $DELETED) continue;
-            const i = n in t ? t[n] : s[n];
-            if (!(n in t) && !(n in s)) continue;
-            t[n] = $DELETED;
-            notifyStoreProperty(e, n, "delete", undefined, i, true);
-          }
-        }
-        if (Array.isArray(s) && t !== "length" && S !== undefined) {
-          const t = getNodes(e, STORE_NODE);
-          if (t.length) {
-            setSignal(t.length, S);
-          } else if (!projectionWriteActive && !e[STORE_OPTIMISTIC]) {
-            const n = upsertStoreNode(e, t, "length", T, e[STORE_SNAPSHOT_PROPS]);
-            setSignal(n, S);
-          }
-        }
-        if (false);
-      });
-    }
-    return true;
-  },
-  defineProperty(e, t, n) {
-    if (t === "__proto__") return true;
-    const i = e[$PROXY];
-    if (writeOnly(i)) {
-      untrack(() => {
-        const { base: r, overrideKey: o } = prepareStoreWrite(e, i, t);
-        armOptimisticStoreWrite(e, i);
-        const s = "value" in n ? { ...n, value: unwrapStoreValue(n.value) } : n;
-        Object.defineProperty(e[o] || (e[o] = Object.create(null)), t, s);
-        notifyStoreProperty(e, t, "invalidate");
-        if (false);
-      });
-    }
-    return true;
-  },
-  deleteProperty(e, t) {
-    if (t === "__proto__") return true;
-    const n = e[STORE_OPTIMISTIC_OVERRIDE]?.[t] === $DELETED;
-    const i = e[STORE_OVERRIDE]?.[t] === $DELETED;
-    if (writeOnly(e[$PROXY]) && !n && !i) {
-      untrack(() => {
-        const n = e[STORE_OPTIMISTIC] && !projectionWriteActive;
-        const i = n ? STORE_OPTIMISTIC_OVERRIDE : STORE_OVERRIDE;
-        const r = getOverlayLayer(e, t);
-        const o = r ? r[t] : e[STORE_VALUE][t];
-        if (t in e[STORE_VALUE] || (e[STORE_OVERRIDE] && t in e[STORE_OVERRIDE])) {
-          armOptimisticStoreWrite(e, e[$PROXY]);
-          (e[i] || (e[i] = Object.create(null)))[t] = $DELETED;
-        } else if (e[i] && t in e[i]) {
-          armOptimisticStoreWrite(e, e[$PROXY]);
-          delete e[i][t];
-        } else return true;
-        notifyStoreProperty(e, t, "delete", undefined, o, true);
-      });
-    }
-    return true;
-  },
-  ownKeys(e) {
-    if (getObserver() !== e[STORE_FIREWALL]) trackSelf(e);
-    let t = getKeys(e[STORE_VALUE], e[STORE_OVERRIDE], false);
-    if (e[STORE_OPTIMISTIC_OVERRIDE]) {
-      const n = new Set(t);
-      for (const t of Reflect.ownKeys(e[STORE_OPTIMISTIC_OVERRIDE])) {
-        if (e[STORE_OPTIMISTIC_OVERRIDE][t] !== $DELETED) n.add(t);
-        else n.delete(t);
-      }
-      t = Array.from(n);
-    }
-    return t;
-  },
-  getOwnPropertyDescriptor(e, t) {
-    if (t === $PROXY) return { value: e[$PROXY], writable: true, configurable: true };
-    if (e[STORE_OPTIMISTIC_OVERRIDE] && t in e[STORE_OPTIMISTIC_OVERRIDE]) {
-      if (e[STORE_OPTIMISTIC_OVERRIDE][t] === $DELETED) return undefined;
-      const n = Reflect.getOwnPropertyDescriptor(e[STORE_OPTIMISTIC_OVERRIDE], t);
-      if (n?.get || n?.set || !(t in e[STORE_VALUE])) return n;
-      const i = getPropertyDescriptor(e[STORE_VALUE], e[STORE_OVERRIDE], t);
-      if (i) {
-        const n = Reflect.getOwnPropertyDescriptor(e, t);
-        const r = !n || n.configurable ? true : i.configurable;
-        return { ...i, configurable: r, value: e[STORE_OPTIMISTIC_OVERRIDE][t] };
-      }
-      return {
-        value: e[STORE_OPTIMISTIC_OVERRIDE][t],
-        writable: true,
-        enumerable: true,
-        configurable: true
-      };
-    }
-    const n = getPropertyDescriptor(e[STORE_VALUE], e[STORE_OVERRIDE], t);
-    if (n && !n.configurable) {
-      const i = Reflect.getOwnPropertyDescriptor(e, t);
-      if (!i || i.configurable) return { ...n, configurable: true };
-    }
-    return n;
-  },
-  getPrototypeOf(e) {
-    return Object.getPrototypeOf(e[STORE_VALUE]);
-  }
-};
-function storeSetter(e, t) {
-  const n = Writing;
-  Writing = new Set();
-  Writing.add(e);
-  try {
-    const n = t(e);
-    if (n !== e && n !== undefined) {
-      if (Array.isArray(n)) {
-        for (let t = 0, i = n.length; t < i; t++) e[t] = n[t];
-        e.length = n.length;
-      } else {
-        const t = new Set([...ownEnumerableKeys(e), ...ownEnumerableKeys(n)]);
-        t.forEach(t => {
-          if (t in n) e[t] = n[t];
-          else delete e[t];
-        });
-      }
-    }
-  } finally {
-    Writing.clear();
-    Writing = n;
-  }
-}
-function createStore(e, t, n) {
-  const i = typeof e === "function",
-    r = i ? createProjectionInternal(e, t, n).store : wrap(e);
-  return [
-    r,
-    i
-      ? e => {
-          suppressComputedRecompute(r[$REFRESH]);
-          storeSetter(r, e);
-        }
-      : e => storeSetter(r, e)
-  ];
-}
-function createOptimisticStore(e, t, n) {
-  GlobalQueue.se ||= clearOptimisticStore;
-  const i = typeof e === "function";
-  const r = i ? t : e;
-  const o = i ? e : undefined;
-  const { store: s } = createOptimisticProjectionInternal(o, r, n);
-  return [s, e => storeSetter(s, e)];
-}
-function clearOptimisticStore(e) {
-  const t = e[$TARGET];
-  if (!t) return;
-  maskStoreTarget(t, false);
-  if (!t[STORE_OPTIMISTIC_OVERRIDE]) return;
-  clearOptimisticOverride(t);
-}
-function clearOptimisticOverride(e) {
-  const t = e[STORE_OPTIMISTIC_OVERRIDE];
-  if (!t) return;
-  maskStoreTarget(e, false);
-  const n = e[STORE_NODE];
-  delete e[STORE_OPTIMISTIC_OVERRIDE];
-  const i = projectionWriteActive;
-  setProjectionWriteActive(true);
-  try {
-    if (n) {
-      for (const i of Reflect.ownKeys(t)) {
-        if (n[i]) {
-          const t = n[i];
-          t.i = undefined;
-          const r = getOverlayLayer(e, i);
-          const o = r ? r[i] : e[STORE_VALUE][i];
-          const s = o === $DELETED ? undefined : o;
-          const u = isWrappable(s) ? wrap(s, e) : s;
-          const c = visibleNodeValue(t);
-          t.O = NOT_PENDING;
-          t.D = NOT_PENDING;
-          t.Z = u;
-          if (!t.xe || !t.xe(c, u)) {
-            insertSubs(t, true);
-            schedule();
-          }
-        }
-      }
-      if (n[$TRACK]) {
-        n[$TRACK].i = undefined;
-        notifySelf(e);
-      }
-    }
-  } finally {
-    setProjectionWriteActive(i);
-  }
-}
-function createOptimisticProjectionInternal(e, t, n) {
-  let i;
-  const r = new WeakMap();
-  const wrapper = e => {
-    e[STORE_WRAP] = wrapProjection;
-    e[STORE_LOOKUP] = r;
-    e[STORE_OPTIMISTIC] = true;
-    Object.defineProperty(e, STORE_FIREWALL, {
-      get() {
-        return i;
-      },
-      configurable: true
-    });
-  };
-  const wrapProjection = e => {
-    if (r.has(e)) return r.get(e);
-    if (e[$TARGET]?.[STORE_WRAP] === wrapProjection) return e;
-    const t = createStoreProxy(e, storeTraps, wrapper);
-    r.set(e, t);
-    return t;
-  };
-  const o = wrapProjection(t);
-  if (e) {
-    const clearProjectionOverride = () => {
-      const e = o[$TARGET];
-      if (e?.[STORE_OPTIMISTIC_OVERRIDE]) clearOptimisticOverride(e);
-    };
-    const wrapCommit = e => {
-      const t = projectionWriteActive;
-      setProjectionWriteActive(true);
-      try {
-        e();
-        clearProjectionOverride();
-      } finally {
-        setProjectionWriteActive(t);
-      }
-    };
-    i = computed(() => {
-      setProjectionWriteActive(true);
-      try {
-        runProjectionComputed(o, e, n?.key || "id", wrapCommit, clearProjectionOverride);
-      } finally {
-        setProjectionWriteActive(false);
-      }
-    }, undefined);
-    i.le &= ~CONFIG_AUTO_DISPOSE;
-  }
-  return { store: o, node: i };
-}
-const DELETE = Symbol(0);
-function isPrototypePollutionKey(e) {
-  return e === "__proto__" || e === "constructor" || e === "prototype";
-}
-function updatePath(e, t, n = 0) {
-  let i,
-    r = e;
-  if (n < t.length - 1) {
-    i = t[n];
-    const o = typeof i;
-    const s = Array.isArray(e);
-    if (o === "string" && isPrototypePollutionKey(i)) return;
-    if (Array.isArray(i)) {
-      for (let r = 0; r < i.length; r++) {
-        t[n] = i[r];
-        updatePath(e, t, n);
-      }
-      t[n] = i;
-      return;
-    } else if (s && o === "function") {
-      for (let r = 0; r < e.length; r++) {
-        if (i(e[r], r)) {
-          t[n] = r;
-          updatePath(e, t, n);
-        }
-      }
-      t[n] = i;
-      return;
-    } else if (s && o === "object") {
-      const { from: r = 0, to: o = e.length - 1, by: s = 1 } = i;
-      for (let i = r; i <= o; i += s) {
-        t[n] = i;
-        updatePath(e, t, n);
-      }
-      t[n] = i;
-      return;
-    } else if (n < t.length - 2) {
-      updatePath(e[i], t, n + 1);
-      return;
-    }
-    r = e[i];
-  }
-  let o = t[t.length - 1];
-  if (typeof o === "function") {
-    o = o(r);
-    if (o === r) return;
-  }
-  if (i === undefined && o == undefined) return;
-  if (o === DELETE) {
-    delete e[i];
-  } else if (i === undefined || (isWrappable(r) && isWrappable(o) && !Array.isArray(o))) {
-    const t = i !== undefined ? e[i] : e;
-    const n = ownEnumerableKeys(o);
-    for (let e = 0; e < n.length; e++) {
-      const i = n[e];
-      if (typeof i === "string" && isPrototypePollutionKey(i)) continue;
-      const r = Object.getOwnPropertyDescriptor(o, i);
-      if (r.get || r.set) Object.defineProperty(t, i, r);
-      else t[i] = r.value;
-    }
-  } else {
-    e[i] = o;
-  }
-}
-const storePath = Object.assign(
-  function storePath(...e) {
-    return t => {
-      updatePath(t, e);
-    };
-  },
-  { DELETE: DELETE }
-);
-function mergedOverlay(e) {
-  const t = e[STORE_OVERRIDE];
-  const n = e[STORE_OPTIMISTIC_OVERRIDE];
-  return t && n ? { ...t, ...n } : (n ?? t);
-}
-function snapshotImpl(e, t, n, i) {
-  let r, o, s, u, c, l;
-  if (!isWrappable(e)) return e;
-  if (n && n.has(e)) return n.get(e);
-  if (!n) n = new Map();
-  if ((r = e[$TARGET] || i?.get(e)?.[$TARGET])) {
-    if (t) trackSelf(r, $TRACK);
-    s = mergedOverlay(r);
-    o = Array.isArray(r[STORE_VALUE]);
-    n.set(
-      e,
-      s ? (u = o ? [] : Object.create(Object.getPrototypeOf(r[STORE_VALUE]))) : r[STORE_VALUE]
-    );
-    e = r[STORE_VALUE];
-    i = r[STORE_LOOKUP] ?? storeLookup;
-  } else {
-    o = Array.isArray(e);
-    n.set(e, e);
-  }
-  if (o) {
-    const o = s?.length ?? e.length;
-    for (let a = 0; a < o; a++) {
-      l = s && a in s ? s[a] : e[a];
-      if (l === $DELETED) continue;
-      if (t && isWrappable(l)) wrap(l, r);
-      if ((c = snapshotImpl(l, t, n, i)) !== l || u) {
-        if (!u) n.set(e, (u = [...e]));
-        u[a] = c;
-      }
-    }
-    if (u) u.length = o;
-  } else if (!s) {
-    const o = getKeys(e, undefined);
-    for (let s = 0, a = o.length; s < a; s++) {
-      const a = o[s];
-      const f = Object.getOwnPropertyDescriptor(e, a);
-      if (f.get) continue;
-      l = f.value;
-      if (t && isWrappable(l)) wrap(l, r);
-      if ((c = snapshotImpl(l, t, n, i)) !== l || u) {
-        if (!u) {
-          u = Object.create(Object.getPrototypeOf(e));
-          Object.assign(u, e);
-        }
-        u[a] = c;
-      }
-    }
-  } else {
-    const o = getKeys(e, s);
-    for (let a = 0, f = o.length; a < f; a++) {
-      let f = o[a];
-      const E = getPropertyDescriptor(e, s, f);
-      if (E.get) continue;
-      l = f in s ? s[f] : e[f];
-      if (t && isWrappable(l)) wrap(l, r);
-      if ((c = snapshotImpl(l, t, n, i)) !== e[f] || u) {
-        if (!u) {
-          u = Object.create(Object.getPrototypeOf(e));
-          Object.assign(u, e);
-        }
-        u[f] = c;
-      }
-    }
-  }
-  return u || e;
-}
-function snapshot(e, t, n) {
-  return snapshotImpl(e, false, t, n);
-}
-function deep(e) {
-  return snapshotImpl(e, true);
-}
-function trueFn() {
-  return true;
-}
-const propTraps = {
-  get(e, t, n) {
-    if (t === $PROXY) return n;
-    return e.get(t);
-  },
-  has(e, t) {
-    if (t === $PROXY) return true;
-    return e.has(t);
-  },
-  set: trueFn,
-  deleteProperty: trueFn,
-  getOwnPropertyDescriptor(e, t) {
-    return {
-      configurable: true,
-      enumerable: true,
-      get() {
-        return e.get(t);
-      },
-      set: trueFn,
-      deleteProperty: trueFn
-    };
-  },
-  ownKeys(e) {
-    return e.keys();
-  }
-};
-function resolveSource(e) {
-  return !(e = typeof e === "function" ? e() : e) ? {} : e;
-}
-const $SOURCES = Symbol(0);
-function merge(...e) {
-  if (e.length === 1 && typeof e[0] !== "function") return e[0];
-  let t = false;
-  const n = [];
-  for (let i = 0; i < e.length; i++) {
-    const r = e[i];
-    t = t || (!!r && $PROXY in r);
-    const o = !!r && r[$SOURCES];
-    if (o) {
-      for (let e = 0; e < o.length; e++) n.push(o[e]);
-    } else n.push(typeof r === "function" ? ((t = true), createMemo(r)) : r);
-  }
-  if (SUPPORTS_PROXY && t) {
-    return new Proxy(
-      {
-        get(e) {
-          if (e === $SOURCES) return n;
-          for (let t = n.length - 1; t >= 0; t--) {
-            const i = resolveSource(n[t]);
-            if (e in i) return i[e];
-          }
-        },
-        has(e) {
-          for (let t = n.length - 1; t >= 0; t--) {
-            if (e in resolveSource(n[t])) return true;
-          }
-          return false;
-        },
-        keys() {
-          const e = new Set();
-          for (let t = 0; t < n.length; t++) {
-            const i = ownEnumerableKeys(resolveSource(n[t]));
-            for (let t = 0; t < i.length; t++) e.add(i[t]);
-          }
-          return [...e];
-        }
-      },
-      propTraps
-    );
-  }
-  const i = Object.create(null);
-  let r = false;
-  let o = n.length - 1;
-  for (let e = o; e >= 0; e--) {
-    const t = n[e];
-    if (!t) {
-      e === o && o--;
-      continue;
-    }
-    const s = Object.getOwnPropertyNames(t);
-    for (let n = s.length - 1; n >= 0; n--) {
-      const u = s[n];
-      if (u === "__proto__" || u === "constructor") continue;
-      if (!i[u]) {
-        r = r || e !== o;
-        const n = Object.getOwnPropertyDescriptor(t, u);
-        i[u] = n.get ? { enumerable: true, configurable: true, get: n.get.bind(t) } : n;
-      }
-    }
-  }
-  if (!r) return n[o];
-  const s = {};
-  const u = Object.keys(i);
-  for (let e = u.length - 1; e >= 0; e--) {
-    const t = u[e],
-      n = i[t];
-    if (n.get) Object.defineProperty(s, t, n);
-    else s[t] = n.value;
-  }
-  s[$SOURCES] = n;
-  return s;
-}
-function omit(e, ...t) {
-  if (SUPPORTS_PROXY && $PROXY in e) {
-    return new Proxy(
-      {
-        get(n) {
-          return t.includes(n) ? undefined : e[n];
-        },
-        has(n) {
-          return !t.includes(n) && n in e;
-        },
-        keys() {
-          return ownEnumerableKeys(e).filter(e => !t.includes(e));
-        }
-      },
-      propTraps
-    );
-  }
-  const n = {};
-  const i = Object.getOwnPropertyNames(e);
-  const r = t.length > 4 && i.length > t.length ? new Set(t) : undefined;
-  for (const o of i) {
-    if (r ? !r.has(o) : !t.includes(o)) {
-      const t = Object.getOwnPropertyDescriptor(e, o);
-      !t.get && !t.set && t.enumerable && t.writable && t.configurable
-        ? (n[o] = t.value)
-        : Object.defineProperty(n, o, t);
-    }
-  }
-  return n;
-}
-function mapArray(e, t, n) {
-  const i = typeof n?.keyed === "function" ? n.keyed : undefined;
-  const r = t.length > 1;
-  const o = t;
-  const s = {
-    ze: createOwner(),
-    Xe: 0,
-    Je: e,
-    et: [],
-    tt: o,
-    nt: [],
-    it: [],
-    rt: i,
-    ot: i || n?.keyed === false ? [] : undefined,
-    st: r && n?.keyed !== false ? [] : undefined,
-    ut: n?.keyed === false,
-    ct: n?.fallback
-  };
-  const u = computed(updateKeyedMap.bind(s));
-  s.ze.Ae = u;
-  u.le &= ~CONFIG_AUTO_DISPOSE;
-  return accessor(u);
-}
-const pureOptions = { ownedWrite: true };
-function updateKeyedMap() {
-  const e = this.Je() || [],
-    t = e.length;
-  e[$TRACK];
-  runWithOwner(this.ze, () => {
-    let n,
-      i,
-      r = this.ot
-        ? this.ut
-          ? () => {
-              this.ot[i] = signal(e[i], pureOptions);
-              return this.tt(accessor(this.ot[i]), i);
-            }
-          : () => {
-              this.ot[i] = signal(e[i], pureOptions);
-              this.st && (this.st[i] = signal(i, pureOptions));
-              return this.tt(accessor(this.ot[i]), this.st ? accessor(this.st[i]) : undefined);
-            }
-        : this.st
-          ? () => {
-              const t = e[i];
-              this.st[i] = signal(i, pureOptions);
-              return this.tt(t, accessor(this.st[i]));
-            }
-          : () => {
-              const t = e[i];
-              return this.tt(t);
-            };
-    if (t === 0) {
-      if (this.Xe !== 0) {
-        this.ze.dispose(false);
-        this.it = [];
-        this.et = [];
-        this.nt = [];
-        this.Xe = 0;
-        this.ot && (this.ot = []);
-        this.st && (this.st = []);
-      }
-      if (this.ct && !this.nt[0]) {
-        this.nt[0] = runWithOwner((this.it[0] = createOwner()), this.ct);
-      }
-    } else if (this.Xe === 0) {
-      if (this.it[0]) this.it[0].dispose();
-      this.nt = new Array(t);
-      for (i = 0; i < t; i++) {
-        this.et[i] = e[i];
-        this.nt[i] = runWithOwner((this.it[i] = createOwner()), r);
-      }
-      this.Xe = t;
-    } else {
-      let o,
-        s,
-        u,
-        c,
-        l,
-        a,
-        f,
-        E = new Array(t),
-        d = new Array(t),
-        T = this.ot ? new Array(t) : undefined,
-        S = this.st ? new Array(t) : undefined;
-      for (
-        o = 0, s = Math.min(this.Xe, t);
-        o < s && (this.et[o] === e[o] || (this.ot && compare(this.rt, this.et[o], e[o])));
-        o++
-      ) {
-        if (this.ot) setSignal(this.ot[o], e[o]);
-      }
-      for (
-        s = this.Xe - 1, u = t - 1;
-        s >= o &&
-        u >= o &&
-        (this.et[s] === e[u] || (this.ot && compare(this.rt, this.et[s], e[u])));
-        s--, u--
-      ) {
-        E[u] = this.nt[s];
-        d[u] = this.it[s];
-        T && (T[u] = this.ot[s]);
-        S && (S[u] = this.st[s]);
-      }
-      a = new Map();
-      f = new Array(u + 1);
-      for (i = u; i >= o; i--) {
-        c = e[i];
-        l = this.rt ? this.rt(c) : c;
-        n = a.get(l);
-        f[i] = n === undefined ? -1 : n;
-        a.set(l, i);
-      }
-      for (n = o; n <= s; n++) {
-        c = this.et[n];
-        l = this.rt ? this.rt(c) : c;
-        i = a.get(l);
-        if (i !== undefined && i !== -1) {
-          E[i] = this.nt[n];
-          d[i] = this.it[n];
-          T && (T[i] = this.ot[n]);
-          S && (S[i] = this.st[n]);
-          i = f[i];
-          a.set(l, i);
-        } else this.it[n].dispose();
-      }
-      for (i = o; i < t; i++) {
-        if (i in E) {
-          this.nt[i] = E[i];
-          this.it[i] = d[i];
-          if (T) {
-            this.ot[i] = T[i];
-            setSignal(this.ot[i], e[i]);
-          }
-          if (S) {
-            this.st[i] = S[i];
-            setSignal(this.st[i], i);
-          }
-        } else {
-          this.nt[i] = runWithOwner((this.it[i] = createOwner()), r);
-        }
-      }
-      this.nt = this.nt.slice(0, (this.Xe = t));
-      this.et = e.slice(0);
-    }
-  });
-  return this.nt;
-}
-function repeat(e, t, n) {
-  const i = t;
-  const r = computed(
-    updateRepeat.bind({
-      ze: createOwner(),
-      Xe: 0,
-      lt: 0,
-      ft: e,
-      tt: i,
-      it: [],
-      nt: [],
-      Et: n?.from,
-      ct: n?.fallback
-    })
-  );
-  r.le &= ~CONFIG_AUTO_DISPOSE;
-  return accessor(r);
-}
-function updateRepeat() {
-  const e = this.ft();
-  const t = this.Et?.() || 0;
-  runWithOwner(this.ze, () => {
-    if (e === 0) {
-      if (this.Xe !== 0) {
-        this.ze.dispose(false);
-        this.it = [];
-        this.nt = [];
-        this.Xe = 0;
-        this.lt = 0;
-      }
-      if (this.ct && !this.nt[0]) {
-        this.nt[0] = runWithOwner((this.it[0] = createOwner()), this.ct);
-      }
-      return;
-    }
-    const n = t + e;
-    const i = this.lt + this.Xe;
-    if (this.Xe === 0 && this.it[0]) this.it[0].dispose();
-    if (t >= i || n <= this.lt) {
-      for (let e = 0; e < this.Xe; e++) this.it[e].dispose();
-      this.it = new Array(e);
-      this.nt = new Array(e);
-      for (let n = 0; n < e; n++)
-        this.nt[n] = runWithOwner((this.it[n] = createOwner()), () => this.tt(t + n));
-      this.lt = t;
-      this.Xe = e;
-      return;
-    }
-    for (let e = n; e < i; e++) this.it[e - this.lt].dispose();
-    if (this.lt < t) {
-      const e = t - this.lt;
-      for (let t = 0; t < e && t < this.Xe; t++) this.it[t].dispose();
-      this.it.splice(0, e);
-      this.nt.splice(0, e);
-    } else if (this.lt > t) {
-      let n = i - this.lt - 1;
-      let r = this.lt - t;
-      this.it.length = this.nt.length = e;
-      while (n >= r) {
-        this.it[n] = this.it[n - r];
-        this.nt[n] = this.nt[n - r];
-        n--;
-      }
-      for (let e = 0; e < r; e++) {
-        this.nt[e] = runWithOwner((this.it[e] = createOwner()), () => this.tt(e + t));
-      }
-    }
-    for (let e = i; e < n; e++) {
-      this.nt[e - t] = runWithOwner((this.it[e - t] = createOwner()), () => this.tt(e));
-    }
-    this.nt = this.nt.slice(0, e);
-    this.lt = t;
-    this.Xe = e;
-  });
-  return this.nt;
-}
-function compare(e, t, n) {
-  return e ? e(t) === e(n) : true;
-}
-function boundaryComputed(e, t) {
-  const n = computed(e, { lazy: true });
-  n.Qe = (e, t) => {
-    const i = e !== undefined ? e : n.Y;
-    const r = t !== undefined ? t : n.ae;
-    n.Y &= ~n.dt;
-    n.F.notify(n, STATUS_PENDING | STATUS_ERROR, i, r);
-    const o = i & ~n.dt & (STATUS_PENDING | STATUS_ERROR);
-    if (o) {
-      n.Y &= ~o;
-      if (n.ae === r && !(n.Y & (STATUS_PENDING | STATUS_ERROR))) n.ae = undefined;
-    }
-  };
-  n.dt = t;
-  n.le &= ~CONFIG_AUTO_DISPOSE;
-  recompute(n, true);
-  return n;
-}
-function createBoundChildren(e, t, n, i) {
-  const r = e.F;
-  r.addChild((e.F = n));
-  cleanup(() => r.removeChild(e.F));
-  return runWithOwner(e, () => {
-    const e = computed(t);
-    return boundaryComputed(() => flatten(read(e)), i);
-  });
-}
-const ON_INIT = Symbol();
-const RevealControllerContext = createContext(null);
-let _revealUsed = false;
-const FALSE_ACCESSOR = () => false;
-const SEQUENTIAL_ACCESSOR = () => "sequential";
-function isRevealController(e) {
-  return e instanceof RevealController;
-}
-function isSlotReady(e) {
-  return isRevealController(e) ? e.isReady() : e.Tt.size === 0 && !e.St;
-}
-function isSlotMinimallyReady(e) {
-  return isRevealController(e) ? e.isMinimallyReady() : isSlotReady(e);
-}
-function setSlotState(e, t, n, i) {
-  setSignal(e._t, n);
-  setSignal(e.Ot, i);
-  if (isRevealController(e)) {
-    if (!n && e.Rt === t) e.Rt = undefined;
-    return e.evaluate(n, i);
-  }
-  if (!n && e.It === t && e.ht) e.It = undefined;
-}
-class RevealController {
-  At;
-  Nt;
-  Ct = [];
-  Rt;
-  _t = signal(false, { ownedWrite: true, Ke: true });
-  Ot = signal(false, { ownedWrite: true, Ke: true });
-  yt = true;
-  Pt = true;
-  gt = false;
-  constructor(e, t) {
-    this.At = e;
-    this.Nt = t;
-  }
-  Dt(e) {
-    for (let t = 0; t < this.Ct.length; t++) {
-      const n = this.Ct[t];
-      if ((isRevealController(n) ? n.Rt : n.It) !== this) continue;
-      if (e(n) === false) return false;
-    }
-    return true;
-  }
-  isReady() {
-    return this.Dt(isSlotReady);
-  }
-  isMinimallyReady() {
-    const e = untrack(this.At);
-    if (e === "together") return this.isReady();
-    if (e === "natural") {
-      let e = false;
-      let t = false;
-      this.Dt(n => {
-        e = true;
-        if (isSlotMinimallyReady(n)) {
-          t = true;
-          return false;
-        }
-      });
-      return !e || t;
-    }
-    let t = true;
-    this.Dt(e => {
-      t = isSlotMinimallyReady(e);
-      return false;
-    });
-    return t;
-  }
-  register(e) {
-    if (this.Ct.includes(e)) return;
-    this.Ct.push(e);
-    const t = untrack(this.At);
-    (setSignal(e._t, true), setSignal(e.Ot, t === "sequential" ? !!untrack(this.Nt) : false));
-    untrack(() => this.evaluate());
-  }
-  unregister(e) {
-    const t = this.Ct.indexOf(e);
-    if (t >= 0) this.Ct.splice(t, 1);
-    untrack(() => this.evaluate());
-  }
-  evaluate(e, t) {
-    if (this.gt) return;
-    this.gt = true;
-    const n = this.yt;
-    const i = this.Pt;
-    try {
-      const n = e ?? read(this._t),
-        i = untrack(this.At),
-        r = i === "sequential" && !!untrack(this.Nt),
-        o = t ?? r;
-      if (n) {
-        this.Dt(e => setSlotState(e, this, true, o));
-      } else if (i === "natural") {
-        this.Dt(e => {
-          if (isRevealController(e)) {
-            setSignal(e.Ot, false);
-            setSignal(e._t, false);
-            e.evaluate(false, false);
-          } else {
-            setSlotState(e, this, !isSlotReady(e), false);
-          }
-        });
-      } else if (i === "together") {
-        const e = this.Dt(isSlotMinimallyReady);
-        this.Dt(t => setSlotState(t, this, !e, false));
-      } else {
-        let e = false;
-        this.Dt(t => {
-          if (e) return setSlotState(t, this, true, r);
-          if (isSlotReady(t)) return setSlotState(t, this, false, false);
-          e = true;
-          if (isRevealController(t)) {
-            setSignal(t.Ot, false);
-            setSignal(t._t, false);
-            t.evaluate(false, false);
-          } else {
-            setSlotState(t, this, true, false);
-          }
-        });
-      }
-    } finally {
-      this.yt = this.isReady();
-      this.Pt = this.isMinimallyReady();
-      this.gt = false;
-    }
-    if (this.Rt && (n !== this.yt || i !== this.Pt)) this.Rt.evaluate();
-  }
-}
-class CollectionQueue extends Queue {
-  bt;
-  Tt = new Set();
-  vt;
-  St = true;
-  _t = signal(false, { ownedWrite: true, Ke: true });
-  ae;
-  Ot = signal(false, { ownedWrite: true, Ke: true });
-  It;
-  ht = false;
-  wt;
-  Lt = ON_INIT;
-  constructor(e) {
-    super();
-    this.bt = e;
-  }
-  run(e) {
-    if (!e || (read(this._t) && (!_revealUsed || read(this.Ot)))) return;
-    return super.run(e);
-  }
-  notify(e, t, n, i) {
-    if (!(t & this.bt)) return super.notify(e, t, n, i);
-    if (this.ht && this.wt) {
-      const e = untrack(() => {
-        try {
-          return this.wt();
-        } catch {
-          return ON_INIT;
-        }
-      });
-      if (e !== this.Lt) {
-        this.Lt = e;
-        this.ht = false;
-        this.Tt.clear();
-      }
-    }
-    if (this.bt & STATUS_PENDING && this.ht) return super.notify(e, t, n, i);
-    if (n & this.bt) {
-      this.St = true;
-      const t = i?.source || e.ae?.source;
-      if (t) {
-        const e = this.Tt.size === 0;
-        this.Tt.add(t);
-        if (e) setSignal(this._t, true);
-        if (this.bt & STATUS_ERROR) {
-          setSignal(this.ae, unwrapStatusError(t.ae));
-        }
-      }
-    }
-    t &= ~this.bt;
-    return t ? super.notify(e, t, n, i) : true;
-  }
-  checkSources() {
-    for (const e of this.Tt) {
-      if (
-        e.W & REACTIVE_DISPOSED ||
-        (!(e.Y & this.bt) && !(this.bt & STATUS_ERROR && e.Y & STATUS_PENDING))
-      )
-        this.Tt.delete(e);
-    }
-    if (!this.Tt.size) {
-      if (this.bt & STATUS_PENDING && this.St && !this.ht && this.vt) {
-        this.St = !!(this.vt.Y & this.bt);
-      } else {
-        this.St = false;
-      }
-      if (!this.St) {
-        setSignal(this._t, false);
-        if (this.wt) {
-          try {
-            this.Lt = untrack(() => this.wt());
-          } catch {}
-        }
-      }
-    }
-    if (_revealUsed) this.It?.evaluate();
-  }
-}
-function createCollectionBoundary(e, t, n, i) {
-  const r = createOwner();
-  if (_revealUsed) setContext(RevealControllerContext, null, r);
-  const o = new CollectionQueue(e);
-  if (e === STATUS_ERROR) o.ae = signal(undefined, { ownedWrite: true, Ke: true });
-  if (i) o.wt = i;
-  const s = (o.vt = createBoundChildren(r, t, o, e));
-  untrack(() => {
-    let t = false;
-    try {
-      read(s);
-    } catch (e) {
-      if (e instanceof NotReadyError) t = true;
-      else throw e;
-    }
-    o.St = t || !!(s.Y & e) || s.ae instanceof NotReadyError;
-  });
-  const u = _revealUsed && e === STATUS_PENDING ? getContext(RevealControllerContext) : null;
-  if (u) {
-    o.It = u;
-    u.register(o);
-    cleanup(() => u.unregister(o));
-  }
-  return accessor(
-    computed(
-      () => {
-        if (!read(o._t)) {
-          const e = read(s);
-          if (!untrack(() => read(o._t))) return ((o.ht = true), e);
-        }
-        if (_revealUsed && read(o.Ot)) return undefined;
-        return n(o);
-      },
-      { Ke: true }
-    )
-  );
-}
-function createLoadingBoundary(e, t, n) {
-  return createCollectionBoundary(STATUS_PENDING, e, () => t(), n?.on);
-}
-function createErrorBoundary(e, t) {
-  return createCollectionBoundary(STATUS_ERROR, e, e =>
-    t(accessor(e.ae), () => {
-      for (const t of e.Tt) recompute(t);
-      schedule();
-    })
-  );
-}
-function createRevealOrder(e, t) {
-  _revealUsed = true;
-  const n = createOwner();
-  const i = getContext(RevealControllerContext);
-  const r = t?.order || SEQUENTIAL_ACCESSOR,
-    o = t?.collapsed || FALSE_ACCESSOR;
-  const s = new RevealController(r, o);
-  setContext(RevealControllerContext, s, n);
-  return runWithOwner(n, () => {
-    const t = e();
-    computed(() => {
-      r();
-      o();
-      s.evaluate();
-    });
-    if (i) {
-      s.Rt = i;
-      i.register(s);
-      cleanup(() => i.unregister(s));
-    }
-    return t;
-  });
-}
-function flatten(e, t) {
-  if (typeof e === "function" && !e.length) {
-    if (t?.doNotUnwrap) return e;
-    do {
-      e = e();
-    } while (typeof e === "function" && !e.length);
-  }
-  if (t?.skipNonRendered && (e == null || e === true || e === false || e === "")) return;
-  if (Array.isArray(e)) {
-    let n = [];
-    if (flattenArray(e, n, t)) {
-      return () => {
-        let e = [];
-        flattenArray(n, e, { ...t, doNotUnwrap: false });
-        return e;
-      };
-    }
-    return n;
-  }
-  return e;
-}
-function flattenArray(e, t = [], n) {
-  let i = null;
-  let r = false;
-  for (let o = 0; o < e.length; o++) {
-    try {
-      let i = e[o];
-      if (typeof i === "function" && !i.length) {
-        if (n?.doNotUnwrap) {
-          t.push(i);
-          r = true;
-          continue;
-        }
-        do {
-          i = i();
-        } while (typeof i === "function" && !i.length);
-      }
-      if (Array.isArray(i)) {
-        r = flattenArray(i, t, n);
-      } else if (n?.skipNonRendered && (i == null || i === true || i === false || i === "")) {
-      } else t.push(i);
-    } catch (e) {
-      if (!(e instanceof NotReadyError)) throw e;
-      i = e;
-    }
-  }
-  if (i) throw i;
-  return r;
-}
-const DEV = undefined;
-export {
-  $PROXY,
-  $REFRESH,
-  $TARGET,
-  $TRACK,
-  ContextNotFoundError,
-  DEV,
-  NoOwnerError,
-  NotReadyError,
-  SUPPORTS_PROXY,
-  action,
-  clearSnapshots,
-  createContext,
-  createEffect,
-  createErrorBoundary,
-  createLoadingBoundary,
-  createMemo,
-  createOptimistic,
-  createOptimisticStore,
-  createOwner,
-  createProjection,
-  createReaction,
-  createRenderEffect,
-  createRevealOrder,
-  createRoot,
-  createSignal,
-  createStore,
-  createTrackedEffect,
-  deep,
-  enableExternalSource,
-  enforceLoadingBoundary,
-  flatten,
-  flush,
-  getContext,
-  getNextChildId,
-  getObserver,
-  getOwner,
-  isDisposed,
-  isEqual,
-  isPending,
-  isWrappable,
-  latest,
-  mapArray,
-  markSnapshotScope,
-  merge,
-  omit,
-  onCleanup,
-  onSettled,
-  peekNextChildId,
-  reconcile,
-  refresh,
-  releaseSnapshotScope,
-  repeat,
-  resetErrorHalt,
-  resolve,
-  runWithOwner,
-  setContext,
-  setSnapshotCapture,
-  snapshot,
-  storePath,
-  untrack
-};