@raphy-js/raph 1.0.1-dev.20 → 1.0.1-dev.25

package/dist/{core-CyilRD7s.js → core-CClhT8WR.js}

@@ -1,84 +1,80 @@
 const Z = /* @__PURE__ */ new WeakMap(), mt = 16384;
 function Jt(t) {
-  var j;
-  if ($t(t.id, t.version), typeof t.states != "object" || t.states === null || Array.isArray(t.states))
+  if (Tt(t.id, t.version), typeof t.states != "object" || t.states === null || Array.isArray(t.states))
     throw new TypeError("[Raph machine] states must be an object.");
-  const e = t, n = [], r = /* @__PURE__ */ new Map(), i = [];
-  for (const [h, b] of Object.entries(e.states))
-    i.push(ct(h, b, void 0, 0, n, r));
-  const o = r.get(t.initial);
-  if (o === void 0 || ((j = n[o]) == null ? void 0 : j.parent) !== void 0)
+  const e = t, n = [], r = /* @__PURE__ */ new Map(), o = [];
+  for (const [f, w] of Object.entries(e.states))
+    o.push(ct(f, w, void 0, 0, n, r));
+  const i = r.get(t.initial);
+  if (i === void 0 || n[i]?.parent !== void 0)
     throw new Error(`[Raph machine] Initial state "${t.initial}" must be a root state key.`);
-  const s = /* @__PURE__ */ new Set(), a = n.map((h) => {
-    const b = h.initialKey === void 0 ? void 0 : h.children.find((z) => {
-      var l;
-      return ((l = n[z]) == null ? void 0 : l.key) === h.initialKey;
-    });
-    if (h.kind === "compound" && b === void 0)
-      throw new Error(`[Raph machine] Compound state "${h.path}" requires a valid direct initial child.`);
-    if (b !== void 0 && n[b].kind === "history")
-      throw new Error(`[Raph machine] Compound state "${h.path}" cannot use history as its initial child.`);
-    const E = h.historyFallbackPath === void 0 ? void 0 : r.get(h.historyFallbackPath);
-    if (h.historyFallbackPath !== void 0 && E === void 0)
+  const s = /* @__PURE__ */ new Set(), a = n.map((f) => {
+    const w = f.initialKey === void 0 ? void 0 : f.children.find((g) => n[g]?.key === f.initialKey);
+    if (f.kind === "compound" && w === void 0)
+      throw new Error(`[Raph machine] Compound state "${f.path}" requires a valid direct initial child.`);
+    if (w !== void 0 && n[w].kind === "history")
+      throw new Error(`[Raph machine] Compound state "${f.path}" cannot use history as its initial child.`);
+    const b = f.historyFallbackPath === void 0 ? void 0 : r.get(f.historyFallbackPath);
+    if (f.historyFallbackPath !== void 0 && b === void 0)
       throw new Error(
-        `[Raph machine] History state "${h.path}" has unknown fallback "${h.historyFallbackPath}".`
+        `[Raph machine] History state "${f.path}" has unknown fallback "${f.historyFallbackPath}".`
       );
-    for (const z of h.on.keys())
-      s.add(z);
+    for (const g of f.on.keys())
+      s.add(g);
     return {
-      after: h.after,
-      always: h.always,
-      children: Object.freeze([...h.children]),
-      depth: h.depth,
-      entry: h.entry,
-      exit: h.exit,
-      history: h.history,
-      ...E === void 0 ? {} : { historyFallback: E },
-      id: h.id,
-      ...b === void 0 ? {} : { initial: b },
-      invokes: h.invokes,
-      key: h.key,
-      kind: h.kind,
-      ...h.meta === void 0 ? {} : { meta: h.meta },
-      on: h.on,
-      onDone: h.onDone,
-      ...h.output === void 0 ? {} : { output: h.output },
-      ...h.parent === void 0 ? {} : { parent: h.parent },
-      path: h.path,
-      resources: h.resources,
-      tags: h.tags
+      after: f.after,
+      always: f.always,
+      children: Object.freeze([...f.children]),
+      depth: f.depth,
+      entry: f.entry,
+      exit: f.exit,
+      history: f.history,
+      ...b === void 0 ? {} : { historyFallback: b },
+      id: f.id,
+      ...w === void 0 ? {} : { initial: w },
+      invokes: f.invokes,
+      key: f.key,
+      kind: f.kind,
+      ...f.meta === void 0 ? {} : { meta: f.meta },
+      on: f.on,
+      onDone: f.onDone,
+      ...f.output === void 0 ? {} : { output: f.output },
+      ...f.parent === void 0 ? {} : { parent: f.parent },
+      path: f.path,
+      resources: f.resources,
+      tags: f.tags
     };
   });
-  for (const h of a)
-    zt(h, r, a);
-  const c = t.version ?? 1;
-  kt(a);
-  const u = Object.freeze([...s]), f = new Map(u.map((h, b) => [h, b])), d = Object.freeze(a.map((h) => Object.freeze(Et(a, h.id)))), p = xt(a), v = p && u.length <= Math.floor(
+  for (const f of a)
+    St(f, r, a);
+  const u = t.version ?? 1;
+  $t(a);
+  const h = Object.freeze([...s]), c = new Map(h.map((f, w) => [f, w])), d = Object.freeze(a.map((f) => Object.freeze(Et(a, f.id)))), l = gt(a), y = l && h.length <= Math.floor(
     mt / a.length
-  ) ? jt(a, f, u.length) : void 0, w = Object.freeze({
+  ) ? jt(a, c, h.length) : void 0, v = Object.freeze({
     ancestry: d,
     context: It(e.context),
-    eventIndexes: f,
-    eventTypes: u,
-    flat: p,
-    ...v === void 0 ? {} : { flatDispatch: v },
+    eventIndexes: c,
+    eventTypes: h,
+    flat: l,
+    ...y === void 0 ? {} : { flatDispatch: y },
     id: t.id,
-    initial: o,
-    migrations: At(t.migrations, c),
+    initial: i,
+    migrations: At(t.migrations, u),
     ...e.output === void 0 ? {} : { output: e.output },
     pathToState: r,
-    rootChildren: Object.freeze(i),
+    rootChildren: Object.freeze(o),
     states: Object.freeze(a),
-    version: c
-  }), m = Object.freeze({ id: t.id, version: c });
-  return Z.set(m, w), m;
+    version: u
+  }), m = Object.freeze({ id: t.id, version: u });
+  return Z.set(m, v), m;
 }
 function jt(t, e, n) {
   const r = Array.from({ length: t.length * n }).fill(void 0);
-  for (const i of t) {
-    const o = i.id * n;
-    for (const [s, a] of i.on)
-      r[o + e.get(s)] = a;
+  for (const o of t) {
+    const i = o.id * n;
+    for (const [s, a] of o.on)
+      r[i + e.get(s)] = a;
   }
   return Object.freeze(r);
 }
@@ -88,7 +84,7 @@ function Et(t, e) {
     n.push(r);
   return n;
 }
-function xt(t) {
+function gt(t) {
   return t.every((e) => {
     if (e.parent !== void 0 || e.kind !== "atomic" && e.kind !== "final" || e.always.length !== 0 || e.onDone.length !== 0 || e.after.size !== 0 || e.entry.length !== 0 || e.exit.length !== 0 || e.resources.length !== 0 || e.invokes.length !== 0)
       return !1;
@@ -104,14 +100,14 @@ function F(t) {
     throw new TypeError("[Raph machine] Model was not created by defineMachine().");
   return e;
 }
-function ct(t, e, n, r, i, o) {
+function ct(t, e, n, r, o, i) {
   if (typeof e != "object" || e === null || Array.isArray(e))
     throw new TypeError(`[Raph machine] State "${t}" must be an object.`);
-  Tt(e, t), Mt(t);
-  const s = n === void 0 ? "" : i[n].path, a = s ? `${s}.${t}` : t, c = i.length;
-  if (o.has(a))
+  kt(e, t), Mt(t);
+  const s = n === void 0 ? "" : o[n].path, a = s ? `${s}.${t}` : t, u = o.length;
+  if (i.has(a))
     throw new Error(`[Raph machine] Duplicate state path "${a}".`);
-  const u = gt(e), f = {
+  const h = zt(e), c = {
     after: /* @__PURE__ */ new Map(),
     always: Object.freeze([]),
     children: [],
@@ -120,11 +116,11 @@ function ct(t, e, n, r, i, o) {
     exit: P(e.exit),
     history: e.history ?? "shallow",
     ...e.target === void 0 ? {} : { historyFallbackPath: e.target },
-    id: c,
+    id: u,
     ...e.initial === void 0 ? {} : { initialKey: e.initial },
     invokes: Object.freeze([]),
     key: t,
-    kind: u,
+    kind: h,
     ...e.meta === void 0 ? {} : { meta: Object.freeze({ ...e.meta }) },
     on: /* @__PURE__ */ new Map(),
     onDone: Object.freeze([]),
@@ -134,43 +130,43 @@ function ct(t, e, n, r, i, o) {
     resources: ot(e.resources),
     tags: ot(e.tags)
   };
-  i.push(f), o.set(a, c);
-  for (const [v, w] of Object.entries(e.states ?? {}))
-    f.children.push(ct(v, w, c, r + 1, i, o));
+  o.push(c), i.set(a, u);
+  for (const [y, v] of Object.entries(e.states ?? {}))
+    c.children.push(ct(y, v, u, r + 1, o, i));
   let d = 0;
-  for (const [v, w] of Object.entries(e.on ?? {})) {
-    if (!v.trim())
+  for (const [y, v] of Object.entries(e.on ?? {})) {
+    if (!y.trim())
       throw new Error(`[Raph machine] State "${a}" has an empty event type.`);
-    f.on.set(v, M(w, c, () => d++));
+    c.on.set(y, M(v, u, () => d++));
   }
-  f.always = M(e.always, c, () => d++), f.onDone = M(e.onDone, c, () => d++);
-  for (const [v, w] of Object.entries(e.after ?? {})) {
-    if (!v.trim())
+  c.always = M(e.always, u, () => d++), c.onDone = M(e.onDone, u, () => d++);
+  for (const [y, v] of Object.entries(e.after ?? {})) {
+    if (!y.trim())
       throw new Error(`[Raph machine] State "${a}" has an empty delay key.`);
-    f.after.set(v, M(w, c, () => d++));
+    c.after.set(y, M(v, u, () => d++));
   }
-  const p = Pt(e.invoke);
-  return f.invokes = Object.freeze(p.map((v, w) => St(
+  const l = Pt(e.invoke);
+  return c.invokes = Object.freeze(l.map((y, v) => xt(
+    y,
+    c,
     v,
-    f,
-    w,
     () => d++
-  ))), Rt(f, i), c;
+  ))), Rt(c, o), u;
 }
-function St(t, e, n, r) {
+function xt(t, e, n, r) {
   if (typeof t != "object" || t === null || Array.isArray(t))
     throw new TypeError(`[Raph machine] Invoke in "${e.path}" must be an object.`);
-  const i = typeof t.src == "string" ? "task" : "machine", o = t.type ?? i, s = t.id ?? `${e.path}:invoke#${n + 1}`;
+  const o = typeof t.src == "string" ? "task" : "machine", i = t.type ?? o, s = t.id ?? `${e.path}:invoke#${n + 1}`;
   if (!s.trim())
     throw new Error(`[Raph machine] Invoke id in "${e.path}" must not be empty.`);
-  if (o !== "machine" && o !== "task")
-    throw new Error(`[Raph machine] Invoke "${s}" has unsupported type "${String(o)}".`);
+  if (i !== "machine" && i !== "task")
+    throw new Error(`[Raph machine] Invoke "${s}" has unsupported type "${String(i)}".`);
   if (typeof t.src == "string") {
     if (!t.src.trim())
       throw new Error(`[Raph machine] Invoke "${s}" source must not be empty.`);
   } else if (!Z.has(t.src))
     throw new TypeError(`[Raph machine] Invoke "${s}" actor source must come from defineMachine().`);
-  if (o === "task" && typeof t.src != "string")
+  if (i === "task" && typeof t.src != "string")
     throw new TypeError(`[Raph machine] Task invoke "${s}" requires a string source.`);
   return Object.freeze({
     id: s,
@@ -178,54 +174,53 @@ function St(t, e, n, r) {
     onDone: M(t.onDone, e.id, r),
     onError: M(t.onError, e.id, r),
     src: t.src,
-    type: o
+    type: i
   });
 }
 function M(t, e, n) {
   if (t === void 0)
     return Object.freeze([]);
   const r = Array.isArray(t) ? t : [t];
-  return Object.freeze(r.map((i) => {
-    const o = typeof i == "string" ? { target: i } : i;
-    if (o === null || typeof o != "object")
+  return Object.freeze(r.map((o) => {
+    const i = typeof o == "string" ? { target: o } : o;
+    if (i === null || typeof i != "object")
       throw new TypeError("[Raph machine] Transition must be a target string or object.");
-    if (o.reenter === !0 && o.target === void 0)
+    if (i.reenter === !0 && i.target === void 0)
       throw new Error("[Raph machine] A targetless transition cannot declare reenter: true.");
-    if (o.reason !== void 0 && (typeof o.reason != "string" || !o.reason.trim()))
+    if (i.reason !== void 0 && (typeof i.reason != "string" || !i.reason.trim()))
       throw new Error("[Raph machine] Transition reason must be a non-empty string.");
-    return W(o.guard === void 0 ? [] : [o.guard], "guard"), W(P(o.reduce), "reducer"), W(P(o.emit), "output"), {
-      emit: P(o.emit),
-      ...o.guard === void 0 ? {} : { guard: o.guard },
+    return W(i.guard === void 0 ? [] : [i.guard], "guard"), W(P(i.reduce), "reducer"), W(P(i.emit), "output"), {
+      emit: P(i.emit),
+      ...i.guard === void 0 ? {} : { guard: i.guard },
       index: n(),
-      ...o.raise === void 0 ? {} : { raise: o.raise },
-      ...o.reason === void 0 ? {} : { reason: o.reason },
-      reduce: P(o.reduce),
-      reenter: o.reenter === !0,
+      ...i.raise === void 0 ? {} : { raise: i.raise },
+      ...i.reason === void 0 ? {} : { reason: i.reason },
+      reduce: P(i.reduce),
+      reenter: i.reenter === !0,
       source: e,
-      ...o.target === void 0 ? {} : { target: o.target }
+      ...i.target === void 0 ? {} : { target: i.target }
     };
   }));
 }
-function zt(t, e, n) {
-  var i;
+function St(t, e, n) {
   const r = [t.always, t.onDone, ...t.on.values(), ...t.after.values()];
   for (const o of t.invokes)
     r.push(o.onDone, o.onError);
   for (const o of r)
-    for (const s of o) {
-      if (s.target !== void 0) {
-        const a = s.target, c = e.get(a);
-        if (c === void 0)
+    for (const i of o) {
+      if (i.target !== void 0) {
+        const s = i.target, a = e.get(s);
+        if (a === void 0)
           throw new Error(
-            `[Raph machine] Transition from "${t.path}" targets unknown state "${a}".`
+            `[Raph machine] Transition from "${t.path}" targets unknown state "${s}".`
           );
-        s.target = c;
+        i.target = a;
       }
-      Object.freeze(s);
+      Object.freeze(i);
     }
   if (t.kind === "history" && t.historyFallback !== void 0) {
-    const o = (i = [...e].find(([, a]) => a === t.historyFallback)) == null ? void 0 : i[0], s = t.path.slice(0, t.path.lastIndexOf("."));
-    if (o === void 0 || o === t.path || t.historyFallback === void 0 || !o.startsWith(`${s}.`))
+    const o = [...e].find(([, s]) => s === t.historyFallback)?.[0], i = t.path.slice(0, t.path.lastIndexOf("."));
+    if (o === void 0 || o === t.path || t.historyFallback === void 0 || !o.startsWith(`${i}.`))
       throw new Error(
         `[Raph machine] History fallback for "${t.path}" must stay inside its parent state.`
       );
@@ -233,7 +228,7 @@ function zt(t, e, n) {
       throw new Error(`[Raph machine] History fallback for "${t.path}" cannot target another history state.`);
   }
 }
-function gt(t) {
+function zt(t) {
   if (t.type !== void 0) {
     if (t.type !== "atomic" && t.type !== "compound" && t.type !== "final" && t.type !== "history" && t.type !== "parallel")
       throw new TypeError(`[Raph machine] Unsupported state type "${String(t.type)}".`);
@@ -257,7 +252,7 @@ function Rt(t, e) {
   if ((t.kind === "final" || t.kind === "history") && (t.on.size !== 0 || t.always.length !== 0 || t.after.size !== 0 || t.onDone.length !== 0 || t.invokes.length !== 0))
     throw new Error(`[Raph machine] ${t.kind} state "${t.path}" cannot declare transitions or invokes.`);
 }
-function Tt(t, e) {
+function kt(t, e) {
   if (V(t.states, `State "${e}" states`), V(t.on, `State "${e}" on`), V(t.after, `State "${e}" after`), t.history !== void 0 && t.history !== "deep" && t.history !== "shallow")
     throw new TypeError(`[Raph machine] State "${e}" has unsupported history mode.`);
 }
@@ -265,14 +260,14 @@ function V(t, e) {
   if (t !== void 0 && (typeof t != "object" || t === null || Array.isArray(t)))
     throw new TypeError(`[Raph machine] ${e} must be an object.`);
 }
-function $t(t, e) {
+function Tt(t, e) {
   if (typeof t != "string" || !t.trim())
     throw new TypeError("[Raph machine] Model id must be a non-empty string.");
   const n = e ?? 1;
   if (!Number.isSafeInteger(n) || n < 1)
     throw new TypeError("[Raph machine] Model version must be a positive safe integer.");
 }
-function kt(t) {
+function $t(t) {
   const e = /* @__PURE__ */ new Set();
   for (const n of t)
     for (const r of n.invokes) {
@@ -283,13 +278,13 @@ function kt(t) {
 }
 function At(t, e) {
   const n = /* @__PURE__ */ new Map();
-  for (const [r, i] of Object.entries(t ?? {})) {
-    const o = Number(r);
-    if (!Number.isSafeInteger(o) || o < 1 || o >= e)
+  for (const [r, o] of Object.entries(t ?? {})) {
+    const i = Number(r);
+    if (!Number.isSafeInteger(i) || i < 1 || i >= e)
       throw new Error(`[Raph machine] Migration version "${r}" must be a positive integer below ${e}.`);
-    if (typeof i != "function")
-      throw new TypeError(`[Raph machine] Migration from version ${o} must be a function.`);
-    n.set(o, i);
+    if (typeof o != "function")
+      throw new TypeError(`[Raph machine] Migration from version ${i} must be a function.`);
+    n.set(i, o);
   }
   return n;
 }
@@ -321,33 +316,33 @@ function It(t) {
   return Array.isArray(t) ? Object.freeze([...t]) : typeof t == "object" && t !== null && Object.getPrototypeOf(t) === Object.prototype ? Object.freeze({ ...t }) : t;
 }
 const T = Symbol("RaphMachineSnapshot"), it = /* @__PURE__ */ new WeakMap();
-function ft(t) {
+function ut(t) {
   const e = Object.getPrototypeOf(t);
   return e !== null && Object.hasOwn(e, T) ? e : void 0;
 }
-function ut(t) {
+function ft(t) {
   return t[T];
 }
 function L(t, e, n) {
-  const r = n ?? Object.freeze({ [T]: e }), i = Object.create(r);
-  return i.active = t.active, i.context = t.context, i.history = t.history, t.output !== void 0 && (i.output = t.output), i.revision = t.revision, i.status = t.status, Object.freeze(i);
+  const r = n ?? Object.freeze({ [T]: e }), o = Object.create(r);
+  return o.active = t.active, o.context = t.context, o.history = t.history, t.output !== void 0 && (o.output = t.output), o.revision = t.revision, o.status = t.status, Object.freeze(o);
 }
-function J(t, e, n, r, i) {
-  let o = t == null ? void 0 : t.flatPrototypes;
-  o === void 0 && (n === void 0 ? (o = it.get(r), o === void 0 && (o = [], it.set(r, o))) : o = []);
-  const s = o[e];
+function J(t, e, n, r, o) {
+  let i = t?.flatPrototypes;
+  i === void 0 && (n === void 0 ? (i = it.get(r), i === void 0 && (i = [], it.set(r, i))) : i = []);
+  const s = i[e];
   if (s !== void 0)
     return s;
   const a = Object.freeze({
     [T]: Object.freeze({
       active: Object.freeze([e]),
-      flatPrototypes: o,
+      flatPrototypes: i,
       input: n,
       model: r,
-      publicActive: Object.freeze([i])
+      publicActive: Object.freeze([o])
     })
   });
-  return o[e] = a, a;
+  return i[e] = a, a;
 }
 const Dt = 100, G = Object.freeze({ type: "@@init" }), ht = Object.freeze([]), q = Object.freeze({}), K = Object.freeze([]), D = Object.freeze([]), Ft = Object.freeze([]), Q = Object.freeze({
   entered: K,
@@ -360,9 +355,9 @@ const Dt = 100, G = Object.freeze({ type: "@@init" }), ht = Object.freeze([]), q
 function Qt(t, e) {
   return _t(t, e, void 0).snapshot;
 }
-function te(t, e, n, r, i) {
-  const o = ut(e);
-  if (o !== void 0 && o.model !== t)
+function te(t, e, n, r, o) {
+  const i = ft(e);
+  if (i !== void 0 && i.model !== t)
     throw new TypeError("[Raph machine] Snapshot belongs to another model.");
   const s = F(t);
   return tt(
@@ -370,14 +365,13 @@ function te(t, e, n, r, i) {
     e,
     n,
     r,
-    o == null ? void 0 : o.input,
-    i,
+    i?.input,
+    o,
     s
   ).snapshot;
 }
 function Ct(t, e) {
-  var n;
-  if (((n = ft(e)) == null ? void 0 : n[T].model) !== t)
+  if (ut(e)?.[T].model !== t)
     throw new TypeError("[Raph machine] Snapshot belongs to another model or was not created by Raph.");
 }
 function ee(t, e) {
@@ -386,7 +380,7 @@ function ee(t, e) {
     e
   ), e.status === "stopped")
     return e;
-  const n = ft(e);
+  const n = ut(e);
   return L({
     active: e.active,
     context: e.context,
@@ -397,139 +391,139 @@ function ee(t, e) {
   }, n[T], n);
 }
 function _t(t, e, n, r) {
-  const i = F(t), o = i.context, s = typeof o == "function" ? o(e) : o;
-  if (i.flat) {
-    const u = i.states[i.initial], f = u.kind === "final" ? "done" : "active", d = f === "done" ? u.output ?? i.output : void 0, p = typeof d == "function" ? d({ context: s, event: G, input: e }) : d, v = J(
+  const o = F(t), i = o.context, s = typeof i == "function" ? i(e) : i;
+  if (o.flat) {
+    const h = o.states[o.initial], c = h.kind === "final" ? "done" : "active", d = c === "done" ? h.output ?? o.output : void 0, l = typeof d == "function" ? d({ context: s, event: G, input: e }) : d, y = J(
       void 0,
-      i.initial,
+      o.initial,
       e,
       t,
-      u.path
-    ), w = v[T], m = L({
-      active: w.publicActive,
+      h.path
+    ), v = y[T], m = L({
+      active: v.publicActive,
       context: rt(s),
       history: q,
-      ...p === void 0 ? {} : { output: p },
+      ...l === void 0 ? {} : { output: l },
       revision: 0,
-      status: f
-    }, w, v);
+      status: c
+    }, v, y);
     return { changed: !1, plan: Q, snapshot: m };
   }
-  const a = $(i, i.initial, q), c = C(t, e, {
+  const a = $(o, o.initial, q), u = C(t, e, {
     active: a,
     context: s,
     history: q
-  }, 0, "active", void 0, i);
-  return tt(t, c, G, n, e, r, i, !0);
+  }, 0, "active", void 0, o);
+  return tt(t, u, G, n, e, r, o, !0);
 }
-function tt(t, e, n, r, i, o, s, a = !1, c = ht) {
+function tt(t, e, n, r, o, i, s, a = !1, u = ht) {
   return Ot(n), Nt(
     t,
     e,
     n,
     r,
-    i,
     o,
+    i,
     s,
     void 0,
     a,
-    c
+    u
   );
 }
-function Nt(t, e, n, r, i, o, s, a, c = !1, u = ht) {
-  const f = s ?? F(t);
+function Nt(t, e, n, r, o, i, s, a, u = !1, h = ht) {
+  const c = s ?? F(t);
   if (e.status !== "active")
     return I(e);
-  if (!c && f.flat) {
-    const y = a ?? f.eventIndexes.get(n.type);
-    return y === void 0 ? I(e) : Ht(t, f, e, n, y, r, i, o);
+  if (!u && c.flat) {
+    const E = a ?? c.eventIndexes.get(n.type);
+    return E === void 0 ? I(e) : Ht(t, c, e, n, E, r, o, i);
   }
-  if (!c && !Gt(f, e.active, n.type))
+  if (!u && !Gt(c, e.active, n.type))
     return I(e);
   const d = {
-    active: e.active.map((y) => N(f, y)),
+    active: e.active.map((E) => N(c, E)),
     context: e.context,
     history: { ...e.history }
-  }, p = r, v = /* @__PURE__ */ new Set(), w = /* @__PURE__ */ new Set(), m = [], j = [], h = [], b = [...u];
-  let E = !1;
-  if (!c) {
-    const y = st(f, d, n, p, i, o);
-    at(y, v, w, m, j, h), E = y.changed, b.push(...y.raised);
+  }, l = r, y = /* @__PURE__ */ new Set(), v = /* @__PURE__ */ new Set(), m = [], f = [], w = [], b = [...h];
+  let g = !1;
+  if (!u) {
+    const E = st(c, d, n, l, o, i);
+    at(E, y, v, m, f, w), g = E.changed, b.push(...E.raised);
   }
-  const z = /* @__PURE__ */ new Set();
-  let l = 0;
+  const p = /* @__PURE__ */ new Set();
+  let O = 0;
   for (; ; ) {
-    const y = b.shift();
+    const E = b.shift();
     let x;
-    if (y !== void 0 ? x = st(f, d, y, p, i, o) : (x = Kt(f, d, n, p, i, o), x.changed || (x = Lt(
-      f,
+    if (E !== void 0 ? x = st(c, d, E, l, o, i) : (x = Kt(c, d, n, l, o, i), x.changed || (x = Lt(
+      c,
       d,
       n,
+      l,
+      o,
       p,
-      i,
-      z,
-      o
+      i
     ))), !x.changed) {
       if (b.length !== 0)
         continue;
       break;
     }
-    if (++l > Dt)
+    if (++O > Dt)
       throw new Error("[Raph machine] Macrostep exceeded 100 stabilization microsteps.");
     for (const U of x.exited)
-      z.delete(U);
+      p.delete(U);
     for (const U of x.entered)
-      z.delete(U);
-    E = !0, at(x, v, w, m, j, h), b.push(...x.raised);
+      p.delete(U);
+    g = !0, at(x, y, v, m, f, w), b.push(...x.raised);
   }
-  const O = nt(f, d.active) ? "done" : "active";
-  if (!E && O === e.status)
+  const R = nt(c, d.active) ? "done" : "active";
+  if (!g && R === e.status)
     return I(e);
-  const k = O === "done" ? yt(f, d, n, i) : void 0, g = C(
+  const z = R === "done" ? yt(c, d, n, o) : void 0, k = C(
     t,
-    i,
+    o,
     d,
     e.revision + 1,
-    O,
-    k,
-    f
-  ), R = new Set(_(f, d.active));
+    R,
+    z,
+    c
+  ), j = new Set(_(c, d.active));
   return Object.freeze({
     changed: !0,
     plan: Object.freeze({
-      entered: Object.freeze([...w].filter((y) => R.has(y)).sort((y, x) => f.states[y].depth - f.states[x].depth)),
-      entryOutputs: Object.freeze(h),
+      entered: Object.freeze([...v].filter((E) => j.has(E)).sort((E, x) => c.states[E].depth - c.states[x].depth)),
+      entryOutputs: Object.freeze(w),
       event: n,
-      exited: Object.freeze([...v].sort((y, x) => f.states[x].depth - f.states[y].depth)),
+      exited: Object.freeze([...y].sort((E, x) => c.states[x].depth - c.states[E].depth)),
       exitOutputs: Object.freeze(m),
-      transitionOutputs: Object.freeze(j)
+      transitionOutputs: Object.freeze(f)
     }),
-    snapshot: g
+    snapshot: k
   });
 }
-function Ht(t, e, n, r, i, o, s, a) {
-  const c = ut(n), u = (c == null ? void 0 : c.active[0]) ?? N(e, n.active[0]), f = e.flatDispatch === void 0 ? e.states[u].on.get(r.type) : e.flatDispatch[u * e.eventTypes.length + i], d = H(
-    f ?? Ft,
+function Ht(t, e, n, r, o, i, s, a) {
+  const u = ft(n), h = u?.active[0] ?? N(e, n.active[0]), c = e.flatDispatch === void 0 ? e.states[h].on.get(r.type) : e.flatDispatch[h * e.eventTypes.length + o], d = H(
+    c ?? Ft,
     n.context,
     r,
-    o,
+    i,
     s,
     a
   );
   if (d === void 0)
     return I(n);
   dt(e, d, a);
-  let p = n.context;
-  for (const z of d.reduce)
-    p = vt(
-      z,
-      o
-    )({ context: p, event: r, input: s });
-  const v = d.target ?? u, w = e.states[v], m = w.kind === "final" ? "done" : "active", j = m === "done" ? w.output ?? e.output : void 0, h = typeof j == "function" ? j({ context: p, event: r, input: s }) : j, b = J(c, v, s, t, w.path), E = L({
-    active: v === u ? n.active : b[T].publicActive,
-    context: p === n.context ? n.context : rt(p),
+  let l = n.context;
+  for (const p of d.reduce)
+    l = vt(
+      p,
+      i
+    )({ context: l, event: r, input: s });
+  const y = d.target ?? h, v = e.states[y], m = v.kind === "final" ? "done" : "active", f = m === "done" ? v.output ?? e.output : void 0, w = typeof f == "function" ? f({ context: l, event: r, input: s }) : f, b = J(u, y, s, t, v.path), g = L({
+    active: y === h ? n.active : b[T].publicActive,
+    context: l === n.context ? n.context : rt(l),
     history: n.history,
-    ...h === void 0 ? {} : { output: h },
+    ...w === void 0 ? {} : { output: w },
     revision: n.revision + 1,
     status: m
   }, b[T], b);
@@ -544,77 +538,77 @@ function Ht(t, e, n, r, i, o, s, a) {
       transitionOutputRefs: d.emit,
       transitionOutputs: D
     },
-    snapshot: E
+    snapshot: g
   };
 }
-function ne(t, e, n, r, i, o, s) {
-  const a = F(t), c = H(
+function ne(t, e, n, r, o, i, s) {
+  const a = F(t), u = H(
     r,
     e.context,
     n,
-    i,
     o,
+    i,
     s
   );
-  if (c === void 0)
+  if (u === void 0)
     return I(e);
-  const u = {
+  const h = {
     active: e.active.map((b) => N(a, b)),
     context: e.context,
     history: { ...e.history }
-  }, f = Y(
+  }, c = Y(
     a,
-    u,
-    [c],
+    h,
+    [u],
     n,
-    i,
     o,
+    i,
     s
   ), d = C(
     t,
-    o,
-    u,
+    i,
+    h,
     e.revision,
     "active",
     void 0,
     a
-  ), p = tt(
+  ), l = tt(
     t,
     d,
     n,
-    i,
     o,
+    i,
     s,
     a,
     !0,
-    f.raised
-  ), v = p.changed ? {
-    active: p.snapshot.active.map((b) => N(a, b)),
-    context: p.snapshot.context,
-    history: { ...p.snapshot.history }
-  } : u, w = p.changed ? p.snapshot.status : nt(a, v.active) ? "done" : "active", m = w === "done" ? p.snapshot.output ?? yt(a, v, n, o) : void 0, j = C(
+    c.raised
+  ), y = l.changed ? {
+    active: l.snapshot.active.map((b) => N(a, b)),
+    context: l.snapshot.context,
+    history: { ...l.snapshot.history }
+  } : h, v = l.changed ? l.snapshot.status : nt(a, y.active) ? "done" : "active", m = v === "done" ? l.snapshot.output ?? yt(a, y, n, i) : void 0, f = C(
     t,
-    o,
-    v,
+    i,
+    y,
     e.revision + 1,
-    w,
+    v,
     m,
     a
-  ), h = new Set(_(a, v.active));
+  ), w = new Set(_(a, y.active));
   return Object.freeze({
     changed: !0,
     plan: Object.freeze({
-      entered: Object.freeze(A([...f.entered, ...p.plan.entered]).filter((b) => h.has(b)).sort((b, E) => a.states[b].depth - a.states[E].depth)),
-      entryOutputs: Object.freeze([...f.entryOutputs, ...p.plan.entryOutputs]),
+      entered: Object.freeze(A([...c.entered, ...l.plan.entered]).filter((b) => w.has(b)).sort((b, g) => a.states[b].depth - a.states[g].depth)),
+      entryOutputs: Object.freeze([...c.entryOutputs, ...l.plan.entryOutputs]),
       event: n,
-      exited: Object.freeze(A([...f.exited, ...p.plan.exited]).sort((b, E) => a.states[E].depth - a.states[b].depth)),
-      exitOutputs: Object.freeze([...f.exitOutputs, ...p.plan.exitOutputs]),
+      exited: Object.freeze(A([...c.exited, ...l.plan.exited]).sort((b, g) => a.states[g].depth - a.states[b].depth)),
+      exitOutputs: Object.freeze([...c.exitOutputs, ...l.plan.exitOutputs]),
       transitionOutputs: Object.freeze([
-        ...f.transitionOutputs,
-        ...p.plan.transitionOutputs
+        ...c.transitionOutputs,
+        ...l.plan.transitionOutputs
       ])
     }),
-    snapshot: j
+    snapshot: f
   });
 }
 function re(t, e, n) {
@@ -623,12 +617,12 @@ function re(t, e, n) {
     throw new Error(`[Raph machine] Unknown persisted status "${String(e.status)}".`);
   if (!Number.isSafeInteger(e.revision) || e.revision < 0)
     throw new Error("[Raph machine] Persisted revision must be a non-negative safe integer.");
-  const i = e.active.map((o) => N(r, o));
-  return qt(r, i, e.history, e.status), C(
+  const o = e.active.map((i) => N(r, i));
+  return qt(r, o, e.history, e.status), C(
     t,
     n,
     {
-      active: A(i),
+      active: A(o),
       context: e.context,
       history: { ...e.history }
     },
@@ -651,45 +645,45 @@ function qt(t, e, n, r) {
   for (const s of t.states) {
     if (s.kind !== "compound" && s.kind !== "parallel")
       continue;
-    const a = s.children.filter((u) => t.states[u].kind !== "history" && e.some((f) => f === u || S(t, u, f)));
-    if (e.some((u) => S(t, s.id, u))) {
+    const a = s.children.filter((h) => t.states[h].kind !== "history" && e.some((c) => c === h || S(t, h, c)));
+    if (e.some((h) => S(t, s.id, h))) {
       if (s.kind === "compound" && a.length !== 1)
         throw new Error(`[Raph machine] Compound state "${s.path}" requires one active child.`);
-      if (s.kind === "parallel" && a.length !== s.children.filter((u) => t.states[u].kind !== "history").length)
+      if (s.kind === "parallel" && a.length !== s.children.filter((h) => t.states[h].kind !== "history").length)
         throw new Error(`[Raph machine] Parallel state "${s.path}" requires every region.`);
     }
   }
-  const o = nt(t, e);
-  if (r === "done" && !o)
+  const i = nt(t, e);
+  if (r === "done" && !i)
     throw new Error("[Raph machine] Done persisted snapshot is not in a final configuration.");
-  if (r === "active" && o)
+  if (r === "active" && i)
     throw new Error("[Raph machine] Active persisted snapshot is already final.");
   for (const [s, a] of Object.entries(n)) {
-    const c = t.pathToState.get(s);
-    if (c === void 0)
+    const u = t.pathToState.get(s);
+    if (u === void 0)
       throw new Error(`[Raph machine] Persisted history has unknown owner "${s}".`);
-    const u = t.states[c];
-    if (u.kind !== "compound" && u.kind !== "parallel")
+    const h = t.states[u];
+    if (h.kind !== "compound" && h.kind !== "parallel")
       throw new Error(`[Raph machine] Persisted history owner "${s}" cannot own history.`);
     if (!Array.isArray(a))
       throw new TypeError(`[Raph machine] Persisted history for "${s}" must be an array.`);
-    for (const f of a) {
-      const d = t.pathToState.get(f);
-      if (d === void 0 || !S(t, c, d))
-        throw new Error(`[Raph machine] Persisted history path "${f}" is invalid for "${s}".`);
+    for (const c of a) {
+      const d = t.pathToState.get(c);
+      if (d === void 0 || !S(t, u, d))
+        throw new Error(`[Raph machine] Persisted history path "${c}" is invalid for "${s}".`);
     }
   }
 }
-function st(t, e, n, r, i, o) {
-  const s = [], a = /* @__PURE__ */ new Set(), c = [...e.active].sort((u, f) => t.states[f].depth - t.states[u].depth || u - f);
-  for (const u of c)
-    for (let f = u; f !== void 0 && !a.has(f); f = t.states[f].parent) {
-      const d = t.states[f].on.get(n.type);
+function st(t, e, n, r, o, i) {
+  const s = [], a = /* @__PURE__ */ new Set(), u = [...e.active].sort((h, c) => t.states[c].depth - t.states[h].depth || h - c);
+  for (const h of u)
+    for (let c = h; c !== void 0 && !a.has(c); c = t.states[c].parent) {
+      const d = t.states[c].on.get(n.type);
       if (d === void 0)
         continue;
-      const p = H(d, e.context, n, r, i, o);
-      if (p !== void 0) {
-        a.add(f), s.push(p);
+      const l = H(d, e.context, n, r, o, i);
+      if (l !== void 0) {
+        a.add(c), s.push(l);
         break;
       }
     }
@@ -699,26 +693,26 @@ function st(t, e, n, r, i, o) {
     pt(t, s),
     n,
     r,
-    i,
-    o
+    o,
+    i
   );
 }
-function Kt(t, e, n, r, i, o) {
+function Kt(t, e, n, r, o, i) {
   const s = [], a = /* @__PURE__ */ new Set();
-  for (const c of e.active)
-    for (let u = c; u !== void 0; u = t.states[u].parent) {
-      if (a.has(u))
+  for (const u of e.active)
+    for (let h = u; h !== void 0; h = t.states[h].parent) {
+      if (a.has(h))
         continue;
-      a.add(u);
-      const f = H(
-        t.states[u].always,
+      a.add(h);
+      const c = H(
+        t.states[h].always,
         e.context,
         n,
         r,
-        i,
-        o
+        o,
+        i
       );
-      f !== void 0 && s.push(f);
+      c !== void 0 && s.push(c);
     }
   return Y(
     t,
@@ -726,65 +720,64 @@ function Kt(t, e, n, r, i, o) {
     pt(t, s),
     n,
     r,
-    i,
-    o
+    o,
+    i
   );
 }
-function Lt(t, e, n, r, i, o, s) {
-  const a = _(t, e.active).filter((c) => !o.has(c) && et(t, c, e.active)).sort((c, u) => t.states[u].depth - t.states[c].depth);
-  for (const c of a) {
-    o.add(c);
-    const u = H(
-      t.states[c].onDone,
+function Lt(t, e, n, r, o, i, s) {
+  const a = _(t, e.active).filter((u) => !i.has(u) && et(t, u, e.active)).sort((u, h) => t.states[h].depth - t.states[u].depth);
+  for (const u of a) {
+    i.add(u);
+    const h = H(
+      t.states[u].onDone,
       e.context,
       n,
       r,
-      i,
+      o,
       s
     );
-    if (u !== void 0)
-      return Y(t, e, [u], n, r, i, s);
+    if (h !== void 0)
+      return Y(t, e, [h], n, r, o, s);
   }
-  return wt();
+  return bt();
 }
-function Y(t, e, n, r, i, o, s) {
-  var z;
+function Y(t, e, n, r, o, i, s) {
   if (n.length === 0)
-    return wt();
-  const a = [...e.active], c = new Set(_(t, a)), u = /* @__PURE__ */ new Set(), f = /* @__PURE__ */ new Set(), d = /* @__PURE__ */ new Set(), p = [], v = [];
-  let w = !1;
-  for (const l of n) {
-    dt(t, l, s);
-    for (const y of l.reduce)
-      e.context = vt(y, i)({
+    return bt();
+  const a = [...e.active], u = new Set(_(t, a)), h = /* @__PURE__ */ new Set(), c = /* @__PURE__ */ new Set(), d = /* @__PURE__ */ new Set(), l = [], y = [];
+  let v = !1;
+  for (const p of n) {
+    dt(t, p, s);
+    for (const j of p.reduce)
+      e.context = vt(j, o)({
         context: e.context,
         event: r,
-        input: o
-      }), w = !0;
-    for (const y of l.emit)
-      p.push({ event: r, ref: y });
-    if (l.emit.length !== 0 && (w = !0), l.raise !== void 0) {
-      const y = typeof l.raise == "function" ? l.raise({ context: e.context, event: r, input: o }) : l.raise;
-      Ot(y), v.push(y), w = !0;
+        input: i
+      }), v = !0;
+    for (const j of p.emit)
+      l.push({ event: r, ref: j });
+    if (p.emit.length !== 0 && (v = !0), p.raise !== void 0) {
+      const j = typeof p.raise == "function" ? p.raise({ context: e.context, event: r, input: i }) : p.raise;
+      Ot(j), y.push(j), v = !0;
     }
-    if (l.target === void 0) {
-      w = !0;
+    if (p.target === void 0) {
+      v = !0;
       continue;
     }
-    const O = l.source, k = l.target;
-    if (O === k && !l.reenter) {
-      w = !0;
+    const O = p.source, R = p.target;
+    if (O === R && !p.reenter) {
+      v = !0;
       continue;
     }
-    const g = X(t, O, k);
-    if (l.reenter) {
-      d.add(g);
-      for (const y of c)
-        (y === g || S(t, g, y)) && u.add(y);
+    const z = X(t, O, R);
+    if (p.reenter) {
+      d.add(z);
+      for (const j of u)
+        (j === z || S(t, z, j)) && h.add(j);
     }
-    e.active = e.active.filter((y) => y !== g && !S(t, g, y));
-    const R = lt(t, k, e.history);
-    e.active.push(...R), w = !0;
+    e.active = e.active.filter((j) => j !== z && !S(t, z, j));
+    const k = lt(t, R, e.history);
+    e.active.push(...k), v = !0;
   }
   e.active = Bt(
     t,
@@ -792,98 +785,96 @@ function Y(t, e, n, r, i, o, s) {
     e.history
   );
   const m = new Set(_(t, e.active));
-  for (const l of d)
+  for (const p of d)
     for (const O of m)
-      (O === l || S(t, l, O)) && f.add(O);
-  const j = [...c].filter((l) => !m.has(l) || u.has(l)).sort((l, O) => t.states[O].depth - t.states[l].depth), h = [...m].filter((l) => !c.has(l) || f.has(l)).sort((l, O) => t.states[l].depth - t.states[O].depth);
-  for (const l of j) {
-    const O = t.states[l];
+      (O === p || S(t, p, O)) && c.add(O);
+  const f = [...u].filter((p) => !m.has(p) || h.has(p)).sort((p, O) => t.states[O].depth - t.states[p].depth), w = [...m].filter((p) => !u.has(p) || c.has(p)).sort((p, O) => t.states[p].depth - t.states[O].depth);
+  for (const p of f) {
+    const O = t.states[p];
     if (O.kind === "compound" || O.kind === "parallel") {
-      const k = a.filter((g) => S(t, l, g));
-      if (k.length !== 0) {
-        const g = ((z = O.children.map((R) => t.states[R]).find((R) => R.kind === "history")) == null ? void 0 : z.history) ?? O.history;
-        e.history[O.path] = Object.freeze(k.map((R) => {
-          if (g === "deep")
-            return t.states[R].path;
-          const y = bt(t, l, R);
-          return t.states[y].path;
+      const R = a.filter((z) => S(t, p, z));
+      if (R.length !== 0) {
+        const z = O.children.map((k) => t.states[k]).find((k) => k.kind === "history")?.history ?? O.history;
+        e.history[O.path] = Object.freeze(R.map((k) => {
+          if (z === "deep")
+            return t.states[k].path;
+          const j = wt(t, p, k);
+          return t.states[j].path;
         }));
       }
     }
   }
-  const b = j.flatMap((l) => t.states[l].exit.map((O) => ({ event: r, ref: O }))), E = h.flatMap((l) => t.states[l].entry.map((O) => ({ event: r, ref: O })));
+  const b = f.flatMap((p) => t.states[p].exit.map((O) => ({ event: r, ref: O }))), g = w.flatMap((p) => t.states[p].entry.map((O) => ({ event: r, ref: O })));
   return Object.freeze({
-    changed: w || j.length !== 0 || h.length !== 0,
-    entered: Object.freeze(h),
-    entryOutputs: Object.freeze(E),
-    exited: Object.freeze(j),
+    changed: v || f.length !== 0 || w.length !== 0,
+    entered: Object.freeze(w),
+    entryOutputs: Object.freeze(g),
+    exited: Object.freeze(f),
     exitOutputs: Object.freeze(b),
-    raised: Object.freeze(v),
-    transitionOutputs: Object.freeze(p)
+    raised: Object.freeze(y),
+    transitionOutputs: Object.freeze(l)
   });
 }
 function dt(t, e, n) {
-  (n == null ? void 0 : n.transition) !== void 0 && n.transition({
+  n?.transition !== void 0 && n.transition({
     ...e.reason === void 0 ? {} : { reason: e.reason },
     source: t.states[e.source].path,
     ...e.target === void 0 ? {} : { target: t.states[e.target].path }
   });
 }
-function H(t, e, n, r, i, o) {
-  var s;
-  for (const a of t) {
-    if (a.guard === void 0)
-      return a;
-    const c = Ut(a.guard, r), u = c({ context: e, event: n, input: i });
-    if ((s = o == null ? void 0 : o.guard) == null || s.call(
-      o,
-      typeof a.guard == "string" ? a.guard : c.name || "inline",
+function H(t, e, n, r, o, i) {
+  for (const s of t) {
+    if (s.guard === void 0)
+      return s;
+    const a = Ut(s.guard, r), u = a({ context: e, event: n, input: o });
+    if (i?.guard?.(
+      typeof s.guard == "string" ? s.guard : a.name || "inline",
       u,
       Zt(e) ? e : void 0
     ), u)
-      return a;
+      return s;
   }
 }
 function pt(t, e) {
-  const n = [...e].sort((i, o) => t.states[o.source].depth - t.states[i.source].depth || i.source - o.source || i.index - o.index), r = [];
-  for (const i of n)
-    r.some((s) => Yt(t, i, s)) || r.push(i);
+  const n = [...e].sort((o, i) => t.states[i.source].depth - t.states[o.source].depth || o.source - i.source || o.index - i.index), r = [];
+  for (const o of n)
+    r.some((s) => Yt(t, o, s)) || r.push(o);
   return r;
 }
 function Yt(t, e, n) {
-  const r = X(t, e.source, e.target ?? e.source), i = X(t, n.source, n.target ?? n.source);
-  return e.source === n.source || S(t, e.source, n.source) || S(t, n.source, e.source) || r === i || S(t, r, i) || S(t, i, r);
+  const r = X(t, e.source, e.target ?? e.source), o = X(t, n.source, n.target ?? n.source);
+  return e.source === n.source || S(t, e.source, n.source) || S(t, n.source, e.source) || r === o || S(t, r, o) || S(t, o, r);
 }
 function X(t, e, n) {
   if (e === n || S(t, e, n))
     return e;
   const r = Vt(t, e, n);
-  return r !== void 0 && t.states[r].kind === "parallel" ? r : r === void 0 ? B(t, e) : bt(t, r, e);
+  return r !== void 0 && t.states[r].kind === "parallel" ? r : r === void 0 ? B(t, e) : wt(t, r, e);
 }
 function lt(t, e, n) {
   const r = t.states[e];
   if (r.kind !== "history")
     return $(t, e, n);
-  const i = r.parent, o = n[t.states[i].path];
-  if (o !== void 0 && o.length !== 0) {
+  const o = r.parent, i = n[t.states[o].path];
+  if (i !== void 0 && i.length !== 0) {
     const s = [];
-    for (const a of o) {
-      const c = t.pathToState.get(a);
-      c !== void 0 && s.push(...r.history === "deep" ? $(t, c, n) : $(t, c, {}));
+    for (const a of i) {
+      const u = t.pathToState.get(a);
+      u !== void 0 && s.push(...r.history === "deep" ? $(t, u, n) : $(t, u, {}));
     }
     if (s.length !== 0)
       return A(s);
   }
-  return r.historyFallback !== void 0 ? $(t, r.historyFallback, n) : $(t, i, {});
+  return r.historyFallback !== void 0 ? $(t, r.historyFallback, n) : $(t, o, {});
 }
 function Bt(t, e, n) {
   const r = [...e];
-  for (let i = 0; i < r.length; i++)
-    for (const o of t.ancestry[r[i]].slice(1)) {
-      const s = t.states[o];
+  for (let o = 0; o < r.length; o++)
+    for (const i of t.ancestry[r[o]].slice(1)) {
+      const s = t.states[i];
       if (s.kind === "parallel")
         for (const a of s.children)
-          t.states[a].kind !== "history" && (r.some((c) => c === a || S(t, a, c)) || r.push(...$(t, a, n)));
+          t.states[a].kind !== "history" && (r.some((u) => u === a || S(t, a, u)) || r.push(...$(t, a, n)));
     }
   return A(r);
 }
@@ -895,55 +886,53 @@ function $(t, e, n) {
     return [e];
   if (r.kind === "compound")
     return $(t, r.initial, n);
-  const i = [];
-  for (const o of r.children)
-    t.states[o].kind !== "history" && i.push(...$(t, o, n));
-  return A(i);
+  const o = [];
+  for (const i of r.children)
+    t.states[i].kind !== "history" && o.push(...$(t, i, n));
+  return A(o);
 }
 function et(t, e, n) {
   const r = t.states[e];
-  return r.kind === "final" ? n.includes(e) : r.kind === "compound" ? r.children.some((i) => t.states[i].kind === "final" && n.includes(i)) : r.kind === "parallel" ? r.children.filter((i) => t.states[i].kind !== "history").every((i) => et(t, i, n)) : !1;
+  return r.kind === "final" ? n.includes(e) : r.kind === "compound" ? r.children.some((o) => t.states[o].kind === "final" && n.includes(o)) : r.kind === "parallel" ? r.children.filter((o) => t.states[o].kind !== "history").every((o) => et(t, o, n)) : !1;
 }
 function nt(t, e) {
   const n = Wt(t, e[0]);
   return n === void 0 ? !1 : et(t, n, e);
 }
 function yt(t, e, n, r) {
-  const i = B(t, e.active[0]), o = t.states[i], s = o.kind === "compound" ? e.active.find((c) => t.states[c].parent === i && t.states[c].kind === "final") : o.kind === "final" ? i : void 0, a = s === void 0 ? t.output : t.states[s].output ?? t.output;
+  const o = B(t, e.active[0]), i = t.states[o], s = i.kind === "compound" ? e.active.find((u) => t.states[u].parent === o && t.states[u].kind === "final") : i.kind === "final" ? o : void 0, a = s === void 0 ? t.output : t.states[s].output ?? t.output;
   return typeof a == "function" ? a({ context: e.context, event: n, input: r }) : a;
 }
 function Ut(t, e) {
-  var r;
   if (typeof t == "function")
     return t;
-  const n = (r = e == null ? void 0 : e.guards) == null ? void 0 : r[t];
+  const n = e?.guards?.[t];
   if (n === void 0)
     throw new Error(`[Raph machine] Guard binding "${t}" is not defined.`);
   return n;
 }
 function vt(t, e) {
-  var r;
   if (typeof t == "function")
     return t;
-  const n = (r = e == null ? void 0 : e.reducers) == null ? void 0 : r[t];
+  const n = e?.reducers?.[t];
   if (n === void 0)
     throw new Error(`[Raph machine] Reducer binding "${t}" is not defined.`);
   return n;
 }
-function C(t, e, n, r, i, o, s) {
-  const a = s ?? F(t), c = a.flat && n.active.length === 1 ? n.active[0] : void 0, u = c === void 0 ? void 0 : J(void 0, c, e, t, a.states[c].path), f = u === void 0 ? Object.freeze([...n.active]) : void 0, d = (u == null ? void 0 : u[T]) ?? Object.freeze({
-    active: f,
+function C(t, e, n, r, o, i, s) {
+  const a = s ?? F(t), u = a.flat && n.active.length === 1 ? n.active[0] : void 0, h = u === void 0 ? void 0 : J(void 0, u, e, t, a.states[u].path), c = h === void 0 ? Object.freeze([...n.active]) : void 0, d = h?.[T] ?? Object.freeze({
+    active: c,
     input: e,
     model: t
   });
   return L({
-    active: d.publicActive ?? Object.freeze(f.map((p) => a.states[p].path)),
+    active: d.publicActive ?? Object.freeze(c.map((l) => a.states[l].path)),
     context: rt(n.context),
     history: a.flat ? q : Xt(n.history),
-    ...o === void 0 ? {} : { output: o },
+    ...i === void 0 ? {} : { output: i },
     revision: r,
-    status: i
-  }, d, u);
+    status: o
+  }, d, h);
 }
 function I(t, e) {
   return {
@@ -952,7 +941,7 @@ function I(t, e) {
     snapshot: t
   };
 }
-function wt() {
+function bt() {
   return Object.freeze({
     changed: !1,
     entered: Object.freeze([]),
@@ -963,37 +952,37 @@ function wt() {
     transitionOutputs: Object.freeze([])
   });
 }
-function at(t, e, n, r, i, o) {
+function at(t, e, n, r, o, i) {
   for (const s of t.exited)
     e.add(s);
   for (const s of t.entered)
     n.add(s);
-  r.push(...t.exitOutputs), i.push(...t.transitionOutputs), o.push(...t.entryOutputs);
+  r.push(...t.exitOutputs), o.push(...t.transitionOutputs), i.push(...t.entryOutputs);
 }
 function _(t, e) {
   const n = /* @__PURE__ */ new Set();
   for (const r of e)
-    for (const i of t.ancestry[r])
-      n.add(i);
+    for (const o of t.ancestry[r])
+      n.add(o);
   return [...n];
 }
 function Vt(t, e, n) {
   const r = new Set(t.ancestry[e]);
-  for (const i of t.ancestry[n])
-    if (r.has(i))
-      return i;
+  for (const o of t.ancestry[n])
+    if (r.has(o))
+      return o;
 }
 function S(t, e, n) {
   const r = t.ancestry[n];
   return r.length > 1 && r.includes(e, 1);
 }
-function bt(t, e, n) {
+function wt(t, e, n) {
   let r = n;
   for (; t.states[r].parent !== e; ) {
-    const i = t.states[r].parent;
-    if (i === void 0)
+    const o = t.states[r].parent;
+    if (o === void 0)
       return r;
-    r = i;
+    r = o;
   }
   return r;
 }
@@ -1013,10 +1002,10 @@ function Gt(t, e, n) {
   if (!t.eventIndexes.has(n))
     return !1;
   for (const r of e) {
-    const i = t.pathToState.get(r);
-    if (i !== void 0) {
-      for (const o of t.ancestry[i])
-        if (t.states[o].on.has(n))
+    const o = t.pathToState.get(r);
+    if (o !== void 0) {
+      for (const i of t.ancestry[o])
+        if (t.states[i].on.has(n))
           return !0;
     }
   }