storybook 9.1.0-alpha.9 → 9.1.0-beta.1

package/dist/instrumenter/index.js

@@ -75,8 +75,8 @@ function jt(e = !1) {
     return p + c.substring(l);
   }, "i"), r = /* @__PURE__ */ i((c, a, u = c) => {
     let m = /* @__PURE__ */ i((p) => {
-      let l = String(p), S = l.indexOf(a, c.length);
-      return ~S ? c + n(l, a, u, S) + a : c + l + a;
+      let l = String(p), b = l.indexOf(a, c.length);
+      return ~b ? c + n(l, a, u, b) + a : c + l + a;
     }, "o");
     return m.open = c, m.close = a, m;
   }, "g"), o = {
@@ -130,8 +130,8 @@ function Ee(e, t, n, r, o, s, c = ": ") {
         a += "\u2026";
         break;
       }
-      let l = s(m.value[0], t, p, r, o), S = s(m.value[1], t, p, r, o);
-      a += l + c + S, m = e.next(), m.done ? t.min || (a += ",") : a += `,${t.spacingInner}`;
+      let l = s(m.value[0], t, p, r, o), b = s(m.value[1], t, p, r, o);
+      a += l + c + b, m = e.next(), m.done ? t.min || (a += ",") : a += `,${t.spacingInner}`;
     }
     a += t.spacingOuter + n;
   }
@@ -155,7 +155,7 @@ function Qe(e, t, n, r, o, s) {
   return c;
 }
 i(Qe, "printIteratorValues");
