storybook 9.0.0-beta.4 → 9.0.0-beta.6
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/assets/server/base-preview-head.html +2 -1
- package/dist/babel/index.cjs +15060 -14974
- package/dist/babel/index.d.ts +37 -18
- package/dist/babel/index.js +15097 -15011
- package/dist/bin/index.cjs +44 -44
- package/dist/bin/index.js +44 -44
- package/dist/builder-manager/index.cjs +119 -104
- package/dist/builder-manager/index.js +118 -102
- package/dist/cli/bin/index.cjs +1 -1
- package/dist/cli/bin/index.js +1 -1
- package/dist/cli/index.cjs +19438 -19340
- package/dist/cli/index.js +19449 -19351
- package/dist/client-logger/index.d.ts +2 -1
- package/dist/common/index.cjs +4997 -4925
- package/dist/common/index.js +5090 -5014
- package/dist/components/index.cjs +4581 -4419
- package/dist/components/index.d.ts +12 -12
- package/dist/components/index.js +3847 -3681
- package/dist/core-server/index.cjs +6360 -6276
- package/dist/core-server/index.js +6407 -6318
- package/dist/core-server/presets/common-manager.js +3871 -3476
- package/dist/core-server/presets/common-preset.cjs +2304 -2238
- package/dist/core-server/presets/common-preset.js +2389 -2319
- package/dist/docs-tools/index.cjs +484 -464
- package/dist/docs-tools/index.js +502 -482
- package/dist/highlight/index.cjs +19 -18
- package/dist/highlight/index.d.ts +4 -5
- package/dist/highlight/index.js +3 -2
- package/dist/highlight/preview.cjs +311 -307
- package/dist/highlight/preview.js +293 -289
- package/dist/instrumenter/index.cjs +561 -559
- package/dist/instrumenter/index.js +1551 -1498
- package/dist/manager/globals-module-info.cjs +1 -0
- package/dist/manager/globals-module-info.js +1 -0
- package/dist/manager/globals-runtime.js +19639 -19374
- package/dist/manager/runtime.js +4372 -4133
- package/dist/manager-api/index.cjs +2375 -2319
- package/dist/manager-api/index.js +1722 -1666
- package/dist/node-logger/index.cjs +25 -25
- package/dist/node-logger/index.js +25 -25
- package/dist/preview/runtime.js +12782 -12707
- package/dist/preview-api/index.cjs +1121 -1102
- package/dist/preview-api/index.js +1169 -1150
- package/dist/router/index.cjs +1366 -1347
- package/dist/router/index.js +594 -575
- package/dist/server-errors.cjs +6 -6
- package/dist/server-errors.js +6 -6
- package/dist/telemetry/index.cjs +696 -691
- package/dist/telemetry/index.js +764 -759
- package/dist/test/index.cjs +69 -70
- package/dist/test/index.d.ts +1216 -74
- package/dist/test/index.js +128 -130
- package/dist/test/preview.cjs +16 -16
- package/dist/test/preview.js +15 -15
- package/dist/theming/create.cjs +16 -17
- package/dist/theming/create.js +346 -228
- package/dist/theming/index.cjs +16 -17
- package/dist/theming/index.js +948 -839
- package/package.json +10 -17
|
@@ -16,13 +16,13 @@ var dr = (e, t) => {
|
|
|
16
16
|
var Sr = (e) => br(Pe({}, "__esModule", { value: !0 }), e);
|
|
17
17
|
|
|
18
18
|
// src/instrumenter/index.ts
|
|
19
|
-
var
|
|
20
|
-
dr(
|
|
19
|
+
var cs = {};
|
|
20
|
+
dr(cs, {
|
|
21
21
|
CallStates: () => cr,
|
|
22
22
|
EVENTS: () => ee,
|
|
23
23
|
instrument: () => mr
|
|
24
24
|
});
|
|
25
|
-
module.exports = Sr(
|
|
25
|
+
module.exports = Sr(cs);
|
|
26
26
|
|
|
27
27
|
// src/instrumenter/instrumenter.ts
|
|
28
28
|
var fr = require("storybook/internal/client-logger"), ye = require("storybook/internal/core-events"), W = require("@storybook/global");
|
|
@@ -83,36 +83,36 @@ function xt(e = !1) {
|
|
|
83
83
|
TERM !== "dumb" || "CI" in n) || typeof window < "u" && !!window.chrome;
|
|
84
84
|
}
|
|
85
85
|
c(xt, "C");
|
|
86
|
-
function
|
|
87
|
-
let t = xt(e), n = /* @__PURE__ */ c((
|
|
86
|
+
function Dt(e = !1) {
|
|
87
|
+
let t = xt(e), n = /* @__PURE__ */ c((s, a, l, m) => {
|
|
88
88
|
let p = "", f = 0;
|
|
89
89
|
do
|
|
90
|
-
p +=
|
|
90
|
+
p += s.substring(f, m) + l, f = m + a.length, m = s.indexOf(a, f);
|
|
91
91
|
while (~m);
|
|
92
|
-
return p +
|
|
93
|
-
}, "i"), r = /* @__PURE__ */ c((
|
|
92
|
+
return p + s.substring(f);
|
|
93
|
+
}, "i"), r = /* @__PURE__ */ c((s, a, l = s) => {
|
|
94
94
|
let m = /* @__PURE__ */ c((p) => {
|
|
95
|
-
let f = String(p), b = f.indexOf(a,
|
|
96
|
-
return ~b ?
|
|
95
|
+
let f = String(p), b = f.indexOf(a, s.length);
|
|
96
|
+
return ~b ? s + n(f, a, l, b) + a : s + f + a;
|
|
97
97
|
}, "o");
|
|
98
|
-
return m.open =
|
|
98
|
+
return m.open = s, m.close = a, m;
|
|
99
99
|
}, "g"), o = {
|
|
100
100
|
isColorSupported: t
|
|
101
|
-
},
|
|
102
|
-
for (let [
|
|
103
|
-
o[
|
|
104
|
-
|
|
105
|
-
|
|
101
|
+
}, i = /* @__PURE__ */ c((s) => `\x1B[${s}m`, "d");
|
|
102
|
+
for (let [s, a] of _r)
|
|
103
|
+
o[s] = t ? r(
|
|
104
|
+
i(a[0]),
|
|
105
|
+
i(a[1]),
|
|
106
106
|
a[2]
|
|
107
107
|
) : Qe;
|
|
108
108
|
return o;
|
|
109
109
|
}
|
|
110
|
-
c(
|
|
110
|
+
c(Dt, "p");
|
|
111
111
|
|
|
112
112
|
// ../node_modules/tinyrainbow/dist/node.js
|
|
113
|
-
var
|
|
114
|
-
var Tr = process.env.FORCE_TTY !== void 0 || (0,
|
|
115
|
-
var ne =
|
|
113
|
+
var Ft = require("tty");
|
|
114
|
+
var Tr = process.env.FORCE_TTY !== void 0 || (0, Ft.isatty)(1);
|
|
115
|
+
var ne = Dt(Tr);
|
|
116
116
|
|
|
117
117
|
// ../node_modules/@vitest/pretty-format/dist/index.js
|
|
118
118
|
function Zt(e, t) {
|
|
@@ -139,7 +139,7 @@ function Cr(e, t) {
|
|
|
139
139
|
return r;
|
|
140
140
|
}
|
|
141
141
|
c(Cr, "getKeysOfEnumerableProperties");
|
|
142
|
-
function Oe(e, t, n, r, o,
|
|
142
|
+
function Oe(e, t, n, r, o, i, s = ": ") {
|
|
143
143
|
let a = "", l = 0, m = e.next();
|
|
144
144
|
if (!m.done) {
|
|
145
145
|
a += t.spacingOuter;
|
|
@@ -149,72 +149,72 @@ function Oe(e, t, n, r, o, s, i = ": ") {
|
|
|
149
149
|
a += "\u2026";
|
|
150
150
|
break;
|
|
151
151
|
}
|
|
152
|
-
let f =
|
|
153
|
-
a += f +
|
|
152
|
+
let f = i(m.value[0], t, p, r, o), b = i(m.value[1], t, p, r, o);
|
|
153
|
+
a += f + s + b, m = e.next(), m.done ? t.min || (a += ",") : a += `,${t.spacingInner}`;
|
|
154
154
|
}
|
|
155
155
|
a += t.spacingOuter + n;
|
|
156
156
|
}
|
|
157
157
|
return a;
|
|
158
158
|
}
|
|
159
159
|
c(Oe, "printIteratorEntries");
|
|
160
|
-
function nt(e, t, n, r, o,
|
|
161
|
-
let
|
|
160
|
+
function nt(e, t, n, r, o, i) {
|
|
161
|
+
let s = "", a = 0, l = e.next();
|
|
162
162
|
if (!l.done) {
|
|
163
|
-
|
|
163
|
+
s += t.spacingOuter;
|
|
164
164
|
let m = n + t.indent;
|
|
165
165
|
for (; !l.done; ) {
|
|
166
|
-
if (
|
|
167
|
-
|
|
166
|
+
if (s += m, a++ === t.maxWidth) {
|
|
167
|
+
s += "\u2026";
|
|
168
168
|
break;
|
|
169
169
|
}
|
|
170
|
-
|
|
170
|
+
s += i(l.value, t, m, r, o), l = e.next(), l.done ? t.min || (s += ",") : s += `,${t.spacingInner}`;
|
|
171
171
|
}
|
|
172
|
-
|
|
172
|
+
s += t.spacingOuter + n;
|
|
173
173
|
}
|
|
174
|
-
return
|
|
174
|
+
return s;
|
|
175
175
|
}
|
|
176
176
|
c(nt, "printIteratorValues");
|
|
177
|
-
function
|
|
178
|
-
let
|
|
177
|
+
function De(e, t, n, r, o, i) {
|
|
178
|
+
let s = "";
|
|
179
179
|
e = e instanceof ArrayBuffer ? new DataView(e) : e;
|
|
180
180
|
let a = /* @__PURE__ */ c((m) => m instanceof DataView, "isDataView"), l = a(e) ? e.byteLength : e.length;
|
|
181
181
|
if (l > 0) {
|
|
182
|
-
|
|
182
|
+
s += t.spacingOuter;
|
|
183
183
|
let m = n + t.indent;
|
|
184
184
|
for (let p = 0; p < l; p++) {
|
|
185
|
-
if (
|
|
186
|
-
|
|
185
|
+
if (s += m, p === t.maxWidth) {
|
|
186
|
+
s += "\u2026";
|
|
187
187
|
break;
|
|
188
188
|
}
|
|
189
|
-
(a(e) || p in e) && (
|
|
189
|
+
(a(e) || p in e) && (s += i(a(e) ? e.getInt8(p) : e[p], t, m, r, o)), p < l - 1 ? s += `,${t.spacingInner}` : t.min || (s += ",");
|
|
190
190
|
}
|
|
191
|
-
|
|
191
|
+
s += t.spacingOuter + n;
|
|
192
192
|
}
|
|
193
|
-
return
|
|
193
|
+
return s;
|
|
194
194
|
}
|
|
195
|
-
c(
|
|
196
|
-
function rt(e, t, n, r, o,
|
|
197
|
-
let
|
|
195
|
+
c(De, "printListItems");
|
|
196
|
+
function rt(e, t, n, r, o, i) {
|
|
197
|
+
let s = "", a = Cr(e, t.compareKeys);
|
|
198
198
|
if (a.length > 0) {
|
|
199
|
-
|
|
199
|
+
s += t.spacingOuter;
|
|
200
200
|
let l = n + t.indent;
|
|
201
201
|
for (let m = 0; m < a.length; m++) {
|
|
202
|
-
let p = a[m], f =
|
|
203
|
-
|
|
202
|
+
let p = a[m], f = i(p, t, l, r, o), b = i(e[p], t, l, r, o);
|
|
203
|
+
s += `${l + f}: ${b}`, m < a.length - 1 ? s += `,${t.spacingInner}` : t.min || (s += ",");
|
|
204
204
|
}
|
|
205
|
-
|
|
205
|
+
s += t.spacingOuter + n;
|
|
206
206
|
}
|
|
207
|
-
return
|
|
207
|
+
return s;
|
|
208
208
|
}
|
|
209
209
|
c(rt, "printObjectProperties");
|
|
210
|
-
var Or = typeof Symbol == "function" && Symbol.for ? Symbol.for("jest.asymmetricMatcher") : 1267621, Ie = " ", $r = /* @__PURE__ */ c((e, t, n, r, o,
|
|
211
|
-
let
|
|
212
|
-
if (
|
|
213
|
-
return ++r > t.maxDepth ? `[${
|
|
214
|
-
if (
|
|
215
|
-
return ++r > t.maxDepth ? `[${
|
|
216
|
-
if (
|
|
217
|
-
return
|
|
210
|
+
var Or = typeof Symbol == "function" && Symbol.for ? Symbol.for("jest.asymmetricMatcher") : 1267621, Ie = " ", $r = /* @__PURE__ */ c((e, t, n, r, o, i) => {
|
|
211
|
+
let s = e.toString();
|
|
212
|
+
if (s === "ArrayContaining" || s === "ArrayNotContaining")
|
|
213
|
+
return ++r > t.maxDepth ? `[${s}]` : `${s + Ie}[${De(e.sample, t, n, r, o, i)}]`;
|
|
214
|
+
if (s === "ObjectContaining" || s === "ObjectNotContaining")
|
|
215
|
+
return ++r > t.maxDepth ? `[${s}]` : `${s + Ie}{${rt(e.sample, t, n, r, o, i)}}`;
|
|
216
|
+
if (s === "StringMatching" || s === "StringNotMatching" || s === "StringContaining" || s === "StringNotContaining")
|
|
217
|
+
return s + Ie + i(e.sample, t, n, r, o);
|
|
218
218
|
if (typeof e.toAsymmetricMatcher != "function")
|
|
219
219
|
throw new TypeError(`Asymmetric matcher ${e.constructor.name} does not implement toAsymmetricMatcher()`);
|
|
220
220
|
return e.toAsymmetricMatcher();
|
|
@@ -231,10 +231,10 @@ function Mr(e) {
|
|
|
231
231
|
return e.constructor.name === "NamedNodeMap";
|
|
232
232
|
}
|
|
233
233
|
c(Mr, "isNamedNodeMap");
|
|
234
|
-
var Lr = /* @__PURE__ */ c((e, t, n, r, o,
|
|
235
|
-
let
|
|
236
|
-
return ++r > t.maxDepth ? `[${
|
|
237
|
-
{}) : { ...e }, t, n, r, o,
|
|
234
|
+
var Lr = /* @__PURE__ */ c((e, t, n, r, o, i) => {
|
|
235
|
+
let s = e.constructor.name;
|
|
236
|
+
return ++r > t.maxDepth ? `[${s}]` : (t.min ? "" : s + Rr) + (vt.has(s) ? `{${rt(Mr(e) ? [...e].reduce((a, l) => (a[l.name] = l.value, a),
|
|
237
|
+
{}) : { ...e }, t, n, r, o, i)}}` : `[${De([...e], t, n, r, o, i)}]`);
|
|
238
238
|
}, "serialize$4"), xr = {
|
|
239
239
|
serialize: Lr,
|
|
240
240
|
test: Ir
|
|
@@ -243,42 +243,42 @@ function Qt(e) {
|
|
|
243
243
|
return e.replaceAll("<", "<").replaceAll(">", ">");
|
|
244
244
|
}
|
|
245
245
|
c(Qt, "escapeHTML");
|
|
246
|
-
function ot(e, t, n, r, o,
|
|
246
|
+
function ot(e, t, n, r, o, i, s) {
|
|
247
247
|
let a = r + n.indent, l = n.colors;
|
|
248
248
|
return e.map((m) => {
|
|
249
|
-
let p = t[m], f =
|
|
249
|
+
let p = t[m], f = s(p, n, a, o, i);
|
|
250
250
|
return typeof p != "string" && (f.includes(`
|
|
251
251
|
`) && (f = n.spacingOuter + a + f + n.spacingOuter + r), f = `{${f}}`), `${n.spacingInner + r + l.prop.open + m + l.prop.close}=${l.value.open}${f}${l.
|
|
252
252
|
value.close}`;
|
|
253
253
|
}).join("");
|
|
254
254
|
}
|
|
255
255
|
c(ot, "printProps");
|
|
256
|
-
function
|
|
257
|
-
return e.map((
|
|
256
|
+
function it(e, t, n, r, o, i) {
|
|
257
|
+
return e.map((s) => t.spacingOuter + n + (typeof s == "string" ? en(s, t) : i(s, t, n, r, o))).join("");
|
|
258
258
|
}
|
|
259
|
-
c(
|
|
259
|
+
c(it, "printChildren");
|
|
260
260
|
function en(e, t) {
|
|
261
261
|
let n = t.colors.content;
|
|
262
262
|
return n.open + Qt(e) + n.close;
|
|
263
263
|
}
|
|
264
264
|
c(en, "printText");
|
|
265
|
-
function
|
|
265
|
+
function Dr(e, t) {
|
|
266
266
|
let n = t.colors.comment;
|
|
267
267
|
return `${n.open}<!--${Qt(e)}-->${n.close}`;
|
|
268
268
|
}
|
|
269
|
-
c(
|
|
270
|
-
function
|
|
271
|
-
let
|
|
272
|
-
return `${
|
|
273
|
-
!r.min ? "" : " "}/`}>${
|
|
269
|
+
c(Dr, "printComment");
|
|
270
|
+
function st(e, t, n, r, o) {
|
|
271
|
+
let i = r.colors.tag;
|
|
272
|
+
return `${i.open}<${e}${t && i.close + t + r.spacingOuter + o + i.open}${n ? `>${i.close}${n}${r.spacingOuter}${o}${i.open}</${e}` : `${t &&
|
|
273
|
+
!r.min ? "" : " "}/`}>${i.close}`;
|
|
274
274
|
}
|
|
275
|
-
c(
|
|
275
|
+
c(st, "printElement");
|
|
276
276
|
function ct(e, t) {
|
|
277
277
|
let n = t.colors.tag;
|
|
278
278
|
return `${n.open}<${e}${n.close} \u2026${n.open} />${n.close}`;
|
|
279
279
|
}
|
|
280
280
|
c(ct, "printElementAsLeaf");
|
|
281
|
-
var
|
|
281
|
+
var Fr = 1, tn = 3, nn = 8, rn = 11, jr = /^(?:(?:HTML|SVG)\w*)?Element$/;
|
|
282
282
|
function Br(e) {
|
|
283
283
|
try {
|
|
284
284
|
return typeof e.hasAttribute == "function" && e.hasAttribute("is");
|
|
@@ -289,7 +289,7 @@ function Br(e) {
|
|
|
289
289
|
c(Br, "testHasAttribute");
|
|
290
290
|
function kr(e) {
|
|
291
291
|
let t = e.constructor.name, { nodeType: n, tagName: r } = e, o = typeof r == "string" && r.includes("-") || Br(e);
|
|
292
|
-
return n ===
|
|
292
|
+
return n === Fr && (jr.test(t) || o) || n === tn && t === "Text" || n === nn && t === "Comment" || n === rn && t === "DocumentFragment";
|
|
293
293
|
}
|
|
294
294
|
c(kr, "testNode");
|
|
295
295
|
var zr = /* @__PURE__ */ c((e) => {
|
|
@@ -308,15 +308,15 @@ function et(e) {
|
|
|
308
308
|
return e.nodeType === rn;
|
|
309
309
|
}
|
|
310
310
|
c(et, "nodeIsFragment");
|
|
311
|
-
var Wr = /* @__PURE__ */ c((e, t, n, r, o,
|
|
311
|
+
var Wr = /* @__PURE__ */ c((e, t, n, r, o, i) => {
|
|
312
312
|
if (Yr(e))
|
|
313
313
|
return en(e.data, t);
|
|
314
314
|
if (Ur(e))
|
|
315
|
-
return
|
|
316
|
-
let
|
|
317
|
-
return ++r > t.maxDepth ? ct(
|
|
318
|
-
reduce((a, l) => (a[l.name] = l.value, a), {}), t, n + t.indent, r, o,
|
|
319
|
-
t.indent, r, o,
|
|
315
|
+
return Dr(e.data, t);
|
|
316
|
+
let s = et(e) ? "DocumentFragment" : e.tagName.toLowerCase();
|
|
317
|
+
return ++r > t.maxDepth ? ct(s, t) : st(s, ot(et(e) ? [] : Array.from(e.attributes, (a) => a.name).sort(), et(e) ? {} : [...e.attributes].
|
|
318
|
+
reduce((a, l) => (a[l.name] = l.value, a), {}), t, n + t.indent, r, o, i), it(Array.prototype.slice.call(e.childNodes || e.children), t, n +
|
|
319
|
+
t.indent, r, o, i), t, n);
|
|
320
320
|
}, "serialize$3"), Vr = {
|
|
321
321
|
serialize: Wr,
|
|
322
322
|
test: zr
|
|
@@ -324,8 +324,8 @@ var Wr = /* @__PURE__ */ c((e, t, n, r, o, s) => {
|
|
|
324
324
|
_IMMUTABLE_ORDERED__@@", Jr = "@@__IMMUTABLE_RECORD__@@", Xr = "@@__IMMUTABLE_SEQ__@@", Zr = "@@__IMMUTABLE_SET__@@", vr = "@@__IMMUTABLE_ST\
|
|
325
325
|
ACK__@@", be = /* @__PURE__ */ c((e) => `Immutable.${e}`, "getImmutableName"), je = /* @__PURE__ */ c((e) => `[${e}]`, "printAsLeaf"), Ce = "\
|
|
326
326
|
", Bt = "\u2026";
|
|
327
|
-
function Qr(e, t, n, r, o,
|
|
328
|
-
return ++r > t.maxDepth ? je(be(
|
|
327
|
+
function Qr(e, t, n, r, o, i, s) {
|
|
328
|
+
return ++r > t.maxDepth ? je(be(s)) : `${be(s) + Ce}{${Oe(e.entries(), t, n, r, o, i)}}`;
|
|
329
329
|
}
|
|
330
330
|
c(Qr, "printImmutableEntries");
|
|
331
331
|
function eo(e) {
|
|
@@ -345,24 +345,24 @@ function eo(e) {
|
|
|
345
345
|
} };
|
|
346
346
|
}
|
|
347
347
|
c(eo, "getRecordEntries");
|
|
348
|
-
function to(e, t, n, r, o,
|
|
349
|
-
let
|
|
350
|
-
return ++r > t.maxDepth ? je(
|
|
348
|
+
function to(e, t, n, r, o, i) {
|
|
349
|
+
let s = be(e._name || "Record");
|
|
350
|
+
return ++r > t.maxDepth ? je(s) : `${s + Ce}{${Oe(eo(e), t, n, r, o, i)}}`;
|
|
351
351
|
}
|
|
352
352
|
c(to, "printImmutableRecord");
|
|
353
|
-
function no(e, t, n, r, o,
|
|
354
|
-
let
|
|
355
|
-
return ++r > t.maxDepth ? je(
|
|
356
|
-
e._array || e._collection || e._iterable ? nt(e.values(), t, n, r, o,
|
|
353
|
+
function no(e, t, n, r, o, i) {
|
|
354
|
+
let s = be("Seq");
|
|
355
|
+
return ++r > t.maxDepth ? je(s) : e[Gr] ? `${s + Ce}{${e._iter || e._object ? Oe(e.entries(), t, n, r, o, i) : Bt}}` : `${s + Ce}[${e._iter ||
|
|
356
|
+
e._array || e._collection || e._iterable ? nt(e.values(), t, n, r, o, i) : Bt}]`;
|
|
357
357
|
}
|
|
358
358
|
c(no, "printImmutableSeq");
|
|
359
|
-
function tt(e, t, n, r, o,
|
|
360
|
-
return ++r > t.maxDepth ? je(be(
|
|
359
|
+
function tt(e, t, n, r, o, i, s) {
|
|
360
|
+
return ++r > t.maxDepth ? je(be(s)) : `${be(s) + Ce}[${nt(e.values(), t, n, r, o, i)}]`;
|
|
361
361
|
}
|
|
362
362
|
c(tt, "printImmutableValues");
|
|
363
|
-
var ro = /* @__PURE__ */ c((e, t, n, r, o,
|
|
364
|
-
List") : e[Zr] ? tt(e, t, n, r, o,
|
|
365
|
-
to(e, t, n, r, o,
|
|
363
|
+
var ro = /* @__PURE__ */ c((e, t, n, r, o, i) => e[Hr] ? Qr(e, t, n, r, o, i, e[jt] ? "OrderedMap" : "Map") : e[Kr] ? tt(e, t, n, r, o, i, "\
|
|
364
|
+
List") : e[Zr] ? tt(e, t, n, r, o, i, e[jt] ? "OrderedSet" : "Set") : e[vr] ? tt(e, t, n, r, o, i, "Stack") : e[Xr] ? no(e, t, n, r, o, i) :
|
|
365
|
+
to(e, t, n, r, o, i), "serialize$2"), oo = /* @__PURE__ */ c((e) => e && (e[qr] === !0 || e[Jr] === !0), "test$2"), io = {
|
|
366
366
|
serialize: ro,
|
|
367
367
|
test: oo
|
|
368
368
|
};
|
|
@@ -372,13 +372,13 @@ function on(e) {
|
|
|
372
372
|
c(on, "getDefaultExportFromCjs");
|
|
373
373
|
var Me = { exports: {} }, N = {};
|
|
374
374
|
var kt;
|
|
375
|
-
function
|
|
375
|
+
function so() {
|
|
376
376
|
if (kt) return N;
|
|
377
377
|
kt = 1;
|
|
378
378
|
var e = Symbol.for("react.transitional.element"), t = Symbol.for("react.portal"), n = Symbol.for("react.fragment"), r = Symbol.for("react.\
|
|
379
|
-
strict_mode"), o = Symbol.for("react.profiler"),
|
|
379
|
+
strict_mode"), o = Symbol.for("react.profiler"), i = Symbol.for("react.consumer"), s = Symbol.for("react.context"), a = Symbol.for("react.fo\
|
|
380
380
|
rward_ref"), l = Symbol.for("react.suspense"), m = Symbol.for("react.suspense_list"), p = Symbol.for("react.memo"), f = Symbol.for("react.la\
|
|
381
|
-
zy"), b = Symbol.for("react.
|
|
381
|
+
zy"), b = Symbol.for("react.view_transition"), y = Symbol.for("react.client.reference");
|
|
382
382
|
function g(u) {
|
|
383
383
|
if (typeof u == "object" && u !== null) {
|
|
384
384
|
var h = u.$$typeof;
|
|
@@ -390,15 +390,16 @@ zy"), b = Symbol.for("react.offscreen"), y = Symbol.for("react.client.reference"
|
|
|
390
390
|
case r:
|
|
391
391
|
case l:
|
|
392
392
|
case m:
|
|
393
|
+
case b:
|
|
393
394
|
return u;
|
|
394
395
|
default:
|
|
395
396
|
switch (u = u && u.$$typeof, u) {
|
|
396
|
-
case
|
|
397
|
+
case s:
|
|
397
398
|
case a:
|
|
398
399
|
case f:
|
|
399
400
|
case p:
|
|
400
401
|
return u;
|
|
401
|
-
case
|
|
402
|
+
case i:
|
|
402
403
|
return u;
|
|
403
404
|
default:
|
|
404
405
|
return h;
|
|
@@ -409,11 +410,11 @@ zy"), b = Symbol.for("react.offscreen"), y = Symbol.for("react.client.reference"
|
|
|
409
410
|
}
|
|
410
411
|
}
|
|
411
412
|
}
|
|
412
|
-
return c(g, "typeOf"), N.ContextConsumer =
|
|
413
|
+
return c(g, "typeOf"), N.ContextConsumer = i, N.ContextProvider = s, N.Element = e, N.ForwardRef = a, N.Fragment = n, N.Lazy = f, N.Memo =
|
|
413
414
|
p, N.Portal = t, N.Profiler = o, N.StrictMode = r, N.Suspense = l, N.SuspenseList = m, N.isContextConsumer = function(u) {
|
|
414
|
-
return g(u) === s;
|
|
415
|
-
}, N.isContextProvider = function(u) {
|
|
416
415
|
return g(u) === i;
|
|
416
|
+
}, N.isContextProvider = function(u) {
|
|
417
|
+
return g(u) === s;
|
|
417
418
|
}, N.isElement = function(u) {
|
|
418
419
|
return typeof u == "object" && u !== null && u.$$typeof === e;
|
|
419
420
|
}, N.isForwardRef = function(u) {
|
|
@@ -435,12 +436,12 @@ zy"), b = Symbol.for("react.offscreen"), y = Symbol.for("react.client.reference"
|
|
|
435
436
|
}, N.isSuspenseList = function(u) {
|
|
436
437
|
return g(u) === m;
|
|
437
438
|
}, N.isValidElementType = function(u) {
|
|
438
|
-
return typeof u == "string" || typeof u == "function" || u === n || u === o || u === r || u === l || u === m || u
|
|
439
|
-
|
|
440
|
-
|
|
439
|
+
return typeof u == "string" || typeof u == "function" || u === n || u === o || u === r || u === l || u === m || typeof u == "object" && u !==
|
|
440
|
+
null && (u.$$typeof === f || u.$$typeof === p || u.$$typeof === s || u.$$typeof === i || u.$$typeof === a || u.$$typeof === y || u.getModuleId !==
|
|
441
|
+
void 0);
|
|
441
442
|
}, N.typeOf = g, N;
|
|
442
443
|
}
|
|
443
|
-
c(
|
|
444
|
+
c(so, "requireReactIs_production");
|
|
444
445
|
var P = {};
|
|
445
446
|
var zt;
|
|
446
447
|
function co() {
|
|
@@ -452,10 +453,11 @@ function co() {
|
|
|
452
453
|
case t:
|
|
453
454
|
switch (u = u.type, u) {
|
|
454
455
|
case r:
|
|
455
|
-
case
|
|
456
|
+
case i:
|
|
456
457
|
case o:
|
|
457
458
|
case m:
|
|
458
459
|
case p:
|
|
460
|
+
case y:
|
|
459
461
|
return u;
|
|
460
462
|
default:
|
|
461
463
|
switch (u = u && u.$$typeof, u) {
|
|
@@ -464,7 +466,7 @@ function co() {
|
|
|
464
466
|
case b:
|
|
465
467
|
case f:
|
|
466
468
|
return u;
|
|
467
|
-
case
|
|
469
|
+
case s:
|
|
468
470
|
return u;
|
|
469
471
|
default:
|
|
470
472
|
return h;
|
|
@@ -477,12 +479,12 @@ function co() {
|
|
|
477
479
|
}
|
|
478
480
|
c(e, "typeOf");
|
|
479
481
|
var t = Symbol.for("react.transitional.element"), n = Symbol.for("react.portal"), r = Symbol.for("react.fragment"), o = Symbol.for("reac\
|
|
480
|
-
t.strict_mode"),
|
|
482
|
+
t.strict_mode"), i = Symbol.for("react.profiler"), s = Symbol.for("react.consumer"), a = Symbol.for("react.context"), l = Symbol.for("react.\
|
|
481
483
|
forward_ref"), m = Symbol.for("react.suspense"), p = Symbol.for("react.suspense_list"), f = Symbol.for("react.memo"), b = Symbol.for("react.\
|
|
482
|
-
lazy"), y = Symbol.for("react.
|
|
483
|
-
P.ContextConsumer =
|
|
484
|
-
|
|
485
|
-
return e(u) ===
|
|
484
|
+
lazy"), y = Symbol.for("react.view_transition"), g = Symbol.for("react.client.reference");
|
|
485
|
+
P.ContextConsumer = s, P.ContextProvider = a, P.Element = t, P.ForwardRef = l, P.Fragment = r, P.Lazy = b, P.Memo = f, P.Portal = n, P.Profiler =
|
|
486
|
+
i, P.StrictMode = o, P.Suspense = m, P.SuspenseList = p, P.isContextConsumer = function(u) {
|
|
487
|
+
return e(u) === s;
|
|
486
488
|
}, P.isContextProvider = function(u) {
|
|
487
489
|
return e(u) === a;
|
|
488
490
|
}, P.isElement = function(u) {
|
|
@@ -498,7 +500,7 @@ lazy"), y = Symbol.for("react.offscreen"), g = Symbol.for("react.client.referenc
|
|
|
498
500
|
}, P.isPortal = function(u) {
|
|
499
501
|
return e(u) === n;
|
|
500
502
|
}, P.isProfiler = function(u) {
|
|
501
|
-
return e(u) ===
|
|
503
|
+
return e(u) === i;
|
|
502
504
|
}, P.isStrictMode = function(u) {
|
|
503
505
|
return e(u) === o;
|
|
504
506
|
}, P.isSuspense = function(u) {
|
|
@@ -506,16 +508,16 @@ lazy"), y = Symbol.for("react.offscreen"), g = Symbol.for("react.client.referenc
|
|
|
506
508
|
}, P.isSuspenseList = function(u) {
|
|
507
509
|
return e(u) === p;
|
|
508
510
|
}, P.isValidElementType = function(u) {
|
|
509
|
-
return typeof u == "string" || typeof u == "function" || u === r || u ===
|
|
510
|
-
|
|
511
|
-
|
|
511
|
+
return typeof u == "string" || typeof u == "function" || u === r || u === i || u === o || u === m || u === p || typeof u == "object" &&
|
|
512
|
+
u !== null && (u.$$typeof === b || u.$$typeof === f || u.$$typeof === a || u.$$typeof === s || u.$$typeof === l || u.$$typeof === g ||
|
|
513
|
+
u.getModuleId !== void 0);
|
|
512
514
|
}, P.typeOf = e;
|
|
513
515
|
}()), P;
|
|
514
516
|
}
|
|
515
517
|
c(co, "requireReactIs_development$1");
|
|
516
518
|
var Yt;
|
|
517
519
|
function uo() {
|
|
518
|
-
return Yt || (Yt = 1, process.env.NODE_ENV === "production" ? Me.exports =
|
|
520
|
+
return Yt || (Yt = 1, process.env.NODE_ENV === "production" ? Me.exports = so() : Me.exports = co()), Me.exports;
|
|
519
521
|
}
|
|
520
522
|
c(uo, "requireReactIs$1");
|
|
521
523
|
var sn = uo(), lo = /* @__PURE__ */ on(sn), ao = /* @__PURE__ */ Zt({
|
|
@@ -527,7 +529,7 @@ function fo() {
|
|
|
527
529
|
if (Ut) return w;
|
|
528
530
|
Ut = 1;
|
|
529
531
|
var e = Symbol.for("react.element"), t = Symbol.for("react.portal"), n = Symbol.for("react.fragment"), r = Symbol.for("react.strict_mode"),
|
|
530
|
-
o = Symbol.for("react.profiler"),
|
|
532
|
+
o = Symbol.for("react.profiler"), i = Symbol.for("react.provider"), s = Symbol.for("react.context"), a = Symbol.for("react.server_context"),
|
|
531
533
|
l = Symbol.for("react.forward_ref"), m = Symbol.for("react.suspense"), p = Symbol.for("react.suspense_list"), f = Symbol.for("react.memo"),
|
|
532
534
|
b = Symbol.for("react.lazy"), y = Symbol.for("react.offscreen"), g;
|
|
533
535
|
g = Symbol.for("react.module.reference");
|
|
@@ -546,11 +548,11 @@ function fo() {
|
|
|
546
548
|
default:
|
|
547
549
|
switch (h = h && h.$$typeof, h) {
|
|
548
550
|
case a:
|
|
549
|
-
case
|
|
551
|
+
case s:
|
|
550
552
|
case l:
|
|
551
553
|
case b:
|
|
552
554
|
case f:
|
|
553
|
-
case
|
|
555
|
+
case i:
|
|
554
556
|
return h;
|
|
555
557
|
default:
|
|
556
558
|
return S;
|
|
@@ -561,15 +563,15 @@ function fo() {
|
|
|
561
563
|
}
|
|
562
564
|
}
|
|
563
565
|
}
|
|
564
|
-
return c(u, "v"), w.ContextConsumer =
|
|
566
|
+
return c(u, "v"), w.ContextConsumer = s, w.ContextProvider = i, w.Element = e, w.ForwardRef = l, w.Fragment = n, w.Lazy = b, w.Memo = f, w.
|
|
565
567
|
Portal = t, w.Profiler = o, w.StrictMode = r, w.Suspense = m, w.SuspenseList = p, w.isAsyncMode = function() {
|
|
566
568
|
return !1;
|
|
567
569
|
}, w.isConcurrentMode = function() {
|
|
568
570
|
return !1;
|
|
569
571
|
}, w.isContextConsumer = function(h) {
|
|
570
|
-
return u(h) === i;
|
|
571
|
-
}, w.isContextProvider = function(h) {
|
|
572
572
|
return u(h) === s;
|
|
573
|
+
}, w.isContextProvider = function(h) {
|
|
574
|
+
return u(h) === i;
|
|
573
575
|
}, w.isElement = function(h) {
|
|
574
576
|
return typeof h == "object" && h !== null && h.$$typeof === e;
|
|
575
577
|
}, w.isForwardRef = function(h) {
|
|
@@ -592,7 +594,7 @@ function fo() {
|
|
|
592
594
|
return u(h) === p;
|
|
593
595
|
}, w.isValidElementType = function(h) {
|
|
594
596
|
return typeof h == "string" || typeof h == "function" || h === n || h === o || h === r || h === m || h === p || h === y || typeof h == "\
|
|
595
|
-
object" && h !== null && (h.$$typeof === b || h.$$typeof === f || h.$$typeof ===
|
|
597
|
+
object" && h !== null && (h.$$typeof === b || h.$$typeof === f || h.$$typeof === i || h.$$typeof === s || h.$$typeof === l || h.$$typeof ===
|
|
596
598
|
g || h.getModuleId !== void 0);
|
|
597
599
|
}, w.typeOf = u, w;
|
|
598
600
|
}
|
|
@@ -602,13 +604,13 @@ var Wt;
|
|
|
602
604
|
function mo() {
|
|
603
605
|
return Wt || (Wt = 1, process.env.NODE_ENV !== "production" && function() {
|
|
604
606
|
var e = Symbol.for("react.element"), t = Symbol.for("react.portal"), n = Symbol.for("react.fragment"), r = Symbol.for("react.strict_mode"),
|
|
605
|
-
o = Symbol.for("react.profiler"),
|
|
607
|
+
o = Symbol.for("react.profiler"), i = Symbol.for("react.provider"), s = Symbol.for("react.context"), a = Symbol.for("react.server_contex\
|
|
606
608
|
t"), l = Symbol.for("react.forward_ref"), m = Symbol.for("react.suspense"), p = Symbol.for("react.suspense_list"), f = Symbol.for("react.mem\
|
|
607
609
|
o"), b = Symbol.for("react.lazy"), y = Symbol.for("react.offscreen"), g = !1, u = !1, h = !1, S = !1, _ = !1, O;
|
|
608
610
|
O = Symbol.for("react.module.reference");
|
|
609
611
|
function d(C) {
|
|
610
612
|
return !!(typeof C == "string" || typeof C == "function" || C === n || C === o || _ || C === r || C === m || C === p || S || C === y ||
|
|
611
|
-
g || u || h || typeof C == "object" && C !== null && (C.$$typeof === b || C.$$typeof === f || C.$$typeof ===
|
|
613
|
+
g || u || h || typeof C == "object" && C !== null && (C.$$typeof === b || C.$$typeof === f || C.$$typeof === i || C.$$typeof === s || C.
|
|
612
614
|
$$typeof === l || // This needs to include all possible module reference object
|
|
613
615
|
// types supported by any Flight configuration anywhere since
|
|
614
616
|
// we don't know which Flight build this will end up being used
|
|
@@ -633,11 +635,11 @@ o"), b = Symbol.for("react.lazy"), y = Symbol.for("react.offscreen"), g = !1, u
|
|
|
633
635
|
var Lt = Ne && Ne.$$typeof;
|
|
634
636
|
switch (Lt) {
|
|
635
637
|
case a:
|
|
636
|
-
case
|
|
638
|
+
case s:
|
|
637
639
|
case l:
|
|
638
640
|
case b:
|
|
639
641
|
case f:
|
|
640
|
-
case
|
|
642
|
+
case i:
|
|
641
643
|
return Lt;
|
|
642
644
|
default:
|
|
643
645
|
return ve;
|
|
@@ -649,21 +651,21 @@ o"), b = Symbol.for("react.lazy"), y = Symbol.for("react.offscreen"), g = !1, u
|
|
|
649
651
|
}
|
|
650
652
|
}
|
|
651
653
|
c(E, "typeOf");
|
|
652
|
-
var $ =
|
|
654
|
+
var $ = s, T = i, R = e, J = l, te = n, L = b, z = f, X = t, V = o, M = r, D = m, F = p, Z = !1, B = !1;
|
|
653
655
|
function K(C) {
|
|
654
656
|
return Z || (Z = !0, console.warn("The ReactIs.isAsyncMode() alias has been deprecated, and will be removed in React 18+.")), !1;
|
|
655
657
|
}
|
|
656
658
|
c(K, "isAsyncMode");
|
|
657
|
-
function
|
|
659
|
+
function ie(C) {
|
|
658
660
|
return B || (B = !0, console.warn("The ReactIs.isConcurrentMode() alias has been deprecated, and will be removed in React 18+.")), !1;
|
|
659
661
|
}
|
|
660
|
-
c(
|
|
662
|
+
c(ie, "isConcurrentMode");
|
|
661
663
|
function G(C) {
|
|
662
|
-
return E(C) ===
|
|
664
|
+
return E(C) === s;
|
|
663
665
|
}
|
|
664
666
|
c(G, "isContextConsumer");
|
|
665
667
|
function H(C) {
|
|
666
|
-
return E(C) ===
|
|
668
|
+
return E(C) === i;
|
|
667
669
|
}
|
|
668
670
|
c(H, "isContextProvider");
|
|
669
671
|
function ce(C) {
|
|
@@ -678,10 +680,10 @@ o"), b = Symbol.for("react.lazy"), y = Symbol.for("react.offscreen"), g = !1, u
|
|
|
678
680
|
return E(C) === n;
|
|
679
681
|
}
|
|
680
682
|
c(q, "isFragment");
|
|
681
|
-
function
|
|
683
|
+
function se(C) {
|
|
682
684
|
return E(C) === b;
|
|
683
685
|
}
|
|
684
|
-
c(
|
|
686
|
+
c(se, "isLazy");
|
|
685
687
|
function de(C) {
|
|
686
688
|
return E(C) === f;
|
|
687
689
|
}
|
|
@@ -706,8 +708,8 @@ o"), b = Symbol.for("react.lazy"), y = Symbol.for("react.offscreen"), g = !1, u
|
|
|
706
708
|
return E(C) === p;
|
|
707
709
|
}
|
|
708
710
|
c(pr, "isSuspenseList"), A.ContextConsumer = $, A.ContextProvider = T, A.Element = R, A.ForwardRef = J, A.Fragment = te, A.Lazy = L, A.Memo =
|
|
709
|
-
z, A.Portal = X, A.Profiler = V, A.StrictMode = M, A.Suspense =
|
|
710
|
-
G, A.isContextProvider = H, A.isElement = ce, A.isForwardRef = v, A.isFragment = q, A.isLazy =
|
|
711
|
+
z, A.Portal = X, A.Profiler = V, A.StrictMode = M, A.Suspense = D, A.SuspenseList = F, A.isAsyncMode = K, A.isConcurrentMode = ie, A.isContextConsumer =
|
|
712
|
+
G, A.isContextProvider = H, A.isElement = ce, A.isForwardRef = v, A.isFragment = q, A.isLazy = se, A.isMemo = de, A.isPortal = ae, A.isProfiler =
|
|
711
713
|
Te, A.isStrictMode = Ae, A.isSuspense = Re, A.isSuspenseList = pr, A.isValidElementType = d, A.typeOf = E;
|
|
712
714
|
}()), A;
|
|
713
715
|
}
|
|
@@ -779,8 +781,8 @@ function bo(e) {
|
|
|
779
781
|
return Object.keys(t).filter((n) => n !== "children" && t[n] !== void 0).sort();
|
|
780
782
|
}
|
|
781
783
|
c(bo, "getPropKeys$1");
|
|
782
|
-
var So = /* @__PURE__ */ c((e, t, n, r, o,
|
|
783
|
-
un(e.props.children), t, n + t.indent, r, o,
|
|
784
|
+
var So = /* @__PURE__ */ c((e, t, n, r, o, i) => ++r > t.maxDepth ? ct(qt(e), t) : st(qt(e), ot(bo(e), e.props, t, n + t.indent, r, o, i), it(
|
|
785
|
+
un(e.props.children), t, n + t.indent, r, o, i), t, n), "serialize$1"), Eo = /* @__PURE__ */ c((e) => e != null && me.isElement(e), "test$1"),
|
|
784
786
|
_o = {
|
|
785
787
|
serialize: So,
|
|
786
788
|
test: Eo
|
|
@@ -790,8 +792,8 @@ function Co(e) {
|
|
|
790
792
|
return t ? Object.keys(t).filter((n) => t[n] !== void 0).sort() : [];
|
|
791
793
|
}
|
|
792
794
|
c(Co, "getPropKeys");
|
|
793
|
-
var Oo = /* @__PURE__ */ c((e, t, n, r, o,
|
|
794
|
-
r, o,
|
|
795
|
+
var Oo = /* @__PURE__ */ c((e, t, n, r, o, i) => ++r > t.maxDepth ? ct(e.type, t) : st(e.type, e.props ? ot(Co(e), e.props, t, n + t.indent,
|
|
796
|
+
r, o, i) : "", e.children ? it(e.children, t, n + t.indent, r, o, i) : "", t, n), "serialize"), $o = /* @__PURE__ */ c((e) => e && e.$$typeof ===
|
|
795
797
|
To, "test"), wo = {
|
|
796
798
|
serialize: Oo,
|
|
797
799
|
test: $o
|
|
@@ -804,7 +806,7 @@ function No(e) {
|
|
|
804
806
|
return typeof window < "u" && e === window;
|
|
805
807
|
}
|
|
806
808
|
c(No, "isWindow");
|
|
807
|
-
var Po = /^Symbol\((.*)\)(.*)$/, Io = /\n/g,
|
|
809
|
+
var Po = /^Symbol\((.*)\)(.*)$/, Io = /\n/g, Fe = class extends Error {
|
|
808
810
|
static {
|
|
809
811
|
c(this, "PrettyFormatPluginError");
|
|
810
812
|
}
|
|
@@ -856,51 +858,51 @@ function an(e, t, n, r) {
|
|
|
856
858
|
return Gt(e, t);
|
|
857
859
|
if (o === "symbol")
|
|
858
860
|
return Ht(e);
|
|
859
|
-
let
|
|
860
|
-
return
|
|
861
|
-
eratorFunction]" ? Gt(e, t) :
|
|
862
|
-
"[object Error]" ? Jt(e) :
|
|
861
|
+
let i = ln.call(e);
|
|
862
|
+
return i === "[object WeakMap]" ? "WeakMap {}" : i === "[object WeakSet]" ? "WeakSet {}" : i === "[object Function]" || i === "[object Gen\
|
|
863
|
+
eratorFunction]" ? Gt(e, t) : i === "[object Symbol]" ? Ht(e) : i === "[object Date]" ? Number.isNaN(+e) ? "Date { NaN }" : Ao.call(e) : i ===
|
|
864
|
+
"[object Error]" ? Jt(e) : i === "[object RegExp]" ? n ? Kt.call(e).replaceAll(/[$()*+.?[\\\]^{|}]/g, "\\$&") : Kt.call(e) : e instanceof Error ?
|
|
863
865
|
Jt(e) : null;
|
|
864
866
|
}
|
|
865
867
|
c(an, "printBasicValue");
|
|
866
|
-
function fn(e, t, n, r, o,
|
|
868
|
+
function fn(e, t, n, r, o, i) {
|
|
867
869
|
if (o.includes(e))
|
|
868
870
|
return "[Circular]";
|
|
869
871
|
o = [...o], o.push(e);
|
|
870
|
-
let
|
|
871
|
-
if (t.callToJSON && !
|
|
872
|
+
let s = ++r > t.maxDepth, a = t.min;
|
|
873
|
+
if (t.callToJSON && !s && e.toJSON && typeof e.toJSON == "function" && !i)
|
|
872
874
|
return fe(e.toJSON(), t, n, r, o, !0);
|
|
873
875
|
let l = ln.call(e);
|
|
874
|
-
return l === "[object Arguments]" ?
|
|
875
|
-
name}]` : `${a || !t.printBasicPrototype && e.constructor.name === "Array" ? "" : `${e.constructor.name} `}[${
|
|
876
|
-
"[object Map]" ?
|
|
877
|
-
t, n, r, o, fe)}}` :
|
|
876
|
+
return l === "[object Arguments]" ? s ? "[Arguments]" : `${a ? "" : "Arguments "}[${De(e, t, n, r, o, fe)}]` : Mo(l) ? s ? `[${e.constructor.
|
|
877
|
+
name}]` : `${a || !t.printBasicPrototype && e.constructor.name === "Array" ? "" : `${e.constructor.name} `}[${De(e, t, n, r, o, fe)}]` : l ===
|
|
878
|
+
"[object Map]" ? s ? "[Map]" : `Map {${Oe(e.entries(), t, n, r, o, fe, " => ")}}` : l === "[object Set]" ? s ? "[Set]" : `Set {${nt(e.values(),
|
|
879
|
+
t, n, r, o, fe)}}` : s || No(e) ? `[${xe(e)}]` : `${a || !t.printBasicPrototype && xe(e) === "Object" ? "" : `${xe(e)} `}{${rt(e, t, n, r,
|
|
878
880
|
o, fe)}}`;
|
|
879
881
|
}
|
|
880
882
|
c(fn, "printComplexValue");
|
|
881
|
-
var
|
|
883
|
+
var Do = {
|
|
882
884
|
test: /* @__PURE__ */ c((e) => e && e instanceof Error, "test"),
|
|
883
|
-
serialize(e, t, n, r, o,
|
|
885
|
+
serialize(e, t, n, r, o, i) {
|
|
884
886
|
if (o.includes(e))
|
|
885
887
|
return "[Circular]";
|
|
886
888
|
o = [...o, e];
|
|
887
|
-
let
|
|
889
|
+
let s = ++r > t.maxDepth, { message: a, cause: l, ...m } = e, p = {
|
|
888
890
|
message: a,
|
|
889
891
|
...typeof l < "u" ? { cause: l } : {},
|
|
890
892
|
...e instanceof AggregateError ? { errors: e.errors } : {},
|
|
891
893
|
...m
|
|
892
894
|
}, f = e.name !== "Error" ? e.name : xe(e);
|
|
893
|
-
return
|
|
895
|
+
return s ? `[${f}]` : `${f} {${Oe(Object.entries(p).values(), t, n, r, o, i)}}`;
|
|
894
896
|
}
|
|
895
897
|
};
|
|
896
|
-
function
|
|
898
|
+
function Fo(e) {
|
|
897
899
|
return e.serialize != null;
|
|
898
900
|
}
|
|
899
|
-
c(
|
|
900
|
-
function mn(e, t, n, r, o,
|
|
901
|
-
let
|
|
901
|
+
c(Fo, "isNewPlugin");
|
|
902
|
+
function mn(e, t, n, r, o, i) {
|
|
903
|
+
let s;
|
|
902
904
|
try {
|
|
903
|
-
|
|
905
|
+
s = Fo(e) ? e.serialize(t, n, r, o, i, fe) : e.print(t, (a) => fe(a, n, r, o, i), (a) => {
|
|
904
906
|
let l = r + n.indent;
|
|
905
907
|
return l + a.replaceAll(Io, `
|
|
906
908
|
${l}`);
|
|
@@ -910,11 +912,11 @@ ${l}`);
|
|
|
910
912
|
spacing: n.spacingInner
|
|
911
913
|
}, n.colors);
|
|
912
914
|
} catch (a) {
|
|
913
|
-
throw new
|
|
915
|
+
throw new Fe(a.message, a.stack);
|
|
914
916
|
}
|
|
915
|
-
if (typeof
|
|
916
|
-
throw new TypeError(`pretty-format: Plugin must return type "string" but instead returned "${typeof
|
|
917
|
-
return
|
|
917
|
+
if (typeof s != "string")
|
|
918
|
+
throw new TypeError(`pretty-format: Plugin must return type "string" but instead returned "${typeof s}".`);
|
|
919
|
+
return s;
|
|
918
920
|
}
|
|
919
921
|
c(mn, "printPlugin");
|
|
920
922
|
function pn(e, t) {
|
|
@@ -923,17 +925,17 @@ function pn(e, t) {
|
|
|
923
925
|
if (n.test(t))
|
|
924
926
|
return n;
|
|
925
927
|
} catch (r) {
|
|
926
|
-
throw new
|
|
928
|
+
throw new Fe(r.message, r.stack);
|
|
927
929
|
}
|
|
928
930
|
return null;
|
|
929
931
|
}
|
|
930
932
|
c(pn, "findPlugin");
|
|
931
|
-
function fe(e, t, n, r, o,
|
|
932
|
-
let
|
|
933
|
-
if (
|
|
934
|
-
return mn(
|
|
933
|
+
function fe(e, t, n, r, o, i) {
|
|
934
|
+
let s = pn(t.plugins, e);
|
|
935
|
+
if (s !== null)
|
|
936
|
+
return mn(s, e, t, n, r, o);
|
|
935
937
|
let a = an(e, t.printFunctionName, t.escapeRegex, t.escapeString);
|
|
936
|
-
return a !== null ? a : fn(e, t, n, r, o,
|
|
938
|
+
return a !== null ? a : fn(e, t, n, r, o, i);
|
|
937
939
|
}
|
|
938
940
|
c(fe, "printer");
|
|
939
941
|
var ut = {
|
|
@@ -1034,10 +1036,10 @@ var $e = {
|
|
|
1034
1036
|
AsymmetricMatcher: Ar,
|
|
1035
1037
|
DOMCollection: xr,
|
|
1036
1038
|
DOMElement: Vr,
|
|
1037
|
-
Immutable:
|
|
1039
|
+
Immutable: io,
|
|
1038
1040
|
ReactElement: _o,
|
|
1039
1041
|
ReactTestComponent: wo,
|
|
1040
|
-
Error:
|
|
1042
|
+
Error: Do
|
|
1041
1043
|
};
|
|
1042
1044
|
|
|
1043
1045
|
// ../node_modules/loupe/lib/helpers.js
|
|
@@ -1092,8 +1094,8 @@ function Sn({
|
|
|
1092
1094
|
colors: n = !1,
|
|
1093
1095
|
customInspect: r = !0,
|
|
1094
1096
|
showProxy: o = !1,
|
|
1095
|
-
maxArrayLength:
|
|
1096
|
-
breakLength:
|
|
1097
|
+
maxArrayLength: i = 1 / 0,
|
|
1098
|
+
breakLength: s = 1 / 0,
|
|
1097
1099
|
seen: a = [],
|
|
1098
1100
|
// eslint-disable-next-line no-shadow
|
|
1099
1101
|
truncate: l = 1 / 0,
|
|
@@ -1105,8 +1107,8 @@ function Sn({
|
|
|
1105
1107
|
colors: !!n,
|
|
1106
1108
|
customInspect: !!r,
|
|
1107
1109
|
showProxy: !!o,
|
|
1108
|
-
maxArrayLength: Number(
|
|
1109
|
-
breakLength: Number(
|
|
1110
|
+
maxArrayLength: Number(i),
|
|
1111
|
+
breakLength: Number(s),
|
|
1110
1112
|
truncate: Number(l),
|
|
1111
1113
|
seen: a,
|
|
1112
1114
|
inspect: p,
|
|
@@ -1125,8 +1127,8 @@ function Y(e, t, n = ue) {
|
|
|
1125
1127
|
if (r > t && o > r)
|
|
1126
1128
|
return n;
|
|
1127
1129
|
if (o > t && o > r) {
|
|
1128
|
-
let
|
|
1129
|
-
return
|
|
1130
|
+
let i = t - r;
|
|
1131
|
+
return i > 0 && Wo(e[i - 1]) && (i = i - 1), `${e.slice(0, i)}${n}`;
|
|
1130
1132
|
}
|
|
1131
1133
|
return e;
|
|
1132
1134
|
}
|
|
@@ -1136,23 +1138,23 @@ function j(e, t, n, r = ", ") {
|
|
|
1136
1138
|
let o = e.length;
|
|
1137
1139
|
if (o === 0)
|
|
1138
1140
|
return "";
|
|
1139
|
-
let
|
|
1141
|
+
let i = t.truncate, s = "", a = "", l = "";
|
|
1140
1142
|
for (let m = 0; m < o; m += 1) {
|
|
1141
1143
|
let p = m + 1 === e.length, f = m + 2 === e.length;
|
|
1142
1144
|
l = `${ue}(${e.length - m})`;
|
|
1143
1145
|
let b = e[m];
|
|
1144
|
-
t.truncate =
|
|
1145
|
-
let y = a || n(b, t) + (p ? "" : r), g =
|
|
1146
|
-
if (p && g >
|
|
1147
|
-
length >
|
|
1146
|
+
t.truncate = i - s.length - (p ? 0 : r.length);
|
|
1147
|
+
let y = a || n(b, t) + (p ? "" : r), g = s.length + y.length, u = g + l.length;
|
|
1148
|
+
if (p && g > i && s.length + l.length <= i || !p && !f && u > i || (a = p ? "" : n(e[m + 1], t) + (f ? "" : r), !p && f && u > i && g + a.
|
|
1149
|
+
length > i))
|
|
1148
1150
|
break;
|
|
1149
|
-
if (
|
|
1151
|
+
if (s += y, !p && !f && g + a.length >= i) {
|
|
1150
1152
|
l = `${ue}(${e.length - m - 1})`;
|
|
1151
1153
|
break;
|
|
1152
1154
|
}
|
|
1153
1155
|
l = "";
|
|
1154
1156
|
}
|
|
1155
|
-
return `${
|
|
1157
|
+
return `${s}${l}`;
|
|
1156
1158
|
}
|
|
1157
1159
|
c(j, "inspectList");
|
|
1158
1160
|
function Vo(e) {
|
|
@@ -1174,7 +1176,7 @@ function lt(e, t) {
|
|
|
1174
1176
|
let r = j(e, t);
|
|
1175
1177
|
t.truncate -= r.length;
|
|
1176
1178
|
let o = "";
|
|
1177
|
-
return n.length && (o = j(n.map((
|
|
1179
|
+
return n.length && (o = j(n.map((i) => [i, e[i]]), t, le)), `[ ${r}${o ? `, ${o}` : ""} ]`;
|
|
1178
1180
|
}
|
|
1179
1181
|
c(lt, "inspectArray");
|
|
1180
1182
|
|
|
@@ -1188,16 +1190,16 @@ function oe(e, t) {
|
|
|
1188
1190
|
if (!e.length && !r.length)
|
|
1189
1191
|
return `${n}[]`;
|
|
1190
1192
|
let o = "";
|
|
1191
|
-
for (let
|
|
1192
|
-
let a = `${t.stylize(Y(e[
|
|
1193
|
-
if (t.truncate -= a.length, e[
|
|
1194
|
-
o += `${ue}(${e.length - e[
|
|
1193
|
+
for (let s = 0; s < e.length; s++) {
|
|
1194
|
+
let a = `${t.stylize(Y(e[s], t.truncate), "number")}${s === e.length - 1 ? "" : ", "}`;
|
|
1195
|
+
if (t.truncate -= a.length, e[s] !== e.length && t.truncate <= 3) {
|
|
1196
|
+
o += `${ue}(${e.length - e[s] + 1})`;
|
|
1195
1197
|
break;
|
|
1196
1198
|
}
|
|
1197
1199
|
o += a;
|
|
1198
1200
|
}
|
|
1199
|
-
let
|
|
1200
|
-
return r.length && (
|
|
1201
|
+
let i = "";
|
|
1202
|
+
return r.length && (i = j(r.map((s) => [s, e[s]]), t, le)), `${n}[ ${o}${i ? `, ${i}` : ""} ]`;
|
|
1201
1203
|
}
|
|
1202
1204
|
c(oe, "inspectTypedArray");
|
|
1203
1205
|
|
|
@@ -1301,8 +1303,8 @@ var _n = /* @__PURE__ */ c(() => "Promise{\u2026}", "getPromiseValue");
|
|
|
1301
1303
|
try {
|
|
1302
1304
|
let { getPromiseDetails: e, kPending: t, kRejected: n } = process.binding("util");
|
|
1303
1305
|
Array.isArray(e(Promise.resolve())) && (_n = /* @__PURE__ */ c((r, o) => {
|
|
1304
|
-
let [
|
|
1305
|
-
return
|
|
1306
|
+
let [i, s] = e(r);
|
|
1307
|
+
return i === t ? "Promise{<pending>}" : `Promise${i === n ? "!" : ""}{${o.inspect(s, o)}}`;
|
|
1306
1308
|
}, "getPromiseValue"));
|
|
1307
1309
|
} catch {
|
|
1308
1310
|
}
|
|
@@ -1316,10 +1318,10 @@ function pe(e, t) {
|
|
|
1316
1318
|
if (t.truncate -= 4, t.seen = t.seen || [], t.seen.includes(e))
|
|
1317
1319
|
return "[Circular]";
|
|
1318
1320
|
t.seen.push(e);
|
|
1319
|
-
let o = j(n.map((a) => [a, e[a]]), t, le),
|
|
1321
|
+
let o = j(n.map((a) => [a, e[a]]), t, le), i = j(r.map((a) => [a, e[a]]), t, le);
|
|
1320
1322
|
t.seen.pop();
|
|
1321
|
-
let
|
|
1322
|
-
return o &&
|
|
1323
|
+
let s = "";
|
|
1324
|
+
return o && i && (s = ", "), `{ ${o}${s}${i} }`;
|
|
1323
1325
|
}
|
|
1324
1326
|
c(pe, "inspectObject");
|
|
1325
1327
|
|
|
@@ -1339,7 +1341,7 @@ function yt(e, t) {
|
|
|
1339
1341
|
c(yt, "inspectArguments");
|
|
1340
1342
|
|
|
1341
1343
|
// ../node_modules/loupe/lib/error.js
|
|
1342
|
-
var
|
|
1344
|
+
var ei = [
|
|
1343
1345
|
"stack",
|
|
1344
1346
|
"line",
|
|
1345
1347
|
"column",
|
|
@@ -1353,41 +1355,41 @@ var es = [
|
|
|
1353
1355
|
"cause"
|
|
1354
1356
|
];
|
|
1355
1357
|
function dt(e, t) {
|
|
1356
|
-
let n = Object.getOwnPropertyNames(e).filter((
|
|
1358
|
+
let n = Object.getOwnPropertyNames(e).filter((s) => ei.indexOf(s) === -1), r = e.name;
|
|
1357
1359
|
t.truncate -= r.length;
|
|
1358
1360
|
let o = "";
|
|
1359
1361
|
if (typeof e.message == "string" ? o = Y(e.message, t.truncate) : n.unshift("message"), o = o ? `: ${o}` : "", t.truncate -= o.length + 5,
|
|
1360
1362
|
t.seen = t.seen || [], t.seen.includes(e))
|
|
1361
1363
|
return "[Circular]";
|
|
1362
1364
|
t.seen.push(e);
|
|
1363
|
-
let
|
|
1364
|
-
return `${r}${o}${
|
|
1365
|
+
let i = j(n.map((s) => [s, e[s]]), t, le);
|
|
1366
|
+
return `${r}${o}${i ? ` { ${i} }` : ""}`;
|
|
1365
1367
|
}
|
|
1366
1368
|
c(dt, "inspectObject");
|
|
1367
1369
|
|
|
1368
1370
|
// ../node_modules/loupe/lib/html.js
|
|
1369
|
-
function
|
|
1371
|
+
function ti([e, t], n) {
|
|
1370
1372
|
return n.truncate -= 3, t ? `${n.stylize(String(e), "yellow")}=${n.stylize(`"${t}"`, "string")}` : `${n.stylize(String(e), "yellow")}`;
|
|
1371
1373
|
}
|
|
1372
|
-
c(
|
|
1374
|
+
c(ti, "inspectAttribute");
|
|
1373
1375
|
function We(e, t) {
|
|
1374
1376
|
return j(e, t, Ve, `
|
|
1375
1377
|
`);
|
|
1376
1378
|
}
|
|
1377
1379
|
c(We, "inspectHTMLCollection");
|
|
1378
1380
|
function Ve(e, t) {
|
|
1379
|
-
let n = e.getAttributeNames(), r = e.tagName.toLowerCase(), o = t.stylize(`<${r}`, "special"),
|
|
1381
|
+
let n = e.getAttributeNames(), r = e.tagName.toLowerCase(), o = t.stylize(`<${r}`, "special"), i = t.stylize(">", "special"), s = t.stylize(
|
|
1380
1382
|
`</${r}>`, "special");
|
|
1381
1383
|
t.truncate -= r.length * 2 + 5;
|
|
1382
1384
|
let a = "";
|
|
1383
|
-
n.length > 0 && (a += " ", a += j(n.map((p) => [p, e.getAttribute(p)]), t,
|
|
1385
|
+
n.length > 0 && (a += " ", a += j(n.map((p) => [p, e.getAttribute(p)]), t, ti, " ")), t.truncate -= a.length;
|
|
1384
1386
|
let l = t.truncate, m = We(e.children, t);
|
|
1385
|
-
return m && m.length > l && (m = `${ue}(${e.children.length})`), `${o}${a}${
|
|
1387
|
+
return m && m.length > l && (m = `${ue}(${e.children.length})`), `${o}${a}${i}${m}${s}`;
|
|
1386
1388
|
}
|
|
1387
1389
|
c(Ve, "inspectHTML");
|
|
1388
1390
|
|
|
1389
1391
|
// ../node_modules/loupe/lib/index.js
|
|
1390
|
-
var
|
|
1392
|
+
var ni = typeof Symbol == "function" && typeof Symbol.for == "function", bt = ni ? Symbol.for("chai/inspect") : "@@chai/inspect", Se = !1;
|
|
1391
1393
|
try {
|
|
1392
1394
|
let e = require("util");
|
|
1393
1395
|
Se = e.inspect ? e.inspect.custom : !1;
|
|
@@ -1435,44 +1437,44 @@ var Cn = /* @__PURE__ */ new WeakMap(), On = {}, $n = {
|
|
|
1435
1437
|
Error: dt,
|
|
1436
1438
|
HTMLCollection: We,
|
|
1437
1439
|
NodeList: We
|
|
1438
|
-
},
|
|
1440
|
+
}, ri = /* @__PURE__ */ c((e, t, n) => bt in e && typeof e[bt] == "function" ? e[bt](t) : Se && Se in e && typeof e[Se] == "function" ? e[Se](
|
|
1439
1441
|
t.depth, t) : "inspect" in e && typeof e.inspect == "function" ? e.inspect(t.depth, t) : "constructor" in e && Cn.has(e.constructor) ? Cn.get(
|
|
1440
|
-
e.constructor)(e, t) : On[n] ? On[n](e, t) : "", "inspectCustom"),
|
|
1442
|
+
e.constructor)(e, t) : On[n] ? On[n](e, t) : "", "inspectCustom"), oi = Object.prototype.toString;
|
|
1441
1443
|
function qe(e, t = {}) {
|
|
1442
1444
|
let n = Sn(t, qe), { customInspect: r } = n, o = e === null ? "null" : typeof e;
|
|
1443
|
-
if (o === "object" && (o =
|
|
1445
|
+
if (o === "object" && (o = oi.call(e).slice(8, -1)), o in $n)
|
|
1444
1446
|
return $n[o](e, n);
|
|
1445
1447
|
if (r && e) {
|
|
1446
|
-
let
|
|
1447
|
-
if (
|
|
1448
|
-
return typeof
|
|
1448
|
+
let s = ri(e, n, o);
|
|
1449
|
+
if (s)
|
|
1450
|
+
return typeof s == "string" ? s : qe(s, n);
|
|
1449
1451
|
}
|
|
1450
|
-
let
|
|
1451
|
-
return
|
|
1452
|
+
let i = e ? Object.getPrototypeOf(e) : !1;
|
|
1453
|
+
return i === Object.prototype || i === null ? pe(e, n) : e && typeof HTMLElement == "function" && e instanceof HTMLElement ? Ve(e, n) : "c\
|
|
1452
1454
|
onstructor" in e ? e.constructor !== Object ? ht(e, n) : pe(e, n) : e === Object(e) ? pe(e, n) : n.stylize(String(e), o);
|
|
1453
1455
|
}
|
|
1454
1456
|
c(qe, "inspect");
|
|
1455
1457
|
|
|
1456
1458
|
// ../node_modules/@vitest/utils/dist/chunk-_commonjsHelpers.js
|
|
1457
|
-
var { AsymmetricMatcher:
|
|
1458
|
-
|
|
1459
|
-
|
|
1460
|
-
|
|
1461
|
-
|
|
1462
|
-
|
|
1463
|
-
|
|
1459
|
+
var { AsymmetricMatcher: si, DOMCollection: ci, DOMElement: ui, Immutable: li, ReactElement: ai, ReactTestComponent: fi } = $e, wn = [
|
|
1460
|
+
fi,
|
|
1461
|
+
ai,
|
|
1462
|
+
ui,
|
|
1463
|
+
ci,
|
|
1464
|
+
li,
|
|
1465
|
+
si
|
|
1464
1466
|
];
|
|
1465
1467
|
function ge(e, t = 10, { maxLength: n, ...r } = {}) {
|
|
1466
|
-
let o = n ?? 1e4,
|
|
1468
|
+
let o = n ?? 1e4, i;
|
|
1467
1469
|
try {
|
|
1468
|
-
|
|
1470
|
+
i = Q(e, {
|
|
1469
1471
|
maxDepth: t,
|
|
1470
1472
|
escapeString: !1,
|
|
1471
1473
|
plugins: wn,
|
|
1472
1474
|
...r
|
|
1473
1475
|
});
|
|
1474
1476
|
} catch {
|
|
1475
|
-
|
|
1477
|
+
i = Q(e, {
|
|
1476
1478
|
callToJSON: !1,
|
|
1477
1479
|
maxDepth: t,
|
|
1478
1480
|
escapeString: !1,
|
|
@@ -1480,44 +1482,44 @@ function ge(e, t = 10, { maxLength: n, ...r } = {}) {
|
|
|
1480
1482
|
...r
|
|
1481
1483
|
});
|
|
1482
1484
|
}
|
|
1483
|
-
return
|
|
1485
|
+
return i.length >= o && t > 1 ? ge(e, Math.floor(Math.min(t, Number.MAX_SAFE_INTEGER) / 2), {
|
|
1484
1486
|
maxLength: n,
|
|
1485
1487
|
...r
|
|
1486
|
-
}) :
|
|
1488
|
+
}) : i;
|
|
1487
1489
|
}
|
|
1488
1490
|
c(ge, "stringify");
|
|
1489
|
-
var
|
|
1491
|
+
var mi = /%[sdjifoOc%]/g;
|
|
1490
1492
|
function An(...e) {
|
|
1491
1493
|
if (typeof e[0] != "string") {
|
|
1492
|
-
let
|
|
1493
|
-
for (let
|
|
1494
|
-
|
|
1494
|
+
let i = [];
|
|
1495
|
+
for (let s = 0; s < e.length; s++)
|
|
1496
|
+
i.push(we(e[s], {
|
|
1495
1497
|
depth: 0,
|
|
1496
1498
|
colors: !1
|
|
1497
1499
|
}));
|
|
1498
|
-
return
|
|
1500
|
+
return i.join(" ");
|
|
1499
1501
|
}
|
|
1500
|
-
let t = e.length, n = 1, r = e[0], o = String(r).replace(
|
|
1501
|
-
if (
|
|
1502
|
+
let t = e.length, n = 1, r = e[0], o = String(r).replace(mi, (i) => {
|
|
1503
|
+
if (i === "%%")
|
|
1502
1504
|
return "%";
|
|
1503
1505
|
if (n >= t)
|
|
1504
|
-
return
|
|
1505
|
-
switch (
|
|
1506
|
+
return i;
|
|
1507
|
+
switch (i) {
|
|
1506
1508
|
case "%s": {
|
|
1507
|
-
let
|
|
1508
|
-
return typeof
|
|
1509
|
-
null ? typeof
|
|
1509
|
+
let s = e[n++];
|
|
1510
|
+
return typeof s == "bigint" ? `${s.toString()}n` : typeof s == "number" && s === 0 && 1 / s < 0 ? "-0" : typeof s == "object" && s !==
|
|
1511
|
+
null ? typeof s.toString == "function" && s.toString !== Object.prototype.toString ? s.toString() : we(s, {
|
|
1510
1512
|
depth: 0,
|
|
1511
1513
|
colors: !1
|
|
1512
|
-
}) : String(
|
|
1514
|
+
}) : String(s);
|
|
1513
1515
|
}
|
|
1514
1516
|
case "%d": {
|
|
1515
|
-
let
|
|
1516
|
-
return typeof
|
|
1517
|
+
let s = e[n++];
|
|
1518
|
+
return typeof s == "bigint" ? `${s.toString()}n` : Number(s).toString();
|
|
1517
1519
|
}
|
|
1518
1520
|
case "%i": {
|
|
1519
|
-
let
|
|
1520
|
-
return typeof
|
|
1521
|
+
let s = e[n++];
|
|
1522
|
+
return typeof s == "bigint" ? `${s.toString()}n` : Number.parseInt(String(s)).toString();
|
|
1521
1523
|
}
|
|
1522
1524
|
case "%f":
|
|
1523
1525
|
return Number.parseFloat(String(e[n++])).toString();
|
|
@@ -1533,18 +1535,18 @@ function An(...e) {
|
|
|
1533
1535
|
case "%j":
|
|
1534
1536
|
try {
|
|
1535
1537
|
return JSON.stringify(e[n++]);
|
|
1536
|
-
} catch (
|
|
1537
|
-
let a =
|
|
1538
|
+
} catch (s) {
|
|
1539
|
+
let a = s.message;
|
|
1538
1540
|
if (a.includes("circular structure") || a.includes("cyclic structures") || a.includes("cyclic object"))
|
|
1539
1541
|
return "[Circular]";
|
|
1540
|
-
throw
|
|
1542
|
+
throw s;
|
|
1541
1543
|
}
|
|
1542
1544
|
default:
|
|
1543
|
-
return
|
|
1545
|
+
return i;
|
|
1544
1546
|
}
|
|
1545
1547
|
});
|
|
1546
|
-
for (let
|
|
1547
|
-
|
|
1548
|
+
for (let i = e[n]; n < t; i = e[++n])
|
|
1549
|
+
i === null || typeof i != "object" ? o += ` ${i}` : o += ` ${we(i)}`;
|
|
1548
1550
|
return o;
|
|
1549
1551
|
}
|
|
1550
1552
|
c(An, "format");
|
|
@@ -1558,22 +1560,22 @@ function Rn(e) {
|
|
|
1558
1560
|
c(Rn, "getDefaultExportFromCjs");
|
|
1559
1561
|
|
|
1560
1562
|
// ../node_modules/@vitest/utils/dist/helpers.js
|
|
1561
|
-
function
|
|
1563
|
+
function pi(e) {
|
|
1562
1564
|
return e === Object.prototype || e === Function.prototype || e === RegExp.prototype;
|
|
1563
1565
|
}
|
|
1564
|
-
c(
|
|
1566
|
+
c(pi, "isFinalObj");
|
|
1565
1567
|
function Ke(e) {
|
|
1566
1568
|
return Object.prototype.toString.apply(e).slice(8, -1);
|
|
1567
1569
|
}
|
|
1568
1570
|
c(Ke, "getType");
|
|
1569
|
-
function
|
|
1571
|
+
function gi(e, t) {
|
|
1570
1572
|
let n = typeof t == "function" ? t : (r) => t.add(r);
|
|
1571
1573
|
Object.getOwnPropertyNames(e).forEach(n), Object.getOwnPropertySymbols(e).forEach(n);
|
|
1572
1574
|
}
|
|
1573
|
-
c(
|
|
1575
|
+
c(gi, "collectOwnProperties");
|
|
1574
1576
|
function Et(e) {
|
|
1575
1577
|
let t = /* @__PURE__ */ new Set();
|
|
1576
|
-
return
|
|
1578
|
+
return pi(e) ? [] : (gi(e, t), Array.from(t));
|
|
1577
1579
|
}
|
|
1578
1580
|
c(Et, "getOwnProperties");
|
|
1579
1581
|
var Nn = { forceWritable: !1 };
|
|
@@ -1592,23 +1594,23 @@ function St(e, t, n = Nn) {
|
|
|
1592
1594
|
}
|
|
1593
1595
|
if (Object.prototype.toString.call(e) === "[object Object]") {
|
|
1594
1596
|
o = Object.create(Object.getPrototypeOf(e)), t.set(e, o);
|
|
1595
|
-
let
|
|
1596
|
-
for (let
|
|
1597
|
-
let a = Object.getOwnPropertyDescriptor(e,
|
|
1597
|
+
let i = Et(e);
|
|
1598
|
+
for (let s of i) {
|
|
1599
|
+
let a = Object.getOwnPropertyDescriptor(e, s);
|
|
1598
1600
|
if (!a)
|
|
1599
1601
|
continue;
|
|
1600
|
-
let l = St(e[
|
|
1601
|
-
n.forceWritable ? Object.defineProperty(o,
|
|
1602
|
+
let l = St(e[s], t, n);
|
|
1603
|
+
n.forceWritable ? Object.defineProperty(o, s, {
|
|
1602
1604
|
enumerable: a.enumerable,
|
|
1603
1605
|
configurable: !0,
|
|
1604
1606
|
writable: !0,
|
|
1605
1607
|
value: l
|
|
1606
|
-
}) : "get" in a ? Object.defineProperty(o,
|
|
1608
|
+
}) : "get" in a ? Object.defineProperty(o, s, {
|
|
1607
1609
|
...a,
|
|
1608
1610
|
get() {
|
|
1609
1611
|
return l;
|
|
1610
1612
|
}
|
|
1611
|
-
}) : Object.defineProperty(o,
|
|
1613
|
+
}) : Object.defineProperty(o, s, {
|
|
1612
1614
|
...a,
|
|
1613
1615
|
value: l
|
|
1614
1616
|
});
|
|
@@ -1630,21 +1632,21 @@ var U = -1, k = 1, x = 0, I = class {
|
|
|
1630
1632
|
this[0] = t, this[1] = n;
|
|
1631
1633
|
}
|
|
1632
1634
|
};
|
|
1633
|
-
function
|
|
1635
|
+
function hi(e, t) {
|
|
1634
1636
|
if (!e || !t || e.charAt(0) !== t.charAt(0))
|
|
1635
1637
|
return 0;
|
|
1636
|
-
let n = 0, r = Math.min(e.length, t.length), o = r,
|
|
1638
|
+
let n = 0, r = Math.min(e.length, t.length), o = r, i = 0;
|
|
1637
1639
|
for (; n < o; )
|
|
1638
|
-
e.substring(
|
|
1640
|
+
e.substring(i, o) === t.substring(i, o) ? (n = o, i = n) : r = o, o = Math.floor((r - n) / 2 + n);
|
|
1639
1641
|
return o;
|
|
1640
1642
|
}
|
|
1641
|
-
c(
|
|
1643
|
+
c(hi, "diff_commonPrefix");
|
|
1642
1644
|
function qn(e, t) {
|
|
1643
1645
|
if (!e || !t || e.charAt(e.length - 1) !== t.charAt(t.length - 1))
|
|
1644
1646
|
return 0;
|
|
1645
|
-
let n = 0, r = Math.min(e.length, t.length), o = r,
|
|
1647
|
+
let n = 0, r = Math.min(e.length, t.length), o = r, i = 0;
|
|
1646
1648
|
for (; n < o; )
|
|
1647
|
-
e.substring(e.length - o, e.length -
|
|
1649
|
+
e.substring(e.length - o, e.length - i) === t.substring(t.length - o, t.length - i) ? (n = o, i = n) : r = o, o = Math.floor((r - n) / 2 +
|
|
1648
1650
|
n);
|
|
1649
1651
|
return o;
|
|
1650
1652
|
}
|
|
@@ -1657,71 +1659,71 @@ function Pn(e, t) {
|
|
|
1657
1659
|
let o = Math.min(n, r);
|
|
1658
1660
|
if (e === t)
|
|
1659
1661
|
return o;
|
|
1660
|
-
let
|
|
1662
|
+
let i = 0, s = 1;
|
|
1661
1663
|
for (; ; ) {
|
|
1662
|
-
let a = e.substring(o -
|
|
1664
|
+
let a = e.substring(o - s), l = t.indexOf(a);
|
|
1663
1665
|
if (l === -1)
|
|
1664
|
-
return
|
|
1665
|
-
|
|
1666
|
+
return i;
|
|
1667
|
+
s += l, (l === 0 || e.substring(o - s) === t.substring(0, s)) && (i = s, s++);
|
|
1666
1668
|
}
|
|
1667
1669
|
}
|
|
1668
1670
|
c(Pn, "diff_commonOverlap_");
|
|
1669
|
-
function
|
|
1670
|
-
let t = !1, n = [], r = 0, o = null,
|
|
1671
|
-
for (;
|
|
1672
|
-
e[
|
|
1673
|
-
o.length <= Math.max(
|
|
1674
|
-
0 ? n[r - 1] : -1,
|
|
1675
|
-
for (t && Kn(e),
|
|
1676
|
-
if (e[
|
|
1677
|
-
let p = e[
|
|
1678
|
-
b >= y ? (b >= p.length / 2 || b >= f.length / 2) && (e.splice(
|
|
1679
|
-
b), e[
|
|
1680
|
-
1][0] = k, e[
|
|
1671
|
+
function yi(e) {
|
|
1672
|
+
let t = !1, n = [], r = 0, o = null, i = 0, s = 0, a = 0, l = 0, m = 0;
|
|
1673
|
+
for (; i < e.length; )
|
|
1674
|
+
e[i][0] === x ? (n[r++] = i, s = l, a = m, l = 0, m = 0, o = e[i][1]) : (e[i][0] === k ? l += e[i][1].length : m += e[i][1].length, o &&
|
|
1675
|
+
o.length <= Math.max(s, a) && o.length <= Math.max(l, m) && (e.splice(n[r - 1], 0, new I(U, o)), e[n[r - 1] + 1][0] = k, r--, r--, i = r >
|
|
1676
|
+
0 ? n[r - 1] : -1, s = 0, a = 0, l = 0, m = 0, o = null, t = !0)), i++;
|
|
1677
|
+
for (t && Kn(e), Si(e), i = 1; i < e.length; ) {
|
|
1678
|
+
if (e[i - 1][0] === U && e[i][0] === k) {
|
|
1679
|
+
let p = e[i - 1][1], f = e[i][1], b = Pn(p, f), y = Pn(f, p);
|
|
1680
|
+
b >= y ? (b >= p.length / 2 || b >= f.length / 2) && (e.splice(i, 0, new I(x, f.substring(0, b))), e[i - 1][1] = p.substring(0, p.length -
|
|
1681
|
+
b), e[i + 1][1] = f.substring(b), i++) : (y >= p.length / 2 || y >= f.length / 2) && (e.splice(i, 0, new I(x, p.substring(0, y))), e[i -
|
|
1682
|
+
1][0] = k, e[i - 1][1] = f.substring(0, f.length - y), e[i + 1][0] = U, e[i + 1][1] = p.substring(y), i++), i++;
|
|
1681
1683
|
}
|
|
1682
|
-
|
|
1684
|
+
i++;
|
|
1683
1685
|
}
|
|
1684
1686
|
}
|
|
1685
|
-
c(
|
|
1686
|
-
var In = /[^a-z0-9]/i, Mn = /\s/, Ln = /[\r\n]/,
|
|
1687
|
-
function
|
|
1687
|
+
c(yi, "diff_cleanupSemantic");
|
|
1688
|
+
var In = /[^a-z0-9]/i, Mn = /\s/, Ln = /[\r\n]/, di = /\n\r?\n$/, bi = /^\r?\n\r?\n/;
|
|
1689
|
+
function Si(e) {
|
|
1688
1690
|
let t = 1;
|
|
1689
1691
|
for (; t < e.length - 1; ) {
|
|
1690
1692
|
if (e[t - 1][0] === x && e[t + 1][0] === x) {
|
|
1691
|
-
let n = e[t - 1][1], r = e[t][1], o = e[t + 1][1],
|
|
1692
|
-
if (
|
|
1693
|
-
let p = r.substring(r.length -
|
|
1694
|
-
n = n.substring(0, n.length -
|
|
1693
|
+
let n = e[t - 1][1], r = e[t][1], o = e[t + 1][1], i = qn(n, r);
|
|
1694
|
+
if (i) {
|
|
1695
|
+
let p = r.substring(r.length - i);
|
|
1696
|
+
n = n.substring(0, n.length - i), r = p + r.substring(0, r.length - i), o = p + o;
|
|
1695
1697
|
}
|
|
1696
|
-
let
|
|
1698
|
+
let s = n, a = r, l = o, m = Ge(n, r) + Ge(r, o);
|
|
1697
1699
|
for (; r.charAt(0) === o.charAt(0); ) {
|
|
1698
1700
|
n += r.charAt(0), r = r.substring(1) + o.charAt(0), o = o.substring(1);
|
|
1699
1701
|
let p = Ge(n, r) + Ge(r, o);
|
|
1700
|
-
p >= m && (m = p,
|
|
1702
|
+
p >= m && (m = p, s = n, a = r, l = o);
|
|
1701
1703
|
}
|
|
1702
|
-
e[t - 1][1] !==
|
|
1704
|
+
e[t - 1][1] !== s && (s ? e[t - 1][1] = s : (e.splice(t - 1, 1), t--), e[t][1] = a, l ? e[t + 1][1] = l : (e.splice(t + 1, 1), t--));
|
|
1703
1705
|
}
|
|
1704
1706
|
t++;
|
|
1705
1707
|
}
|
|
1706
1708
|
}
|
|
1707
|
-
c(
|
|
1709
|
+
c(Si, "diff_cleanupSemanticLossless");
|
|
1708
1710
|
function Kn(e) {
|
|
1709
1711
|
e.push(new I(x, ""));
|
|
1710
|
-
let t = 0, n = 0, r = 0, o = "",
|
|
1712
|
+
let t = 0, n = 0, r = 0, o = "", i = "", s;
|
|
1711
1713
|
for (; t < e.length; )
|
|
1712
1714
|
switch (e[t][0]) {
|
|
1713
1715
|
case k:
|
|
1714
|
-
r++,
|
|
1716
|
+
r++, i += e[t][1], t++;
|
|
1715
1717
|
break;
|
|
1716
1718
|
case U:
|
|
1717
1719
|
n++, o += e[t][1], t++;
|
|
1718
1720
|
break;
|
|
1719
1721
|
case x:
|
|
1720
|
-
n + r > 1 ? (n !== 0 && r !== 0 && (
|
|
1721
|
-
substring(0,
|
|
1722
|
-
(e[t][1] =
|
|
1723
|
-
splice(t, n + r), o.length && (e.splice(t, 0, new I(U, o)), t++),
|
|
1724
|
-
1][0] === x ? (e[t - 1][1] += e[t][1], e.splice(t, 1)) : t++, r = 0, n = 0, o = "",
|
|
1722
|
+
n + r > 1 ? (n !== 0 && r !== 0 && (s = hi(i, o), s !== 0 && (t - n - r > 0 && e[t - n - r - 1][0] === x ? e[t - n - r - 1][1] += i.
|
|
1723
|
+
substring(0, s) : (e.splice(0, 0, new I(x, i.substring(0, s))), t++), i = i.substring(s), o = o.substring(s)), s = qn(i, o), s !== 0 &&
|
|
1724
|
+
(e[t][1] = i.substring(i.length - s) + e[t][1], i = i.substring(0, i.length - s), o = o.substring(0, o.length - s))), t -= n + r, e.
|
|
1725
|
+
splice(t, n + r), o.length && (e.splice(t, 0, new I(U, o)), t++), i.length && (e.splice(t, 0, new I(k, i)), t++), t++) : t !== 0 && e[t -
|
|
1726
|
+
1][0] === x ? (e[t - 1][1] += e[t][1], e.splice(t, 1)) : t++, r = 0, n = 0, o = "", i = "";
|
|
1725
1727
|
break;
|
|
1726
1728
|
}
|
|
1727
1729
|
e[e.length - 1][1] === "" && e.pop();
|
|
@@ -1737,14 +1739,14 @@ c(Kn, "diff_cleanupMerge");
|
|
|
1737
1739
|
function Ge(e, t) {
|
|
1738
1740
|
if (!e || !t)
|
|
1739
1741
|
return 6;
|
|
1740
|
-
let n = e.charAt(e.length - 1), r = t.charAt(0), o = n.match(In),
|
|
1741
|
-
match(Ln), m = a && r.match(Ln), p = l && e.match(
|
|
1742
|
-
return p || f ? 5 : l || m ? 4 : o && !
|
|
1742
|
+
let n = e.charAt(e.length - 1), r = t.charAt(0), o = n.match(In), i = r.match(In), s = o && n.match(Mn), a = i && r.match(Mn), l = s && n.
|
|
1743
|
+
match(Ln), m = a && r.match(Ln), p = l && e.match(di), f = m && t.match(bi);
|
|
1744
|
+
return p || f ? 5 : l || m ? 4 : o && !s && a ? 3 : s || a ? 2 : o || i ? 1 : 0;
|
|
1743
1745
|
}
|
|
1744
1746
|
c(Ge, "diff_cleanupSemanticScore_");
|
|
1745
|
-
var Gn = "Compared values have no visual difference.",
|
|
1747
|
+
var Gn = "Compared values have no visual difference.", Ei = "Compared values serialize to the same structure.\nPrinting internal object struc\
|
|
1746
1748
|
ture without calling `toJSON` instead.", He = {}, xn;
|
|
1747
|
-
function
|
|
1749
|
+
function _i() {
|
|
1748
1750
|
if (xn) return He;
|
|
1749
1751
|
xn = 1, Object.defineProperty(He, "__esModule", {
|
|
1750
1752
|
value: !0
|
|
@@ -1777,7 +1779,7 @@ function _s() {
|
|
|
1777
1779
|
T = _[d], _[d] = $ + n($ + 1, g, h + $ - E + 1, u, S);
|
|
1778
1780
|
}
|
|
1779
1781
|
return O;
|
|
1780
|
-
}, "extendPathsF"),
|
|
1782
|
+
}, "extendPathsF"), i = /* @__PURE__ */ c((y, g, u, h, S, _, O) => {
|
|
1781
1783
|
let d = 0, E = y, $ = _[d], T = $;
|
|
1782
1784
|
_[d] -= r(
|
|
1783
1785
|
g,
|
|
@@ -1801,30 +1803,30 @@ function _s() {
|
|
|
1801
1803
|
);
|
|
1802
1804
|
}
|
|
1803
1805
|
return O;
|
|
1804
|
-
}, "extendPathsR"),
|
|
1806
|
+
}, "extendPathsR"), s = /* @__PURE__ */ c((y, g, u, h, S, _, O, d, E, $, T) => {
|
|
1805
1807
|
let R = h - g, J = u - g, L = S - h - J, z = -L - (y - 1), X = -L + (y - 1), V = t, M = y < d ? y : d;
|
|
1806
|
-
for (let
|
|
1807
|
-
let Z =
|
|
1808
|
+
for (let D = 0, F = -y; D <= M; D += 1, F += 2) {
|
|
1809
|
+
let Z = D === 0 || D !== y && V < O[D], B = Z ? O[D] : V, K = Z ? B : B + 1, ie = R + K - F, G = n(
|
|
1808
1810
|
K + 1,
|
|
1809
1811
|
u,
|
|
1810
|
-
|
|
1812
|
+
ie + 1,
|
|
1811
1813
|
S,
|
|
1812
1814
|
_
|
|
1813
1815
|
), H = K + G;
|
|
1814
|
-
if (V = O[
|
|
1815
|
-
let ce = (y - 1 - (
|
|
1816
|
+
if (V = O[D], O[D] = H, z <= F && F <= X) {
|
|
1817
|
+
let ce = (y - 1 - (F + L)) / 2;
|
|
1816
1818
|
if (ce <= $ && E[ce] - 1 <= H) {
|
|
1817
|
-
let v = R + B - (Z ?
|
|
1819
|
+
let v = R + B - (Z ? F + 1 : F - 1), q = r(
|
|
1818
1820
|
g,
|
|
1819
1821
|
B,
|
|
1820
1822
|
h,
|
|
1821
1823
|
v,
|
|
1822
1824
|
_
|
|
1823
|
-
),
|
|
1825
|
+
), se = B - q, de = v - q, ae = se + 1, Te = de + 1;
|
|
1824
1826
|
T.nChangePreceding = y - 1, y - 1 === ae + Te - g - h ? (T.aEndPreceding = g, T.bEndPreceding = h) : (T.aEndPreceding = ae, T.bEndPreceding =
|
|
1825
1827
|
Te), T.nCommonPreceding = q, q !== 0 && (T.aCommonPreceding = ae, T.bCommonPreceding = Te), T.nCommonFollowing = G, G !== 0 && (T.
|
|
1826
|
-
aCommonFollowing = K + 1, T.bCommonFollowing =
|
|
1827
|
-
let Ae = H + 1, Re =
|
|
1828
|
+
aCommonFollowing = K + 1, T.bCommonFollowing = ie + 1);
|
|
1829
|
+
let Ae = H + 1, Re = ie + G + 1;
|
|
1828
1830
|
return T.nChangeFollowing = y - 1, y - 1 === u + S - Ae - Re ? (T.aStartFollowing = u, T.bStartFollowing = S) : (T.aStartFollowing =
|
|
1829
1831
|
Ae, T.bStartFollowing = Re), !0;
|
|
1830
1832
|
}
|
|
@@ -1833,31 +1835,31 @@ function _s() {
|
|
|
1833
1835
|
return !1;
|
|
1834
1836
|
}, "extendOverlappablePathsF"), a = /* @__PURE__ */ c((y, g, u, h, S, _, O, d, E, $, T) => {
|
|
1835
1837
|
let R = S - u, J = u - g, L = S - h - J, z = L - y, X = L + y, V = t, M = y < $ ? y : $;
|
|
1836
|
-
for (let
|
|
1837
|
-
let Z =
|
|
1838
|
+
for (let D = 0, F = y; D <= M; D += 1, F -= 2) {
|
|
1839
|
+
let Z = D === 0 || D !== y && E[D] < V, B = Z ? E[D] : V, K = Z ? B : B - 1, ie = R + K - F, G = r(
|
|
1838
1840
|
g,
|
|
1839
1841
|
K - 1,
|
|
1840
1842
|
h,
|
|
1841
|
-
|
|
1843
|
+
ie - 1,
|
|
1842
1844
|
_
|
|
1843
1845
|
), H = K - G;
|
|
1844
|
-
if (V = E[
|
|
1845
|
-
let ce = (y + (
|
|
1846
|
+
if (V = E[D], E[D] = H, z <= F && F <= X) {
|
|
1847
|
+
let ce = (y + (F - L)) / 2;
|
|
1846
1848
|
if (ce <= d && H - 1 <= O[ce]) {
|
|
1847
|
-
let v =
|
|
1849
|
+
let v = ie - G;
|
|
1848
1850
|
if (T.nChangePreceding = y, y === H + v - g - h ? (T.aEndPreceding = g, T.bEndPreceding = h) : (T.aEndPreceding = H, T.bEndPreceding =
|
|
1849
1851
|
v), T.nCommonPreceding = G, G !== 0 && (T.aCommonPreceding = H, T.bCommonPreceding = v), T.nChangeFollowing = y - 1, y === 1)
|
|
1850
1852
|
T.nCommonFollowing = 0, T.aStartFollowing = u, T.bStartFollowing = S;
|
|
1851
1853
|
else {
|
|
1852
|
-
let q = R + B - (Z ?
|
|
1854
|
+
let q = R + B - (Z ? F - 1 : F + 1), se = n(
|
|
1853
1855
|
B,
|
|
1854
1856
|
u,
|
|
1855
1857
|
q,
|
|
1856
1858
|
S,
|
|
1857
1859
|
_
|
|
1858
1860
|
);
|
|
1859
|
-
T.nCommonFollowing =
|
|
1860
|
-
let de = B +
|
|
1861
|
+
T.nCommonFollowing = se, se !== 0 && (T.aCommonFollowing = B, T.bCommonFollowing = q);
|
|
1862
|
+
let de = B + se, ae = q + se;
|
|
1861
1863
|
y - 1 === u + S - de - ae ? (T.aStartFollowing = u, T.bStartFollowing = S) : (T.aStartFollowing = de, T.bStartFollowing = ae);
|
|
1862
1864
|
}
|
|
1863
1865
|
return !0;
|
|
@@ -1871,7 +1873,7 @@ function _s() {
|
|
|
1871
1873
|
let X = (y || te) / 2, V = (R + J) / 2;
|
|
1872
1874
|
for (let M = 1; M <= V; M += 1)
|
|
1873
1875
|
if (L = o(M, u, S, $, _, O, L), M < X)
|
|
1874
|
-
z =
|
|
1876
|
+
z = i(M, g, h, T, _, d, z);
|
|
1875
1877
|
else if (
|
|
1876
1878
|
// If a reverse path overlaps a forward path in the same diagonal,
|
|
1877
1879
|
// return a division of the index intervals at the middle change.
|
|
@@ -1893,7 +1895,7 @@ function _s() {
|
|
|
1893
1895
|
} else {
|
|
1894
1896
|
let X = ((y || te) + 1) / 2, V = (R + J + 1) / 2, M = 1;
|
|
1895
1897
|
for (L = o(M, u, S, $, _, O, L), M += 1; M <= V; M += 1)
|
|
1896
|
-
if (z =
|
|
1898
|
+
if (z = i(
|
|
1897
1899
|
M - 1,
|
|
1898
1900
|
g,
|
|
1899
1901
|
h,
|
|
@@ -1906,7 +1908,7 @@ function _s() {
|
|
|
1906
1908
|
else if (
|
|
1907
1909
|
// If a forward path overlaps a reverse path in the same diagonal,
|
|
1908
1910
|
// return a division of the index intervals at the middle change.
|
|
1909
|
-
|
|
1911
|
+
s(
|
|
1910
1912
|
M,
|
|
1911
1913
|
g,
|
|
1912
1914
|
u,
|
|
@@ -1930,14 +1932,14 @@ function _s() {
|
|
|
1930
1932
|
if (_ = !_, _ && O.length === 1) {
|
|
1931
1933
|
let { foundSubsequence: H, isCommon: ce } = O[0];
|
|
1932
1934
|
O[1] = {
|
|
1933
|
-
foundSubsequence: /* @__PURE__ */ c((v, q,
|
|
1934
|
-
H(v,
|
|
1935
|
+
foundSubsequence: /* @__PURE__ */ c((v, q, se) => {
|
|
1936
|
+
H(v, se, q);
|
|
1935
1937
|
}, "foundSubsequence"),
|
|
1936
1938
|
isCommon: /* @__PURE__ */ c((v, q) => ce(q, v), "isCommon")
|
|
1937
1939
|
};
|
|
1938
1940
|
}
|
|
1939
|
-
let
|
|
1940
|
-
g = h, u = S, h =
|
|
1941
|
+
let ie = g, G = u;
|
|
1942
|
+
g = h, u = S, h = ie, S = G;
|
|
1941
1943
|
}
|
|
1942
1944
|
let { foundSubsequence: T, isCommon: R } = O[_ ? 1 : 0];
|
|
1943
1945
|
l(
|
|
@@ -1959,8 +1961,8 @@ function _s() {
|
|
|
1959
1961
|
aCommonPreceding: X,
|
|
1960
1962
|
bCommonPreceding: V,
|
|
1961
1963
|
nCommonFollowing: M,
|
|
1962
|
-
aCommonFollowing:
|
|
1963
|
-
bCommonFollowing:
|
|
1964
|
+
aCommonFollowing: D,
|
|
1965
|
+
bCommonFollowing: F,
|
|
1964
1966
|
nChangeFollowing: Z,
|
|
1965
1967
|
aStartFollowing: B,
|
|
1966
1968
|
bStartFollowing: K
|
|
@@ -1976,7 +1978,7 @@ function _s() {
|
|
|
1976
1978
|
d,
|
|
1977
1979
|
E,
|
|
1978
1980
|
$
|
|
1979
|
-
), z !== 0 && T(z, X, V), M !== 0 && T(M,
|
|
1981
|
+
), z !== 0 && T(z, X, V), M !== 0 && T(M, D, F), B < u && K < S && m(
|
|
1980
1982
|
Z,
|
|
1981
1983
|
B,
|
|
1982
1984
|
u,
|
|
@@ -2045,54 +2047,54 @@ function _s() {
|
|
|
2045
2047
|
}
|
|
2046
2048
|
return c(b, "diffSequence"), He;
|
|
2047
2049
|
}
|
|
2048
|
-
c(
|
|
2049
|
-
var
|
|
2050
|
-
function
|
|
2050
|
+
c(_i, "requireBuild");
|
|
2051
|
+
var Ti = _i(), Hn = /* @__PURE__ */ Rn(Ti);
|
|
2052
|
+
function Ci(e, t) {
|
|
2051
2053
|
return e.replace(/\s+$/, (n) => t(n));
|
|
2052
2054
|
}
|
|
2053
|
-
c(
|
|
2054
|
-
function Rt(e, t, n, r, o,
|
|
2055
|
-
return e.length !== 0 ? n(`${r} ${
|
|
2055
|
+
c(Ci, "formatTrailingSpaces");
|
|
2056
|
+
function Rt(e, t, n, r, o, i) {
|
|
2057
|
+
return e.length !== 0 ? n(`${r} ${Ci(e, o)}`) : r !== " " ? n(r) : t && i.length !== 0 ? n(`${r} ${i}`) : "";
|
|
2056
2058
|
}
|
|
2057
2059
|
c(Rt, "printDiffLine");
|
|
2058
|
-
function Jn(e, t, { aColor: n, aIndicator: r, changeLineTrailingSpaceColor: o, emptyFirstOrLastLinePlaceholder:
|
|
2059
|
-
return Rt(e, t, n, r, o,
|
|
2060
|
+
function Jn(e, t, { aColor: n, aIndicator: r, changeLineTrailingSpaceColor: o, emptyFirstOrLastLinePlaceholder: i }) {
|
|
2061
|
+
return Rt(e, t, n, r, o, i);
|
|
2060
2062
|
}
|
|
2061
2063
|
c(Jn, "printDeleteLine");
|
|
2062
|
-
function Xn(e, t, { bColor: n, bIndicator: r, changeLineTrailingSpaceColor: o, emptyFirstOrLastLinePlaceholder:
|
|
2063
|
-
return Rt(e, t, n, r, o,
|
|
2064
|
+
function Xn(e, t, { bColor: n, bIndicator: r, changeLineTrailingSpaceColor: o, emptyFirstOrLastLinePlaceholder: i }) {
|
|
2065
|
+
return Rt(e, t, n, r, o, i);
|
|
2064
2066
|
}
|
|
2065
2067
|
c(Xn, "printInsertLine");
|
|
2066
|
-
function Zn(e, t, { commonColor: n, commonIndicator: r, commonLineTrailingSpaceColor: o, emptyFirstOrLastLinePlaceholder:
|
|
2067
|
-
return Rt(e, t, n, r, o,
|
|
2068
|
+
function Zn(e, t, { commonColor: n, commonIndicator: r, commonLineTrailingSpaceColor: o, emptyFirstOrLastLinePlaceholder: i }) {
|
|
2069
|
+
return Rt(e, t, n, r, o, i);
|
|
2068
2070
|
}
|
|
2069
2071
|
c(Zn, "printCommonLine");
|
|
2070
|
-
function
|
|
2072
|
+
function Dn(e, t, n, r, { patchColor: o }) {
|
|
2071
2073
|
return o(`@@ -${e + 1},${t - e} +${n + 1},${r - n} @@`);
|
|
2072
2074
|
}
|
|
2073
|
-
c(
|
|
2074
|
-
function
|
|
2075
|
-
let n = e.length, r = t.contextLines, o = r + r,
|
|
2075
|
+
c(Dn, "createPatchMark");
|
|
2076
|
+
function Oi(e, t) {
|
|
2077
|
+
let n = e.length, r = t.contextLines, o = r + r, i = n, s = !1, a = 0, l = 0;
|
|
2076
2078
|
for (; l !== n; ) {
|
|
2077
2079
|
let d = l;
|
|
2078
2080
|
for (; l !== n && e[l][0] === x; )
|
|
2079
2081
|
l += 1;
|
|
2080
2082
|
if (d !== l)
|
|
2081
2083
|
if (d === 0)
|
|
2082
|
-
l > r && (
|
|
2084
|
+
l > r && (i -= l - r, s = !0);
|
|
2083
2085
|
else if (l === n) {
|
|
2084
2086
|
let E = l - d;
|
|
2085
|
-
E > r && (
|
|
2087
|
+
E > r && (i -= E - r, s = !0);
|
|
2086
2088
|
} else {
|
|
2087
2089
|
let E = l - d;
|
|
2088
|
-
E > o && (
|
|
2090
|
+
E > o && (i -= E - o, a += 1);
|
|
2089
2091
|
}
|
|
2090
2092
|
for (; l !== n && e[l][0] !== x; )
|
|
2091
2093
|
l += 1;
|
|
2092
2094
|
}
|
|
2093
|
-
let m = a !== 0 ||
|
|
2094
|
-
a !== 0 ?
|
|
2095
|
-
let p =
|
|
2095
|
+
let m = a !== 0 || s;
|
|
2096
|
+
a !== 0 ? i += a + 1 : s && (i += 1);
|
|
2097
|
+
let p = i - 1, f = [], b = 0;
|
|
2096
2098
|
m && f.push("");
|
|
2097
2099
|
let y = 0, g = 0, u = 0, h = 0, S = /* @__PURE__ */ c((d) => {
|
|
2098
2100
|
let E = f.length;
|
|
@@ -2123,7 +2125,7 @@ function Os(e, t) {
|
|
|
2123
2125
|
let $ = d + r;
|
|
2124
2126
|
for (let R = d; R !== $; R += 1)
|
|
2125
2127
|
S(e[R][1]);
|
|
2126
|
-
f[b] =
|
|
2128
|
+
f[b] = Dn(y, u, g, h, t), b = f.length, f.push("");
|
|
2127
2129
|
let T = E - o;
|
|
2128
2130
|
y = u + T, g = h + T, u = y, h = g;
|
|
2129
2131
|
for (let R = l - r; R !== l; R += 1)
|
|
@@ -2137,27 +2139,27 @@ function Os(e, t) {
|
|
|
2137
2139
|
for (; l !== n && e[l][0] === k; )
|
|
2138
2140
|
O(e[l][1]), l += 1;
|
|
2139
2141
|
}
|
|
2140
|
-
return m && (f[b] =
|
|
2142
|
+
return m && (f[b] = Dn(y, u, g, h, t)), f.join(`
|
|
2141
2143
|
`);
|
|
2142
2144
|
}
|
|
2143
|
-
c(
|
|
2144
|
-
function $
|
|
2145
|
+
c(Oi, "joinAlignedDiffsNoExpand");
|
|
2146
|
+
function $i(e, t) {
|
|
2145
2147
|
return e.map((n, r, o) => {
|
|
2146
|
-
let
|
|
2148
|
+
let i = n[1], s = r === 0 || r === o.length - 1;
|
|
2147
2149
|
switch (n[0]) {
|
|
2148
2150
|
case U:
|
|
2149
|
-
return Jn(
|
|
2151
|
+
return Jn(i, s, t);
|
|
2150
2152
|
case k:
|
|
2151
|
-
return Xn(
|
|
2153
|
+
return Xn(i, s, t);
|
|
2152
2154
|
default:
|
|
2153
|
-
return Zn(
|
|
2155
|
+
return Zn(i, s, t);
|
|
2154
2156
|
}
|
|
2155
2157
|
}).join(`
|
|
2156
2158
|
`);
|
|
2157
2159
|
}
|
|
2158
|
-
c($
|
|
2159
|
-
var Tt = /* @__PURE__ */ c((e) => e, "noColor"), vn = 5,
|
|
2160
|
-
function
|
|
2160
|
+
c($i, "joinAlignedDiffsExpand");
|
|
2161
|
+
var Tt = /* @__PURE__ */ c((e) => e, "noColor"), vn = 5, wi = 0;
|
|
2162
|
+
function Ai() {
|
|
2161
2163
|
return {
|
|
2162
2164
|
aAnnotation: "Expected",
|
|
2163
2165
|
aColor: ne.green,
|
|
@@ -2178,26 +2180,26 @@ function As() {
|
|
|
2178
2180
|
omitAnnotationLines: !1,
|
|
2179
2181
|
patchColor: ne.yellow,
|
|
2180
2182
|
printBasicPrototype: !1,
|
|
2181
|
-
truncateThreshold:
|
|
2183
|
+
truncateThreshold: wi,
|
|
2182
2184
|
truncateAnnotation: "... Diff result is truncated",
|
|
2183
2185
|
truncateAnnotationColor: Tt
|
|
2184
2186
|
};
|
|
2185
2187
|
}
|
|
2186
|
-
c(
|
|
2187
|
-
function
|
|
2188
|
+
c(Ai, "getDefaultOptions");
|
|
2189
|
+
function Ri(e) {
|
|
2188
2190
|
return e && typeof e == "function" ? e : void 0;
|
|
2189
2191
|
}
|
|
2190
|
-
c(
|
|
2191
|
-
function
|
|
2192
|
+
c(Ri, "getCompareKeys");
|
|
2193
|
+
function Ni(e) {
|
|
2192
2194
|
return typeof e == "number" && Number.isSafeInteger(e) && e >= 0 ? e : vn;
|
|
2193
2195
|
}
|
|
2194
|
-
c(
|
|
2196
|
+
c(Ni, "getContextLines");
|
|
2195
2197
|
function he(e = {}) {
|
|
2196
2198
|
return {
|
|
2197
|
-
...
|
|
2199
|
+
...Ai(),
|
|
2198
2200
|
...e,
|
|
2199
|
-
compareKeys:
|
|
2200
|
-
contextLines:
|
|
2201
|
+
compareKeys: Ri(e.compareKeys),
|
|
2202
|
+
contextLines: Ni(e.contextLines)
|
|
2201
2203
|
};
|
|
2202
2204
|
}
|
|
2203
2205
|
c(he, "normalizeDiffOptions");
|
|
@@ -2205,7 +2207,7 @@ function Ee(e) {
|
|
|
2205
2207
|
return e.length === 1 && e[0].length === 0;
|
|
2206
2208
|
}
|
|
2207
2209
|
c(Ee, "isEmptyString");
|
|
2208
|
-
function
|
|
2210
|
+
function Pi(e) {
|
|
2209
2211
|
let t = 0, n = 0;
|
|
2210
2212
|
return e.forEach((r) => {
|
|
2211
2213
|
switch (r[0]) {
|
|
@@ -2221,38 +2223,38 @@ function Ps(e) {
|
|
|
2221
2223
|
b: n
|
|
2222
2224
|
};
|
|
2223
2225
|
}
|
|
2224
|
-
c(
|
|
2225
|
-
function
|
|
2226
|
+
c(Pi, "countChanges");
|
|
2227
|
+
function Ii({ aAnnotation: e, aColor: t, aIndicator: n, bAnnotation: r, bColor: o, bIndicator: i, includeChangeCounts: s, omitAnnotationLines: a }, l) {
|
|
2226
2228
|
if (a)
|
|
2227
2229
|
return "";
|
|
2228
2230
|
let m = "", p = "";
|
|
2229
|
-
if (
|
|
2231
|
+
if (s) {
|
|
2230
2232
|
let y = String(l.a), g = String(l.b), u = r.length - e.length, h = " ".repeat(Math.max(0, u)), S = " ".repeat(Math.max(0, -u)), _ = g.length -
|
|
2231
2233
|
y.length, O = " ".repeat(Math.max(0, _)), d = " ".repeat(Math.max(0, -_));
|
|
2232
|
-
m = `${h} ${n} ${O}${y}`, p = `${S} ${
|
|
2234
|
+
m = `${h} ${n} ${O}${y}`, p = `${S} ${i} ${d}${g}`;
|
|
2233
2235
|
}
|
|
2234
|
-
let f = `${n} ${e}${m}`, b = `${
|
|
2236
|
+
let f = `${n} ${e}${m}`, b = `${i} ${r}${p}`;
|
|
2235
2237
|
return `${t(f)}
|
|
2236
2238
|
${o(b)}
|
|
2237
2239
|
|
|
2238
2240
|
`;
|
|
2239
2241
|
}
|
|
2240
|
-
c(
|
|
2242
|
+
c(Ii, "printAnnotation");
|
|
2241
2243
|
function Nt(e, t, n) {
|
|
2242
|
-
return
|
|
2244
|
+
return Ii(n, Pi(e)) + (n.expand ? $i(e, n) : Oi(e, n)) + (t ? n.truncateAnnotationColor(`
|
|
2243
2245
|
${n.truncateAnnotation}`) : "");
|
|
2244
2246
|
}
|
|
2245
2247
|
c(Nt, "printDiffLines");
|
|
2246
2248
|
function Xe(e, t, n) {
|
|
2247
|
-
let r = he(n), [o,
|
|
2248
|
-
return Nt(o,
|
|
2249
|
+
let r = he(n), [o, i] = Qn(Ee(e) ? [] : e, Ee(t) ? [] : t, r);
|
|
2250
|
+
return Nt(o, i, r);
|
|
2249
2251
|
}
|
|
2250
2252
|
c(Xe, "diffLinesUnified");
|
|
2251
|
-
function
|
|
2253
|
+
function Mi(e, t, n, r, o) {
|
|
2252
2254
|
if (Ee(e) && Ee(n) && (e = [], n = []), Ee(t) && Ee(r) && (t = [], r = []), e.length !== n.length || t.length !== r.length)
|
|
2253
2255
|
return Xe(e, t, o);
|
|
2254
|
-
let [
|
|
2255
|
-
return
|
|
2256
|
+
let [i, s] = Qn(n, r, o), a = 0, l = 0;
|
|
2257
|
+
return i.forEach((m) => {
|
|
2256
2258
|
switch (m[0]) {
|
|
2257
2259
|
case U:
|
|
2258
2260
|
m[1] = e[a], a += 1;
|
|
@@ -2263,28 +2265,28 @@ function Ms(e, t, n, r, o) {
|
|
|
2263
2265
|
default:
|
|
2264
2266
|
m[1] = t[l], a += 1, l += 1;
|
|
2265
2267
|
}
|
|
2266
|
-
}), Nt(
|
|
2268
|
+
}), Nt(i, s, he(o));
|
|
2267
2269
|
}
|
|
2268
|
-
c(
|
|
2270
|
+
c(Mi, "diffLinesUnified2");
|
|
2269
2271
|
function Qn(e, t, n) {
|
|
2270
|
-
let r = n?.truncateThreshold ?? !1, o = Math.max(Math.floor(n?.truncateThreshold ?? 0), 0),
|
|
2271
|
-
Math.min(t.length, o) : t.length, a =
|
|
2272
|
+
let r = n?.truncateThreshold ?? !1, o = Math.max(Math.floor(n?.truncateThreshold ?? 0), 0), i = r ? Math.min(e.length, o) : e.length, s = r ?
|
|
2273
|
+
Math.min(t.length, o) : t.length, a = i !== e.length || s !== t.length, l = /* @__PURE__ */ c((y, g) => e[y] === t[g], "isCommon"), m = [],
|
|
2272
2274
|
p = 0, f = 0;
|
|
2273
|
-
for (Hn(
|
|
2275
|
+
for (Hn(i, s, l, /* @__PURE__ */ c((y, g, u) => {
|
|
2274
2276
|
for (; p !== g; p += 1)
|
|
2275
2277
|
m.push(new I(U, e[p]));
|
|
2276
2278
|
for (; f !== u; f += 1)
|
|
2277
2279
|
m.push(new I(k, t[f]));
|
|
2278
2280
|
for (; y !== 0; y -= 1, p += 1, f += 1)
|
|
2279
2281
|
m.push(new I(x, t[f]));
|
|
2280
|
-
}, "foundSubsequence")); p !==
|
|
2282
|
+
}, "foundSubsequence")); p !== i; p += 1)
|
|
2281
2283
|
m.push(new I(U, e[p]));
|
|
2282
|
-
for (; f !==
|
|
2284
|
+
for (; f !== s; f += 1)
|
|
2283
2285
|
m.push(new I(k, t[f]));
|
|
2284
2286
|
return [m, a];
|
|
2285
2287
|
}
|
|
2286
2288
|
c(Qn, "diffLinesRaw");
|
|
2287
|
-
function
|
|
2289
|
+
function Fn(e) {
|
|
2288
2290
|
if (e === void 0)
|
|
2289
2291
|
return "undefined";
|
|
2290
2292
|
if (e === null)
|
|
@@ -2317,7 +2319,7 @@ function Dn(e) {
|
|
|
2317
2319
|
return "symbol";
|
|
2318
2320
|
throw new Error(`value of unknown type: ${e}`);
|
|
2319
2321
|
}
|
|
2320
|
-
c(
|
|
2322
|
+
c(Fn, "getType");
|
|
2321
2323
|
function jn(e) {
|
|
2322
2324
|
return e.includes(`\r
|
|
2323
2325
|
`) ? `\r
|
|
@@ -2325,27 +2327,27 @@ function jn(e) {
|
|
|
2325
2327
|
`;
|
|
2326
2328
|
}
|
|
2327
2329
|
c(jn, "getNewLineSymbol");
|
|
2328
|
-
function
|
|
2329
|
-
let r = n?.truncateThreshold ?? !1, o = Math.max(Math.floor(n?.truncateThreshold ?? 0), 0),
|
|
2330
|
+
function Li(e, t, n) {
|
|
2331
|
+
let r = n?.truncateThreshold ?? !1, o = Math.max(Math.floor(n?.truncateThreshold ?? 0), 0), i = e.length, s = t.length;
|
|
2330
2332
|
if (r) {
|
|
2331
2333
|
let y = e.includes(`
|
|
2332
2334
|
`), g = t.includes(`
|
|
2333
2335
|
`), u = jn(e), h = jn(t), S = y ? `${e.split(u, o).join(u)}
|
|
2334
2336
|
` : e, _ = g ? `${t.split(h, o).join(h)}
|
|
2335
2337
|
` : t;
|
|
2336
|
-
|
|
2338
|
+
i = S.length, s = _.length;
|
|
2337
2339
|
}
|
|
2338
|
-
let a =
|
|
2339
|
-
return Hn(
|
|
2340
|
+
let a = i !== e.length || s !== t.length, l = /* @__PURE__ */ c((y, g) => e[y] === t[g], "isCommon"), m = 0, p = 0, f = [];
|
|
2341
|
+
return Hn(i, s, l, /* @__PURE__ */ c((y, g, u) => {
|
|
2340
2342
|
m !== g && f.push(new I(U, e.slice(m, g))), p !== u && f.push(new I(k, t.slice(p, u))), m = g + y, p = u + y, f.push(new I(x, t.slice(u,
|
|
2341
2343
|
p)));
|
|
2342
|
-
}, "foundSubsequence")), m !==
|
|
2344
|
+
}, "foundSubsequence")), m !== i && f.push(new I(U, e.slice(m))), p !== s && f.push(new I(k, t.slice(p))), [f, a];
|
|
2343
2345
|
}
|
|
2344
|
-
c(
|
|
2345
|
-
function
|
|
2346
|
+
c(Li, "diffStrings");
|
|
2347
|
+
function xi(e, t, n) {
|
|
2346
2348
|
return t.reduce((r, o) => r + (o[0] === x ? o[1] : o[0] === e && o[1].length !== 0 ? n(o[1]) : ""), "");
|
|
2347
2349
|
}
|
|
2348
|
-
c(
|
|
2350
|
+
c(xi, "concatenateRelevantDiffs");
|
|
2349
2351
|
var Je = class {
|
|
2350
2352
|
static {
|
|
2351
2353
|
c(this, "ChangeBuffer");
|
|
@@ -2361,7 +2363,7 @@ var Je = class {
|
|
|
2361
2363
|
this.pushDiff(new I(this.op, t));
|
|
2362
2364
|
}
|
|
2363
2365
|
pushLine() {
|
|
2364
|
-
this.lines.push(this.line.length !== 1 ? new I(this.op,
|
|
2366
|
+
this.lines.push(this.line.length !== 1 ? new I(this.op, xi(this.op, this.line, this.changeColor)) : this.line[0][0] === this.op ? this.line[0] :
|
|
2365
2367
|
new I(this.op, this.line[0][1])), this.line.length = 0;
|
|
2366
2368
|
}
|
|
2367
2369
|
isLineEmpty() {
|
|
@@ -2376,8 +2378,8 @@ var Je = class {
|
|
|
2376
2378
|
`)) {
|
|
2377
2379
|
let r = n.split(`
|
|
2378
2380
|
`), o = r.length - 1;
|
|
2379
|
-
r.forEach((
|
|
2380
|
-
|
|
2381
|
+
r.forEach((i, s) => {
|
|
2382
|
+
s < o ? (this.pushSubstring(i), this.pushLine()) : i.length !== 0 && this.pushSubstring(i);
|
|
2381
2383
|
});
|
|
2382
2384
|
} else
|
|
2383
2385
|
this.pushDiff(t);
|
|
@@ -2411,13 +2413,13 @@ var Je = class {
|
|
|
2411
2413
|
if (r.includes(`
|
|
2412
2414
|
`)) {
|
|
2413
2415
|
let o = r.split(`
|
|
2414
|
-
`),
|
|
2415
|
-
o.forEach((
|
|
2416
|
+
`), i = o.length - 1;
|
|
2417
|
+
o.forEach((s, a) => {
|
|
2416
2418
|
if (a === 0) {
|
|
2417
|
-
let l = new I(n,
|
|
2419
|
+
let l = new I(n, s);
|
|
2418
2420
|
this.deleteBuffer.isLineEmpty() && this.insertBuffer.isLineEmpty() ? (this.flushChangeLines(), this.pushDiffCommonLine(l)) : (this.
|
|
2419
2421
|
pushDiffChangeLines(l), this.flushChangeLines());
|
|
2420
|
-
} else a <
|
|
2422
|
+
} else a < i ? this.pushDiffCommonLine(new I(n, s)) : s.length !== 0 && this.pushDiffChangeLines(new I(n, s));
|
|
2421
2423
|
});
|
|
2422
2424
|
} else
|
|
2423
2425
|
this.pushDiffChangeLines(t);
|
|
@@ -2426,23 +2428,23 @@ var Je = class {
|
|
|
2426
2428
|
return this.flushChangeLines(), this.lines;
|
|
2427
2429
|
}
|
|
2428
2430
|
};
|
|
2429
|
-
function
|
|
2431
|
+
function Di(e, t) {
|
|
2430
2432
|
let n = new Je(U, t), r = new Je(k, t), o = new Ot(n, r);
|
|
2431
|
-
return e.forEach((
|
|
2432
|
-
switch (
|
|
2433
|
+
return e.forEach((i) => {
|
|
2434
|
+
switch (i[0]) {
|
|
2433
2435
|
case U:
|
|
2434
|
-
n.align(
|
|
2436
|
+
n.align(i);
|
|
2435
2437
|
break;
|
|
2436
2438
|
case k:
|
|
2437
|
-
r.align(
|
|
2439
|
+
r.align(i);
|
|
2438
2440
|
break;
|
|
2439
2441
|
default:
|
|
2440
|
-
o.align(
|
|
2442
|
+
o.align(i);
|
|
2441
2443
|
}
|
|
2442
2444
|
}), o.getLines();
|
|
2443
2445
|
}
|
|
2444
|
-
c(
|
|
2445
|
-
function
|
|
2446
|
+
c(Di, "getAlignedDiffs");
|
|
2447
|
+
function Fi(e, t) {
|
|
2446
2448
|
if (t) {
|
|
2447
2449
|
let n = e.length - 1;
|
|
2448
2450
|
return e.some((r, o) => r[0] === x && (o !== n || r[1] !== `
|
|
@@ -2450,27 +2452,27 @@ function Ds(e, t) {
|
|
|
2450
2452
|
}
|
|
2451
2453
|
return e.some((n) => n[0] === x);
|
|
2452
2454
|
}
|
|
2453
|
-
c(
|
|
2454
|
-
function
|
|
2455
|
+
c(Fi, "hasCommonDiff");
|
|
2456
|
+
function ji(e, t, n) {
|
|
2455
2457
|
if (e !== t && e.length !== 0 && t.length !== 0) {
|
|
2456
2458
|
let r = e.includes(`
|
|
2457
2459
|
`) || t.includes(`
|
|
2458
|
-
`), [o,
|
|
2460
|
+
`), [o, i] = er(r ? `${e}
|
|
2459
2461
|
` : e, r ? `${t}
|
|
2460
2462
|
` : t, !0, n);
|
|
2461
|
-
if (
|
|
2462
|
-
let
|
|
2463
|
-
return Nt(a,
|
|
2463
|
+
if (Fi(o, r)) {
|
|
2464
|
+
let s = he(n), a = Di(o, s.changeColor);
|
|
2465
|
+
return Nt(a, i, s);
|
|
2464
2466
|
}
|
|
2465
2467
|
}
|
|
2466
2468
|
return Xe(e.split(`
|
|
2467
2469
|
`), t.split(`
|
|
2468
2470
|
`), n);
|
|
2469
2471
|
}
|
|
2470
|
-
c(
|
|
2472
|
+
c(ji, "diffStringsUnified");
|
|
2471
2473
|
function er(e, t, n, r) {
|
|
2472
|
-
let [o,
|
|
2473
|
-
return n &&
|
|
2474
|
+
let [o, i] = Li(e, t, r);
|
|
2475
|
+
return n && yi(o), [o, i];
|
|
2474
2476
|
}
|
|
2475
2477
|
c(er, "diffStringsRaw");
|
|
2476
2478
|
function $t(e, t) {
|
|
@@ -2478,13 +2480,13 @@ function $t(e, t) {
|
|
|
2478
2480
|
return n(e);
|
|
2479
2481
|
}
|
|
2480
2482
|
c($t, "getCommonMessage");
|
|
2481
|
-
var { AsymmetricMatcher:
|
|
2482
|
-
|
|
2483
|
-
|
|
2484
|
-
|
|
2485
|
-
|
|
2486
|
-
|
|
2487
|
-
|
|
2483
|
+
var { AsymmetricMatcher: Bi, DOMCollection: ki, DOMElement: zi, Immutable: Yi, ReactElement: Ui, ReactTestComponent: Wi } = $e, tr = [
|
|
2484
|
+
Wi,
|
|
2485
|
+
Ui,
|
|
2486
|
+
zi,
|
|
2487
|
+
ki,
|
|
2488
|
+
Yi,
|
|
2489
|
+
Bi,
|
|
2488
2490
|
$e.Error
|
|
2489
2491
|
], wt = {
|
|
2490
2492
|
maxDepth: 20,
|
|
@@ -2494,31 +2496,31 @@ var { AsymmetricMatcher: Bs, DOMCollection: ks, DOMElement: zs, Immutable: Ys, R
|
|
|
2494
2496
|
maxDepth: 8,
|
|
2495
2497
|
plugins: tr
|
|
2496
2498
|
};
|
|
2497
|
-
function
|
|
2499
|
+
function Vi(e, t, n) {
|
|
2498
2500
|
if (Object.is(e, t))
|
|
2499
2501
|
return "";
|
|
2500
|
-
let r =
|
|
2502
|
+
let r = Fn(e), o = r, i = !1;
|
|
2501
2503
|
if (r === "object" && typeof e.asymmetricMatch == "function") {
|
|
2502
2504
|
if (e.$$typeof !== Symbol.for("jest.asymmetricMatcher") || typeof e.getExpectedType != "function")
|
|
2503
2505
|
return;
|
|
2504
|
-
o = e.getExpectedType(),
|
|
2506
|
+
o = e.getExpectedType(), i = o === "string";
|
|
2505
2507
|
}
|
|
2506
|
-
if (o !==
|
|
2508
|
+
if (o !== Fn(t)) {
|
|
2507
2509
|
let h = function(O) {
|
|
2508
2510
|
return O.length <= u ? O : `${O.slice(0, u)}...`;
|
|
2509
2511
|
};
|
|
2510
2512
|
c(h, "truncate");
|
|
2511
|
-
let { aAnnotation:
|
|
2513
|
+
let { aAnnotation: s, aColor: a, aIndicator: l, bAnnotation: m, bColor: p, bIndicator: f } = he(n), b = At(nr, n), y = Q(e, b), g = Q(t,
|
|
2512
2514
|
b), u = 1e5;
|
|
2513
2515
|
y = h(y), g = h(g);
|
|
2514
|
-
let S = `${a(`${l} ${
|
|
2516
|
+
let S = `${a(`${l} ${s}:`)}
|
|
2515
2517
|
${y}`, _ = `${p(`${f} ${m}:`)}
|
|
2516
2518
|
${g}`;
|
|
2517
2519
|
return `${S}
|
|
2518
2520
|
|
|
2519
2521
|
${_}`;
|
|
2520
2522
|
}
|
|
2521
|
-
if (!
|
|
2523
|
+
if (!i)
|
|
2522
2524
|
switch (r) {
|
|
2523
2525
|
case "string":
|
|
2524
2526
|
return Xe(e.split(`
|
|
@@ -2526,7 +2528,7 @@ ${_}`;
|
|
|
2526
2528
|
`), n);
|
|
2527
2529
|
case "boolean":
|
|
2528
2530
|
case "number":
|
|
2529
|
-
return
|
|
2531
|
+
return qi(e, t, n);
|
|
2530
2532
|
case "map":
|
|
2531
2533
|
return Ct(Bn(e), Bn(t), n);
|
|
2532
2534
|
case "set":
|
|
@@ -2535,14 +2537,14 @@ ${_}`;
|
|
|
2535
2537
|
return Ct(e, t, n);
|
|
2536
2538
|
}
|
|
2537
2539
|
}
|
|
2538
|
-
c(
|
|
2539
|
-
function
|
|
2540
|
+
c(Vi, "diff");
|
|
2541
|
+
function qi(e, t, n) {
|
|
2540
2542
|
let r = Q(e, wt), o = Q(t, wt);
|
|
2541
2543
|
return r === o ? "" : Xe(r.split(`
|
|
2542
2544
|
`), o.split(`
|
|
2543
2545
|
`), n);
|
|
2544
2546
|
}
|
|
2545
|
-
c(
|
|
2547
|
+
c(qi, "comparePrimitive");
|
|
2546
2548
|
function Bn(e) {
|
|
2547
2549
|
return new Map(Array.from(e.entries()).sort());
|
|
2548
2550
|
}
|
|
@@ -2554,15 +2556,15 @@ c(kn, "sortSet");
|
|
|
2554
2556
|
function Ct(e, t, n) {
|
|
2555
2557
|
let r, o = !1;
|
|
2556
2558
|
try {
|
|
2557
|
-
let
|
|
2558
|
-
r = zn(e, t,
|
|
2559
|
+
let s = At(wt, n);
|
|
2560
|
+
r = zn(e, t, s, n);
|
|
2559
2561
|
} catch {
|
|
2560
2562
|
o = !0;
|
|
2561
2563
|
}
|
|
2562
|
-
let
|
|
2563
|
-
if (r === void 0 || r ===
|
|
2564
|
-
let
|
|
2565
|
-
r = zn(e, t,
|
|
2564
|
+
let i = $t(Gn, n);
|
|
2565
|
+
if (r === void 0 || r === i) {
|
|
2566
|
+
let s = At(nr, n);
|
|
2567
|
+
r = zn(e, t, s, n), r !== i && !o && (r = `${$t(Ei, n)}
|
|
2566
2568
|
|
|
2567
2569
|
${r}`);
|
|
2568
2570
|
}
|
|
@@ -2583,15 +2585,15 @@ function zn(e, t, n, r) {
|
|
|
2583
2585
|
let o = {
|
|
2584
2586
|
...n,
|
|
2585
2587
|
indent: 0
|
|
2586
|
-
},
|
|
2587
|
-
if (
|
|
2588
|
+
}, i = Q(e, o), s = Q(t, o);
|
|
2589
|
+
if (i === s)
|
|
2588
2590
|
return $t(Gn, r);
|
|
2589
2591
|
{
|
|
2590
2592
|
let a = Q(e, n), l = Q(t, n);
|
|
2591
|
-
return
|
|
2593
|
+
return Mi(a.split(`
|
|
2592
2594
|
`), l.split(`
|
|
2593
|
-
`), s.split(`
|
|
2594
2595
|
`), i.split(`
|
|
2596
|
+
`), s.split(`
|
|
2595
2597
|
`), r);
|
|
2596
2598
|
}
|
|
2597
2599
|
}
|
|
@@ -2612,13 +2614,13 @@ function rr(e, t, n) {
|
|
|
2612
2614
|
if (t.includes(`
|
|
2613
2615
|
`) || e.includes(`
|
|
2614
2616
|
`))
|
|
2615
|
-
return
|
|
2616
|
-
let [p] = er(t, e, !0), f = p.some((u) => u[0] === x), b =
|
|
2617
|
+
return ji(t, e, n);
|
|
2618
|
+
let [p] = er(t, e, !0), f = p.some((u) => u[0] === x), b = Ki(r, o), y = b(r) + Ji(Vn(p, U, f)), g = b(o) + Hi(Vn(p, k, f));
|
|
2617
2619
|
return `${y}
|
|
2618
2620
|
${g}`;
|
|
2619
2621
|
}
|
|
2620
|
-
let
|
|
2621
|
-
return
|
|
2622
|
+
let i = _t(t, { forceWritable: !0 }), s = _t(e, { forceWritable: !0 }), { replacedExpected: a, replacedActual: l } = or(s, i);
|
|
2623
|
+
return Vi(a, l, n);
|
|
2622
2624
|
}
|
|
2623
2625
|
c(rr, "printDiffOrStringify");
|
|
2624
2626
|
function or(e, t, n = /* @__PURE__ */ new WeakSet(), r = /* @__PURE__ */ new WeakSet()) {
|
|
@@ -2629,13 +2631,13 @@ function or(e, t, n = /* @__PURE__ */ new WeakSet(), r = /* @__PURE__ */ new Wea
|
|
|
2629
2631
|
replacedActual: e,
|
|
2630
2632
|
replacedExpected: t
|
|
2631
2633
|
} : (n.add(e), r.add(t), Et(t).forEach((o) => {
|
|
2632
|
-
let
|
|
2633
|
-
if (Un(
|
|
2634
|
-
|
|
2635
|
-
else if (Un(
|
|
2636
|
-
|
|
2637
|
-
else if (Wn(
|
|
2638
|
-
let a = or(
|
|
2634
|
+
let i = t[o], s = e[o];
|
|
2635
|
+
if (Un(i))
|
|
2636
|
+
i.asymmetricMatch(s) && (e[o] = i);
|
|
2637
|
+
else if (Un(s))
|
|
2638
|
+
s.asymmetricMatch(i) && (t[o] = s);
|
|
2639
|
+
else if (Wn(s, i)) {
|
|
2640
|
+
let a = or(s, i, n, r);
|
|
2639
2641
|
e[o] = a.replacedActual, t[o] = a.replacedExpected;
|
|
2640
2642
|
}
|
|
2641
2643
|
}), {
|
|
@@ -2647,40 +2649,40 @@ function or(e, t, n = /* @__PURE__ */ new WeakSet(), r = /* @__PURE__ */ new Wea
|
|
|
2647
2649
|
};
|
|
2648
2650
|
}
|
|
2649
2651
|
c(or, "replaceAsymmetricMatcher");
|
|
2650
|
-
function
|
|
2652
|
+
function Ki(...e) {
|
|
2651
2653
|
let t = e.reduce((n, r) => r.length > n ? r.length : n, 0);
|
|
2652
2654
|
return (n) => `${n}: ${" ".repeat(t - n.length)}`;
|
|
2653
2655
|
}
|
|
2654
|
-
c(
|
|
2655
|
-
var
|
|
2656
|
-
function
|
|
2657
|
-
return e.replace(/\s+$/gm, (t) =>
|
|
2656
|
+
c(Ki, "getLabelPrinter");
|
|
2657
|
+
var Gi = "\xB7";
|
|
2658
|
+
function ir(e) {
|
|
2659
|
+
return e.replace(/\s+$/gm, (t) => Gi.repeat(t.length));
|
|
2658
2660
|
}
|
|
2659
|
-
c(
|
|
2660
|
-
function
|
|
2661
|
-
return ne.red(
|
|
2661
|
+
c(ir, "replaceTrailingSpaces");
|
|
2662
|
+
function Hi(e) {
|
|
2663
|
+
return ne.red(ir(ge(e)));
|
|
2662
2664
|
}
|
|
2663
|
-
c(
|
|
2664
|
-
function
|
|
2665
|
-
return ne.green(
|
|
2665
|
+
c(Hi, "printReceived");
|
|
2666
|
+
function Ji(e) {
|
|
2667
|
+
return ne.green(ir(ge(e)));
|
|
2666
2668
|
}
|
|
2667
|
-
c(
|
|
2669
|
+
c(Ji, "printExpected");
|
|
2668
2670
|
function Vn(e, t, n) {
|
|
2669
2671
|
return e.reduce((r, o) => r + (o[0] === x ? o[1] : o[0] === t ? n ? ne.inverse(o[1]) : o[1] : ""), "");
|
|
2670
2672
|
}
|
|
2671
2673
|
c(Vn, "getCommonAndChangedSubstrings");
|
|
2672
2674
|
|
|
2673
2675
|
// ../node_modules/@vitest/utils/dist/error.js
|
|
2674
|
-
var
|
|
2675
|
-
function
|
|
2676
|
-
return e && (e[
|
|
2676
|
+
var Xi = "@@__IMMUTABLE_RECORD__@@", Zi = "@@__IMMUTABLE_ITERABLE__@@";
|
|
2677
|
+
function vi(e) {
|
|
2678
|
+
return e && (e[Zi] || e[Xi]);
|
|
2677
2679
|
}
|
|
2678
|
-
c(
|
|
2679
|
-
var
|
|
2680
|
-
function
|
|
2680
|
+
c(vi, "isImmutable");
|
|
2681
|
+
var Qi = Object.getPrototypeOf({});
|
|
2682
|
+
function sr(e) {
|
|
2681
2683
|
return e instanceof Error ? `<unserializable>: ${e.message}` : typeof e == "string" ? `<unserializable>: ${e}` : "<unserializable>";
|
|
2682
2684
|
}
|
|
2683
|
-
c(
|
|
2685
|
+
c(sr, "getUnserializableMessage");
|
|
2684
2686
|
function _e(e, t = /* @__PURE__ */ new WeakMap()) {
|
|
2685
2687
|
if (!e || typeof e == "string")
|
|
2686
2688
|
return e;
|
|
@@ -2690,7 +2692,7 @@ function _e(e, t = /* @__PURE__ */ new WeakMap()) {
|
|
|
2690
2692
|
return e.toString();
|
|
2691
2693
|
if (typeof e != "object")
|
|
2692
2694
|
return e;
|
|
2693
|
-
if (
|
|
2695
|
+
if (vi(e))
|
|
2694
2696
|
return _e(e.toJSON(), t);
|
|
2695
2697
|
if (e instanceof Promise || e.constructor && e.constructor.prototype === "AsyncFunction")
|
|
2696
2698
|
return "Promise";
|
|
@@ -2707,31 +2709,31 @@ function _e(e, t = /* @__PURE__ */ new WeakMap()) {
|
|
|
2707
2709
|
return t.set(e, n), e.forEach((r, o) => {
|
|
2708
2710
|
try {
|
|
2709
2711
|
n[o] = _e(r, t);
|
|
2710
|
-
} catch (
|
|
2711
|
-
n[o] =
|
|
2712
|
+
} catch (i) {
|
|
2713
|
+
n[o] = sr(i);
|
|
2712
2714
|
}
|
|
2713
2715
|
}), n;
|
|
2714
2716
|
} else {
|
|
2715
2717
|
let n = /* @__PURE__ */ Object.create(null);
|
|
2716
2718
|
t.set(e, n);
|
|
2717
2719
|
let r = e;
|
|
2718
|
-
for (; r && r !==
|
|
2720
|
+
for (; r && r !== Qi; )
|
|
2719
2721
|
Object.getOwnPropertyNames(r).forEach((o) => {
|
|
2720
2722
|
if (!(o in n))
|
|
2721
2723
|
try {
|
|
2722
2724
|
n[o] = _e(e[o], t);
|
|
2723
|
-
} catch (
|
|
2724
|
-
delete n[o], n[o] =
|
|
2725
|
+
} catch (i) {
|
|
2726
|
+
delete n[o], n[o] = sr(i);
|
|
2725
2727
|
}
|
|
2726
2728
|
}), r = Object.getPrototypeOf(r);
|
|
2727
2729
|
return n;
|
|
2728
2730
|
}
|
|
2729
2731
|
}
|
|
2730
2732
|
c(_e, "serializeValue");
|
|
2731
|
-
function
|
|
2733
|
+
function es(e) {
|
|
2732
2734
|
return e.replace(/__(vite_ssr_import|vi_import)_\d+__\./g, "");
|
|
2733
2735
|
}
|
|
2734
|
-
c(
|
|
2736
|
+
c(es, "normalizeErrorMessage");
|
|
2735
2737
|
function Pt(e, t, n = /* @__PURE__ */ new WeakSet()) {
|
|
2736
2738
|
if (!e || typeof e != "object")
|
|
2737
2739
|
return { message: String(e) };
|
|
@@ -2742,7 +2744,7 @@ function Pt(e, t, n = /* @__PURE__ */ new WeakSet()) {
|
|
|
2742
2744
|
...r.diffOptions
|
|
2743
2745
|
})), typeof r.expected != "string" && (r.expected = ge(r.expected, 10)), typeof r.actual != "string" && (r.actual = ge(r.actual, 10));
|
|
2744
2746
|
try {
|
|
2745
|
-
typeof r.message == "string" && (r.message =
|
|
2747
|
+
typeof r.message == "string" && (r.message = es(r.message));
|
|
2746
2748
|
} catch {
|
|
2747
2749
|
}
|
|
2748
2750
|
try {
|
|
@@ -2782,17 +2784,17 @@ var ur = {
|
|
|
2782
2784
|
goto: !1,
|
|
2783
2785
|
next: !1,
|
|
2784
2786
|
end: !1
|
|
2785
|
-
},
|
|
2787
|
+
}, ts = new Error(
|
|
2786
2788
|
"This function ran after the play function completed. Did you forget to `await` it?"
|
|
2787
|
-
), lr = /* @__PURE__ */ c((e) => Object.prototype.toString.call(e) === "[object Object]", "isObject"),
|
|
2788
|
-
prototype.toString.call(e) === "[object Module]", "isModule"),
|
|
2789
|
-
if (!lr(e) && !
|
|
2789
|
+
), lr = /* @__PURE__ */ c((e) => Object.prototype.toString.call(e) === "[object Object]", "isObject"), ns = /* @__PURE__ */ c((e) => Object.
|
|
2790
|
+
prototype.toString.call(e) === "[object Module]", "isModule"), rs = /* @__PURE__ */ c((e) => {
|
|
2791
|
+
if (!lr(e) && !ns(e))
|
|
2790
2792
|
return !1;
|
|
2791
2793
|
if (e.constructor === void 0)
|
|
2792
2794
|
return !0;
|
|
2793
2795
|
let t = e.constructor.prototype;
|
|
2794
2796
|
return !!lr(t);
|
|
2795
|
-
}, "isInstrumentable"),
|
|
2797
|
+
}, "isInstrumentable"), os = /* @__PURE__ */ c((e) => {
|
|
2796
2798
|
try {
|
|
2797
2799
|
return new e.constructor();
|
|
2798
2800
|
} catch {
|
|
@@ -2865,15 +2867,15 @@ prototype.toString.call(e) === "[object Module]", "isModule"), ri = /* @__PURE__
|
|
|
2865
2867
|
u.id !== h && this.setState(m, { playUntil: u.id }), Object.values(y).forEach((S) => S());
|
|
2866
2868
|
} else
|
|
2867
2869
|
n(l)({ storyId: m, playUntil: p });
|
|
2868
|
-
}, "goto"),
|
|
2870
|
+
}, "goto"), i = /* @__PURE__ */ c((l) => ({ storyId: m }) => {
|
|
2869
2871
|
let { resolvers: p } = this.getState(m);
|
|
2870
2872
|
if (Object.values(p).length > 0)
|
|
2871
2873
|
Object.values(p).forEach((f) => f());
|
|
2872
2874
|
else {
|
|
2873
2875
|
let f = this.getLog(m).find((b) => b.status === "waiting")?.callId;
|
|
2874
|
-
f ? n(l)({ storyId: m, playUntil: f }) :
|
|
2876
|
+
f ? n(l)({ storyId: m, playUntil: f }) : s({ storyId: m });
|
|
2875
2877
|
}
|
|
2876
|
-
}, "next"),
|
|
2878
|
+
}, "next"), s = /* @__PURE__ */ c(({ storyId: l }) => {
|
|
2877
2879
|
this.setState(l, { playUntil: void 0, isDebugging: !1 }), Object.values(this.getState(l).resolvers).forEach((m) => m());
|
|
2878
2880
|
}, "end"), a = /* @__PURE__ */ c(({ storyId: l, newPhase: m }) => {
|
|
2879
2881
|
let { isDebugging: p } = this.getState(l);
|
|
@@ -2892,7 +2894,7 @@ prototype.toString.call(e) === "[object Module]", "isModule"), ri = /* @__PURE__
|
|
|
2892
2894
|
on(ye.SET_CURRENT_STORY, () => {
|
|
2893
2895
|
this.initialized ? this.cleanup() : this.initialized = !0;
|
|
2894
2896
|
}), this.channel.on(ee.START, n(this.channel)), this.channel.on(ee.BACK, r(this.channel)), this.channel.on(ee.GOTO, o(this.channel)), this.
|
|
2895
|
-
channel.on(ee.NEXT,
|
|
2897
|
+
channel.on(ee.NEXT, i(this.channel)), this.channel.on(ee.END, s);
|
|
2896
2898
|
});
|
|
2897
2899
|
}
|
|
2898
2900
|
static {
|
|
@@ -2909,8 +2911,8 @@ prototype.toString.call(e) === "[object Module]", "isModule"), ri = /* @__PURE__
|
|
|
2909
2911
|
cleanup() {
|
|
2910
2912
|
this.state = Object.entries(this.state).reduce(
|
|
2911
2913
|
(n, [r, o]) => {
|
|
2912
|
-
let
|
|
2913
|
-
return
|
|
2914
|
+
let i = ar(o);
|
|
2915
|
+
return i && (n[r] = Object.assign(It(), i)), n;
|
|
2914
2916
|
},
|
|
2915
2917
|
{}
|
|
2916
2918
|
);
|
|
@@ -2920,62 +2922,62 @@ prototype.toString.call(e) === "[object Module]", "isModule"), ri = /* @__PURE__
|
|
|
2920
2922
|
}
|
|
2921
2923
|
getLog(t) {
|
|
2922
2924
|
let { calls: n, shadowCalls: r } = this.getState(t), o = [...r];
|
|
2923
|
-
n.forEach((
|
|
2924
|
-
o[a] =
|
|
2925
|
+
n.forEach((s, a) => {
|
|
2926
|
+
o[a] = s;
|
|
2925
2927
|
});
|
|
2926
|
-
let
|
|
2927
|
-
return o.reduceRight((
|
|
2928
|
-
l?.__callId__ &&
|
|
2928
|
+
let i = /* @__PURE__ */ new Set();
|
|
2929
|
+
return o.reduceRight((s, a) => (a.args.forEach((l) => {
|
|
2930
|
+
l?.__callId__ && i.add(l.__callId__);
|
|
2929
2931
|
}), a.path.forEach((l) => {
|
|
2930
|
-
l.__callId__ &&
|
|
2931
|
-
}), (a.interceptable || a.exception) && !
|
|
2932
|
-
id)),
|
|
2932
|
+
l.__callId__ && i.add(l.__callId__);
|
|
2933
|
+
}), (a.interceptable || a.exception) && !i.has(a.id) && (s.unshift({ callId: a.id, status: a.status, ancestors: a.ancestors }), i.add(a.
|
|
2934
|
+
id)), s), []);
|
|
2933
2935
|
}
|
|
2934
2936
|
// Traverses the object structure to recursively patch all function properties.
|
|
2935
2937
|
// Returns the original object, or a new object with the same constructor,
|
|
2936
2938
|
// depending on whether it should mutate.
|
|
2937
2939
|
instrument(t, n, r = 0) {
|
|
2938
|
-
if (!
|
|
2940
|
+
if (!rs(t))
|
|
2939
2941
|
return t;
|
|
2940
|
-
let { mutate: o = !1, path:
|
|
2941
|
-
return r += 1,
|
|
2942
|
+
let { mutate: o = !1, path: i = [] } = n, s = n.getKeys ? n.getKeys(t, r) : Object.keys(t);
|
|
2943
|
+
return r += 1, s.reduce(
|
|
2942
2944
|
(a, l) => {
|
|
2943
|
-
let m =
|
|
2945
|
+
let m = is(t, l);
|
|
2944
2946
|
if (typeof m?.get == "function") {
|
|
2945
2947
|
if (m.configurable) {
|
|
2946
2948
|
let f = /* @__PURE__ */ c(() => m?.get?.bind(t)?.(), "getter");
|
|
2947
2949
|
Object.defineProperty(a, l, {
|
|
2948
|
-
get: /* @__PURE__ */ c(() => this.instrument(f(), { ...n, path:
|
|
2950
|
+
get: /* @__PURE__ */ c(() => this.instrument(f(), { ...n, path: i.concat(l) }, r), "get")
|
|
2949
2951
|
});
|
|
2950
2952
|
}
|
|
2951
2953
|
return a;
|
|
2952
2954
|
}
|
|
2953
2955
|
let p = t[l];
|
|
2954
|
-
return typeof p != "function" ? (a[l] = this.instrument(p, { ...n, path:
|
|
2956
|
+
return typeof p != "function" ? (a[l] = this.instrument(p, { ...n, path: i.concat(l) }, r), a) : "__originalFn__" in p && typeof p.__originalFn__ ==
|
|
2955
2957
|
"function" ? (a[l] = p, a) : (a[l] = (...f) => this.track(l, p, t, f, n), a[l].__originalFn__ = p, Object.defineProperty(a[l], "name",
|
|
2956
2958
|
{ value: l, writable: !1 }), Object.keys(p).length > 0 && Object.assign(
|
|
2957
2959
|
a[l],
|
|
2958
|
-
this.instrument({ ...p }, { ...n, path:
|
|
2960
|
+
this.instrument({ ...p }, { ...n, path: i.concat(l) }, r)
|
|
2959
2961
|
), a);
|
|
2960
2962
|
},
|
|
2961
|
-
o ? t :
|
|
2963
|
+
o ? t : os(t)
|
|
2962
2964
|
);
|
|
2963
2965
|
}
|
|
2964
2966
|
// Monkey patch an object method to record calls.
|
|
2965
2967
|
// Returns a function that invokes the original function, records the invocation ("call") and
|
|
2966
2968
|
// returns the original result.
|
|
2967
|
-
track(t, n, r, o,
|
|
2968
|
-
let
|
|
2969
|
-
|
|
2970
|
-
this.setState(
|
|
2971
|
-
let m = `${l.slice(-1)[0] ||
|
|
2972
|
-
p) : f, g = { id: m, cursor: a, storyId:
|
|
2973
|
-
this.intercept : this.invoke).call(this, n, r, g,
|
|
2974
|
-
return this.instrument(h, { ...
|
|
2969
|
+
track(t, n, r, o, i) {
|
|
2970
|
+
let s = o?.[0]?.__storyId__ || W.global.__STORYBOOK_PREVIEW__?.selectionStore?.selection?.storyId, { cursor: a, ancestors: l } = this.getState(
|
|
2971
|
+
s);
|
|
2972
|
+
this.setState(s, { cursor: a + 1 });
|
|
2973
|
+
let m = `${l.slice(-1)[0] || s} [${a}] ${t}`, { path: p = [], intercept: f = !1, retain: b = !1 } = i, y = typeof f == "function" ? f(t,
|
|
2974
|
+
p) : f, g = { id: m, cursor: a, storyId: s, ancestors: l, path: p, method: t, args: o, interceptable: y, retain: b }, h = (y && !l.length ?
|
|
2975
|
+
this.intercept : this.invoke).call(this, n, r, g, i);
|
|
2976
|
+
return this.instrument(h, { ...i, mutate: !0, path: [{ __callId__: g.id }] });
|
|
2975
2977
|
}
|
|
2976
2978
|
intercept(t, n, r, o) {
|
|
2977
|
-
let { chainedCallIds:
|
|
2978
|
-
return !
|
|
2979
|
+
let { chainedCallIds: i, isDebugging: s, playUntil: a } = this.getState(r.storyId), l = i.has(r.id);
|
|
2980
|
+
return !s || l || a ? (a === r.id && this.setState(r.storyId, { playUntil: void 0 }), this.invoke(t, n, r, o)) : new Promise((m) => {
|
|
2979
2981
|
this.setState(r.storyId, ({ resolvers: p }) => ({
|
|
2980
2982
|
isLocked: !1,
|
|
2981
2983
|
resolvers: { ...p, [r.id]: m }
|
|
@@ -2986,13 +2988,13 @@ prototype.toString.call(e) === "[object Module]", "isModule"), ri = /* @__PURE__
|
|
|
2986
2988
|
}), this.invoke(t, n, r, o)));
|
|
2987
2989
|
}
|
|
2988
2990
|
invoke(t, n, r, o) {
|
|
2989
|
-
let { callRefsByResult:
|
|
2991
|
+
let { callRefsByResult: i, renderPhase: s } = this.getState(r.storyId), a = 25, l = /* @__PURE__ */ c((f, b, y) => {
|
|
2990
2992
|
if (y.includes(f))
|
|
2991
2993
|
return "[Circular]";
|
|
2992
2994
|
if (y = [...y, f], b > a)
|
|
2993
2995
|
return "...";
|
|
2994
|
-
if (
|
|
2995
|
-
return
|
|
2996
|
+
if (i.has(f))
|
|
2997
|
+
return i.get(f);
|
|
2996
2998
|
if (f instanceof Array)
|
|
2997
2999
|
return f.map((g) => l(g, ++b, y));
|
|
2998
3000
|
if (f instanceof Date)
|
|
@@ -3043,9 +3045,9 @@ prototype.toString.call(e) === "[object Module]", "isModule"), ri = /* @__PURE__
|
|
|
3043
3045
|
throw f;
|
|
3044
3046
|
}, "handleException");
|
|
3045
3047
|
try {
|
|
3046
|
-
if (
|
|
3047
|
-
throw
|
|
3048
|
-
let b = (o.getArgs ? o.getArgs(r, this.getState(r.storyId)) : r.args).map((g) => typeof g != "function" ||
|
|
3048
|
+
if (s === "played" && !r.retain)
|
|
3049
|
+
throw ts;
|
|
3050
|
+
let b = (o.getArgs ? o.getArgs(r, this.getState(r.storyId)) : r.args).map((g) => typeof g != "function" || ss(g) || Object.keys(g).length ?
|
|
3049
3051
|
g : (...u) => {
|
|
3050
3052
|
let { cursor: h, ancestors: S } = this.getState(r.storyId);
|
|
3051
3053
|
this.setState(r.storyId, { cursor: 0, ancestors: [...S, r.id] });
|
|
@@ -3073,11 +3075,11 @@ prototype.toString.call(e) === "[object Module]", "isModule"), ri = /* @__PURE__
|
|
|
3073
3075
|
// Sends the call info to the manager and synchronizes the log.
|
|
3074
3076
|
update(t) {
|
|
3075
3077
|
this.channel?.emit(ee.CALL, t), this.setState(t.storyId, ({ calls: n }) => {
|
|
3076
|
-
let r = n.concat(t).reduce((o,
|
|
3078
|
+
let r = n.concat(t).reduce((o, i) => Object.assign(o, { [i.id]: i }), {});
|
|
3077
3079
|
return {
|
|
3078
3080
|
// Calls are sorted to ensure parent calls always come before calls in their callback.
|
|
3079
3081
|
calls: Object.values(r).sort(
|
|
3080
|
-
(o,
|
|
3082
|
+
(o, i) => o.id.localeCompare(i.id, void 0, { numeric: !0 })
|
|
3081
3083
|
)
|
|
3082
3084
|
};
|
|
3083
3085
|
}), this.sync(t.storyId);
|
|
@@ -3086,14 +3088,14 @@ prototype.toString.call(e) === "[object Module]", "isModule"), ri = /* @__PURE__
|
|
|
3086
3088
|
// Uses a 0ms debounce because this might get called many times in one tick.
|
|
3087
3089
|
sync(t) {
|
|
3088
3090
|
let n = /* @__PURE__ */ c(() => {
|
|
3089
|
-
let { isLocked: r, isPlaying: o } = this.getState(t),
|
|
3090
|
-
status === "waiting")?.callId, a =
|
|
3091
|
-
if (r || a ||
|
|
3092
|
-
let f = { controlStates: ur, logItems:
|
|
3091
|
+
let { isLocked: r, isPlaying: o } = this.getState(t), i = this.getLog(t), s = i.filter(({ ancestors: f }) => !f.length).find((f) => f.
|
|
3092
|
+
status === "waiting")?.callId, a = i.some((f) => f.status === "active");
|
|
3093
|
+
if (r || a || i.length === 0) {
|
|
3094
|
+
let f = { controlStates: ur, logItems: i };
|
|
3093
3095
|
this.channel?.emit(ee.SYNC, f);
|
|
3094
3096
|
return;
|
|
3095
3097
|
}
|
|
3096
|
-
let l =
|
|
3098
|
+
let l = i.some(
|
|
3097
3099
|
(f) => f.status === "done" || f.status === "error"
|
|
3098
3100
|
), p = { controlStates: {
|
|
3099
3101
|
start: l,
|
|
@@ -3101,7 +3103,7 @@ prototype.toString.call(e) === "[object Module]", "isModule"), ri = /* @__PURE__
|
|
|
3101
3103
|
goto: !0,
|
|
3102
3104
|
next: o,
|
|
3103
3105
|
end: o
|
|
3104
|
-
}, logItems:
|
|
3106
|
+
}, logItems: i, pausedAt: s };
|
|
3105
3107
|
this.channel?.emit(ee.SYNC, p);
|
|
3106
3108
|
}, "synchronize");
|
|
3107
3109
|
this.setState(t, ({ syncTimeout: r }) => (clearTimeout(r), { syncTimeout: setTimeout(n, 0) }));
|
|
@@ -3119,7 +3121,7 @@ function mr(e, t = {}) {
|
|
|
3119
3121
|
}
|
|
3120
3122
|
}
|
|
3121
3123
|
c(mr, "instrument");
|
|
3122
|
-
function
|
|
3124
|
+
function is(e, t) {
|
|
3123
3125
|
let n = e;
|
|
3124
3126
|
for (; n != null; ) {
|
|
3125
3127
|
let r = Object.getOwnPropertyDescriptor(n, t);
|
|
@@ -3128,11 +3130,11 @@ function si(e, t) {
|
|
|
3128
3130
|
n = Object.getPrototypeOf(n);
|
|
3129
3131
|
}
|
|
3130
3132
|
}
|
|
3131
|
-
c(
|
|
3132
|
-
function
|
|
3133
|
+
c(is, "getPropertyDescriptor");
|
|
3134
|
+
function ss(e) {
|
|
3133
3135
|
if (typeof e != "function")
|
|
3134
3136
|
return !1;
|
|
3135
3137
|
let t = Object.getOwnPropertyDescriptor(e, "prototype");
|
|
3136
3138
|
return t ? !t.writable : !1;
|
|
3137
3139
|
}
|
|
3138
|
-
c(
|
|
3140
|
+
c(ss, "isClass");
|