storybook 9.0.0-alpha.17 → 9.0.0-alpha.18

package/dist/instrumenter/index.js

@@ -1742,7 +1742,7 @@ i(Sn, "p");
 // ../node_modules/tinyrainbow/dist/browser.js
 var ie = Sn();
 
-// ../node_modules/@vitest/utils/node_modules/@vitest/pretty-format/dist/index.js
+// ../node_modules/@vitest/pretty-format/dist/index.js
 function jn(e, t) {
   return t.forEach(function(r) {
     r && typeof r != "string" && !Array.isArray(r) && Object.keys(r).forEach(function(n) {
@@ -1777,19 +1777,7 @@ function qe(e, t, r, n, o, s, c = ": ") {
         u += "\u2026";
         break;
       }
-      let l = s(
-        f.value[0],
-        t,
-        y,
-        n,
-        o
-      ), h = s(
-        f.value[1],
-        t,
-        y,
-        n,
-        o
-      );
+      let l = s(f.value[0], t, y, n, o), h = s(f.value[1], t, y, n, o);
       u += l + c + h, f = e.next(), f.done ? t.min || (u += ",") : u += `,${t.spacingInner}`;
     }
     u += t.spacingOuter + r;
@@ -1826,13 +1814,7 @@ function it(e, t, r, n, o, s) {
         c += "\u2026";
         break;
       }
-      (u(e) || y in e) && (c += s(
-        u(e) ? e.getInt8(y) : e[y],
-        t,
-        f,
-        n,
-        o
-      )), y < a - 1 ? c += `,${t.spacingInner}` : t.min || (c += ",");
+      (u(e) || y in e) && (c += s(u(e) ? e.getInt8(y) : e[y], t, f, n, o)), y < a - 1 ? c += `,${t.spacingInner}` : t.min || (c += ",");
     }
     c += t.spacingOuter + r;
   }
@@ -1856,32 +1838,18 @@ i(nr, "printObjectProperties");
 var $c = typeof Symbol == "function" && Symbol.for ? Symbol.for("jest.asymmetricMatcher") : 1267621, nt = " ", Rc = /* @__PURE__ */ i((e, t, r, n, o, s) => {
   let c = e.toString();
   if (c === "ArrayContaining" || c === "ArrayNotContaining")
-    return ++n > t.maxDepth ? `[${c}]` : `${c + nt}[${it(
-      e.sample,
-      t,
-      r,
-      n,
-      o,
-      s
-    )}]`;
+    return ++n > t.maxDepth ? `[${c}]` : `${c + nt}[${it(e.sample, t, r, n, o, s)}]`;
   if (c === "ObjectContaining" || c === "ObjectNotContaining")
-    return ++n > t.maxDepth ? `[${c}]` : `${c + nt}{${nr(
-      e.sample,
-      t,
-      r,
-      n,
-      o,
-      s
-    )}}`;
+    return ++n > t.maxDepth ? `[${c}]` : `${c + nt}{${nr(e.sample, t, r, n, o, s)}}`;
   if (c === "StringMatching" || c === "StringNotMatching" || c === "StringContaining" || c === "StringNotContaining")
     return c + nt + s(e.sample, t, r, n, o);
   if (typeof e.toAsymmetricMatcher != "function")
-    throw new TypeError(
-      `Asymmetric matcher ${e.constructor.name} does not implement toAsymmetricMatcher()`
-    );
+    throw new TypeError(`Asymmetric matcher ${e.constructor.name} does not implement toAsymmetricMatcher()`);
   return e.toAsymmetricMatcher();
-}, "serialize$5"), Ic = /* @__PURE__ */ i((e) => e && e.$$typeof === $c, "test$5"), Nc = { serialize: Rc, test: Ic }, jc = " ", Mn = /* @__PURE__ */ new Set(
-["DOMStringMap", "NamedNodeMap"]), Mc = /^(?:HTML\w*Collection|NodeList)$/;
+}, "serialize$5"), Ic = /* @__PURE__ */ i((e) => e && e.$$typeof === $c, "test$5"), Nc = {
+  serialize: Rc,
+  test: Ic
+}, jc = " ", Mn = /* @__PURE__ */ new Set(["DOMStringMap", "NamedNodeMap"]), Mc = /^(?:HTML\w*Collection|NodeList)$/;
 function xc(e) {
   return Mn.has(e) || Mc.test(e);
 }
@@ -1893,25 +1861,12 @@ function Fc(e) {
 i(Fc, "isNamedNodeMap");
 var Lc = /* @__PURE__ */ i((e, t, r, n, o, s) => {
   let c = e.constructor.name;
-  return ++n > t.maxDepth ? `[${c}]` : (t.min ? "" : c + jc) + (Mn.has(c) ? `{${nr(
-    Fc(e) ? [...e].reduce(
-      (u, a) => (u[a.name] = a.value, u),
-      {}
-    ) : { ...e },
-    t,
-    r,
-    n,
-    o,
-    s
-  )}}` : `[${it(
-    [...e],
-    t,
-    r,
-    n,
-    o,
-    s
-  )}]`);
-}, "serialize$4"), Dc = { serialize: Lc, test: vc };
+  return ++n > t.maxDepth ? `[${c}]` : (t.min ? "" : c + jc) + (Mn.has(c) ? `{${nr(Fc(e) ? [...e].reduce((u, a) => (u[a.name] = a.value, u),
+  {}) : { ...e }, t, r, n, o, s)}}` : `[${it([...e], t, r, n, o, s)}]`);
+}, "serialize$4"), Dc = {
+  serialize: Lc,
+  test: vc
+};
 function xn(e) {
   return e.replaceAll("<", "&lt;").replaceAll(">", "&gt;");
 }
