@solidjs/signals 0.6.4 → 0.7.1

package/dist/prod.js

@@ -45,13 +45,13 @@ function schedule() {
   if (scheduled)
     return;
   scheduled = true;
-  if (!globalQueue.y)
+  if (!globalQueue.B)
     queueMicrotask(flush);
 }
 function notifyUnobserved() {
   for (let i = 0; i < Unobserved.length; i++) {
     const source = Unobserved[i];
-    if (!source.b || !source.b.length)
+    if (!source.c || !source.c.length)
       Unobserved[i].ea?.();
   }
   Unobserved = [];
@@ -59,7 +59,7 @@ function notifyUnobserved() {
 var pureQueue = [];
 var Queue = class {
   k = null;
-  y = false;
+  B = false;
   g = [[], []];
   f = [];
   created = clock;
@@ -84,9 +84,9 @@ var Queue = class {
     }
   }
   flush() {
-    if (this.y)
+    if (this.B)
       return;
-    this.y = true;
+    this.B = true;
     try {
       this.run(EFFECT_PURE);
       incrementClock();
@@ -94,19 +94,19 @@ var Queue = class {
       this.run(EFFECT_RENDER);
       this.run(EFFECT_USER);
     } finally {
-      this.y = false;
+      this.B = false;
       Unobserved.length && notifyUnobserved();
     }
   }
   addChild(child) {
-    if (ActiveTransition && ActiveTransition.G.has(this))
-      return ActiveTransition.G.get(this).addChild(child);
+    if (ActiveTransition && ActiveTransition.H.has(this))
+      return ActiveTransition.H.get(this).addChild(child);
     this.f.push(child);
     child.k = this;
   }
   removeChild(child) {
-    if (ActiveTransition && ActiveTransition.G.has(this))
-      return ActiveTransition.G.get(this).removeChild(child);
+    if (ActiveTransition && ActiveTransition.H.has(this))
+      return ActiveTransition.H.get(this).removeChild(child);
     const index = this.f.indexOf(child);
     if (index >= 0) {
       this.f.splice(index, 1);
@@ -122,7 +122,7 @@ var Queue = class {
     this.g[0].push.apply(this.g[0], queue.g[0]);
     this.g[1].push.apply(this.g[1], queue.g[1]);
     for (let i = 0; i < queue.f.length; i++) {
-      const og = this.f.find((c) => c.e === queue.f[i].e);
+      const og = this.f.find((c) => c.d === queue.f[i].d);
       if (og)
         og.merge(queue.f[i]);
       else
@@ -141,12 +141,12 @@ function removeSourceObservers(node, index) {
   let swap;
   for (let i = index; i < node.a.length; i++) {
     source = getTransitionSource(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.c) {
+      if ((swap = source.c.indexOf(node)) !== -1) {
+        source.c[swap] = source.c[source.c.length - 1];
+        source.c.pop();
       }
-      if (!source.b.length)
+      if (!source.c.length)
         Unobserved.push(source);
     }
   }
@@ -157,35 +157,35 @@ function runQueue(queue, type) {
 }
 var Transition = class _Transition {
   a = /* @__PURE__ */ new Map();
-  r = /* @__PURE__ */ new Set();
-  H = /* @__PURE__ */ new Set();
+  s = /* @__PURE__ */ new Set();
   I = /* @__PURE__ */ new Set();
-  B = false;
+  J = /* @__PURE__ */ new Set();
+  E = false;
   g = [[], []];
-  G = /* @__PURE__ */ new Map();
-  J = [];
+  H = /* @__PURE__ */ new Map();
+  K = [];
   f = [];
   k = null;
-  y = false;
+  B = false;
   Y = false;
-  e = globalQueue;
+  d = globalQueue;
   created = clock;
   constructor() {
-    this.G.set(globalQueue, this);
+    this.H.set(globalQueue, this);
     for (const child of globalQueue.f) {
       cloneQueue(child, this, this);
     }
   }
   enqueue(type, fn) {
-    this.J.push(fn);
+    this.K.push(fn);
     if (type)
       this.g[type - 1].push(fn);
     this.schedule();
   }
   run(type) {
     if (type === EFFECT_PURE) {
-      this.J.length && runQueue(this.J, type);
-      this.J = [];
+      this.K.length && runQueue(this.K, type);
+      this.K = [];
       return;
     } else if (this.g[type - 1].length) {
       const effects = this.g[type - 1];
@@ -197,9 +197,9 @@ var Transition = class _Transition {
     }
   }
   flush() {
-    if (this.y)
+    if (this.B)
       return;
-    this.y = true;
+    this.B = true;
     let currentTransition = ActiveTransition;
     ActiveTransition = this;
     try {
@@ -209,7 +209,7 @@ var Transition = class _Transition {
       ActiveTransition = currentTransition;
       finishTransition(this);
     } finally {
-      this.y = false;
+      this.B = false;
       ActiveTransition = currentTransition;
     }
   }
@@ -226,18 +226,18 @@ var Transition = class _Transition {
     if (!(type & LOADING_BIT))
       return false;
     if (flags & LOADING_BIT) {
-      this.r.add(node);
+      this.s.add(node);
     } else {
-      this.r.delete(node);
+      this.s.delete(node);
     }
     return true;
   }
   merge(queue) {
     this.g[0].push.apply(this.g[0], queue.g[0]);
     this.g[1].push.apply(this.g[1], queue.g[1]);
-    this.J.push.apply(this.J, queue.J);
+    this.K.push.apply(this.K, queue.K);
     for (let i = 0; i < queue.f.length; i++) {
-      const og = this.f.find((c) => c.e === queue.f[i].e);
+      const og = this.f.find((c) => c.d === queue.f[i].d);
       if (og)
         og.merge(queue.f[i]);
       else
@@ -248,13 +248,13 @@ var Transition = class _Transition {
     if (this.Y)
       return;
     this.Y = true;
-    if (!this.y)
+    if (!this.B)
       queueMicrotask(() => this.flush());
   }
   runTransition(fn, force = false) {
-    if (this.B) {
-      if (this.B instanceof _Transition)
-        return this.B.runTransition(fn, force);
+    if (this.E) {
+      if (this.E instanceof _Transition)
+        return this.E.runTransition(fn, force);
       if (!force)
         throw new Error("Transition already completed");
       fn();
@@ -269,12 +269,12 @@ var Transition = class _Transition {
           let temp, value;
           while (!(temp = result.next(value)).done) {
             if (temp.value instanceof Promise) {
-              transition2.H.add(temp.value);
+              transition2.I.add(temp.value);
               try {
                 value = await temp.value;
               } finally {
                 transition2 = latestTransition(transition2);
-                transition2.H.delete(temp.value);
+                transition2.I.delete(temp.value);
               }
               ActiveTransition = transition2;
             } else
@@ -285,10 +285,10 @@ var Transition = class _Transition {
         })();
       }
       if (result instanceof Promise) {
-        transition2.H.add(result);
+        transition2.I.add(result);
         result.finally(() => {
           transition2 = latestTransition(transition2);
-          transition2.H.delete(result);
+          transition2.I.delete(result);
           ActiveTransition = null;
           finishTransition(transition2);
         });
@@ -306,7 +306,7 @@ var Transition = class _Transition {
       return;
     }
     fn.j = this;
-    this.I.add(fn);
+    this.J.add(fn);
   }
 };
 function transition(fn) {
@@ -325,29 +325,29 @@ function cloneGraph(node, optimistic) {
   Object.assign(clone, node, {
     n: null,
     m: null,
-    b: null,
+    c: null,
     a: node.a ? [...node.a] : null,
-    e: node,
-    I: !!optimistic
+    d: node,
+    J: !!optimistic
   });
-  delete clone.S;
+  delete clone.T;
   ActiveTransition.a.set(node, clone);
   node.j = ActiveTransition;
   if (!optimistic && node.a) {
     for (let i = 0; i < node.a.length; i++)
-      node.a[i].b.push(clone);
+      node.a[i].c.push(clone);
   }
-  if (node.b) {
-    clone.b = [];
-    for (let i = 0, length = node.b.length; i < length; i++) {
-      !node.b[i].e && clone.b.push(cloneGraph(node.b[i], optimistic));
+  if (node.c) {
+    clone.c = [];
+    for (let i = 0, length = node.c.length; i < length; i++) {
+      !node.c[i].d && clone.c.push(cloneGraph(node.c[i], optimistic));
     }
   }
   return clone;
 }
 function latestTransition(t) {
-  while (t.B instanceof Transition)
-    t = t.B;
+  while (t.E instanceof Transition)
+    t = t.E;
   return t;
 }
 function replaceSourceObservers(node, transition2) {
@@ -357,16 +357,16 @@ function replaceSourceObservers(node, transition2) {
   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.e : source.b[source.b.length - 1];
-      !transitionSource && source.b.pop();
+    if (source.c && (swap = source.c.indexOf(node)) !== -1) {
+      source.c[swap] = transitionSource ? node.d : source.c[source.c.length - 1];
+      !transitionSource && source.c.pop();
     }
   }
 }
 function cloneQueue(queue, parent, transition2) {
   const clone = Object.create(Object.getPrototypeOf(queue));
   Object.assign(clone, queue, {
-    e: queue,
+    d: queue,
     k: parent,
     f: [],
     enqueue(type, fn) {
@@ -374,8 +374,8 @@ function cloneQueue(queue, parent, transition2) {
       transition2.enqueue(type, fn);
     },
     notify(node, type, flags) {
-      node = node.e || node;
-      if (!clone.K || type & LOADING_BIT) {
+      node = node.d || node;
+      if (!clone.L || type & LOADING_BIT) {
         type &= ~LOADING_BIT;
         transition2 = latestTransition(transition2);
         transition2.notify(node, LOADING_BIT, flags);
@@ -386,14 +386,14 @@ function cloneQueue(queue, parent, transition2) {
     }
   });
   parent.f.push(clone);
-  transition2.G.set(queue, clone);
+  transition2.H.set(queue, clone);
   for (const child of queue.f) {
     cloneQueue(child, clone, transition2);
   }
 }
 function resolveQueues(children) {
   for (const child of children) {
-    const og = child.e;
+    const og = child.d;
     if (og) {
       const clonedChildren = child.f;
       delete child.enqueue;
@@ -401,10 +401,10 @@ function resolveQueues(children) {
       delete child.k;
       delete child.f;
       Object.assign(og, child);
-      delete og.e;
+      delete og.d;
       resolveQueues(clonedChildren);
-    } else if (child.k.e) {
-      child.k.e.addChild(child);
+    } else if (child.k.d) {
+      child.k.d.addChild(child);
     }
   }
 }
@@ -413,21 +413,21 @@ function mergeTransitions(t1, t2) {
     key.j = t1;
     t1.a.set(key, value);
   });
-  t2.I.forEach((c) => {
+  t2.J.forEach((c) => {
     c.j = t1;
-    t1.I.add(c);
+    t1.J.add(c);
   });
-  t2.H.forEach((p) => t1.H.add(p));
-  t2.r.forEach((n) => t1.r.add(n));
+  t2.I.forEach((p) => t1.I.add(p));
+  t2.s.forEach((n) => t1.s.add(n));
   t1.merge(t2);
-  t2.B = t1;
+  t2.E = t1;
 }
 function getTransitionSource(input) {
   return ActiveTransition && ActiveTransition.a.get(input) || input;
 }
 function getQueue(node) {
-  const transition2 = ActiveTransition || node.e?.j;
-  return transition2 && transition2.G.get(node.z) || node.z;
+  const transition2 = ActiveTransition || node.d?.j;
+  return transition2 && transition2.H.get(node.C) || node.C;
 }
 function initialDispose(node) {
   let current = node.m;
@@ -440,7 +440,7 @@ function initialDispose(node) {
   }
 }
 function finishTransition(transition2) {
-  if (transition2.B || transition2.Y || transition2.H.size || transition2.r.size)
+  if (transition2.E || transition2.Y || transition2.I.size || transition2.s.size)
     return;
   globalQueue.g[0].push.apply(globalQueue.g[0], transition2.g[0]);
   globalQueue.g[1].push.apply(globalQueue.g[1], transition2.g[1]);
@@ -452,14 +452,14 @@ function finishTransition(transition2) {
     }
     if (clone.a)
       replaceSourceObservers(clone, transition2);
-    if (clone.I) {
+    if (clone.J) {
       clone.dispose();
       clone.emptyDisposal();
       delete source.j;
       continue;
     }
-    if (clone.Z || clone.c === STATE_DISPOSED) {
-      source.dispose(clone.c === STATE_DISPOSED);
+    if (clone.Z || clone.b === STATE_DISPOSED) {
+      source.dispose(clone.b === STATE_DISPOSED);
       source.emptyDisposal();
       delete clone.Z;
     } else {
@@ -467,18 +467,18 @@ function finishTransition(transition2) {
       delete clone.n;
     }
     Object.assign(source, clone);
-    delete source.e;
+    delete source.d;
     let current = clone.m;
-    if (current?.t === clone)
-      current.t = source;
+    if (current?.y === clone)
+      current.y = source;
     while (current?.k === clone) {
       current.k = source;
       current = current.m;
     }
     delete source.j;
   }
-  transition2.B = true;
-  for (const reset of transition2.I) {
+  transition2.E = true;
+  for (const reset of transition2.J) {
     delete reset.j;
     reset();
   }
@@ -502,11 +502,11 @@ var Owner = class {
   // See comment at the top of the file for an example of the _nextSibling traversal
   k = null;
   m = null;
-  t = null;
-  c = STATE_CLEAN;
+  y = null;
+  b = STATE_CLEAN;
   n = null;
-  u = defaultContext;
-  z = globalQueue;
+  z = defaultContext;
+  C = globalQueue;
   fa = 0;
   id = null;
   constructor(id = null, skipAppend = false) {
@@ -517,23 +517,23 @@ var Owner = class {
   }
   append(child) {
     child.k = this;
-    child.t = this;
+    child.y = this;
     if (this.m)
-      this.m.t = child;
+      this.m.y = child;
     child.m = this.m;
     this.m = child;
     if (this.id != null && child.id == null)
       child.id = this.getNextChildId();
-    if (child.u !== this.u) {
-      child.u = { ...this.u, ...child.u };
+    if (child.z !== this.z) {
+      child.z = { ...this.z, ...child.z };
     }
-    if (this.z)
-      child.z = this.z;
+    if (this.C)
+      child.C = this.C;
   }
   dispose(self = true) {
-    if (this.c === STATE_DISPOSED)
+    if (this.b === STATE_DISPOSED)
       return;
-    let head = self ? this.t || this.k : this, current = this.m, next = null;
+    let head = self ? this.y || this.k : this, current = this.m, next = null;
     while (current && current.k === this) {
       current.dispose(true);
       next = current.m;
@@ -542,19 +542,19 @@ var Owner = class {
     }
     this.fa = 0;
     if (self)
-      this.T();
+      this.M();
     if (current)
-      current.t = !self ? this : this.t;
+      current.y = !self ? this : this.y;
     if (head)
       head.m = current;
   }
-  T() {
-    if (this.t)
-      this.t.m = null;
+  M() {
+    if (this.y)
+      this.y.m = null;
     this.k = null;
-    this.t = null;
-    this.u = defaultContext;
-    this.c = STATE_DISPOSED;
+    this.y = null;
+    this.z = defaultContext;
+    this.b = STATE_DISPOSED;
     this.emptyDisposal();
   }
   emptyDisposal() {
@@ -583,7 +583,7 @@ function getContext(context, owner = currentOwner) {
   if (!owner) {
     throw new NoOwnerError();
   }
-  const value = hasContext(context, owner) ? owner.u[context.id] : context.defaultValue;
+  const value = hasContext(context, owner) ? owner.z[context.id] : context.defaultValue;
   if (isUndefined(value)) {
     throw new ContextNotFoundError();
   }
@@ -593,13 +593,13 @@ function setContext(context, value, owner = currentOwner) {
   if (!owner) {
     throw new NoOwnerError();
   }
-  owner.u = {
-    ...owner.u,
+  owner.z = {
+    ...owner.z,
     [context.id]: isUndefined(value) ? context.defaultValue : value
   };
 }
 function hasContext(context, owner = currentOwner) {
-  return !isUndefined(owner?.u[context.id]);
+  return !isUndefined(owner?.z[context.id]);
 }
 function onCleanup(fn) {
   if (!currentOwner)
@@ -637,10 +637,10 @@ function getObserver() {
 var UNCHANGED = Symbol(0);
 var Computation = class extends Owner {
   a = null;
-  b = null;
+  c = null;
   l;
-  M;
-  N;
+  O;
+  P;
   // Used in __DEV__ mode, hopefully removed in production
   la;
   // Using false is an optimization as an alternative to _equals: () => false
@@ -649,19 +649,19 @@ var Computation = class extends Owner {
   ea;
   ha = false;
   /** Whether the computation is an error or has ancestors that are unresolved */
-  h = 0;
+  i = 0;
   /** Which flags raised by sources are handled, vs. being passed through. */
   ba = DEFAULT_FLAGS;
-  O = -1;
-  C = false;
+  Q = -1;
+  F = false;
   j;
-  e;
-  I = false;
+  d;
+  J = false;
   constructor(initialValue, compute2, options) {
     super(options?.id, compute2 === null);
-    this.N = compute2;
-    this.c = compute2 ? STATE_DIRTY : STATE_CLEAN;
-    this.h = compute2 && initialValue === void 0 ? UNINITIALIZED_BIT : 0;
+    this.P = compute2;
+    this.b = compute2 ? STATE_DIRTY : STATE_CLEAN;
+    this.i = compute2 && initialValue === void 0 ? UNINITIALIZED_BIT : 0;
     this.l = initialValue;
     if (options?.equals !== void 0)
       this.aa = options.equals;
@@ -674,9 +674,9 @@ var Computation = class extends Owner {
   }
   ga() {
     track(this);
-    newFlags |= this.h & ~currentMask;
-    if (this.h & ERROR_BIT) {
-      throw this.M;
+    newFlags |= this.i & ~currentMask;
+    if (this.i & ERROR_BIT) {
+      throw this.O;
     } else {
       return this.l;
     }
@@ -686,16 +686,16 @@ var Computation = class extends Owner {
    * Automatically re-executes the surrounding computation when the value changes
    */
   read() {
-    if (ActiveTransition && (ActiveTransition.a.has(this) || !this.e && this.h & (UNINITIALIZED_BIT | ERROR_BIT))) {
+    if (ActiveTransition && (ActiveTransition.a.has(this) || !this.d && this.i & (UNINITIALIZED_BIT | ERROR_BIT))) {
       const clone = ActiveTransition.a.get(this) || cloneGraph(this);
       if (clone !== this)
         return clone.read();
     }
-    if (this.N) {
-      if (this.h & ERROR_BIT && this.O <= clock)
+    if (this.P) {
+      if (this.i & ERROR_BIT && this.Q <= clock)
         update(this);
       else
-        this.L();
+        this.D();
     }
     return this.ga();
   }
@@ -707,49 +707,49 @@ var Computation = class extends Owner {
    * before continuing
    */
   wait() {
-    if (ActiveTransition && (ActiveTransition.a.has(this) || !this.e && this.h & (UNINITIALIZED_BIT | ERROR_BIT))) {
+    if (ActiveTransition && (ActiveTransition.a.has(this) || !this.d && this.i & (UNINITIALIZED_BIT | ERROR_BIT))) {
       const clone = ActiveTransition.a.get(this) || cloneGraph(this);
       if (clone !== this)
         return clone.wait();
     }
-    if (this.N) {
-      if (this.h & ERROR_BIT && this.O <= clock)
+    if (this.P) {
+      if (this.i & ERROR_BIT && this.Q <= clock)
         update(this);
       else
-        this.L();
+        this.D();
     }
-    if ((notStale || this.h & UNINITIALIZED_BIT) && this.h & LOADING_BIT) {
+    if ((notStale || this.i & UNINITIALIZED_BIT) && this.i & LOADING_BIT) {
       track(this);
       throw new NotReadyError();
     }
-    if (staleCheck && this.h & LOADING_BIT) {
+    if (staleCheck && this.i & LOADING_BIT) {
       staleCheck.l = true;
     }
     return this.ga();
   }
   /** Update the computation with a new value. */
   write(value, flags = 0, raw = false) {
-    if (ActiveTransition && !this.e) {
+    if (ActiveTransition && !this.d) {
       const clone = cloneGraph(this);
       if (clone !== this)
         return clone.write(value, flags, raw);
     }
     const newValue = !raw && typeof value === "function" ? value(this.l) : value;
-    const valueChanged = newValue !== UNCHANGED && (!!(this.h & UNINITIALIZED_BIT) || // this._stateFlags & LOADING_BIT & ~flags ||
+    const valueChanged = newValue !== UNCHANGED && (!!(this.i & UNINITIALIZED_BIT) || // this._stateFlags & LOADING_BIT & ~flags ||
     this.aa === false || !this.aa(this.l, newValue));
     if (valueChanged) {
       this.l = newValue;
-      this.M = void 0;
+      this.O = void 0;
     }
-    const changedFlagsMask = this.h ^ flags, changedFlags = changedFlagsMask & flags;
-    this.h = flags;
-    this.O = clock + 1;
-    if (this.b) {
-      for (let i = 0; i < this.b.length; i++) {
+    const changedFlagsMask = this.i ^ flags, changedFlags = changedFlagsMask & flags;
+    this.i = flags;
+    this.Q = clock + 1;
+    if (this.c) {
+      for (let i = 0; i < this.c.length; i++) {
         if (valueChanged) {
-          this.b[i].w(STATE_DIRTY);
+          this.c[i].t(STATE_DIRTY);
         } else if (changedFlagsMask) {
-          this.b[i]._(changedFlagsMask, changedFlags);
+          this.c[i]._(changedFlagsMask, changedFlags);
         }
       }
     }
@@ -758,14 +758,14 @@ var Computation = class extends Owner {
   /**
    * Set the current node's state, and recursively mark all of this node's observers as STATE_CHECK
    */
-  w(state, skipQueue) {
-    if (this.c >= state && !this.C)
+  t(state, skipQueue) {
+    if (this.b >= state && !this.F)
       return;
-    this.C = !!skipQueue;
-    this.c = state;
-    if (this.b) {
-      for (let i = 0; i < this.b.length; i++) {
-        this.b[i].w(STATE_CHECK, skipQueue);
+    this.F = !!skipQueue;
+    this.b = state;
+    if (this.c) {
+      for (let i = 0; i < this.c.length; i++) {
+        this.c[i].t(STATE_CHECK, skipQueue);
       }
     }
   }
@@ -776,35 +776,35 @@ var Computation = class extends Owner {
    * @param newFlags The source's new flags, masked to just the changed ones.
    */
   _(mask, newFlags2) {
-    if (this.c >= STATE_DIRTY)
+    if (this.b >= STATE_DIRTY)
       return;
     if (mask & this.ba) {
-      this.w(STATE_DIRTY);
+      this.t(STATE_DIRTY);
       return;
     }
-    if (this.c >= STATE_CHECK && !this.C)
+    if (this.b >= STATE_CHECK && !this.F)
       return;
-    const prevFlags = this.h & mask;
+    const prevFlags = this.i & mask;
     const deltaFlags = prevFlags ^ newFlags2;
     if (newFlags2 === prevFlags) ; else if (deltaFlags & prevFlags & mask) {
-      this.w(STATE_CHECK);
+      this.t(STATE_CHECK);
     } else {
-      this.h ^= deltaFlags;
-      if (this.b) {
-        for (let i = 0; i < this.b.length; i++) {
-          this.b[i]._(mask, newFlags2);
+      this.i ^= deltaFlags;
+      if (this.c) {
+        for (let i = 0; i < this.c.length; i++) {
+          this.c[i]._(mask, newFlags2);
         }
       }
     }
   }
-  D(error) {
-    if (ActiveTransition && !this.e) {
+  N(error) {
+    if (ActiveTransition && !this.d) {
       const clone = cloneGraph(this);
       if (clone !== this)
-        return clone.D(error);
+        return clone.N(error);
     }
-    this.M = error;
-    this.write(UNCHANGED, this.h & ~LOADING_BIT | ERROR_BIT | UNINITIALIZED_BIT);
+    this.O = error;
+    this.write(UNCHANGED, this.i & ~LOADING_BIT | ERROR_BIT | UNINITIALIZED_BIT);
   }
   /**
    * This is the core part of the reactivity system, which makes sure that the values are updated
@@ -813,48 +813,48 @@ var Computation = class extends Owner {
    *
    * This function will ensure that the value and states we read from the computation are up to date
    */
-  L() {
-    if (!this.N) {
+  D() {
+    if (!this.P) {
       return;
     }
-    if (this.c === STATE_DISPOSED) {
+    if (this.b === STATE_DISPOSED) {
       return;
     }
-    if (this.c === STATE_CLEAN) {
+    if (this.b === STATE_CLEAN) {
       return;
     }
     let observerFlags = 0;
-    if (this.c === STATE_CHECK) {
+    if (this.b === STATE_CHECK) {
       for (let i = 0; i < this.a.length; i++) {
         const source = getTransitionSource(this.a[i]);
-        source.L();
-        observerFlags |= source.h & ~UNINITIALIZED_BIT;
-        if (this.c === STATE_DIRTY) {
+        source.D();
+        observerFlags |= source.i & ~UNINITIALIZED_BIT;
+        if (this.b === STATE_DIRTY) {
           break;
         }
       }
     }
-    if (this.c === STATE_DIRTY) {
+    if (this.b === STATE_DIRTY) {
       update(this);
     } else {
       this.write(UNCHANGED, observerFlags);
-      this.c = STATE_CLEAN;
+      this.b = STATE_CLEAN;
     }
   }
   /**
    * Remove ourselves from the owner graph and the computation graph
    */
-  T() {
-    if (this.c === STATE_DISPOSED)
+  M() {
+    if (this.b === STATE_DISPOSED)
       return;
     if (this.a)
       removeSourceObservers(this, 0);
-    super.T();
+    super.M();
   }
 };
 function track(computation) {
-  if (ActiveTransition && computation.e)
-    computation = computation.e;
+  if (ActiveTransition && computation.d)
+    computation = computation.d;
   if (currentObserver) {
     if (!newSources && currentObserver.a && currentObserver.a[newSourcesIndex] === computation) {
       newSourcesIndex++;
@@ -864,7 +864,7 @@ function track(computation) {
       newSources.push(computation);
     }
     if (updateCheck) {
-      updateCheck.l = computation.O > currentObserver.O;
+      updateCheck.l = computation.Q > currentObserver.Q;
     }
   }
 }
@@ -874,19 +874,19 @@ function update(node) {
   newSourcesIndex = 0;
   newFlags = 0;
   try {
-    if (ActiveTransition && node.e && !node.Z) {
-      initialDispose(node.e);
+    if (ActiveTransition && node.d && !node.Z) {
+      initialDispose(node.d);
       node.Z = true;
     }
     node.dispose(false);
     node.emptyDisposal();
-    const result = compute(node, node.N, node);
+    const result = compute(node, node.P, node);
     node.write(result, newFlags, true);
   } catch (error) {
     if (error instanceof NotReadyError) {
-      node.write(UNCHANGED, newFlags | LOADING_BIT | node.h & UNINITIALIZED_BIT);
+      node.write(UNCHANGED, newFlags | LOADING_BIT | node.i & UNINITIALIZED_BIT);
     } else {
-      node.D(error);
+      node.N(error);
     }
   } finally {
     if (newSources) {
@@ -903,10 +903,10 @@ function update(node) {
       let source;
       for (let i = newSourcesIndex; i < node.a.length; i++) {
         source = getTransitionSource(node.a[i]);
-        if (!source.b)
-          source.b = [node];
+        if (!source.c)
+          source.c = [node];
         else
-          source.b.push(node);
+          source.c.push(node);
       }
     } else if (node.a && newSourcesIndex < node.a.length) {
       removeSourceObservers(node, newSourcesIndex);
@@ -915,8 +915,8 @@ function update(node) {
     newSources = prevSources;
     newSourcesIndex = prevSourcesIndex;
     newFlags = prevFlags;
-    node.O = clock + 1;
-    node.c = STATE_CLEAN;
+    node.Q = clock + 1;
+    node.b = STATE_CLEAN;
   }
 }
 function isEqual(a, b) {
@@ -976,46 +976,6 @@ function latest(fn, fallback) {
     notStale = prevNotStale;
   }
 }
-function runWithObserver(observer, run) {
-  const prevSources = newSources, prevSourcesIndex = newSourcesIndex, prevFlags = newFlags;
-  newSources = null;
-  newSourcesIndex = observer.a ? observer.a.length : 0;
-  newFlags = 0;
-  try {
-    return compute(observer, run, observer);
-  } catch (error) {
-    if (error instanceof NotReadyError) {
-      observer.write(
-        UNCHANGED,
-        newFlags | LOADING_BIT | observer.h & UNINITIALIZED_BIT
-      );
-    } else {
-      observer.D(error);
-    }
-  } finally {
-    if (newSources) {
-      if (newSourcesIndex > 0) {
-        observer.a.length = newSourcesIndex + newSources.length;
-        for (let i = 0; i < newSources.length; i++) {
-          observer.a[newSourcesIndex + i] = newSources[i];
-        }
-      } else {
-        observer.a = newSources;
-      }
-      let source;
-      for (let i = newSourcesIndex; i < observer.a.length; i++) {
-        source = observer.a[i];
-        if (!source.b)
-          source.b = [observer];
-        else
-          source.b.push(observer);
-      }
-    }
-    newSources = prevSources;
-    newSourcesIndex = prevSourcesIndex;
-    newFlags = prevFlags;
-  }
-}
 function compute(owner, fn, observer) {
   const prevOwner = setOwner(owner), prevObserver = currentObserver, prevMask = currentMask, prevNotStale = notStale;
   currentObserver = observer;
@@ -1035,65 +995,65 @@ function compute(owner, fn, observer) {
 var Effect = class extends Computation {
   ca;
   $;
-  P;
+  u;
   da = false;
-  S;
-  A;
+  T;
+  r;
   constructor(initialValue, compute2, effect, error, options) {
     super(initialValue, compute2, options);
     this.ca = effect;
     this.$ = error;
-    this.S = initialValue;
-    this.A = options?.render ? EFFECT_RENDER : EFFECT_USER;
-    if (this.A === EFFECT_RENDER) {
-      this.N = function(p) {
-        return !this.e && clock > this.z.created && !(this.h & ERROR_BIT) ? latest(() => compute2(p)) : compute2(p);
+    this.T = initialValue;
+    this.r = options?.render ? EFFECT_RENDER : EFFECT_USER;
+    if (this.r === EFFECT_RENDER) {
+      this.P = function(p) {
+        return !this.d && clock > this.C.created && !(this.i & ERROR_BIT) ? latest(() => compute2(p)) : compute2(p);
       };
     }
-    this.L();
-    !options?.defer && (this.A === EFFECT_USER ? getQueue(this).enqueue(this.A, this.E.bind(this)) : this.E(this.A));
+    this.D();
+    !options?.defer && (this.r === EFFECT_USER ? getQueue(this).enqueue(this.r, this.w.bind(this)) : this.w(this.r));
   }
   write(value, flags = 0) {
-    if (this.c == STATE_DIRTY) {
-      this.h = flags;
-      if (this.A === EFFECT_RENDER) {
-        getQueue(this).notify(this, LOADING_BIT | ERROR_BIT, this.h);
+    if (this.b == STATE_DIRTY) {
+      this.i = flags;
+      if (this.r === EFFECT_RENDER) {
+        getQueue(this).notify(this, LOADING_BIT | ERROR_BIT, this.i);
       }
     }
     if (value === UNCHANGED)
       return this.l;
     this.l = value;
     this.da = true;
-    this.M = void 0;
+    this.O = void 0;
     return value;
   }
-  w(state, skipQueue) {
-    if (this.c >= state || skipQueue)
+  t(state, skipQueue) {
+    if (this.b >= state || skipQueue)
       return;
-    if (this.c === STATE_CLEAN || this.e && !ActiveTransition)
-      getQueue(this).enqueue(this.A, this.E.bind(this));
-    this.c = state;
+    if (this.b === STATE_CLEAN || this.d && !ActiveTransition)
+      getQueue(this).enqueue(this.r, this.w.bind(this));
+    this.b = state;
   }
   _(mask, newFlags2) {
-    if (this.e) {
-      if (this.c >= STATE_DIRTY)
+    if (this.d) {
+      if (this.b >= STATE_DIRTY)
         return;
       if (mask & 3) {
-        this.w(STATE_DIRTY);
+        this.t(STATE_DIRTY);
         return;
       }
     }
     super._(mask, newFlags2);
   }
-  D(error) {
-    this.M = error;
+  N(error) {
+    this.O = error;
     getQueue(this).notify(this, LOADING_BIT, 0);
-    this.h = ERROR_BIT;
-    if (this.A === EFFECT_USER) {
+    this.i = ERROR_BIT;
+    if (this.r === EFFECT_USER) {
       try {
         return this.$ ? this.$(error, () => {
-          this.P?.();
-          this.P = void 0;
+          this.u?.();
+          this.u = void 0;
         }) : console.error(error);
       } catch (e) {
         error = e;
@@ -1102,50 +1062,81 @@ var Effect = class extends Computation {
     if (!getQueue(this).notify(this, ERROR_BIT, ERROR_BIT))
       throw error;
   }
-  T() {
-    if (this.c === STATE_DISPOSED)
+  M() {
+    if (this.b === STATE_DISPOSED)
       return;
     this.ca = void 0;
-    this.S = void 0;
+    this.T = void 0;
     this.$ = void 0;
-    this.P?.();
-    this.P = void 0;
+    this.u?.();
+    this.u = void 0;
     getQueue(this).notify(this, ERROR_BIT | LOADING_BIT, 0);
-    super.T();
+    super.M();
   }
-  E(type) {
+  w(type) {
     if (type) {
-      const effect = this.e || this;
-      if (effect.da && effect.c !== STATE_DISPOSED) {
-        effect.P?.();
+      const effect = this.d || this;
+      if (effect.da && effect.b !== STATE_DISPOSED) {
+        effect.u?.();
         try {
-          effect.P = effect.ca(effect.l, effect.S);
+          effect.u = effect.ca(effect.l, effect.T);
         } catch (e) {
           if (!getQueue(effect).notify(effect, ERROR_BIT, ERROR_BIT))
             throw e;
         } finally {
-          effect.S = effect.l;
+          effect.T = effect.l;
           effect.da = false;
         }
       }
     } else
-      this.c !== STATE_CLEAN && runTop(this);
+      this.b !== STATE_CLEAN && runTop(this);
+  }
+};
+var TrackedEffect = class extends Computation {
+  r = EFFECT_USER;
+  u;
+  constructor(compute2, options) {
+    super(void 0, () => {
+      this.u?.();
+      this.u = latest(compute2);
+      return void 0;
+    }, options);
+    getQueue(this).enqueue(this.r, this.w.bind(this));
+  }
+  t(state, skipQueue) {
+    if (this.b >= state || skipQueue)
+      return;
+    if (this.b === STATE_CLEAN || this.d && !ActiveTransition)
+      getQueue(this).enqueue(this.r, this.w.bind(this));
+    this.b = state;
+  }
+  M() {
+    if (this.b === STATE_DISPOSED)
+      return;
+    this.u?.();
+    this.u = void 0;
+    getQueue(this).notify(this, ERROR_BIT | LOADING_BIT, 0);
+    super.M();
+  }
+  w(type) {
+    if (type)
+      this.b !== STATE_CLEAN && runTop(this);
   }
 };
 var EagerComputation = class extends Computation {
   constructor(initialValue, compute2, options) {
     super(initialValue, compute2, options);
-    !options?.defer && this.L();
+    !options?.defer && this.D();
   }
-  w(state, skipQueue) {
-    if (this.c >= state && !this.C)
+  t(state, skipQueue) {
+    if (this.b >= state && !this.F)
       return;
-    if (!skipQueue && (this.c === STATE_CLEAN || this.c === STATE_CHECK && this.C))
-      getQueue(this).enqueue(EFFECT_PURE, this.E.bind(this));
-    super.w(state, skipQueue);
+    if (!skipQueue && (this.b === STATE_CLEAN || this.b === STATE_CHECK && this.F))
+      getQueue(this).enqueue(EFFECT_PURE, this.w.bind(this));
+    super.t(state, skipQueue);
   }
-  E() {
-    this.c !== STATE_CLEAN && runTop(this);
+  w() {
+    this.b !== STATE_CLEAN && runTop(this);
   }
 };
 var FirewallComputation = class extends Computation {
@@ -1153,16 +1144,16 @@ var FirewallComputation = class extends Computation {
   constructor(compute2) {
     super(void 0, compute2);
   }
-  w(state, skipQueue) {
-    if (this.c >= state && !this.C)
+  t(state, skipQueue) {
+    if (this.b >= state && !this.F)
       return;
-    if (!skipQueue && (this.c === STATE_CLEAN || this.c === STATE_CHECK && this.C))
-      getQueue(this).enqueue(EFFECT_PURE, this.E.bind(this));
-    super.w(state, true);
-    this.C = !!skipQueue;
+    if (!skipQueue && (this.b === STATE_CLEAN || this.b === STATE_CHECK && this.F))
+      getQueue(this).enqueue(EFFECT_PURE, this.w.bind(this));
+    super.t(state, true);
+    this.F = !!skipQueue;
   }
-  E() {
-    this.c !== STATE_CLEAN && runTop(this);
+  w() {
+    this.b !== STATE_CLEAN && runTop(this);
   }
 };
 function runTop(node) {
@@ -1170,28 +1161,24 @@ function runTop(node) {
   for (let current = node; current !== null; current = current.k) {
     if (ActiveTransition && current.j)
       current = ActiveTransition.a.get(current);
-    if (current.c !== STATE_CLEAN) {
+    if (current.b !== STATE_CLEAN) {
       ancestors.push(current);
     }
   }
   for (let i = ancestors.length - 1; i >= 0; i--) {
-    if (ancestors[i].c !== STATE_DISPOSED)
-      ancestors[i].L();
+    if (ancestors[i].b !== STATE_DISPOSED)
+      ancestors[i].D();
   }
 }
 
 // src/signals.ts
 function createSignal(first, second, third) {
   if (typeof first === "function") {
-    const memo = createMemo((p) => {
-      const node2 = new Computation(
-        first(p ? untrack(p[0]) : second),
-        null,
-        third
-      );
-      return [node2.read.bind(node2), node2.write.bind(node2)];
-    });
-    return [() => memo()[0](), (value) => memo()[1](value)];
+    const node2 = new Computation(second, first, third);
+    return [node2.read.bind(node2), (v) => {
+      node2.D();
+      return node2.write(v);
+    }];
   }
   const o = getOwner();
   const needsId = o?.id != null;
@@ -1211,12 +1198,12 @@ function createMemo(compute2, value, options) {
   let resolvedValue;
   return () => {
     if (node) {
-      if (node.c === STATE_DISPOSED) {
+      if (node.b === STATE_DISPOSED) {
         node = void 0;
         return resolvedValue;
       }
       resolvedValue = node.wait();
-      if (!node.a?.length && node.m?.k !== node && !(node.h & UNINITIALIZED_BIT)) {
+      if (!node.a?.length && node.m?.k !== node && !(node.i & UNINITIALIZED_BIT)) {
         node.dispose();
         node = void 0;
       }
@@ -1254,8 +1241,8 @@ function createAsync(compute2, value, options) {
             if (abort)
               return;
             if (transition2)
-              return transition2.runTransition(() => node.D(error), true);
-            node.D(error);
+              return transition2.runTransition(() => node.N(error), true);
+            node.N(error);
           }
         );
       } else {
@@ -1276,10 +1263,10 @@ function createAsync(compute2, value, options) {
               return;
             if (transition2)
               return transition2.runTransition(() => {
-                node.D(error);
+                node.N(error);
                 transition2 = null;
               }, true);
-            node.D(error);
+            node.N(error);
           }
         })();
       }
@@ -1290,12 +1277,12 @@ function createAsync(compute2, value, options) {
   const read = node.wait.bind(node);
   read.refresh = () => {
     let n = node;
-    if (ActiveTransition && !node.e) {
+    if (ActiveTransition && !node.d) {
       n = cloneGraph(node);
     }
-    n.c = STATE_DIRTY;
+    n.b = STATE_DIRTY;
     refreshing = true;
-    n.L();
+    n.D();
   };
   return read;
 }
@@ -1303,7 +1290,7 @@ function createEffect(compute2, effect, value, options) {
   void new Effect(
     value,
     compute2,
-    effect.effect ? effect.effect : effect,
+    effect.effect || effect,
     effect.error,
     options
   );
@@ -1314,6 +1301,29 @@ function createRenderEffect(compute2, effect, value, options) {
     ...options
   });
 }
+function createTrackedEffect(compute2, options) {
+  void new TrackedEffect(compute2, options);
+}
+function createReaction(effect, options) {
+  let cleanup = void 0;
+  onCleanup(() => cleanup?.());
+  return (tracking) => {
+    const node = new Effect(
+      void 0,
+      tracking,
+      () => {
+        cleanup?.();
+        cleanup = (effect.effect || effect)?.();
+        node.dispose(true);
+      },
+      effect.error,
+      {
+        defer: true,
+        ...options
+      }
+    );
+  };
+}
 function createRoot(init, options) {
   const owner = new Owner(options?.id);
   return compute(owner, !init.length ? init : () => init(() => owner.dispose()), null);
@@ -1337,23 +1347,25 @@ function resolve(fn) {
     });
   });
 }
-function createPending() {
-  const node = new Computation(false, null);
-  const reset = () => node.write(false);
-  function write() {
+function createOptimistic(first, second, third) {
+  const node = typeof first === "function" ? new Computation(second, first, third) : new Computation(first, null, second);
+  const reset = () => node.write(first);
+  function write(v) {
     if (!ActiveTransition)
-      return false;
+      throw new Error("createOptimistic can only be updated inside a transition");
     ActiveTransition.addOptimistic(reset);
-    queueMicrotask(() => reset.j && node.write(true));
-  }
-  function read() {
-    const v = node.read();
-    return ActiveTransition ? false : v;
+    cloneGraph(node, true);
+    queueMicrotask(() => {
+      if (reset.j) {
+        node.D();
+        node.write(v);
+      }
+    });
   }
-  return [read, write];
+  return [node.read.bind(node), write];
 }
 function useTransition() {
-  const [pending, setPending] = createPending();
+  const [pending, setPending] = createOptimistic(false);
   function start(fn) {
     transition((resume) => {
       setPending(true);
@@ -1819,7 +1831,7 @@ function deep(store) {
 }
 
 // src/store/optimistic.ts
-function createOptimistic(first, second, options) {
+function createOptimisticStore(first, second, options) {
   const derived = typeof first === "function";
   const { store, node } = derived ? createProjectionInternal(first, second, options) : createProjectionInternal(() => {
   }, first);
@@ -1833,7 +1845,7 @@ function createOptimistic(first, second, options) {
   );
   const write = (v) => {
     if (!ActiveTransition)
-      throw new Error("createOptimistic can only be updated inside a transition");
+      throw new Error("createOptimisticStore can only be updated inside a transition");
     ActiveTransition.addOptimistic(reset);
     cloneGraph(node, true);
     queueMicrotask(() => reset.j && storeSetter(store, v));
@@ -2048,11 +2060,11 @@ function mapArray(list, map, options) {
     U: new Owner(),
     o: 0,
     ia: list,
-    F: [],
-    Q: map,
-    i: [],
-    d: [],
-    R: keyFn,
+    G: [],
+    R: map,
+    h: [],
+    e: [],
+    S: keyFn,
     p: keyFn || options?.keyed === false ? [] : void 0,
     q: map.length > 1 ? [] : void 0,
     V: options?.fallback
@@ -2066,53 +2078,53 @@ function updateKeyedMap() {
     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.Q(
+      return this.R(
         Computation.prototype.read.bind(this.p[j]),
         this.q ? Computation.prototype.read.bind(this.q[j]) : void 0
       );
     } : this.q ? () => {
       const item = newItems[j];
       this.q[j] = new Computation(j, null, pureOptions);
-      return this.Q(() => item, Computation.prototype.read.bind(this.q[j]));
+      return this.R(() => item, Computation.prototype.read.bind(this.q[j]));
     } : () => {
       const item = newItems[j];
-      return this.Q(() => item);
+      return this.R(() => item);
     };
     if (newLen === 0) {
       if (this.o !== 0) {
         this.U.dispose(false);
-        this.d = [];
-        this.F = [];
-        this.i = [];
+        this.e = [];
+        this.G = [];
+        this.h = [];
         this.o = 0;
         this.p && (this.p = []);
         this.q && (this.q = []);
       }
-      if (this.V && !this.i[0]) {
-        this.i[0] = compute(
-          this.d[0] = new Owner(),
+      if (this.V && !this.h[0]) {
+        this.h[0] = compute(
+          this.e[0] = new Owner(),
           this.V,
           null
         );
       }
     } else if (this.o === 0) {
-      if (this.d[0])
-        this.d[0].dispose();
-      this.i = new Array(newLen);
+      if (this.e[0])
+        this.e[0].dispose();
+      this.h = new Array(newLen);
       for (j = 0; j < newLen; j++) {
-        this.F[j] = newItems[j];
-        this.i[j] = compute(this.d[j] = new Owner(), mapper, null);
+        this.G[j] = newItems[j];
+        this.h[j] = compute(this.e[j] = new Owner(), mapper, null);
       }
       this.o = newLen;
     } else {
       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.F[start] === newItems[start] || this.p && compare(this.R, this.F[start], newItems[start])); start++) {
+      for (start = 0, end = Math.min(this.o, newLen); start < end && (this.G[start] === newItems[start] || this.p && compare(this.S, this.G[start], newItems[start])); start++) {
         if (this.p)
           this.p[start].write(newItems[start]);
       }
-      for (end = this.o - 1, newEnd = newLen - 1; end >= start && newEnd >= start && (this.F[end] === newItems[newEnd] || this.p && compare(this.R, this.F[end], newItems[newEnd])); end--, newEnd--) {
-        temp[newEnd] = this.i[end];
-        tempNodes[newEnd] = this.d[end];
+      for (end = this.o - 1, newEnd = newLen - 1; end >= start && newEnd >= start && (this.G[end] === newItems[newEnd] || this.p && compare(this.S, this.G[end], newItems[newEnd])); end--, newEnd--) {
+        temp[newEnd] = this.h[end];
+        tempNodes[newEnd] = this.e[end];
         tempRows && (tempRows[newEnd] = this.p[end]);
         tempIndexes && (tempIndexes[newEnd] = this.q[end]);
       }
@@ -2120,29 +2132,29 @@ function updateKeyedMap() {
       newIndicesNext = new Array(newEnd + 1);
       for (j = newEnd; j >= start; j--) {
         item = newItems[j];
-        key = this.R ? this.R(item) : item;
+        key = this.S ? this.S(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.F[i];
-        key = this.R ? this.R(item) : item;
+        item = this.G[i];
+        key = this.S ? this.S(item) : item;
         j = newIndices.get(key);
         if (j !== void 0 && j !== -1) {
-          temp[j] = this.i[i];
-          tempNodes[j] = this.d[i];
+          temp[j] = this.h[i];
+          tempNodes[j] = this.e[i];
           tempRows && (tempRows[j] = this.p[i]);
           tempIndexes && (tempIndexes[j] = this.q[i]);
           j = newIndicesNext[j];
           newIndices.set(key, j);
         } else
-          this.d[i].dispose();
+          this.e[i].dispose();
       }
       for (j = start; j < newLen; j++) {
         if (j in temp) {
-          this.i[j] = temp[j];
-          this.d[j] = tempNodes[j];
+          this.h[j] = temp[j];
+          this.e[j] = tempNodes[j];
           if (tempRows) {
             this.p[j] = tempRows[j];
             this.p[j].write(newItems[j]);
@@ -2152,24 +2164,24 @@ function updateKeyedMap() {
             this.q[j].write(j);
           }
         } else {
-          this.i[j] = compute(this.d[j] = new Owner(), mapper, null);
+          this.h[j] = compute(this.e[j] = new Owner(), mapper, null);
         }
       }
-      this.i = this.i.slice(0, this.o = newLen);
-      this.F = newItems.slice(0);
+      this.h = this.h.slice(0, this.o = newLen);
+      this.G = newItems.slice(0);
     }
   });
-  return this.i;
+  return this.h;
 }
 function repeat(count, map, options) {
   return updateRepeat.bind({
     U: new Owner(),
     o: 0,
-    x: 0,
+    A: 0,
     ja: count,
-    Q: map,
-    d: [],
-    i: [],
+    R: map,
+    e: [],
+    h: [],
     ka: options?.from,
     V: options?.fallback
   });
@@ -2181,13 +2193,13 @@ function updateRepeat() {
     if (newLen === 0) {
       if (this.o !== 0) {
         this.U.dispose(false);
-        this.d = [];
-        this.i = [];
+        this.e = [];
+        this.h = [];
         this.o = 0;
       }
-      if (this.V && !this.i[0]) {
-        this.i[0] = compute(
-          this.d[0] = new Owner(),
+      if (this.V && !this.h[0]) {
+        this.h[0] = compute(
+          this.e[0] = new Owner(),
           this.V,
           null
         );
@@ -2195,46 +2207,46 @@ function updateRepeat() {
       return;
     }
     const to = from + newLen;
-    const prevTo = this.x + this.o;
-    if (this.o === 0 && this.d[0])
-      this.d[0].dispose();
+    const prevTo = this.A + this.o;
+    if (this.o === 0 && this.e[0])
+      this.e[0].dispose();
     for (let i = to; i < prevTo; i++)
-      this.d[i - this.x].dispose();
-    if (this.x < from) {
-      let i = this.x;
+      this.e[i - this.A].dispose();
+    if (this.A < from) {
+      let i = this.A;
       while (i < from && i < this.o)
-        this.d[i++].dispose();
-      this.d.splice(0, from - this.x);
-      this.i.splice(0, from - this.x);
-    } else if (this.x > from) {
-      let i = prevTo - this.x - 1;
-      let difference = this.x - from;
-      this.d.length = this.i.length = newLen;
+        this.e[i++].dispose();
+      this.e.splice(0, from - this.A);
+      this.h.splice(0, from - this.A);
+    } else if (this.A > from) {
+      let i = prevTo - this.A - 1;
+      let difference = this.A - from;
+      this.e.length = this.h.length = newLen;
       while (i >= difference) {
-        this.d[i] = this.d[i - difference];
-        this.i[i] = this.i[i - difference];
+        this.e[i] = this.e[i - difference];
+        this.h[i] = this.h[i - difference];
         i--;
       }
       for (let i2 = 0; i2 < difference; i2++) {
-        this.i[i2] = compute(
-          this.d[i2] = new Owner(),
-          () => this.Q(i2 + from),
+        this.h[i2] = compute(
+          this.e[i2] = new Owner(),
+          () => this.R(i2 + from),
           null
         );
       }
     }
     for (let i = prevTo; i < to; i++) {
-      this.i[i - from] = compute(
-        this.d[i - from] = new Owner(),
-        () => this.Q(i),
+      this.h[i - from] = compute(
+        this.e[i - from] = new Owner(),
+        () => this.R(i),
         null
       );
     }
-    this.i = this.i.slice(0, newLen);
-    this.x = from;
+    this.h = this.h.slice(0, newLen);
+    this.A = from;
     this.o = newLen;
   });
-  return this.i;
+  return this.h;
 }
 function compare(key, a, b) {
   return key ? key(a) === key(b) : true;
@@ -2249,7 +2261,7 @@ var BoundaryComputation = class extends EagerComputation {
   }
   write(value, flags) {
     super.write(value, flags & ~this.W);
-    if (this.W & LOADING_BIT && !(this.h & UNINITIALIZED_BIT || ActiveTransition)) {
+    if (this.W & LOADING_BIT && !(this.i & UNINITIALIZED_BIT || ActiveTransition)) {
       flags &= ~LOADING_BIT;
     }
     getQueue(this).notify(this, this.W, flags);
@@ -2257,9 +2269,9 @@ var BoundaryComputation = class extends EagerComputation {
   }
 };
 function createBoundChildren(owner, fn, queue, mask) {
-  const parentQueue = owner.z;
-  parentQueue.addChild(owner.z = queue);
-  onCleanup(() => parentQueue.removeChild(owner.z));
+  const parentQueue = owner.C;
+  parentQueue.addChild(owner.C = queue);
+  onCleanup(() => parentQueue.removeChild(owner.C));
   return compute(
     owner,
     () => {
@@ -2270,25 +2282,25 @@ function createBoundChildren(owner, fn, queue, mask) {
   );
 }
 var ConditionalQueue = class extends Queue {
-  s;
+  x;
   X = /* @__PURE__ */ new Set();
-  r = /* @__PURE__ */ new Set();
+  s = /* @__PURE__ */ new Set();
   constructor(disabled) {
     super();
-    this.s = disabled;
+    this.x = disabled;
   }
   run(type) {
-    if (!type || this.s.read())
+    if (!type || this.x.read())
       return;
     return super.run(type);
   }
   notify(node, type, flags) {
-    if (this.s.read()) {
+    if (this.x.read()) {
       if (type & LOADING_BIT) {
         if (flags & LOADING_BIT) {
-          this.r.add(node);
+          this.s.add(node);
           type &= ~LOADING_BIT;
-        } else if (this.r.delete(node))
+        } else if (this.s.delete(node))
           type &= ~LOADING_BIT;
       }
       if (type & ERROR_BIT) {
@@ -2302,41 +2314,41 @@ var ConditionalQueue = class extends Queue {
     return type ? super.notify(node, type, flags) : true;
   }
   merge(queue) {
-    queue.r.forEach((n) => this.notify(n, LOADING_BIT, LOADING_BIT));
+    queue.s.forEach((n) => this.notify(n, LOADING_BIT, LOADING_BIT));
     queue.X.forEach((n) => this.notify(n, ERROR_BIT, ERROR_BIT));
     super.merge(queue);
   }
 };
 var CollectionQueue = class extends Queue {
-  K;
-  d = /* @__PURE__ */ new Set();
-  s = new Computation(false, null, { pureWrite: true });
+  L;
+  e = /* @__PURE__ */ new Set();
+  x = new Computation(false, null, { pureWrite: true });
   constructor(type) {
     super();
-    this.K = type;
+    this.L = type;
   }
   run(type) {
-    if (!type || this.s.read())
+    if (!type || this.x.read())
       return;
     return super.run(type);
   }
   notify(node, type, flags) {
-    if (!(type & this.K))
+    if (!(type & this.L))
       return super.notify(node, type, flags);
-    if (flags & this.K) {
-      this.d.add(node);
-      if (this.d.size === 1)
-        this.s.write(true);
-    } else if (this.d.size > 0) {
-      this.d.delete(node);
-      if (this.d.size === 0)
-        this.s.write(false);
-    }
-    type &= ~this.K;
+    if (flags & this.L) {
+      this.e.add(node);
+      if (this.e.size === 1)
+        this.x.write(true);
+    } else if (this.e.size > 0) {
+      this.e.delete(node);
+      if (this.e.size === 0)
+        this.x.write(false);
+    }
+    type &= ~this.L;
     return type ? super.notify(node, type, flags) : true;
   }
   merge(queue) {
-    queue.d.forEach((n) => this.notify(n, this.K, this.K));
+    queue.e.forEach((n) => this.notify(n, this.L, this.L));
     super.merge(queue);
   }
 };
@@ -2347,25 +2359,25 @@ function createBoundary(fn, condition) {
   );
   const tree = createBoundChildren(owner, fn, queue, 0);
   new EagerComputation(void 0, () => {
-    const disabled = queue.s.read();
+    const disabled = queue.x.read();
     tree.W = disabled ? ERROR_BIT | LOADING_BIT : 0;
     if (!disabled) {
-      queue.r.forEach((node) => queue.notify(node, LOADING_BIT, LOADING_BIT));
+      queue.s.forEach((node) => queue.notify(node, LOADING_BIT, LOADING_BIT));
       queue.X.forEach((node) => queue.notify(node, ERROR_BIT, ERROR_BIT));
-      queue.r.clear();
+      queue.s.clear();
       queue.X.clear();
     }
   });
-  return () => queue.s.read() ? void 0 : tree.read();
+  return () => queue.x.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.s.read()) {
+    if (!queue.x.read()) {
       const resolved = tree.read();
-      if (!untrack(() => queue.s.read()))
+      if (!untrack(() => queue.x.read()))
         return resolved;
     }
     return fallback(queue);
@@ -2377,14 +2389,14 @@ function createSuspense(fn, fallback) {
 }
 function createErrorBoundary(fn, fallback) {
   return createCollectionBoundary(ERROR_BIT, fn, (queue) => {
-    let node = getTransitionSource(queue.d.values().next().value);
-    return fallback(node.M, () => {
+    let node = getTransitionSource(queue.e.values().next().value);
+    return fallback(node.O, () => {
       incrementClock();
-      for (let node2 of queue.d) {
-        if (ActiveTransition && !node2.e)
+      for (let node2 of queue.e) {
+        if (ActiveTransition && !node2.d)
           node2 = cloneGraph(node2);
-        node2.c = STATE_DIRTY;
-        getQueue(node2).enqueue(node2.A, node2.E.bind(node2));
+        node2.b = STATE_DIRTY;
+        getQueue(node2).enqueue(node2.r, node2.w.bind(node2));
       }
     });
   });
@@ -2444,4 +2456,4 @@ function flattenArray(children, results = [], options) {
   return needsUnwrap;
 }
 
-export { $PROXY, $TARGET, $TRACK, Computation, ContextNotFoundError, NoOwnerError, NotReadyError, Owner, Queue, SUPPORTS_PROXY, createAsync, createBoundary, createContext, createEffect, createErrorBoundary, createMemo, createOptimistic, createProjection, createRenderEffect, createRoot, createSignal, createStore, createSuspense, deep, flatten, flush, getContext, getObserver, getOwner, hasContext, hasUpdated, isEqual, isPending, isWrappable, latest, mapArray, merge, omit, onCleanup, reconcile, repeat, resolve, runWithObserver, runWithOwner, setContext, snapshot, transition, untrack, useTransition };
+export { $PROXY, $TARGET, $TRACK, Computation, ContextNotFoundError, NoOwnerError, NotReadyError, Owner, Queue, SUPPORTS_PROXY, createAsync, createBoundary, createContext, createEffect, createErrorBoundary, createMemo, createOptimistic, createOptimisticStore, createProjection, createReaction, createRenderEffect, createRoot, createSignal, createStore, createSuspense, createTrackedEffect, deep, flatten, flush, getContext, getObserver, getOwner, hasContext, hasUpdated, isEqual, isPending, isWrappable, latest, mapArray, merge, omit, onCleanup, reconcile, repeat, resolve, runWithOwner, setContext, snapshot, transition, untrack, useTransition };