-function Re(e, t, n, r, o, s) {
+function Ae(e, t, n, r, o, s) {
   let c = "";
   e = e instanceof ArrayBuffer ? new DataView(e) : e;
   let a = /* @__PURE__ */ i((m) => m instanceof DataView, "isDataView"), u = a(e) ? e.byteLength : e.length;
@@ -173,15 +173,15 @@ function Re(e, t, n, r, o, s) {
   }
   return c;
 }
-i(Re, "printListItems");
+i(Ae, "printListItems");
 function ve(e, t, n, r, o, s) {
   let c = "", a = pr(e, t.compareKeys);
   if (a.length > 0) {
     c += t.spacingOuter;
     let u = n + t.indent;
     for (let m = 0; m < a.length; m++) {
-      let p = a[m], l = s(p, t, u, r, o), S = s(e[p], t, u, r, o);
-      c += `${u + l}: ${S}`, m < a.length - 1 ? c += `,${t.spacingInner}` : t.min || (c += ",");
+      let p = a[m], l = s(p, t, u, r, o), b = s(e[p], t, u, r, o);
+      c += `${u + l}: ${b}`, m < a.length - 1 ? c += `,${t.spacingInner}` : t.min || (c += ",");
     }
     c += t.spacingOuter + n;
   }
@@ -191,7 +191,7 @@ i(ve, "printObjectProperties");
 var gr = typeof Symbol == "function" && Symbol.for ? Symbol.for("jest.asymmetricMatcher") : 1267621, we = " ", hr = /* @__PURE__ */ i((e, t, n, r, o, s) => {
   let c = e.toString();
   if (c === "ArrayContaining" || c === "ArrayNotContaining")
-    return ++r > t.maxDepth ? `[${c}]` : `${c + we}[${Re(e.sample, t, n, r, o, s)}]`;
+    return ++r > t.maxDepth ? `[${c}]` : `${c + we}[${Ae(e.sample, t, n, r, o, s)}]`;
   if (c === "ObjectContaining" || c === "ObjectNotContaining")
     return ++r > t.maxDepth ? `[${c}]` : `${c + we}{${ve(e.sample, t, n, r, o, s)}}`;
   if (c === "StringMatching" || c === "StringNotMatching" || c === "StringContaining" || c === "StringNotContaining")
@@ -215,7 +215,7 @@ i(Tr, "isNamedNodeMap");
 var Cr = /* @__PURE__ */ i((e, t, n, r, o, s) => {
   let c = e.constructor.name;
   return ++r > t.maxDepth ? `[${c}]` : (t.min ? "" : c + br) + (Zt.has(c) ? `{${ve(Tr(e) ? [...e].reduce((a, u) => (a[u.name] = u.value, a),
-  {}) : { ...e }, t, n, r, o, s)}}` : `[${Re([...e], t, n, r, o, s)}]`);
+  {}) : { ...e }, t, n, r, o, s)}}` : `[${Ae([...e], t, n, r, o, s)}]`);
 }, "serialize$4"), Or = {
   serialize: Cr,
   test: _r
@@ -259,23 +259,23 @@ function rt(e, t) {
   return `${n.open}<${e}${n.close} \u2026${n.open} />${n.close}`;
 }
 i(rt, "printElementAsLeaf");
-var wr = 1, en = 3, tn = 8, nn = 11, Ar = /^(?:(?:HTML|SVG)\w*)?Element$/;
-function Rr(e) {
+var wr = 1, en = 3, tn = 8, nn = 11, Rr = /^(?:(?:HTML|SVG)\w*)?Element$/;
+function Ar(e) {
   try {
     return typeof e.hasAttribute == "function" && e.hasAttribute("is");
   } catch {
     return !1;
   }
 }
-i(Rr, "testHasAttribute");
-function Nr(e) {
-  let t = e.constructor.name, { nodeType: n, tagName: r } = e, o = typeof r == "string" && r.includes("-") || Rr(e);
-  return n === wr && (Ar.test(t) || o) || n === en && t === "Text" || n === tn && t === "Comment" || n === nn && t === "DocumentFragment";
+i(Ar, "testHasAttribute");
+function Pr(e) {
+  let t = e.constructor.name, { nodeType: n, tagName: r } = e, o = typeof r == "string" && r.includes("-") || Ar(e);
+  return n === wr && (Rr.test(t) || o) || n === en && t === "Text" || n === tn && t === "Comment" || n === nn && t === "DocumentFragment";
 }
-i(Nr, "testNode");
-var Pr = /* @__PURE__ */ i((e) => {
+i(Pr, "testNode");
+var Nr = /* @__PURE__ */ i((e) => {
   var t;
-  return (e == null || (t = e.constructor) === null || t === void 0 ? void 0 : t.name) && Nr(e);
+  return (e == null || (t = e.constructor) === null || t === void 0 ? void 0 : t.name) && Pr(e);
 }, "test$3");
 function Ir(e) {
   return e.nodeType === en;
@@ -300,13 +300,13 @@ var Lr = /* @__PURE__ */ i((e, t, n, r, o, s) => {
   t.indent, r, o, s), t, n);
 }, "serialize$3"), xr = {
   serialize: Lr,
-  test: Pr
+  test: Nr
 }, Dr = "@@__IMMUTABLE_ITERABLE__@@", Fr = "@@__IMMUTABLE_LIST__@@", jr = "@@__IMMUTABLE_KEYED__@@", kr = "@@__IMMUTABLE_MAP__@@", kt = "@@_\
 _IMMUTABLE_ORDERED__@@", Br = "@@__IMMUTABLE_RECORD__@@", zr = "@@__IMMUTABLE_SEQ__@@", Yr = "@@__IMMUTABLE_SET__@@", Ur = "@@__IMMUTABLE_ST\
-ACK__@@", de = /* @__PURE__ */ i((e) => `Immutable.${e}`, "getImmutableName"), Pe = /* @__PURE__ */ i((e) => `[${e}]`, "printAsLeaf"), Se = "\
+ACK__@@", de = /* @__PURE__ */ i((e) => `Immutable.${e}`, "getImmutableName"), Ne = /* @__PURE__ */ i((e) => `[${e}]`, "printAsLeaf"), Se = "\
  ", Bt = "\u2026";
 function Wr(e, t, n, r, o, s, c) {
-  return ++r > t.maxDepth ? Pe(de(c)) : `${de(c) + Se}{${Ee(e.entries(), t, n, r, o, s)}}`;
+  return ++r > t.maxDepth ? Ne(de(c)) : `${de(c) + Se}{${Ee(e.entries(), t, n, r, o, s)}}`;
 }
 i(Wr, "printImmutableEntries");
 function Vr(e) {
@@ -328,17 +328,17 @@ function Vr(e) {
 i(Vr, "getRecordEntries");
 function qr(e, t, n, r, o, s) {
   let c = de(e._name || "Record");
-  return ++r > t.maxDepth ? Pe(c) : `${c + Se}{${Ee(Vr(e), t, n, r, o, s)}}`;
+  return ++r > t.maxDepth ? Ne(c) : `${c + Se}{${Ee(Vr(e), t, n, r, o, s)}}`;
 }
 i(qr, "printImmutableRecord");
 function Kr(e, t, n, r, o, s) {
   let c = de("Seq");
-  return ++r > t.maxDepth ? Pe(c) : e[jr] ? `${c + Se}{${e._iter || e._object ? Ee(e.entries(), t, n, r, o, s) : Bt}}` : `${c + Se}[${e._iter ||
+  return ++r > t.maxDepth ? Ne(c) : e[jr] ? `${c + Se}{${e._iter || e._object ? Ee(e.entries(), t, n, r, o, s) : Bt}}` : `${c + Se}[${e._iter ||
   e._array || e._collection || e._iterable ? Qe(e.values(), t, n, r, o, s) : Bt}]`;
 }
 i(Kr, "printImmutableSeq");
 function Je(e, t, n, r, o, s, c) {
-  return ++r > t.maxDepth ? Pe(de(c)) : `${de(c) + Se}[${Qe(e.values(), t, n, r, o, s)}]`;
+  return ++r > t.maxDepth ? Ne(de(c)) : `${de(c) + Se}[${Qe(e.values(), t, n, r, o, s)}]`;
 }
 i(Je, "printImmutableValues");
 var Gr = /* @__PURE__ */ i((e, t, n, r, o, s) => e[kr] ? Wr(e, t, n, r, o, s, e[kt] ? "OrderedMap" : "Map") : e[Fr] ? Je(e, t, n, r, o, s, "\
@@ -352,7 +352,7 @@ function rn(e) {
 }
 i(rn, "getDefaultExportFromCjs");
 var Xe = { exports: {} };
-var R = {};
+var A = {};
 var zt;
 function Xr() {
   return zt || (zt = 1, function() {
@@ -373,7 +373,7 @@ function Xr() {
                 switch (f = f && f.$$typeof, f) {
                   case a:
                   case u:
-                  case S:
+                  case b:
                   case l:
                     return f;
                   case c:
@@ -390,39 +390,39 @@ function Xr() {
     i(e, "typeOf");
     var t = Symbol.for("react.transitional.element"), n = Symbol.for("react.portal"), r = Symbol.for("react.fragment"), o = Symbol.for("reac\
 t.strict_mode"), s = Symbol.for("react.profiler"), c = Symbol.for("react.consumer"), a = Symbol.for("react.context"), u = Symbol.for("react.\
-forward_ref"), m = Symbol.for("react.suspense"), p = Symbol.for("react.suspense_list"), l = Symbol.for("react.memo"), S = Symbol.for("react.\
+forward_ref"), m = Symbol.for("react.suspense"), p = Symbol.for("react.suspense_list"), l = Symbol.for("react.memo"), b = Symbol.for("react.\
 lazy"), g = Symbol.for("react.view_transition"), h = Symbol.for("react.client.reference");
-    R.ContextConsumer = c, R.ContextProvider = a, R.Element = t, R.ForwardRef = u, R.Fragment = r, R.Lazy = S, R.Memo = l, R.Portal = n, R.Profiler =
-    s, R.StrictMode = o, R.Suspense = m, R.SuspenseList = p, R.isContextConsumer = function(f) {
+    A.ContextConsumer = c, A.ContextProvider = a, A.Element = t, A.ForwardRef = u, A.Fragment = r, A.Lazy = b, A.Memo = l, A.Portal = n, A.Profiler =
+    s, A.StrictMode = o, A.Suspense = m, A.SuspenseList = p, A.isContextConsumer = function(f) {
       return e(f) === c;
-    }, R.isContextProvider = function(f) {
+    }, A.isContextProvider = function(f) {
       return e(f) === a;
-    }, R.isElement = function(f) {
+    }, A.isElement = function(f) {
       return typeof f == "object" && f !== null && f.$$typeof === t;
-    }, R.isForwardRef = function(f) {
+    }, A.isForwardRef = function(f) {
       return e(f) === u;
-    }, R.isFragment = function(f) {
+    }, A.isFragment = function(f) {
       return e(f) === r;
-    }, R.isLazy = function(f) {
-      return e(f) === S;
-    }, R.isMemo = function(f) {
+    }, A.isLazy = function(f) {
+      return e(f) === b;
+    }, A.isMemo = function(f) {
       return e(f) === l;
-    }, R.isPortal = function(f) {
+    }, A.isPortal = function(f) {
       return e(f) === n;
-    }, R.isProfiler = function(f) {
+    }, A.isProfiler = function(f) {
       return e(f) === s;
-    }, R.isStrictMode = function(f) {
+    }, A.isStrictMode = function(f) {
       return e(f) === o;
-    }, R.isSuspense = function(f) {
+    }, A.isSuspense = function(f) {
       return e(f) === m;
-    }, R.isSuspenseList = function(f) {
+    }, A.isSuspenseList = function(f) {
       return e(f) === p;
-    }, R.isValidElementType = function(f) {
+    }, A.isValidElementType = function(f) {
       return typeof f == "string" || typeof f == "function" || f === r || f === s || f === o || f === m || f === p || typeof f == "object" &&
-      f !== null && (f.$$typeof === S || f.$$typeof === l || f.$$typeof === a || f.$$typeof === c || f.$$typeof === u || f.$$typeof === h ||
+      f !== null && (f.$$typeof === b || f.$$typeof === l || f.$$typeof === a || f.$$typeof === c || f.$$typeof === u || f.$$typeof === h ||
       f.getModuleId !== void 0);
-    }, R.typeOf = e;
-  }()), R;
+    }, A.typeOf = e;
+  }()), A;
 }
 i(Xr, "requireReactIs_development$1");
 var Yt;
@@ -441,11 +441,11 @@ function eo() {
     var e = Symbol.for("react.element"), t = Symbol.for("react.portal"), n = Symbol.for("react.fragment"), r = Symbol.for("react.strict_mode"),
     o = Symbol.for("react.profiler"), s = Symbol.for("react.provider"), c = Symbol.for("react.context"), a = Symbol.for("react.server_contex\
 t"), u = Symbol.for("react.forward_ref"), m = Symbol.for("react.suspense"), p = Symbol.for("react.suspense_list"), l = Symbol.for("react.mem\
-o"), S = Symbol.for("react.lazy"), g = Symbol.for("react.offscreen"), h = !1, f = !1, d = !1, b = !1, _ = !1, O;
+o"), b = Symbol.for("react.lazy"), g = Symbol.for("react.offscreen"), h = !1, f = !1, d = !1, S = !1, _ = !1, O;
     O = Symbol.for("react.module.reference");
     function y(C) {
-      return !!(typeof C == "string" || typeof C == "function" || C === n || C === o || _ || C === r || C === m || C === p || b || C === g ||
-      h || f || d || typeof C == "object" && C !== null && (C.$$typeof === S || C.$$typeof === l || C.$$typeof === s || C.$$typeof === c || C.
+      return !!(typeof C == "string" || typeof C == "function" || C === n || C === o || _ || C === r || C === m || C === p || S || C === g ||
+      h || f || d || typeof C == "object" && C !== null && (C.$$typeof === b || C.$$typeof === l || C.$$typeof === s || C.$$typeof === c || C.
       $$typeof === u || // This needs to include all possible module reference object
       // types supported by any Flight configuration anywhere since
       // we don't know which Flight build this will end up being used
@@ -472,7 +472,7 @@ o"), S = Symbol.for("react.lazy"), g = Symbol.for("react.offscreen"), h = !1, f
                   case a:
                   case c:
                   case u:
-                  case S:
+                  case b:
                   case l:
                   case s:
                     return Dt;
@@ -486,7 +486,7 @@ o"), S = Symbol.for("react.lazy"), g = Symbol.for("react.offscreen"), h = !1, f
       }
     }
     i(E, "typeOf");
-    var $ = c, T = s, A = e, K = u, Q = n, I = S, k = l, G = t, Y = o, P = r, L = m, x = p, H = !1, F = !1;
+    var $ = c, T = s, R = e, K = u, Q = n, I = b, k = l, G = t, Y = o, N = r, L = m, x = p, H = !1, F = !1;
     function W(C) {
       return H || (H = !0, console.warn("The ReactIs.isAsyncMode() alias has been deprecated, and will be removed in React 18+.")), !1;
     }
@@ -516,7 +516,7 @@ o"), S = Symbol.for("react.lazy"), g = Symbol.for("react.offscreen"), h = !1, f
     }
     i(U, "isFragment");
     function oe(C) {
-      return E(C) === S;
+      return E(C) === b;
     }
     i(oe, "isLazy");
     function he(C) {
@@ -542,8 +542,8 @@ o"), S = Symbol.for("react.lazy"), g = Symbol.for("react.offscreen"), h = !1, f
     function ar(C) {
       return E(C) === p;
     }
-    i(ar, "isSuspenseList"), w.ContextConsumer = $, w.ContextProvider = T, w.Element = A, w.ForwardRef = K, w.Fragment = Q, w.Lazy = I, w.Memo =
-    k, w.Portal = G, w.Profiler = Y, w.StrictMode = P, w.Suspense = L, w.SuspenseList = x, w.isAsyncMode = W, w.isConcurrentMode = re, w.isContextConsumer =
+    i(ar, "isSuspenseList"), w.ContextConsumer = $, w.ContextProvider = T, w.Element = R, w.ForwardRef = K, w.Fragment = Q, w.Lazy = I, w.Memo =
+    k, w.Portal = G, w.Profiler = Y, w.StrictMode = N, w.Suspense = L, w.SuspenseList = x, w.isAsyncMode = W, w.isConcurrentMode = re, w.isContextConsumer =
     V, w.isContextProvider = q, w.isElement = se, w.isForwardRef = J, w.isFragment = U, w.isLazy = oe, w.isMemo = he, w.isPortal = ue, w.isProfiler =
     be, w.isStrictMode = Ce, w.isSuspense = Oe, w.isSuspenseList = ar, w.isValidElementType = y, w.typeOf = E;
   }()), w;
@@ -633,10 +633,10 @@ ao, "test"), po = {
   serialize: fo,
   test: mo
 }, un = Object.prototype.toString, go = Date.prototype.toISOString, ho = Error.prototype.toString, qt = RegExp.prototype.toString;
-function Ae(e) {
+function Re(e) {
   return typeof e.constructor == "function" && e.constructor.name || "Object";
 }
-i(Ae, "getConstructorName");
+i(Re, "getConstructorName");
 function yo(e) {
   return typeof window < "u" && e === window;
 }
@@ -647,7 +647,7 @@ var bo = /^Symbol\((.*)\)(.*)$/, So = /\n/g, st = class st extends Error {
   }
 };
 i(st, "PrettyFormatPluginError");
-var Ne = st;
+var Pe = st;
 function Eo(e) {
   return e === "[object Array]" || e === "[object ArrayBuffer]" || e === "[object DataView]" || e === "[object Float32Array]" || e === "[obj\
 ect Float64Array]" || e === "[object Int8Array]" || e === "[object Int16Array]" || e === "[object Int32Array]" || e === "[object Uint8Array]" ||
@@ -707,10 +707,10 @@ function ln(e, t, n, r, o, s) {
   if (t.callToJSON && !c && e.toJSON && typeof e.toJSON == "function" && !s)
     return ae(e.toJSON(), t, n, r, o, !0);
   let u = un.call(e);
-  return u === "[object Arguments]" ? c ? "[Arguments]" : `${a ? "" : "Arguments "}[${Re(e, t, n, r, o, ae)}]` : Eo(u) ? c ? `[${e.constructor.
-  name}]` : `${a || !t.printBasicPrototype && e.constructor.name === "Array" ? "" : `${e.constructor.name} `}[${Re(e, t, n, r, o, ae)}]` : u ===
+  return u === "[object Arguments]" ? c ? "[Arguments]" : `${a ? "" : "Arguments "}[${Ae(e, t, n, r, o, ae)}]` : Eo(u) ? c ? `[${e.constructor.
+  name}]` : `${a || !t.printBasicPrototype && e.constructor.name === "Array" ? "" : `${e.constructor.name} `}[${Ae(e, t, n, r, o, ae)}]` : u ===
   "[object Map]" ? c ? "[Map]" : `Map {${Ee(e.entries(), t, n, r, o, ae, " => ")}}` : u === "[object Set]" ? c ? "[Set]" : `Set {${Qe(e.values(),
-  t, n, r, o, ae)}}` : c || yo(e) ? `[${Ae(e)}]` : `${a || !t.printBasicPrototype && Ae(e) === "Object" ? "" : `${Ae(e)} `}{${ve(e, t, n, r,
+  t, n, r, o, ae)}}` : c || yo(e) ? `[${Re(e)}]` : `${a || !t.printBasicPrototype && Re(e) === "Object" ? "" : `${Re(e)} `}{${ve(e, t, n, r,
   o, ae)}}`;
 }
 i(ln, "printComplexValue");
@@ -725,7 +725,7 @@ var Co = {
       ...typeof u < "u" ? { cause: u } : {},
       ...e instanceof AggregateError ? { errors: e.errors } : {},
       ...m
-    }, l = e.name !== "Error" ? e.name : Ae(e);
+    }, l = e.name !== "Error" ? e.name : Re(e);
     return c ? `[${l}]` : `${l} {${Ee(Object.entries(p).values(), t, n, r, o, s)}}`;
   }
 };
@@ -746,7 +746,7 @@ ${u}`);
       spacing: n.spacingInner
     }, n.colors);
   } catch (a) {
-    throw new Ne(a.message, a.stack);
+    throw new Pe(a.message, a.stack);
   }
   if (typeof c != "string")
     throw new TypeError(`pretty-format: Plugin must return type "string" but instead returned "${typeof c}".`);
@@ -759,7 +759,7 @@ function mn(e, t) {
       if (n.test(t))
         return n;
     } catch (r) {
-      throw new Ne(r.message, r.stack);
+      throw new Pe(r.message, r.stack);
     }
   return null;
 }
@@ -812,13 +812,13 @@ function wo() {
   }, /* @__PURE__ */ Object.create(null));
 }
 i(wo, "getColorsHighlight");
-function Ao() {
+function Ro() {
   return pn.reduce((e, t) => (e[t] = {
     close: "",
     open: ""
   }, e), /* @__PURE__ */ Object.create(null));
 }
-i(Ao, "getColorsEmpty");
+i(Ro, "getColorsEmpty");
 function gn(e) {
   return e?.printFunctionName ?? ee.printFunctionName;
 }
@@ -834,11 +834,11 @@ i(dn, "getEscapeString");
 function Jt(e) {
   return {
     callToJSON: e?.callToJSON ?? ee.callToJSON,
-    colors: e?.highlight ? wo() : Ao(),
+    colors: e?.highlight ? wo() : Ro(),
     compareKeys: typeof e?.compareKeys == "function" || e?.compareKeys === null ? e.compareKeys : ee.compareKeys,
     escapeRegex: hn(e),
     escapeString: dn(e),
-    indent: e?.min ? "" : Ro(e?.indent ?? ee.indent),
+    indent: e?.min ? "" : Ao(e?.indent ?? ee.indent),
     maxDepth: e?.maxDepth ?? ee.maxDepth,
     maxWidth: e?.maxWidth ?? ee.maxWidth,
     min: e?.min ?? ee.min,
@@ -852,10 +852,10 @@ function Jt(e) {
   };
 }
 i(Jt, "getConfig");
-function Ro(e) {
+function Ao(e) {
   return Array.from({ length: e + 1 }).join(" ");
 }
-i(Ro, "createIndent");
+i(Ao, "createIndent");
 function X(e, t) {
   if (t && ($o(t), t.plugins)) {
     let r = mn(t.plugins, e);
@@ -905,7 +905,7 @@ var yn = {
   brightcyan: ["36;1", "39"],
   brightwhite: ["37;1", "39"],
   grey: ["90", "39"]
-}, No = {
+}, Po = {
   special: "cyan",
   number: "yellow",
   bigint: "yellow",
@@ -917,11 +917,11 @@ var yn = {
   date: "magenta",
   regexp: "red"
 }, ie = "\u2026";
-function Po(e, t) {
-  let n = yn[No[t]] || yn[t] || "";
+function No(e, t) {
+  let n = yn[Po[t]] || yn[t] || "";
   return n ? `\x1B[${n[0]}m${String(e)}\x1B[${n[1]}m` : String(e);
 }
-i(Po, "colorise");
+i(No, "colorise");
 function bn({
   showHidden: e = !1,
   depth: t = 2,
@@ -948,7 +948,7 @@ function bn({
     inspect: p,
     stylize: m
   };
-  return l.colors && (l.stylize = Po), l;
+  return l.colors && (l.stylize = No), l;
 }
 i(bn, "normaliseOptions");
 function Io(e) {
@@ -976,9 +976,9 @@ function D(e, t, n, r = ", ") {
   for (let m = 0; m < o; m += 1) {
     let p = m + 1 === e.length, l = m + 2 === e.length;
     u = `${ie}(${e.length - m})`;
-    let S = e[m];
+    let b = e[m];
     t.truncate = s - c.length - (p ? 0 : r.length);
-    let g = a || n(S, t) + (p ? "" : r), h = c.length + g.length, f = h + u.length;
+    let g = a || n(b, t) + (p ? "" : r), h = c.length + g.length, f = h + u.length;
     if (p && h > s && c.length + u.length <= s || !p && !l && f > s || (a = p ? "" : n(e[m + 1], t) + (l ? "" : r), !p && l && f > s && h + a.
     length > s))
       break;
@@ -1393,10 +1393,10 @@ function Te(e, t = {}) {
   return t.truncate === 0 && (t.truncate = Number.POSITIVE_INFINITY), ke(e, t);
 }
 i(Te, "inspect");
-function An(e) {
+function Rn(e) {
   return e && e.__esModule && Object.prototype.hasOwnProperty.call(e, "default") ? e.default : e;
 }
-i(An, "getDefaultExportFromCjs");
+i(Rn, "getDefaultExportFromCjs");
 
 // ../node_modules/@vitest/utils/dist/helpers.js
 function ns(e) {
@@ -1417,12 +1417,12 @@ function bt(e) {
   return ns(e) ? [] : (rs(e, t), Array.from(t));
 }
 i(bt, "getOwnProperties");
-var Rn = { forceWritable: !1 };
-function St(e, t = Rn) {
+var An = { forceWritable: !1 };
+function St(e, t = An) {
   return yt(e, /* @__PURE__ */ new WeakMap(), t);
 }
 i(St, "deepClone");
-function yt(e, t, n = Rn) {
+function yt(e, t, n = An) {
   let r, o;
   if (t.has(e))
     return t.get(e);
@@ -1461,15 +1461,15 @@ function yt(e, t, n = Rn) {
 i(yt, "clone");
 
 // ../node_modules/@vitest/utils/dist/diff.js
-var z = -1, j = 1, M = 0, Rt = class Rt {
+var z = -1, j = 1, M = 0, At = class At {
   0;
   1;
   constructor(t, n) {
     this[0] = t, this[1] = n;
   }
 };
-i(Rt, "Diff");
-var N = Rt;
+i(At, "Diff");
+var P = At;
 function os(e, t) {
   if (!e || !t || e.charAt(0) !== t.charAt(0))
     return 0;
@@ -1489,7 +1489,7 @@ function Vn(e, t) {
   return o;
 }
 i(Vn, "diff_commonSuffix");
-function Nn(e, t) {
+function Pn(e, t) {
   let n = e.length, r = t.length;
   if (n === 0 || r === 0)
     return 0;
@@ -1505,25 +1505,25 @@ function Nn(e, t) {
     c += u, (u === 0 || e.substring(o - c) === t.substring(0, c)) && (s = c, c++);
   }
 }
-i(Nn, "diff_commonOverlap_");
+i(Pn, "diff_commonOverlap_");
 function ss(e) {
   let t = !1, n = [], r = 0, o = null, s = 0, c = 0, a = 0, u = 0, m = 0;
   for (; s < e.length; )
     e[s][0] === M ? (n[r++] = s, c = u, a = m, u = 0, m = 0, o = e[s][1]) : (e[s][0] === j ? u += e[s][1].length : m += e[s][1].length, o &&
-    o.length <= Math.max(c, a) && o.length <= Math.max(u, m) && (e.splice(n[r - 1], 0, new N(z, o)), e[n[r - 1] + 1][0] = j, r--, r--, s = r >
+    o.length <= Math.max(c, a) && o.length <= Math.max(u, m) && (e.splice(n[r - 1], 0, new P(z, o)), e[n[r - 1] + 1][0] = j, r--, r--, s = r >
     0 ? n[r - 1] : -1, c = 0, a = 0, u = 0, m = 0, o = null, t = !0)), s++;
   for (t && qn(e), us(e), s = 1; s < e.length; ) {
     if (e[s - 1][0] === z && e[s][0] === j) {
-      let p = e[s - 1][1], l = e[s][1], S = Nn(p, l), g = Nn(l, p);
-      S >= g ? (S >= p.length / 2 || S >= l.length / 2) && (e.splice(s, 0, new N(M, l.substring(0, S))), e[s - 1][1] = p.substring(0, p.length -
-      S), e[s + 1][1] = l.substring(S), s++) : (g >= p.length / 2 || g >= l.length / 2) && (e.splice(s, 0, new N(M, p.substring(0, g))), e[s -
+      let p = e[s - 1][1], l = e[s][1], b = Pn(p, l), g = Pn(l, p);
+      b >= g ? (b >= p.length / 2 || b >= l.length / 2) && (e.splice(s, 0, new P(M, l.substring(0, b))), e[s - 1][1] = p.substring(0, p.length -
+      b), e[s + 1][1] = l.substring(b), s++) : (g >= p.length / 2 || g >= l.length / 2) && (e.splice(s, 0, new P(M, p.substring(0, g))), e[s -
       1][0] = j, e[s - 1][1] = l.substring(0, l.length - g), e[s + 1][0] = z, e[s + 1][1] = p.substring(g), s++), s++;
     }
     s++;
   }
 }
 i(ss, "diff_cleanupSemantic");
-var Pn = /[^a-z0-9]/i, In = /\s/, Mn = /[\r\n]/, is = /\n\r?\n$/, cs = /^\r?\n\r?\n/;
+var Nn = /[^a-z0-9]/i, In = /\s/, Mn = /[\r\n]/, is = /\n\r?\n$/, cs = /^\r?\n\r?\n/;
 function us(e) {
   let t = 1;
   for (; t < e.length - 1; ) {
@@ -1546,7 +1546,7 @@ function us(e) {
 }
 i(us, "diff_cleanupSemanticLossless");
 function qn(e) {
-  e.push(new N(M, ""));
+  e.push(new P(M, ""));
   let t = 0, n = 0, r = 0, o = "", s = "", c;
   for (; t < e.length; )
     switch (e[t][0]) {
@@ -1558,9 +1558,9 @@ function qn(e) {
         break;
       case M:
         n + r > 1 ? (n !== 0 && r !== 0 && (c = os(s, o), c !== 0 && (t - n - r > 0 && e[t - n - r - 1][0] === M ? e[t - n - r - 1][1] += s.
-        substring(0, c) : (e.splice(0, 0, new N(M, s.substring(0, c))), t++), s = s.substring(c), o = o.substring(c)), c = Vn(s, o), c !== 0 &&
+        substring(0, c) : (e.splice(0, 0, new P(M, s.substring(0, c))), t++), s = s.substring(c), o = o.substring(c)), c = Vn(s, o), c !== 0 &&
         (e[t][1] = s.substring(s.length - c) + e[t][1], s = s.substring(0, s.length - c), o = o.substring(0, o.length - c))), t -= n + r, e.
-        splice(t, n + r), o.length && (e.splice(t, 0, new N(z, o)), t++), s.length && (e.splice(t, 0, new N(j, s)), t++), t++) : t !== 0 && e[t -
+        splice(t, n + r), o.length && (e.splice(t, 0, new P(z, o)), t++), s.length && (e.splice(t, 0, new P(j, s)), t++), t++) : t !== 0 && e[t -
         1][0] === M ? (e[t - 1][1] += e[t][1], e.splice(t, 1)) : t++, r = 0, n = 0, o = "", s = "";
         break;
     }
@@ -1577,7 +1577,7 @@ i(qn, "diff_cleanupMerge");
 function ze(e, t) {
   if (!e || !t)
     return 6;
-  let n = e.charAt(e.length - 1), r = t.charAt(0), o = n.match(Pn), s = r.match(Pn), c = o && n.match(In), a = s && r.match(In), u = c && n.
+  let n = e.charAt(e.length - 1), r = t.charAt(0), o = n.match(Nn), s = r.match(Nn), c = o && n.match(In), a = s && r.match(In), u = c && n.
   match(Mn), m = a && r.match(Mn), p = u && e.match(is), l = m && t.match(cs);
   return p || l ? 5 : u || m ? 4 : o && !c && a ? 3 : c || a ? 2 : o || s ? 1 : 0;
 }
@@ -1588,46 +1588,46 @@ function ls() {
   if (Ln) return Ye;
   Ln = 1, Object.defineProperty(Ye, "__esModule", {
     value: !0
-  }), Ye.default = S;
-  let e = "diff-sequences", t = 0, n = /* @__PURE__ */ i((g, h, f, d, b) => {
+  }), Ye.default = b;
+  let e = "diff-sequences", t = 0, n = /* @__PURE__ */ i((g, h, f, d, S) => {
     let _ = 0;
-    for (; g < h && f < d && b(g, f); )
+    for (; g < h && f < d && S(g, f); )
       g += 1, f += 1, _ += 1;
     return _;
-  }, "countCommonItemsF"), r = /* @__PURE__ */ i((g, h, f, d, b) => {
+  }, "countCommonItemsF"), r = /* @__PURE__ */ i((g, h, f, d, S) => {
     let _ = 0;
-    for (; g <= h && f <= d && b(h, d); )
+    for (; g <= h && f <= d && S(h, d); )
       h -= 1, d -= 1, _ += 1;
     return _;
-  }, "countCommonItemsR"), o = /* @__PURE__ */ i((g, h, f, d, b, _, O) => {
+  }, "countCommonItemsR"), o = /* @__PURE__ */ i((g, h, f, d, S, _, O) => {
     let y = 0, E = -g, $ = _[y], T = $;
     _[y] += n(
       $ + 1,
       h,
       d + $ - E + 1,
       f,
-      b
+      S
     );
-    let A = g < O ? g : O;
-    for (y += 1, E += 2; y <= A; y += 1, E += 2) {
+    let R = g < O ? g : O;
+    for (y += 1, E += 2; y <= R; y += 1, E += 2) {
       if (y !== g && T < _[y])
         $ = _[y];
       else if ($ = T + 1, h <= $)
         return y - 1;
-      T = _[y], _[y] = $ + n($ + 1, h, d + $ - E + 1, f, b);
+      T = _[y], _[y] = $ + n($ + 1, h, d + $ - E + 1, f, S);
     }
     return O;
-  }, "extendPathsF"), s = /* @__PURE__ */ i((g, h, f, d, b, _, O) => {
+  }, "extendPathsF"), s = /* @__PURE__ */ i((g, h, f, d, S, _, O) => {
     let y = 0, E = g, $ = _[y], T = $;
     _[y] -= r(
       h,
       $ - 1,
       f,
       d + $ - E - 1,
-      b
+      S
     );
-    let A = g < O ? g : O;
-    for (y += 1, E -= 2; y <= A; y += 1, E -= 2) {
+    let R = g < O ? g : O;
+    for (y += 1, E -= 2; y <= R; y += 1, E -= 2) {
       if (y !== g && _[y] < T)
         $ = _[y];
       else if ($ = T - 1, $ < h)
@@ -1637,24 +1637,24 @@ function ls() {
         $ - 1,
         f,
         d + $ - E - 1,
-        b
+        S
       );
     }
     return O;
-  }, "extendPathsR"), c = /* @__PURE__ */ i((g, h, f, d, b, _, O, y, E, $, T) => {
-    let A = d - h, K = f - h, I = b - d - K, k = -I - (g - 1), G = -I + (g - 1), Y = t, P = g < y ? g : y;
-    for (let L = 0, x = -g; L <= P; L += 1, x += 2) {
-      let H = L === 0 || L !== g && Y < O[L], F = H ? O[L] : Y, W = H ? F : F + 1, re = A + W - x, V = n(
+  }, "extendPathsR"), c = /* @__PURE__ */ i((g, h, f, d, S, _, O, y, E, $, T) => {
+    let R = d - h, K = f - h, I = S - d - K, k = -I - (g - 1), G = -I + (g - 1), Y = t, N = g < y ? g : y;
+    for (let L = 0, x = -g; L <= N; L += 1, x += 2) {
+      let H = L === 0 || L !== g && Y < O[L], F = H ? O[L] : Y, W = H ? F : F + 1, re = R + W - x, V = n(
         W + 1,
         f,
         re + 1,
-        b,
+        S,
         _
       ), q = W + V;
       if (Y = O[L], O[L] = q, k <= x && x <= G) {
         let se = (g - 1 - (x + I)) / 2;
         if (se <= $ && E[se] - 1 <= q) {
-          let J = A + F - (H ? x + 1 : x - 1), U = r(
+          let J = R + F - (H ? x + 1 : x - 1), U = r(
             h,
             F,
             d,
@@ -1665,16 +1665,16 @@ function ls() {
           be), T.nCommonPreceding = U, U !== 0 && (T.aCommonPreceding = ue, T.bCommonPreceding = be), T.nCommonFollowing = V, V !== 0 && (T.
           aCommonFollowing = W + 1, T.bCommonFollowing = re + 1);
           let Ce = q + 1, Oe = re + V + 1;
-          return T.nChangeFollowing = g - 1, g - 1 === f + b - Ce - Oe ? (T.aStartFollowing = f, T.bStartFollowing = b) : (T.aStartFollowing =
+          return T.nChangeFollowing = g - 1, g - 1 === f + S - Ce - Oe ? (T.aStartFollowing = f, T.bStartFollowing = S) : (T.aStartFollowing =
           Ce, T.bStartFollowing = Oe), !0;
         }
       }
     }
     return !1;
-  }, "extendOverlappablePathsF"), a = /* @__PURE__ */ i((g, h, f, d, b, _, O, y, E, $, T) => {
-    let A = b - f, K = f - h, I = b - d - K, k = I - g, G = I + g, Y = t, P = g < $ ? g : $;
-    for (let L = 0, x = g; L <= P; L += 1, x -= 2) {
-      let H = L === 0 || L !== g && E[L] < Y, F = H ? E[L] : Y, W = H ? F : F - 1, re = A + W - x, V = r(
+  }, "extendOverlappablePathsF"), a = /* @__PURE__ */ i((g, h, f, d, S, _, O, y, E, $, T) => {
+    let R = S - f, K = f - h, I = S - d - K, k = I - g, G = I + g, Y = t, N = g < $ ? g : $;
+    for (let L = 0, x = g; L <= N; L += 1, x -= 2) {
+      let H = L === 0 || L !== g && E[L] < Y, F = H ? E[L] : Y, W = H ? F : F - 1, re = R + W - x, V = r(
         h,
         W - 1,
         d,
@@ -1687,40 +1687,40 @@ function ls() {
           let J = re - V;
           if (T.nChangePreceding = g, g === q + J - h - d ? (T.aEndPreceding = h, T.bEndPreceding = d) : (T.aEndPreceding = q, T.bEndPreceding =
           J), T.nCommonPreceding = V, V !== 0 && (T.aCommonPreceding = q, T.bCommonPreceding = J), T.nChangeFollowing = g - 1, g === 1)
-            T.nCommonFollowing = 0, T.aStartFollowing = f, T.bStartFollowing = b;
+            T.nCommonFollowing = 0, T.aStartFollowing = f, T.bStartFollowing = S;
           else {
-            let U = A + F - (H ? x - 1 : x + 1), oe = n(
+            let U = R + F - (H ? x - 1 : x + 1), oe = n(
               F,
               f,
               U,
-              b,
+              S,
               _
             );
             T.nCommonFollowing = oe, oe !== 0 && (T.aCommonFollowing = F, T.bCommonFollowing = U);
             let he = F + oe, ue = U + oe;
-            g - 1 === f + b - he - ue ? (T.aStartFollowing = f, T.bStartFollowing = b) : (T.aStartFollowing = he, T.bStartFollowing = ue);
+            g - 1 === f + S - he - ue ? (T.aStartFollowing = f, T.bStartFollowing = S) : (T.aStartFollowing = he, T.bStartFollowing = ue);
           }
           return !0;
         }
       }
     }
     return !1;
-  }, "extendOverlappablePathsR"), u = /* @__PURE__ */ i((g, h, f, d, b, _, O, y, E) => {
-    let $ = d - h, T = b - f, A = f - h, K = b - d, Q = K - A, I = A, k = A;
+  }, "extendOverlappablePathsR"), u = /* @__PURE__ */ i((g, h, f, d, S, _, O, y, E) => {
+    let $ = d - h, T = S - f, R = f - h, K = S - d, Q = K - R, I = R, k = R;
     if (O[0] = h - 1, y[0] = f, Q % 2 === 0) {
-      let G = (g || Q) / 2, Y = (A + K) / 2;
-      for (let P = 1; P <= Y; P += 1)
-        if (I = o(P, f, b, $, _, O, I), P < G)
-          k = s(P, h, d, T, _, y, k);
+      let G = (g || Q) / 2, Y = (R + K) / 2;
+      for (let N = 1; N <= Y; N += 1)
+        if (I = o(N, f, S, $, _, O, I), N < G)
+          k = s(N, h, d, T, _, y, k);
         else if (
           // If a reverse path overlaps a forward path in the same diagonal,
           // return a division of the index intervals at the middle change.
           a(
-            P,
+            N,
             h,
             f,
             d,
-            b,
+            S,
             _,
             O,
             I,
@@ -1731,27 +1731,27 @@ function ls() {
         )
           return;
     } else {
-      let G = ((g || Q) + 1) / 2, Y = (A + K + 1) / 2, P = 1;
-      for (I = o(P, f, b, $, _, O, I), P += 1; P <= Y; P += 1)
+      let G = ((g || Q) + 1) / 2, Y = (R + K + 1) / 2, N = 1;
+      for (I = o(N, f, S, $, _, O, I), N += 1; N <= Y; N += 1)
         if (k = s(
-          P - 1,
+          N - 1,
           h,
           d,
           T,
           _,
           y,
           k
-        ), P < G)
-          I = o(P, f, b, $, _, O, I);
+        ), N < G)
+          I = o(N, f, S, $, _, O, I);
         else if (
           // If a forward path overlaps a reverse path in the same diagonal,
           // return a division of the index intervals at the middle change.
           c(
-            P,
+            N,
             h,
             f,
             d,
-            b,
+            S,
             _,
             O,
             I,
@@ -1763,10 +1763,10 @@ function ls() {
           return;
     }
     throw new Error(
-      `${e}: no overlap aStart=${h} aEnd=${f} bStart=${d} bEnd=${b}`
+      `${e}: no overlap aStart=${h} aEnd=${f} bStart=${d} bEnd=${S}`
     );
-  }, "divide"), m = /* @__PURE__ */ i((g, h, f, d, b, _, O, y, E, $) => {
-    if (b - d < f - h) {
+  }, "divide"), m = /* @__PURE__ */ i((g, h, f, d, S, _, O, y, E, $) => {
+    if (S - d < f - h) {
       if (_ = !_, _ && O.length === 1) {
         let { foundSubsequence: q, isCommon: se } = O[0];
         O[1] = {
@@ -1777,16 +1777,16 @@ function ls() {
         };
       }
       let re = h, V = f;
-      h = d, f = b, d = re, b = V;
+      h = d, f = S, d = re, S = V;
     }
-    let { foundSubsequence: T, isCommon: A } = O[_ ? 1 : 0];
+    let { foundSubsequence: T, isCommon: R } = O[_ ? 1 : 0];
     u(
       g,
       h,
       f,
       d,
-      b,
-      A,
+      S,
+      R,
       y,
       E,
       $
@@ -1798,7 +1798,7 @@ function ls() {
       nCommonPreceding: k,
       aCommonPreceding: G,
       bCommonPreceding: Y,
-      nCommonFollowing: P,
+      nCommonFollowing: N,
       aCommonFollowing: L,
       bCommonFollowing: x,
       nChangeFollowing: H,
@@ -1816,12 +1816,12 @@ function ls() {
       y,
       E,
       $
-    ), k !== 0 && T(k, G, Y), P !== 0 && T(P, L, x), F < f && W < b && m(
+    ), k !== 0 && T(k, G, Y), N !== 0 && T(N, L, x), F < f && W < S && m(
       H,
       F,
       f,
       W,
-      b,
+      S,
       _,
       O,
       y,
@@ -1840,17 +1840,17 @@ function ls() {
     if (f !== "function")
       throw new TypeError(`${e}: ${g} typeof ${f} is not a function`);
   }, "validateCallback");
-  function S(g, h, f, d) {
+  function b(g, h, f, d) {
     p("aLength", g), p("bLength", h), l("isCommon", f), l("foundSubsequence", d);
-    let b = n(0, g, 0, h, f);
-    if (b !== 0 && d(b, 0, 0), g !== b || h !== b) {
-      let _ = b, O = b, y = r(
+    let S = n(0, g, 0, h, f);
+    if (S !== 0 && d(S, 0, 0), g !== S || h !== S) {
+      let _ = S, O = S, y = r(
         _,
         g - 1,
         O,
         h - 1,
         f
-      ), E = g - y, $ = h - y, T = b + y;
+      ), E = g - y, $ = h - y, T = S + y;
       g !== T && h !== T && m(
         0,
         _,
@@ -1883,10 +1883,10 @@ function ls() {
       ), y !== 0 && d(y, E, $);
     }
   }
-  return i(S, "diffSequence"), Ye;
+  return i(b, "diffSequence"), Ye;
 }
 i(ls, "requireBuild");
-var fs = ls(), Gn = /* @__PURE__ */ An(fs);
+var fs = ls(), Gn = /* @__PURE__ */ Rn(fs);
 function ms(e, t) {
   return e.replace(/\s+$/, (n) => t(n));
 }
@@ -1932,9 +1932,9 @@ function ps(e, t) {
   }
   let m = a !== 0 || c;
   a !== 0 ? s += a + 1 : c && (s += 1);
-  let p = s - 1, l = [], S = 0;
+  let p = s - 1, l = [], b = 0;
   m && l.push("");
-  let g = 0, h = 0, f = 0, d = 0, b = /* @__PURE__ */ i((y) => {
+  let g = 0, h = 0, f = 0, d = 0, S = /* @__PURE__ */ i((y) => {
     let E = l.length;
     l.push(Xn(y, E === 0 || E === p, t)), f += 1, d += 1;
   }, "pushCommonLine"), _ = /* @__PURE__ */ i((y) => {
@@ -1952,32 +1952,32 @@ function ps(e, t) {
       if (y === 0) {
         u > r && (y = u - r, g = y, h = y, f = g, d = h);
         for (let E = y; E !== u; E += 1)
-          b(e[E][1]);
+          S(e[E][1]);
       } else if (u === n) {
         let E = u - y > r ? y + r : u;
         for (let $ = y; $ !== E; $ += 1)
-          b(e[$][1]);
+          S(e[$][1]);
       } else {
         let E = u - y;
         if (E > o) {
           let $ = y + r;
-          for (let A = y; A !== $; A += 1)
-            b(e[A][1]);
-          l[S] = xn(g, f, h, d, t), S = l.length, l.push("");
+          for (let R = y; R !== $; R += 1)
+            S(e[R][1]);
+          l[b] = xn(g, f, h, d, t), b = l.length, l.push("");
           let T = E - o;
           g = f + T, h = d + T, f = g, d = h;
-          for (let A = u - r; A !== u; A += 1)
-            b(e[A][1]);
+          for (let R = u - r; R !== u; R += 1)
+            S(e[R][1]);
         } else
           for (let $ = y; $ !== u; $ += 1)
-            b(e[$][1]);
+            S(e[$][1]);
       }
     for (; u !== n && e[u][0] === z; )
       _(e[u][1]), u += 1;
     for (; u !== n && e[u][0] === j; )
       O(e[u][1]), u += 1;
   }
-  return m && (l[S] = xn(g, f, h, d, t)), l.join(`
+  return m && (l[b] = xn(g, f, h, d, t)), l.join(`
 `);
 }
 i(ps, "joinAlignedDiffsNoExpand");
@@ -2067,25 +2067,25 @@ function Es({ aAnnotation: e, aColor: t, aIndicator: n, bAnnotation: r, bColor:
     return "";
   let m = "", p = "";
   if (c) {
-    let g = String(u.a), h = String(u.b), f = r.length - e.length, d = " ".repeat(Math.max(0, f)), b = " ".repeat(Math.max(0, -f)), _ = h.length -
+    let g = String(u.a), h = String(u.b), f = r.length - e.length, d = " ".repeat(Math.max(0, f)), S = " ".repeat(Math.max(0, -f)), _ = h.length -
     g.length, O = " ".repeat(Math.max(0, _)), y = " ".repeat(Math.max(0, -_));
-    m = `${d}  ${n} ${O}${g}`, p = `${b}  ${s} ${y}${h}`;
+    m = `${d}  ${n} ${O}${g}`, p = `${S}  ${s} ${y}${h}`;
   }
-  let l = `${n} ${e}${m}`, S = `${s} ${r}${p}`;
+  let l = `${n} ${e}${m}`, b = `${s} ${r}${p}`;
   return `${t(l)}
-${o(S)}
+${o(b)}
 
 `;
 }
 i(Es, "printAnnotation");
-function At(e, t, n) {
+function Rt(e, t, n) {
   return Es(n, Ss(e)) + (n.expand ? gs(e, n) : ps(e, n)) + (t ? n.truncateAnnotationColor(`
 ${n.truncateAnnotation}`) : "");
 }
-i(At, "printDiffLines");
+i(Rt, "printDiffLines");
 function We(e, t, n) {
   let r = ge(n), [o, s] = Qn(ye(e) ? [] : e, ye(t) ? [] : t, r);
-  return At(o, s, r);
+  return Rt(o, s, r);
 }
 i(We, "diffLinesUnified");
 function _s(e, t, n, r, o) {
@@ -2103,7 +2103,7 @@ function _s(e, t, n, r, o) {
       default:
         m[1] = t[u], a += 1, u += 1;
     }
-  }), At(s, c, ge(o));
+  }), Rt(s, c, ge(o));
 }
 i(_s, "diffLinesUnified2");
 function Qn(e, t, n) {
@@ -2112,15 +2112,15 @@ function Qn(e, t, n) {
   p = 0, l = 0;
   for (Gn(s, c, u, /* @__PURE__ */ i((g, h, f) => {
     for (; p !== h; p += 1)
-      m.push(new N(z, e[p]));
+      m.push(new P(z, e[p]));
     for (; l !== f; l += 1)
-      m.push(new N(j, t[l]));
+      m.push(new P(j, t[l]));
     for (; g !== 0; g -= 1, p += 1, l += 1)
-      m.push(new N(M, t[l]));
+      m.push(new P(M, t[l]));
   }, "foundSubsequence")); p !== s; p += 1)
-    m.push(new N(z, e[p]));
+    m.push(new P(z, e[p]));
   for (; l !== c; l += 1)
-    m.push(new N(j, t[l]));
+    m.push(new P(j, t[l]));
   return [m, a];
 }
 i(Qn, "diffLinesRaw");
@@ -2170,23 +2170,23 @@ function Ts(e, t, n) {
   if (r) {
     let g = e.includes(`
 `), h = t.includes(`
-`), f = Fn(e), d = Fn(t), b = g ? `${e.split(f, o).join(f)}
+`), f = Fn(e), d = Fn(t), S = g ? `${e.split(f, o).join(f)}
 ` : e, _ = h ? `${t.split(d, o).join(d)}
 ` : t;
-    s = b.length, c = _.length;
+    s = S.length, c = _.length;
   }
   let a = s !== e.length || c !== t.length, u = /* @__PURE__ */ i((g, h) => e[g] === t[h], "isCommon"), m = 0, p = 0, l = [];
   return Gn(s, c, u, /* @__PURE__ */ i((g, h, f) => {
-    m !== h && l.push(new N(z, e.slice(m, h))), p !== f && l.push(new N(j, t.slice(p, f))), m = h + g, p = f + g, l.push(new N(M, t.slice(f,
+    m !== h && l.push(new P(z, e.slice(m, h))), p !== f && l.push(new P(j, t.slice(p, f))), m = h + g, p = f + g, l.push(new P(M, t.slice(f,
     p)));
-  }, "foundSubsequence")), m !== s && l.push(new N(z, e.slice(m))), p !== c && l.push(new N(j, t.slice(p))), [l, a];
+  }, "foundSubsequence")), m !== s && l.push(new P(z, e.slice(m))), p !== c && l.push(new P(j, t.slice(p))), [l, a];
 }
 i(Ts, "diffStrings");
 function Cs(e, t, n) {
   return t.reduce((r, o) => r + (o[0] === M ? o[1] : o[0] === e && o[1].length !== 0 ? n(o[1]) : ""), "");
 }
 i(Cs, "concatenateRelevantDiffs");
-var Nt = class Nt {
+var Pt = class Pt {
   op;
   line;
   lines;
@@ -2195,11 +2195,11 @@ var Nt = class Nt {
     this.op = t, this.line = [], this.lines = [], this.changeColor = n;
   }
   pushSubstring(t) {
-    this.pushDiff(new N(this.op, t));
+    this.pushDiff(new P(this.op, t));
   }
   pushLine() {
-    this.lines.push(this.line.length !== 1 ? new N(this.op, Cs(this.op, this.line, this.changeColor)) : this.line[0][0] === this.op ? this.line[0] :
-    new N(this.op, this.line[0][1])), this.line.length = 0;
+    this.lines.push(this.line.length !== 1 ? new P(this.op, Cs(this.op, this.line, this.changeColor)) : this.line[0][0] === this.op ? this.line[0] :
+    new P(this.op, this.line[0][1])), this.line.length = 0;
   }
   isLineEmpty() {
     return this.line.length === 0;
@@ -2226,8 +2226,8 @@ var Nt = class Nt {
     this.isLineEmpty() || this.pushLine(), t.push(...this.lines), this.lines.length = 0;
   }
 };
-i(Nt, "ChangeBuffer");
-var Ue = Nt, Pt = class Pt {
+i(Pt, "ChangeBuffer");
+var Ue = Pt, Nt = class Nt {
   deleteBuffer;
   insertBuffer;
   lines;
@@ -2254,10 +2254,10 @@ var Ue = Nt, Pt = class Pt {
 `), s = o.length - 1;
       o.forEach((c, a) => {
         if (a === 0) {
-          let u = new N(n, c);
+          let u = new P(n, c);
           this.deleteBuffer.isLineEmpty() && this.insertBuffer.isLineEmpty() ? (this.flushChangeLines(), this.pushDiffCommonLine(u)) : (this.
           pushDiffChangeLines(u), this.flushChangeLines());
-        } else a < s ? this.pushDiffCommonLine(new N(n, c)) : c.length !== 0 && this.pushDiffChangeLines(new N(n, c));
+        } else a < s ? this.pushDiffCommonLine(new P(n, c)) : c.length !== 0 && this.pushDiffChangeLines(new P(n, c));
       });
     } else
       this.pushDiffChangeLines(t);
@@ -2267,8 +2267,8 @@ var Ue = Nt, Pt = class Pt {
     return this.flushChangeLines(), this.lines;
   }
 };
-i(Pt, "CommonBuffer");
-var Tt = Pt;
+i(Nt, "CommonBuffer");
+var Tt = Nt;
 function Os(e, t) {
   let n = new Ue(z, t), r = new Ue(j, t), o = new Tt(n, r);
   return e.forEach((s) => {
@@ -2303,7 +2303,7 @@ function ws(e, t, n) {
 ` : t, !0, n);
     if ($s(o, r)) {
       let c = ge(n), a = Os(o, c.changeColor);
-      return At(a, s, c);
+      return Rt(a, s, c);
     }
   }
   return We(e.split(`
@@ -2321,13 +2321,13 @@ function Ct(e, t) {
   return n(e);
 }
 i(Ct, "getCommonMessage");
-var { AsymmetricMatcher: As, DOMCollection: Rs, DOMElement: Ns, Immutable: Ps, ReactElement: Is, ReactTestComponent: Ms } = _e, er = [
+var { AsymmetricMatcher: Rs, DOMCollection: As, DOMElement: Ps, Immutable: Ns, ReactElement: Is, ReactTestComponent: Ms } = _e, er = [
   Ms,
   Is,
-  Ns,
-  Rs,
   Ps,
   As,
+  Ns,
+  Rs,
   _e.Error
 ], Ot = {
   maxDepth: 20,
@@ -2351,13 +2351,13 @@ function Ls(e, t, n) {
       return O.length <= f ? O : `${O.slice(0, f)}...`;
     };
     i(d, "truncate");
-    let { aAnnotation: c, aColor: a, aIndicator: u, bAnnotation: m, bColor: p, bIndicator: l } = ge(n), S = $t(tr, n), g = X(e, S), h = X(t,
-    S), f = 1e5;
+    let { aAnnotation: c, aColor: a, aIndicator: u, bAnnotation: m, bColor: p, bIndicator: l } = ge(n), b = $t(tr, n), g = X(e, b), h = X(t,
+    b), f = 1e5;
     g = d(g), h = d(h);
-    let b = `${a(`${u} ${c}:`)} 
+    let S = `${a(`${u} ${c}:`)} 
 ${g}`, _ = `${p(`${l} ${m}:`)} 
 ${h}`;
-    return `${b}
+    return `${S}
 
 ${_}`;
   }
@@ -2456,7 +2456,7 @@ function nr(e, t, n) {
 `) || e.includes(`
 `))
       return ws(t, e, n);
-    let [p] = vn(t, e, !0), l = p.some((f) => f[0] === M), S = Ds(r, o), g = S(r) + ks(Wn(p, z, l)), h = S(o) + js(Wn(p, j, l));
+    let [p] = vn(t, e, !0), l = p.some((f) => f[0] === M), b = Ds(r, o), g = b(r) + ks(Wn(p, z, l)), h = b(o) + js(Wn(p, j, l));
     return `${g}
 ${h}`;
   }
@@ -2653,7 +2653,7 @@ prototype.toString.call(e) === "[object Module]", "isModule"), Xs = /* @__PURE__
     return {};
   }
 }, "construct"), Mt = /* @__PURE__ */ i(() => ({
-  renderPhase: void 0,
+  renderPhase: "preparing",
   isDebugging: !1,
   isPlaying: !1,
   isLocked: !1,
@@ -2697,43 +2697,45 @@ prototype.toString.call(e) === "[object Module]", "isModule"), Xs = /* @__PURE__
     this.loadParentWindowState();
     let t = /* @__PURE__ */ i(({
       storyId: u,
-      isPlaying: m = !0,
-      isDebugging: p = !1
+      renderPhase: m,
+      isPlaying: p = !0,
+      isDebugging: l = !1
     }) => {
-      let l = this.getState(u);
+      let b = this.getState(u);
       this.setState(u, {
         ...Mt(),
-        ...ur(l, p),
-        shadowCalls: p ? l.shadowCalls : [],
-        chainedCallIds: p ? l.chainedCallIds : /* @__PURE__ */ new Set(),
-        playUntil: p ? l.playUntil : void 0,
-        isPlaying: m,
-        isDebugging: p
+        ...ur(b, l),
+        renderPhase: m || b.renderPhase,
+        shadowCalls: l ? b.shadowCalls : [],
+        chainedCallIds: l ? b.chainedCallIds : /* @__PURE__ */ new Set(),
+        playUntil: l ? b.playUntil : void 0,
+        isPlaying: p,
+        isDebugging: l
       }), this.sync(u);
     }, "resetState"), n = /* @__PURE__ */ i((u) => ({ storyId: m, playUntil: p }) => {
-      this.getState(m).isDebugging || this.setState(m, ({ calls: S }) => ({
+      this.getState(m).isDebugging || this.setState(m, ({ calls: b }) => ({
         calls: [],
-        shadowCalls: S.map((g) => ({ ...g, status: "waiting" })),
+        shadowCalls: b.map((g) => ({ ...g, status: "waiting" })),
         isDebugging: !0
       }));
       let l = this.getLog(m);
-      this.setState(m, ({ shadowCalls: S }) => {
+      this.setState(m, ({ shadowCalls: b }) => {
         if (p || !l.length)
           return { playUntil: p };
-        let g = S.findIndex((h) => h.id === l[0].callId);
+        let g = b.findIndex((h) => h.id === l[0].callId);
         return {
-          playUntil: S.slice(0, g).filter((h) => h.interceptable && !h.ancestors?.length).slice(-1)[0]?.id
+          playUntil: b.slice(0, g).filter((h) => h.interceptable && !h.ancestors?.length).slice(-1)[0]?.id
         };
       }), u.emit(ir, { storyId: m, isDebugging: !0 });
     }, "start"), r = /* @__PURE__ */ i((u) => ({ storyId: m }) => {
-      let p = this.getLog(m).filter((S) => !S.ancestors?.length), l = p.reduceRight((S, g, h) => S >= 0 || g.status === "waiting" ? S : h, -1);
+      let p = this.getLog(m).filter((b) => !b.ancestors?.length), l = p.reduceRight((b, g, h) => b >= 0 || g.status === "waiting" ? b : h, -1);
       n(u)({ storyId: m, playUntil: p[l - 1]?.callId });
     }, "back"), o = /* @__PURE__ */ i((u) => ({ storyId: m, callId: p }) => {
-      let { calls: l, shadowCalls: S, resolvers: g } = this.getState(m), h = l.find(({ id: d }) => d === p), f = S.find(({ id: d }) => d ===
+      let { calls: l, shadowCalls: b, resolvers: g } = this.getState(m), h = l.find(({ id: d }) => d === p), f = b.find(({ id: d }) => d ===
       p);
       if (!h && f && Object.values(g).length > 0) {
-        let d = this.getLog(m).find((b) => b.status === "waiting")?.callId;
-        f.id !== d && this.setState(m, { playUntil: f.id }), Object.values(g).forEach((b) => b());
+        let d = this.getLog(m).find((S) => S.status === "waiting")?.callId;
+        f.id !== d && this.setState(m, { playUntil: f.id }), Object.values(g).forEach((S) => S());
       } else
         n(u)({ storyId: m, playUntil: p });
     }, "goto"), s = /* @__PURE__ */ i((u) => ({ storyId: m }) => {
@@ -2741,22 +2743,36 @@ prototype.toString.call(e) === "[object Module]", "isModule"), Xs = /* @__PURE__
       if (Object.values(p).length > 0)
         Object.values(p).forEach((l) => l());
       else {
-        let l = this.getLog(m).find((S) => S.status === "waiting")?.callId;
+        let l = this.getLog(m).find((b) => b.status === "waiting")?.callId;
         l ? n(u)({ storyId: m, playUntil: l }) : c({ storyId: m });
       }
     }, "next"), c = /* @__PURE__ */ i(({ storyId: u }) => {
       this.setState(u, { playUntil: void 0, isDebugging: !1 }), Object.values(this.getState(u).resolvers).forEach((m) => m());
-    }, "end"), a = /* @__PURE__ */ i(({ storyId: u, newPhase: m }) => {
+    }, "end"), a = /* @__PURE__ */ i(({
+      storyId: u,
+      newPhase: m
+    }) => {
       let { isDebugging: p } = this.getState(u);
-      this.setState(u, { renderPhase: m }), m === "preparing" && p && t({ storyId: u }), m === "playing" && t({ storyId: u, isDebugging: p }),
-      m === "played" && this.setState(u, {
+      if (m === "preparing" && p)
+        return t({ storyId: u, renderPhase: m });
+      if (m === "playing")
+        return t({ storyId: u, renderPhase: m, isDebugging: p });
+      m === "played" ? this.setState(u, {
+        renderPhase: m,
         isLocked: !1,
         isPlaying: !1,
         isDebugging: !1
-      }), m === "errored" && this.setState(u, {
+      }) : m === "errored" ? this.setState(u, {
+        renderPhase: m,
         isLocked: !1,
         isPlaying: !1
-      });
+      }) : m === "aborted" ? this.setState(u, {
+        renderPhase: m,
+        isLocked: !0,
+        isPlaying: !1
+      }) : this.setState(u, {
+        renderPhase: m
+      }), this.sync(u);
     }, "renderPhaseChanged");
     qe && qe.ready().then(() => {
       this.channel = qe.getChannel(), this.channel.on(ir, t), this.channel.on(Gs, a), this.channel.on(Ks, () => {
@@ -2769,8 +2785,10 @@ prototype.toString.call(e) === "[object Module]", "isModule"), Xs = /* @__PURE__
     return this.state[t] || Mt();
   }
   setState(t, n) {
-    let r = this.getState(t), o = typeof n == "function" ? n(r) : n;
-    this.state = { ...this.state, [t]: { ...r, ...o } }, this.updateParentWindowState();
+    if (t) {
+      let r = this.getState(t), o = typeof n == "function" ? n(r) : n;
+      this.state = { ...this.state, [t]: { ...r, ...o } }, this.updateParentWindowState();
+    }
   }
   cleanup() {
     this.state = Object.entries(this.state).reduce(
@@ -2840,8 +2858,8 @@ prototype.toString.call(e) === "[object Module]", "isModule"), Xs = /* @__PURE__
     let c = o?.[0]?.__storyId__ || Z.__STORYBOOK_PREVIEW__?.selectionStore?.selection?.storyId, { cursor: a, ancestors: u } = this.getState(
     c);
     this.setState(c, { cursor: a + 1 });
-    let m = `${u.slice(-1)[0] || c} [${a}] ${t}`, { path: p = [], intercept: l = !1, retain: S = !1 } = s, g = typeof l == "function" ? l(t,
-    p) : l, h = { id: m, cursor: a, storyId: c, ancestors: u, path: p, method: t, args: o, interceptable: g, retain: S }, d = (g && !u.length ?
+    let m = `${u.slice(-1)[0] || c} [${a}] ${t}`, { path: p = [], intercept: l = !1, retain: b = !1 } = s, g = typeof l == "function" ? l(t,
+    p) : l, h = { id: m, cursor: a, storyId: c, ancestors: u, path: p, method: t, args: o, interceptable: g, retain: b }, d = (g && !u.length ?
     this.intercept : this.invoke).call(this, n, r, h, s);
     return this.instrument(d, { ...s, mutate: !0, path: [{ __callId__: h.id }] });
   }
@@ -2858,15 +2876,15 @@ prototype.toString.call(e) === "[object Module]", "isModule"), Xs = /* @__PURE__
     }), this.invoke(t, n, r, o)));
   }
   invoke(t, n, r, o) {
-    let { callRefsByResult: s, renderPhase: c } = this.getState(r.storyId), a = 25, u = /* @__PURE__ */ i((l, S, g) => {
+    let { callRefsByResult: s, renderPhase: c } = this.getState(r.storyId), a = 25, u = /* @__PURE__ */ i((l, b, g) => {
       if (g.includes(l))
         return "[Circular]";
-      if (g = [...g, l], S > a)
+      if (g = [...g, l], b > a)
         return "...";
       if (s.has(l))
         return s.get(l);
       if (l instanceof Array)
-        return l.map((h) => u(h, ++S, g));
+        return l.map((h) => u(h, ++b, g));
       if (l instanceof Date)
         return { __date__: { value: l.toISOString() } };
       if (l instanceof Error) {
@@ -2878,32 +2896,32 @@ prototype.toString.call(e) === "[object Module]", "isModule"), Xs = /* @__PURE__
         return { __regexp__: { flags: h, source: f } };
       }
       if (l instanceof Z.window?.HTMLElement) {
-        let { prefix: h, localName: f, id: d, classList: b, innerText: _ } = l, O = Array.from(b);
+        let { prefix: h, localName: f, id: d, classList: S, innerText: _ } = l, O = Array.from(S);
         return { __element__: { prefix: h, localName: f, id: d, classNames: O, innerText: _ } };
       }
       return typeof l == "function" ? {
         __function__: { name: "getMockName" in l ? l.getMockName() : l.name }
       } : typeof l == "symbol" ? { __symbol__: { description: l.description } } : typeof l == "object" && l?.constructor?.name && l?.constructor?.
       name !== "Object" ? { __class__: { name: l.constructor.name } } : Object.prototype.toString.call(l) === "[object Object]" ? Object.fromEntries(
-        Object.entries(l).map(([h, f]) => [h, u(f, ++S, g)])
+        Object.entries(l).map(([h, f]) => [h, u(f, ++b, g)])
       ) : l;
     }, "serializeValues"), m = {
       ...r,
       args: r.args.map((l) => u(l, 0, []))
     };
     r.path.forEach((l) => {
-      l?.__callId__ && this.setState(r.storyId, ({ chainedCallIds: S }) => ({
-        chainedCallIds: new Set(Array.from(S).concat(l.__callId__))
+      l?.__callId__ && this.setState(r.storyId, ({ chainedCallIds: b }) => ({
+        chainedCallIds: new Set(Array.from(b).concat(l.__callId__))
       }));
     });
     let p = /* @__PURE__ */ i((l) => {
       if (l instanceof Error) {
-        let { name: S, message: g, stack: h, callId: f = r.id } = l, {
+        let { name: b, message: g, stack: h, callId: f = r.id } = l, {
           showDiff: d = void 0,
-          diff: b = void 0,
+          diff: S = void 0,
           actual: _ = void 0,
           expected: O = void 0
-        } = l.name === "AssertionError" ? It(l) : l, y = { name: S, message: g, stack: h, callId: f, showDiff: d, diff: b, actual: _, expected: O };
+        } = l.name === "AssertionError" ? It(l) : l, y = { name: b, message: g, stack: h, callId: f, showDiff: d, diff: S, actual: _, expected: O };
         if (this.update({ ...m, status: "error", exception: y }), this.setState(r.storyId, (E) => ({
           callRefsByResult: new Map([
             ...Array.from(E.callRefsByResult.entries()),
@@ -2917,18 +2935,18 @@ prototype.toString.call(e) === "[object Module]", "isModule"), Xs = /* @__PURE__
     try {
       if (c === "played" && !r.retain)
         throw Hs;
-      let S = (o.getArgs ? o.getArgs(r, this.getState(r.storyId)) : r.args).map((h) => typeof h != "function" || ei(h) || Object.keys(h).length ?
+      let b = (o.getArgs ? o.getArgs(r, this.getState(r.storyId)) : r.args).map((h) => typeof h != "function" || ei(h) || Object.keys(h).length ?
       h : (...f) => {
-        let { cursor: d, ancestors: b } = this.getState(r.storyId);
-        this.setState(r.storyId, { cursor: 0, ancestors: [...b, r.id] });
-        let _ = /* @__PURE__ */ i(() => this.setState(r.storyId, { cursor: d, ancestors: b }), "restore"), O = !1;
+        let { cursor: d, ancestors: S } = this.getState(r.storyId);
+        this.setState(r.storyId, { cursor: 0, ancestors: [...S, r.id] });
+        let _ = /* @__PURE__ */ i(() => this.setState(r.storyId, { cursor: d, ancestors: S }), "restore"), O = !1;
         try {
           let y = h(...f);
           return y instanceof Promise ? (O = !0, y.finally(_)) : y;
         } finally {
           O || _();
         }
-      }), g = t.apply(n, S);
+      }), g = t.apply(n, b);
       return g && ["object", "function", "symbol"].includes(typeof g) && this.setState(r.storyId, (h) => ({
         callRefsByResult: new Map([
           ...Array.from(h.callRefsByResult.entries()),
@@ -2961,7 +2979,7 @@ prototype.toString.call(e) === "[object Module]", "isModule"), Xs = /* @__PURE__
       let { isLocked: r, isPlaying: o } = this.getState(t), s = this.getLog(t), c = s.filter(({ ancestors: l }) => !l.length).find((l) => l.
       status === "waiting")?.callId, a = s.some((l) => l.status === "active");
       if (this.detached || r || a || s.length === 0) {
-        let S = { controlStates: {
+        let b = { controlStates: {
           detached: this.detached,
           start: !1,
           back: !1,
@@ -2969,7 +2987,7 @@ prototype.toString.call(e) === "[object Module]", "isModule"), Xs = /* @__PURE__
           next: !1,
           end: !1
         }, logItems: s };
-        this.channel?.emit(ne.SYNC, S);
+        this.channel?.emit(ne.SYNC, b);
         return;
       }
       let u = s.some(