@wp-playground/client 3.1.33 → 3.1.34

package/index.js

@@ -2551,36 +2551,36 @@ var tc = {};
   })(function(t) {
     t.version = "1.2.2";
     function r() {
-      for (var b = 0, F = new Array(256), P = 0; P != 256; ++P)
-        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;
+      for (var b = 0, F = new Array(256), k = 0; k != 256; ++k)
+        b = k, 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[k] = b;
       return typeof Int32Array < "u" ? new Int32Array(F) : F;
     }
     var i = r();
     function a(b) {
-      var F = 0, P = 0, S = 0, j = typeof Int32Array < "u" ? new Int32Array(4096) : new Array(4096);
+      var F = 0, k = 0, S = 0, j = typeof Int32Array < "u" ? new Int32Array(4096) : new Array(4096);
       for (S = 0; S != 256; ++S) j[S] = b[S];
       for (S = 0; S != 256; ++S)
-        for (P = b[S], F = 256 + S; F < 4096; F += 256) P = j[F] = P >>> 8 ^ b[P & 255];
+        for (k = b[S], F = 256 + S; F < 4096; F += 256) k = j[F] = k >>> 8 ^ b[k & 255];
       var R = [];
       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);
       return R;
     }
-    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];
+    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], L = s[14];
     function $(b, F) {
-      for (var P = F ^ -1, S = 0, j = b.length; S < j; ) P = P >>> 8 ^ i[(P ^ b.charCodeAt(S++)) & 255];
-      return ~P;
+      for (var k = F ^ -1, S = 0, j = b.length; S < j; ) k = k >>> 8 ^ i[(k ^ b.charCodeAt(S++)) & 255];
+      return ~k;
     }
-    function L(b, F) {
-      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++]];
-      for (S += 15; j < S; ) P = P >>> 8 ^ i[(P ^ b[j++]) & 255];
-      return ~P;
+    function I(b, F) {
+      for (var k = F ^ -1, S = b.length - 15, j = 0; j < S; ) k = L[b[j++] ^ k & 255] ^ E[b[j++] ^ k >> 8 & 255] ^ T[b[j++] ^ k >> 16 & 255] ^ _[b[j++] ^ k >>> 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++]];
+      for (S += 15; j < S; ) k = k >>> 8 ^ i[(k ^ b[j++]) & 255];
+      return ~k;
     }
     function C(b, F) {
-      for (var P = F ^ -1, S = 0, j = b.length, R = 0, D = 0; S < j; )
-        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]);
-      return ~P;
+      for (var k = F ^ -1, S = 0, j = b.length, R = 0, D = 0; S < j; )
+        R = b.charCodeAt(S++), R < 128 ? k = k >>> 8 ^ i[(k ^ R) & 255] : R < 2048 ? (k = k >>> 8 ^ i[(k ^ (192 | R >> 6 & 31)) & 255], k = k >>> 8 ^ i[(k ^ (128 | R & 63)) & 255]) : R >= 55296 && R < 57344 ? (R = (R & 1023) + 64, D = b.charCodeAt(S++) & 1023, k = k >>> 8 ^ i[(k ^ (240 | R >> 8 & 7)) & 255], k = k >>> 8 ^ i[(k ^ (128 | R >> 2 & 63)) & 255], k = k >>> 8 ^ i[(k ^ (128 | D >> 6 & 15 | (R & 3) << 4)) & 255], k = k >>> 8 ^ i[(k ^ (128 | D & 63)) & 255]) : (k = k >>> 8 ^ i[(k ^ (224 | R >> 12 & 15)) & 255], k = k >>> 8 ^ i[(k ^ (128 | R >> 6 & 63)) & 255], k = k >>> 8 ^ i[(k ^ (128 | R & 63)) & 255]);
+      return ~k;
     }
-    t.table = i, t.bstr = $, t.buf = L, t.str = C;
+    t.table = i, t.bstr = $, t.buf = I, t.str = C;
   });
 })(tc);
 const zh = /* @__PURE__ */ co(tc);
