@solidjs/signals 0.0.5 → 0.0.7

package/dist/node.cjs

@@ -105,9 +105,9 @@ var Owner = class {
   m = null;
   p = null;
   a = STATE_CLEAN;
-  i = null;
-  n = defaultContext;
   j = null;
+  n = defaultContext;
+  k = null;
   e = null;
   constructor(signal = false) {
     if (currentOwner && !signal)
@@ -123,8 +123,8 @@ var Owner = class {
     if (child.n !== this.n) {
       child.n = { ...this.n, ...child.n };
     }
-    if (this.j) {
-      child.j = !child.j ? this.j : [...child.j, ...this.j];
+    if (this.k) {
+      child.k = !child.k ? this.k : [...child.k, ...this.k];
     }
     if (this.e)
       child.e = this.e;
@@ -153,30 +153,30 @@ var Owner = class {
     this.o = null;
     this.p = null;
     this.n = defaultContext;
-    this.j = null;
+    this.k = null;
     this.a = STATE_DISPOSED;
     this.emptyDisposal();
   }
   emptyDisposal() {
-    if (!this.i)
+    if (!this.j)
       return;
-    if (Array.isArray(this.i)) {
-      for (let i = 0; i < this.i.length; i++) {
-        const callable = this.i[i];
+    if (Array.isArray(this.j)) {
+      for (let i = 0; i < this.j.length; i++) {
+        const callable = this.j[i];
         callable.call(callable);
       }
     } else {
-      this.i.call(this.i);
+      this.j.call(this.j);
     }
-    this.i = null;
+    this.j = null;
   }
   handleError(error) {
-    if (!this.j)
+    if (!this.k)
       throw error;
-    let i = 0, len = this.j.length;
+    let i = 0, len = this.k.length;
     for (i = 0; i < len; i++) {
       try {
-        this.j[i](error);
+        this.k[i](error);
         break;
       } catch (e) {
         error = e;
@@ -215,12 +215,12 @@ function onCleanup(fn) {
   if (!currentOwner)
     return fn;
   const node = currentOwner;
-  if (!node.i) {
-    node.i = fn;
-  } else if (Array.isArray(node.i)) {
-    node.i.push(fn);
+  if (!node.j) {
+    node.j = fn;
+  } else if (Array.isArray(node.j)) {
+    node.j.push(fn);
   } else {
-    node.i = [node.i, fn];
+    node.j = [node.j, fn];
   }
   return fn;
 }
@@ -252,35 +252,35 @@ var Computation = class extends Owner {
   c = null;
   b = null;
   d;
-  B;
+  C;
   // Used in __DEV__ mode, hopefully removed in production
   V;
   // Using false is an optimization as an alternative to _equals: () => false
   // which could enable more efficient DIRTY notification
-  F = isEqual;
-  N;
+  G = isEqual;
+  O;
   /** Whether the computation is an error or has ancestors that are unresolved */
   f = 0;
   /** Which flags raised by sources are handled, vs. being passed through. */
-  C = DEFAULT_FLAGS;
-  G = null;
+  D = DEFAULT_FLAGS;
+  z = null;
   H = null;
   I = -1;
   constructor(initialValue, compute2, options) {
     super(compute2 === null);
-    this.B = compute2;
+    this.C = compute2;
     this.a = compute2 ? STATE_UNINITIALIZED : STATE_CLEAN;
     this.d = initialValue;
     if ((options == null ? void 0 : options.equals) !== void 0)
-      this.F = options.equals;
+      this.G = options.equals;
     if (options == null ? void 0 : options.unobserved)
-      this.N = options == null ? void 0 : options.unobserved;
+      this.O = options == null ? void 0 : options.unobserved;
   }
-  O() {
+  P() {
     var _a;
-    if (this.B)
-      this.s();
-    if (!this.B || ((_a = this.c) == null ? void 0 : _a.length))
+    if (this.C)
+      this.t();
+    if (!this.C || ((_a = this.c) == null ? void 0 : _a.length))
       track(this);
     newFlags |= this.f & ~currentMask;
     if (this.f & ERROR_BIT) {
@@ -294,7 +294,7 @@ var Computation = class extends Owner {
    * Automatically re-executes the surrounding computation when the value changes
    */
   read() {
-    return this.O();
+    return this.P();
   }
   /**
    * Return the current value of this computation
@@ -307,7 +307,7 @@ var Computation = class extends Owner {
     if (!syncResolve && this.loading()) {
       throw new NotReadyError();
     }
-    return this.O();
+    return this.P();
   }
   /**
    * Return true if the computation is the value is dependent on an unresolved promise
@@ -327,15 +327,15 @@ var Computation = class extends Owner {
    * Triggers re-execution of the computation when the error state changes
    */
   error() {
-    if (this.G === null) {
-      this.G = errorState(this);
+    if (this.z === null) {
+      this.z = errorState(this);
     }
-    return this.G.read();
+    return this.z.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.F === false || !this.F(this.d, newValue));
+    const valueChanged = newValue !== UNCHANGED && (!!(flags & ERROR_BIT) || this.a === STATE_UNINITIALIZED || this.G === false || !this.G(this.d, newValue));
     if (valueChanged)
       this.d = newValue;
     const changedFlagsMask = this.f ^ flags, changedFlags = changedFlagsMask & flags;
@@ -344,9 +344,9 @@ var Computation = class extends Owner {
     if (this.b) {
       for (let i = 0; i < this.b.length; i++) {
         if (valueChanged) {
-          this.b[i].t(STATE_DIRTY);
+          this.b[i].u(STATE_DIRTY);
         } else if (changedFlagsMask) {
-          this.b[i].P(changedFlagsMask, changedFlags);
+          this.b[i].Q(changedFlagsMask, changedFlags);
         }
       }
     }
@@ -355,13 +355,13 @@ var Computation = class extends Owner {
   /**
    * Set the current node's state, and recursively mark all of this node's observers as STATE_CHECK
    */
-  t(state) {
+  u(state) {
     if (this.a >= state)
       return;
     this.a = state;
     if (this.b) {
       for (let i = 0; i < this.b.length; i++) {
-        this.b[i].t(STATE_CHECK);
+        this.b[i].u(STATE_CHECK);
       }
     }
   }
@@ -371,11 +371,11 @@ 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.
    */
-  P(mask, newFlags2) {
+  Q(mask, newFlags2) {
     if (this.a >= STATE_DIRTY)
       return;
-    if (mask & this.C) {
-      this.t(STATE_DIRTY);
+    if (mask & this.D) {
+      this.u(STATE_DIRTY);
       return;
     }
     if (this.a >= STATE_CHECK)
@@ -383,17 +383,17 @@ var Computation = class extends Owner {
     const prevFlags = this.f & mask;
     const deltaFlags = prevFlags ^ newFlags2;
     if (newFlags2 === prevFlags) ; else if (deltaFlags & prevFlags & mask) {
-      this.t(STATE_CHECK);
+      this.u(STATE_CHECK);
     } else {
       this.f ^= deltaFlags;
       if (this.b) {
         for (let i = 0; i < this.b.length; i++) {
-          this.b[i].P(mask, newFlags2);
+          this.b[i].Q(mask, newFlags2);
         }
       }
     }
   }
-  Q(error) {
+  J(error) {
     this.write(error, this.f | ERROR_BIT);
   }
   /**
@@ -403,7 +403,7 @@ var Computation = class extends Owner {
    *
    * This function will ensure that the value and states we read from the computation are up to date
    */
-  s() {
+  t() {
     if (this.a === STATE_DISPOSED) {
       throw new Error("Tried to read a disposed computation");
     }
@@ -413,7 +413,7 @@ 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].s();
+        this.c[i].t();
         observerFlags |= this.c[i].f;
         if (this.a === STATE_DIRTY) {
           break;
@@ -445,12 +445,12 @@ function loadingState(node) {
     void 0,
     () => {
       track(node);
-      node.s();
+      node.t();
       return !!(node.f & LOADING_BIT);
     },
     options
   );
-  computation.C = ERROR_BIT | LOADING_BIT;
+  computation.D = ERROR_BIT | LOADING_BIT;
   setOwner(prevOwner);
   return computation;
 }
@@ -461,12 +461,12 @@ function errorState(node) {
     void 0,
     () => {
       track(node);
-      node.s();
+      node.t();
       return !!(node.f & ERROR_BIT);
     },
     options
   );
-  computation.C = ERROR_BIT;
+  computation.D = ERROR_BIT;
   setOwner(prevOwner);
   return computation;
 }
@@ -492,13 +492,13 @@ function update(node) {
   try {
     node.dispose(false);
     node.emptyDisposal();
-    const result = compute(node, node.B, node);
+    const result = compute(node, node.C, node);
     node.write(result, newFlags, true);
   } catch (error) {
     if (error instanceof NotReadyError) {
       node.write(UNCHANGED, newFlags | LOADING_BIT);
     } else {
-      node.Q(error);
+      node.J(error);
     }
   } finally {
     if (newSources) {
@@ -541,7 +541,7 @@ function removeSourceObservers(node, index) {
       source.b[swap] = source.b[source.b.length - 1];
       source.b.pop();
       if (!source.b.length)
-        (_a = source.N) == null ? void 0 : _a.call(source);
+        (_a = source.O) == null ? void 0 : _a.call(source);
     }
   }
 }
@@ -585,7 +585,7 @@ function latest(fn) {
 function compute(owner, compute2, observer) {
   const prevOwner = setOwner(owner), prevObserver = currentObserver, prevMask = currentMask;
   currentObserver = observer;
-  currentMask = (observer == null ? void 0 : observer.C) ?? DEFAULT_FLAGS;
+  currentMask = (observer == null ? void 0 : observer.D) ?? DEFAULT_FLAGS;
   try {
     return compute2(observer ? observer.d : void 0);
   } finally {
@@ -601,55 +601,60 @@ function schedule() {
   if (scheduled)
     return;
   scheduled = true;
-  if (!globalQueue.D)
+  if (!globalQueue.E)
     queueMicrotask(flushSync);
 }
 var Queue = class {
-  D = false;
-  u = [[], [], []];
-  z = [];
+  E = false;
+  q = [[], [], []];
+  A = [];
   enqueue(type, node) {
-    this.u[0].push(node);
+    this.q[0].push(node);
     if (type)
-      this.u[type].push(node);
+      this.q[type].push(node);
     schedule();
   }
   run(type) {
-    if (this.u[type].length) {
+    if (this.q[type].length) {
       if (type === EFFECT_PURE) {
-        runPureQueue(this.u[type]);
-        this.u[type] = [];
+        runPureQueue(this.q[type]);
+        this.q[type] = [];
       } else {
-        const effects = this.u[type];
-        this.u[type] = [];
+        const effects = this.q[type];
+        this.q[type] = [];
         runEffectQueue(effects);
       }
     }
-    for (let i = 0; i < this.z.length; i++) {
-      this.z[i].run(type);
+    let rerun = false;
+    for (let i = 0; i < this.A.length; i++) {
+      rerun = this.A[i].run(type) || rerun;
     }
+    if (type === EFFECT_PURE && this.q[type].length)
+      return true;
   }
   flush() {
-    if (this.D)
+    if (this.E)
       return;
-    this.D = true;
+    this.E = true;
     try {
-      this.run(EFFECT_PURE);
+      while (this.run(EFFECT_PURE)) {
+      }
+      ;
       incrementClock();
       scheduled = false;
       this.run(EFFECT_RENDER);
       this.run(EFFECT_USER);
     } finally {
-      this.D = false;
+      this.E = false;
     }
   }
   addChild(child) {
-    this.z.push(child);
+    this.A.push(child);
   }
   removeChild(child) {
-    const index = this.z.indexOf(child);
+    const index = this.A.indexOf(child);
     if (index >= 0)
-      this.z.splice(index, 1);
+      this.A.splice(index, 1);
   }
 };
 var globalQueue = new Queue();
@@ -682,7 +687,7 @@ function runTop(node) {
   }
   for (let i = ancestors.length - 1; i >= 0; i--) {
     if (ancestors[i].a !== STATE_DISPOSED)
-      ancestors[i].s();
+      ancestors[i].t();
   }
 }
 function runPureQueue(queue) {
@@ -698,54 +703,54 @@ function runEffectQueue(queue) {
 
 // src/core/effect.ts
 var Effect = class extends Computation {
-  J;
-  K = false;
-  E;
-  A;
+  K;
+  L = false;
+  F;
+  B;
   e;
   constructor(initialValue, compute2, effect, options) {
     var _a;
     super(initialValue, compute2, options);
-    this.J = effect;
-    this.E = initialValue;
-    this.A = (options == null ? void 0 : options.render) ? EFFECT_RENDER : EFFECT_USER;
+    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.s();
-    this.A === EFFECT_USER ? this.e.enqueue(this.A, this) : this.R();
+    this.t();
+    this.B === EFFECT_USER ? this.e.enqueue(this.B, this) : this.R();
   }
   write(value, flags = 0) {
     var _a, _b;
     const currentFlags = this.f;
     this.f = flags;
-    if (this.A === EFFECT_RENDER && (flags & LOADING_BIT) !== (currentFlags & LOADING_BIT)) {
+    if (this.B === EFFECT_RENDER && (flags & LOADING_BIT) !== (currentFlags & LOADING_BIT)) {
       (_b = (_a = this.e).S) == null ? void 0 : _b.call(_a, this);
     }
     if (value === UNCHANGED)
       return this.d;
     this.d = value;
-    this.K = true;
+    this.L = true;
     return value;
   }
-  t(state) {
+  u(state) {
     if (this.a >= state)
       return;
     if (this.a === STATE_CLEAN)
-      this.e.enqueue(this.A, this);
+      this.e.enqueue(this.B, this);
     this.a = state;
   }
-  Q(error) {
+  J(error) {
     this.handleError(error);
   }
   x() {
-    this.J = void 0;
-    this.E = void 0;
+    this.K = void 0;
+    this.F = void 0;
     super.x();
   }
   R() {
-    if (this.K && this.a !== STATE_DISPOSED) {
-      this.J(this.d, this.E);
-      this.E = this.d;
-      this.K = false;
+    if (this.L && this.a !== STATE_DISPOSED) {
+      this.K(this.d, this.F);
+      this.F = this.d;
+      this.L = false;
     }
   }
 };
@@ -755,39 +760,39 @@ var EagerComputation = class extends Computation {
     var _a;
     super(initialValue, compute2, options);
     this.e = ((_a = getOwner()) == null ? void 0 : _a.e) || globalQueue;
-    this.s();
+    this.t();
   }
-  t(state) {
+  u(state) {
     if (this.a >= state)
       return;
     if (this.a === STATE_CLEAN)
       this.e.enqueue(EFFECT_PURE, this);
-    super.t(state);
+    super.u(state);
   }
 };
 
 // src/core/suspense.ts
 var SuspenseQueue = class extends Queue {
   g = /* @__PURE__ */ new Set();
-  q = false;
-  L = new Computation(false, null);
+  r = false;
+  M = new Computation(false, null);
   run(type) {
-    if (type && this.q)
+    if (type && this.r)
       return;
-    super.run(type);
+    return super.run(type);
   }
   S(node) {
     if (node.f & LOADING_BIT) {
       this.g.add(node);
-      if (!this.q) {
-        this.q = true;
-        queueTask(() => this.L.write(true));
+      if (!this.r) {
+        this.r = true;
+        queueTask(() => this.M.write(true));
       }
     } else {
       this.g.delete(node);
       if (this.g.size === 0) {
-        this.q = false;
-        queueTask(() => this.L.write(false));
+        this.r = false;
+        queueTask(() => this.M.write(false));
       }
     }
   }
@@ -803,14 +808,14 @@ var LiveComputation = class extends EagerComputation {
     return this.d;
   }
 };
-function createSuspense(fn, fallbackFn) {
+function createSuspense(fn, fallback) {
   const queue = new SuspenseQueue();
   const tree = createBoundary(() => {
     const child = new Computation(null, fn);
     return new LiveComputation(null, () => flatten(child.wait()));
   }, queue);
-  const equality = new Computation(null, () => queue.L.read() || queue.q);
-  const comp = new Computation(null, () => equality.read() ? untrack(fallbackFn) : tree.read());
+  const equality = new Computation(null, () => queue.M.read() || queue.r);
+  const comp = new Computation(null, () => equality.read() ? fallback() : tree.read());
   return comp.read.bind(comp);
 }
 
@@ -927,14 +932,36 @@ function runWithOwner(owner, run) {
     return void 0;
   }
 }
-function catchError(fn, handler) {
+function createErrorBoundary(fn, fallback) {
   const owner = new Owner();
-  owner.j = owner.j ? [handler, ...owner.j] : [handler];
-  try {
-    return compute(owner, fn, null);
-  } catch (error) {
-    owner.handleError(error);
-  }
+  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 guarded = compute(
+    owner,
+    () => {
+      const c = new Computation(null, () => (reset.read(), fn()));
+      const f = new Computation(null, () => flatten(c.read()));
+      f.J = function(error2) {
+        this.handleError(error2);
+      };
+      return f;
+    },
+    null
+  );
+  const decision = new Computation(null, () => {
+    if (!error.read()) {
+      const resolved = guarded.read();
+      if (!error.read())
+        return resolved;
+    }
+    return fallback(error.read().z, () => {
+      error.write(null);
+      reset.write(null);
+    });
+  });
+  return decision.read.bind(decision);
 }
 
 // src/store/store.ts
@@ -1401,14 +1428,14 @@ function mapArray(list, map, options) {
     T: new Owner(),
     w: 0,
     U: list,
-    r: [],
-    M: map,
-    k: [],
+    s: [],
+    N: map,
+    l: [],
     g: [],
     y: keyFn,
     h: keyFn || (options == null ? void 0 : options.keyed) === false ? [] : void 0,
-    l: map.length > 1 ? [] : void 0,
-    q: options == null ? void 0 : options.fallback
+    i: map.length > 1 ? [] : void 0,
+    r: options == null ? void 0 : options.fallback
   });
 }
 function updateKeyedMap() {
@@ -1417,56 +1444,56 @@ function updateKeyedMap() {
   runWithOwner(this.T, () => {
     let i, j, mapper = this.h ? () => {
       this.h[j] = new Computation(newItems[j], null);
-      this.l[j] = new Computation(j, null);
-      return this.M(
+      this.i && (this.i[j] = new Computation(j, null));
+      return this.N(
         Computation.prototype.read.bind(this.h[j]),
-        Computation.prototype.read.bind(this.l[j])
+        this.i ? Computation.prototype.read.bind(this.i[j]) : void 0
       );
-    } : this.l ? () => {
+    } : this.i ? () => {
       const item = newItems[j];
-      this.l[j] = new Computation(j, null);
-      return this.M(() => item, Computation.prototype.read.bind(this.l[j]));
+      this.i[j] = new Computation(j, null);
+      return this.N(() => item, Computation.prototype.read.bind(this.i[j]));
     } : () => {
       const item = newItems[j];
-      return this.M(() => item);
+      return this.N(() => item);
     };
     if (newLen === 0) {
       if (this.w !== 0) {
         this.T.dispose(false);
         this.g = [];
-        this.r = [];
-        this.k = [];
+        this.s = [];
+        this.l = [];
         this.w = 0;
         this.h && (this.h = []);
-        this.l && (this.l = []);
+        this.i && (this.i = []);
       }
-      if (this.q && !this.k[0]) {
-        this.k[0] = compute(
+      if (this.r && !this.l[0]) {
+        this.l[0] = compute(
           this.g[0] = new Owner(),
-          this.q,
+          this.r,
           null
         );
       }
     } else if (this.w === 0) {
       if (this.g[0])
         this.g[0].dispose();
-      this.k = new Array(newLen);
+      this.l = new Array(newLen);
       for (j = 0; j < newLen; j++) {
-        this.r[j] = newItems[j];
-        this.k[j] = compute(this.g[j] = new Owner(), mapper, null);
+        this.s[j] = newItems[j];
+        this.l[j] = compute(this.g[j] = new Owner(), mapper, null);
       }
       this.w = 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.l ? new Array(newLen) : void 0;
-      for (start = 0, end = Math.min(this.w, newLen); start < end && (this.r[start] === newItems[start] || this.h && compare(this.y, this.r[start], newItems[start])); start++) {
+      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]);
       }
-      for (end = this.w - 1, newEnd = newLen - 1; end >= start && newEnd >= start && (this.r[end] === newItems[newEnd] || this.h && compare(this.y, this.r[end], newItems[newEnd])); end--, newEnd--) {
-        temp[newEnd] = this.k[end];
+      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.l[end]);
+        tempIndexes && (tempIndexes[newEnd] = this.i[end]);
       }
       newIndices = /* @__PURE__ */ new Map();
       newIndicesNext = new Array(newEnd + 1);
@@ -1478,14 +1505,14 @@ function updateKeyedMap() {
         newIndices.set(key, j);
       }
       for (i = start; i <= end; i++) {
-        item = this.r[i];
+        item = this.s[i];
         key = this.y ? this.y(item) : item;
         j = newIndices.get(key);
         if (j !== void 0 && j !== -1) {
-          temp[j] = this.k[i];
+          temp[j] = this.l[i];
           tempNodes[j] = this.g[i];
           tempRows && (tempRows[j] = this.h[i]);
-          tempIndexes && (tempIndexes[j] = this.l[i]);
+          tempIndexes && (tempIndexes[j] = this.i[i]);
           j = newIndicesNext[j];
           newIndices.set(key, j);
         } else
@@ -1493,25 +1520,25 @@ function updateKeyedMap() {
       }
       for (j = start; j < newLen; j++) {
         if (j in temp) {
-          this.k[j] = temp[j];
+          this.l[j] = temp[j];
           this.g[j] = tempNodes[j];
           if (tempRows) {
             this.h[j] = tempRows[j];
             this.h[j].write(newItems[j]);
           }
           if (tempIndexes) {
-            this.l[j] = tempIndexes[j];
-            this.l[j].write(j);
+            this.i[j] = tempIndexes[j];
+            this.i[j].write(j);
           }
         } else {
-          this.k[j] = compute(this.g[j] = new Owner(), mapper, null);
+          this.l[j] = compute(this.g[j] = new Owner(), mapper, null);
         }
       }
-      this.k = this.k.slice(0, this.w = newLen);
-      this.r = newItems.slice(0);
+      this.l = this.l.slice(0, this.w = newLen);
+      this.s = newItems.slice(0);
     }
   });
-  return this.k;
+  return this.l;
 }
 function compare(key, a, b) {
   return key ? key(a) === key(b) : true;
@@ -1528,11 +1555,11 @@ 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;
 exports.createEffect = createEffect;
+exports.createErrorBoundary = createErrorBoundary;
 exports.createMemo = createMemo;
 exports.createProjection = createProjection;
 exports.createRenderEffect = createRenderEffect;