@solidjs/signals 0.4.4 → 0.4.5

package/dist/prod.js

@@ -39,7 +39,7 @@ function incrementClock() {
   clock++;
 }
 var ActiveTransition = null;
-var unobserved = [];
+var Unobserved = [];
 var scheduled = false;
 function schedule() {
   if (scheduled)
@@ -49,12 +49,12 @@ function schedule() {
     queueMicrotask(flush);
 }
 function notifyUnobserved() {
-  for (let i = 0; i < unobserved.length; i++) {
-    const source = unobserved[i];
-    if (!source.d || !source.d.length)
-      unobserved[i].da?.();
+  for (let i = 0; i < Unobserved.length; i++) {
+    const source = Unobserved[i];
+    if (!source.b || !source.b.length)
+      Unobserved[i].da?.();
   }
-  unobserved = [];
+  Unobserved = [];
 }
 var pureQueue = [];
 var Queue = class {
@@ -64,8 +64,8 @@ var Queue = class {
   e = [];
   created = clock;
   enqueue(type, fn) {
-    if (ActiveTransition && ActiveTransition.w.has(this))
-      return ActiveTransition.w.get(this).enqueue(type, fn);
+    if (ActiveTransition && ActiveTransition.u.has(this))
+      return ActiveTransition.u.get(this).enqueue(type, fn);
     pureQueue.push(fn);
     if (type)
       this.f[type - 1].push(fn);
@@ -97,7 +97,7 @@ var Queue = class {
       this.run(EFFECT_USER);
     } finally {
       this.z = false;
-      unobserved.length && notifyUnobserved();
+      Unobserved.length && notifyUnobserved();
     }
   }
   addChild(child) {
@@ -110,8 +110,8 @@ var Queue = class {
       this.e.splice(index, 1);
   }
   notify(...args) {
-    if (ActiveTransition && ActiveTransition.w.has(this))
-      return ActiveTransition.w.get(this).notify(...args);
+    if (ActiveTransition && ActiveTransition.u.has(this))
+      return ActiveTransition.u.get(this).notify(...args);
     if (this.m)
       return this.m.notify(...args);
     return false;
@@ -120,7 +120,7 @@ var Queue = class {
     this.f[0].push.apply(this.f[0], queue.f[0]);
     this.f[1].push.apply(this.f[1], queue.f[1]);
     for (let i = 0; i < queue.e.length; i++) {
-      const og = this.e.find((c) => c.j === queue.e[i].j);
+      const og = this.e.find((c) => c.g === queue.e[i].g);
       if (og)
         og.merge(queue.e[i]);
       else
@@ -140,12 +140,12 @@ function runQueue(queue, type) {
 }
 var Transition = class _Transition {
   a = /* @__PURE__ */ new Map();
-  t = /* @__PURE__ */ new Set();
-  Q = /* @__PURE__ */ new Set();
+  s = /* @__PURE__ */ new Set();
+  R = /* @__PURE__ */ new Set();
   W = /* @__PURE__ */ new Set();
   I = false;
   f = [[], []];
-  w = /* @__PURE__ */ new Map();
+  u = /* @__PURE__ */ new Map();
   E = [];
   e = [];
   m = null;
@@ -153,9 +153,9 @@ var Transition = class _Transition {
   X = false;
   created = clock;
   constructor() {
-    this.w.set(globalQueue, this);
+    this.u.set(globalQueue, this);
     for (const child of globalQueue.e) {
-      cloneQueue(child, this, this.w);
+      cloneQueue(child, this, this.u);
     }
   }
   enqueue(type, fn) {
@@ -208,9 +208,9 @@ var Transition = class _Transition {
     if (!(type & LOADING_BIT))
       return false;
     if (flags & LOADING_BIT) {
-      this.t.add(node);
+      this.s.add(node);
     } else {
-      this.t.delete(node);
+      this.s.delete(node);
     }
     return true;
   }
@@ -219,7 +219,7 @@ var Transition = class _Transition {
     this.f[1].push.apply(this.f[1], queue.f[1]);
     this.E.push.apply(this.E, queue.E);
     for (let i = 0; i < queue.e.length; i++) {
-      const og = this.e.find((c) => c.j === queue.e[i].j);
+      const og = this.e.find((c) => c.g === queue.e[i].g);
       if (og)
         og.merge(queue.e[i]);
       else
@@ -247,9 +247,9 @@ var Transition = class _Transition {
       const result = fn();
       const transition2 = ActiveTransition;
       if (result instanceof Promise) {
-        transition2.Q.add(result);
+        transition2.R.add(result);
         result.finally(() => {
-          transition2.Q.delete(result);
+          transition2.R.delete(result);
           finishTransition(transition2);
         });
       }
@@ -282,43 +282,51 @@ function cloneGraph(node) {
     return node.k.a.get(node);
   }
   const clone = Object.create(Object.getPrototypeOf(node));
-  Object.assign(clone, node, { n: null, s: null, j: node });
+  Object.assign(clone, node, {
+    n: null,
+    r: null,
+    b: null,
+    a: node.a ? [...node.a] : null,
+    g: node
+  });
   ActiveTransition.a.set(node, clone);
   node.k = ActiveTransition;
-  if (node.d) {
-    for (let i = 0, length = node.d.length; i < length; i++) {
-      const o = node.d[i];
-      node.d.push(cloneGraph(o));
+  if (node.a) {
+    for (let i = 0; i < node.a.length; i++)
+      node.a[i].b.push(clone);
+  }
+  if (node.b) {
+    clone.b = [];
+    for (let i = 0, length = node.b.length; i < length; i++) {
+      !node.b[i].g && clone.b.push(cloneGraph(node.b[i]));
     }
   }
   return clone;
 }
-function removeSourceObservers(node, index) {
+function replaceSourceObservers(node, transition2) {
   let source;
+  let transitionSource;
   let swap;
-  for (let i = index; i < node.a.length; i++) {
-    source = ActiveTransition && ActiveTransition.a.get(node.a[i]) || node.a[i];
-    if (source.d) {
-      if ((swap = source.d.indexOf(node)) !== -1) {
-        source.d[swap] = source.d[source.d.length - 1];
-        source.d.pop();
-      }
-      if (!source.d.length)
-        unobserved.push(source);
+  for (let i = 0; i < node.a.length; i++) {
+    transitionSource = transition2.a.get(node.a[i]);
+    source = transitionSource || node.a[i];
+    if (source.b && (swap = source.b.indexOf(node)) !== -1) {
+      source.b[swap] = transitionSource ? node.g : source.b[source.b.length - 1];
+      !transitionSource && source.b.pop();
     }
   }
 }
 function cloneQueue(queue, parent, clonedQueues) {
   const clone = Object.create(Object.getPrototypeOf(queue));
   Object.assign(clone, queue, {
-    j: queue,
+    g: queue,
     m: parent,
     e: [],
     enqueue(type, fn) {
       ActiveTransition?.enqueue(type, fn);
     },
     notify(node, type, flags) {
-      node = node.j || node;
+      node = node.g || node;
       if (!clone.F || type & LOADING_BIT) {
         type &= ~LOADING_BIT;
         ActiveTransition?.notify(node, LOADING_BIT, flags);
@@ -336,7 +344,7 @@ function cloneQueue(queue, parent, clonedQueues) {
 }
 function resolveQueues(children) {
   for (const child of children) {
-    const og = child.j;
+    const og = child.g;
     if (og) {
       const clonedChildren = child.e;
       delete child.enqueue;
@@ -344,10 +352,10 @@ function resolveQueues(children) {
       delete child.m;
       delete child.e;
       Object.assign(og, child);
-      delete og.j;
+      delete og.g;
       resolveQueues(clonedChildren);
-    } else if (child.m.j) {
-      child.m.j.addChild(child);
+    } else if (child.m.g) {
+      child.m.g.addChild(child);
     }
   }
 }
@@ -360,34 +368,34 @@ function mergeTransitions(t1, t2) {
     c.k = t1;
     t1.W.add(c);
   });
-  t2.Q.forEach((p) => t1.Q.add(p));
-  t2.t.forEach((n) => t1.t.add(n));
+  t2.R.forEach((p) => t1.R.add(p));
+  t2.s.forEach((n) => t1.s.add(n));
   t1.merge(t2);
   t2.I = t1;
 }
 function finishTransition(transition2) {
-  if (transition2.I || transition2.X || transition2.Q.size || transition2.t.size)
+  if (transition2.I || transition2.X || transition2.R.size || transition2.s.size)
     return;
   for (const [source, clone] of transition2.a) {
     if (source === clone || source.k !== transition2)
       continue;
     if (clone.a)
-      removeSourceObservers(clone, 0);
+      replaceSourceObservers(clone, transition2);
     source.dispose(false);
     source.emptyDisposal();
     Object.assign(source, clone);
-    delete source.j;
+    delete source.g;
     delete source.k;
   }
   globalQueue.f[0].push.apply(globalQueue.f[0], transition2.f[0]);
   globalQueue.f[1].push.apply(globalQueue.f[1], transition2.f[1]);
   resolveQueues(transition2.e);
   transition2.I = true;
-  globalQueue.flush();
   for (const reset of transition2.W) {
     delete reset.k;
     reset();
   }
+  globalQueue.flush();
 }
 
 // src/core/owner.ts
@@ -406,11 +414,11 @@ var Owner = class {
   // However, the children are actually added in reverse creation order
   // See comment at the top of the file for an example of the _nextSibling traversal
   m = null;
-  s = null;
+  r = null;
   B = null;
-  b = STATE_CLEAN;
+  c = STATE_CLEAN;
   n = null;
-  x = defaultContext;
+  w = defaultContext;
   l = globalQueue;
   ea = 0;
   id = null;
@@ -423,27 +431,27 @@ var Owner = class {
   append(child) {
     child.m = this;
     child.B = this;
-    if (this.s)
-      this.s.B = child;
-    child.s = this.s;
-    this.s = child;
+    if (this.r)
+      this.r.B = child;
+    child.r = this.r;
+    this.r = child;
     if (this.id != null && child.id == null)
       child.id = this.getNextChildId();
-    if (child.x !== this.x) {
-      child.x = { ...this.x, ...child.x };
+    if (child.w !== this.w) {
+      child.w = { ...this.w, ...child.w };
     }
     if (this.l)
       child.l = this.l;
   }
   dispose(self = true) {
-    if (this.b === STATE_DISPOSED)
+    if (this.c === STATE_DISPOSED)
       return;
-    let head = self ? this.B || this.m : this, current = this.s, next = null;
+    let head = self ? this.B || this.m : this, current = this.r, next = null;
     while (current && current.m === this) {
       current.dispose(true);
       current.J();
-      next = current.s;
-      current.s = null;
+      next = current.r;
+      current.r = null;
       current = next;
     }
     this.ea = 0;
@@ -452,15 +460,15 @@ var Owner = class {
     if (current)
       current.B = !self ? this : this.B;
     if (head)
-      head.s = current;
+      head.r = current;
   }
   J() {
     if (this.B)
-      this.B.s = null;
+      this.B.r = null;
     this.m = null;
     this.B = null;
-    this.x = defaultContext;
-    this.b = STATE_DISPOSED;
+    this.w = defaultContext;
+    this.c = STATE_DISPOSED;
     this.emptyDisposal();
   }
   emptyDisposal() {
@@ -489,7 +497,7 @@ function getContext(context, owner = currentOwner) {
   if (!owner) {
     throw new NoOwnerError();
   }
-  const value = hasContext(context, owner) ? owner.x[context.id] : context.defaultValue;
+  const value = hasContext(context, owner) ? owner.w[context.id] : context.defaultValue;
   if (isUndefined(value)) {
     throw new ContextNotFoundError();
   }
@@ -499,13 +507,13 @@ function setContext(context, value, owner = currentOwner) {
   if (!owner) {
     throw new NoOwnerError();
   }
-  owner.x = {
-    ...owner.x,
+  owner.w = {
+    ...owner.w,
     [context.id]: isUndefined(value) ? context.defaultValue : value
   };
 }
 function hasContext(context, owner = currentOwner) {
-  return !isUndefined(owner?.x[context.id]);
+  return !isUndefined(owner?.w[context.id]);
 }
 function onCleanup(fn) {
   if (!currentOwner)
@@ -543,10 +551,10 @@ function getObserver() {
 var UNCHANGED = Symbol(0);
 var Computation = class extends Owner {
   a = null;
-  d = null;
-  i;
-  R;
+  b = null;
+  j;
   K;
+  L;
   // Used in __DEV__ mode, hopefully removed in production
   ka;
   // Using false is an optimization as an alternative to _equals: () => false
@@ -558,16 +566,16 @@ var Computation = class extends Owner {
   h = 0;
   /** Which flags raised by sources are handled, vs. being passed through. */
   aa = DEFAULT_FLAGS;
-  L = -1;
+  M = -1;
   G = false;
   k;
-  j;
+  g;
   constructor(initialValue, compute2, options) {
     super(options?.id, compute2 === null);
-    this.K = compute2;
-    this.b = compute2 ? STATE_DIRTY : STATE_CLEAN;
+    this.L = compute2;
+    this.c = compute2 ? STATE_DIRTY : STATE_CLEAN;
     this.h = compute2 && initialValue === void 0 ? UNINITIALIZED_BIT : 0;
-    this.i = initialValue;
+    this.j = initialValue;
     if (options?.equals !== void 0)
       this.$ = options.equals;
     if (options?.pureWrite)
@@ -583,9 +591,9 @@ var Computation = class extends Owner {
     track(this);
     newFlags |= this.h & ~currentMask;
     if (this.h & ERROR_BIT) {
-      throw this.R;
+      throw this.K;
     } else {
-      return this.i;
+      return this.j;
     }
   }
   /**
@@ -593,13 +601,13 @@ var Computation = class extends Owner {
    * Automatically re-executes the surrounding computation when the value changes
    */
   read() {
-    if (ActiveTransition && ActiveTransition.a.has(this)) {
-      const clone = ActiveTransition.a.get(this);
+    if (ActiveTransition && (ActiveTransition.a.has(this) || !this.g && this.h & UNINITIALIZED_BIT)) {
+      const clone = ActiveTransition.a.get(this) || cloneGraph(this);
       if (clone !== this)
         return clone.read();
     }
-    if (this.K) {
-      if (this.h & ERROR_BIT && this.L <= clock)
+    if (this.L) {
+      if (this.h & ERROR_BIT && this.M <= clock)
         update(this);
       else
         this.H();
@@ -614,13 +622,13 @@ var Computation = class extends Owner {
    * before continuing
    */
   wait() {
-    if (ActiveTransition && ActiveTransition.a.has(this)) {
-      const clone = ActiveTransition.a.get(this);
+    if (ActiveTransition && (ActiveTransition.a.has(this) || !this.g && this.h & UNINITIALIZED_BIT)) {
+      const clone = ActiveTransition.a.get(this) || cloneGraph(this);
       if (clone !== this)
         return clone.wait();
     }
-    if (this.K) {
-      if (this.h & ERROR_BIT && this.L <= clock)
+    if (this.L) {
+      if (this.h & ERROR_BIT && this.M <= clock)
         update(this);
       else
         this.H();
@@ -630,54 +638,49 @@ var Computation = class extends Owner {
       throw new NotReadyError();
     }
     if (staleCheck && this.h & LOADING_BIT) {
-      staleCheck.i = true;
+      staleCheck.j = true;
     }
     return this.fa();
   }
   /** Update the computation with a new value. */
   write(value, flags = 0, raw = false) {
-    if (ActiveTransition && !this.j) {
+    if (ActiveTransition && !this.g) {
       const clone = cloneGraph(this);
       if (clone !== this)
         return clone.write(value, flags, raw);
     }
-    const newValue = !raw && typeof value === "function" ? value(this.i) : value;
+    const newValue = !raw && typeof value === "function" ? value(this.j) : value;
     const valueChanged = newValue !== UNCHANGED && (!!(this.h & UNINITIALIZED_BIT) || // this._stateFlags & LOADING_BIT & ~flags ||
-    this.$ === false || !this.$(this.i, newValue));
+    this.$ === false || !this.$(this.j, newValue));
     if (valueChanged) {
-      this.i = newValue;
-      this.R = void 0;
+      this.j = newValue;
+      this.K = void 0;
     }
     const changedFlagsMask = this.h ^ flags, changedFlags = changedFlagsMask & flags;
     this.h = flags;
-    this.L = clock + 1;
-    if (this.d) {
-      for (let i = 0; i < this.d.length; i++) {
+    this.M = clock + 1;
+    if (this.b) {
+      for (let i = 0; i < this.b.length; i++) {
         if (valueChanged) {
-          this.d[i].o(STATE_DIRTY);
+          this.b[i].x(STATE_DIRTY);
         } else if (changedFlagsMask) {
-          this.d[i].Y(changedFlagsMask, changedFlags);
+          this.b[i].Y(changedFlagsMask, changedFlags);
         }
       }
     }
-    return this.i;
+    return this.j;
   }
   /**
    * Set the current node's state, and recursively mark all of this node's observers as STATE_CHECK
    */
-  o(state, skipQueue) {
-    if (ActiveTransition && ActiveTransition.a.has(this)) {
-      const clone = ActiveTransition.a.get(this);
-      if (clone !== this)
-        return clone.o(state, skipQueue);
-    }
-    if (this.b >= state && !this.G)
+  x(state, skipQueue) {
+    if (this.c >= state && !this.G)
       return;
     this.G = !!skipQueue;
-    this.b = state;
-    if (this.d) {
-      for (let i = 0; i < this.d.length; i++) {
-        this.d[i].o(STATE_CHECK, skipQueue);
+    this.c = state;
+    if (this.b) {
+      for (let i = 0; i < this.b.length; i++) {
+        this.b[i].x(STATE_CHECK, skipQueue);
       }
     }
   }
@@ -688,34 +691,34 @@ var Computation = class extends Owner {
    * @param newFlags The source's new flags, masked to just the changed ones.
    */
   Y(mask, newFlags2) {
-    if (this.b >= STATE_DIRTY)
+    if (this.c >= STATE_DIRTY)
       return;
     if (mask & this.aa) {
-      this.o(STATE_DIRTY);
+      this.x(STATE_DIRTY);
       return;
     }
-    if (this.b >= STATE_CHECK)
+    if (this.c >= STATE_CHECK)
       return;
     const prevFlags = this.h & mask;
     const deltaFlags = prevFlags ^ newFlags2;
     if (newFlags2 === prevFlags) ; else if (deltaFlags & prevFlags & mask) {
-      this.o(STATE_CHECK);
+      this.x(STATE_CHECK);
     } else {
       this.h ^= deltaFlags;
-      if (this.d) {
-        for (let i = 0; i < this.d.length; i++) {
-          this.d[i].Y(mask, newFlags2);
+      if (this.b) {
+        for (let i = 0; i < this.b.length; i++) {
+          this.b[i].Y(mask, newFlags2);
         }
       }
     }
   }
-  M(error) {
-    if (ActiveTransition && !this.j) {
+  N(error) {
+    if (ActiveTransition && !this.g) {
       const clone = cloneGraph(this);
       if (clone !== this)
-        return clone.M(error);
+        return clone.N(error);
     }
-    this.R = error;
+    this.K = error;
     this.write(UNCHANGED, this.h & ~LOADING_BIT | ERROR_BIT | UNINITIALIZED_BIT);
   }
   /**
@@ -726,38 +729,38 @@ var Computation = class extends Owner {
    * This function will ensure that the value and states we read from the computation are up to date
    */
   H() {
-    if (!this.K) {
+    if (!this.L) {
       return;
     }
-    if (this.b === STATE_DISPOSED) {
+    if (this.c === STATE_DISPOSED) {
       return;
     }
-    if (this.b === STATE_CLEAN) {
+    if (this.c === STATE_CLEAN) {
       return;
     }
     let observerFlags = 0;
-    if (this.b === STATE_CHECK) {
+    if (this.c === STATE_CHECK) {
       for (let i = 0; i < this.a.length; i++) {
         const source = ActiveTransition && ActiveTransition.a.get(this.a[i]) || this.a[i];
         source.H();
-        observerFlags |= source.h;
-        if (this.b === STATE_DIRTY) {
+        observerFlags |= source.h & ~UNINITIALIZED_BIT;
+        if (this.c === STATE_DIRTY) {
           break;
         }
       }
     }
-    if (this.b === STATE_DIRTY) {
+    if (this.c === STATE_DIRTY) {
       update(this);
     } else {
       this.write(UNCHANGED, observerFlags);
-      this.b = STATE_CLEAN;
+      this.c = STATE_CLEAN;
     }
   }
   /**
    * Remove ourselves from the owner graph and the computation graph
    */
   J() {
-    if (this.b === STATE_DISPOSED)
+    if (this.c === STATE_DISPOSED)
       return;
     if (this.a)
       removeSourceObservers(this, 0);
@@ -765,8 +768,8 @@ var Computation = class extends Owner {
   }
 };
 function track(computation) {
-  if (ActiveTransition && computation.j)
-    computation = computation.j;
+  if (ActiveTransition && computation.g)
+    computation = computation.g;
   if (currentObserver) {
     if (!newSources && currentObserver.a && currentObserver.a[newSourcesIndex] === computation) {
       newSourcesIndex++;
@@ -776,7 +779,7 @@ function track(computation) {
       newSources.push(computation);
     }
     if (updateCheck) {
-      updateCheck.i = computation.L > currentObserver.L;
+      updateCheck.j = computation.M > currentObserver.M;
     }
   }
 }
@@ -788,13 +791,13 @@ function update(node) {
   try {
     node.dispose(false);
     node.emptyDisposal();
-    const result = compute(node, node.K, node);
+    const result = compute(node, node.L, node);
     node.write(result, newFlags, true);
   } catch (error) {
     if (error instanceof NotReadyError) {
       node.write(UNCHANGED, newFlags | LOADING_BIT | node.h & UNINITIALIZED_BIT);
     } else {
-      node.M(error);
+      node.N(error);
     }
   } finally {
     if (newSources) {
@@ -810,11 +813,11 @@ function update(node) {
       }
       let source;
       for (let i = newSourcesIndex; i < node.a.length; i++) {
-        source = node.a[i];
-        if (!source.d)
-          source.d = [node];
+        source = ActiveTransition && ActiveTransition.a.get(node.a[i]) || node.a[i];
+        if (!source.b)
+          source.b = [node];
         else
-          source.d.push(node);
+          source.b.push(node);
       }
     } else if (node.a && newSourcesIndex < node.a.length) {
       removeSourceObservers(node, newSourcesIndex);
@@ -823,8 +826,23 @@ function update(node) {
     newSources = prevSources;
     newSourcesIndex = prevSourcesIndex;
     newFlags = prevFlags;
-    node.L = clock + 1;
-    node.b = STATE_CLEAN;
+    node.M = clock + 1;
+    node.c = STATE_CLEAN;
+  }
+}
+function removeSourceObservers(node, index) {
+  let source;
+  let swap;
+  for (let i = index; i < node.a.length; i++) {
+    source = ActiveTransition && ActiveTransition.a.get(node.a[i]) || node.a[i];
+    if (source.b) {
+      if ((swap = source.b.indexOf(node)) !== -1) {
+        source.b[swap] = source.b[source.b.length - 1];
+        source.b.pop();
+      }
+      if (!source.b.length)
+        Unobserved.push(source);
+    }
   }
 }
 function isEqual(a, b) {
@@ -837,20 +855,20 @@ function untrack(fn) {
 }
 function hasUpdated(fn) {
   const current = updateCheck;
-  updateCheck = { i: false };
+  updateCheck = { j: false };
   try {
     fn();
-    return updateCheck.i;
+    return updateCheck.j;
   } finally {
     updateCheck = current;
   }
 }
 function pendingCheck(fn, loadingValue) {
   const current = staleCheck;
-  staleCheck = { i: false };
+  staleCheck = { j: false };
   try {
     latest(fn);
-    return staleCheck.i;
+    return staleCheck.j;
   } catch (err) {
     if (!(err instanceof NotReadyError))
       return false;
@@ -898,7 +916,7 @@ function runWithObserver(observer, run) {
         newFlags | LOADING_BIT | observer.h & UNINITIALIZED_BIT
       );
     } else {
-      observer.M(error);
+      observer.N(error);
     }
   } finally {
     if (newSources) {
@@ -913,10 +931,10 @@ function runWithObserver(observer, run) {
       let source;
       for (let i = newSourcesIndex; i < observer.a.length; i++) {
         source = observer.a[i];
-        if (!source.d)
-          source.d = [observer];
+        if (!source.b)
+          source.b = [observer];
         else
-          source.d.push(observer);
+          source.b.push(observer);
       }
     }
     newSources = prevSources;
@@ -930,7 +948,7 @@ function compute(owner, fn, observer) {
   currentMask = observer?.aa ?? DEFAULT_FLAGS;
   notStale = true;
   try {
-    return fn(observer ? observer.i : void 0);
+    return fn.call(observer, observer ? observer.j : void 0);
   } finally {
     setOwner(prevOwner);
     currentObserver = prevObserver;
@@ -943,7 +961,7 @@ function compute(owner, fn, observer) {
 var Effect = class extends Computation {
   ba;
   Z;
-  N;
+  O;
   ca = false;
   _;
   A;
@@ -954,54 +972,54 @@ var Effect = class extends Computation {
     this._ = initialValue;
     this.A = options?.render ? EFFECT_RENDER : EFFECT_USER;
     if (this.A === EFFECT_RENDER) {
-      this.K = (p) => !ActiveTransition && clock > this.l.created && !(this.h & ERROR_BIT) ? latest(() => compute2(p)) : compute2(p);
+      this.L = function(p) {
+        return !this.g && clock > this.l.created && !(this.h & ERROR_BIT) ? latest(() => compute2(p)) : compute2(p);
+      };
     }
     this.H();
     !options?.defer && (this.A === EFFECT_USER ? this.l.enqueue(this.A, this.C.bind(this)) : this.C(this.A));
   }
   write(value, flags = 0) {
-    if (this.b == STATE_DIRTY) {
+    if (this.c == STATE_DIRTY) {
       this.h = flags;
       if (this.A === EFFECT_RENDER) {
-        this.l.notify(this, LOADING_BIT | ERROR_BIT, flags);
+        this.l.notify(this, LOADING_BIT | ERROR_BIT, this.h);
       }
     }
     if (value === UNCHANGED)
-      return this.i;
-    this.i = value;
+      return this.j;
+    this.j = value;
     this.ca = true;
+    this.K = void 0;
     return value;
   }
-  o(state, skipQueue) {
-    if (ActiveTransition && ActiveTransition.a.has(this)) {
-      return ActiveTransition.a.get(this).o(state, skipQueue);
-    }
-    if (this.b >= state || skipQueue)
+  x(state, skipQueue) {
+    if (this.c >= state || skipQueue)
       return;
-    if (this.b === STATE_CLEAN)
+    if (this.c === STATE_CLEAN)
       this.l.enqueue(this.A, this.C.bind(this));
-    this.b = state;
+    this.c = state;
   }
   Y(mask, newFlags2) {
-    if (ActiveTransition && ActiveTransition.a.has(this)) {
-      if (this.b >= STATE_CHECK)
+    if (this.g) {
+      if (this.c >= STATE_DIRTY)
         return;
       if (mask & 3) {
-        this.o(STATE_DIRTY);
+        this.x(STATE_DIRTY);
         return;
       }
     }
     super.Y(mask, newFlags2);
   }
-  M(error) {
-    this.R = error;
+  N(error) {
+    this.K = error;
     this.l.notify(this, LOADING_BIT, 0);
     this.h = ERROR_BIT;
     if (this.A === EFFECT_USER) {
       try {
         return this.Z ? this.Z(error, () => {
-          this.N?.();
-          this.N = void 0;
+          this.O?.();
+          this.O = void 0;
         }) : console.error(error);
       } catch (e) {
         error = e;
@@ -1011,32 +1029,32 @@ var Effect = class extends Computation {
       throw error;
   }
   J() {
-    if (this.b === STATE_DISPOSED)
+    if (this.c === STATE_DISPOSED)
       return;
     this.ba = void 0;
     this._ = void 0;
     this.Z = void 0;
-    this.N?.();
-    this.N = void 0;
+    this.O?.();
+    this.O = void 0;
     super.J();
   }
   C(type) {
     if (type) {
-      const effect = this.j || this;
-      if (effect.ca && effect.b !== STATE_DISPOSED) {
-        effect.N?.();
+      const effect = this.g || this;
+      if (effect.ca && effect.c !== STATE_DISPOSED) {
+        effect.O?.();
         try {
-          effect.N = effect.ba(effect.i, effect._);
+          effect.O = effect.ba(effect.j, effect._);
         } catch (e) {
           if (!effect.l.notify(effect, ERROR_BIT, ERROR_BIT))
             throw e;
         } finally {
-          effect._ = effect.i;
+          effect._ = effect.j;
           effect.ca = false;
         }
       }
     } else
-      this.b !== STATE_CLEAN && runTop(this);
+      this.c !== STATE_CLEAN && runTop(this);
   }
 };
 var EagerComputation = class extends Computation {
@@ -1044,18 +1062,15 @@ var EagerComputation = class extends Computation {
     super(initialValue, compute2, options);
     !options?.defer && this.H();
   }
-  o(state, skipQueue) {
-    if (ActiveTransition && ActiveTransition.a.has(this)) {
-      return ActiveTransition.a.get(this).o(state, skipQueue);
-    }
-    if (this.b >= state && !this.G)
+  x(state, skipQueue) {
+    if (this.c >= state && !this.G)
       return;
-    if (!skipQueue && (this.b === STATE_CLEAN || this.b === STATE_CHECK && this.G))
+    if (!skipQueue && (this.c === STATE_CLEAN || this.c === STATE_CHECK && this.G))
       this.l.enqueue(EFFECT_PURE, this.C.bind(this));
-    super.o(state, skipQueue);
+    super.x(state, skipQueue);
   }
   C() {
-    this.b !== STATE_CLEAN && runTop(this);
+    this.c !== STATE_CLEAN && runTop(this);
   }
 };
 var FirewallComputation = class extends Computation {
@@ -1063,30 +1078,27 @@ var FirewallComputation = class extends Computation {
   constructor(compute2) {
     super(void 0, compute2);
   }
-  o(state, skipQueue) {
-    if (ActiveTransition && ActiveTransition.a.has(this)) {
-      return ActiveTransition.a.get(this).o(state, skipQueue);
-    }
-    if (this.b >= state && !this.G)
+  x(state, skipQueue) {
+    if (this.c >= state && !this.G)
       return;
-    if (!skipQueue && (this.b === STATE_CLEAN || this.b === STATE_CHECK && this.G))
+    if (!skipQueue && (this.c === STATE_CLEAN || this.c === STATE_CHECK && this.G))
       this.l.enqueue(EFFECT_PURE, this.C.bind(this));
-    super.o(state, true);
+    super.x(state, true);
     this.G = !!skipQueue;
   }
   C() {
-    this.b !== STATE_CLEAN && runTop(this);
+    this.c !== STATE_CLEAN && runTop(this);
   }
 };
 function runTop(node) {
   const ancestors = [];
   for (let current = node; current !== null; current = current.m) {
-    if (current.b !== STATE_CLEAN) {
+    if (current.c !== STATE_CLEAN) {
       ancestors.push(current);
     }
   }
   for (let i = ancestors.length - 1; i >= 0; i--) {
-    if (ancestors[i].b !== STATE_DISPOSED)
+    if (ancestors[i].c !== STATE_DISPOSED)
       ancestors[i].H();
   }
 }
@@ -1221,7 +1233,7 @@ var storeTraps = {
         return desc.get.call(receiver);
     }
     if (Writing?.has(receiver)) {
-      let value2 = tracked && (overridden || !proxySource) ? tracked.i : storeValue[property];
+      let value2 = tracked && (overridden || !proxySource) ? tracked.j : storeValue[property];
       value2 === $DELETED && (value2 = void 0);
       if (!isWrappable(value2))
         return value2;
@@ -1512,6 +1524,8 @@ function applyState(next, state, keyFn, all) {
 }
 function reconcile(value, key, all = false) {
   return (state) => {
+    if (state == null)
+      throw new Error("Cannot reconcile null or undefined state");
     const keyFn = typeof key === "string" ? (item) => item[key] : key;
     const eq = keyFn(state);
     if (eq !== void 0 && keyFn(value) !== keyFn(state))
@@ -1751,12 +1765,12 @@ function createMemo(compute2, value, options) {
   let resolvedValue;
   return () => {
     if (node) {
-      if (node.b === STATE_DISPOSED) {
+      if (node.c === STATE_DISPOSED) {
         node = void 0;
         return resolvedValue;
       }
       resolvedValue = node.wait();
-      if (!node.a?.length && node.s?.m !== node) {
+      if (!node.a?.length && node.r?.m !== node && !(node.h & UNINITIALIZED_BIT)) {
         node.dispose();
         node = void 0;
       }
@@ -1792,8 +1806,8 @@ function createAsync(compute2, value, options) {
             if (abort)
               return;
             if (transition2)
-              return transition2.runTransition(() => node.M(error), true);
-            node.M(error);
+              return transition2.runTransition(() => node.N(error), true);
+            node.N(error);
           }
         );
       } else {
@@ -1817,9 +1831,13 @@ function createAsync(compute2, value, options) {
   );
   const read = node.wait.bind(node);
   read.refresh = () => {
-    node.b = STATE_DIRTY;
+    let n = node;
+    if (ActiveTransition && !node.g) {
+      n = cloneGraph(node);
+    }
+    n.c = STATE_DIRTY;
     refreshing = true;
-    node.H();
+    n.H();
   };
   return read;
 }
@@ -1900,7 +1918,7 @@ function createOptimistic(initial, compute2, key) {
       (s) => {
         const value = initial();
         if (!ActiveTransition)
-          s.value = value;
+          reconcile({ value }, key)(s);
       },
       { value: void 0 }
     );
@@ -1908,9 +1926,9 @@ function createOptimistic(initial, compute2, key) {
     [store, setStore] = createStore({ value: initial });
   const reset = () => setStore(
     (s) => reconcile(
-      typeof initial === "function" ? initial() : initial,
+      { value: typeof initial === "function" ? initial() : initial },
       key
-    )(s.value)
+    )(s)
   );
   let lastChange = void 0;
   function write(v) {
@@ -1932,15 +1950,15 @@ function mapArray(list, map, options) {
   const keyFn = typeof options?.keyed === "function" ? options.keyed : void 0;
   return updateKeyedMap.bind({
     S: new Owner(),
-    p: 0,
+    o: 0,
     ha: list,
     D: [],
-    O: map,
-    g: [],
-    c: [],
-    P: keyFn,
-    q: keyFn || options?.keyed === false ? [] : void 0,
-    r: map.length > 1 ? [] : void 0,
+    P: map,
+    i: [],
+    d: [],
+    Q: keyFn,
+    p: keyFn || options?.keyed === false ? [] : void 0,
+    q: map.length > 1 ? [] : void 0,
     T: options?.fallback
   });
 }
@@ -1949,113 +1967,113 @@ function updateKeyedMap() {
   const newItems = this.ha() || [], newLen = newItems.length;
   newItems[$TRACK];
   runWithOwner(this.S, () => {
-    let i, j, mapper = this.q ? () => {
-      this.q[j] = new Computation(newItems[j], null, pureOptions);
-      this.r && (this.r[j] = new Computation(j, null, pureOptions));
-      return this.O(
-        Computation.prototype.read.bind(this.q[j]),
-        this.r ? Computation.prototype.read.bind(this.r[j]) : void 0
+    let i, j, mapper = this.p ? () => {
+      this.p[j] = new Computation(newItems[j], null, pureOptions);
+      this.q && (this.q[j] = new Computation(j, null, pureOptions));
+      return this.P(
+        Computation.prototype.read.bind(this.p[j]),
+        this.q ? Computation.prototype.read.bind(this.q[j]) : void 0
       );
-    } : this.r ? () => {
+    } : this.q ? () => {
       const item = newItems[j];
-      this.r[j] = new Computation(j, null, pureOptions);
-      return this.O(() => item, Computation.prototype.read.bind(this.r[j]));
+      this.q[j] = new Computation(j, null, pureOptions);
+      return this.P(() => item, Computation.prototype.read.bind(this.q[j]));
     } : () => {
       const item = newItems[j];
-      return this.O(() => item);
+      return this.P(() => item);
     };
     if (newLen === 0) {
-      if (this.p !== 0) {
+      if (this.o !== 0) {
         this.S.dispose(false);
-        this.c = [];
+        this.d = [];
         this.D = [];
-        this.g = [];
-        this.p = 0;
+        this.i = [];
+        this.o = 0;
+        this.p && (this.p = []);
         this.q && (this.q = []);
-        this.r && (this.r = []);
       }
-      if (this.T && !this.g[0]) {
-        this.g[0] = compute(
-          this.c[0] = new Owner(),
+      if (this.T && !this.i[0]) {
+        this.i[0] = compute(
+          this.d[0] = new Owner(),
           this.T,
           null
         );
       }
-    } else if (this.p === 0) {
-      if (this.c[0])
-        this.c[0].dispose();
-      this.g = new Array(newLen);
+    } else if (this.o === 0) {
+      if (this.d[0])
+        this.d[0].dispose();
+      this.i = new Array(newLen);
       for (j = 0; j < newLen; j++) {
         this.D[j] = newItems[j];
-        this.g[j] = compute(this.c[j] = new Owner(), mapper, null);
+        this.i[j] = compute(this.d[j] = new Owner(), mapper, null);
       }
-      this.p = newLen;
+      this.o = newLen;
     } else {
-      let start, end, newEnd, item, key, newIndices, newIndicesNext, temp = new Array(newLen), tempNodes = new Array(newLen), tempRows = this.q ? new Array(newLen) : void 0, tempIndexes = this.r ? new Array(newLen) : void 0;
-      for (start = 0, end = Math.min(this.p, newLen); start < end && (this.D[start] === newItems[start] || this.q && compare(this.P, this.D[start], newItems[start])); start++) {
-        if (this.q)
-          this.q[start].write(newItems[start]);
+      let start, end, newEnd, item, key, newIndices, newIndicesNext, temp = new Array(newLen), tempNodes = new Array(newLen), tempRows = this.p ? new Array(newLen) : void 0, tempIndexes = this.q ? new Array(newLen) : void 0;
+      for (start = 0, end = Math.min(this.o, newLen); start < end && (this.D[start] === newItems[start] || this.p && compare(this.Q, this.D[start], newItems[start])); start++) {
+        if (this.p)
+          this.p[start].write(newItems[start]);
       }
-      for (end = this.p - 1, newEnd = newLen - 1; end >= start && newEnd >= start && (this.D[end] === newItems[newEnd] || this.q && compare(this.P, this.D[end], newItems[newEnd])); end--, newEnd--) {
-        temp[newEnd] = this.g[end];
-        tempNodes[newEnd] = this.c[end];
-        tempRows && (tempRows[newEnd] = this.q[end]);
-        tempIndexes && (tempIndexes[newEnd] = this.r[end]);
+      for (end = this.o - 1, newEnd = newLen - 1; end >= start && newEnd >= start && (this.D[end] === newItems[newEnd] || this.p && compare(this.Q, this.D[end], newItems[newEnd])); end--, newEnd--) {
+        temp[newEnd] = this.i[end];
+        tempNodes[newEnd] = this.d[end];
+        tempRows && (tempRows[newEnd] = this.p[end]);
+        tempIndexes && (tempIndexes[newEnd] = this.q[end]);
       }
       newIndices = /* @__PURE__ */ new Map();
       newIndicesNext = new Array(newEnd + 1);
       for (j = newEnd; j >= start; j--) {
         item = newItems[j];
-        key = this.P ? this.P(item) : item;
+        key = this.Q ? this.Q(item) : item;
         i = newIndices.get(key);
         newIndicesNext[j] = i === void 0 ? -1 : i;
         newIndices.set(key, j);
       }
       for (i = start; i <= end; i++) {
         item = this.D[i];
-        key = this.P ? this.P(item) : item;
+        key = this.Q ? this.Q(item) : item;
         j = newIndices.get(key);
         if (j !== void 0 && j !== -1) {
-          temp[j] = this.g[i];
-          tempNodes[j] = this.c[i];
-          tempRows && (tempRows[j] = this.q[i]);
-          tempIndexes && (tempIndexes[j] = this.r[i]);
+          temp[j] = this.i[i];
+          tempNodes[j] = this.d[i];
+          tempRows && (tempRows[j] = this.p[i]);
+          tempIndexes && (tempIndexes[j] = this.q[i]);
           j = newIndicesNext[j];
           newIndices.set(key, j);
         } else
-          this.c[i].dispose();
+          this.d[i].dispose();
       }
       for (j = start; j < newLen; j++) {
         if (j in temp) {
-          this.g[j] = temp[j];
-          this.c[j] = tempNodes[j];
+          this.i[j] = temp[j];
+          this.d[j] = tempNodes[j];
           if (tempRows) {
-            this.q[j] = tempRows[j];
-            this.q[j].write(newItems[j]);
+            this.p[j] = tempRows[j];
+            this.p[j].write(newItems[j]);
           }
           if (tempIndexes) {
-            this.r[j] = tempIndexes[j];
-            this.r[j].write(j);
+            this.q[j] = tempIndexes[j];
+            this.q[j].write(j);
           }
         } else {
-          this.g[j] = compute(this.c[j] = new Owner(), mapper, null);
+          this.i[j] = compute(this.d[j] = new Owner(), mapper, null);
         }
       }
-      this.g = this.g.slice(0, this.p = newLen);
+      this.i = this.i.slice(0, this.o = newLen);
       this.D = newItems.slice(0);
     }
   });
-  return this.g;
+  return this.i;
 }
 function repeat(count, map, options) {
   return updateRepeat.bind({
     S: new Owner(),
-    p: 0,
+    o: 0,
     y: 0,
     ia: count,
-    O: map,
-    c: [],
-    g: [],
+    P: map,
+    d: [],
+    i: [],
     ja: options?.from,
     T: options?.fallback
   });
@@ -2065,15 +2083,15 @@ function updateRepeat() {
   const from = this.ja?.() || 0;
   runWithOwner(this.S, () => {
     if (newLen === 0) {
-      if (this.p !== 0) {
+      if (this.o !== 0) {
         this.S.dispose(false);
-        this.c = [];
-        this.g = [];
-        this.p = 0;
+        this.d = [];
+        this.i = [];
+        this.o = 0;
       }
-      if (this.T && !this.g[0]) {
-        this.g[0] = compute(
-          this.c[0] = new Owner(),
+      if (this.T && !this.i[0]) {
+        this.i[0] = compute(
+          this.d[0] = new Owner(),
           this.T,
           null
         );
@@ -2081,46 +2099,46 @@ function updateRepeat() {
       return;
     }
     const to = from + newLen;
-    const prevTo = this.y + this.p;
-    if (this.p === 0 && this.c[0])
-      this.c[0].dispose();
+    const prevTo = this.y + this.o;
+    if (this.o === 0 && this.d[0])
+      this.d[0].dispose();
     for (let i = to; i < prevTo; i++)
-      this.c[i - this.y].dispose();
+      this.d[i - this.y].dispose();
     if (this.y < from) {
       let i = this.y;
-      while (i < from && i < this.p)
-        this.c[i++].dispose();
-      this.c.splice(0, from - this.y);
-      this.g.splice(0, from - this.y);
+      while (i < from && i < this.o)
+        this.d[i++].dispose();
+      this.d.splice(0, from - this.y);
+      this.i.splice(0, from - this.y);
     } else if (this.y > from) {
       let i = prevTo - this.y - 1;
       let difference = this.y - from;
-      this.c.length = this.g.length = newLen;
+      this.d.length = this.i.length = newLen;
       while (i >= difference) {
-        this.c[i] = this.c[i - difference];
-        this.g[i] = this.g[i - difference];
+        this.d[i] = this.d[i - difference];
+        this.i[i] = this.i[i - difference];
         i--;
       }
       for (let i2 = 0; i2 < difference; i2++) {
-        this.g[i2] = compute(
-          this.c[i2] = new Owner(),
-          () => this.O(i2 + from),
+        this.i[i2] = compute(
+          this.d[i2] = new Owner(),
+          () => this.P(i2 + from),
           null
         );
       }
     }
     for (let i = prevTo; i < to; i++) {
-      this.g[i - from] = compute(
-        this.c[i - from] = new Owner(),
-        () => this.O(i),
+      this.i[i - from] = compute(
+        this.d[i - from] = new Owner(),
+        () => this.P(i),
         null
       );
     }
-    this.g = this.g.slice(0, newLen);
+    this.i = this.i.slice(0, newLen);
     this.y = from;
-    this.p = newLen;
+    this.o = newLen;
   });
-  return this.g;
+  return this.i;
 }
 function compare(key, a, b) {
   return key ? key(a) === key(b) : true;
@@ -2139,7 +2157,7 @@ var BoundaryComputation = class extends EagerComputation {
       flags &= ~LOADING_BIT;
     }
     this.l.notify(this, this.U, flags);
-    return this.i;
+    return this.j;
   }
 };
 function createBoundChildren(owner, fn, queue, mask) {
@@ -2156,27 +2174,27 @@ function createBoundChildren(owner, fn, queue, mask) {
   );
 }
 var ConditionalQueue = class extends Queue {
-  u;
+  t;
   V = /* @__PURE__ */ new Set();
-  t = /* @__PURE__ */ new Set();
+  s = /* @__PURE__ */ new Set();
   constructor(disabled) {
     super();
-    this.u = disabled;
+    this.t = disabled;
   }
   run(type) {
-    if (!type || this.u.read())
+    if (!type || this.t.read())
       return;
     return super.run(type);
   }
   notify(node, type, flags) {
-    if (ActiveTransition && ActiveTransition.w.has(this))
-      return ActiveTransition.w.get(this).notify(node, type, flags);
-    if (this.u.read()) {
+    if (ActiveTransition && ActiveTransition.u.has(this))
+      return ActiveTransition.u.get(this).notify(node, type, flags);
+    if (this.t.read()) {
       if (type & LOADING_BIT) {
         if (flags & LOADING_BIT) {
-          this.t.add(node);
+          this.s.add(node);
           type &= ~LOADING_BIT;
-        } else if (this.t.delete(node))
+        } else if (this.s.delete(node))
           type &= ~LOADING_BIT;
       }
       if (type & ERROR_BIT) {
@@ -2190,43 +2208,43 @@ var ConditionalQueue = class extends Queue {
     return type ? super.notify(node, type, flags) : true;
   }
   merge(queue) {
-    queue.t.forEach((n) => this.notify(n, LOADING_BIT, LOADING_BIT));
+    queue.s.forEach((n) => this.notify(n, LOADING_BIT, LOADING_BIT));
     queue.V.forEach((n) => this.notify(n, ERROR_BIT, ERROR_BIT));
     super.merge(queue);
   }
 };
 var CollectionQueue = class extends Queue {
   F;
-  c = /* @__PURE__ */ new Set();
-  u = new Computation(false, null, { pureWrite: true });
+  d = /* @__PURE__ */ new Set();
+  t = new Computation(false, null, { pureWrite: true });
   constructor(type) {
     super();
     this.F = type;
   }
   run(type) {
-    if (!type || this.u.read())
+    if (!type || this.t.read())
       return;
     return super.run(type);
   }
   notify(node, type, flags) {
-    if (ActiveTransition && ActiveTransition.w.has(this))
-      return ActiveTransition.w.get(this).notify(node, type, flags);
+    if (ActiveTransition && ActiveTransition.u.has(this))
+      return ActiveTransition.u.get(this).notify(node, type, flags);
     if (!(type & this.F))
       return super.notify(node, type, flags);
     if (flags & this.F) {
-      this.c.add(node);
-      if (this.c.size === 1)
-        this.u.write(true);
+      this.d.add(node);
+      if (this.d.size === 1)
+        this.t.write(true);
     } else {
-      this.c.delete(node);
-      if (this.c.size === 0)
-        this.u.write(false);
+      this.d.delete(node);
+      if (this.d.size === 0)
+        this.t.write(false);
     }
     type &= ~this.F;
     return type ? super.notify(node, type, flags) : true;
   }
   merge(queue) {
-    queue.c.forEach((n) => this.notify(n, this.F, this.F));
+    queue.d.forEach((n) => this.notify(n, this.F, this.F));
     super.merge(queue);
   }
 };
@@ -2237,25 +2255,25 @@ function createBoundary(fn, condition) {
   );
   const tree = createBoundChildren(owner, fn, queue, 0);
   new EagerComputation(void 0, () => {
-    const disabled = queue.u.read();
+    const disabled = queue.t.read();
     tree.U = disabled ? ERROR_BIT | LOADING_BIT : 0;
     if (!disabled) {
-      queue.t.forEach((node) => queue.notify(node, LOADING_BIT, LOADING_BIT));
+      queue.s.forEach((node) => queue.notify(node, LOADING_BIT, LOADING_BIT));
       queue.V.forEach((node) => queue.notify(node, ERROR_BIT, ERROR_BIT));
-      queue.t.clear();
+      queue.s.clear();
       queue.V.clear();
     }
   });
-  return () => queue.u.read() ? void 0 : tree.read();
+  return () => queue.t.read() ? void 0 : tree.read();
 }
 function createCollectionBoundary(type, fn, fallback) {
   const owner = new Owner();
   const queue = new CollectionQueue(type);
   const tree = createBoundChildren(owner, fn, queue, type);
   const decision = new Computation(void 0, () => {
-    if (!queue.u.read()) {
+    if (!queue.t.read()) {
       const resolved = tree.read();
-      if (!queue.u.read())
+      if (!queue.t.read())
         return resolved;
     }
     return fallback(queue);
@@ -2267,12 +2285,14 @@ function createSuspense(fn, fallback) {
 }
 function createErrorBoundary(fn, fallback) {
   return createCollectionBoundary(ERROR_BIT, fn, (queue) => {
-    let node = queue.c.values().next().value;
+    let node = queue.d.values().next().value;
     ActiveTransition && ActiveTransition.a.has(node) && (node = ActiveTransition.a.get(node));
-    return fallback(node.R, () => {
+    return fallback(node.K, () => {
       incrementClock();
-      for (let node2 of queue.c) {
-        node2.b = STATE_DIRTY;
+      for (let node2 of queue.d) {
+        if (ActiveTransition && !node2.g)
+          node2 = cloneGraph(node2);
+        node2.c = STATE_DIRTY;
         node2.l?.enqueue(node2.A, node2.C.bind(node2));
       }
     });