@solidjs/signals 0.4.5 → 0.4.6

package/dist/dev.js

@@ -1044,6 +1044,7 @@ var Effect = class extends Computation {
     this._onerror = void 0;
     this._cleanup?.();
     this._cleanup = void 0;
+    this._queue.notify(this, ERROR_BIT | LOADING_BIT, 0);
     super._disposeNode();
   }
   _run(type) {

package/dist/node.cjs

@@ -263,12 +263,12 @@ var Transition = class _Transition {
     }
   }
   addOptimistic(fn) {
-    if (fn.k && fn.k !== this) {
-      mergeTransitions(fn.k, this);
-      ActiveTransition = fn.k;
+    if (fn.l && fn.l !== this) {
+      mergeTransitions(fn.l, this);
+      ActiveTransition = fn.l;
       return;
     }
-    fn.k = this;
+    fn.l = this;
     this.W.add(fn);
   }
 };
@@ -277,12 +277,12 @@ function transition(fn) {
   queueMicrotask(() => t.runTransition(() => fn((fn2) => t.runTransition(fn2))));
 }
 function cloneGraph(node) {
-  if (node.k) {
-    if (node.k !== ActiveTransition) {
-      mergeTransitions(node.k, ActiveTransition);
-      ActiveTransition = node.k;
+  if (node.l) {
+    if (node.l !== ActiveTransition) {
+      mergeTransitions(node.l, ActiveTransition);
+      ActiveTransition = node.l;
     }
-    return node.k.a.get(node);
+    return node.l.a.get(node);
   }
   const clone = Object.create(Object.getPrototypeOf(node));
   Object.assign(clone, node, {
@@ -293,7 +293,7 @@ function cloneGraph(node) {
     g: node
   });
   ActiveTransition.a.set(node, clone);
-  node.k = ActiveTransition;
+  node.l = ActiveTransition;
   if (node.a) {
     for (let i = 0; i < node.a.length; i++)
       node.a[i].b.push(clone);
@@ -364,11 +364,11 @@ function resolveQueues(children) {
 }
 function mergeTransitions(t1, t2) {
   t2.a.forEach((value, key) => {
-    key.k = t1;
+    key.l = t1;
     t1.a.set(key, value);
   });
   t2.W.forEach((c) => {
-    c.k = t1;
+    c.l = t1;
     t1.W.add(c);
   });
   t2.R.forEach((p) => t1.R.add(p));
@@ -380,7 +380,7 @@ function finishTransition(transition2) {
   if (transition2.I || transition2.X || transition2.R.size || transition2.s.size)
     return;
   for (const [source, clone] of transition2.a) {
-    if (source === clone || source.k !== transition2)
+    if (source === clone || source.l !== transition2)
       continue;
     if (clone.a)
       replaceSourceObservers(clone, transition2);
@@ -388,14 +388,14 @@ function finishTransition(transition2) {
     source.emptyDisposal();
     Object.assign(source, clone);
     delete source.g;
-    delete source.k;
+    delete source.l;
   }
   globalQueue.f[0].push.apply(globalQueue.f[0], transition2.f[0]);
   globalQueue.f[1].push.apply(globalQueue.f[1], transition2.f[1]);
   resolveQueues(transition2.e);
   transition2.I = true;
   for (const reset of transition2.W) {
-    delete reset.k;
+    delete reset.l;
     reset();
   }
   globalQueue.flush();
@@ -422,7 +422,7 @@ var Owner = class {
   c = STATE_CLEAN;
   n = null;
   w = defaultContext;
-  l = globalQueue;
+  k = globalQueue;
   ea = 0;
   id = null;
   constructor(id = null, skipAppend = false) {
@@ -443,8 +443,8 @@ var Owner = class {
     if (child.w !== this.w) {
       child.w = { ...this.w, ...child.w };
     }
-    if (this.l)
-      child.l = this.l;
+    if (this.k)
+      child.k = this.k;
   }
   dispose(self = true) {
     if (this.c === STATE_DISPOSED)
@@ -571,7 +571,7 @@ var Computation = class extends Owner {
   aa = DEFAULT_FLAGS;
   M = -1;
   G = false;
-  k;
+  l;
   g;
   constructor(initialValue, compute2, options) {
     super(options == null ? void 0 : options.id, compute2 === null);
@@ -586,7 +586,7 @@ var Computation = class extends Owner {
     if (options == null ? void 0 : options.unobserved)
       this.da = options == null ? void 0 : options.unobserved;
     if (ActiveTransition) {
-      this.k = ActiveTransition;
+      this.l = ActiveTransition;
       ActiveTransition.a.set(this, this);
     }
   }
@@ -976,17 +976,17 @@ var Effect = class extends Computation {
     this.A = (options == null ? void 0 : options.render) ? EFFECT_RENDER : EFFECT_USER;
     if (this.A === EFFECT_RENDER) {
       this.L = function(p) {
-        return !this.g && clock > this.l.created && !(this.h & ERROR_BIT) ? latest(() => compute2(p)) : compute2(p);
+        return !this.g && clock > this.k.created && !(this.h & ERROR_BIT) ? latest(() => compute2(p)) : compute2(p);
       };
     }
     this.H();
-    !(options == null ? void 0 : options.defer) && (this.A === EFFECT_USER ? this.l.enqueue(this.A, this.C.bind(this)) : this.C(this.A));
+    !(options == null ? void 0 : options.defer) && (this.A === EFFECT_USER ? this.k.enqueue(this.A, this.C.bind(this)) : this.C(this.A));
   }
   write(value, flags = 0) {
     if (this.c == STATE_DIRTY) {
       this.h = flags;
       if (this.A === EFFECT_RENDER) {
-        this.l.notify(this, LOADING_BIT | ERROR_BIT, this.h);
+        this.k.notify(this, LOADING_BIT | ERROR_BIT, this.h);
       }
     }
     if (value === UNCHANGED)
@@ -1000,7 +1000,7 @@ var Effect = class extends Computation {
     if (this.c >= state || skipQueue)
       return;
     if (this.c === STATE_CLEAN)
-      this.l.enqueue(this.A, this.C.bind(this));
+      this.k.enqueue(this.A, this.C.bind(this));
     this.c = state;
   }
   Y(mask, newFlags2) {
@@ -1016,7 +1016,7 @@ var Effect = class extends Computation {
   }
   N(error) {
     this.K = error;
-    this.l.notify(this, LOADING_BIT, 0);
+    this.k.notify(this, LOADING_BIT, 0);
     this.h = ERROR_BIT;
     if (this.A === EFFECT_USER) {
       try {
@@ -1029,7 +1029,7 @@ var Effect = class extends Computation {
         error = e;
       }
     }
-    if (!this.l.notify(this, ERROR_BIT, ERROR_BIT))
+    if (!this.k.notify(this, ERROR_BIT, ERROR_BIT))
       throw error;
   }
   J() {
@@ -1041,6 +1041,7 @@ var Effect = class extends Computation {
     this.Z = void 0;
     (_a = this.O) == null ? void 0 : _a.call(this);
     this.O = void 0;
+    this.k.notify(this, ERROR_BIT | LOADING_BIT, 0);
     super.J();
   }
   C(type) {
@@ -1052,7 +1053,7 @@ var Effect = class extends Computation {
         try {
           effect.O = effect.ba(effect.j, effect._);
         } catch (e) {
-          if (!effect.l.notify(effect, ERROR_BIT, ERROR_BIT))
+          if (!effect.k.notify(effect, ERROR_BIT, ERROR_BIT))
             throw e;
         } finally {
           effect._ = effect.j;
@@ -1072,7 +1073,7 @@ var EagerComputation = class extends Computation {
     if (this.c >= state && !this.G)
       return;
     if (!skipQueue && (this.c === STATE_CLEAN || this.c === STATE_CHECK && this.G))
-      this.l.enqueue(EFFECT_PURE, this.C.bind(this));
+      this.k.enqueue(EFFECT_PURE, this.C.bind(this));
     super.x(state, skipQueue);
   }
   C() {
@@ -1088,7 +1089,7 @@ var FirewallComputation = class extends Computation {
     if (this.c >= state && !this.G)
       return;
     if (!skipQueue && (this.c === STATE_CLEAN || this.c === STATE_CHECK && this.G))
-      this.l.enqueue(EFFECT_PURE, this.C.bind(this));
+      this.k.enqueue(EFFECT_PURE, this.C.bind(this));
     super.x(state, true);
     this.G = !!skipQueue;
   }
@@ -2172,14 +2173,14 @@ var BoundaryComputation = class extends EagerComputation {
     if (this.U & LOADING_BIT && !(this.h & UNINITIALIZED_BIT)) {
       flags &= ~LOADING_BIT;
     }
-    this.l.notify(this, this.U, flags);
+    this.k.notify(this, this.U, flags);
     return this.j;
   }
 };
 function createBoundChildren(owner, fn, queue, mask) {
-  const parentQueue = owner.l;
-  parentQueue.addChild(owner.l = queue);
-  onCleanup(() => parentQueue.removeChild(owner.l));
+  const parentQueue = owner.k;
+  parentQueue.addChild(owner.k = queue);
+  onCleanup(() => parentQueue.removeChild(owner.k));
   return compute(
     owner,
     () => {
@@ -2310,7 +2311,7 @@ function createErrorBoundary(fn, fallback) {
         if (ActiveTransition && !node2.g)
           node2 = cloneGraph(node2);
         node2.c = STATE_DIRTY;
-        (_a = node2.l) == null ? void 0 : _a.enqueue(node2.A, node2.C.bind(node2));
+        (_a = node2.k) == null ? void 0 : _a.enqueue(node2.A, node2.C.bind(node2));
       }
     });
   });

package/dist/prod.js

@@ -260,12 +260,12 @@ var Transition = class _Transition {
     }
   }
   addOptimistic(fn) {
-    if (fn.k && fn.k !== this) {
-      mergeTransitions(fn.k, this);
-      ActiveTransition = fn.k;
+    if (fn.l && fn.l !== this) {
+      mergeTransitions(fn.l, this);
+      ActiveTransition = fn.l;
       return;
     }
-    fn.k = this;
+    fn.l = this;
     this.W.add(fn);
   }
 };
@@ -274,12 +274,12 @@ function transition(fn) {
   queueMicrotask(() => t.runTransition(() => fn((fn2) => t.runTransition(fn2))));
 }
 function cloneGraph(node) {
-  if (node.k) {
-    if (node.k !== ActiveTransition) {
-      mergeTransitions(node.k, ActiveTransition);
-      ActiveTransition = node.k;
+  if (node.l) {
+    if (node.l !== ActiveTransition) {
+      mergeTransitions(node.l, ActiveTransition);
+      ActiveTransition = node.l;
     }
-    return node.k.a.get(node);
+    return node.l.a.get(node);
   }
   const clone = Object.create(Object.getPrototypeOf(node));
   Object.assign(clone, node, {
@@ -290,7 +290,7 @@ function cloneGraph(node) {
     g: node
   });
   ActiveTransition.a.set(node, clone);
-  node.k = ActiveTransition;
+  node.l = ActiveTransition;
   if (node.a) {
     for (let i = 0; i < node.a.length; i++)
       node.a[i].b.push(clone);
@@ -361,11 +361,11 @@ function resolveQueues(children) {
 }
 function mergeTransitions(t1, t2) {
   t2.a.forEach((value, key) => {
-    key.k = t1;
+    key.l = t1;
     t1.a.set(key, value);
   });
   t2.W.forEach((c) => {
-    c.k = t1;
+    c.l = t1;
     t1.W.add(c);
   });
   t2.R.forEach((p) => t1.R.add(p));
@@ -377,7 +377,7 @@ function finishTransition(transition2) {
   if (transition2.I || transition2.X || transition2.R.size || transition2.s.size)
     return;
   for (const [source, clone] of transition2.a) {
-    if (source === clone || source.k !== transition2)
+    if (source === clone || source.l !== transition2)
       continue;
     if (clone.a)
       replaceSourceObservers(clone, transition2);
@@ -385,14 +385,14 @@ function finishTransition(transition2) {
     source.emptyDisposal();
     Object.assign(source, clone);
     delete source.g;
-    delete source.k;
+    delete source.l;
   }
   globalQueue.f[0].push.apply(globalQueue.f[0], transition2.f[0]);
   globalQueue.f[1].push.apply(globalQueue.f[1], transition2.f[1]);
   resolveQueues(transition2.e);
   transition2.I = true;
   for (const reset of transition2.W) {
-    delete reset.k;
+    delete reset.l;
     reset();
   }
   globalQueue.flush();
@@ -419,7 +419,7 @@ var Owner = class {
   c = STATE_CLEAN;
   n = null;
   w = defaultContext;
-  l = globalQueue;
+  k = globalQueue;
   ea = 0;
   id = null;
   constructor(id = null, skipAppend = false) {
@@ -440,8 +440,8 @@ var Owner = class {
     if (child.w !== this.w) {
       child.w = { ...this.w, ...child.w };
     }
-    if (this.l)
-      child.l = this.l;
+    if (this.k)
+      child.k = this.k;
   }
   dispose(self = true) {
     if (this.c === STATE_DISPOSED)
@@ -568,7 +568,7 @@ var Computation = class extends Owner {
   aa = DEFAULT_FLAGS;
   M = -1;
   G = false;
-  k;
+  l;
   g;
   constructor(initialValue, compute2, options) {
     super(options?.id, compute2 === null);
@@ -583,7 +583,7 @@ var Computation = class extends Owner {
     if (options?.unobserved)
       this.da = options?.unobserved;
     if (ActiveTransition) {
-      this.k = ActiveTransition;
+      this.l = ActiveTransition;
       ActiveTransition.a.set(this, this);
     }
   }
@@ -973,17 +973,17 @@ var Effect = class extends Computation {
     this.A = options?.render ? EFFECT_RENDER : EFFECT_USER;
     if (this.A === EFFECT_RENDER) {
       this.L = function(p) {
-        return !this.g && clock > this.l.created && !(this.h & ERROR_BIT) ? latest(() => compute2(p)) : compute2(p);
+        return !this.g && clock > this.k.created && !(this.h & ERROR_BIT) ? latest(() => compute2(p)) : compute2(p);
       };
     }
     this.H();
-    !options?.defer && (this.A === EFFECT_USER ? this.l.enqueue(this.A, this.C.bind(this)) : this.C(this.A));
+    !options?.defer && (this.A === EFFECT_USER ? this.k.enqueue(this.A, this.C.bind(this)) : this.C(this.A));
   }
   write(value, flags = 0) {
     if (this.c == STATE_DIRTY) {
       this.h = flags;
       if (this.A === EFFECT_RENDER) {
-        this.l.notify(this, LOADING_BIT | ERROR_BIT, this.h);
+        this.k.notify(this, LOADING_BIT | ERROR_BIT, this.h);
       }
     }
     if (value === UNCHANGED)
@@ -997,7 +997,7 @@ var Effect = class extends Computation {
     if (this.c >= state || skipQueue)
       return;
     if (this.c === STATE_CLEAN)
-      this.l.enqueue(this.A, this.C.bind(this));
+      this.k.enqueue(this.A, this.C.bind(this));
     this.c = state;
   }
   Y(mask, newFlags2) {
@@ -1013,7 +1013,7 @@ var Effect = class extends Computation {
   }
   N(error) {
     this.K = error;
-    this.l.notify(this, LOADING_BIT, 0);
+    this.k.notify(this, LOADING_BIT, 0);
     this.h = ERROR_BIT;
     if (this.A === EFFECT_USER) {
       try {
@@ -1025,7 +1025,7 @@ var Effect = class extends Computation {
         error = e;
       }
     }
-    if (!this.l.notify(this, ERROR_BIT, ERROR_BIT))
+    if (!this.k.notify(this, ERROR_BIT, ERROR_BIT))
       throw error;
   }
   J() {
@@ -1036,6 +1036,7 @@ var Effect = class extends Computation {
     this.Z = void 0;
     this.O?.();
     this.O = void 0;
+    this.k.notify(this, ERROR_BIT | LOADING_BIT, 0);
     super.J();
   }
   C(type) {
@@ -1046,7 +1047,7 @@ var Effect = class extends Computation {
         try {
           effect.O = effect.ba(effect.j, effect._);
         } catch (e) {
-          if (!effect.l.notify(effect, ERROR_BIT, ERROR_BIT))
+          if (!effect.k.notify(effect, ERROR_BIT, ERROR_BIT))
             throw e;
         } finally {
           effect._ = effect.j;
@@ -1066,7 +1067,7 @@ var EagerComputation = class extends Computation {
     if (this.c >= state && !this.G)
       return;
     if (!skipQueue && (this.c === STATE_CLEAN || this.c === STATE_CHECK && this.G))
-      this.l.enqueue(EFFECT_PURE, this.C.bind(this));
+      this.k.enqueue(EFFECT_PURE, this.C.bind(this));
     super.x(state, skipQueue);
   }
   C() {
@@ -1082,7 +1083,7 @@ var FirewallComputation = class extends Computation {
     if (this.c >= state && !this.G)
       return;
     if (!skipQueue && (this.c === STATE_CLEAN || this.c === STATE_CHECK && this.G))
-      this.l.enqueue(EFFECT_PURE, this.C.bind(this));
+      this.k.enqueue(EFFECT_PURE, this.C.bind(this));
     super.x(state, true);
     this.G = !!skipQueue;
   }
@@ -2156,14 +2157,14 @@ var BoundaryComputation = class extends EagerComputation {
     if (this.U & LOADING_BIT && !(this.h & UNINITIALIZED_BIT)) {
       flags &= ~LOADING_BIT;
     }
-    this.l.notify(this, this.U, flags);
+    this.k.notify(this, this.U, flags);
     return this.j;
   }
 };
 function createBoundChildren(owner, fn, queue, mask) {
-  const parentQueue = owner.l;
-  parentQueue.addChild(owner.l = queue);
-  onCleanup(() => parentQueue.removeChild(owner.l));
+  const parentQueue = owner.k;
+  parentQueue.addChild(owner.k = queue);
+  onCleanup(() => parentQueue.removeChild(owner.k));
   return compute(
     owner,
     () => {
@@ -2293,7 +2294,7 @@ function createErrorBoundary(fn, fallback) {
         if (ActiveTransition && !node2.g)
           node2 = cloneGraph(node2);
         node2.c = STATE_DIRTY;
-        node2.l?.enqueue(node2.A, node2.C.bind(node2));
+        node2.k?.enqueue(node2.A, node2.C.bind(node2));
       }
     });
   });

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@solidjs/signals",
-  "version": "0.4.5",
+  "version": "0.4.6",
   "description": "",
   "author": "Ryan Carniato",
   "license": "MIT",