@@ -1927,9 +1882,7 @@ function or(e, t, r, n, o, s, c) {
 }
 i(or, "printProps");
 function ir(e, t, r, n, o, s) {
-  return e.map(
-    (c) => t.spacingOuter + r + (typeof c == "string" ? vn(c, t) : s(c, t, r, n, o))
-  ).join("");
+  return e.map((c) => t.spacingOuter + r + (typeof c == "string" ? vn(c, t) : s(c, t, r, n, o))).join("");
 }
 i(ir, "printChildren");
 function vn(e, t) {
@@ -1969,7 +1922,7 @@ function zc(e) {
 i(zc, "testNode");
 var Wc = /* @__PURE__ */ i((e) => {
   var t;
-  return ((t = e?.constructor) == null ? void 0 : t.name) && zc(e);
+  return (e == null || (t = e.constructor) === null || t === void 0 ? void 0 : t.name) && zc(e);
 }, "test$3");
 function Yc(e) {
   return e.nodeType === Fn;
@@ -1989,136 +1942,58 @@ var Vc = /* @__PURE__ */ i((e, t, r, n, o, s) => {
   if (Gc(e))
     return Bc(e.data, t);
   let c = Zt(e) ? "DocumentFragment" : e.tagName.toLowerCase();
-  return ++n > t.maxDepth ? cr(c, t) : sr(
-    c,
-    or(
-      Zt(e) ? [] : Array.from(e.attributes, (u) => u.name).sort(),
-      Zt(e) ? {} : [...e.attributes].reduce(
-        (u, a) => (u[a.name] = a.value, u),
-        {}
-      ),
-      t,
-      r + t.indent,
-      n,
-      o,
-      s
-    ),
-    ir(
-      Array.prototype.slice.call(e.childNodes || e.children),
-      t,
-      r + t.indent,
-      n,
-      o,
-      s
-    ),
-    t,
-    r
-  );
-}, "serialize$3"), Hc = { serialize: Vc, test: Wc }, Kc = "@@__IMMUTABLE_ITERABLE__@@", Jc = "@@__IMMUTABLE_LIST__@@", Xc = "@@__IMMUTABLE_K\
-EYED__@@", Zc = "@@__IMMUTABLE_MAP__@@", En = "@@__IMMUTABLE_ORDERED__@@", Qc = "@@__IMMUTABLE_RECORD__@@", ea = "@@__IMMUTABLE_SEQ__@@", ta = "\
-@@__IMMUTABLE_SET__@@", ra = "@@__IMMUTABLE_STACK__@@", Pe = /* @__PURE__ */ i((e) => `Immutable.${e}`, "getImmutableName"), ct = /* @__PURE__ */ i(
-(e) => `[${e}]`, "printAsLeaf"), Ue = " ", An = "\u2026";
+  return ++n > t.maxDepth ? cr(c, t) : sr(c, or(Zt(e) ? [] : Array.from(e.attributes, (u) => u.name).sort(), Zt(e) ? {} : [...e.attributes].
+  reduce((u, a) => (u[a.name] = a.value, u), {}), t, r + t.indent, n, o, s), ir(Array.prototype.slice.call(e.childNodes || e.children), t, r +
+  t.indent, n, o, s), t, r);
+}, "serialize$3"), Hc = {
+  serialize: Vc,
+  test: Wc
+}, Kc = "@@__IMMUTABLE_ITERABLE__@@", Jc = "@@__IMMUTABLE_LIST__@@", Xc = "@@__IMMUTABLE_KEYED__@@", Zc = "@@__IMMUTABLE_MAP__@@", En = "@@_\
+_IMMUTABLE_ORDERED__@@", Qc = "@@__IMMUTABLE_RECORD__@@", ea = "@@__IMMUTABLE_SEQ__@@", ta = "@@__IMMUTABLE_SET__@@", ra = "@@__IMMUTABLE_ST\
+ACK__@@", Pe = /* @__PURE__ */ i((e) => `Immutable.${e}`, "getImmutableName"), ct = /* @__PURE__ */ i((e) => `[${e}]`, "printAsLeaf"), Ue = "\
+ ", An = "\u2026";
 function na(e, t, r, n, o, s, c) {
-  return ++n > t.maxDepth ? ct(Pe(c)) : `${Pe(c) + Ue}{${qe(
-    e.entries(),
-    t,
-    r,
-    n,
-    o,
-    s
-  )}}`;
+  return ++n > t.maxDepth ? ct(Pe(c)) : `${Pe(c) + Ue}{${qe(e.entries(), t, r, n, o, s)}}`;
 }
 i(na, "printImmutableEntries");
 function oa(e) {
   let t = 0;
-  return {
-    next() {
-      if (t < e._keys.length) {
-        let r = e._keys[t++];
-        return { done: !1, value: [r, e.get(r)] };
-      }
-      return { done: !0, value: void 0 };
+  return { next() {
+    if (t < e._keys.length) {
+      let r = e._keys[t++];
+      return {
+        done: !1,
+        value: [r, e.get(r)]
+      };
     }
-  };
+    return {
+      done: !0,
+      value: void 0
+    };
+  } };
 }
 i(oa, "getRecordEntries");
 function ia(e, t, r, n, o, s) {
   let c = Pe(e._name || "Record");
-  return ++n > t.maxDepth ? ct(c) : `${c + Ue}{${qe(
-    oa(e),
-    t,
-    r,
-    n,
-    o,
-    s
-  )}}`;
+  return ++n > t.maxDepth ? ct(c) : `${c + Ue}{${qe(oa(e), t, r, n, o, s)}}`;
 }
 i(ia, "printImmutableRecord");
 function sa(e, t, r, n, o, s) {
   let c = Pe("Seq");
-  return ++n > t.maxDepth ? ct(c) : e[Xc] ? `${c + Ue}{${// from Immutable collection of entries or from ECMAScript object
-  e._iter || e._object ? qe(
-    e.entries(),
-    t,
-    r,
-    n,
-    o,
-    s
-  ) : An}}` : `${c + Ue}[${e._iter || e._array || e._collection || e._iterable ? rr(
-    e.values(),
-    t,
-    r,
-    n,
-    o,
-    s
-  ) : An}]`;
+  return ++n > t.maxDepth ? ct(c) : e[Xc] ? `${c + Ue}{${e._iter || e._object ? qe(e.entries(), t, r, n, o, s) : An}}` : `${c + Ue}[${e._iter ||
+  e._array || e._collection || e._iterable ? rr(e.values(), t, r, n, o, s) : An}]`;
 }
 i(sa, "printImmutableSeq");
 function Qt(e, t, r, n, o, s, c) {
-  return ++n > t.maxDepth ? ct(Pe(c)) : `${Pe(c) + Ue}[${rr(
-    e.values(),
-    t,
-    r,
-    n,
-    o,
-    s
-  )}]`;
+  return ++n > t.maxDepth ? ct(Pe(c)) : `${Pe(c) + Ue}[${rr(e.values(), t, r, n, o, s)}]`;
 }
 i(Qt, "printImmutableValues");
-var ca = /* @__PURE__ */ i((e, t, r, n, o, s) => e[Zc] ? na(
-  e,
-  t,
-  r,
-  n,
-  o,
-  s,
-  e[En] ? "OrderedMap" : "Map"
-) : e[Jc] ? Qt(
-  e,
-  t,
-  r,
-  n,
-  o,
-  s,
-  "List"
-) : e[ta] ? Qt(
-  e,
-  t,
-  r,
-  n,
-  o,
-  s,
-  e[En] ? "OrderedSet" : "Set"
-) : e[ra] ? Qt(
-  e,
-  t,
-  r,
-  n,
-  o,
-  s,
-  "Stack"
-) : e[ea] ? sa(e, t, r, n, o, s) : ia(e, t, r, n, o, s), "serialize$2"), aa = /* @__PURE__ */ i((e) => e && (e[Kc] === !0 || e[Qc] === !0), "\
-test$2"), ua = { serialize: ca, test: aa };
+var ca = /* @__PURE__ */ i((e, t, r, n, o, s) => e[Zc] ? na(e, t, r, n, o, s, e[En] ? "OrderedMap" : "Map") : e[Jc] ? Qt(e, t, r, n, o, s, "\
+List") : e[ta] ? Qt(e, t, r, n, o, s, e[En] ? "OrderedSet" : "Set") : e[ra] ? Qt(e, t, r, n, o, s, "Stack") : e[ea] ? sa(e, t, r, n, o, s) :
+ia(e, t, r, n, o, s), "serialize$2"), aa = /* @__PURE__ */ i((e) => e && (e[Kc] === !0 || e[Qc] === !0), "test$2"), ua = {
+  serialize: ca,
+  test: aa
+};
 function Bn(e) {
   return e && e.__esModule && Object.prototype.hasOwnProperty.call(e, "default") ? e.default : e;
 }
@@ -2201,7 +2076,7 @@ function fa() {
   return _n || (_n = 1, er.exports = la()), er.exports;
 }
 i(fa, "requireReactIs$1");
-var kn = /* @__PURE__ */ fa(), pa = /* @__PURE__ */ Bn(kn), ya = /* @__PURE__ */ jn({
+var kn = fa(), pa = /* @__PURE__ */ Bn(kn), ya = /* @__PURE__ */ jn({
   __proto__: null,
   default: pa
 }, [kn]), tr = { exports: {} };
@@ -2344,9 +2219,7 @@ var Un = ma(), ha = /* @__PURE__ */ Bn(Un), da = /* @__PURE__ */ jn({
   "isSuspense",
   "isSuspenseList",
   "isValidElementType"
-], be = Object.fromEntries(
-  ba.map((e) => [e, (t) => da[e](t) || ya[e](t)])
-);
+], be = Object.fromEntries(ba.map((e) => [e, (t) => da[e](t) || ya[e](t)]));
 function qn(e, t = []) {
   if (Array.isArray(e))
     for (let r of e)
@@ -2389,57 +2262,23 @@ function Sa(e) {
   return Object.keys(t).filter((r) => r !== "children" && t[r] !== void 0).sort();
 }
 i(Sa, "getPropKeys$1");
-var Ea = /* @__PURE__ */ i((e, t, r, n, o, s) => ++n > t.maxDepth ? cr(Pn(e), t) : sr(
-  Pn(e),
-  or(
-    Sa(e),
-    e.props,
-    t,
-    r + t.indent,
-    n,
-    o,
-    s
-  ),
-  ir(
-    qn(e.props.children),
-    t,
-    r + t.indent,
-    n,
-    o,
-    s
-  ),
-  t,
-  r
-), "serialize$1"), Aa = /* @__PURE__ */ i((e) => e != null && be.isElement(e), "test$1"), Oa = { serialize: Ea, test: Aa }, _a = typeof Symbol ==
-"function" && Symbol.for ? Symbol.for("react.test.json") : 245830487;
+var Ea = /* @__PURE__ */ i((e, t, r, n, o, s) => ++n > t.maxDepth ? cr(Pn(e), t) : sr(Pn(e), or(Sa(e), e.props, t, r + t.indent, n, o, s), ir(
+qn(e.props.children), t, r + t.indent, n, o, s), t, r), "serialize$1"), Aa = /* @__PURE__ */ i((e) => e != null && be.isElement(e), "test$1"),
+Oa = {
+  serialize: Ea,
+  test: Aa
+}, _a = typeof Symbol == "function" && Symbol.for ? Symbol.for("react.test.json") : 245830487;
 function wa(e) {
   let { props: t } = e;
   return t ? Object.keys(t).filter((r) => t[r] !== void 0).sort() : [];
 }
 i(wa, "getPropKeys");
-var Ta = /* @__PURE__ */ i((e, t, r, n, o, s) => ++n > t.maxDepth ? cr(e.type, t) : sr(
-  e.type,
-  e.props ? or(
-    wa(e),
-    e.props,
-    t,
-    r + t.indent,
-    n,
-    o,
-    s
-  ) : "",
-  e.children ? ir(
-    e.children,
-    t,
-    r + t.indent,
-    n,
-    o,
-    s
-  ) : "",
-  t,
-  r
-), "serialize"), Pa = /* @__PURE__ */ i((e) => e && e.$$typeof === _a, "test"), Ca = { serialize: Ta, test: Pa }, zn = Object.prototype.toString,
-$a = Date.prototype.toISOString, Ra = Error.prototype.toString, Cn = RegExp.prototype.toString;
+var Ta = /* @__PURE__ */ i((e, t, r, n, o, s) => ++n > t.maxDepth ? cr(e.type, t) : sr(e.type, e.props ? or(wa(e), e.props, t, r + t.indent,
+n, o, s) : "", e.children ? ir(e.children, t, r + t.indent, n, o, s) : "", t, r), "serialize"), Pa = /* @__PURE__ */ i((e) => e && e.$$typeof ===
+_a, "test"), Ca = {
+  serialize: Ta,
+  test: Pa
+}, zn = Object.prototype.toString, $a = Date.prototype.toISOString, Ra = Error.prototype.toString, Cn = RegExp.prototype.toString;
 function ot(e) {
   return typeof e.constructor == "function" && e.constructor.name || "Object";
 }
@@ -2514,37 +2353,11 @@ function Yn(e, t, r, n, o, s) {
   if (t.callToJSON && !c && e.toJSON && typeof e.toJSON == "function" && !s)
     return he(e.toJSON(), t, r, n, o, !0);
   let a = zn.call(e);
-  return a === "[object Arguments]" ? c ? "[Arguments]" : `${u ? "" : "Arguments "}[${it(
-    e,
-    t,
-    r,
-    n,
-    o,
-    he
-  )}]` : Ma(a) ? c ? `[${e.constructor.name}]` : `${u || !t.printBasicPrototype && e.constructor.name === "Array" ? "" : `${e.constructor.name}\
- `}[${it(e, t, r, n, o, he)}]` : a === "[object Map]" ? c ? "[Map]" : `Map {${qe(
-    e.entries(),
-    t,
-    r,
-    n,
-    o,
-    he,
-    " => "
-  )}}` : a === "[object Set]" ? c ? "[Set]" : `Set {${rr(
-    e.values(),
-    t,
-    r,
-    n,
-    o,
-    he
-  )}}` : c || Ia(e) ? `[${ot(e)}]` : `${u || !t.printBasicPrototype && ot(e) === "Object" ? "" : `${ot(e)} `}{${nr(
-    e,
-    t,
-    r,
-    n,
-    o,
-    he
-  )}}`;
+  return a === "[object Arguments]" ? c ? "[Arguments]" : `${u ? "" : "Arguments "}[${it(e, t, r, n, o, he)}]` : Ma(a) ? c ? `[${e.constructor.
+  name}]` : `${u || !t.printBasicPrototype && e.constructor.name === "Array" ? "" : `${e.constructor.name} `}[${it(e, t, r, n, o, he)}]` : a ===
+  "[object Map]" ? c ? "[Map]" : `Map {${qe(e.entries(), t, r, n, o, he, " => ")}}` : a === "[object Set]" ? c ? "[Set]" : `Set {${rr(e.values(),
+  t, r, n, o, he)}}` : c || Ia(e) ? `[${ot(e)}]` : `${u || !t.printBasicPrototype && ot(e) === "Object" ? "" : `${ot(e)} `}{${nr(e, t, r, n,
+  o, he)}}`;
 }
 i(Yn, "printComplexValue");
 var Fa = {
@@ -2559,14 +2372,7 @@ var Fa = {
       ...e instanceof AggregateError ? { errors: e.errors } : {},
       ...f
     }, l = e.name !== "Error" ? e.name : ot(e);
-    return c ? `[${l}]` : `${l} {${qe(
-      Object.entries(y).values(),
-      t,
-      r,
-      n,
-      o,
-      s
-    )}}`;
+    return c ? `[${l}]` : `${l} {${qe(Object.entries(y).values(), t, r, n, o, s)}}`;
   }
 };
 function La(e) {
@@ -2576,28 +2382,20 @@ i(La, "isNewPlugin");
 function Gn(e, t, r, n, o, s) {
   let c;
   try {
-    c = La(e) ? e.serialize(t, r, n, o, s, he) : e.print(
-      t,
-      (u) => he(u, r, n, o, s),
-      (u) => {
-        let a = n + r.indent;
-        return a + u.replaceAll(ja, `
+    c = La(e) ? e.serialize(t, r, n, o, s, he) : e.print(t, (u) => he(u, r, n, o, s), (u) => {
+      let a = n + r.indent;
+      return a + u.replaceAll(ja, `
 ${a}`);
-      },
-      {
-        edgeSpacing: r.spacingOuter,
-        min: r.min,
-        spacing: r.spacingInner
-      },
-      r.colors
-    );
+    }, {
+      edgeSpacing: r.spacingOuter,
+      min: r.min,
+      spacing: r.spacingInner
+    }, r.colors);
   } catch (u) {
     throw new st(u.message, u.stack);
   }
   if (typeof c != "string")
-    throw new TypeError(
-      `pretty-format: Plugin must return type "string" but instead returned "${typeof c}".`
-    );
+    throw new TypeError(`pretty-format: Plugin must return type "string" but instead returned "${typeof c}".`);
   return c;
 }
 i(Gn, "printPlugin");
@@ -2616,20 +2414,8 @@ function he(e, t, r, n, o, s) {
   let c = Vn(t.plugins, e);
   if (c !== null)
     return Gn(c, e, t, r, n, o);
-  let u = Wn(
-    e,
-    t.printFunctionName,
-    t.escapeRegex,
-    t.escapeString
-  );
-  return u !== null ? u : Yn(
-    e,
-    t,
-    r,
-    n,
-    o,
-    s
-  );
+  let u = Wn(e, t.printFunctionName, t.escapeRegex, t.escapeString);
+  return u !== null ? u : Yn(e, t, r, n, o, s);
 }
 i(he, "printer");
 var ar = {
@@ -2658,9 +2444,7 @@ function Da(e) {
     if (!Object.prototype.hasOwnProperty.call(se, t))
       throw new Error(`pretty-format: Unknown option "${t}".`);
   if (e.min && e.indent !== void 0 && e.indent !== 0)
-    throw new Error(
-      'pretty-format: Options "min" and "indent" cannot be used together.'
-    );
+    throw new Error('pretty-format: Options "min" and "indent" cannot be used together.');
 }
 i(Da, "validateOptions");
 function Ba() {
@@ -2669,15 +2453,16 @@ function Ba() {
     if (n && typeof n.close == "string" && typeof n.open == "string")
       e[t] = n;
     else
-      throw new Error(
-        `pretty-format: Option "theme" has a key "${t}" whose value "${r}" is undefined in ansi-styles.`
-      );
+      throw new Error(`pretty-format: Option "theme" has a key "${t}" whose value "${r}" is undefined in ansi-styles.`);
     return e;
   }, /* @__PURE__ */ Object.create(null));
 }
 i(Ba, "getColorsHighlight");
 function ka() {
-  return Hn.reduce((e, t) => (e[t] = { close: "", open: "" }, e), /* @__PURE__ */ Object.create(null));
+  return Hn.reduce((e, t) => (e[t] = {
+    close: "",
+    open: ""
+  }, e), /* @__PURE__ */ Object.create(null));
 }
 i(ka, "getColorsEmpty");
 function Kn(e) {
@@ -2723,12 +2508,7 @@ function re(e, t) {
     if (n !== null)
       return Gn(n, e, Nn(t), "", 0, []);
   }
-  let r = Wn(
-    e,
-    Kn(t),
-    Jn(t),
-    Xn(t)
-  );
+  let r = Wn(e, Kn(t), Jn(t), Xn(t));
   return r !== null ? r : Yn(e, Nn(t), "", 0, []);
 }
 i(re, "format");
@@ -3156,14 +2936,7 @@ onstructor" in e ? e.constructor !== Object ? hr(e, r) : Se(e, r) : e === Object
 i(zt, "inspect");
 
 // ../node_modules/@vitest/utils/dist/chunk-_commonjsHelpers.js
-var {
-  AsymmetricMatcher: jf,
-  DOMCollection: Mf,
-  DOMElement: xf,
-  Immutable: vf,
-  ReactElement: Ff,
-  ReactTestComponent: Lf
-} = ze, Ds = [
+var { AsymmetricMatcher: jf, DOMCollection: Mf, DOMElement: xf, Immutable: vf, ReactElement: Ff, ReactTestComponent: Lf } = ze, Ds = [
   Lf,
   Ff,
   xf,
@@ -3177,7 +2950,6 @@ function _e(e, t = 10, { maxLength: r, ...n } = {}) {
     s = re(e, {
       maxDepth: t,
       escapeString: !1,
-      // min: true,
       plugins: Ds,
       ...n
     });
@@ -3186,12 +2958,14 @@ function _e(e, t = 10, { maxLength: r, ...n } = {}) {
       callToJSON: !1,
       maxDepth: t,
       escapeString: !1,
-      // min: true,
       plugins: Ds,
       ...n
     });
   }
-  return s.length >= o && t > 1 ? _e(e, Math.floor(Math.min(t, Number.MAX_SAFE_INTEGER) / 2), { maxLength: r, ...n }) : s;
+  return s.length >= o && t > 1 ? _e(e, Math.floor(Math.min(t, Number.MAX_SAFE_INTEGER) / 2), {
+    maxLength: r,
+    ...n
+  }) : s;
 }
 i(_e, "stringify");
 var Df = /%[sdjifoOc%]/g;
@@ -3199,7 +2973,10 @@ function Bs(...e) {
   if (typeof e[0] != "string") {
     let s = [];
     for (let c = 0; c < e.length; c++)
-      s.push(Qe(e[c], { depth: 0, colors: !1 }));
+      s.push(Qe(e[c], {
+        depth: 0,
+        colors: !1
+      }));
     return s.join(" ");
   }
   let t = e.length, r = 1, n = e[0], o = String(n).replace(Df, (s) => {
@@ -3211,8 +2988,10 @@ function Bs(...e) {
       case "%s": {
         let c = e[r++];
         return typeof c == "bigint" ? `${c.toString()}n` : typeof c == "number" && c === 0 && 1 / c < 0 ? "-0" : typeof c == "object" && c !==
-        null ? typeof c.toString == "function" && c.toString !== Object.prototype.toString ? c.toString() : Qe(c, { depth: 0, colors: !1 }) :
-        String(c);
+        null ? typeof c.toString == "function" && c.toString !== Object.prototype.toString ? c.toString() : Qe(c, {
+          depth: 0,
+          colors: !1
+        }) : String(c);
       }
       case "%d": {
         let c = e[r++];
@@ -3225,7 +3004,10 @@ function Bs(...e) {
       case "%f":
         return Number.parseFloat(String(e[r++])).toString();
       case "%o":
-        return Qe(e[r++], { showHidden: !0, showProxy: !0 });
+        return Qe(e[r++], {
+          showHidden: !0,
+          showProxy: !0
+        });
       case "%O":
         return Qe(e[r++]);
       case "%c":
@@ -3235,10 +3017,7 @@ function Bs(...e) {
           return JSON.stringify(e[r++]);
         } catch (c) {
           let u = c.message;
-          if (
-            // chromium
-            u.includes("circular structure") || u.includes("cyclic structures") || u.includes("cyclic object")
-          )
+          if (u.includes("circular structure") || u.includes("cyclic structures") || u.includes("cyclic object"))
             return "[Circular]";
           throw c;
         }
@@ -3372,29 +3151,14 @@ function qf(e) {
   let t = !1, r = [], n = 0, o = null, s = 0, c = 0, u = 0, a = 0, f = 0;
   for (; s < e.length; )
     e[s][0] === F ? (r[n++] = s, c = a, u = f, a = 0, f = 0, o = e[s][1]) : (e[s][0] === q ? a += e[s][1].length : f += e[s][1].length, o &&
-    o.length <= Math.max(c, u) && o.length <= Math.max(a, f) && (e.splice(
-      r[n - 1],
-      0,
-      new M(Y, o)
-    ), e[r[n - 1] + 1][0] = q, n--, n--, s = n > 0 ? r[n - 1] : -1, c = 0, u = 0, a = 0, f = 0, o = null, t = !0)), s++;
+    o.length <= Math.max(c, u) && o.length <= Math.max(a, f) && (e.splice(r[n - 1], 0, new M(Y, o)), e[r[n - 1] + 1][0] = q, n--, n--, s = n >
+    0 ? r[n - 1] : -1, c = 0, u = 0, a = 0, f = 0, o = null, t = !0)), s++;
   for (t && oc(e), Yf(e), s = 1; s < e.length; ) {
     if (e[s - 1][0] === Y && e[s][0] === q) {
       let y = e[s - 1][1], l = e[s][1], h = qs(y, l), g = qs(l, y);
-      h >= g ? (h >= y.length / 2 || h >= l.length / 2) && (e.splice(
-        s,
-        0,
-        new M(F, l.substring(0, h))
-      ), e[s - 1][1] = y.substring(
-        0,
-        y.length - h
-      ), e[s + 1][1] = l.substring(h), s++) : (g >= y.length / 2 || g >= l.length / 2) && (e.splice(
-        s,
-        0,
-        new M(F, y.substring(0, g))
-      ), e[s - 1][0] = q, e[s - 1][1] = l.substring(
-        0,
-        l.length - g
-      ), e[s + 1][0] = Y, e[s + 1][1] = y.substring(g), s++), s++;
+      h >= g ? (h >= y.length / 2 || h >= l.length / 2) && (e.splice(s, 0, new M(F, l.substring(0, h))), e[s - 1][1] = y.substring(0, y.length -
+      h), e[s + 1][1] = l.substring(h), s++) : (g >= y.length / 2 || g >= l.length / 2) && (e.splice(s, 0, new M(F, y.substring(0, g))), e[s -
+      1][0] = q, e[s - 1][1] = l.substring(0, l.length - g), e[s + 1][0] = Y, e[s + 1][1] = y.substring(g), s++), s++;
     }
     s++;
   }
@@ -3435,30 +3199,19 @@ function oc(e) {
         break;
       case F:
         r + n > 1 ? (r !== 0 && n !== 0 && (c = Uf(s, o), c !== 0 && (t - r - n > 0 && e[t - r - n - 1][0] === F ? e[t - r - n - 1][1] += s.
-        substring(0, c) : (e.splice(
-          0,
-          0,
-          new M(F, s.substring(0, c))
-        ), t++), s = s.substring(c), o = o.substring(c)), c = nc(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 -= r + n, e.splice(t, r + n), o.length && (e.splice(t, 0, new M(Y, o)), t++), s.length && (e.splice(t, 0, new M(q, s)), t++),
-        t++) : t !== 0 && e[t - 1][0] === F ? (e[t - 1][1] += e[t][1], e.splice(t, 1)) : t++, n = 0, r = 0, o = "", s = "";
+        substring(0, c) : (e.splice(0, 0, new M(F, s.substring(0, c))), t++), s = s.substring(c), o = o.substring(c)), c = nc(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 -= r + n, e.
+        splice(t, r + n), o.length && (e.splice(t, 0, new M(Y, o)), t++), s.length && (e.splice(t, 0, new M(q, s)), t++), t++) : t !== 0 && e[t -
+        1][0] === F ? (e[t - 1][1] += e[t][1], e.splice(t, 1)) : t++, n = 0, r = 0, o = "", s = "";
         break;
     }
   e[e.length - 1][1] === "" && e.pop();
   let u = !1;
   for (t = 1; t < e.length - 1; )
-    e[t - 1][0] === F && e[t + 1][0] === F && (e[t][1].substring(
-      e[t][1].length - e[t - 1][1].length
-    ) === e[t - 1][1] ? (e[t][1] = e[t - 1][1] + e[t][1].substring(
-      0,
-      e[t][1].length - e[t - 1][1].length
-    ), e[t + 1][1] = e[t - 1][1] + e[t + 1][1], e.splice(t - 1, 1), u = !0) : e[t][1].substring(0, e[t + 1][1].length) === e[t + 1][1] && (e[t -
-    1][1] += e[t + 1][1], e[t][1] = e[t][1].substring(e[t + 1][1].length) + e[t + 1][1], e.splice(t + 1, 1), u = !0)), t++;
+    e[t - 1][0] === F && e[t + 1][0] === F && (e[t][1].substring(e[t][1].length - e[t - 1][1].length) === e[t - 1][1] ? (e[t][1] = e[t - 1][1] +
+    e[t][1].substring(0, e[t][1].length - e[t - 1][1].length), e[t + 1][1] = e[t - 1][1] + e[t + 1][1], e.splice(t - 1, 1), u = !0) : e[t][1].
+    substring(0, e[t + 1][1].length) === e[t + 1][1] && (e[t - 1][1] += e[t + 1][1], e[t][1] = e[t][1].substring(e[t + 1][1].length) + e[t +
+    1][1], e.splice(t + 1, 1), u = !0)), t++;
   u && oc(e);
 }
 i(oc, "diff_cleanupMerge");
@@ -3780,63 +3533,23 @@ function Kf(e, t) {
 }
 i(Kf, "formatTrailingSpaces");
 function an(e, t, r, n, o, s) {
-  return e.length !== 0 ? r(
-    `${n} ${Kf(e, o)}`
-  ) : n !== " " ? r(n) : t && s.length !== 0 ? r(`${n} ${s}`) : "";
+  return e.length !== 0 ? r(`${n} ${Kf(e, o)}`) : n !== " " ? r(n) : t && s.length !== 0 ? r(`${n} ${s}`) : "";
 }
 i(an, "printDiffLine");
-function cc(e, t, {
-  aColor: r,
-  aIndicator: n,
-  changeLineTrailingSpaceColor: o,
-  emptyFirstOrLastLinePlaceholder: s
-}) {
-  return an(
-    e,
-    t,
-    r,
-    n,
-    o,
-    s
-  );
+function cc(e, t, { aColor: r, aIndicator: n, changeLineTrailingSpaceColor: o, emptyFirstOrLastLinePlaceholder: s }) {
+  return an(e, t, r, n, o, s);
 }
 i(cc, "printDeleteLine");
-function ac(e, t, {
-  bColor: r,
-  bIndicator: n,
-  changeLineTrailingSpaceColor: o,
-  emptyFirstOrLastLinePlaceholder: s
-}) {
-  return an(
-    e,
-    t,
-    r,
-    n,
-    o,
-    s
-  );
+function ac(e, t, { bColor: r, bIndicator: n, changeLineTrailingSpaceColor: o, emptyFirstOrLastLinePlaceholder: s }) {
+  return an(e, t, r, n, o, s);
 }
 i(ac, "printInsertLine");
-function uc(e, t, {
-  commonColor: r,
-  commonIndicator: n,
-  commonLineTrailingSpaceColor: o,
-  emptyFirstOrLastLinePlaceholder: s
-}) {
-  return an(
-    e,
-    t,
-    r,
-    n,
-    o,
-    s
-  );
+function uc(e, t, { commonColor: r, commonIndicator: n, commonLineTrailingSpaceColor: o, emptyFirstOrLastLinePlaceholder: s }) {
+  return an(e, t, r, n, o, s);
 }
 i(uc, "printCommonLine");
 function Vs(e, t, r, n, { patchColor: o }) {
-  return o(
-    `@@ -${e + 1},${t - e} +${r + 1},${n - r} @@`
-  );
+  return o(`@@ -${e + 1},${t - e} +${r + 1},${n - r} @@`);
 }
 i(Vs, "createPatchMark");
 function Jf(e, t) {
@@ -3891,13 +3604,7 @@ function Jf(e, t) {
           let P = b + n;
           for (let N = b; N !== P; N += 1)
             S(e[N][1]);
-          l[h] = Vs(
-            g,
-            p,
-            m,
-            d,
-            t
-          ), h = l.length, l.push("");
+          l[h] = Vs(g, p, m, d, t), h = l.length, l.push("");
           let O = E - o;
           g = p + O, m = d + O, p = g, d = m;
           for (let N = a - n; N !== a; N += 1)
@@ -3947,7 +3654,7 @@ function Qf() {
     compareKeys: void 0,
     contextLines: lc,
     emptyFirstOrLastLinePlaceholder: "",
-    expand: !0,
+    expand: !1,
     includeChangeCounts: !1,
     omitAnnotationLines: !1,
     patchColor: ie.yellow,
@@ -3990,19 +3697,13 @@ function rp(e) {
         r += 1;
         break;
     }
-  }), { a: t, b: r };
+  }), {
+    a: t,
+    b: r
+  };
 }
 i(rp, "countChanges");
-function np({
-  aAnnotation: e,
-  aColor: t,
-  aIndicator: r,
-  bAnnotation: n,
-  bColor: o,
-  bIndicator: s,
-  includeChangeCounts: c,
-  omitAnnotationLines: u
-}, a) {
+function np({ aAnnotation: e, aColor: t, aIndicator: r, bAnnotation: n, bColor: o, bIndicator: s, includeChangeCounts: c, omitAnnotationLines: u }, a) {
   if (u)
     return "";
   let f = "", y = "";
@@ -4024,22 +3725,14 @@ ${r.truncateAnnotation}`) : "");
 }
 i(un, "printDiffLines");
 function Ht(e, t, r) {
-  let n = we(r), [o, s] = fc(
-    De(e) ? [] : e,
-    De(t) ? [] : t,
-    n
-  );
+  let n = we(r), [o, s] = fc(De(e) ? [] : e, De(t) ? [] : t, n);
   return un(o, s, n);
 }
 i(Ht, "diffLinesUnified");
 function op(e, t, r, n, o) {
   if (De(e) && De(r) && (e = [], r = []), De(t) && De(n) && (t = [], n = []), e.length !== r.length || t.length !== n.length)
     return Ht(e, t, o);
-  let [s, c] = fc(
-    r,
-    n,
-    o
-  ), u = 0, a = 0;
+  let [s, c] = fc(r, n, o), u = 0, a = 0;
   return s.forEach((f) => {
     switch (f[0]) {
       case Y:
@@ -4055,11 +3748,9 @@ function op(e, t, r, n, o) {
 }
 i(op, "diffLinesUnified2");
 function fc(e, t, r) {
-  let n = r?.truncateThreshold ?? !1, o = Math.max(
-    Math.floor(r?.truncateThreshold ?? 0),
-    0
-  ), s = n ? Math.min(e.length, o) : e.length, c = n ? Math.min(t.length, o) : t.length, u = s !== e.length || c !== t.length, a = /* @__PURE__ */ i(
-  (g, m) => e[g] === t[m], "isCommon"), f = [], y = 0, l = 0;
+  let n = r?.truncateThreshold ?? !1, o = Math.max(Math.floor(r?.truncateThreshold ?? 0), 0), s = n ? Math.min(e.length, o) : e.length, c = n ?
+  Math.min(t.length, o) : t.length, u = s !== e.length || c !== t.length, a = /* @__PURE__ */ i((g, m) => e[g] === t[m], "isCommon"), f = [],
+  y = 0, l = 0;
   for (sc(s, c, a, /* @__PURE__ */ i((g, m, p) => {
     for (; y !== m; y += 1)
       f.push(new M(Y, e[y]));
@@ -4116,10 +3807,7 @@ function Ks(e) {
 }
 i(Ks, "getNewLineSymbol");
 function ip(e, t, r) {
-  let n = r?.truncateThreshold ?? !1, o = Math.max(
-    Math.floor(r?.truncateThreshold ?? 0),
-    0
-  ), s = e.length, c = t.length;
+  let n = r?.truncateThreshold ?? !1, o = Math.max(Math.floor(r?.truncateThreshold ?? 0), 0), s = e.length, c = t.length;
   if (n) {
     let g = e.includes(`
 `), m = t.includes(`
@@ -4136,18 +3824,13 @@ function ip(e, t, r) {
 }
 i(ip, "diffStrings");
 function sp(e, t, r) {
-  return t.reduce(
-    (n, o) => n + (o[0] === F ? o[1] : o[0] === e && o[1].length !== 0 ? r(o[1]) : ""),
-    ""
-  );
+  return t.reduce((n, o) => n + (o[0] === F ? o[1] : o[0] === e && o[1].length !== 0 ? r(o[1]) : ""), "");
 }
 i(sp, "concatenateRelevantDiffs");
 var fn = class fn {
   op;
   line;
-  // incomplete line
   lines;
-  // complete lines
   changeColor;
   constructor(t, r) {
     this.op = t, this.line = [], this.lines = [], this.changeColor = r;
@@ -4156,22 +3839,15 @@ var fn = class fn {
     this.pushDiff(new M(this.op, t));
   }
   pushLine() {
-    this.lines.push(
-      this.line.length !== 1 ? new M(
-        this.op,
-        sp(this.op, this.line, this.changeColor)
-      ) : this.line[0][0] === this.op ? this.line[0] : new M(this.op, this.line[0][1])
-      // was common diff
-    ), this.line.length = 0;
+    this.lines.push(this.line.length !== 1 ? new M(this.op, sp(this.op, this.line, this.changeColor)) : this.line[0][0] === this.op ? this.line[0] :
+    new M(this.op, this.line[0][1])), this.line.length = 0;
   }
   isLineEmpty() {
     return this.line.length === 0;
   }
-  // Minor input to buffer.
   pushDiff(t) {
     this.line.push(t);
   }
-  // Main input to buffer.
   align(t) {
     let r = t[1];
     if (r.includes(`
@@ -4184,7 +3860,6 @@ var fn = class fn {
     } else
       this.pushDiff(t);
   }
-  // Output from buffer.
   moveLinesTo(t) {
     this.isLineEmpty() || this.pushLine(), t.push(...this.lines), this.lines.length = 0;
   }
@@ -4208,7 +3883,6 @@ var Vt = fn, pn = class pn {
   flushChangeLines() {
     this.deleteBuffer.moveLinesTo(this.lines), this.insertBuffer.moveLinesTo(this.lines);
   }
-  // Input to buffer.
   align(t) {
     let r = t[0], n = t[1];
     if (n.includes(`
@@ -4225,7 +3899,6 @@ var Vt = fn, pn = class pn {
     } else
       this.pushDiffChangeLines(t);
   }
-  // Output from buffer.
   getLines() {
     return this.flushChangeLines(), this.lines;
   }
@@ -4251,10 +3924,8 @@ i(cp, "getAlignedDiffs");
 function ap(e, t) {
   if (t) {
     let r = e.length - 1;
-    return e.some(
-      (n, o) => n[0] === F && (o !== r || n[1] !== `
-`)
-    );
+    return e.some((n, o) => n[0] === F && (o !== r || n[1] !== `
+`));
   }
   return e.some((r) => r[0] === F);
 }
@@ -4263,15 +3934,9 @@ function up(e, t, r) {
   if (e !== t && e.length !== 0 && t.length !== 0) {
     let n = e.includes(`
 `) || t.includes(`
-`), [o, s] = pc(
-      n ? `${e}
-` : e,
-      n ? `${t}
-` : t,
-      !0,
-      // cleanupSemantic
-      r
-    );
+`), [o, s] = pc(n ? `${e}
+` : e, n ? `${t}
+` : t, !0, r);
     if (ap(o, n)) {
       let c = we(r), u = cp(o, c.changeColor);
       return un(u, s, c);
@@ -4292,14 +3957,7 @@ function on(e, t) {
   return r(e);
 }
 i(on, "getCommonMessage");
-var {
-  AsymmetricMatcher: lp,
-  DOMCollection: fp,
-  DOMElement: pp,
-  Immutable: yp,
-  ReactElement: gp,
-  ReactTestComponent: mp
-} = ze, yc = [
+var { AsymmetricMatcher: lp, DOMCollection: fp, DOMElement: pp, Immutable: yp, ReactElement: gp, ReactTestComponent: mp } = ze, yc = [
   mp,
   gp,
   pp,
@@ -4308,6 +3966,7 @@ var {
   lp,
   ze.Error
 ], sn = {
+  maxDepth: 20,
   plugins: yc
 }, gc = {
   callToJSON: !1,
@@ -4324,14 +3983,16 @@ function hp(e, t, r) {
     o = e.getExpectedType(), s = o === "string";
   }
   if (o !== Hs(t)) {
-    let c = /* @__PURE__ */ i(function(T) {
-      return T.length <= d ? T : `${T.slice(0, d)}...`;
-    }, "truncate2"), { aAnnotation: u, aColor: a, aIndicator: f, bAnnotation: y, bColor: l, bIndicator: h } = we(r), g = cn(gc, r), m = re(e,
-    g), p = re(t, g), d = 1e5;
-    m = c(m), p = c(p);
-    let S = `${a(`${f} ${u}:`)} 
-${m}`, A = `${l(`${h} ${y}:`)} 
-${p}`;
+    let d = function(T) {
+      return T.length <= p ? T : `${T.slice(0, p)}...`;
+    };
+    i(d, "truncate");
+    let { aAnnotation: c, aColor: u, aIndicator: a, bAnnotation: f, bColor: y, bIndicator: l } = we(r), h = cn(gc, r), g = re(e, h), m = re(
+    t, h), p = 1e5;
+    g = d(g), m = d(m);
+    let S = `${u(`${a} ${c}:`)} 
+${g}`, A = `${y(`${l} ${f}:`)} 
+${m}`;
     return `${S}
 
 ${A}`;
@@ -4380,10 +4041,7 @@ function rn(e, t, r) {
   let s = on(ic, r);
   if (n === void 0 || n === s) {
     let c = cn(gc, r);
-    n = Zs(e, t, c, r), n !== s && !o && (n = `${on(
-      Gf,
-      r
-    )}
+    n = Zs(e, t, c, r), n !== s && !o && (n = `${on(Gf, r)}
 
 ${n}`);
   }
@@ -4391,31 +4049,29 @@ ${n}`);
 }
 i(rn, "compareObjects");
 function cn(e, t) {
-  let { compareKeys: r, printBasicPrototype: n } = we(t);
+  let { compareKeys: r, printBasicPrototype: n, maxDepth: o } = we(t);
   return {
     ...e,
     compareKeys: r,
-    printBasicPrototype: n
+    printBasicPrototype: n,
+    maxDepth: o ?? e.maxDepth
   };
 }
 i(cn, "getFormatOptions");
 function Zs(e, t, r, n) {
-  let o = { ...r, indent: 0 }, s = re(e, o), c = re(t, o);
+  let o = {
+    ...r,
+    indent: 0
+  }, s = re(e, o), c = re(t, o);
   if (s === c)
     return on(ic, n);
   {
     let u = re(e, r), a = re(t, r);
-    return op(
-      u.split(`
-`),
-      a.split(`
-`),
-      s.split(`
-`),
-      c.split(`
-`),
-      n
-    );
+    return op(u.split(`
+`), a.split(`
+`), s.split(`
+`), c.split(`
+`), n);
   }
 }
 i(Zs, "getObjectsDifference");
@@ -4436,11 +4092,7 @@ function mc(e, t, r) {
 `) || e.includes(`
 `))
       return up(t, e, r);
-    let [y] = pc(t, e, !0), l = y.some((p) => p[0] === F), h = bp(n, o), g = h(n) + Ap(
-      rc(y, Y, l)
-    ), m = h(o) + Ep(
-      rc(y, q, l)
-    );
+    let [y] = pc(t, e, !0), l = y.some((p) => p[0] === F), h = bp(n, o), g = h(n) + Ap(rc(y, Y, l)), m = h(o) + Ep(rc(y, q, l));
     return `${g}
 ${m}`;
   }
@@ -4452,32 +4104,30 @@ function hc(e, t, r = /* @__PURE__ */ new WeakSet(), n = /* @__PURE__ */ new Wea
   return e instanceof Error && t instanceof Error && typeof e.cause < "u" && typeof t.cause > "u" ? (delete e.cause, {
     replacedActual: e,
     replacedExpected: t
-  }) : tc(e, t) ? r.has(e) || n.has(t) ? { replacedActual: e, replacedExpected: t } : (r.add(e), n.add(t), Qr(t).forEach((o) => {
+  }) : tc(e, t) ? r.has(e) || n.has(t) ? {
+    replacedActual: e,
+    replacedExpected: t
+  } : (r.add(e), n.add(t), Qr(t).forEach((o) => {
     let s = t[o], c = e[o];
     if (ec(s))
       s.asymmetricMatch(c) && (e[o] = s);
     else if (ec(c))
       c.asymmetricMatch(s) && (t[o] = c);
     else if (tc(c, s)) {
-      let u = hc(
-        c,
-        s,
-        r,
-        n
-      );
+      let u = hc(c, s, r, n);
       e[o] = u.replacedActual, t[o] = u.replacedExpected;
     }
   }), {
     replacedActual: e,
     replacedExpected: t
-  }) : { replacedActual: e, replacedExpected: t };
+  }) : {
+    replacedActual: e,
+    replacedExpected: t
+  };
 }
 i(hc, "replaceAsymmetricMatcher");
 function bp(...e) {
-  let t = e.reduce(
-    (r, n) => n.length > r ? n.length : r,
-    0
-  );
+  let t = e.reduce((r, n) => n.length > r ? n.length : r, 0);
   return (r) => `${r}: ${" ".repeat(t - r.length)}`;
 }
 i(bp, "getLabelPrinter");
@@ -4495,10 +4145,7 @@ function Ap(e) {
 }
 i(Ap, "printExpected");
 function rc(e, t, r) {
-  return e.reduce(
-    (n, o) => n + (o[0] === F ? o[1] : o[0] === t ? r ? ie.inverse(o[1]) : o[1] : ""),
-    ""
-  );
+  return e.reduce((n, o) => n + (o[0] === F ? o[1] : o[0] === t ? r ? ie.inverse(o[1]) : o[1] : ""), "");
 }
 i(rc, "getCommonAndChangedSubstrings");
 
@@ -4584,12 +4231,8 @@ function yn(e, t, r = /* @__PURE__ */ new WeakSet()) {
   try {
     return Be(n);
   } catch (o) {
-    return Be(
-      new Error(
-        `Failed to fully serialize error: ${o?.message}
-Inner error message: ${n?.message}`
-      )
-    );
+    return Be(new Error(`Failed to fully serialize error: ${o?.message}
+Inner error message: ${n?.message}`));
   }
 }
 i(yn, "processError");