@solidjs/signals 0.8.2 → 0.8.3

package/dist/node.cjs

@@ -27,13 +27,13 @@ var SUPPORTS_PROXY = typeof Proxy === "function";
 // src/core/heap.ts
 function actualInsertIntoHeap(n, heap) {
   var _a, _b, _c;
-  const parentHeight = (((_a = n.w) == null ? void 0 : _a._) ? (_b = n.w.$) == null ? void 0 : _b.c : (_c = n.w) == null ? void 0 : _c.c) ?? -1;
+  const parentHeight = (((_a = n.w) == null ? void 0 : _a.$) ? (_b = n.w.aa) == null ? void 0 : _b.c : (_c = n.w) == null ? void 0 : _c.c) ?? -1;
   if (parentHeight >= n.c)
     n.c = parentHeight + 1;
   const height = n.c;
-  const heapAtHeight = heap.r[height];
+  const heapAtHeight = heap.s[height];
   if (heapAtHeight === void 0) {
-    heap.r[height] = n;
+    heap.s[height] = n;
   } else {
     const tail = heapAtHeight.z;
     tail.Q = n;
@@ -70,13 +70,13 @@ function deleteFromHeap(n, heap) {
   n.b = flags & ~(8 /* InHeap */ | 16 /* InHeapHeight */);
   const height = n.c;
   if (n.z === n) {
-    heap.r[height] = void 0;
+    heap.s[height] = void 0;
   } else {
     const next = n.Q;
-    const dhh = heap.r[height];
+    const dhh = heap.s[height];
     const end = next ?? dhh;
     if (n === dhh) {
-      heap.r[height] = next;
+      heap.s[height] = next;
     } else {
       n.z.Q = next;
     }
@@ -86,11 +86,11 @@ function deleteFromHeap(n, heap) {
   n.Q = void 0;
 }
 function markHeap(heap) {
-  if (heap.aa)
+  if (heap.ba)
     return;
-  heap.aa = true;
+  heap.ba = true;
   for (let i = 0; i <= heap.L; i++) {
-    for (let el = heap.r[i]; el !== void 0; el = el.Q) {
+    for (let el = heap.s[i]; el !== void 0; el = el.Q) {
       if (el.b & 8 /* InHeap */)
         markNode(el);
     }
@@ -101,28 +101,28 @@ function markNode(el, newState = 2 /* Dirty */) {
   if ((flags & (1 /* Check */ | 2 /* Dirty */)) >= newState)
     return;
   el.b = flags & ~(1 /* Check */ | 2 /* Dirty */) | newState;
-  for (let link2 = el.s; link2 !== null; link2 = link2.A) {
+  for (let link2 = el.x; link2 !== null; link2 = link2.A) {
     markNode(link2.j, 1 /* Check */);
   }
-  if (el.ba !== null) {
-    for (let child = el.ba; child !== null; child = child.ra) {
-      for (let link2 = child.s; link2 !== null; link2 = link2.A) {
+  if (el.ca !== null) {
+    for (let child = el.ca; child !== null; child = child.sa) {
+      for (let link2 = child.x; link2 !== null; link2 = link2.A) {
         markNode(link2.j, 1 /* Check */);
       }
     }
   }
 }
 function runHeap(heap, recompute2) {
-  heap.aa = false;
-  for (heap.p = 0; heap.p <= heap.L; heap.p++) {
-    let el = heap.r[heap.p];
+  heap.ba = false;
+  for (heap.q = 0; heap.q <= heap.L; heap.q++) {
+    let el = heap.s[heap.q];
     while (el !== void 0) {
       if (el.b & 8 /* InHeap */)
         recompute2(el);
       else {
         adjustHeight(el, heap);
       }
-      el = heap.r[heap.p];
+      el = heap.s[heap.q];
     }
   }
   heap.L = 0;
@@ -130,10 +130,10 @@ function runHeap(heap, recompute2) {
 function adjustHeight(el, heap) {
   deleteFromHeap(el, heap);
   let newHeight = el.c;
-  for (let d = el.x; d; d = d.F) {
+  for (let d = el.l; d; d = d.E) {
     const dep1 = d.R;
-    const dep = "_owner" in dep1 ? dep1.B : dep1;
-    if ("_fn" in dep) {
+    const dep = dep1.ia || dep1;
+    if (dep.H) {
       if (dep.c >= newHeight) {
         newHeight = dep.c + 1;
       }
@@ -141,7 +141,7 @@ function adjustHeight(el, heap) {
   }
   if (el.c !== newHeight) {
     el.c = newHeight;
-    for (let s = el.s; s !== null; s = s.A) {
+    for (let s = el.x; s !== null; s = s.A) {
       insertIntoHeapHeight(s.j, heap);
     }
   }
@@ -150,41 +150,40 @@ function adjustHeight(el, heap) {
 // src/core/scheduler.ts
 var clock = 0;
 var activeTransition = null;
-var unobserved = [];
 var transitions = /* @__PURE__ */ new Set();
 var scheduled = false;
 function schedule() {
   if (scheduled)
     return;
   scheduled = true;
-  if (!globalQueue.ca)
+  if (!globalQueue.da)
     queueMicrotask(flush);
 }
 var dirtyQueue = {
-  r: new Array(2e3).fill(void 0),
-  aa: false,
-  p: 0,
+  s: new Array(2e3).fill(void 0),
+  ba: false,
+  q: 0,
   L: 0
 };
 var zombieQueue = {
-  r: new Array(2e3).fill(void 0),
-  aa: false,
-  p: 0,
+  s: new Array(2e3).fill(void 0),
+  ba: false,
+  q: 0,
   L: 0
 };
 var Queue = class {
   w = null;
   k = [[], []];
-  l = [];
+  m = [];
   created = clock;
   addChild(child) {
-    this.l.push(child);
+    this.m.push(child);
     child.w = this;
   }
   removeChild(child) {
-    const index = this.l.indexOf(child);
+    const index = this.m.indexOf(child);
     if (index >= 0) {
-      this.l.splice(index, 1);
+      this.m.splice(index, 1);
       child.w = null;
     }
   }
@@ -199,8 +198,8 @@ var Queue = class {
       this.k[type - 1] = [];
       runQueue(effects, type);
     }
-    for (let i = 0; i < this.l.length; i++) {
-      this.l[i].run(type);
+    for (let i = 0; i < this.m.length; i++) {
+      this.m[i].run(type);
     }
   }
   enqueue(type, fn) {
@@ -212,12 +211,12 @@ var Queue = class {
     stub.k[0].push(...this.k[0]);
     stub.k[1].push(...this.k[1]);
     this.k = [[], []];
-    for (let i = 0; i < this.l.length; i++) {
-      let child = this.l[i];
-      let childStub = stub.l[i];
+    for (let i = 0; i < this.m.length; i++) {
+      let child = this.m[i];
+      let childStub = stub.m[i];
       if (!childStub) {
-        childStub = { k: [[], []], l: [] };
-        stub.l[i] = childStub;
+        childStub = { k: [[], []], m: [] };
+        stub.m[i] = childStub;
       }
       child.stashQueues(childStub);
     }
@@ -225,23 +224,23 @@ var Queue = class {
   restoreQueues(stub) {
     this.k[0].push(...stub.k[0]);
     this.k[1].push(...stub.k[1]);
-    for (let i = 0; i < stub.l.length; i++) {
-      const childStub = stub.l[i];
-      let child = this.l[i];
+    for (let i = 0; i < stub.m.length; i++) {
+      const childStub = stub.m[i];
+      let child = this.m[i];
       if (child)
         child.restoreQueues(childStub);
     }
   }
 };
 var GlobalQueue = class _GlobalQueue extends Queue {
-  ca = false;
+  da = false;
   h = [];
   static S;
-  static ka;
+  static la;
   flush() {
-    if (this.ca)
+    if (this.da)
       return;
-    this.ca = true;
+    this.da = true;
     try {
       runHeap(dirtyQueue, _GlobalQueue.S);
       if (activeTransition) {
@@ -269,8 +268,8 @@ var GlobalQueue = class _GlobalQueue extends Queue {
           n.g = n.e;
           n.e = NOT_PENDING;
         }
-        if (n.ha)
-          _GlobalQueue.ka(n, false, true);
+        if (n.H)
+          _GlobalQueue.la(n, false, true);
       }
       globalQueue.h.length = 0;
       clock++;
@@ -278,15 +277,14 @@ var GlobalQueue = class _GlobalQueue extends Queue {
       this.run(1 /* Render */);
       this.run(2 /* User */);
     } finally {
-      this.ca = false;
-      unobserved.length && notifyUnobserved();
+      this.da = false;
     }
   }
   notify(node, mask, flags) {
     if (mask & 1 /* Pending */) {
       if (flags & 1 /* Pending */) {
-        if (activeTransition && !activeTransition.asyncNodes.includes(node.C.cause))
-          activeTransition.asyncNodes.push(node.C.cause);
+        if (activeTransition && !activeTransition.asyncNodes.includes(node.B.cause))
+          activeTransition.asyncNodes.push(node.B.cause);
       }
       return true;
     }
@@ -300,7 +298,7 @@ var GlobalQueue = class _GlobalQueue extends Queue {
         time: clock,
         pendingNodes: [],
         asyncNodes: [],
-        queueStash: { k: [[], []], l: [] }
+        queueStash: { k: [[], []], m: [] }
       };
     }
     transitions.add(activeTransition);
@@ -319,8 +317,8 @@ function runPending(pendingNodes, value) {
   for (let i = 0; i < p.length; i++) {
     const n = p[i];
     n.T = activeTransition;
-    if (n.H) {
-      n.H.da(value);
+    if (n.I) {
+      n.I.ea(value);
       needsReset = true;
     }
   }
@@ -346,19 +344,10 @@ function transitionComplete(transition) {
   }
   return done;
 }
-function notifyUnobserved() {
-  var _a, _b;
-  for (let i = 0; i < unobserved.length; i++) {
-    const source = unobserved[i];
-    if (!source.s)
-      (_b = (_a = unobserved[i]).sa) == null ? void 0 : _b.call(_a);
-  }
-  unobserved = [];
-}
 
 // src/core/core.ts
 GlobalQueue.S = recompute;
-GlobalQueue.ka = disposeChildren;
+GlobalQueue.la = disposeChildren;
 var tracking = false;
 var stale = false;
 var pendingValueCheck = false;
@@ -366,10 +355,10 @@ var pendingCheck = null;
 var context = null;
 var defaultContext = {};
 function notifySubs(node) {
-  for (let s = node.s; s !== null; s = s.A) {
+  for (let s = node.x; s !== null; s = s.A) {
     const queue = s.j.b & 32 /* Zombie */ ? zombieQueue : dirtyQueue;
-    if (queue.p > s.j.c)
-      queue.p = s.j.c;
+    if (queue.q > s.j.c)
+      queue.q = s.j.c;
     insertIntoHeap(s.j, queue);
   }
 }
@@ -382,24 +371,24 @@ function recompute(el, create = false) {
     markDisposal(el);
     globalQueue.h.push(el);
     el.V = el.t;
-    el.U = el.q;
+    el.U = el.r;
     el.t = null;
-    el.q = null;
+    el.r = null;
   }
   const oldcontext = context;
   context = el;
-  el.I = null;
+  el.F = null;
   el.b = 4 /* RecomputingDeps */;
   el.J = clock;
   let value = el.e === NOT_PENDING ? el.g : el.e;
   let oldHeight = el.c;
   let prevStatusFlags = el.f;
-  let prevError = el.C;
+  let prevError = el.B;
   let prevTracking = tracking;
   clearStatusFlags(el);
   tracking = true;
   try {
-    value = el.ha(value);
+    value = el.H(value);
   } catch (e) {
     if (e instanceof NotReadyError) {
       if (e.cause !== el)
@@ -413,51 +402,51 @@ function recompute(el, create = false) {
   }
   el.b = 0 /* None */;
   context = oldcontext;
-  const depsTail = el.I;
-  let toRemove = depsTail !== null ? depsTail.F : el.x;
+  const depsTail = el.F;
+  let toRemove = depsTail !== null ? depsTail.E : el.l;
   if (toRemove !== null) {
     do {
       toRemove = unlinkSubs(toRemove);
     } while (toRemove !== null);
     if (depsTail !== null) {
-      depsTail.F = null;
+      depsTail.E = null;
     } else {
-      el.x = null;
+      el.l = null;
     }
   }
-  const valueChanged = !el.ea || !el.ea(el.e === NOT_PENDING ? el.g : el.e, value);
-  const statusFlagsChanged = el.f !== prevStatusFlags || el.C !== prevError;
-  (_a = el.la) == null ? void 0 : _a.call(el, statusFlagsChanged, prevStatusFlags);
+  const valueChanged = !el.fa || !el.fa(el.e === NOT_PENDING ? el.g : el.e, value);
+  const statusFlagsChanged = el.f !== prevStatusFlags || el.B !== prevError;
+  (_a = el.ma) == null ? void 0 : _a.call(el, statusFlagsChanged, prevStatusFlags);
   if (valueChanged || statusFlagsChanged) {
     if (valueChanged) {
-      if (create || el.ia || el.K)
+      if (create || el.ja || el.K)
         el.g = value;
       else {
         if (el.e === NOT_PENDING)
           globalQueue.h.push(el);
         el.e = value;
       }
-      if (el.D)
-        el.D.da(value);
+      if (el.C)
+        el.C.ea(value);
     }
-    for (let s = el.s; s !== null; s = s.A) {
+    for (let s = el.x; s !== null; s = s.A) {
       const queue = s.j.b & 32 /* Zombie */ ? zombieQueue : dirtyQueue;
-      if (s.j.c < el.c && queue.p > s.j.c)
-        queue.p = s.j.c;
+      if (s.j.c < el.c && queue.q > s.j.c)
+        queue.q = s.j.c;
       insertIntoHeap(s.j, queue);
     }
   } else if (el.c != oldHeight) {
-    for (let s = el.s; s !== null; s = s.A) {
+    for (let s = el.x; s !== null; s = s.A) {
       insertIntoHeapHeight(s.j, s.j.b & 32 /* Zombie */ ? zombieQueue : dirtyQueue);
     }
   }
 }
 function updateIfNecessary(el) {
   if (el.b & 1 /* Check */) {
-    for (let d = el.x; d; d = d.F) {
+    for (let d = el.l; d; d = d.E) {
       const dep1 = d.R;
-      const dep = "_owner" in dep1 ? dep1.B : dep1;
-      if ("_fn" in dep) {
+      const dep = dep1.ia || dep1;
+      if (dep.H) {
         updateIfNecessary(dep);
       }
       if (el.b & 2 /* Dirty */) {
@@ -471,33 +460,47 @@ function updateIfNecessary(el) {
   el.b = 0 /* None */;
 }
 function unlinkSubs(link2) {
+  var _a;
   const dep = link2.R;
-  const nextDep = link2.F;
+  const nextDep = link2.E;
   const nextSub = link2.A;
-  const prevSub = link2.ma;
+  const prevSub = link2.na;
   if (nextSub !== null) {
-    nextSub.ma = prevSub;
+    nextSub.na = prevSub;
   } else {
     dep.W = prevSub;
   }
   if (prevSub !== null) {
     prevSub.A = nextSub;
   } else {
-    dep.s = nextSub;
+    dep.x = nextSub;
+    if (nextSub === null) {
+      (_a = dep.ta) == null ? void 0 : _a.call(dep);
+      dep.H && unobserved(dep);
+    }
   }
   return nextDep;
 }
+function unobserved(el) {
+  deleteFromHeap(el, el.b & 32 /* Zombie */ ? zombieQueue : dirtyQueue);
+  let dep = el.l;
+  while (dep !== null) {
+    dep = unlinkSubs(dep);
+  }
+  el.l = null;
+  runDisposal(el);
+}
 function link(dep, sub) {
-  const prevDep = sub.I;
+  const prevDep = sub.F;
   if (prevDep !== null && prevDep.R === dep) {
     return;
   }
   let nextDep = null;
   const isRecomputing = sub.b & 4 /* RecomputingDeps */;
   if (isRecomputing) {
-    nextDep = prevDep !== null ? prevDep.F : sub.x;
+    nextDep = prevDep !== null ? prevDep.E : sub.l;
     if (nextDep !== null && nextDep.R === dep) {
-      sub.I = nextDep;
+      sub.F = nextDep;
       return;
     }
   }
@@ -505,28 +508,28 @@ function link(dep, sub) {
   if (prevSub !== null && prevSub.j === sub && (!isRecomputing || isValidLink(prevSub, sub))) {
     return;
   }
-  const newLink = sub.I = dep.W = {
+  const newLink = sub.F = dep.W = {
     R: dep,
     j: sub,
-    F: nextDep,
-    ma: prevSub,
+    E: nextDep,
+    na: prevSub,
     A: null
   };
   if (prevDep !== null) {
-    prevDep.F = newLink;
+    prevDep.E = newLink;
   } else {
-    sub.x = newLink;
+    sub.l = newLink;
   }
   if (prevSub !== null) {
     prevSub.A = newLink;
   } else {
-    dep.s = newLink;
+    dep.x = newLink;
   }
 }
 function isValidLink(checkLink, sub) {
-  const depsTail = sub.I;
+  const depsTail = sub.F;
   if (depsTail !== null) {
-    let link2 = sub.x;
+    let link2 = sub.l;
     do {
       if (link2 === checkLink) {
         return true;
@@ -534,14 +537,14 @@ function isValidLink(checkLink, sub) {
       if (link2 === depsTail) {
         break;
       }
-      link2 = link2.F;
+      link2 = link2.E;
     } while (link2 !== null);
   }
   return false;
 }
 function setStatusFlags(signal2, flags, error = null) {
   signal2.f = flags;
-  signal2.C = error;
+  signal2.B = error;
 }
 function setError(signal2, error) {
   setStatusFlags(signal2, 2 /* Error */, error);
@@ -550,7 +553,7 @@ function clearStatusFlags(signal2) {
   setStatusFlags(signal2, 0 /* None */);
 }
 function markDisposal(el) {
-  let child = el.q;
+  let child = el.r;
   while (child) {
     child.b |= 32 /* Zombie */;
     const inHeap = child.b & 8 /* InHeap */;
@@ -562,23 +565,32 @@ function markDisposal(el) {
     child = child.M;
   }
 }
+function dispose(node) {
+  let toRemove = node.l || null;
+  do {
+    toRemove = unlinkSubs(toRemove);
+  } while (toRemove !== null);
+  node.l = null;
+  node.F = null;
+  disposeChildren(node, true);
+}
 function disposeChildren(node, self = false, zombie) {
   if (node.b & 64 /* Disposed */)
     return;
   if (self)
     node.b = 64 /* Disposed */;
-  let child = zombie ? node.U : node.q;
+  let child = zombie ? node.U : node.r;
   while (child) {
     const nextChild = child.M;
-    if (child.x) {
+    if (child.l) {
       const n = child;
       deleteFromHeap(n, n.b & 32 /* Zombie */ ? zombieQueue : dirtyQueue);
-      let toRemove = n.x;
+      let toRemove = n.l;
       do {
         toRemove = unlinkSubs(toRemove);
       } while (toRemove !== null);
-      n.x = null;
-      n.I = null;
+      n.l = null;
+      n.F = null;
     }
     disposeChildren(child, true);
     child = nextChild;
@@ -586,7 +598,7 @@ function disposeChildren(node, self = false, zombie) {
   if (zombie) {
     node.U = null;
   } else {
-    node.q = null;
+    node.r = null;
     node.M = null;
   }
   runDisposal(node, zombie);
@@ -607,16 +619,16 @@ function runDisposal(node, zombie) {
 }
 function withOptions(obj, options) {
   obj.id = (options == null ? void 0 : options.id) ?? ((context == null ? void 0 : context.id) != null ? getNextChildId(context) : void 0);
-  obj.ea = (options == null ? void 0 : options.equals) != null ? options.equals : isEqual;
-  obj.ya = !!(options == null ? void 0 : options.pureWrite);
-  obj.sa = options == null ? void 0 : options.unobserved;
-  if (options == null ? void 0 : options.ja)
-    Object.assign(obj, options.ja);
+  obj.fa = (options == null ? void 0 : options.equals) != null ? options.equals : isEqual;
+  obj.za = !!(options == null ? void 0 : options.pureWrite);
+  obj.ta = options == null ? void 0 : options.unobserved;
+  if (options == null ? void 0 : options.ka)
+    Object.assign(obj, options.ka);
   return obj;
 }
 function getNextChildId(owner) {
   if (owner.id != null)
-    return formatId(owner.id, owner.na++);
+    return formatId(owner.id, owner.oa++);
   throw new Error("Cannot get child id from owner without an id");
 }
 function formatId(prefix, id) {
@@ -628,21 +640,21 @@ function computed(fn, initialValue, options) {
     {
       t: null,
       i: globalQueue,
-      E: defaultContext,
-      na: 0,
-      ha: fn,
+      D: defaultContext,
+      oa: 0,
+      H: fn,
       g: initialValue,
       c: 0,
-      ba: null,
+      ca: null,
       Q: void 0,
       z: null,
+      l: null,
+      F: null,
       x: null,
-      I: null,
-      s: null,
       W: null,
       w: context,
       M: null,
-      q: null,
+      r: null,
       b: 0 /* None */,
       f: 4 /* Uninitialized */,
       J: clock,
@@ -653,16 +665,16 @@ function computed(fn, initialValue, options) {
     options
   );
   self.z = self;
-  const parent = (context == null ? void 0 : context._) ? context.$ : context;
+  const parent = (context == null ? void 0 : context.$) ? context.aa : context;
   if (context) {
     context.i && (self.i = context.i);
-    context.E && (self.E = context.E);
-    const lastChild = context.q;
+    context.D && (self.D = context.D);
+    const lastChild = context.r;
     if (lastChild === null) {
-      context.q = self;
+      context.r = self;
     } else {
       self.M = lastChild;
-      context.q = self;
+      context.r = self;
     }
   }
   if (parent)
@@ -725,7 +737,7 @@ function asyncComputed(asyncFn, initialValue, options) {
     throw new NotReadyError(context);
   };
   const self = computed(fn, initialValue, options);
-  self.ta = () => {
+  self.ua = () => {
     refreshing = true;
     recompute(self);
     flush();
@@ -734,13 +746,13 @@ function asyncComputed(asyncFn, initialValue, options) {
 }
 function signal(v, options, firewall = null) {
   if (firewall !== null) {
-    return firewall.ba = withOptions(
+    return firewall.ca = withOptions(
       {
         g: v,
-        s: null,
+        x: null,
         W: null,
-        B: firewall,
-        ra: firewall.ba,
+        ia: firewall,
+        sa: firewall.ca,
         f: 0 /* None */,
         J: clock,
         e: NOT_PENDING
@@ -751,7 +763,7 @@ function signal(v, options, firewall = null) {
     return withOptions(
       {
         g: v,
-        s: null,
+        x: null,
         W: null,
         f: 0 /* None */,
         J: clock,
@@ -776,14 +788,14 @@ function untrack(fn) {
 }
 function read(el) {
   let c = context;
-  if (c == null ? void 0 : c._)
-    c = c.$;
+  if (c == null ? void 0 : c.$)
+    c = c.aa;
   if (c && tracking) {
     link(el, c);
-    const owner = "_owner" in el ? el.B : el;
-    if ("_fn" in owner) {
+    const owner = el.ia || el;
+    if (owner.H) {
       const isZombie = el.b & 32 /* Zombie */;
-      if (owner.c >= (isZombie ? zombieQueue.p : dirtyQueue.p)) {
+      if (owner.c >= (isZombie ? zombieQueue.q : dirtyQueue.q)) {
         markNode(c);
         markHeap(isZombie ? zombieQueue : dirtyQueue);
         updateIfNecessary(owner);
@@ -796,40 +808,40 @@ function read(el) {
   }
   if (pendingCheck) {
     const pendingResult = (el.f & 1 /* Pending */) !== 0 || !!el.T || false;
-    if (!el.H) {
-      el.H = signal(pendingResult);
-      el.H.ia = true;
-      el.H.da = (v) => setSignal(el.H, v);
+    if (!el.I) {
+      el.I = signal(pendingResult);
+      el.I.ja = true;
+      el.I.ea = (v) => setSignal(el.I, v);
     }
     const prev = pendingCheck;
     pendingCheck = null;
-    read(el.H);
+    read(el.I);
     pendingCheck = prev;
     prev.g = pendingResult || prev.g;
   }
   if (pendingValueCheck) {
-    if (!el.D) {
-      el.D = signal(
+    if (!el.C) {
+      el.C = signal(
         el.e === NOT_PENDING ? el.g : el.e
       );
-      el.D.ia = true;
-      el.D.da = (v) => queueMicrotask(() => queueMicrotask(() => setSignal(el.D, v)));
+      el.C.ja = true;
+      el.C.ea = (v) => queueMicrotask(() => queueMicrotask(() => setSignal(el.C, v)));
     }
     pendingValueCheck = false;
     try {
-      return read(el.D);
+      return read(el.C);
     } finally {
       pendingValueCheck = true;
     }
   }
   if (el.f & 1 /* Pending */) {
     if (c && !stale || el.f & 4 /* Uninitialized */)
-      throw el.C;
+      throw el.B;
     else if (c && stale && !pendingCheck) {
       setStatusFlags(
         c,
         c.f | 1,
-        el.C
+        el.B
       );
     }
   }
@@ -838,7 +850,7 @@ function read(el) {
       recompute(el, true);
       return read(el);
     } else {
-      throw el.C;
+      throw el.B;
     }
   }
   return !c || el.e === NOT_PENDING || stale && !pendingCheck && el.T && activeTransition !== el.T ? el.g : el.e;
@@ -849,19 +861,19 @@ function setSignal(el, v) {
       el.e === NOT_PENDING ? el.g : el.e
     );
   }
-  const valueChanged = !el.ea || !el.ea(el.e === NOT_PENDING ? el.g : el.e, v);
+  const valueChanged = !el.fa || !el.fa(el.e === NOT_PENDING ? el.g : el.e, v);
   if (!valueChanged && !el.f)
     return v;
   if (valueChanged) {
-    if (el.ia)
+    if (el.ja)
       el.g = v;
     else {
       if (el.e === NOT_PENDING)
         globalQueue.h.push(el);
       el.e = v;
     }
-    if (el.D)
-      el.D.da(v);
+    if (el.C)
+      el.C.ea(v);
   }
   clearStatusFlags(el);
   el.J = clock;
@@ -891,15 +903,15 @@ function onCleanup(fn) {
 function createOwner(options) {
   const parent = context;
   const owner = {
-    _: true,
-    $: (parent == null ? void 0 : parent._) ? parent.$ : parent,
-    q: null,
+    $: true,
+    aa: (parent == null ? void 0 : parent.$) ? parent.aa : parent,
+    r: null,
     M: null,
     t: null,
     id: (options == null ? void 0 : options.id) ?? ((parent == null ? void 0 : parent.id) != null ? getNextChildId(parent) : void 0),
     i: (parent == null ? void 0 : parent.i) ?? globalQueue,
-    E: (parent == null ? void 0 : parent.E) || defaultContext,
-    na: 0,
+    D: (parent == null ? void 0 : parent.D) || defaultContext,
+    oa: 0,
     V: null,
     U: null,
     w: parent,
@@ -908,12 +920,12 @@ function createOwner(options) {
     }
   };
   if (parent) {
-    const lastChild = parent.q;
+    const lastChild = parent.r;
     if (lastChild === null) {
-      parent.q = owner;
+      parent.r = owner;
     } else {
       owner.M = lastChild;
-      parent.q = owner;
+      parent.r = owner;
     }
   }
   return owner;
@@ -974,7 +986,7 @@ function getContext(context2, owner = getOwner()) {
   if (!owner) {
     throw new NoOwnerError();
   }
-  const value = hasContext(context2, owner) ? owner.E[context2.id] : context2.defaultValue;
+  const value = hasContext(context2, owner) ? owner.D[context2.id] : context2.defaultValue;
   if (isUndefined(value)) {
     throw new ContextNotFoundError();
   }
@@ -984,13 +996,13 @@ function setContext(context2, value, owner = getOwner()) {
   if (!owner) {
     throw new NoOwnerError();
   }
-  owner.E = {
-    ...owner.E,
+  owner.D = {
+    ...owner.D,
     [context2.id]: isUndefined(value) ? context2.defaultValue : value
   };
 }
 function hasContext(context2, owner) {
-  return !isUndefined(owner == null ? void 0 : owner.E[context2.id]);
+  return !isUndefined(owner == null ? void 0 : owner.D[context2.id]);
 }
 function isUndefined(value) {
   return typeof value === "undefined";
@@ -1002,27 +1014,27 @@ function effect(compute, effect2, error, initialValue, options) {
   let initialized = false;
   const node = computed(compute, initialValue, {
     ...options,
-    ja: {
-      fa: true,
-      oa: initialValue,
-      ua: effect2,
-      pa: error,
+    ka: {
+      ga: true,
+      pa: initialValue,
+      va: effect2,
+      qa: error,
       N: void 0,
       i: ((_a = getOwner()) == null ? void 0 : _a.i) ?? globalQueue,
       K: (options == null ? void 0 : options.render) ? 1 /* Render */ : 2 /* User */,
-      la(statusFlagsChanged, prevStatusFlags) {
+      ma(statusFlagsChanged, prevStatusFlags) {
         if (initialized) {
           const errorChanged = this.f && this.f === prevStatusFlags && statusFlagsChanged;
-          this.fa = !(this.f & 2 /* Error */) && !(this.f & 1 /* Pending */ & ~prevStatusFlags) && !errorChanged;
-          if (this.fa)
+          this.ga = !(this.f & 2 /* Error */) && !(this.f & 1 /* Pending */ & ~prevStatusFlags) && !errorChanged;
+          if (this.ga)
             this.i.enqueue(this.K, runEffect.bind(this));
         }
         if (this.f & 2 /* Error */) {
-          let error2 = this.C;
+          let error2 = this.B;
           this.i.notify(this, 1 /* Pending */, 0);
           if (this.K === 2 /* User */) {
             try {
-              return this.pa ? this.pa(error2, () => {
+              return this.qa ? this.qa(error2, () => {
                 var _a2;
                 (_a2 = this.N) == null ? void 0 : _a2.call(this);
                 this.N = void 0;
@@ -1045,7 +1057,7 @@ function effect(compute, effect2, error, initialValue, options) {
   });
   initialized = true;
   if (node.K === 1 /* Render */)
-    node.ha = (p) => staleValues(() => compute(p));
+    node.H = (p) => staleValues(() => compute(p));
   !(options == null ? void 0 : options.defer) && !(node.f & (2 /* Error */ | 1 /* Pending */)) && (node.K === 2 /* User */ ? node.i.enqueue(node.K, runEffect.bind(node)) : runEffect.call(node));
   onCleanup(() => {
     var _a2;
@@ -1054,18 +1066,18 @@ function effect(compute, effect2, error, initialValue, options) {
 }
 function runEffect() {
   var _a;
-  if (!this.fa || this.b & 64 /* Disposed */)
+  if (!this.ga || this.b & 64 /* Disposed */)
     return;
   (_a = this.N) == null ? void 0 : _a.call(this);
   this.N = void 0;
   try {
-    this.N = this.ua(this.g, this.oa);
+    this.N = this.va(this.g, this.pa);
   } catch (error) {
     if (!this.i.notify(this, 2 /* Error */, 2 /* Error */))
       throw error;
   } finally {
-    this.oa = this.g;
-    this.fa = false;
+    this.pa = this.g;
+    this.ga = false;
   }
 }
 
@@ -1096,7 +1108,7 @@ function createMemo(compute, value, options) {
 function createAsync(compute, value, options) {
   const node = asyncComputed(compute, value, options);
   const ret = read.bind(null, node);
-  ret.refresh = node.ta;
+  ret.refresh = node.ua;
   return ret;
 }
 function createEffect(compute, effectFn, value, options) {
@@ -1116,11 +1128,30 @@ function createRenderEffect(compute, effectFn, value, options) {
 }
 function createTrackedEffect(compute, options) {
 }
-function createReaction(effect2, options) {
+function createReaction(effectFn, options) {
+  let cleanup = void 0;
+  onCleanup(() => cleanup == null ? void 0 : cleanup());
+  return (tracking2) => {
+    effect(
+      () => (tracking2(), getOwner()),
+      (node) => {
+        var _a;
+        cleanup == null ? void 0 : cleanup();
+        cleanup = (_a = effectFn.effect || effectFn) == null ? void 0 : _a();
+        dispose(node);
+      },
+      effectFn.error,
+      void 0,
+      {
+        defer: true,
+        ...options
+      }
+    );
+  };
 }
 function resolve(fn) {
   return new Promise((res, rej) => {
-    createRoot((dispose) => {
+    createRoot((dispose2) => {
       computed(() => {
         try {
           res(fn());
@@ -1129,7 +1160,7 @@ function resolve(fn) {
             throw err;
           rej(err);
         }
-        dispose();
+        dispose2();
       });
     });
   });
@@ -1138,6 +1169,14 @@ function createOptimistic(first, second, third) {
   return {};
 }
 function onSettled(callback) {
+  let cleanup;
+  const o = getOwner();
+  if (o)
+    onCleanup(() => cleanup == null ? void 0 : cleanup());
+  globalQueue.enqueue(2 /* User */, () => {
+    cleanup = callback();
+    !o && (cleanup == null ? void 0 : cleanup());
+  });
 }
 
 // src/store/reconcile.ts
@@ -1274,24 +1313,18 @@ function reconcile(value, key, all = false) {
 function createProjectionInternal(fn, initialValue = {}, options) {
   let node;
   const wrappedMap = /* @__PURE__ */ new WeakMap();
-  const traps = {
-    ...storeTraps,
-    get(target, property, receiver) {
-      const o = getOwner();
-      const n = node;
-      (!o || o !== n) && n && read(n);
-      return storeTraps.get(target, property, receiver);
-    }
-  };
   const wrapProjection = (source) => {
     var _a;
     if (wrappedMap.has(source))
       return wrappedMap.get(source);
     if (((_a = source[$TARGET]) == null ? void 0 : _a[STORE_WRAP]) === wrapProjection)
       return source;
-    const wrapped = createStoreProxy(source, traps, {
+    const wrapped = createStoreProxy(source, storeTraps, {
       [STORE_WRAP]: wrapProjection,
-      [STORE_LOOKUP]: wrappedMap
+      [STORE_LOOKUP]: wrappedMap,
+      [STORE_FIREWALL]() {
+        return node;
+      }
     });
     wrappedMap.set(source, wrapped);
     return wrapped;
@@ -1324,6 +1357,7 @@ var STORE_NODE = "n";
 var STORE_HAS = "h";
 var STORE_WRAP = "w";
 var STORE_LOOKUP = "l";
+var STORE_FIREWALL = "f";
 function createStoreProxy(value, traps = storeTraps, extend) {
   let newTarget;
   if (Array.isArray(value)) {
@@ -1352,18 +1386,25 @@ function getNodes(target, type) {
     target[type] = nodes = /* @__PURE__ */ Object.create(null);
   return nodes;
 }
-function getNode(nodes, property, value, equals = isEqual) {
+function getNode(nodes, property, value, firewall, equals = isEqual) {
   if (nodes[property])
     return nodes[property];
-  return nodes[property] = signal(value, {
-    equals,
-    unobserved() {
-      delete nodes[property];
-    }
-  });
+  return nodes[property] = signal(
+    value,
+    {
+      equals,
+      unobserved() {
+        delete nodes[property];
+      }
+    },
+    firewall
+  );
 }
 function trackSelf(target, symbol = $TRACK) {
-  getObserver() && read(getNode(getNodes(target, STORE_NODE), symbol, void 0, false));
+  var _a;
+  getObserver() && read(
+    getNode(getNodes(target, STORE_NODE), symbol, void 0, (_a = target[STORE_FIREWALL]) == null ? void 0 : _a.call(target), false)
+  );
 }
 function getKeys(source, override, enumerable = true) {
   const baseKeys = untrack(() => enumerable ? Object.keys(source) : Reflect.ownKeys(source));
@@ -1392,6 +1433,7 @@ function getPropertyDescriptor(source, override, property) {
 var Writing = null;
 var storeTraps = {
   get(target, property, receiver) {
+    var _a;
     if (property === $TARGET)
       return target;
     if (property === $PROXY)
@@ -1426,16 +1468,24 @@ var storeTraps = {
         let proto;
         return !Array.isArray(target[STORE_VALUE]) && (proto = Object.getPrototypeOf(target[STORE_VALUE])) && proto !== Object.prototype ? value.bind(storeValue) : value;
       } else if (getObserver()) {
-        return read(getNode(nodes, property, isWrappable(value) ? wrap(value, target) : value));
+        return read(
+          getNode(
+            nodes,
+            property,
+            isWrappable(value) ? wrap(value, target) : value,
+            (_a = target[STORE_FIREWALL]) == null ? void 0 : _a.call(target)
+          )
+        );
       }
     }
     return isWrappable(value) ? wrap(value, target) : value;
   },
   has(target, property) {
+    var _a;
     if (property === $PROXY || property === $TRACK || property === "__proto__")
       return true;
     const has = target[STORE_OVERRIDE] && property in target[STORE_OVERRIDE] ? target[STORE_OVERRIDE][property] !== $DELETED : property in target[STORE_VALUE];
-    getObserver() && read(getNode(getNodes(target, STORE_HAS), property, has));
+    getObserver() && read(getNode(getNodes(target, STORE_HAS), property, has, (_a = target[STORE_FIREWALL]) == null ? void 0 : _a.call(target)));
     return has;
   },
   set(target, property, rawValue) {
@@ -1815,60 +1865,60 @@ function mapArray(list, map, options) {
   const keyFn = typeof (options == null ? void 0 : options.keyed) === "function" ? options.keyed : void 0;
   return createMemo(
     updateKeyedMap.bind({
-      B: createOwner(),
-      m: 0,
-      va: list,
+      X: createOwner(),
+      n: 0,
+      wa: list,
       G: [],
       O: map,
       d: [],
       a: [],
       P: keyFn,
-      n: keyFn || (options == null ? void 0 : options.keyed) === false ? [] : void 0,
-      o: map.length > 1 ? [] : void 0,
-      X: options == null ? void 0 : options.fallback
+      o: keyFn || (options == null ? void 0 : options.keyed) === false ? [] : void 0,
+      p: map.length > 1 ? [] : void 0,
+      Y: options == null ? void 0 : options.fallback
     })
   );
 }
 var pureOptions = { pureWrite: true };
 function updateKeyedMap() {
-  const newItems = this.va() || [], newLen = newItems.length;
+  const newItems = this.wa() || [], newLen = newItems.length;
   newItems[$TRACK];
-  runWithOwner(this.B, () => {
-    let i, j, mapper = this.n ? () => {
-      this.n[j] = signal(newItems[j], pureOptions);
-      this.o && (this.o[j] = signal(j, pureOptions));
+  runWithOwner(this.X, () => {
+    let i, j, mapper = this.o ? () => {
+      this.o[j] = signal(newItems[j], pureOptions);
+      this.p && (this.p[j] = signal(j, pureOptions));
       return this.O(
-        read.bind(null, this.n[j]),
-        this.o ? read.bind(null, this.o[j]) : void 0
+        read.bind(null, this.o[j]),
+        this.p ? read.bind(null, this.p[j]) : void 0
       );
-    } : this.o ? () => {
+    } : this.p ? () => {
       const item = newItems[j];
-      this.o[j] = signal(j, pureOptions);
+      this.p[j] = signal(j, pureOptions);
       return this.O(
         () => item,
-        read.bind(null, this.o[j])
+        read.bind(null, this.p[j])
       );
     } : () => {
       const item = newItems[j];
       return this.O(() => item);
     };
     if (newLen === 0) {
-      if (this.m !== 0) {
-        this.B.dispose(false);
+      if (this.n !== 0) {
+        this.X.dispose(false);
         this.a = [];
         this.G = [];
         this.d = [];
-        this.m = 0;
-        this.n && (this.n = []);
+        this.n = 0;
         this.o && (this.o = []);
+        this.p && (this.p = []);
       }
-      if (this.X && !this.d[0]) {
+      if (this.Y && !this.d[0]) {
         this.d[0] = runWithOwner(
           this.a[0] = createOwner(),
-          this.X
+          this.Y
         );
       }
-    } else if (this.m === 0) {
+    } else if (this.n === 0) {
       if (this.a[0])
         this.a[0].dispose();
       this.d = new Array(newLen);
@@ -1876,18 +1926,18 @@ function updateKeyedMap() {
         this.G[j] = newItems[j];
         this.d[j] = runWithOwner(this.a[j] = createOwner(), mapper);
       }
-      this.m = newLen;
+      this.n = newLen;
     } else {
-      let start, end, newEnd, item, key, newIndices, newIndicesNext, temp = new Array(newLen), tempNodes = new Array(newLen), tempRows = this.n ? new Array(newLen) : void 0, tempIndexes = this.o ? new Array(newLen) : void 0;
-      for (start = 0, end = Math.min(this.m, newLen); start < end && (this.G[start] === newItems[start] || this.n && compare(this.P, this.G[start], newItems[start])); start++) {
-        if (this.n)
-          setSignal(this.n[start], newItems[start]);
+      let start, end, newEnd, item, key, newIndices, newIndicesNext, temp = new Array(newLen), tempNodes = new Array(newLen), tempRows = this.o ? new Array(newLen) : void 0, tempIndexes = this.p ? new Array(newLen) : void 0;
+      for (start = 0, end = Math.min(this.n, newLen); start < end && (this.G[start] === newItems[start] || this.o && compare(this.P, this.G[start], newItems[start])); start++) {
+        if (this.o)
+          setSignal(this.o[start], newItems[start]);
       }
-      for (end = this.m - 1, newEnd = newLen - 1; end >= start && newEnd >= start && (this.G[end] === newItems[newEnd] || this.n && compare(this.P, this.G[end], newItems[newEnd])); end--, newEnd--) {
+      for (end = this.n - 1, newEnd = newLen - 1; end >= start && newEnd >= start && (this.G[end] === newItems[newEnd] || this.o && compare(this.P, this.G[end], newItems[newEnd])); end--, newEnd--) {
         temp[newEnd] = this.d[end];
         tempNodes[newEnd] = this.a[end];
-        tempRows && (tempRows[newEnd] = this.n[end]);
-        tempIndexes && (tempIndexes[newEnd] = this.o[end]);
+        tempRows && (tempRows[newEnd] = this.o[end]);
+        tempIndexes && (tempIndexes[newEnd] = this.p[end]);
       }
       newIndices = /* @__PURE__ */ new Map();
       newIndicesNext = new Array(newEnd + 1);
@@ -1905,8 +1955,8 @@ function updateKeyedMap() {
         if (j !== void 0 && j !== -1) {
           temp[j] = this.d[i];
           tempNodes[j] = this.a[i];
-          tempRows && (tempRows[j] = this.n[i]);
-          tempIndexes && (tempIndexes[j] = this.o[i]);
+          tempRows && (tempRows[j] = this.o[i]);
+          tempIndexes && (tempIndexes[j] = this.p[i]);
           j = newIndicesNext[j];
           newIndices.set(key, j);
         } else
@@ -1917,18 +1967,18 @@ function updateKeyedMap() {
           this.d[j] = temp[j];
           this.a[j] = tempNodes[j];
           if (tempRows) {
-            this.n[j] = tempRows[j];
-            setSignal(this.n[j], newItems[j]);
+            this.o[j] = tempRows[j];
+            setSignal(this.o[j], newItems[j]);
           }
           if (tempIndexes) {
-            this.o[j] = tempIndexes[j];
-            setSignal(this.o[j], j);
+            this.p[j] = tempIndexes[j];
+            setSignal(this.p[j], j);
           }
         } else {
           this.d[j] = runWithOwner(this.a[j] = createOwner(), mapper);
         }
       }
-      this.d = this.d.slice(0, this.m = newLen);
+      this.d = this.d.slice(0, this.n = newLen);
       this.G = newItems.slice(0);
     }
   });
@@ -1936,46 +1986,46 @@ function updateKeyedMap() {
 }
 function repeat(count, map, options) {
   return updateRepeat.bind({
-    B: createOwner(),
-    m: 0,
+    X: createOwner(),
+    n: 0,
     y: 0,
-    wa: count,
+    xa: count,
     O: map,
     a: [],
     d: [],
-    xa: options == null ? void 0 : options.from,
-    X: options == null ? void 0 : options.fallback
+    ya: options == null ? void 0 : options.from,
+    Y: options == null ? void 0 : options.fallback
   });
 }
 function updateRepeat() {
   var _a;
-  const newLen = this.wa();
-  const from = ((_a = this.xa) == null ? void 0 : _a.call(this)) || 0;
-  runWithOwner(this.B, () => {
+  const newLen = this.xa();
+  const from = ((_a = this.ya) == null ? void 0 : _a.call(this)) || 0;
+  runWithOwner(this.X, () => {
     if (newLen === 0) {
-      if (this.m !== 0) {
-        this.B.dispose(false);
+      if (this.n !== 0) {
+        this.X.dispose(false);
         this.a = [];
         this.d = [];
-        this.m = 0;
+        this.n = 0;
       }
-      if (this.X && !this.d[0]) {
+      if (this.Y && !this.d[0]) {
         this.d[0] = runWithOwner(
           this.a[0] = createOwner(),
-          this.X
+          this.Y
         );
       }
       return;
     }
     const to = from + newLen;
-    const prevTo = this.y + this.m;
-    if (this.m === 0 && this.a[0])
+    const prevTo = this.y + this.n;
+    if (this.n === 0 && this.a[0])
       this.a[0].dispose();
     for (let i = to; i < prevTo; i++)
       this.a[i - this.y].dispose();
     if (this.y < from) {
       let i = this.y;
-      while (i < from && i < this.m)
+      while (i < from && i < this.n)
         this.a[i++].dispose();
       this.a.splice(0, from - this.y);
       this.d.splice(0, from - this.y);
@@ -2003,7 +2053,7 @@ function updateRepeat() {
     }
     this.d = this.d.slice(0, newLen);
     this.y = from;
-    this.m = newLen;
+    this.n = newLen;
   });
   return this.d;
 }
@@ -2014,19 +2064,19 @@ function compare(key, a, b) {
 // src/boundaries.ts
 function boundaryComputed(fn, propagationMask) {
   const node = computed(fn, void 0, {
-    ja: {
-      la() {
+    ka: {
+      ma() {
         let flags = this.f;
-        this.f &= ~this.Y;
-        if (this.Y & 1 /* Pending */ && !(this.f & 4 /* Uninitialized */)) {
+        this.f &= ~this.Z;
+        if (this.Z & 1 /* Pending */ && !(this.f & 4 /* Uninitialized */)) {
           flags &= ~1 /* Pending */;
         }
-        this.i.notify(this, this.Y, flags);
+        this.i.notify(this, this.Z, flags);
       },
-      Y: propagationMask
+      Z: propagationMask
     }
   });
-  node.Y = propagationMask;
+  node.Z = propagationMask;
   return node;
 }
 function createBoundChildren(owner, fn, queue, mask) {
@@ -2040,7 +2090,7 @@ function createBoundChildren(owner, fn, queue, mask) {
 }
 var ConditionalQueue = class extends Queue {
   u;
-  ga = /* @__PURE__ */ new Set();
+  ha = /* @__PURE__ */ new Set();
   h = /* @__PURE__ */ new Set();
   constructor(disabled) {
     super();
@@ -2062,9 +2112,9 @@ var ConditionalQueue = class extends Queue {
       }
       if (type & 2 /* Error */) {
         if (flags & 2 /* Error */) {
-          this.ga.add(node);
+          this.ha.add(node);
           type &= ~2 /* Error */;
-        } else if (this.ga.delete(node))
+        } else if (this.ha.delete(node))
           type &= ~2 /* Error */;
       }
     }
@@ -2072,13 +2122,13 @@ var ConditionalQueue = class extends Queue {
   }
 };
 var CollectionQueue = class extends Queue {
-  Z;
+  _;
   a = /* @__PURE__ */ new Set();
   u = signal(false, { pureWrite: true });
-  qa = false;
+  ra = false;
   constructor(type) {
     super();
-    this.Z = type;
+    this._ = type;
   }
   run(type) {
     if (!type || read(this.u))
@@ -2086,9 +2136,9 @@ var CollectionQueue = class extends Queue {
     return super.run(type);
   }
   notify(node, type, flags) {
-    if (!(type & this.Z) || this.Z & 1 /* Pending */ && this.qa)
+    if (!(type & this._) || this._ & 1 /* Pending */ && this.ra)
       return super.notify(node, type, flags);
-    if (flags & this.Z) {
+    if (flags & this._) {
       this.a.add(node);
       if (this.a.size === 1)
         setSignal(this.u, true);
@@ -2097,7 +2147,7 @@ var CollectionQueue = class extends Queue {
       if (this.a.size === 0)
         setSignal(this.u, false);
     }
-    type &= ~this.Z;
+    type &= ~this._;
     return type ? super.notify(node, type, flags) : true;
   }
 };
@@ -2107,14 +2157,14 @@ function createBoundary(fn, condition) {
   const tree = createBoundChildren(owner, fn, queue, 0);
   computed(() => {
     const disabled = read(queue.u);
-    tree.Y = disabled ? 2 /* Error */ | 1 /* Pending */ : 0;
+    tree.Z = disabled ? 2 /* Error */ | 1 /* Pending */ : 0;
     if (!disabled) {
       queue.h.forEach(
         (node) => queue.notify(node, 1 /* Pending */, 1 /* Pending */)
       );
-      queue.ga.forEach((node) => queue.notify(node, 2 /* Error */, 2 /* Error */));
+      queue.ha.forEach((node) => queue.notify(node, 2 /* Error */, 2 /* Error */));
       queue.h.clear();
-      queue.ga.clear();
+      queue.ha.clear();
     }
   });
   return () => read(queue.u) ? void 0 : read(tree);
@@ -2127,7 +2177,7 @@ function createCollectionBoundary(type, fn, fallback) {
     if (!read(queue.u)) {
       const resolved = read(tree);
       if (!untrack(() => read(queue.u)))
-        queue.qa = true;
+        queue.ra = true;
       return resolved;
     }
     return fallback(queue);
@@ -2140,7 +2190,7 @@ function createLoadBoundary(fn, fallback) {
 function createErrorBoundary(fn, fallback) {
   return createCollectionBoundary(2 /* Error */, fn, (queue) => {
     let node = queue.a.values().next().value;
-    return fallback(node.C, () => {
+    return fallback(node.B, () => {
       for (let node2 of queue.a) {
         recompute(node2, true);
       }