@manyducks.co/dolla 2.0.0-alpha.62 → 2.0.0-alpha.64

package/dist/{signals-gCwiIe5X.js → signals-DbDmN2gr.js}

@@ -1,54 +1,54 @@
-import { t as E, c as v } from "./typeChecking-CbltMOUt.js";
-var V;
+import { t as _, c as g } from "./typeChecking-CbltMOUt.js";
+var z;
 (function(e) {
   e[e.None = 0] = "None", e[e.Mutable = 1] = "Mutable", e[e.Watching = 2] = "Watching", e[e.RecursedCheck = 4] = "RecursedCheck", e[e.Recursed = 8] = "Recursed", e[e.Dirty = 16] = "Dirty", e[e.Pending = 32] = "Pending";
-})(V || (V = {}));
+})(z || (z = {}));
 function H({ update: e, notify: t, unwatched: r }) {
   return {
     link: n,
     unlink: u,
     propagate: d,
-    checkDirty: k,
+    checkDirty: Y,
     endTracking: X,
-    startTracking: S,
-    shallowPropagate: y
+    startTracking: p,
+    shallowPropagate: m
   };
   function n(s, i) {
     const o = i.depsTail;
     if (o !== void 0 && o.dep === s)
       return;
     let f;
-    const l = i.flags & 4;
-    if (l && (f = o !== void 0 ? o.nextDep : i.deps, f !== void 0 && f.dep === s)) {
+    const c = i.flags & 4;
+    if (c && (f = o !== void 0 ? o.nextDep : i.deps, f !== void 0 && f.dep === s)) {
       i.depsTail = f;
       return;
     }
-    const c = s.subsTail;
-    if (c !== void 0 && c.sub === i && (!l || j(c, i)))
+    const l = s.subsTail;
+    if (l !== void 0 && l.sub === i && (!c || j(l, i)))
       return;
     const a = i.depsTail = s.subsTail = {
       dep: s,
       sub: i,
       prevDep: o,
       nextDep: f,
-      prevSub: c,
+      prevSub: l,
       nextSub: void 0
     };
-    f !== void 0 && (f.prevDep = a), o !== void 0 ? o.nextDep = a : i.deps = a, c !== void 0 ? c.nextSub = a : s.subs = a;
+    f !== void 0 && (f.prevDep = a), o !== void 0 ? o.nextDep = a : i.deps = a, l !== void 0 ? l.nextSub = a : s.subs = a;
   }
   function u(s, i = s.sub) {
-    const o = s.dep, f = s.prevDep, l = s.nextDep, c = s.nextSub, a = s.prevSub;
-    return l !== void 0 ? l.prevDep = f : i.depsTail = f, f !== void 0 ? f.nextDep = l : i.deps = l, c !== void 0 ? c.prevSub = a : o.subsTail = a, a !== void 0 ? a.nextSub = c : (o.subs = c) === void 0 && r(o), l;
+    const o = s.dep, f = s.prevDep, c = s.nextDep, l = s.nextSub, a = s.prevSub;
+    return c !== void 0 ? c.prevDep = f : i.depsTail = f, f !== void 0 ? f.nextDep = c : i.deps = c, l !== void 0 ? l.prevSub = a : o.subsTail = a, a !== void 0 ? a.nextSub = l : (o.subs = l) === void 0 && r(o), c;
   }
   function d(s) {
     let i = s.nextSub, o;
     e: do {
       const f = s.sub;
-      let l = f.flags;
-      if (l & 3 && (l & 60 ? l & 12 ? l & 4 ? !(l & 48) && j(s, f) ? (f.flags = l | 40, l &= 1) : l = 0 : f.flags = l & -9 | 32 : l = 0 : f.flags = l | 32, l & 2 && t(f), l & 1)) {
-        const c = f.subs;
-        if (c !== void 0) {
-          s = c, c.nextSub !== void 0 && (o = { value: i, prev: o }, i = s.nextSub);
+      let c = f.flags;
+      if (c & 3 && (c & 60 ? c & 12 ? c & 4 ? !(c & 48) && j(s, f) ? (f.flags = c | 40, c &= 1) : c = 0 : f.flags = c & -9 | 32 : c = 0 : f.flags = c | 32, c & 2 && t(f), c & 1)) {
+        const l = f.subs;
+        if (l !== void 0) {
+          s = l, l.nextSub !== void 0 && (o = { value: i, prev: o }, i = s.nextSub);
           continue;
         }
       }
@@ -64,7 +64,7 @@ function H({ update: e, notify: t, unwatched: r }) {
       break;
     } while (!0);
   }
-  function S(s) {
+  function p(s) {
     s.depsTail = void 0, s.flags = s.flags & -57 | 4;
   }
   function X(s) {
@@ -74,20 +74,20 @@ function H({ update: e, notify: t, unwatched: r }) {
       o = u(o, s);
     s.flags &= -5;
   }
-  function k(s, i) {
+  function Y(s, i) {
     let o, f = 0;
     e: do {
-      const l = s.dep, c = l.flags;
+      const c = s.dep, l = c.flags;
       let a = !1;
       if (i.flags & 16)
         a = !0;
-      else if ((c & 17) === 17) {
-        if (e(l)) {
-          const g = l.subs;
-          g.nextSub !== void 0 && y(g), a = !0;
+      else if ((l & 17) === 17) {
+        if (e(c)) {
+          const S = c.subs;
+          S.nextSub !== void 0 && m(S), a = !0;
         }
-      } else if ((c & 33) === 33) {
-        (s.nextSub !== void 0 || s.prevSub !== void 0) && (o = { value: s, prev: o }), s = l.deps, i = l, ++f;
+      } else if ((l & 33) === 33) {
+        (s.nextSub !== void 0 || s.prevSub !== void 0) && (o = { value: s, prev: o }), s = c.deps, i = c, ++f;
         continue;
       }
       if (!a && s.nextDep !== void 0) {
@@ -96,10 +96,10 @@ function H({ update: e, notify: t, unwatched: r }) {
       }
       for (; f; ) {
         --f;
-        const g = i.subs, A = g.nextSub !== void 0;
-        if (A ? (s = o.value, o = o.prev) : s = g, a) {
+        const S = i.subs, A = S.nextSub !== void 0;
+        if (A ? (s = o.value, o = o.prev) : s = S, a) {
           if (e(i)) {
-            A && y(g), i = s.sub;
+            A && m(S), i = s.sub;
             continue;
           }
         } else
@@ -113,7 +113,7 @@ function H({ update: e, notify: t, unwatched: r }) {
       return a;
     } while (!0);
   }
-  function y(s) {
+  function m(s) {
     do {
       const i = s.sub, o = s.nextSub, f = i.flags;
       (f & 48) === 32 && (i.flags = f | 16, f & 2 && t(i)), s = o;
@@ -134,19 +134,19 @@ function H({ update: e, notify: t, unwatched: r }) {
     return !1;
   }
 }
-const Z = () => {
+const re = () => {
 };
-let b = 1;
-function R() {
-  return b = b % Number.MAX_SAFE_INTEGER + 1, b.toString(36) + Date.now().toString(36);
+let D = 1;
+function ue() {
+  return D = D % Number.MAX_SAFE_INTEGER + 1, D.toString(36) + Date.now().toString(36);
 }
-function z(e, t) {
+function N(e, t) {
   return Object.is(e, t);
 }
-function F(e, t) {
+function ie(e, t) {
   if (Object.is(e, t)) return !0;
-  const r = E(e);
-  if (r !== E(t))
+  const r = _(e);
+  if (r !== _(t))
     return !1;
   switch (r) {
     case "object":
@@ -167,7 +167,7 @@ function F(e, t) {
         if (e[u] !== t[u]) return !1;
       return !0;
     case "set":
-      if (v(e.symmetricDifference))
+      if (g(e.symmetricDifference))
         return e.symmetricDifference(t).size === 0;
       for (const u of e.keys())
         if (e[u] !== t.get(u)) return !1;
@@ -175,20 +175,20 @@ function F(e, t) {
   }
   return !1;
 }
-function D(e, t) {
+function T(e, t) {
   if (e === t) return !0;
   if (e && t && typeof e == "object" && typeof t == "object") {
     if (e.constructor !== t.constructor) return !1;
     var r, n, u;
     if (Array.isArray(e)) {
       if (r = e.length, r != t.length) return !1;
-      for (n = r; n-- !== 0; ) if (!D(e[n], t[n])) return !1;
+      for (n = r; n-- !== 0; ) if (!T(e[n], t[n])) return !1;
       return !0;
     }
     if (e instanceof Map && t instanceof Map) {
       if (e.size !== t.size) return !1;
       for (n of e.entries()) if (!t.has(n[0])) return !1;
-      for (n of e.entries()) if (!D(n[1], t.get(n[0]))) return !1;
+      for (n of e.entries()) if (!T(n[1], t.get(n[0]))) return !1;
       return !0;
     }
     if (e instanceof Set && t instanceof Set) {
@@ -208,31 +208,31 @@ function D(e, t) {
     for (n = r; n-- !== 0; ) if (!Object.prototype.hasOwnProperty.call(t, u[n])) return !1;
     for (n = r; n-- !== 0; ) {
       var d = u[n];
-      if (!D(e[d], t[d])) return !1;
+      if (!T(e[d], t[d])) return !1;
     }
     return !0;
   }
   return e !== e && t !== t;
 }
-function ee(e, t) {
+function fe(e, t) {
   const r = {};
   for (const n in t)
     e.includes(n) || (r[n] = t[n]);
   return r;
 }
-function te(e) {
+function oe(e) {
   return Array.isArray(e) ? e : [e];
 }
-function ne(e) {
+function ce(e) {
   return e.replace(/-./g, (t) => t[1].toUpperCase());
 }
-function se(e) {
+function le(e) {
   let t = 0;
   for (let r = 0; r < e.length; r++)
     t = (t + e.charCodeAt(r) * 10) % 360;
   return `oklch(0.68 0.15 ${t}deg)`;
 }
-function re(e) {
+function ae(e) {
   if (e instanceof RegExp)
     return (n) => e.test(n);
   const t = {
@@ -251,144 +251,189 @@ function re(e) {
   }
   return function(n) {
     const { positive: u, negative: d } = t;
-    return !(d.some((S) => S(n)) || u.length > 0 && !u.some((S) => S(n)));
+    return !(d.some((p) => p(n)) || u.length > 0 && !u.some((p) => p(n)));
   };
 }
-const w = [], { link: q, unlink: T, propagate: J, checkDirty: M, endTracking: P, startTracking: W, shallowPropagate: _ } = H({
+let V = "production";
+function J() {
+  return V;
+}
+function de(e) {
+  V = e;
+}
+const w = [], { link: q, unlink: E, propagate: K, checkDirty: M, endTracking: I, startTracking: L, shallowPropagate: P } = H({
   update(e) {
-    return "getter" in e ? N(e) : I(e, e.value);
+    return "getter" in e ? W(e) : B(e, e.value);
   },
-  notify: L,
+  notify: U,
   unwatched(e) {
     if ("getter" in e) {
       let t = e.deps;
       if (t !== void 0) {
         e.flags = 17;
         do
-          t = T(t, e);
+          t = E(t, e);
         while (t !== void 0);
       }
-    } else "previousValue" in e || $.call(e);
+    } else "previousValue" in e || G.call(e);
   }
 });
-let m = 0, x = 0, C = 0, p, O;
-function h(e) {
-  const t = p;
-  return p = e, t;
+let C = 0, x = 0, O = 0, h, b;
+function v(e) {
+  const t = h;
+  return h = e, t;
 }
-function ue() {
-  return O;
+function pe() {
+  return b;
 }
-function ie(e) {
-  const t = O;
-  return O = e, t;
+function he(e) {
+  const t = b;
+  return b = e, t;
 }
-function N(e) {
-  const t = h(e);
-  W(e);
+function W(e) {
+  const t = v(e);
+  L(e);
   try {
     const r = e.value, n = { value: e.value };
     return !e.equals(r, e.value = e.getter.call(n));
   } finally {
-    h(t), P(e);
+    v(t), I(e);
   }
 }
-function I(e, t) {
+function B(e, t) {
   return e.flags = 1, !e.equals(e.previousValue, e.previousValue = t);
 }
-function L(e) {
+function U(e) {
   const t = e.flags;
   if (!(t & 64)) {
     e.flags = t | 64;
     const r = e.subs;
-    r !== void 0 ? L(r.sub) : w[C++] = e;
+    r !== void 0 ? U(r.sub) : w[O++] = e;
   }
 }
-function B(e, t) {
+function $(e, t) {
   if (t & 16 || t & 32 && M(e.deps, e)) {
-    const n = h(e);
-    W(e);
+    const n = v(e);
+    L(e);
     try {
       "cleanup" in e && e.cleanup !== void 0 && e.cleanup();
       const u = e.fn();
-      "cleanup" in e && v(u) && (e.cleanup = u);
+      "cleanup" in e && g(u) && (e.cleanup = u);
     } finally {
-      h(n), P(e);
+      v(n), I(e);
     }
     return;
   } else t & 32 && (e.flags = t & -33);
   let r = e.deps;
   for (; r !== void 0; ) {
     const n = r.dep, u = n.flags;
-    u & 64 && B(
+    u & 64 && $(
       n,
       n.flags = u & -65
       /* Queued */
     ), r = r.nextDep;
   }
 }
-function U() {
-  for (; x < C; ) {
+function k() {
+  for (; x < O; ) {
     const e = w[x];
-    w[x++] = void 0, B(
+    w[x++] = void 0, $(
       e,
       e.flags &= -65
       /* Queued */
     );
   }
-  x = 0, C = 0;
+  x = 0, O = 0;
 }
-function K() {
+function Q() {
   const e = this.flags;
   if (e & 16 || e & 32 && M(this.deps, this)) {
-    if (N(this)) {
+    if (W(this)) {
       const t = this.subs;
-      t !== void 0 && _(t);
+      t !== void 0 && P(t);
     }
   } else e & 32 && (this.flags = e & -33);
-  return p !== void 0 && q(this, p), this.value;
+  return h !== void 0 && q(this, h), this.value;
 }
-function Q(...e) {
-  if (e.length) {
-    let t = e[0];
-    if (v(t) && (t = G(t(this.value))), !this.equals(this.value, t)) {
-      this.value = t, this.flags = 17;
-      const r = this.subs;
-      r !== void 0 && (J(r), m || U());
-    }
-  } else {
-    const t = this.value;
-    if (this.flags & 16 && I(this, t)) {
-      const r = this.subs;
-      r !== void 0 && _(r);
-    }
-    return p !== void 0 && q(this, p), t;
+function R() {
+  const e = this.value;
+  if (this.flags & 16 && B(this, e)) {
+    const t = this.subs;
+    t !== void 0 && P(t);
+  }
+  return h !== void 0 && q(this, h), e;
+}
+function Z(e) {
+  let t = g(e) ? y(e(this.value)) : e;
+  if (!this.equals(this.value, t)) {
+    this.value = t, this.flags = 17;
+    const r = this.subs;
+    r !== void 0 && (K(r), C || k());
   }
 }
-function $() {
+function G() {
   let e = this.deps;
   for (; e !== void 0; )
-    e = T(e, this);
+    e = E(e, this);
   const t = this.subs;
-  t !== void 0 && T(t), this.flags = 0, "cleanup" in this && this.cleanup != null && this.cleanup();
+  t !== void 0 && E(t), this.flags = 0, "cleanup" in this && this.cleanup != null && this.cleanup();
 }
-function fe(e) {
-  ++m, e(), --m || U();
+function ve(...e) {
+  return g(e[0]) ? ee(e[0], e[1]) : F(e[0], e[1]);
 }
-function oe(e) {
-  if (v(e)) {
+function F(e, t) {
+  const r = {
+    previousValue: e,
+    value: e,
+    equals: (t == null ? void 0 : t.equals) ?? N,
+    subs: void 0,
+    subsTail: void 0,
+    flags: 1
+  }, n = R.bind(r);
+  return n.set = Z.bind(r), n;
+}
+function ee(e, t) {
+  return Q.bind({
+    value: void 0,
+    subs: void 0,
+    subsTail: void 0,
+    deps: void 0,
+    depsTail: void 0,
+    flags: 17,
+    getter: function() {
+      if (t != null && t.deps) {
+        for (let r of t.deps) y(r);
+        return y(te(() => e(this.value)));
+      }
+      return y(e(this.value));
+    },
+    equals: (t == null ? void 0 : t.equals) ?? N
+  });
+}
+function ge(e) {
+  ++C, e(), --C || k();
+}
+function te(e) {
+  if (g(e)) {
     let t;
-    const r = h(void 0);
-    return t = e(), h(r), t;
+    const r = v(void 0);
+    return t = e(), v(r), t;
   } else
     return e;
 }
-function G(e) {
-  return v(e) ? e() : e;
+function y(e) {
+  return g(e) ? e() : e;
 }
-function le(e) {
-  var n;
-  const t = {
+const ne = Symbol("INTERNAL_EFFECT");
+function Se(e, t) {
+  var d;
+  const r = (t == null ? void 0 : t._type) === ne;
+  if (!r && b)
+    return b.effect(e);
+  !r && J() === "development" && console.warn(
+    "This effect is not bound to a scope. You must call the unsubscribe function when done to avoid memory leaks."
+  );
+  const n = {
     fn: e,
     subs: void 0,
     subsTail: void 0,
@@ -396,55 +441,39 @@ function le(e) {
     depsTail: void 0,
     flags: 2
   };
-  p !== void 0 && q(t, p);
-  const r = h(t);
+  h !== void 0 && q(n, h);
+  const u = v(n);
   try {
-    (n = t.cleanup) == null || n.call(t);
-    const u = t.fn();
-    t.cleanup = v(u) ? u : void 0;
+    (d = n.cleanup) == null || d.call(n);
+    const p = n.fn();
+    n.cleanup = g(p) ? p : void 0;
   } finally {
-    h(r);
+    v(u);
   }
-  return $.bind(t);
-}
-function ce(e, t) {
-  return v(e) ? K.bind({
-    value: void 0,
-    subs: void 0,
-    subsTail: void 0,
-    deps: void 0,
-    depsTail: void 0,
-    flags: 17,
-    getter: function() {
-      return G(e.call(this));
-    },
-    equals: (t == null ? void 0 : t.equals) ?? z
-  }) : Q.bind({
-    previousValue: e,
-    value: e,
-    equals: (t == null ? void 0 : t.equals) ?? z,
-    subs: void 0,
-    subsTail: void 0,
-    flags: 1
-  });
+  return G.bind(n);
 }
 export {
-  ce as $,
-  z as a,
-  fe as b,
-  ue as c,
-  D as d,
-  le as e,
-  R as f,
-  G as g,
-  ie as h,
-  ne as i,
-  re as j,
-  se as k,
-  Z as n,
-  ee as o,
-  F as s,
-  te as t,
-  oe as u
+  ve as $,
+  ne as I,
+  N as a,
+  ge as b,
+  J as c,
+  T as d,
+  Se as e,
+  de as f,
+  y as g,
+  pe as h,
+  ue as i,
+  he as j,
+  ce as k,
+  ae as l,
+  ee as m,
+  re as n,
+  fe as o,
+  le as p,
+  ie as s,
+  oe as t,
+  te as u,
+  F as w
 };
-//# sourceMappingURL=signals-gCwiIe5X.js.map
+//# sourceMappingURL=signals-DbDmN2gr.js.map