@shane_il/pulse 0.1.2 → 0.3.0

package/dist/pulse.js

@@ -1,152 +1,188 @@
-var v = Object.defineProperty;
-var tt = (t, e, s) => e in t ? v(t, e, { enumerable: !0, configurable: !0, writable: !0, value: s }) : t[e] = s;
-var g = (t, e, s) => tt(t, typeof e != "symbol" ? e + "" : e, s);
-const j = Symbol("TEXT_NODE"), et = Symbol("FRAGMENT");
-function D(t) {
+var st = Object.defineProperty;
+var ot = (t, e, s) => e in t ? st(t, e, { enumerable: !0, configurable: !0, writable: !0, value: s }) : t[e] = s;
+var T = (t, e, s) => ot(t, typeof e != "symbol" ? e + "" : e, s);
+const G = Symbol("TEXT_NODE"), rt = Symbol("FRAGMENT");
+function $(t) {
   return {
-    type: j,
+    type: G,
     props: { nodeValue: String(t) },
     children: [],
     key: null
   };
 }
-function nt(t) {
-  return t == null || typeof t == "boolean" ? null : typeof t == "string" || typeof t == "number" ? D(t) : t;
+function ct(t) {
+  return t == null || typeof t == "boolean" ? null : typeof t == "string" || typeof t == "number" ? $(t) : t;
 }
-function z(t) {
+function J(t) {
   const e = [];
   for (const s of t)
     if (Array.isArray(s))
-      e.push(...z(s));
+      e.push(...J(s));
     else {
-      const n = nt(s);
+      const n = ct(s);
       n !== null && e.push(n);
     }
   return e;
 }
-function W(t, e, ...s) {
+function K(t, e, ...s) {
   e = e || {};
   const n = e.key ?? null;
   e.key !== void 0 && (e = { ...e }, delete e.key);
-  const o = z(s);
-  return { type: t, props: e, children: o, key: n };
+  const r = J(s);
+  return { type: t, props: e, children: r, key: n };
 }
-function st(t) {
+function it(t) {
   let e = t.state;
-  const s = t.actions, n = /* @__PURE__ */ new Set();
+  const s = t.actions, n = /* @__PURE__ */ new Set(), r = t.middleware;
   function o() {
     return e;
   }
-  function r(i, u) {
-    const h = s[i];
-    if (!h)
-      throw new Error(`[pulse] Unknown action: "${i}"`);
-    const p = h(e, u);
-    if (p !== e) {
-      e = p;
-      for (const f of n)
-        f(e);
+  function c() {
+    for (const u of n)
+      u(e);
+  }
+  function l(u, d) {
+    const g = s[u];
+    if (!g)
+      throw new Error(`[pulse] Unknown action: "${u}"`);
+    const b = g(e, d);
+    b !== e && (e = b, c());
+  }
+  function a(u, d) {
+    if (u === "__devtools_replace__") {
+      e = d, c();
+      return;
+    }
+    const g = s[u];
+    if (!g)
+      throw new Error(`[pulse] Unknown action: "${u}"`);
+    const b = {
+      store: h,
+      actionName: u,
+      payload: d,
+      prevState: e,
+      nextState: void 0
+    };
+    let I = 0;
+    function x() {
+      if (I < r.length) {
+        const f = r[I++];
+        f(b, x);
+      } else {
+        const f = g(b.prevState, b.payload);
+        b.nextState = f, f !== e && (e = f, c());
+      }
     }
+    x();
   }
-  function c(i) {
-    return n.add(i), () => {
-      n.delete(i);
+  const i = r && r.length > 0 ? a : l;
+  function p(u) {
+    return n.add(u), () => {
+      n.delete(u);
     };
   }
-  function a(i) {
-    return { store: l, selector: i };
+  function y(u) {
+    return { store: h, selector: u };
   }
-  const l = { getState: o, dispatch: r, subscribe: c, select: a };
-  return l;
+  const h = {
+    getState: o,
+    dispatch: i,
+    subscribe: p,
+    select: y
+  };
+  return t.name && (h.name = t.name), h;
 }
-let I = !1;
-const V = /* @__PURE__ */ new Set();
-function rt(t) {
-  V.add(t), I || (I = !0, queueMicrotask(ot));
+let U = !1;
+const N = /* @__PURE__ */ new Set();
+function at(t) {
+  N.add(t), U || (U = !0, queueMicrotask(lt));
 }
-function ot() {
-  const t = [...V];
-  V.clear(), I = !1;
+function lt() {
+  const t = [...N];
+  N.clear(), U = !1;
   for (const e of t)
     e();
 }
-function ht() {
-  const t = [...V];
-  V.clear(), I = !1;
+function _t() {
+  const t = [...N];
+  N.clear(), U = !1;
   for (const e of t)
     e();
 }
-const H = Symbol("PULSE_CONNECTED");
-function ct(t, e) {
+const Y = Symbol("PULSE_CONNECTED"), H = globalThis;
+H.__PULSE_HOOKS__ || (H.__PULSE_HOOKS__ = { onMount: null, onUnmount: null });
+const M = H.__PULSE_HOOKS__;
+function ut(t, e) {
   return function(n) {
-    const o = t || {};
-    function r(c) {
-      const a = {};
-      for (const l in o) {
-        const { store: i, selector: u } = o[l];
-        a[l] = u(i.getState());
+    const r = t || {};
+    function o(c) {
+      const l = {};
+      for (const a in r) {
+        const { store: i, selector: p } = r[a];
+        l[a] = p(i.getState());
       }
-      return n({ ...a, ...c });
+      return n({ ...l, ...c });
     }
-    return r[H] = !0, r._bindings = o, r._innerComponent = n, e && (r._lifecycle = e), r.displayName = `Connected(${n.displayName || n.name || "Anonymous"})`, r;
+    return o[Y] = !0, o._bindings = r, o._innerComponent = n, e && (o._lifecycle = e), o.displayName = `Connected(${n.displayName || n.name || "Anonymous"})`, o;
   };
 }
-class it {
+class ft {
   constructor(e, s) {
-    g(this, "connectedFn");
-    g(this, "props");
-    g(this, "prevSelected");
-    g(this, "unsubscribers");
-    g(this, "lastVTree");
-    g(this, "parentDom");
-    g(this, "_renderCallback");
-    g(this, "_mountCleanup");
+    T(this, "connectedFn");
+    T(this, "props");
+    T(this, "prevSelected");
+    T(this, "unsubscribers");
+    T(this, "lastVTree");
+    T(this, "parentDom");
+    T(this, "_renderCallback");
+    T(this, "_mountCleanup");
     this.connectedFn = e, this.props = s, this.prevSelected = {}, this.unsubscribers = [], this.lastVTree = null, this.parentDom = null, this._renderCallback = null, this._mountCleanup = null;
   }
   mount(e, s) {
-    var r;
+    var o;
     this.parentDom = e, this._renderCallback = s;
     const n = this.connectedFn._bindings;
     for (const c in n) {
-      const { store: a, selector: l } = n[c];
-      this.prevSelected[c] = l(a.getState());
+      const { store: l, selector: a } = n[c];
+      this.prevSelected[c] = a(l.getState());
     }
     for (const c in n) {
-      const { store: a } = n[c], l = a.subscribe(() => {
+      const { store: l } = n[c], a = l.subscribe(() => {
         this._onStoreChange();
       });
-      this.unsubscribers.push(l);
+      this.unsubscribers.push(a);
     }
-    const o = this.connectedFn._lifecycle;
-    if (o != null && o.onMount) {
-      const c = o.onMount({
-        dom: (r = this.lastVTree) == null ? void 0 : r._dom,
+    const r = this.connectedFn._lifecycle;
+    if (r != null && r.onMount) {
+      const c = r.onMount({
+        dom: (o = this.lastVTree) == null ? void 0 : o._dom,
         props: this.props
       });
       typeof c == "function" && (this._mountCleanup = c);
     }
+    M.onMount && M.onMount(this);
   }
   _onStoreChange() {
     const e = this.connectedFn._bindings;
     let s = !1;
     for (const n in e) {
-      const { store: o, selector: r } = e[n], c = r(o.getState());
-      if (!lt(c, this.prevSelected[n])) {
+      const { store: r, selector: o } = e[n], c = o(r.getState());
+      if (!pt(c, this.prevSelected[n])) {
         s = !0;
         break;
       }
     }
-    s && rt(this._renderCallback);
+    s && at(this._renderCallback);
   }
   updateSelected() {
     const e = this.connectedFn._bindings;
     for (const s in e) {
-      const { store: n, selector: o } = e[s];
-      this.prevSelected[s] = o(n.getState());
+      const { store: n, selector: r } = e[s];
+      this.prevSelected[s] = r(n.getState());
     }
   }
   unmount() {
-    this._mountCleanup && (this._mountCleanup(), this._mountCleanup = null);
+    M.onUnmount && M.onUnmount(this), this._mountCleanup && (this._mountCleanup(), this._mountCleanup = null);
     const e = this.connectedFn._lifecycle;
     e != null && e.onDestroy && e.onDestroy({ props: this.props });
     for (const s of this.unsubscribers)
@@ -154,17 +190,17 @@ class it {
     this.unsubscribers = [], this._renderCallback = null;
   }
 }
-function lt(t, e) {
+function pt(t, e) {
   if (Object.is(t, e)) return !0;
   if (typeof t != "object" || typeof e != "object" || t === null || e === null) return !1;
   const s = Object.keys(t), n = Object.keys(e);
   if (s.length !== n.length) return !1;
-  for (const o of s)
-    if (!Object.prototype.hasOwnProperty.call(e, o) || !Object.is(t[o], e[o]))
+  for (const r of s)
+    if (!Object.prototype.hasOwnProperty.call(e, r) || !Object.is(t[r], e[r]))
       return !1;
   return !0;
 }
-const y = {
+const m = {
   CREATE: "CREATE",
   REMOVE: "REMOVE",
   REPLACE: "REPLACE",
@@ -173,310 +209,344 @@ const y = {
   MOVE: "MOVE",
   CHILDREN: "CHILDREN"
 };
-function k(t, e) {
+function w(t, e) {
   if (e == null && t == null) return [];
-  if (e == null) return [{ type: y.REMOVE, target: t }];
-  if (t == null) return [{ type: y.CREATE, newVNode: e }];
+  if (e == null) return [{ type: m.REMOVE, target: t }];
+  if (t == null) return [{ type: m.CREATE, newVNode: e }];
   if (t.type !== e.type)
-    return [{ type: y.REPLACE, oldVNode: t, newVNode: e }];
-  if (e._dom = t._dom, t.type === j)
-    return t.props.nodeValue !== e.props.nodeValue ? [{ type: y.TEXT, oldVNode: t, newVNode: e }] : [];
-  const s = [], n = at(t.props, e.props);
-  n && s.push({ type: y.UPDATE, target: t, propPatches: n });
-  const o = ut(t.children, e.children);
-  return o.length && s.push({ type: y.CHILDREN, parent: t, childPatches: o }), s;
-}
-function at(t, e) {
+    return [{ type: m.REPLACE, oldVNode: t, newVNode: e }];
+  if (e._dom = t._dom, t.type === G)
+    return t.props.nodeValue !== e.props.nodeValue ? [{ type: m.TEXT, oldVNode: t, newVNode: e }] : [];
+  const s = [], n = ht(t.props, e.props);
+  n && s.push({ type: m.UPDATE, target: t, propPatches: n });
+  const r = dt(t.children, e.children);
+  return r.length && s.push({ type: m.CHILDREN, parent: t, childPatches: r }), s;
+}
+function ht(t, e) {
   const s = {}, n = [];
-  let o = !1;
-  for (const r in e)
-    r !== "children" && t[r] !== e[r] && (s[r] = e[r], o = !0);
-  for (const r in t)
-    r !== "children" && (r in e || (n.push(r), o = !0));
-  return o ? { set: s, remove: n } : null;
-}
-function O(t, e) {
+  let r = !1;
+  for (const o in e)
+    o !== "children" && t[o] !== e[o] && (s[o] = e[o], r = !0);
+  for (const o in t)
+    o !== "children" && (o in e || (n.push(o), r = !0));
+  return r ? { set: s, remove: n } : null;
+}
+function P(t, e) {
   return t == null || e == null ? !1 : t.type === e.type && t.key === e.key;
 }
-function q(t, e) {
+function X(t, e) {
   const s = /* @__PURE__ */ new Set();
-  let n = 0, o = 0;
-  for (const r of t)
-    r != null && (r.key != null ? (n++, s.has(r.key) && console.warn(
-      `[pulse] Duplicate key "${String(r.key)}" in ${e} children. Keys must be unique among siblings.`
-    ), s.add(r.key)) : o++);
-  n > 0 && o > 0 && console.warn(
-    `[pulse] Mixed keyed and unkeyed children in ${e} list (${n} keyed, ${o} unkeyed). Either all children should have keys or none should.`
+  let n = 0, r = 0;
+  for (const o of t)
+    o != null && (o.key != null ? (n++, s.has(o.key) && console.warn(
+      `[pulse] Duplicate key "${String(o.key)}" in ${e} children. Keys must be unique among siblings.`
+    ), s.add(o.key)) : r++);
+  n > 0 && r > 0 && console.warn(
+    `[pulse] Mixed keyed and unkeyed children in ${e} list (${n} keyed, ${r} unkeyed). Either all children should have keys or none should.`
   );
 }
-function ut(t, e) {
-  var h;
-  process.env.NODE_ENV !== "production" && (q(t, "old"), q(e, "new"));
+function dt(t, e) {
+  var y;
+  process.env.NODE_ENV !== "production" && (X(t, "old"), X(e, "new"));
   const s = [];
-  let n = 0, o = t.length - 1, r = 0, c = e.length - 1, a = t[n], l = t[o], i = e[r], u = e[c];
-  for (; n <= o && r <= c; ) {
-    if (a == null) {
-      a = t[++n];
+  let n = 0, r = t.length - 1, o = 0, c = e.length - 1, l = t[n], a = t[r], i = e[o], p = e[c];
+  for (; n <= r && o <= c; ) {
+    if (l == null) {
+      l = t[++n];
       continue;
     }
-    if (l == null) {
-      l = t[--o];
+    if (a == null) {
+      a = t[--r];
       continue;
     }
-    if (O(a, i))
-      s.push(...k(a, i)), a = t[++n], i = e[++r];
-    else if (O(l, u))
-      s.push(...k(l, u)), l = t[--o], u = e[--c];
-    else if (O(a, u))
-      s.push({
-        type: y.MOVE,
-        vnode: a,
-        anchor: t[o + 1] || null,
-        childPatches: k(a, u)
-      }), a = t[++n], u = e[--c];
-    else if (O(l, i))
+    if (P(l, i))
+      s.push(...w(l, i)), l = t[++n], i = e[++o];
+    else if (P(a, p))
+      s.push(...w(a, p)), a = t[--r], p = e[--c];
+    else if (P(l, p))
       s.push({
-        type: y.MOVE,
+        type: m.MOVE,
         vnode: l,
-        anchor: a,
-        childPatches: k(l, i)
-      }), l = t[--o], i = e[++r];
+        anchor: t[r + 1] || null,
+        childPatches: w(l, p)
+      }), l = t[++n], p = e[--c];
+    else if (P(a, i))
+      s.push({
+        type: m.MOVE,
+        vnode: a,
+        anchor: l,
+        childPatches: w(a, i)
+      }), a = t[--r], i = e[++o];
     else
       break;
   }
-  if (n <= o && r <= c) {
-    const p = /* @__PURE__ */ new Map();
-    for (let f = n; f <= o; f++) {
-      const m = (h = t[f]) == null ? void 0 : h.key;
-      m != null && p.set(m, f);
+  if (n <= r && o <= c) {
+    const h = /* @__PURE__ */ new Map();
+    for (let u = n; u <= r; u++) {
+      const d = (y = t[u]) == null ? void 0 : y.key;
+      d != null && h.set(d, u);
     }
-    for (; r <= c; ) {
-      i = e[r];
-      const f = i.key != null ? p.get(i.key) : void 0;
-      if (f !== void 0) {
-        const m = t[f];
+    for (; o <= c; ) {
+      i = e[o];
+      const u = i.key != null ? h.get(i.key) : void 0;
+      if (u !== void 0) {
+        const d = t[u];
         s.push({
-          type: y.MOVE,
-          vnode: m,
+          type: m.MOVE,
+          vnode: d,
           anchor: t[n] || null,
-          childPatches: k(m, i)
-        }), t[f] = null, p.delete(i.key);
+          childPatches: w(d, i)
+        }), t[u] = null, h.delete(i.key);
       } else
         s.push({
-          type: y.CREATE,
+          type: m.CREATE,
           newVNode: i,
           anchor: t[n] || null
         });
-      r++;
+      o++;
     }
-    for (let f = n; f <= o; f++)
-      t[f] != null && s.push({ type: y.REMOVE, target: t[f] });
+    for (let u = n; u <= r; u++)
+      t[u] != null && s.push({ type: m.REMOVE, target: t[u] });
   }
-  if (n > o) {
-    const p = e[c + 1] || null;
-    for (let f = r; f <= c; f++)
-      s.push({ type: y.CREATE, newVNode: e[f], anchor: p });
-  } else if (r > c)
-    for (let p = n; p <= o; p++)
-      t[p] != null && s.push({ type: y.REMOVE, target: t[p] });
+  if (n > r) {
+    const h = e[c + 1] || null;
+    for (let u = o; u <= c; u++)
+      s.push({ type: m.CREATE, newVNode: e[u], anchor: h });
+  } else if (o > c)
+    for (let h = n; h <= r; h++)
+      t[h] != null && s.push({ type: m.REMOVE, target: t[h] });
   return s;
 }
-function N(t) {
-  if (t.type === j) {
-    const s = document.createTextNode(t.props.nodeValue);
-    return t._dom = s, s;
+const Z = "http://www.w3.org/2000/svg";
+function A(t, e) {
+  if (t.type === G) {
+    const n = document.createTextNode(t.props.nodeValue);
+    return t._dom = n, n;
   }
-  if (t.type === et) {
-    const s = document.createDocumentFragment();
-    for (const n of t.children)
-      s.appendChild(N(n));
-    return t._dom = s, s;
+  if (t.type === rt) {
+    const n = document.createDocumentFragment();
+    for (const r of t.children)
+      n.appendChild(A(r, e));
+    return t._dom = n, n;
   }
-  const e = document.createElement(t.type);
-  ft(e, {}, t.props);
-  for (const s of t.children)
-    e.appendChild(N(s));
-  return t._dom = e, e;
-}
-function ft(t, e, s) {
+  t.type === "svg" ? e = Z : t.type === "foreignObject" && (e = void 0);
+  const s = e ? document.createElementNS(e, t.type) : document.createElement(t.type);
+  mt(s, {}, t.props);
+  for (const n of t.children)
+    s.appendChild(A(n, e));
+  return t._dom = s, s;
+}
+function mt(t, e, s) {
   for (const n in e)
-    n === "children" || n === "key" || n in s || B(t, n, e[n]);
+    n === "children" || n === "key" || n in s || tt(t, n, e[n]);
   for (const n in s)
-    n === "children" || n === "key" || e[n] !== s[n] && K(t, n, s[n], e[n]);
+    n === "children" || n === "key" || e[n] !== s[n] && v(t, n, s[n], e[n]);
 }
-function K(t, e, s, n) {
+function v(t, e, s, n) {
   if (e.startsWith("on")) {
-    const o = e.slice(2).toLowerCase();
-    n && t.removeEventListener(o, n), s && t.addEventListener(o, s);
-  } else if (e === "className")
-    t.className = s || "";
+    const r = e.slice(2).toLowerCase();
+    n && t.removeEventListener(r, n), s && t.addEventListener(r, s);
+  } else if (e === "className" || e === "class")
+    t instanceof SVGElement ? t.setAttribute("class", s || "") : t.className = s || "";
   else if (e === "style" && typeof s == "object") {
     if (typeof n == "object" && n)
-      for (const o in n)
-        o in s || (t.style[o] = "");
+      for (const r in n)
+        r in s || (t.style[r] = "");
     Object.assign(t.style, s);
-  } else e === "ref" ? typeof s == "function" && s(t) : s === !0 ? t.setAttribute(e, "") : s === !1 || s == null ? t.removeAttribute(e) : t.setAttribute(e, s);
+  } else if (e === "dangerouslySetInnerHTML")
+    s && typeof s.__html == "string" && (t.innerHTML = s.__html);
+  else if (e === "ref")
+    typeof s == "function" && s(t);
+  else if (e in t && !(t instanceof SVGElement))
+    try {
+      t[e] = s ?? "";
+    } catch {
+      t.setAttribute(e, s);
+    }
+  else s === !0 ? t.setAttribute(e, "") : s === !1 || s == null ? t.removeAttribute(e) : t.setAttribute(e, s);
+}
+function tt(t, e, s) {
+  if (e.startsWith("on"))
+    t.removeEventListener(e.slice(2).toLowerCase(), s);
+  else if (e === "dangerouslySetInnerHTML")
+    t.innerHTML = "";
+  else if (e === "className" || e === "class")
+    t instanceof SVGElement ? t.removeAttribute("class") : t.className = "";
+  else if (e in t && !(t instanceof SVGElement))
+    try {
+      t[e] = "";
+    } catch {
+      t.removeAttribute(e);
+    }
+  else
+    t.removeAttribute(e);
 }
-function B(t, e, s) {
-  e.startsWith("on") ? t.removeEventListener(e.slice(2).toLowerCase(), s) : e === "className" ? t.className = "" : t.removeAttribute(e);
+function z(t) {
+  return t instanceof SVGElement ? Z : void 0;
 }
 function R(t, e) {
-  var s, n, o;
-  for (const r of e)
-    switch (r.type) {
-      case y.CREATE: {
-        const c = N(r.newVNode);
-        (s = r.anchor) != null && s._dom ? t.insertBefore(c, r.anchor._dom) : t.appendChild(c);
+  var s, n, r;
+  for (const o of e)
+    switch (o.type) {
+      case m.CREATE: {
+        const c = A(o.newVNode, z(t));
+        (s = o.anchor) != null && s._dom ? t.insertBefore(c, o.anchor._dom) : t.appendChild(c);
         break;
       }
-      case y.REMOVE: {
-        const c = r.target._dom;
+      case m.REMOVE: {
+        const c = o.target._dom;
         c != null && c.parentNode && c.parentNode.removeChild(c);
         break;
       }
-      case y.REPLACE: {
-        const c = N(r.newVNode), a = r.oldVNode._dom;
-        a != null && a.parentNode && a.parentNode.replaceChild(c, a);
+      case m.REPLACE: {
+        const c = o.oldVNode._dom, l = c == null ? void 0 : c.parentNode, a = A(
+          o.newVNode,
+          l ? z(l) : void 0
+        );
+        l && l.replaceChild(a, c);
         break;
       }
-      case y.UPDATE: {
-        const c = r.target._dom, { set: a, remove: l } = r.propPatches;
-        for (const i of l)
-          B(c, i, r.target.props[i]);
-        for (const i in a)
-          K(c, i, a[i], r.target.props[i]);
+      case m.UPDATE: {
+        const c = o.target._dom, { set: l, remove: a } = o.propPatches;
+        for (const i of a)
+          tt(c, i, o.target.props[i]);
+        for (const i in l)
+          v(c, i, l[i], o.target.props[i]);
         break;
       }
-      case y.TEXT: {
-        const c = r.oldVNode._dom;
-        c && (c.nodeValue = r.newVNode.props.nodeValue);
+      case m.TEXT: {
+        const c = o.oldVNode._dom;
+        c && (c.nodeValue = o.newVNode.props.nodeValue);
         break;
       }
-      case y.MOVE: {
-        const c = r.vnode._dom;
-        c && ((n = r.anchor) != null && n._dom ? t.insertBefore(c, r.anchor._dom) : t.appendChild(c)), (o = r.childPatches) != null && o.length && c && R(c, r.childPatches);
+      case m.MOVE: {
+        const c = o.vnode._dom;
+        c && ((n = o.anchor) != null && n._dom ? t.insertBefore(c, o.anchor._dom) : t.appendChild(c)), (r = o.childPatches) != null && r.length && c && R(c, o.childPatches);
         break;
       }
-      case y.CHILDREN: {
-        const c = r.parent._dom;
-        c && r.childPatches.length && R(c, r.childPatches);
+      case m.CHILDREN: {
+        const c = o.parent._dom;
+        c && o.childPatches.length && R(c, o.childPatches);
         break;
       }
     }
 }
-const M = /* @__PURE__ */ new WeakMap();
-function dt(t, e) {
-  const s = M.get(e);
+const F = /* @__PURE__ */ new WeakMap();
+function Et(t, e) {
+  const s = F.get(e);
   if (s) {
-    const n = T(t, e), o = [];
-    C(s.vTree, o);
-    const r = k(s.vTree, n);
-    R(e, r);
+    const n = k(t, e), r = [];
+    C(s.vTree, r);
+    const o = w(s.vTree, n);
+    R(e, o);
     const c = [];
     n && C(n, c);
-    const a = new Set(c);
-    for (const i of o)
-      a.has(i) || i.unmount();
-    const l = new Set(o);
+    const l = new Set(c);
+    for (const i of r)
+      l.has(i) || i.unmount();
+    const a = new Set(r);
     for (const i of c)
-      l.has(i) || i.mount(e, () => L(i, e));
-    M.set(e, { vTree: n });
+      a.has(i) || i.mount(e, () => D(i, e));
+    F.set(e, { vTree: n });
   } else {
-    const n = T(t, e);
+    const n = k(t, e);
     if (!n) return;
-    const o = N(n);
-    e.appendChild(o);
-    const r = [];
-    C(n, r);
-    for (const c of r)
-      c.mount(e, () => L(c, e));
-    M.set(e, { vTree: n });
+    const r = A(n);
+    e.appendChild(r);
+    const o = [];
+    C(n, o);
+    for (const c of o)
+      c.mount(e, () => D(c, e));
+    F.set(e, { vTree: n });
   }
 }
-function T(t, e) {
+function k(t, e) {
   var s;
   if (t == null) return null;
   if (typeof t.type == "function") {
-    if (t.type[H]) {
-      const o = t.type._lifecycle;
+    if (t.type[Y]) {
+      const r = t.type._lifecycle;
       try {
-        const r = new it(t.type, t.props), c = t.type(t.props), l = T(c, e) ?? D("");
-        if (l._instance) {
+        const o = new ft(t.type, t.props), c = t.type(t.props), a = k(c, e) ?? $("");
+        if (a._instance) {
           const i = {
             type: "div",
             props: { style: { display: "contents" } },
-            children: [l],
+            children: [a],
             key: t.key
           };
-          return i._instance = r, r.lastVTree = i, i;
+          return i._instance = o, o.lastVTree = i, i;
         }
-        return l._instance = r, r.lastVTree = l, l;
-      } catch (r) {
-        if (o != null && o.onError) {
-          const c = o.onError({ error: r, props: t.props });
-          return T(c, e);
+        return a._instance = o, o.lastVTree = a, a;
+      } catch (o) {
+        if (r != null && r.onError) {
+          const c = r.onError({
+            error: o,
+            props: t.props
+          });
+          return k(c, e);
         }
-        throw r;
+        throw o;
       }
     }
     const n = t.type({ ...t.props, children: t.children });
-    return T(n, e);
+    return k(n, e);
   }
-  return (s = t.children) != null && s.length && (t.children = t.children.map((n) => T(n, e)).filter((n) => n != null)), t;
+  return (s = t.children) != null && s.length && (t.children = t.children.map((n) => k(n, e)).filter((n) => n != null)), t;
 }
-function L(t, e) {
-  var o, r;
+function D(t, e) {
+  var r, o;
   if (!t._renderCallback) return;
   const s = t.connectedFn, n = s._lifecycle;
   try {
-    const c = s(t.props);
-    let l = T(c, e) ?? D(""), i;
-    if (l._instance && l._instance !== t ? (i = {
+    const c = s(t.props), a = k(c, e) ?? $("");
+    let i;
+    if (a._instance && a._instance !== t ? (i = {
       type: "div",
       props: { style: { display: "contents" } },
-      children: [l],
+      children: [a],
       key: null
-    }, i._instance = t) : (l._instance = t, i = l), t.lastVTree) {
-      F(t.lastVTree, t);
-      const m = k(t.lastVTree, i), x = ((o = t.lastVTree._dom) == null ? void 0 : o.parentNode) || e;
-      R(x, m), i._dom || (i._dom = t.lastVTree._dom);
+    }, i._instance = t) : (a._instance = t, i = a), t.lastVTree) {
+      W(t.lastVTree, t);
+      const d = w(t.lastVTree, i), g = ((r = t.lastVTree._dom) == null ? void 0 : r.parentNode) || e;
+      R(g, d), i._dom || (i._dom = t.lastVTree._dom);
     }
-    const u = [];
-    A(t.lastVTree, u, t);
-    const h = [];
-    A(i, h, t);
-    const p = new Set(h);
-    for (const m of u)
-      p.has(m) || m.unmount();
+    const p = [];
+    L(t.lastVTree, p, t);
+    const y = [];
+    L(i, y, t);
+    const h = new Set(y);
+    for (const d of p)
+      h.has(d) || d.unmount();
     t.lastVTree = i;
-    const f = new Set(u);
-    for (const m of h)
-      f.has(m) || m.mount(e, () => L(m, e));
+    const u = new Set(p);
+    for (const d of y)
+      u.has(d) || d.mount(e, () => D(d, e));
     n != null && n.onUpdate && n.onUpdate({
       dom: i == null ? void 0 : i._dom,
       props: t.props
     }), t.updateSelected();
   } catch (c) {
     if (n != null && n.onError) {
-      const a = n.onError({ error: c, props: t.props }), l = T(a, e);
-      if (t.lastVTree && l) {
-        F(t.lastVTree, t);
-        const u = k(t.lastVTree, l), h = ((r = t.lastVTree._dom) == null ? void 0 : r.parentNode) || e;
-        R(h, u), l._dom || (l._dom = t.lastVTree._dom);
+      const l = n.onError({ error: c, props: t.props }), a = k(l, e);
+      if (t.lastVTree && a) {
+        W(t.lastVTree, t);
+        const p = w(t.lastVTree, a), y = ((o = t.lastVTree._dom) == null ? void 0 : o.parentNode) || e;
+        R(y, p), a._dom || (a._dom = t.lastVTree._dom);
       }
       const i = [];
-      A(t.lastVTree, i, t);
-      for (const u of i) u.unmount();
-      t.lastVTree = l, t.updateSelected();
+      L(t.lastVTree, i, t);
+      for (const p of i) p.unmount();
+      t.lastVTree = a, t.updateSelected();
     } else
       throw c;
   }
 }
-function F(t, e) {
+function W(t, e) {
   if (!(!t || !t.children))
     for (let s = 0; s < t.children.length; s++) {
       const n = t.children[s];
-      n._instance && n._instance !== e && n._instance.lastVTree && n._instance.lastVTree !== n && (t.children[s] = n._instance.lastVTree), F(t.children[s], e);
+      n._instance && n._instance !== e && n._instance.lastVTree && n._instance.lastVTree !== n && (t.children[s] = n._instance.lastVTree), W(t.children[s], e);
     }
 }
 function C(t, e) {
@@ -484,148 +554,184 @@ function C(t, e) {
     for (const s of t.children)
       C(s, e);
 }
-function A(t, e, s) {
+function L(t, e, s) {
   if (t && (t._instance && t._instance !== s && e.push(t._instance), t.children))
     for (const n of t.children)
-      A(n, e, s);
+      L(n, e, s);
 }
-function P(t) {
+function j(t) {
   return t.length > 1 && t.endsWith("/") ? t.slice(0, -1) : t || "/";
 }
-function $(t) {
+function B(t) {
   const e = {};
   if (!t) return e;
   const s = t.startsWith("?") ? t.slice(1) : t;
-  return s && new URLSearchParams(s).forEach((o, r) => {
-    e[r] = o;
+  return s && new URLSearchParams(s).forEach((r, o) => {
+    e[o] = r;
   }), e;
 }
-function G(t, e) {
-  const s = P(t), n = P(e);
+function et(t, e) {
+  const s = j(t), n = j(e);
   if (n === "*")
     return { params: { "*": s } };
-  const o = s === "/" ? [""] : s.split("/").slice(1), r = n === "/" ? [""] : n.split("/").slice(1);
-  if (r.length > 0 && r[r.length - 1] === "*") {
-    const l = r.slice(0, -1);
-    if (o.length < l.length) return null;
+  const r = s === "/" ? [""] : s.split("/").slice(1), o = n === "/" ? [""] : n.split("/").slice(1);
+  if (o.length > 0 && o[o.length - 1] === "*") {
+    const a = o.slice(0, -1);
+    if (r.length < a.length) return null;
     const i = {};
-    for (let h = 0; h < l.length; h++) {
-      const p = l[h];
-      if (p.startsWith(":"))
-        i[p.slice(1)] = o[h];
-      else if (p !== o[h])
+    for (let y = 0; y < a.length; y++) {
+      const h = a[y];
+      if (h.startsWith(":"))
+        i[h.slice(1)] = r[y];
+      else if (h !== r[y])
         return null;
     }
-    const u = o.slice(l.length).join("/");
-    return i["*"] = u, { params: i };
+    const p = r.slice(a.length).join("/");
+    return i["*"] = p, { params: i };
   }
-  if (o.length !== r.length) return null;
-  const a = {};
-  for (let l = 0; l < r.length; l++) {
-    const i = r[l];
+  if (r.length !== o.length) return null;
+  const l = {};
+  for (let a = 0; a < o.length; a++) {
+    const i = o[a];
     if (i.startsWith(":"))
-      a[i.slice(1)] = o[l];
-    else if (i !== o[l])
+      l[i.slice(1)] = r[a];
+    else if (i !== r[a])
       return null;
   }
-  return { params: a };
+  return { params: l };
 }
-function X(t, e) {
+function Q(t, e) {
   for (const s of e) {
-    const n = G(t, s.path);
+    const n = et(t, s.path);
     if (n)
       return { pattern: s.path, params: n.params };
   }
   return null;
 }
-function yt(t) {
-  const { routes: e, initialPath: s } = t, n = s ?? window.location.pathname, o = s ? "" : window.location.search, r = P(n), c = $(o), a = X(r, e), l = st({
+function St(t) {
+  const { routes: e, initialPath: s } = t, n = s ?? window.location.pathname, r = s ? "" : window.location.search, o = j(n), c = B(r), l = Q(o, e), a = it({
     state: {
-      path: r,
-      params: (a == null ? void 0 : a.params) ?? {},
+      path: o,
+      params: (l == null ? void 0 : l.params) ?? {},
       query: c,
-      matched: (a == null ? void 0 : a.pattern) ?? null
+      matched: (l == null ? void 0 : l.pattern) ?? null
     },
     actions: {
-      _sync: (d, E) => E
+      _sync: (f, _) => _
     }
   });
-  function i(d) {
-    const E = d.indexOf("?"), S = P(E >= 0 ? d.slice(0, E) : d), w = E >= 0 ? d.slice(E + 1) : "", _ = $(w), b = X(S, e);
+  function i(f) {
+    const _ = f.indexOf("?"), V = j(
+      _ >= 0 ? f.slice(0, _) : f
+    ), O = _ >= 0 ? f.slice(_ + 1) : "", E = B(O), S = Q(V, e);
     return {
-      path: S,
-      params: (b == null ? void 0 : b.params) ?? {},
-      query: _,
-      matched: (b == null ? void 0 : b.pattern) ?? null
+      path: V,
+      params: (S == null ? void 0 : S.params) ?? {},
+      query: E,
+      matched: (S == null ? void 0 : S.pattern) ?? null
     };
   }
-  function u(d) {
-    const E = i(d);
-    window.history.pushState(null, "", d), l.dispatch("_sync", E);
+  function p(f) {
+    const _ = i(f);
+    window.history.pushState(null, "", f), a.dispatch("_sync", _);
   }
-  function h(d) {
-    const E = i(d);
-    window.history.replaceState(null, "", d), l.dispatch("_sync", E);
+  function y(f) {
+    const _ = i(f);
+    window.history.replaceState(null, "", f), a.dispatch("_sync", _);
   }
-  function p() {
+  function h() {
     window.history.back();
   }
-  function f() {
+  function u() {
     window.history.forward();
   }
-  function m() {
-    const d = i(
-      window.location.pathname + window.location.search
-    );
-    l.dispatch("_sync", d);
+  function d() {
+    const f = i(window.location.pathname + window.location.search);
+    a.dispatch("_sync", f);
   }
-  window.addEventListener("popstate", m);
-  function x() {
-    window.removeEventListener("popstate", m);
+  window.addEventListener("popstate", d);
+  function g() {
+    window.removeEventListener("popstate", d);
   }
-  const Q = ct({
-    _path: l.select((d) => d.path)
-  })(function(E) {
-    const { _path: S, path: w, component: _, children: b, ...Z } = E, U = G(S, w);
-    return U ? _ ? W(_, { ...Z, params: U.params }) : (b == null ? void 0 : b[0]) ?? null : null;
+  const b = ut({
+    _path: a.select((f) => f.path)
+  })(function(_) {
+    const { _path: V, path: O, component: E, children: S, ...nt } = _, q = et(V, O);
+    return q ? E ? K(E, { ...nt, params: q.params }) : (S == null ? void 0 : S[0]) ?? null : null;
   });
-  function J(d) {
-    const { to: E, children: S, ...w } = d;
-    return W(
+  function I(f) {
+    const { to: _, children: V, ...O } = f;
+    return K(
       "a",
       {
-        ...w,
-        href: E,
-        onClick: (_) => {
-          _.metaKey || _.ctrlKey || _.shiftKey || _.button !== 0 || (_.preventDefault(), u(E));
+        ...O,
+        href: _,
+        onClick: (E) => {
+          E.metaKey || E.ctrlKey || E.shiftKey || E.button !== 0 || (E.preventDefault(), p(_));
         }
       },
-      ...S || []
+      ...V || []
     );
   }
-  function Y(d) {
-    return h(d.to), null;
+  function x(f) {
+    return y(f.to), null;
   }
   return {
-    store: l,
-    navigate: u,
-    redirect: h,
-    back: p,
-    forward: f,
-    destroy: x,
-    Route: Q,
-    Link: J,
-    Redirect: Y
+    store: a,
+    navigate: p,
+    redirect: y,
+    back: h,
+    forward: u,
+    destroy: g,
+    Route: b,
+    Link: I,
+    Redirect: x
+  };
+}
+function gt() {
+  return (t, e) => {
+    const s = `[pulse] ${t.actionName}`;
+    console.group(s), console.log("prev state", t.prevState), console.log("payload", t.payload), e(), console.log("next state", t.nextState), console.groupEnd();
+  };
+}
+function bt(t, e) {
+  return async (...s) => {
+    e.start && t.dispatch(e.start);
+    try {
+      const n = await e.run(...s);
+      return t.dispatch(e.ok, n), n;
+    } catch (n) {
+      if (e.fail)
+        t.dispatch(e.fail, (n == null ? void 0 : n.message) ?? String(n));
+      else
+        throw n;
+      return;
+    }
+  };
+}
+function Tt(t, e) {
+  const s = (e == null ? void 0 : e.maxEntries) ?? 1 / 0;
+  return (n, r) => {
+    r(), t.push({
+      actionName: n.actionName,
+      payload: n.payload,
+      prevState: n.prevState,
+      nextState: n.nextState ?? n.prevState,
+      timestamp: Date.now()
+    }), t.length > s && t.splice(0, t.length - s);
   };
 }
 export {
-  et as Fragment,
-  ct as connect,
-  W as createElement,
-  yt as createRouter,
-  st as createStore,
-  ht as flushSync,
-  W as h,
-  dt as render
+  rt as Fragment,
+  Tt as actionHistory,
+  ut as connect,
+  bt as createAsyncAction,
+  K as createElement,
+  St as createRouter,
+  it as createStore,
+  _t as flushSync,
+  K as h,
+  gt as logger,
+  Et as render
 };
 //# sourceMappingURL=pulse.js.map