@manyducks.co/dolla 2.0.0-alpha.67 → 2.0.0-alpha.68

package/dist/{signals-HNnDUJRQ.js → logger-IE5c3t-c.js}

@@ -1,21 +1,21 @@
-import { t as I, b as g } from "./typeChecking-Cw-4pIto.js";
-const ue = () => {
+import { t as M, b, i as ne } from "./typeChecking-Cw-4pIto.js";
+const re = () => {
 };
-let T = 1;
-function fe() {
-  return T = T % Number.MAX_SAFE_INTEGER + 1, T.toString(36) + Date.now().toString(36);
+let D = 1;
+function de() {
+  return D = D % Number.MAX_SAFE_INTEGER + 1, D.toString(36) + Date.now().toString(36);
 }
-let D = 0;
-function ie() {
-  return D = D % Number.MAX_SAFE_INTEGER + 1, D;
+let T = 0;
+function ge() {
+  return T = T % Number.MAX_SAFE_INTEGER + 1, T;
 }
-function A(e, t) {
+function N(e, t) {
   return Object.is(e, t);
 }
-function oe(e, t) {
+function pe(e, t) {
   if (Object.is(e, t)) return !0;
-  const r = I(e);
-  if (r !== I(t))
+  const r = M(e);
+  if (r !== M(t))
     return !1;
   switch (r) {
     case "object":
@@ -36,7 +36,7 @@ function oe(e, t) {
         if (e[u] !== t[u]) return !1;
       return !0;
     case "set":
-      if (g(e.symmetricDifference))
+      if (b(e.symmetricDifference))
         return e.symmetricDifference(t).size === 0;
       for (const u of e.keys())
         if (e[u] !== t.get(u)) return !1;
@@ -44,20 +44,20 @@ function oe(e, t) {
   }
   return !1;
 }
-function w(e, t) {
+function C(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 (!w(e[n], t[n])) return !1;
+      for (n = r; n-- !== 0; ) if (!C(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 (!w(n[1], t.get(n[0]))) return !1;
+      for (n of e.entries()) if (!C(n[1], t.get(n[0]))) return !1;
       return !0;
     }
     if (e instanceof Set && t instanceof Set) {
@@ -77,34 +77,34 @@ function w(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 (!w(e[d], t[d])) return !1;
+      if (!C(e[d], t[d])) return !1;
     }
     return !0;
   }
   return e !== e && t !== t;
 }
-function ce(e, t) {
+function ve(e, t) {
   const r = {};
   for (const n in t)
     e.includes(n) || (r[n] = t[n]);
   return r;
 }
-function le(e) {
+function he(e) {
   return Array.isArray(e) ? e : [e];
 }
-function ae(e) {
+function be(e) {
   return e.replace(/-./g, (t) => t[1].toUpperCase());
 }
-function de(e, t, r) {
+function xe(e, t, r) {
   "moveBefore" in e ? e.moveBefore(t, r) : e.insertBefore(t, r);
 }
-function pe(e) {
+function se(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 he(e) {
+function I(e) {
   if (e instanceof RegExp)
     return (n) => e.test(n);
   const t = {
@@ -123,66 +123,66 @@ function he(e) {
   }
   return function(n) {
     const { positive: u, negative: d } = t;
-    return !(d.some((p) => p(n)) || u.length > 0 && !u.some((p) => p(n)));
+    return !(d.some((g) => g(n)) || u.length > 0 && !u.some((g) => g(n)));
   };
 }
-let M = "production";
-function K() {
-  return M;
+let $ = "production";
+function ue() {
+  return $;
 }
-function ve(e) {
-  M = e;
+function Se(e) {
+  $ = e;
 }
-var z;
+var V;
 (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 Q({ update: e, notify: t, unwatched: r }) {
+})(V || (V = {}));
+function fe({ update: e, notify: t, unwatched: r }) {
   return {
     link: n,
     unlink: u,
     propagate: d,
-    checkDirty: J,
-    endTracking: H,
-    startTracking: p,
+    checkDirty: te,
+    endTracking: ee,
+    startTracking: g,
     shallowPropagate: m
   };
   function n(s, f) {
-    const o = f.depsTail;
-    if (o !== void 0 && o.dep === s)
+    const l = f.depsTail;
+    if (l !== void 0 && l.dep === s)
       return;
     let i;
     const c = f.flags & 4;
-    if (c && (i = o !== void 0 ? o.nextDep : f.deps, i !== void 0 && i.dep === s)) {
+    if (c && (i = l !== void 0 ? l.nextDep : f.deps, i !== void 0 && i.dep === s)) {
       f.depsTail = i;
       return;
     }
-    const l = s.subsTail;
-    if (l !== void 0 && l.sub === f && (!c || _(l, f)))
+    const o = s.subsTail;
+    if (o !== void 0 && o.sub === f && (!c || L(o, f)))
       return;
     const a = f.depsTail = s.subsTail = {
       dep: s,
       sub: f,
-      prevDep: o,
+      prevDep: l,
       nextDep: i,
-      prevSub: l,
+      prevSub: o,
       nextSub: void 0
     };
-    i !== void 0 && (i.prevDep = a), o !== void 0 ? o.nextDep = a : f.deps = a, l !== void 0 ? l.nextSub = a : s.subs = a;
+    i !== void 0 && (i.prevDep = a), l !== void 0 ? l.nextDep = a : f.deps = a, o !== void 0 ? o.nextSub = a : s.subs = a;
   }
   function u(s, f = s.sub) {
-    const o = s.dep, i = s.prevDep, c = s.nextDep, l = s.nextSub, a = s.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 && r(o), c;
+    const l = s.dep, i = s.prevDep, c = s.nextDep, o = s.nextSub, a = s.prevSub;
+    return c !== void 0 ? c.prevDep = i : f.depsTail = i, i !== void 0 ? i.nextDep = c : f.deps = c, o !== void 0 ? o.prevSub = a : l.subsTail = a, a !== void 0 ? a.nextSub = o : (l.subs = o) === void 0 && r(l), c;
   }
   function d(s) {
-    let f = s.nextSub, o;
+    let f = s.nextSub, l;
     e: do {
       const i = s.sub;
       let c = i.flags;
-      if (c & 3 && (c & 60 ? c & 12 ? c & 4 ? !(c & 48) && _(s, 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) {
-          s = l, l.nextSub !== void 0 && (o = { value: f, prev: o }, f = s.nextSub);
+      if (c & 3 && (c & 60 ? c & 12 ? c & 4 ? !(c & 48) && L(s, 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 o = i.subs;
+        if (o !== void 0) {
+          s = o, o.nextSub !== void 0 && (l = { value: f, prev: l }, f = s.nextSub);
           continue;
         }
       }
@@ -190,38 +190,38 @@ function Q({ update: e, notify: t, unwatched: r }) {
         f = s.nextSub;
         continue;
       }
-      for (; o !== void 0; )
-        if (s = o.value, o = o.prev, s !== void 0) {
+      for (; l !== void 0; )
+        if (s = l.value, l = l.prev, s !== void 0) {
           f = s.nextSub;
           continue e;
         }
       break;
     } while (!0);
   }
-  function p(s) {
+  function g(s) {
     s.depsTail = void 0, s.flags = s.flags & -57 | 4;
   }
-  function H(s) {
+  function ee(s) {
     const f = s.depsTail;
-    let o = f !== void 0 ? f.nextDep : s.deps;
-    for (; o !== void 0; )
-      o = u(o, s);
+    let l = f !== void 0 ? f.nextDep : s.deps;
+    for (; l !== void 0; )
+      l = u(l, s);
     s.flags &= -5;
   }
-  function J(s, f) {
-    let o, i = 0;
+  function te(s, f) {
+    let l, i = 0;
     e: do {
-      const c = s.dep, l = c.flags;
+      const c = s.dep, o = c.flags;
       let a = !1;
       if (f.flags & 16)
         a = !0;
-      else if ((l & 17) === 17) {
+      else if ((o & 17) === 17) {
         if (e(c)) {
-          const b = c.subs;
-          b.nextSub !== void 0 && m(b), a = !0;
+          const h = c.subs;
+          h.nextSub !== void 0 && m(h), a = !0;
         }
-      } else if ((l & 33) === 33) {
-        (s.nextSub !== void 0 || s.prevSub !== void 0) && (o = { value: s, prev: o }), s = c.deps, f = c, ++i;
+      } else if ((o & 33) === 33) {
+        (s.nextSub !== void 0 || s.prevSub !== void 0) && (l = { value: s, prev: l }), s = c.deps, f = c, ++i;
         continue;
       }
       if (!a && s.nextDep !== void 0) {
@@ -230,10 +230,10 @@ function Q({ update: e, notify: t, unwatched: r }) {
       }
       for (; i; ) {
         --i;
-        const b = f.subs, N = b.nextSub !== void 0;
-        if (N ? (s = o.value, o = o.prev) : s = b, a) {
+        const h = f.subs, z = h.nextSub !== void 0;
+        if (z ? (s = l.value, l = l.prev) : s = h, a) {
           if (e(f)) {
-            N && m(b), f = s.sub;
+            z && m(h), f = s.sub;
             continue;
           }
         } else
@@ -249,18 +249,18 @@ function Q({ update: e, notify: t, unwatched: r }) {
   }
   function m(s) {
     do {
-      const f = s.sub, o = s.nextSub, i = f.flags;
-      (i & 48) === 32 && (f.flags = i | 16, i & 2 && t(f)), s = o;
+      const f = s.sub, l = s.nextSub, i = f.flags;
+      (i & 48) === 32 && (f.flags = i | 16, i & 2 && t(f)), s = l;
     } while (s !== void 0);
   }
-  function _(s, f) {
-    const o = f.depsTail;
-    if (o !== void 0) {
+  function L(s, f) {
+    const l = f.depsTail;
+    if (l !== void 0) {
       let i = f.deps;
       do {
         if (i === s)
           return !0;
-        if (i === o)
+        if (i === l)
           break;
         i = i.nextDep;
       } while (i !== void 0);
@@ -268,150 +268,150 @@ function Q({ update: e, notify: t, unwatched: r }) {
     return !1;
   }
 }
-const E = [], { link: j, unlink: C, propagate: Z, checkDirty: V, endTracking: B, startTracking: L, shallowPropagate: P } = Q({
+const O = [], { link: _, unlink: q, propagate: ie, checkDirty: P, endTracking: W, startTracking: G, shallowPropagate: U } = fe({
   update(e) {
-    return "getter" in e ? W(e) : G(e, e.value);
+    return "getter" in e ? X(e) : k(e, e.value);
   },
-  notify: U,
+  notify: H,
   unwatched(e) {
     if ("getter" in e) {
       let t = e.deps;
       if (t !== void 0) {
         e.flags = 17;
         do
-          t = C(t, e);
+          t = q(t, e);
         while (t !== void 0);
       }
-    } else "previousValue" in e || Y.call(e);
+    } else "previousValue" in e || Z.call(e);
   }
 });
-let q = 0, x = 0, O = 0, h, S;
+let E = 0, S = 0, j = 0, p, A;
 function v(e) {
-  const t = h;
-  return h = e, t;
+  const t = p;
+  return p = e, t;
 }
-function ge() {
-  return S;
+function ye() {
+  return A;
 }
-function be(e) {
-  const t = S;
-  return S = e, t;
+function we(e) {
+  const t = A;
+  return A = e, t;
 }
-function W(e) {
+function X(e) {
   const t = v(e);
-  L(e);
+  G(e);
   try {
     const r = e.value, n = { value: e.value };
     return !e.equals(r, e.value = e.getter.call(n));
   } finally {
-    v(t), B(e);
+    v(t), W(e);
   }
 }
-function G(e, t) {
+function k(e, t) {
   return e.flags = 1, !e.equals(e.previousValue, e.previousValue = t);
 }
-function U(e) {
+function H(e) {
   const t = e.flags;
   if (!(t & 64)) {
     e.flags = t | 64;
     const r = e.subs;
-    r !== void 0 ? U(r.sub) : E[O++] = e;
+    r !== void 0 ? H(r.sub) : O[j++] = e;
   }
 }
-function X(e, t) {
-  if (t & 16 || t & 32 && V(e.deps, e)) {
+function J(e, t) {
+  if (t & 16 || t & 32 && P(e.deps, e)) {
     const n = v(e);
-    L(e);
+    G(e);
     try {
       "cleanup" in e && e.cleanup !== void 0 && e.cleanup();
       const u = e.fn();
-      "cleanup" in e && g(u) && (e.cleanup = u);
+      "cleanup" in e && b(u) && (e.cleanup = u);
     } finally {
-      v(n), B(e);
+      v(n), W(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 && X(
+    u & 64 && J(
       n,
       n.flags = u & -65
       /* Queued */
     ), r = r.nextDep;
   }
 }
-function $() {
-  for (; x < O; ) {
-    const e = E[x];
-    E[x++] = void 0, X(
+function K() {
+  for (; S < j; ) {
+    const e = O[S];
+    O[S++] = void 0, J(
       e,
       e.flags &= -65
       /* Queued */
     );
   }
-  x = 0, O = 0;
+  S = 0, j = 0;
 }
-function F() {
+function le() {
   const e = this.flags;
-  if (e & 16 || e & 32 && V(this.deps, this)) {
-    if (W(this)) {
+  if (e & 16 || e & 32 && P(this.deps, this)) {
+    if (X(this)) {
       const t = this.subs;
-      t !== void 0 && P(t);
+      t !== void 0 && U(t);
     }
   } else e & 32 && (this.flags = e & -33);
-  return h !== void 0 && j(this, h), this.value;
+  return p !== void 0 && _(this, p), this.value;
 }
-function k() {
+function Q() {
   const e = this.value;
-  if (this.flags & 16 && G(this, e)) {
+  if (this.flags & 16 && k(this, e)) {
     const t = this.subs;
-    t !== void 0 && P(t);
+    t !== void 0 && U(t);
   }
-  return h !== void 0 && j(this, h), e;
+  return p !== void 0 && _(this, p), e;
 }
-function R(e) {
-  let t = g(e) ? y(e(this.value)) : e;
+function Y(e) {
+  let t = b(e) ? x(e(this.value)) : e;
   if (!this.equals(this.value, t)) {
     this.value = t, this.flags = 17;
     const r = this.subs;
-    r !== void 0 && (Z(r), q || $());
+    r !== void 0 && (ie(r), E || K());
   }
 }
-function Y() {
+function Z() {
   let e = this.deps;
   for (; e !== void 0; )
-    e = C(e, this);
+    e = q(e, this);
   const t = this.subs;
-  t !== void 0 && C(t), this.flags = 0, "cleanup" in this && this.cleanup != null && this.cleanup();
-}
-function Se(...e) {
-  return g(e[0]) ? te(e[0], e[1]) : ee(e[0], e[1]);
+  t !== void 0 && q(t), this.flags = 0, "cleanup" in this && this.cleanup != null && this.cleanup();
 }
-function ee(e, t) {
+function me(e, t) {
   const r = {
     previousValue: e,
     value: e,
-    equals: (t == null ? void 0 : t.equals) ?? A,
+    equals: (t == null ? void 0 : t.equals) ?? N,
     subs: void 0,
     subsTail: void 0,
     flags: 1
-  }, n = k.bind(r);
-  return n.set = R.bind(r), n;
+  }, n = Q.bind(r);
+  return n.set = Y.bind(r), n;
+}
+function De(e) {
+  return ce(() => e);
 }
-function xe(e, t) {
+function Te(e, t) {
   const r = {
     previousValue: e,
     value: e,
-    equals: (t == null ? void 0 : t.equals) ?? A,
+    equals: (t == null ? void 0 : t.equals) ?? N,
     subs: void 0,
     subsTail: void 0,
     flags: 1
   };
-  return [k.bind(r), R.bind(r)];
+  return [Q.bind(r), Y.bind(r)];
 }
-function te(e, t) {
-  return F.bind({
+function ce(e, t) {
+  return le.bind({
     value: void 0,
     subs: void 0,
     subsTail: void 0,
@@ -420,38 +420,31 @@ function te(e, t) {
     flags: 17,
     getter: function() {
       if (t != null && t.deps) {
-        for (let r of t.deps) y(r);
-        return y(ne(() => e(this.value)));
+        for (let r of t.deps) x(r);
+        return x(R(() => e(this.value)));
       }
-      return y(e(this.value));
+      return x(e(this.value));
     },
-    equals: (t == null ? void 0 : t.equals) ?? A
+    equals: (t == null ? void 0 : t.equals) ?? N
   });
 }
-function ye(e) {
-  ++q, e(), --q || $();
+function Ce(e) {
+  ++E, e(), --E || K();
 }
-function ne(e) {
-  if (g(e)) {
+function R(e) {
+  if (b(e)) {
     let t;
     const r = v(void 0);
     return t = e(), v(r), t;
   } else
     return e;
 }
-function y(e) {
-  return g(e) ? e() : e;
+function x(e) {
+  return b(e) ? e() : e;
 }
-const se = Symbol("INTERNAL_EFFECT");
-function me(e, t) {
-  var d;
-  const r = (t == null ? void 0 : t._type) === se;
-  if (!r && S)
-    return S.effect(e);
-  !r && K() === "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 = {
+function Oe(e) {
+  var n;
+  const t = {
     fn: e,
     subs: void 0,
     subsTail: void 0,
@@ -459,42 +452,115 @@ function me(e, t) {
     depsTail: void 0,
     flags: 2
   };
-  h !== void 0 && j(n, h);
-  const u = v(n);
+  p !== void 0 && _(t, p);
+  const r = v(t);
   try {
-    (d = n.cleanup) == null || d.call(n);
-    const p = n.fn();
-    n.cleanup = g(p) ? p : void 0;
+    (n = t.cleanup) == null || n.call(t);
+    const u = t.fn();
+    t.cleanup = b(u) ? u : void 0;
   } finally {
-    v(u);
+    v(r);
   }
-  return Y.bind(n);
+  return Z.bind(t);
+}
+let y = {
+  info: "development",
+  log: "development",
+  warn: "development",
+  error: !0
+}, F = I("*,-dolla.*"), w = [], B = !1;
+function qe(e) {
+  return w.push(e), function() {
+    w.splice(w.indexOf(e), 1);
+  };
+}
+function Ee(e, t) {
+  const r = (t == null ? void 0 : t.console) ?? oe(), n = (u) => {
+    let d = R(e);
+    if (y[u] === !1 || ne(y[u]) && y[u] !== ue() || !F(d))
+      return re;
+    {
+      let g = `%c${d}`;
+      return t != null && t.tag ? t.tagName ? g += ` %c[${t.tagName}: %c${t.tag}%c]` : g += ` %c[%c${t.tag}%c]` : g += "%c%c%c", r[u].bind(
+        r,
+        g,
+        `color:${se(g)};font-weight:bold`,
+        "color:#777",
+        "color:#aaa",
+        "color:#777"
+      );
+    }
+  };
+  return {
+    get info() {
+      return n("info");
+    },
+    get log() {
+      return n("log");
+    },
+    get warn() {
+      return n("warn");
+    },
+    get error() {
+      return n("error");
+    },
+    crash(u) {
+      if (!B) {
+        B = !0;
+        const d = {
+          error: u,
+          loggerName: x(e),
+          tag: t == null ? void 0 : t.tag,
+          tagName: t == null ? void 0 : t.tagName
+        };
+        for (const g of w)
+          g(d);
+        throw u;
+      }
+      return u;
+    }
+  };
+}
+function je(e) {
+  F = I(e);
+}
+function Ae(e) {
+  for (const t in e) {
+    const r = e[t];
+    r && (y[t] = r);
+  }
+}
+function oe() {
+  if (typeof window < "u" && window.console)
+    return window.console;
+  if (typeof global < "u" && global.console)
+    return global.console;
 }
 export {
-  Se as $,
-  se as I,
-  A as a,
-  ye as b,
-  K as c,
-  w as d,
-  me as e,
-  ve as f,
-  y as g,
-  xe as h,
-  ge as i,
-  fe as j,
-  be as k,
-  de as l,
-  te as m,
-  ie as n,
-  ce as o,
-  ae as p,
-  he as q,
-  ue as r,
-  oe as s,
-  le as t,
-  ne as u,
-  pe as v,
-  ee as w
+  ye as a,
+  Ce as b,
+  pe as c,
+  C as d,
+  Oe as e,
+  N as f,
+  x as g,
+  ue as h,
+  Se as i,
+  Ee as j,
+  je as k,
+  Ae as l,
+  ce as m,
+  de as n,
+  qe as o,
+  we as p,
+  xe as q,
+  De as r,
+  Te as s,
+  he as t,
+  R as u,
+  ge as v,
+  me as w,
+  ve as x,
+  be as y
 };
-//# sourceMappingURL=signals-HNnDUJRQ.js.map
+//# sourceMappingURL=logger-IE5c3t-c.js.map