@manyducks.co/dolla 2.0.0-alpha.4 → 2.0.0-alpha.40

package/dist/markup-DIfh0nwz.js

@@ -0,0 +1,1442 @@
+var Ee = Object.defineProperty;
+var Q = (t) => {
+  throw TypeError(t);
+};
+var Se = (t, e, n) => e in t ? Ee(t, e, { enumerable: !0, configurable: !0, writable: !0, value: n }) : t[e] = n;
+var f = (t, e, n) => Se(t, typeof e != "symbol" ? e + "" : e, n), ee = (t, e, n) => e.has(t) || Q("Cannot " + n);
+var k = (t, e, n) => (ee(t, e, "read from private field"), n ? n.call(t) : e.get(t)), _ = (t, e, n) => e.has(t) ? Q("Cannot add the same private member more than once") : e instanceof WeakSet ? e.add(t) : e.set(t, n), U = (t, e, n, s) => (ee(t, e, "write to private field"), s ? s.call(t, n) : e.set(t, n), n);
+var S = /* @__PURE__ */ ((t) => (t[t.Computed = 1] = "Computed", t[t.Effect = 2] = "Effect", t[t.Tracking = 4] = "Tracking", t[t.Notified = 8] = "Notified", t[t.Recursed = 16] = "Recursed", t[t.Dirty = 32] = "Dirty", t[t.PendingComputed = 64] = "PendingComputed", t[t.PendingEffect = 128] = "PendingEffect", t[t.Propagated = 224] = "Propagated", t))(S || {});
+function fe({
+  updateComputed: t,
+  notifyEffect: e
+}) {
+  let n, s;
+  return {
+    /**
+     * Links a given dependency and subscriber if they are not already linked.
+     * 
+     * @param dep - The dependency to be linked.
+     * @param sub - The subscriber that depends on this dependency.
+     * @returns The newly created link object if the two are not already linked; otherwise `undefined`.
+     */
+    link(r, u) {
+      const c = u.depsTail;
+      if (c !== void 0 && c.dep === r)
+        return;
+      const d = c !== void 0 ? c.nextDep : u.deps;
+      if (d !== void 0 && d.dep === r) {
+        u.depsTail = d;
+        return;
+      }
+      const h = r.subsTail;
+      if (!(h !== void 0 && h.sub === u && a(h, u)))
+        return i(r, u, d, c);
+    },
+    /**
+     * Traverses and marks subscribers starting from the provided link.
+     * 
+     * It sets flags (e.g., Dirty, PendingComputed, PendingEffect) on each subscriber
+     * to indicate which ones require re-computation or effect processing. 
+     * This function should be called after a signal's value changes.
+     * 
+     * @param link - The starting link from which propagation begins.
+     */
+    propagate(r) {
+      let u = 32, c = r, d = 0;
+      e: do {
+        const h = r.sub, p = h.flags;
+        if (!(p & 244) && (h.flags = p | u | 8, !0) || p & 16 && !(p & 4) && (h.flags = p & -17 | u | 8, !0) || !(p & 224) && a(r, h) && (h.flags = p | 16 | u | 8, h.subs !== void 0)) {
+          const x = h.subs;
+          if (x !== void 0) {
+            x.nextSub !== void 0 ? (x.prevSub = c, r = c = x, u = 64, ++d) : (r = x, u = p & 2 ? 128 : 64);
+            continue;
+          }
+          p & 2 && (s !== void 0 ? s.depsTail.nextDep = h.deps : n = h, s = h);
+        } else p & (4 | u) ? !(p & u) && p & 224 && a(r, h) && (h.flags = p | u) : (h.flags = p | u | 8, (p & 10) === 2 && (s !== void 0 ? s.depsTail.nextDep = h.deps : n = h, s = h));
+        if ((r = c.nextSub) !== void 0) {
+          c = r, u = d ? 64 : 32;
+          continue;
+        }
+        for (; d; ) {
+          --d;
+          const J = c.dep.subs;
+          if (c = J.prevSub, J.prevSub = void 0, (r = c.nextSub) !== void 0) {
+            c = r, u = d ? 64 : 32;
+            continue e;
+          }
+        }
+        break;
+      } while (!0);
+    },
+    /**
+     * Prepares the given subscriber to track new dependencies.
+     * 
+     * It resets the subscriber's internal pointers (e.g., depsTail) and
+     * sets its flags to indicate it is now tracking dependency links.
+     * 
+     * @param sub - The subscriber to start tracking.
+     */
+    startTracking(r) {
+      r.depsTail = void 0, r.flags = r.flags & -249 | 4;
+    },
+    /**
+     * Concludes tracking of dependencies for the specified subscriber.
+     * 
+     * It clears or unlinks any tracked dependency information, then
+     * updates the subscriber's flags to indicate tracking is complete.
+     * 
+     * @param sub - The subscriber whose tracking is ending.
+     */
+    endTracking(r) {
+      const u = r.depsTail;
+      if (u !== void 0) {
+        const c = u.nextDep;
+        c !== void 0 && (m(c), u.nextDep = void 0);
+      } else r.deps !== void 0 && (m(r.deps), r.deps = void 0);
+      r.flags &= -5;
+    },
+    /**
+     * Updates the dirty flag for the given subscriber based on its dependencies.
+     * 
+     * If the subscriber has any pending computeds, this function sets the Dirty flag
+     * and returns `true`. Otherwise, it clears the PendingComputed flag and returns `false`.
+     * 
+     * @param sub - The subscriber to update.
+     * @param flags - The current flag set for this subscriber.
+     * @returns `true` if the subscriber is marked as Dirty; otherwise `false`.
+     */
+    updateDirtyFlag(r, u) {
+      return o(r.deps) ? (r.flags = u | 32, !0) : (r.flags = u & -65, !1);
+    },
+    /**
+     * Updates the computed subscriber if necessary before its value is accessed.
+     * 
+     * If the subscriber is marked Dirty or PendingComputed, this function runs
+     * the provided updateComputed logic and triggers a shallowPropagate for any
+     * downstream subscribers if an actual update occurs.
+     * 
+     * @param computed - The computed subscriber to update.
+     * @param flags - The current flag set for this subscriber.
+     */
+    processComputedUpdate(r, u) {
+      if ((u & 32 || (o(r.deps) || (r.flags = u & -65, !1))) && t(r)) {
+        const c = r.subs;
+        c !== void 0 && l(c);
+      }
+    },
+    /**
+     * Ensures all pending internal effects for the given subscriber are processed.
+     * 
+     * This should be called after an effect decides not to re-run itself but may still
+     * have dependencies flagged with PendingEffect. If the subscriber is flagged with
+     * PendingEffect, this function clears that flag and invokes `notifyEffect` on any
+     * related dependencies marked as Effect and Propagated, processing pending effects.
+     * 
+     * @param sub - The subscriber which may have pending effects.
+     * @param flags - The current flags on the subscriber to check.
+     */
+    processPendingInnerEffects(r, u) {
+      if (u & 128) {
+        r.flags = u & -129;
+        let c = r.deps;
+        do {
+          const d = c.dep;
+          "flags" in d && d.flags & 2 && d.flags & 224 && e(d), c = c.nextDep;
+        } while (c !== void 0);
+      }
+    },
+    /**
+     * Processes queued effect notifications after a batch operation finishes.
+     * 
+     * Iterates through all queued effects, calling notifyEffect on each.
+     * If an effect remains partially handled, its flags are updated, and future
+     * notifications may be triggered until fully handled.
+     */
+    processEffectNotifications() {
+      for (; n !== void 0; ) {
+        const r = n, u = r.depsTail, c = u.nextDep;
+        c !== void 0 ? (u.nextDep = void 0, n = c.sub) : (n = void 0, s = void 0), e(r) || (r.flags &= -9);
+      }
+    }
+  };
+  function i(r, u, c, d) {
+    const h = {
+      dep: r,
+      sub: u,
+      nextDep: c,
+      prevSub: void 0,
+      nextSub: void 0
+    };
+    if (d === void 0 ? u.deps = h : d.nextDep = h, r.subs === void 0)
+      r.subs = h;
+    else {
+      const p = r.subsTail;
+      h.prevSub = p, p.nextSub = h;
+    }
+    return u.depsTail = h, r.subsTail = h, h;
+  }
+  function o(r) {
+    let u = 0, c;
+    e: do {
+      c = !1;
+      const d = r.dep;
+      if ("flags" in d) {
+        const h = d.flags;
+        if ((h & 33) === 33) {
+          if (t(d)) {
+            const p = d.subs;
+            p.nextSub !== void 0 && l(p), c = !0;
+          }
+        } else if ((h & 65) === 65) {
+          const p = d.subs;
+          p.nextSub !== void 0 && (p.prevSub = r), r = d.deps, ++u;
+          continue;
+        }
+      }
+      if (!c && r.nextDep !== void 0) {
+        r = r.nextDep;
+        continue;
+      }
+      if (u) {
+        let h = r.sub;
+        do {
+          --u;
+          const p = h.subs;
+          if (c) {
+            if (t(h)) {
+              (r = p.prevSub) !== void 0 ? (p.prevSub = void 0, l(h.subs), h = r.sub) : h = p.sub;
+              continue;
+            }
+          } else
+            h.flags &= -65;
+          if ((r = p.prevSub) !== void 0) {
+            if (p.prevSub = void 0, r.nextDep !== void 0) {
+              r = r.nextDep;
+              continue e;
+            }
+            h = r.sub;
+          } else {
+            if ((r = p.nextDep) !== void 0)
+              continue e;
+            h = p.sub;
+          }
+          c = !1;
+        } while (u);
+      }
+      return c;
+    } while (!0);
+  }
+  function l(r) {
+    do {
+      const u = r.sub, c = u.flags;
+      (c & 96) === 64 && (u.flags = c | 32 | 8, (c & 10) === 2 && (s !== void 0 ? s.depsTail.nextDep = u.deps : n = u, s = u)), r = r.nextSub;
+    } while (r !== void 0);
+  }
+  function a(r, u) {
+    const c = u.depsTail;
+    if (c !== void 0) {
+      let d = u.deps;
+      do {
+        if (d === r)
+          return !0;
+        if (d === c)
+          break;
+        d = d.nextDep;
+      } while (d !== void 0);
+    }
+    return !1;
+  }
+  function m(r) {
+    do {
+      const u = r.dep, c = r.nextDep, d = r.nextSub, h = r.prevSub;
+      if (d !== void 0 ? d.prevSub = h : u.subsTail = h, h !== void 0 ? h.nextSub = d : u.subs = d, u.subs === void 0 && "deps" in u) {
+        const p = u.flags;
+        p & 32 || (u.flags = p | 32);
+        const x = u.deps;
+        if (x !== void 0) {
+          r = x, u.depsTail.nextDep = c, u.deps = void 0, u.depsTail = void 0;
+          continue;
+        }
+      }
+      r = c;
+    } while (r !== void 0);
+  }
+}
+var {
+  link: Qe,
+  propagate: et,
+  updateDirtyFlag: Ne,
+  startTracking: ae,
+  endTracking: he,
+  processEffectNotifications: tt,
+  processComputedUpdate: nt,
+  processPendingInnerEffects: de
+} = fe({
+  updateComputed(t) {
+    ae(t);
+    try {
+      const e = t.currentValue, n = t.getter(e);
+      return e !== n ? (t.currentValue = n, !0) : !1;
+    } finally {
+      he(t);
+    }
+  },
+  notifyEffect(t) {
+    return "isScope" in t ? Ce(t) : ke(t);
+  }
+});
+function Te(t) {
+  ae(t);
+  try {
+    t.fn();
+  } finally {
+    he(t);
+  }
+}
+function ke(t) {
+  const e = t.flags;
+  return e & 32 || e & 64 && Ne(t, e) ? Te(t) : de(t, t.flags), !0;
+}
+function Ce(t) {
+  return t.flags & 128 ? (de(t, t.flags), !0) : !1;
+}
+function L(t) {
+  const e = typeof t;
+  switch (e) {
+    case "undefined":
+      return e;
+    case "number":
+      return isNaN(t) ? "NaN" : e;
+    case "function":
+      return /^\s*class\s+/.test(t.toString()) ? "class" : e;
+    case "object":
+      return t === null ? "null" : t instanceof Promise ? "promise" : t instanceof Map ? "map" : t instanceof Set ? "set" : Array.isArray(t) ? "array" : e;
+    default:
+      return e;
+  }
+}
+function P(t) {
+  return Array.isArray(t);
+}
+function F(t, e) {
+  return P(e) && e.every((n) => t(n));
+}
+function st(t, e, n) {
+  if (F(t, e))
+    return !0;
+  throw new TypeError(V(e, n));
+}
+function D(t) {
+  return typeof t == "string";
+}
+function it(t, e) {
+  if (D(t))
+    return !0;
+  throw new TypeError(V(t, e ?? "Expected a string. Got type: %t, value: %v"));
+}
+function E(t) {
+  return L(t) === "function";
+}
+function Le(t) {
+  return typeof t == "number" && !isNaN(t);
+}
+function rt(...t) {
+  const e = t[0], n = D(t[2]) ? t[2] : `Expected instance of ${e.name}. Got type: %t, value: %v`, s = (i) => {
+    if (i instanceof e)
+      return !0;
+    throw new TypeError(V(i, n));
+  };
+  return t.length < 2 ? s : s(t[1]);
+}
+function W(t) {
+  return t != null && typeof t == "object" && !P(t);
+}
+function ot(t, e) {
+  if (W(t))
+    return !0;
+  throw new TypeError(V(t, e));
+}
+function V(t, e) {
+  var i;
+  const n = L(t), s = ((i = t == null ? void 0 : t.toString) == null ? void 0 : i.call(t)) || String(t);
+  return e.replaceAll("%t", n).replaceAll("%v", s);
+}
+const q = Symbol("dependency"), {
+  link: pe,
+  propagate: De,
+  updateDirtyFlag: Ae,
+  startTracking: Z,
+  endTracking: H,
+  processEffectNotifications: Pe,
+  processComputedUpdate: Oe,
+  processPendingInnerEffects: $e
+} = fe({
+  updateComputed(t) {
+    const e = w;
+    w = t, Z(t);
+    try {
+      const n = t.currentValue, s = t.getter(n);
+      return t.equals(n, s) ? !1 : (t.currentValue = s, !0);
+    } finally {
+      w = e, H(t);
+    }
+  },
+  notifyEffect(t) {
+    const e = t.flags;
+    return e & S.Dirty || e & S.PendingComputed && Ae(t, e) ? me(t) : $e(t, t.flags), !0;
+  }
+});
+let w;
+const C = [];
+let z = !1;
+function Ie() {
+  z || (z = !0, queueMicrotask(() => {
+    z = !1;
+    for (let t = 0; t < C.length; t++) {
+      const e = C[t], n = w;
+      w = e, Z(e);
+      try {
+        e.fn();
+      } finally {
+        w = n, H(e);
+      }
+    }
+    C.length = 0;
+  }));
+}
+function me(t) {
+  C.push(t), Ie();
+}
+function je() {
+  Z(this), H(this), queueMicrotask(() => {
+    C.splice(C.indexOf(this), 1);
+  });
+}
+var M, A;
+class Ve {
+  constructor(e, n) {
+    _(this, M);
+    _(this, A);
+    f(this, "name");
+    U(this, M, e), U(this, A, (n == null ? void 0 : n.equals) ?? Object.is), n != null && n.name && (this.name = n.name), Object.defineProperty(this, q, {
+      value: e,
+      configurable: !1,
+      enumerable: !1,
+      writable: !1
+    });
+  }
+  get value() {
+    return k(this, M).currentValue;
+  }
+  set value(e) {
+    if (!k(this, A).call(this, k(this, M).currentValue, e)) {
+      k(this, M).currentValue = e;
+      const n = k(this, M).subs;
+      n !== void 0 && (De(n), Pe());
+    }
+  }
+}
+M = new WeakMap(), A = new WeakMap();
+class qe {
+  constructor(e) {
+    f(this, "computed");
+    this.computed = e, Object.defineProperty(this, q, {
+      value: e,
+      configurable: !1,
+      enumerable: !1,
+      writable: !1
+    });
+  }
+  get value() {
+    const e = this.computed, n = e.flags;
+    return n & (S.Dirty | S.PendingComputed) && Oe(e, n), e.currentValue;
+  }
+}
+function g(t) {
+  return t != null && t[q] != null;
+}
+function G(t, e) {
+  return new Ve({ currentValue: t, subs: void 0, subsTail: void 0 }, e);
+}
+function K(t, e) {
+  return new qe({
+    currentValue: void 0,
+    equals: (e == null ? void 0 : e.equals) ?? Object.is,
+    subs: void 0,
+    subsTail: void 0,
+    deps: void 0,
+    depsTail: void 0,
+    flags: S.Computed | S.Dirty,
+    getter: (n) => {
+      let s = t(n);
+      return s = v(s), s;
+    }
+  });
+}
+function _e(t, e) {
+  if (E(e))
+    t.value = e(t.value);
+  else if (arguments.length > 1)
+    t.value = e;
+  else
+    return (n) => _e(t, n);
+}
+function v(t) {
+  if (g(t)) {
+    if (w !== void 0) {
+      const e = t[q];
+      pe(e, w);
+    }
+    return t.value;
+  } else
+    return t;
+}
+function ut(t) {
+  return g(t) ? t.value : t;
+}
+function y(t) {
+  const e = {
+    fn: t,
+    subs: void 0,
+    subsTail: void 0,
+    deps: void 0,
+    depsTail: void 0,
+    flags: S.Effect
+  };
+  return w !== void 0 && pe(e, w), me(e), je.bind(e);
+}
+const ct = () => {
+};
+let R = 1;
+function ge() {
+  return R = R % Number.MAX_SAFE_INTEGER + 1, R.toString(36) + Date.now().toString(36);
+}
+function lt(t, e) {
+  return Object.is(t, e);
+}
+function ft(t, e) {
+  if (Object.is(t, e)) return !0;
+  const n = L(t);
+  if (n !== L(e))
+    return !1;
+  switch (n) {
+    case "object":
+      let s = 0;
+      for (const i in t) {
+        if (t[i] !== e[i]) return !1;
+        s++;
+      }
+      return Object.keys(e).length === s;
+    case "array":
+      if (t.length !== e.length) return !1;
+      for (let i = 0; i < t.length; i++)
+        if (t[i] !== e[i]) return !1;
+      return !0;
+    case "map":
+      if (t.size !== e.size) return !1;
+      for (const i of t.keys())
+        if (t[i] !== e[i]) return !1;
+      return !0;
+    case "set":
+      if (E(t.symmetricDifference))
+        return t.symmetricDifference(e).size === 0;
+      for (const i of t.keys())
+        if (t[i] !== e.get(i)) return !1;
+      return !0;
+  }
+  return !1;
+}
+function B(t, e) {
+  if (t === e) return !0;
+  if (t && e && typeof t == "object" && typeof e == "object") {
+    if (t.constructor !== e.constructor) return !1;
+    var n, s, i;
+    if (Array.isArray(t)) {
+      if (n = t.length, n != e.length) return !1;
+      for (s = n; s-- !== 0; ) if (!B(t[s], e[s])) return !1;
+      return !0;
+    }
+    if (t instanceof Map && e instanceof Map) {
+      if (t.size !== e.size) return !1;
+      for (s of t.entries()) if (!e.has(s[0])) return !1;
+      for (s of t.entries()) if (!B(s[1], e.get(s[0]))) return !1;
+      return !0;
+    }
+    if (t instanceof Set && e instanceof Set) {
+      if (t.size !== e.size) return !1;
+      for (s of t.entries()) if (!e.has(s[0])) return !1;
+      return !0;
+    }
+    if (ArrayBuffer.isView(t) && ArrayBuffer.isView(e)) {
+      if (n = t.length, n != e.length) return !1;
+      for (s = n; s-- !== 0; ) if (t[s] !== e[s]) return !1;
+      return !0;
+    }
+    if (t.constructor === RegExp) return t.source === e.source && t.flags === e.flags;
+    if (t.valueOf !== Object.prototype.valueOf) return t.valueOf() === e.valueOf();
+    if (t.toString !== Object.prototype.toString) return t.toString() === e.toString();
+    if (i = Object.keys(t), n = i.length, n !== Object.keys(e).length) return !1;
+    for (s = n; s-- !== 0; ) if (!Object.prototype.hasOwnProperty.call(e, i[s])) return !1;
+    for (s = n; s-- !== 0; ) {
+      var o = i[s];
+      if (!B(t[o], e[o])) return !1;
+    }
+    return !0;
+  }
+  return t !== t && e !== e;
+}
+function Ue(t, e) {
+  const n = (s) => {
+    const i = {};
+    for (const o in s)
+      t.includes(o) || (i[o] = s[o]);
+    return i;
+  };
+  return e == null ? n : n(e);
+}
+function at(t) {
+  let e = 0;
+  for (let n = 0; n < t.length; n++)
+    e = (e + t.charCodeAt(n) * 10) % 360;
+  return `oklch(0.68 0.15 ${e}deg)`;
+}
+function ht(t) {
+  if (t instanceof RegExp)
+    return (s) => t.test(s);
+  const e = {
+    positive: [],
+    negative: []
+  }, n = t.split(",").map((s) => s.trim()).filter((s) => s !== "");
+  for (let s of n) {
+    let i = "positive";
+    s.startsWith("-") && (i = "negative", s = s.slice(1)), s === "*" ? e[i].push(function() {
+      return !0;
+    }) : s.endsWith("*") ? e[i].push(function(o) {
+      return o.startsWith(s.slice(0, s.length - 1));
+    }) : e[i].push(function(o) {
+      return o === s;
+    });
+  }
+  return function(s) {
+    const { positive: i, negative: o } = e;
+    return !(o.some((l) => l(s)) || i.length > 0 && !i.some((l) => l(s)));
+  };
+}
+const N = Symbol.for("DollaMarkupElement"), dt = Symbol.for("DollaRouter");
+function pt(t, e) {
+  return e.outlet();
+}
+function ze(t) {
+  for (var e, n, s = arguments, i = 1, o = "", l = "", a = [0], m = function(c) {
+    i === 1 && (c || (o = o.replace(/^\s*\n\s*|\s*\n\s*$/g, ""))) ? a.push(c ? s[c] : o) : i === 3 && (c || o) ? (a[1] = c ? s[c] : o, i = 2) : i === 2 && o === "..." && c ? a[2] = Object.assign(a[2] || {}, s[c]) : i === 2 && o && !c ? (a[2] = a[2] || {})[o] = !0 : i >= 5 && (i === 5 ? ((a[2] = a[2] || {})[n] = c ? o ? o + s[c] : s[c] : o, i = 6) : (c || o) && (a[2][n] += c ? o + s[c] : o)), o = "";
+  }, r = 0; r < t.length; r++) {
+    r && (i === 1 && m(), m(r));
+    for (var u = 0; u < t[r].length; u++) e = t[r][u], i === 1 ? e === "<" ? (m(), a = [a, "", null], i = 3) : o += e : i === 4 ? o === "--" && e === ">" ? (i = 1, o = "") : o = e + o[0] : l ? e === l ? l = "" : o += e : e === '"' || e === "'" ? l = e : e === ">" ? (m(), i = 1) : i && (e === "=" ? (i = 5, n = o, o = "") : e === "/" && (i < 5 || t[r][u + 1] === ">") ? (m(), i === 3 && (a = a[0]), i = a, (a = a[0]).push(this.apply(null, i.slice(1))), i = 0) : e === " " || e === "	" || e === `
+` || e === "\r" ? (m(), i = 2) : o += e), i === 3 && o === "!--" && (i = 4, a = a[0]);
+  }
+  return m(), a.length > 2 ? a.slice(1) : a[1];
+}
+var se;
+se = N;
+class te {
+  constructor(e) {
+    f(this, se, !0);
+    f(this, "node");
+    this.node = e;
+  }
+  get isMounted() {
+    return this.node.parentNode != null;
+  }
+  mount(e, n) {
+    e.insertBefore(this.node, (n == null ? void 0 : n.nextSibling) ?? null);
+  }
+  unmount(e = !1) {
+    this.node.parentNode && !e && this.node.parentNode.removeChild(this.node);
+  }
+}
+var ie;
+ie = N;
+class Re {
+  constructor(e) {
+    f(this, ie, !0);
+    f(this, "node", document.createTextNode(""));
+    f(this, "children", []);
+    f(this, "elementContext");
+    f(this, "source");
+    f(this, "unsubscribe");
+    this.source = e.source, this.elementContext = e.elementContext;
+  }
+  get isMounted() {
+    return this.node.parentNode != null;
+  }
+  mount(e, n) {
+    this.isMounted || (e.insertBefore(this.node, (n == null ? void 0 : n.nextSibling) ?? null), this.unsubscribe = y(() => {
+      const s = v(this.source);
+      if (!Me(s))
+        throw console.error(s), new TypeError(
+          `Dynamic received invalid value to render. Got type: ${L(s)}, value: ${s}`
+        );
+      this.update(P(s) ? s : [s]);
+    }));
+  }
+  unmount(e = !1) {
+    var n, s;
+    (n = this.unsubscribe) == null || n.call(this), this.isMounted && (this.cleanup(e), (s = this.node.parentNode) == null || s.removeChild(this.node));
+  }
+  cleanup(e) {
+    for (const n of this.children)
+      n.unmount(e);
+    this.children = [];
+  }
+  update(e) {
+    var o, l, a;
+    if (this.cleanup(!1), e == null || e.length === 0 || !this.isMounted)
+      return;
+    const n = e.flatMap((m) => be(m) ? m : T(this.elementContext, X(m)));
+    for (const m of n) {
+      const r = ((o = this.children.at(-1)) == null ? void 0 : o.node) || this.node;
+      m.mount(this.node.parentNode, r), this.children.push(m);
+    }
+    const s = this.node.parentNode, i = ((a = (l = this.children.at(-1)) == null ? void 0 : l.node) == null ? void 0 : a.nextSibling) ?? null;
+    s.insertBefore(this.node, i);
+  }
+}
+const Be = (t) => /^on[A-Z]/.test(t);
+var re;
+re = N;
+class Ge {
+  constructor({ tag: e, props: n, children: s, elementContext: i }) {
+    f(this, re, !0);
+    f(this, "node");
+    f(this, "props");
+    f(this, "childMarkup", []);
+    f(this, "children", []);
+    f(this, "unsubscribers", []);
+    f(this, "elementContext");
+    // Track the ref so we can nullify it on unmount.
+    f(this, "ref");
+    // Prevents 'onClickOutside' handlers from firing in the same cycle in which the element is connected.
+    f(this, "canClickAway", !1);
+    if (e.toLowerCase() === "svg" && (i = {
+      ...i,
+      isSVG: !0
+    }), i.isSVG ? this.node = document.createElementNS("http://www.w3.org/2000/svg", e) : this.node = document.createElement(e), i.root.getEnv() === "development" && i.viewName && (this.node.dataset.view = i.viewName), n.ref)
+      if (E(n.ref))
+        this.ref = n.ref, this.ref(this.node);
+      else
+        throw new Error("Expected ref to be a function. Got: " + n.ref);
+    this.props = {
+      ...Ue(["ref", "class", "className"], n),
+      class: n.className ?? n.class
+    }, s && (this.childMarkup = s), this.elementContext = i;
+  }
+  get isMounted() {
+    return this.node.parentNode != null;
+  }
+  mount(e, n) {
+    if (e == null)
+      throw new Error(`HTML element requires a parent element as the first argument to connect. Got: ${e}`);
+    if (!this.isMounted) {
+      this.childMarkup.length > 0 && (this.children = T(this.elementContext, this.childMarkup));
+      for (let s = 0; s < this.children.length; s++) {
+        const i = this.children[s], o = s > 0 ? this.children[s - 1].node : void 0;
+        i.mount(this.node, o);
+      }
+      this.applyProps(this.node, this.props), this.props.style && this.applyStyles(this.node, this.props.style, this.unsubscribers), this.props.class && this.applyClasses(this.node, this.props.class, this.unsubscribers);
+    }
+    e.insertBefore(this.node, (n == null ? void 0 : n.nextSibling) ?? null), setTimeout(() => {
+      this.canClickAway = !0;
+    }, 0);
+  }
+  unmount(e = !1) {
+    var n;
+    if (this.isMounted) {
+      e || (n = this.node.parentNode) == null || n.removeChild(this.node);
+      for (const s of this.children)
+        s.unmount(!0);
+      this.ref && this.ref(void 0), this.canClickAway = !1;
+      for (const s of this.unsubscribers)
+        s();
+      this.unsubscribers.length = 0;
+    }
+  }
+  attachProp(e, n) {
+    g(e) ? this.unsubscribers.push(y(() => n(v(e)))) : n(e);
+  }
+  applyProps(e, n) {
+    for (const s in n) {
+      const i = n[s];
+      if (s === "attributes") {
+        const o = i;
+        for (const l in o)
+          this.attachProp(o[l], (a) => {
+            a == null ? e.removeAttribute(l) : e.setAttribute(l, String(a));
+          });
+      } else if (s === "onClickOutside" || s === "onclickoutside") {
+        const o = (a) => {
+          this.canClickAway && !e.contains(a.target) && (g(i) ? i.value(a) : i(a));
+        }, l = { capture: !0 };
+        window.addEventListener("click", o, l), this.unsubscribers.push(() => {
+          window.removeEventListener("click", o, l);
+        });
+      } else if (Be(s)) {
+        const o = s.slice(2).toLowerCase(), l = g(i) ? (a) => i.value(a) : i;
+        e.addEventListener(o, l), this.unsubscribers.push(() => {
+          e.removeEventListener(o, l);
+        });
+      } else if (s.includes("-"))
+        this.attachProp(i, (o) => {
+          o == null ? e.removeAttribute(s) : e.setAttribute(s, String(o));
+        });
+      else if (!Fe.includes(s))
+        if (this.elementContext.isSVG)
+          this.attachProp(i, (o) => {
+            o != null ? e.setAttribute(s, String(n[s])) : e.removeAttribute(s);
+          });
+        else
+          switch (s) {
+            case "contentEditable":
+            case "value":
+              this.attachProp(i, (o) => {
+                e[s] = String(o);
+              });
+              break;
+            case "for":
+              this.attachProp(i, (o) => {
+                e.htmlFor = o;
+              });
+              break;
+            case "checked":
+              this.attachProp(i, (o) => {
+                e.checked = o, o ? e.setAttribute("checked", "") : e.removeAttribute("checked");
+              });
+              break;
+            // Attribute-aliased props
+            case "exportParts":
+            case "part":
+            case "translate":
+            case "type":
+            case "title": {
+              const o = s.toLowerCase();
+              this.attachProp(i, (l) => {
+                l == null ? e.removeAttribute(o) : e.setAttribute(o, String(l));
+              });
+              break;
+            }
+            case "autocomplete":
+            case "autocapitalize":
+              this.attachProp(i, (o) => {
+                typeof o == "string" ? e.autocomplete = o : o ? e.autocomplete = "on" : e.autocomplete = "off";
+              });
+              break;
+            default: {
+              this.attachProp(i, (o) => {
+                e[s] = o;
+              });
+              break;
+            }
+          }
+    }
+  }
+  applyStyles(e, n, s) {
+    const i = [];
+    if (g(n)) {
+      let o;
+      const l = y(() => {
+        E(o) && o(), e.style.cssText = "", o = this.applyStyles(e, v(n), s);
+      });
+      s.push(l), i.push(l);
+    } else {
+      const o = ve(n);
+      for (const l in o) {
+        const { value: a, priority: m } = o[l];
+        if (g(a)) {
+          const r = y(() => {
+            v(a) ? e.style.setProperty(l, String(a.value), m) : e.style.removeProperty(l);
+          });
+          s.push(r), i.push(r);
+        } else a != null && e.style.setProperty(l, String(a));
+      }
+    }
+    return function() {
+      for (const l of i)
+        l(), s.splice(s.indexOf(l), 1);
+    };
+  }
+  applyClasses(e, n, s) {
+    const i = [];
+    if (g(n)) {
+      let o;
+      const l = y(() => {
+        E(o) && o(), e.removeAttribute("class"), o = this.applyClasses(e, v(n), s);
+      });
+      s.push(l), i.push(l);
+    } else {
+      const o = ye(n);
+      for (const l in o) {
+        const a = o[l];
+        if (g(a)) {
+          const m = y(() => {
+            v(a) ? e.classList.add(l) : e.classList.remove(l);
+          });
+          s.push(m), i.push(m);
+        } else a && e.classList.add(l);
+      }
+    }
+    return function() {
+      for (const l of i)
+        l(), s.splice(s.indexOf(l), 1);
+    };
+  }
+}
+function ye(t) {
+  let e = {};
+  if (D(t)) {
+    const n = t.split(" ");
+    for (const s of n)
+      e[s] = !0;
+  } else W(t) ? Object.assign(e, t) : Array.isArray(t) && Array.from(t).filter(Boolean).forEach((n) => {
+    Object.assign(e, ye(n));
+  });
+  return delete e.undefined, e;
+}
+function ve(t) {
+  let e = {};
+  if (D(t)) {
+    const n = t.split(";").filter((s) => s.trim() !== "");
+    for (const s of n) {
+      const [i, o] = s.split(":"), l = {
+        value: o
+      };
+      o.includes("!important") ? (l.priority = "important", l.value = o.replace("!important", "").trim()) : l.value = o.trim(), e[ne(i.trim())] = l;
+    }
+  }
+  if (W(t))
+    for (const n in t)
+      n.startsWith("--") ? e[n] = { value: t[n] } : e[ne(n)] = { value: t[n] };
+  else Array.isArray(t) && Array.from(t).filter((n) => n != null).forEach((n) => {
+    Object.assign(e, ve(n));
+  });
+  return e;
+}
+function ne(t) {
+  return t.replace(/[A-Z]+(?![a-z])|[A-Z]/g, (e, n) => (n ? "-" : "") + e.toLowerCase());
+}
+const Fe = ["ref", "children", "class", "style", "data"];
+let We = class {
+  constructor(e) {
+    f(this, "store");
+    this.store = e;
+    const n = Object.getOwnPropertyDescriptors(this.store.logger);
+    for (const s in n)
+      s !== "setName" && Object.defineProperty(this, s, n[s]);
+  }
+  get isMounted() {
+    return this.store.isMounted;
+  }
+  get name() {
+    return this.store.name || this.store.id;
+  }
+  set name(e) {
+    this.store.name = e, this.store.logger.setName(e);
+  }
+  get(e) {
+    if (E(e)) {
+      let n = this.store.elementContext, s;
+      for (; s = n.stores.get(e), s == null && n.parent != null; )
+        n = n.parent;
+      if (s == null)
+        throw new $(`Store '${e.name}' is not provided on this context.`);
+      return s.value;
+    } else
+      throw new $("Invalid store.");
+  }
+  onMount(e) {
+    this.store.lifecycleListeners.mount.push(e);
+  }
+  onUnmount(e) {
+    this.store.lifecycleListeners.unmount.push(e);
+  }
+  effect(e) {
+    const n = this.store;
+    if (n.isMounted) {
+      const s = y(e);
+      return n.lifecycleListeners.unmount.push(s), s;
+    } else {
+      let s, i = !1;
+      return n.lifecycleListeners.mount.push(() => {
+        i || (s = y(e), n.lifecycleListeners.unmount.push(s));
+      }), () => {
+        s != null && (i = !0, s());
+      };
+    }
+  }
+};
+class Ze {
+  constructor(e, n) {
+    f(this, "fn");
+    f(this, "_options");
+    /**
+     * Value is guaranteed to be set after `attach` is called.
+     */
+    f(this, "value");
+    f(this, "isMounted", !1);
+    f(this, "elementContext");
+    f(this, "lifecycleListeners", { mount: [], unmount: [] });
+    f(this, "logger");
+    f(this, "id", ge());
+    f(this, "name");
+    this.fn = e, this.name = e.name, this._options = n;
+  }
+  /**
+   * Attaches this Store to the elementContext.
+   * Returns false if there was already an instance attached, and true otherwise.
+   */
+  attach(e) {
+    if (e.stores.has(this.fn))
+      return !1;
+    this.elementContext = e, this.logger = e.root.createLogger(this.name);
+    const n = new We(this);
+    try {
+      this.value = this.fn.call(n, this._options, n);
+    } catch (s) {
+      throw this.logger.crash(s), s;
+    }
+    return e.stores.set(this.fn, this), !0;
+  }
+  handleMount() {
+    this.isMounted = !0;
+    for (const e of this.lifecycleListeners.mount)
+      e();
+    this.lifecycleListeners.mount.length = 0;
+  }
+  handleUnmount() {
+    this.isMounted = !1;
+    for (const e of this.lifecycleListeners.unmount)
+      e();
+    this.lifecycleListeners.unmount.length = 0;
+  }
+}
+class $ extends Error {
+}
+class He {
+  constructor(e) {
+    f(this, "view");
+    this.view = e;
+    const n = Object.getOwnPropertyDescriptors(this.view.logger);
+    for (const s in n)
+      s !== "setName" && Object.defineProperty(this, s, n[s]);
+  }
+  get uid() {
+    return this.view.uniqueId;
+  }
+  get isMounted() {
+    return this.view.isMounted;
+  }
+  get name() {
+    return this.view.elementContext.viewName || this.uid;
+  }
+  set name(e) {
+    this.view.elementContext.viewName = e, this.view.logger.setName(e);
+  }
+  provide(e, n) {
+    const s = new Ze(e, n);
+    if (s.attach(this.view.elementContext))
+      return this.view.lifecycleListeners.mount.push(() => {
+        s.handleMount();
+      }), this.view.lifecycleListeners.unmount.push(() => {
+        s.handleUnmount();
+      }), s.value;
+    {
+      let o = e.name ? `'${e.name}'` : "this store";
+      return this.view.logger.warn(`An instance of ${o} was already attached to this context.`), this.get(e);
+    }
+  }
+  get(e) {
+    if (E(e)) {
+      let n = this.view.elementContext, s;
+      for (; s = n.stores.get(e), s == null && n.parent != null; )
+        n = n.parent;
+      if (s == null)
+        throw new $(`Store '${e.name}' is not provided on this context.`);
+      return s.value;
+    } else
+      throw new $("Invalid store.");
+  }
+  beforeMount(e) {
+    this.view.lifecycleListeners.beforeMount.push(e);
+  }
+  onMount(e) {
+    this.view.lifecycleListeners.mount.push(e);
+  }
+  beforeUnmount(e) {
+    this.view.lifecycleListeners.beforeUnmount.push(e);
+  }
+  onUnmount(e) {
+    this.view.lifecycleListeners.unmount.push(e);
+  }
+  effect(e) {
+    if (this.view.isMounted) {
+      const n = y(e);
+      return this.view.lifecycleListeners.unmount.push(n), n;
+    } else {
+      let n, s = !1;
+      return this.view.lifecycleListeners.mount.push(() => {
+        s || (n = y(e), this.view.lifecycleListeners.unmount.push(n));
+      }), () => {
+        n != null && (s = !0, n());
+      };
+    }
+  }
+  outlet() {
+    return b("$outlet", { children: this.view.children });
+  }
+}
+var oe;
+oe = N;
+const Y = class Y {
+  constructor(e, n, s, i = []) {
+    f(this, oe, !0);
+    f(this, "uniqueId", ge());
+    f(this, "elementContext");
+    f(this, "logger");
+    f(this, "props");
+    f(this, "fn");
+    f(this, "element");
+    f(this, "childMarkup");
+    f(this, "children", G([]));
+    f(this, "lifecycleListeners", { beforeMount: [], mount: [], beforeUnmount: [], unmount: [] });
+    f(this, "isMounted", !1);
+    this.elementContext = {
+      ...e,
+      parent: e,
+      viewName: n.name,
+      stores: /* @__PURE__ */ new Map()
+    }, this.logger = e.root.createLogger(n.name || "🌇 anonymous view", { uid: this.uniqueId }), this.props = s, this.fn = n, this.childMarkup = i;
+  }
+  /*===============================*\
+  ||         "Public" API          ||
+  \*===============================*/
+  get node() {
+    var e;
+    return (e = this.element) == null ? void 0 : e.node;
+  }
+  mount(e, n) {
+    const s = this.isMounted;
+    if (!s) {
+      this._initialize();
+      for (const i of this.lifecycleListeners.beforeMount)
+        i();
+    }
+    this.element && this.element.mount(e, n), s || (this.isMounted = !0, requestAnimationFrame(() => {
+      for (const i of this.lifecycleListeners.mount)
+        i();
+    }));
+  }
+  unmount(e = !1) {
+    for (const n of this.lifecycleListeners.beforeUnmount)
+      n();
+    this.element && this.element.unmount(e), this.isMounted = !1;
+    for (const n of this.lifecycleListeners.unmount)
+      n();
+    this.lifecycleListeners.beforeMount.length = 0, this.lifecycleListeners.mount.length = 0, this.lifecycleListeners.beforeUnmount.length = 0, this.lifecycleListeners.unmount.length = 0;
+  }
+  setChildView(e) {
+    this.childMarkup = [];
+    const n = new Y(this.elementContext, e, {});
+    return this.children.value = [n], n;
+  }
+  /*===============================*\
+  ||           Internal            ||
+  \*===============================*/
+  _initialize() {
+    const e = new He(this);
+    let n;
+    try {
+      n = this.fn.call(e, this.props, e), this.childMarkup.length && (this.children.value = T(this.elementContext, this.childMarkup));
+    } catch (s) {
+      throw s instanceof Error && this.logger.crash(s), s;
+    }
+    if (n !== null) if (n instanceof Node)
+      this.element = O(T(this.elementContext, b("$node", { value: n })));
+    else if (g(n))
+      this.element = O(
+        T(this.elementContext, b("$dynamic", { source: n }))
+      );
+    else if (j(n) || F(j, n))
+      this.element = O(T(this.elementContext, n));
+    else {
+      const s = new TypeError(
+        `Expected '${this.fn.name}' function to return a DOM node, Markup element, Readable or null. Got: ${L(n)}`
+      );
+      this.logger.crash(s);
+    }
+  }
+};
+let I = Y;
+var ue;
+ue = N;
+class Ke {
+  constructor({ elementContext: e, items: n, renderFn: s, keyFn: i }) {
+    f(this, ue, !0);
+    f(this, "node", document.createTextNode(""));
+    f(this, "items");
+    f(this, "unsubscribe", null);
+    f(this, "connectedItems", []);
+    f(this, "elementContext");
+    f(this, "renderFn");
+    f(this, "keyFn");
+    this.elementContext = e, this.items = n, this.renderFn = s, this.keyFn = i;
+  }
+  get isMounted() {
+    return this.node.parentNode != null;
+  }
+  mount(e, n) {
+    this.isMounted || (e.insertBefore(this.node, (n == null ? void 0 : n.nextSibling) ?? null), this.unsubscribe = y(() => {
+      let s = v(this.items);
+      s == null && (s = [], console.log("list received empty value", s, this)), this._update(Array.from(s));
+    }));
+  }
+  unmount(e = !1) {
+    var n;
+    this.unsubscribe && (this.unsubscribe(), this.unsubscribe = null), !e && this.isMounted && ((n = this.node.parentNode) == null || n.removeChild(this.node)), this._cleanup(e);
+  }
+  _cleanup(e) {
+    for (const n of this.connectedItems)
+      n.element.unmount(e);
+    this.connectedItems = [];
+  }
+  _update(e) {
+    var l, a, m;
+    if (e.length === 0 || !this.isMounted)
+      return this._cleanup(!1);
+    const n = [];
+    let s = 0;
+    for (const r of e)
+      n.push({
+        key: this.keyFn(r, s),
+        value: r,
+        index: s++
+      });
+    const i = [];
+    for (const r of this.connectedItems)
+      n.find((c) => c.key === r.key) || r.element.unmount(!1);
+    for (const r of n) {
+      const u = this.connectedItems.find((c) => c.key === r.key);
+      if (u)
+        u.item.value = r.value, u.index.value = r.index, i[r.index] = u;
+      else {
+        const c = G(r.value), d = G(r.index);
+        i[r.index] = {
+          key: r.key,
+          item: c,
+          index: d,
+          element: new I(this.elementContext, Xe, {
+            item: K(() => c.value),
+            index: d,
+            renderFn: this.renderFn
+          })
+        };
+      }
+    }
+    for (let r = 0; r < i.length; r++) {
+      const u = i[r], c = ((l = i[r - 1]) == null ? void 0 : l.element.node) ?? this.node;
+      u.element.mount(this.node.parentNode, c);
+    }
+    this.connectedItems = i;
+    const o = ((a = i.at(-1)) == null ? void 0 : a.element.node) ?? this.node;
+    (m = this.node.parentNode) == null || m.insertBefore(this.node, o.nextSibling);
+  }
+}
+function Xe(t, e) {
+  return e.name = "@ListItem", t.renderFn.call(e, t.item, t.index, e);
+}
+var ce;
+ce = N;
+class we {
+  constructor(e) {
+    f(this, ce, !0);
+    f(this, "node", document.createTextNode(""));
+    f(this, "isMounted", !1);
+    f(this, "source");
+    f(this, "elements", []);
+    f(this, "unsubscribe");
+    this.source = e;
+  }
+  mount(e, n) {
+    this.isMounted || (this.isMounted = !0, e.insertBefore(this.node, (n == null ? void 0 : n.nextSibling) ?? null), g(this.source) ? this.unsubscribe = y(() => {
+      this.update(v(this.source));
+    }) : this.update(this.elements));
+  }
+  unmount(e = !1) {
+    this.unsubscribe && (this.unsubscribe(), this.unsubscribe = void 0), this.isMounted && (this.cleanup(e), this.isMounted = !1);
+  }
+  cleanup(e) {
+    for (const n of this.elements)
+      n.unmount(e);
+    this.elements = [];
+  }
+  update(e) {
+    var n, s;
+    if (this.cleanup(!1), e.length > 0) {
+      for (let i = 0; i < e.length; i++) {
+        const o = e[i], l = i > 0 ? this.elements[i - 1] : void 0;
+        o.mount(this.node.parentElement, l == null ? void 0 : l.node), this.elements.push(o);
+      }
+      (s = this.node.parentNode) == null || s.insertBefore(this.node, ((n = this.elements.at(-1)) == null ? void 0 : n.node) ?? null);
+    }
+  }
+}
+var le;
+le = N;
+class Ye {
+  constructor(e) {
+    f(this, le, !0);
+    f(this, "config");
+    f(this, "element");
+    this.config = e;
+  }
+  get isMounted() {
+    return this.element ? this.element.isMounted : !1;
+  }
+  mount(e, n) {
+    const { content: s, parent: i } = this.config;
+    be(s) ? this.element = s : this.element = O(T(this.config.elementContext, X(s))), this.element.mount(i);
+  }
+  unmount(e = !1) {
+    var n;
+    (n = this.element) != null && n.isMounted && this.element.unmount(e);
+  }
+}
+function j(t) {
+  return t instanceof xe;
+}
+function be(t) {
+  return (t == null ? void 0 : t[N]) === !0;
+}
+function X(t) {
+  return P(t) || (t = [t]), t.flat(1 / 0).filter((e) => e != null && e !== !1).map((e) => j(e) ? e : e instanceof Node ? b("$node", { value: e }) : g(e) ? b("$dynamic", { source: e }) : b("$text", { value: e }));
+}
+function b(t, e, ...n) {
+  return new xe(t, e, ...n);
+}
+class xe {
+  constructor(e, n, ...s) {
+    f(this, "type");
+    f(this, "props");
+    f(this, "children");
+    this.type = e, this.props = n, this.children = X(s);
+  }
+}
+const gt = ze.bind(b);
+function yt(t, e, n) {
+  return b("$dynamic", {
+    source: K(() => {
+      const s = v(t);
+      return s && e ? e : !s && n ? n : null;
+    })
+  });
+}
+function vt(t, e, n) {
+  return b("$list", { items: K(() => t), keyFn: e, renderFn: n });
+}
+function wt(t, e) {
+  return b("$portal", { parent: t, content: e });
+}
+function T(t, e) {
+  return (P(e) ? e : [e]).map((s) => {
+    if (E(s.type))
+      return new I(t, s.type, s.props, s.children);
+    if (D(s.type))
+      switch (s.type) {
+        case "$node": {
+          const i = s.props;
+          return new te(i.value);
+        }
+        case "$text": {
+          const i = s.props;
+          return new te(document.createTextNode(String(i.value)));
+        }
+        case "$list": {
+          const i = s.props;
+          return new Ke({
+            items: i.items,
+            keyFn: i.keyFn,
+            renderFn: i.renderFn,
+            elementContext: t
+          });
+        }
+        case "$dynamic": {
+          const i = s.props;
+          return new Re({
+            source: i.source,
+            elementContext: t
+          });
+        }
+        case "$outlet": {
+          const i = s.props;
+          return new we(i.children);
+        }
+        case "$portal": {
+          const i = s.props;
+          return new Ye({
+            content: i.content,
+            parent: i.parent,
+            elementContext: t
+          });
+        }
+        default:
+          if (s.type.startsWith("$"))
+            throw new Error(`Unknown markup type: ${s.type}`);
+          return new Ge({
+            tag: s.type,
+            props: s.props ?? {},
+            children: s.children,
+            elementContext: t
+          });
+      }
+    else
+      throw new TypeError(`Expected a string or view function. Got: ${s.type}`);
+  });
+}
+function O(t) {
+  return t.length === 1 ? t[0] : new we(t);
+}
+function Me(t) {
+  return t == null || t === !1 || D(t) || Le(t) || j(t) || g(t) || F(Me, t);
+}
+export {
+  wt as A,
+  vt as B,
+  dt as I,
+  pt as P,
+  Ze as S,
+  I as V,
+  st as a,
+  it as b,
+  G as c,
+  K as d,
+  ot as e,
+  D as f,
+  v as g,
+  W as h,
+  E as i,
+  B as j,
+  yt as k,
+  gt as l,
+  ht as m,
+  $ as n,
+  rt as o,
+  b as p,
+  O as q,
+  T as r,
+  ft as s,
+  L as t,
+  ct as u,
+  at as v,
+  y as w,
+  _e as x,
+  ut as y,
+  lt as z
+};
+//# sourceMappingURL=markup-DIfh0nwz.js.map