@solidjs/signals 0.9.11 → 0.10.1

package/dist/node.cjs

@@ -1,16 +1,16 @@
 "use strict";
 class NotReadyError extends Error {
-  t;
+  source;
   constructor(e) {
     super();
-    this.t = e;
+    this.source = e;
   }
 }
 class StatusError extends Error {
-  t;
+  source;
   constructor(e, t) {
     super(t instanceof Error ? t.message : String(t), { cause: t });
-    this.t = e;
+    this.source = e;
   }
 }
 class NoOwnerError extends Error {
@@ -43,182 +43,114 @@ const g = typeof Proxy === "function";
 const w = {};
 const S = Symbol("refresh");
 function actualInsertIntoHeap(e, t) {
-  const n = (e.o?.i ? e.o.l?.u : e.o?.u) ?? -1;
-  if (n >= e.u) e.u = n + 1;
-  const r = e.u;
-  const i = t.p[r];
-  if (i === undefined) t.p[r] = e;
+  const n = (e.i?.t ? e.i.u?.o : e.i?.o) ?? -1;
+  if (n >= e.o) e.o = n + 1;
+  const r = e.o;
+  const i = t.l[r];
+  if (i === undefined) t.l[r] = e;
   else {
-    const t = i.h;
-    t.S = e;
-    e.h = t;
-    i.h = e;
+    const t = i.p;
+    t.h = e;
+    e.p = t;
+    i.p = e;
   }
-  if (r > t.m) t.m = r;
+  if (r > t.S) t.S = r;
 }
 function insertIntoHeap(e, o) {
-  let u = e._;
+  let u = e.m;
   if (u & (i | r)) return;
   if (u & t) {
-    e._ = (u & -4) | n | i;
-  } else e._ = u | i;
+    e.m = (u & -4) | n | i;
+  } else e.m = u | i;
   if (!(u & s)) actualInsertIntoHeap(e, o);
 }
 function insertIntoHeapHeight(e, t) {
-  let n = e._;
+  let n = e.m;
   if (n & (i | r | s)) return;
-  e._ = n | s;
+  e.m = n | s;
   actualInsertIntoHeap(e, t);
 }
 function deleteFromHeap(e, t) {
-  const n = e._;
+  const n = e.m;
   if (!(n & (i | s))) return;
-  e._ = n & -25;
-  const r = e.u;
-  if (e.h === e) t.p[r] = undefined;
+  e.m = n & -25;
+  const r = e.o;
+  if (e.p === e) t.l[r] = undefined;
   else {
-    const n = e.S;
-    const i = t.p[r];
+    const n = e.h;
+    const i = t.l[r];
     const s = n ?? i;
-    if (e === i) t.p[r] = n;
-    else e.h.S = n;
-    s.h = e.h;
+    if (e === i) t.l[r] = n;
+    else e.p.h = n;
+    s.p = e.p;
   }
-  e.h = e;
-  e.S = undefined;
+  e.p = e;
+  e.h = undefined;
 }
 function markHeap(e) {
-  if (e.O) return;
-  e.O = true;
-  for (let t = 0; t <= e.m; t++) {
-    for (let n = e.p[t]; n !== undefined; n = n.S) {
-      if (n._ & i) markNode(n);
+  if (e._) return;
+  e._ = true;
+  for (let t = 0; t <= e.S; t++) {
+    for (let n = e.l[t]; n !== undefined; n = n.h) {
+      if (n.m & i) markNode(n);
     }
   }
 }
 function markNode(e, r = n) {
-  const i = e._;
+  const i = e.m;
   if ((i & (t | n)) >= r) return;
-  e._ = (i & -4) | r;
-  for (let n = e.P; n !== null; n = n.C) {
-    markNode(n.k, t);
+  e.m = (i & -4) | r;
+  for (let n = e.O; n !== null; n = n.P) {
+    markNode(n.A, t);
   }
-  if (e.A !== null) {
-    for (let n = e.A; n !== null; n = n.W) {
-      for (let e = n.P; e !== null; e = e.C) {
-        markNode(e.k, t);
+  if (e.k !== null) {
+    for (let n = e.k; n !== null; n = n.C) {
+      for (let e = n.O; e !== null; e = e.P) {
+        markNode(e.A, t);
       }
     }
   }
 }
 function runHeap(e, t) {
-  e.O = false;
-  for (e.j = 0; e.j <= e.m; e.j++) {
-    let n = e.p[e.j];
+  e._ = false;
+  for (e.W = 0; e.W <= e.S; e.W++) {
+    let n = e.l[e.W];
     while (n !== undefined) {
-      if (n._ & i) t(n);
+      if (n.m & i) t(n);
       else adjustHeight(n, e);
-      n = e.p[e.j];
+      n = e.l[e.W];
     }
   }
-  e.m = 0;
+  e.S = 0;
 }
 function adjustHeight(e, t) {
   deleteFromHeap(e, t);
-  let n = e.u;
-  for (let t = e.N; t; t = t.L) {
-    const e = t.I;
-    const r = e.H || e;
-    if (r.R && r.u >= n) n = r.u + 1;
+  let n = e.o;
+  for (let t = e.j; t; t = t.N) {
+    const e = t.L;
+    const r = e.I || e;
+    if (r.H && r.o >= n) n = r.o + 1;
   }
-  if (e.u !== n) {
-    e.u = n;
-    for (let n = e.P; n !== null; n = n.C) {
-      insertIntoHeapHeight(n.k, t);
+  if (e.o !== n) {
+    e.o = n;
+    for (let n = e.O; n !== null; n = n.P) {
+      insertIntoHeapHeight(n.A, t);
     }
   }
 }
 const m = new Set();
-const _ = { p: new Array(2e3).fill(undefined), O: false, j: 0, m: 0 };
-const b = { p: new Array(2e3).fill(undefined), O: false, j: 0, m: 0 };
+const b = { l: new Array(2e3).fill(undefined), _: false, W: 0, S: 0 };
+const _ = { l: new Array(2e3).fill(undefined), _: false, W: 0, S: 0 };
 let O = 0;
 let x = null;
 let v = false;
 let P = false;
-const C = new WeakMap();
-const k = new Set();
-let A = null;
-function setCurrentOptimisticLane(e) {
-  A = e;
-}
-function getOrCreateLane(e) {
-  let t = C.get(e);
-  if (t) {
-    return findLane(t);
-  }
-  const n = e.T;
-  const r = n?.M ? findLane(n.M) : null;
-  t = { t: e, q: new Set(), F: [[], []], V: null, B: x, D: r };
-  C.set(e, t);
-  k.add(t);
-  e.G = e.K || 0;
-  return t;
-}
-function findLane(e) {
-  while (e.V) e = e.V;
-  return e;
-}
-function mergeLanes(e, t) {
-  e = findLane(e);
-  t = findLane(t);
-  if (e === t) return e;
-  t.V = e;
-  for (const n of t.q) e.q.add(n);
-  e.F[0].push(...t.F[0]);
-  e.F[1].push(...t.F[1]);
-  return e;
-}
-function clearLaneEntry(e) {
-  C.delete(e);
-}
-function resolveLane(e) {
-  const t = e.M;
-  if (!t) return undefined;
-  const n = findLane(t);
-  if (k.has(n)) return n;
-  e.M = undefined;
-  return undefined;
-}
-function hasActiveOverride(e) {
-  return !!(e.U && e.J !== y);
-}
-function assignOrMergeLane(e, t) {
-  const n = findLane(t);
-  const r = e.M;
-  if (r) {
-    if (r.V) {
-      e.M = t;
-      return;
-    }
-    const i = findLane(r);
-    if (k.has(i)) {
-      if (i !== n && !hasActiveOverride(e)) {
-        if (n.D && findLane(n.D) === i) {
-          e.M = t;
-        } else if (i.D && findLane(i.D) === n);
-        else mergeLanes(n, i);
-      }
-      return;
-    }
-  }
-  e.M = t;
-}
 function runLaneEffects(e) {
-  for (const t of k) {
-    if (t.V || t.q.size > 0) continue;
-    const n = t.F[e - 1];
+  for (const t of C) {
+    if (t.R || t.T.size > 0) continue;
+    const n = t.M[e - 1];
     if (n.length) {
-      t.F[e - 1] = [];
+      t.M[e - 1] = [];
       runQueue(n, e);
     }
   }
@@ -229,129 +161,129 @@ function setProjectionWriteActive(e) {
 function schedule() {
   if (v) return;
   v = true;
-  if (!E.X) queueMicrotask(flush);
+  if (!A.q) queueMicrotask(flush);
 }
 class Queue {
-  o = null;
-  Y = [[], []];
-  Z = [];
+  i = null;
+  F = [[], []];
+  V = [];
   created = O;
   addChild(e) {
-    this.Z.push(e);
-    e.o = this;
+    this.V.push(e);
+    e.i = this;
   }
   removeChild(e) {
-    const t = this.Z.indexOf(e);
+    const t = this.V.indexOf(e);
     if (t >= 0) {
-      this.Z.splice(t, 1);
-      e.o = null;
+      this.V.splice(t, 1);
+      e.i = null;
     }
   }
   notify(e, t, n, r) {
-    if (this.o) return this.o.notify(e, t, n, r);
+    if (this.i) return this.i.notify(e, t, n, r);
     return false;
   }
   run(e) {
-    if (this.Y[e - 1].length) {
-      const t = this.Y[e - 1];
-      this.Y[e - 1] = [];
+    if (this.F[e - 1].length) {
+      const t = this.F[e - 1];
+      this.F[e - 1] = [];
       runQueue(t, e);
     }
-    for (let t = 0; t < this.Z.length; t++) this.Z[t].run?.(e);
+    for (let t = 0; t < this.V.length; t++) this.V[t].run?.(e);
   }
   enqueue(e, t) {
     if (e) {
-      if (A) {
-        const n = findLane(A);
-        n.F[e - 1].push(t);
+      if (R) {
+        const n = findLane(R);
+        n.M[e - 1].push(t);
       } else {
-        this.Y[e - 1].push(t);
+        this.F[e - 1].push(t);
       }
     }
     schedule();
   }
   stashQueues(e) {
-    e.Y[0].push(...this.Y[0]);
-    e.Y[1].push(...this.Y[1]);
-    this.Y = [[], []];
-    for (let t = 0; t < this.Z.length; t++) {
-      let n = this.Z[t];
-      let r = e.Z[t];
+    e.F[0].push(...this.F[0]);
+    e.F[1].push(...this.F[1]);
+    this.F = [[], []];
+    for (let t = 0; t < this.V.length; t++) {
+      let n = this.V[t];
+      let r = e.V[t];
       if (!r) {
-        r = { Y: [[], []], Z: [] };
-        e.Z[t] = r;
+        r = { F: [[], []], V: [] };
+        e.V[t] = r;
       }
       n.stashQueues(r);
     }
   }
   restoreQueues(e) {
-    this.Y[0].push(...e.Y[0]);
-    this.Y[1].push(...e.Y[1]);
-    for (let t = 0; t < e.Z.length; t++) {
-      const n = e.Z[t];
-      let r = this.Z[t];
+    this.F[0].push(...e.F[0]);
+    this.F[1].push(...e.F[1]);
+    for (let t = 0; t < e.V.length; t++) {
+      const n = e.V[t];
+      let r = this.V[t];
       if (r) r.restoreQueues(n);
     }
   }
 }
 class GlobalQueue extends Queue {
-  X = false;
-  $ = [];
-  ee = [];
-  te = new Set();
-  static ne;
-  static re;
-  static ie = null;
+  q = false;
+  D = [];
+  B = [];
+  G = new Set();
+  static K;
+  static U;
+  static J = null;
   flush() {
-    if (this.X) return;
-    this.X = true;
+    if (this.q) return;
+    this.q = true;
     try {
-      runHeap(_, GlobalQueue.ne);
+      runHeap(b, GlobalQueue.K);
       if (x) {
         const e = transitionComplete(x);
         if (!e) {
           let e = x;
-          runHeap(b, GlobalQueue.ne);
-          this.$ = [];
-          this.ee = [];
-          this.te = new Set();
+          runHeap(_, GlobalQueue.K);
+          this.D = [];
+          this.B = [];
+          this.G = new Set();
           runLaneEffects(d);
           runLaneEffects(p);
-          this.stashQueues(x.se);
+          this.stashQueues(x.X);
           O++;
-          v = _.m >= _.j;
-          reassignPendingTransition(x.$);
+          v = b.S >= b.W;
+          reassignPendingTransition(x.D);
           x = null;
           finalizePureQueue(null, true);
           return;
         }
-        this.$ !== x.$ && this.$.push(...x.$);
-        this.restoreQueues(x.se);
+        this.D !== x.D && this.D.push(...x.D);
+        this.restoreQueues(x.X);
         m.delete(x);
         const t = x;
         x = null;
-        reassignPendingTransition(this.$);
+        reassignPendingTransition(this.D);
         finalizePureQueue(t);
       } else {
-        if (m.size) runHeap(b, GlobalQueue.ne);
+        if (m.size) runHeap(_, GlobalQueue.K);
         finalizePureQueue();
       }
       O++;
-      v = _.m >= _.j;
+      v = b.S >= b.W;
       runLaneEffects(d);
       this.run(d);
       runLaneEffects(p);
       this.run(p);
     } finally {
-      this.X = false;
+      this.q = false;
     }
   }
   notify(e, t, n, r) {
     if (t & l) {
       if (n & l) {
-        const t = r !== undefined ? r : e.oe;
-        if (x && t && !x.ue.includes(t.t)) {
-          x.ue.push(t.t);
+        const t = r !== undefined ? r : e.Y;
+        if (x && t && !x.Z.includes(t.source)) {
+          x.Z.push(t.source);
           schedule();
         }
       }
@@ -362,172 +294,175 @@ class GlobalQueue extends Queue {
   initTransition(e) {
     if (e) e = currentTransition(e);
     if (e && e === x) return;
-    if (!e && x && x.fe === O) return;
+    if (!e && x && x.$ === O) return;
     if (!x) {
       x = e ?? {
-        fe: O,
-        $: [],
-        ue: [],
+        $: O,
+        D: [],
+        Z: [],
+        B: [],
+        G: new Set(),
         ee: [],
-        te: new Set(),
-        le: [],
-        se: { Y: [[], []], Z: [] },
-        ce: false
+        X: { F: [[], []], V: [] },
+        te: false
       };
     } else if (e) {
       const t = x;
-      t.ce = e;
-      e.le.push(...t.le);
-      for (const n of k) {
-        if (n.B === t) n.B = e;
-      }
+      t.te = e;
       e.ee.push(...t.ee);
-      for (const n of t.te) {
-        e.te.add(n);
+      for (const n of C) {
+        if (n.ne === t) n.ne = e;
+      }
+      e.B.push(...t.B);
+      for (const n of t.G) {
+        e.G.add(n);
       }
       m.delete(t);
       x = e;
     }
     m.add(x);
-    x.fe = O;
-    for (let e = 0; e < this.$.length; e++) {
-      const t = this.$[e];
-      t.B = x;
-      x.$.push(t);
+    x.$ = O;
+    for (let e = 0; e < this.D.length; e++) {
+      const t = this.D[e];
+      t.ne = x;
+      x.D.push(t);
     }
-    this.$ = x.$;
-    for (let e = 0; e < this.ee.length; e++) {
-      const t = this.ee[e];
-      t.B = x;
-      x.ee.push(t);
+    this.D = x.D;
+    for (let e = 0; e < this.B.length; e++) {
+      const t = this.B[e];
+      t.ne = x;
+      x.B.push(t);
     }
-    this.ee = x.ee;
-    for (const e of k) {
-      if (!e.B) e.B = x;
+    this.B = x.B;
+    for (const e of C) {
+      if (!e.ne) e.ne = x;
     }
-    for (const e of this.te) x.te.add(e);
-    this.te = x.te;
+    for (const e of this.G) x.G.add(e);
+    this.G = x.G;
   }
 }
 function insertSubs(e, t = false) {
-  const n = e.M || A;
-  for (let r = e.P; r !== null; r = r.C) {
+  const n = e.re || R;
+  for (let r = e.O; r !== null; r = r.P) {
     if (t && n) {
-      r.k._ |= f;
-      assignOrMergeLane(r.k, n);
+      r.A.m |= f;
+      assignOrMergeLane(r.A, n);
     } else if (t) {
-      r.k._ |= f;
-      r.k.M = undefined;
+      r.A.m |= f;
+      r.A.re = undefined;
     }
-    const e = r.k;
-    if (e.ae === h) {
-      if (!e.de) {
-        e.de = true;
-        e.pe.enqueue(p, e.he);
+    const e = r.A;
+    if (e.ie === h) {
+      if (!e.se) {
+        e.se = true;
+        e.oe.enqueue(p, e.ue);
       }
       continue;
     }
-    const i = r.k._ & o ? b : _;
-    if (i.j > r.k.u) i.j = r.k.u;
-    insertIntoHeap(r.k, i);
+    const i = r.A.m & o ? _ : b;
+    if (i.W > r.A.o) i.W = r.A.o;
+    insertIntoHeap(r.A, i);
   }
 }
 function finalizePureQueue(e = null, t = false) {
   let n = !t;
-  if (!t) checkBoundaryChildren(E);
-  if (_.m >= _.j) runHeap(_, GlobalQueue.ne);
+  if (!t) checkBoundaryChildren(A);
+  if (b.S >= b.W) runHeap(b, GlobalQueue.K);
   if (n) {
-    const t = E.$;
+    const t = A.D;
     for (let e = 0; e < t.length; e++) {
       const n = t[e];
-      if (n.J !== y) {
-        n.ye = n.J;
-        n.J = y;
-        if (n.ae && n.ae !== h) n.de = true;
+      if (n.fe !== y) {
+        n.le = n.fe;
+        n.fe = y;
+        if (n.ie && n.ie !== h) n.se = true;
       }
-      n.ge &= ~a;
-      if (n.R) GlobalQueue.re(n, false, true);
+      n.ce &= ~a;
+      if (n.H) GlobalQueue.U(n, false, true);
     }
     t.length = 0;
-    const n = e ? e.ee : E.ee;
+    const n = e ? e.B : A.B;
     for (let e = 0; e < n.length; e++) {
       const t = n[e];
-      const r = t.J;
-      t.M = undefined;
-      if (r !== y && t.ye !== r) {
-        t.ye = r;
+      const r = t.fe;
+      t.re = undefined;
+      if (r !== y && t.le !== r) {
+        t.le = r;
         insertSubs(t, true);
       }
-      t.J = y;
-      t.B = null;
+      t.fe = y;
+      t.ne = null;
     }
     n.length = 0;
-    const r = e ? e.te : E.te;
-    if (GlobalQueue.ie && r.size) {
+    const r = e ? e.G : A.G;
+    if (GlobalQueue.J && r.size) {
       for (const e of r) {
-        GlobalQueue.ie(e);
+        GlobalQueue.J(e);
       }
       r.clear();
       schedule();
     }
-    for (const t of k) {
-      const n = e ? t.B === e : !t.B;
+    for (const t of C) {
+      const n = e ? t.ne === e : !t.ne;
       if (!n) continue;
-      if (!t.V) {
-        if (t.F[0].length) runQueue(t.F[0], d);
-        if (t.F[1].length) runQueue(t.F[1], p);
+      if (!t.R) {
+        if (t.M[0].length) runQueue(t.M[0], d);
+        if (t.M[1].length) runQueue(t.M[1], p);
       }
-      if (t.t.M === t) t.t.M = undefined;
-      t.q.clear();
-      t.F[0].length = 0;
-      t.F[1].length = 0;
-      k.delete(t);
-      C.delete(t.t);
+      if (t.ae.re === t) t.ae.re = undefined;
+      t.T.clear();
+      t.M[0].length = 0;
+      t.M[1].length = 0;
+      C.delete(t);
+      k.delete(t.ae);
     }
   }
 }
 function checkBoundaryChildren(e) {
-  for (const t of e.Z) {
+  for (const t of e.V) {
     t.checkSources?.();
     checkBoundaryChildren(t);
   }
 }
 function trackOptimisticStore(e) {
-  E.te.add(e);
+  A.G.add(e);
   schedule();
 }
 function reassignPendingTransition(e) {
   for (let t = 0; t < e.length; t++) {
-    e[t].B = x;
+    e[t].ne = x;
   }
 }
-const E = new GlobalQueue();
+const A = new GlobalQueue();
 function flush() {
   while (v) {
-    E.flush();
+    A.flush();
   }
 }
 function runQueue(e, t) {
   for (let n = 0; n < e.length; n++) e[n](t);
 }
 function transitionComplete(e) {
-  if (e.ce) return true;
-  if (e.le.length) return false;
+  if (e.te) return true;
+  if (e.ee.length) return false;
   let t = true;
-  for (let n = 0; n < e.ue.length; n++) {
-    const r = e.ue[n];
-    if (r.ge & l && r.oe?.t === r) {
+  for (let n = 0; n < e.Z.length; n++) {
+    const r = e.Z[n];
+    if (r.ce & l && r.Y?.source === r) {
       t = false;
       break;
     }
   }
-  t && (e.ce = true);
+  t && (e.te = true);
   return t;
 }
 function currentTransition(e) {
-  while (e.ce && typeof e.ce === "object") e = e.ce;
+  while (e.te && typeof e.te === "object") e = e.te;
   return e;
 }
+function setActiveTransition(e) {
+  x = e;
+}
 function runInTransition(e, t) {
   const n = x;
   try {
@@ -537,195 +472,107 @@ function runInTransition(e, t) {
     x = n;
   }
 }
-function restoreTransition(e, t) {
-  E.initTransition(e);
-  const n = t();
-  flush();
-  return n;
+const k = new WeakMap();
+const C = new Set();
+function getOrCreateLane(e) {
+  let t = k.get(e);
+  if (t) {
+    return findLane(t);
+  }
+  const n = e.de;
+  const r = n?.re ? findLane(n.re) : null;
+  t = { ae: e, T: new Set(), M: [[], []], R: null, ne: x, pe: r };
+  k.set(e, t);
+  C.add(t);
+  e.he = e.ye || 0;
+  return t;
 }
-function action(e) {
-  return (...t) =>
-    new Promise((n, r) => {
-      const i = e(...t);
-      E.initTransition();
-      let s = x;
-      s.le.push(i);
-      const done = (e, t) => {
-        s = currentTransition(s);
-        const o = s.le.indexOf(i);
-        if (o >= 0) s.le.splice(o, 1);
-        x = s;
-        schedule();
-        t ? r(t) : n(e);
-      };
-      const step = (e, t) => {
-        let n;
-        try {
-          n = t ? i.throw(e) : i.next(e);
-        } catch (e) {
-          return done(undefined, e);
-        }
-        if (n instanceof Promise)
-          return void n.then(run, e => restoreTransition(s, () => step(e, true)));
-        run(n);
-      };
-      const run = e => {
-        if (e.done) return done(e.value);
-        if (e.value instanceof Promise)
-          return void e.value.then(
-            e => restoreTransition(s, () => step(e)),
-            e => restoreTransition(s, () => step(e, true))
-          );
-        restoreTransition(s, () => step(e.value));
-      };
-      step();
-    });
+function findLane(e) {
+  while (e.R) e = e.R;
+  return e;
 }
-GlobalQueue.ne = recompute;
-GlobalQueue.re = disposeChildren;
-let W = false;
-let j = false;
-let N = false;
-let L = false;
-let Q = false;
-let I = false;
-let H = null;
-function recompute(t, n = false) {
-  const i = t.ae;
-  if (!n) {
-    if (t.B && (!i || x) && x !== t.B) E.initTransition(t.B);
-    deleteFromHeap(t, t._ & o ? b : _);
-    if (t.B || i === h) disposeChildren(t);
-    else {
-      markDisposal(t);
-      t.we = t.Se;
-      t.me = t._e;
-      t.Se = null;
-      t._e = null;
-    }
-  }
-  const s = !!(t._ & f);
-  const u = hasActiveOverride(t);
-  const a = !!(t.ge & l);
-  const d = H;
-  H = t;
-  t.be = null;
-  t._ = r;
-  t.fe = O;
-  let p = t.J === y ? t.ye : t.J;
-  let g = t.u;
-  let w = W;
-  let S = A;
-  W = true;
-  if (s) {
-    const e = resolveLane(t);
-    if (e) setCurrentOptimisticLane(e);
-  }
-  try {
-    p = handleAsync(t, t.R(p));
-    clearStatus(t);
-    const e = resolveLane(t);
-    if (e) {
-      e.q.delete(t);
-      updatePendingSignal(e.t);
-    }
-  } catch (e) {
-    if (e instanceof NotReadyError && A) {
-      const e = findLane(A);
-      if (e.t !== t) {
-        e.q.add(t);
-        t.M = e;
-        updatePendingSignal(e.t);
-      }
-    }
-    notifyStatus(
-      t,
-      e instanceof NotReadyError ? l : c,
-      e,
-      undefined,
-      e instanceof NotReadyError ? t.M : undefined
-    );
-  } finally {
-    W = w;
-    t._ = e;
-    H = d;
-  }
-  if (!t.oe) {
-    const e = t.be;
-    let r = e !== null ? e.L : t.N;
-    if (r !== null) {
-      do {
-        r = unlinkSubs(r);
-      } while (r !== null);
-      if (e !== null) e.L = null;
-      else t.N = null;
+function mergeLanes(e, t) {
+  e = findLane(e);
+  t = findLane(t);
+  if (e === t) return e;
+  t.R = e;
+  for (const n of t.T) e.T.add(n);
+  e.M[0].push(...t.M[0]);
+  e.M[1].push(...t.M[1]);
+  return e;
+}
+function resolveLane(e) {
+  const t = e.re;
+  if (!t) return undefined;
+  const n = findLane(t);
+  if (C.has(n)) return n;
+  e.re = undefined;
+  return undefined;
+}
+function hasActiveOverride(e) {
+  return !!(e.ge && e.fe !== y);
+}
+function assignOrMergeLane(e, t) {
+  const n = findLane(t);
+  const r = e.re;
+  if (r) {
+    if (r.R) {
+      e.re = t;
+      return;
     }
-    const f = u ? t.ye : t.J === y ? t.ye : t.J;
-    const l = !t.Oe || !t.Oe(f, p);
-    if (l) {
-      const e = u ? t.ye : undefined;
-      if (n || (i && x !== t.B) || s) t.ye = p;
-      else t.J = p;
-      if (u && !s && a) {
-        const e = t.K || 0;
-        const n = t.G || 0;
-        if (e <= n) t.ye = p;
-      }
-      if (!u || s || t.ye !== e) {
-        insertSubs(t, s || u);
-      }
-    } else if (u) {
-      t.J = p;
-    } else if (t.u != g) {
-      for (let e = t.P; e !== null; e = e.C) {
-        insertIntoHeapHeight(e.k, e.k._ & o ? b : _);
+    const i = findLane(r);
+    if (C.has(i)) {
+      if (i !== n && !hasActiveOverride(e)) {
+        if (n.pe && findLane(n.pe) === i) {
+          e.re = t;
+        } else if (i.pe && findLane(i.pe) === n);
+        else mergeLanes(n, i);
       }
+      return;
     }
   }
-  setCurrentOptimisticLane(S);
-  (!n || t.ge & l) && !t.B && !(x && t.U) && E.$.push(t);
-  t.B && i && x !== t.B && runInTransition(t.B, () => recompute(t));
+  e.re = t;
 }
 function handleAsync(e, t, r) {
   const i = typeof t === "object" && t !== null;
   const s = i && untrack(() => t[Symbol.asyncIterator]);
   const o = !s && i && untrack(() => typeof t.then === "function");
   if (!o && !s) {
-    e.xe = null;
+    e.we = null;
     return t;
   }
-  e.xe = t;
+  e.we = t;
   let u;
   const handleError = n => {
-    if (e.xe !== t) return;
-    E.initTransition(e.B);
+    if (e.we !== t) return;
+    A.initTransition(e.ne);
     notifyStatus(e, n instanceof NotReadyError ? l : c, n);
-    e.fe = O;
+    e.$ = O;
   };
   const asyncWrite = (i, s) => {
-    if (e.xe !== t) return;
-    if (e._ & (n | f)) return;
-    E.initTransition(e.B);
+    if (e.we !== t) return;
+    if (e.m & (n | f)) return;
+    A.initTransition(e.ne);
     clearStatus(e);
     const o = resolveLane(e);
-    if (o) o.q.delete(e);
+    if (o) o.T.delete(e);
     if (r) r(i);
-    else if (e.U) {
-      const t = e.J !== y;
-      if (e.R) e.J = i;
+    else if (e.ge) {
+      const t = e.fe !== y;
+      if (e.H) e.fe = i;
       if (!t) {
-        e.ye = i;
+        e.le = i;
         insertSubs(e);
       }
-      e.fe = O;
+      e.$ = O;
     } else if (o) {
-      const t = e.ye;
-      const n = e.Oe;
+      const t = e.le;
+      const n = e.Se;
       if (!n || !n(i, t)) {
-        e.ye = i;
-        e.fe = O;
-        if (e.ve) {
-          setSignal(e.ve, i);
+        e.le = i;
+        e.$ = O;
+        if (e.me) {
+          setSignal(e.me, i);
         }
         insertSubs(e, true);
       }
@@ -752,8 +599,8 @@ function handleAsync(e, t, r) {
     );
     r = false;
     if (!n) {
-      E.initTransition(e.B);
-      throw new NotReadyError(H);
+      A.initTransition(e.ne);
+      throw new NotReadyError(Q);
     }
   }
   if (s) {
@@ -784,191 +631,196 @@ function handleAsync(e, t, r) {
     };
     const i = iterate();
     if (!r && !i) {
-      E.initTransition(e.B);
-      throw new NotReadyError(H);
+      A.initTransition(e.ne);
+      throw new NotReadyError(Q);
     }
   }
   return u;
 }
 function clearStatus(e) {
-  e.ge = e.ge & a;
-  e.oe = null;
+  e.ce = e.ce & a;
+  e.Y = null;
   updatePendingSignal(e);
-  e.Pe?.();
+  e.be?.();
 }
 function notifyStatus(e, t, n, r, i) {
   if (t === c && !(n instanceof StatusError) && !(n instanceof NotReadyError))
     n = new StatusError(e, n);
-  const s = n instanceof NotReadyError && n.t === e;
-  const o = t === l && e.U && !s;
+  const s = n instanceof NotReadyError && n.source === e;
+  const o = t === l && e.ge && !s;
   const u = o && hasActiveOverride(e);
   if (!r) {
-    e.ge = t | (t !== c ? e.ge & a : 0);
-    e.oe = n;
+    e.ce = t | (t !== c ? e.ce & a : 0);
+    e.Y = n;
     updatePendingSignal(e);
   }
   if (i && !r) {
     assignOrMergeLane(e, i);
   }
   if (u && x && n instanceof NotReadyError) {
-    const e = n.t;
-    if (!x.ue.includes(e)) {
-      x.ue.push(e);
+    const e = n.source;
+    if (!x.Z.includes(e)) {
+      x.Z.push(e);
     }
   }
   const f = r || u;
   const d = r || o ? undefined : i;
-  if (e.Pe) {
+  if (e.be) {
     if (f) {
-      e.Pe(t, n);
+      e.be(t, n);
     } else {
-      e.Pe();
+      e.be();
     }
     return;
   }
-  for (let r = e.P; r !== null; r = r.C) {
-    r.k.fe = O;
-    if (r.k.oe !== n) {
-      !r.k.B && E.$.push(r.k);
-      notifyStatus(r.k, t, n, f, d);
+  for (let r = e.O; r !== null; r = r.P) {
+    r.A.$ = O;
+    if (r.A.Y !== n) {
+      !r.A.ne && A.D.push(r.A);
+      notifyStatus(r.A, t, n, f, d);
     }
   }
-  for (let r = e.A; r !== null; r = r.W) {
-    for (let e = r.P; e !== null; e = e.C) {
-      e.k.fe = O;
-      if (e.k.oe !== n) {
-        !e.k.B && E.$.push(e.k);
-        notifyStatus(e.k, t, n, f, d);
+  for (let r = e.k; r !== null; r = r.C) {
+    for (let e = r.O; e !== null; e = e.P) {
+      e.A.$ = O;
+      if (e.A.Y !== n) {
+        !e.A.ne && A.D.push(e.A);
+        notifyStatus(e.A, t, n, f, d);
       }
     }
   }
 }
-function updateIfNecessary(r) {
-  if (r._ & t) {
-    for (let e = r.N; e; e = e.L) {
-      const t = e.I;
-      const i = t.H || t;
-      if (i.R) {
-        updateIfNecessary(i);
-      }
-      if (r._ & n) {
-        break;
+function effect(e, t, n, r, i) {
+  let s = false;
+  const o = computed(i?.render ? t => staleValues(() => e(t)) : e, r, {
+    ...i,
+    equals: () => {
+      o.se = !o.Y;
+      if (s) o.oe.enqueue(o.ie, runEffect.bind(o));
+      return false;
+    },
+    lazy: true
+  });
+  o._e = r;
+  o.Oe = t;
+  o.xe = n;
+  o.ve = undefined;
+  o.ie = i?.render ? d : p;
+  o.be = (e, t) => {
+    const n = e !== undefined ? e : o.ce;
+    const r = t !== undefined ? t : o.Y;
+    if (n & c) {
+      let e = r;
+      o.oe.notify(o, l, 0);
+      if (o.ie === p) {
+        try {
+          return o.xe
+            ? o.xe(e, () => {
+                o.ve?.();
+                o.ve = undefined;
+              })
+            : console.error(e);
+        } catch (t) {
+          e = t;
+        }
       }
-    }
-  }
-  if (r._ & (n | f) || (r.oe && r.fe < O)) {
-    recompute(r);
-  }
-  r._ = e;
-}
-function unlinkSubs(e) {
-  const t = e.I;
-  const n = e.L;
-  const r = e.C;
-  const i = e.Ce;
-  if (r !== null) r.Ce = i;
-  else t.ke = i;
-  if (i !== null) i.C = r;
-  else {
-    t.P = r;
-    if (r === null) {
-      t.Ae?.();
-      t.R && !t.Ee && unobserved(t);
-    }
-  }
-  return n;
-}
-function unobserved(e) {
-  deleteFromHeap(e, e._ & o ? b : _);
-  let t = e.N;
-  while (t !== null) {
-    t = unlinkSubs(t);
-  }
-  e.N = null;
-  disposeChildren(e, true);
-}
-function link(e, t) {
-  const n = t.be;
-  if (n !== null && n.I === e) return;
-  let i = null;
-  const s = t._ & r;
-  if (s) {
-    i = n !== null ? n.L : t.N;
-    if (i !== null && i.I === e) {
-      t.be = i;
-      return;
-    }
-  }
-  const o = e.ke;
-  if (o !== null && o.k === t && (!s || isValidLink(o, t))) return;
-  const u = (t.be = e.ke = { I: e, k: t, L: i, Ce: o, C: null });
-  if (n !== null) n.L = u;
-  else t.N = u;
-  if (o !== null) o.C = u;
-  else e.P = u;
+      if (!o.oe.notify(o, c, c)) throw e;
+    } else if (o.ie === d) o.oe.notify(o, l | c, n, r);
+  };
+  recompute(o, true);
+  !i?.defer && (o.ie === p ? o.oe.enqueue(o.ie, runEffect.bind(o)) : runEffect.call(o));
+  s = true;
+  onCleanup(() => o.ve?.());
 }
-function isValidLink(e, t) {
-  const n = t.be;
-  if (n !== null) {
-    let r = t.N;
-    do {
-      if (r === e) return true;
-      if (r === n) break;
-      r = r.L;
-    } while (r !== null);
+function runEffect() {
+  if (!this.se || this.m & u) return;
+  this.ve?.();
+  this.ve = undefined;
+  try {
+    this.ve = this.Oe(this.le, this._e);
+  } catch (e) {
+    if (!this.oe.notify(this, c, c)) throw e;
+  } finally {
+    this._e = this.le;
+    this.se = false;
   }
-  return false;
 }
+function trackedEffect(e, t) {
+  const run = () => {
+    if (!n.se || n.m & u) return;
+    n.se = false;
+    recompute(n);
+  };
+  const n = computed(
+    () => {
+      try {
+        n.ve?.();
+        n.ve = undefined;
+        n.ve = staleValues(e) || undefined;
+      } finally {
+      }
+    },
+    undefined,
+    { ...t, lazy: true, pureWrite: true }
+  );
+  n.ve = undefined;
+  n.se = true;
+  n.ie = h;
+  n.ue = run;
+  n.oe.enqueue(p, run);
+  onCleanup(() => n.ve?.());
+}
+const W = {};
 function markDisposal(e) {
-  let t = e._e;
+  let t = e.Pe;
   while (t) {
-    t._ |= o;
-    if (t._ & i) {
-      deleteFromHeap(t, _);
-      insertIntoHeap(t, b);
+    t.m |= o;
+    if (t.m & i) {
+      deleteFromHeap(t, b);
+      insertIntoHeap(t, _);
     }
     markDisposal(t);
-    t = t.We;
+    t = t.Ae;
   }
 }
 function dispose(e) {
-  let t = e.N || null;
+  let t = e.j || null;
   do {
     t = unlinkSubs(t);
   } while (t !== null);
-  e.N = null;
-  e.be = null;
+  e.j = null;
+  e.ke = null;
   disposeChildren(e, true);
 }
 function disposeChildren(e, t = false, n) {
-  if (e._ & u) return;
-  if (t) e._ = u;
-  let r = n ? e.me : e._e;
+  if (e.m & u) return;
+  if (t) e.m = u;
+  let r = n ? e.Ce : e.Pe;
   while (r) {
-    const e = r.We;
-    if (r.N) {
+    const e = r.Ae;
+    if (r.j) {
       const e = r;
-      deleteFromHeap(e, e._ & o ? b : _);
-      let t = e.N;
+      deleteFromHeap(e, e.m & o ? _ : b);
+      let t = e.j;
       do {
         t = unlinkSubs(t);
       } while (t !== null);
-      e.N = null;
-      e.be = null;
+      e.j = null;
+      e.ke = null;
     }
     disposeChildren(r, true);
     r = e;
   }
   if (n) {
-    e.me = null;
+    e.Ce = null;
   } else {
-    e._e = null;
-    e.We = null;
+    e.Pe = null;
+    e.Ae = null;
   }
   runDisposal(e, n);
 }
 function runDisposal(e, t) {
-  let n = t ? e.we : e.Se;
+  let n = t ? e.We : e.Ee;
   if (!n) return;
   if (Array.isArray(n)) {
     for (let e = 0; e < n.length; e++) {
@@ -978,7 +830,7 @@ function runDisposal(e, t) {
   } else {
     n.call(n);
   }
-  t ? (e.we = null) : (e.Se = null);
+  t ? (e.We = null) : (e.Ee = null);
 }
 function getNextChildId(e) {
   if (e.id != null) return formatId(e.id, e.je++);
@@ -989,319 +841,500 @@ function formatId(e, t) {
     r = n.length - 1;
   return e + (r ? String.fromCharCode(64 + r) : "") + n;
 }
+function getObserver() {
+  if (L || H) return W;
+  return E ? Q : null;
+}
+function getOwner() {
+  return Q;
+}
+function onCleanup(e) {
+  if (!Q) return e;
+  if (!Q.Ee) Q.Ee = e;
+  else if (Array.isArray(Q.Ee)) Q.Ee.push(e);
+  else Q.Ee = [Q.Ee, e];
+  return e;
+}
+function createOwner(e) {
+  const t = Q;
+  const n = {
+    id: e?.id ?? (t?.id != null ? getNextChildId(t) : undefined),
+    t: true,
+    u: t?.t ? t.u : t,
+    Pe: null,
+    Ae: null,
+    Ee: null,
+    oe: t?.oe ?? A,
+    Ne: t?.Ne || w,
+    je: 0,
+    We: null,
+    Ce: null,
+    i: t,
+    dispose(e = true) {
+      disposeChildren(n, e);
+    }
+  };
+  if (t) {
+    const e = t.Pe;
+    if (e === null) {
+      t.Pe = n;
+    } else {
+      n.Ae = e;
+      t.Pe = n;
+    }
+  }
+  return n;
+}
+function createRoot(e, t) {
+  const n = createOwner(t);
+  return runWithOwner(n, () => e(n.dispose));
+}
+function unlinkSubs(e) {
+  const t = e.L;
+  const n = e.N;
+  const r = e.P;
+  const i = e.Le;
+  if (r !== null) r.Le = i;
+  else t.Ie = i;
+  if (i !== null) i.P = r;
+  else {
+    t.O = r;
+    if (r === null) {
+      t.He?.();
+      t.H && !t.Qe && unobserved(t);
+    }
+  }
+  return n;
+}
+function unobserved(e) {
+  deleteFromHeap(e, e.m & o ? _ : b);
+  let t = e.j;
+  while (t !== null) {
+    t = unlinkSubs(t);
+  }
+  e.j = null;
+  disposeChildren(e, true);
+}
+function link(e, t) {
+  const n = t.ke;
+  if (n !== null && n.L === e) return;
+  let i = null;
+  const s = t.m & r;
+  if (s) {
+    i = n !== null ? n.N : t.j;
+    if (i !== null && i.L === e) {
+      t.ke = i;
+      return;
+    }
+  }
+  const o = e.Ie;
+  if (o !== null && o.A === t && (!s || isValidLink(o, t))) return;
+  const u = (t.ke = e.Ie = { L: e, A: t, N: i, Le: o, P: null });
+  if (n !== null) n.N = u;
+  else t.j = u;
+  if (o !== null) o.P = u;
+  else e.O = u;
+}
+function isValidLink(e, t) {
+  const n = t.ke;
+  if (n !== null) {
+    let r = t.j;
+    do {
+      if (r === e) return true;
+      if (r === n) break;
+      r = r.N;
+    } while (r !== null);
+  }
+  return false;
+}
+GlobalQueue.K = recompute;
+GlobalQueue.U = disposeChildren;
+let E = false;
+let j = false;
+let N = false;
+let L = false;
+let I = false;
+let H = false;
+let Q = null;
+let R = null;
+function recompute(t, n = false) {
+  const i = t.ie;
+  if (!n) {
+    if (t.ne && (!i || x) && x !== t.ne) A.initTransition(t.ne);
+    deleteFromHeap(t, t.m & o ? _ : b);
+    if (t.ne || i === h) disposeChildren(t);
+    else {
+      markDisposal(t);
+      t.We = t.Ee;
+      t.Ce = t.Pe;
+      t.Ee = null;
+      t.Pe = null;
+    }
+  }
+  const s = !!(t.m & f);
+  const u = hasActiveOverride(t);
+  const a = !!(t.ce & l);
+  const d = Q;
+  Q = t;
+  t.ke = null;
+  t.m = r;
+  t.$ = O;
+  let p = t.fe === y ? t.le : t.fe;
+  let g = t.o;
+  let w = E;
+  let S = R;
+  E = true;
+  if (s) {
+    const e = resolveLane(t);
+    if (e) R = e;
+  }
+  try {
+    p = handleAsync(t, t.H(p));
+    clearStatus(t);
+    const e = resolveLane(t);
+    if (e) {
+      e.T.delete(t);
+      updatePendingSignal(e.ae);
+    }
+  } catch (e) {
+    if (e instanceof NotReadyError && R) {
+      const e = findLane(R);
+      if (e.ae !== t) {
+        e.T.add(t);
+        t.re = e;
+        updatePendingSignal(e.ae);
+      }
+    }
+    notifyStatus(
+      t,
+      e instanceof NotReadyError ? l : c,
+      e,
+      undefined,
+      e instanceof NotReadyError ? t.re : undefined
+    );
+  } finally {
+    E = w;
+    t.m = e;
+    Q = d;
+  }
+  if (!t.Y) {
+    const e = t.ke;
+    let r = e !== null ? e.N : t.j;
+    if (r !== null) {
+      do {
+        r = unlinkSubs(r);
+      } while (r !== null);
+      if (e !== null) e.N = null;
+      else t.j = null;
+    }
+    const f = u ? t.le : t.fe === y ? t.le : t.fe;
+    const l = !t.Se || !t.Se(f, p);
+    if (l) {
+      const e = u ? t.le : undefined;
+      if (n || (i && x !== t.ne) || s) t.le = p;
+      else t.fe = p;
+      if (u && !s && a) {
+        const e = t.ye || 0;
+        const n = t.he || 0;
+        if (e <= n) t.le = p;
+      }
+      if (!u || s || t.le !== e) {
+        insertSubs(t, s || u);
+      }
+    } else if (u) {
+      t.fe = p;
+    } else if (t.o != g) {
+      for (let e = t.O; e !== null; e = e.P) {
+        insertIntoHeapHeight(e.A, e.A.m & o ? _ : b);
+      }
+    }
+  }
+  R = S;
+  (!n || t.ce & l) && !t.ne && !(x && t.ge) && A.D.push(t);
+  t.ne && i && x !== t.ne && runInTransition(t.ne, () => recompute(t));
+}
+function updateIfNecessary(r) {
+  if (r.m & t) {
+    for (let e = r.j; e; e = e.N) {
+      const t = e.L;
+      const i = t.I || t;
+      if (i.H) {
+        updateIfNecessary(i);
+      }
+      if (r.m & n) {
+        break;
+      }
+    }
+  }
+  if (r.m & (n | f) || (r.Y && r.$ < O)) {
+    recompute(r);
+  }
+  r.m = e;
+}
 function computed(t, n, r) {
   const i = {
-    id: r?.id ?? (H?.id != null ? getNextChildId(H) : undefined),
-    Oe: r?.equals != null ? r.equals : isEqual,
-    Ne: !!r?.pureWrite,
-    Ae: r?.unobserved,
-    Se: null,
-    pe: H?.pe ?? E,
-    Le: H?.Le ?? w,
+    id: r?.id ?? (Q?.id != null ? getNextChildId(Q) : undefined),
+    Se: r?.equals != null ? r.equals : isEqual,
+    Re: !!r?.pureWrite,
+    He: r?.unobserved,
+    Ee: null,
+    oe: Q?.oe ?? A,
+    Ne: Q?.Ne ?? w,
     je: 0,
-    R: t,
-    ye: n,
-    u: 0,
-    A: null,
-    S: undefined,
-    h: null,
-    N: null,
-    be: null,
-    P: null,
+    H: t,
+    le: n,
+    o: 0,
+    k: null,
+    h: undefined,
+    p: null,
+    j: null,
     ke: null,
-    o: H,
+    O: null,
+    Ie: null,
+    i: Q,
+    Ae: null,
+    Pe: null,
+    m: e,
+    ce: a,
+    $: O,
+    fe: y,
     We: null,
-    _e: null,
-    _: e,
-    ge: a,
-    fe: O,
-    J: y,
+    Ce: null,
     we: null,
-    me: null,
-    xe: null,
-    B: null
+    ne: null
   };
-  i.h = i;
-  const s = H?.i ? H.l : H;
-  if (H) {
-    const e = H._e;
+  i.p = i;
+  const s = Q?.t ? Q.u : Q;
+  if (Q) {
+    const e = Q.Pe;
     if (e === null) {
-      H._e = i;
+      Q.Pe = i;
     } else {
-      i.We = e;
-      H._e = i;
+      i.Ae = e;
+      Q.Pe = i;
     }
   }
-  if (s) i.u = s.u + 1;
+  if (s) i.o = s.o + 1;
   !r?.lazy && recompute(i, true);
   return i;
 }
 function signal(e, t, n = null) {
   const r = {
-    Oe: t?.equals != null ? t.equals : isEqual,
-    Ne: !!t?.pureWrite,
-    Ae: t?.unobserved,
-    ye: e,
-    P: null,
-    ke: null,
-    fe: O,
-    H: n,
-    W: n?.A || null,
-    J: y
+    Se: t?.equals != null ? t.equals : isEqual,
+    Re: !!t?.pureWrite,
+    He: t?.unobserved,
+    le: e,
+    O: null,
+    Ie: null,
+    $: O,
+    I: n,
+    C: n?.k || null,
+    fe: y
   };
-  n && (n.A = r);
+  n && (n.k = r);
   return r;
 }
 function optimisticSignal(e, t) {
   const n = signal(e, t);
-  n.U = true;
+  n.ge = true;
   return n;
 }
 function optimisticComputed(e, t, n) {
   const r = computed(e, t, n);
-  r.U = true;
+  r.ge = true;
   return r;
 }
-function getPendingSignal(e) {
-  if (!e.Qe) {
-    e.Qe = optimisticSignal(false, { pureWrite: true });
-    if (e.T) {
-      e.Qe.T = e;
-    }
-    if (computePendingState(e)) setSignal(e.Qe, true);
-  }
-  return e.Qe;
-}
-function computePendingState(e) {
-  const t = e;
-  if (e.U && e.J !== y) {
-    if (t.ge & l && !(t.ge & a)) return true;
-    if (e.T) {
-      const t = e.M ? findLane(e.M) : null;
-      return !!(t && t.q.size > 0);
-    }
-    return true;
-  }
-  if (e.J !== y && !(t.ge & a)) return true;
-  return !!(t.ge & l && !(t.ge & a));
-}
-function getPendingValueComputed(e) {
-  if (!e.ve) {
-    const t = I;
-    I = false;
-    const n = L;
-    L = false;
-    const r = H;
-    H = null;
-    e.ve = optimisticComputed(() => read(e));
-    e.ve.T = e;
-    H = r;
-    L = n;
-    I = t;
-  }
-  return e.ve;
-}
-function updatePendingSignal(e) {
-  if (e.Qe) {
-    const t = computePendingState(e);
-    const n = e.Qe;
-    setSignal(n, t);
-    if (!t && n.M) {
-      const t = resolveLane(e);
-      if (t && t.q.size > 0) {
-        const e = findLane(n.M);
-        if (e !== t) {
-          mergeLanes(t, e);
-        }
-      }
-      clearLaneEntry(n);
-      n.M = undefined;
-    }
-  }
-}
 function isEqual(e, t) {
   return e === t;
 }
 function untrack(e) {
-  if (!W) return e();
-  W = false;
+  if (!E) return e();
+  E = false;
   try {
     return e();
   } finally {
-    W = true;
+    E = true;
   }
 }
 function read(e) {
-  if (I) {
+  if (H) {
     const t = getPendingValueComputed(e);
-    const n = I;
-    I = false;
+    const n = H;
+    H = false;
     const r = read(t);
-    I = n;
-    if (t.ge & l) return e.ye;
-    if (j && A && t.M) {
-      const n = findLane(t.M);
-      const r = findLane(A);
-      if (n !== r && n.q.size > 0) {
-        return e.ye;
+    H = n;
+    if (t.ce & l) return e.le;
+    if (j && R && t.re) {
+      const n = findLane(t.re);
+      const r = findLane(R);
+      if (n !== r && n.T.size > 0) {
+        return e.le;
       }
     }
     return r;
   }
   if (L) {
-    const t = e.H || e;
+    const t = e.I || e;
     const n = getPendingSignal(t);
     const r = L;
     L = false;
     if (read(n)) {
-      Q = true;
+      I = true;
     }
     L = r;
-    return e.ye;
+    return e.le;
   }
-  let t = H;
-  if (t?.i) t = t.l;
-  if (N && e.R) recompute(e);
-  if (t && W) {
-    if (e.R && e._ & u) recompute(e);
+  let t = Q;
+  if (t?.t) t = t.u;
+  if (N && e.H) recompute(e);
+  if (t && E) {
+    if (e.H && e.m & u) recompute(e);
     link(e, t);
-    const n = e.H || e;
-    if (n.R) {
-      const r = e._ & o;
-      if (n.u >= (r ? b.j : _.j)) {
+    const n = e.I || e;
+    if (n.H) {
+      const r = e.m & o;
+      if (n.o >= (r ? _.W : b.W)) {
         markNode(t);
-        markHeap(r ? b : _);
+        markHeap(r ? _ : b);
         updateIfNecessary(n);
       }
-      const i = n.u;
-      if (i >= t.u && e.o !== t) {
-        t.u = i + 1;
+      const i = n.o;
+      if (i >= t.o && e.i !== t) {
+        t.o = i + 1;
       }
     }
   }
-  const n = e.H || e;
-  if (t && n.ge & l && !(j && n.B && x !== n.B)) {
-    if (A) {
-      const r = n.M;
-      const i = findLane(A);
+  const n = e.I || e;
+  if (t && n.ce & l && !(j && n.ne && x !== n.ne)) {
+    if (R) {
+      const r = n.re;
+      const i = findLane(R);
       if (r && findLane(r) === i && !hasActiveOverride(n)) {
-        if (!W) link(e, t);
-        throw n.oe;
+        if (!E) link(e, t);
+        throw n.Y;
       }
     } else {
-      if (!W) link(e, t);
-      throw n.oe;
+      if (!E) link(e, t);
+      throw n.Y;
     }
   }
-  if (e.R && e.ge & c) {
-    if (e.fe < O) {
+  if (e.H && e.ce & c) {
+    if (e.$ < O) {
       recompute(e, true);
       return read(e);
-    } else throw e.oe;
+    } else throw e.Y;
   }
-  return !t || A !== null || e.J === y || (j && e.B && x !== e.B) ? e.ye : e.J;
+  return !t || R !== null || e.fe === y || (j && e.ne && x !== e.ne) ? e.le : e.fe;
 }
 function setSignal(e, t) {
-  if (e.B && x !== e.B) E.initTransition(e.B);
-  const n = e.U && !P;
-  const r = n ? e.ye : e.J === y ? e.ye : e.J;
+  if (e.ne && x !== e.ne) A.initTransition(e.ne);
+  const n = e.ge && !P;
+  const r = n ? e.le : e.fe === y ? e.le : e.fe;
   if (typeof t === "function") t = t(r);
-  const i = !e.Oe || !e.Oe(r, t);
+  const i = !e.Se || !e.Se(r, t);
   if (!i) {
-    if (n && e.J !== y && e.R) {
+    if (n && e.fe !== y && e.H) {
       insertSubs(e, true);
       schedule();
     }
     return t;
   }
   if (n) {
-    const n = E.ee.includes(e);
-    if (e.B && n) {
-      E.initTransition(e.B);
+    const n = A.B.includes(e);
+    if (e.ne && n) {
+      A.initTransition(e.ne);
     }
-    if (e.J === y) {
-      e.J = e.ye;
+    if (e.fe === y) {
+      e.fe = e.le;
     }
     if (!n) {
-      E.ee.push(e);
+      A.B.push(e);
     }
-    e.K = (e.K || 0) + 1;
+    e.ye = (e.ye || 0) + 1;
     const r = getOrCreateLane(e);
-    e.M = r;
-    e.ye = t;
+    e.re = r;
+    e.le = t;
   } else {
-    if (e.J === y) E.$.push(e);
-    e.J = t;
+    if (e.fe === y) A.D.push(e);
+    e.fe = t;
   }
   updatePendingSignal(e);
-  if (e.ve) {
-    setSignal(e.ve, t);
+  if (e.me) {
+    setSignal(e.me, t);
   }
-  e.fe = O;
+  e.$ = O;
   insertSubs(e, n);
   schedule();
   return t;
 }
-const R = {};
-function getObserver() {
-  if (L || I) return R;
-  return W ? H : null;
-}
-function getOwner() {
-  return H;
-}
-function onCleanup(e) {
-  if (!H) return e;
-  if (!H.Se) H.Se = e;
-  else if (Array.isArray(H.Se)) H.Se.push(e);
-  else H.Se = [H.Se, e];
-  return e;
+function runWithOwner(e, t) {
+  const n = Q;
+  const r = E;
+  Q = e;
+  E = false;
+  try {
+    return t();
+  } finally {
+    Q = n;
+    E = r;
+  }
 }
-function createOwner(e) {
-  const t = H;
-  const n = {
-    id: e?.id ?? (t?.id != null ? getNextChildId(t) : undefined),
-    i: true,
-    l: t?.i ? t.l : t,
-    _e: null,
-    We: null,
-    Se: null,
-    pe: t?.pe ?? E,
-    Le: t?.Le || w,
-    je: 0,
-    we: null,
-    me: null,
-    o: t,
-    dispose(e = true) {
-      disposeChildren(n, e);
+function getPendingSignal(e) {
+  if (!e.Te) {
+    e.Te = optimisticSignal(false, { pureWrite: true });
+    if (e.de) {
+      e.Te.de = e;
     }
-  };
-  if (t) {
-    const e = t._e;
-    if (e === null) {
-      t._e = n;
-    } else {
-      n.We = e;
-      t._e = n;
+    if (computePendingState(e)) setSignal(e.Te, true);
+  }
+  return e.Te;
+}
+function computePendingState(e) {
+  const t = e;
+  if (e.ge && e.fe !== y) {
+    if (t.ce & l && !(t.ce & a)) return true;
+    if (e.de) {
+      const t = e.re ? findLane(e.re) : null;
+      return !!(t && t.T.size > 0);
     }
+    return true;
   }
-  return n;
+  if (e.fe !== y && !(t.ce & a)) return true;
+  return !!(t.ce & l && !(t.ce & a));
 }
-function createRoot(e, t) {
-  const n = createOwner(t);
-  return runWithOwner(n, () => e(n.dispose));
+function updatePendingSignal(e) {
+  if (e.Te) {
+    const t = computePendingState(e);
+    const n = e.Te;
+    setSignal(n, t);
+    if (!t && n.re) {
+      const t = resolveLane(e);
+      if (t && t.T.size > 0) {
+        const e = findLane(n.re);
+        if (e !== t) {
+          mergeLanes(t, e);
+        }
+      }
+      k.delete(n);
+      n.re = undefined;
+    }
+  }
 }
-function runWithOwner(e, t) {
-  const n = H;
-  const r = W;
-  H = e;
-  W = false;
-  try {
-    return t();
-  } finally {
-    H = n;
-    W = r;
+function getPendingValueComputed(e) {
+  if (!e.me) {
+    const t = H;
+    H = false;
+    const n = L;
+    L = false;
+    const r = Q;
+    Q = null;
+    e.me = optimisticComputed(() => read(e));
+    e.me.de = e;
+    Q = r;
+    L = n;
+    H = t;
   }
+  return e.me;
 }
 function staleValues(e, t = true) {
   const n = j;
@@ -1313,27 +1346,27 @@ function staleValues(e, t = true) {
   }
 }
 function pending(e) {
-  const t = I;
-  I = true;
+  const t = H;
+  H = true;
   try {
     return e();
   } finally {
-    I = t;
+    H = t;
   }
 }
 function isPending(e) {
   const t = L;
-  const n = Q;
+  const n = I;
   L = true;
-  Q = false;
+  I = false;
   try {
     e();
-    return Q;
+    return I;
   } catch {
-    return Q;
+    return I;
   } finally {
     L = t;
-    Q = n;
+    I = n;
   }
 }
 function refresh(e) {
@@ -1362,7 +1395,7 @@ function getContext(e, t = getOwner()) {
   if (!t) {
     throw new NoOwnerError();
   }
-  const n = hasContext(e, t) ? t.Le[e.id] : e.defaultValue;
+  const n = hasContext(e, t) ? t.Ne[e.id] : e.defaultValue;
   if (isUndefined(n)) {
     throw new ContextNotFoundError();
   }
@@ -1372,93 +1405,57 @@ function setContext(e, t, n = getOwner()) {
   if (!n) {
     throw new NoOwnerError();
   }
-  n.Le = { ...n.Le, [e.id]: isUndefined(t) ? e.defaultValue : t };
+  n.Ne = { ...n.Ne, [e.id]: isUndefined(t) ? e.defaultValue : t };
 }
 function hasContext(e, t) {
-  return !isUndefined(t?.Le[e.id]);
+  return !isUndefined(t?.Ne[e.id]);
 }
 function isUndefined(e) {
   return typeof e === "undefined";
 }
-function effect(e, t, n, r, i) {
-  let s = false;
-  const o = computed(i?.render ? t => staleValues(() => e(t)) : e, r, {
-    ...i,
-    equals: () => {
-      o.de = !o.oe;
-      if (s) o.pe.enqueue(o.ae, runEffect.bind(o));
-      return false;
-    },
-    lazy: true
-  });
-  o.Ie = r;
-  o.He = t;
-  o.Re = n;
-  o.Te = undefined;
-  o.ae = i?.render ? d : p;
-  o.Pe = (e, t) => {
-    const n = e !== undefined ? e : o.ge;
-    const r = t !== undefined ? t : o.oe;
-    if (n & c) {
-      let e = r;
-      o.pe.notify(o, l, 0);
-      if (o.ae === p) {
+function restoreTransition(e, t) {
+  A.initTransition(e);
+  const n = t();
+  flush();
+  return n;
+}
+function action(e) {
+  return (...t) =>
+    new Promise((n, r) => {
+      const i = e(...t);
+      A.initTransition();
+      let s = x;
+      s.ee.push(i);
+      const done = (e, t) => {
+        s = currentTransition(s);
+        const o = s.ee.indexOf(i);
+        if (o >= 0) s.ee.splice(o, 1);
+        setActiveTransition(s);
+        schedule();
+        t ? r(t) : n(e);
+      };
+      const step = (e, t) => {
+        let n;
         try {
-          return o.Re
-            ? o.Re(e, () => {
-                o.Te?.();
-                o.Te = undefined;
-              })
-            : console.error(e);
-        } catch (t) {
-          e = t;
+          n = t ? i.throw(e) : i.next(e);
+        } catch (e) {
+          return done(undefined, e);
         }
-      }
-      if (!o.pe.notify(o, c, c)) throw e;
-    } else if (o.ae === d) o.pe.notify(o, l | c, n, r);
-  };
-  recompute(o, true);
-  !i?.defer && (o.ae === p ? o.pe.enqueue(o.ae, runEffect.bind(o)) : runEffect.call(o));
-  s = true;
-  onCleanup(() => o.Te?.());
-}
-function runEffect() {
-  if (!this.de || this._ & u) return;
-  this.Te?.();
-  this.Te = undefined;
-  try {
-    this.Te = this.He(this.ye, this.Ie);
-  } catch (e) {
-    if (!this.pe.notify(this, c, c)) throw e;
-  } finally {
-    this.Ie = this.ye;
-    this.de = false;
-  }
-}
-function trackedEffect(e, t) {
-  const run = () => {
-    if (!n.de || n._ & u) return;
-    n.de = false;
-    recompute(n);
-  };
-  const n = computed(
-    () => {
-      try {
-        n.Te?.();
-        n.Te = undefined;
-        n.Te = staleValues(e) || undefined;
-      } finally {
-      }
-    },
-    undefined,
-    { ...t, lazy: true, pureWrite: true }
-  );
-  n.Te = undefined;
-  n.de = true;
-  n.ae = h;
-  n.he = run;
-  n.pe.enqueue(p, run);
-  onCleanup(() => n.Te?.());
+        if (n instanceof Promise)
+          return void n.then(run, e => restoreTransition(s, () => step(e, true)));
+        run(n);
+      };
+      const run = e => {
+        if (e.done) return done(e.value);
+        if (e.value instanceof Promise)
+          return void e.value.then(
+            e => restoreTransition(s, () => step(e)),
+            e => restoreTransition(s, () => step(e, true))
+          );
+        restoreTransition(s, () => step(e.value));
+      };
+      step();
+    });
 }
 function createSignal(e, t, n) {
   if (typeof e === "function") {
@@ -1523,7 +1520,7 @@ function createOptimistic(e, t, n) {
 function onSettled(e) {
   getOwner()
     ? createTrackedEffect(() => untrack(e))
-    : E.enqueue(p, () => {
+    : A.enqueue(p, () => {
         const t = e();
         t?.();
       });
@@ -1531,7 +1528,8 @@ function onSettled(e) {
 function unwrap(e) {
   return e?.[F]?.[U] ?? e;
 }
-function getOverrideValue(e, t, n, r) {
+function getOverrideValue(e, t, n, r, i) {
+  if (i && r in i) return i[r];
   return t && r in t ? t[r] : e[r];
 }
 function getAllKeys(e, t, n) {
@@ -1544,108 +1542,110 @@ function applyState(e, t, n, r) {
   if (!i) return;
   const s = i[G];
   const o = i[K];
-  let u = i[U];
-  if (e === s && !o) return;
+  const u = i[z];
+  let f = i[U];
+  if (e === s && !o && !u) return;
   (i[Y] || ee).set(e, i[V]);
   i[G] = e;
   i[K] = undefined;
   if (Array.isArray(s)) {
     let t = false;
-    const f = getOverrideValue(s, o, u, "length");
-    if (e.length && f && e[0] && n(e[0]) != null) {
-      let l, c, a, d, p, h, y, g;
+    const l = getOverrideValue(s, o, f, "length", u);
+    if (e.length && l && e[0] && n(e[0]) != null) {
+      let c, a, d, p, h, y, g, w;
       for (
-        a = 0, d = Math.min(f, e.length);
-        a < d && ((h = getOverrideValue(s, o, u, a)) === e[a] || (h && e[a] && n(h) === n(e[a])));
-        a++
+        d = 0, p = Math.min(l, e.length);
+        d < p &&
+        ((y = getOverrideValue(s, o, f, d, u)) === e[d] || (y && e[d] && n(y) === n(e[d])));
+        d++
       ) {
-        applyState(e[a], wrap(h, i), n, r);
+        applyState(e[d], wrap(y, i), n, r);
       }
-      const w = new Array(e.length),
-        S = new Map();
+      const S = new Array(e.length),
+        m = new Map();
       for (
-        d = f - 1, p = e.length - 1;
-        d >= a &&
-        p >= a &&
-        ((h = getOverrideValue(s, o, u, d)) === e[p] || (h && e[p] && n(h) === n(e[p])));
-        d--, p--
+        p = l - 1, h = e.length - 1;
+        p >= d &&
+        h >= d &&
+        ((y = getOverrideValue(s, o, f, p, u)) === e[h] || (y && e[h] && n(y) === n(e[h])));
+        p--, h--
       ) {
-        w[p] = h;
+        S[h] = y;
       }
-      if (a > p || a > d) {
-        for (c = a; c <= p; c++) {
+      if (d > h || d > p) {
+        for (a = d; a <= h; a++) {
           t = true;
-          i[U][c] && setSignal(i[U][c], wrap(e[c], i));
+          i[U][a] && setSignal(i[U][a], wrap(e[a], i));
         }
-        for (; c < e.length; c++) {
+        for (; a < e.length; a++) {
           t = true;
-          const s = wrap(w[c], i);
-          i[U][c] && setSignal(i[U][c], s);
-          applyState(e[c], s, n, r);
+          const s = wrap(S[a], i);
+          i[U][a] && setSignal(i[U][a], s);
+          applyState(e[a], s, n, r);
         }
         t && i[U][M] && setSignal(i[U][M], void 0);
-        f !== e.length && i[U].length && setSignal(i[U].length, e.length);
+        l !== e.length && i[U].length && setSignal(i[U].length, e.length);
         return;
       }
-      y = new Array(p + 1);
-      for (c = p; c >= a; c--) {
-        h = e[c];
-        g = h ? n(h) : h;
-        l = S.get(g);
-        y[c] = l === undefined ? -1 : l;
-        S.set(g, c);
-      }
-      for (l = a; l <= d; l++) {
-        h = getOverrideValue(s, o, u, l);
-        g = h ? n(h) : h;
-        c = S.get(g);
-        if (c !== undefined && c !== -1) {
-          w[c] = h;
-          c = y[c];
-          S.set(g, c);
+      g = new Array(h + 1);
+      for (a = h; a >= d; a--) {
+        y = e[a];
+        w = y ? n(y) : y;
+        c = m.get(w);
+        g[a] = c === undefined ? -1 : c;
+        m.set(w, a);
+      }
+      for (c = d; c <= p; c++) {
+        y = getOverrideValue(s, o, f, c, u);
+        w = y ? n(y) : y;
+        a = m.get(w);
+        if (a !== undefined && a !== -1) {
+          S[a] = y;
+          a = g[a];
+          m.set(w, a);
         }
       }
-      for (c = a; c < e.length; c++) {
-        if (c in w) {
-          const t = wrap(w[c], i);
-          i[U][c] && setSignal(i[U][c], t);
-          applyState(e[c], t, n, r);
-        } else i[U][c] && setSignal(i[U][c], wrap(e[c], i));
+      for (a = d; a < e.length; a++) {
+        if (a in S) {
+          const t = wrap(S[a], i);
+          i[U][a] && setSignal(i[U][a], t);
+          applyState(e[a], t, n, r);
+        } else i[U][a] && setSignal(i[U][a], wrap(e[a], i));
       }
-      if (a < e.length) t = true;
+      if (d < e.length) t = true;
     } else if (e.length) {
-      for (let t = 0, f = e.length; t < f; t++) {
-        const f = getOverrideValue(s, o, u, t);
-        isWrappable(f) ? applyState(e[t], wrap(f, i), n, r) : i[U][t] && setSignal(i[U][t], e[t]);
+      for (let t = 0, l = e.length; t < l; t++) {
+        const l = getOverrideValue(s, o, f, t, u);
+        isWrappable(l) ? applyState(e[t], wrap(l, i), n, r) : i[U][t] && setSignal(i[U][t], e[t]);
       }
     }
-    if (f !== e.length) {
+    if (l !== e.length) {
       t = true;
       i[U].length && setSignal(i[U].length, e.length);
     }
     t && i[U][M] && setSignal(i[U][M], void 0);
     return;
   }
-  if (u) {
-    const t = u[M];
-    const f = t || r ? getAllKeys(s, o, e) : Object.keys(u);
-    for (let l = 0, c = f.length; l < c; l++) {
-      const c = f[l];
-      const a = u[c];
-      const d = unwrap(getOverrideValue(s, o, u, c));
-      let p = unwrap(e[c]);
-      if (d === p) continue;
-      if (!d || !isWrappable(d) || !isWrappable(p) || (n(d) != null && n(d) !== n(p))) {
+  if (f) {
+    const t = f[M];
+    const l = t || r ? getAllKeys(s, o, e) : Object.keys(f);
+    for (let c = 0, a = l.length; c < a; c++) {
+      const a = l[c];
+      const d = f[a];
+      const p = unwrap(getOverrideValue(s, o, f, a, u));
+      let h = unwrap(e[a]);
+      if (p === h) continue;
+      if (!p || !isWrappable(p) || !isWrappable(h) || (n(p) != null && n(p) !== n(h))) {
         t && setSignal(t, void 0);
-        a && setSignal(a, isWrappable(p) ? wrap(p, i) : p);
-      } else applyState(p, wrap(d, i), n, r);
+        d && setSignal(d, isWrappable(h) ? wrap(h, i) : h);
+      } else applyState(h, wrap(p, i), n, r);
     }
   }
-  if ((u = i[J])) {
-    const t = Object.keys(u);
+  if ((f = i[J])) {
+    const t = Object.keys(f);
     for (let n = 0, r = t.length; n < r; n++) {
       const r = t[n];
-      setSignal(u[r], r in e);
+      setSignal(f[r], r in e);
     }
   }
 }
@@ -1690,7 +1690,7 @@ function createProjectionInternal(e, t = {}, n) {
       i !== r && i !== undefined && reconcile(i, n?.key || "id", n?.all)(s);
     });
   });
-  r.Ee = true;
+  r.Qe = true;
   return { store: s, node: r };
 }
 function createProjection(e, t = {}, n) {
@@ -1736,8 +1736,8 @@ const M = Symbol(0),
   q = Symbol(0),
   F = Symbol(0),
   V = Symbol(0),
-  B = Symbol(0);
-const D = new WeakMap();
+  D = Symbol(0);
+const B = new WeakMap();
 const G = "v",
   K = "o",
   z = "x",
@@ -1790,7 +1790,7 @@ function getNode(e, t, n, r, i = isEqual, s) {
     },
     r
   );
-  if (s) o.U = true;
+  if (s) o.ge = true;
   return (e[t] = o);
 }
 function trackSelf(e, t = M) {
@@ -1802,7 +1802,7 @@ function getKeys(e, t, n = true) {
   const i = new Set(r);
   const s = Reflect.ownKeys(t);
   for (const e of s) {
-    if (t[e] !== B) i.add(e);
+    if (t[e] !== D) i.add(e);
     else i.delete(e);
   }
   return Array.from(i);
@@ -1810,7 +1810,7 @@ function getKeys(e, t, n = true) {
 function getPropertyDescriptor(e, t, n) {
   let r = e;
   if (t && n in t) {
-    if (r[n] === B) return void 0;
+    if (r[n] === D) return void 0;
     if (!(n in r)) r = t;
   }
   return Reflect.getOwnPropertyDescriptor(r, n);
@@ -1836,15 +1836,15 @@ const re = {
       if (e && e.get) return e.get.call(n);
     }
     if (writeOnly(n)) {
-      let n = i && (o || !u) ? (i.J !== y ? (i.U ? i.ye : i.J) : i.ye) : f[t];
-      n === B && (n = undefined);
+      let n = i && (o || !u) ? (i.fe !== y ? (i.ge ? i.le : i.fe) : i.le) : f[t];
+      n === D && (n = undefined);
       if (!isWrappable(n)) return n;
       const r = wrap(n, e);
       ne?.add(r);
       return r;
     }
     let l = i ? (o || !u ? read(r[t]) : (read(r[t]), f[t])) : f[t];
-    l === B && (l = undefined);
+    l === D && (l = undefined);
     if (!i) {
       if (!o && typeof l === "function" && !f.hasOwnProperty(t)) {
         let t;
@@ -1859,7 +1859,7 @@ const re = {
   },
   has(e, t) {
     if (t === V || t === M || t === "__proto__") return true;
-    const n = e[z] && t in e[z] ? e[z][t] !== B : e[K] && t in e[K] ? e[K][t] !== B : t in e[G];
+    const n = e[z] && t in e[z] ? e[z][t] !== D : e[K] && t in e[K] ? e[K][t] !== D : t in e[G];
     getObserver() && read(getNode(getNodes(e, J), t, n, e[Z], isEqual, e[$]));
     return n;
   },
@@ -1868,8 +1868,8 @@ const re = {
     if (writeOnly(r)) {
       if (e[$]) {
         const t = e[Z];
-        if (t?.B) {
-          E.initTransition(t.B);
+        if (t?.ne) {
+          A.initTransition(t.ne);
         }
       }
       untrack(() => {
@@ -1886,8 +1886,8 @@ const re = {
         else (e[u] || (e[u] = Object.create(null)))[t] = l;
         const a = isWrappable(l);
         if (isWrappable(f)) {
-          const e = D.get(f);
-          e && (e instanceof Set ? e.delete(r) : D.delete(f));
+          const e = B.get(f);
+          e && (e instanceof Set ? e.delete(r) : B.delete(f));
         }
         if (recursivelyNotify(r, ee) && a) recursivelyAddParent(l, r);
         e[J]?.[t] && setSignal(e[J][t], true);
@@ -1907,8 +1907,8 @@ const re = {
     return true;
   },
   deleteProperty(e, t) {
-    const n = e[z]?.[t] === B;
-    const r = e[K]?.[t] === B;
+    const n = e[z]?.[t] === D;
+    const r = e[K]?.[t] === D;
     if (writeOnly(e[V]) && !n && !r) {
       untrack(() => {
         const n = e[$] && !P;
@@ -1916,13 +1916,13 @@ const re = {
         if (n) trackOptimisticStore(e[V]);
         const i = e[z] && t in e[z] ? e[z][t] : e[K] && t in e[K] ? e[K][t] : e[G][t];
         if (t in e[G] || (e[K] && t in e[K])) {
-          (e[r] || (e[r] = Object.create(null)))[t] = B;
+          (e[r] || (e[r] = Object.create(null)))[t] = D;
         } else if (e[r] && t in e[r]) {
           delete e[r][t];
         } else return true;
         if (isWrappable(i)) {
-          const t = D.get(i);
-          t && (t instanceof Set ? t.delete(e) : D.delete(i));
+          const t = B.get(i);
+          t && (t instanceof Set ? t.delete(e) : B.delete(i));
         }
         if (e[J]?.[t]) setSignal(e[J][t], false);
         const s = getNodes(e, U);
@@ -1938,7 +1938,7 @@ const re = {
     if (e[z]) {
       const n = new Set(t);
       for (const t of Reflect.ownKeys(e[z])) {
-        if (e[z][t] !== B) n.add(t);
+        if (e[z][t] !== D) n.add(t);
         else n.delete(t);
       }
       t = Array.from(n);
@@ -1948,7 +1948,7 @@ const re = {
   getOwnPropertyDescriptor(e, t) {
     if (t === V) return { value: e[V], writable: true, configurable: true };
     if (e[z] && t in e[z]) {
-      if (e[z][t] === B) return undefined;
+      if (e[z][t] === D) return undefined;
       const n = getPropertyDescriptor(e[G], e[K], t);
       if (n) {
         return { ...n, value: e[z][t] };
@@ -2000,7 +2000,7 @@ function recursivelyNotify(e, t) {
     }
     t = n[Y] || t;
   }
-  const i = D.get(n?.[G] || e);
+  const i = B.get(n?.[G] || e);
   if (!i) return r;
   if (i instanceof Set) {
     for (let e of i) r = recursivelyNotify(e, t) || r;
@@ -2015,10 +2015,10 @@ function recursivelyAddParent(e, t) {
     e = r[G];
   }
   if (t) {
-    let n = D.get(e);
-    if (!n) D.set(e, t);
+    let n = B.get(e);
+    if (!n) B.set(e, t);
     else if (n !== t) {
-      if (!(n instanceof Set)) D.set(e, (n = new Set([n])));
+      if (!(n instanceof Set)) B.set(e, (n = new Set([n])));
       else if (n.has(t)) return;
       n.add(t);
     } else return;
@@ -2043,7 +2043,7 @@ function deep(e) {
   return e[q];
 }
 function createOptimisticStore(e, t, n) {
-  GlobalQueue.ie ||= clearOptimisticStore;
+  GlobalQueue.J ||= clearOptimisticStore;
   const r = typeof e === "function";
   const i = (r ? t : e) ?? {};
   const s = r ? e : undefined;
@@ -2060,14 +2060,14 @@ function clearOptimisticStore(e) {
     if (r) {
       for (const e of Reflect.ownKeys(n)) {
         if (r[e]) {
-          r[e].M = undefined;
+          r[e].re = undefined;
           const n = t[K] && e in t[K] ? t[K][e] : t[G][e];
-          const i = n === B ? undefined : n;
+          const i = n === D ? undefined : n;
           setSignal(r[e], isWrappable(i) ? wrap(i, t) : i);
         }
       }
       if (r[M]) {
-        r[M].M = undefined;
+        r[M].re = undefined;
         setSignal(r[M], undefined);
       }
     }
@@ -2118,7 +2118,7 @@ function createOptimisticProjectionInternal(e, t = {}, n) {
         setProjectionWriteActive(false);
       }
     });
-    r.Ee = true;
+    r.Qe = true;
   }
   return { store: s, node: r };
 }
@@ -2141,7 +2141,7 @@ function snapshot(e, t, n) {
     const r = s?.length || e.length;
     for (let i = 0; i < r; i++) {
       f = s && i in s ? s[i] : e[i];
-      if (f === B) continue;
+      if (f === D) continue;
       if ((u = snapshot(f, t, n)) !== f || o) {
         if (!o) t.set(e, (o = [...e]));
         o[i] = u;
@@ -2303,8 +2303,8 @@ function mapArray(e, t, n) {
       qe: 0,
       Fe: e,
       Ve: [],
-      Be: t,
-      De: [],
+      De: t,
+      Be: [],
       Ge: [],
       Ke: r,
       ze: r || n?.keyed === false ? [] : undefined,
@@ -2325,7 +2325,7 @@ function updateKeyedMap() {
         ? () => {
             this.ze[r] = signal(e[r], oe);
             this.Ue && (this.Ue[r] = signal(r, oe));
-            return this.Be(
+            return this.De(
               read.bind(null, this.ze[r]),
               this.Ue ? read.bind(null, this.Ue[r]) : undefined
             );
@@ -2334,31 +2334,31 @@ function updateKeyedMap() {
           ? () => {
               const t = e[r];
               this.Ue[r] = signal(r, oe);
-              return this.Be(() => t, read.bind(null, this.Ue[r]));
+              return this.De(() => t, read.bind(null, this.Ue[r]));
             }
           : () => {
               const t = e[r];
-              return this.Be(() => t);
+              return this.De(() => t);
             };
     if (t === 0) {
       if (this.qe !== 0) {
         this.Me.dispose(false);
         this.Ge = [];
         this.Ve = [];
-        this.De = [];
+        this.Be = [];
         this.qe = 0;
         this.ze && (this.ze = []);
         this.Ue && (this.Ue = []);
       }
-      if (this.Je && !this.De[0]) {
-        this.De[0] = runWithOwner((this.Ge[0] = createOwner()), this.Je);
+      if (this.Je && !this.Be[0]) {
+        this.Be[0] = runWithOwner((this.Ge[0] = createOwner()), this.Je);
       }
     } else if (this.qe === 0) {
       if (this.Ge[0]) this.Ge[0].dispose();
-      this.De = new Array(t);
+      this.Be = new Array(t);
       for (r = 0; r < t; r++) {
         this.Ve[r] = e[r];
-        this.De[r] = runWithOwner((this.Ge[r] = createOwner()), i);
+        this.Be[r] = runWithOwner((this.Ge[r] = createOwner()), i);
       }
       this.qe = t;
     } else {
@@ -2387,7 +2387,7 @@ function updateKeyedMap() {
         (this.Ve[o] === e[u] || (this.ze && compare(this.Ke, this.Ve[o], e[u])));
         o--, u--
       ) {
-        d[u] = this.De[o];
+        d[u] = this.Be[o];
         p[u] = this.Ge[o];
         h && (h[u] = this.ze[o]);
         y && (y[u] = this.Ue[o]);
@@ -2406,7 +2406,7 @@ function updateKeyedMap() {
         l = this.Ke ? this.Ke(f) : f;
         r = c.get(l);
         if (r !== undefined && r !== -1) {
-          d[r] = this.De[n];
+          d[r] = this.Be[n];
           p[r] = this.Ge[n];
           h && (h[r] = this.ze[n]);
           y && (y[r] = this.Ue[n]);
@@ -2416,7 +2416,7 @@ function updateKeyedMap() {
       }
       for (r = s; r < t; r++) {
         if (r in d) {
-          this.De[r] = d[r];
+          this.Be[r] = d[r];
           this.Ge[r] = p[r];
           if (h) {
             this.ze[r] = h[r];
@@ -2427,14 +2427,14 @@ function updateKeyedMap() {
             setSignal(this.Ue[r], r);
           }
         } else {
-          this.De[r] = runWithOwner((this.Ge[r] = createOwner()), i);
+          this.Be[r] = runWithOwner((this.Ge[r] = createOwner()), i);
         }
       }
-      this.De = this.De.slice(0, (this.qe = t));
+      this.Be = this.Be.slice(0, (this.qe = t));
       this.Ve = e.slice(0);
     }
   });
-  return this.De;
+  return this.Be;
 }
 function repeat(e, t, n) {
   return updateRepeat.bind({
@@ -2442,9 +2442,9 @@ function repeat(e, t, n) {
     qe: 0,
     Xe: 0,
     Ye: e,
-    Be: t,
+    De: t,
     Ge: [],
-    De: [],
+    Be: [],
     Ze: n?.from,
     Je: n?.fallback
   });
@@ -2457,11 +2457,11 @@ function updateRepeat() {
       if (this.qe !== 0) {
         this.Me.dispose(false);
         this.Ge = [];
-        this.De = [];
+        this.Be = [];
         this.qe = 0;
       }
-      if (this.Je && !this.De[0]) {
-        this.De[0] = runWithOwner((this.Ge[0] = createOwner()), this.Je);
+      if (this.Je && !this.Be[0]) {
+        this.Be[0] = runWithOwner((this.Ge[0] = createOwner()), this.Je);
       }
       return;
     }
@@ -2473,147 +2473,96 @@ function updateRepeat() {
       let e = this.Xe;
       while (e < t && e < this.qe) this.Ge[e++].dispose();
       this.Ge.splice(0, t - this.Xe);
-      this.De.splice(0, t - this.Xe);
+      this.Be.splice(0, t - this.Xe);
     } else if (this.Xe > t) {
       let n = r - this.Xe - 1;
       let i = this.Xe - t;
-      this.Ge.length = this.De.length = e;
+      this.Ge.length = this.Be.length = e;
       while (n >= i) {
         this.Ge[n] = this.Ge[n - i];
-        this.De[n] = this.De[n - i];
+        this.Be[n] = this.Be[n - i];
         n--;
       }
       for (let e = 0; e < i; e++) {
-        this.De[e] = runWithOwner((this.Ge[e] = createOwner()), () => this.Be(e + t));
+        this.Be[e] = runWithOwner((this.Ge[e] = createOwner()), () => this.De(e + t));
       }
     }
     for (let e = r; e < n; e++) {
-      this.De[e - t] = runWithOwner((this.Ge[e - t] = createOwner()), () => this.Be(e));
+      this.Be[e - t] = runWithOwner((this.Ge[e - t] = createOwner()), () => this.De(e));
     }
-    this.De = this.De.slice(0, e);
+    this.Be = this.Be.slice(0, e);
     this.Xe = t;
     this.qe = e;
   });
-  return this.De;
+  return this.Be;
 }
 function compare(e, t, n) {
   return e ? e(t) === e(n) : true;
 }
 function boundaryComputed(e, t) {
   const n = computed(e, undefined, { lazy: true });
-  n.Pe = (e, t) => {
-    const r = e !== undefined ? e : n.ge;
-    const i = t !== undefined ? t : n.oe;
-    n.ge &= ~n.$e;
-    n.pe.notify(n, n.$e, r, i);
+  n.be = (e, t) => {
+    const r = e !== undefined ? e : n.ce;
+    const i = t !== undefined ? t : n.Y;
+    n.ce &= ~n.$e;
+    n.oe.notify(n, n.$e, r, i);
   };
   n.$e = t;
-  n.Ee = true;
+  n.Qe = true;
   recompute(n, true);
   return n;
 }
 function createBoundChildren(e, t, n, r) {
-  const i = e.pe;
-  i.addChild((e.pe = n));
-  onCleanup(() => i.removeChild(e.pe));
+  const i = e.oe;
+  i.addChild((e.oe = n));
+  onCleanup(() => i.removeChild(e.oe));
   return runWithOwner(e, () => {
     const e = computed(t);
     return boundaryComputed(() => staleValues(() => flatten(read(e))), r);
   });
 }
-class ConditionalQueue extends Queue {
+class CollectionQueue extends Queue {
   et;
   tt = new Set();
-  $ = new Set();
+  nt = signal(false, { pureWrite: true });
+  rt = false;
   constructor(e) {
     super();
     this.et = e;
   }
   run(e) {
-    if (!e || read(this.et)) return;
+    if (!e || read(this.nt)) return;
     return super.run(e);
   }
   notify(e, t, n, r) {
-    if (read(this.et)) {
-      if (t & l) {
-        if (n & l) {
-          this.$.add(e);
-          t &= ~l;
-        } else if (this.$.delete(e)) t &= ~l;
-      }
-      if (t & c) {
-        if (n & c) {
-          this.tt.add(e);
-          t &= ~c;
-        } else if (this.tt.delete(e)) t &= ~c;
-      }
-    }
-    return t ? super.notify(e, t, n, r ?? e.oe) : true;
-  }
-}
-class CollectionQueue extends Queue {
-  nt;
-  rt = new Set();
-  et = signal(false, { pureWrite: true });
-  it = false;
-  constructor(e) {
-    super();
-    this.nt = e;
-  }
-  run(e) {
-    if (!e || read(this.et)) return;
-    return super.run(e);
-  }
-  notify(e, t, n, r) {
-    if (!(t & this.nt) || (this.nt & l && this.it)) return super.notify(e, t, n, r);
-    if (n & this.nt) {
-      const t = r?.t || e.oe?.t;
+    if (!(t & this.et) || (this.et & l && this.rt)) return super.notify(e, t, n, r);
+    if (n & this.et) {
+      const t = r?.source || e.Y?.source;
       if (t) {
-        const e = this.rt.size === 0;
-        this.rt.add(t);
-        if (e) setSignal(this.et, true);
+        const e = this.tt.size === 0;
+        this.tt.add(t);
+        if (e) setSignal(this.nt, true);
       }
     }
-    t &= ~this.nt;
+    t &= ~this.et;
     return t ? super.notify(e, t, n, r) : true;
   }
   checkSources() {
-    for (const e of this.rt) {
-      if (!(e.ge & this.nt)) this.rt.delete(e);
-    }
-    if (!this.rt.size) setSignal(this.et, false);
-  }
-}
-var ue;
-(function (e) {
-  e["VISIBLE"] = "visible";
-  e["HIDDEN"] = "hidden";
-})(ue || (ue = {}));
-function createBoundary(e, t) {
-  const n = createOwner();
-  const r = new ConditionalQueue(computed(() => t() === ue.HIDDEN));
-  const i = createBoundChildren(n, e, r, 0);
-  computed(() => {
-    const e = read(r.et);
-    i.$e = e ? c | l : 0;
-    if (!e) {
-      r.$.forEach(e => r.notify(e, l, l, e.oe));
-      r.tt.forEach(e => r.notify(e, c, c, e.oe));
-      r.$.clear();
-      r.tt.clear();
+    for (const e of this.tt) {
+      if (!(e.ce & this.et)) this.tt.delete(e);
     }
-  });
-  return () => (read(r.et) ? undefined : read(i));
+    if (!this.tt.size) setSignal(this.nt, false);
+  }
 }
 function createCollectionBoundary(e, t, n) {
   const r = createOwner();
   const i = new CollectionQueue(e);
   const s = createBoundChildren(r, t, i, e);
   const o = computed(() => {
-    if (!read(i.et)) {
+    if (!read(i.nt)) {
       const e = read(s);
-      if (!untrack(() => read(i.et))) {
-        i.it = true;
+      if (!untrack(() => read(i.nt))) {
+        i.rt = true;
         return e;
       }
     }
@@ -2626,10 +2575,10 @@ function createLoadBoundary(e, t) {
 }
 function createErrorBoundary(e, t) {
   return createCollectionBoundary(c, e, e => {
-    let n = e.rt.values().next().value;
-    const r = n.oe?.cause ?? n.oe;
+    let n = e.tt.values().next().value;
+    const r = n.Y?.cause ?? n.Y;
     return t(r, () => {
-      for (const t of e.rt) recompute(t);
+      for (const t of e.tt) recompute(t);
       schedule();
     });
   });
@@ -2691,7 +2640,6 @@ exports.NoOwnerError = NoOwnerError;
 exports.NotReadyError = NotReadyError;
 exports.SUPPORTS_PROXY = g;
 exports.action = action;
-exports.createBoundary = createBoundary;
 exports.createContext = createContext;
 exports.createEffect = createEffect;
 exports.createErrorBoundary = createErrorBoundary;
@@ -2699,6 +2647,7 @@ exports.createLoadBoundary = createLoadBoundary;
 exports.createMemo = createMemo;
 exports.createOptimistic = createOptimistic;
 exports.createOptimisticStore = createOptimisticStore;
+exports.createOwner = createOwner;
 exports.createProjection = createProjection;
 exports.createReaction = createReaction;
 exports.createRenderEffect = createRenderEffect;