@wp-playground/client 3.1.26 → 3.1.28

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.
Files changed (4) hide show
  1. package/index.cjs +9 -9
  2. package/index.d.ts +21 -0
  3. package/index.js +388 -382
  4. package/package.json +2 -2
package/index.js CHANGED
@@ -2551,33 +2551,33 @@ var nc = {};
2551
2551
  })(function(t) {
2552
2552
  t.version = "1.2.2";
2553
2553
  function r() {
2554
- for (var _ = 0, F = new Array(256), P = 0; P != 256; ++P)
2555
- _ = P, _ = _ & 1 ? -306674912 ^ _ >>> 1 : _ >>> 1, _ = _ & 1 ? -306674912 ^ _ >>> 1 : _ >>> 1, _ = _ & 1 ? -306674912 ^ _ >>> 1 : _ >>> 1, _ = _ & 1 ? -306674912 ^ _ >>> 1 : _ >>> 1, _ = _ & 1 ? -306674912 ^ _ >>> 1 : _ >>> 1, _ = _ & 1 ? -306674912 ^ _ >>> 1 : _ >>> 1, _ = _ & 1 ? -306674912 ^ _ >>> 1 : _ >>> 1, _ = _ & 1 ? -306674912 ^ _ >>> 1 : _ >>> 1, F[P] = _;
2554
+ for (var b = 0, F = new Array(256), P = 0; P != 256; ++P)
2555
+ b = P, b = b & 1 ? -306674912 ^ b >>> 1 : b >>> 1, b = b & 1 ? -306674912 ^ b >>> 1 : b >>> 1, b = b & 1 ? -306674912 ^ b >>> 1 : b >>> 1, b = b & 1 ? -306674912 ^ b >>> 1 : b >>> 1, b = b & 1 ? -306674912 ^ b >>> 1 : b >>> 1, b = b & 1 ? -306674912 ^ b >>> 1 : b >>> 1, b = b & 1 ? -306674912 ^ b >>> 1 : b >>> 1, b = b & 1 ? -306674912 ^ b >>> 1 : b >>> 1, F[P] = b;
2556
2556
  return typeof Int32Array < "u" ? new Int32Array(F) : F;
2557
2557
  }
2558
2558
  var i = r();
2559
- function a(_) {
2559
+ function a(b) {
2560
2560
  var F = 0, P = 0, S = 0, j = typeof Int32Array < "u" ? new Int32Array(4096) : new Array(4096);
2561
- for (S = 0; S != 256; ++S) j[S] = _[S];
2561
+ for (S = 0; S != 256; ++S) j[S] = b[S];
2562
2562
  for (S = 0; S != 256; ++S)
2563
- for (P = _[S], F = 256 + S; F < 4096; F += 256) P = j[F] = P >>> 8 ^ _[P & 255];
2563
+ for (P = b[S], F = 256 + S; F < 4096; F += 256) P = j[F] = P >>> 8 ^ b[P & 255];
2564
2564
  var R = [];
2565
2565
  for (S = 1; S != 16; ++S) R[S - 1] = typeof Int32Array < "u" ? j.subarray(S * 256, S * 256 + 256) : j.slice(S * 256, S * 256 + 256);
2566
2566
  return R;
2567
2567
  }
2568
- var s = a(i), n = s[0], o = s[1], l = s[2], p = s[3], c = s[4], d = s[5], m = s[6], y = s[7], O = s[8], g = s[9], w = s[10], b = s[11], T = s[12], E = s[13], I = s[14];
2569
- function $(_, F) {
2570
- for (var P = F ^ -1, S = 0, j = _.length; S < j; ) P = P >>> 8 ^ i[(P ^ _.charCodeAt(S++)) & 255];
2568
+ var s = a(i), n = s[0], o = s[1], l = s[2], p = s[3], c = s[4], d = s[5], m = s[6], y = s[7], O = s[8], g = s[9], w = s[10], _ = s[11], T = s[12], E = s[13], I = s[14];
2569
+ function $(b, F) {
2570
+ for (var P = F ^ -1, S = 0, j = b.length; S < j; ) P = P >>> 8 ^ i[(P ^ b.charCodeAt(S++)) & 255];
2571
2571
  return ~P;
2572
2572
  }
2573
- function L(_, F) {
2574
- for (var P = F ^ -1, S = _.length - 15, j = 0; j < S; ) P = I[_[j++] ^ P & 255] ^ E[_[j++] ^ P >> 8 & 255] ^ T[_[j++] ^ P >> 16 & 255] ^ b[_[j++] ^ P >>> 24] ^ w[_[j++]] ^ g[_[j++]] ^ O[_[j++]] ^ y[_[j++]] ^ m[_[j++]] ^ d[_[j++]] ^ c[_[j++]] ^ p[_[j++]] ^ l[_[j++]] ^ o[_[j++]] ^ n[_[j++]] ^ i[_[j++]];
2575
- for (S += 15; j < S; ) P = P >>> 8 ^ i[(P ^ _[j++]) & 255];
2573
+ function L(b, F) {
2574
+ for (var P = F ^ -1, S = b.length - 15, j = 0; j < S; ) P = I[b[j++] ^ P & 255] ^ E[b[j++] ^ P >> 8 & 255] ^ T[b[j++] ^ P >> 16 & 255] ^ _[b[j++] ^ P >>> 24] ^ w[b[j++]] ^ g[b[j++]] ^ O[b[j++]] ^ y[b[j++]] ^ m[b[j++]] ^ d[b[j++]] ^ c[b[j++]] ^ p[b[j++]] ^ l[b[j++]] ^ o[b[j++]] ^ n[b[j++]] ^ i[b[j++]];
2575
+ for (S += 15; j < S; ) P = P >>> 8 ^ i[(P ^ b[j++]) & 255];
2576
2576
  return ~P;
2577
2577
  }
2578
- function C(_, F) {
2579
- for (var P = F ^ -1, S = 0, j = _.length, R = 0, D = 0; S < j; )
2580
- R = _.charCodeAt(S++), R < 128 ? P = P >>> 8 ^ i[(P ^ R) & 255] : R < 2048 ? (P = P >>> 8 ^ i[(P ^ (192 | R >> 6 & 31)) & 255], P = P >>> 8 ^ i[(P ^ (128 | R & 63)) & 255]) : R >= 55296 && R < 57344 ? (R = (R & 1023) + 64, D = _.charCodeAt(S++) & 1023, P = P >>> 8 ^ i[(P ^ (240 | R >> 8 & 7)) & 255], P = P >>> 8 ^ i[(P ^ (128 | R >> 2 & 63)) & 255], P = P >>> 8 ^ i[(P ^ (128 | D >> 6 & 15 | (R & 3) << 4)) & 255], P = P >>> 8 ^ i[(P ^ (128 | D & 63)) & 255]) : (P = P >>> 8 ^ i[(P ^ (224 | R >> 12 & 15)) & 255], P = P >>> 8 ^ i[(P ^ (128 | R >> 6 & 63)) & 255], P = P >>> 8 ^ i[(P ^ (128 | R & 63)) & 255]);
2578
+ function C(b, F) {
2579
+ for (var P = F ^ -1, S = 0, j = b.length, R = 0, D = 0; S < j; )
2580
+ R = b.charCodeAt(S++), R < 128 ? P = P >>> 8 ^ i[(P ^ R) & 255] : R < 2048 ? (P = P >>> 8 ^ i[(P ^ (192 | R >> 6 & 31)) & 255], P = P >>> 8 ^ i[(P ^ (128 | R & 63)) & 255]) : R >= 55296 && R < 57344 ? (R = (R & 1023) + 64, D = b.charCodeAt(S++) & 1023, P = P >>> 8 ^ i[(P ^ (240 | R >> 8 & 7)) & 255], P = P >>> 8 ^ i[(P ^ (128 | R >> 2 & 63)) & 255], P = P >>> 8 ^ i[(P ^ (128 | D >> 6 & 15 | (R & 3) << 4)) & 255], P = P >>> 8 ^ i[(P ^ (128 | D & 63)) & 255]) : (P = P >>> 8 ^ i[(P ^ (224 | R >> 12 & 15)) & 255], P = P >>> 8 ^ i[(P ^ (128 | R >> 6 & 63)) & 255], P = P >>> 8 ^ i[(P ^ (128 | R & 63)) & 255]);
2581
2581
  return ~P;
2582
2582
  }
2583
2583
  t.table = i, t.bstr = $, t.buf = L, t.str = C;
@@ -3492,8 +3492,8 @@ ss.deflate = So;
3492
3492
  ss.deflateRaw = iy;
3493
3493
  ss.gzip = ay;
3494
3494
  var os = {}, Ut = {}, _s = 30, oy = 12, ly = function(t, r) {
3495
- var i, a, s, n, o, l, p, c, d, m, y, O, g, w, b, T, E, I, $, L, C, _, F, P, S;
3496
- i = t.state, a = t.next_in, P = t.input, s = a + (t.avail_in - 5), n = t.next_out, S = t.output, o = n - (r - t.avail_out), l = n + (t.avail_out - 257), p = i.dmax, c = i.wsize, d = i.whave, m = i.wnext, y = i.window, O = i.hold, g = i.bits, w = i.lencode, b = i.distcode, T = (1 << i.lenbits) - 1, E = (1 << i.distbits) - 1;
3495
+ var i, a, s, n, o, l, p, c, d, m, y, O, g, w, _, T, E, I, $, L, C, b, F, P, S;
3496
+ i = t.state, a = t.next_in, P = t.input, s = a + (t.avail_in - 5), n = t.next_out, S = t.output, o = n - (r - t.avail_out), l = n + (t.avail_out - 257), p = i.dmax, c = i.wsize, d = i.whave, m = i.wnext, y = i.window, O = i.hold, g = i.bits, w = i.lencode, _ = i.distcode, T = (1 << i.lenbits) - 1, E = (1 << i.distbits) - 1;
3497
3497
  e:
3498
3498
  do {
3499
3499
  g < 15 && (O += P[a++] << g, g += 8, O += P[a++] << g, g += 8), I = w[O & T];
@@ -3502,7 +3502,7 @@ var os = {}, Ut = {}, _s = 30, oy = 12, ly = function(t, r) {
3502
3502
  if ($ = I >>> 24, O >>>= $, g -= $, $ = I >>> 16 & 255, $ === 0)
3503
3503
  S[n++] = I & 65535;
3504
3504
  else if ($ & 16) {
3505
- L = I & 65535, $ &= 15, $ && (g < $ && (O += P[a++] << g, g += 8), L += O & (1 << $) - 1, O >>>= $, g -= $), g < 15 && (O += P[a++] << g, g += 8, O += P[a++] << g, g += 8), I = b[O & E];
3505
+ L = I & 65535, $ &= 15, $ && (g < $ && (O += P[a++] << g, g += 8), L += O & (1 << $) - 1, O >>>= $, g -= $), g < 15 && (O += P[a++] << g, g += 8, O += P[a++] << g, g += 8), I = _[O & E];
3506
3506
  r:
3507
3507
  for (; ; ) {
3508
3508
  if ($ = I >>> 24, O >>>= $, g -= $, $ = I >>> 16 & 255, $ & 16) {
@@ -3515,50 +3515,50 @@ var os = {}, Ut = {}, _s = 30, oy = 12, ly = function(t, r) {
3515
3515
  t.msg = "invalid distance too far back", i.mode = _s;
3516
3516
  break e;
3517
3517
  }
3518
- if (_ = 0, F = y, m === 0) {
3519
- if (_ += c - $, $ < L) {
3518
+ if (b = 0, F = y, m === 0) {
3519
+ if (b += c - $, $ < L) {
3520
3520
  L -= $;
3521
3521
  do
3522
- S[n++] = y[_++];
3522
+ S[n++] = y[b++];
3523
3523
  while (--$);
3524
- _ = n - C, F = S;
3524
+ b = n - C, F = S;
3525
3525
  }
3526
3526
  } else if (m < $) {
3527
- if (_ += c + m - $, $ -= m, $ < L) {
3527
+ if (b += c + m - $, $ -= m, $ < L) {
3528
3528
  L -= $;
3529
3529
  do
3530
- S[n++] = y[_++];
3530
+ S[n++] = y[b++];
3531
3531
  while (--$);
3532
- if (_ = 0, m < L) {
3532
+ if (b = 0, m < L) {
3533
3533
  $ = m, L -= $;
3534
3534
  do
3535
- S[n++] = y[_++];
3535
+ S[n++] = y[b++];
3536
3536
  while (--$);
3537
- _ = n - C, F = S;
3537
+ b = n - C, F = S;
3538
3538
  }
3539
3539
  }
3540
- } else if (_ += m - $, $ < L) {
3540
+ } else if (b += m - $, $ < L) {
3541
3541
  L -= $;
3542
3542
  do
3543
- S[n++] = y[_++];
3543
+ S[n++] = y[b++];
3544
3544
  while (--$);
3545
- _ = n - C, F = S;
3545
+ b = n - C, F = S;
3546
3546
  }
3547
3547
  for (; L > 2; )
3548
- S[n++] = F[_++], S[n++] = F[_++], S[n++] = F[_++], L -= 3;
3549
- L && (S[n++] = F[_++], L > 1 && (S[n++] = F[_++]));
3548
+ S[n++] = F[b++], S[n++] = F[b++], S[n++] = F[b++], L -= 3;
3549
+ L && (S[n++] = F[b++], L > 1 && (S[n++] = F[b++]));
3550
3550
  } else {
3551
- _ = n - C;
3551
+ b = n - C;
3552
3552
  do
3553
- S[n++] = S[_++], S[n++] = S[_++], S[n++] = S[_++], L -= 3;
3553
+ S[n++] = S[b++], S[n++] = S[b++], S[n++] = S[b++], L -= 3;
3554
3554
  while (L > 2);
3555
- L && (S[n++] = S[_++], L > 1 && (S[n++] = S[_++]));
3555
+ L && (S[n++] = S[b++], L > 1 && (S[n++] = S[b++]));
3556
3556
  }
3557
3557
  } else if ($ & 64) {
3558
3558
  t.msg = "invalid distance code", i.mode = _s;
3559
3559
  break e;
3560
3560
  } else {
3561
- I = b[(I & 65535) + (O & (1 << $) - 1)];
3561
+ I = _[(I & 65535) + (O & (1 << $) - 1)];
3562
3562
  continue r;
3563
3563
  }
3564
3564
  break;
@@ -3714,7 +3714,7 @@ var os = {}, Ut = {}, _s = 30, oy = 12, ly = function(t, r) {
3714
3714
  64,
3715
3715
  64
3716
3716
  ], dy = function(t, r, i, a, s, n, o, l) {
3717
- var p = l.bits, c = 0, d = 0, m = 0, y = 0, O = 0, g = 0, w = 0, b = 0, T = 0, E = 0, I, $, L, C, _, F = null, P = 0, S, j = new vl.Buf16(Vr + 1), R = new vl.Buf16(Vr + 1), D = null, V = 0, B, Y, G;
3717
+ var p = l.bits, c = 0, d = 0, m = 0, y = 0, O = 0, g = 0, w = 0, _ = 0, T = 0, E = 0, I, $, L, C, b, F = null, P = 0, S, j = new vl.Buf16(Vr + 1), R = new vl.Buf16(Vr + 1), D = null, V = 0, B, Y, G;
3718
3718
  for (c = 0; c <= Vr; c++)
3719
3719
  j[c] = 0;
3720
3720
  for (d = 0; d < a; d++)
@@ -3725,21 +3725,21 @@ var os = {}, Ut = {}, _s = 30, oy = 12, ly = function(t, r) {
3725
3725
  return s[n++] = 1 << 24 | 64 << 16 | 0, s[n++] = 1 << 24 | 64 << 16 | 0, l.bits = 1, 0;
3726
3726
  for (m = 1; m < y && j[m] === 0; m++)
3727
3727
  ;
3728
- for (O < m && (O = m), b = 1, c = 1; c <= Vr; c++)
3729
- if (b <<= 1, b -= j[c], b < 0)
3728
+ for (O < m && (O = m), _ = 1, c = 1; c <= Vr; c++)
3729
+ if (_ <<= 1, _ -= j[c], _ < 0)
3730
3730
  return -1;
3731
- if (b > 0 && (t === Pl || y !== 1))
3731
+ if (_ > 0 && (t === Pl || y !== 1))
3732
3732
  return -1;
3733
3733
  for (R[1] = 0, c = 1; c < Vr; c++)
3734
3734
  R[c + 1] = R[c] + j[c];
3735
3735
  for (d = 0; d < a; d++)
3736
3736
  r[i + d] !== 0 && (o[R[r[i + d]]++] = d);
3737
- if (t === Pl ? (F = D = o, S = 19) : t === Vi ? (F = fy, P -= 257, D = py, V -= 257, S = 256) : (F = cy, D = uy, S = -1), E = 0, d = 0, c = m, _ = n, g = O, w = 0, L = -1, T = 1 << O, C = T - 1, t === Vi && T > xl || t === El && T > kl)
3737
+ if (t === Pl ? (F = D = o, S = 19) : t === Vi ? (F = fy, P -= 257, D = py, V -= 257, S = 256) : (F = cy, D = uy, S = -1), E = 0, d = 0, c = m, b = n, g = O, w = 0, L = -1, T = 1 << O, C = T - 1, t === Vi && T > xl || t === El && T > kl)
3738
3738
  return 1;
3739
3739
  for (; ; ) {
3740
3740
  B = c - w, o[d] < S ? (Y = 0, G = o[d]) : o[d] > S ? (Y = D[V + o[d]], G = F[P + o[d]]) : (Y = 96, G = 0), I = 1 << c - w, $ = 1 << g, m = $;
3741
3741
  do
3742
- $ -= I, s[_ + (E >> w) + $] = B << 24 | Y << 16 | G | 0;
3742
+ $ -= I, s[b + (E >> w) + $] = B << 24 | Y << 16 | G | 0;
3743
3743
  while ($ !== 0);
3744
3744
  for (I = 1 << c - 1; E & I; )
3745
3745
  I >>= 1;
@@ -3749,14 +3749,14 @@ var os = {}, Ut = {}, _s = 30, oy = 12, ly = function(t, r) {
3749
3749
  c = r[i + o[d]];
3750
3750
  }
3751
3751
  if (c > O && (E & C) !== L) {
3752
- for (w === 0 && (w = O), _ += m, g = c - w, b = 1 << g; g + w < y && (b -= j[g + w], !(b <= 0)); )
3753
- g++, b <<= 1;
3752
+ for (w === 0 && (w = O), b += m, g = c - w, _ = 1 << g; g + w < y && (_ -= j[g + w], !(_ <= 0)); )
3753
+ g++, _ <<= 1;
3754
3754
  if (T += 1 << g, t === Vi && T > xl || t === El && T > kl)
3755
3755
  return 1;
3756
- L = E & C, s[L] = O << 24 | g << 16 | _ - n | 0;
3756
+ L = E & C, s[L] = O << 24 | g << 16 | b - n | 0;
3757
3757
  }
3758
3758
  }
3759
- return E !== 0 && (s[_ + E] = c - w << 24 | 64 << 16 | 0), l.bits = O, 0;
3759
+ return E !== 0 && (s[b + E] = c - w << 24 | 64 << 16 | 0), l.bits = O, 0;
3760
3760
  }, kt = ar, Ja = bc, Mt = _c, hy = ly, In = dy, my = 0, Rc = 1, Fc = 2, Sl = 4, yy = 5, vs = 6, Dr = 0, gy = 1, wy = 2, Rt = -2, Lc = -3, Ic = -4, by = -5, Ol = 8, Cc = 1, Tl = 2, Al = 3, $l = 4, Rl = 5, Fl = 6, Ll = 7, Il = 8, Cl = 9, jl = 10, ri = 11, tr = 12, Zi = 13, Nl = 14, Gi = 15, Dl = 16, Ul = 17, Bl = 18, ql = 19, xs = 20, ks = 21, Ml = 22, Wl = 23, Hl = 24, zl = 25, Vl = 26, Yi = 27, Zl = 28, Gl = 29, je = 30, jc = 31, _y = 32, vy = 852, xy = 592, ky = 15, Py = ky;
3761
3761
  function Yl(e) {
3762
3762
  return (e >>> 24 & 255) + (e >>> 8 & 65280) + ((e & 65280) << 8) + ((e & 255) << 24);
@@ -3806,13 +3806,13 @@ function qc(e, t, r, i) {
3806
3806
  return s.window === null && (s.wsize = 1 << s.wbits, s.wnext = 0, s.whave = 0, s.window = new kt.Buf8(s.wsize)), i >= s.wsize ? (kt.arraySet(s.window, t, r - s.wsize, s.wsize, 0), s.wnext = 0, s.whave = s.wsize) : (a = s.wsize - s.wnext, a > i && (a = i), kt.arraySet(s.window, t, r - i, a, s.wnext), i -= a, i ? (kt.arraySet(s.window, t, r - i, i, 0), s.wnext = i, s.whave = s.wsize) : (s.wnext += a, s.wnext === s.wsize && (s.wnext = 0), s.whave < s.wsize && (s.whave += a))), 0;
3807
3807
  }
3808
3808
  function Ty(e, t) {
3809
- var r, i, a, s, n, o, l, p, c, d, m, y, O, g, w = 0, b, T, E, I, $, L, C, _, F = new kt.Buf8(4), P, S, j = (
3809
+ var r, i, a, s, n, o, l, p, c, d, m, y, O, g, w = 0, _, T, E, I, $, L, C, b, F = new kt.Buf8(4), P, S, j = (
3810
3810
  /* permutation of code lengths */
3811
3811
  [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]
3812
3812
  );
3813
3813
  if (!e || !e.state || !e.output || !e.input && e.avail_in !== 0)
3814
3814
  return Rt;
3815
- r = e.state, r.mode === tr && (r.mode = Zi), n = e.next_out, a = e.output, l = e.avail_out, s = e.next_in, i = e.input, o = e.avail_in, p = r.hold, c = r.bits, d = o, m = l, _ = Dr;
3815
+ r = e.state, r.mode === tr && (r.mode = Zi), n = e.next_out, a = e.output, l = e.avail_out, s = e.next_in, i = e.input, o = e.avail_in, p = r.hold, c = r.bits, d = o, m = l, b = Dr;
3816
3816
  e:
3817
3817
  for (; ; )
3818
3818
  switch (r.mode) {
@@ -4025,46 +4025,46 @@ function Ty(e, t) {
4025
4025
  }
4026
4026
  for (; r.have < 19; )
4027
4027
  r.lens[j[r.have++]] = 0;
4028
- if (r.lencode = r.lendyn, r.lenbits = 7, P = { bits: r.lenbits }, _ = In(my, r.lens, 0, 19, r.lencode, 0, r.work, P), r.lenbits = P.bits, _) {
4028
+ if (r.lencode = r.lendyn, r.lenbits = 7, P = { bits: r.lenbits }, b = In(my, r.lens, 0, 19, r.lencode, 0, r.work, P), r.lenbits = P.bits, b) {
4029
4029
  e.msg = "invalid code lengths set", r.mode = je;
4030
4030
  break;
4031
4031
  }
4032
4032
  r.have = 0, r.mode = ql;
4033
4033
  case ql:
4034
4034
  for (; r.have < r.nlen + r.ndist; ) {
4035
- for (; w = r.lencode[p & (1 << r.lenbits) - 1], b = w >>> 24, T = w >>> 16 & 255, E = w & 65535, !(b <= c); ) {
4035
+ for (; w = r.lencode[p & (1 << r.lenbits) - 1], _ = w >>> 24, T = w >>> 16 & 255, E = w & 65535, !(_ <= c); ) {
4036
4036
  if (o === 0)
4037
4037
  break e;
4038
4038
  o--, p += i[s++] << c, c += 8;
4039
4039
  }
4040
4040
  if (E < 16)
4041
- p >>>= b, c -= b, r.lens[r.have++] = E;
4041
+ p >>>= _, c -= _, r.lens[r.have++] = E;
4042
4042
  else {
4043
4043
  if (E === 16) {
4044
- for (S = b + 2; c < S; ) {
4044
+ for (S = _ + 2; c < S; ) {
4045
4045
  if (o === 0)
4046
4046
  break e;
4047
4047
  o--, p += i[s++] << c, c += 8;
4048
4048
  }
4049
- if (p >>>= b, c -= b, r.have === 0) {
4049
+ if (p >>>= _, c -= _, r.have === 0) {
4050
4050
  e.msg = "invalid bit length repeat", r.mode = je;
4051
4051
  break;
4052
4052
  }
4053
4053
  C = r.lens[r.have - 1], y = 3 + (p & 3), p >>>= 2, c -= 2;
4054
4054
  } else if (E === 17) {
4055
- for (S = b + 3; c < S; ) {
4055
+ for (S = _ + 3; c < S; ) {
4056
4056
  if (o === 0)
4057
4057
  break e;
4058
4058
  o--, p += i[s++] << c, c += 8;
4059
4059
  }
4060
- p >>>= b, c -= b, C = 0, y = 3 + (p & 7), p >>>= 3, c -= 3;
4060
+ p >>>= _, c -= _, C = 0, y = 3 + (p & 7), p >>>= 3, c -= 3;
4061
4061
  } else {
4062
- for (S = b + 7; c < S; ) {
4062
+ for (S = _ + 7; c < S; ) {
4063
4063
  if (o === 0)
4064
4064
  break e;
4065
4065
  o--, p += i[s++] << c, c += 8;
4066
4066
  }
4067
- p >>>= b, c -= b, C = 0, y = 11 + (p & 127), p >>>= 7, c -= 7;
4067
+ p >>>= _, c -= _, C = 0, y = 11 + (p & 127), p >>>= 7, c -= 7;
4068
4068
  }
4069
4069
  if (r.have + y > r.nlen + r.ndist) {
4070
4070
  e.msg = "invalid bit length repeat", r.mode = je;
@@ -4080,11 +4080,11 @@ function Ty(e, t) {
4080
4080
  e.msg = "invalid code -- missing end-of-block", r.mode = je;
4081
4081
  break;
4082
4082
  }
4083
- if (r.lenbits = 9, P = { bits: r.lenbits }, _ = In(Rc, r.lens, 0, r.nlen, r.lencode, 0, r.work, P), r.lenbits = P.bits, _) {
4083
+ if (r.lenbits = 9, P = { bits: r.lenbits }, b = In(Rc, r.lens, 0, r.nlen, r.lencode, 0, r.work, P), r.lenbits = P.bits, b) {
4084
4084
  e.msg = "invalid literal/lengths set", r.mode = je;
4085
4085
  break;
4086
4086
  }
4087
- if (r.distbits = 6, r.distcode = r.distdyn, P = { bits: r.distbits }, _ = In(Fc, r.lens, r.nlen, r.ndist, r.distcode, 0, r.work, P), r.distbits = P.bits, _) {
4087
+ if (r.distbits = 6, r.distcode = r.distdyn, P = { bits: r.distbits }, b = In(Fc, r.lens, r.nlen, r.ndist, r.distcode, 0, r.work, P), r.distbits = P.bits, b) {
4088
4088
  e.msg = "invalid distances set", r.mode = je;
4089
4089
  break;
4090
4090
  }
@@ -4097,20 +4097,20 @@ function Ty(e, t) {
4097
4097
  e.next_out = n, e.avail_out = l, e.next_in = s, e.avail_in = o, r.hold = p, r.bits = c, hy(e, m), n = e.next_out, a = e.output, l = e.avail_out, s = e.next_in, i = e.input, o = e.avail_in, p = r.hold, c = r.bits, r.mode === tr && (r.back = -1);
4098
4098
  break;
4099
4099
  }
4100
- for (r.back = 0; w = r.lencode[p & (1 << r.lenbits) - 1], b = w >>> 24, T = w >>> 16 & 255, E = w & 65535, !(b <= c); ) {
4100
+ for (r.back = 0; w = r.lencode[p & (1 << r.lenbits) - 1], _ = w >>> 24, T = w >>> 16 & 255, E = w & 65535, !(_ <= c); ) {
4101
4101
  if (o === 0)
4102
4102
  break e;
4103
4103
  o--, p += i[s++] << c, c += 8;
4104
4104
  }
4105
4105
  if (T && !(T & 240)) {
4106
- for (I = b, $ = T, L = E; w = r.lencode[L + ((p & (1 << I + $) - 1) >> I)], b = w >>> 24, T = w >>> 16 & 255, E = w & 65535, !(I + b <= c); ) {
4106
+ for (I = _, $ = T, L = E; w = r.lencode[L + ((p & (1 << I + $) - 1) >> I)], _ = w >>> 24, T = w >>> 16 & 255, E = w & 65535, !(I + _ <= c); ) {
4107
4107
  if (o === 0)
4108
4108
  break e;
4109
4109
  o--, p += i[s++] << c, c += 8;
4110
4110
  }
4111
4111
  p >>>= I, c -= I, r.back += I;
4112
4112
  }
4113
- if (p >>>= b, c -= b, r.back += b, r.length = E, T === 0) {
4113
+ if (p >>>= _, c -= _, r.back += _, r.length = E, T === 0) {
4114
4114
  r.mode = Vl;
4115
4115
  break;
4116
4116
  }
@@ -4134,20 +4134,20 @@ function Ty(e, t) {
4134
4134
  }
4135
4135
  r.was = r.length, r.mode = Wl;
4136
4136
  case Wl:
4137
- for (; w = r.distcode[p & (1 << r.distbits) - 1], b = w >>> 24, T = w >>> 16 & 255, E = w & 65535, !(b <= c); ) {
4137
+ for (; w = r.distcode[p & (1 << r.distbits) - 1], _ = w >>> 24, T = w >>> 16 & 255, E = w & 65535, !(_ <= c); ) {
4138
4138
  if (o === 0)
4139
4139
  break e;
4140
4140
  o--, p += i[s++] << c, c += 8;
4141
4141
  }
4142
4142
  if (!(T & 240)) {
4143
- for (I = b, $ = T, L = E; w = r.distcode[L + ((p & (1 << I + $) - 1) >> I)], b = w >>> 24, T = w >>> 16 & 255, E = w & 65535, !(I + b <= c); ) {
4143
+ for (I = _, $ = T, L = E; w = r.distcode[L + ((p & (1 << I + $) - 1) >> I)], _ = w >>> 24, T = w >>> 16 & 255, E = w & 65535, !(I + _ <= c); ) {
4144
4144
  if (o === 0)
4145
4145
  break e;
4146
4146
  o--, p += i[s++] << c, c += 8;
4147
4147
  }
4148
4148
  p >>>= I, c -= I, r.back += I;
4149
4149
  }
4150
- if (p >>>= b, c -= b, r.back += b, T & 64) {
4150
+ if (p >>>= _, c -= _, r.back += _, T & 64) {
4151
4151
  e.msg = "invalid distance code", r.mode = je;
4152
4152
  break;
4153
4153
  }
@@ -4218,10 +4218,10 @@ function Ty(e, t) {
4218
4218
  }
4219
4219
  r.mode = Gl;
4220
4220
  case Gl:
4221
- _ = gy;
4221
+ b = gy;
4222
4222
  break e;
4223
4223
  case je:
4224
- _ = Lc;
4224
+ b = Lc;
4225
4225
  break e;
4226
4226
  case jc:
4227
4227
  return Ic;
@@ -4230,7 +4230,7 @@ function Ty(e, t) {
4230
4230
  return Rt;
4231
4231
  }
4232
4232
  return e.next_out = n, e.avail_out = l, e.next_in = s, e.avail_in = o, r.hold = p, r.bits = c, (r.wsize || m !== e.avail_out && r.mode < je && (r.mode < Yi || t !== Sl)) && qc(e, e.output, e.next_out, m - e.avail_out), d -= e.avail_in, m -= e.avail_out, e.total_in += d, e.total_out += m, r.total += m, r.wrap && m && (e.adler = r.check = /*UPDATE(state.check, strm.next_out - _out, _out);*/
4233
- r.flags ? Mt(r.check, a, m, e.next_out - m) : Ja(r.check, a, m, e.next_out - m)), e.data_type = r.bits + (r.last ? 64 : 0) + (r.mode === tr ? 128 : 0) + (r.mode === xs || r.mode === Gi ? 256 : 0), (d === 0 && m === 0 || t === Sl) && _ === Dr && (_ = by), _;
4233
+ r.flags ? Mt(r.check, a, m, e.next_out - m) : Ja(r.check, a, m, e.next_out - m)), e.data_type = r.bits + (r.last ? 64 : 0) + (r.mode === tr ? 128 : 0) + (r.mode === xs || r.mode === Gi ? 256 : 0), (d === 0 && m === 0 || t === Sl) && b === Dr && (b = by), b;
4234
4234
  }
4235
4235
  function Ay(e) {
4236
4236
  if (!e || !e.state)
@@ -4605,7 +4605,7 @@ $o.write = function(e, t, r, i, a, s) {
4605
4605
  return c(x, u, h);
4606
4606
  };
4607
4607
  function d(x) {
4608
- return p(x), n(x < 0 ? 0 : b(x) | 0);
4608
+ return p(x), n(x < 0 ? 0 : _(x) | 0);
4609
4609
  }
4610
4610
  o.allocUnsafe = function(x) {
4611
4611
  return d(x);
@@ -4619,7 +4619,7 @@ $o.write = function(e, t, r, i, a, s) {
4619
4619
  return U !== h && (A = A.slice(0, U)), A;
4620
4620
  }
4621
4621
  function y(x) {
4622
- for (var u = x.length < 0 ? 0 : b(x.length) | 0, h = n(u), A = 0; A < u; A += 1)
4622
+ for (var u = x.length < 0 ? 0 : _(x.length) | 0, h = n(u), A = 0; A < u; A += 1)
4623
4623
  h[A] = x[A] & 255;
4624
4624
  return h;
4625
4625
  }
@@ -4640,7 +4640,7 @@ $o.write = function(e, t, r, i, a, s) {
4640
4640
  }
4641
4641
  function w(x) {
4642
4642
  if (o.isBuffer(x)) {
4643
- var u = b(x.length) | 0, h = n(u);
4643
+ var u = _(x.length) | 0, h = n(u);
4644
4644
  return h.length === 0 || x.copy(h, 0, 0, u), h;
4645
4645
  }
4646
4646
  if (x.length !== void 0)
@@ -4648,7 +4648,7 @@ $o.write = function(e, t, r, i, a, s) {
4648
4648
  if (x.type === "Buffer" && Array.isArray(x.data))
4649
4649
  return y(x.data);
4650
4650
  }
4651
- function b(x) {
4651
+ function _(x) {
4652
4652
  if (x >= a)
4653
4653
  throw new RangeError("Attempt to allocate Buffer larger than maximum size: 0x" + a.toString(16) + " bytes");
4654
4654
  return x | 0;
@@ -4883,7 +4883,7 @@ $o.write = function(e, t, r, i, a, s) {
4883
4883
  }, o.prototype.lastIndexOf = function(u, h, A) {
4884
4884
  return L(this, u, h, A, !1);
4885
4885
  };
4886
- function _(x, u, h, A) {
4886
+ function b(x, u, h, A) {
4887
4887
  h = Number(h) || 0;
4888
4888
  var U = x.length - h;
4889
4889
  A ? (A = Number(A), A > U && (A = U)) : A = U;
@@ -4926,7 +4926,7 @@ $o.write = function(e, t, r, i, a, s) {
4926
4926
  for (var J = !1; ; )
4927
4927
  switch (U) {
4928
4928
  case "hex":
4929
- return _(this, u, h, A);
4929
+ return b(this, u, h, A);
4930
4930
  case "utf8":
4931
4931
  case "utf-8":
4932
4932
  return F(this, u, h, A);
@@ -5758,8 +5758,8 @@ function cg() {
5758
5758
  return !1;
5759
5759
  };
5760
5760
  if (typeof document == "object") {
5761
- var b = document.all;
5762
- o.call(b) === o.call(document.all) && (w = function(E) {
5761
+ var _ = document.all;
5762
+ o.call(_) === o.call(document.all) && (w = function(E) {
5763
5763
  if ((g || !E) && (typeof E > "u" || typeof E == "object"))
5764
5764
  try {
5765
5765
  var I = o.call(E);
@@ -5961,18 +5961,18 @@ var ba, bf;
5961
5961
  function vg() {
5962
5962
  if (bf) return ba;
5963
5963
  bf = 1;
5964
- var e = ug(), t = hg(), r = bg(), i = su, a = fs, s = Jc(), n = i("Object.prototype.toString"), o = _g()(), l = typeof globalThis > "u" ? Up : globalThis, p = t(), c = i("String.prototype.slice"), d = i("Array.prototype.indexOf", !0) || function(w, b) {
5964
+ var e = ug(), t = hg(), r = bg(), i = su, a = fs, s = Jc(), n = i("Object.prototype.toString"), o = _g()(), l = typeof globalThis > "u" ? Up : globalThis, p = t(), c = i("String.prototype.slice"), d = i("Array.prototype.indexOf", !0) || function(w, _) {
5965
5965
  for (var T = 0; T < w.length; T += 1)
5966
- if (w[T] === b)
5966
+ if (w[T] === _)
5967
5967
  return T;
5968
5968
  return -1;
5969
5969
  }, m = { __proto__: null };
5970
5970
  o && a && s ? e(p, function(g) {
5971
5971
  var w = new l[g]();
5972
5972
  if (Symbol.toStringTag in w && s) {
5973
- var b = s(w), T = a(b, Symbol.toStringTag);
5974
- if (!T && b) {
5975
- var E = s(b);
5973
+ var _ = s(w), T = a(_, Symbol.toStringTag);
5974
+ if (!T && _) {
5975
+ var E = s(_);
5976
5976
  T = a(E, Symbol.toStringTag);
5977
5977
  }
5978
5978
  if (T && T.get) {
@@ -5984,12 +5984,12 @@ function vg() {
5984
5984
  }
5985
5985
  }
5986
5986
  }) : e(p, function(g) {
5987
- var w = new l[g](), b = w.slice || w.set;
5988
- if (b) {
5987
+ var w = new l[g](), _ = w.slice || w.set;
5988
+ if (_) {
5989
5989
  var T = (
5990
5990
  /** @type {import('./types').BoundSlice | import('./types').BoundSet} */
5991
5991
  // @ts-expect-error TODO FIXME
5992
- r(b)
5992
+ r(_)
5993
5993
  );
5994
5994
  m[
5995
5995
  /** @type {`$${import('.').TypedArrayName}`} */
@@ -5998,42 +5998,42 @@ function vg() {
5998
5998
  }
5999
5999
  });
6000
6000
  var y = function(w) {
6001
- var b = !1;
6001
+ var _ = !1;
6002
6002
  return e(
6003
6003
  /** @type {Record<`\$${import('.').TypedArrayName}`, Getter>} */
6004
6004
  m,
6005
6005
  /** @type {(getter: Getter, name: `\$${import('.').TypedArrayName}`) => void} */
6006
6006
  function(T, E) {
6007
- if (!b)
6007
+ if (!_)
6008
6008
  try {
6009
- "$" + T(w) === E && (b = /** @type {import('.').TypedArrayName} */
6009
+ "$" + T(w) === E && (_ = /** @type {import('.').TypedArrayName} */
6010
6010
  c(E, 1));
6011
6011
  } catch {
6012
6012
  }
6013
6013
  }
6014
- ), b;
6014
+ ), _;
6015
6015
  }, O = function(w) {
6016
- var b = !1;
6016
+ var _ = !1;
6017
6017
  return e(
6018
6018
  /** @type {Record<`\$${import('.').TypedArrayName}`, Getter>} */
6019
6019
  m,
6020
6020
  /** @type {(getter: Getter, name: `\$${import('.').TypedArrayName}`) => void} */
6021
6021
  function(T, E) {
6022
- if (!b)
6022
+ if (!_)
6023
6023
  try {
6024
- T(w), b = /** @type {import('.').TypedArrayName} */
6024
+ T(w), _ = /** @type {import('.').TypedArrayName} */
6025
6025
  c(E, 1);
6026
6026
  } catch {
6027
6027
  }
6028
6028
  }
6029
- ), b;
6029
+ ), _;
6030
6030
  };
6031
6031
  return ba = function(w) {
6032
6032
  if (!w || typeof w != "object")
6033
6033
  return !1;
6034
6034
  if (!o) {
6035
- var b = c(n(w), 8, -1);
6036
- return d(p, b) > -1 ? b : b !== "Object" ? !1 : O(w);
6035
+ var _ = c(n(w), 8, -1);
6036
+ return d(p, _) > -1 ? _ : _ !== "Object" ? !1 : O(w);
6037
6037
  }
6038
6038
  return a ? y(w) : null;
6039
6039
  }, ba;
@@ -6245,7 +6245,7 @@ class un {
6245
6245
  7: "ref-delta"
6246
6246
  }, s = {}, n = t.slice(-20).toString("hex"), o = [], l = {}, p = /* @__PURE__ */ new Map();
6247
6247
  let c = null, d = null;
6248
- await My([t], async ({ data: w, type: b, reference: T, offset: E, num: I }) => {
6248
+ await My([t], async ({ data: w, type: _, reference: T, offset: E, num: I }) => {
6249
6249
  c === null && (c = I);
6250
6250
  const $ = Math.floor(
6251
6251
  (c - I) * 100 / c
@@ -6254,20 +6254,20 @@ class un {
6254
6254
  phase: "Receiving objects",
6255
6255
  loaded: c - I,
6256
6256
  total: c
6257
- }), d = $, b = a[b], ["commit", "tree", "blob", "tag"].includes(b) ? s[E] = {
6258
- type: b,
6257
+ }), d = $, _ = a[_], ["commit", "tree", "blob", "tag"].includes(_) ? s[E] = {
6258
+ type: _,
6259
6259
  offset: E
6260
- } : b === "ofs-delta" ? s[E] = {
6261
- type: b,
6260
+ } : _ === "ofs-delta" ? s[E] = {
6261
+ type: _,
6262
6262
  offset: E
6263
- } : b === "ref-delta" && (s[E] = {
6264
- type: b,
6263
+ } : _ === "ref-delta" && (s[E] = {
6264
+ type: _,
6265
6265
  offset: E
6266
6266
  });
6267
6267
  });
6268
6268
  const m = Object.keys(s).map(Number);
6269
- for (const [w, b] of m.entries()) {
6270
- const T = w + 1 === m.length ? t.byteLength - 20 : m[w + 1], E = s[b], I = Zh.buf(t.slice(b, T)) >>> 0;
6269
+ for (const [w, _] of m.entries()) {
6270
+ const T = w + 1 === m.length ? t.byteLength - 20 : m[w + 1], E = s[_], I = Zh.buf(t.slice(_, T)) >>> 0;
6271
6271
  E.end = T, E.crc = I;
6272
6272
  }
6273
6273
  const y = new un({
@@ -6283,12 +6283,12 @@ class un {
6283
6283
  const g = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0];
6284
6284
  for (let w in s) {
6285
6285
  w = Number(w);
6286
- const b = Math.floor(O * 100 / c);
6287
- b !== d && i && await i({
6286
+ const _ = Math.floor(O * 100 / c);
6287
+ _ !== d && i && await i({
6288
6288
  phase: "Resolving deltas",
6289
6289
  loaded: O,
6290
6290
  total: c
6291
- }), O++, d = b;
6291
+ }), O++, d = _;
6292
6292
  const T = s[w];
6293
6293
  if (!T.oid)
6294
6294
  try {
@@ -7838,7 +7838,7 @@ function $f(e, t, r, i) {
7838
7838
  }
7839
7839
  function Iw() {
7840
7840
  const e = this;
7841
- let t, r, i, a, s, n, o, l, p, c, d, m, y, O, g, w, b, T, E, I, $, L, C, _, F, P, S, j, R, D, V, B, Y;
7841
+ let t, r, i, a, s, n, o, l, p, c, d, m, y, O, g, w, _, T, E, I, $, L, C, b, F, P, S, j, R, D, V, B, Y;
7842
7842
  const G = new Fe(), te = new Fe(), z = new Fe();
7843
7843
  e.depth = [];
7844
7844
  let X, ee, Z, fe, oe, ie;
@@ -7847,7 +7847,7 @@ function Iw() {
7847
7847
  p = 2 * s, d[y - 1] = 0;
7848
7848
  for (let M = 0; M < y - 1; M++)
7849
7849
  d[M] = 0;
7850
- P = Lt[S].max_lazy, R = Lt[S].good_length, D = Lt[S].nice_length, F = Lt[S].max_chain, $ = 0, b = 0, C = 0, T = _ = Ne - 1, I = 0, m = 0;
7850
+ P = Lt[S].max_lazy, R = Lt[S].good_length, D = Lt[S].nice_length, F = Lt[S].max_chain, $ = 0, _ = 0, C = 0, T = b = Ne - 1, I = 0, m = 0;
7851
7851
  }
7852
7852
  function Te() {
7853
7853
  let M;
@@ -7926,7 +7926,7 @@ function Iw() {
7926
7926
  function H(M, K) {
7927
7927
  let W, Q, se;
7928
7928
  if (e.dist_buf[ee] = M, e.lc_buf[ee] = K & 255, ee++, M === 0 ? V[K * 2]++ : (Z++, M--, V[(Fe._length_code[K] + ai + 1) * 2]++, B[Fe.d_code(M) * 2]++), !(ee & 8191) && S > 2) {
7929
- for (W = ee * 8, Q = $ - b, se = 0; se < no; se++)
7929
+ for (W = ee * 8, Q = $ - _, se = 0; se < no; se++)
7930
7930
  W += B[se * 2] * (5 + Fe.extra_dbits[se]);
7931
7931
  if (W >>>= 3, Z < Math.floor(ee / 2) && W < Math.floor(Q / 2))
7932
7932
  return !0;
@@ -7955,7 +7955,7 @@ function Iw() {
7955
7955
  S > 0 ? (G.build_tree(e), te.build_tree(e), le = Et(), Q = e.opt_len + 3 + 7 >>> 3, se = e.static_len + 3 + 7 >>> 3, se <= Q && (Q = se)) : Q = se = K + 5, K + 4 <= Q && M != -1 ? he(M, K, W) : se == Q ? (Re((Sa << 1) + (W ? 1 : 0), 3), J(Je.static_ltree, Je.static_dtree)) : (Re((Lw << 1) + (W ? 1 : 0), 3), h(G.max_code + 1, te.max_code + 1, le + 1), J(V, B)), Te(), W && pe();
7956
7956
  }
7957
7957
  function ue(M) {
7958
- De(b >= 0 ? b : -1, $ - b, M), b = $, t.flush_pending();
7958
+ De(_ >= 0 ? _ : -1, $ - _, M), _ = $, t.flush_pending();
7959
7959
  }
7960
7960
  function yt() {
7961
7961
  let M, K, W, Q;
@@ -7965,7 +7965,7 @@ function Iw() {
7965
7965
  else if (Q == -1)
7966
7966
  Q--;
7967
7967
  else if ($ >= s + s - wt) {
7968
- l.set(l.subarray(s, s + s), 0), L -= s, $ -= s, b -= s, M = y, W = M;
7968
+ l.set(l.subarray(s, s + s), 0), L -= s, $ -= s, _ -= s, M = y, W = M;
7969
7969
  do
7970
7970
  K = d[--W] & 65535, d[W] = K >= s ? K - s : 0;
7971
7971
  while (--M !== 0);
@@ -7989,18 +7989,18 @@ function Iw() {
7989
7989
  if (C === 0)
7990
7990
  break;
7991
7991
  }
7992
- if ($ += C, C = 0, W = b + K, ($ === 0 || $ >= W) && (C = $ - W, $ = W, ue(!1), t.avail_out === 0) || $ - b >= s - wt && (ue(!1), t.avail_out === 0))
7992
+ if ($ += C, C = 0, W = _ + K, ($ === 0 || $ >= W) && (C = $ - W, $ = W, ue(!1), t.avail_out === 0) || $ - _ >= s - wt && (ue(!1), t.avail_out === 0))
7993
7993
  return St;
7994
7994
  }
7995
7995
  return ue(M == pt), t.avail_out === 0 ? M == pt ? kn : St : M == pt ? Ts : Os;
7996
7996
  }
7997
7997
  function Ft(M) {
7998
- let K = F, W = $, Q, se, le = _;
7998
+ let K = F, W = $, Q, se, le = b;
7999
7999
  const de = $ > s - wt ? $ - (s - wt) : 0;
8000
8000
  let Me = D;
8001
8001
  const ce = o, xe = $ + Hs;
8002
8002
  let q = l[W + le - 1], ae = l[W + le];
8003
- _ >= R && (K >>= 2), Me > C && (Me = C);
8003
+ b >= R && (K >>= 2), Me > C && (Me = C);
8004
8004
  do
8005
8005
  if (Q = M, !(l[Q + le] != ae || l[Q + le - 1] != q || l[Q] != l[W] || l[++Q] != l[W + 1])) {
8006
8006
  W += 2, Q++;
@@ -8050,11 +8050,11 @@ function Iw() {
8050
8050
  if (C === 0)
8051
8051
  break;
8052
8052
  }
8053
- if (C >= Ne && (m = (m << w ^ l[$ + (Ne - 1)] & 255) & g, K = d[m] & 65535, c[$ & o] = d[m], d[m] = $), _ = T, E = L, T = Ne - 1, K !== 0 && _ < P && ($ - K & 65535) <= s - wt && (j != Ps && (T = Ft(K)), T <= 5 && (j == vw || T == Ne && $ - L > 4096) && (T = Ne - 1)), _ >= Ne && T <= _) {
8054
- Q = $ + C - Ne, W = H($ - 1 - E, _ - Ne), C -= _ - 1, _ -= 2;
8053
+ if (C >= Ne && (m = (m << w ^ l[$ + (Ne - 1)] & 255) & g, K = d[m] & 65535, c[$ & o] = d[m], d[m] = $), b = T, E = L, T = Ne - 1, K !== 0 && b < P && ($ - K & 65535) <= s - wt && (j != Ps && (T = Ft(K)), T <= 5 && (j == vw || T == Ne && $ - L > 4096) && (T = Ne - 1)), b >= Ne && T <= b) {
8054
+ Q = $ + C - Ne, W = H($ - 1 - E, b - Ne), C -= b - 1, b -= 2;
8055
8055
  do
8056
8056
  ++$ <= Q && (m = (m << w ^ l[$ + (Ne - 1)] & 255) & g, K = d[m] & 65535, c[$ & o] = d[m], d[m] = $);
8057
- while (--_ !== 0);
8057
+ while (--b !== 0);
8058
8058
  if (I = 0, T = Ne - 1, $++, W && (ue(!1), t.avail_out === 0))
8059
8059
  return St;
8060
8060
  } else if (I !== 0) {
@@ -8081,7 +8081,7 @@ function Iw() {
8081
8081
  return Nt;
8082
8082
  if (Q < Ne)
8083
8083
  return Ct;
8084
- for (Q > s - wt && (Q = s - wt, le = W - Q), l.set(K.subarray(le, le + Q), 0), $ = Q, b = Q, m = l[0] & 255, m = (m << w ^ l[1] & 255) & g, se = 0; se <= Q - Ne; se++)
8084
+ for (Q > s - wt && (Q = s - wt, le = W - Q), l.set(K.subarray(le, le + Q), 0), $ = Q, _ = Q, m = l[0] & 255, m = (m << w ^ l[1] & 255) & g, se = 0; se <= Q - Ne; se++)
8085
8085
  m = (m << w ^ l[se + (Ne - 1)] & 255) & g, c[se & o] = d[m], d[m] = se;
8086
8086
  return Ct;
8087
8087
  }, e.deflate = function(M, K) {
@@ -9994,30 +9994,30 @@ const Nw = 15, ve = 0, sr = 1, Dw = 2, ut = -2, Le = -3, Rf = -4, ir = -5, _t =
9994
9994
  function io() {
9995
9995
  const e = this;
9996
9996
  let t, r, i, a, s, n;
9997
- function o(p, c, d, m, y, O, g, w, b, T, E) {
9998
- let I, $, L, C, _, F, P, S, j, R, D, V, B, Y, G;
9999
- R = 0, _ = d;
9997
+ function o(p, c, d, m, y, O, g, w, _, T, E) {
9998
+ let I, $, L, C, b, F, P, S, j, R, D, V, B, Y, G;
9999
+ R = 0, b = d;
10000
10000
  do
10001
- i[p[c + R]]++, R++, _--;
10002
- while (_ !== 0);
10001
+ i[p[c + R]]++, R++, b--;
10002
+ while (b !== 0);
10003
10003
  if (i[0] == d)
10004
10004
  return g[0] = -1, w[0] = 0, ve;
10005
10005
  for (S = w[0], F = 1; F <= fr && i[F] === 0; F++)
10006
10006
  ;
10007
- for (P = F, S < F && (S = F), _ = fr; _ !== 0 && i[_] === 0; _--)
10007
+ for (P = F, S < F && (S = F), b = fr; b !== 0 && i[b] === 0; b--)
10008
10008
  ;
10009
- for (L = _, S > _ && (S = _), w[0] = S, Y = 1 << F; F < _; F++, Y <<= 1)
10009
+ for (L = b, S > b && (S = b), w[0] = S, Y = 1 << F; F < b; F++, Y <<= 1)
10010
10010
  if ((Y -= i[F]) < 0)
10011
10011
  return Le;
10012
- if ((Y -= i[_]) < 0)
10012
+ if ((Y -= i[b]) < 0)
10013
10013
  return Le;
10014
- for (i[_] += Y, n[1] = F = 0, R = 1, B = 2; --_ !== 0; )
10014
+ for (i[b] += Y, n[1] = F = 0, R = 1, B = 2; --b !== 0; )
10015
10015
  n[B] = F += i[R], B++, R++;
10016
- _ = 0, R = 0;
10016
+ b = 0, R = 0;
10017
10017
  do
10018
- (F = p[c + R]) !== 0 && (E[n[F]++] = _), R++;
10019
- while (++_ < d);
10020
- for (d = n[L], n[0] = _ = 0, R = 0, C = -1, V = -S, s[0] = 0, D = 0, G = 0; P <= L; P++)
10018
+ (F = p[c + R]) !== 0 && (E[n[F]++] = b), R++;
10019
+ while (++b < d);
10020
+ for (d = n[L], n[0] = b = 0, R = 0, C = -1, V = -S, s[0] = 0, D = 0, G = 0; P <= L; P++)
10021
10021
  for (I = i[P]; I-- !== 0; ) {
10022
10022
  for (; P > V + S; ) {
10023
10023
  if (C++, V += S, G = L - V, G = G > S ? S : G, ($ = 1 << (F = P - V)) > I + 1 && ($ -= I + 1, B = P, F < G))
@@ -10026,19 +10026,19 @@ function io() {
10026
10026
  if (G = 1 << F, T[0] + G > gu)
10027
10027
  return Le;
10028
10028
  s[C] = D = /* hp+ */
10029
- T[0], T[0] += G, C !== 0 ? (n[C] = _, a[0] = /* (byte) */
10029
+ T[0], T[0] += G, C !== 0 ? (n[C] = b, a[0] = /* (byte) */
10030
10030
  F, a[1] = /* (byte) */
10031
- S, F = _ >>> V - S, a[2] = /* (int) */
10032
- D - s[C - 1] - F, b.set(a, (s[C - 1] + F) * 3)) : g[0] = D;
10031
+ S, F = b >>> V - S, a[2] = /* (int) */
10032
+ D - s[C - 1] - F, _.set(a, (s[C - 1] + F) * 3)) : g[0] = D;
10033
10033
  }
10034
10034
  for (a[1] = /* (byte) */
10035
10035
  P - V, R >= d ? a[0] = 192 : E[R] < m ? (a[0] = /* (byte) */
10036
10036
  E[R] < 256 ? 0 : 96, a[2] = E[R++]) : (a[0] = /* (byte) */
10037
- O[E[R] - m] + 16 + 64, a[2] = y[E[R++] - m]), $ = 1 << P - V, F = _ >>> V; F < G; F += $)
10038
- b.set(a, (D + F) * 3);
10039
- for (F = 1 << P - 1; _ & F; F >>>= 1)
10040
- _ ^= F;
10041
- for (_ ^= F, j = (1 << V) - 1; (_ & j) != n[C]; )
10037
+ O[E[R] - m] + 16 + 64, a[2] = y[E[R++] - m]), $ = 1 << P - V, F = b >>> V; F < G; F += $)
10038
+ _.set(a, (D + F) * 3);
10039
+ for (F = 1 << P - 1; b & F; F >>>= 1)
10040
+ b ^= F;
10041
+ for (b ^= F, j = (1 << V) - 1; (b & j) != n[C]; )
10042
10042
  C--, V -= S, j = (1 << V) - 1;
10043
10043
  }
10044
10044
  return Y !== 0 && L != 1 ? ir : ve;
@@ -10056,9 +10056,9 @@ function io() {
10056
10056
  e.inflate_trees_bits = function(p, c, d, m, y) {
10057
10057
  let O;
10058
10058
  return l(19), t[0] = 0, O = o(p, 0, 19, 19, null, null, d, c, m, t, r), O == Le ? y.msg = "oversubscribed dynamic bit lengths tree" : (O == ir || c[0] === 0) && (y.msg = "incomplete dynamic bit lengths tree", O = Le), O;
10059
- }, e.inflate_trees_dynamic = function(p, c, d, m, y, O, g, w, b) {
10059
+ }, e.inflate_trees_dynamic = function(p, c, d, m, y, O, g, w, _) {
10060
10060
  let T;
10061
- return l(288), t[0] = 0, T = o(d, 0, p, 257, zw, Vw, O, m, w, t, r), T != ve || m[0] === 0 ? (T == Le ? b.msg = "oversubscribed literal/length tree" : T != Rf && (b.msg = "incomplete literal/length tree", T = Le), T) : (l(288), T = o(d, p, c, 0, Zw, Gw, g, y, w, t, r), T != ve || y[0] === 0 && p > 257 ? (T == Le ? b.msg = "oversubscribed distance tree" : T == ir ? (b.msg = "incomplete distance tree", T = Le) : T != Rf && (b.msg = "empty distance tree with lengths", T = Le), T) : ve);
10061
+ return l(288), t[0] = 0, T = o(d, 0, p, 257, zw, Vw, O, m, w, t, r), T != ve || m[0] === 0 ? (T == Le ? _.msg = "oversubscribed literal/length tree" : T != Rf && (_.msg = "incomplete literal/length tree", T = Le), T) : (l(288), T = o(d, p, c, 0, Zw, Gw, g, y, w, t, r), T != ve || y[0] === 0 && p > 257 ? (T == Le ? _.msg = "oversubscribed distance tree" : T == ir ? (_.msg = "incomplete distance tree", T = Le) : T != Rf && (_.msg = "empty distance tree with lengths", T = Le), T) : ve);
10062
10062
  };
10063
10063
  }
10064
10064
  io.inflate_trees_fixed = function(e, t, r, i) {
@@ -10068,13 +10068,13 @@ const $s = 0, Ff = 1, Lf = 2, If = 3, Cf = 4, jf = 5, Nf = 6, Oa = 7, Df = 8, Rs
10068
10068
  function Yw() {
10069
10069
  const e = this;
10070
10070
  let t, r = 0, i, a = 0, s = 0, n = 0, o = 0, l = 0, p = 0, c = 0, d, m = 0, y, O = 0;
10071
- function g(w, b, T, E, I, $, L, C) {
10072
- let _, F, P, S, j, R, D, V, B, Y, G, te, z, X, ee, Z;
10073
- D = C.next_in_index, V = C.avail_in, j = L.bitb, R = L.bitk, B = L.write, Y = B < L.read ? L.read - B - 1 : L.end - B, G = _t[w], te = _t[b];
10071
+ function g(w, _, T, E, I, $, L, C) {
10072
+ let b, F, P, S, j, R, D, V, B, Y, G, te, z, X, ee, Z;
10073
+ D = C.next_in_index, V = C.avail_in, j = L.bitb, R = L.bitk, B = L.write, Y = B < L.read ? L.read - B - 1 : L.end - B, G = _t[w], te = _t[_];
10074
10074
  do {
10075
10075
  for (; R < 20; )
10076
10076
  V--, j |= (C.read_byte(D++) & 255) << R, R += 8;
10077
- if (_ = j & G, F = T, P = E, Z = (P + _) * 3, (S = F[Z]) === 0) {
10077
+ if (b = j & G, F = T, P = E, Z = (P + b) * 3, (S = F[Z]) === 0) {
10078
10078
  j >>= F[Z + 1], R -= F[Z + 1], L.win[B++] = /* (byte) */
10079
10079
  F[Z + 2], Y--;
10080
10080
  continue;
@@ -10084,7 +10084,7 @@ function Yw() {
10084
10084
  for (S &= 15, z = F[Z + 2] + /* (int) */
10085
10085
  (j & _t[S]), j >>= S, R -= S; R < 15; )
10086
10086
  V--, j |= (C.read_byte(D++) & 255) << R, R += 8;
10087
- _ = j & te, F = I, P = $, Z = (P + _) * 3, S = F[Z];
10087
+ b = j & te, F = I, P = $, Z = (P + b) * 3, S = F[Z];
10088
10088
  do
10089
10089
  if (j >>= F[Z + 1], R -= F[Z + 1], S & 16) {
10090
10090
  for (S &= 15; R < S; )
@@ -10114,7 +10114,7 @@ function Yw() {
10114
10114
  L.win.set(L.win.subarray(ee, ee + z), B), B += z, ee += z, z = 0;
10115
10115
  break;
10116
10116
  } else if (!(S & 64))
10117
- _ += F[Z + 2], _ += j & _t[S], Z = (P + _) * 3, S = F[Z];
10117
+ b += F[Z + 2], b += j & _t[S], Z = (P + b) * 3, S = F[Z];
10118
10118
  else
10119
10119
  return C.msg = "invalid distance code", z = C.avail_in - V, z = R >> 3 < z ? R >> 3 : z, V += z, D -= z, R -= z << 3, L.bitb = j, L.bitk = R, C.avail_in = V, C.total_in += D - C.next_in_index, C.next_in_index = D, L.write = B, Le;
10120
10120
  while (!0);
@@ -10122,7 +10122,7 @@ function Yw() {
10122
10122
  }
10123
10123
  if (S & 64)
10124
10124
  return S & 32 ? (z = C.avail_in - V, z = R >> 3 < z ? R >> 3 : z, V += z, D -= z, R -= z << 3, L.bitb = j, L.bitk = R, C.avail_in = V, C.total_in += D - C.next_in_index, C.next_in_index = D, L.write = B, sr) : (C.msg = "invalid literal/length code", z = C.avail_in - V, z = R >> 3 < z ? R >> 3 : z, V += z, D -= z, R -= z << 3, L.bitb = j, L.bitk = R, C.avail_in = V, C.total_in += D - C.next_in_index, C.next_in_index = D, L.write = B, Le);
10125
- if (_ += F[Z + 2], _ += j & _t[S], Z = (P + _) * 3, (S = F[Z]) === 0) {
10125
+ if (b += F[Z + 2], b += j & _t[S], Z = (P + b) * 3, (S = F[Z]) === 0) {
10126
10126
  j >>= F[Z + 1], R -= F[Z + 1], L.win[B++] = /* (byte) */
10127
10127
  F[Z + 2], Y--;
10128
10128
  break;
@@ -10131,16 +10131,16 @@ function Yw() {
10131
10131
  } while (Y >= 258 && V >= 10);
10132
10132
  return z = C.avail_in - V, z = R >> 3 < z ? R >> 3 : z, V += z, D -= z, R -= z << 3, L.bitb = j, L.bitk = R, C.avail_in = V, C.total_in += D - C.next_in_index, C.next_in_index = D, L.write = B, ve;
10133
10133
  }
10134
- e.init = function(w, b, T, E, I, $) {
10134
+ e.init = function(w, _, T, E, I, $) {
10135
10135
  t = $s, p = /* (byte) */
10136
10136
  w, c = /* (byte) */
10137
- b, d = T, m = E, y = I, O = $, i = null;
10138
- }, e.proc = function(w, b, T) {
10139
- let E, I, $, L = 0, C = 0, _ = 0, F, P, S, j;
10140
- for (_ = b.next_in_index, F = b.avail_in, L = w.bitb, C = w.bitk, P = w.write, S = P < w.read ? w.read - P - 1 : w.end - P; ; )
10137
+ _, d = T, m = E, y = I, O = $, i = null;
10138
+ }, e.proc = function(w, _, T) {
10139
+ let E, I, $, L = 0, C = 0, b = 0, F, P, S, j;
10140
+ for (b = _.next_in_index, F = _.avail_in, L = w.bitb, C = w.bitk, P = w.write, S = P < w.read ? w.read - P - 1 : w.end - P; ; )
10141
10141
  switch (t) {
10142
10142
  case $s:
10143
- if (S >= 258 && F >= 10 && (w.bitb = L, w.bitk = C, b.avail_in = F, b.total_in += _ - b.next_in_index, b.next_in_index = _, w.write = P, T = g(p, c, d, m, y, O, w, b), _ = b.next_in_index, F = b.avail_in, L = w.bitb, C = w.bitk, P = w.write, S = P < w.read ? w.read - P - 1 : w.end - P, T != ve)) {
10143
+ if (S >= 258 && F >= 10 && (w.bitb = L, w.bitk = C, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = P, T = g(p, c, d, m, y, O, w, _), b = _.next_in_index, F = _.avail_in, L = w.bitb, C = w.bitk, P = w.write, S = P < w.read ? w.read - P - 1 : w.end - P, T != ve)) {
10144
10144
  t = T == sr ? Oa : Rs;
10145
10145
  break;
10146
10146
  }
@@ -10150,8 +10150,8 @@ function Yw() {
10150
10150
  if (F !== 0)
10151
10151
  T = ve;
10152
10152
  else
10153
- return w.bitb = L, w.bitk = C, b.avail_in = F, b.total_in += _ - b.next_in_index, b.next_in_index = _, w.write = P, w.inflate_flush(b, T);
10154
- F--, L |= (b.read_byte(_++) & 255) << C, C += 8;
10153
+ return w.bitb = L, w.bitk = C, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = P, w.inflate_flush(_, T);
10154
+ F--, L |= (_.read_byte(b++) & 255) << C, C += 8;
10155
10155
  }
10156
10156
  if (I = (a + (L & _t[E])) * 3, L >>>= i[I + 1], C -= i[I + 1], $ = i[I], $ === 0) {
10157
10157
  n = i[I + 2], t = Nf;
@@ -10169,14 +10169,14 @@ function Yw() {
10169
10169
  t = Oa;
10170
10170
  break;
10171
10171
  }
10172
- return t = Rs, b.msg = "invalid literal/length code", T = Le, w.bitb = L, w.bitk = C, b.avail_in = F, b.total_in += _ - b.next_in_index, b.next_in_index = _, w.write = P, w.inflate_flush(b, T);
10172
+ return t = Rs, _.msg = "invalid literal/length code", T = Le, w.bitb = L, w.bitk = C, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = P, w.inflate_flush(_, T);
10173
10173
  case Lf:
10174
10174
  for (E = o; C < E; ) {
10175
10175
  if (F !== 0)
10176
10176
  T = ve;
10177
10177
  else
10178
- return w.bitb = L, w.bitk = C, b.avail_in = F, b.total_in += _ - b.next_in_index, b.next_in_index = _, w.write = P, w.inflate_flush(b, T);
10179
- F--, L |= (b.read_byte(_++) & 255) << C, C += 8;
10178
+ return w.bitb = L, w.bitk = C, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = P, w.inflate_flush(_, T);
10179
+ F--, L |= (_.read_byte(b++) & 255) << C, C += 8;
10180
10180
  }
10181
10181
  r += L & _t[E], L >>= E, C -= E, s = c, i = y, a = O, t = If;
10182
10182
  case If:
@@ -10184,8 +10184,8 @@ function Yw() {
10184
10184
  if (F !== 0)
10185
10185
  T = ve;
10186
10186
  else
10187
- return w.bitb = L, w.bitk = C, b.avail_in = F, b.total_in += _ - b.next_in_index, b.next_in_index = _, w.write = P, w.inflate_flush(b, T);
10188
- F--, L |= (b.read_byte(_++) & 255) << C, C += 8;
10187
+ return w.bitb = L, w.bitk = C, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = P, w.inflate_flush(_, T);
10188
+ F--, L |= (_.read_byte(b++) & 255) << C, C += 8;
10189
10189
  }
10190
10190
  if (I = (a + (L & _t[E])) * 3, L >>= i[I + 1], C -= i[I + 1], $ = i[I], $ & 16) {
10191
10191
  o = $ & 15, l = i[I + 2], t = Cf;
@@ -10195,42 +10195,42 @@ function Yw() {
10195
10195
  s = $, a = I / 3 + i[I + 2];
10196
10196
  break;
10197
10197
  }
10198
- return t = Rs, b.msg = "invalid distance code", T = Le, w.bitb = L, w.bitk = C, b.avail_in = F, b.total_in += _ - b.next_in_index, b.next_in_index = _, w.write = P, w.inflate_flush(b, T);
10198
+ return t = Rs, _.msg = "invalid distance code", T = Le, w.bitb = L, w.bitk = C, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = P, w.inflate_flush(_, T);
10199
10199
  case Cf:
10200
10200
  for (E = o; C < E; ) {
10201
10201
  if (F !== 0)
10202
10202
  T = ve;
10203
10203
  else
10204
- return w.bitb = L, w.bitk = C, b.avail_in = F, b.total_in += _ - b.next_in_index, b.next_in_index = _, w.write = P, w.inflate_flush(b, T);
10205
- F--, L |= (b.read_byte(_++) & 255) << C, C += 8;
10204
+ return w.bitb = L, w.bitk = C, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = P, w.inflate_flush(_, T);
10205
+ F--, L |= (_.read_byte(b++) & 255) << C, C += 8;
10206
10206
  }
10207
10207
  l += L & _t[E], L >>= E, C -= E, t = jf;
10208
10208
  case jf:
10209
10209
  for (j = P - l; j < 0; )
10210
10210
  j += w.end;
10211
10211
  for (; r !== 0; ) {
10212
- if (S === 0 && (P == w.end && w.read !== 0 && (P = 0, S = P < w.read ? w.read - P - 1 : w.end - P), S === 0 && (w.write = P, T = w.inflate_flush(b, T), P = w.write, S = P < w.read ? w.read - P - 1 : w.end - P, P == w.end && w.read !== 0 && (P = 0, S = P < w.read ? w.read - P - 1 : w.end - P), S === 0)))
10213
- return w.bitb = L, w.bitk = C, b.avail_in = F, b.total_in += _ - b.next_in_index, b.next_in_index = _, w.write = P, w.inflate_flush(b, T);
10212
+ if (S === 0 && (P == w.end && w.read !== 0 && (P = 0, S = P < w.read ? w.read - P - 1 : w.end - P), S === 0 && (w.write = P, T = w.inflate_flush(_, T), P = w.write, S = P < w.read ? w.read - P - 1 : w.end - P, P == w.end && w.read !== 0 && (P = 0, S = P < w.read ? w.read - P - 1 : w.end - P), S === 0)))
10213
+ return w.bitb = L, w.bitk = C, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = P, w.inflate_flush(_, T);
10214
10214
  w.win[P++] = w.win[j++], S--, j == w.end && (j = 0), r--;
10215
10215
  }
10216
10216
  t = $s;
10217
10217
  break;
10218
10218
  case Nf:
10219
- if (S === 0 && (P == w.end && w.read !== 0 && (P = 0, S = P < w.read ? w.read - P - 1 : w.end - P), S === 0 && (w.write = P, T = w.inflate_flush(b, T), P = w.write, S = P < w.read ? w.read - P - 1 : w.end - P, P == w.end && w.read !== 0 && (P = 0, S = P < w.read ? w.read - P - 1 : w.end - P), S === 0)))
10220
- return w.bitb = L, w.bitk = C, b.avail_in = F, b.total_in += _ - b.next_in_index, b.next_in_index = _, w.write = P, w.inflate_flush(b, T);
10219
+ if (S === 0 && (P == w.end && w.read !== 0 && (P = 0, S = P < w.read ? w.read - P - 1 : w.end - P), S === 0 && (w.write = P, T = w.inflate_flush(_, T), P = w.write, S = P < w.read ? w.read - P - 1 : w.end - P, P == w.end && w.read !== 0 && (P = 0, S = P < w.read ? w.read - P - 1 : w.end - P), S === 0)))
10220
+ return w.bitb = L, w.bitk = C, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = P, w.inflate_flush(_, T);
10221
10221
  T = ve, w.win[P++] = /* (byte) */
10222
10222
  n, S--, t = $s;
10223
10223
  break;
10224
10224
  case Oa:
10225
- if (C > 7 && (C -= 8, F++, _--), w.write = P, T = w.inflate_flush(b, T), P = w.write, S = P < w.read ? w.read - P - 1 : w.end - P, w.read != w.write)
10226
- return w.bitb = L, w.bitk = C, b.avail_in = F, b.total_in += _ - b.next_in_index, b.next_in_index = _, w.write = P, w.inflate_flush(b, T);
10225
+ if (C > 7 && (C -= 8, F++, b--), w.write = P, T = w.inflate_flush(_, T), P = w.write, S = P < w.read ? w.read - P - 1 : w.end - P, w.read != w.write)
10226
+ return w.bitb = L, w.bitk = C, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = P, w.inflate_flush(_, T);
10227
10227
  t = Df;
10228
10228
  case Df:
10229
- return T = sr, w.bitb = L, w.bitk = C, b.avail_in = F, b.total_in += _ - b.next_in_index, b.next_in_index = _, w.write = P, w.inflate_flush(b, T);
10229
+ return T = sr, w.bitb = L, w.bitk = C, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = P, w.inflate_flush(_, T);
10230
10230
  case Rs:
10231
- return T = Le, w.bitb = L, w.bitk = C, b.avail_in = F, b.total_in += _ - b.next_in_index, b.next_in_index = _, w.write = P, w.inflate_flush(b, T);
10231
+ return T = Le, w.bitb = L, w.bitk = C, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = P, w.inflate_flush(_, T);
10232
10232
  default:
10233
- return T = ut, w.bitb = L, w.bitk = C, b.avail_in = F, b.total_in += _ - b.next_in_index, b.next_in_index = _, w.write = P, w.inflate_flush(b, T);
10233
+ return T = ut, w.bitb = L, w.bitk = C, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = P, w.inflate_flush(_, T);
10234
10234
  }
10235
10235
  }, e.free = function() {
10236
10236
  };
@@ -10266,11 +10266,11 @@ function Kw(e, t) {
10266
10266
  r.bitk = 0, r.bitb = 0, r.win = new Uint8Array(t), r.end = t, r.read = 0, r.write = 0, r.reset = function(g, w) {
10267
10267
  w && (w[0] = y), i == Fs && c.free(g), i = Kr, r.bitk = 0, r.bitb = 0, r.read = r.write = 0;
10268
10268
  }, r.reset(e, null), r.inflate_flush = function(g, w) {
10269
- let b, T, E;
10270
- return T = g.next_out_index, E = r.read, b = /* (int) */
10271
- (E <= r.write ? r.write : r.end) - E, b > g.avail_out && (b = g.avail_out), b !== 0 && w == ir && (w = ve), g.avail_out -= b, g.total_out += b, g.next_out.set(r.win.subarray(E, E + b), T), T += b, E += b, E == r.end && (E = 0, r.write == r.end && (r.write = 0), b = r.write - E, b > g.avail_out && (b = g.avail_out), b !== 0 && w == ir && (w = ve), g.avail_out -= b, g.total_out += b, g.next_out.set(r.win.subarray(E, E + b), T), T += b, E += b), g.next_out_index = T, r.read = E, w;
10269
+ let _, T, E;
10270
+ return T = g.next_out_index, E = r.read, _ = /* (int) */
10271
+ (E <= r.write ? r.write : r.end) - E, _ > g.avail_out && (_ = g.avail_out), _ !== 0 && w == ir && (w = ve), g.avail_out -= _, g.total_out += _, g.next_out.set(r.win.subarray(E, E + _), T), T += _, E += _, E == r.end && (E = 0, r.write == r.end && (r.write = 0), _ = r.write - E, _ > g.avail_out && (_ = g.avail_out), _ !== 0 && w == ir && (w = ve), g.avail_out -= _, g.total_out += _, g.next_out.set(r.win.subarray(E, E + _), T), T += _, E += _), g.next_out_index = T, r.read = E, w;
10272
10272
  }, r.proc = function(g, w) {
10273
- let b, T, E, I, $, L, C, _;
10273
+ let _, T, E, I, $, L, C, b;
10274
10274
  for (I = g.next_in_index, $ = g.avail_in, T = r.bitb, E = r.bitk, L = r.write, C = /* (int) */
10275
10275
  L < r.read ? r.read - L - 1 : r.end - L; ; ) {
10276
10276
  let F, P, S, j, R, D, V, B;
@@ -10283,10 +10283,10 @@ function Kw(e, t) {
10283
10283
  return r.bitb = T, r.bitk = E, g.avail_in = $, g.total_in += I - g.next_in_index, g.next_in_index = I, r.write = L, r.inflate_flush(g, w);
10284
10284
  $--, T |= (g.read_byte(I++) & 255) << E, E += 8;
10285
10285
  }
10286
- switch (b = /* (int) */
10287
- T & 7, d = b & 1, b >>> 1) {
10286
+ switch (_ = /* (int) */
10287
+ T & 7, d = _ & 1, _ >>> 1) {
10288
10288
  case 0:
10289
- T >>>= 3, E -= 3, b = E & 7, T >>>= b, E -= b, i = Ta;
10289
+ T >>>= 3, E -= 3, _ = E & 7, T >>>= _, E -= _, i = Ta;
10290
10290
  break;
10291
10291
  case 1:
10292
10292
  F = [], P = [], S = [[]], j = [[]], io.inflate_trees_fixed(F, P, S, j), c.init(F[0], P[0], S[0], 0, j[0], 0), T >>>= 3, E -= 3, i = Fs;
@@ -10316,7 +10316,7 @@ function Kw(e, t) {
10316
10316
  L < r.read ? r.read - L - 1 : r.end - L, L == r.end && r.read !== 0 && (L = 0, C = /* (int) */
10317
10317
  L < r.read ? r.read - L - 1 : r.end - L), C === 0)))
10318
10318
  return r.bitb = T, r.bitk = E, g.avail_in = $, g.total_in += I - g.next_in_index, g.next_in_index = I, r.write = L, r.inflate_flush(g, w);
10319
- if (w = ve, b = a, b > $ && (b = $), b > C && (b = C), r.win.set(g.read_buf(I, b), L), I += b, $ -= b, L += b, C -= b, (a -= b) !== 0)
10319
+ if (w = ve, _ = a, _ > $ && (_ = $), _ > C && (_ = C), r.win.set(g.read_buf(I, _), L), I += _, $ -= _, L += _, C -= _, (a -= _) !== 0)
10320
10320
  break;
10321
10321
  i = d !== 0 ? Ls : Kr;
10322
10322
  break;
@@ -10328,13 +10328,13 @@ function Kw(e, t) {
10328
10328
  return r.bitb = T, r.bitk = E, g.avail_in = $, g.total_in += I - g.next_in_index, g.next_in_index = I, r.write = L, r.inflate_flush(g, w);
10329
10329
  $--, T |= (g.read_byte(I++) & 255) << E, E += 8;
10330
10330
  }
10331
- if (s = b = T & 16383, (b & 31) > 29 || (b >> 5 & 31) > 29)
10331
+ if (s = _ = T & 16383, (_ & 31) > 29 || (_ >> 5 & 31) > 29)
10332
10332
  return i = kr, g.msg = "too many length or distance symbols", w = Le, r.bitb = T, r.bitk = E, g.avail_in = $, g.total_in += I - g.next_in_index, g.next_in_index = I, r.write = L, r.inflate_flush(g, w);
10333
- if (b = 258 + (b & 31) + (b >> 5 & 31), !o || o.length < b)
10333
+ if (_ = 258 + (_ & 31) + (_ >> 5 & 31), !o || o.length < _)
10334
10334
  o = [];
10335
10335
  else
10336
- for (_ = 0; _ < b; _++)
10337
- o[_] = 0;
10336
+ for (b = 0; b < _; b++)
10337
+ o[b] = 0;
10338
10338
  T >>>= 14, E -= 14, n = 0, i = Mf;
10339
10339
  case Mf:
10340
10340
  for (; n < 4 + (s >>> 10); ) {
@@ -10349,40 +10349,40 @@ function Kw(e, t) {
10349
10349
  }
10350
10350
  for (; n < 19; )
10351
10351
  o[Uf[n++]] = 0;
10352
- if (l[0] = 7, b = O.inflate_trees_bits(o, l, p, m, g), b != ve)
10353
- return w = b, w == Le && (o = null, i = kr), r.bitb = T, r.bitk = E, g.avail_in = $, g.total_in += I - g.next_in_index, g.next_in_index = I, r.write = L, r.inflate_flush(g, w);
10352
+ if (l[0] = 7, _ = O.inflate_trees_bits(o, l, p, m, g), _ != ve)
10353
+ return w = _, w == Le && (o = null, i = kr), r.bitb = T, r.bitk = E, g.avail_in = $, g.total_in += I - g.next_in_index, g.next_in_index = I, r.write = L, r.inflate_flush(g, w);
10354
10354
  n = 0, i = Wf;
10355
10355
  case Wf:
10356
- for (; b = s, !(n >= 258 + (b & 31) + (b >> 5 & 31)); ) {
10356
+ for (; _ = s, !(n >= 258 + (_ & 31) + (_ >> 5 & 31)); ) {
10357
10357
  let Y, G;
10358
- for (b = l[0]; E < b; ) {
10358
+ for (_ = l[0]; E < _; ) {
10359
10359
  if ($ !== 0)
10360
10360
  w = ve;
10361
10361
  else
10362
10362
  return r.bitb = T, r.bitk = E, g.avail_in = $, g.total_in += I - g.next_in_index, g.next_in_index = I, r.write = L, r.inflate_flush(g, w);
10363
10363
  $--, T |= (g.read_byte(I++) & 255) << E, E += 8;
10364
10364
  }
10365
- if (b = m[(p[0] + (T & _t[b])) * 3 + 1], G = m[(p[0] + (T & _t[b])) * 3 + 2], G < 16)
10366
- T >>>= b, E -= b, o[n++] = G;
10365
+ if (_ = m[(p[0] + (T & _t[_])) * 3 + 1], G = m[(p[0] + (T & _t[_])) * 3 + 2], G < 16)
10366
+ T >>>= _, E -= _, o[n++] = G;
10367
10367
  else {
10368
- for (_ = G == 18 ? 7 : G - 14, Y = G == 18 ? 11 : 3; E < b + _; ) {
10368
+ for (b = G == 18 ? 7 : G - 14, Y = G == 18 ? 11 : 3; E < _ + b; ) {
10369
10369
  if ($ !== 0)
10370
10370
  w = ve;
10371
10371
  else
10372
10372
  return r.bitb = T, r.bitk = E, g.avail_in = $, g.total_in += I - g.next_in_index, g.next_in_index = I, r.write = L, r.inflate_flush(g, w);
10373
10373
  $--, T |= (g.read_byte(I++) & 255) << E, E += 8;
10374
10374
  }
10375
- if (T >>>= b, E -= b, Y += T & _t[_], T >>>= _, E -= _, _ = n, b = s, _ + Y > 258 + (b & 31) + (b >> 5 & 31) || G == 16 && _ < 1)
10375
+ if (T >>>= _, E -= _, Y += T & _t[b], T >>>= b, E -= b, b = n, _ = s, b + Y > 258 + (_ & 31) + (_ >> 5 & 31) || G == 16 && b < 1)
10376
10376
  return o = null, i = kr, g.msg = "invalid bit length repeat", w = Le, r.bitb = T, r.bitk = E, g.avail_in = $, g.total_in += I - g.next_in_index, g.next_in_index = I, r.write = L, r.inflate_flush(g, w);
10377
- G = G == 16 ? o[_ - 1] : 0;
10377
+ G = G == 16 ? o[b - 1] : 0;
10378
10378
  do
10379
- o[_++] = G;
10379
+ o[b++] = G;
10380
10380
  while (--Y !== 0);
10381
- n = _;
10381
+ n = b;
10382
10382
  }
10383
10383
  }
10384
- if (p[0] = -1, R = [], D = [], V = [], B = [], R[0] = 9, D[0] = 6, b = s, b = O.inflate_trees_dynamic(257 + (b & 31), 1 + (b >> 5 & 31), o, R, D, V, B, m, g), b != ve)
10385
- return b == Le && (o = null, i = kr), w = b, r.bitb = T, r.bitk = E, g.avail_in = $, g.total_in += I - g.next_in_index, g.next_in_index = I, r.write = L, r.inflate_flush(g, w);
10384
+ if (p[0] = -1, R = [], D = [], V = [], B = [], R[0] = 9, D[0] = 6, _ = s, _ = O.inflate_trees_dynamic(257 + (_ & 31), 1 + (_ >> 5 & 31), o, R, D, V, B, m, g), _ != ve)
10385
+ return _ == Le && (o = null, i = kr), w = _, r.bitb = T, r.bitk = E, g.avail_in = $, g.total_in += I - g.next_in_index, g.next_in_index = I, r.write = L, r.inflate_flush(g, w);
10386
10386
  c.init(R[0], D[0], m, V[0], m, B[0]), i = Fs;
10387
10387
  case Fs:
10388
10388
  if (r.bitb = T, r.bitk = E, g.avail_in = $, g.total_in += I - g.next_in_index, g.next_in_index = I, r.write = L, (w = c.proc(r, g, w)) != sr)
@@ -10408,8 +10408,8 @@ function Kw(e, t) {
10408
10408
  }
10409
10409
  }, r.free = function(g) {
10410
10410
  r.reset(g, null), r.win = null, m = null;
10411
- }, r.set_dictionary = function(g, w, b) {
10412
- r.win.set(g.subarray(w, w + b), 0), r.read = r.write = b;
10411
+ }, r.set_dictionary = function(g, w, _) {
10412
+ r.win.set(g.subarray(w, w + _), 0), r.read = r.write = _;
10413
10413
  }, r.sync_point = function() {
10414
10414
  return i == Ta ? 1 : 0;
10415
10415
  };
@@ -12526,9 +12526,9 @@ ku.aes = class {
12526
12526
  if (e.length !== 4)
12527
12527
  throw new Error("invalid aes block size");
12528
12528
  const r = this._key[t], i = r.length / 4 - 2, a = [0, 0, 0, 0], s = this._tables[t], n = s[0], o = s[1], l = s[2], p = s[3], c = s[4];
12529
- let d = e[0] ^ r[0], m = e[t ? 3 : 1] ^ r[1], y = e[2] ^ r[2], O = e[t ? 1 : 3] ^ r[3], g = 4, w, b, T;
12529
+ let d = e[0] ^ r[0], m = e[t ? 3 : 1] ^ r[1], y = e[2] ^ r[2], O = e[t ? 1 : 3] ^ r[3], g = 4, w, _, T;
12530
12530
  for (let E = 0; E < i; E++)
12531
- w = n[d >>> 24] ^ o[m >> 16 & 255] ^ l[y >> 8 & 255] ^ p[O & 255] ^ r[g], b = n[m >>> 24] ^ o[y >> 16 & 255] ^ l[O >> 8 & 255] ^ p[d & 255] ^ r[g + 1], T = n[y >>> 24] ^ o[O >> 16 & 255] ^ l[d >> 8 & 255] ^ p[m & 255] ^ r[g + 2], O = n[O >>> 24] ^ o[d >> 16 & 255] ^ l[m >> 8 & 255] ^ p[y & 255] ^ r[g + 3], g += 4, d = w, m = b, y = T;
12531
+ w = n[d >>> 24] ^ o[m >> 16 & 255] ^ l[y >> 8 & 255] ^ p[O & 255] ^ r[g], _ = n[m >>> 24] ^ o[y >> 16 & 255] ^ l[O >> 8 & 255] ^ p[d & 255] ^ r[g + 1], T = n[y >>> 24] ^ o[O >> 16 & 255] ^ l[d >> 8 & 255] ^ p[m & 255] ^ r[g + 2], O = n[O >>> 24] ^ o[d >> 16 & 255] ^ l[m >> 8 & 255] ^ p[y & 255] ^ r[g + 3], g += 4, d = w, m = _, y = T;
12532
12532
  for (let E = 0; E < 4; E++)
12533
12533
  a[t ? 3 & -E : E] = c[d >>> 24] << 24 ^ c[m >> 16 & 255] << 16 ^ c[y >> 8 & 255] << 8 ^ c[O & 255] ^ r[g++], w = d, d = m, m = y, y = O, O = w;
12534
12534
  return a;
@@ -13191,8 +13191,8 @@ async function ib({ data: e }, t) {
13191
13191
  const { type: r, value: i, messageId: a, result: s, error: n } = e, { reader: o, writer: l, resolveResult: p, rejectResult: c, onTaskFinished: d } = t;
13192
13192
  try {
13193
13193
  if (n) {
13194
- const { message: y, stack: O, code: g, name: w } = n, b = new Error(y);
13195
- Object.assign(b, { stack: O, code: g, name: w }), m(b);
13194
+ const { message: y, stack: O, code: g, name: w } = n, _ = new Error(y);
13195
+ Object.assign(_, { stack: O, code: g, name: w }), m(_);
13196
13196
  } else {
13197
13197
  if (r == G1) {
13198
13198
  const { value: y, done: O } = await o.read();
@@ -13216,20 +13216,20 @@ async function ab(e, t) {
13216
13216
  const y = !l && !p && !c && !t.transferStreams;
13217
13217
  return t.useWebWorkers = !y && (s || s === lt && i.useWebWorkers), t.scripts = t.useWebWorkers && d ? d[o] : [], r.useCompressionStream = n || n === lt && i.useCompressionStream, (await O()).run();
13218
13218
  async function O() {
13219
- const w = Or.find((b) => !b.busy);
13219
+ const w = Or.find((_) => !_.busy);
13220
13220
  if (w)
13221
13221
  return wp(w), new La(w, e, t, g);
13222
13222
  if (Or.length < m) {
13223
- const b = { indexWorker: gp };
13224
- return gp++, Or.push(b), new La(b, e, t, g);
13223
+ const _ = { indexWorker: gp };
13224
+ return gp++, Or.push(_), new La(_, e, t, g);
13225
13225
  } else
13226
- return new Promise((b) => Ca.push({ resolve: b, stream: e, workerOptions: t }));
13226
+ return new Promise((_) => Ca.push({ resolve: _, stream: e, workerOptions: t }));
13227
13227
  }
13228
13228
  function g(w) {
13229
13229
  if (Ca.length) {
13230
- const [{ resolve: b, stream: T, workerOptions: E }] = Ca.splice(0, 1);
13231
- b(new La(w, T, E, g));
13232
- } else w.worker ? (wp(w), ob(w, t)) : Or = Or.filter((b) => b != w);
13230
+ const [{ resolve: _, stream: T, workerOptions: E }] = Ca.splice(0, 1);
13231
+ _(new La(w, T, E, g));
13232
+ } else w.worker ? (wp(w), ob(w, t)) : Or = Or.filter((_) => _ != w);
13233
13233
  }
13234
13234
  }
13235
13235
  function ob(e, t) {
@@ -13494,7 +13494,7 @@ class Ep {
13494
13494
  const p = s.offset, c = Ge(n, 20), d = p + Xr + c;
13495
13495
  let m = Ge(n, 4);
13496
13496
  const y = i.lastDiskNumber || 0;
13497
- let O = Ge(n, 6), g = Ge(n, 8), w = 0, b = 0;
13497
+ let O = Ge(n, 6), g = Ge(n, 8), w = 0, _ = 0;
13498
13498
  if (l == Fr || o == Fr || g == mr || O == mr) {
13499
13499
  const P = await et(i, s.offset - $a, $a), S = Ye(P);
13500
13500
  if (Be(S, 0) == f1) {
@@ -13558,7 +13558,7 @@ class Ep {
13558
13558
  filename: Ie,
13559
13559
  comment: Ce,
13560
13560
  directory: ie || Ie.endsWith(ip)
13561
- }), b = Math.max(Te, b), td(S, S, I, T + 6), S.zipCrypto = S.encrypted && !S.extraFieldAES;
13561
+ }), _ = Math.max(Te, _), td(S, S, I, T + 6), S.zipCrypto = S.encrypted && !S.extraFieldAES;
13562
13562
  const ft = new _p(S);
13563
13563
  ft.getData = (x, u) => S.getData(x, ft, u), T = X;
13564
13564
  const { onprogress: Re } = t;
@@ -13569,8 +13569,8 @@ class Ep {
13569
13569
  }
13570
13570
  yield ft;
13571
13571
  }
13572
- const _ = it(r, t, "extractPrependedData"), F = it(r, t, "extractAppendedData");
13573
- return _ && (r.prependedData = b > 0 ? await et(i, 0, b) : new Uint8Array()), r.comment = c ? await et(i, p + Xr, c) : new Uint8Array(), F && (r.appendedData = d < i.size ? await et(i, d, i.size - d) : new Uint8Array()), !0;
13572
+ const b = it(r, t, "extractPrependedData"), F = it(r, t, "extractAppendedData");
13573
+ return b && (r.prependedData = _ > 0 ? await et(i, 0, _) : new Uint8Array()), r.comment = c ? await et(i, p + Xr, c) : new Uint8Array(), F && (r.appendedData = d < i.size ? await et(i, d, i.size - d) : new Uint8Array()), !0;
13574
13574
  }
13575
13575
  async getEntries(t = {}) {
13576
13576
  const r = [];
@@ -13602,7 +13602,7 @@ class Mb {
13602
13602
  rawLastModDate: y,
13603
13603
  uncompressedSize: O,
13604
13604
  compressedSize: g
13605
- } = a, w = r.localDirectory = {}, b = await et(s, n, 30, o), T = Ye(b);
13605
+ } = a, w = r.localDirectory = {}, _ = await et(s, n, 30, o), T = Ye(_);
13606
13606
  let E = it(a, i, "password"), I = it(a, i, "rawPassword");
13607
13607
  const $ = it(a, i, "passThrough");
13608
13608
  if (E = E && E.length && E, I = I && I.length && I, l && l.originalCompressionMethod != i1)
@@ -13622,10 +13622,10 @@ class Mb {
13622
13622
  if (!E && !I)
13623
13623
  throw new Error(Db);
13624
13624
  }
13625
- const _ = n + 30 + w.filenameLength + w.extraFieldLength, F = g, P = s.readable;
13625
+ const b = n + 30 + w.filenameLength + w.extraFieldLength, F = g, P = s.readable;
13626
13626
  Object.assign(P, {
13627
13627
  diskNumberStart: o,
13628
- offset: _,
13628
+ offset: b,
13629
13629
  size: F
13630
13630
  });
13631
13631
  const S = it(a, i, "signal"), j = it(a, i, "checkPasswordOnly");
@@ -13684,9 +13684,9 @@ function td(e, t, r, i, a) {
13684
13684
  let l = 0;
13685
13685
  try {
13686
13686
  for (; l < s.length; ) {
13687
- const b = Ge(o, l), T = Ge(o, l + 2);
13688
- n.set(b, {
13689
- type: b,
13687
+ const _ = Ge(o, l), T = Ge(o, l + 2);
13688
+ n.set(_, {
13689
+ type: _,
13690
13690
  data: s.slice(l + 4, l + 4 + T)
13691
13691
  }), l += 4 + T;
13692
13692
  }
@@ -14086,14 +14086,14 @@ async function n_(e, t, r, i) {
14086
14086
  headers: c,
14087
14087
  body: O,
14088
14088
  ...m && { credentials: "include" }
14089
- }), b = await fetch(w);
14090
- if (!b.headers.has(r_))
14089
+ }), _ = await fetch(w);
14090
+ if (!_.headers.has(r_))
14091
14091
  throw new t_(
14092
14092
  a.url,
14093
- b.status,
14094
- b.statusText
14093
+ _.status,
14094
+ _.statusText
14095
14095
  );
14096
- return b;
14096
+ return _;
14097
14097
  }
14098
14098
  }
14099
14099
  const s_ = `Blueprint resource of type "bundled" requires a filesystem.
@@ -17156,7 +17156,7 @@ function Lr(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
17156
17156
  if (y = y || o, !y) {
17157
17157
  const g = n;
17158
17158
  if (!(c && typeof c == "object" && !Array.isArray(c)) && typeof c != "string") {
17159
- const b = {
17159
+ const _ = {
17160
17160
  instancePath: t + "/" + p.replace(/~/g, "~0").replace(/\//g, "~1"),
17161
17161
  schemaPath: "#/additionalProperties/anyOf/1/type",
17162
17162
  keyword: "type",
@@ -17165,7 +17165,7 @@ function Lr(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
17165
17165
  },
17166
17166
  message: "must be object,string"
17167
17167
  };
17168
- s === null ? s = [b] : s.push(b), n++;
17168
+ s === null ? s = [_] : s.push(_), n++;
17169
17169
  }
17170
17170
  var o = g === n;
17171
17171
  y = y || o;
@@ -17406,27 +17406,27 @@ function jt(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
17406
17406
  ), n = s.length);
17407
17407
  var l = g === n;
17408
17408
  if (O = O || l, !O) {
17409
- const b = n;
17409
+ const _ = n;
17410
17410
  ct(d, {
17411
17411
  instancePath: t + "/inner",
17412
17412
  parentData: e,
17413
17413
  parentDataProperty: "inner",
17414
17414
  rootData: a
17415
17415
  }) || (s = s === null ? ct.errors : s.concat(ct.errors), n = s.length);
17416
- var l = b === n;
17416
+ var l = _ === n;
17417
17417
  O = O || l;
17418
17418
  }
17419
17419
  if (O)
17420
17420
  n = y, s !== null && (y ? s.length = y : s = null);
17421
17421
  else {
17422
- const b = {
17422
+ const _ = {
17423
17423
  instancePath: t + "/inner",
17424
17424
  schemaPath: "#/properties/inner/anyOf",
17425
17425
  keyword: "anyOf",
17426
17426
  params: {},
17427
17427
  message: "must match a schema in anyOf"
17428
17428
  };
17429
- return s === null ? s = [b] : s.push(b), n++, jt.errors = s, !1;
17429
+ return s === null ? s = [_] : s.push(_), n++, jt.errors = s, !1;
17430
17430
  }
17431
17431
  var o = m === n;
17432
17432
  } else
@@ -17483,20 +17483,20 @@ function _e(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
17483
17483
  const L = n;
17484
17484
  for (const C in e)
17485
17485
  if (!(C === "resource" || C === "path")) {
17486
- const _ = {
17486
+ const b = {
17487
17487
  instancePath: t,
17488
17488
  schemaPath: "#/definitions/VFSReference/additionalProperties",
17489
17489
  keyword: "additionalProperties",
17490
17490
  params: { additionalProperty: C },
17491
17491
  message: "must NOT have additional properties"
17492
17492
  };
17493
- s === null ? s = [_] : s.push(_), n++;
17493
+ s === null ? s = [b] : s.push(b), n++;
17494
17494
  break;
17495
17495
  }
17496
17496
  if (L === n) {
17497
17497
  if (e.resource !== void 0) {
17498
17498
  let C = e.resource;
17499
- const _ = n;
17499
+ const b = n;
17500
17500
  if (typeof C != "string") {
17501
17501
  const F = {
17502
17502
  instancePath: t + "/resource",
@@ -17517,7 +17517,7 @@ function _e(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
17517
17517
  };
17518
17518
  s === null ? s = [F] : s.push(F), n++;
17519
17519
  }
17520
- var d = _ === n;
17520
+ var d = b === n;
17521
17521
  } else
17522
17522
  var d = !0;
17523
17523
  if (d)
@@ -17553,14 +17553,14 @@ function _e(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
17553
17553
  const $ = n;
17554
17554
  if (n === n)
17555
17555
  if (e && typeof e == "object" && !Array.isArray(e)) {
17556
- let _;
17557
- if (e.resource === void 0 && (_ = "resource") || e.name === void 0 && (_ = "name") || e.contents === void 0 && (_ = "contents")) {
17556
+ let b;
17557
+ if (e.resource === void 0 && (b = "resource") || e.name === void 0 && (b = "name") || e.contents === void 0 && (b = "contents")) {
17558
17558
  const F = {
17559
17559
  instancePath: t,
17560
17560
  schemaPath: "#/definitions/LiteralReference/required",
17561
17561
  keyword: "required",
17562
- params: { missingProperty: _ },
17563
- message: "must have required property '" + _ + "'"
17562
+ params: { missingProperty: b },
17563
+ message: "must have required property '" + b + "'"
17564
17564
  };
17565
17565
  s === null ? s = [F] : s.push(F), n++;
17566
17566
  } else {
@@ -17909,18 +17909,18 @@ function _e(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
17909
17909
  }
17910
17910
  }
17911
17911
  } else {
17912
- const _ = {
17912
+ const b = {
17913
17913
  instancePath: t,
17914
17914
  schemaPath: "#/definitions/LiteralReference/type",
17915
17915
  keyword: "type",
17916
17916
  params: { type: "object" },
17917
17917
  message: "must be object"
17918
17918
  };
17919
- s === null ? s = [_] : s.push(_), n++;
17919
+ s === null ? s = [b] : s.push(b), n++;
17920
17920
  }
17921
17921
  var m = $ === n;
17922
17922
  if (l = l || m, !l) {
17923
- const _ = n;
17923
+ const b = n;
17924
17924
  if (n === n)
17925
17925
  if (e && typeof e == "object" && !Array.isArray(e)) {
17926
17926
  let S;
@@ -17973,10 +17973,10 @@ function _e(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
17973
17973
  };
17974
17974
  s === null ? s = [V] : s.push(V), n++;
17975
17975
  }
17976
- var b = D === n;
17976
+ var _ = D === n;
17977
17977
  } else
17978
- var b = !0;
17979
- if (b)
17978
+ var _ = !0;
17979
+ if (_)
17980
17980
  if (e.slug !== void 0) {
17981
17981
  const R = n;
17982
17982
  if (typeof e.slug != "string") {
@@ -17989,9 +17989,9 @@ function _e(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
17989
17989
  };
17990
17990
  s === null ? s = [V] : s.push(V), n++;
17991
17991
  }
17992
- var b = R === n;
17992
+ var _ = R === n;
17993
17993
  } else
17994
- var b = !0;
17994
+ var _ = !0;
17995
17995
  }
17996
17996
  }
17997
17997
  } else {
@@ -18004,7 +18004,7 @@ function _e(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
18004
18004
  };
18005
18005
  s === null ? s = [S] : s.push(S), n++;
18006
18006
  }
18007
- var m = _ === n;
18007
+ var m = b === n;
18008
18008
  if (l = l || m, !l) {
18009
18009
  const S = n;
18010
18010
  if (n === n)
@@ -19044,15 +19044,15 @@ function vt(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
19044
19044
  let s = null, n = 0;
19045
19045
  if (n === 0)
19046
19046
  if (e && typeof e == "object" && !Array.isArray(e)) {
19047
- let b;
19048
- if (e.url === void 0 && (b = "url"))
19047
+ let _;
19048
+ if (e.url === void 0 && (_ = "url"))
19049
19049
  return vt.errors = [
19050
19050
  {
19051
19051
  instancePath: t,
19052
19052
  schemaPath: "#/required",
19053
19053
  keyword: "required",
19054
- params: { missingProperty: b },
19055
- message: "must have required property '" + b + "'"
19054
+ params: { missingProperty: _ },
19055
+ message: "must have required property '" + _ + "'"
19056
19056
  }
19057
19057
  ], !1;
19058
19058
  {
@@ -19118,7 +19118,7 @@ function vt(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
19118
19118
  if (n === n)
19119
19119
  if (E && typeof E == "object" && !Array.isArray(E))
19120
19120
  for (const C in E) {
19121
- const _ = n;
19121
+ const b = n;
19122
19122
  if (typeof E[C] != "string")
19123
19123
  return vt.errors = [
19124
19124
  {
@@ -19137,7 +19137,7 @@ function vt(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
19137
19137
  message: "must be string"
19138
19138
  }
19139
19139
  ], !1;
19140
- var l = _ === n;
19140
+ var l = b === n;
19141
19141
  if (!l)
19142
19142
  break;
19143
19143
  }
@@ -20290,7 +20290,7 @@ function We(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
20290
20290
  if (o) {
20291
20291
  if (e.body !== void 0) {
20292
20292
  let g = e.body;
20293
- const w = n, b = n;
20293
+ const w = n, _ = n;
20294
20294
  let T = !1;
20295
20295
  const E = n;
20296
20296
  if (typeof g != "string") {
@@ -20310,7 +20310,7 @@ function We(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
20310
20310
  if (g && typeof g == "object" && !Array.isArray(g)) {
20311
20311
  let C;
20312
20312
  if (g.BYTES_PER_ELEMENT === void 0 && (C = "BYTES_PER_ELEMENT") || g.buffer === void 0 && (C = "buffer") || g.byteLength === void 0 && (C = "byteLength") || g.byteOffset === void 0 && (C = "byteOffset") || g.length === void 0 && (C = "length")) {
20313
- const _ = {
20313
+ const b = {
20314
20314
  instancePath: t + "/body",
20315
20315
  schemaPath: "#/properties/body/anyOf/1/required",
20316
20316
  keyword: "required",
@@ -20319,9 +20319,9 @@ function We(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
20319
20319
  },
20320
20320
  message: "must have required property '" + C + "'"
20321
20321
  };
20322
- s === null ? s = [_] : s.push(_), n++;
20322
+ s === null ? s = [b] : s.push(b), n++;
20323
20323
  } else {
20324
- const _ = n;
20324
+ const b = n;
20325
20325
  for (const F in g)
20326
20326
  if (!(F === "BYTES_PER_ELEMENT" || F === "buffer" || F === "byteLength" || F === "byteOffset" || F === "length")) {
20327
20327
  let P = g[F];
@@ -20354,7 +20354,7 @@ function We(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
20354
20354
  if (!c)
20355
20355
  break;
20356
20356
  }
20357
- if (_ === n) {
20357
+ if (b === n) {
20358
20358
  if (g.BYTES_PER_ELEMENT !== void 0) {
20359
20359
  let F = g.BYTES_PER_ELEMENT;
20360
20360
  const P = n;
@@ -20560,7 +20560,7 @@ function We(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
20560
20560
  T = T || p;
20561
20561
  }
20562
20562
  if (T)
20563
- n = b, s !== null && (b ? s.length = b : s = null);
20563
+ n = _, s !== null && (_ ? s.length = _ : s = null);
20564
20564
  else {
20565
20565
  const $ = {
20566
20566
  instancePath: t + "/body",
@@ -21721,10 +21721,10 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
21721
21721
  message: "must be number"
21722
21722
  }
21723
21723
  ], !1;
21724
- var b = ne === n;
21724
+ var _ = ne === n;
21725
21725
  } else
21726
- var b = !0;
21727
- if (b)
21726
+ var _ = !0;
21727
+ if (_)
21728
21728
  if (f.caption !== void 0) {
21729
21729
  const k = n;
21730
21730
  if (typeof f.caption != "string")
@@ -21739,9 +21739,9 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
21739
21739
  message: "must be string"
21740
21740
  }
21741
21741
  ], !1;
21742
- var b = k === n;
21742
+ var _ = k === n;
21743
21743
  } else
21744
- var b = !0;
21744
+ var _ = !0;
21745
21745
  }
21746
21746
  } else
21747
21747
  return v.errors = [
@@ -22287,10 +22287,10 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
22287
22287
  message: "must be object"
22288
22288
  }
22289
22289
  ], !1;
22290
- var _ = N === n;
22290
+ var b = N === n;
22291
22291
  } else
22292
- var _ = !0;
22293
- if (_) {
22292
+ var b = !0;
22293
+ if (b) {
22294
22294
  if (e.step !== void 0) {
22295
22295
  let f = e.step;
22296
22296
  const N = n;
@@ -22318,10 +22318,10 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
22318
22318
  message: "must be equal to constant"
22319
22319
  }
22320
22320
  ], !1;
22321
- var _ = N === n;
22321
+ var b = N === n;
22322
22322
  } else
22323
- var _ = !0;
22324
- if (_) {
22323
+ var b = !0;
22324
+ if (b) {
22325
22325
  if (e.wordPressFilesZip !== void 0) {
22326
22326
  const f = n;
22327
22327
  _e(
@@ -22335,10 +22335,10 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
22335
22335
  ) || (s = s === null ? _e.errors : s.concat(
22336
22336
  _e.errors
22337
22337
  ), n = s.length);
22338
- var _ = f === n;
22338
+ var b = f === n;
22339
22339
  } else
22340
- var _ = !0;
22341
- if (_)
22340
+ var b = !0;
22341
+ if (b)
22342
22342
  if (e.pathInZip !== void 0) {
22343
22343
  const f = n;
22344
22344
  if (typeof e.pathInZip != "string")
@@ -22353,9 +22353,9 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
22353
22353
  message: "must be string"
22354
22354
  }
22355
22355
  ], !1;
22356
- var _ = f === n;
22356
+ var b = f === n;
22357
22357
  } else
22358
- var _ = !0;
22358
+ var b = !0;
22359
22359
  }
22360
22360
  }
22361
22361
  }
@@ -26797,20 +26797,20 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
26797
26797
  if (n === 0)
26798
26798
  if (e && typeof e == "object" && !Array.isArray(e)) {
26799
26799
  const C = n;
26800
- for (const _ in e)
26801
- if (!yd.call(ov.properties, _))
26800
+ for (const b in e)
26801
+ if (!yd.call(ov.properties, b))
26802
26802
  return me.errors = [
26803
26803
  {
26804
26804
  instancePath: t,
26805
26805
  schemaPath: "#/additionalProperties",
26806
26806
  keyword: "additionalProperties",
26807
- params: { additionalProperty: _ },
26807
+ params: { additionalProperty: b },
26808
26808
  message: "must NOT have additional properties"
26809
26809
  }
26810
26810
  ], !1;
26811
26811
  if (C === n) {
26812
26812
  if (e.landingPage !== void 0) {
26813
- const _ = n;
26813
+ const b = n;
26814
26814
  if (typeof e.landingPage != "string")
26815
26815
  return me.errors = [
26816
26816
  {
@@ -26821,12 +26821,12 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
26821
26821
  message: "must be string"
26822
26822
  }
26823
26823
  ], !1;
26824
- var o = _ === n;
26824
+ var o = b === n;
26825
26825
  } else
26826
26826
  var o = !0;
26827
26827
  if (o) {
26828
26828
  if (e.description !== void 0) {
26829
- const _ = n;
26829
+ const b = n;
26830
26830
  if (typeof e.description != "string")
26831
26831
  return me.errors = [
26832
26832
  {
@@ -26837,17 +26837,17 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
26837
26837
  message: "must be string"
26838
26838
  }
26839
26839
  ], !1;
26840
- var o = _ === n;
26840
+ var o = b === n;
26841
26841
  } else
26842
26842
  var o = !0;
26843
26843
  if (o) {
26844
26844
  if (e.meta !== void 0) {
26845
- let _ = e.meta;
26845
+ let b = e.meta;
26846
26846
  const F = n;
26847
26847
  if (n === F)
26848
- if (_ && typeof _ == "object" && !Array.isArray(_)) {
26848
+ if (b && typeof b == "object" && !Array.isArray(b)) {
26849
26849
  let S;
26850
- if (_.title === void 0 && (S = "title") || _.author === void 0 && (S = "author"))
26850
+ if (b.title === void 0 && (S = "title") || b.author === void 0 && (S = "author"))
26851
26851
  return me.errors = [
26852
26852
  {
26853
26853
  instancePath: t + "/meta",
@@ -26861,7 +26861,7 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
26861
26861
  ], !1;
26862
26862
  {
26863
26863
  const j = n;
26864
- for (const R in _)
26864
+ for (const R in b)
26865
26865
  if (!(R === "title" || R === "description" || R === "author" || R === "categories"))
26866
26866
  return me.errors = [
26867
26867
  {
@@ -26875,9 +26875,9 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
26875
26875
  }
26876
26876
  ], !1;
26877
26877
  if (j === n) {
26878
- if (_.title !== void 0) {
26878
+ if (b.title !== void 0) {
26879
26879
  const R = n;
26880
- if (typeof _.title != "string")
26880
+ if (typeof b.title != "string")
26881
26881
  return me.errors = [
26882
26882
  {
26883
26883
  instancePath: t + "/meta/title",
@@ -26893,9 +26893,9 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
26893
26893
  } else
26894
26894
  var l = !0;
26895
26895
  if (l) {
26896
- if (_.description !== void 0) {
26896
+ if (b.description !== void 0) {
26897
26897
  const R = n;
26898
- if (typeof _.description != "string")
26898
+ if (typeof b.description != "string")
26899
26899
  return me.errors = [
26900
26900
  {
26901
26901
  instancePath: t + "/meta/description",
@@ -26911,9 +26911,9 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
26911
26911
  } else
26912
26912
  var l = !0;
26913
26913
  if (l) {
26914
- if (_.author !== void 0) {
26914
+ if (b.author !== void 0) {
26915
26915
  const R = n;
26916
- if (typeof _.author != "string")
26916
+ if (typeof b.author != "string")
26917
26917
  return me.errors = [
26918
26918
  {
26919
26919
  instancePath: t + "/meta/author",
@@ -26929,8 +26929,8 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
26929
26929
  } else
26930
26930
  var l = !0;
26931
26931
  if (l)
26932
- if (_.categories !== void 0) {
26933
- let R = _.categories;
26932
+ if (b.categories !== void 0) {
26933
+ let R = b.categories;
26934
26934
  const D = n;
26935
26935
  if (n === D)
26936
26936
  if (Array.isArray(
@@ -26990,12 +26990,12 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
26990
26990
  var o = !0;
26991
26991
  if (o) {
26992
26992
  if (e.preferredVersions !== void 0) {
26993
- let _ = e.preferredVersions;
26993
+ let b = e.preferredVersions;
26994
26994
  const F = n;
26995
26995
  if (n === F)
26996
- if (_ && typeof _ == "object" && !Array.isArray(_)) {
26996
+ if (b && typeof b == "object" && !Array.isArray(b)) {
26997
26997
  let S;
26998
- if (_.php === void 0 && (S = "php") || _.wp === void 0 && (S = "wp"))
26998
+ if (b.php === void 0 && (S = "php") || b.wp === void 0 && (S = "wp"))
26999
26999
  return me.errors = [
27000
27000
  {
27001
27001
  instancePath: t + "/preferredVersions",
@@ -27009,7 +27009,7 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
27009
27009
  ], !1;
27010
27010
  {
27011
27011
  const j = n;
27012
- for (const R in _)
27012
+ for (const R in b)
27013
27013
  if (!(R === "php" || R === "wp"))
27014
27014
  return me.errors = [
27015
27015
  {
@@ -27023,14 +27023,14 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
27023
27023
  }
27024
27024
  ], !1;
27025
27025
  if (j === n) {
27026
- if (_.php !== void 0) {
27027
- let R = _.php;
27026
+ if (b.php !== void 0) {
27027
+ let R = b.php;
27028
27028
  const D = n, V = n;
27029
27029
  let B = !1;
27030
27030
  const Y = n;
27031
27031
  Nn(R, {
27032
27032
  instancePath: t + "/preferredVersions/php",
27033
- parentData: _,
27033
+ parentData: b,
27034
27034
  parentDataProperty: "php",
27035
27035
  rootData: a
27036
27036
  }) || (s = s === null ? Nn.errors : s.concat(
@@ -27090,8 +27090,8 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
27090
27090
  } else
27091
27091
  var d = !0;
27092
27092
  if (d)
27093
- if (_.wp !== void 0) {
27094
- let R = _.wp;
27093
+ if (b.wp !== void 0) {
27094
+ let R = b.wp;
27095
27095
  const D = n, V = n;
27096
27096
  let B = !1;
27097
27097
  const Y = n;
@@ -27221,12 +27221,12 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
27221
27221
  var o = !0;
27222
27222
  if (o) {
27223
27223
  if (e.features !== void 0) {
27224
- let _ = e.features;
27224
+ let b = e.features;
27225
27225
  const F = n;
27226
27226
  if (n === F)
27227
- if (_ && typeof _ == "object" && !Array.isArray(_)) {
27227
+ if (b && typeof b == "object" && !Array.isArray(b)) {
27228
27228
  const S = n;
27229
- for (const j in _)
27229
+ for (const j in b)
27230
27230
  if (!(j === "intl" || j === "networking"))
27231
27231
  return me.errors = [
27232
27232
  {
@@ -27240,9 +27240,9 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
27240
27240
  }
27241
27241
  ], !1;
27242
27242
  if (S === n) {
27243
- if (_.intl !== void 0) {
27243
+ if (b.intl !== void 0) {
27244
27244
  const j = n;
27245
- if (typeof _.intl != "boolean")
27245
+ if (typeof b.intl != "boolean")
27246
27246
  return me.errors = [
27247
27247
  {
27248
27248
  instancePath: t + "/features/intl",
@@ -27258,9 +27258,9 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
27258
27258
  } else
27259
27259
  var y = !0;
27260
27260
  if (y)
27261
- if (_.networking !== void 0) {
27261
+ if (b.networking !== void 0) {
27262
27262
  const j = n;
27263
- if (typeof _.networking != "boolean")
27263
+ if (typeof b.networking != "boolean")
27264
27264
  return me.errors = [
27265
27265
  {
27266
27266
  instancePath: t + "/features/networking",
@@ -27291,14 +27291,14 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
27291
27291
  var o = !0;
27292
27292
  if (o) {
27293
27293
  if (e.extraLibraries !== void 0) {
27294
- let _ = e.extraLibraries;
27294
+ let b = e.extraLibraries;
27295
27295
  const F = n;
27296
27296
  if (n === F)
27297
- if (Array.isArray(_)) {
27297
+ if (Array.isArray(b)) {
27298
27298
  var O = !0;
27299
- const S = _.length;
27299
+ const S = b.length;
27300
27300
  for (let j = 0; j < S; j++) {
27301
- let R = _[j];
27301
+ let R = b[j];
27302
27302
  const D = n;
27303
27303
  if (typeof R != "string")
27304
27304
  return me.errors = [
@@ -27345,12 +27345,12 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
27345
27345
  var o = !0;
27346
27346
  if (o) {
27347
27347
  if (e.constants !== void 0) {
27348
- let _ = e.constants;
27348
+ let b = e.constants;
27349
27349
  const F = n;
27350
27350
  if (n === n)
27351
- if (_ && typeof _ == "object" && !Array.isArray(_))
27352
- for (const j in _) {
27353
- let R = _[j];
27351
+ if (b && typeof b == "object" && !Array.isArray(b))
27352
+ for (const j in b) {
27353
+ let R = b[j];
27354
27354
  const D = n;
27355
27355
  if (typeof R != "string" && typeof R != "boolean" && !(typeof R == "number" && isFinite(R)))
27356
27356
  return me.errors = [
@@ -27391,14 +27391,14 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
27391
27391
  var o = !0;
27392
27392
  if (o) {
27393
27393
  if (e.plugins !== void 0) {
27394
- let _ = e.plugins;
27394
+ let b = e.plugins;
27395
27395
  const F = n;
27396
27396
  if (n === F)
27397
- if (Array.isArray(_)) {
27397
+ if (Array.isArray(b)) {
27398
27398
  var w = !0;
27399
- const S = _.length;
27399
+ const S = b.length;
27400
27400
  for (let j = 0; j < S; j++) {
27401
- let R = _[j];
27401
+ let R = b[j];
27402
27402
  const D = n, V = n;
27403
27403
  let B = !1;
27404
27404
  const Y = n;
@@ -27418,22 +27418,22 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
27418
27418
  te
27419
27419
  ), n++;
27420
27420
  }
27421
- var b = Y === n;
27422
- if (B = B || b, !B) {
27421
+ var _ = Y === n;
27422
+ if (B = B || _, !B) {
27423
27423
  const te = n;
27424
27424
  _e(
27425
27425
  R,
27426
27426
  {
27427
27427
  instancePath: t + "/plugins/" + j,
27428
- parentData: _,
27428
+ parentData: b,
27429
27429
  parentDataProperty: j,
27430
27430
  rootData: a
27431
27431
  }
27432
27432
  ) || (s = s === null ? _e.errors : s.concat(
27433
27433
  _e.errors
27434
27434
  ), n = s.length);
27435
- var b = te === n;
27436
- B = B || b;
27435
+ var _ = te === n;
27436
+ B = B || _;
27437
27437
  }
27438
27438
  if (B)
27439
27439
  n = V, s !== null && (V ? s.length = V : s = null);
@@ -27472,17 +27472,17 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
27472
27472
  var o = !0;
27473
27473
  if (o) {
27474
27474
  if (e.siteOptions !== void 0) {
27475
- let _ = e.siteOptions;
27475
+ let b = e.siteOptions;
27476
27476
  const F = n;
27477
27477
  if (n === F)
27478
- if (_ && typeof _ == "object" && !Array.isArray(
27479
- _
27478
+ if (b && typeof b == "object" && !Array.isArray(
27479
+ b
27480
27480
  )) {
27481
27481
  const S = n;
27482
- for (const j in _)
27482
+ for (const j in b)
27483
27483
  if (j !== "blogname") {
27484
27484
  const R = n;
27485
- if (typeof _[j] != "string")
27485
+ if (typeof b[j] != "string")
27486
27486
  return me.errors = [
27487
27487
  {
27488
27488
  instancePath: t + "/siteOptions/" + j.replace(
@@ -27504,7 +27504,7 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
27504
27504
  if (!T)
27505
27505
  break;
27506
27506
  }
27507
- if (S === n && _.blogname !== void 0 && typeof _.blogname != "string")
27507
+ if (S === n && b.blogname !== void 0 && typeof b.blogname != "string")
27508
27508
  return me.errors = [
27509
27509
  {
27510
27510
  instancePath: t + "/siteOptions/blogname",
@@ -27533,11 +27533,11 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
27533
27533
  var o = !0;
27534
27534
  if (o) {
27535
27535
  if (e.login !== void 0) {
27536
- let _ = e.login;
27536
+ let b = e.login;
27537
27537
  const F = n, P = n;
27538
27538
  let S = !1;
27539
27539
  const j = n;
27540
- if (typeof _ != "boolean") {
27540
+ if (typeof b != "boolean") {
27541
27541
  const D = {
27542
27542
  instancePath: t + "/login",
27543
27543
  schemaPath: "#/properties/login/anyOf/0/type",
@@ -27557,11 +27557,11 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
27557
27557
  if (S = S || E, !S) {
27558
27558
  const D = n;
27559
27559
  if (n === D)
27560
- if (_ && typeof _ == "object" && !Array.isArray(
27561
- _
27560
+ if (b && typeof b == "object" && !Array.isArray(
27561
+ b
27562
27562
  )) {
27563
27563
  let B;
27564
- if (_.username === void 0 && (B = "username") || _.password === void 0 && (B = "password")) {
27564
+ if (b.username === void 0 && (B = "username") || b.password === void 0 && (B = "password")) {
27565
27565
  const Y = {
27566
27566
  instancePath: t + "/login",
27567
27567
  schemaPath: "#/properties/login/anyOf/1/required",
@@ -27578,7 +27578,7 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
27578
27578
  ), n++;
27579
27579
  } else {
27580
27580
  const Y = n;
27581
- for (const G in _)
27581
+ for (const G in b)
27582
27582
  if (!(G === "username" || G === "password")) {
27583
27583
  const te = {
27584
27584
  instancePath: t + "/login",
@@ -27597,9 +27597,9 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
27597
27597
  break;
27598
27598
  }
27599
27599
  if (Y === n) {
27600
- if (_.username !== void 0) {
27600
+ if (b.username !== void 0) {
27601
27601
  const G = n;
27602
- if (typeof _.username != "string") {
27602
+ if (typeof b.username != "string") {
27603
27603
  const te = {
27604
27604
  instancePath: t + "/login/username",
27605
27605
  schemaPath: "#/properties/login/anyOf/1/properties/username/type",
@@ -27619,9 +27619,9 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
27619
27619
  } else
27620
27620
  var I = !0;
27621
27621
  if (I)
27622
- if (_.password !== void 0) {
27622
+ if (b.password !== void 0) {
27623
27623
  const G = n;
27624
- if (typeof _.password != "string") {
27624
+ if (typeof b.password != "string") {
27625
27625
  const z = {
27626
27626
  instancePath: t + "/login/password",
27627
27627
  schemaPath: "#/properties/login/anyOf/1/properties/password/type",
@@ -27682,16 +27682,16 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
27682
27682
  var o = !0;
27683
27683
  if (o) {
27684
27684
  if (e.steps !== void 0) {
27685
- let _ = e.steps;
27685
+ let b = e.steps;
27686
27686
  const F = n;
27687
27687
  if (n === F)
27688
27688
  if (Array.isArray(
27689
- _
27689
+ b
27690
27690
  )) {
27691
27691
  var $ = !0;
27692
- const S = _.length;
27692
+ const S = b.length;
27693
27693
  for (let j = 0; j < S; j++) {
27694
- let R = _[j];
27694
+ let R = b[j];
27695
27695
  const D = n, V = n;
27696
27696
  let B = !1;
27697
27697
  const Y = n;
@@ -27699,7 +27699,7 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
27699
27699
  R,
27700
27700
  {
27701
27701
  instancePath: t + "/steps/" + j,
27702
- parentData: _,
27702
+ parentData: b,
27703
27703
  parentDataProperty: j,
27704
27704
  rootData: a
27705
27705
  }
@@ -27836,7 +27836,7 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
27836
27836
  var o = !0;
27837
27837
  if (o)
27838
27838
  if (e.$schema !== void 0) {
27839
- const _ = n;
27839
+ const b = n;
27840
27840
  if (typeof e.$schema != "string")
27841
27841
  return me.errors = [
27842
27842
  {
@@ -27849,7 +27849,7 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
27849
27849
  message: "must be string"
27850
27850
  }
27851
27851
  ], !1;
27852
- var o = _ === n;
27852
+ var o = b === n;
27853
27853
  } else
27854
27854
  var o = !0;
27855
27855
  }
@@ -27931,7 +27931,7 @@ function wv(e, {
27931
27931
  gitAdditionalHeadersCallback: o,
27932
27932
  additionalSteps: l
27933
27933
  } = {}) {
27934
- var g, w, b, T, E, I, $, L, C, _, F;
27934
+ var g, w, _, T, E, I, $, L, C, b, F;
27935
27935
  e = structuredClone(e), e = {
27936
27936
  ...e,
27937
27937
  steps: (e.steps || []).filter(xv).filter(kv)
@@ -27977,7 +27977,7 @@ function wv(e, {
27977
27977
  const p = ((w = e.steps) == null ? void 0 : w.findIndex(
27978
27978
  (P) => typeof P == "object" && (P == null ? void 0 : P.step) && ["wp-cli", "enableMultisite"].includes(P.step)
27979
27979
  )) ?? -1;
27980
- if ((b = e == null ? void 0 : e.extraLibraries) != null && b.includes("wp-cli") || p !== -1) {
27980
+ if ((_ = e == null ? void 0 : e.extraLibraries) != null && _.includes("wp-cli") || p !== -1) {
27981
27981
  const P = {
27982
27982
  step: "writeFile",
27983
27983
  data: j_,
@@ -28041,7 +28041,7 @@ Please review your Blueprint and fix these issues. Learn more about the Blueprin
28041
28041
  },
28042
28042
  features: {
28043
28043
  // Disable intl by default to reduce the transfer size
28044
- intl: ((_ = e.features) == null ? void 0 : _.intl) ?? !1,
28044
+ intl: ((b = e.features) == null ? void 0 : b.intl) ?? !1,
28045
28045
  // Enable network access by default
28046
28046
  networking: ((F = e.features) == null ? void 0 : F.networking) ?? !0
28047
28047
  },
@@ -28527,7 +28527,7 @@ class Bv {
28527
28527
  this.options = t;
28528
28528
  }
28529
28529
  async bootPlayground(t, r) {
28530
- var F;
28530
+ var S;
28531
28531
  const {
28532
28532
  onBlueprintValidated: i,
28533
28533
  onBlueprintStepCompleted: a,
@@ -28537,48 +28537,54 @@ class Bv {
28537
28537
  sapiName: l,
28538
28538
  scope: p,
28539
28539
  shouldInstallWordPress: c,
28540
- sqliteDriverVersion: d,
28541
- wordpressInstallMode: m,
28542
- onClientConnected: y,
28543
- pathAliases: O
28544
- } = this.options, g = r.stage(0.5), w = r.stage(), b = this.options.blueprint || {}, T = Kp(
28540
+ shouldBootWordPress: d,
28541
+ sqliteDriverVersion: m,
28542
+ wordpressInstallMode: y,
28543
+ onClientConnected: O,
28544
+ pathAliases: g
28545
+ } = this.options, w = r.stage(0.5), _ = r.stage(), T = this.options.blueprint || {}, E = Kp(
28545
28546
  t.contentWindow,
28546
28547
  t.ownerDocument.defaultView
28547
28548
  );
28548
- await T.isConnected(), r.pipe(T);
28549
- const E = await jv(b);
28550
- await T.onDownloadProgress(w.loadingListener);
28551
- const I = !Vo(b) && ((F = b.preferredVersions) == null ? void 0 : F.wp) === !1;
28552
- if (c === !0 && I)
28549
+ await E.isConnected(), r.pipe(E);
28550
+ const I = await jv(T);
28551
+ await E.onDownloadProgress(_.loadingListener);
28552
+ const $ = !Vo(T) && ((S = T.preferredVersions) == null ? void 0 : S.wp) === !1;
28553
+ if ((c === !0 || d === !0) && $)
28554
+ throw new Error(
28555
+ "Conflicting options: WordPress install or boot was requested, but the Blueprint sets `preferredVersions.wp: false`. Pick one."
28556
+ );
28557
+ const L = d ?? !$, C = c ?? L;
28558
+ if (C && !L)
28553
28559
  throw new Error(
28554
- "Conflicting options: `shouldInstallWordPress: true` was passed to startPlaygroundWeb, but the Blueprint sets `preferredVersions.wp: false`. Pick one."
28560
+ "Conflicting options: WordPress installation was requested, but WordPress boot was disabled. Pick one."
28555
28561
  );
28556
- const $ = c ?? !I;
28557
- if (await T.boot({
28562
+ if (await E.boot({
28558
28563
  mounts: o,
28559
28564
  sapiName: l,
28560
28565
  scope: p ?? Math.random().toFixed(16),
28561
- shouldInstallWordPress: $,
28562
- wordpressInstallMode: m,
28563
- phpVersion: E.phpVersion,
28564
- wpVersion: E.wpVersion,
28565
- extensions: E.intl ? ["intl"] : [],
28566
- withNetworking: E.networking,
28566
+ shouldInstallWordPress: C,
28567
+ shouldBootWordPress: L,
28568
+ wordpressInstallMode: y,
28569
+ phpVersion: I.phpVersion,
28570
+ wpVersion: I.wpVersion,
28571
+ extensions: I.intl ? ["intl"] : [],
28572
+ withNetworking: I.networking,
28567
28573
  corsProxyUrl: s,
28568
- sqliteDriverVersion: d,
28569
- pathAliases: O
28570
- }), await T.isReady(), w.finish(), Cp(Oe, T), y == null || y(T), (await Dn.create(b)).getVersion() === 1) {
28571
- const P = await bd(b, {
28572
- progress: g,
28574
+ sqliteDriverVersion: m,
28575
+ pathAliases: g
28576
+ }), await E.isReady(), _.finish(), Cp(Oe, E), O == null || O(E), (await Dn.create(T)).getVersion() === 1) {
28577
+ const j = await bd(T, {
28578
+ progress: w,
28573
28579
  onStepCompleted: a,
28574
28580
  onBlueprintValidated: i,
28575
28581
  corsProxy: s,
28576
28582
  gitAdditionalHeadersCallback: n
28577
28583
  });
28578
- await Sv(P, T);
28584
+ await Sv(j, E);
28579
28585
  }
28580
- const C = parseFloat(E.wpVersion), _ = Number.isFinite(C) && C < 5.1;
28581
- return E.networking && !_ && $ && await T.prefetchUpdateChecks(), T;
28586
+ const F = parseFloat(I.wpVersion), P = Number.isFinite(F) && F < 5.1;
28587
+ return I.networking && !P && C && await E.prefetchUpdateChecks(), E;
28582
28588
  }
28583
28589
  }
28584
28590
  class qv {