storybook 9.1.0-alpha.9 → 9.1.0-beta.1
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/dist/bin/index.cjs +66 -66
- package/dist/bin/index.js +65 -65
- package/dist/cli/bin/index.cjs +1 -1
- package/dist/cli/bin/index.js +1 -1
- package/dist/common/index.cjs +2103 -2103
- package/dist/common/index.js +3197 -3197
- package/dist/components/index.cjs +289 -290
- package/dist/components/index.js +2 -3
- package/dist/core-server/presets/common-manager.js +2243 -2228
- package/dist/core-server/presets/common-preset.cjs +4761 -4759
- package/dist/core-server/presets/common-preset.js +9645 -9643
- package/dist/core-server/presets/webpack/loaders/storybook-mock-transform-loader.cjs +2 -1
- package/dist/core-server/presets/webpack/loaders/storybook-mock-transform-loader.js +2 -1
- package/dist/csf/index.cjs +40 -41
- package/dist/csf/index.js +2 -3
- package/dist/instrumenter/index.cjs +370 -352
- package/dist/instrumenter/index.d.ts +24 -3
- package/dist/instrumenter/index.js +268 -250
- package/dist/manager/globals-runtime.js +38 -21
- package/dist/manager-api/index.cjs +1 -1
- package/dist/manager-api/index.d.ts +8 -534
- package/dist/manager-api/index.js +1 -1
- package/dist/preview/runtime.js +3894 -3870
- package/dist/preview-api/index.cjs +43 -37
- package/dist/preview-api/index.d.ts +3 -1
- package/dist/preview-api/index.js +234 -227
- package/dist/telemetry/index.cjs +506 -507
- package/dist/telemetry/index.js +974 -975
- package/package.json +1 -1
|
@@ -1,23 +1,23 @@
|
|
|
1
1
|
"use strict";
|
|
2
|
-
var
|
|
2
|
+
var Pe = Object.defineProperty;
|
|
3
3
|
var gr = Object.getOwnPropertyDescriptor;
|
|
4
4
|
var hr = Object.getOwnPropertyNames;
|
|
5
|
-
var
|
|
6
|
-
var c = (e, t) =>
|
|
7
|
-
var
|
|
5
|
+
var dr = Object.prototype.hasOwnProperty;
|
|
6
|
+
var c = (e, t) => Pe(e, "name", { value: t, configurable: !0 });
|
|
7
|
+
var yr = (e, t) => {
|
|
8
8
|
for (var n in t)
|
|
9
|
-
|
|
9
|
+
Pe(e, n, { get: t[n], enumerable: !0 });
|
|
10
10
|
}, br = (e, t, n, r) => {
|
|
11
11
|
if (t && typeof t == "object" || typeof t == "function")
|
|
12
12
|
for (let o of hr(t))
|
|
13
|
-
!
|
|
13
|
+
!dr.call(e, o) && o !== n && Pe(e, o, { get: () => t[o], enumerable: !(r = gr(t, o)) || r.enumerable });
|
|
14
14
|
return e;
|
|
15
15
|
};
|
|
16
|
-
var Sr = (e) => br(
|
|
16
|
+
var Sr = (e) => br(Pe({}, "__esModule", { value: !0 }), e);
|
|
17
17
|
|
|
18
18
|
// src/instrumenter/index.ts
|
|
19
19
|
var ui = {};
|
|
20
|
-
|
|
20
|
+
yr(ui, {
|
|
21
21
|
CallStates: () => ur,
|
|
22
22
|
EVENTS: () => ee,
|
|
23
23
|
instrument: () => mr
|
|
@@ -25,7 +25,7 @@ dr(ui, {
|
|
|
25
25
|
module.exports = Sr(ui);
|
|
26
26
|
|
|
27
27
|
// src/instrumenter/instrumenter.ts
|
|
28
|
-
var fr = require("storybook/internal/client-logger"),
|
|
28
|
+
var fr = require("storybook/internal/client-logger"), ye = require("storybook/internal/core-events"), H = require("@storybook/global");
|
|
29
29
|
|
|
30
30
|
// ../node_modules/tinyrainbow/dist/chunk-BVHSVHOK.js
|
|
31
31
|
var Er = {
|
|
@@ -92,8 +92,8 @@ function Ft(e = !1) {
|
|
|
92
92
|
return p + i.substring(f);
|
|
93
93
|
}, "i"), r = /* @__PURE__ */ c((i, l, a = i) => {
|
|
94
94
|
let m = /* @__PURE__ */ c((p) => {
|
|
95
|
-
let f = String(p),
|
|
96
|
-
return ~
|
|
95
|
+
let f = String(p), y = f.indexOf(l, i.length);
|
|
96
|
+
return ~y ? i + n(f, l, a, y) + l : i + f + l;
|
|
97
97
|
}, "o");
|
|
98
98
|
return m.open = i, m.close = l, m;
|
|
99
99
|
}, "g"), o = {
|
|
@@ -149,8 +149,8 @@ function Te(e, t, n, r, o, s, i = ": ") {
|
|
|
149
149
|
l += "\u2026";
|
|
150
150
|
break;
|
|
151
151
|
}
|
|
152
|
-
let f = s(m.value[0], t, p, r, o),
|
|
153
|
-
l += f + i +
|
|
152
|
+
let f = s(m.value[0], t, p, r, o), y = s(m.value[1], t, p, r, o);
|
|
153
|
+
l += f + i + y, m = e.next(), m.done ? t.min || (l += ",") : l += `,${t.spacingInner}`;
|
|
154
154
|
}
|
|
155
155
|
l += t.spacingOuter + n;
|
|
156
156
|
}
|
|
@@ -199,41 +199,41 @@ function rt(e, t, n, r, o, s) {
|
|
|
199
199
|
i += t.spacingOuter;
|
|
200
200
|
let a = n + t.indent;
|
|
201
201
|
for (let m = 0; m < l.length; m++) {
|
|
202
|
-
let p = l[m], f = s(p, t, a, r, o),
|
|
203
|
-
i += `${a + f}: ${
|
|
202
|
+
let p = l[m], f = s(p, t, a, r, o), y = s(e[p], t, a, r, o);
|
|
203
|
+
i += `${a + f}: ${y}`, m < l.length - 1 ? i += `,${t.spacingInner}` : t.min || (i += ",");
|
|
204
204
|
}
|
|
205
205
|
i += t.spacingOuter + n;
|
|
206
206
|
}
|
|
207
207
|
return i;
|
|
208
208
|
}
|
|
209
209
|
c(rt, "printObjectProperties");
|
|
210
|
-
var Or = typeof Symbol == "function" && Symbol.for ? Symbol.for("jest.asymmetricMatcher") : 1267621,
|
|
210
|
+
var Or = typeof Symbol == "function" && Symbol.for ? Symbol.for("jest.asymmetricMatcher") : 1267621, Ne = " ", $r = /* @__PURE__ */ c((e, t, n, r, o, s) => {
|
|
211
211
|
let i = e.toString();
|
|
212
212
|
if (i === "ArrayContaining" || i === "ArrayNotContaining")
|
|
213
|
-
return ++r > t.maxDepth ? `[${i}]` : `${i +
|
|
213
|
+
return ++r > t.maxDepth ? `[${i}]` : `${i + Ne}[${xe(e.sample, t, n, r, o, s)}]`;
|
|
214
214
|
if (i === "ObjectContaining" || i === "ObjectNotContaining")
|
|
215
|
-
return ++r > t.maxDepth ? `[${i}]` : `${i +
|
|
215
|
+
return ++r > t.maxDepth ? `[${i}]` : `${i + Ne}{${rt(e.sample, t, n, r, o, s)}}`;
|
|
216
216
|
if (i === "StringMatching" || i === "StringNotMatching" || i === "StringContaining" || i === "StringNotContaining")
|
|
217
|
-
return i +
|
|
217
|
+
return i + Ne + s(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();
|
|
221
|
-
}, "serialize$5"), wr = /* @__PURE__ */ c((e) => e && e.$$typeof === Or, "test$5"),
|
|
221
|
+
}, "serialize$5"), wr = /* @__PURE__ */ c((e) => e && e.$$typeof === Or, "test$5"), Rr = {
|
|
222
222
|
serialize: $r,
|
|
223
223
|
test: wr
|
|
224
|
-
},
|
|
225
|
-
function
|
|
226
|
-
return vt.has(e) ||
|
|
224
|
+
}, Ar = " ", vt = /* @__PURE__ */ new Set(["DOMStringMap", "NamedNodeMap"]), Pr = /^(?:HTML\w*Collection|NodeList)$/;
|
|
225
|
+
function Nr(e) {
|
|
226
|
+
return vt.has(e) || Pr.test(e);
|
|
227
227
|
}
|
|
228
|
-
c(
|
|
229
|
-
var Ir = /* @__PURE__ */ c((e) => e && e.constructor && !!e.constructor.name &&
|
|
228
|
+
c(Nr, "testName");
|
|
229
|
+
var Ir = /* @__PURE__ */ c((e) => e && e.constructor && !!e.constructor.name && Nr(e.constructor.name), "test$4");
|
|
230
230
|
function Mr(e) {
|
|
231
231
|
return e.constructor.name === "NamedNodeMap";
|
|
232
232
|
}
|
|
233
233
|
c(Mr, "isNamedNodeMap");
|
|
234
234
|
var Lr = /* @__PURE__ */ c((e, t, n, r, o, s) => {
|
|
235
235
|
let i = e.constructor.name;
|
|
236
|
-
return ++r > t.maxDepth ? `[${i}]` : (t.min ? "" : i +
|
|
236
|
+
return ++r > t.maxDepth ? `[${i}]` : (t.min ? "" : i + Ar) + (vt.has(i) ? `{${rt(Mr(e) ? [...e].reduce((l, a) => (l[a.name] = a.value, l),
|
|
237
237
|
{}) : { ...e }, t, n, r, o, s)}}` : `[${xe([...e], t, n, r, o, s)}]`);
|
|
238
238
|
}, "serialize$4"), xr = {
|
|
239
239
|
serialize: Lr,
|
|
@@ -370,15 +370,15 @@ function sn(e) {
|
|
|
370
370
|
return e && e.__esModule && Object.prototype.hasOwnProperty.call(e, "default") ? e.default : e;
|
|
371
371
|
}
|
|
372
372
|
c(sn, "getDefaultExportFromCjs");
|
|
373
|
-
var Ie = { exports: {} },
|
|
373
|
+
var Ie = { exports: {} }, P = {};
|
|
374
374
|
var zt;
|
|
375
375
|
function io() {
|
|
376
|
-
if (zt) return
|
|
376
|
+
if (zt) return P;
|
|
377
377
|
zt = 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
379
|
strict_mode"), o = Symbol.for("react.profiler"), s = Symbol.for("react.consumer"), i = Symbol.for("react.context"), l = Symbol.for("react.fo\
|
|
380
380
|
rward_ref"), a = Symbol.for("react.suspense"), m = Symbol.for("react.suspense_list"), p = Symbol.for("react.memo"), f = Symbol.for("react.la\
|
|
381
|
-
zy"),
|
|
381
|
+
zy"), y = Symbol.for("react.view_transition"), d = 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,7 +390,7 @@ zy"), b = Symbol.for("react.view_transition"), y = Symbol.for("react.client.refe
|
|
|
390
390
|
case r:
|
|
391
391
|
case a:
|
|
392
392
|
case m:
|
|
393
|
-
case
|
|
393
|
+
case y:
|
|
394
394
|
return u;
|
|
395
395
|
default:
|
|
396
396
|
switch (u = u && u.$$typeof, u) {
|
|
@@ -410,39 +410,39 @@ zy"), b = Symbol.for("react.view_transition"), y = Symbol.for("react.client.refe
|
|
|
410
410
|
}
|
|
411
411
|
}
|
|
412
412
|
}
|
|
413
|
-
return c(g, "typeOf"),
|
|
414
|
-
p,
|
|
413
|
+
return c(g, "typeOf"), P.ContextConsumer = s, P.ContextProvider = i, P.Element = e, P.ForwardRef = l, P.Fragment = n, P.Lazy = f, P.Memo =
|
|
414
|
+
p, P.Portal = t, P.Profiler = o, P.StrictMode = r, P.Suspense = a, P.SuspenseList = m, P.isContextConsumer = function(u) {
|
|
415
415
|
return g(u) === s;
|
|
416
|
-
},
|
|
416
|
+
}, P.isContextProvider = function(u) {
|
|
417
417
|
return g(u) === i;
|
|
418
|
-
},
|
|
418
|
+
}, P.isElement = function(u) {
|
|
419
419
|
return typeof u == "object" && u !== null && u.$$typeof === e;
|
|
420
|
-
},
|
|
420
|
+
}, P.isForwardRef = function(u) {
|
|
421
421
|
return g(u) === l;
|
|
422
|
-
},
|
|
422
|
+
}, P.isFragment = function(u) {
|
|
423
423
|
return g(u) === n;
|
|
424
|
-
},
|
|
424
|
+
}, P.isLazy = function(u) {
|
|
425
425
|
return g(u) === f;
|
|
426
|
-
},
|
|
426
|
+
}, P.isMemo = function(u) {
|
|
427
427
|
return g(u) === p;
|
|
428
|
-
},
|
|
428
|
+
}, P.isPortal = function(u) {
|
|
429
429
|
return g(u) === t;
|
|
430
|
-
},
|
|
430
|
+
}, P.isProfiler = function(u) {
|
|
431
431
|
return g(u) === o;
|
|
432
|
-
},
|
|
432
|
+
}, P.isStrictMode = function(u) {
|
|
433
433
|
return g(u) === r;
|
|
434
|
-
},
|
|
434
|
+
}, P.isSuspense = function(u) {
|
|
435
435
|
return g(u) === a;
|
|
436
|
-
},
|
|
436
|
+
}, P.isSuspenseList = function(u) {
|
|
437
437
|
return g(u) === m;
|
|
438
|
-
},
|
|
438
|
+
}, P.isValidElementType = function(u) {
|
|
439
439
|
return typeof u == "string" || typeof u == "function" || u === n || u === o || u === r || u === a || u === m || typeof u == "object" && u !==
|
|
440
|
-
null && (u.$$typeof === f || u.$$typeof === p || u.$$typeof === i || u.$$typeof === s || u.$$typeof === l || u.$$typeof ===
|
|
440
|
+
null && (u.$$typeof === f || u.$$typeof === p || u.$$typeof === i || u.$$typeof === s || u.$$typeof === l || u.$$typeof === d || u.getModuleId !==
|
|
441
441
|
void 0);
|
|
442
|
-
},
|
|
442
|
+
}, P.typeOf = g, P;
|
|
443
443
|
}
|
|
444
444
|
c(io, "requireReactIs_production");
|
|
445
|
-
var
|
|
445
|
+
var N = {};
|
|
446
446
|
var Yt;
|
|
447
447
|
function co() {
|
|
448
448
|
return Yt || (Yt = 1, process.env.NODE_ENV !== "production" && function() {
|
|
@@ -457,13 +457,13 @@ function co() {
|
|
|
457
457
|
case o:
|
|
458
458
|
case m:
|
|
459
459
|
case p:
|
|
460
|
-
case
|
|
460
|
+
case d:
|
|
461
461
|
return u;
|
|
462
462
|
default:
|
|
463
463
|
switch (u = u && u.$$typeof, u) {
|
|
464
464
|
case l:
|
|
465
465
|
case a:
|
|
466
|
-
case
|
|
466
|
+
case y:
|
|
467
467
|
case f:
|
|
468
468
|
return u;
|
|
469
469
|
case i:
|
|
@@ -480,39 +480,39 @@ function co() {
|
|
|
480
480
|
c(e, "typeOf");
|
|
481
481
|
var t = Symbol.for("react.transitional.element"), n = Symbol.for("react.portal"), r = Symbol.for("react.fragment"), o = Symbol.for("reac\
|
|
482
482
|
t.strict_mode"), s = Symbol.for("react.profiler"), i = Symbol.for("react.consumer"), l = Symbol.for("react.context"), a = Symbol.for("react.\
|
|
483
|
-
forward_ref"), m = Symbol.for("react.suspense"), p = Symbol.for("react.suspense_list"), f = Symbol.for("react.memo"),
|
|
484
|
-
lazy"),
|
|
485
|
-
|
|
486
|
-
s,
|
|
483
|
+
forward_ref"), m = Symbol.for("react.suspense"), p = Symbol.for("react.suspense_list"), f = Symbol.for("react.memo"), y = Symbol.for("react.\
|
|
484
|
+
lazy"), d = Symbol.for("react.view_transition"), g = Symbol.for("react.client.reference");
|
|
485
|
+
N.ContextConsumer = i, N.ContextProvider = l, N.Element = t, N.ForwardRef = a, N.Fragment = r, N.Lazy = y, N.Memo = f, N.Portal = n, N.Profiler =
|
|
486
|
+
s, N.StrictMode = o, N.Suspense = m, N.SuspenseList = p, N.isContextConsumer = function(u) {
|
|
487
487
|
return e(u) === i;
|
|
488
|
-
},
|
|
488
|
+
}, N.isContextProvider = function(u) {
|
|
489
489
|
return e(u) === l;
|
|
490
|
-
},
|
|
490
|
+
}, N.isElement = function(u) {
|
|
491
491
|
return typeof u == "object" && u !== null && u.$$typeof === t;
|
|
492
|
-
},
|
|
492
|
+
}, N.isForwardRef = function(u) {
|
|
493
493
|
return e(u) === a;
|
|
494
|
-
},
|
|
494
|
+
}, N.isFragment = function(u) {
|
|
495
495
|
return e(u) === r;
|
|
496
|
-
},
|
|
497
|
-
return e(u) ===
|
|
498
|
-
},
|
|
496
|
+
}, N.isLazy = function(u) {
|
|
497
|
+
return e(u) === y;
|
|
498
|
+
}, N.isMemo = function(u) {
|
|
499
499
|
return e(u) === f;
|
|
500
|
-
},
|
|
500
|
+
}, N.isPortal = function(u) {
|
|
501
501
|
return e(u) === n;
|
|
502
|
-
},
|
|
502
|
+
}, N.isProfiler = function(u) {
|
|
503
503
|
return e(u) === s;
|
|
504
|
-
},
|
|
504
|
+
}, N.isStrictMode = function(u) {
|
|
505
505
|
return e(u) === o;
|
|
506
|
-
},
|
|
506
|
+
}, N.isSuspense = function(u) {
|
|
507
507
|
return e(u) === m;
|
|
508
|
-
},
|
|
508
|
+
}, N.isSuspenseList = function(u) {
|
|
509
509
|
return e(u) === p;
|
|
510
|
-
},
|
|
510
|
+
}, N.isValidElementType = function(u) {
|
|
511
511
|
return typeof u == "string" || typeof u == "function" || u === r || u === s || u === o || u === m || u === p || typeof u == "object" &&
|
|
512
|
-
u !== null && (u.$$typeof ===
|
|
512
|
+
u !== null && (u.$$typeof === y || u.$$typeof === f || u.$$typeof === l || u.$$typeof === i || u.$$typeof === a || u.$$typeof === g ||
|
|
513
513
|
u.getModuleId !== void 0);
|
|
514
|
-
},
|
|
515
|
-
}()),
|
|
514
|
+
}, N.typeOf = e;
|
|
515
|
+
}()), N;
|
|
516
516
|
}
|
|
517
517
|
c(co, "requireReactIs_development$1");
|
|
518
518
|
var Ut;
|
|
@@ -531,7 +531,7 @@ function fo() {
|
|
|
531
531
|
var e = Symbol.for("react.element"), t = Symbol.for("react.portal"), n = Symbol.for("react.fragment"), r = Symbol.for("react.strict_mode"),
|
|
532
532
|
o = Symbol.for("react.profiler"), s = Symbol.for("react.provider"), i = Symbol.for("react.context"), l = Symbol.for("react.server_context"),
|
|
533
533
|
a = Symbol.for("react.forward_ref"), m = Symbol.for("react.suspense"), p = Symbol.for("react.suspense_list"), f = Symbol.for("react.memo"),
|
|
534
|
-
|
|
534
|
+
y = Symbol.for("react.lazy"), d = Symbol.for("react.offscreen"), g;
|
|
535
535
|
g = Symbol.for("react.module.reference");
|
|
536
536
|
function u(h) {
|
|
537
537
|
if (typeof h == "object" && h !== null) {
|
|
@@ -550,7 +550,7 @@ function fo() {
|
|
|
550
550
|
case l:
|
|
551
551
|
case i:
|
|
552
552
|
case a:
|
|
553
|
-
case
|
|
553
|
+
case y:
|
|
554
554
|
case f:
|
|
555
555
|
case s:
|
|
556
556
|
return h;
|
|
@@ -563,7 +563,7 @@ function fo() {
|
|
|
563
563
|
}
|
|
564
564
|
}
|
|
565
565
|
}
|
|
566
|
-
return c(u, "v"), w.ContextConsumer = i, w.ContextProvider = s, w.Element = e, w.ForwardRef = a, w.Fragment = n, w.Lazy =
|
|
566
|
+
return c(u, "v"), w.ContextConsumer = i, w.ContextProvider = s, w.Element = e, w.ForwardRef = a, w.Fragment = n, w.Lazy = y, w.Memo = f, w.
|
|
567
567
|
Portal = t, w.Profiler = o, w.StrictMode = r, w.Suspense = m, w.SuspenseList = p, w.isAsyncMode = function() {
|
|
568
568
|
return !1;
|
|
569
569
|
}, w.isConcurrentMode = function() {
|
|
@@ -579,7 +579,7 @@ function fo() {
|
|
|
579
579
|
}, w.isFragment = function(h) {
|
|
580
580
|
return u(h) === n;
|
|
581
581
|
}, w.isLazy = function(h) {
|
|
582
|
-
return u(h) ===
|
|
582
|
+
return u(h) === y;
|
|
583
583
|
}, w.isMemo = function(h) {
|
|
584
584
|
return u(h) === f;
|
|
585
585
|
}, w.isPortal = function(h) {
|
|
@@ -593,51 +593,51 @@ function fo() {
|
|
|
593
593
|
}, w.isSuspenseList = function(h) {
|
|
594
594
|
return u(h) === p;
|
|
595
595
|
}, w.isValidElementType = function(h) {
|
|
596
|
-
return typeof h == "string" || typeof h == "function" || h === n || h === o || h === r || h === m || h === p || h ===
|
|
597
|
-
object" && h !== null && (h.$$typeof ===
|
|
596
|
+
return typeof h == "string" || typeof h == "function" || h === n || h === o || h === r || h === m || h === p || h === d || typeof h == "\
|
|
597
|
+
object" && h !== null && (h.$$typeof === y || h.$$typeof === f || h.$$typeof === s || h.$$typeof === i || h.$$typeof === a || h.$$typeof ===
|
|
598
598
|
g || h.getModuleId !== void 0);
|
|
599
599
|
}, w.typeOf = u, w;
|
|
600
600
|
}
|
|
601
601
|
c(fo, "requireReactIs_production_min");
|
|
602
|
-
var
|
|
602
|
+
var R = {};
|
|
603
603
|
var Vt;
|
|
604
604
|
function mo() {
|
|
605
605
|
return Vt || (Vt = 1, process.env.NODE_ENV !== "production" && function() {
|
|
606
606
|
var e = Symbol.for("react.element"), t = Symbol.for("react.portal"), n = Symbol.for("react.fragment"), r = Symbol.for("react.strict_mode"),
|
|
607
607
|
o = Symbol.for("react.profiler"), s = Symbol.for("react.provider"), i = Symbol.for("react.context"), l = Symbol.for("react.server_contex\
|
|
608
608
|
t"), a = Symbol.for("react.forward_ref"), m = Symbol.for("react.suspense"), p = Symbol.for("react.suspense_list"), f = Symbol.for("react.mem\
|
|
609
|
-
o"),
|
|
609
|
+
o"), y = Symbol.for("react.lazy"), d = Symbol.for("react.offscreen"), g = !1, u = !1, h = !1, S = !1, _ = !1, O;
|
|
610
610
|
O = Symbol.for("react.module.reference");
|
|
611
|
-
function
|
|
612
|
-
return !!(typeof T == "string" || typeof T == "function" || T === n || T === o || _ || T === r || T === m || T === p || S || T ===
|
|
613
|
-
g || u || h || typeof T == "object" && T !== null && (T.$$typeof ===
|
|
611
|
+
function b(T) {
|
|
612
|
+
return !!(typeof T == "string" || typeof T == "function" || T === n || T === o || _ || T === r || T === m || T === p || S || T === d ||
|
|
613
|
+
g || u || h || typeof T == "object" && T !== null && (T.$$typeof === y || T.$$typeof === f || T.$$typeof === s || T.$$typeof === i || T.
|
|
614
614
|
$$typeof === a || // This needs to include all possible module reference object
|
|
615
615
|
// types supported by any Flight configuration anywhere since
|
|
616
616
|
// we don't know which Flight build this will end up being used
|
|
617
617
|
// with.
|
|
618
618
|
T.$$typeof === O || T.getModuleId !== void 0));
|
|
619
619
|
}
|
|
620
|
-
c(
|
|
620
|
+
c(b, "isValidElementType");
|
|
621
621
|
function E(T) {
|
|
622
622
|
if (typeof T == "object" && T !== null) {
|
|
623
623
|
var Qe = T.$$typeof;
|
|
624
624
|
switch (Qe) {
|
|
625
625
|
case e:
|
|
626
|
-
var
|
|
627
|
-
switch (
|
|
626
|
+
var Ae = T.type;
|
|
627
|
+
switch (Ae) {
|
|
628
628
|
case n:
|
|
629
629
|
case o:
|
|
630
630
|
case r:
|
|
631
631
|
case m:
|
|
632
632
|
case p:
|
|
633
|
-
return
|
|
633
|
+
return Ae;
|
|
634
634
|
default:
|
|
635
|
-
var xt =
|
|
635
|
+
var xt = Ae && Ae.$$typeof;
|
|
636
636
|
switch (xt) {
|
|
637
637
|
case l:
|
|
638
638
|
case i:
|
|
639
639
|
case a:
|
|
640
|
-
case
|
|
640
|
+
case y:
|
|
641
641
|
case f:
|
|
642
642
|
case s:
|
|
643
643
|
return xt;
|
|
@@ -651,7 +651,7 @@ o"), b = Symbol.for("react.lazy"), y = Symbol.for("react.offscreen"), g = !1, u
|
|
|
651
651
|
}
|
|
652
652
|
}
|
|
653
653
|
c(E, "typeOf");
|
|
654
|
-
var $ = i, C = s,
|
|
654
|
+
var $ = i, C = s, A = e, J = a, te = n, L = y, z = f, X = t, W = o, M = r, D = m, F = p, Z = !1, B = !1;
|
|
655
655
|
function q(T) {
|
|
656
656
|
return Z || (Z = !0, console.warn("The ReactIs.isAsyncMode() alias has been deprecated, and will be removed in React 18+.")), !1;
|
|
657
657
|
}
|
|
@@ -681,7 +681,7 @@ o"), b = Symbol.for("react.lazy"), y = Symbol.for("react.offscreen"), g = !1, u
|
|
|
681
681
|
}
|
|
682
682
|
c(V, "isFragment");
|
|
683
683
|
function ie(T) {
|
|
684
|
-
return E(T) ===
|
|
684
|
+
return E(T) === y;
|
|
685
685
|
}
|
|
686
686
|
c(ie, "isLazy");
|
|
687
687
|
function be(T) {
|
|
@@ -700,18 +700,18 @@ o"), b = Symbol.for("react.lazy"), y = Symbol.for("react.offscreen"), g = !1, u
|
|
|
700
700
|
return E(T) === r;
|
|
701
701
|
}
|
|
702
702
|
c(we, "isStrictMode");
|
|
703
|
-
function
|
|
703
|
+
function Re(T) {
|
|
704
704
|
return E(T) === m;
|
|
705
705
|
}
|
|
706
|
-
c(
|
|
706
|
+
c(Re, "isSuspense");
|
|
707
707
|
function pr(T) {
|
|
708
708
|
return E(T) === p;
|
|
709
709
|
}
|
|
710
|
-
c(pr, "isSuspenseList"),
|
|
711
|
-
z,
|
|
712
|
-
K,
|
|
713
|
-
_e,
|
|
714
|
-
}()),
|
|
710
|
+
c(pr, "isSuspenseList"), R.ContextConsumer = $, R.ContextProvider = C, R.Element = A, R.ForwardRef = J, R.Fragment = te, R.Lazy = L, R.Memo =
|
|
711
|
+
z, R.Portal = X, R.Profiler = W, R.StrictMode = M, R.Suspense = D, R.SuspenseList = F, R.isAsyncMode = q, R.isConcurrentMode = se, R.isContextConsumer =
|
|
712
|
+
K, R.isContextProvider = G, R.isElement = ce, R.isForwardRef = Q, R.isFragment = V, R.isLazy = ie, R.isMemo = be, R.isPortal = le, R.isProfiler =
|
|
713
|
+
_e, R.isStrictMode = we, R.isSuspense = Re, R.isSuspenseList = pr, R.isValidElementType = b, R.typeOf = E;
|
|
714
|
+
}()), R;
|
|
715
715
|
}
|
|
716
716
|
c(mo, "requireReactIs_development");
|
|
717
717
|
var qt;
|
|
@@ -797,16 +797,16 @@ r, o, s) : "", e.children ? st(e.children, t, n + t.indent, r, o, s) : "", t, n)
|
|
|
797
797
|
Co, "test"), wo = {
|
|
798
798
|
serialize: Oo,
|
|
799
799
|
test: $o
|
|
800
|
-
}, ln = Object.prototype.toString,
|
|
800
|
+
}, ln = Object.prototype.toString, Ro = Date.prototype.toISOString, Ao = Error.prototype.toString, Gt = RegExp.prototype.toString;
|
|
801
801
|
function Le(e) {
|
|
802
802
|
return typeof e.constructor == "function" && e.constructor.name || "Object";
|
|
803
803
|
}
|
|
804
804
|
c(Le, "getConstructorName");
|
|
805
|
-
function
|
|
805
|
+
function Po(e) {
|
|
806
806
|
return typeof window < "u" && e === window;
|
|
807
807
|
}
|
|
808
|
-
c(
|
|
809
|
-
var
|
|
808
|
+
c(Po, "isWindow");
|
|
809
|
+
var No = /^Symbol\((.*)\)(.*)$/, Io = /\n/g, De = class extends Error {
|
|
810
810
|
static {
|
|
811
811
|
c(this, "PrettyFormatPluginError");
|
|
812
812
|
}
|
|
@@ -833,11 +833,11 @@ function Ht(e, t) {
|
|
|
833
833
|
}
|
|
834
834
|
c(Ht, "printFunction");
|
|
835
835
|
function Jt(e) {
|
|
836
|
-
return String(e).replace(
|
|
836
|
+
return String(e).replace(No, "Symbol($1)");
|
|
837
837
|
}
|
|
838
838
|
c(Jt, "printSymbol");
|
|
839
839
|
function Xt(e) {
|
|
840
|
-
return `[${
|
|
840
|
+
return `[${Ao.call(e)}]`;
|
|
841
841
|
}
|
|
842
842
|
c(Xt, "printError");
|
|
843
843
|
function fn(e, t, n, r) {
|
|
@@ -860,7 +860,7 @@ function fn(e, t, n, r) {
|
|
|
860
860
|
return Jt(e);
|
|
861
861
|
let s = ln.call(e);
|
|
862
862
|
return s === "[object WeakMap]" ? "WeakMap {}" : s === "[object WeakSet]" ? "WeakSet {}" : s === "[object Function]" || s === "[object Gen\
|
|
863
|
-
eratorFunction]" ? Ht(e, t) : s === "[object Symbol]" ? Jt(e) : s === "[object Date]" ? Number.isNaN(+e) ? "Date { NaN }" :
|
|
863
|
+
eratorFunction]" ? Ht(e, t) : s === "[object Symbol]" ? Jt(e) : s === "[object Date]" ? Number.isNaN(+e) ? "Date { NaN }" : Ro.call(e) : s ===
|
|
864
864
|
"[object Error]" ? Xt(e) : s === "[object RegExp]" ? n ? Gt.call(e).replaceAll(/[$()*+.?[\\\]^{|}]/g, "\\$&") : Gt.call(e) : e instanceof Error ?
|
|
865
865
|
Xt(e) : null;
|
|
866
866
|
}
|
|
@@ -876,7 +876,7 @@ function mn(e, t, n, r, o, s) {
|
|
|
876
876
|
return a === "[object Arguments]" ? i ? "[Arguments]" : `${l ? "" : "Arguments "}[${xe(e, t, n, r, o, fe)}]` : Mo(a) ? i ? `[${e.constructor.
|
|
877
877
|
name}]` : `${l || !t.printBasicPrototype && e.constructor.name === "Array" ? "" : `${e.constructor.name} `}[${xe(e, t, n, r, o, fe)}]` : a ===
|
|
878
878
|
"[object Map]" ? i ? "[Map]" : `Map {${Te(e.entries(), t, n, r, o, fe, " => ")}}` : a === "[object Set]" ? i ? "[Set]" : `Set {${nt(e.values(),
|
|
879
|
-
t, n, r, o, fe)}}` : i ||
|
|
879
|
+
t, n, r, o, fe)}}` : i || Po(e) ? `[${Le(e)}]` : `${l || !t.printBasicPrototype && Le(e) === "Object" ? "" : `${Le(e)} `}{${rt(e, t, n, r,
|
|
880
880
|
o, fe)}}`;
|
|
881
881
|
}
|
|
882
882
|
c(mn, "printComplexValue");
|
|
@@ -985,14 +985,14 @@ function ko() {
|
|
|
985
985
|
}, e), /* @__PURE__ */ Object.create(null));
|
|
986
986
|
}
|
|
987
987
|
c(ko, "getColorsEmpty");
|
|
988
|
-
function
|
|
988
|
+
function dn(e) {
|
|
989
989
|
return e?.printFunctionName ?? re.printFunctionName;
|
|
990
990
|
}
|
|
991
|
-
c(
|
|
992
|
-
function
|
|
991
|
+
c(dn, "getPrintFunctionName");
|
|
992
|
+
function yn(e) {
|
|
993
993
|
return e?.escapeRegex ?? re.escapeRegex;
|
|
994
994
|
}
|
|
995
|
-
c(
|
|
995
|
+
c(yn, "getEscapeRegex");
|
|
996
996
|
function bn(e) {
|
|
997
997
|
return e?.escapeString ?? re.escapeString;
|
|
998
998
|
}
|
|
@@ -1002,7 +1002,7 @@ function Zt(e) {
|
|
|
1002
1002
|
callToJSON: e?.callToJSON ?? re.callToJSON,
|
|
1003
1003
|
colors: e?.highlight ? Bo() : ko(),
|
|
1004
1004
|
compareKeys: typeof e?.compareKeys == "function" || e?.compareKeys === null ? e.compareKeys : re.compareKeys,
|
|
1005
|
-
escapeRegex:
|
|
1005
|
+
escapeRegex: yn(e),
|
|
1006
1006
|
escapeString: bn(e),
|
|
1007
1007
|
indent: e?.min ? "" : zo(e?.indent ?? re.indent),
|
|
1008
1008
|
maxDepth: e?.maxDepth ?? re.maxDepth,
|
|
@@ -1010,7 +1010,7 @@ function Zt(e) {
|
|
|
1010
1010
|
min: e?.min ?? re.min,
|
|
1011
1011
|
plugins: e?.plugins ?? re.plugins,
|
|
1012
1012
|
printBasicPrototype: e?.printBasicPrototype ?? !0,
|
|
1013
|
-
printFunctionName:
|
|
1013
|
+
printFunctionName: dn(e),
|
|
1014
1014
|
spacingInner: e?.min ? " " : `
|
|
1015
1015
|
`,
|
|
1016
1016
|
spacingOuter: e?.min ? "" : `
|
|
@@ -1028,12 +1028,12 @@ function v(e, t) {
|
|
|
1028
1028
|
if (r !== null)
|
|
1029
1029
|
return pn(r, e, Zt(t), "", 0, []);
|
|
1030
1030
|
}
|
|
1031
|
-
let n = fn(e,
|
|
1031
|
+
let n = fn(e, dn(t), yn(t), bn(t));
|
|
1032
1032
|
return n !== null ? n : mn(e, Zt(t), "", 0, []);
|
|
1033
1033
|
}
|
|
1034
1034
|
c(v, "format");
|
|
1035
1035
|
var Oe = {
|
|
1036
|
-
AsymmetricMatcher:
|
|
1036
|
+
AsymmetricMatcher: Rr,
|
|
1037
1037
|
DOMCollection: xr,
|
|
1038
1038
|
DOMElement: Vr,
|
|
1039
1039
|
Immutable: so,
|
|
@@ -1142,13 +1142,13 @@ function j(e, t, n, r = ", ") {
|
|
|
1142
1142
|
for (let m = 0; m < o; m += 1) {
|
|
1143
1143
|
let p = m + 1 === e.length, f = m + 2 === e.length;
|
|
1144
1144
|
a = `${ue}(${e.length - m})`;
|
|
1145
|
-
let
|
|
1145
|
+
let y = e[m];
|
|
1146
1146
|
t.truncate = s - i.length - (p ? 0 : r.length);
|
|
1147
|
-
let
|
|
1147
|
+
let d = l || n(y, t) + (p ? "" : r), g = i.length + d.length, u = g + a.length;
|
|
1148
1148
|
if (p && g > s && i.length + a.length <= s || !p && !f && u > s || (l = p ? "" : n(e[m + 1], t) + (f ? "" : r), !p && f && u > s && g + l.
|
|
1149
1149
|
length > s))
|
|
1150
1150
|
break;
|
|
1151
|
-
if (i +=
|
|
1151
|
+
if (i += d, !p && !f && g + l.length >= s) {
|
|
1152
1152
|
a = `${ue}(${e.length - m - 1})`;
|
|
1153
1153
|
break;
|
|
1154
1154
|
}
|
|
@@ -1335,10 +1335,10 @@ function ht(e, t) {
|
|
|
1335
1335
|
c(ht, "inspectClass");
|
|
1336
1336
|
|
|
1337
1337
|
// ../node_modules/loupe/lib/arguments.js
|
|
1338
|
-
function
|
|
1338
|
+
function dt(e, t) {
|
|
1339
1339
|
return e.length === 0 ? "Arguments[]" : (t.truncate -= 13, `Arguments[ ${j(e, t)} ]`);
|
|
1340
1340
|
}
|
|
1341
|
-
c(
|
|
1341
|
+
c(dt, "inspectArguments");
|
|
1342
1342
|
|
|
1343
1343
|
// ../node_modules/loupe/lib/error.js
|
|
1344
1344
|
var es = [
|
|
@@ -1354,7 +1354,7 @@ var es = [
|
|
|
1354
1354
|
"description",
|
|
1355
1355
|
"cause"
|
|
1356
1356
|
];
|
|
1357
|
-
function
|
|
1357
|
+
function yt(e, t) {
|
|
1358
1358
|
let n = Object.getOwnPropertyNames(e).filter((i) => es.indexOf(i) === -1), r = e.name;
|
|
1359
1359
|
t.truncate -= r.length;
|
|
1360
1360
|
let o = "";
|
|
@@ -1365,7 +1365,7 @@ function dt(e, t) {
|
|
|
1365
1365
|
let s = j(n.map((i) => [i, e[i]]), t, ae);
|
|
1366
1366
|
return `${r}${o}${s ? ` { ${s} }` : ""}`;
|
|
1367
1367
|
}
|
|
1368
|
-
c(
|
|
1368
|
+
c(yt, "inspectObject");
|
|
1369
1369
|
|
|
1370
1370
|
// ../node_modules/loupe/lib/html.js
|
|
1371
1371
|
function ts([e, t], n) {
|
|
@@ -1426,7 +1426,7 @@ for("nodejs.util.inspect.custom"), On = /* @__PURE__ */ new WeakMap(), $n = {},
|
|
|
1426
1426
|
// WeakSet, WeakMap are totally opaque to us
|
|
1427
1427
|
WeakSet: /* @__PURE__ */ c((e, t) => t.stylize("WeakSet{\u2026}", "special"), "WeakSet"),
|
|
1428
1428
|
WeakMap: /* @__PURE__ */ c((e, t) => t.stylize("WeakMap{\u2026}", "special"), "WeakMap"),
|
|
1429
|
-
Arguments:
|
|
1429
|
+
Arguments: dt,
|
|
1430
1430
|
Int8Array: oe,
|
|
1431
1431
|
Uint8Array: oe,
|
|
1432
1432
|
Uint8ClampedArray: oe,
|
|
@@ -1439,7 +1439,7 @@ for("nodejs.util.inspect.custom"), On = /* @__PURE__ */ new WeakMap(), $n = {},
|
|
|
1439
1439
|
Generator: /* @__PURE__ */ c(() => "", "Generator"),
|
|
1440
1440
|
DataView: /* @__PURE__ */ c(() => "", "DataView"),
|
|
1441
1441
|
ArrayBuffer: /* @__PURE__ */ c(() => "", "ArrayBuffer"),
|
|
1442
|
-
Error:
|
|
1442
|
+
Error: yt,
|
|
1443
1443
|
HTMLCollection: Ue,
|
|
1444
1444
|
NodeList: Ue
|
|
1445
1445
|
}, os = /* @__PURE__ */ c((e, t, n) => bt in e && typeof e[bt] == "function" ? e[bt](t) : St in e && typeof e[St] == "function" ? e[St](t.depth,
|
|
@@ -1461,7 +1461,7 @@ onstructor" in e ? e.constructor !== Object ? ht(e, n) : ge(e, n) : e === Object
|
|
|
1461
1461
|
c(Ve, "inspect");
|
|
1462
1462
|
|
|
1463
1463
|
// ../node_modules/@vitest/utils/dist/chunk-_commonjsHelpers.js
|
|
1464
|
-
var { AsymmetricMatcher: cs, DOMCollection: us, DOMElement: as, Immutable: ls, ReactElement: fs, ReactTestComponent: ms } = Oe,
|
|
1464
|
+
var { AsymmetricMatcher: cs, DOMCollection: us, DOMElement: as, Immutable: ls, ReactElement: fs, ReactTestComponent: ms } = Oe, Rn = [
|
|
1465
1465
|
ms,
|
|
1466
1466
|
fs,
|
|
1467
1467
|
as,
|
|
@@ -1475,7 +1475,7 @@ function he(e, t = 10, { maxLength: n, ...r } = {}) {
|
|
|
1475
1475
|
s = v(e, {
|
|
1476
1476
|
maxDepth: t,
|
|
1477
1477
|
escapeString: !1,
|
|
1478
|
-
plugins:
|
|
1478
|
+
plugins: Rn,
|
|
1479
1479
|
...r
|
|
1480
1480
|
});
|
|
1481
1481
|
} catch {
|
|
@@ -1483,7 +1483,7 @@ function he(e, t = 10, { maxLength: n, ...r } = {}) {
|
|
|
1483
1483
|
callToJSON: !1,
|
|
1484
1484
|
maxDepth: t,
|
|
1485
1485
|
escapeString: !1,
|
|
1486
|
-
plugins:
|
|
1486
|
+
plugins: Rn,
|
|
1487
1487
|
...r
|
|
1488
1488
|
});
|
|
1489
1489
|
}
|
|
@@ -1494,7 +1494,7 @@ function he(e, t = 10, { maxLength: n, ...r } = {}) {
|
|
|
1494
1494
|
}
|
|
1495
1495
|
c(he, "stringify");
|
|
1496
1496
|
var ps = /%[sdjifoOc%]/g;
|
|
1497
|
-
function
|
|
1497
|
+
function An(...e) {
|
|
1498
1498
|
if (typeof e[0] != "string") {
|
|
1499
1499
|
let s = [];
|
|
1500
1500
|
for (let i = 0; i < e.length; i++)
|
|
@@ -1554,15 +1554,15 @@ function Rn(...e) {
|
|
|
1554
1554
|
s === null || typeof s != "object" ? o += ` ${s}` : o += ` ${$e(s)}`;
|
|
1555
1555
|
return o;
|
|
1556
1556
|
}
|
|
1557
|
-
c(
|
|
1557
|
+
c(An, "format");
|
|
1558
1558
|
function $e(e, t = {}) {
|
|
1559
1559
|
return t.truncate === 0 && (t.truncate = Number.POSITIVE_INFINITY), Ve(e, t);
|
|
1560
1560
|
}
|
|
1561
1561
|
c($e, "inspect");
|
|
1562
|
-
function
|
|
1562
|
+
function Pn(e) {
|
|
1563
1563
|
return e && e.__esModule && Object.prototype.hasOwnProperty.call(e, "default") ? e.default : e;
|
|
1564
1564
|
}
|
|
1565
|
-
c(
|
|
1565
|
+
c(Pn, "getDefaultExportFromCjs");
|
|
1566
1566
|
|
|
1567
1567
|
// ../node_modules/@vitest/utils/dist/helpers.js
|
|
1568
1568
|
function gs(e) {
|
|
@@ -1583,12 +1583,12 @@ function _t(e) {
|
|
|
1583
1583
|
return gs(e) ? [] : (hs(e, t), Array.from(t));
|
|
1584
1584
|
}
|
|
1585
1585
|
c(_t, "getOwnProperties");
|
|
1586
|
-
var
|
|
1587
|
-
function Ct(e, t =
|
|
1586
|
+
var Nn = { forceWritable: !1 };
|
|
1587
|
+
function Ct(e, t = Nn) {
|
|
1588
1588
|
return Et(e, /* @__PURE__ */ new WeakMap(), t);
|
|
1589
1589
|
}
|
|
1590
1590
|
c(Ct, "deepClone");
|
|
1591
|
-
function Et(e, t, n =
|
|
1591
|
+
function Et(e, t, n = Nn) {
|
|
1592
1592
|
let r, o;
|
|
1593
1593
|
if (t.has(e))
|
|
1594
1594
|
return t.get(e);
|
|
@@ -1637,7 +1637,7 @@ var U = -1, k = 1, x = 0, I = class {
|
|
|
1637
1637
|
this[0] = t, this[1] = n;
|
|
1638
1638
|
}
|
|
1639
1639
|
};
|
|
1640
|
-
function
|
|
1640
|
+
function ds(e, t) {
|
|
1641
1641
|
if (!e || !t || e.charAt(0) !== t.charAt(0))
|
|
1642
1642
|
return 0;
|
|
1643
1643
|
let n = 0, r = Math.min(e.length, t.length), o = r, s = 0;
|
|
@@ -1645,7 +1645,7 @@ function ys(e, t) {
|
|
|
1645
1645
|
e.substring(s, o) === t.substring(s, o) ? (n = o, s = n) : r = o, o = Math.floor((r - n) / 2 + n);
|
|
1646
1646
|
return o;
|
|
1647
1647
|
}
|
|
1648
|
-
c(
|
|
1648
|
+
c(ds, "diff_commonPrefix");
|
|
1649
1649
|
function Kn(e, t) {
|
|
1650
1650
|
if (!e || !t || e.charAt(e.length - 1) !== t.charAt(t.length - 1))
|
|
1651
1651
|
return 0;
|
|
@@ -1673,7 +1673,7 @@ function In(e, t) {
|
|
|
1673
1673
|
}
|
|
1674
1674
|
}
|
|
1675
1675
|
c(In, "diff_commonOverlap_");
|
|
1676
|
-
function
|
|
1676
|
+
function ys(e) {
|
|
1677
1677
|
let t = !1, n = [], r = 0, o = null, s = 0, i = 0, l = 0, a = 0, m = 0;
|
|
1678
1678
|
for (; s < e.length; )
|
|
1679
1679
|
e[s][0] === x ? (n[r++] = s, i = a, l = m, a = 0, m = 0, o = e[s][1]) : (e[s][0] === k ? a += e[s][1].length : m += e[s][1].length, o &&
|
|
@@ -1681,15 +1681,15 @@ function ds(e) {
|
|
|
1681
1681
|
0 ? n[r - 1] : -1, i = 0, l = 0, a = 0, m = 0, o = null, t = !0)), s++;
|
|
1682
1682
|
for (t && Gn(e), Es(e), s = 1; s < e.length; ) {
|
|
1683
1683
|
if (e[s - 1][0] === U && e[s][0] === k) {
|
|
1684
|
-
let p = e[s - 1][1], f = e[s][1],
|
|
1685
|
-
|
|
1686
|
-
|
|
1687
|
-
1][0] = k, e[s - 1][1] = f.substring(0, f.length -
|
|
1684
|
+
let p = e[s - 1][1], f = e[s][1], y = In(p, f), d = In(f, p);
|
|
1685
|
+
y >= d ? (y >= p.length / 2 || y >= f.length / 2) && (e.splice(s, 0, new I(x, f.substring(0, y))), e[s - 1][1] = p.substring(0, p.length -
|
|
1686
|
+
y), e[s + 1][1] = f.substring(y), s++) : (d >= p.length / 2 || d >= f.length / 2) && (e.splice(s, 0, new I(x, p.substring(0, d))), e[s -
|
|
1687
|
+
1][0] = k, e[s - 1][1] = f.substring(0, f.length - d), e[s + 1][0] = U, e[s + 1][1] = p.substring(d), s++), s++;
|
|
1688
1688
|
}
|
|
1689
1689
|
s++;
|
|
1690
1690
|
}
|
|
1691
1691
|
}
|
|
1692
|
-
c(
|
|
1692
|
+
c(ys, "diff_cleanupSemantic");
|
|
1693
1693
|
var Mn = /[^a-z0-9]/i, Ln = /\s/, xn = /[\r\n]/, bs = /\n\r?\n$/, Ss = /^\r?\n\r?\n/;
|
|
1694
1694
|
function Es(e) {
|
|
1695
1695
|
let t = 1;
|
|
@@ -1724,7 +1724,7 @@ function Gn(e) {
|
|
|
1724
1724
|
n++, o += e[t][1], t++;
|
|
1725
1725
|
break;
|
|
1726
1726
|
case x:
|
|
1727
|
-
n + r > 1 ? (n !== 0 && r !== 0 && (i =
|
|
1727
|
+
n + r > 1 ? (n !== 0 && r !== 0 && (i = ds(s, o), i !== 0 && (t - n - r > 0 && e[t - n - r - 1][0] === x ? e[t - n - r - 1][1] += s.
|
|
1728
1728
|
substring(0, i) : (e.splice(0, 0, new I(x, s.substring(0, i))), t++), s = s.substring(i), o = o.substring(i)), i = Kn(s, o), i !== 0 &&
|
|
1729
1729
|
(e[t][1] = s.substring(s.length - i) + e[t][1], s = s.substring(0, s.length - i), o = o.substring(0, o.length - i))), t -= n + r, e.
|
|
1730
1730
|
splice(t, n + r), o.length && (e.splice(t, 0, new I(U, o)), t++), s.length && (e.splice(t, 0, new I(k, s)), t++), t++) : t !== 0 && e[t -
|
|
@@ -1755,51 +1755,51 @@ function Cs() {
|
|
|
1755
1755
|
if (Dn) return Ge;
|
|
1756
1756
|
Dn = 1, Object.defineProperty(Ge, "__esModule", {
|
|
1757
1757
|
value: !0
|
|
1758
|
-
}), Ge.default =
|
|
1759
|
-
let e = "diff-sequences", t = 0, n = /* @__PURE__ */ c((
|
|
1758
|
+
}), Ge.default = y;
|
|
1759
|
+
let e = "diff-sequences", t = 0, n = /* @__PURE__ */ c((d, g, u, h, S) => {
|
|
1760
1760
|
let _ = 0;
|
|
1761
|
-
for (;
|
|
1762
|
-
|
|
1761
|
+
for (; d < g && u < h && S(d, u); )
|
|
1762
|
+
d += 1, u += 1, _ += 1;
|
|
1763
1763
|
return _;
|
|
1764
|
-
}, "countCommonItemsF"), r = /* @__PURE__ */ c((
|
|
1764
|
+
}, "countCommonItemsF"), r = /* @__PURE__ */ c((d, g, u, h, S) => {
|
|
1765
1765
|
let _ = 0;
|
|
1766
|
-
for (;
|
|
1766
|
+
for (; d <= g && u <= h && S(g, h); )
|
|
1767
1767
|
g -= 1, h -= 1, _ += 1;
|
|
1768
1768
|
return _;
|
|
1769
|
-
}, "countCommonItemsR"), o = /* @__PURE__ */ c((
|
|
1770
|
-
let
|
|
1771
|
-
_[
|
|
1769
|
+
}, "countCommonItemsR"), o = /* @__PURE__ */ c((d, g, u, h, S, _, O) => {
|
|
1770
|
+
let b = 0, E = -d, $ = _[b], C = $;
|
|
1771
|
+
_[b] += n(
|
|
1772
1772
|
$ + 1,
|
|
1773
1773
|
g,
|
|
1774
1774
|
h + $ - E + 1,
|
|
1775
1775
|
u,
|
|
1776
1776
|
S
|
|
1777
1777
|
);
|
|
1778
|
-
let
|
|
1779
|
-
for (
|
|
1780
|
-
if (
|
|
1781
|
-
$ = _[
|
|
1778
|
+
let A = d < O ? d : O;
|
|
1779
|
+
for (b += 1, E += 2; b <= A; b += 1, E += 2) {
|
|
1780
|
+
if (b !== d && C < _[b])
|
|
1781
|
+
$ = _[b];
|
|
1782
1782
|
else if ($ = C + 1, g <= $)
|
|
1783
|
-
return
|
|
1784
|
-
C = _[
|
|
1783
|
+
return b - 1;
|
|
1784
|
+
C = _[b], _[b] = $ + n($ + 1, g, h + $ - E + 1, u, S);
|
|
1785
1785
|
}
|
|
1786
1786
|
return O;
|
|
1787
|
-
}, "extendPathsF"), s = /* @__PURE__ */ c((
|
|
1788
|
-
let
|
|
1789
|
-
_[
|
|
1787
|
+
}, "extendPathsF"), s = /* @__PURE__ */ c((d, g, u, h, S, _, O) => {
|
|
1788
|
+
let b = 0, E = d, $ = _[b], C = $;
|
|
1789
|
+
_[b] -= r(
|
|
1790
1790
|
g,
|
|
1791
1791
|
$ - 1,
|
|
1792
1792
|
u,
|
|
1793
1793
|
h + $ - E - 1,
|
|
1794
1794
|
S
|
|
1795
1795
|
);
|
|
1796
|
-
let
|
|
1797
|
-
for (
|
|
1798
|
-
if (
|
|
1799
|
-
$ = _[
|
|
1796
|
+
let A = d < O ? d : O;
|
|
1797
|
+
for (b += 1, E -= 2; b <= A; b += 1, E -= 2) {
|
|
1798
|
+
if (b !== d && _[b] < C)
|
|
1799
|
+
$ = _[b];
|
|
1800
1800
|
else if ($ = C - 1, $ < g)
|
|
1801
|
-
return
|
|
1802
|
-
C = _[
|
|
1801
|
+
return b - 1;
|
|
1802
|
+
C = _[b], _[b] = $ - r(
|
|
1803
1803
|
g,
|
|
1804
1804
|
$ - 1,
|
|
1805
1805
|
u,
|
|
@@ -1808,10 +1808,10 @@ function Cs() {
|
|
|
1808
1808
|
);
|
|
1809
1809
|
}
|
|
1810
1810
|
return O;
|
|
1811
|
-
}, "extendPathsR"), i = /* @__PURE__ */ c((
|
|
1812
|
-
let
|
|
1813
|
-
for (let D = 0, F = -
|
|
1814
|
-
let Z = D === 0 || D !==
|
|
1811
|
+
}, "extendPathsR"), i = /* @__PURE__ */ c((d, g, u, h, S, _, O, b, E, $, C) => {
|
|
1812
|
+
let A = h - g, J = u - g, L = S - h - J, z = -L - (d - 1), X = -L + (d - 1), W = t, M = d < b ? d : b;
|
|
1813
|
+
for (let D = 0, F = -d; D <= M; D += 1, F += 2) {
|
|
1814
|
+
let Z = D === 0 || D !== d && W < O[D], B = Z ? O[D] : W, q = Z ? B : B + 1, se = A + q - F, K = n(
|
|
1815
1815
|
q + 1,
|
|
1816
1816
|
u,
|
|
1817
1817
|
se + 1,
|
|
@@ -1819,29 +1819,29 @@ function Cs() {
|
|
|
1819
1819
|
_
|
|
1820
1820
|
), G = q + K;
|
|
1821
1821
|
if (W = O[D], O[D] = G, z <= F && F <= X) {
|
|
1822
|
-
let ce = (
|
|
1822
|
+
let ce = (d - 1 - (F + L)) / 2;
|
|
1823
1823
|
if (ce <= $ && E[ce] - 1 <= G) {
|
|
1824
|
-
let Q =
|
|
1824
|
+
let Q = A + B - (Z ? F + 1 : F - 1), V = r(
|
|
1825
1825
|
g,
|
|
1826
1826
|
B,
|
|
1827
1827
|
h,
|
|
1828
1828
|
Q,
|
|
1829
1829
|
_
|
|
1830
1830
|
), ie = B - V, be = Q - V, le = ie + 1, _e = be + 1;
|
|
1831
|
-
C.nChangePreceding =
|
|
1831
|
+
C.nChangePreceding = d - 1, d - 1 === le + _e - g - h ? (C.aEndPreceding = g, C.bEndPreceding = h) : (C.aEndPreceding = le, C.bEndPreceding =
|
|
1832
1832
|
_e), C.nCommonPreceding = V, V !== 0 && (C.aCommonPreceding = le, C.bCommonPreceding = _e), C.nCommonFollowing = K, K !== 0 && (C.
|
|
1833
1833
|
aCommonFollowing = q + 1, C.bCommonFollowing = se + 1);
|
|
1834
|
-
let we = G + 1,
|
|
1835
|
-
return C.nChangeFollowing =
|
|
1836
|
-
we, C.bStartFollowing =
|
|
1834
|
+
let we = G + 1, Re = se + K + 1;
|
|
1835
|
+
return C.nChangeFollowing = d - 1, d - 1 === u + S - we - Re ? (C.aStartFollowing = u, C.bStartFollowing = S) : (C.aStartFollowing =
|
|
1836
|
+
we, C.bStartFollowing = Re), !0;
|
|
1837
1837
|
}
|
|
1838
1838
|
}
|
|
1839
1839
|
}
|
|
1840
1840
|
return !1;
|
|
1841
|
-
}, "extendOverlappablePathsF"), l = /* @__PURE__ */ c((
|
|
1842
|
-
let
|
|
1843
|
-
for (let D = 0, F =
|
|
1844
|
-
let Z = D === 0 || D !==
|
|
1841
|
+
}, "extendOverlappablePathsF"), l = /* @__PURE__ */ c((d, g, u, h, S, _, O, b, E, $, C) => {
|
|
1842
|
+
let A = S - u, J = u - g, L = S - h - J, z = L - d, X = L + d, W = t, M = d < $ ? d : $;
|
|
1843
|
+
for (let D = 0, F = d; D <= M; D += 1, F -= 2) {
|
|
1844
|
+
let Z = D === 0 || D !== d && E[D] < W, B = Z ? E[D] : W, q = Z ? B : B - 1, se = A + q - F, K = r(
|
|
1845
1845
|
g,
|
|
1846
1846
|
q - 1,
|
|
1847
1847
|
h,
|
|
@@ -1849,14 +1849,14 @@ function Cs() {
|
|
|
1849
1849
|
_
|
|
1850
1850
|
), G = q - K;
|
|
1851
1851
|
if (W = E[D], E[D] = G, z <= F && F <= X) {
|
|
1852
|
-
let ce = (
|
|
1853
|
-
if (ce <=
|
|
1852
|
+
let ce = (d + (F - L)) / 2;
|
|
1853
|
+
if (ce <= b && G - 1 <= O[ce]) {
|
|
1854
1854
|
let Q = se - K;
|
|
1855
|
-
if (C.nChangePreceding =
|
|
1856
|
-
Q), C.nCommonPreceding = K, K !== 0 && (C.aCommonPreceding = G, C.bCommonPreceding = Q), C.nChangeFollowing =
|
|
1855
|
+
if (C.nChangePreceding = d, d === G + Q - g - h ? (C.aEndPreceding = g, C.bEndPreceding = h) : (C.aEndPreceding = G, C.bEndPreceding =
|
|
1856
|
+
Q), C.nCommonPreceding = K, K !== 0 && (C.aCommonPreceding = G, C.bCommonPreceding = Q), C.nChangeFollowing = d - 1, d === 1)
|
|
1857
1857
|
C.nCommonFollowing = 0, C.aStartFollowing = u, C.bStartFollowing = S;
|
|
1858
1858
|
else {
|
|
1859
|
-
let V =
|
|
1859
|
+
let V = A + B - (Z ? F - 1 : F + 1), ie = n(
|
|
1860
1860
|
B,
|
|
1861
1861
|
u,
|
|
1862
1862
|
V,
|
|
@@ -1865,20 +1865,20 @@ function Cs() {
|
|
|
1865
1865
|
);
|
|
1866
1866
|
C.nCommonFollowing = ie, ie !== 0 && (C.aCommonFollowing = B, C.bCommonFollowing = V);
|
|
1867
1867
|
let be = B + ie, le = V + ie;
|
|
1868
|
-
|
|
1868
|
+
d - 1 === u + S - be - le ? (C.aStartFollowing = u, C.bStartFollowing = S) : (C.aStartFollowing = be, C.bStartFollowing = le);
|
|
1869
1869
|
}
|
|
1870
1870
|
return !0;
|
|
1871
1871
|
}
|
|
1872
1872
|
}
|
|
1873
1873
|
}
|
|
1874
1874
|
return !1;
|
|
1875
|
-
}, "extendOverlappablePathsR"), a = /* @__PURE__ */ c((
|
|
1876
|
-
let $ = h - g, C = S - u,
|
|
1877
|
-
if (O[0] = g - 1,
|
|
1878
|
-
let X = (
|
|
1875
|
+
}, "extendOverlappablePathsR"), a = /* @__PURE__ */ c((d, g, u, h, S, _, O, b, E) => {
|
|
1876
|
+
let $ = h - g, C = S - u, A = u - g, J = S - h, te = J - A, L = A, z = A;
|
|
1877
|
+
if (O[0] = g - 1, b[0] = u, te % 2 === 0) {
|
|
1878
|
+
let X = (d || te) / 2, W = (A + J) / 2;
|
|
1879
1879
|
for (let M = 1; M <= W; M += 1)
|
|
1880
1880
|
if (L = o(M, u, S, $, _, O, L), M < X)
|
|
1881
|
-
z = s(M, g, h, C, _,
|
|
1881
|
+
z = s(M, g, h, C, _, b, z);
|
|
1882
1882
|
else if (
|
|
1883
1883
|
// If a reverse path overlaps a forward path in the same diagonal,
|
|
1884
1884
|
// return a division of the index intervals at the middle change.
|
|
@@ -1891,14 +1891,14 @@ function Cs() {
|
|
|
1891
1891
|
_,
|
|
1892
1892
|
O,
|
|
1893
1893
|
L,
|
|
1894
|
-
|
|
1894
|
+
b,
|
|
1895
1895
|
z,
|
|
1896
1896
|
E
|
|
1897
1897
|
)
|
|
1898
1898
|
)
|
|
1899
1899
|
return;
|
|
1900
1900
|
} else {
|
|
1901
|
-
let X = ((
|
|
1901
|
+
let X = ((d || te) + 1) / 2, W = (A + J + 1) / 2, M = 1;
|
|
1902
1902
|
for (L = o(M, u, S, $, _, O, L), M += 1; M <= W; M += 1)
|
|
1903
1903
|
if (z = s(
|
|
1904
1904
|
M - 1,
|
|
@@ -1906,7 +1906,7 @@ function Cs() {
|
|
|
1906
1906
|
h,
|
|
1907
1907
|
C,
|
|
1908
1908
|
_,
|
|
1909
|
-
|
|
1909
|
+
b,
|
|
1910
1910
|
z
|
|
1911
1911
|
), M < X)
|
|
1912
1912
|
L = o(M, u, S, $, _, O, L);
|
|
@@ -1922,7 +1922,7 @@ function Cs() {
|
|
|
1922
1922
|
_,
|
|
1923
1923
|
O,
|
|
1924
1924
|
L,
|
|
1925
|
-
|
|
1925
|
+
b,
|
|
1926
1926
|
z,
|
|
1927
1927
|
E
|
|
1928
1928
|
)
|
|
@@ -1932,7 +1932,7 @@ function Cs() {
|
|
|
1932
1932
|
throw new Error(
|
|
1933
1933
|
`${e}: no overlap aStart=${g} aEnd=${u} bStart=${h} bEnd=${S}`
|
|
1934
1934
|
);
|
|
1935
|
-
}, "divide"), m = /* @__PURE__ */ c((
|
|
1935
|
+
}, "divide"), m = /* @__PURE__ */ c((d, g, u, h, S, _, O, b, E, $) => {
|
|
1936
1936
|
if (S - h < u - g) {
|
|
1937
1937
|
if (_ = !_, _ && O.length === 1) {
|
|
1938
1938
|
let { foundSubsequence: G, isCommon: ce } = O[0];
|
|
@@ -1946,15 +1946,15 @@ function Cs() {
|
|
|
1946
1946
|
let se = g, K = u;
|
|
1947
1947
|
g = h, u = S, h = se, S = K;
|
|
1948
1948
|
}
|
|
1949
|
-
let { foundSubsequence: C, isCommon:
|
|
1949
|
+
let { foundSubsequence: C, isCommon: A } = O[_ ? 1 : 0];
|
|
1950
1950
|
a(
|
|
1951
|
-
|
|
1951
|
+
d,
|
|
1952
1952
|
g,
|
|
1953
1953
|
u,
|
|
1954
1954
|
h,
|
|
1955
1955
|
S,
|
|
1956
|
-
|
|
1957
|
-
|
|
1956
|
+
A,
|
|
1957
|
+
b,
|
|
1958
1958
|
E,
|
|
1959
1959
|
$
|
|
1960
1960
|
);
|
|
@@ -1980,7 +1980,7 @@ function Cs() {
|
|
|
1980
1980
|
L,
|
|
1981
1981
|
_,
|
|
1982
1982
|
O,
|
|
1983
|
-
|
|
1983
|
+
b,
|
|
1984
1984
|
E,
|
|
1985
1985
|
$
|
|
1986
1986
|
), z !== 0 && C(z, X, W), M !== 0 && C(M, D, F), B < u && q < S && m(
|
|
@@ -1991,34 +1991,34 @@ function Cs() {
|
|
|
1991
1991
|
S,
|
|
1992
1992
|
_,
|
|
1993
1993
|
O,
|
|
1994
|
-
|
|
1994
|
+
b,
|
|
1995
1995
|
E,
|
|
1996
1996
|
$
|
|
1997
1997
|
);
|
|
1998
|
-
}, "findSubsequences"), p = /* @__PURE__ */ c((
|
|
1998
|
+
}, "findSubsequences"), p = /* @__PURE__ */ c((d, g) => {
|
|
1999
1999
|
if (typeof g != "number")
|
|
2000
|
-
throw new TypeError(`${e}: ${
|
|
2000
|
+
throw new TypeError(`${e}: ${d} typeof ${typeof g} is not a number`);
|
|
2001
2001
|
if (!Number.isSafeInteger(g))
|
|
2002
|
-
throw new RangeError(`${e}: ${
|
|
2002
|
+
throw new RangeError(`${e}: ${d} value ${g} is not a safe integer`);
|
|
2003
2003
|
if (g < 0)
|
|
2004
|
-
throw new RangeError(`${e}: ${
|
|
2005
|
-
}, "validateLength"), f = /* @__PURE__ */ c((
|
|
2004
|
+
throw new RangeError(`${e}: ${d} value ${g} is a negative integer`);
|
|
2005
|
+
}, "validateLength"), f = /* @__PURE__ */ c((d, g) => {
|
|
2006
2006
|
let u = typeof g;
|
|
2007
2007
|
if (u !== "function")
|
|
2008
|
-
throw new TypeError(`${e}: ${
|
|
2008
|
+
throw new TypeError(`${e}: ${d} typeof ${u} is not a function`);
|
|
2009
2009
|
}, "validateCallback");
|
|
2010
|
-
function
|
|
2011
|
-
p("aLength",
|
|
2012
|
-
let S = n(0,
|
|
2013
|
-
if (S !== 0 && h(S, 0, 0),
|
|
2014
|
-
let _ = S, O = S,
|
|
2010
|
+
function y(d, g, u, h) {
|
|
2011
|
+
p("aLength", d), p("bLength", g), f("isCommon", u), f("foundSubsequence", h);
|
|
2012
|
+
let S = n(0, d, 0, g, u);
|
|
2013
|
+
if (S !== 0 && h(S, 0, 0), d !== S || g !== S) {
|
|
2014
|
+
let _ = S, O = S, b = r(
|
|
2015
2015
|
_,
|
|
2016
|
-
|
|
2016
|
+
d - 1,
|
|
2017
2017
|
O,
|
|
2018
2018
|
g - 1,
|
|
2019
2019
|
u
|
|
2020
|
-
), E =
|
|
2021
|
-
|
|
2020
|
+
), E = d - b, $ = g - b, C = S + b;
|
|
2021
|
+
d !== C && g !== C && m(
|
|
2022
2022
|
0,
|
|
2023
2023
|
_,
|
|
2024
2024
|
E,
|
|
@@ -2047,31 +2047,31 @@ function Cs() {
|
|
|
2047
2047
|
nCommonFollowing: t,
|
|
2048
2048
|
nCommonPreceding: t
|
|
2049
2049
|
}
|
|
2050
|
-
),
|
|
2050
|
+
), b !== 0 && h(b, E, $);
|
|
2051
2051
|
}
|
|
2052
2052
|
}
|
|
2053
|
-
return c(
|
|
2053
|
+
return c(y, "diffSequence"), Ge;
|
|
2054
2054
|
}
|
|
2055
2055
|
c(Cs, "requireBuild");
|
|
2056
|
-
var Ts = Cs(), Jn = /* @__PURE__ */
|
|
2056
|
+
var Ts = Cs(), Jn = /* @__PURE__ */ Pn(Ts);
|
|
2057
2057
|
function Os(e, t) {
|
|
2058
2058
|
return e.replace(/\s+$/, (n) => t(n));
|
|
2059
2059
|
}
|
|
2060
2060
|
c(Os, "formatTrailingSpaces");
|
|
2061
|
-
function
|
|
2061
|
+
function Pt(e, t, n, r, o, s) {
|
|
2062
2062
|
return e.length !== 0 ? n(`${r} ${Os(e, o)}`) : r !== " " ? n(r) : t && s.length !== 0 ? n(`${r} ${s}`) : "";
|
|
2063
2063
|
}
|
|
2064
|
-
c(
|
|
2064
|
+
c(Pt, "printDiffLine");
|
|
2065
2065
|
function Xn(e, t, { aColor: n, aIndicator: r, changeLineTrailingSpaceColor: o, emptyFirstOrLastLinePlaceholder: s }) {
|
|
2066
|
-
return
|
|
2066
|
+
return Pt(e, t, n, r, o, s);
|
|
2067
2067
|
}
|
|
2068
2068
|
c(Xn, "printDeleteLine");
|
|
2069
2069
|
function Zn(e, t, { bColor: n, bIndicator: r, changeLineTrailingSpaceColor: o, emptyFirstOrLastLinePlaceholder: s }) {
|
|
2070
|
-
return
|
|
2070
|
+
return Pt(e, t, n, r, o, s);
|
|
2071
2071
|
}
|
|
2072
2072
|
c(Zn, "printInsertLine");
|
|
2073
2073
|
function Qn(e, t, { commonColor: n, commonIndicator: r, commonLineTrailingSpaceColor: o, emptyFirstOrLastLinePlaceholder: s }) {
|
|
2074
|
-
return
|
|
2074
|
+
return Pt(e, t, n, r, o, s);
|
|
2075
2075
|
}
|
|
2076
2076
|
c(Qn, "printCommonLine");
|
|
2077
2077
|
function Fn(e, t, n, r, { patchColor: o }) {
|
|
@@ -2081,17 +2081,17 @@ c(Fn, "createPatchMark");
|
|
|
2081
2081
|
function $s(e, t) {
|
|
2082
2082
|
let n = e.length, r = t.contextLines, o = r + r, s = n, i = !1, l = 0, a = 0;
|
|
2083
2083
|
for (; a !== n; ) {
|
|
2084
|
-
let
|
|
2084
|
+
let b = a;
|
|
2085
2085
|
for (; a !== n && e[a][0] === x; )
|
|
2086
2086
|
a += 1;
|
|
2087
|
-
if (
|
|
2088
|
-
if (
|
|
2087
|
+
if (b !== a)
|
|
2088
|
+
if (b === 0)
|
|
2089
2089
|
a > r && (s -= a - r, i = !0);
|
|
2090
2090
|
else if (a === n) {
|
|
2091
|
-
let E = a -
|
|
2091
|
+
let E = a - b;
|
|
2092
2092
|
E > r && (s -= E - r, i = !0);
|
|
2093
2093
|
} else {
|
|
2094
|
-
let E = a -
|
|
2094
|
+
let E = a - b;
|
|
2095
2095
|
E > o && (s -= E - o, l += 1);
|
|
2096
2096
|
}
|
|
2097
2097
|
for (; a !== n && e[a][0] !== x; )
|
|
@@ -2099,44 +2099,44 @@ function $s(e, t) {
|
|
|
2099
2099
|
}
|
|
2100
2100
|
let m = l !== 0 || i;
|
|
2101
2101
|
l !== 0 ? s += l + 1 : i && (s += 1);
|
|
2102
|
-
let p = s - 1, f = [],
|
|
2102
|
+
let p = s - 1, f = [], y = 0;
|
|
2103
2103
|
m && f.push("");
|
|
2104
|
-
let
|
|
2104
|
+
let d = 0, g = 0, u = 0, h = 0, S = /* @__PURE__ */ c((b) => {
|
|
2105
2105
|
let E = f.length;
|
|
2106
|
-
f.push(Qn(
|
|
2107
|
-
}, "pushCommonLine"), _ = /* @__PURE__ */ c((
|
|
2106
|
+
f.push(Qn(b, E === 0 || E === p, t)), u += 1, h += 1;
|
|
2107
|
+
}, "pushCommonLine"), _ = /* @__PURE__ */ c((b) => {
|
|
2108
2108
|
let E = f.length;
|
|
2109
|
-
f.push(Xn(
|
|
2110
|
-
}, "pushDeleteLine"), O = /* @__PURE__ */ c((
|
|
2109
|
+
f.push(Xn(b, E === 0 || E === p, t)), u += 1;
|
|
2110
|
+
}, "pushDeleteLine"), O = /* @__PURE__ */ c((b) => {
|
|
2111
2111
|
let E = f.length;
|
|
2112
|
-
f.push(Zn(
|
|
2112
|
+
f.push(Zn(b, E === 0 || E === p, t)), h += 1;
|
|
2113
2113
|
}, "pushInsertLine");
|
|
2114
2114
|
for (a = 0; a !== n; ) {
|
|
2115
|
-
let
|
|
2115
|
+
let b = a;
|
|
2116
2116
|
for (; a !== n && e[a][0] === x; )
|
|
2117
2117
|
a += 1;
|
|
2118
|
-
if (
|
|
2119
|
-
if (
|
|
2120
|
-
a > r && (
|
|
2121
|
-
for (let E =
|
|
2118
|
+
if (b !== a)
|
|
2119
|
+
if (b === 0) {
|
|
2120
|
+
a > r && (b = a - r, d = b, g = b, u = d, h = g);
|
|
2121
|
+
for (let E = b; E !== a; E += 1)
|
|
2122
2122
|
S(e[E][1]);
|
|
2123
2123
|
} else if (a === n) {
|
|
2124
|
-
let E = a -
|
|
2125
|
-
for (let $ =
|
|
2124
|
+
let E = a - b > r ? b + r : a;
|
|
2125
|
+
for (let $ = b; $ !== E; $ += 1)
|
|
2126
2126
|
S(e[$][1]);
|
|
2127
2127
|
} else {
|
|
2128
|
-
let E = a -
|
|
2128
|
+
let E = a - b;
|
|
2129
2129
|
if (E > o) {
|
|
2130
|
-
let $ =
|
|
2131
|
-
for (let
|
|
2132
|
-
S(e[
|
|
2133
|
-
f[
|
|
2130
|
+
let $ = b + r;
|
|
2131
|
+
for (let A = b; A !== $; A += 1)
|
|
2132
|
+
S(e[A][1]);
|
|
2133
|
+
f[y] = Fn(d, u, g, h, t), y = f.length, f.push("");
|
|
2134
2134
|
let C = E - o;
|
|
2135
|
-
|
|
2136
|
-
for (let
|
|
2137
|
-
S(e[
|
|
2135
|
+
d = u + C, g = h + C, u = d, h = g;
|
|
2136
|
+
for (let A = a - r; A !== a; A += 1)
|
|
2137
|
+
S(e[A][1]);
|
|
2138
2138
|
} else
|
|
2139
|
-
for (let $ =
|
|
2139
|
+
for (let $ = b; $ !== a; $ += 1)
|
|
2140
2140
|
S(e[$][1]);
|
|
2141
2141
|
}
|
|
2142
2142
|
for (; a !== n && e[a][0] === U; )
|
|
@@ -2144,7 +2144,7 @@ function $s(e, t) {
|
|
|
2144
2144
|
for (; a !== n && e[a][0] === k; )
|
|
2145
2145
|
O(e[a][1]), a += 1;
|
|
2146
2146
|
}
|
|
2147
|
-
return m && (f[
|
|
2147
|
+
return m && (f[y] = Fn(d, u, g, h, t)), f.join(`
|
|
2148
2148
|
`);
|
|
2149
2149
|
}
|
|
2150
2150
|
c($s, "joinAlignedDiffsNoExpand");
|
|
@@ -2163,8 +2163,8 @@ function ws(e, t) {
|
|
|
2163
2163
|
`);
|
|
2164
2164
|
}
|
|
2165
2165
|
c(ws, "joinAlignedDiffsExpand");
|
|
2166
|
-
var Tt = /* @__PURE__ */ c((e) => e, "noColor"), vn = 5,
|
|
2167
|
-
function
|
|
2166
|
+
var Tt = /* @__PURE__ */ c((e) => e, "noColor"), vn = 5, Rs = 0;
|
|
2167
|
+
function As() {
|
|
2168
2168
|
return {
|
|
2169
2169
|
aAnnotation: "Expected",
|
|
2170
2170
|
aColor: ne.green,
|
|
@@ -2185,29 +2185,29 @@ function Rs() {
|
|
|
2185
2185
|
omitAnnotationLines: !1,
|
|
2186
2186
|
patchColor: ne.yellow,
|
|
2187
2187
|
printBasicPrototype: !1,
|
|
2188
|
-
truncateThreshold:
|
|
2188
|
+
truncateThreshold: Rs,
|
|
2189
2189
|
truncateAnnotation: "... Diff result is truncated",
|
|
2190
2190
|
truncateAnnotationColor: Tt
|
|
2191
2191
|
};
|
|
2192
2192
|
}
|
|
2193
|
-
c(
|
|
2194
|
-
function
|
|
2193
|
+
c(As, "getDefaultOptions");
|
|
2194
|
+
function Ps(e) {
|
|
2195
2195
|
return e && typeof e == "function" ? e : void 0;
|
|
2196
2196
|
}
|
|
2197
|
-
c(
|
|
2198
|
-
function
|
|
2197
|
+
c(Ps, "getCompareKeys");
|
|
2198
|
+
function Ns(e) {
|
|
2199
2199
|
return typeof e == "number" && Number.isSafeInteger(e) && e >= 0 ? e : vn;
|
|
2200
2200
|
}
|
|
2201
|
-
c(
|
|
2202
|
-
function
|
|
2201
|
+
c(Ns, "getContextLines");
|
|
2202
|
+
function de(e = {}) {
|
|
2203
2203
|
return {
|
|
2204
|
-
...
|
|
2204
|
+
...As(),
|
|
2205
2205
|
...e,
|
|
2206
|
-
compareKeys:
|
|
2207
|
-
contextLines:
|
|
2206
|
+
compareKeys: Ps(e.compareKeys),
|
|
2207
|
+
contextLines: Ns(e.contextLines)
|
|
2208
2208
|
};
|
|
2209
2209
|
}
|
|
2210
|
-
c(
|
|
2210
|
+
c(de, "normalizeDiffOptions");
|
|
2211
2211
|
function Ee(e) {
|
|
2212
2212
|
return e.length === 1 && e[0].length === 0;
|
|
2213
2213
|
}
|
|
@@ -2234,25 +2234,25 @@ function Ms({ aAnnotation: e, aColor: t, aIndicator: n, bAnnotation: r, bColor:
|
|
|
2234
2234
|
return "";
|
|
2235
2235
|
let m = "", p = "";
|
|
2236
2236
|
if (i) {
|
|
2237
|
-
let
|
|
2238
|
-
|
|
2239
|
-
m = `${h} ${n} ${O}${
|
|
2237
|
+
let d = String(a.a), g = String(a.b), u = r.length - e.length, h = " ".repeat(Math.max(0, u)), S = " ".repeat(Math.max(0, -u)), _ = g.length -
|
|
2238
|
+
d.length, O = " ".repeat(Math.max(0, _)), b = " ".repeat(Math.max(0, -_));
|
|
2239
|
+
m = `${h} ${n} ${O}${d}`, p = `${S} ${s} ${b}${g}`;
|
|
2240
2240
|
}
|
|
2241
|
-
let f = `${n} ${e}${m}`,
|
|
2241
|
+
let f = `${n} ${e}${m}`, y = `${s} ${r}${p}`;
|
|
2242
2242
|
return `${t(f)}
|
|
2243
|
-
${o(
|
|
2243
|
+
${o(y)}
|
|
2244
2244
|
|
|
2245
2245
|
`;
|
|
2246
2246
|
}
|
|
2247
2247
|
c(Ms, "printAnnotation");
|
|
2248
|
-
function
|
|
2248
|
+
function Nt(e, t, n) {
|
|
2249
2249
|
return Ms(n, Is(e)) + (n.expand ? ws(e, n) : $s(e, n)) + (t ? n.truncateAnnotationColor(`
|
|
2250
2250
|
${n.truncateAnnotation}`) : "");
|
|
2251
2251
|
}
|
|
2252
|
-
c(
|
|
2252
|
+
c(Nt, "printDiffLines");
|
|
2253
2253
|
function Je(e, t, n) {
|
|
2254
|
-
let r =
|
|
2255
|
-
return
|
|
2254
|
+
let r = de(n), [o, s] = er(Ee(e) ? [] : e, Ee(t) ? [] : t, r);
|
|
2255
|
+
return Nt(o, s, r);
|
|
2256
2256
|
}
|
|
2257
2257
|
c(Je, "diffLinesUnified");
|
|
2258
2258
|
function Ls(e, t, n, r, o) {
|
|
@@ -2270,19 +2270,19 @@ function Ls(e, t, n, r, o) {
|
|
|
2270
2270
|
default:
|
|
2271
2271
|
m[1] = t[a], l += 1, a += 1;
|
|
2272
2272
|
}
|
|
2273
|
-
}),
|
|
2273
|
+
}), Nt(s, i, de(o));
|
|
2274
2274
|
}
|
|
2275
2275
|
c(Ls, "diffLinesUnified2");
|
|
2276
2276
|
function er(e, t, n) {
|
|
2277
2277
|
let r = n?.truncateThreshold ?? !1, o = Math.max(Math.floor(n?.truncateThreshold ?? 0), 0), s = r ? Math.min(e.length, o) : e.length, i = r ?
|
|
2278
|
-
Math.min(t.length, o) : t.length, l = s !== e.length || i !== t.length, a = /* @__PURE__ */ c((
|
|
2278
|
+
Math.min(t.length, o) : t.length, l = s !== e.length || i !== t.length, a = /* @__PURE__ */ c((d, g) => e[d] === t[g], "isCommon"), m = [],
|
|
2279
2279
|
p = 0, f = 0;
|
|
2280
|
-
for (Jn(s, i, a, /* @__PURE__ */ c((
|
|
2280
|
+
for (Jn(s, i, a, /* @__PURE__ */ c((d, g, u) => {
|
|
2281
2281
|
for (; p !== g; p += 1)
|
|
2282
2282
|
m.push(new I(U, e[p]));
|
|
2283
2283
|
for (; f !== u; f += 1)
|
|
2284
2284
|
m.push(new I(k, t[f]));
|
|
2285
|
-
for (;
|
|
2285
|
+
for (; d !== 0; d -= 1, p += 1, f += 1)
|
|
2286
2286
|
m.push(new I(x, t[f]));
|
|
2287
2287
|
}, "foundSubsequence")); p !== s; p += 1)
|
|
2288
2288
|
m.push(new I(U, e[p]));
|
|
@@ -2335,16 +2335,16 @@ c(Bn, "getNewLineSymbol");
|
|
|
2335
2335
|
function xs(e, t, n) {
|
|
2336
2336
|
let r = n?.truncateThreshold ?? !1, o = Math.max(Math.floor(n?.truncateThreshold ?? 0), 0), s = e.length, i = t.length;
|
|
2337
2337
|
if (r) {
|
|
2338
|
-
let
|
|
2338
|
+
let d = e.includes(`
|
|
2339
2339
|
`), g = t.includes(`
|
|
2340
|
-
`), u = Bn(e), h = Bn(t), S =
|
|
2340
|
+
`), u = Bn(e), h = Bn(t), S = d ? `${e.split(u, o).join(u)}
|
|
2341
2341
|
` : e, _ = g ? `${t.split(h, o).join(h)}
|
|
2342
2342
|
` : t;
|
|
2343
2343
|
s = S.length, i = _.length;
|
|
2344
2344
|
}
|
|
2345
|
-
let l = s !== e.length || i !== t.length, a = /* @__PURE__ */ c((
|
|
2346
|
-
return Jn(s, i, a, /* @__PURE__ */ c((
|
|
2347
|
-
m !== g && f.push(new I(U, e.slice(m, g))), p !== u && f.push(new I(k, t.slice(p, u))), m = g +
|
|
2345
|
+
let l = s !== e.length || i !== t.length, a = /* @__PURE__ */ c((d, g) => e[d] === t[g], "isCommon"), m = 0, p = 0, f = [];
|
|
2346
|
+
return Jn(s, i, a, /* @__PURE__ */ c((d, g, u) => {
|
|
2347
|
+
m !== g && f.push(new I(U, e.slice(m, g))), p !== u && f.push(new I(k, t.slice(p, u))), m = g + d, p = u + d, f.push(new I(x, t.slice(u,
|
|
2348
2348
|
p)));
|
|
2349
2349
|
}, "foundSubsequence")), m !== s && f.push(new I(U, e.slice(m))), p !== i && f.push(new I(k, t.slice(p))), [f, l];
|
|
2350
2350
|
}
|
|
@@ -2471,8 +2471,8 @@ function Bs(e, t, n) {
|
|
|
2471
2471
|
` : e, r ? `${t}
|
|
2472
2472
|
` : t, !0, n);
|
|
2473
2473
|
if (js(o, r)) {
|
|
2474
|
-
let i =
|
|
2475
|
-
return
|
|
2474
|
+
let i = de(n), l = Fs(o, i.changeColor);
|
|
2475
|
+
return Nt(l, s, i);
|
|
2476
2476
|
}
|
|
2477
2477
|
}
|
|
2478
2478
|
return Je(e.split(`
|
|
@@ -2482,11 +2482,11 @@ function Bs(e, t, n) {
|
|
|
2482
2482
|
c(Bs, "diffStringsUnified");
|
|
2483
2483
|
function tr(e, t, n, r) {
|
|
2484
2484
|
let [o, s] = xs(e, t, r);
|
|
2485
|
-
return n &&
|
|
2485
|
+
return n && ys(o), [o, s];
|
|
2486
2486
|
}
|
|
2487
2487
|
c(tr, "diffStringsRaw");
|
|
2488
2488
|
function wt(e, t) {
|
|
2489
|
-
let { commonColor: n } =
|
|
2489
|
+
let { commonColor: n } = de(t);
|
|
2490
2490
|
return n(e);
|
|
2491
2491
|
}
|
|
2492
2492
|
c(wt, "getCommonMessage");
|
|
@@ -2498,7 +2498,7 @@ var { AsymmetricMatcher: ks, DOMCollection: zs, DOMElement: Ys, Immutable: Us, R
|
|
|
2498
2498
|
Us,
|
|
2499
2499
|
ks,
|
|
2500
2500
|
Oe.Error
|
|
2501
|
-
],
|
|
2501
|
+
], Rt = {
|
|
2502
2502
|
maxDepth: 20,
|
|
2503
2503
|
plugins: nr
|
|
2504
2504
|
}, rr = {
|
|
@@ -2520,11 +2520,11 @@ function qs(e, t, n) {
|
|
|
2520
2520
|
return O.length <= u ? O : `${O.slice(0, u)}...`;
|
|
2521
2521
|
};
|
|
2522
2522
|
c(h, "truncate");
|
|
2523
|
-
let { aAnnotation: i, aColor: l, aIndicator: a, bAnnotation: m, bColor: p, bIndicator: f } =
|
|
2524
|
-
|
|
2525
|
-
|
|
2523
|
+
let { aAnnotation: i, aColor: l, aIndicator: a, bAnnotation: m, bColor: p, bIndicator: f } = de(n), y = At(rr, n), d = v(e, y), g = v(t,
|
|
2524
|
+
y), u = 1e5;
|
|
2525
|
+
d = h(d), g = h(g);
|
|
2526
2526
|
let S = `${l(`${a} ${i}:`)}
|
|
2527
|
-
${
|
|
2527
|
+
${d}`, _ = `${p(`${f} ${m}:`)}
|
|
2528
2528
|
${g}`;
|
|
2529
2529
|
return `${S}
|
|
2530
2530
|
|
|
@@ -2549,7 +2549,7 @@ ${_}`;
|
|
|
2549
2549
|
}
|
|
2550
2550
|
c(qs, "diff");
|
|
2551
2551
|
function Ks(e, t, n) {
|
|
2552
|
-
let r = v(e,
|
|
2552
|
+
let r = v(e, Rt), o = v(t, Rt);
|
|
2553
2553
|
return r === o ? "" : Je(r.split(`
|
|
2554
2554
|
`), o.split(`
|
|
2555
2555
|
`), n);
|
|
@@ -2566,14 +2566,14 @@ c(zn, "sortSet");
|
|
|
2566
2566
|
function Ot(e, t, n) {
|
|
2567
2567
|
let r, o = !1;
|
|
2568
2568
|
try {
|
|
2569
|
-
let i = Rt
|
|
2569
|
+
let i = At(Rt, n);
|
|
2570
2570
|
r = Yn(e, t, i, n);
|
|
2571
2571
|
} catch {
|
|
2572
2572
|
o = !0;
|
|
2573
2573
|
}
|
|
2574
2574
|
let s = wt(Hn, n);
|
|
2575
2575
|
if (r === void 0 || r === s) {
|
|
2576
|
-
let i =
|
|
2576
|
+
let i = At(rr, n);
|
|
2577
2577
|
r = Yn(e, t, i, n), r !== s && !o && (r = `${wt(_s, n)}
|
|
2578
2578
|
|
|
2579
2579
|
${r}`);
|
|
@@ -2581,8 +2581,8 @@ ${r}`);
|
|
|
2581
2581
|
return r;
|
|
2582
2582
|
}
|
|
2583
2583
|
c(Ot, "compareObjects");
|
|
2584
|
-
function
|
|
2585
|
-
let { compareKeys: n, printBasicPrototype: r, maxDepth: o } =
|
|
2584
|
+
function At(e, t) {
|
|
2585
|
+
let { compareKeys: n, printBasicPrototype: r, maxDepth: o } = de(t);
|
|
2586
2586
|
return {
|
|
2587
2587
|
...e,
|
|
2588
2588
|
compareKeys: n,
|
|
@@ -2590,7 +2590,7 @@ function Rt(e, t) {
|
|
|
2590
2590
|
maxDepth: o ?? e.maxDepth
|
|
2591
2591
|
};
|
|
2592
2592
|
}
|
|
2593
|
-
c(
|
|
2593
|
+
c(At, "getFormatOptions");
|
|
2594
2594
|
function Yn(e, t, n, r) {
|
|
2595
2595
|
let o = {
|
|
2596
2596
|
...n,
|
|
@@ -2619,14 +2619,14 @@ function Vn(e, t) {
|
|
|
2619
2619
|
}
|
|
2620
2620
|
c(Vn, "isReplaceable");
|
|
2621
2621
|
function or(e, t, n) {
|
|
2622
|
-
let { aAnnotation: r, bAnnotation: o } =
|
|
2622
|
+
let { aAnnotation: r, bAnnotation: o } = de(n);
|
|
2623
2623
|
if (typeof t == "string" && typeof e == "string" && t.length > 0 && e.length > 0 && t.length <= Un && e.length <= Un && t !== e) {
|
|
2624
2624
|
if (t.includes(`
|
|
2625
2625
|
`) || e.includes(`
|
|
2626
2626
|
`))
|
|
2627
2627
|
return Bs(t, e, n);
|
|
2628
|
-
let [p] = tr(t, e, !0), f = p.some((u) => u[0] === x),
|
|
2629
|
-
return `${
|
|
2628
|
+
let [p] = tr(t, e, !0), f = p.some((u) => u[0] === x), y = Gs(r, o), d = y(r) + Xs(qn(p, U, f)), g = y(o) + Js(qn(p, k, f));
|
|
2629
|
+
return `${d}
|
|
2630
2630
|
${g}`;
|
|
2631
2631
|
}
|
|
2632
2632
|
let s = Ct(t, { forceWritable: !0 }), i = Ct(e, { forceWritable: !0 }), { replacedExpected: l, replacedActual: a } = sr(i, s);
|
|
@@ -2719,7 +2719,7 @@ function me(e, t = /* @__PURE__ */ new WeakMap()) {
|
|
|
2719
2719
|
if (typeof Element < "u" && e instanceof Element)
|
|
2720
2720
|
return e.tagName;
|
|
2721
2721
|
if (typeof e.asymmetricMatch == "function")
|
|
2722
|
-
return `${e.toString()} ${
|
|
2722
|
+
return `${e.toString()} ${An(e.sample)}`;
|
|
2723
2723
|
if (typeof e.toJSON == "function")
|
|
2724
2724
|
return me(e.toJSON(), t);
|
|
2725
2725
|
if (t.has(e))
|
|
@@ -2822,7 +2822,7 @@ prototype.toString.call(e) === "[object Module]", "isModule"), oi = /* @__PURE__
|
|
|
2822
2822
|
return {};
|
|
2823
2823
|
}
|
|
2824
2824
|
}, "construct"), Mt = /* @__PURE__ */ c(() => ({
|
|
2825
|
-
renderPhase:
|
|
2825
|
+
renderPhase: "preparing",
|
|
2826
2826
|
isDebugging: !1,
|
|
2827
2827
|
isPlaying: !1,
|
|
2828
2828
|
isLocked: !1,
|
|
@@ -2866,43 +2866,45 @@ prototype.toString.call(e) === "[object Module]", "isModule"), oi = /* @__PURE__
|
|
|
2866
2866
|
this.loadParentWindowState();
|
|
2867
2867
|
let t = /* @__PURE__ */ c(({
|
|
2868
2868
|
storyId: a,
|
|
2869
|
-
|
|
2870
|
-
|
|
2869
|
+
renderPhase: m,
|
|
2870
|
+
isPlaying: p = !0,
|
|
2871
|
+
isDebugging: f = !1
|
|
2871
2872
|
}) => {
|
|
2872
|
-
let
|
|
2873
|
+
let y = this.getState(a);
|
|
2873
2874
|
this.setState(a, {
|
|
2874
2875
|
...Mt(),
|
|
2875
|
-
...lr(
|
|
2876
|
-
|
|
2877
|
-
|
|
2878
|
-
|
|
2879
|
-
|
|
2880
|
-
|
|
2876
|
+
...lr(y, f),
|
|
2877
|
+
renderPhase: m || y.renderPhase,
|
|
2878
|
+
shadowCalls: f ? y.shadowCalls : [],
|
|
2879
|
+
chainedCallIds: f ? y.chainedCallIds : /* @__PURE__ */ new Set(),
|
|
2880
|
+
playUntil: f ? y.playUntil : void 0,
|
|
2881
|
+
isPlaying: p,
|
|
2882
|
+
isDebugging: f
|
|
2881
2883
|
}), this.sync(a);
|
|
2882
2884
|
}, "resetState"), n = /* @__PURE__ */ c((a) => ({ storyId: m, playUntil: p }) => {
|
|
2883
|
-
this.getState(m).isDebugging || this.setState(m, ({ calls:
|
|
2885
|
+
this.getState(m).isDebugging || this.setState(m, ({ calls: y }) => ({
|
|
2884
2886
|
calls: [],
|
|
2885
|
-
shadowCalls:
|
|
2887
|
+
shadowCalls: y.map((d) => ({ ...d, status: "waiting" })),
|
|
2886
2888
|
isDebugging: !0
|
|
2887
2889
|
}));
|
|
2888
2890
|
let f = this.getLog(m);
|
|
2889
|
-
this.setState(m, ({ shadowCalls:
|
|
2891
|
+
this.setState(m, ({ shadowCalls: y }) => {
|
|
2890
2892
|
if (p || !f.length)
|
|
2891
2893
|
return { playUntil: p };
|
|
2892
|
-
let
|
|
2894
|
+
let d = y.findIndex((g) => g.id === f[0].callId);
|
|
2893
2895
|
return {
|
|
2894
|
-
playUntil:
|
|
2896
|
+
playUntil: y.slice(0, d).filter((g) => g.interceptable && !g.ancestors?.length).slice(-1)[0]?.id
|
|
2895
2897
|
};
|
|
2896
|
-
}), a.emit(
|
|
2898
|
+
}), a.emit(ye.FORCE_REMOUNT, { storyId: m, isDebugging: !0 });
|
|
2897
2899
|
}, "start"), r = /* @__PURE__ */ c((a) => ({ storyId: m }) => {
|
|
2898
|
-
let p = this.getLog(m).filter((
|
|
2900
|
+
let p = this.getLog(m).filter((y) => !y.ancestors?.length), f = p.reduceRight((y, d, g) => y >= 0 || d.status === "waiting" ? y : g, -1);
|
|
2899
2901
|
n(a)({ storyId: m, playUntil: p[f - 1]?.callId });
|
|
2900
2902
|
}, "back"), o = /* @__PURE__ */ c((a) => ({ storyId: m, callId: p }) => {
|
|
2901
|
-
let { calls: f, shadowCalls:
|
|
2903
|
+
let { calls: f, shadowCalls: y, resolvers: d } = this.getState(m), g = f.find(({ id: h }) => h === p), u = y.find(({ id: h }) => h ===
|
|
2902
2904
|
p);
|
|
2903
|
-
if (!g && u && Object.values(
|
|
2905
|
+
if (!g && u && Object.values(d).length > 0) {
|
|
2904
2906
|
let h = this.getLog(m).find((S) => S.status === "waiting")?.callId;
|
|
2905
|
-
u.id !== h && this.setState(m, { playUntil: u.id }), Object.values(
|
|
2907
|
+
u.id !== h && this.setState(m, { playUntil: u.id }), Object.values(d).forEach((S) => S());
|
|
2906
2908
|
} else
|
|
2907
2909
|
n(a)({ storyId: m, playUntil: p });
|
|
2908
2910
|
}, "goto"), s = /* @__PURE__ */ c((a) => ({ storyId: m }) => {
|
|
@@ -2910,26 +2912,40 @@ prototype.toString.call(e) === "[object Module]", "isModule"), oi = /* @__PURE__
|
|
|
2910
2912
|
if (Object.values(p).length > 0)
|
|
2911
2913
|
Object.values(p).forEach((f) => f());
|
|
2912
2914
|
else {
|
|
2913
|
-
let f = this.getLog(m).find((
|
|
2915
|
+
let f = this.getLog(m).find((y) => y.status === "waiting")?.callId;
|
|
2914
2916
|
f ? n(a)({ storyId: m, playUntil: f }) : i({ storyId: m });
|
|
2915
2917
|
}
|
|
2916
2918
|
}, "next"), i = /* @__PURE__ */ c(({ storyId: a }) => {
|
|
2917
2919
|
this.setState(a, { playUntil: void 0, isDebugging: !1 }), Object.values(this.getState(a).resolvers).forEach((m) => m());
|
|
2918
|
-
}, "end"), l = /* @__PURE__ */ c(({
|
|
2920
|
+
}, "end"), l = /* @__PURE__ */ c(({
|
|
2921
|
+
storyId: a,
|
|
2922
|
+
newPhase: m
|
|
2923
|
+
}) => {
|
|
2919
2924
|
let { isDebugging: p } = this.getState(a);
|
|
2920
|
-
|
|
2921
|
-
|
|
2925
|
+
if (m === "preparing" && p)
|
|
2926
|
+
return t({ storyId: a, renderPhase: m });
|
|
2927
|
+
if (m === "playing")
|
|
2928
|
+
return t({ storyId: a, renderPhase: m, isDebugging: p });
|
|
2929
|
+
m === "played" ? this.setState(a, {
|
|
2930
|
+
renderPhase: m,
|
|
2922
2931
|
isLocked: !1,
|
|
2923
2932
|
isPlaying: !1,
|
|
2924
2933
|
isDebugging: !1
|
|
2925
|
-
})
|
|
2934
|
+
}) : m === "errored" ? this.setState(a, {
|
|
2935
|
+
renderPhase: m,
|
|
2926
2936
|
isLocked: !1,
|
|
2927
2937
|
isPlaying: !1
|
|
2928
|
-
})
|
|
2938
|
+
}) : m === "aborted" ? this.setState(a, {
|
|
2939
|
+
renderPhase: m,
|
|
2940
|
+
isLocked: !0,
|
|
2941
|
+
isPlaying: !1
|
|
2942
|
+
}) : this.setState(a, {
|
|
2943
|
+
renderPhase: m
|
|
2944
|
+
}), this.sync(a);
|
|
2929
2945
|
}, "renderPhaseChanged");
|
|
2930
2946
|
Ze && Ze.ready().then(() => {
|
|
2931
|
-
this.channel = Ze.getChannel(), this.channel.on(
|
|
2932
|
-
on(
|
|
2947
|
+
this.channel = Ze.getChannel(), this.channel.on(ye.FORCE_REMOUNT, t), this.channel.on(ye.STORY_RENDER_PHASE_CHANGED, l), this.channel.
|
|
2948
|
+
on(ye.SET_CURRENT_STORY, () => {
|
|
2933
2949
|
this.initialized ? this.cleanup() : this.initialized = !0;
|
|
2934
2950
|
}), 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.
|
|
2935
2951
|
channel.on(ee.NEXT, s(this.channel)), this.channel.on(ee.END, i);
|
|
@@ -2942,8 +2958,10 @@ prototype.toString.call(e) === "[object Module]", "isModule"), oi = /* @__PURE__
|
|
|
2942
2958
|
return this.state[t] || Mt();
|
|
2943
2959
|
}
|
|
2944
2960
|
setState(t, n) {
|
|
2945
|
-
|
|
2946
|
-
|
|
2961
|
+
if (t) {
|
|
2962
|
+
let r = this.getState(t), o = typeof n == "function" ? n(r) : n;
|
|
2963
|
+
this.state = { ...this.state, [t]: { ...r, ...o } }, this.updateParentWindowState();
|
|
2964
|
+
}
|
|
2947
2965
|
}
|
|
2948
2966
|
cleanup() {
|
|
2949
2967
|
this.state = Object.entries(this.state).reduce(
|
|
@@ -3013,8 +3031,8 @@ prototype.toString.call(e) === "[object Module]", "isModule"), oi = /* @__PURE__
|
|
|
3013
3031
|
let i = o?.[0]?.__storyId__ || H.global.__STORYBOOK_PREVIEW__?.selectionStore?.selection?.storyId, { cursor: l, ancestors: a } = this.getState(
|
|
3014
3032
|
i);
|
|
3015
3033
|
this.setState(i, { cursor: l + 1 });
|
|
3016
|
-
let m = `${a.slice(-1)[0] || i} [${l}] ${t}`, { path: p = [], intercept: f = !1, retain:
|
|
3017
|
-
p) : f, g = { id: m, cursor: l, storyId: i, ancestors: a, path: p, method: t, args: o, interceptable:
|
|
3034
|
+
let m = `${a.slice(-1)[0] || i} [${l}] ${t}`, { path: p = [], intercept: f = !1, retain: y = !1 } = s, d = typeof f == "function" ? f(t,
|
|
3035
|
+
p) : f, g = { id: m, cursor: l, storyId: i, ancestors: a, path: p, method: t, args: o, interceptable: d, retain: y }, h = (d && !a.length ?
|
|
3018
3036
|
this.intercept : this.invoke).call(this, n, r, g, s);
|
|
3019
3037
|
return this.instrument(h, { ...s, mutate: !0, path: [{ __callId__: g.id }] });
|
|
3020
3038
|
}
|
|
@@ -3031,15 +3049,15 @@ prototype.toString.call(e) === "[object Module]", "isModule"), oi = /* @__PURE__
|
|
|
3031
3049
|
}), this.invoke(t, n, r, o)));
|
|
3032
3050
|
}
|
|
3033
3051
|
invoke(t, n, r, o) {
|
|
3034
|
-
let { callRefsByResult: s, renderPhase: i } = this.getState(r.storyId), l = 25, a = /* @__PURE__ */ c((f,
|
|
3035
|
-
if (
|
|
3052
|
+
let { callRefsByResult: s, renderPhase: i } = this.getState(r.storyId), l = 25, a = /* @__PURE__ */ c((f, y, d) => {
|
|
3053
|
+
if (d.includes(f))
|
|
3036
3054
|
return "[Circular]";
|
|
3037
|
-
if (
|
|
3055
|
+
if (d = [...d, f], y > l)
|
|
3038
3056
|
return "...";
|
|
3039
3057
|
if (s.has(f))
|
|
3040
3058
|
return s.get(f);
|
|
3041
3059
|
if (f instanceof Array)
|
|
3042
|
-
return f.map((g) => a(g, ++
|
|
3060
|
+
return f.map((g) => a(g, ++y, d));
|
|
3043
3061
|
if (f instanceof Date)
|
|
3044
3062
|
return { __date__: { value: f.toISOString() } };
|
|
3045
3063
|
if (f instanceof Error) {
|
|
@@ -3058,26 +3076,26 @@ prototype.toString.call(e) === "[object Module]", "isModule"), oi = /* @__PURE__
|
|
|
3058
3076
|
__function__: { name: "getMockName" in f ? f.getMockName() : f.name }
|
|
3059
3077
|
} : typeof f == "symbol" ? { __symbol__: { description: f.description } } : typeof f == "object" && f?.constructor?.name && f?.constructor?.
|
|
3060
3078
|
name !== "Object" ? { __class__: { name: f.constructor.name } } : Object.prototype.toString.call(f) === "[object Object]" ? Object.fromEntries(
|
|
3061
|
-
Object.entries(f).map(([g, u]) => [g, a(u, ++
|
|
3079
|
+
Object.entries(f).map(([g, u]) => [g, a(u, ++y, d)])
|
|
3062
3080
|
) : f;
|
|
3063
3081
|
}, "serializeValues"), m = {
|
|
3064
3082
|
...r,
|
|
3065
3083
|
args: r.args.map((f) => a(f, 0, []))
|
|
3066
3084
|
};
|
|
3067
3085
|
r.path.forEach((f) => {
|
|
3068
|
-
f?.__callId__ && this.setState(r.storyId, ({ chainedCallIds:
|
|
3069
|
-
chainedCallIds: new Set(Array.from(
|
|
3086
|
+
f?.__callId__ && this.setState(r.storyId, ({ chainedCallIds: y }) => ({
|
|
3087
|
+
chainedCallIds: new Set(Array.from(y).concat(f.__callId__))
|
|
3070
3088
|
}));
|
|
3071
3089
|
});
|
|
3072
3090
|
let p = /* @__PURE__ */ c((f) => {
|
|
3073
3091
|
if (f instanceof Error) {
|
|
3074
|
-
let { name:
|
|
3092
|
+
let { name: y, message: d, stack: g, callId: u = r.id } = f, {
|
|
3075
3093
|
showDiff: h = void 0,
|
|
3076
3094
|
diff: S = void 0,
|
|
3077
3095
|
actual: _ = void 0,
|
|
3078
3096
|
expected: O = void 0
|
|
3079
|
-
} = f.name === "AssertionError" ? It(f) : f,
|
|
3080
|
-
if (this.update({ ...m, status: "error", exception:
|
|
3097
|
+
} = f.name === "AssertionError" ? It(f) : f, b = { name: y, message: d, stack: g, callId: u, showDiff: h, diff: S, actual: _, expected: O };
|
|
3098
|
+
if (this.update({ ...m, status: "error", exception: b }), this.setState(r.storyId, (E) => ({
|
|
3081
3099
|
callRefsByResult: new Map([
|
|
3082
3100
|
...Array.from(E.callRefsByResult.entries()),
|
|
3083
3101
|
[f, { __callId__: r.id, retain: r.retain }]
|
|
@@ -3090,27 +3108,27 @@ prototype.toString.call(e) === "[object Module]", "isModule"), oi = /* @__PURE__
|
|
|
3090
3108
|
try {
|
|
3091
3109
|
if (i === "played" && !r.retain)
|
|
3092
3110
|
throw ni;
|
|
3093
|
-
let
|
|
3111
|
+
let y = (o.getArgs ? o.getArgs(r, this.getState(r.storyId)) : r.args).map((g) => typeof g != "function" || ci(g) || Object.keys(g).length ?
|
|
3094
3112
|
g : (...u) => {
|
|
3095
3113
|
let { cursor: h, ancestors: S } = this.getState(r.storyId);
|
|
3096
3114
|
this.setState(r.storyId, { cursor: 0, ancestors: [...S, r.id] });
|
|
3097
3115
|
let _ = /* @__PURE__ */ c(() => this.setState(r.storyId, { cursor: h, ancestors: S }), "restore"), O = !1;
|
|
3098
3116
|
try {
|
|
3099
|
-
let
|
|
3100
|
-
return
|
|
3117
|
+
let b = g(...u);
|
|
3118
|
+
return b instanceof Promise ? (O = !0, b.finally(_)) : b;
|
|
3101
3119
|
} finally {
|
|
3102
3120
|
O || _();
|
|
3103
3121
|
}
|
|
3104
|
-
}),
|
|
3105
|
-
return
|
|
3122
|
+
}), d = t.apply(n, y);
|
|
3123
|
+
return d && ["object", "function", "symbol"].includes(typeof d) && this.setState(r.storyId, (g) => ({
|
|
3106
3124
|
callRefsByResult: new Map([
|
|
3107
3125
|
...Array.from(g.callRefsByResult.entries()),
|
|
3108
|
-
[
|
|
3126
|
+
[d, { __callId__: r.id, retain: r.retain }]
|
|
3109
3127
|
])
|
|
3110
3128
|
})), this.update({
|
|
3111
3129
|
...m,
|
|
3112
|
-
status:
|
|
3113
|
-
}),
|
|
3130
|
+
status: d instanceof Promise ? "active" : "done"
|
|
3131
|
+
}), d instanceof Promise ? d.then((g) => (this.update({ ...m, status: "done" }), g), p) : d;
|
|
3114
3132
|
} catch (f) {
|
|
3115
3133
|
return p(f);
|
|
3116
3134
|
}
|
|
@@ -3134,7 +3152,7 @@ prototype.toString.call(e) === "[object Module]", "isModule"), oi = /* @__PURE__
|
|
|
3134
3152
|
let { isLocked: r, isPlaying: o } = this.getState(t), s = this.getLog(t), i = s.filter(({ ancestors: f }) => !f.length).find((f) => f.
|
|
3135
3153
|
status === "waiting")?.callId, l = s.some((f) => f.status === "active");
|
|
3136
3154
|
if (this.detached || r || l || s.length === 0) {
|
|
3137
|
-
let
|
|
3155
|
+
let y = { controlStates: {
|
|
3138
3156
|
detached: this.detached,
|
|
3139
3157
|
start: !1,
|
|
3140
3158
|
back: !1,
|
|
@@ -3142,7 +3160,7 @@ prototype.toString.call(e) === "[object Module]", "isModule"), oi = /* @__PURE__
|
|
|
3142
3160
|
next: !1,
|
|
3143
3161
|
end: !1
|
|
3144
3162
|
}, logItems: s };
|
|
3145
|
-
this.channel?.emit(ee.SYNC,
|
|
3163
|
+
this.channel?.emit(ee.SYNC, y);
|
|
3146
3164
|
return;
|
|
3147
3165
|
}
|
|
3148
3166
|
let a = s.some(
|