@solidjs/signals 0.0.7 → 0.0.8

package/dist/node.cjs

@@ -15,6 +15,12 @@ var ContextNotFoundError = class extends Error {
     );
   }
 };
+var EffectError = class extends Error {
+  constructor(effect, cause) {
+    super("");
+    this.cause = cause;
+  }
+};
 
 // src/core/constants.ts
 var STATE_CLEAN = 0;
@@ -101,82 +107,82 @@ var Owner = class {
   // We flatten the owner tree into a linked list so that we don't need a pointer to .firstChild
   // 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
-  o = null;
-  m = null;
-  p = null;
+  r = null;
+  n = null;
+  s = null;
   a = STATE_CLEAN;
-  j = null;
-  n = defaultContext;
-  k = null;
-  e = null;
+  l = null;
+  p = defaultContext;
+  m = null;
+  g = null;
   constructor(signal = false) {
     if (currentOwner && !signal)
       currentOwner.append(this);
   }
   append(child) {
-    child.o = this;
-    child.p = this;
-    if (this.m)
-      this.m.p = child;
-    child.m = this.m;
-    this.m = child;
-    if (child.n !== this.n) {
-      child.n = { ...this.n, ...child.n };
+    child.r = this;
+    child.s = this;
+    if (this.n)
+      this.n.s = child;
+    child.n = this.n;
+    this.n = child;
+    if (child.p !== this.p) {
+      child.p = { ...this.p, ...child.p };
     }
-    if (this.k) {
-      child.k = !child.k ? this.k : [...child.k, ...this.k];
+    if (this.m) {
+      child.m = !child.m ? this.m : [...child.m, ...this.m];
     }
-    if (this.e)
-      child.e = this.e;
+    if (this.g)
+      child.g = this.g;
   }
   dispose(self = true) {
     if (this.a === STATE_DISPOSED)
       return;
-    let head = self ? this.p || this.o : this, current = this.m, next = null;
-    while (current && current.o === this) {
+    let head = self ? this.s || this.r : this, current = this.n, next = null;
+    while (current && current.r === this) {
       current.dispose(true);
-      current.x();
-      next = current.m;
-      current.m = null;
+      current.y();
+      next = current.n;
+      current.n = null;
       current = next;
     }
     if (self)
-      this.x();
+      this.y();
     if (current)
-      current.p = !self ? this : this.p;
+      current.s = !self ? this : this.s;
     if (head)
-      head.m = current;
-  }
-  x() {
-    if (this.p)
-      this.p.m = null;
-    this.o = null;
-    this.p = null;
-    this.n = defaultContext;
-    this.k = null;
+      head.n = current;
+  }
+  y() {
+    if (this.s)
+      this.s.n = null;
+    this.r = null;
+    this.s = null;
+    this.p = defaultContext;
+    this.m = null;
     this.a = STATE_DISPOSED;
     this.emptyDisposal();
   }
   emptyDisposal() {
-    if (!this.j)
+    if (!this.l)
       return;
-    if (Array.isArray(this.j)) {
-      for (let i = 0; i < this.j.length; i++) {
-        const callable = this.j[i];
+    if (Array.isArray(this.l)) {
+      for (let i = 0; i < this.l.length; i++) {
+        const callable = this.l[i];
         callable.call(callable);
       }
     } else {
-      this.j.call(this.j);
+      this.l.call(this.l);
     }
-    this.j = null;
+    this.l = null;
   }
   handleError(error) {
-    if (!this.k)
+    if (!this.m)
       throw error;
-    let i = 0, len = this.k.length;
+    let i = 0, len = this.m.length;
     for (i = 0; i < len; i++) {
       try {
-        this.k[i](error);
+        this.m[i](error);
         break;
       } catch (e) {
         error = e;
@@ -193,7 +199,7 @@ function getContext(context, owner = currentOwner) {
   if (!owner) {
     throw new NoOwnerError();
   }
-  const value = hasContext(context, owner) ? owner.n[context.id] : context.defaultValue;
+  const value = hasContext(context, owner) ? owner.p[context.id] : context.defaultValue;
   if (isUndefined(value)) {
     throw new ContextNotFoundError();
   }
@@ -203,24 +209,24 @@ function setContext(context, value, owner = currentOwner) {
   if (!owner) {
     throw new NoOwnerError();
   }
-  owner.n = {
-    ...owner.n,
+  owner.p = {
+    ...owner.p,
     [context.id]: isUndefined(value) ? context.defaultValue : value
   };
 }
 function hasContext(context, owner = currentOwner) {
-  return !isUndefined(owner == null ? void 0 : owner.n[context.id]);
+  return !isUndefined(owner == null ? void 0 : owner.p[context.id]);
 }
 function onCleanup(fn) {
   if (!currentOwner)
     return fn;
   const node = currentOwner;
-  if (!node.j) {
-    node.j = fn;
-  } else if (Array.isArray(node.j)) {
-    node.j.push(fn);
+  if (!node.l) {
+    node.l = fn;
+  } else if (Array.isArray(node.l)) {
+    node.l.push(fn);
   } else {
-    node.j = [node.j, fn];
+    node.l = [node.l, fn];
   }
   return fn;
 }
@@ -244,49 +250,52 @@ var updateCheck = null;
 function getObserver() {
   return currentObserver;
 }
+function getClock() {
+  return clock;
+}
 function incrementClock() {
   clock++;
 }
 var UNCHANGED = Symbol(0);
 var Computation = class extends Owner {
-  c = null;
+  d = null;
   b = null;
-  d;
-  C;
+  e;
+  w;
   // Used in __DEV__ mode, hopefully removed in production
-  V;
+  Y;
   // Using false is an optimization as an alternative to _equals: () => false
   // which could enable more efficient DIRTY notification
-  G = isEqual;
-  O;
+  L = isEqual;
+  S;
   /** Whether the computation is an error or has ancestors that are unresolved */
-  f = 0;
+  h = 0;
   /** Which flags raised by sources are handled, vs. being passed through. */
-  D = DEFAULT_FLAGS;
-  z = null;
-  H = null;
-  I = -1;
+  M = DEFAULT_FLAGS;
+  N = null;
+  z = -1;
+  H = false;
   constructor(initialValue, compute2, options) {
     super(compute2 === null);
-    this.C = compute2;
+    this.w = compute2;
     this.a = compute2 ? STATE_UNINITIALIZED : STATE_CLEAN;
-    this.d = initialValue;
+    this.e = initialValue;
     if ((options == null ? void 0 : options.equals) !== void 0)
-      this.G = options.equals;
+      this.L = options.equals;
     if (options == null ? void 0 : options.unobserved)
-      this.O = options == null ? void 0 : options.unobserved;
+      this.S = options == null ? void 0 : options.unobserved;
   }
-  P() {
+  T() {
     var _a;
-    if (this.C)
-      this.t();
-    if (!this.C || ((_a = this.c) == null ? void 0 : _a.length))
+    if (this.w)
+      this.x();
+    if (!this.w || ((_a = this.d) == null ? void 0 : _a.length))
       track(this);
-    newFlags |= this.f & ~currentMask;
-    if (this.f & ERROR_BIT) {
-      throw this.d;
+    newFlags |= this.h & ~currentMask;
+    if (this.h & ERROR_BIT) {
+      throw this.e;
     } else {
-      return this.d;
+      return this.e;
     }
   }
   /**
@@ -294,7 +303,7 @@ var Computation = class extends Owner {
    * Automatically re-executes the surrounding computation when the value changes
    */
   read() {
-    return this.P();
+    return this.T();
   }
   /**
    * Return the current value of this computation
@@ -304,10 +313,13 @@ var Computation = class extends Owner {
    * before continuing
    */
   wait() {
+    if (this.w && this.h & ERROR_BIT && this.z <= clock) {
+      update(this);
+    }
     if (!syncResolve && this.loading()) {
       throw new NotReadyError();
     }
-    return this.P();
+    return this.T();
   }
   /**
    * Return true if the computation is the value is dependent on an unresolved promise
@@ -317,51 +329,42 @@ var Computation = class extends Owner {
    * loading state changes
    */
   loading() {
-    if (this.H === null) {
-      this.H = loadingState(this);
+    if (this.N === null) {
+      this.N = loadingState(this);
     }
-    return this.H.read();
-  }
-  /**
-   * Return true if the computation is the computation threw an error
-   * Triggers re-execution of the computation when the error state changes
-   */
-  error() {
-    if (this.z === null) {
-      this.z = errorState(this);
-    }
-    return this.z.read();
+    return this.N.read();
   }
   /** Update the computation with a new value. */
   write(value, flags = 0, raw = false) {
-    const newValue = !raw && typeof value === "function" ? value(this.d) : value;
-    const valueChanged = newValue !== UNCHANGED && (!!(flags & ERROR_BIT) || this.a === STATE_UNINITIALIZED || this.G === false || !this.G(this.d, newValue));
+    const newValue = !raw && typeof value === "function" ? value(this.e) : value;
+    const valueChanged = newValue !== UNCHANGED && (!!(flags & ERROR_BIT) || this.a === STATE_UNINITIALIZED || this.L === false || !this.L(this.e, newValue));
     if (valueChanged)
-      this.d = newValue;
-    const changedFlagsMask = this.f ^ flags, changedFlags = changedFlagsMask & flags;
-    this.f = flags;
-    this.I = clock + 1;
+      this.e = newValue;
+    const changedFlagsMask = this.h ^ flags, changedFlags = changedFlagsMask & flags;
+    this.h = flags;
+    this.z = clock + 1;
     if (this.b) {
       for (let i = 0; i < this.b.length; i++) {
         if (valueChanged) {
-          this.b[i].u(STATE_DIRTY);
+          this.b[i].q(STATE_DIRTY);
         } else if (changedFlagsMask) {
-          this.b[i].Q(changedFlagsMask, changedFlags);
+          this.b[i].U(changedFlagsMask, changedFlags);
         }
       }
     }
-    return this.d;
+    return this.e;
   }
   /**
    * Set the current node's state, and recursively mark all of this node's observers as STATE_CHECK
    */
-  u(state) {
-    if (this.a >= state)
+  q(state, skipQueue) {
+    if (this.a >= state && !this.H)
       return;
+    this.H = !!skipQueue;
     this.a = state;
     if (this.b) {
       for (let i = 0; i < this.b.length; i++) {
-        this.b[i].u(STATE_CHECK);
+        this.b[i].q(STATE_CHECK, skipQueue);
       }
     }
   }
@@ -371,30 +374,30 @@ var Computation = class extends Owner {
    * @param mask A bitmask for which flag(s) were changed.
    * @param newFlags The source's new flags, masked to just the changed ones.
    */
-  Q(mask, newFlags2) {
+  U(mask, newFlags2) {
     if (this.a >= STATE_DIRTY)
       return;
-    if (mask & this.D) {
-      this.u(STATE_DIRTY);
+    if (mask & this.M) {
+      this.q(STATE_DIRTY);
       return;
     }
     if (this.a >= STATE_CHECK)
       return;
-    const prevFlags = this.f & mask;
+    const prevFlags = this.h & mask;
     const deltaFlags = prevFlags ^ newFlags2;
     if (newFlags2 === prevFlags) ; else if (deltaFlags & prevFlags & mask) {
-      this.u(STATE_CHECK);
+      this.q(STATE_CHECK);
     } else {
-      this.f ^= deltaFlags;
+      this.h ^= deltaFlags;
       if (this.b) {
         for (let i = 0; i < this.b.length; i++) {
-          this.b[i].Q(mask, newFlags2);
+          this.b[i].U(mask, newFlags2);
         }
       }
     }
   }
-  J(error) {
-    this.write(error, this.f | ERROR_BIT);
+  O(error) {
+    this.write(error, this.h & ~LOADING_BIT | ERROR_BIT);
   }
   /**
    * This is the core part of the reactivity system, which makes sure that the values are updated
@@ -403,7 +406,7 @@ var Computation = class extends Owner {
    *
    * This function will ensure that the value and states we read from the computation are up to date
    */
-  t() {
+  x() {
     if (this.a === STATE_DISPOSED) {
       throw new Error("Tried to read a disposed computation");
     }
@@ -412,9 +415,9 @@ var Computation = class extends Owner {
     }
     let observerFlags = 0;
     if (this.a === STATE_CHECK) {
-      for (let i = 0; i < this.c.length; i++) {
-        this.c[i].t();
-        observerFlags |= this.c[i].f;
+      for (let i = 0; i < this.d.length; i++) {
+        this.d[i].x();
+        observerFlags |= this.d[i].h;
         if (this.a === STATE_DIRTY) {
           break;
         }
@@ -430,49 +433,33 @@ var Computation = class extends Owner {
   /**
    * Remove ourselves from the owner graph and the computation graph
    */
-  x() {
+  y() {
     if (this.a === STATE_DISPOSED)
       return;
-    if (this.c)
+    if (this.d)
       removeSourceObservers(this, 0);
-    super.x();
+    super.y();
   }
 };
 function loadingState(node) {
-  const prevOwner = setOwner(node.o);
+  const prevOwner = setOwner(node.r);
   const options = void 0;
   const computation = new Computation(
     void 0,
     () => {
       track(node);
-      node.t();
-      return !!(node.f & LOADING_BIT);
+      node.x();
+      return !!(node.h & LOADING_BIT);
     },
     options
   );
-  computation.D = ERROR_BIT | LOADING_BIT;
-  setOwner(prevOwner);
-  return computation;
-}
-function errorState(node) {
-  const prevOwner = setOwner(node.o);
-  const options = void 0;
-  const computation = new Computation(
-    void 0,
-    () => {
-      track(node);
-      node.t();
-      return !!(node.f & ERROR_BIT);
-    },
-    options
-  );
-  computation.D = ERROR_BIT;
+  computation.M = ERROR_BIT | LOADING_BIT;
   setOwner(prevOwner);
   return computation;
 }
 function track(computation) {
   if (currentObserver) {
-    if (!newSources && currentObserver.c && currentObserver.c[newSourcesIndex] === computation) {
+    if (!newSources && currentObserver.d && currentObserver.d[newSourcesIndex] === computation) {
       newSourcesIndex++;
     } else if (!newSources)
       newSources = [computation];
@@ -480,7 +467,7 @@ function track(computation) {
       newSources.push(computation);
     }
     if (updateCheck) {
-      updateCheck.d = computation.I > currentObserver.I;
+      updateCheck.e = computation.z > currentObserver.z;
     }
   }
 }
@@ -492,41 +479,42 @@ function update(node) {
   try {
     node.dispose(false);
     node.emptyDisposal();
-    const result = compute(node, node.C, node);
+    const result = compute(node, node.w, node);
     node.write(result, newFlags, true);
   } catch (error) {
     if (error instanceof NotReadyError) {
       node.write(UNCHANGED, newFlags | LOADING_BIT);
     } else {
-      node.J(error);
+      node.O(error);
     }
   } finally {
     if (newSources) {
-      if (node.c)
+      if (node.d)
         removeSourceObservers(node, newSourcesIndex);
-      if (node.c && newSourcesIndex > 0) {
-        node.c.length = newSourcesIndex + newSources.length;
+      if (node.d && newSourcesIndex > 0) {
+        node.d.length = newSourcesIndex + newSources.length;
         for (let i = 0; i < newSources.length; i++) {
-          node.c[newSourcesIndex + i] = newSources[i];
+          node.d[newSourcesIndex + i] = newSources[i];
         }
       } else {
-        node.c = newSources;
+        node.d = newSources;
       }
       let source;
-      for (let i = newSourcesIndex; i < node.c.length; i++) {
-        source = node.c[i];
+      for (let i = newSourcesIndex; i < node.d.length; i++) {
+        source = node.d[i];
         if (!source.b)
           source.b = [node];
         else
           source.b.push(node);
       }
-    } else if (node.c && newSourcesIndex < node.c.length) {
+    } else if (node.d && newSourcesIndex < node.d.length) {
       removeSourceObservers(node, newSourcesIndex);
-      node.c.length = newSourcesIndex;
+      node.d.length = newSourcesIndex;
     }
     newSources = prevSources;
     newSourcesIndex = prevSourcesIndex;
     newFlags = prevFlags;
+    node.z = clock + 1;
     node.a = STATE_CLEAN;
   }
 }
@@ -534,14 +522,14 @@ function removeSourceObservers(node, index) {
   var _a;
   let source;
   let swap;
-  for (let i = index; i < node.c.length; i++) {
-    source = node.c[i];
+  for (let i = index; i < node.d.length; i++) {
+    source = node.d[i];
     if (source.b) {
       swap = source.b.indexOf(node);
       source.b[swap] = source.b[source.b.length - 1];
       source.b.pop();
       if (!source.b.length)
-        (_a = source.O) == null ? void 0 : _a.call(source);
+        (_a = source.S) == null ? void 0 : _a.call(source);
     }
   }
 }
@@ -555,10 +543,10 @@ function untrack(fn) {
 }
 function hasUpdated(fn) {
   const current = updateCheck;
-  updateCheck = { d: false };
+  updateCheck = { e: false };
   try {
     fn();
-    return updateCheck.d;
+    return updateCheck.e;
   } finally {
     updateCheck = current;
   }
@@ -571,7 +559,7 @@ function isPending(fn) {
     return e instanceof NotReadyError;
   }
 }
-function latest(fn) {
+function resolveSync(fn) {
   const prevFlags = newFlags;
   syncResolve = true;
   try {
@@ -582,12 +570,21 @@ function latest(fn) {
     syncResolve = false;
   }
 }
+function catchError(fn) {
+  try {
+    fn();
+  } catch (e) {
+    if (e instanceof NotReadyError)
+      throw e;
+    return e;
+  }
+}
 function compute(owner, compute2, observer) {
   const prevOwner = setOwner(owner), prevObserver = currentObserver, prevMask = currentMask;
   currentObserver = observer;
-  currentMask = (observer == null ? void 0 : observer.D) ?? DEFAULT_FLAGS;
+  currentMask = (observer == null ? void 0 : observer.M) ?? DEFAULT_FLAGS;
   try {
-    return compute2(observer ? observer.d : void 0);
+    return compute2(observer ? observer.e : void 0);
   } finally {
     setOwner(prevOwner);
     currentObserver = prevObserver;
@@ -601,93 +598,84 @@ function schedule() {
   if (scheduled)
     return;
   scheduled = true;
-  if (!globalQueue.E)
+  if (!globalQueue.I)
     queueMicrotask(flushSync);
 }
 var Queue = class {
-  E = false;
-  q = [[], [], []];
-  A = [];
+  I = false;
+  t = [[], [], []];
+  E = [];
   enqueue(type, node) {
-    this.q[0].push(node);
+    this.t[0].push(node);
     if (type)
-      this.q[type].push(node);
+      this.t[type].push(node);
     schedule();
   }
   run(type) {
-    if (this.q[type].length) {
+    if (this.t[type].length) {
       if (type === EFFECT_PURE) {
-        runPureQueue(this.q[type]);
-        this.q[type] = [];
+        runPureQueue(this.t[type]);
+        this.t[type] = [];
       } else {
-        const effects = this.q[type];
-        this.q[type] = [];
+        const effects = this.t[type];
+        this.t[type] = [];
         runEffectQueue(effects);
       }
     }
     let rerun = false;
-    for (let i = 0; i < this.A.length; i++) {
-      rerun = this.A[i].run(type) || rerun;
+    for (let i = 0; i < this.E.length; i++) {
+      rerun = this.E[i].run(type) || rerun;
     }
-    if (type === EFFECT_PURE && this.q[type].length)
+    if (type === EFFECT_PURE && this.t[type].length)
       return true;
   }
   flush() {
-    if (this.E)
+    if (this.I)
       return;
-    this.E = true;
+    this.I = true;
     try {
       while (this.run(EFFECT_PURE)) {
       }
-      ;
       incrementClock();
       scheduled = false;
       this.run(EFFECT_RENDER);
       this.run(EFFECT_USER);
     } finally {
-      this.E = false;
+      this.I = false;
     }
   }
   addChild(child) {
-    this.A.push(child);
+    this.E.push(child);
   }
   removeChild(child) {
-    const index = this.A.indexOf(child);
+    const index = this.E.indexOf(child);
     if (index >= 0)
-      this.A.splice(index, 1);
+      this.E.splice(index, 1);
   }
 };
 var globalQueue = new Queue();
-var globalTasks = [];
 function flushSync() {
   while (scheduled) {
     globalQueue.flush();
-    for (let i = 0; i < globalTasks.length; i++)
-      globalTasks[i]();
-    globalTasks.length = 0;
   }
 }
-function queueTask(fn) {
-  globalTasks.push(fn);
-  schedule();
-}
 function createBoundary(fn, queue) {
   const owner = new Owner();
-  const parentQueue = owner.e || globalQueue;
-  parentQueue.addChild(owner.e = queue);
-  onCleanup(() => parentQueue.removeChild(owner.e));
+  const parentQueue = owner.g || globalQueue;
+  parentQueue.addChild(owner.g = queue);
+  onCleanup(() => parentQueue.removeChild(owner.g));
   return compute(owner, fn, null);
 }
 function runTop(node) {
   const ancestors = [];
-  for (let current = node; current !== null; current = current.o) {
+  for (let current = node; current !== null; current = current.r) {
     if (current.a !== STATE_CLEAN) {
       ancestors.push(current);
     }
   }
   for (let i = ancestors.length - 1; i >= 0; i--) {
     if (ancestors[i].a !== STATE_DISPOSED)
-      ancestors[i].t();
+      ancestors[i].x();
   }
 }
 function runPureQueue(queue) {
@@ -698,101 +686,132 @@ function runPureQueue(queue) {
 }
 function runEffectQueue(queue) {
   for (let i = 0; i < queue.length; i++)
-    queue[i].R();
+    queue[i].V();
 }
 
 // src/core/effect.ts
 var Effect = class extends Computation {
-  K;
-  L = false;
-  F;
+  J;
+  A;
   B;
-  e;
-  constructor(initialValue, compute2, effect, options) {
+  P = false;
+  K;
+  C;
+  g;
+  constructor(initialValue, compute2, effect, error, options) {
     var _a;
     super(initialValue, compute2, options);
-    this.K = effect;
-    this.F = initialValue;
-    this.B = (options == null ? void 0 : options.render) ? EFFECT_RENDER : EFFECT_USER;
-    this.e = ((_a = getOwner()) == null ? void 0 : _a.e) || globalQueue;
-    this.t();
-    this.B === EFFECT_USER ? this.e.enqueue(this.B, this) : this.R();
+    this.J = effect;
+    this.A = error;
+    this.K = initialValue;
+    this.C = (options == null ? void 0 : options.render) ? EFFECT_RENDER : EFFECT_USER;
+    this.g = ((_a = getOwner()) == null ? void 0 : _a.g) || globalQueue;
+    if (!(options == null ? void 0 : options.defer)) {
+      this.x();
+      this.C === EFFECT_USER ? this.g.enqueue(this.C, this) : this.V();
+    }
   }
   write(value, flags = 0) {
     var _a, _b;
-    const currentFlags = this.f;
-    this.f = flags;
-    if (this.B === EFFECT_RENDER && (flags & LOADING_BIT) !== (currentFlags & LOADING_BIT)) {
-      (_b = (_a = this.e).S) == null ? void 0 : _b.call(_a, this);
+    const currentFlags = this.h;
+    this.h = flags;
+    if (this.C === EFFECT_RENDER && (flags & LOADING_BIT) !== (currentFlags & LOADING_BIT)) {
+      (_b = (_a = this.g).Q) == null ? void 0 : _b.call(_a, this);
     }
     if (value === UNCHANGED)
-      return this.d;
-    this.d = value;
-    this.L = true;
+      return this.e;
+    this.e = value;
+    this.P = true;
     return value;
   }
-  u(state) {
-    if (this.a >= state)
+  q(state, skipQueue) {
+    if (this.a >= state || skipQueue)
       return;
     if (this.a === STATE_CLEAN)
-      this.e.enqueue(this.B, this);
+      this.g.enqueue(this.C, this);
     this.a = state;
   }
-  J(error) {
+  O(error) {
+    var _a, _b, _c;
+    (_a = this.B) == null ? void 0 : _a.call(this);
+    if (this.h & LOADING_BIT) {
+      this.h = 0;
+      (_c = (_b = this.g).Q) == null ? void 0 : _c.call(_b, this);
+    }
+    if (this.C === EFFECT_USER) {
+      try {
+        return this.A ? this.B = this.A(error) : console.error(new EffectError(this.J, error));
+      } catch (e) {
+        error = e;
+      }
+    }
     this.handleError(error);
   }
-  x() {
+  y() {
+    var _a;
+    if (this.a === STATE_DISPOSED)
+      return;
+    this.J = void 0;
     this.K = void 0;
-    this.F = void 0;
-    super.x();
-  }
-  R() {
-    if (this.L && this.a !== STATE_DISPOSED) {
-      this.K(this.d, this.F);
-      this.F = this.d;
-      this.L = false;
+    this.A = void 0;
+    (_a = this.B) == null ? void 0 : _a.call(this);
+    this.B = void 0;
+    super.y();
+  }
+  V() {
+    var _a;
+    if (this.P && this.a !== STATE_DISPOSED) {
+      (_a = this.B) == null ? void 0 : _a.call(this);
+      try {
+        this.B = this.J(this.e, this.K);
+      } catch (e) {
+        this.handleError(e);
+      } finally {
+        this.K = this.e;
+        this.P = false;
+      }
     }
   }
 };
 var EagerComputation = class extends Computation {
-  e;
+  g;
   constructor(initialValue, compute2, options) {
     var _a;
     super(initialValue, compute2, options);
-    this.e = ((_a = getOwner()) == null ? void 0 : _a.e) || globalQueue;
-    this.t();
+    this.g = ((_a = getOwner()) == null ? void 0 : _a.g) || globalQueue;
+    this.x();
   }
-  u(state) {
-    if (this.a >= state)
+  q(state, skipQueue) {
+    if (this.a >= state && !this.H)
       return;
-    if (this.a === STATE_CLEAN)
-      this.e.enqueue(EFFECT_PURE, this);
-    super.u(state);
+    if (this.a === STATE_CLEAN && !skipQueue)
+      this.g.enqueue(EFFECT_PURE, this);
+    super.q(state, skipQueue);
   }
 };
 
 // src/core/suspense.ts
 var SuspenseQueue = class extends Queue {
-  g = /* @__PURE__ */ new Set();
-  r = false;
-  M = new Computation(false, null);
+  c = /* @__PURE__ */ new Set();
+  o = false;
+  R = new Computation(false, null);
   run(type) {
-    if (type && this.r)
+    if (type && this.o)
       return;
     return super.run(type);
   }
-  S(node) {
-    if (node.f & LOADING_BIT) {
-      this.g.add(node);
-      if (!this.r) {
-        this.r = true;
-        queueTask(() => this.M.write(true));
+  Q(node) {
+    if (node.h & LOADING_BIT) {
+      this.c.add(node);
+      if (!this.o) {
+        this.o = true;
+        this.R.write(true);
       }
     } else {
-      this.g.delete(node);
-      if (this.g.size === 0) {
-        this.r = false;
-        queueTask(() => this.M.write(false));
+      this.c.delete(node);
+      if (this.c.size === 0) {
+        this.o = false;
+        this.R.write(false);
       }
     }
   }
@@ -800,12 +819,12 @@ var SuspenseQueue = class extends Queue {
 var LiveComputation = class extends EagerComputation {
   write(value, flags = 0) {
     var _a, _b;
-    const currentFlags = this.f;
+    const currentFlags = this.h;
     super.write(value, flags);
     if ((flags & LOADING_BIT) !== (currentFlags & LOADING_BIT)) {
-      (_b = (_a = this.e).S) == null ? void 0 : _b.call(_a, this);
+      (_b = (_a = this.g).Q) == null ? void 0 : _b.call(_a, this);
     }
-    return this.d;
+    return this.e;
   }
 };
 function createSuspense(fn, fallback) {
@@ -814,7 +833,7 @@ function createSuspense(fn, fallback) {
     const child = new Computation(null, fn);
     return new LiveComputation(null, () => flatten(child.wait()));
   }, queue);
-  const equality = new Computation(null, () => queue.M.read() || queue.r);
+  const equality = new Computation(null, () => queue.R.read() || queue.o);
   const comp = new Computation(null, () => equality.read() ? fallback() : tree.read());
   return comp.read.bind(comp);
 }
@@ -846,10 +865,10 @@ function createMemo(compute2, value, options) {
     var _a, _b, _c;
     if (node) {
       resolvedValue = node.wait();
-      if (!((_a = node.c) == null ? void 0 : _a.length) && ((_b = node.m) == null ? void 0 : _b.o) !== node) {
+      if (!((_a = node.d) == null ? void 0 : _a.length) && ((_b = node.n) == null ? void 0 : _b.r) !== node) {
         node.dispose();
         node = void 0;
-      } else if (!node.o && !((_c = node.b) == null ? void 0 : _c.length)) {
+      } else if (!node.r && !((_c = node.b) == null ? void 0 : _c.length)) {
         node.dispose();
         node.a = STATE_UNINITIALIZED;
       }
@@ -860,10 +879,10 @@ function createMemo(compute2, value, options) {
 function createAsync(compute2, value, options) {
   const lhs = new EagerComputation(
     {
-      d: value
+      e: value
     },
     (p) => {
-      const value2 = p == null ? void 0 : p.d;
+      const value2 = p == null ? void 0 : p.e;
       const source = compute2(value2);
       const isPromise = source instanceof Promise;
       const iterator = source[Symbol.asyncIterator];
@@ -872,10 +891,18 @@ function createAsync(compute2, value, options) {
           wait() {
             return source;
           },
-          d: source
+          e: source
         };
       }
       const signal = new Computation(value2, null, options);
+      const w = signal.wait;
+      signal.wait = function() {
+        if (signal.h & ERROR_BIT && signal.z <= getClock()) {
+          lhs.q(STATE_DIRTY);
+          throw new NotReadyError();
+        }
+        return w.call(this);
+      };
       signal.write(UNCHANGED, LOADING_BIT);
       if (isPromise) {
         source.then(
@@ -906,16 +933,17 @@ function createAsync(compute2, value, options) {
   );
   return () => lhs.wait().wait();
 }
-function createEffect(compute2, effect, value, options) {
+function createEffect(compute2, effect, error, value, options) {
   void new Effect(
     value,
     compute2,
     effect,
+    error,
     void 0
   );
 }
 function createRenderEffect(compute2, effect, value, options) {
-  void new Effect(value, compute2, effect, {
+  void new Effect(value, compute2, effect, void 0, {
     render: true,
     ...void 0
   });
@@ -936,14 +964,14 @@ function createErrorBoundary(fn, fallback) {
   const owner = new Owner();
   const error = new Computation(null, null);
   const reset = new Computation(null, null, { equals: false });
-  const handler = (err) => error.write({ z: err });
-  owner.k = owner.k ? [handler, ...owner.k] : [handler];
+  const handler = (err) => error.write({ A: err });
+  owner.m = owner.m ? [handler, ...owner.m] : [handler];
   const guarded = compute(
     owner,
     () => {
       const c = new Computation(null, () => (reset.read(), fn()));
       const f = new Computation(null, () => flatten(c.read()));
-      f.J = function(error2) {
+      f.O = function(error2) {
         this.handleError(error2);
       };
       return f;
@@ -956,13 +984,78 @@ function createErrorBoundary(fn, fallback) {
       if (!error.read())
         return resolved;
     }
-    return fallback(error.read().z, () => {
+    return fallback(error.read().A, () => {
       error.write(null);
       reset.write(null);
     });
   });
   return decision.read.bind(decision);
 }
+function resolve(fn) {
+  return new Promise((res, rej) => {
+    let node = new EagerComputation(void 0, () => {
+      try {
+        res(fn());
+      } catch (err) {
+        if (err instanceof NotReadyError)
+          throw err;
+        rej(err);
+      }
+      node.dispose(true);
+    });
+  });
+}
+function createReaction(effect, error, options) {
+  const node = new Effect(void 0, () => {
+  }, effect, error, {
+    defer: true,
+    ...void 0
+  });
+  return (tracking) => {
+    node.w = tracking;
+    node.a = STATE_DIRTY;
+    node.x();
+    node.w = null;
+  };
+}
+
+// src/store/projection.ts
+var ProjectionComputation = class extends EagerComputation {
+  q(state, skipQueue) {
+    if (this.a >= state && !this.H)
+      return;
+    if (this.a === STATE_CLEAN && !skipQueue)
+      this.g.enqueue(EFFECT_PURE, this);
+    super.q(state, true);
+  }
+};
+function createProjection(fn, initialValue = {}) {
+  const [store, setStore] = createStore(initialValue);
+  const node = new ProjectionComputation(void 0, () => {
+    setStore(fn);
+  });
+  const wrapped = /* @__PURE__ */ new WeakMap();
+  return wrap(store, node, wrapped);
+}
+function wrap(source, node, wrapped) {
+  if (wrapped.has(source))
+    return wrapped.get(source);
+  const wrap3 = new Proxy(source, {
+    get(target, property) {
+      node.read();
+      const v = target[property];
+      return isWrappable(v) ? wrap3(v, node, wrapped) : v;
+    },
+    set() {
+      throw new Error("Projections are readonly");
+    },
+    deleteProperty() {
+      throw new Error("Projections are readonly");
+    }
+  });
+  wrapped.set(source, wrap3);
+  return wrap3;
+}
 
 // src/store/store.ts
 var $RAW = Symbol(0);
@@ -972,7 +1065,7 @@ var $PROXY = Symbol(0);
 var STORE_VALUE = "v";
 var STORE_NODE = "n";
 var STORE_HAS = "h";
-function wrap(value) {
+function wrap2(value) {
   let p = value[$PROXY];
   if (!p) {
     let target;
@@ -1080,8 +1173,8 @@ var proxyTraps = {
         return desc.get.call(receiver);
     }
     if (Writing.has(storeValue)) {
-      const value2 = tracked ? tracked.d : storeValue[property];
-      return isWrappable(value2) ? (Writing.add(value2[$RAW] || value2), wrap(value2)) : value2;
+      const value2 = tracked ? tracked.e : storeValue[property];
+      return isWrappable(value2) ? (Writing.add(value2[$RAW] || value2), wrap2(value2)) : value2;
     }
     let value = tracked ? nodes[property].read() : storeValue[property];
     if (!tracked) {
@@ -1089,10 +1182,10 @@ var proxyTraps = {
         let proto;
         return !Array.isArray(storeValue) && (proto = Object.getPrototypeOf(storeValue)) && proto !== Object.prototype ? value.bind(storeValue) : value;
       } else if (getObserver()) {
-        value = getNode(nodes, property, isWrappable(value) ? wrap(value) : value).read();
+        value = getNode(nodes, property, isWrappable(value) ? wrap2(value) : value).read();
       }
     }
-    return isWrappable(value) ? wrap(value) : value;
+    return isWrappable(value) ? wrap2(value) : value;
   },
   has(target, property) {
     if (property === $RAW || property === $PROXY || property === $TRACK || property === "__proto__")
@@ -1135,13 +1228,16 @@ function setProperty(state, property, value, deleting = false) {
   const nodes = getNodes(target, STORE_NODE);
   let node;
   if (node = nodes[property])
-    node.write(isWrappable(value) ? wrap(value) : value);
+    node.write(isWrappable(value) ? wrap2(value) : value);
   Array.isArray(state) && state.length !== len && (node = nodes.length) && node.write(state.length);
   (node = nodes[$TRACK]) && node.write(void 0);
 }
 function createStore(first, second) {
-  const derived = typeof first === "function", store = derived ? second : first, unwrappedStore = unwrap(store, false);
-  const wrappedStore = wrap(unwrappedStore);
+  const derived = typeof first === "function", store = derived ? second : first;
+  if (derived)
+    return createProjection(first, store);
+  const unwrappedStore = unwrap(store, false);
+  const wrappedStore = wrap2(unwrappedStore);
   const setStore = (fn) => {
     try {
       Writing.add(unwrappedStore);
@@ -1150,15 +1246,8 @@ function createStore(first, second) {
       Writing.clear();
     }
   };
-  if (derived) {
-    new EagerComputation(void 0, () => setStore(first));
-  }
   return [wrappedStore, setStore];
 }
-function createProjection(fn, initialValue = {}) {
-  const [store] = createStore(fn, initialValue);
-  return store;
-}
 
 // src/store/reconcile.ts
 function applyState(next, state, keyFn) {
@@ -1180,7 +1269,7 @@ function applyState(next, state, keyFn) {
     if (next.length && previous.length && next[0] && keyFn(next[0]) != null) {
       let i, j, start, end, newEnd, item, newIndicesNext, keyVal;
       for (start = 0, end = Math.min(previous.length, next.length); start < end && (previous[start] === next[start] || previous[start] && next[start] && keyFn(previous[start]) === keyFn(next[start])); start++) {
-        applyState(next[start], wrap(previous[start]), keyFn);
+        applyState(next[start], wrap2(previous[start]), keyFn);
       }
       const temp = new Array(next.length), newIndices = /* @__PURE__ */ new Map();
       for (end = previous.length - 1, newEnd = next.length - 1; end >= start && newEnd >= start && (previous[end] === next[newEnd] || previous[end] && next[newEnd] && keyFn(previous[end]) === keyFn(next[newEnd])); end--, newEnd--) {
@@ -1189,11 +1278,11 @@ function applyState(next, state, keyFn) {
       if (start > newEnd || start > end) {
         for (j = start; j <= newEnd; j++) {
           changed = true;
-          (_a = target[STORE_NODE][j]) == null ? void 0 : _a.write(wrap(next[j]));
+          (_a = target[STORE_NODE][j]) == null ? void 0 : _a.write(wrap2(next[j]));
         }
         for (; j < next.length; j++) {
           changed = true;
-          const wrapped = wrap(temp[j]);
+          const wrapped = wrap2(temp[j]);
           (_b = target[STORE_NODE][j]) == null ? void 0 : _b.write(wrapped);
           applyState(next[j], wrapped, keyFn);
         }
@@ -1221,17 +1310,17 @@ function applyState(next, state, keyFn) {
       }
       for (j = start; j < next.length; j++) {
         if (j in temp) {
-          const wrapped = wrap(temp[j]);
+          const wrapped = wrap2(temp[j]);
           (_e = target[STORE_NODE][j]) == null ? void 0 : _e.write(wrapped);
           applyState(next[j], wrapped, keyFn);
         } else
-          (_f = target[STORE_NODE][j]) == null ? void 0 : _f.write(wrap(next[j]));
+          (_f = target[STORE_NODE][j]) == null ? void 0 : _f.write(wrap2(next[j]));
       }
       if (start < next.length)
         changed = true;
     } else if (previous.length && next.length) {
       for (let i = 0, len = next.length; i < len; i++) {
-        isWrappable(previous[i]) && applyState(next[i], wrap(previous[i]), keyFn);
+        isWrappable(previous[i]) && applyState(next[i], wrap2(previous[i]), keyFn);
       }
     }
     if (previous.length !== next.length) {
@@ -1251,9 +1340,9 @@ function applyState(next, state, keyFn) {
       if (previousValue === nextValue)
         continue;
       if (!previousValue || !isWrappable(previousValue) || keyFn(previousValue) != null && keyFn(previousValue) !== keyFn(nextValue))
-        node.write(isWrappable(nextValue) ? wrap(nextValue) : nextValue);
+        node.write(isWrappable(nextValue) ? wrap2(nextValue) : nextValue);
       else
-        applyState(nextValue, wrap(previousValue), keyFn);
+        applyState(nextValue, wrap2(previousValue), keyFn);
     }
   }
   if (nodes = target[STORE_HAS]) {
@@ -1425,120 +1514,166 @@ function omit(props, ...keys) {
 function mapArray(list, map, options) {
   const keyFn = typeof (options == null ? void 0 : options.keyed) === "function" ? options.keyed : void 0;
   return updateKeyedMap.bind({
-    T: new Owner(),
-    w: 0,
-    U: list,
-    s: [],
-    N: map,
-    l: [],
-    g: [],
-    y: keyFn,
-    h: keyFn || (options == null ? void 0 : options.keyed) === false ? [] : void 0,
-    i: map.length > 1 ? [] : void 0,
-    r: options == null ? void 0 : options.fallback
+    F: new Owner(),
+    i: 0,
+    W: list,
+    u: [],
+    G: map,
+    f: [],
+    c: [],
+    D: keyFn,
+    j: keyFn || (options == null ? void 0 : options.keyed) === false ? [] : void 0,
+    k: map.length > 1 ? [] : void 0,
+    o: options == null ? void 0 : options.fallback
   });
 }
 function updateKeyedMap() {
-  const newItems = this.U() || [], newLen = newItems.length;
+  const newItems = this.W() || [], newLen = newItems.length;
   newItems[$TRACK];
-  runWithOwner(this.T, () => {
-    let i, j, mapper = this.h ? () => {
-      this.h[j] = new Computation(newItems[j], null);
-      this.i && (this.i[j] = new Computation(j, null));
-      return this.N(
-        Computation.prototype.read.bind(this.h[j]),
-        this.i ? Computation.prototype.read.bind(this.i[j]) : void 0
+  runWithOwner(this.F, () => {
+    let i, j, mapper = this.j ? () => {
+      this.j[j] = new Computation(newItems[j], null);
+      this.k && (this.k[j] = new Computation(j, null));
+      return this.G(
+        Computation.prototype.read.bind(this.j[j]),
+        this.k ? Computation.prototype.read.bind(this.k[j]) : void 0
       );
-    } : this.i ? () => {
+    } : this.k ? () => {
       const item = newItems[j];
-      this.i[j] = new Computation(j, null);
-      return this.N(() => item, Computation.prototype.read.bind(this.i[j]));
+      this.k[j] = new Computation(j, null);
+      return this.G(() => item, Computation.prototype.read.bind(this.k[j]));
     } : () => {
       const item = newItems[j];
-      return this.N(() => item);
+      return this.G(() => item);
     };
     if (newLen === 0) {
-      if (this.w !== 0) {
-        this.T.dispose(false);
-        this.g = [];
-        this.s = [];
-        this.l = [];
-        this.w = 0;
-        this.h && (this.h = []);
-        this.i && (this.i = []);
+      if (this.i !== 0) {
+        this.F.dispose(false);
+        this.c = [];
+        this.u = [];
+        this.f = [];
+        this.i = 0;
+        this.j && (this.j = []);
+        this.k && (this.k = []);
       }
-      if (this.r && !this.l[0]) {
-        this.l[0] = compute(
-          this.g[0] = new Owner(),
-          this.r,
+      if (this.o && !this.f[0]) {
+        this.f[0] = compute(
+          this.c[0] = new Owner(),
+          this.o,
           null
         );
       }
-    } else if (this.w === 0) {
-      if (this.g[0])
-        this.g[0].dispose();
-      this.l = new Array(newLen);
+    } else if (this.i === 0) {
+      if (this.c[0])
+        this.c[0].dispose();
+      this.f = new Array(newLen);
       for (j = 0; j < newLen; j++) {
-        this.s[j] = newItems[j];
-        this.l[j] = compute(this.g[j] = new Owner(), mapper, null);
+        this.u[j] = newItems[j];
+        this.f[j] = compute(this.c[j] = new Owner(), mapper, null);
       }
-      this.w = newLen;
+      this.i = newLen;
     } else {
-      let start, end, newEnd, item, key, newIndices, newIndicesNext, temp = new Array(newLen), tempNodes = new Array(newLen), tempRows = this.h ? new Array(newLen) : void 0, tempIndexes = this.i ? new Array(newLen) : void 0;
-      for (start = 0, end = Math.min(this.w, newLen); start < end && (this.s[start] === newItems[start] || this.h && compare(this.y, this.s[start], newItems[start])); start++) {
-        if (this.h)
-          this.h[start].write(newItems[start]);
+      let start, end, newEnd, item, key, newIndices, newIndicesNext, temp = new Array(newLen), tempNodes = new Array(newLen), tempRows = this.j ? new Array(newLen) : void 0, tempIndexes = this.k ? new Array(newLen) : void 0;
+      for (start = 0, end = Math.min(this.i, newLen); start < end && (this.u[start] === newItems[start] || this.j && compare(this.D, this.u[start], newItems[start])); start++) {
+        if (this.j)
+          this.j[start].write(newItems[start]);
       }
-      for (end = this.w - 1, newEnd = newLen - 1; end >= start && newEnd >= start && (this.s[end] === newItems[newEnd] || this.h && compare(this.y, this.s[end], newItems[newEnd])); end--, newEnd--) {
-        temp[newEnd] = this.l[end];
-        tempNodes[newEnd] = this.g[end];
-        tempRows && (tempRows[newEnd] = this.h[end]);
-        tempIndexes && (tempIndexes[newEnd] = this.i[end]);
+      for (end = this.i - 1, newEnd = newLen - 1; end >= start && newEnd >= start && (this.u[end] === newItems[newEnd] || this.j && compare(this.D, this.u[end], newItems[newEnd])); end--, newEnd--) {
+        temp[newEnd] = this.f[end];
+        tempNodes[newEnd] = this.c[end];
+        tempRows && (tempRows[newEnd] = this.j[end]);
+        tempIndexes && (tempIndexes[newEnd] = this.k[end]);
       }
       newIndices = /* @__PURE__ */ new Map();
       newIndicesNext = new Array(newEnd + 1);
       for (j = newEnd; j >= start; j--) {
         item = newItems[j];
-        key = this.y ? this.y(item) : item;
+        key = this.D ? this.D(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.s[i];
-        key = this.y ? this.y(item) : item;
+        item = this.u[i];
+        key = this.D ? this.D(item) : item;
         j = newIndices.get(key);
         if (j !== void 0 && j !== -1) {
-          temp[j] = this.l[i];
-          tempNodes[j] = this.g[i];
-          tempRows && (tempRows[j] = this.h[i]);
-          tempIndexes && (tempIndexes[j] = this.i[i]);
+          temp[j] = this.f[i];
+          tempNodes[j] = this.c[i];
+          tempRows && (tempRows[j] = this.j[i]);
+          tempIndexes && (tempIndexes[j] = this.k[i]);
           j = newIndicesNext[j];
           newIndices.set(key, j);
         } else
-          this.g[i].dispose();
+          this.c[i].dispose();
       }
       for (j = start; j < newLen; j++) {
         if (j in temp) {
-          this.l[j] = temp[j];
-          this.g[j] = tempNodes[j];
+          this.f[j] = temp[j];
+          this.c[j] = tempNodes[j];
           if (tempRows) {
-            this.h[j] = tempRows[j];
-            this.h[j].write(newItems[j]);
+            this.j[j] = tempRows[j];
+            this.j[j].write(newItems[j]);
           }
           if (tempIndexes) {
-            this.i[j] = tempIndexes[j];
-            this.i[j].write(j);
+            this.k[j] = tempIndexes[j];
+            this.k[j].write(j);
           }
         } else {
-          this.l[j] = compute(this.g[j] = new Owner(), mapper, null);
+          this.f[j] = compute(this.c[j] = new Owner(), mapper, null);
         }
       }
-      this.l = this.l.slice(0, this.w = newLen);
-      this.s = newItems.slice(0);
+      this.f = this.f.slice(0, this.i = newLen);
+      this.u = newItems.slice(0);
+    }
+  });
+  return this.f;
+}
+function repeat(count, map, options) {
+  return updateRepeat.bind({
+    F: new Owner(),
+    i: 0,
+    X: count,
+    G: map,
+    c: [],
+    f: [],
+    o: options == null ? void 0 : options.fallback
+  });
+}
+function updateRepeat() {
+  const newLen = this.X();
+  runWithOwner(this.F, () => {
+    if (newLen === 0) {
+      if (this.i !== 0) {
+        this.F.dispose(false);
+        this.c = [];
+        this.f = [];
+        this.i = 0;
+      }
+      if (this.o && !this.f[0]) {
+        this.f[0] = compute(
+          this.c[0] = new Owner(),
+          this.o,
+          null
+        );
+      }
+    } else {
+      if (this.i === 0 && this.c[0])
+        this.c[0].dispose();
+      for (let i = this.i; i < newLen; i++) {
+        this.f[i] = compute(
+          this.c[i] = new Owner(),
+          () => this.G(i),
+          null
+        );
+      }
+      for (let i = newLen; i < this.i; i++)
+        this.c[i].dispose();
+      this.f = this.f.slice(0, newLen);
+      this.i = newLen;
     }
   });
-  return this.l;
+  return this.f;
 }
 function compare(key, a, b) {
   return key ? key(a) === key(b) : true;
@@ -1555,6 +1690,7 @@ exports.NotReadyError = NotReadyError;
 exports.Owner = Owner;
 exports.Queue = Queue;
 exports.SUPPORTS_PROXY = SUPPORTS_PROXY;
+exports.catchError = catchError;
 exports.createAsync = createAsync;
 exports.createBoundary = createBoundary;
 exports.createContext = createContext;
@@ -1562,6 +1698,7 @@ exports.createEffect = createEffect;
 exports.createErrorBoundary = createErrorBoundary;
 exports.createMemo = createMemo;
 exports.createProjection = createProjection;
+exports.createReaction = createReaction;
 exports.createRenderEffect = createRenderEffect;
 exports.createRoot = createRoot;
 exports.createSignal = createSignal;
@@ -1577,12 +1714,14 @@ exports.hasUpdated = hasUpdated;
 exports.isEqual = isEqual;
 exports.isPending = isPending;
 exports.isWrappable = isWrappable;
-exports.latest = latest;
 exports.mapArray = mapArray;
 exports.merge = merge;
 exports.omit = omit;
 exports.onCleanup = onCleanup;
 exports.reconcile = reconcile;
+exports.repeat = repeat;
+exports.resolve = resolve;
+exports.resolveSync = resolveSync;
 exports.runWithOwner = runWithOwner;
 exports.setContext = setContext;
 exports.untrack = untrack;