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

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

@@ -1,154 +1,23 @@
-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";
-})(z || (z = {}));
-function H({ update: e, notify: t, unwatched: r }) {
-  return {
-    link: n,
-    unlink: u,
-    propagate: d,
-    checkDirty: Y,
-    endTracking: X,
-    startTracking: p,
-    shallowPropagate: m
-  };
-  function n(s, i) {
-    const o = i.depsTail;
-    if (o !== void 0 && o.dep === s)
-      return;
-    let f;
-    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 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: l,
-      nextSub: void 0
-    };
-    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, 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 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;
-        }
-      }
-      if ((s = i) !== void 0) {
-        i = s.nextSub;
-        continue;
-      }
-      for (; o !== void 0; )
-        if (s = o.value, o = o.prev, s !== void 0) {
-          i = s.nextSub;
-          continue e;
-        }
-      break;
-    } while (!0);
-  }
-  function p(s) {
-    s.depsTail = void 0, s.flags = s.flags & -57 | 4;
-  }
-  function X(s) {
-    const i = s.depsTail;
-    let o = i !== void 0 ? i.nextDep : s.deps;
-    for (; o !== void 0; )
-      o = u(o, s);
-    s.flags &= -5;
-  }
-  function Y(s, i) {
-    let o, f = 0;
-    e: do {
-      const c = s.dep, l = c.flags;
-      let a = !1;
-      if (i.flags & 16)
-        a = !0;
-      else if ((l & 17) === 17) {
-        if (e(c)) {
-          const S = c.subs;
-          S.nextSub !== void 0 && m(S), a = !0;
-        }
-      } 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) {
-        s = s.nextDep;
-        continue;
-      }
-      for (; f; ) {
-        --f;
-        const S = i.subs, A = S.nextSub !== void 0;
-        if (A ? (s = o.value, o = o.prev) : s = S, a) {
-          if (e(i)) {
-            A && m(S), i = s.sub;
-            continue;
-          }
-        } else
-          i.flags &= -33;
-        if (i = s.sub, s.nextDep !== void 0) {
-          s = s.nextDep;
-          continue e;
-        }
-        a = !1;
-      }
-      return a;
-    } while (!0);
-  }
-  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;
-    } while (s !== void 0);
-  }
-  function j(s, i) {
-    const o = i.depsTail;
-    if (o !== void 0) {
-      let f = i.deps;
-      do {
-        if (f === s)
-          return !0;
-        if (f === o)
-          break;
-        f = f.nextDep;
-      } while (f !== void 0);
-    }
-    return !1;
-  }
-}
-const re = () => {
+import { t as N, b as g } from "./typeChecking-D0-H8_Xm.js";
+const ue = () => {
 };
-let D = 1;
-function ue() {
-  return D = D % Number.MAX_SAFE_INTEGER + 1, D.toString(36) + Date.now().toString(36);
+let T = 1;
+function fe() {
+  return T = T % Number.MAX_SAFE_INTEGER + 1, T.toString(36) + Date.now().toString(36);
 }
-function N(e, t) {
+let D = 0;
+function ie() {
+  return D = D % Number.MAX_SAFE_INTEGER + 1, D;
+}
+function z(e, t) {
   return Object.is(e, t);
 }
-function ie(e, t) {
+function oe(e, t) {
   if (Object.is(e, t)) return !0;
-  const r = _(e);
-  if (r !== _(t))
+  const s = N(e);
+  if (s !== N(t))
     return !1;
-  switch (r) {
+  switch (s) {
     case "object":
       let n = 0;
       for (const u in e) {
@@ -175,20 +44,20 @@ function ie(e, t) {
   }
   return !1;
 }
-function T(e, t) {
+function w(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;
+    var s, n, u;
     if (Array.isArray(e)) {
-      if (r = e.length, r != t.length) return !1;
-      for (n = r; n-- !== 0; ) if (!T(e[n], t[n])) return !1;
+      if (s = e.length, s != t.length) return !1;
+      for (n = s; n-- !== 0; ) if (!w(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 (!T(n[1], t.get(n[0]))) return !1;
+      for (n of e.entries()) if (!w(n[1], t.get(n[0]))) return !1;
       return !0;
     }
     if (e instanceof Set && t instanceof Set) {
@@ -197,49 +66,52 @@ function T(e, t) {
       return !0;
     }
     if (ArrayBuffer.isView(e) && ArrayBuffer.isView(t)) {
-      if (r = e.length, r != t.length) return !1;
-      for (n = r; n-- !== 0; ) if (e[n] !== t[n]) return !1;
+      if (s = e.length, s != t.length) return !1;
+      for (n = s; n-- !== 0; ) if (e[n] !== t[n]) return !1;
       return !0;
     }
     if (e.constructor === RegExp) return e.source === t.source && e.flags === t.flags;
     if (e.valueOf !== Object.prototype.valueOf) return e.valueOf() === t.valueOf();
     if (e.toString !== Object.prototype.toString) return e.toString() === t.toString();
-    if (u = Object.keys(e), r = u.length, r !== Object.keys(t).length) return !1;
-    for (n = r; n-- !== 0; ) if (!Object.prototype.hasOwnProperty.call(t, u[n])) return !1;
-    for (n = r; n-- !== 0; ) {
+    if (u = Object.keys(e), s = u.length, s !== Object.keys(t).length) return !1;
+    for (n = s; n-- !== 0; ) if (!Object.prototype.hasOwnProperty.call(t, u[n])) return !1;
+    for (n = s; n-- !== 0; ) {
       var d = u[n];
-      if (!T(e[d], t[d])) return !1;
+      if (!w(e[d], t[d])) return !1;
     }
     return !0;
   }
   return e !== e && t !== t;
 }
-function fe(e, t) {
-  const r = {};
+function ce(e, t) {
+  const s = {};
   for (const n in t)
-    e.includes(n) || (r[n] = t[n]);
-  return r;
+    e.includes(n) || (s[n] = t[n]);
+  return s;
 }
-function oe(e) {
+function le(e) {
   return Array.isArray(e) ? e : [e];
 }
-function ce(e) {
+function ae(e) {
   return e.replace(/-./g, (t) => t[1].toUpperCase());
 }
-function le(e) {
+function de(e, t, s) {
+  "moveBefore" in e ? e.moveBefore(t, s) : e.insertBefore(t, s);
+}
+function pe(e) {
   let t = 0;
-  for (let r = 0; r < e.length; r++)
-    t = (t + e.charCodeAt(r) * 10) % 360;
+  for (let s = 0; s < e.length; s++)
+    t = (t + e.charCodeAt(s) * 10) % 360;
   return `oklch(0.68 0.15 ${t}deg)`;
 }
-function ae(e) {
+function he(e) {
   if (e instanceof RegExp)
     return (n) => e.test(n);
   const t = {
     positive: [],
     negative: []
-  }, r = e.split(",").map((n) => n.trim()).filter((n) => n !== "");
-  for (let n of r) {
+  }, s = e.split(",").map((n) => n.trim()).filter((n) => n !== "");
+  for (let n of s) {
     let u = "positive";
     n.startsWith("-") && (u = "negative", n = n.slice(1)), n === "*" ? t[u].push(function() {
       return !0;
@@ -254,16 +126,151 @@ function ae(e) {
     return !(d.some((p) => p(n)) || u.length > 0 && !u.some((p) => p(n)));
   };
 }
-let V = "production";
-function J() {
-  return V;
+let M = "production";
+function H() {
+  return M;
 }
-function de(e) {
-  V = e;
+function ve(e) {
+  M = e;
 }
-const w = [], { link: q, unlink: E, propagate: K, checkDirty: M, endTracking: I, startTracking: L, shallowPropagate: P } = H({
+var I;
+(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";
+})(I || (I = {}));
+function J({ update: e, notify: t, unwatched: s }) {
+  return {
+    link: n,
+    unlink: u,
+    propagate: d,
+    checkDirty: Y,
+    endTracking: R,
+    startTracking: p,
+    shallowPropagate: m
+  };
+  function n(r, f) {
+    const o = f.depsTail;
+    if (o !== void 0 && o.dep === r)
+      return;
+    let i;
+    const c = f.flags & 4;
+    if (c && (i = o !== void 0 ? o.nextDep : f.deps, i !== void 0 && i.dep === r)) {
+      f.depsTail = i;
+      return;
+    }
+    const l = r.subsTail;
+    if (l !== void 0 && l.sub === f && (!c || j(l, f)))
+      return;
+    const a = f.depsTail = r.subsTail = {
+      dep: r,
+      sub: f,
+      prevDep: o,
+      nextDep: i,
+      prevSub: l,
+      nextSub: void 0
+    };
+    i !== void 0 && (i.prevDep = a), o !== void 0 ? o.nextDep = a : f.deps = a, l !== void 0 ? l.nextSub = a : r.subs = a;
+  }
+  function u(r, f = r.sub) {
+    const o = r.dep, i = r.prevDep, c = r.nextDep, l = r.nextSub, a = r.prevSub;
+    return c !== void 0 ? c.prevDep = i : f.depsTail = i, i !== void 0 ? i.nextDep = c : f.deps = c, l !== void 0 ? l.prevSub = a : o.subsTail = a, a !== void 0 ? a.nextSub = l : (o.subs = l) === void 0 && s(o), c;
+  }
+  function d(r) {
+    let f = r.nextSub, o;
+    e: do {
+      const i = r.sub;
+      let c = i.flags;
+      if (c & 3 && (c & 60 ? c & 12 ? c & 4 ? !(c & 48) && j(r, i) ? (i.flags = c | 40, c &= 1) : c = 0 : i.flags = c & -9 | 32 : c = 0 : i.flags = c | 32, c & 2 && t(i), c & 1)) {
+        const l = i.subs;
+        if (l !== void 0) {
+          r = l, l.nextSub !== void 0 && (o = { value: f, prev: o }, f = r.nextSub);
+          continue;
+        }
+      }
+      if ((r = f) !== void 0) {
+        f = r.nextSub;
+        continue;
+      }
+      for (; o !== void 0; )
+        if (r = o.value, o = o.prev, r !== void 0) {
+          f = r.nextSub;
+          continue e;
+        }
+      break;
+    } while (!0);
+  }
+  function p(r) {
+    r.depsTail = void 0, r.flags = r.flags & -57 | 4;
+  }
+  function R(r) {
+    const f = r.depsTail;
+    let o = f !== void 0 ? f.nextDep : r.deps;
+    for (; o !== void 0; )
+      o = u(o, r);
+    r.flags &= -5;
+  }
+  function Y(r, f) {
+    let o, i = 0;
+    e: do {
+      const c = r.dep, l = c.flags;
+      let a = !1;
+      if (f.flags & 16)
+        a = !0;
+      else if ((l & 17) === 17) {
+        if (e(c)) {
+          const S = c.subs;
+          S.nextSub !== void 0 && m(S), a = !0;
+        }
+      } else if ((l & 33) === 33) {
+        (r.nextSub !== void 0 || r.prevSub !== void 0) && (o = { value: r, prev: o }), r = c.deps, f = c, ++i;
+        continue;
+      }
+      if (!a && r.nextDep !== void 0) {
+        r = r.nextDep;
+        continue;
+      }
+      for (; i; ) {
+        --i;
+        const S = f.subs, _ = S.nextSub !== void 0;
+        if (_ ? (r = o.value, o = o.prev) : r = S, a) {
+          if (e(f)) {
+            _ && m(S), f = r.sub;
+            continue;
+          }
+        } else
+          f.flags &= -33;
+        if (f = r.sub, r.nextDep !== void 0) {
+          r = r.nextDep;
+          continue e;
+        }
+        a = !1;
+      }
+      return a;
+    } while (!0);
+  }
+  function m(r) {
+    do {
+      const f = r.sub, o = r.nextSub, i = f.flags;
+      (i & 48) === 32 && (f.flags = i | 16, i & 2 && t(f)), r = o;
+    } while (r !== void 0);
+  }
+  function j(r, f) {
+    const o = f.depsTail;
+    if (o !== void 0) {
+      let i = f.deps;
+      do {
+        if (i === r)
+          return !0;
+        if (i === o)
+          break;
+        i = i.nextDep;
+      } while (i !== void 0);
+    }
+    return !1;
+  }
+}
+const E = [], { link: A, unlink: C, propagate: K, checkDirty: V, endTracking: B, startTracking: L, shallowPropagate: P } = J({
   update(e) {
-    return "getter" in e ? W(e) : B(e, e.value);
+    return "getter" in e ? W(e) : G(e, e.value);
   },
   notify: U,
   unwatched(e) {
@@ -272,21 +279,21 @@ const w = [], { link: q, unlink: E, propagate: K, checkDirty: M, endTracking: I,
       if (t !== void 0) {
         e.flags = 17;
         do
-          t = E(t, e);
+          t = C(t, e);
         while (t !== void 0);
       }
-    } else "previousValue" in e || G.call(e);
+    } else "previousValue" in e || k.call(e);
   }
 });
-let C = 0, x = 0, O = 0, h, b;
+let O = 0, x = 0, q = 0, h, b;
 function v(e) {
   const t = h;
   return h = e, t;
 }
-function pe() {
+function ge() {
   return b;
 }
-function he(e) {
+function Se(e) {
   const t = b;
   return b = e, t;
 }
@@ -294,25 +301,25 @@ 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));
+    const s = e.value, n = { value: e.value };
+    return !e.equals(s, e.value = e.getter.call(n));
   } finally {
-    v(t), I(e);
+    v(t), B(e);
   }
 }
-function B(e, t) {
+function G(e, t) {
   return e.flags = 1, !e.equals(e.previousValue, e.previousValue = t);
 }
 function U(e) {
   const t = e.flags;
   if (!(t & 64)) {
     e.flags = t | 64;
-    const r = e.subs;
-    r !== void 0 ? U(r.sub) : w[O++] = e;
+    const s = e.subs;
+    s !== void 0 ? U(s.sub) : E[q++] = e;
   }
 }
-function $(e, t) {
-  if (t & 16 || t & 32 && M(e.deps, e)) {
+function X(e, t) {
+  if (t & 16 || t & 32 && V(e.deps, e)) {
     const n = v(e);
     L(e);
     try {
@@ -320,79 +327,79 @@ function $(e, t) {
       const u = e.fn();
       "cleanup" in e && g(u) && (e.cleanup = u);
     } finally {
-      v(n), I(e);
+      v(n), B(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 && $(
+  let s = e.deps;
+  for (; s !== void 0; ) {
+    const n = s.dep, u = n.flags;
+    u & 64 && X(
       n,
       n.flags = u & -65
       /* Queued */
-    ), r = r.nextDep;
+    ), s = s.nextDep;
   }
 }
-function k() {
-  for (; x < O; ) {
-    const e = w[x];
-    w[x++] = void 0, $(
+function $() {
+  for (; x < q; ) {
+    const e = E[x];
+    E[x++] = void 0, X(
       e,
       e.flags &= -65
       /* Queued */
     );
   }
-  x = 0, O = 0;
+  x = 0, q = 0;
 }
 function Q() {
   const e = this.flags;
-  if (e & 16 || e & 32 && M(this.deps, this)) {
+  if (e & 16 || e & 32 && V(this.deps, this)) {
     if (W(this)) {
       const t = this.subs;
       t !== void 0 && P(t);
     }
   } else e & 32 && (this.flags = e & -33);
-  return h !== void 0 && q(this, h), this.value;
+  return h !== void 0 && A(this, h), this.value;
 }
-function R() {
+function Z() {
   const e = this.value;
-  if (this.flags & 16 && B(this, e)) {
+  if (this.flags & 16 && G(this, e)) {
     const t = this.subs;
     t !== void 0 && P(t);
   }
-  return h !== void 0 && q(this, h), e;
+  return h !== void 0 && A(this, h), e;
 }
-function Z(e) {
+function F(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());
+    const s = this.subs;
+    s !== void 0 && (K(s), O || $());
   }
 }
-function G() {
+function k() {
   let e = this.deps;
   for (; e !== void 0; )
-    e = E(e, this);
+    e = C(e, this);
   const t = this.subs;
-  t !== void 0 && E(t), this.flags = 0, "cleanup" in this && this.cleanup != null && this.cleanup();
+  t !== void 0 && C(t), this.flags = 0, "cleanup" in this && this.cleanup != null && this.cleanup();
 }
-function ve(...e) {
-  return g(e[0]) ? ee(e[0], e[1]) : F(e[0], e[1]);
+function be(...e) {
+  return g(e[0]) ? te(e[0], e[1]) : ee(e[0], e[1]);
 }
-function F(e, t) {
-  const r = {
+function ee(e, t) {
+  const s = {
     previousValue: e,
     value: e,
-    equals: (t == null ? void 0 : t.equals) ?? N,
+    equals: (t == null ? void 0 : t.equals) ?? z,
     subs: void 0,
     subsTail: void 0,
     flags: 1
-  }, n = R.bind(r);
-  return n.set = Z.bind(r), n;
+  }, n = Z.bind(s);
+  return n.set = F.bind(s), n;
 }
-function ee(e, t) {
+function te(e, t) {
   return Q.bind({
     value: void 0,
     subs: void 0,
@@ -402,35 +409,35 @@ function ee(e, t) {
     flags: 17,
     getter: function() {
       if (t != null && t.deps) {
-        for (let r of t.deps) y(r);
-        return y(te(() => e(this.value)));
+        for (let s of t.deps) y(s);
+        return y(ne(() => e(this.value)));
       }
       return y(e(this.value));
     },
-    equals: (t == null ? void 0 : t.equals) ?? N
+    equals: (t == null ? void 0 : t.equals) ?? z
   });
 }
-function ge(e) {
-  ++C, e(), --C || k();
+function xe(e) {
+  ++O, e(), --O || $();
 }
-function te(e) {
+function ne(e) {
   if (g(e)) {
     let t;
-    const r = v(void 0);
-    return t = e(), v(r), t;
+    const s = v(void 0);
+    return t = e(), v(s), t;
   } else
     return e;
 }
 function y(e) {
   return g(e) ? e() : e;
 }
-const ne = Symbol("INTERNAL_EFFECT");
-function Se(e, t) {
+const re = Symbol("INTERNAL_EFFECT");
+function ye(e, t) {
   var d;
-  const r = (t == null ? void 0 : t._type) === ne;
-  if (!r && b)
+  const s = (t == null ? void 0 : t._type) === re;
+  if (!s && b)
     return b.effect(e);
-  !r && J() === "development" && console.warn(
+  !s && H() === "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 = {
@@ -441,7 +448,7 @@ function Se(e, t) {
     depsTail: void 0,
     flags: 2
   };
-  h !== void 0 && q(n, h);
+  h !== void 0 && A(n, h);
   const u = v(n);
   try {
     (d = n.cleanup) == null || d.call(n);
@@ -450,30 +457,32 @@ function Se(e, t) {
   } finally {
     v(u);
   }
-  return G.bind(n);
+  return k.bind(n);
 }
 export {
-  ve as $,
-  ne as I,
-  N as a,
-  ge as b,
-  J as c,
-  T as d,
-  Se as e,
-  de as f,
+  be as $,
+  re as I,
+  z as a,
+  xe as b,
+  H as c,
+  w as d,
+  ye as e,
+  ve 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
+  ge as h,
+  fe as i,
+  Se as j,
+  de as k,
+  ie as l,
+  te as m,
+  ae as n,
+  ce as o,
+  he as p,
+  ue as q,
+  pe as r,
+  oe as s,
+  le as t,
+  ne as u,
+  ee as w
 };
-//# sourceMappingURL=signals-DbDmN2gr.js.map
+//# sourceMappingURL=signals-BDlRtifZ.js.map