@@ -3492,21 +3492,21 @@ ss.deflate = Eo;
 ss.deflateRaw = ny;
 ss.gzip = sy;
 var os = {}, Ut = {}, _s = 30, iy = 12, ay = function(t, r) {
-  var i, a, s, n, o, l, p, c, d, m, y, O, g, w, _, T, E, I, $, L, C, b, F, P, S;
-  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;
+  var i, a, s, n, o, l, p, c, d, m, y, O, g, w, _, T, E, L, $, I, C, b, F, k, S;
+  i = t.state, a = t.next_in, k = 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;
   e:
     do {
-      g < 15 && (O += P[a++] << g, g += 8, O += P[a++] << g, g += 8), I = w[O & T];
+      g < 15 && (O += k[a++] << g, g += 8, O += k[a++] << g, g += 8), L = w[O & T];
       t:
         for (; ; ) {
-          if ($ = I >>> 24, O >>>= $, g -= $, $ = I >>> 16 & 255, $ === 0)
-            S[n++] = I & 65535;
+          if ($ = L >>> 24, O >>>= $, g -= $, $ = L >>> 16 & 255, $ === 0)
+            S[n++] = L & 65535;
           else if ($ & 16) {
-            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];
+            I = L & 65535, $ &= 15, $ && (g < $ && (O += k[a++] << g, g += 8), I += O & (1 << $) - 1, O >>>= $, g -= $), g < 15 && (O += k[a++] << g, g += 8, O += k[a++] << g, g += 8), L = _[O & E];
             r:
               for (; ; ) {
-                if ($ = I >>> 24, O >>>= $, g -= $, $ = I >>> 16 & 255, $ & 16) {
-                  if (C = I & 65535, $ &= 15, g < $ && (O += P[a++] << g, g += 8, g < $ && (O += P[a++] << g, g += 8)), C += O & (1 << $) - 1, C > p) {
+                if ($ = L >>> 24, O >>>= $, g -= $, $ = L >>> 16 & 255, $ & 16) {
+                  if (C = L & 65535, $ &= 15, g < $ && (O += k[a++] << g, g += 8, g < $ && (O += k[a++] << g, g += 8)), C += O & (1 << $) - 1, C > p) {
                     t.msg = "invalid distance too far back", i.mode = _s;
                     break e;
                   }
@@ -3516,49 +3516,49 @@ var os = {}, Ut = {}, _s = 30, iy = 12, ay = function(t, r) {
                       break e;
                     }
                     if (b = 0, F = y, m === 0) {
-                      if (b += c - $, $ < L) {
-                        L -= $;
+                      if (b += c - $, $ < I) {
+                        I -= $;
                         do
                           S[n++] = y[b++];
                         while (--$);
                         b = n - C, F = S;
                       }
                     } else if (m < $) {
-                      if (b += c + m - $, $ -= m, $ < L) {
-                        L -= $;
+                      if (b += c + m - $, $ -= m, $ < I) {
+                        I -= $;
                         do
                           S[n++] = y[b++];
                         while (--$);
-                        if (b = 0, m < L) {
-                          $ = m, L -= $;
+                        if (b = 0, m < I) {
+                          $ = m, I -= $;
                           do
                             S[n++] = y[b++];
                           while (--$);
                           b = n - C, F = S;
                         }
                       }
-                    } else if (b += m - $, $ < L) {
-                      L -= $;
+                    } else if (b += m - $, $ < I) {
+                      I -= $;
                       do
                         S[n++] = y[b++];
                       while (--$);
                       b = n - C, F = S;
                     }
-                    for (; L > 2; )
-                      S[n++] = F[b++], S[n++] = F[b++], S[n++] = F[b++], L -= 3;
-                    L && (S[n++] = F[b++], L > 1 && (S[n++] = F[b++]));
+                    for (; I > 2; )
+                      S[n++] = F[b++], S[n++] = F[b++], S[n++] = F[b++], I -= 3;
+                    I && (S[n++] = F[b++], I > 1 && (S[n++] = F[b++]));
                   } else {
                     b = n - C;
                     do
-                      S[n++] = S[b++], S[n++] = S[b++], S[n++] = S[b++], L -= 3;
-                    while (L > 2);
-                    L && (S[n++] = S[b++], L > 1 && (S[n++] = S[b++]));
+                      S[n++] = S[b++], S[n++] = S[b++], S[n++] = S[b++], I -= 3;
+                    while (I > 2);
+                    I && (S[n++] = S[b++], I > 1 && (S[n++] = S[b++]));
                   }
                 } else if ($ & 64) {
                   t.msg = "invalid distance code", i.mode = _s;
                   break e;
                 } else {
-                  I = _[(I & 65535) + (O & (1 << $) - 1)];
+                  L = _[(L & 65535) + (O & (1 << $) - 1)];
                   continue r;
                 }
                 break;
@@ -3572,13 +3572,13 @@ var os = {}, Ut = {}, _s = 30, iy = 12, ay = function(t, r) {
               break e;
             }
           else {
-            I = w[(I & 65535) + (O & (1 << $) - 1)];
+            L = w[(L & 65535) + (O & (1 << $) - 1)];
             continue t;
           }
           break;
         }
     } while (a < s && n < l);
-  L = g >> 3, a -= L, g -= L << 3, O &= (1 << g) - 1, t.next_in = a, t.next_out = n, t.avail_in = a < s ? 5 + (s - a) : 5 - (a - s), t.avail_out = n < l ? 257 + (l - n) : 257 - (n - l), i.hold = O, i.bits = g;
+  I = g >> 3, a -= I, g -= I << 3, O &= (1 << g) - 1, t.next_in = a, t.next_out = n, t.avail_in = a < s ? 5 + (s - a) : 5 - (a - s), t.avail_out = n < l ? 257 + (l - n) : 257 - (n - l), i.hold = O, i.bits = g;
 }, _l = ar, Vr = 15, vl = 852, xl = 592, kl = 0, Vi = 1, Pl = 2, oy = [
   /* Length codes 257..285 base */
   3,
@@ -3714,7 +3714,7 @@ var os = {}, Ut = {}, _s = 30, iy = 12, ay = function(t, r) {
   64,
   64
 ], cy = function(t, r, i, a, s, n, o, l) {
-  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 _l.Buf16(Vr + 1), R = new _l.Buf16(Vr + 1), D = null, V = 0, B, Y, G;
+  var p = l.bits, c = 0, d = 0, m = 0, y = 0, O = 0, g = 0, w = 0, _ = 0, T = 0, E = 0, L, $, I, C, b, F = null, k = 0, S, j = new _l.Buf16(Vr + 1), R = new _l.Buf16(Vr + 1), D = null, V = 0, B, Y, G;
   for (c = 0; c <= Vr; c++)
     j[c] = 0;
   for (d = 0; d < a; d++)
@@ -3734,26 +3734,26 @@ var os = {}, Ut = {}, _s = 30, iy = 12, ay = function(t, r) {
     R[c + 1] = R[c] + j[c];
   for (d = 0; d < a; d++)
     r[i + d] !== 0 && (o[R[r[i + d]]++] = d);
-  if (t === kl ? (F = D = o, S = 19) : t === Vi ? (F = oy, P -= 257, D = ly, V -= 257, S = 256) : (F = fy, D = py, 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 > vl || t === Pl && T > xl)
+  if (t === kl ? (F = D = o, S = 19) : t === Vi ? (F = oy, k -= 257, D = ly, V -= 257, S = 256) : (F = fy, D = py, S = -1), E = 0, d = 0, c = m, b = n, g = O, w = 0, I = -1, T = 1 << O, C = T - 1, t === Vi && T > vl || t === Pl && T > xl)
     return 1;
   for (; ; ) {
-    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 = $;
+    B = c - w, o[d] < S ? (Y = 0, G = o[d]) : o[d] > S ? (Y = D[V + o[d]], G = F[k + o[d]]) : (Y = 96, G = 0), L = 1 << c - w, $ = 1 << g, m = $;
     do
-      $ -= I, s[b + (E >> w) + $] = B << 24 | Y << 16 | G | 0;
+      $ -= L, s[b + (E >> w) + $] = B << 24 | Y << 16 | G | 0;
     while ($ !== 0);
-    for (I = 1 << c - 1; E & I; )
-      I >>= 1;
-    if (I !== 0 ? (E &= I - 1, E += I) : E = 0, d++, --j[c] === 0) {
+    for (L = 1 << c - 1; E & L; )
+      L >>= 1;
+    if (L !== 0 ? (E &= L - 1, E += L) : E = 0, d++, --j[c] === 0) {
       if (c === y)
         break;
       c = r[i + o[d]];
     }
-    if (c > O && (E & C) !== L) {
+    if (c > O && (E & C) !== I) {
       for (w === 0 && (w = O), b += m, g = c - w, _ = 1 << g; g + w < y && (_ -= j[g + w], !(_ <= 0)); )
         g++, _ <<= 1;
       if (T += 1 << g, t === Vi && T > vl || t === Pl && T > xl)
         return 1;
-      L = E & C, s[L] = O << 24 | g << 16 | b - n | 0;
+      I = E & C, s[I] = O << 24 | g << 16 | b - n | 0;
     }
   }
   return E !== 0 && (s[b + E] = c - w << 24 | 64 << 16 | 0), l.bits = O, 0;
@@ -3806,7 +3806,7 @@ function Uc(e, t, r, i) {
   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;
 }
 function Sy(e, t) {
-  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 = (
+  var r, i, a, s, n, o, l, p, c, d, m, y, O, g, w = 0, _, T, E, L, $, I, C, b, F = new kt.Buf8(4), k, S, j = (
     /* permutation of code lengths */
     [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]
   );
@@ -4025,7 +4025,7 @@ function Sy(e, t) {
           }
           for (; r.have < 19; )
             r.lens[j[r.have++]] = 0;
-          if (r.lencode = r.lendyn, r.lenbits = 7, P = { bits: r.lenbits }, b = In(dy, r.lens, 0, 19, r.lencode, 0, r.work, P), r.lenbits = P.bits, b) {
+          if (r.lencode = r.lendyn, r.lenbits = 7, k = { bits: r.lenbits }, b = In(dy, r.lens, 0, 19, r.lencode, 0, r.work, k), r.lenbits = k.bits, b) {
             e.msg = "invalid code lengths set", r.mode = je;
             break;
           }
@@ -4080,11 +4080,11 @@ function Sy(e, t) {
             e.msg = "invalid code -- missing end-of-block", r.mode = je;
             break;
           }
-          if (r.lenbits = 9, P = { bits: r.lenbits }, b = In(Ac, r.lens, 0, r.nlen, r.lencode, 0, r.work, P), r.lenbits = P.bits, b) {
+          if (r.lenbits = 9, k = { bits: r.lenbits }, b = In(Ac, r.lens, 0, r.nlen, r.lencode, 0, r.work, k), r.lenbits = k.bits, b) {
             e.msg = "invalid literal/lengths set", r.mode = je;
             break;
           }
-          if (r.distbits = 6, r.distcode = r.distdyn, P = { bits: r.distbits }, b = In($c, r.lens, r.nlen, r.ndist, r.distcode, 0, r.work, P), r.distbits = P.bits, b) {
+          if (r.distbits = 6, r.distcode = r.distdyn, k = { bits: r.distbits }, b = In($c, r.lens, r.nlen, r.ndist, r.distcode, 0, r.work, k), r.distbits = k.bits, b) {
             e.msg = "invalid distances set", r.mode = je;
             break;
           }
@@ -4103,12 +4103,12 @@ function Sy(e, t) {
             o--, p += i[s++] << c, c += 8;
           }
           if (T && !(T & 240)) {
-            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); ) {
+            for (L = _, $ = T, I = E; w = r.lencode[I + ((p & (1 << L + $) - 1) >> L)], _ = w >>> 24, T = w >>> 16 & 255, E = w & 65535, !(L + _ <= c); ) {
               if (o === 0)
                 break e;
               o--, p += i[s++] << c, c += 8;
             }
-            p >>>= I, c -= I, r.back += I;
+            p >>>= L, c -= L, r.back += L;
           }
           if (p >>>= _, c -= _, r.back += _, r.length = E, T === 0) {
             r.mode = zl;
@@ -4140,12 +4140,12 @@ function Sy(e, t) {
             o--, p += i[s++] << c, c += 8;
           }
           if (!(T & 240)) {
-            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); ) {
+            for (L = _, $ = T, I = E; w = r.distcode[I + ((p & (1 << L + $) - 1) >> L)], _ = w >>> 24, T = w >>> 16 & 255, E = w & 65535, !(L + _ <= c); ) {
               if (o === 0)
                 break e;
               o--, p += i[s++] << c, c += 8;
             }
-            p >>>= I, c -= I, r.back += I;
+            p >>>= L, c -= L, r.back += L;
           }
           if (p >>>= _, c -= _, r.back += _, T & 64) {
             e.msg = "invalid distance code", r.mode = je;
@@ -4749,7 +4749,7 @@ Ao.write = function(e, t, r, i, a, s) {
       }
   }
   o.byteLength = E;
-  function I(x, u, h) {
+  function L(x, u, h) {
     var A = !1;
     if ((u === void 0 || u < 0) && (u = 0), u > this.length || ((h === void 0 || h > this.length) && (h = this.length), h <= 0) || (h >>>= 0, u >>>= 0, h <= u))
       return "";
@@ -4805,7 +4805,7 @@ Ao.write = function(e, t, r, i, a, s) {
     return this;
   }, o.prototype.toString = function() {
     var u = this.length;
-    return u === 0 ? "" : arguments.length === 0 ? D(this, 0, u) : I.apply(this, arguments);
+    return u === 0 ? "" : arguments.length === 0 ? D(this, 0, u) : L.apply(this, arguments);
   }, o.prototype.toLocaleString = o.prototype.toString, o.prototype.equals = function(u) {
     if (!o.isBuffer(u)) throw new TypeError("Argument must be a Buffer");
     return this === u ? !0 : o.compare(this, u) === 0;
@@ -4833,7 +4833,7 @@ Ao.write = function(e, t, r, i, a, s) {
       }
     return J < pe ? -1 : pe < J ? 1 : 0;
   };
-  function L(x, u, h, A, U) {
+  function I(x, u, h, A, U) {
     if (x.length === 0) return -1;
     if (typeof h == "string" ? (A = h, h = 0) : h > 2147483647 ? h = 2147483647 : h < -2147483648 && (h = -2147483648), h = +h, ft(h) && (h = U ? 0 : x.length - 1), h < 0 && (h = x.length + h), h >= x.length) {
       if (U) return -1;
@@ -4879,9 +4879,9 @@ Ao.write = function(e, t, r, i, a, s) {
   o.prototype.includes = function(u, h, A) {
     return this.indexOf(u, h, A) !== -1;
   }, o.prototype.indexOf = function(u, h, A) {
-    return L(this, u, h, A, !0);
+    return I(this, u, h, A, !0);
   }, o.prototype.lastIndexOf = function(u, h, A) {
-    return L(this, u, h, A, !1);
+    return I(this, u, h, A, !1);
   };
   function b(x, u, h, A) {
     h = Number(h) || 0;
@@ -4899,7 +4899,7 @@ Ao.write = function(e, t, r, i, a, s) {
   function F(x, u, h, A) {
     return Ie(Te(u, x.length - h), x, h, A);
   }
-  function P(x, u, h, A) {
+  function k(x, u, h, A) {
     return Ie(Xe(u), x, h, A);
   }
   function S(x, u, h, A) {
@@ -4933,7 +4933,7 @@ Ao.write = function(e, t, r, i, a, s) {
         case "ascii":
         case "latin1":
         case "binary":
-          return P(this, u, h, A);
+          return k(this, u, h, A);
         case "base64":
           return S(this, u, h, A);
         case "ucs2":
@@ -5739,8 +5739,8 @@ function fg() {
     t = null;
   var a = /^\s*class\b/, s = function(E) {
     try {
-      var I = e.call(E);
-      return a.test(I);
+      var L = e.call(E);
+      return a.test(L);
     } catch {
       return !1;
     }
@@ -5758,8 +5758,8 @@ function fg() {
     o.call(_) === o.call(document.all) && (w = function(E) {
       if ((g || !E) && (typeof E > "u" || typeof E == "object"))
         try {
-          var I = o.call(E);
-          return (I === d || I === m || I === y || I === l) && E("") == null;
+          var L = o.call(E);
+          return (L === d || L === m || L === y || L === l) && E("") == null;
         } catch {
         }
       return !1;
@@ -5772,8 +5772,8 @@ function fg() {
       return !1;
     try {
       t(E, null, r);
-    } catch (I) {
-      if (I !== i)
+    } catch (L) {
+      if (L !== i)
         return !1;
     }
     return !s(E) && n(E);
@@ -5786,8 +5786,8 @@ function fg() {
       return n(E);
     if (s(E))
       return !1;
-    var I = o.call(E);
-    return I !== p && I !== c && !/^\[object HTML/.test(I) ? !1 : n(E);
+    var L = o.call(E);
+    return L !== p && L !== c && !/^\[object HTML/.test(L) ? !1 : n(E);
   }, la;
 }
 var fa, lf;
@@ -5972,11 +5972,11 @@ function bg() {
         T = a(E, Symbol.toStringTag);
       }
       if (T && T.get) {
-        var I = r(T.get);
+        var L = r(T.get);
         m[
           /** @type {`$${import('.').TypedArrayName}`} */
           "$" + g
-        ] = I;
+        ] = L;
       }
     }
   }) : e(p, function(g) {
@@ -6241,14 +6241,14 @@ class un {
       7: "ref-delta"
     }, s = {}, n = t.slice(-20).toString("hex"), o = [], l = {}, p = /* @__PURE__ */ new Map();
     let c = null, d = null;
-    await By([t], async ({ data: w, type: _, reference: T, offset: E, num: I }) => {
-      c === null && (c = I);
+    await By([t], async ({ data: w, type: _, reference: T, offset: E, num: L }) => {
+      c === null && (c = L);
       const $ = Math.floor(
-        (c - I) * 100 / c
+        (c - L) * 100 / c
       );
       $ !== d && i && await i({
         phase: "Receiving objects",
-        loaded: c - I,
+        loaded: c - L,
         total: c
       }), d = $, _ = a[_], ["commit", "tree", "blob", "tag"].includes(_) ? s[E] = {
         type: _,
@@ -6263,8 +6263,8 @@ class un {
     });
     const m = Object.keys(s).map(Number);
     for (const [w, _] of m.entries()) {
-      const T = w + 1 === m.length ? t.byteLength - 20 : m[w + 1], E = s[_], I = zh.buf(t.slice(_, T)) >>> 0;
-      E.end = T, E.crc = I;
+      const T = w + 1 === m.length ? t.byteLength - 20 : m[w + 1], E = s[_], L = zh.buf(t.slice(_, T)) >>> 0;
+      E.end = T, E.crc = L;
     }
     const y = new un({
       pack: Promise.resolve(t),
@@ -6289,9 +6289,9 @@ class un {
       if (!T.oid)
         try {
           y.readDepth = 0, y.externalReadDepth = 0;
-          const { type: E, object: I } = await y.readSlice({ start: w });
+          const { type: E, object: L } = await y.readSlice({ start: w });
           g[y.readDepth] += 1;
-          const $ = await ii(Vh.wrap({ type: E, object: I }));
+          const $ = await ii(Vh.wrap({ type: E, object: L }));
           T.oid = $, o.push($), p.set($, w), l[$] = T.crc;
         } catch {
           continue;
@@ -7834,7 +7834,7 @@ function Tf(e, t, r, i) {
 }
 function Fw() {
   const e = this;
-  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;
+  let t, r, i, a, s, n, o, l, p, c, d, m, y, O, g, w, _, T, E, L, $, I, C, b, F, k, S, j, R, D, V, B, Y;
   const G = new Fe(), te = new Fe(), z = new Fe();
   e.depth = [];
   let X, ee, Z, fe, oe, ie;
@@ -7843,7 +7843,7 @@ function Fw() {
     p = 2 * s, d[y - 1] = 0;
     for (let M = 0; M < y - 1; M++)
       d[M] = 0;
-    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;
+    k = 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, L = 0, m = 0;
   }
   function Te() {
     let M;
@@ -7961,7 +7961,7 @@ function Fw() {
       else if (Q == -1)
         Q--;
       else if ($ >= s + s - wt) {
-        l.set(l.subarray(s, s + s), 0), L -= s, $ -= s, _ -= s, M = y, W = M;
+        l.set(l.subarray(s, s + s), 0), I -= s, $ -= s, _ -= s, M = y, W = M;
         do
           K = d[--W] & 65535, d[W] = K >= s ? K - s : 0;
         while (--M !== 0);
@@ -8004,7 +8004,7 @@ function Fw() {
           ;
         while (l[++W] == l[++Q] && l[++W] == l[++Q] && l[++W] == l[++Q] && l[++W] == l[++Q] && l[++W] == l[++Q] && l[++W] == l[++Q] && l[++W] == l[++Q] && l[++W] == l[++Q] && W < xe);
         if (se = Hs - (xe - W), W = xe - Hs, se > le) {
-          if (L = M, le = se, se >= Me)
+          if (I = M, le = se, se >= Me)
             break;
           q = l[W + le - 1], ae = l[W + le];
         }
@@ -8022,7 +8022,7 @@ function Fw() {
           break;
       }
       if (C >= Ne && (m = (m << w ^ l[$ + (Ne - 1)] & 255) & g, K = d[m] & 65535, c[$ & o] = d[m], d[m] = $), K !== 0 && ($ - K & 65535) <= s - wt && j != Ps && (T = Ft(K)), T >= Ne)
-        if (W = H($ - L, T - Ne), C -= T, T <= P && C >= Ne) {
+        if (W = H($ - I, T - Ne), C -= T, T <= k && C >= Ne) {
           T--;
           do
             $++, m = (m << w ^ l[$ + (Ne - 1)] & 255) & g, K = d[m] & 65535, c[$ & o] = d[m], d[m] = $;
@@ -8046,20 +8046,20 @@ function Fw() {
         if (C === 0)
           break;
       }
-      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 == bw || T == Ne && $ - L > 4096) && (T = Ne - 1)), b >= Ne && T <= b) {
+      if (C >= Ne && (m = (m << w ^ l[$ + (Ne - 1)] & 255) & g, K = d[m] & 65535, c[$ & o] = d[m], d[m] = $), b = T, E = I, T = Ne - 1, K !== 0 && b < k && ($ - K & 65535) <= s - wt && (j != Ps && (T = Ft(K)), T <= 5 && (j == bw || T == Ne && $ - I > 4096) && (T = Ne - 1)), b >= Ne && T <= b) {
         Q = $ + C - Ne, W = H($ - 1 - E, b - Ne), C -= b - 1, b -= 2;
         do
           ++$ <= Q && (m = (m << w ^ l[$ + (Ne - 1)] & 255) & g, K = d[m] & 65535, c[$ & o] = d[m], d[m] = $);
         while (--b !== 0);
-        if (I = 0, T = Ne - 1, $++, W && (ue(!1), t.avail_out === 0))
+        if (L = 0, T = Ne - 1, $++, W && (ue(!1), t.avail_out === 0))
           return St;
-      } else if (I !== 0) {
+      } else if (L !== 0) {
         if (W = H(0, l[$ - 1] & 255), W && ue(!1), $++, C--, t.avail_out === 0)
           return St;
       } else
-        I = 1, $++, C--;
+        L = 1, $++, C--;
     }
-    return I !== 0 && (W = H(0, l[$ - 1] & 255), I = 0), ue(M == pt), t.avail_out === 0 ? M == pt ? kn : St : M == pt ? Ts : Os;
+    return L !== 0 && (W = H(0, l[$ - 1] & 255), L = 0), ue(M == pt), t.avail_out === 0 ? M == pt ? kn : St : M == pt ? Ts : Os;
   }
   function Hr(M) {
     return M.total_in = M.total_out = 0, M.msg = null, e.pending = 0, e.pending_out = 0, r = As, a = en, Xe(), Ae(), Ct;
@@ -8070,7 +8070,7 @@ function Fw() {
     return r != ka && r != As && r != Pn ? Nt : (e.lc_buf = null, e.dist_buf = null, e.pending_buf = null, d = null, c = null, l = null, e.dstate = null, r == As ? xw : Ct);
   }, e.deflateParams = function(M, K, W) {
     let Q = Ct;
-    return K == oi && (K = 6), K < 0 || K > 9 || W < 0 || W > Ps ? Nt : (Lt[S].func != Lt[K].func && M.total_in !== 0 && (Q = M.deflate(Sf)), S != K && (S = K, P = Lt[S].max_lazy, R = Lt[S].good_length, D = Lt[S].nice_length, F = Lt[S].max_chain), j = W, Q);
+    return K == oi && (K = 6), K < 0 || K > 9 || W < 0 || W > Ps ? Nt : (Lt[S].func != Lt[K].func && M.total_in !== 0 && (Q = M.deflate(Sf)), S != K && (S = K, k = Lt[S].max_lazy, R = Lt[S].good_length, D = Lt[S].nice_length, F = Lt[S].max_chain), j = W, Q);
   }, e.deflateSetDictionary = function(M, K, W) {
     let Q = W, se, le = 0;
     if (!K || r != ka)
@@ -9991,7 +9991,7 @@ function so() {
   const e = this;
   let t, r, i, a, s, n;
   function o(p, c, d, m, y, O, g, w, _, T, E) {
-    let I, $, L, C, b, F, P, S, j, R, D, V, B, Y, G;
+    let L, $, I, C, b, F, k, S, j, R, D, V, B, Y, G;
     R = 0, b = d;
     do
       i[p[c + R]]++, R++, b--;
@@ -10000,9 +10000,9 @@ function so() {
       return g[0] = -1, w[0] = 0, ve;
     for (S = w[0], F = 1; F <= fr && i[F] === 0; F++)
       ;
-    for (P = F, S < F && (S = F), b = fr; b !== 0 && i[b] === 0; b--)
+    for (k = F, S < F && (S = F), b = fr; b !== 0 && i[b] === 0; b--)
       ;
-    for (L = b, S > b && (S = b), w[0] = S, Y = 1 << F; F < b; F++, Y <<= 1)
+    for (I = b, S > b && (S = b), w[0] = S, Y = 1 << F; F < b; F++, Y <<= 1)
       if ((Y -= i[F]) < 0)
         return Le;
     if ((Y -= i[b]) < 0)
@@ -10013,10 +10013,10 @@ function so() {
     do
       (F = p[c + R]) !== 0 && (E[n[F]++] = b), R++;
     while (++b < d);
-    for (d = n[L], n[0] = b = 0, R = 0, C = -1, V = -S, s[0] = 0, D = 0, G = 0; P <= L; P++)
-      for (I = i[P]; I-- !== 0; ) {
-        for (; P > V + S; ) {
-          if (C++, V += S, G = L - V, G = G > S ? S : G, ($ = 1 << (F = P - V)) > I + 1 && ($ -= I + 1, B = P, F < G))
+    for (d = n[I], n[0] = b = 0, R = 0, C = -1, V = -S, s[0] = 0, D = 0, G = 0; k <= I; k++)
+      for (L = i[k]; L-- !== 0; ) {
+        for (; k > V + S; ) {
+          if (C++, V += S, G = I - V, G = G > S ? S : G, ($ = 1 << (F = k - V)) > L + 1 && ($ -= L + 1, B = k, F < G))
             for (; ++F < G && !(($ <<= 1) <= i[++B]); )
               $ -= i[B];
           if (G = 1 << F, T[0] + G > mu)
@@ -10028,16 +10028,16 @@ function so() {
           D - s[C - 1] - F, _.set(a, (s[C - 1] + F) * 3)) : g[0] = D;
         }
         for (a[1] = /* (byte) */
-        P - V, R >= d ? a[0] = 192 : E[R] < m ? (a[0] = /* (byte) */
+        k - V, R >= d ? a[0] = 192 : E[R] < m ? (a[0] = /* (byte) */
         E[R] < 256 ? 0 : 96, a[2] = E[R++]) : (a[0] = /* (byte) */
-        O[E[R] - m] + 16 + 64, a[2] = y[E[R++] - m]), $ = 1 << P - V, F = b >>> V; F < G; F += $)
+        O[E[R] - m] + 16 + 64, a[2] = y[E[R++] - m]), $ = 1 << k - V, F = b >>> V; F < G; F += $)
           _.set(a, (D + F) * 3);
-        for (F = 1 << P - 1; b & F; F >>>= 1)
+        for (F = 1 << k - 1; b & F; F >>>= 1)
           b ^= F;
         for (b ^= F, j = (1 << V) - 1; (b & j) != n[C]; )
           C--, V -= S, j = (1 << V) - 1;
       }
-    return Y !== 0 && L != 1 ? ir : ve;
+    return Y !== 0 && I != 1 ? ir : ve;
   }
   function l(p) {
     let c;
@@ -10064,14 +10064,14 @@ const $s = 0, $f = 1, Rf = 2, Ff = 3, Lf = 4, If = 5, Cf = 6, Sa = 7, jf = 8, Rs
 function Zw() {
   const e = this;
   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;
-  function g(w, _, T, E, I, $, L, C) {
-    let b, F, P, S, j, R, D, V, B, Y, G, te, z, X, ee, Z;
-    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[_];
+  function g(w, _, T, E, L, $, I, C) {
+    let b, F, k, S, j, R, D, V, B, Y, G, te, z, X, ee, Z;
+    D = C.next_in_index, V = C.avail_in, j = I.bitb, R = I.bitk, B = I.write, Y = B < I.read ? I.read - B - 1 : I.end - B, G = _t[w], te = _t[_];
     do {
       for (; R < 20; )
         V--, j |= (C.read_byte(D++) & 255) << R, R += 8;
-      if (b = j & G, F = T, P = E, Z = (P + b) * 3, (S = F[Z]) === 0) {
-        j >>= F[Z + 1], R -= F[Z + 1], L.win[B++] = /* (byte) */
+      if (b = j & G, F = T, k = E, Z = (k + b) * 3, (S = F[Z]) === 0) {
+        j >>= F[Z + 1], R -= F[Z + 1], I.win[B++] = /* (byte) */
         F[Z + 2], Y--;
         continue;
       }
@@ -10080,63 +10080,63 @@ function Zw() {
           for (S &= 15, z = F[Z + 2] + /* (int) */
           (j & _t[S]), j >>= S, R -= S; R < 15; )
             V--, j |= (C.read_byte(D++) & 255) << R, R += 8;
-          b = j & te, F = I, P = $, Z = (P + b) * 3, S = F[Z];
+          b = j & te, F = L, k = $, Z = (k + b) * 3, S = F[Z];
           do
             if (j >>= F[Z + 1], R -= F[Z + 1], S & 16) {
               for (S &= 15; R < S; )
                 V--, j |= (C.read_byte(D++) & 255) << R, R += 8;
               if (X = F[Z + 2] + (j & _t[S]), j >>= S, R -= S, Y -= z, B >= X)
-                ee = B - X, B - ee > 0 && 2 > B - ee ? (L.win[B++] = L.win[ee++], L.win[B++] = L.win[ee++], z -= 2) : (L.win.set(L.win.subarray(ee, ee + 2), B), B += 2, ee += 2, z -= 2);
+                ee = B - X, B - ee > 0 && 2 > B - ee ? (I.win[B++] = I.win[ee++], I.win[B++] = I.win[ee++], z -= 2) : (I.win.set(I.win.subarray(ee, ee + 2), B), B += 2, ee += 2, z -= 2);
               else {
                 ee = B - X;
                 do
-                  ee += L.end;
+                  ee += I.end;
                 while (ee < 0);
-                if (S = L.end - ee, z > S) {
+                if (S = I.end - ee, z > S) {
                   if (z -= S, B - ee > 0 && S > B - ee)
                     do
-                      L.win[B++] = L.win[ee++];
+                      I.win[B++] = I.win[ee++];
                     while (--S !== 0);
                   else
-                    L.win.set(L.win.subarray(ee, ee + S), B), B += S, ee += S, S = 0;
+                    I.win.set(I.win.subarray(ee, ee + S), B), B += S, ee += S, S = 0;
                   ee = 0;
                 }
               }
               if (B - ee > 0 && z > B - ee)
                 do
-                  L.win[B++] = L.win[ee++];
+                  I.win[B++] = I.win[ee++];
                 while (--z !== 0);
               else
-                L.win.set(L.win.subarray(ee, ee + z), B), B += z, ee += z, z = 0;
+                I.win.set(I.win.subarray(ee, ee + z), B), B += z, ee += z, z = 0;
               break;
             } else if (!(S & 64))
-              b += F[Z + 2], b += j & _t[S], Z = (P + b) * 3, S = F[Z];
+              b += F[Z + 2], b += j & _t[S], Z = (k + b) * 3, S = F[Z];
             else
-              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;
+              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, I.bitb = j, I.bitk = R, C.avail_in = V, C.total_in += D - C.next_in_index, C.next_in_index = D, I.write = B, Le;
           while (!0);
           break;
         }
         if (S & 64)
-          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);
-        if (b += F[Z + 2], b += j & _t[S], Z = (P + b) * 3, (S = F[Z]) === 0) {
-          j >>= F[Z + 1], R -= F[Z + 1], L.win[B++] = /* (byte) */
+          return S & 32 ? (z = C.avail_in - V, z = R >> 3 < z ? R >> 3 : z, V += z, D -= z, R -= z << 3, I.bitb = j, I.bitk = R, C.avail_in = V, C.total_in += D - C.next_in_index, C.next_in_index = D, I.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, I.bitb = j, I.bitk = R, C.avail_in = V, C.total_in += D - C.next_in_index, C.next_in_index = D, I.write = B, Le);
+        if (b += F[Z + 2], b += j & _t[S], Z = (k + b) * 3, (S = F[Z]) === 0) {
+          j >>= F[Z + 1], R -= F[Z + 1], I.win[B++] = /* (byte) */
           F[Z + 2], Y--;
           break;
         }
       } while (!0);
     } while (Y >= 258 && V >= 10);
-    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;
+    return z = C.avail_in - V, z = R >> 3 < z ? R >> 3 : z, V += z, D -= z, R -= z << 3, I.bitb = j, I.bitk = R, C.avail_in = V, C.total_in += D - C.next_in_index, C.next_in_index = D, I.write = B, ve;
   }
-  e.init = function(w, _, T, E, I, $) {
+  e.init = function(w, _, T, E, L, $) {
     t = $s, p = /* (byte) */
     w, c = /* (byte) */
-    _, d = T, m = E, y = I, O = $, i = null;
+    _, d = T, m = E, y = L, O = $, i = null;
   }, e.proc = function(w, _, T) {
-    let E, I, $, L = 0, C = 0, b = 0, F, P, S, j;
-    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; ; )
+    let E, L, $, I = 0, C = 0, b = 0, F, k, S, j;
+    for (b = _.next_in_index, F = _.avail_in, I = w.bitb, C = w.bitk, k = w.write, S = k < w.read ? w.read - k - 1 : w.end - k; ; )
       switch (t) {
         case $s:
-          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)) {
+          if (S >= 258 && F >= 10 && (w.bitb = I, w.bitk = C, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = k, T = g(p, c, d, m, y, O, w, _), b = _.next_in_index, F = _.avail_in, I = w.bitb, C = w.bitk, k = w.write, S = k < w.read ? w.read - k - 1 : w.end - k, T != ve)) {
             t = T == sr ? Sa : Rs;
             break;
           }
@@ -10146,87 +10146,87 @@ function Zw() {
             if (F !== 0)
               T = ve;
             else
-              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);
-            F--, L |= (_.read_byte(b++) & 255) << C, C += 8;
+              return w.bitb = I, w.bitk = C, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = k, w.inflate_flush(_, T);
+            F--, I |= (_.read_byte(b++) & 255) << C, C += 8;
           }
-          if (I = (a + (L & _t[E])) * 3, L >>>= i[I + 1], C -= i[I + 1], $ = i[I], $ === 0) {
-            n = i[I + 2], t = Cf;
+          if (L = (a + (I & _t[E])) * 3, I >>>= i[L + 1], C -= i[L + 1], $ = i[L], $ === 0) {
+            n = i[L + 2], t = Cf;
             break;
           }
           if ($ & 16) {
-            o = $ & 15, r = i[I + 2], t = Rf;
+            o = $ & 15, r = i[L + 2], t = Rf;
             break;
           }
           if (!($ & 64)) {
-            s = $, a = I / 3 + i[I + 2];
+            s = $, a = L / 3 + i[L + 2];
             break;
           }
           if ($ & 32) {
             t = Sa;
             break;
           }
-          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);
+          return t = Rs, _.msg = "invalid literal/length code", T = Le, w.bitb = I, w.bitk = C, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = k, w.inflate_flush(_, T);
         case Rf:
           for (E = o; C < E; ) {
             if (F !== 0)
               T = ve;
             else
-              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);
-            F--, L |= (_.read_byte(b++) & 255) << C, C += 8;
+              return w.bitb = I, w.bitk = C, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = k, w.inflate_flush(_, T);
+            F--, I |= (_.read_byte(b++) & 255) << C, C += 8;
           }
-          r += L & _t[E], L >>= E, C -= E, s = c, i = y, a = O, t = Ff;
+          r += I & _t[E], I >>= E, C -= E, s = c, i = y, a = O, t = Ff;
         case Ff:
           for (E = s; C < E; ) {
             if (F !== 0)
               T = ve;
             else
-              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);
-            F--, L |= (_.read_byte(b++) & 255) << C, C += 8;
+              return w.bitb = I, w.bitk = C, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = k, w.inflate_flush(_, T);
+            F--, I |= (_.read_byte(b++) & 255) << C, C += 8;
           }
-          if (I = (a + (L & _t[E])) * 3, L >>= i[I + 1], C -= i[I + 1], $ = i[I], $ & 16) {
-            o = $ & 15, l = i[I + 2], t = Lf;
+          if (L = (a + (I & _t[E])) * 3, I >>= i[L + 1], C -= i[L + 1], $ = i[L], $ & 16) {
+            o = $ & 15, l = i[L + 2], t = Lf;
             break;
           }
           if (!($ & 64)) {
-            s = $, a = I / 3 + i[I + 2];
+            s = $, a = L / 3 + i[L + 2];
             break;
           }
-          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);
+          return t = Rs, _.msg = "invalid distance code", T = Le, w.bitb = I, w.bitk = C, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = k, w.inflate_flush(_, T);
         case Lf:
           for (E = o; C < E; ) {
             if (F !== 0)
               T = ve;
             else
-              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);
-            F--, L |= (_.read_byte(b++) & 255) << C, C += 8;
+              return w.bitb = I, w.bitk = C, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = k, w.inflate_flush(_, T);
+            F--, I |= (_.read_byte(b++) & 255) << C, C += 8;
           }
-          l += L & _t[E], L >>= E, C -= E, t = If;
+          l += I & _t[E], I >>= E, C -= E, t = If;
         case If:
-          for (j = P - l; j < 0; )
+          for (j = k - l; j < 0; )
             j += w.end;
           for (; r !== 0; ) {
-            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)))
-              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);
-            w.win[P++] = w.win[j++], S--, j == w.end && (j = 0), r--;
+            if (S === 0 && (k == w.end && w.read !== 0 && (k = 0, S = k < w.read ? w.read - k - 1 : w.end - k), S === 0 && (w.write = k, T = w.inflate_flush(_, T), k = w.write, S = k < w.read ? w.read - k - 1 : w.end - k, k == w.end && w.read !== 0 && (k = 0, S = k < w.read ? w.read - k - 1 : w.end - k), S === 0)))
+              return w.bitb = I, w.bitk = C, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = k, w.inflate_flush(_, T);
+            w.win[k++] = w.win[j++], S--, j == w.end && (j = 0), r--;
           }
           t = $s;
           break;
         case Cf:
-          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)))
-            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);
-          T = ve, w.win[P++] = /* (byte) */
+          if (S === 0 && (k == w.end && w.read !== 0 && (k = 0, S = k < w.read ? w.read - k - 1 : w.end - k), S === 0 && (w.write = k, T = w.inflate_flush(_, T), k = w.write, S = k < w.read ? w.read - k - 1 : w.end - k, k == w.end && w.read !== 0 && (k = 0, S = k < w.read ? w.read - k - 1 : w.end - k), S === 0)))
+            return w.bitb = I, w.bitk = C, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = k, w.inflate_flush(_, T);
+          T = ve, w.win[k++] = /* (byte) */
           n, S--, t = $s;
           break;
         case Sa:
-          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)
-            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);
+          if (C > 7 && (C -= 8, F++, b--), w.write = k, T = w.inflate_flush(_, T), k = w.write, S = k < w.read ? w.read - k - 1 : w.end - k, w.read != w.write)
+            return w.bitb = I, w.bitk = C, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = k, w.inflate_flush(_, T);
           t = jf;
         case jf:
-          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);
+          return T = sr, w.bitb = I, w.bitk = C, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = k, w.inflate_flush(_, T);
         case Rs:
-          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);
+          return T = Le, w.bitb = I, w.bitk = C, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = k, w.inflate_flush(_, T);
         default:
-          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);
+          return T = ut, w.bitb = I, w.bitk = C, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = k, w.inflate_flush(_, T);
       }
   }, e.free = function() {
   };
@@ -10266,18 +10266,18 @@ function Gw(e, t) {
     return T = g.next_out_index, E = r.read, _ = /* (int) */
     (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;
   }, r.proc = function(g, w) {
-    let _, T, E, I, $, L, C, b;
-    for (I = g.next_in_index, $ = g.avail_in, T = r.bitb, E = r.bitk, L = r.write, C = /* (int) */
-    L < r.read ? r.read - L - 1 : r.end - L; ; ) {
-      let F, P, S, j, R, D, V, B;
+    let _, T, E, L, $, I, C, b;
+    for (L = g.next_in_index, $ = g.avail_in, T = r.bitb, E = r.bitk, I = r.write, C = /* (int) */
+    I < r.read ? r.read - I - 1 : r.end - I; ; ) {
+      let F, k, S, j, R, D, V, B;
       switch (i) {
         case Kr:
           for (; E < 3; ) {
             if ($ !== 0)
               w = ve;
             else
-              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);
-            $--, T |= (g.read_byte(I++) & 255) << E, E += 8;
+              return r.bitb = T, r.bitk = E, g.avail_in = $, g.total_in += L - g.next_in_index, g.next_in_index = L, r.write = I, r.inflate_flush(g, w);
+            $--, T |= (g.read_byte(L++) & 255) << E, E += 8;
           }
           switch (_ = /* (int) */
           T & 7, d = _ & 1, _ >>> 1) {
@@ -10285,13 +10285,13 @@ function Gw(e, t) {
               T >>>= 3, E -= 3, _ = E & 7, T >>>= _, E -= _, i = Oa;
               break;
             case 1:
-              F = [], P = [], S = [[]], j = [[]], so.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;
+              F = [], k = [], S = [[]], j = [[]], so.inflate_trees_fixed(F, k, S, j), c.init(F[0], k[0], S[0], 0, j[0], 0), T >>>= 3, E -= 3, i = Fs;
               break;
             case 2:
               T >>>= 3, E -= 3, i = Uf;
               break;
             case 3:
-              return T >>>= 3, E -= 3, i = kr, g.msg = "invalid block type", 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);
+              return T >>>= 3, E -= 3, i = kr, g.msg = "invalid block type", w = Le, r.bitb = T, r.bitk = E, g.avail_in = $, g.total_in += L - g.next_in_index, g.next_in_index = L, r.write = I, r.inflate_flush(g, w);
           }
           break;
         case Oa:
@@ -10299,20 +10299,20 @@ function Gw(e, t) {
             if ($ !== 0)
               w = ve;
             else
-              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);
-            $--, T |= (g.read_byte(I++) & 255) << E, E += 8;
+              return r.bitb = T, r.bitk = E, g.avail_in = $, g.total_in += L - g.next_in_index, g.next_in_index = L, r.write = I, r.inflate_flush(g, w);
+            $--, T |= (g.read_byte(L++) & 255) << E, E += 8;
           }
           if ((~T >>> 16 & 65535) != (T & 65535))
-            return i = kr, g.msg = "invalid stored block lengths", 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);
+            return i = kr, g.msg = "invalid stored block lengths", w = Le, r.bitb = T, r.bitk = E, g.avail_in = $, g.total_in += L - g.next_in_index, g.next_in_index = L, r.write = I, r.inflate_flush(g, w);
           a = T & 65535, T = E = 0, i = a !== 0 ? Df : d !== 0 ? Ls : Kr;
           break;
         case Df:
-          if ($ === 0 || C === 0 && (L == r.end && r.read !== 0 && (L = 0, C = /* (int) */
-          L < r.read ? r.read - L - 1 : r.end - L), C === 0 && (r.write = L, w = r.inflate_flush(g, w), L = r.write, C = /* (int) */
-          L < r.read ? r.read - L - 1 : r.end - L, L == r.end && r.read !== 0 && (L = 0, C = /* (int) */
-          L < r.read ? r.read - L - 1 : r.end - L), C === 0)))
-            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);
-          if (w = ve, _ = a, _ > $ && (_ = $), _ > C && (_ = C), r.win.set(g.read_buf(I, _), L), I += _, $ -= _, L += _, C -= _, (a -= _) !== 0)
+          if ($ === 0 || C === 0 && (I == r.end && r.read !== 0 && (I = 0, C = /* (int) */
+          I < r.read ? r.read - I - 1 : r.end - I), C === 0 && (r.write = I, w = r.inflate_flush(g, w), I = r.write, C = /* (int) */
+          I < r.read ? r.read - I - 1 : r.end - I, I == r.end && r.read !== 0 && (I = 0, C = /* (int) */
+          I < r.read ? r.read - I - 1 : r.end - I), C === 0)))
+            return r.bitb = T, r.bitk = E, g.avail_in = $, g.total_in += L - g.next_in_index, g.next_in_index = L, r.write = I, r.inflate_flush(g, w);
+          if (w = ve, _ = a, _ > $ && (_ = $), _ > C && (_ = C), r.win.set(g.read_buf(L, _), I), L += _, $ -= _, I += _, C -= _, (a -= _) !== 0)
             break;
           i = d !== 0 ? Ls : Kr;
           break;
@@ -10321,11 +10321,11 @@ function Gw(e, t) {
             if ($ !== 0)
               w = ve;
             else
-              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);
-            $--, T |= (g.read_byte(I++) & 255) << E, E += 8;
+              return r.bitb = T, r.bitk = E, g.avail_in = $, g.total_in += L - g.next_in_index, g.next_in_index = L, r.write = I, r.inflate_flush(g, w);
+            $--, T |= (g.read_byte(L++) & 255) << E, E += 8;
           }
           if (s = _ = T & 16383, (_ & 31) > 29 || (_ >> 5 & 31) > 29)
-            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);
+            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 += L - g.next_in_index, g.next_in_index = L, r.write = I, r.inflate_flush(g, w);
           if (_ = 258 + (_ & 31) + (_ >> 5 & 31), !o || o.length < _)
             o = [];
           else
@@ -10338,15 +10338,15 @@ function Gw(e, t) {
               if ($ !== 0)
                 w = ve;
               else
-                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);
-              $--, T |= (g.read_byte(I++) & 255) << E, E += 8;
+                return r.bitb = T, r.bitk = E, g.avail_in = $, g.total_in += L - g.next_in_index, g.next_in_index = L, r.write = I, r.inflate_flush(g, w);
+              $--, T |= (g.read_byte(L++) & 255) << E, E += 8;
             }
             o[Nf[n++]] = T & 7, T >>>= 3, E -= 3;
           }
           for (; n < 19; )
             o[Nf[n++]] = 0;
           if (l[0] = 7, _ = O.inflate_trees_bits(o, l, p, m, g), _ != ve)
-            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);
+            return w = _, w == Le && (o = null, i = kr), r.bitb = T, r.bitk = E, g.avail_in = $, g.total_in += L - g.next_in_index, g.next_in_index = L, r.write = I, r.inflate_flush(g, w);
           n = 0, i = qf;
         case qf:
           for (; _ = s, !(n >= 258 + (_ & 31) + (_ >> 5 & 31)); ) {
@@ -10355,8 +10355,8 @@ function Gw(e, t) {
               if ($ !== 0)
                 w = ve;
               else
-                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);
-              $--, T |= (g.read_byte(I++) & 255) << E, E += 8;
+                return r.bitb = T, r.bitk = E, g.avail_in = $, g.total_in += L - g.next_in_index, g.next_in_index = L, r.write = I, r.inflate_flush(g, w);
+              $--, T |= (g.read_byte(L++) & 255) << E, E += 8;
             }
             if (_ = m[(p[0] + (T & _t[_])) * 3 + 1], G = m[(p[0] + (T & _t[_])) * 3 + 2], G < 16)
               T >>>= _, E -= _, o[n++] = G;
@@ -10365,11 +10365,11 @@ function Gw(e, t) {
                 if ($ !== 0)
                   w = ve;
                 else
-                  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);
-                $--, T |= (g.read_byte(I++) & 255) << E, E += 8;
+                  return r.bitb = T, r.bitk = E, g.avail_in = $, g.total_in += L - g.next_in_index, g.next_in_index = L, r.write = I, r.inflate_flush(g, w);
+                $--, T |= (g.read_byte(L++) & 255) << E, E += 8;
               }
               if (T >>>= _, E -= _, Y += T & _t[b], T >>>= b, E -= b, b = n, _ = s, b + Y > 258 + (_ & 31) + (_ >> 5 & 31) || G == 16 && b < 1)
-                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);
+                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 += L - g.next_in_index, g.next_in_index = L, r.write = I, r.inflate_flush(g, w);
               G = G == 16 ? o[b - 1] : 0;
               do
                 o[b++] = G;
@@ -10378,28 +10378,28 @@ function Gw(e, t) {
             }
           }
           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)
-            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);
+            return _ == Le && (o = null, i = kr), w = _, r.bitb = T, r.bitk = E, g.avail_in = $, g.total_in += L - g.next_in_index, g.next_in_index = L, r.write = I, r.inflate_flush(g, w);
           c.init(R[0], D[0], m, V[0], m, B[0]), i = Fs;
         case Fs:
-          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)
+          if (r.bitb = T, r.bitk = E, g.avail_in = $, g.total_in += L - g.next_in_index, g.next_in_index = L, r.write = I, (w = c.proc(r, g, w)) != sr)
             return r.inflate_flush(g, w);
-          if (w = ve, c.free(g), I = g.next_in_index, $ = g.avail_in, T = r.bitb, E = r.bitk, L = r.write, C = /* (int) */
-          L < r.read ? r.read - L - 1 : r.end - L, d === 0) {
+          if (w = ve, c.free(g), L = g.next_in_index, $ = g.avail_in, T = r.bitb, E = r.bitk, I = r.write, C = /* (int) */
+          I < r.read ? r.read - I - 1 : r.end - I, d === 0) {
             i = Kr;
             break;
           }
           i = Ls;
         case Ls:
-          if (r.write = L, w = r.inflate_flush(g, w), L = r.write, C = /* (int) */
-          L < r.read ? r.read - L - 1 : r.end - L, r.read != r.write)
-            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);
+          if (r.write = I, w = r.inflate_flush(g, w), I = r.write, C = /* (int) */
+          I < r.read ? r.read - I - 1 : r.end - I, r.read != r.write)
+            return r.bitb = T, r.bitk = E, g.avail_in = $, g.total_in += L - g.next_in_index, g.next_in_index = L, r.write = I, r.inflate_flush(g, w);
           i = Mf;
         case Mf:
-          return w = sr, 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);
+          return w = sr, r.bitb = T, r.bitk = E, g.avail_in = $, g.total_in += L - g.next_in_index, g.next_in_index = L, r.write = I, r.inflate_flush(g, w);
         case kr:
-          return 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);
+          return w = Le, r.bitb = T, r.bitk = E, g.avail_in = $, g.total_in += L - g.next_in_index, g.next_in_index = L, r.write = I, r.inflate_flush(g, w);
         default:
-          return w = ut, 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);
+          return w = ut, r.bitb = T, r.bitk = E, g.avail_in = $, g.total_in += L - g.next_in_index, g.next_in_index = L, r.write = I, r.inflate_flush(g, w);
       }
     }
   }, r.free = function(g) {
@@ -13482,7 +13482,7 @@ class kp {
     i.chunkSize = _1(a);
     const s = await zb(i, a1, i.size, Xr, mr * 16);
     if (!s) {
-      const P = await et(i, 0, 4), S = Ye(P);
+      const k = await et(i, 0, 4), S = Ye(k);
       throw Be(S) == i1 ? new Error(_p) : new Error(Rb);
     }
     const n = Ye(s);
@@ -13492,7 +13492,7 @@ class kp {
     const y = i.lastDiskNumber || 0;
     let O = Ge(n, 6), g = Ge(n, 8), w = 0, _ = 0;
     if (l == Fr || o == Fr || g == mr || O == mr) {
-      const P = await et(i, s.offset - Aa, Aa), S = Ye(P);
+      const k = await et(i, s.offset - Aa, Aa), S = Ye(k);
       if (Be(S, 0) == o1) {
         l = Zs(S, 8);
         let j = await et(i, l, $a, -1), R = Ye(j);
@@ -13510,24 +13510,24 @@ class kp {
       throw new Error(_p);
     if (l < 0)
       throw new Error(Ca);
-    let T = 0, E = await et(i, l, o, O), I = Ye(E);
+    let T = 0, E = await et(i, l, o, O), L = Ye(E);
     if (o) {
-      const P = s.offset - o;
-      if (Be(I, T) != Yf && l != P) {
+      const k = s.offset - o;
+      if (Be(L, T) != Yf && l != k) {
         const S = l;
-        l = P, w += l - S, E = await et(i, l, o, O), I = Ye(E);
+        l = k, w += l - S, E = await et(i, l, o, O), L = Ye(E);
       }
     }
     const $ = s.offset - l - (i.lastDiskOffset || 0);
-    if (o != $ && $ >= 0 && (o = $, E = await et(i, l, o, O), I = Ye(E)), l < 0 || l >= i.size)
+    if (o != $ && $ >= 0 && (o = $, E = await et(i, l, o, O), L = Ye(E)), l < 0 || l >= i.size)
       throw new Error(Ca);
-    const L = it(r, t, "filenameEncoding"), C = it(r, t, "commentEncoding");
-    for (let P = 0; P < g; P++) {
+    const I = it(r, t, "filenameEncoding"), C = it(r, t, "commentEncoding");
+    for (let k = 0; k < g; k++) {
       const S = new Bb(i, a, r.options);
-      if (Be(I, T) != Yf)
+      if (Be(L, T) != Yf)
         throw new Error(Lb);
-      Ju(S, I, T + 6);
-      const j = !!S.bitFlag.languageEncodingFlag, R = T + 46, D = R + S.filenameLength, V = D + S.extraFieldLength, B = Ge(I, T + 4), Y = B >> 8 == 0, G = B >> 8 == 3, te = E.subarray(R, D), z = Ge(I, T + 32), X = V + z, ee = E.subarray(V, X), Z = j, fe = j, oe = Be(I, T + 38), ie = Y && (pn(I, T + 38) & ep) == ep || G && (oe >> 16 & tp) == tp || te.length && te[te.length - 1] == np.charCodeAt(0), Ae = G && (oe >> 16 & rp) == rp, Te = Be(I, T + 42) + w;
+      Ju(S, L, T + 6);
+      const j = !!S.bitFlag.languageEncodingFlag, R = T + 46, D = R + S.filenameLength, V = D + S.extraFieldLength, B = Ge(L, T + 4), Y = B >> 8 == 0, G = B >> 8 == 3, te = E.subarray(R, D), z = Ge(L, T + 32), X = V + z, ee = E.subarray(V, X), Z = j, fe = j, oe = Be(L, T + 38), ie = Y && (pn(L, T + 38) & ep) == ep || G && (oe >> 16 & tp) == tp || te.length && te[te.length - 1] == np.charCodeAt(0), Ae = G && (oe >> 16 & rp) == rp, Te = Be(L, T + 42) + w;
       Object.assign(S, {
         versionMadeBy: B,
         msDosCompatible: Y,
@@ -13536,8 +13536,8 @@ class kp {
         commentLength: z,
         directory: ie,
         offset: Te,
-        diskNumberStart: Ge(I, T + 34),
-        internalFileAttributes: Ge(I, T + 36),
+        diskNumberStart: Ge(L, T + 34),
+        internalFileAttributes: Ge(L, T + 36),
         externalFileAttributes: oe,
         rawFilename: te,
         filenameUTF8: Z,
@@ -13545,7 +13545,7 @@ class kp {
         rawExtraField: E.subarray(D, V),
         executable: Ae
       }), S.internalFileAttribute = S.internalFileAttributes, S.externalFileAttribute = S.externalFileAttributes;
-      const Xe = it(r, t, "decodeText") || Vs, tt = Z ? vp : L || xp, Et = fe ? vp : C || xp;
+      const Xe = it(r, t, "decodeText") || Vs, tt = Z ? vp : I || xp, Et = fe ? vp : C || xp;
       let Ie = Xe(te, tt);
       Ie === lt && (Ie = Vs(te, tt));
       let Ce = Xe(ee, Et);
@@ -13554,13 +13554,13 @@ class kp {
         filename: Ie,
         comment: Ce,
         directory: ie || Ie.endsWith(np)
-      }), _ = Math.max(Te, _), Qu(S, S, I, T + 6), S.zipCrypto = S.encrypted && !S.extraFieldAES;
+      }), _ = Math.max(Te, _), Qu(S, S, L, T + 6), S.zipCrypto = S.encrypted && !S.extraFieldAES;
       const ft = new wp(S);
       ft.getData = (x, u) => S.getData(x, ft, u), T = X;
       const { onprogress: Re } = t;
       if (Re)
         try {
-          await Re(P + 1, g, new wp(S));
+          await Re(k + 1, g, new wp(S));
         } catch {
         }
       yield ft;
@@ -13599,9 +13599,9 @@ class Bb {
       uncompressedSize: O,
       compressedSize: g
     } = a, w = r.localDirectory = {}, _ = await et(s, n, 30, o), T = Ye(_);
-    let E = it(a, i, "password"), I = it(a, i, "rawPassword");
+    let E = it(a, i, "password"), L = it(a, i, "rawPassword");
     const $ = it(a, i, "passThrough");
-    if (E = E && E.length && E, I = I && I.length && I, l && l.originalCompressionMethod != n1)
+    if (E = E && E.length && E, L = L && L.length && L, l && l.originalCompressionMethod != n1)
       throw new Error(bp);
     if (p != r1 && p != t1 && !$)
       throw new Error(bp);
@@ -13611,15 +13611,15 @@ class Bb {
       lastAccessDate: w.lastAccessDate,
       creationDate: w.creationDate
     });
-    const L = a.encrypted && w.encrypted && !$, C = L && !l;
-    if ($ || (r.zipCrypto = C), L) {
+    const I = a.encrypted && w.encrypted && !$, C = I && !l;
+    if ($ || (r.zipCrypto = C), I) {
       if (!C && l.strength === lt)
         throw new Error(Nb);
-      if (!E && !I)
+      if (!E && !L)
         throw new Error(jb);
     }
-    const b = n + 30 + w.filenameLength + w.extraFieldLength, F = g, P = s.readable;
-    Object.assign(P, {
+    const b = n + 30 + w.filenameLength + w.extraFieldLength, F = g, k = s.readable;
+    Object.assign(k, {
       diskNumberStart: o,
       offset: b,
       size: F
@@ -13630,7 +13630,7 @@ class Bb {
       options: {
         codecType: Nu,
         password: E,
-        rawPassword: I,
+        rawPassword: L,
         zipCrypto: C,
         encryptionStrength: l && l.strength,
         signed: it(a, i, "checkSignature") && !$,
@@ -13648,7 +13648,7 @@ class Bb {
     };
     let G = 0;
     try {
-      ({ outputSize: G } = await sb({ readable: P, writable: R }, Y));
+      ({ outputSize: G } = await sb({ readable: k, writable: R }, Y));
     } catch (te) {
       if (!j || te.message != jo)
         throw te;
@@ -17467,16 +17467,16 @@ function _e(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
     if (e && typeof e == "object" && !Array.isArray(e)) {
       let $;
       if (e.resource === void 0 && ($ = "resource") || e.path === void 0 && ($ = "path")) {
-        const L = {
+        const I = {
           instancePath: t,
           schemaPath: "#/definitions/VFSReference/required",
           keyword: "required",
           params: { missingProperty: $ },
           message: "must have required property '" + $ + "'"
         };
-        s === null ? s = [L] : s.push(L), n++;
+        s === null ? s = [I] : s.push(I), n++;
       } else {
-        const L = n;
+        const I = n;
         for (const C in e)
           if (!(C === "resource" || C === "path")) {
             const b = {
@@ -17489,7 +17489,7 @@ function _e(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
             s === null ? s = [b] : s.push(b), n++;
             break;
           }
-        if (L === n) {
+        if (I === n) {
           if (e.resource !== void 0) {
             let C = e.resource;
             const b = n;
@@ -17561,13 +17561,13 @@ function _e(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
           s === null ? s = [F] : s.push(F), n++;
         } else {
           const F = n;
-          for (const P in e)
-            if (!(P === "resource" || P === "name" || P === "contents")) {
+          for (const k in e)
+            if (!(k === "resource" || k === "name" || k === "contents")) {
               const S = {
                 instancePath: t,
                 schemaPath: "#/definitions/LiteralReference/additionalProperties",
                 keyword: "additionalProperties",
-                params: { additionalProperty: P },
+                params: { additionalProperty: k },
                 message: "must NOT have additional properties"
               };
               s === null ? s = [S] : s.push(S), n++;
@@ -17575,9 +17575,9 @@ function _e(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
             }
           if (F === n) {
             if (e.resource !== void 0) {
-              let P = e.resource;
+              let k = e.resource;
               const S = n;
-              if (typeof P != "string") {
+              if (typeof k != "string") {
                 const j = {
                   instancePath: t + "/resource",
                   schemaPath: "#/definitions/LiteralReference/properties/resource/type",
@@ -17587,7 +17587,7 @@ function _e(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                 };
                 s === null ? s = [j] : s.push(j), n++;
               }
-              if (P !== "literal") {
+              if (k !== "literal") {
                 const j = {
                   instancePath: t + "/resource",
                   schemaPath: "#/definitions/LiteralReference/properties/resource/const",
@@ -17602,7 +17602,7 @@ function _e(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
               var y = !0;
             if (y) {
               if (e.name !== void 0) {
-                const P = n;
+                const k = n;
                 if (typeof e.name != "string") {
                   const j = {
                     instancePath: t + "/name",
@@ -17613,16 +17613,16 @@ function _e(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                   };
                   s === null ? s = [j] : s.push(j), n++;
                 }
-                var y = P === n;
+                var y = k === n;
               } else
                 var y = !0;
               if (y)
                 if (e.contents !== void 0) {
-                  let P = e.contents;
+                  let k = e.contents;
                   const S = n, j = n;
                   let R = !1;
                   const D = n;
-                  if (typeof P != "string") {
+                  if (typeof k != "string") {
                     const B = {
                       instancePath: t + "/contents",
                       schemaPath: "#/definitions/LiteralReference/properties/contents/anyOf/0/type",
@@ -17636,9 +17636,9 @@ function _e(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                   if (R = R || O, !R) {
                     const B = n;
                     if (n === B)
-                      if (P && typeof P == "object" && !Array.isArray(P)) {
+                      if (k && typeof k == "object" && !Array.isArray(k)) {
                         let G;
-                        if (P.BYTES_PER_ELEMENT === void 0 && (G = "BYTES_PER_ELEMENT") || P.buffer === void 0 && (G = "buffer") || P.byteLength === void 0 && (G = "byteLength") || P.byteOffset === void 0 && (G = "byteOffset") || P.length === void 0 && (G = "length")) {
+                        if (k.BYTES_PER_ELEMENT === void 0 && (G = "BYTES_PER_ELEMENT") || k.buffer === void 0 && (G = "buffer") || k.byteLength === void 0 && (G = "byteLength") || k.byteOffset === void 0 && (G = "byteOffset") || k.length === void 0 && (G = "length")) {
                           const te = {
                             instancePath: t + "/contents",
                             schemaPath: "#/definitions/LiteralReference/properties/contents/anyOf/1/required",
@@ -17651,9 +17651,9 @@ function _e(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                           s === null ? s = [te] : s.push(te), n++;
                         } else {
                           const te = n;
-                          for (const z in P)
+                          for (const z in k)
                             if (!(z === "BYTES_PER_ELEMENT" || z === "buffer" || z === "byteLength" || z === "byteOffset" || z === "length")) {
-                              let X = P[z];
+                              let X = k[z];
                               const ee = n;
                               if (!(typeof X == "number" && isFinite(
                                 X
@@ -17684,8 +17684,8 @@ function _e(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                                 break;
                             }
                           if (te === n) {
-                            if (P.BYTES_PER_ELEMENT !== void 0) {
-                              let z = P.BYTES_PER_ELEMENT;
+                            if (k.BYTES_PER_ELEMENT !== void 0) {
+                              let z = k.BYTES_PER_ELEMENT;
                               const X = n;
                               if (!(typeof z == "number" && isFinite(
                                 z
@@ -17709,8 +17709,8 @@ function _e(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                             } else
                               var w = !0;
                             if (w) {
-                              if (P.buffer !== void 0) {
-                                let z = P.buffer;
+                              if (k.buffer !== void 0) {
+                                let z = k.buffer;
                                 const X = n;
                                 if (n === X)
                                   if (z && typeof z == "object" && !Array.isArray(
@@ -17794,8 +17794,8 @@ function _e(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                               } else
                                 var w = !0;
                               if (w) {
-                                if (P.byteLength !== void 0) {
-                                  let z = P.byteLength;
+                                if (k.byteLength !== void 0) {
+                                  let z = k.byteLength;
                                   const X = n;
                                   if (!(typeof z == "number" && isFinite(
                                     z
@@ -17819,8 +17819,8 @@ function _e(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                                 } else
                                   var w = !0;
                                 if (w) {
-                                  if (P.byteOffset !== void 0) {
-                                    let z = P.byteOffset;
+                                  if (k.byteOffset !== void 0) {
+                                    let z = k.byteOffset;
                                     const X = n;
                                     if (!(typeof z == "number" && isFinite(
                                       z
@@ -17844,8 +17844,8 @@ function _e(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                                   } else
                                     var w = !0;
                                   if (w)
-                                    if (P.length !== void 0) {
-                                      let z = P.length;
+                                    if (k.length !== void 0) {
+                                      let z = k.length;
                                       const X = n;
                                       if (!(typeof z == "number" && isFinite(
                                         z
@@ -18248,10 +18248,10 @@ function _e(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                         };
                         s === null ? s = [fe] : s.push(fe), n++;
                       }
-                      var I = Z === n;
+                      var L = Z === n;
                     } else
-                      var I = !0;
-                    if (I)
+                      var L = !0;
+                    if (L)
                       if (e.path !== void 0) {
                         const ee = n;
                         if (typeof e.path != "string") {
@@ -18266,9 +18266,9 @@ function _e(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                           };
                           s === null ? s = [fe] : s.push(fe), n++;
                         }
-                        var I = ee === n;
+                        var L = ee === n;
                       } else
-                        var I = !0;
+                        var L = !0;
                   }
                 }
               } else {
@@ -19067,7 +19067,7 @@ function vt(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
         if (T === n) {
           if (e.method !== void 0) {
             let E = e.method;
-            const I = n;
+            const L = n;
             if (typeof E != "string")
               return vt.errors = [
                 {
@@ -19088,7 +19088,7 @@ function vt(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                   message: "must be equal to one of the allowed values"
                 }
               ], !1;
-            var o = I === n;
+            var o = L === n;
           } else
             var o = !0;
           if (o) {
@@ -19110,7 +19110,7 @@ function vt(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
             if (o) {
               if (e.headers !== void 0) {
                 let E = e.headers;
-                const I = n;
+                const L = n;
                 if (n === n)
                   if (E && typeof E == "object" && !Array.isArray(E))
                     for (const C in E) {
@@ -19147,14 +19147,14 @@ function vt(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                         message: "must be object"
                       }
                     ], !1;
-                var o = I === n;
+                var o = L === n;
               } else
                 var o = !0;
               if (o)
                 if (e.body !== void 0) {
                   let E = e.body;
-                  const I = n, $ = n;
-                  let L = !1;
+                  const L = n, $ = n;
+                  let I = !1;
                   const C = n;
                   if (typeof E != "string") {
                     const F = {
@@ -19167,7 +19167,7 @@ function vt(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                     s === null ? s = [F] : s.push(F), n++;
                   }
                   var p = C === n;
-                  if (L = L || p, !L) {
+                  if (I = I || p, !I) {
                     const F = n;
                     if (n === F)
                       if (E && typeof E == "object" && !Array.isArray(E)) {
@@ -19418,7 +19418,7 @@ function vt(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                         s === null ? s = [S] : s.push(S), n++;
                       }
                     var p = F === n;
-                    if (L = L || p, !L) {
+                    if (I = I || p, !I) {
                       const S = n;
                       if (n === S)
                         if (E && typeof E == "object" && !Array.isArray(E))
@@ -20049,10 +20049,10 @@ function vt(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                           s === null ? s = [R] : s.push(R), n++;
                         }
                       var p = S === n;
-                      L = L || p;
+                      I = I || p;
                     }
                   }
-                  if (L)
+                  if (I)
                     n = $, s !== null && ($ ? s.length = $ : s = null);
                   else {
                     const F = {
@@ -20064,7 +20064,7 @@ function vt(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                     };
                     return s === null ? s = [F] : s.push(F), n++, vt.errors = s, !1;
                   }
-                  var o = I === n;
+                  var o = L === n;
                 } else
                   var o = !0;
             }
@@ -20247,7 +20247,7 @@ function We(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                   if (n === n)
                     if (g && typeof g == "object" && !Array.isArray(g))
                       for (const E in g) {
-                        const I = n;
+                        const L = n;
                         if (typeof g[E] != "string")
                           return We.errors = [
                             {
@@ -20266,7 +20266,7 @@ function We(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                               message: "must be string"
                             }
                           ], !1;
-                        var l = I === n;
+                        var l = L === n;
                         if (!l)
                           break;
                       }
@@ -20320,10 +20320,10 @@ function We(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                             const b = n;
                             for (const F in g)
                               if (!(F === "BYTES_PER_ELEMENT" || F === "buffer" || F === "byteLength" || F === "byteOffset" || F === "length")) {
-                                let P = g[F];
+                                let k = g[F];
                                 const S = n;
-                                if (!(typeof P == "number" && isFinite(
-                                  P
+                                if (!(typeof k == "number" && isFinite(
+                                  k
                                 ))) {
                                   const j = {
                                     instancePath: t + "/body/" + F.replace(
@@ -20353,7 +20353,7 @@ function We(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                             if (b === n) {
                               if (g.BYTES_PER_ELEMENT !== void 0) {
                                 let F = g.BYTES_PER_ELEMENT;
-                                const P = n;
+                                const k = n;
                                 if (!(typeof F == "number" && isFinite(
                                   F
                                 ))) {
@@ -20372,14 +20372,14 @@ function We(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                                     S
                                   ), n++;
                                 }
-                                var d = P === n;
+                                var d = k === n;
                               } else
                                 var d = !0;
                               if (d) {
                                 if (g.buffer !== void 0) {
                                   let F = g.buffer;
-                                  const P = n;
-                                  if (n === P)
+                                  const k = n;
+                                  if (n === k)
                                     if (F && typeof F == "object" && !Array.isArray(
                                       F
                                     )) {
@@ -20457,13 +20457,13 @@ function We(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                                         j
                                       ), n++;
                                     }
-                                  var d = P === n;
+                                  var d = k === n;
                                 } else
                                   var d = !0;
                                 if (d) {
                                   if (g.byteLength !== void 0) {
                                     let F = g.byteLength;
-                                    const P = n;
+                                    const k = n;
                                     if (!(typeof F == "number" && isFinite(
                                       F
                                     ))) {
@@ -20482,13 +20482,13 @@ function We(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                                         j
                                       ), n++;
                                     }
-                                    var d = P === n;
+                                    var d = k === n;
                                   } else
                                     var d = !0;
                                   if (d) {
                                     if (g.byteOffset !== void 0) {
                                       let F = g.byteOffset;
-                                      const P = n;
+                                      const k = n;
                                       if (!(typeof F == "number" && isFinite(
                                         F
                                       ))) {
@@ -20507,13 +20507,13 @@ function We(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                                           j
                                         ), n++;
                                       }
-                                      var d = P === n;
+                                      var d = k === n;
                                     } else
                                       var d = !0;
                                     if (d)
                                       if (g.length !== void 0) {
                                         let F = g.length;
-                                        const P = n;
+                                        const k = n;
                                         if (!(typeof F == "number" && isFinite(
                                           F
                                         ))) {
@@ -20532,7 +20532,7 @@ function We(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                                             j
                                           ), n++;
                                         }
-                                        var d = P === n;
+                                        var d = k === n;
                                       } else
                                         var d = !0;
                                   }
@@ -20754,25 +20754,25 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                       if (n === N)
                         if (f && typeof f == "object" && !Array.isArray(f)) {
                           const re = n;
-                          for (const k in f)
-                            if (!(k === "weight" || k === "caption"))
+                          for (const P in f)
+                            if (!(P === "weight" || P === "caption"))
                               return v.errors = [
                                 {
                                   instancePath: t + "/progress",
                                   schemaPath: "#/oneOf/0/properties/progress/additionalProperties",
                                   keyword: "additionalProperties",
                                   params: {
-                                    additionalProperty: k
+                                    additionalProperty: P
                                   },
                                   message: "must NOT have additional properties"
                                 }
                               ], !1;
                           if (re === n) {
                             if (f.weight !== void 0) {
-                              let k = f.weight;
+                              let P = f.weight;
                               const ne = n;
-                              if (!(typeof k == "number" && isFinite(
-                                k
+                              if (!(typeof P == "number" && isFinite(
+                                P
                               )))
                                 return v.errors = [
                                   {
@@ -20790,7 +20790,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                               var o = !0;
                             if (o)
                               if (f.caption !== void 0) {
-                                const k = n;
+                                const P = n;
                                 if (typeof f.caption != "string")
                                   return v.errors = [
                                     {
@@ -20803,7 +20803,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                       message: "must be string"
                                     }
                                   ], !1;
-                                var o = k === n;
+                                var o = P === n;
                               } else
                                 var o = !0;
                           }
@@ -20941,25 +20941,25 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                       if (n === N)
                         if (f && typeof f == "object" && !Array.isArray(f)) {
                           const re = n;
-                          for (const k in f)
-                            if (!(k === "weight" || k === "caption"))
+                          for (const P in f)
+                            if (!(P === "weight" || P === "caption"))
                               return v.errors = [
                                 {
                                   instancePath: t + "/progress",
                                   schemaPath: "#/oneOf/1/properties/progress/additionalProperties",
                                   keyword: "additionalProperties",
                                   params: {
-                                    additionalProperty: k
+                                    additionalProperty: P
                                   },
                                   message: "must NOT have additional properties"
                                 }
                               ], !1;
                           if (re === n) {
                             if (f.weight !== void 0) {
-                              let k = f.weight;
+                              let P = f.weight;
                               const ne = n;
-                              if (!(typeof k == "number" && isFinite(
-                                k
+                              if (!(typeof P == "number" && isFinite(
+                                P
                               )))
                                 return v.errors = [
                                   {
@@ -20977,7 +20977,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                               var p = !0;
                             if (p)
                               if (f.caption !== void 0) {
-                                const k = n;
+                                const P = n;
                                 if (typeof f.caption != "string")
                                   return v.errors = [
                                     {
@@ -20990,7 +20990,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                       message: "must be string"
                                     }
                                   ], !1;
-                                var p = k === n;
+                                var p = P === n;
                               } else
                                 var p = !0;
                           }
@@ -21109,25 +21109,25 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                       if (n === N)
                         if (f && typeof f == "object" && !Array.isArray(f)) {
                           const re = n;
-                          for (const k in f)
-                            if (!(k === "weight" || k === "caption"))
+                          for (const P in f)
+                            if (!(P === "weight" || P === "caption"))
                               return v.errors = [
                                 {
                                   instancePath: t + "/progress",
                                   schemaPath: "#/oneOf/2/properties/progress/additionalProperties",
                                   keyword: "additionalProperties",
                                   params: {
-                                    additionalProperty: k
+                                    additionalProperty: P
                                   },
                                   message: "must NOT have additional properties"
                                 }
                               ], !1;
                           if (re === n) {
                             if (f.weight !== void 0) {
-                              let k = f.weight;
+                              let P = f.weight;
                               const ne = n;
-                              if (!(typeof k == "number" && isFinite(
-                                k
+                              if (!(typeof P == "number" && isFinite(
+                                P
                               )))
                                 return v.errors = [
                                   {
@@ -21145,7 +21145,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                               var d = !0;
                             if (d)
                               if (f.caption !== void 0) {
-                                const k = n;
+                                const P = n;
                                 if (typeof f.caption != "string")
                                   return v.errors = [
                                     {
@@ -21158,7 +21158,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                       message: "must be string"
                                     }
                                   ], !1;
-                                var d = k === n;
+                                var d = P === n;
                               } else
                                 var d = !0;
                           }
@@ -21296,25 +21296,25 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                       if (n === N)
                         if (f && typeof f == "object" && !Array.isArray(f)) {
                           const re = n;
-                          for (const k in f)
-                            if (!(k === "weight" || k === "caption"))
+                          for (const P in f)
+                            if (!(P === "weight" || P === "caption"))
                               return v.errors = [
                                 {
                                   instancePath: t + "/progress",
                                   schemaPath: "#/oneOf/3/properties/progress/additionalProperties",
                                   keyword: "additionalProperties",
                                   params: {
-                                    additionalProperty: k
+                                    additionalProperty: P
                                   },
                                   message: "must NOT have additional properties"
                                 }
                               ], !1;
                           if (re === n) {
                             if (f.weight !== void 0) {
-                              let k = f.weight;
+                              let P = f.weight;
                               const ne = n;
-                              if (!(typeof k == "number" && isFinite(
-                                k
+                              if (!(typeof P == "number" && isFinite(
+                                P
                               )))
                                 return v.errors = [
                                   {
@@ -21332,7 +21332,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                               var y = !0;
                             if (y)
                               if (f.caption !== void 0) {
-                                const k = n;
+                                const P = n;
                                 if (typeof f.caption != "string")
                                   return v.errors = [
                                     {
@@ -21345,7 +21345,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                       message: "must be string"
                                     }
                                   ], !1;
-                                var y = k === n;
+                                var y = P === n;
                               } else
                                 var y = !0;
                           }
@@ -21518,25 +21518,25 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                       if (n === N)
                         if (f && typeof f == "object" && !Array.isArray(f)) {
                           const re = n;
-                          for (const k in f)
-                            if (!(k === "weight" || k === "caption"))
+                          for (const P in f)
+                            if (!(P === "weight" || P === "caption"))
                               return v.errors = [
                                 {
                                   instancePath: t + "/progress",
                                   schemaPath: "#/oneOf/4/properties/progress/additionalProperties",
                                   keyword: "additionalProperties",
                                   params: {
-                                    additionalProperty: k
+                                    additionalProperty: P
                                   },
                                   message: "must NOT have additional properties"
                                 }
                               ], !1;
                           if (re === n) {
                             if (f.weight !== void 0) {
-                              let k = f.weight;
+                              let P = f.weight;
                               const ne = n;
-                              if (!(typeof k == "number" && isFinite(
-                                k
+                              if (!(typeof P == "number" && isFinite(
+                                P
                               )))
                                 return v.errors = [
                                   {
@@ -21554,7 +21554,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                               var g = !0;
                             if (g)
                               if (f.caption !== void 0) {
-                                const k = n;
+                                const P = n;
                                 if (typeof f.caption != "string")
                                   return v.errors = [
                                     {
@@ -21567,7 +21567,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                       message: "must be string"
                                     }
                                   ], !1;
-                                var g = k === n;
+                                var g = P === n;
                               } else
                                 var g = !0;
                           }
@@ -21686,25 +21686,25 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                       if (n === N)
                         if (f && typeof f == "object" && !Array.isArray(f)) {
                           const re = n;
-                          for (const k in f)
-                            if (!(k === "weight" || k === "caption"))
+                          for (const P in f)
+                            if (!(P === "weight" || P === "caption"))
                               return v.errors = [
                                 {
                                   instancePath: t + "/progress",
                                   schemaPath: "#/oneOf/5/properties/progress/additionalProperties",
                                   keyword: "additionalProperties",
                                   params: {
-                                    additionalProperty: k
+                                    additionalProperty: P
                                   },
                                   message: "must NOT have additional properties"
                                 }
                               ], !1;
                           if (re === n) {
                             if (f.weight !== void 0) {
-                              let k = f.weight;
+                              let P = f.weight;
                               const ne = n;
-                              if (!(typeof k == "number" && isFinite(
-                                k
+                              if (!(typeof P == "number" && isFinite(
+                                P
                               )))
                                 return v.errors = [
                                   {
@@ -21722,7 +21722,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                               var _ = !0;
                             if (_)
                               if (f.caption !== void 0) {
-                                const k = n;
+                                const P = n;
                                 if (typeof f.caption != "string")
                                   return v.errors = [
                                     {
@@ -21735,7 +21735,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                       message: "must be string"
                                     }
                                   ], !1;
-                                var _ = k === n;
+                                var _ = P === n;
                               } else
                                 var _ = !0;
                           }
@@ -21854,25 +21854,25 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                       if (n === N)
                         if (f && typeof f == "object" && !Array.isArray(f)) {
                           const re = n;
-                          for (const k in f)
-                            if (!(k === "weight" || k === "caption"))
+                          for (const P in f)
+                            if (!(P === "weight" || P === "caption"))
                               return v.errors = [
                                 {
                                   instancePath: t + "/progress",
                                   schemaPath: "#/oneOf/6/properties/progress/additionalProperties",
                                   keyword: "additionalProperties",
                                   params: {
-                                    additionalProperty: k
+                                    additionalProperty: P
                                   },
                                   message: "must NOT have additional properties"
                                 }
                               ], !1;
                           if (re === n) {
                             if (f.weight !== void 0) {
-                              let k = f.weight;
+                              let P = f.weight;
                               const ne = n;
-                              if (!(typeof k == "number" && isFinite(
-                                k
+                              if (!(typeof P == "number" && isFinite(
+                                P
                               )))
                                 return v.errors = [
                                   {
@@ -21890,7 +21890,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                               var E = !0;
                             if (E)
                               if (f.caption !== void 0) {
-                                const k = n;
+                                const P = n;
                                 if (typeof f.caption != "string")
                                   return v.errors = [
                                     {
@@ -21903,7 +21903,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                       message: "must be string"
                                     }
                                   ], !1;
-                                var E = k === n;
+                                var E = P === n;
                               } else
                                 var E = !0;
                           }
@@ -21919,10 +21919,10 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                               message: "must be object"
                             }
                           ], !1;
-                      var I = N === n;
+                      var L = N === n;
                     } else
-                      var I = !0;
-                    if (I) {
+                      var L = !0;
+                    if (L) {
                       if (e.step !== void 0) {
                         let f = e.step;
                         const N = n;
@@ -21950,10 +21950,10 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                               message: "must be equal to constant"
                             }
                           ], !1;
-                        var I = N === n;
+                        var L = N === n;
                       } else
-                        var I = !0;
-                      if (I) {
+                        var L = !0;
+                      if (L) {
                         if (e.file !== void 0) {
                           const f = n;
                           _e(e.file, {
@@ -21964,10 +21964,10 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                           }) || (s = s === null ? _e.errors : s.concat(
                             _e.errors
                           ), n = s.length);
-                          var I = f === n;
+                          var L = f === n;
                         } else
-                          var I = !0;
-                        if (I)
+                          var L = !0;
+                        if (L)
                           if (e.importer !== void 0) {
                             let f = e.importer;
                             const N = n;
@@ -21995,9 +21995,9 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                   message: "must be equal to one of the allowed values"
                                 }
                               ], !1;
-                            var I = N === n;
+                            var L = N === n;
                           } else
-                            var I = !0;
+                            var L = !0;
                       }
                     }
                   }
@@ -22050,25 +22050,25 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                       if (n === N)
                         if (f && typeof f == "object" && !Array.isArray(f)) {
                           const re = n;
-                          for (const k in f)
-                            if (!(k === "weight" || k === "caption"))
+                          for (const P in f)
+                            if (!(P === "weight" || P === "caption"))
                               return v.errors = [
                                 {
                                   instancePath: t + "/progress",
                                   schemaPath: "#/oneOf/7/properties/progress/additionalProperties",
                                   keyword: "additionalProperties",
                                   params: {
-                                    additionalProperty: k
+                                    additionalProperty: P
                                   },
                                   message: "must NOT have additional properties"
                                 }
                               ], !1;
                           if (re === n) {
                             if (f.weight !== void 0) {
-                              let k = f.weight;
+                              let P = f.weight;
                               const ne = n;
-                              if (!(typeof k == "number" && isFinite(
-                                k
+                              if (!(typeof P == "number" && isFinite(
+                                P
                               )))
                                 return v.errors = [
                                   {
@@ -22086,7 +22086,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                               var $ = !0;
                             if ($)
                               if (f.caption !== void 0) {
-                                const k = n;
+                                const P = n;
                                 if (typeof f.caption != "string")
                                   return v.errors = [
                                     {
@@ -22099,7 +22099,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                       message: "must be string"
                                     }
                                   ], !1;
-                                var $ = k === n;
+                                var $ = P === n;
                               } else
                                 var $ = !0;
                           }
@@ -22115,10 +22115,10 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                               message: "must be object"
                             }
                           ], !1;
-                      var L = N === n;
+                      var I = N === n;
                     } else
-                      var L = !0;
-                    if (L) {
+                      var I = !0;
+                    if (I) {
                       if (e.step !== void 0) {
                         let f = e.step;
                         const N = n;
@@ -22146,10 +22146,10 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                               message: "must be equal to constant"
                             }
                           ], !1;
-                        var L = N === n;
+                        var I = N === n;
                       } else
-                        var L = !0;
-                      if (L)
+                        var I = !0;
+                      if (I)
                         if (e.themeSlug !== void 0) {
                           const f = n;
                           if (typeof e.themeSlug != "string")
@@ -22164,9 +22164,9 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                 message: "must be string"
                               }
                             ], !1;
-                          var L = f === n;
+                          var I = f === n;
                         } else
-                          var L = !0;
+                          var I = !0;
                     }
                   }
                 }
@@ -22218,25 +22218,25 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                       if (n === N)
                         if (f && typeof f == "object" && !Array.isArray(f)) {
                           const re = n;
-                          for (const k in f)
-                            if (!(k === "weight" || k === "caption"))
+                          for (const P in f)
+                            if (!(P === "weight" || P === "caption"))
                               return v.errors = [
                                 {
                                   instancePath: t + "/progress",
                                   schemaPath: "#/oneOf/8/properties/progress/additionalProperties",
                                   keyword: "additionalProperties",
                                   params: {
-                                    additionalProperty: k
+                                    additionalProperty: P
                                   },
                                   message: "must NOT have additional properties"
                                 }
                               ], !1;
                           if (re === n) {
                             if (f.weight !== void 0) {
-                              let k = f.weight;
+                              let P = f.weight;
                               const ne = n;
-                              if (!(typeof k == "number" && isFinite(
-                                k
+                              if (!(typeof P == "number" && isFinite(
+                                P
                               )))
                                 return v.errors = [
                                   {
@@ -22254,7 +22254,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                               var C = !0;
                             if (C)
                               if (f.caption !== void 0) {
-                                const k = n;
+                                const P = n;
                                 if (typeof f.caption != "string")
                                   return v.errors = [
                                     {
@@ -22267,7 +22267,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                       message: "must be string"
                                     }
                                   ], !1;
-                                var C = k === n;
+                                var C = P === n;
                               } else
                                 var C = !0;
                           }
@@ -22404,25 +22404,25 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                       if (n === N)
                         if (f && typeof f == "object" && !Array.isArray(f)) {
                           const re = n;
-                          for (const k in f)
-                            if (!(k === "weight" || k === "caption"))
+                          for (const P in f)
+                            if (!(P === "weight" || P === "caption"))
                               return v.errors = [
                                 {
                                   instancePath: t + "/progress",
                                   schemaPath: "#/oneOf/9/properties/progress/additionalProperties",
                                   keyword: "additionalProperties",
                                   params: {
-                                    additionalProperty: k
+                                    additionalProperty: P
                                   },
                                   message: "must NOT have additional properties"
                                 }
                               ], !1;
                           if (re === n) {
                             if (f.weight !== void 0) {
-                              let k = f.weight;
+                              let P = f.weight;
                               const ne = n;
-                              if (!(typeof k == "number" && isFinite(
-                                k
+                              if (!(typeof P == "number" && isFinite(
+                                P
                               )))
                                 return v.errors = [
                                   {
@@ -22440,7 +22440,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                               var F = !0;
                             if (F)
                               if (f.caption !== void 0) {
-                                const k = n;
+                                const P = n;
                                 if (typeof f.caption != "string")
                                   return v.errors = [
                                     {
@@ -22453,7 +22453,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                       message: "must be string"
                                     }
                                   ], !1;
-                                var F = k === n;
+                                var F = P === n;
                               } else
                                 var F = !0;
                           }
@@ -22469,10 +22469,10 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                               message: "must be object"
                             }
                           ], !1;
-                      var P = N === n;
+                      var k = N === n;
                     } else
-                      var P = !0;
-                    if (P) {
+                      var k = !0;
+                    if (k) {
                       if (e.ifAlreadyInstalled !== void 0) {
                         let f = e.ifAlreadyInstalled;
                         const N = n;
@@ -22500,10 +22500,10 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                               message: "must be equal to one of the allowed values"
                             }
                           ], !1;
-                        var P = N === n;
+                        var k = N === n;
                       } else
-                        var P = !0;
-                      if (P) {
+                        var k = !0;
+                      if (k) {
                         if (e.step !== void 0) {
                           let f = e.step;
                           const N = n;
@@ -22531,14 +22531,14 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                 message: "must be equal to constant"
                               }
                             ], !1;
-                          var P = N === n;
+                          var k = N === n;
                         } else
-                          var P = !0;
-                        if (P) {
+                          var k = !0;
+                        if (k) {
                           if (e.pluginData !== void 0) {
                             let f = e.pluginData;
                             const N = n, re = n;
-                            let k = !1;
+                            let P = !1;
                             const ne = n;
                             _e(
                               f,
@@ -22552,7 +22552,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                               _e.errors
                             ), n = s.length);
                             var S = ne === n;
-                            if (k = k || S, !k) {
+                            if (P = P || S, !P) {
                               const ke = n;
                               ct(
                                 f,
@@ -22566,9 +22566,9 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                 ct.errors
                               ), n = s.length);
                               var S = ke === n;
-                              k = k || S;
+                              P = P || S;
                             }
-                            if (k)
+                            if (P)
                               n = re, s !== null && (re ? s.length = re : s = null);
                             else {
                               const ke = {
@@ -22584,10 +22584,10 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                 ke
                               ), n++, v.errors = s, !1;
                             }
-                            var P = N === n;
+                            var k = N === n;
                           } else
-                            var P = !0;
-                          if (P) {
+                            var k = !0;
+                          if (k) {
                             if (e.pluginZipFile !== void 0) {
                               const f = n;
                               _e(
@@ -22601,10 +22601,10 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                               ) || (s = s === null ? _e.errors : s.concat(
                                 _e.errors
                               ), n = s.length);
-                              var P = f === n;
+                              var k = f === n;
                             } else
-                              var P = !0;
-                            if (P)
+                              var k = !0;
+                            if (k)
                               if (e.options !== void 0) {
                                 let f = e.options;
                                 const N = n;
@@ -22675,9 +22675,9 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                         message: "must be object"
                                       }
                                     ], !1;
-                                var P = N === n;
+                                var k = N === n;
                               } else
-                                var P = !0;
+                                var k = !0;
                           }
                         }
                       }
@@ -22732,25 +22732,25 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                       if (n === N)
                         if (f && typeof f == "object" && !Array.isArray(f)) {
                           const re = n;
-                          for (const k in f)
-                            if (!(k === "weight" || k === "caption"))
+                          for (const P in f)
+                            if (!(P === "weight" || P === "caption"))
                               return v.errors = [
                                 {
                                   instancePath: t + "/progress",
                                   schemaPath: "#/oneOf/10/properties/progress/additionalProperties",
                                   keyword: "additionalProperties",
                                   params: {
-                                    additionalProperty: k
+                                    additionalProperty: P
                                   },
                                   message: "must NOT have additional properties"
                                 }
                               ], !1;
                           if (re === n) {
                             if (f.weight !== void 0) {
-                              let k = f.weight;
+                              let P = f.weight;
                               const ne = n;
-                              if (!(typeof k == "number" && isFinite(
-                                k
+                              if (!(typeof P == "number" && isFinite(
+                                P
                               )))
                                 return v.errors = [
                                   {
@@ -22768,7 +22768,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                               var R = !0;
                             if (R)
                               if (f.caption !== void 0) {
-                                const k = n;
+                                const P = n;
                                 if (typeof f.caption != "string")
                                   return v.errors = [
                                     {
@@ -22781,7 +22781,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                       message: "must be string"
                                     }
                                   ], !1;
-                                var R = k === n;
+                                var R = P === n;
                               } else
                                 var R = !0;
                           }
@@ -22866,7 +22866,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                           if (e.themeData !== void 0) {
                             let f = e.themeData;
                             const N = n, re = n;
-                            let k = !1;
+                            let P = !1;
                             const ne = n;
                             _e(
                               f,
@@ -22880,7 +22880,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                               _e.errors
                             ), n = s.length);
                             var V = ne === n;
-                            if (k = k || V, !k) {
+                            if (P = P || V, !P) {
                               const ke = n;
                               ct(
                                 f,
@@ -22894,9 +22894,9 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                 ct.errors
                               ), n = s.length);
                               var V = ke === n;
-                              k = k || V;
+                              P = P || V;
                             }
-                            if (k)
+                            if (P)
                               n = re, s !== null && (re ? s.length = re : s = null);
                             else {
                               const ke = {
@@ -23079,25 +23079,25 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                       if (n === N)
                         if (f && typeof f == "object" && !Array.isArray(f)) {
                           const re = n;
-                          for (const k in f)
-                            if (!(k === "weight" || k === "caption"))
+                          for (const P in f)
+                            if (!(P === "weight" || P === "caption"))
                               return v.errors = [
                                 {
                                   instancePath: t + "/progress",
                                   schemaPath: "#/oneOf/11/properties/progress/additionalProperties",
                                   keyword: "additionalProperties",
                                   params: {
-                                    additionalProperty: k
+                                    additionalProperty: P
                                   },
                                   message: "must NOT have additional properties"
                                 }
                               ], !1;
                           if (re === n) {
                             if (f.weight !== void 0) {
-                              let k = f.weight;
+                              let P = f.weight;
                               const ne = n;
-                              if (!(typeof k == "number" && isFinite(
-                                k
+                              if (!(typeof P == "number" && isFinite(
+                                P
                               )))
                                 return v.errors = [
                                   {
@@ -23115,7 +23115,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                               var Y = !0;
                             if (Y)
                               if (f.caption !== void 0) {
-                                const k = n;
+                                const P = n;
                                 if (typeof f.caption != "string")
                                   return v.errors = [
                                     {
@@ -23128,7 +23128,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                       message: "must be string"
                                     }
                                   ], !1;
-                                var Y = k === n;
+                                var Y = P === n;
                               } else
                                 var Y = !0;
                           }
@@ -23266,25 +23266,25 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                       if (n === N)
                         if (f && typeof f == "object" && !Array.isArray(f)) {
                           const re = n;
-                          for (const k in f)
-                            if (!(k === "weight" || k === "caption"))
+                          for (const P in f)
+                            if (!(P === "weight" || P === "caption"))
                               return v.errors = [
                                 {
                                   instancePath: t + "/progress",
                                   schemaPath: "#/oneOf/12/properties/progress/additionalProperties",
                                   keyword: "additionalProperties",
                                   params: {
-                                    additionalProperty: k
+                                    additionalProperty: P
                                   },
                                   message: "must NOT have additional properties"
                                 }
                               ], !1;
                           if (re === n) {
                             if (f.weight !== void 0) {
-                              let k = f.weight;
+                              let P = f.weight;
                               const ne = n;
-                              if (!(typeof k == "number" && isFinite(
-                                k
+                              if (!(typeof P == "number" && isFinite(
+                                P
                               )))
                                 return v.errors = [
                                   {
@@ -23302,7 +23302,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                               var te = !0;
                             if (te)
                               if (f.caption !== void 0) {
-                                const k = n;
+                                const P = n;
                                 if (typeof f.caption != "string")
                                   return v.errors = [
                                     {
@@ -23315,7 +23315,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                       message: "must be string"
                                     }
                                   ], !1;
-                                var te = k === n;
+                                var te = P === n;
                               } else
                                 var te = !0;
                           }
@@ -23434,25 +23434,25 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                       if (n === N)
                         if (f && typeof f == "object" && !Array.isArray(f)) {
                           const re = n;
-                          for (const k in f)
-                            if (!(k === "weight" || k === "caption"))
+                          for (const P in f)
+                            if (!(P === "weight" || P === "caption"))
                               return v.errors = [
                                 {
                                   instancePath: t + "/progress",
                                   schemaPath: "#/oneOf/13/properties/progress/additionalProperties",
                                   keyword: "additionalProperties",
                                   params: {
-                                    additionalProperty: k
+                                    additionalProperty: P
                                   },
                                   message: "must NOT have additional properties"
                                 }
                               ], !1;
                           if (re === n) {
                             if (f.weight !== void 0) {
-                              let k = f.weight;
+                              let P = f.weight;
                               const ne = n;
-                              if (!(typeof k == "number" && isFinite(
-                                k
+                              if (!(typeof P == "number" && isFinite(
+                                P
                               )))
                                 return v.errors = [
                                   {
@@ -23470,7 +23470,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                               var X = !0;
                             if (X)
                               if (f.caption !== void 0) {
-                                const k = n;
+                                const P = n;
                                 if (typeof f.caption != "string")
                                   return v.errors = [
                                     {
@@ -23483,7 +23483,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                       message: "must be string"
                                     }
                                   ], !1;
-                                var X = k === n;
+                                var X = P === n;
                               } else
                                 var X = !0;
                           }
@@ -23621,25 +23621,25 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                       if (n === N)
                         if (f && typeof f == "object" && !Array.isArray(f)) {
                           const re = n;
-                          for (const k in f)
-                            if (!(k === "weight" || k === "caption"))
+                          for (const P in f)
+                            if (!(P === "weight" || P === "caption"))
                               return v.errors = [
                                 {
                                   instancePath: t + "/progress",
                                   schemaPath: "#/oneOf/14/properties/progress/additionalProperties",
                                   keyword: "additionalProperties",
                                   params: {
-                                    additionalProperty: k
+                                    additionalProperty: P
                                   },
                                   message: "must NOT have additional properties"
                                 }
                               ], !1;
                           if (re === n) {
                             if (f.weight !== void 0) {
-                              let k = f.weight;
+                              let P = f.weight;
                               const ne = n;
-                              if (!(typeof k == "number" && isFinite(
-                                k
+                              if (!(typeof P == "number" && isFinite(
+                                P
                               )))
                                 return v.errors = [
                                   {
@@ -23657,7 +23657,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                               var Z = !0;
                             if (Z)
                               if (f.caption !== void 0) {
-                                const k = n;
+                                const P = n;
                                 if (typeof f.caption != "string")
                                   return v.errors = [
                                     {
@@ -23670,7 +23670,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                       message: "must be string"
                                     }
                                   ], !1;
-                                var Z = k === n;
+                                var Z = P === n;
                               } else
                                 var Z = !0;
                           }
@@ -23770,25 +23770,25 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                       if (n === N)
                         if (f && typeof f == "object" && !Array.isArray(f)) {
                           const re = n;
-                          for (const k in f)
-                            if (!(k === "weight" || k === "caption"))
+                          for (const P in f)
+                            if (!(P === "weight" || P === "caption"))
                               return v.errors = [
                                 {
                                   instancePath: t + "/progress",
                                   schemaPath: "#/oneOf/15/properties/progress/additionalProperties",
                                   keyword: "additionalProperties",
                                   params: {
-                                    additionalProperty: k
+                                    additionalProperty: P
                                   },
                                   message: "must NOT have additional properties"
                                 }
                               ], !1;
                           if (re === n) {
                             if (f.weight !== void 0) {
-                              let k = f.weight;
+                              let P = f.weight;
                               const ne = n;
-                              if (!(typeof k == "number" && isFinite(
-                                k
+                              if (!(typeof P == "number" && isFinite(
+                                P
                               )))
                                 return v.errors = [
                                   {
@@ -23806,7 +23806,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                               var oe = !0;
                             if (oe)
                               if (f.caption !== void 0) {
-                                const k = n;
+                                const P = n;
                                 if (typeof f.caption != "string")
                                   return v.errors = [
                                     {
@@ -23819,7 +23819,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                       message: "must be string"
                                     }
                                   ], !1;
-                                var oe = k === n;
+                                var oe = P === n;
                               } else
                                 var oe = !0;
                           }
@@ -23937,25 +23937,25 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                       if (n === N)
                         if (f && typeof f == "object" && !Array.isArray(f)) {
                           const re = n;
-                          for (const k in f)
-                            if (!(k === "weight" || k === "caption"))
+                          for (const P in f)
+                            if (!(P === "weight" || P === "caption"))
                               return v.errors = [
                                 {
                                   instancePath: t + "/progress",
                                   schemaPath: "#/oneOf/16/properties/progress/additionalProperties",
                                   keyword: "additionalProperties",
                                   params: {
-                                    additionalProperty: k
+                                    additionalProperty: P
                                   },
                                   message: "must NOT have additional properties"
                                 }
                               ], !1;
                           if (re === n) {
                             if (f.weight !== void 0) {
-                              let k = f.weight;
+                              let P = f.weight;
                               const ne = n;
-                              if (!(typeof k == "number" && isFinite(
-                                k
+                              if (!(typeof P == "number" && isFinite(
+                                P
                               )))
                                 return v.errors = [
                                   {
@@ -23973,7 +23973,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                               var Ae = !0;
                             if (Ae)
                               if (f.caption !== void 0) {
-                                const k = n;
+                                const P = n;
                                 if (typeof f.caption != "string")
                                   return v.errors = [
                                     {
@@ -23986,7 +23986,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                       message: "must be string"
                                     }
                                   ], !1;
-                                var Ae = k === n;
+                                var Ae = P === n;
                               } else
                                 var Ae = !0;
                           }
@@ -24105,25 +24105,25 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                       if (n === N)
                         if (f && typeof f == "object" && !Array.isArray(f)) {
                           const re = n;
-                          for (const k in f)
-                            if (!(k === "weight" || k === "caption"))
+                          for (const P in f)
+                            if (!(P === "weight" || P === "caption"))
                               return v.errors = [
                                 {
                                   instancePath: t + "/progress",
                                   schemaPath: "#/oneOf/17/properties/progress/additionalProperties",
                                   keyword: "additionalProperties",
                                   params: {
-                                    additionalProperty: k
+                                    additionalProperty: P
                                   },
                                   message: "must NOT have additional properties"
                                 }
                               ], !1;
                           if (re === n) {
                             if (f.weight !== void 0) {
-                              let k = f.weight;
+                              let P = f.weight;
                               const ne = n;
-                              if (!(typeof k == "number" && isFinite(
-                                k
+                              if (!(typeof P == "number" && isFinite(
+                                P
                               )))
                                 return v.errors = [
                                   {
@@ -24141,7 +24141,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                               var Xe = !0;
                             if (Xe)
                               if (f.caption !== void 0) {
-                                const k = n;
+                                const P = n;
                                 if (typeof f.caption != "string")
                                   return v.errors = [
                                     {
@@ -24154,7 +24154,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                       message: "must be string"
                                     }
                                   ], !1;
-                                var Xe = k === n;
+                                var Xe = P === n;
                               } else
                                 var Xe = !0;
                           }
@@ -24273,25 +24273,25 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                       if (n === N)
                         if (f && typeof f == "object" && !Array.isArray(f)) {
                           const re = n;
-                          for (const k in f)
-                            if (!(k === "weight" || k === "caption"))
+                          for (const P in f)
+                            if (!(P === "weight" || P === "caption"))
                               return v.errors = [
                                 {
                                   instancePath: t + "/progress",
                                   schemaPath: "#/oneOf/18/properties/progress/additionalProperties",
                                   keyword: "additionalProperties",
                                   params: {
-                                    additionalProperty: k
+                                    additionalProperty: P
                                   },
                                   message: "must NOT have additional properties"
                                 }
                               ], !1;
                           if (re === n) {
                             if (f.weight !== void 0) {
-                              let k = f.weight;
+                              let P = f.weight;
                               const ne = n;
-                              if (!(typeof k == "number" && isFinite(
-                                k
+                              if (!(typeof P == "number" && isFinite(
+                                P
                               )))
                                 return v.errors = [
                                   {
@@ -24309,7 +24309,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                               var Et = !0;
                             if (Et)
                               if (f.caption !== void 0) {
-                                const k = n;
+                                const P = n;
                                 if (typeof f.caption != "string")
                                   return v.errors = [
                                     {
@@ -24322,7 +24322,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                       message: "must be string"
                                     }
                                   ], !1;
-                                var Et = k === n;
+                                var Et = P === n;
                               } else
                                 var Et = !0;
                           }
@@ -24376,7 +24376,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                         if (e.code !== void 0) {
                           let f = e.code;
                           const N = n, re = n;
-                          let k = !1;
+                          let P = !1;
                           const ne = n;
                           if (typeof f != "string") {
                             const ke = {
@@ -24391,7 +24391,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                             s === null ? s = [ke] : s.push(ke), n++;
                           }
                           var Ce = ne === n;
-                          if (k = k || Ce, !k) {
+                          if (P = P || Ce, !P) {
                             const ke = n;
                             if (n === ke)
                               if (f && typeof f == "object" && !Array.isArray(
@@ -24496,9 +24496,9 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                 ), n++;
                               }
                             var Ce = ke === n;
-                            k = k || Ce;
+                            P = P || Ce;
                           }
-                          if (k)
+                          if (P)
                             n = re, s !== null && (re ? s.length = re : s = null);
                           else {
                             const ke = {
@@ -24564,25 +24564,25 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                       if (n === N)
                         if (f && typeof f == "object" && !Array.isArray(f)) {
                           const re = n;
-                          for (const k in f)
-                            if (!(k === "weight" || k === "caption"))
+                          for (const P in f)
+                            if (!(P === "weight" || P === "caption"))
                               return v.errors = [
                                 {
                                   instancePath: t + "/progress",
                                   schemaPath: "#/oneOf/19/properties/progress/additionalProperties",
                                   keyword: "additionalProperties",
                                   params: {
-                                    additionalProperty: k
+                                    additionalProperty: P
                                   },
                                   message: "must NOT have additional properties"
                                 }
                               ], !1;
                           if (re === n) {
                             if (f.weight !== void 0) {
-                              let k = f.weight;
+                              let P = f.weight;
                               const ne = n;
-                              if (!(typeof k == "number" && isFinite(
-                                k
+                              if (!(typeof P == "number" && isFinite(
+                                P
                               )))
                                 return v.errors = [
                                   {
@@ -24600,7 +24600,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                               var Re = !0;
                             if (Re)
                               if (f.caption !== void 0) {
-                                const k = n;
+                                const P = n;
                                 if (typeof f.caption != "string")
                                   return v.errors = [
                                     {
@@ -24613,7 +24613,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                       message: "must be string"
                                     }
                                   ], !1;
-                                var Re = k === n;
+                                var Re = P === n;
                               } else
                                 var Re = !0;
                           }
@@ -24731,25 +24731,25 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                       if (n === N)
                         if (f && typeof f == "object" && !Array.isArray(f)) {
                           const re = n;
-                          for (const k in f)
-                            if (!(k === "weight" || k === "caption"))
+                          for (const P in f)
+                            if (!(P === "weight" || P === "caption"))
                               return v.errors = [
                                 {
                                   instancePath: t + "/progress",
                                   schemaPath: "#/oneOf/20/properties/progress/additionalProperties",
                                   keyword: "additionalProperties",
                                   params: {
-                                    additionalProperty: k
+                                    additionalProperty: P
                                   },
                                   message: "must NOT have additional properties"
                                 }
                               ], !1;
                           if (re === n) {
                             if (f.weight !== void 0) {
-                              let k = f.weight;
+                              let P = f.weight;
                               const ne = n;
-                              if (!(typeof k == "number" && isFinite(
-                                k
+                              if (!(typeof P == "number" && isFinite(
+                                P
                               )))
                                 return v.errors = [
                                   {
@@ -24767,7 +24767,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                               var u = !0;
                             if (u)
                               if (f.caption !== void 0) {
-                                const k = n;
+                                const P = n;
                                 if (typeof f.caption != "string")
                                   return v.errors = [
                                     {
@@ -24780,7 +24780,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                       message: "must be string"
                                     }
                                   ], !1;
-                                var u = k === n;
+                                var u = P === n;
                               } else
                                 var u = !0;
                           }
@@ -24955,25 +24955,25 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                       if (n === N)
                         if (f && typeof f == "object" && !Array.isArray(f)) {
                           const re = n;
-                          for (const k in f)
-                            if (!(k === "weight" || k === "caption"))
+                          for (const P in f)
+                            if (!(P === "weight" || P === "caption"))
                               return v.errors = [
                                 {
                                   instancePath: t + "/progress",
                                   schemaPath: "#/oneOf/21/properties/progress/additionalProperties",
                                   keyword: "additionalProperties",
                                   params: {
-                                    additionalProperty: k
+                                    additionalProperty: P
                                   },
                                   message: "must NOT have additional properties"
                                 }
                               ], !1;
                           if (re === n) {
                             if (f.weight !== void 0) {
-                              let k = f.weight;
+                              let P = f.weight;
                               const ne = n;
-                              if (!(typeof k == "number" && isFinite(
-                                k
+                              if (!(typeof P == "number" && isFinite(
+                                P
                               )))
                                 return v.errors = [
                                   {
@@ -24991,7 +24991,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                               var U = !0;
                             if (U)
                               if (f.caption !== void 0) {
-                                const k = n;
+                                const P = n;
                                 if (typeof f.caption != "string")
                                   return v.errors = [
                                     {
@@ -25004,7 +25004,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                       message: "must be string"
                                     }
                                   ], !1;
-                                var U = k === n;
+                                var U = P === n;
                               } else
                                 var U = !0;
                           }
@@ -25119,25 +25119,25 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                       if (n === N)
                         if (f && typeof f == "object" && !Array.isArray(f)) {
                           const re = n;
-                          for (const k in f)
-                            if (!(k === "weight" || k === "caption"))
+                          for (const P in f)
+                            if (!(P === "weight" || P === "caption"))
                               return v.errors = [
                                 {
                                   instancePath: t + "/progress",
                                   schemaPath: "#/oneOf/22/properties/progress/additionalProperties",
                                   keyword: "additionalProperties",
                                   params: {
-                                    additionalProperty: k
+                                    additionalProperty: P
                                   },
                                   message: "must NOT have additional properties"
                                 }
                               ], !1;
                           if (re === n) {
                             if (f.weight !== void 0) {
-                              let k = f.weight;
+                              let P = f.weight;
                               const ne = n;
-                              if (!(typeof k == "number" && isFinite(
-                                k
+                              if (!(typeof P == "number" && isFinite(
+                                P
                               )))
                                 return v.errors = [
                                   {
@@ -25155,7 +25155,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                               var J = !0;
                             if (J)
                               if (f.caption !== void 0) {
-                                const k = n;
+                                const P = n;
                                 if (typeof f.caption != "string")
                                   return v.errors = [
                                     {
@@ -25168,7 +25168,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                       message: "must be string"
                                     }
                                   ], !1;
-                                var J = k === n;
+                                var J = P === n;
                               } else
                                 var J = !0;
                           }
@@ -25290,25 +25290,25 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                       if (n === N)
                         if (f && typeof f == "object" && !Array.isArray(f)) {
                           const re = n;
-                          for (const k in f)
-                            if (!(k === "weight" || k === "caption"))
+                          for (const P in f)
+                            if (!(P === "weight" || P === "caption"))
                               return v.errors = [
                                 {
                                   instancePath: t + "/progress",
                                   schemaPath: "#/oneOf/23/properties/progress/additionalProperties",
                                   keyword: "additionalProperties",
                                   params: {
-                                    additionalProperty: k
+                                    additionalProperty: P
                                   },
                                   message: "must NOT have additional properties"
                                 }
                               ], !1;
                           if (re === n) {
                             if (f.weight !== void 0) {
-                              let k = f.weight;
+                              let P = f.weight;
                               const ne = n;
-                              if (!(typeof k == "number" && isFinite(
-                                k
+                              if (!(typeof P == "number" && isFinite(
+                                P
                               )))
                                 return v.errors = [
                                   {
@@ -25326,7 +25326,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                               var we = !0;
                             if (we)
                               if (f.caption !== void 0) {
-                                const k = n;
+                                const P = n;
                                 if (typeof f.caption != "string")
                                   return v.errors = [
                                     {
@@ -25339,7 +25339,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                       message: "must be string"
                                     }
                                   ], !1;
-                                var we = k === n;
+                                var we = P === n;
                               } else
                                 var we = !0;
                           }
@@ -25495,25 +25495,25 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                       if (n === N)
                         if (f && typeof f == "object" && !Array.isArray(f)) {
                           const re = n;
-                          for (const k in f)
-                            if (!(k === "weight" || k === "caption"))
+                          for (const P in f)
+                            if (!(P === "weight" || P === "caption"))
                               return v.errors = [
                                 {
                                   instancePath: t + "/progress",
                                   schemaPath: "#/oneOf/24/properties/progress/additionalProperties",
                                   keyword: "additionalProperties",
                                   params: {
-                                    additionalProperty: k
+                                    additionalProperty: P
                                   },
                                   message: "must NOT have additional properties"
                                 }
                               ], !1;
                           if (re === n) {
                             if (f.weight !== void 0) {
-                              let k = f.weight;
+                              let P = f.weight;
                               const ne = n;
-                              if (!(typeof k == "number" && isFinite(
-                                k
+                              if (!(typeof P == "number" && isFinite(
+                                P
                               )))
                                 return v.errors = [
                                   {
@@ -25531,7 +25531,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                               var De = !0;
                             if (De)
                               if (f.caption !== void 0) {
-                                const k = n;
+                                const P = n;
                                 if (typeof f.caption != "string")
                                   return v.errors = [
                                     {
@@ -25544,7 +25544,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                       message: "must be string"
                                     }
                                   ], !1;
-                                var De = k === n;
+                                var De = P === n;
                               } else
                                 var De = !0;
                           }
@@ -25688,25 +25688,25 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                       if (n === N)
                         if (f && typeof f == "object" && !Array.isArray(f)) {
                           const re = n;
-                          for (const k in f)
-                            if (!(k === "weight" || k === "caption"))
+                          for (const P in f)
+                            if (!(P === "weight" || P === "caption"))
                               return v.errors = [
                                 {
                                   instancePath: t + "/progress",
                                   schemaPath: "#/oneOf/25/properties/progress/additionalProperties",
                                   keyword: "additionalProperties",
                                   params: {
-                                    additionalProperty: k
+                                    additionalProperty: P
                                   },
                                   message: "must NOT have additional properties"
                                 }
                               ], !1;
                           if (re === n) {
                             if (f.weight !== void 0) {
-                              let k = f.weight;
+                              let P = f.weight;
                               const ne = n;
-                              if (!(typeof k == "number" && isFinite(
-                                k
+                              if (!(typeof P == "number" && isFinite(
+                                P
                               )))
                                 return v.errors = [
                                   {
@@ -25724,7 +25724,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                               var yt = !0;
                             if (yt)
                               if (f.caption !== void 0) {
-                                const k = n;
+                                const P = n;
                                 if (typeof f.caption != "string")
                                   return v.errors = [
                                     {
@@ -25737,7 +25737,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                       message: "must be string"
                                     }
                                   ], !1;
-                                var yt = k === n;
+                                var yt = P === n;
                               } else
                                 var yt = !0;
                           }
@@ -25809,7 +25809,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                           if (e.data !== void 0) {
                             let f = e.data;
                             const N = n, re = n;
-                            let k = !1;
+                            let P = !1;
                             const ne = n;
                             _e(
                               f,
@@ -25823,7 +25823,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                               _e.errors
                             ), n = s.length);
                             var Ft = ne === n;
-                            if (k = k || Ft, !k) {
+                            if (P = P || Ft, !P) {
                               const ke = n;
                               if (typeof f != "string") {
                                 const ze = {
@@ -25842,7 +25842,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                 ), n++;
                               }
                               var Ft = ke === n;
-                              if (k = k || Ft, !k) {
+                              if (P = P || Ft, !P) {
                                 const ze = n;
                                 if (n === ze)
                                   if (f && typeof f == "object" && !Array.isArray(
@@ -26105,10 +26105,10 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                     ), n++;
                                   }
                                 var Ft = ze === n;
-                                k = k || Ft;
+                                P = P || Ft;
                               }
                             }
-                            if (k)
+                            if (P)
                               n = re, s !== null && (re ? s.length = re : s = null);
                             else {
                               const ke = {
@@ -26179,25 +26179,25 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                       if (n === N)
                         if (f && typeof f == "object" && !Array.isArray(f)) {
                           const re = n;
-                          for (const k in f)
-                            if (!(k === "weight" || k === "caption"))
+                          for (const P in f)
+                            if (!(P === "weight" || P === "caption"))
                               return v.errors = [
                                 {
                                   instancePath: t + "/progress",
                                   schemaPath: "#/oneOf/26/properties/progress/additionalProperties",
                                   keyword: "additionalProperties",
                                   params: {
-                                    additionalProperty: k
+                                    additionalProperty: P
                                   },
                                   message: "must NOT have additional properties"
                                 }
                               ], !1;
                           if (re === n) {
                             if (f.weight !== void 0) {
-                              let k = f.weight;
+                              let P = f.weight;
                               const ne = n;
-                              if (!(typeof k == "number" && isFinite(
-                                k
+                              if (!(typeof P == "number" && isFinite(
+                                P
                               )))
                                 return v.errors = [
                                   {
@@ -26215,7 +26215,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                               var Hr = !0;
                             if (Hr)
                               if (f.caption !== void 0) {
-                                const k = n;
+                                const P = n;
                                 if (typeof f.caption != "string")
                                   return v.errors = [
                                     {
@@ -26228,7 +26228,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                       message: "must be string"
                                     }
                                   ], !1;
-                                var Hr = k === n;
+                                var Hr = P === n;
                               } else
                                 var Hr = !0;
                           }
@@ -26365,25 +26365,25 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                       if (n === N)
                         if (f && typeof f == "object" && !Array.isArray(f)) {
                           const re = n;
-                          for (const k in f)
-                            if (!(k === "weight" || k === "caption"))
+                          for (const P in f)
+                            if (!(P === "weight" || P === "caption"))
                               return v.errors = [
                                 {
                                   instancePath: t + "/progress",
                                   schemaPath: "#/oneOf/27/properties/progress/additionalProperties",
                                   keyword: "additionalProperties",
                                   params: {
-                                    additionalProperty: k
+                                    additionalProperty: P
                                   },
                                   message: "must NOT have additional properties"
                                 }
                               ], !1;
                           if (re === n) {
                             if (f.weight !== void 0) {
-                              let k = f.weight;
+                              let P = f.weight;
                               const ne = n;
-                              if (!(typeof k == "number" && isFinite(
-                                k
+                              if (!(typeof P == "number" && isFinite(
+                                P
                               )))
                                 return v.errors = [
                                   {
@@ -26401,7 +26401,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                               var K = !0;
                             if (K)
                               if (f.caption !== void 0) {
-                                const k = n;
+                                const P = n;
                                 if (typeof f.caption != "string")
                                   return v.errors = [
                                     {
@@ -26414,7 +26414,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                       message: "must be string"
                                     }
                                   ], !1;
-                                var K = k === n;
+                                var K = P === n;
                               } else
                                 var K = !0;
                           }
@@ -26468,7 +26468,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                         if (e.command !== void 0) {
                           let f = e.command;
                           const N = n, re = n;
-                          let k = !1;
+                          let P = !1;
                           const ne = n;
                           if (typeof f != "string") {
                             const ke = {
@@ -26483,7 +26483,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                             s === null ? s = [ke] : s.push(ke), n++;
                           }
                           var Q = ne === n;
-                          if (k = k || Q, !k) {
+                          if (P = P || Q, !P) {
                             const ke = n;
                             if (n === ke)
                               if (Array.isArray(
@@ -26530,9 +26530,9 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                 ), n++;
                               }
                             var Q = ke === n;
-                            k = k || Q;
+                            P = P || Q;
                           }
-                          if (k)
+                          if (P)
                             n = re, s !== null && (re ? s.length = re : s = null);
                           else {
                             const ke = {
@@ -26617,25 +26617,25 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                       if (n === N)
                         if (f && typeof f == "object" && !Array.isArray(f)) {
                           const re = n;
-                          for (const k in f)
-                            if (!(k === "weight" || k === "caption"))
+                          for (const P in f)
+                            if (!(P === "weight" || P === "caption"))
                               return v.errors = [
                                 {
                                   instancePath: t + "/progress",
                                   schemaPath: "#/oneOf/28/properties/progress/additionalProperties",
                                   keyword: "additionalProperties",
                                   params: {
-                                    additionalProperty: k
+                                    additionalProperty: P
                                   },
                                   message: "must NOT have additional properties"
                                 }
                               ], !1;
                           if (re === n) {
                             if (f.weight !== void 0) {
-                              let k = f.weight;
+                              let P = f.weight;
                               const ne = n;
-                              if (!(typeof k == "number" && isFinite(
-                                k
+                              if (!(typeof P == "number" && isFinite(
+                                P
                               )))
                                 return v.errors = [
                                   {
@@ -26653,7 +26653,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                               var le = !0;
                             if (le)
                               if (f.caption !== void 0) {
-                                const k = n;
+                                const P = n;
                                 if (typeof f.caption != "string")
                                   return v.errors = [
                                     {
@@ -26666,7 +26666,7 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                       message: "must be string"
                                     }
                                   ], !1;
-                                var le = k === n;
+                                var le = P === n;
                               } else
                                 var le = !0;
                           }
@@ -27530,7 +27530,7 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                         if (o) {
                           if (e.login !== void 0) {
                             let b = e.login;
-                            const F = n, P = n;
+                            const F = n, k = n;
                             let S = !1;
                             const j = n;
                             if (typeof b != "boolean") {
@@ -27611,10 +27611,10 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                                             te
                                           ), n++;
                                         }
-                                        var I = G === n;
+                                        var L = G === n;
                                       } else
-                                        var I = !0;
-                                      if (I)
+                                        var L = !0;
+                                      if (L)
                                         if (b.password !== void 0) {
                                           const G = n;
                                           if (typeof b.password != "string") {
@@ -27633,9 +27633,9 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                                               z
                                             ), n++;
                                           }
-                                          var I = G === n;
+                                          var L = G === n;
                                         } else
-                                          var I = !0;
+                                          var L = !0;
                                     }
                                   }
                                 } else {
@@ -27658,7 +27658,7 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                               S = S || E;
                             }
                             if (S)
-                              n = P, s !== null && (P ? s.length = P : s = null);
+                              n = k, s !== null && (k ? s.length = k : s = null);
                             else {
                               const D = {
                                 instancePath: t + "/login",
@@ -27702,8 +27702,8 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                                     ) || (s = s === null ? v.errors : s.concat(
                                       v.errors
                                     ), n = s.length);
-                                    var L = Y === n;
-                                    if (B = B || L, !B) {
+                                    var I = Y === n;
+                                    if (B = B || I, !B) {
                                       const te = n;
                                       if (typeof R != "string") {
                                         const X = {
@@ -27721,8 +27721,8 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                                           X
                                         ), n++;
                                       }
-                                      var L = te === n;
-                                      if (B = B || L, !B) {
+                                      var I = te === n;
+                                      if (B = B || I, !B) {
                                         const X = n, ee = {
                                           instancePath: t + "/steps/" + j,
                                           schemaPath: "#/properties/steps/items/anyOf/2/not",
@@ -27735,8 +27735,8 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                                         ] : s.push(
                                           ee
                                         ), n++;
-                                        var L = X === n;
-                                        if (B = B || L, !B) {
+                                        var I = X === n;
+                                        if (B = B || I, !B) {
                                           const fe = n;
                                           if (typeof R != "boolean") {
                                             const ie = {
@@ -27770,8 +27770,8 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                                               ie
                                             ), n++;
                                           }
-                                          var L = fe === n;
-                                          if (B = B || L, !B) {
+                                          var I = fe === n;
+                                          if (B = B || I, !B) {
                                             const ie = n;
                                             if (R !== null) {
                                               const Te = {
@@ -27789,8 +27789,8 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                                                 Te
                                               ), n++;
                                             }
-                                            var L = ie === n;
-                                            B = B || L;
+                                            var I = ie === n;
+                                            B = B || I;
                                           }
                                         }
                                       }
@@ -27927,17 +27927,17 @@ function yv(e, {
   gitAdditionalHeadersCallback: o,
   additionalSteps: l
 } = {}) {
-  var g, w, _, T, E, I, $, L, C, b, F;
+  var g, w, _, T, E, L, $, I, C, b, F;
   e = structuredClone(e), e = {
     ...e,
     steps: (e.steps || []).filter(_v).filter(vv)
   }, e.steps = [...e.steps || [], ...l || []], ((g = e.preferredVersions) == null ? void 0 : g.wp) === !1 && Sv(e);
-  for (const P of e.steps)
-    !P || typeof P != "object" || (P.step === "importFile" ? (P.step = "importWxr", Oe.warn(
+  for (const k of e.steps)
+    !k || typeof k != "object" || (k.step === "importFile" ? (k.step = "importWxr", Oe.warn(
       'The "importFile" step is deprecated. Use "importWxr" instead.'
-    )) : (P == null ? void 0 : P.step) === "installPlugin" && "pluginZipFile" in P ? (P.pluginData = P.pluginZipFile, Oe.warn(
+    )) : (k == null ? void 0 : k.step) === "installPlugin" && "pluginZipFile" in k ? (k.pluginData = k.pluginZipFile, Oe.warn(
       'The "pluginZipFile" option of the "installPlugin" step is deprecated. Use "pluginData" instead.'
-    )) : (P == null ? void 0 : P.step) === "installTheme" && "themeZipFile" in P && (P.themeData = P.themeZipFile, Oe.warn(
+    )) : (k == null ? void 0 : k.step) === "installTheme" && "themeZipFile" in k && (k.themeData = k.themeZipFile, Oe.warn(
       'The "themeZipFile" option of the "installTheme" step is deprecated. Use "themeData" instead.'
     )));
   if (e.constants && e.steps.unshift({
@@ -27947,7 +27947,7 @@ function yv(e, {
     step: "setSiteOptions",
     options: e.siteOptions
   }), e.plugins) {
-    const P = e.plugins.map((S) => typeof S == "string" ? Ov(S) ? {
+    const k = e.plugins.map((S) => typeof S == "string" ? Ov(S) ? {
       resource: "zip",
       inner: {
         resource: "git:directory",
@@ -27964,29 +27964,29 @@ function yv(e, {
       step: "installPlugin",
       pluginData: S
     }));
-    e.steps.unshift(...P);
+    e.steps.unshift(...k);
   }
   e.login && e.steps.unshift({
     step: "login",
     ...e.login === !0 ? { username: "admin" } : e.login
   });
   const p = ((w = e.steps) == null ? void 0 : w.findIndex(
-    (P) => typeof P == "object" && (P == null ? void 0 : P.step) && ["wp-cli", "enableMultisite"].includes(P.step)
+    (k) => typeof k == "object" && (k == null ? void 0 : k.step) && ["wp-cli", "enableMultisite"].includes(k.step)
   )) ?? -1;
   if ((_ = e == null ? void 0 : e.extraLibraries) != null && _.includes("wp-cli") || p !== -1) {
-    const P = {
+    const k = {
       step: "writeFile",
       data: I_,
       path: Mo
     };
-    p === -1 ? (T = e.steps) == null || T.push(P) : (E = e.steps) == null || E.splice(
+    p === -1 ? (T = e.steps) == null || T.push(k) : (E = e.steps) == null || E.splice(
       p,
       0,
-      P
+      k
     );
   }
-  const c = (I = e.steps) == null ? void 0 : I.findIndex(
-    (P) => typeof P == "object" && (P == null ? void 0 : P.step) === "importWxr"
+  const c = (L = e.steps) == null ? void 0 : L.findIndex(
+    (k) => typeof k == "object" && (k == null ? void 0 : k.step) === "importWxr"
   );
   c !== void 0 && c > -1 && (($ = e.steps) == null || $.splice(c, 0, {
     step: "installPlugin",
@@ -27997,27 +27997,27 @@ function yv(e, {
   }));
   const d = wv(e);
   if (!d.valid) {
-    const { errors: P } = d, S = gv(e, P);
+    const { errors: k } = d, S = gv(e, k);
     throw new yd(
       `Invalid Blueprint: The Blueprint does not conform to the schema.
 
-Found ${P.length} validation error(s):
+Found ${k.length} validation error(s):
 
 ${S}
 
 Please review your Blueprint and fix these issues. Learn more about the Blueprint format: https://wordpress.github.io/wordpress-playground/blueprints/data-format`,
-      P
+      k
     );
   }
   a(e);
   const m = e.steps || [], y = m.reduce(
-    (P, S) => {
+    (k, S) => {
       var j;
-      return P + (((j = S.progress) == null ? void 0 : j.weight) || 1);
+      return k + (((j = S.progress) == null ? void 0 : j.weight) || 1);
     },
     0
   ), O = m.map(
-    (P) => xv(P, {
+    (k) => xv(k, {
       semaphore: r,
       rootProgressTracker: t,
       totalProgressWeight: y,
@@ -28029,7 +28029,7 @@ Please review your Blueprint and fix these issues. Learn more about the Blueprin
   return {
     versions: {
       php: bv(
-        (L = e.preferredVersions) == null ? void 0 : L.php,
+        (I = e.preferredVersions) == null ? void 0 : I.php,
         rh,
         eh
       ),
@@ -28042,15 +28042,15 @@ Please review your Blueprint and fix these issues. Learn more about the Blueprin
       networking: ((F = e.features) == null ? void 0 : F.networking) ?? !0
     },
     extraLibraries: e.extraLibraries || [],
-    run: async (P) => {
+    run: async (k) => {
       try {
         for (const { resources: S } of O)
           for (const j of S)
-            j.setPlayground(P), j.isAsync && j.resolve().catch(() => {
+            j.setPlayground(k), j.isAsync && j.resolve().catch(() => {
             });
         for (const [S, { run: j, step: R }] of Object.entries(O))
           try {
-            const D = await j(P);
+            const D = await j(k);
             i(D, R);
           } catch (D) {
             const V = Number(S) + 1;
@@ -28062,8 +28062,8 @@ Please review your Blueprint and fix these issues. Learn more about the Blueprin
           }
       } finally {
         try {
-          const S = await P.pathToInternalUrl(e.landingPage || "/");
-          await P.goTo(
+          const S = await k.pathToInternalUrl(e.landingPage || "/");
+          await k.goTo(
             "/index.php?playground-redirection-handler&next=" + encodeURIComponent(S)
           );
         } catch {
@@ -28526,7 +28526,7 @@ class Dv {
     this.options = t;
   }
   async bootPlayground(t, r) {
-    var S;
+    var j;
     const {
       onBlueprintValidated: i,
       onBlueprintStepCompleted: a,
@@ -28546,15 +28546,15 @@ class Dv {
       t.ownerDocument.defaultView
     );
     await E.isConnected(), r.pipe(E);
-    const I = await Iv(T);
-    await E.onDownloadProgress(_.loadingListener);
-    const $ = !zo(T) && ((S = T.preferredVersions) == null ? void 0 : S.wp) === !1;
-    if ((c === !0 || d === !0) && $)
+    const L = await Iv(T), $ = L.intl ? ["intl"] : [];
+    $.push(...this.options.extensions || []), await E.onDownloadProgress(_.loadingListener);
+    const I = !zo(T) && ((j = T.preferredVersions) == null ? void 0 : j.wp) === !1;
+    if ((c === !0 || d === !0) && I)
       throw new Error(
         "Conflicting options: WordPress install or boot was requested, but the Blueprint sets `preferredVersions.wp: false`. Pick one."
       );
-    const L = d ?? !$, C = c ?? L;
-    if (C && !L)
+    const C = d ?? !I, b = c ?? C;
+    if (b && !C)
       throw new Error(
         "Conflicting options: WordPress installation was requested, but WordPress boot was disabled. Pick one."
       );
@@ -28562,28 +28562,28 @@ class Dv {
       mounts: o,
       sapiName: l,
       scope: p ?? Math.random().toFixed(16),
-      shouldInstallWordPress: C,
-      shouldBootWordPress: L,
+      shouldInstallWordPress: b,
+      shouldBootWordPress: C,
       wordpressInstallMode: y,
-      phpVersion: I.phpVersion,
-      wpVersion: I.wpVersion,
-      extensions: I.intl ? ["intl"] : [],
-      withNetworking: I.networking,
+      phpVersion: L.phpVersion,
+      wpVersion: L.wpVersion,
+      extensions: $,
+      withNetworking: L.networking,
       corsProxyUrl: s,
       sqliteDriverVersion: m,
       pathAliases: g
     }), await E.isReady(), _.finish(), Lp(Oe, E), O == null || O(E), (await Dn.create(T)).getVersion() === 1) {
-      const j = await gd(T, {
+      const R = await gd(T, {
         progress: w,
         onStepCompleted: a,
         onBlueprintValidated: i,
         corsProxy: s,
         gitAdditionalHeadersCallback: n
       });
-      await Pv(j, E);
+      await Pv(R, E);
     }
-    const F = parseFloat(I.wpVersion), P = Number.isFinite(F) && F < 5.1;
-    return I.networking && !P && C && await E.prefetchUpdateChecks(), E;
+    const k = parseFloat(L.wpVersion), S = Number.isFinite(k) && k < 5.1;
+    return L.networking && !S && b && await E.prefetchUpdateChecks(), E;
   }
 }
 class Uv {
@@ -28632,6 +28632,7 @@ class Uv {
       sapiName: o,
       scope: l ?? Math.random().toFixed(16),
       corsProxyUrl: s,
+      extensions: this.options.extensions,
       experimentalBlueprintsV2Runner: !0,
       // Pass the declaration directly – the worker runs the V2 runner.
       blueprint: i,