@manyducks.co/dolla 2.0.0-alpha.6 → 2.0.0-alpha.61

package/dist/router.js

@@ -0,0 +1,8 @@
+import { R as e } from "./router-CjCkk4dA.js";
+function o(r) {
+  return new e(r);
+}
+export {
+  o as createRouter
+};
+//# sourceMappingURL=router.js.map

package/dist/router.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"router.js","sources":["../src/router/index.ts"],"sourcesContent":["import { Router, type RouterOptions } from \"./router.js\";\n\nexport function createRouter(options: RouterOptions): Router {\n  return new Router(options);\n}\n"],"names":["createRouter","options","Router"],"mappings":";AAEO,SAASA,EAAaC,GAAgC;AACpD,SAAA,IAAIC,EAAOD,CAAO;AAC3B;"}

package/dist/signals-gCwiIe5X.js

@@ -0,0 +1,450 @@
+import { t as E, c as v } from "./typeChecking-CbltMOUt.js";
+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";
+})(V || (V = {}));
+function H({ update: e, notify: t, unwatched: r }) {
+  return {
+    link: n,
+    unlink: u,
+    propagate: d,
+    checkDirty: k,
+    endTracking: X,
+    startTracking: S,
+    shallowPropagate: y
+  };
+  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)) {
+      i.depsTail = f;
+      return;
+    }
+    const c = s.subsTail;
+    if (c !== void 0 && c.sub === i && (!l || j(c, i)))
+      return;
+    const a = i.depsTail = s.subsTail = {
+      dep: s,
+      sub: i,
+      prevDep: o,
+      nextDep: f,
+      prevSub: c,
+      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;
+  }
+  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;
+  }
+  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);
+          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 S(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 k(s, i) {
+    let o, f = 0;
+    e: do {
+      const l = s.dep, c = l.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 ((c & 33) === 33) {
+        (s.nextSub !== void 0 || s.prevSub !== void 0) && (o = { value: s, prev: o }), s = l.deps, i = l, ++f;
+        continue;
+      }
+      if (!a && s.nextDep !== void 0) {
+        s = s.nextDep;
+        continue;
+      }
+      for (; f; ) {
+        --f;
+        const g = i.subs, A = g.nextSub !== void 0;
+        if (A ? (s = o.value, o = o.prev) : s = g, a) {
+          if (e(i)) {
+            A && y(g), 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 y(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 Z = () => {
+};
+let b = 1;
+function R() {
+  return b = b % Number.MAX_SAFE_INTEGER + 1, b.toString(36) + Date.now().toString(36);
+}
+function z(e, t) {
+  return Object.is(e, t);
+}
+function F(e, t) {
+  if (Object.is(e, t)) return !0;
+  const r = E(e);
+  if (r !== E(t))
+    return !1;
+  switch (r) {
+    case "object":
+      let n = 0;
+      for (const u in e) {
+        if (e[u] !== t[u]) return !1;
+        n++;
+      }
+      return Object.keys(t).length === n;
+    case "array":
+      if (e.length !== t.length) return !1;
+      for (let u = 0; u < e.length; u++)
+        if (e[u] !== t[u]) return !1;
+      return !0;
+    case "map":
+      if (e.size !== t.size) return !1;
+      for (const u of e.keys())
+        if (e[u] !== t[u]) return !1;
+      return !0;
+    case "set":
+      if (v(e.symmetricDifference))
+        return e.symmetricDifference(t).size === 0;
+      for (const u of e.keys())
+        if (e[u] !== t.get(u)) return !1;
+      return !0;
+  }
+  return !1;
+}
+function D(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;
+      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;
+      return !0;
+    }
+    if (e instanceof Set && t instanceof Set) {
+      if (e.size !== t.size) return !1;
+      for (n of e.entries()) if (!t.has(n[0])) return !1;
+      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;
+      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; ) {
+      var d = u[n];
+      if (!D(e[d], t[d])) return !1;
+    }
+    return !0;
+  }
+  return e !== e && t !== t;
+}
+function ee(e, t) {
+  const r = {};
+  for (const n in t)
+    e.includes(n) || (r[n] = t[n]);
+  return r;
+}
+function te(e) {
+  return Array.isArray(e) ? e : [e];
+}
+function ne(e) {
+  return e.replace(/-./g, (t) => t[1].toUpperCase());
+}
+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 re(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) {
+    let u = "positive";
+    n.startsWith("-") && (u = "negative", n = n.slice(1)), n === "*" ? t[u].push(function() {
+      return !0;
+    }) : n.endsWith("*") ? t[u].push(function(d) {
+      return d.startsWith(n.slice(0, n.length - 1));
+    }) : t[u].push(function(d) {
+      return d === n;
+    });
+  }
+  return function(n) {
+    const { positive: u, negative: d } = t;
+    return !(d.some((S) => S(n)) || u.length > 0 && !u.some((S) => S(n)));
+  };
+}
+const w = [], { link: q, unlink: T, propagate: J, checkDirty: M, endTracking: P, startTracking: W, shallowPropagate: _ } = H({
+  update(e) {
+    return "getter" in e ? N(e) : I(e, e.value);
+  },
+  notify: L,
+  unwatched(e) {
+    if ("getter" in e) {
+      let t = e.deps;
+      if (t !== void 0) {
+        e.flags = 17;
+        do
+          t = T(t, e);
+        while (t !== void 0);
+      }
+    } else "previousValue" in e || $.call(e);
+  }
+});
+let m = 0, x = 0, C = 0, p, O;
+function h(e) {
+  const t = p;
+  return p = e, t;
+}
+function ue() {
+  return O;
+}
+function ie(e) {
+  const t = O;
+  return O = e, t;
+}
+function N(e) {
+  const t = h(e);
+  W(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);
+  }
+}
+function I(e, t) {
+  return e.flags = 1, !e.equals(e.previousValue, e.previousValue = t);
+}
+function L(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;
+  }
+}
+function B(e, t) {
+  if (t & 16 || t & 32 && M(e.deps, e)) {
+    const n = h(e);
+    W(e);
+    try {
+      "cleanup" in e && e.cleanup !== void 0 && e.cleanup();
+      const u = e.fn();
+      "cleanup" in e && v(u) && (e.cleanup = u);
+    } finally {
+      h(n), P(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(
+      n,
+      n.flags = u & -65
+      /* Queued */
+    ), r = r.nextDep;
+  }
+}
+function U() {
+  for (; x < C; ) {
+    const e = w[x];
+    w[x++] = void 0, B(
+      e,
+      e.flags &= -65
+      /* Queued */
+    );
+  }
+  x = 0, C = 0;
+}
+function K() {
+  const e = this.flags;
+  if (e & 16 || e & 32 && M(this.deps, this)) {
+    if (N(this)) {
+      const t = this.subs;
+      t !== void 0 && _(t);
+    }
+  } else e & 32 && (this.flags = e & -33);
+  return p !== void 0 && q(this, p), 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 $() {
+  let e = this.deps;
+  for (; e !== void 0; )
+    e = T(e, this);
+  const t = this.subs;
+  t !== void 0 && T(t), this.flags = 0, "cleanup" in this && this.cleanup != null && this.cleanup();
+}
+function fe(e) {
+  ++m, e(), --m || U();
+}
+function oe(e) {
+  if (v(e)) {
+    let t;
+    const r = h(void 0);
+    return t = e(), h(r), t;
+  } else
+    return e;
+}
+function G(e) {
+  return v(e) ? e() : e;
+}
+function le(e) {
+  var n;
+  const t = {
+    fn: e,
+    subs: void 0,
+    subsTail: void 0,
+    deps: void 0,
+    depsTail: void 0,
+    flags: 2
+  };
+  p !== void 0 && q(t, p);
+  const r = h(t);
+  try {
+    (n = t.cleanup) == null || n.call(t);
+    const u = t.fn();
+    t.cleanup = v(u) ? u : void 0;
+  } finally {
+    h(r);
+  }
+  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
+  });
+}
+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
+};
+//# sourceMappingURL=signals-gCwiIe5X.js.map

package/dist/signals-gCwiIe5X.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"signals-gCwiIe5X.js","sources":["../node_modules/alien-signals/esm/system.mjs","../src/utils.ts","../src/core/signals.ts"],"sourcesContent":["export var ReactiveFlags;\n(function (ReactiveFlags) {\n    ReactiveFlags[ReactiveFlags[\"None\"] = 0] = \"None\";\n    ReactiveFlags[ReactiveFlags[\"Mutable\"] = 1] = \"Mutable\";\n    ReactiveFlags[ReactiveFlags[\"Watching\"] = 2] = \"Watching\";\n    ReactiveFlags[ReactiveFlags[\"RecursedCheck\"] = 4] = \"RecursedCheck\";\n    ReactiveFlags[ReactiveFlags[\"Recursed\"] = 8] = \"Recursed\";\n    ReactiveFlags[ReactiveFlags[\"Dirty\"] = 16] = \"Dirty\";\n    ReactiveFlags[ReactiveFlags[\"Pending\"] = 32] = \"Pending\";\n})(ReactiveFlags || (ReactiveFlags = {}));\nexport function createReactiveSystem({ update, notify, unwatched, }) {\n    return {\n        link,\n        unlink,\n        propagate,\n        checkDirty,\n        endTracking,\n        startTracking,\n        shallowPropagate,\n    };\n    function link(dep, sub) {\n        const prevDep = sub.depsTail;\n        if (prevDep !== undefined && prevDep.dep === dep) {\n            return;\n        }\n        let nextDep = undefined;\n        const recursedCheck = sub.flags & 4;\n        if (recursedCheck) {\n            nextDep = prevDep !== undefined ? prevDep.nextDep : sub.deps;\n            if (nextDep !== undefined && nextDep.dep === dep) {\n                sub.depsTail = nextDep;\n                return;\n            }\n        }\n        const prevSub = dep.subsTail;\n        if (prevSub !== undefined\n            && prevSub.sub === sub\n            && (!recursedCheck || isValidLink(prevSub, sub))) {\n            return;\n        }\n        const newLink = sub.depsTail\n            = dep.subsTail\n                = {\n                    dep,\n                    sub,\n                    prevDep,\n                    nextDep,\n                    prevSub,\n                    nextSub: undefined,\n                };\n        if (nextDep !== undefined) {\n            nextDep.prevDep = newLink;\n        }\n        if (prevDep !== undefined) {\n            prevDep.nextDep = newLink;\n        }\n        else {\n            sub.deps = newLink;\n        }\n        if (prevSub !== undefined) {\n            prevSub.nextSub = newLink;\n        }\n        else {\n            dep.subs = newLink;\n        }\n    }\n    function unlink(link, sub = link.sub) {\n        const dep = link.dep;\n        const prevDep = link.prevDep;\n        const nextDep = link.nextDep;\n        const nextSub = link.nextSub;\n        const prevSub = link.prevSub;\n        if (nextDep !== undefined) {\n            nextDep.prevDep = prevDep;\n        }\n        else {\n            sub.depsTail = prevDep;\n        }\n        if (prevDep !== undefined) {\n            prevDep.nextDep = nextDep;\n        }\n        else {\n            sub.deps = nextDep;\n        }\n        if (nextSub !== undefined) {\n            nextSub.prevSub = prevSub;\n        }\n        else {\n            dep.subsTail = prevSub;\n        }\n        if (prevSub !== undefined) {\n            prevSub.nextSub = nextSub;\n        }\n        else if ((dep.subs = nextSub) === undefined) {\n            unwatched(dep);\n        }\n        return nextDep;\n    }\n    function propagate(link) {\n        let next = link.nextSub;\n        let stack;\n        top: do {\n            const sub = link.sub;\n            let flags = sub.flags;\n            if (flags & 3) {\n                if (!(flags & 60)) {\n                    sub.flags = flags | 32;\n                }\n                else if (!(flags & 12)) {\n                    flags = 0;\n                }\n                else if (!(flags & 4)) {\n                    sub.flags = (flags & ~8) | 32;\n                }\n                else if (!(flags & 48) && isValidLink(link, sub)) {\n                    sub.flags = flags | 40;\n                    flags &= 1;\n                }\n                else {\n                    flags = 0;\n                }\n                if (flags & 2) {\n                    notify(sub);\n                }\n                if (flags & 1) {\n                    const subSubs = sub.subs;\n                    if (subSubs !== undefined) {\n                        link = subSubs;\n                        if (subSubs.nextSub !== undefined) {\n                            stack = { value: next, prev: stack };\n                            next = link.nextSub;\n                        }\n                        continue;\n                    }\n                }\n            }\n            if ((link = next) !== undefined) {\n                next = link.nextSub;\n                continue;\n            }\n            while (stack !== undefined) {\n                link = stack.value;\n                stack = stack.prev;\n                if (link !== undefined) {\n                    next = link.nextSub;\n                    continue top;\n                }\n            }\n            break;\n        } while (true);\n    }\n    function startTracking(sub) {\n        sub.depsTail = undefined;\n        sub.flags = (sub.flags & ~56) | 4;\n    }\n    function endTracking(sub) {\n        const depsTail = sub.depsTail;\n        let toRemove = depsTail !== undefined ? depsTail.nextDep : sub.deps;\n        while (toRemove !== undefined) {\n            toRemove = unlink(toRemove, sub);\n        }\n        sub.flags &= ~4;\n    }\n    function checkDirty(link, sub) {\n        let stack;\n        let checkDepth = 0;\n        top: do {\n            const dep = link.dep;\n            const depFlags = dep.flags;\n            let dirty = false;\n            if (sub.flags & 16) {\n                dirty = true;\n            }\n            else if ((depFlags & 17) === 17) {\n                if (update(dep)) {\n                    const subs = dep.subs;\n                    if (subs.nextSub !== undefined) {\n                        shallowPropagate(subs);\n                    }\n                    dirty = true;\n                }\n            }\n            else if ((depFlags & 33) === 33) {\n                if (link.nextSub !== undefined || link.prevSub !== undefined) {\n                    stack = { value: link, prev: stack };\n                }\n                link = dep.deps;\n                sub = dep;\n                ++checkDepth;\n                continue;\n            }\n            if (!dirty && link.nextDep !== undefined) {\n                link = link.nextDep;\n                continue;\n            }\n            while (checkDepth) {\n                --checkDepth;\n                const firstSub = sub.subs;\n                const hasMultipleSubs = firstSub.nextSub !== undefined;\n                if (hasMultipleSubs) {\n                    link = stack.value;\n                    stack = stack.prev;\n                }\n                else {\n                    link = firstSub;\n                }\n                if (dirty) {\n                    if (update(sub)) {\n                        if (hasMultipleSubs) {\n                            shallowPropagate(firstSub);\n                        }\n                        sub = link.sub;\n                        continue;\n                    }\n                }\n                else {\n                    sub.flags &= ~32;\n                }\n                sub = link.sub;\n                if (link.nextDep !== undefined) {\n                    link = link.nextDep;\n                    continue top;\n                }\n                dirty = false;\n            }\n            return dirty;\n        } while (true);\n    }\n    function shallowPropagate(link) {\n        do {\n            const sub = link.sub;\n            const nextSub = link.nextSub;\n            const subFlags = sub.flags;\n            if ((subFlags & 48) === 32) {\n                sub.flags = subFlags | 16;\n                if (subFlags & 2) {\n                    notify(sub);\n                }\n            }\n            link = nextSub;\n        } while (link !== undefined);\n    }\n    function isValidLink(checkLink, sub) {\n        const depsTail = sub.depsTail;\n        if (depsTail !== undefined) {\n            let link = sub.deps;\n            do {\n                if (link === checkLink) {\n                    return true;\n                }\n                if (link === depsTail) {\n                    break;\n                }\n                link = link.nextDep;\n            } while (link !== undefined);\n        }\n        return false;\n    }\n}\n","import { isFunction, isObject, typeOf } from \"./typeChecking.js\";\n\nexport const noOp = () => {};\n\n// Guarantee unique ID by incrementing a global counter.\nlet idCounter = 1;\nexport function getUniqueId(): string {\n  idCounter = (idCounter % Number.MAX_SAFE_INTEGER) + 1;\n  return idCounter.toString(36) + Date.now().toString(36);\n}\n\n/*=============================*\\\n||       Object Equality       ||\n\\*=============================*/\n\n/**\n * Equality check that passes if both values are the same object.\n * This is the default equality check for states.\n */\nexport function strictEqual(a: any, b: any): boolean {\n  return Object.is(a, b);\n}\n\n/**\n * Equality check that passes if both values are the same object, or if both are objects or arrays with equal keys and values.\n */\nexport function shallowEqual(a: any, b: any): boolean {\n  if (Object.is(a, b)) return true;\n\n  // Must be same type\n  const t = typeOf(a);\n  if (t !== typeOf(b)) {\n    return false;\n  }\n\n  switch (t) {\n    case \"object\":\n      // Objects must have same number of keys with strict equal values\n      let size = 0;\n      for (const key in a) {\n        if (a[key] !== b[key]) return false;\n        size++;\n      }\n      return Object.keys(b).length === size;\n    case \"array\":\n      // Arrays must be the same length with strict equal values\n      if (a.length !== b.length) return false;\n      for (let i = 0; i < a.length; i++) {\n        if (a[i] !== b[i]) return false;\n      }\n      return true;\n    case \"map\":\n      if (a.size !== b.size) return false;\n      for (const key of a.keys()) {\n        if (a[key] !== b[key]) return false;\n      }\n      return true;\n    case \"set\":\n      if (isFunction(a.symmetricDifference)) {\n        return a.symmetricDifference(b).size === 0;\n      } else {\n        for (const key of a.keys()) {\n          if (a[key] !== b.get(key)) return false;\n        }\n        return true;\n      }\n  }\n\n  return false;\n}\n\n/**\n * Equality check that passes if two objects have equal values, even if they are not the same object.\n */\n// NOTE: This code is https://github.com/epoberezkin/fast-deep-equal licensed under MIT.\n// I imported it because I couldn't get the old school module to play nice with my modern ES code as an external dependency.\nexport function deepEqual(a: any, b: any): boolean {\n  if (a === b) return true;\n\n  if (a && b && typeof a == \"object\" && typeof b == \"object\") {\n    if (a.constructor !== b.constructor) return false;\n\n    var length, i, keys;\n    if (Array.isArray(a)) {\n      length = a.length;\n      if (length != b.length) return false;\n      for (i = length; i-- !== 0; ) if (!deepEqual(a[i], b[i])) return false;\n      return true;\n    }\n\n    if (a instanceof Map && b instanceof Map) {\n      if (a.size !== b.size) return false;\n      for (i of a.entries()) if (!b.has(i[0])) return false;\n      for (i of a.entries()) if (!deepEqual(i[1], b.get(i[0]))) return false;\n      return true;\n    }\n\n    if (a instanceof Set && b instanceof Set) {\n      if (a.size !== b.size) return false;\n      for (i of a.entries()) if (!b.has(i[0])) return false;\n      return true;\n    }\n\n    if (ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\n      length = (a as any).length;\n      if (length != (b as any).length) return false;\n      for (i = length; i-- !== 0; ) if ((a as any)[i] !== (b as any)[i]) return false;\n      return true;\n    }\n\n    if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\n    if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\n    if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\n\n    keys = Object.keys(a);\n    length = keys.length;\n    if (length !== Object.keys(b).length) return false;\n\n    for (i = length; i-- !== 0; ) if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\n\n    for (i = length; i-- !== 0; ) {\n      var key = keys[i];\n\n      if (!deepEqual(a[key], b[key])) return false;\n    }\n\n    return true;\n  }\n\n  // true if both NaN, false otherwise\n  return a !== a && b !== b;\n}\n\n/*=============================*\\\n||         Object Utils        ||\n\\*=============================*/\n\n/**\n * Takes an old value and a new value.  Returns a merged copy if both are objects, otherwise returns the new value.\n */\nexport function merge(one: unknown, two: unknown) {\n  if (isObject(one)) {\n    if (!isObject(two)) {\n      return two;\n    }\n\n    const merged = Object.assign({}, one) as any;\n\n    for (const key in two) {\n      merged[key] = merge(merged[key], two[key]);\n    }\n\n    return merged;\n  } else {\n    return two;\n  }\n}\n\n/**\n * Returns a new object without the specified keys.\n * If called without object, returns a function that takes an object\n * and returns a version with the original keys omitted.\n *\n * @param keys - An array of keys to omit.\n * @param object - An object to clone without the omitted keys.\n */\nexport function omit<O extends Record<any, any>>(keys: (keyof O)[], object: O): Record<any, any> {\n  const newObject: Record<any, any> = {};\n\n  for (const key in object) {\n    if (!keys.includes(key)) {\n      newObject[key] = object[key];\n    }\n  }\n\n  return newObject;\n}\n\n/*=============================*\\\n||          Misc Utils         ||\n\\*=============================*/\n\nexport function toArray<T>(value: T | T[]): T[] {\n  if (Array.isArray(value)) {\n    return value;\n  } else {\n    return [value];\n  }\n}\n\nexport function toCamelCase(s: string) {\n  return s.replace(/-./g, (x) => x[1].toUpperCase());\n}\n\n/**\n * Takes any string and returns an OKLCH color.\n */\nexport function okhash(value: string) {\n  let hue = 0;\n  for (let i = 0; i < value.length; i++) {\n    hue = (hue + value.charCodeAt(i) * 10) % 360;\n  }\n  return `oklch(0.68 0.15 ${hue}deg)`;\n}\n\nexport type MatcherFunction = (value: string) => boolean;\n\n/**\n * Parses a filter string into a matcher function.\n *\n * @param pattern - A string or regular expression that specifies a pattern for names of loggers whose messages you want to display.\n */\nexport function createMatcher(pattern: string | RegExp): MatcherFunction {\n  if (pattern instanceof RegExp) {\n    return (value: string) => pattern.test(value);\n  }\n\n  const matchers: Record<\"positive\" | \"negative\", MatcherFunction[]> = {\n    positive: [],\n    negative: [],\n  };\n\n  const parts = pattern\n    .split(\",\")\n    .map((p) => p.trim())\n    .filter((p) => p !== \"\");\n\n  for (let part of parts) {\n    let section: \"positive\" | \"negative\" = \"positive\";\n\n    if (part.startsWith(\"-\")) {\n      section = \"negative\";\n      part = part.slice(1);\n    }\n\n    if (part === \"*\") {\n      matchers[section].push(function () {\n        return true;\n      });\n    } else if (part.endsWith(\"*\")) {\n      matchers[section].push(function (value) {\n        return value.startsWith(part.slice(0, part.length - 1));\n      });\n    } else {\n      matchers[section].push(function (value) {\n        return value === part;\n      });\n    }\n  }\n\n  return function (name: string) {\n    const { positive, negative } = matchers;\n\n    // Matching any negative matcher disqualifies.\n    if (negative.some((fn) => fn(name))) {\n      return false;\n    }\n\n    // Matching at least one positive matcher is required if any are specified.\n    if (positive.length > 0 && !positive.some((fn) => fn(name))) {\n      return false;\n    }\n\n    return true;\n  };\n}\n","import type { ReactiveFlags, ReactiveNode } from \"alien-signals\";\nimport { createReactiveSystem } from \"alien-signals/system\";\nimport { isFunction } from \"../typeChecking\";\nimport { strictEqual } from \"../utils\";\nimport { Context } from \"./context\";\n\nconst enum EffectFlags {\n  Queued = 1 << 6,\n}\n\ninterface EffectScope extends ReactiveNode {}\n\ninterface Effect extends ReactiveNode {\n  fn(): void | (() => void);\n  cleanup?: () => void;\n}\n\ninterface ComputedGetterState<T> {\n  value?: T;\n}\n\ninterface Computed<T = any> extends ReactiveNode {\n  value: T | undefined;\n  getter: (this: ComputedGetterState<T>) => T;\n  equals: EqualityFn<T>;\n}\n\ninterface Value<T = any> extends ReactiveNode {\n  previousValue: T;\n  value: T;\n  equals: EqualityFn<T>;\n}\n\nconst queuedEffects: (Effect | EffectScope | undefined)[] = [];\nconst { link, unlink, propagate, checkDirty, endTracking, startTracking, shallowPropagate } = createReactiveSystem({\n  update(signal: Value | Computed): boolean {\n    if (\"getter\" in signal) {\n      return updateComputed(signal);\n    } else {\n      return updateSignal(signal, signal.value);\n    }\n  },\n  notify,\n  unwatched(node: Value | Computed | Effect | EffectScope) {\n    if (\"getter\" in node) {\n      let toRemove = node.deps;\n      if (toRemove !== undefined) {\n        node.flags = 17 as ReactiveFlags.Mutable | ReactiveFlags.Dirty;\n        do {\n          toRemove = unlink(toRemove, node);\n        } while (toRemove !== undefined);\n      }\n    } else if (!(\"previousValue\" in node)) {\n      _effect.call(node);\n    }\n  },\n});\n\nlet batchDepth = 0;\n\nlet notifyIndex = 0;\nlet queuedEffectsLength = 0;\nlet activeSub: ReactiveNode | undefined;\nlet activeScope: EffectScope | undefined;\nlet activeContext: Context | undefined;\n\nfunction getCurrentSub(): ReactiveNode | undefined {\n  return activeSub;\n}\n\nfunction setCurrentSub(sub: ReactiveNode | undefined) {\n  const prevSub = activeSub;\n  activeSub = sub;\n  return prevSub;\n}\n\nexport function getCurrentContext(): Context | undefined {\n  return activeContext;\n}\n\nexport function setCurrentContext(context: Context | undefined) {\n  const prevContext = activeContext;\n  activeContext = context;\n  return prevContext;\n}\n\n// function getCurrentScope(): EffectScope | undefined {\n//   return activeScope;\n// }\n\n// function setCurrentScope(scope: EffectScope | undefined) {\n//   const prevScope = activeScope;\n//   activeScope = scope;\n//   return prevScope;\n// }\n\n// export function effectScope(fn: () => void): () => void {\n//   const e: EffectScope = {\n//     deps: undefined,\n//     depsTail: undefined,\n//     subs: undefined,\n//     subsTail: undefined,\n//     flags: 0 satisfies ReactiveFlags.None,\n//   };\n//   if (activeScope !== undefined) {\n//     link(e, activeScope);\n//   }\n//   const prevSub = setCurrentSub(undefined);\n//   const prevScope = setCurrentScope(e);\n//   try {\n//     fn();\n//   } finally {\n//     setCurrentScope(prevScope);\n//     setCurrentSub(prevSub);\n//   }\n//   return effectOper.bind(e);\n// }\n\nfunction updateComputed(c: Computed): boolean {\n  const prevSub = setCurrentSub(c);\n  startTracking(c);\n  try {\n    const oldValue = c.value;\n    const state: ComputedGetterState<any> = { value: c.value };\n    // return oldValue !== (c.value = c.getter.call(state));\n    return !c.equals(oldValue, (c.value = c.getter.call(state)));\n  } finally {\n    setCurrentSub(prevSub);\n    endTracking(c);\n  }\n}\n\nfunction updateSignal(s: Value, value: any): boolean {\n  s.flags = 1 satisfies ReactiveFlags.Mutable;\n  // return s.previousValue !== (s.previousValue = value);\n  return !s.equals(s.previousValue, (s.previousValue = value));\n}\n\nfunction notify(e: Effect | EffectScope) {\n  const flags = e.flags;\n  if (!(flags & EffectFlags.Queued)) {\n    e.flags = flags | EffectFlags.Queued;\n    const subs = e.subs;\n    if (subs !== undefined) {\n      notify(subs.sub as Effect | EffectScope);\n    } else {\n      queuedEffects[queuedEffectsLength++] = e;\n    }\n  }\n}\n\nfunction run(e: Effect | EffectScope, flags: ReactiveFlags): void {\n  if (\n    flags & (16 satisfies ReactiveFlags.Dirty) ||\n    (flags & (32 satisfies ReactiveFlags.Pending) && checkDirty(e.deps!, e))\n  ) {\n    const prev = setCurrentSub(e);\n    startTracking(e);\n    try {\n      if (\"cleanup\" in e && e.cleanup !== undefined) {\n        e.cleanup();\n      }\n      const result = (e as Effect).fn();\n      if (\"cleanup\" in e && isFunction(result)) {\n        e.cleanup = result;\n      }\n    } finally {\n      setCurrentSub(prev);\n      endTracking(e);\n    }\n    return;\n  } else if (flags & (32 satisfies ReactiveFlags.Pending)) {\n    e.flags = flags & ~(32 satisfies ReactiveFlags.Pending);\n  }\n  let link = e.deps;\n  while (link !== undefined) {\n    const dep = link.dep;\n    const depFlags = dep.flags;\n    if (depFlags & EffectFlags.Queued) {\n      run(dep, (dep.flags = depFlags & ~EffectFlags.Queued));\n    }\n    link = link.nextDep;\n  }\n}\n\nfunction flush(): void {\n  while (notifyIndex < queuedEffectsLength) {\n    const effect = queuedEffects[notifyIndex]!;\n    queuedEffects[notifyIndex++] = undefined;\n    run(effect, (effect.flags &= ~EffectFlags.Queued));\n  }\n  notifyIndex = 0;\n  queuedEffectsLength = 0;\n}\n\nfunction _computed<T>(this: Computed<T>): T {\n  const flags = this.flags;\n  if (\n    flags & (16 satisfies ReactiveFlags.Dirty) ||\n    (flags & (32 satisfies ReactiveFlags.Pending) && checkDirty(this.deps!, this))\n  ) {\n    if (updateComputed(this)) {\n      const subs = this.subs;\n      if (subs !== undefined) {\n        shallowPropagate(subs);\n      }\n    }\n  } else if (flags & (32 satisfies ReactiveFlags.Pending)) {\n    this.flags = flags & ~(32 satisfies ReactiveFlags.Pending);\n  }\n  if (activeSub !== undefined) {\n    link(this, activeSub);\n  } else if (activeScope !== undefined) {\n    link(this, activeScope);\n  }\n  return this.value!;\n}\n\nfunction _source<T>(this: Value<T>, ...value: [T]): T | void {\n  if (value.length) {\n    let newValue = value[0];\n    if (isFunction(newValue)) {\n      newValue = get(newValue(this.value)) as T;\n    }\n    if (!this.equals(this.value, newValue)) {\n      this.value = newValue;\n      this.flags = 17 as ReactiveFlags.Mutable | ReactiveFlags.Dirty;\n      const subs = this.subs;\n      if (subs !== undefined) {\n        propagate(subs);\n        if (!batchDepth) {\n          flush();\n        }\n      }\n    }\n  } else {\n    const value = this.value;\n    if (this.flags & (16 satisfies ReactiveFlags.Dirty)) {\n      if (updateSignal(this, value)) {\n        const subs = this.subs;\n        if (subs !== undefined) {\n          shallowPropagate(subs);\n        }\n      }\n    }\n    if (activeSub !== undefined) {\n      link(this, activeSub);\n    }\n    return value;\n  }\n}\n\nfunction _effect(this: Effect | EffectScope): void {\n  let dep = this.deps;\n  while (dep !== undefined) {\n    dep = unlink(dep, this);\n  }\n  const sub = this.subs;\n  if (sub !== undefined) {\n    unlink(sub);\n  }\n  this.flags = 0 satisfies ReactiveFlags.None;\n\n  if (\"cleanup\" in this && this.cleanup != null) {\n    this.cleanup();\n  }\n}\n\n/*===================================*\\\n||                API                ||\n\\*===================================*/\n\n/* -------------- TYPES --------------- */\n\n/**\n * A getter that returns the current value held within the signal.\n * If called inside a trackable scope this signal will be tracked as a dependency.\n */\nexport interface Signal<T> {\n  (): T;\n}\n\n/**\n * Extends Signal with the ability to pass a value or an updater function to change the Signal's value.\n */\nexport interface Source<T> extends Signal<T> {\n  (value: T): void;\n  (updater: (value: T) => T): void;\n}\n\nexport type MaybeSignal<T> = Signal<T> | T;\n\nexport type EqualityFn<T> = (current: T, next: T) => boolean;\nexport interface SignalOptions<T> {\n  /**\n   * A function to compare the current and next values. Returning `true` means the value has changed.\n   */\n  equals?: EqualityFn<T>;\n}\n\n/* -------------- PUBLIC API --------------- */\n\n/**\n * Suspends effects during `fn`. Effects for all updated Signal values are called at the end of the batch.\n */\nexport function batch(fn: () => void) {\n  ++batchDepth;\n  fn();\n  if (!--batchDepth) flush();\n}\n\n/**\n * Call a Signal function without tracking its value.\n */\nexport function untracked<T>(value: MaybeSignal<T>): T {\n  if (isFunction(value)) {\n    let result: T;\n    const pausedSub = setCurrentSub(undefined);\n    result = value();\n    setCurrentSub(pausedSub);\n    return result;\n  } else {\n    return value;\n  }\n}\n\n/**\n * Unwraps the plain value from a Signal. If the value is not a Signal it is returned as-is.\n */\nexport function get<T>(value: MaybeSignal<T>) {\n  if (isFunction(value)) {\n    return (value as () => T)();\n  } else {\n    return value;\n  }\n}\n\n/**\n * Function to be invoked for the effect. Can return an optional cleanup function to be called between invocations.\n */\nexport type EffectFn = () => void | (() => void);\n\nexport type UnsubscribeFn = () => void;\n\n/**\n * Creates a tracked scope that re-runs whenever the values of any tracked reactives changes.\n * Reactives are tracked by accessing their `value` within the body of the function.\n *\n * NOTE: You must call the unsubscribe function to stop watching for changes.\n * If you are using an effect inside a View or Store, use `ctx.effect` instead, which cleans up automatically when the component unmounts.\n */\nexport function effect(fn: EffectFn): UnsubscribeFn {\n  const e: Effect = {\n    fn,\n    subs: undefined,\n    subsTail: undefined,\n    deps: undefined,\n    depsTail: undefined,\n    flags: 2 satisfies ReactiveFlags.Watching,\n  };\n  if (activeSub !== undefined) {\n    link(e, activeSub);\n  } else if (activeScope !== undefined) {\n    link(e, activeScope);\n  }\n  const prev = setCurrentSub(e);\n  try {\n    e.cleanup?.();\n    const result = e.fn();\n    e.cleanup = isFunction(result) ? result : undefined;\n  } finally {\n    setCurrentSub(prev);\n  }\n  return _effect.bind(e);\n}\n\nexport function $<T>(compute: (this: ComputedGetterState<T>) => MaybeSignal<T>, options?: SignalOptions<T>): Signal<T>;\nexport function $<T>(value: T, options?: SignalOptions<T>): Source<T>;\nexport function $<T>(value: undefined, options?: SignalOptions<T>): Source<T | undefined>;\nexport function $<T>(): Source<T | undefined>;\n\nexport function $<T>(init?: ((previousValue: T) => MaybeSignal<T>) | T, options?: SignalOptions<T>) {\n  if (isFunction(init)) {\n    return _computed.bind({\n      value: undefined,\n      subs: undefined,\n      subsTail: undefined,\n      deps: undefined,\n      depsTail: undefined,\n      flags: 17 as ReactiveFlags.Mutable | ReactiveFlags.Dirty,\n      getter: function (this: ComputedGetterState<any>) {\n        return get(init.call(this));\n      },\n      equals: (options?.equals as EqualityFn<unknown>) ?? strictEqual,\n    }) as () => T;\n  } else {\n    return _source.bind({\n      previousValue: init,\n      value: init,\n      equals: (options?.equals as EqualityFn<unknown>) ?? strictEqual,\n      subs: undefined,\n      subsTail: undefined,\n      flags: 1 satisfies ReactiveFlags.Mutable,\n    }) as () => T | undefined;\n  }\n}\n"],"names":["ReactiveFlags","createReactiveSystem","update","notify","unwatched","link","unlink","propagate","checkDirty","endTracking","startTracking","shallowPropagate","dep","sub","prevDep","nextDep","recursedCheck","prevSub","isValidLink","newLink","nextSub","next","stack","top","flags","subSubs","depsTail","toRemove","checkDepth","depFlags","dirty","subs","firstSub","hasMultipleSubs","subFlags","checkLink","noOp","idCounter","getUniqueId","strictEqual","a","b","shallowEqual","t","typeOf","size","key","i","isFunction","deepEqual","length","keys","omit","object","newObject","toArray","value","toCamelCase","s","x","okhash","hue","createMatcher","pattern","matchers","parts","p","part","section","name","positive","negative","fn","queuedEffects","signal","updateComputed","updateSignal","node","_effect","batchDepth","notifyIndex","queuedEffectsLength","activeSub","activeContext","setCurrentSub","getCurrentContext","setCurrentContext","context","prevContext","c","oldValue","state","run","prev","result","flush","effect","_computed","_source","newValue","get","batch","untracked","pausedSub","e","_a","$","init","options"],"mappings":";AAAO,IAAIA;AAAA,CACV,SAAUA,GAAe;AACtB,EAAAA,EAAcA,EAAc,OAAU,CAAC,IAAI,QAC3CA,EAAcA,EAAc,UAAa,CAAC,IAAI,WAC9CA,EAAcA,EAAc,WAAc,CAAC,IAAI,YAC/CA,EAAcA,EAAc,gBAAmB,CAAC,IAAI,iBACpDA,EAAcA,EAAc,WAAc,CAAC,IAAI,YAC/CA,EAAcA,EAAc,QAAW,EAAE,IAAI,SAC7CA,EAAcA,EAAc,UAAa,EAAE,IAAI;AACnD,GAAGA,MAAkBA,IAAgB,CAAA,EAAG;AACjC,SAASC,EAAqB,EAAE,QAAAC,GAAQ,QAAAC,GAAQ,WAAAC,EAAS,GAAK;AACjE,SAAO;AAAA,IACH,MAAAC;AAAA,IACA,QAAAC;AAAA,IACA,WAAAC;AAAA,IACA,YAAAC;AAAA,IACA,aAAAC;AAAA,IACA,eAAAC;AAAA,IACA,kBAAAC;AAAA,EACH;AACD,WAASN,EAAKO,GAAKC,GAAK;AACpB,UAAMC,IAAUD,EAAI;AACpB,QAAIC,MAAY,UAAaA,EAAQ,QAAQF;AACzC;AAEJ,QAAIG;AACJ,UAAMC,IAAgBH,EAAI,QAAQ;AAClC,QAAIG,MACAD,IAAUD,MAAY,SAAYA,EAAQ,UAAUD,EAAI,MACpDE,MAAY,UAAaA,EAAQ,QAAQH,IAAK;AAC9C,MAAAC,EAAI,WAAWE;AACf;AAAA,IAChB;AAEQ,UAAME,IAAUL,EAAI;AACpB,QAAIK,MAAY,UACTA,EAAQ,QAAQJ,MACf,CAACG,KAAiBE,EAAYD,GAASJ,CAAG;AAC9C;AAEJ,UAAMM,IAAUN,EAAI,WACdD,EAAI,WACA;AAAA,MACE,KAAAA;AAAA,MACA,KAAAC;AAAA,MACA,SAAAC;AAAA,MACA,SAAAC;AAAA,MACA,SAAAE;AAAA,MACA,SAAS;AAAA,IACZ;AACT,IAAIF,MAAY,WACZA,EAAQ,UAAUI,IAElBL,MAAY,SACZA,EAAQ,UAAUK,IAGlBN,EAAI,OAAOM,GAEXF,MAAY,SACZA,EAAQ,UAAUE,IAGlBP,EAAI,OAAOO;AAAA,EAEvB;AACI,WAASb,EAAOD,GAAMQ,IAAMR,EAAK,KAAK;AAClC,UAAMO,IAAMP,EAAK,KACXS,IAAUT,EAAK,SACfU,IAAUV,EAAK,SACfe,IAAUf,EAAK,SACfY,IAAUZ,EAAK;AACrB,WAAIU,MAAY,SACZA,EAAQ,UAAUD,IAGlBD,EAAI,WAAWC,GAEfA,MAAY,SACZA,EAAQ,UAAUC,IAGlBF,EAAI,OAAOE,GAEXK,MAAY,SACZA,EAAQ,UAAUH,IAGlBL,EAAI,WAAWK,GAEfA,MAAY,SACZA,EAAQ,UAAUG,KAEZR,EAAI,OAAOQ,OAAa,UAC9BhB,EAAUQ,CAAG,GAEVG;AAAA,EACf;AACI,WAASR,EAAUF,GAAM;AACrB,QAAIgB,IAAOhB,EAAK,SACZiB;AACJ,IAAAC,EAAK,IAAG;AACJ,YAAMV,IAAMR,EAAK;AACjB,UAAImB,IAAQX,EAAI;AAChB,UAAIW,IAAQ,MACFA,IAAQ,KAGHA,IAAQ,KAGRA,IAAQ,IAGV,EAAEA,IAAQ,OAAON,EAAYb,GAAMQ,CAAG,KAC3CA,EAAI,QAAQW,IAAQ,IACpBA,KAAS,KAGTA,IAAQ,IAPRX,EAAI,QAASW,IAAQ,KAAM,KAH3BA,IAAQ,IAHRX,EAAI,QAAQW,IAAQ,IAepBA,IAAQ,KACRrB,EAAOU,CAAG,GAEVW,IAAQ,IAAG;AACX,cAAMC,IAAUZ,EAAI;AACpB,YAAIY,MAAY,QAAW;AACvB,UAAApB,IAAOoB,GACHA,EAAQ,YAAY,WACpBH,IAAQ,EAAE,OAAOD,GAAM,MAAMC,EAAO,GACpCD,IAAOhB,EAAK;AAEhB;AAAA,QACxB;AAAA,MACA;AAEY,WAAKA,IAAOgB,OAAU,QAAW;AAC7B,QAAAA,IAAOhB,EAAK;AACZ;AAAA,MAChB;AACY,aAAOiB,MAAU;AAGb,YAFAjB,IAAOiB,EAAM,OACbA,IAAQA,EAAM,MACVjB,MAAS,QAAW;AACpB,UAAAgB,IAAOhB,EAAK;AACZ,mBAASkB;AAAA,QAC7B;AAEY;AAAA,IACZ,SAAiB;AAAA,EACjB;AACI,WAASb,EAAcG,GAAK;AACxB,IAAAA,EAAI,WAAW,QACfA,EAAI,QAASA,EAAI,QAAQ,MAAO;AAAA,EACxC;AACI,WAASJ,EAAYI,GAAK;AACtB,UAAMa,IAAWb,EAAI;AACrB,QAAIc,IAAWD,MAAa,SAAYA,EAAS,UAAUb,EAAI;AAC/D,WAAOc,MAAa;AAChB,MAAAA,IAAWrB,EAAOqB,GAAUd,CAAG;AAEnC,IAAAA,EAAI,SAAS;AAAA,EACrB;AACI,WAASL,EAAWH,GAAMQ,GAAK;AAC3B,QAAIS,GACAM,IAAa;AACjB,IAAAL,EAAK,IAAG;AACJ,YAAMX,IAAMP,EAAK,KACXwB,IAAWjB,EAAI;AACrB,UAAIkB,IAAQ;AACZ,UAAIjB,EAAI,QAAQ;AACZ,QAAAiB,IAAQ;AAAA,gBAEFD,IAAW,QAAQ;AACzB,YAAI3B,EAAOU,CAAG,GAAG;AACb,gBAAMmB,IAAOnB,EAAI;AACjB,UAAImB,EAAK,YAAY,UACjBpB,EAAiBoB,CAAI,GAEzBD,IAAQ;AAAA,QAC5B;AAAA,kBAEsBD,IAAW,QAAQ,IAAI;AAC7B,SAAIxB,EAAK,YAAY,UAAaA,EAAK,YAAY,YAC/CiB,IAAQ,EAAE,OAAOjB,GAAM,MAAMiB,EAAO,IAExCjB,IAAOO,EAAI,MACXC,IAAMD,GACN,EAAEgB;AACF;AAAA,MAChB;AACY,UAAI,CAACE,KAASzB,EAAK,YAAY,QAAW;AACtC,QAAAA,IAAOA,EAAK;AACZ;AAAA,MAChB;AACY,aAAOuB,KAAY;AACf,UAAEA;AACF,cAAMI,IAAWnB,EAAI,MACfoB,IAAkBD,EAAS,YAAY;AAQ7C,YAPIC,KACA5B,IAAOiB,EAAM,OACbA,IAAQA,EAAM,QAGdjB,IAAO2B,GAEPF;AACA,cAAI5B,EAAOW,CAAG,GAAG;AACb,YAAIoB,KACAtB,EAAiBqB,CAAQ,GAE7BnB,IAAMR,EAAK;AACX;AAAA,UACxB;AAAA;AAGoB,UAAAQ,EAAI,SAAS;AAGjB,YADAA,IAAMR,EAAK,KACPA,EAAK,YAAY,QAAW;AAC5B,UAAAA,IAAOA,EAAK;AACZ,mBAASkB;AAAA,QAC7B;AACgB,QAAAO,IAAQ;AAAA,MACxB;AACY,aAAOA;AAAA,IACnB,SAAiB;AAAA,EACjB;AACI,WAASnB,EAAiBN,GAAM;AAC5B,OAAG;AACC,YAAMQ,IAAMR,EAAK,KACXe,IAAUf,EAAK,SACf6B,IAAWrB,EAAI;AACrB,OAAKqB,IAAW,QAAQ,OACpBrB,EAAI,QAAQqB,IAAW,IACnBA,IAAW,KACX/B,EAAOU,CAAG,IAGlBR,IAAOe;AAAA,IACV,SAAQf,MAAS;AAAA,EAC1B;AACI,WAASa,EAAYiB,GAAWtB,GAAK;AACjC,UAAMa,IAAWb,EAAI;AACrB,QAAIa,MAAa,QAAW;AACxB,UAAIrB,IAAOQ,EAAI;AACf,SAAG;AACC,YAAIR,MAAS8B;AACT,iBAAO;AAEX,YAAI9B,MAASqB;AACT;AAEJ,QAAArB,IAAOA,EAAK;AAAA,MACf,SAAQA,MAAS;AAAA,IAC9B;AACQ,WAAO;AAAA,EACf;AACA;AChQO,MAAM+B,IAAO,MAAM;AAAC;AAG3B,IAAIC,IAAY;AACT,SAASC,IAAsB;AACvB,SAAAD,IAAAA,IAAY,OAAO,mBAAoB,GAC7CA,EAAU,SAAS,EAAE,IAAI,KAAK,IAAI,EAAE,SAAS,EAAE;AACxD;AAUgB,SAAAE,EAAYC,GAAQC,GAAiB;AAC5C,SAAA,OAAO,GAAGD,GAAGC,CAAC;AACvB;AAKgB,SAAAC,EAAaF,GAAQC,GAAiB;AACpD,MAAI,OAAO,GAAGD,GAAGC,CAAC,EAAU,QAAA;AAGtB,QAAAE,IAAIC,EAAOJ,CAAC;AACd,MAAAG,MAAMC,EAAOH,CAAC;AACT,WAAA;AAGT,UAAQE,GAAG;AAAA,IACT,KAAK;AAEH,UAAIE,IAAO;AACX,iBAAWC,KAAON,GAAG;AACnB,YAAIA,EAAEM,CAAG,MAAML,EAAEK,CAAG,EAAU,QAAA;AAC9B,QAAAD;AAAA,MAAA;AAEF,aAAO,OAAO,KAAKJ,CAAC,EAAE,WAAWI;AAAA,IACnC,KAAK;AAEH,UAAIL,EAAE,WAAWC,EAAE,OAAe,QAAA;AAClC,eAASM,IAAI,GAAGA,IAAIP,EAAE,QAAQO;AAC5B,YAAIP,EAAEO,CAAC,MAAMN,EAAEM,CAAC,EAAU,QAAA;AAErB,aAAA;AAAA,IACT,KAAK;AACH,UAAIP,EAAE,SAASC,EAAE,KAAa,QAAA;AACnB,iBAAAK,KAAON,EAAE;AAClB,YAAIA,EAAEM,CAAG,MAAML,EAAEK,CAAG,EAAU,QAAA;AAEzB,aAAA;AAAA,IACT,KAAK;AACC,UAAAE,EAAWR,EAAE,mBAAmB;AAClC,eAAOA,EAAE,oBAAoBC,CAAC,EAAE,SAAS;AAE9B,iBAAAK,KAAON,EAAE;AAClB,YAAIA,EAAEM,CAAG,MAAML,EAAE,IAAIK,CAAG,EAAU,QAAA;AAE7B,aAAA;AAAA,EACT;AAGG,SAAA;AACT;AAOgB,SAAAG,EAAUT,GAAQC,GAAiB;AAC7C,MAAAD,MAAMC,EAAU,QAAA;AAEpB,MAAID,KAAKC,KAAK,OAAOD,KAAK,YAAY,OAAOC,KAAK,UAAU;AAC1D,QAAID,EAAE,gBAAgBC,EAAE,YAAoB,QAAA;AAE5C,QAAIS,GAAQH,GAAGI;AACX,QAAA,MAAM,QAAQX,CAAC,GAAG;AAEhB,UADJU,IAASV,EAAE,QACPU,KAAUT,EAAE,OAAe,QAAA;AAC/B,WAAKM,IAAIG,GAAQH,QAAQ,SAAS,CAACE,EAAUT,EAAEO,CAAC,GAAGN,EAAEM,CAAC,CAAC,EAAU,QAAA;AAC1D,aAAA;AAAA,IAAA;AAGL,QAAAP,aAAa,OAAOC,aAAa,KAAK;AACxC,UAAID,EAAE,SAASC,EAAE,KAAa,QAAA;AAC9B,WAAKM,KAAKP,EAAE,QAAQ,EAAO,KAAA,CAACC,EAAE,IAAIM,EAAE,CAAC,CAAC,EAAU,QAAA;AAChD,WAAKA,KAAKP,EAAE,QAAW,EAAA,KAAI,CAACS,EAAUF,EAAE,CAAC,GAAGN,EAAE,IAAIM,EAAE,CAAC,CAAC,CAAC,EAAU,QAAA;AAC1D,aAAA;AAAA,IAAA;AAGL,QAAAP,aAAa,OAAOC,aAAa,KAAK;AACxC,UAAID,EAAE,SAASC,EAAE,KAAa,QAAA;AAC9B,WAAKM,KAAKP,EAAE,QAAQ,EAAO,KAAA,CAACC,EAAE,IAAIM,EAAE,CAAC,CAAC,EAAU,QAAA;AACzC,aAAA;AAAA,IAAA;AAGT,QAAI,YAAY,OAAOP,CAAC,KAAK,YAAY,OAAOC,CAAC,GAAG;AAE9C,UADJS,IAAUV,EAAU,QAChBU,KAAWT,EAAU,OAAe,QAAA;AACnC,WAAAM,IAAIG,GAAQH,QAAQ,IAAK,KAAKP,EAAUO,CAAC,MAAON,EAAUM,CAAC,EAAU,QAAA;AACnE,aAAA;AAAA,IAAA;AAGL,QAAAP,EAAE,gBAAgB,OAAe,QAAAA,EAAE,WAAWC,EAAE,UAAUD,EAAE,UAAUC,EAAE;AACxE,QAAAD,EAAE,YAAY,OAAO,UAAU,gBAAgBA,EAAE,QAAA,MAAcC,EAAE,QAAQ;AACzE,QAAAD,EAAE,aAAa,OAAO,UAAU,iBAAiBA,EAAE,SAAA,MAAeC,EAAE,SAAS;AAIjF,QAFOU,IAAA,OAAO,KAAKX,CAAC,GACpBU,IAASC,EAAK,QACVD,MAAW,OAAO,KAAKT,CAAC,EAAE,OAAe,QAAA;AAE7C,SAAKM,IAAIG,GAAQH,QAAQ,SAAS,CAAC,OAAO,UAAU,eAAe,KAAKN,GAAGU,EAAKJ,CAAC,CAAC,EAAU,QAAA;AAEvF,SAAAA,IAAIG,GAAQH,QAAQ,KAAK;AACxB,UAAAD,IAAMK,EAAKJ,CAAC;AAEZ,UAAA,CAACE,EAAUT,EAAEM,CAAG,GAAGL,EAAEK,CAAG,CAAC,EAAU,QAAA;AAAA,IAAA;AAGlC,WAAA;AAAA,EAAA;AAIF,SAAAN,MAAMA,KAAKC,MAAMA;AAC1B;AAmCgB,SAAAW,GAAiCD,GAAmBE,GAA6B;AAC/F,QAAMC,IAA8B,CAAC;AAErC,aAAWR,KAAOO;AAChB,IAAKF,EAAK,SAASL,CAAG,MACVQ,EAAAR,CAAG,IAAIO,EAAOP,CAAG;AAIxB,SAAAQ;AACT;AAMO,SAASC,GAAWC,GAAqB;AAC1C,SAAA,MAAM,QAAQA,CAAK,IACdA,IAEA,CAACA,CAAK;AAEjB;AAEO,SAASC,GAAYC,GAAW;AAC9B,SAAAA,EAAE,QAAQ,OAAO,CAACC,MAAMA,EAAE,CAAC,EAAE,aAAa;AACnD;AAKO,SAASC,GAAOJ,GAAe;AACpC,MAAIK,IAAM;AACV,WAASd,IAAI,GAAGA,IAAIS,EAAM,QAAQT;AAChC,IAAAc,KAAOA,IAAML,EAAM,WAAWT,CAAC,IAAI,MAAM;AAE3C,SAAO,mBAAmBc,CAAG;AAC/B;AASO,SAASC,GAAcC,GAA2C;AACvE,MAAIA,aAAmB;AACrB,WAAO,CAACP,MAAkBO,EAAQ,KAAKP,CAAK;AAG9C,QAAMQ,IAA+D;AAAA,IACnE,UAAU,CAAC;AAAA,IACX,UAAU,CAAA;AAAA,EACZ,GAEMC,IAAQF,EACX,MAAM,GAAG,EACT,IAAI,CAACG,MAAMA,EAAE,KAAM,CAAA,EACnB,OAAO,CAACA,MAAMA,MAAM,EAAE;AAEzB,WAASC,KAAQF,GAAO;AACtB,QAAIG,IAAmC;AAEnC,IAAAD,EAAK,WAAW,GAAG,MACXC,IAAA,YACHD,IAAAA,EAAK,MAAM,CAAC,IAGjBA,MAAS,MACFH,EAAAI,CAAO,EAAE,KAAK,WAAY;AAC1B,aAAA;AAAA,IAAA,CACR,IACQD,EAAK,SAAS,GAAG,IAC1BH,EAASI,CAAO,EAAE,KAAK,SAAUZ,GAAO;AAC/B,aAAAA,EAAM,WAAWW,EAAK,MAAM,GAAGA,EAAK,SAAS,CAAC,CAAC;AAAA,IAAA,CACvD,IAEDH,EAASI,CAAO,EAAE,KAAK,SAAUZ,GAAO;AACtC,aAAOA,MAAUW;AAAA,IAAA,CAClB;AAAA,EACH;AAGF,SAAO,SAAUE,GAAc;AACvB,UAAA,EAAE,UAAAC,GAAU,UAAAC,EAAA,IAAaP;AAQ3B,WALA,EAAAO,EAAS,KAAK,CAACC,MAAOA,EAAGH,CAAI,CAAC,KAK9BC,EAAS,SAAS,KAAK,CAACA,EAAS,KAAK,CAACE,MAAOA,EAAGH,CAAI,CAAC;AAAA,EAK5D;AACF;ACxOA,MAAMI,IAAsD,CAAC,GACvD,EAAE,MAAApE,GAAM,QAAAC,GAAQ,WAAAC,GAAW,YAAAC,GAAY,aAAAC,GAAa,eAAAC,GAAe,kBAAAC,EAAiB,IAAIV,EAAqB;AAAA,EACjH,OAAOyE,GAAmC;AACxC,WAAI,YAAYA,IACPC,EAAeD,CAAM,IAErBE,EAAaF,GAAQA,EAAO,KAAK;AAAA,EAE5C;AAAA,EACA,QAAAvE;AAAA,EACA,UAAU0E,GAA+C;AACvD,QAAI,YAAYA,GAAM;AACpB,UAAIlD,IAAWkD,EAAK;AACpB,UAAIlD,MAAa,QAAW;AAC1B,QAAAkD,EAAK,QAAQ;AACV;AACU,UAAAlD,IAAArB,EAAOqB,GAAUkD,CAAI;AAAA,eACzBlD,MAAa;AAAA,MAAA;AAAA,IACxB,MACF,CAAa,mBAAmBkD,KAC9BC,EAAQ,KAAKD,CAAI;AAAA,EACnB;AAEJ,CAAC;AAED,IAAIE,IAAa,GAEbC,IAAc,GACdC,IAAsB,GACtBC,GAEAC;AAMJ,SAASC,EAAcvE,GAA+B;AACpD,QAAMI,IAAUiE;AACJ,SAAAA,IAAArE,GACLI;AACT;AAEO,SAASoE,KAAyC;AAChD,SAAAF;AACT;AAEO,SAASG,GAAkBC,GAA8B;AAC9D,QAAMC,IAAcL;AACJ,SAAAA,IAAAI,GACTC;AACT;AAkCA,SAASb,EAAec,GAAsB;AACtC,QAAAxE,IAAUmE,EAAcK,CAAC;AAC/B,EAAA/E,EAAc+E,CAAC;AACX,MAAA;AACF,UAAMC,IAAWD,EAAE,OACbE,IAAkC,EAAE,OAAOF,EAAE,MAAM;AAElD,WAAA,CAACA,EAAE,OAAOC,GAAWD,EAAE,QAAQA,EAAE,OAAO,KAAKE,CAAK,CAAE;AAAA,EAAA,UAC3D;AACA,IAAAP,EAAcnE,CAAO,GACrBR,EAAYgF,CAAC;AAAA,EAAA;AAEjB;AAEA,SAASb,EAAalB,GAAUF,GAAqB;AACnD,SAAAE,EAAE,QAAQ,GAEH,CAACA,EAAE,OAAOA,EAAE,eAAgBA,EAAE,gBAAgBF,CAAM;AAC7D;AAEA,SAASrD,EAAO,GAAyB;AACvC,QAAMqB,IAAQ,EAAE;AACZ,MAAA,EAAEA,IAAQ,KAAqB;AACjC,MAAE,QAAQA,IAAQ;AAClB,UAAMO,IAAO,EAAE;AACf,IAAIA,MAAS,SACX5B,EAAO4B,EAAK,GAA2B,IAEvC0C,EAAcQ,GAAqB,IAAI;AAAA,EACzC;AAEJ;AAEA,SAASW,EAAI,GAAyBpE,GAA4B;AAE9D,MAAAA,IAAS,MACRA,IAAS,MAAuChB,EAAW,EAAE,MAAO,CAAC,GACtE;AACM,UAAAqF,IAAOT,EAAc,CAAC;AAC5B,IAAA1E,EAAc,CAAC;AACX,QAAA;AACF,MAAI,aAAa,KAAK,EAAE,YAAY,UAClC,EAAE,QAAQ;AAEN,YAAAoF,IAAU,EAAa,GAAG;AAChC,MAAI,aAAa,KAAK9C,EAAW8C,CAAM,MACrC,EAAE,UAAUA;AAAA,IACd,UACA;AACA,MAAAV,EAAcS,CAAI,GAClBpF,EAAY,CAAC;AAAA,IAAA;AAEf;AAAA,EAAA,MACF,CAAWe,IAAS,OAChB,EAAA,QAAQA,IAAQ;AAEpB,MAAInB,IAAO,EAAE;AACb,SAAOA,MAAS,UAAW;AACzB,UAAMO,IAAMP,EAAK,KACXwB,IAAWjB,EAAI;AACrB,IAAIiB,IAAW,MACb+D;AAAA,MAAIhF;AAAA,MAAMA,EAAI,QAAQiB,IAAW;AAAA;AAAA,IAAoB,GAEvDxB,IAAOA,EAAK;AAAA,EAAA;AAEhB;AAEA,SAAS0F,IAAc;AACrB,SAAOf,IAAcC,KAAqB;AAClCe,UAAAA,IAASvB,EAAcO,CAAW;AACxC,IAAAP,EAAcO,GAAa,IAAI,QAC/BY;AAAA,MAAII;AAAAA,MAASA,EAAO,SAAS;AAAA;AAAA,IAAoB;AAAA,EAAA;AAErC,EAAAhB,IAAA,GACQC,IAAA;AACxB;AAEA,SAASgB,IAAmC;AAC1C,QAAMzE,IAAQ,KAAK;AAEjB,MAAAA,IAAS,MACRA,IAAS,MAAuChB,EAAW,KAAK,MAAO,IAAI;AAExE,QAAAmE,EAAe,IAAI,GAAG;AACxB,YAAM5C,IAAO,KAAK;AAClB,MAAIA,MAAS,UACXpB,EAAiBoB,CAAI;AAAA,IACvB;AAAA,QAEJ,CAAWP,IAAS,OACb,KAAA,QAAQA,IAAQ;AAEvB,SAAI0D,MAAc,UAChB7E,EAAK,MAAM6E,CAAS,GAIf,KAAK;AACd;AAEA,SAASgB,KAA8B1C,GAAsB;AAC3D,MAAIA,EAAM,QAAQ;AACZ,QAAA2C,IAAW3C,EAAM,CAAC;AAItB,QAHIR,EAAWmD,CAAQ,MACrBA,IAAWC,EAAID,EAAS,KAAK,KAAK,CAAC,IAEjC,CAAC,KAAK,OAAO,KAAK,OAAOA,CAAQ,GAAG;AACtC,WAAK,QAAQA,GACb,KAAK,QAAQ;AACb,YAAMpE,IAAO,KAAK;AAClB,MAAIA,MAAS,WACXxB,EAAUwB,CAAI,GACTgD,KACGgB,EAAA;AAAA,IAEV;AAAA,EACF,OACK;AACL,UAAMvC,IAAQ,KAAK;AACf,QAAA,KAAK,QAAS,MACZoB,EAAa,MAAMpB,CAAK,GAAG;AAC7B,YAAMzB,IAAO,KAAK;AAClB,MAAIA,MAAS,UACXpB,EAAiBoB,CAAI;AAAA,IACvB;AAGJ,WAAImD,MAAc,UAChB7E,EAAK,MAAM6E,CAAS,GAEf1B;AAAAA,EAAA;AAEX;AAEA,SAASsB,IAA0C;AACjD,MAAIlE,IAAM,KAAK;AACf,SAAOA,MAAQ;AACP,IAAAA,IAAAN,EAAOM,GAAK,IAAI;AAExB,QAAMC,IAAM,KAAK;AACjB,EAAIA,MAAQ,UACVP,EAAOO,CAAG,GAEZ,KAAK,QAAQ,GAET,aAAa,QAAQ,KAAK,WAAW,QACvC,KAAK,QAAQ;AAEjB;AAuCO,SAASwF,GAAM7B,GAAgB;AAClC,IAAAO,GACCP,EAAA,GACE,EAAEO,KAAkBgB,EAAA;AAC3B;AAKO,SAASO,GAAa9C,GAA0B;AACjD,MAAAR,EAAWQ,CAAK,GAAG;AACjB,QAAAsC;AACE,UAAAS,IAAYnB,EAAc,MAAS;AACzC,WAAAU,IAAStC,EAAM,GACf4B,EAAcmB,CAAS,GAChBT;AAAA,EAAA;AAEA,WAAAtC;AAEX;AAKO,SAAS4C,EAAO5C,GAAuB;AACxC,SAAAR,EAAWQ,CAAK,IACVA,EAAkB,IAEnBA;AAEX;AAgBO,SAASwC,GAAOxB,GAA6B;;AAClD,QAAMgC,IAAY;AAAA,IAChB,IAAAhC;AAAA,IACA,MAAM;AAAA,IACN,UAAU;AAAA,IACV,MAAM;AAAA,IACN,UAAU;AAAA,IACV,OAAO;AAAA,EACT;AACA,EAAIU,MAAc,UAChB7E,EAAKmG,GAAGtB,CAAS;AAIb,QAAAW,IAAOT,EAAcoB,CAAC;AACxB,MAAA;AACF,KAAAC,IAAAD,EAAE,YAAF,QAAAC,EAAA,KAAAD;AACM,UAAAV,IAASU,EAAE,GAAG;AACpB,IAAAA,EAAE,UAAUxD,EAAW8C,CAAM,IAAIA,IAAS;AAAA,EAAA,UAC1C;AACA,IAAAV,EAAcS,CAAI;AAAA,EAAA;AAEb,SAAAf,EAAQ,KAAK0B,CAAC;AACvB;AAOgB,SAAAE,GAAKC,GAAmDC,GAA4B;AAC9F,SAAA5D,EAAW2D,CAAI,IACVV,EAAU,KAAK;AAAA,IACpB,OAAO;AAAA,IACP,MAAM;AAAA,IACN,UAAU;AAAA,IACV,MAAM;AAAA,IACN,UAAU;AAAA,IACV,OAAO;AAAA,IACP,QAAQ,WAA0C;AAChD,aAAOG,EAAIO,EAAK,KAAK,IAAI,CAAC;AAAA,IAC5B;AAAA,IACA,SAASC,KAAA,gBAAAA,EAAS,WAAkCrE;AAAA,EAAA,CACrD,IAEM2D,EAAQ,KAAK;AAAA,IAClB,eAAeS;AAAA,IACf,OAAOA;AAAA,IACP,SAASC,KAAA,gBAAAA,EAAS,WAAkCrE;AAAA,IACpD,MAAM;AAAA,IACN,UAAU;AAAA,IACV,OAAO;AAAA,EAAA,CACR;AAEL;","x_google_ignoreList":[0]}

package/dist/typeChecking-CbltMOUt.js

@@ -0,0 +1,71 @@
+function o(r) {
+  const t = typeof r;
+  switch (t) {
+    case "undefined":
+      return t;
+    case "number":
+      return isNaN(r) ? "NaN" : t;
+    case "function":
+      return /^\s*class\s+/.test(r.toString()) ? "class" : t;
+    case "object":
+      return r === null ? "null" : r instanceof Promise ? "promise" : r instanceof Map ? "map" : r instanceof Set ? "set" : Array.isArray(r) ? "array" : t;
+    default:
+      return t;
+  }
+}
+function c(r) {
+  return Array.isArray(r);
+}
+function u(r, t) {
+  return c(t) && t.every((n) => r(n));
+}
+function y(r, t, n) {
+  if (u(r, t))
+    return !0;
+  throw new TypeError(i(t, n));
+}
+function f(r) {
+  return typeof r == "string";
+}
+function p(r, t) {
+  if (f(r))
+    return !0;
+  throw new TypeError(i(r, t ?? "Expected a string. Got type: %t, value: %v"));
+}
+function w(r) {
+  return o(r) === "function";
+}
+function A(...r) {
+  const t = r[0], n = f(r[2]) ? r[2] : `Expected instance of ${t.name}. Got type: %t, value: %v`, s = (e) => {
+    if (e instanceof t)
+      return !0;
+    throw new TypeError(i(e, n));
+  };
+  return r.length < 2 ? s : s(r[1]);
+}
+function a(r) {
+  return r != null && typeof r == "object" && !c(r);
+}
+function g(r, t) {
+  if (a(r))
+    return !0;
+  throw new TypeError(i(r, t));
+}
+function i(r, t) {
+  var e;
+  const n = o(r), s = ((e = r == null ? void 0 : r.toString) == null ? void 0 : e.call(r)) || String(r);
+  return t.replaceAll("%t", n).replaceAll("%v", s);
+}
+export {
+  A as a,
+  f as b,
+  w as c,
+  y as d,
+  p as e,
+  g as f,
+  c as g,
+  u as h,
+  a as i,
+  o as t
+};
+//# sourceMappingURL=typeChecking-CbltMOUt.js.map

package/dist/typeChecking-CbltMOUt.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"typeChecking-CbltMOUt.js","sources":["../src/typeChecking.ts"],"sourcesContent":["type TypeNames =\n  // These values can be returned by `typeof`.\n  | \"string\"\n  | \"number\"\n  | \"bigint\"\n  | \"boolean\"\n  | \"symbol\"\n  | \"undefined\"\n  | \"object\"\n  | \"function\"\n  // These values are more specific ones that the `typeOf` function can return.\n  | \"null\"\n  | \"array\"\n  | \"class\"\n  | \"promise\"\n  | \"map\"\n  | \"set\"\n  | \"NaN\";\n\n/**\n * Extends `typeof` operator with more specific and useful type distinctions.\n */\nexport function typeOf(value: any): TypeNames {\n  const type = typeof value;\n  switch (type) {\n    case \"undefined\":\n      return type;\n    case \"number\":\n      if (isNaN(value as any)) return \"NaN\";\n      return type;\n    case \"function\":\n      if (/^\\s*class\\s+/.test(value.toString())) return \"class\";\n      return type;\n    case \"object\":\n      if (value === null) return \"null\";\n      if (value instanceof Promise) return \"promise\";\n      if (value instanceof Map) return \"map\";\n      if (value instanceof Set) return \"set\";\n      if (Array.isArray(value)) return \"array\";\n      return type;\n    default:\n      return type;\n  }\n}\n\n/**\n * Throws a TypeError unless `condition` is truthy.\n *\n * @param condition - Value whose truthiness is in question.\n * @param errorMessage - Optional message for the thrown TypeError.\n */\nexport function assert(condition: any, errorMessage?: string): void {\n  if (!condition) {\n    throw new TypeError(\n      formatError(condition, errorMessage || \"Failed assertion. Value is not truthy. Got type: %t, value: %v\"),\n    );\n  }\n}\n\n/**\n * Returns true if `value` is an array.\n */\nexport function isArray(value: unknown): value is Array<unknown> {\n  return Array.isArray(value);\n}\n\n/**\n * Throws an error if `value` is not an array.\n */\nexport function assertArray(value: unknown, errorMessage?: string): value is Array<unknown> {\n  if (isArray(value)) {\n    return true;\n  }\n\n  throw new TypeError(formatError(value, errorMessage || \"Expected array. Got type: %t, value: %v\"));\n}\n\n/**\n * Returns true when `value` is an array and `check` returns true for every item.\n *\n * @param check - Function to check items against.\n * @param value - A possible array.\n */\n\nexport function isArrayOf<T>(check: (item: unknown) => boolean, value: unknown): value is T[] {\n  return isArray(value) && value.every((item) => check(item));\n}\n\n/**\n * Throws a TypeError unless `value` is an array and `check` returns true for every item.\n *\n * @param check - Function to check items against.\n * @param value - A possible array.\n * @param errorMessage - A custom error message.\n */\nexport function assertArrayOf<T>(\n  check: (item: unknown) => boolean,\n  value: unknown,\n  errorMessage?: string,\n): value is T[] {\n  if (isArrayOf(check, value)) {\n    return true;\n  }\n\n  throw new TypeError(formatError(value, errorMessage ?? \"Expected an array of valid items. Got type: %t, value: %v\"));\n}\n\n/**\n * Returns true if `value` is a string.\n */\nexport function isString(value: unknown): value is string {\n  return typeof value === \"string\";\n}\n\n/**\n * Throws a TypeError unless `value` is a string.\n */\nexport function assertString(value: unknown, errorMessage?: string): value is string {\n  if (isString(value)) {\n    return true;\n  }\n\n  throw new TypeError(formatError(value, errorMessage ?? \"Expected a string. Got type: %t, value: %v\"));\n}\n\n// TODO: More specific validation for common types of strings? Email address, URL, UUID, etc?\n\n/**\n * Returns true if `value` is a function (but not a class).\n */\nexport function isFunction<T = (...args: unknown[]) => unknown>(value: unknown): value is T {\n  return typeOf(value) === \"function\";\n}\n\n/**\n * Throws a TypeError unless `value` is a function.\n */\nexport function assertFunction<T = (...args: unknown[]) => unknown>(value: unknown, errorMessage?: string): value is T {\n  if (isFunction(value)) {\n    return true;\n  }\n\n  throw new TypeError(formatError(value, errorMessage ?? \"Expected a function. Got type: %t, value: %v\"));\n}\n\n/**\n * Returns true if `value` is a number.\n */\nexport function isNumber(value: unknown): value is number {\n  return typeof value === \"number\" && !isNaN(value);\n}\n\n/**\n * Throws a TypeError unless `value` is a number.\n */\nexport function assertNumber(value: unknown, errorMessage?: string): value is number {\n  if (isNumber(value)) {\n    return true;\n  }\n\n  throw new TypeError(formatError(value, errorMessage ?? \"Expected a number. Got type: %t, value: %v\"));\n}\n\n/**\n * Returns a function that takes a `value` and returns true if `value` is an instance of `constructor`.\n *\n * @param constructor - The constructor a value must be an instance of to match.\n */\nexport function isInstanceOf<T extends Function>(constructor: T): (value: unknown) => value is T;\n\n/**\n * Returns `true` if `value` is an instance of `constructor`.\n *\n * @param constructor - The constructor `value` must be an instance of.\n * @param value - A value that may be an instance of `constructor`.\n */\nexport function isInstanceOf<T extends Function>(constructor: T, value: unknown): value is T;\n\nexport function isInstanceOf<T extends Function>(...args: unknown[]) {\n  const constructor = args[0] as T;\n\n  const test = (value: unknown): value is T => {\n    return value instanceof constructor;\n  };\n\n  if (args.length < 2) {\n    return test;\n  } else {\n    return test(args[1]);\n  }\n}\n\n/**\n * Returns a function that takes a `value` and throws a TypeError unless `value` is an instance of `constructor`.\n *\n * @param constructor - The constructor a value must be an instance of to match.\n */\nexport function assertInstanceOf<T extends Function>(constructor: T): (value: unknown) => value is T;\n\n/**\n * Throws a TypeError unless `value` is an instance of `constructor`.\n *\n * @param constructor - The constructor `value` must be an instance of.\n * @param value - A value that may be an instance of `constructor`.\n * @param errorMessage - A custom error message for when the assertion fails.\n */\nexport function assertInstanceOf<T extends Function>(constructor: T, value: unknown, errorMessage?: string): value is T;\n\nexport function assertInstanceOf<T extends Function>(...args: unknown[]) {\n  const constructor = args[0] as T;\n  const errorMessage = isString(args[2])\n    ? args[2]\n    : `Expected instance of ${constructor.name}. Got type: %t, value: %v`;\n\n  const test = (value: unknown): value is T => {\n    if (value instanceof constructor) {\n      return true;\n    }\n\n    throw new TypeError(formatError(value, errorMessage));\n  };\n\n  if (args.length < 2) {\n    return test;\n  } else {\n    return test(args[1]);\n  }\n}\n\n/**\n * Returns true if `value` is a plain JavaScript object.\n */\nexport function isObject(value: unknown): value is Record<string | number | symbol, unknown> {\n  return value != null && typeof value === \"object\" && !isArray(value);\n}\n\n/**\n * Throws a TypeError unless `value` is a plain JavaScript object.\n */\nexport function assertObject(value: unknown, errorMessage?: string): value is object {\n  if (isObject(value)) {\n    return true;\n  }\n\n  throw new TypeError(formatError(value, errorMessage ?? \"Expected an object. Got type: %t, value: %v\"));\n}\n\n/**\n * Replaces `%t` and `%v` placeholders in a message with real values.\n */\nfunction formatError(value: unknown, message: string) {\n  const typeName = typeOf(value);\n\n  // TODO: Pretty format value as string based on type.\n  const valueString = value?.toString?.() || String(value);\n\n  return message.replaceAll(\"%t\", typeName).replaceAll(\"%v\", valueString);\n}\n"],"names":["typeOf","value","type","isArray","isArrayOf","check","item","assertArrayOf","errorMessage","formatError","isString","assertString","isFunction","assertInstanceOf","args","constructor","test","isObject","assertObject","message","_a","typeName","valueString"],"mappings":"AAsBO,SAASA,EAAOC,GAAuB;AAC5C,QAAMC,IAAO,OAAOD;AACpB,UAAQC,GAAM;AAAA,IACZ,KAAK;AACI,aAAAA;AAAA,IACT,KAAK;AACC,aAAA,MAAMD,CAAY,IAAU,QACzBC;AAAA,IACT,KAAK;AACH,aAAI,eAAe,KAAKD,EAAM,SAAU,CAAA,IAAU,UAC3CC;AAAA,IACT,KAAK;AACC,aAAAD,MAAU,OAAa,SACvBA,aAAiB,UAAgB,YACjCA,aAAiB,MAAY,QAC7BA,aAAiB,MAAY,QAC7B,MAAM,QAAQA,CAAK,IAAU,UAC1BC;AAAA,IACT;AACS,aAAAA;AAAA,EAAA;AAEb;AAmBO,SAASC,EAAQF,GAAyC;AACxD,SAAA,MAAM,QAAQA,CAAK;AAC5B;AAoBgB,SAAAG,EAAaC,GAAmCJ,GAA8B;AACrF,SAAAE,EAAQF,CAAK,KAAKA,EAAM,MAAM,CAACK,MAASD,EAAMC,CAAI,CAAC;AAC5D;AASgB,SAAAC,EACdF,GACAJ,GACAO,GACc;AACV,MAAAJ,EAAUC,GAAOJ,CAAK;AACjB,WAAA;AAGT,QAAM,IAAI,UAAUQ,EAAYR,GAAOO,CAA2E,CAAC;AACrH;AAKO,SAASE,EAAST,GAAiC;AACxD,SAAO,OAAOA,KAAU;AAC1B;AAKgB,SAAAU,EAAaV,GAAgBO,GAAwC;AAC/E,MAAAE,EAAST,CAAK;AACT,WAAA;AAGT,QAAM,IAAI,UAAUQ,EAAYR,GAAOO,KAAgB,4CAA4C,CAAC;AACtG;AAOO,SAASI,EAAgDX,GAA4B;AACnF,SAAAD,EAAOC,CAAK,MAAM;AAC3B;AA4EO,SAASY,KAAwCC,GAAiB;AACjE,QAAAC,IAAcD,EAAK,CAAC,GACpBN,IAAeE,EAASI,EAAK,CAAC,CAAC,IACjCA,EAAK,CAAC,IACN,wBAAwBC,EAAY,IAAI,6BAEtCC,IAAO,CAACf,MAA+B;AAC3C,QAAIA,aAAiBc;AACZ,aAAA;AAGT,UAAM,IAAI,UAAUN,EAAYR,GAAOO,CAAY,CAAC;AAAA,EACtD;AAEI,SAAAM,EAAK,SAAS,IACTE,IAEAA,EAAKF,EAAK,CAAC,CAAC;AAEvB;AAKO,SAASG,EAAShB,GAAoE;AAC3F,SAAOA,KAAS,QAAQ,OAAOA,KAAU,YAAY,CAACE,EAAQF,CAAK;AACrE;AAKgB,SAAAiB,EAAajB,GAAgBO,GAAwC;AAC/E,MAAAS,EAAShB,CAAK;AACT,WAAA;AAGT,QAAM,IAAI,UAAUQ,EAAYR,GAAOO,CAA6D,CAAC;AACvG;AAKA,SAASC,EAAYR,GAAgBkB,GAAiB;AApO/C,MAAAC;AAqOC,QAAAC,IAAWrB,EAAOC,CAAK,GAGvBqB,MAAcF,IAAAnB,KAAA,gBAAAA,EAAO,aAAP,gBAAAmB,EAAA,KAAAnB,OAAuB,OAAOA,CAAK;AAEvD,SAAOkB,EAAQ,WAAW,MAAME,CAAQ,EAAE,WAAW,MAAMC,CAAW;AACxE;"}