@wp-playground/client 3.1.40 → 3.1.42

package/index.js

@@ -934,7 +934,7 @@ const Bd = (e, t = {}) => {
     const y = m ? d.slice(0, -2) : d;
     if (y === "__proto__")
       continue;
-    const T = c[3] ? Ii(c[4]) : !0, g = T === "true" || T === "false" || T === "null" ? JSON.parse(T) : T;
+    const S = c[3] ? Ii(c[4]) : !0, g = S === "true" || S === "false" || S === "null" ? JSON.parse(S) : S;
     m && (Li.call(i, y) ? Array.isArray(i[y]) || (i[y] = [i[y]]) : i[y] = []), Array.isArray(i[y]) ? i[y].push(g) : i[y] = g;
   }
   const l = [];
@@ -1283,7 +1283,7 @@ function go(e, t = globalThis, r = ["*"], i) {
     }, p = (s.data.argumentList || []).map(Er);
     let c;
     try {
-      const d = l.slice(0, -1).reduce((y, T) => y[T], e), m = l.reduce((y, T) => y[T], e);
+      const d = l.slice(0, -1).reduce((y, S) => y[S], e), m = l.reduce((y, S) => y[S], e);
       switch (o) {
         case xt.GET:
           c = m;
@@ -1304,8 +1304,8 @@ function go(e, t = globalThis, r = ["*"], i) {
           break;
         case xt.ENDPOINT:
           {
-            const { port1: y, port2: T } = new MessageChannel();
-            go(e, T), c = hh(y, [y]);
+            const { port1: y, port2: S } = new MessageChannel();
+            go(e, S), c = hh(y, [y]);
           }
           break;
         case xt.RELEASE:
@@ -2558,30 +2558,30 @@ var tc = {};
     }
     var i = r();
     function a(b) {
-      var F = 0, P = 0, S = 0, I = typeof Int32Array < "u" ? new Int32Array(4096) : new Array(4096);
-      for (S = 0; S != 256; ++S) I[S] = b[S];
-      for (S = 0; S != 256; ++S)
-        for (P = b[S], F = 256 + S; F < 4096; F += 256) P = I[F] = P >>> 8 ^ b[P & 255];
+      var F = 0, P = 0, T = 0, j = typeof Int32Array < "u" ? new Int32Array(4096) : new Array(4096);
+      for (T = 0; T != 256; ++T) j[T] = b[T];
+      for (T = 0; T != 256; ++T)
+        for (P = b[T], F = 256 + T; F < 4096; F += 256) P = j[F] = P >>> 8 ^ b[P & 255];
       var R = [];
-      for (S = 1; S != 16; ++S) R[S - 1] = typeof Int32Array < "u" ? I.subarray(S * 256, S * 256 + 256) : I.slice(S * 256, S * 256 + 256);
+      for (T = 1; T != 16; ++T) R[T - 1] = typeof Int32Array < "u" ? j.subarray(T * 256, T * 256 + 256) : j.slice(T * 256, T * 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], T = s[8], g = s[9], w = s[10], _ = s[11], O = s[12], E = s[13], C = 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], S = s[8], g = s[9], w = s[10], _ = s[11], O = s[12], E = s[13], L = s[14];
     function $(b, F) {
-      for (var P = F ^ -1, S = 0, I = b.length; S < I; ) P = P >>> 8 ^ i[(P ^ b.charCodeAt(S++)) & 255];
+      for (var P = F ^ -1, T = 0, j = b.length; T < j; ) P = P >>> 8 ^ i[(P ^ b.charCodeAt(T++)) & 255];
       return ~P;
     }
-    function L(b, F) {
-      for (var P = F ^ -1, S = b.length - 15, I = 0; I < S; ) P = C[b[I++] ^ P & 255] ^ E[b[I++] ^ P >> 8 & 255] ^ O[b[I++] ^ P >> 16 & 255] ^ _[b[I++] ^ P >>> 24] ^ w[b[I++]] ^ g[b[I++]] ^ T[b[I++]] ^ y[b[I++]] ^ m[b[I++]] ^ d[b[I++]] ^ c[b[I++]] ^ p[b[I++]] ^ l[b[I++]] ^ o[b[I++]] ^ n[b[I++]] ^ i[b[I++]];
-      for (S += 15; I < S; ) P = P >>> 8 ^ i[(P ^ b[I++]) & 255];
+    function I(b, F) {
+      for (var P = F ^ -1, T = b.length - 15, j = 0; j < T; ) P = L[b[j++] ^ P & 255] ^ E[b[j++] ^ P >> 8 & 255] ^ O[b[j++] ^ P >> 16 & 255] ^ _[b[j++] ^ P >>> 24] ^ w[b[j++]] ^ g[b[j++]] ^ S[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 (T += 15; j < T; ) P = P >>> 8 ^ i[(P ^ b[j++]) & 255];
       return ~P;
     }
-    function j(b, F) {
-      for (var P = F ^ -1, S = 0, I = b.length, R = 0, D = 0; S < I; )
-        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]);
+    function C(b, F) {
+      for (var P = F ^ -1, T = 0, j = b.length, R = 0, D = 0; T < j; )
+        R = b.charCodeAt(T++), 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(T++) & 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;
     }
-    t.table = i, t.bstr = $, t.buf = L, t.str = j;
+    t.table = i, t.bstr = $, t.buf = I, t.str = C;
   });
 })(tc);
 const Zh = /* @__PURE__ */ ho(tc);
@@ -2817,11 +2817,11 @@ function am(e) {
   e.bi_valid === 16 ? (Wn(e, e.bi_buf), e.bi_buf = 0, e.bi_valid = 0) : e.bi_valid >= 8 && (e.pending_buf[e.pending++] = e.bi_buf & 255, e.bi_buf >>= 8, e.bi_valid -= 8);
 }
 function om(e, t) {
-  var r = t.dyn_tree, i = t.max_code, a = t.stat_desc.static_tree, s = t.stat_desc.has_stree, n = t.stat_desc.extra_bits, o = t.stat_desc.extra_base, l = t.stat_desc.max_length, p, c, d, m, y, T, g = 0;
+  var r = t.dyn_tree, i = t.max_code, a = t.stat_desc.static_tree, s = t.stat_desc.has_stree, n = t.stat_desc.extra_bits, o = t.stat_desc.extra_base, l = t.stat_desc.max_length, p, c, d, m, y, S, g = 0;
   for (m = 0; m <= Or; m++)
     e.bl_count[m] = 0;
   for (r[e.heap[e.heap_max] * 2 + 1] = 0, p = e.heap_max + 1; p < nc; p++)
-    c = e.heap[p], m = r[r[c * 2 + 1] * 2 + 1] + 1, m > l && (m = l, g++), r[c * 2 + 1] = m, !(c > i) && (e.bl_count[m]++, y = 0, c >= o && (y = n[c - o]), T = r[c * 2], e.opt_len += T * (m + y), s && (e.static_len += T * (a[c * 2 + 1] + y)));
+    c = e.heap[p], m = r[r[c * 2 + 1] * 2 + 1] + 1, m > l && (m = l, g++), r[c * 2 + 1] = m, !(c > i) && (e.bl_count[m]++, y = 0, c >= o && (y = n[c - o]), S = r[c * 2], e.opt_len += S * (m + y), s && (e.static_len += S * (a[c * 2 + 1] + y)));
   if (g !== 0) {
     do {
       for (m = l - 1; e.bl_count[m] === 0; )
@@ -3078,10 +3078,10 @@ function Mm(e, t, r, i) {
   return a > i && (a = i), a === 0 ? 0 : (e.avail_in -= a, ot.arraySet(t, e.input, e.next_in, a, r), e.state.wrap === 1 ? e.adler = bc(e.adler, t, a, r) : e.state.wrap === 2 && (e.adler = ur(e.adler, t, a, r)), e.next_in += a, e.total_in += a, a);
 }
 function _c(e, t) {
-  var r = e.max_chain_length, i = e.strstart, a, s, n = e.prev_length, o = e.nice_match, l = e.strstart > e.w_size - Dt ? e.strstart - (e.w_size - Dt) : 0, p = e.window, c = e.w_mask, d = e.prev, m = e.strstart + br, y = p[i + n - 1], T = p[i + n];
+  var r = e.max_chain_length, i = e.strstart, a, s, n = e.prev_length, o = e.nice_match, l = e.strstart > e.w_size - Dt ? e.strstart - (e.w_size - Dt) : 0, p = e.window, c = e.w_mask, d = e.prev, m = e.strstart + br, y = p[i + n - 1], S = p[i + n];
   e.prev_length >= e.good_match && (r >>= 2), o > e.lookahead && (o = e.lookahead);
   do
-    if (a = t, !(p[a + n] !== T || p[a + n - 1] !== y || p[a] !== p[i] || p[++a] !== p[i + 1])) {
+    if (a = t, !(p[a + n] !== S || p[a + n - 1] !== y || p[a] !== p[i] || p[++a] !== p[i + 1])) {
       i += 2, a++;
       do
         ;
@@ -3089,7 +3089,7 @@ function _c(e, t) {
       if (s = br - (m - i), i = m - br, s > n) {
         if (e.match_start = t, n = s, s >= o)
           break;
-        y = p[i + n - 1], T = p[i + n];
+        y = p[i + n - 1], S = p[i + n];
       }
     }
   while ((t = d[t & c]) > l && --r !== 0);
@@ -3493,73 +3493,73 @@ ss.deflate = To;
 ss.deflateRaw = iy;
 ss.gzip = ay;
 var os = {}, Ut = {}, _s = 30, oy = 12, ly = function(t, r) {
-  var i, a, s, n, o, l, p, c, d, m, y, T, g, w, _, O, E, C, $, L, j, 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, T = i.hold, g = i.bits, w = i.lencode, _ = i.distcode, O = (1 << i.lenbits) - 1, E = (1 << i.distbits) - 1;
+  var i, a, s, n, o, l, p, c, d, m, y, S, g, w, _, O, E, L, $, I, C, b, F, P, T;
+  i = t.state, a = t.next_in, P = t.input, s = a + (t.avail_in - 5), n = t.next_out, T = 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, S = i.hold, g = i.bits, w = i.lencode, _ = i.distcode, O = (1 << i.lenbits) - 1, E = (1 << i.distbits) - 1;
   e:
     do {
-      g < 15 && (T += P[a++] << g, g += 8, T += P[a++] << g, g += 8), C = w[T & O];
+      g < 15 && (S += P[a++] << g, g += 8, S += P[a++] << g, g += 8), L = w[S & O];
       t:
         for (; ; ) {
-          if ($ = C >>> 24, T >>>= $, g -= $, $ = C >>> 16 & 255, $ === 0)
-            S[n++] = C & 65535;
+          if ($ = L >>> 24, S >>>= $, g -= $, $ = L >>> 16 & 255, $ === 0)
+            T[n++] = L & 65535;
           else if ($ & 16) {
-            L = C & 65535, $ &= 15, $ && (g < $ && (T += P[a++] << g, g += 8), L += T & (1 << $) - 1, T >>>= $, g -= $), g < 15 && (T += P[a++] << g, g += 8, T += P[a++] << g, g += 8), C = _[T & E];
+            I = L & 65535, $ &= 15, $ && (g < $ && (S += P[a++] << g, g += 8), I += S & (1 << $) - 1, S >>>= $, g -= $), g < 15 && (S += P[a++] << g, g += 8, S += P[a++] << g, g += 8), L = _[S & E];
             r:
               for (; ; ) {
-                if ($ = C >>> 24, T >>>= $, g -= $, $ = C >>> 16 & 255, $ & 16) {
-                  if (j = C & 65535, $ &= 15, g < $ && (T += P[a++] << g, g += 8, g < $ && (T += P[a++] << g, g += 8)), j += T & (1 << $) - 1, j > p) {
+                if ($ = L >>> 24, S >>>= $, g -= $, $ = L >>> 16 & 255, $ & 16) {
+                  if (C = L & 65535, $ &= 15, g < $ && (S += P[a++] << g, g += 8, g < $ && (S += P[a++] << g, g += 8)), C += S & (1 << $) - 1, C > p) {
                     t.msg = "invalid distance too far back", i.mode = _s;
                     break e;
                   }
-                  if (T >>>= $, g -= $, $ = n - o, j > $) {
-                    if ($ = j - $, $ > d && i.sane) {
+                  if (S >>>= $, g -= $, $ = n - o, C > $) {
+                    if ($ = C - $, $ > d && i.sane) {
                       t.msg = "invalid distance too far back", i.mode = _s;
                       break e;
                     }
                     if (b = 0, F = y, m === 0) {
-                      if (b += c - $, $ < L) {
-                        L -= $;
+                      if (b += c - $, $ < I) {
+                        I -= $;
                         do
-                          S[n++] = y[b++];
+                          T[n++] = y[b++];
                         while (--$);
-                        b = n - j, F = S;
+                        b = n - C, F = T;
                       }
                     } else if (m < $) {
-                      if (b += c + m - $, $ -= m, $ < L) {
-                        L -= $;
+                      if (b += c + m - $, $ -= m, $ < I) {
+                        I -= $;
                         do
-                          S[n++] = y[b++];
+                          T[n++] = y[b++];
                         while (--$);
-                        if (b = 0, m < L) {
-                          $ = m, L -= $;
+                        if (b = 0, m < I) {
+                          $ = m, I -= $;
                           do
-                            S[n++] = y[b++];
+                            T[n++] = y[b++];
                           while (--$);
-                          b = n - j, F = S;
+                          b = n - C, F = T;
                         }
                       }
-                    } else if (b += m - $, $ < L) {
-                      L -= $;
+                    } else if (b += m - $, $ < I) {
+                      I -= $;
                       do
-                        S[n++] = y[b++];
+                        T[n++] = y[b++];
                       while (--$);
-                      b = n - j, F = S;
+                      b = n - C, F = T;
                     }
-                    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; )
+                      T[n++] = F[b++], T[n++] = F[b++], T[n++] = F[b++], I -= 3;
+                    I && (T[n++] = F[b++], I > 1 && (T[n++] = F[b++]));
                   } else {
-                    b = n - j;
+                    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++]));
+                      T[n++] = T[b++], T[n++] = T[b++], T[n++] = T[b++], I -= 3;
+                    while (I > 2);
+                    I && (T[n++] = T[b++], I > 1 && (T[n++] = T[b++]));
                   }
                 } else if ($ & 64) {
                   t.msg = "invalid distance code", i.mode = _s;
                   break e;
                 } else {
-                  C = _[(C & 65535) + (T & (1 << $) - 1)];
+                  L = _[(L & 65535) + (S & (1 << $) - 1)];
                   continue r;
                 }
                 break;
@@ -3573,13 +3573,13 @@ var os = {}, Ut = {}, _s = 30, oy = 12, ly = function(t, r) {
               break e;
             }
           else {
-            C = w[(C & 65535) + (T & (1 << $) - 1)];
+            L = w[(L & 65535) + (S & (1 << $) - 1)];
             continue t;
           }
           break;
         }
     } while (a < s && n < l);
-  L = g >> 3, a -= L, g -= L << 3, T &= (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 = T, i.bits = g;
+  I = g >> 3, a -= I, g -= I << 3, S &= (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 = S, i.bits = g;
 }, vl = ar, Vr = 15, xl = 852, kl = 592, Pl = 0, Zi = 1, El = 2, fy = [
   /* Length codes 257..285 base */
   3,
@@ -3715,49 +3715,49 @@ var os = {}, Ut = {}, _s = 30, oy = 12, ly = function(t, r) {
   64,
   64
 ], dy = function(t, r, i, a, s, n, o, l) {
-  var p = l.bits, c = 0, d = 0, m = 0, y = 0, T = 0, g = 0, w = 0, _ = 0, O = 0, E = 0, C, $, L, j, b, F = null, P = 0, S, I = new vl.Buf16(Vr + 1), R = new vl.Buf16(Vr + 1), D = null, V = 0, B, Y, G;
+  var p = l.bits, c = 0, d = 0, m = 0, y = 0, S = 0, g = 0, w = 0, _ = 0, O = 0, E = 0, L, $, I, C, b, F = null, P = 0, T, j = new vl.Buf16(Vr + 1), R = new vl.Buf16(Vr + 1), D = null, V = 0, B, Y, G;
   for (c = 0; c <= Vr; c++)
-    I[c] = 0;
+    j[c] = 0;
   for (d = 0; d < a; d++)
-    I[r[i + d]]++;
-  for (T = p, y = Vr; y >= 1 && I[y] === 0; y--)
+    j[r[i + d]]++;
+  for (S = p, y = Vr; y >= 1 && j[y] === 0; y--)
     ;
-  if (T > y && (T = y), y === 0)
+  if (S > y && (S = y), y === 0)
     return s[n++] = 1 << 24 | 64 << 16 | 0, s[n++] = 1 << 24 | 64 << 16 | 0, l.bits = 1, 0;
-  for (m = 1; m < y && I[m] === 0; m++)
+  for (m = 1; m < y && j[m] === 0; m++)
     ;
-  for (T < m && (T = m), _ = 1, c = 1; c <= Vr; c++)
-    if (_ <<= 1, _ -= I[c], _ < 0)
+  for (S < m && (S = m), _ = 1, c = 1; c <= Vr; c++)
+    if (_ <<= 1, _ -= j[c], _ < 0)
       return -1;
   if (_ > 0 && (t === Pl || y !== 1))
     return -1;
   for (R[1] = 0, c = 1; c < Vr; c++)
-    R[c + 1] = R[c] + I[c];
+    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 === Pl ? (F = D = o, S = 19) : t === Zi ? (F = fy, P -= 257, D = py, V -= 257, S = 256) : (F = cy, D = uy, S = -1), E = 0, d = 0, c = m, b = n, g = T, w = 0, L = -1, O = 1 << T, j = O - 1, t === Zi && O > xl || t === El && O > kl)
+  if (t === Pl ? (F = D = o, T = 19) : t === Zi ? (F = fy, P -= 257, D = py, V -= 257, T = 256) : (F = cy, D = uy, T = -1), E = 0, d = 0, c = m, b = n, g = S, w = 0, I = -1, O = 1 << S, C = O - 1, t === Zi && O > xl || t === El && O > kl)
     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), C = 1 << c - w, $ = 1 << g, m = $;
+    B = c - w, o[d] < T ? (Y = 0, G = o[d]) : o[d] > T ? (Y = D[V + o[d]], G = F[P + o[d]]) : (Y = 96, G = 0), L = 1 << c - w, $ = 1 << g, m = $;
     do
-      $ -= C, s[b + (E >> w) + $] = B << 24 | Y << 16 | G | 0;
+      $ -= L, s[b + (E >> w) + $] = B << 24 | Y << 16 | G | 0;
     while ($ !== 0);
-    for (C = 1 << c - 1; E & C; )
-      C >>= 1;
-    if (C !== 0 ? (E &= C - 1, E += C) : E = 0, d++, --I[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 > T && (E & j) !== L) {
-      for (w === 0 && (w = T), b += m, g = c - w, _ = 1 << g; g + w < y && (_ -= I[g + w], !(_ <= 0)); )
+    if (c > S && (E & C) !== I) {
+      for (w === 0 && (w = S), b += m, g = c - w, _ = 1 << g; g + w < y && (_ -= j[g + w], !(_ <= 0)); )
         g++, _ <<= 1;
       if (O += 1 << g, t === Zi && O > xl || t === El && O > kl)
         return 1;
-      L = E & j, s[L] = T << 24 | g << 16 | b - n | 0;
+      I = E & C, s[I] = S << 24 | g << 16 | b - n | 0;
     }
   }
-  return E !== 0 && (s[b + E] = c - w << 24 | 64 << 16 | 0), l.bits = T, 0;
+  return E !== 0 && (s[b + E] = c - w << 24 | 64 << 16 | 0), l.bits = S, 0;
 }, kt = ar, Ja = gc, Mt = wc, hy = ly, In = dy, my = 0, Ac = 1, $c = 2, Sl = 4, yy = 5, vs = 6, Dr = 0, gy = 1, wy = 2, Rt = -2, Rc = -3, Fc = -4, by = -5, Tl = 8, Lc = 1, Ol = 2, Al = 3, $l = 4, Rl = 5, Fl = 6, Ll = 7, Il = 8, Cl = 9, jl = 10, ri = 11, tr = 12, Gi = 13, Nl = 14, Yi = 15, Dl = 16, Ul = 17, Bl = 18, ql = 19, xs = 20, ks = 21, Ml = 22, Wl = 23, Hl = 24, zl = 25, Vl = 26, Ki = 27, Zl = 28, Gl = 29, je = 30, Ic = 31, _y = 32, vy = 852, xy = 592, ky = 15, Py = ky;
 function Yl(e) {
   return (e >>> 24 & 255) + (e >>> 8 & 65280) + ((e & 65280) << 8) + ((e & 255) << 24);
@@ -3807,7 +3807,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 Oy(e, t) {
-  var r, i, a, s, n, o, l, p, c, d, m, y, T, g, w = 0, _, O, E, C, $, L, j, b, F = new kt.Buf8(4), P, S, I = (
+  var r, i, a, s, n, o, l, p, c, d, m, y, S, g, w = 0, _, O, E, L, $, I, C, b, F = new kt.Buf8(4), P, T, j = (
     /* permutation of code lengths */
     [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]
   );
@@ -3840,13 +3840,13 @@ function Oy(e, t) {
             e.msg = "unknown compression method", r.mode = je;
             break;
           }
-          if (p >>>= 4, c -= 4, j = (p & 15) + 8, r.wbits === 0)
-            r.wbits = j;
-          else if (j > r.wbits) {
+          if (p >>>= 4, c -= 4, C = (p & 15) + 8, r.wbits === 0)
+            r.wbits = C;
+          else if (C > r.wbits) {
             e.msg = "invalid window size", r.mode = je;
             break;
           }
-          r.dmax = 1 << j, e.adler = r.check = 1, r.mode = p & 512 ? jl : tr, p = 0, c = 0;
+          r.dmax = 1 << C, e.adler = r.check = 1, r.mode = p & 512 ? jl : tr, p = 0, c = 0;
           break;
         case Ol:
           for (; c < 16; ) {
@@ -3888,7 +3888,7 @@ function Oy(e, t) {
           } else r.head && (r.head.extra = null);
           r.mode = Fl;
         case Fl:
-          if (r.flags & 1024 && (y = r.length, y > o && (y = o), y && (r.head && (j = r.head.extra_len - r.length, r.head.extra || (r.head.extra = new Array(r.head.extra_len)), kt.arraySet(
+          if (r.flags & 1024 && (y = r.length, y > o && (y = o), y && (r.head && (C = r.head.extra_len - r.length, r.head.extra || (r.head.extra = new Array(r.head.extra_len)), kt.arraySet(
             r.head.extra,
             i,
             s,
@@ -3896,7 +3896,7 @@ function Oy(e, t) {
             // - no need for additional size check
             y,
             /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/
-            j
+            C
           )), r.flags & 512 && (r.check = Mt(r.check, i, y, s)), o -= y, s += y, r.length -= y), r.length))
             break e;
           r.length = 0, r.mode = Ll;
@@ -3906,9 +3906,9 @@ function Oy(e, t) {
               break e;
             y = 0;
             do
-              j = i[s + y++], r.head && j && r.length < 65536 && (r.head.name += String.fromCharCode(j));
-            while (j && y < o);
-            if (r.flags & 512 && (r.check = Mt(r.check, i, y, s)), o -= y, s += y, j)
+              C = i[s + y++], r.head && C && r.length < 65536 && (r.head.name += String.fromCharCode(C));
+            while (C && y < o);
+            if (r.flags & 512 && (r.check = Mt(r.check, i, y, s)), o -= y, s += y, C)
               break e;
           } else r.head && (r.head.name = null);
           r.length = 0, r.mode = Il;
@@ -3918,9 +3918,9 @@ function Oy(e, t) {
               break e;
             y = 0;
             do
-              j = i[s + y++], r.head && j && r.length < 65536 && (r.head.comment += String.fromCharCode(j));
-            while (j && y < o);
-            if (r.flags & 512 && (r.check = Mt(r.check, i, y, s)), o -= y, s += y, j)
+              C = i[s + y++], r.head && C && r.length < 65536 && (r.head.comment += String.fromCharCode(C));
+            while (C && y < o);
+            if (r.flags & 512 && (r.check = Mt(r.check, i, y, s)), o -= y, s += y, C)
               break e;
           } else r.head && (r.head.comment = null);
           r.mode = Cl;
@@ -4022,10 +4022,10 @@ function Oy(e, t) {
                 break e;
               o--, p += i[s++] << c, c += 8;
             }
-            r.lens[I[r.have++]] = p & 7, p >>>= 3, c -= 3;
+            r.lens[j[r.have++]] = p & 7, p >>>= 3, c -= 3;
           }
           for (; r.have < 19; )
-            r.lens[I[r.have++]] = 0;
+            r.lens[j[r.have++]] = 0;
           if (r.lencode = r.lendyn, r.lenbits = 7, P = { bits: r.lenbits }, b = In(my, r.lens, 0, 19, r.lencode, 0, r.work, P), r.lenbits = P.bits, b) {
             e.msg = "invalid code lengths set", r.mode = je;
             break;
@@ -4042,7 +4042,7 @@ function Oy(e, t) {
               p >>>= _, c -= _, r.lens[r.have++] = E;
             else {
               if (E === 16) {
-                for (S = _ + 2; c < S; ) {
+                for (T = _ + 2; c < T; ) {
                   if (o === 0)
                     break e;
                   o--, p += i[s++] << c, c += 8;
@@ -4051,28 +4051,28 @@ function Oy(e, t) {
                   e.msg = "invalid bit length repeat", r.mode = je;
                   break;
                 }
-                j = r.lens[r.have - 1], y = 3 + (p & 3), p >>>= 2, c -= 2;
+                C = r.lens[r.have - 1], y = 3 + (p & 3), p >>>= 2, c -= 2;
               } else if (E === 17) {
-                for (S = _ + 3; c < S; ) {
+                for (T = _ + 3; c < T; ) {
                   if (o === 0)
                     break e;
                   o--, p += i[s++] << c, c += 8;
                 }
-                p >>>= _, c -= _, j = 0, y = 3 + (p & 7), p >>>= 3, c -= 3;
+                p >>>= _, c -= _, C = 0, y = 3 + (p & 7), p >>>= 3, c -= 3;
               } else {
-                for (S = _ + 7; c < S; ) {
+                for (T = _ + 7; c < T; ) {
                   if (o === 0)
                     break e;
                   o--, p += i[s++] << c, c += 8;
                 }
-                p >>>= _, c -= _, j = 0, y = 11 + (p & 127), p >>>= 7, c -= 7;
+                p >>>= _, c -= _, C = 0, y = 11 + (p & 127), p >>>= 7, c -= 7;
               }
               if (r.have + y > r.nlen + r.ndist) {
                 e.msg = "invalid bit length repeat", r.mode = je;
                 break;
               }
               for (; y--; )
-                r.lens[r.have++] = j;
+                r.lens[r.have++] = C;
             }
           }
           if (r.mode === je)
@@ -4104,12 +4104,12 @@ function Oy(e, t) {
             o--, p += i[s++] << c, c += 8;
           }
           if (O && !(O & 240)) {
-            for (C = _, $ = O, L = E; w = r.lencode[L + ((p & (1 << C + $) - 1) >> C)], _ = w >>> 24, O = w >>> 16 & 255, E = w & 65535, !(C + _ <= c); ) {
+            for (L = _, $ = O, I = E; w = r.lencode[I + ((p & (1 << L + $) - 1) >> L)], _ = w >>> 24, O = w >>> 16 & 255, E = w & 65535, !(L + _ <= c); ) {
               if (o === 0)
                 break e;
               o--, p += i[s++] << c, c += 8;
             }
-            p >>>= C, c -= C, r.back += C;
+            p >>>= L, c -= L, r.back += L;
           }
           if (p >>>= _, c -= _, r.back += _, r.length = E, O === 0) {
             r.mode = Vl;
@@ -4126,7 +4126,7 @@ function Oy(e, t) {
           r.extra = O & 15, r.mode = Ml;
         case Ml:
           if (r.extra) {
-            for (S = r.extra; c < S; ) {
+            for (T = r.extra; c < T; ) {
               if (o === 0)
                 break e;
               o--, p += i[s++] << c, c += 8;
@@ -4141,12 +4141,12 @@ function Oy(e, t) {
             o--, p += i[s++] << c, c += 8;
           }
           if (!(O & 240)) {
-            for (C = _, $ = O, L = E; w = r.distcode[L + ((p & (1 << C + $) - 1) >> C)], _ = w >>> 24, O = w >>> 16 & 255, E = w & 65535, !(C + _ <= c); ) {
+            for (L = _, $ = O, I = E; w = r.distcode[I + ((p & (1 << L + $) - 1) >> L)], _ = w >>> 24, O = w >>> 16 & 255, E = w & 65535, !(L + _ <= c); ) {
               if (o === 0)
                 break e;
               o--, p += i[s++] << c, c += 8;
             }
-            p >>>= C, c -= C, r.back += C;
+            p >>>= L, c -= L, r.back += L;
           }
           if (p >>>= _, c -= _, r.back += _, O & 64) {
             e.msg = "invalid distance code", r.mode = je;
@@ -4155,7 +4155,7 @@ function Oy(e, t) {
           r.offset = E, r.extra = O & 15, r.mode = Hl;
         case Hl:
           if (r.extra) {
-            for (S = r.extra; c < S; ) {
+            for (T = r.extra; c < T; ) {
               if (o === 0)
                 break e;
               o--, p += i[s++] << c, c += 8;
@@ -4175,12 +4175,12 @@ function Oy(e, t) {
               e.msg = "invalid distance too far back", r.mode = je;
               break;
             }
-            y > r.wnext ? (y -= r.wnext, T = r.wsize - y) : T = r.wnext - y, y > r.length && (y = r.length), g = r.window;
+            y > r.wnext ? (y -= r.wnext, S = r.wsize - y) : S = r.wnext - y, y > r.length && (y = r.length), g = r.window;
           } else
-            g = a, T = n - r.offset, y = r.length;
+            g = a, S = n - r.offset, y = r.length;
           y > l && (y = l), l -= y, r.length -= y;
           do
-            a[n++] = g[T++];
+            a[n++] = g[S++];
           while (--y);
           r.length === 0 && (r.mode = ks);
           break;
@@ -4500,12 +4500,12 @@ Ro.read = function(e, t, r, i, a) {
   return (y ? -1 : 1) * n * Math.pow(2, s - i);
 };
 Ro.write = function(e, t, r, i, a, s) {
-  var n, o, l, p = s * 8 - a - 1, c = (1 << p) - 1, d = c >> 1, m = a === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0, y = i ? 0 : s - 1, T = i ? 1 : -1, g = t < 0 || t === 0 && 1 / t < 0 ? 1 : 0;
-  for (t = Math.abs(t), isNaN(t) || t === 1 / 0 ? (o = isNaN(t) ? 1 : 0, n = c) : (n = Math.floor(Math.log(t) / Math.LN2), t * (l = Math.pow(2, -n)) < 1 && (n--, l *= 2), n + d >= 1 ? t += m / l : t += m * Math.pow(2, 1 - d), t * l >= 2 && (n++, l /= 2), n + d >= c ? (o = 0, n = c) : n + d >= 1 ? (o = (t * l - 1) * Math.pow(2, a), n = n + d) : (o = t * Math.pow(2, d - 1) * Math.pow(2, a), n = 0)); a >= 8; e[r + y] = o & 255, y += T, o /= 256, a -= 8)
+  var n, o, l, p = s * 8 - a - 1, c = (1 << p) - 1, d = c >> 1, m = a === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0, y = i ? 0 : s - 1, S = i ? 1 : -1, g = t < 0 || t === 0 && 1 / t < 0 ? 1 : 0;
+  for (t = Math.abs(t), isNaN(t) || t === 1 / 0 ? (o = isNaN(t) ? 1 : 0, n = c) : (n = Math.floor(Math.log(t) / Math.LN2), t * (l = Math.pow(2, -n)) < 1 && (n--, l *= 2), n + d >= 1 ? t += m / l : t += m * Math.pow(2, 1 - d), t * l >= 2 && (n++, l /= 2), n + d >= c ? (o = 0, n = c) : n + d >= 1 ? (o = (t * l - 1) * Math.pow(2, a), n = n + d) : (o = t * Math.pow(2, d - 1) * Math.pow(2, a), n = 0)); a >= 8; e[r + y] = o & 255, y += S, o /= 256, a -= 8)
     ;
-  for (n = n << a | o, p += a; p > 0; e[r + y] = n & 255, y += T, n /= 256, p -= 8)
+  for (n = n << a | o, p += a; p > 0; e[r + y] = n & 255, y += S, n /= 256, p -= 8)
     ;
-  e[r + y - T] |= g * 128;
+  e[r + y - S] |= g * 128;
 };
 /*!
  * The buffer module from node.js, for the browser.
@@ -4564,7 +4564,7 @@ Ro.write = function(e, t, r, i, a, s) {
     if (typeof x == "string")
       return m(x, u);
     if (ArrayBuffer.isView(x))
-      return T(x);
+      return S(x);
     if (x == null)
       throw new TypeError(
         "The first argument must be one of type string, Buffer, ArrayBuffer, Array, or Array-like Object. Received type " + typeof x
@@ -4624,7 +4624,7 @@ Ro.write = function(e, t, r, i, a, s) {
       h[A] = x[A] & 255;
     return h;
   }
-  function T(x) {
+  function S(x) {
     if (Ce(x, Uint8Array)) {
       var u = new Uint8Array(x);
       return g(u.buffer, u.byteOffset, u.byteLength);
@@ -4750,7 +4750,7 @@ Ro.write = function(e, t, r, i, a, s) {
       }
   }
   o.byteLength = E;
-  function C(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 "";
@@ -4806,7 +4806,7 @@ Ro.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) : C.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;
@@ -4834,7 +4834,7 @@ Ro.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, pt(h) && (h = U ? 0 : x.length - 1), h < 0 && (h = x.length + h), h >= x.length) {
       if (U) return -1;
@@ -4843,12 +4843,12 @@ Ro.write = function(e, t, r, i, a, s) {
       if (U) h = 0;
       else return -1;
     if (typeof u == "string" && (u = o.from(u, A)), o.isBuffer(u))
-      return u.length === 0 ? -1 : j(x, u, h, A, U);
+      return u.length === 0 ? -1 : C(x, u, h, A, U);
     if (typeof u == "number")
-      return u = u & 255, typeof Uint8Array.prototype.indexOf == "function" ? U ? Uint8Array.prototype.indexOf.call(x, u, h) : Uint8Array.prototype.lastIndexOf.call(x, u, h) : j(x, [u], h, A, U);
+      return u = u & 255, typeof Uint8Array.prototype.indexOf == "function" ? U ? Uint8Array.prototype.indexOf.call(x, u, h) : Uint8Array.prototype.lastIndexOf.call(x, u, h) : C(x, [u], h, A, U);
     throw new TypeError("val must be string, number or Buffer");
   }
-  function j(x, u, h, A, U) {
+  function C(x, u, h, A, U) {
     var H = 1, J = x.length, pe = u.length;
     if (A !== void 0 && (A = String(A).toLowerCase(), A === "ucs2" || A === "ucs-2" || A === "utf16le" || A === "utf-16le")) {
       if (x.length < 2 || u.length < 2)
@@ -4880,9 +4880,9 @@ Ro.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;
@@ -4903,10 +4903,10 @@ Ro.write = function(e, t, r, i, a, s) {
   function P(x, u, h, A) {
     return Ie(Xe(u), x, h, A);
   }
-  function S(x, u, h, A) {
+  function T(x, u, h, A) {
     return Ie(Et(u), x, h, A);
   }
-  function I(x, u, h, A) {
+  function j(x, u, h, A) {
     return Ie(rt(u, x.length - h), x, h, A);
   }
   o.prototype.write = function(u, h, A, U) {
@@ -4936,12 +4936,12 @@ Ro.write = function(e, t, r, i, a, s) {
         case "binary":
           return P(this, u, h, A);
         case "base64":
-          return S(this, u, h, A);
+          return T(this, u, h, A);
         case "ucs2":
         case "ucs-2":
         case "utf16le":
         case "utf-16le":
-          return I(this, u, h, A);
+          return j(this, u, h, A);
         default:
           if (J) throw new TypeError("Unknown encoding: " + U);
           U = ("" + U).toLowerCase(), J = !0;
@@ -5690,8 +5690,8 @@ var rg = function e(t) {
   var i = lg(t), a = i.length > 0 ? i[0] : "", s = fg("%" + a + "%", r), n = s.name, o = s.value, l = !1, p = s.alias;
   p && (a = p[0], sg(i, ng([0, 1], p)));
   for (var c = 1, d = !0; c < i.length; c += 1) {
-    var m = i[c], y = si(m, 0, 1), T = si(m, -1);
-    if ((y === '"' || y === "'" || y === "`" || T === '"' || T === "'" || T === "`") && y !== T)
+    var m = i[c], y = si(m, 0, 1), S = si(m, -1);
+    if ((y === '"' || y === "'" || y === "`" || S === '"' || S === "'" || S === "`") && y !== S)
       throw new cn("property names with quotes must have matching quotes");
     if ((m === "constructor" || !d) && (l = !0), a += "." + m, n = "%" + a + "%", ni($r, n))
       o = $r[n];
@@ -5740,8 +5740,8 @@ function cg() {
     t = null;
   var a = /^\s*class\b/, s = function(E) {
     try {
-      var C = e.call(E);
-      return a.test(C);
+      var L = e.call(E);
+      return a.test(L);
     } catch {
       return !1;
     }
@@ -5751,7 +5751,7 @@ function cg() {
     } catch {
       return !1;
     }
-  }, o = Object.prototype.toString, l = "[object Object]", p = "[object Function]", c = "[object GeneratorFunction]", d = "[object HTMLAllCollection]", m = "[object HTML document.all class]", y = "[object HTMLCollection]", T = typeof Symbol == "function" && !!Symbol.toStringTag, g = !(0 in [,]), w = function() {
+  }, o = Object.prototype.toString, l = "[object Object]", p = "[object Function]", c = "[object GeneratorFunction]", d = "[object HTMLAllCollection]", m = "[object HTML document.all class]", y = "[object HTMLCollection]", S = typeof Symbol == "function" && !!Symbol.toStringTag, g = !(0 in [,]), w = function() {
     return !1;
   };
   if (typeof document == "object") {
@@ -5759,8 +5759,8 @@ function cg() {
     o.call(_) === o.call(document.all) && (w = function(E) {
       if ((g || !E) && (typeof E > "u" || typeof E == "object"))
         try {
-          var C = o.call(E);
-          return (C === d || C === m || C === y || C === l) && E("") == null;
+          var L = o.call(E);
+          return (L === d || L === m || L === y || L === l) && E("") == null;
         } catch {
         }
       return !1;
@@ -5773,8 +5773,8 @@ function cg() {
       return !1;
     try {
       t(E, null, r);
-    } catch (C) {
-      if (C !== i)
+    } catch (L) {
+      if (L !== i)
         return !1;
     }
     return !s(E) && n(E);
@@ -5783,12 +5783,12 @@ function cg() {
       return !0;
     if (!E || typeof E != "function" && typeof E != "object")
       return !1;
-    if (T)
+    if (S)
       return n(E);
     if (s(E))
       return !1;
-    var C = o.call(E);
-    return C !== p && C !== c && !/^\[object HTML/.test(C) ? !1 : n(E);
+    var L = o.call(E);
+    return L !== p && L !== c && !/^\[object HTML/.test(L) ? !1 : n(E);
   }, fa;
 }
 var pa, ff;
@@ -5973,11 +5973,11 @@ function vg() {
         O = a(E, Symbol.toStringTag);
       }
       if (O && O.get) {
-        var C = r(O.get);
+        var L = r(O.get);
         m[
           /** @type {`$${import('.').TypedArrayName}`} */
           "$" + g
-        ] = C;
+        ] = L;
       }
     }
   }) : e(p, function(g) {
@@ -6009,7 +6009,7 @@ function vg() {
           }
       }
     ), _;
-  }, T = function(w) {
+  }, S = function(w) {
     var _ = !1;
     return e(
       /** @type {Record<`\$${import('.').TypedArrayName}`, Getter>} */
@@ -6030,7 +6030,7 @@ function vg() {
       return !1;
     if (!o) {
       var _ = c(n(w), 8, -1);
-      return d(p, _) > -1 ? _ : _ !== "Object" ? !1 : T(w);
+      return d(p, _) > -1 ? _ : _ !== "Object" ? !1 : S(w);
     }
     return a ? y(w) : null;
   }, ba;
@@ -6242,14 +6242,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 My([t], async ({ data: w, type: _, reference: O, offset: E, num: C }) => {
-      c === null && (c = C);
+    await My([t], async ({ data: w, type: _, reference: O, offset: E, num: L }) => {
+      c === null && (c = L);
       const $ = Math.floor(
-        (c - C) * 100 / c
+        (c - L) * 100 / c
       );
       $ !== d && i && await i({
         phase: "Receiving objects",
-        loaded: c - C,
+        loaded: c - L,
         total: c
       }), d = $, _ = a[_], ["commit", "tree", "blob", "tag"].includes(_) ? s[E] = {
         type: _,
@@ -6264,8 +6264,8 @@ class un {
     });
     const m = Object.keys(s).map(Number);
     for (const [w, _] of m.entries()) {
-      const O = w + 1 === m.length ? t.byteLength - 20 : m[w + 1], E = s[_], C = Zh.buf(t.slice(_, O)) >>> 0;
-      E.end = O, E.crc = C;
+      const O = w + 1 === m.length ? t.byteLength - 20 : m[w + 1], E = s[_], L = Zh.buf(t.slice(_, O)) >>> 0;
+      E.end = O, E.crc = L;
     }
     const y = new un({
       pack: Promise.resolve(t),
@@ -6276,23 +6276,23 @@ class un {
       getExternalRefDelta: r
     });
     d = null;
-    let T = 0;
+    let S = 0;
     const g = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0];
     for (let w in s) {
       w = Number(w);
-      const _ = Math.floor(T * 100 / c);
+      const _ = Math.floor(S * 100 / c);
       _ !== d && i && await i({
         phase: "Resolving deltas",
-        loaded: T,
+        loaded: S,
         total: c
-      }), T++, d = _;
+      }), S++, d = _;
       const O = s[w];
       if (!O.oid)
         try {
           y.readDepth = 0, y.externalReadDepth = 0;
-          const { type: E, object: C } = await y.readSlice({ start: w });
+          const { type: E, object: L } = await y.readSlice({ start: w });
           g[y.readDepth] += 1;
-          const $ = await ii(Gh.wrap({ type: E, object: C }));
+          const $ = await ii(Gh.wrap({ type: E, object: L }));
           O.oid = $, o.push($), p.set($, w), l[$] = O.crc;
         } catch {
           continue;
@@ -6366,12 +6366,12 @@ class un {
     s & 128 && (p = Xg(a, l));
     let d = null, m = null;
     if (o === "ofs_delta") {
-      const T = Kg(a), g = t - T;
+      const S = Kg(a), g = t - S;
       ({ object: d, type: o } = await this.readSlice({ start: g }));
     }
     if (o === "ref_delta") {
-      const T = a.slice(20).toString("hex");
-      ({ object: d, type: o } = await this.read({ oid: T }));
+      const S = a.slice(20).toString("hex");
+      ({ object: d, type: o } = await this.read({ oid: S }));
     }
     const y = i.slice(a.tell());
     if (m = Buffer.from(await Hy(y)), m.byteLength !== p)
@@ -6508,10 +6508,10 @@ class Sr {
         throw new ns(c.path);
       let y = 8 - (i.tell() - 12) % 8;
       for (y === 0 && (y = 8); y--; ) {
-        const T = i.readUInt8();
-        if (T !== 0)
+        const S = i.readUInt8();
+        if (S !== 0)
           throw new Ee(
-            `Expected 1-8 null characters but got '${T}' after ${c.path}`
+            `Expected 1-8 null characters but got '${S}' after ${c.path}`
           );
         if (i.eof())
           throw new Ee("Unexpected end of file");
@@ -6781,8 +6781,8 @@ async function ou(e) {
         const y = m.slice(-41).trim();
         y.length !== 40 && c(new Vn(y)), s.push(y);
       } else if (m.startsWith("ACK")) {
-        const [, y, T] = m.split(" ");
-        n.push({ oid: y, status: T }), T || (l = !0);
+        const [, y, S] = m.split(" ");
+        n.push({ oid: y, status: S }), S || (l = !0);
       } else m.startsWith("NAK") ? (o = !0, l = !0) : (l = !0, o = !0);
       l && (e.error ? c(e.error) : p({ shallows: a, unshallows: s, acks: n, nak: o, packfile: r, progress: i }));
     }).finally(() => {
@@ -7381,11 +7381,11 @@ function Fe() {
   const e = this;
   function t(a) {
     const s = e.dyn_tree, n = e.stat_desc.static_tree, o = e.stat_desc.extra_bits, l = e.stat_desc.extra_base, p = e.stat_desc.max_length;
-    let c, d, m, y, T, g, w = 0;
+    let c, d, m, y, S, g, w = 0;
     for (y = 0; y <= Kn; y++)
       a.bl_count[y] = 0;
     for (s[a.heap[a.heap_max] * 2 + 1] = 0, c = a.heap_max + 1; c < kf; c++)
-      d = a.heap[c], y = s[s[d * 2 + 1] * 2 + 1] + 1, y > p && (y = p, w++), s[d * 2 + 1] = y, !(d > e.max_code) && (a.bl_count[y]++, T = 0, d >= l && (T = o[d - l]), g = s[d * 2], a.opt_len += g * (y + T), n && (a.static_len += g * (n[d * 2 + 1] + T)));
+      d = a.heap[c], y = s[s[d * 2 + 1] * 2 + 1] + 1, y > p && (y = p, w++), s[d * 2 + 1] = y, !(d > e.max_code) && (a.bl_count[y]++, S = 0, d >= l && (S = o[d - l]), g = s[d * 2], a.opt_len += g * (y + S), n && (a.static_len += g * (n[d * 2 + 1] + S)));
     if (w !== 0) {
       do {
         for (y = p - 1; a.bl_count[y] === 0; )
@@ -7835,7 +7835,7 @@ function Af(e, t, r, i) {
 }
 function Iw() {
   const e = this;
-  let t, r, i, a, s, n, o, l, p, c, d, m, y, T, g, w, _, O, E, C, $, L, j, b, F, P, S, I, R, D, V, B, Y;
+  let t, r, i, a, s, n, o, l, p, c, d, m, y, S, g, w, _, O, E, L, $, I, C, b, F, P, T, 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;
@@ -7844,7 +7844,7 @@ function Iw() {
     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, j = 0, O = b = Ne - 1, C = 0, m = 0;
+    P = Lt[T].max_lazy, R = Lt[T].good_length, D = Lt[T].nice_length, F = Lt[T].max_chain, $ = 0, _ = 0, C = 0, O = b = Ne - 1, L = 0, m = 0;
   }
   function Oe() {
     let M;
@@ -7922,7 +7922,7 @@ function Iw() {
   }
   function H(M, K) {
     let W, Q, se;
-    if (e.dist_buf[ee] = M, e.lc_buf[ee] = K & 255, ee++, M === 0 ? V[K * 2]++ : (Z++, M--, V[(Fe._length_code[K] + ai + 1) * 2]++, B[Fe.d_code(M) * 2]++), !(ee & 8191) && S > 2) {
+    if (e.dist_buf[ee] = M, e.lc_buf[ee] = K & 255, ee++, M === 0 ? V[K * 2]++ : (Z++, M--, V[(Fe._length_code[K] + ai + 1) * 2]++, B[Fe.d_code(M) * 2]++), !(ee & 8191) && T > 2) {
       for (W = ee * 8, Q = $ - _, se = 0; se < no; se++)
         W += B[se * 2] * (5 + Fe.extra_dbits[se]);
       if (W >>>= 3, Z < Math.floor(ee / 2) && W < Math.floor(Q / 2))
@@ -7949,7 +7949,7 @@ function Iw() {
   }
   function De(M, K, W) {
     let Q, se, le = 0;
-    S > 0 ? (G.build_tree(e), te.build_tree(e), le = Et(), Q = e.opt_len + 3 + 7 >>> 3, se = e.static_len + 3 + 7 >>> 3, se <= Q && (Q = se)) : Q = se = K + 5, K + 4 <= Q && M != -1 ? he(M, K, W) : se == Q ? (Re((Sa << 1) + (W ? 1 : 0), 3), J(Je.static_ltree, Je.static_dtree)) : (Re((Lw << 1) + (W ? 1 : 0), 3), h(G.max_code + 1, te.max_code + 1, le + 1), J(V, B)), Oe(), W && pe();
+    T > 0 ? (G.build_tree(e), te.build_tree(e), le = Et(), Q = e.opt_len + 3 + 7 >>> 3, se = e.static_len + 3 + 7 >>> 3, se <= Q && (Q = se)) : Q = se = K + 5, K + 4 <= Q && M != -1 ? he(M, K, W) : se == Q ? (Re((Sa << 1) + (W ? 1 : 0), 3), J(Je.static_ltree, Je.static_dtree)) : (Re((Lw << 1) + (W ? 1 : 0), 3), h(G.max_code + 1, te.max_code + 1, le + 1), J(V, B)), Oe(), W && pe();
   }
   function ue(M) {
     De(_ >= 0 ? _ : -1, $ - _, M), _ = $, t.flush_pending();
@@ -7957,12 +7957,12 @@ function Iw() {
   function yt() {
     let M, K, W, Q;
     do {
-      if (Q = p - j - $, Q === 0 && $ === 0 && j === 0)
+      if (Q = p - C - $, Q === 0 && $ === 0 && C === 0)
         Q = s;
       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);
@@ -7974,19 +7974,19 @@ function Iw() {
       }
       if (t.avail_in === 0)
         return;
-      M = t.read_buf(l, $ + j, Q), j += M, j >= Ne && (m = l[$] & 255, m = (m << w ^ l[$ + 1] & 255) & g);
-    } while (j < wt && t.avail_in !== 0);
+      M = t.read_buf(l, $ + C, Q), C += M, C >= Ne && (m = l[$] & 255, m = (m << w ^ l[$ + 1] & 255) & g);
+    } while (C < wt && t.avail_in !== 0);
   }
   function nt(M) {
     let K = 65535, W;
     for (K > i - 5 && (K = i - 5); ; ) {
-      if (j <= 1) {
-        if (yt(), j === 0 && M == en)
+      if (C <= 1) {
+        if (yt(), C === 0 && M == en)
           return St;
-        if (j === 0)
+        if (C === 0)
           break;
       }
-      if ($ += j, j = 0, W = _ + K, ($ === 0 || $ >= W) && (j = $ - W, $ = W, ue(!1), t.avail_out === 0) || $ - _ >= s - wt && (ue(!1), t.avail_out === 0))
+      if ($ += C, C = 0, W = _ + K, ($ === 0 || $ >= W) && (C = $ - W, $ = W, ue(!1), t.avail_out === 0) || $ - _ >= s - wt && (ue(!1), t.avail_out === 0))
         return St;
     }
     return ue(M == ct), t.avail_out === 0 ? M == ct ? kn : St : M == ct ? Os : Ts;
@@ -7997,7 +7997,7 @@ function Iw() {
     let Me = D;
     const ce = o, xe = $ + Hs;
     let q = l[W + le - 1], ae = l[W + le];
-    b >= R && (K >>= 2), Me > j && (Me = j);
+    b >= R && (K >>= 2), Me > C && (Me = C);
     do
       if (Q = M, !(l[Q + le] != ae || l[Q + le - 1] != q || l[Q] != l[W] || l[++Q] != l[W + 1])) {
         W += 2, Q++;
@@ -8005,25 +8005,25 @@ function Iw() {
           ;
         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];
         }
       }
     while ((M = c[M & ce] & 65535) > de && --K !== 0);
-    return le <= j ? le : j;
+    return le <= C ? le : C;
   }
   function Ti(M) {
     let K = 0, W;
     for (; ; ) {
-      if (j < wt) {
-        if (yt(), j < wt && M == en)
+      if (C < wt) {
+        if (yt(), C < wt && M == en)
           return St;
-        if (j === 0)
+        if (C === 0)
           break;
       }
-      if (j >= 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 && I != Ps && (O = Ft(K)), O >= Ne)
-        if (W = H($ - L, O - Ne), j -= O, O <= P && j >= Ne) {
+      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 && (O = Ft(K)), O >= Ne)
+        if (W = H($ - I, O - Ne), C -= O, O <= P && C >= Ne) {
           O--;
           do
             $++, m = (m << w ^ l[$ + (Ne - 1)] & 255) & g, K = d[m] & 65535, c[$ & o] = d[m], d[m] = $;
@@ -8032,7 +8032,7 @@ function Iw() {
         } else
           $ += O, O = 0, m = l[$] & 255, m = (m << w ^ l[$ + 1] & 255) & g;
       else
-        W = H(0, l[$] & 255), j--, $++;
+        W = H(0, l[$] & 255), C--, $++;
       if (W && (ue(!1), t.avail_out === 0))
         return St;
     }
@@ -8041,37 +8041,37 @@ function Iw() {
   function st(M) {
     let K = 0, W, Q;
     for (; ; ) {
-      if (j < wt) {
-        if (yt(), j < wt && M == en)
+      if (C < wt) {
+        if (yt(), C < wt && M == en)
           return St;
-        if (j === 0)
+        if (C === 0)
           break;
       }
-      if (j >= Ne && (m = (m << w ^ l[$ + (Ne - 1)] & 255) & g, K = d[m] & 65535, c[$ & o] = d[m], d[m] = $), b = O, E = L, O = Ne - 1, K !== 0 && b < P && ($ - K & 65535) <= s - wt && (I != Ps && (O = Ft(K)), O <= 5 && (I == vw || O == Ne && $ - L > 4096) && (O = Ne - 1)), b >= Ne && O <= b) {
-        Q = $ + j - Ne, W = H($ - 1 - E, b - Ne), j -= b - 1, b -= 2;
+      if (C >= Ne && (m = (m << w ^ l[$ + (Ne - 1)] & 255) & g, K = d[m] & 65535, c[$ & o] = d[m], d[m] = $), b = O, E = I, O = Ne - 1, K !== 0 && b < P && ($ - K & 65535) <= s - wt && (j != Ps && (O = Ft(K)), O <= 5 && (j == vw || O == Ne && $ - I > 4096) && (O = Ne - 1)), b >= Ne && O <= 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 (C = 0, O = Ne - 1, $++, W && (ue(!1), t.avail_out === 0))
+        if (L = 0, O = Ne - 1, $++, W && (ue(!1), t.avail_out === 0))
           return St;
-      } else if (C !== 0) {
-        if (W = H(0, l[$ - 1] & 255), W && ue(!1), $++, j--, t.avail_out === 0)
+      } else if (L !== 0) {
+        if (W = H(0, l[$ - 1] & 255), W && ue(!1), $++, C--, t.avail_out === 0)
           return St;
       } else
-        C = 1, $++, j--;
+        L = 1, $++, C--;
     }
-    return C !== 0 && (W = H(0, l[$ - 1] & 255), C = 0), ue(M == ct), t.avail_out === 0 ? M == ct ? kn : St : M == ct ? Os : Ts;
+    return L !== 0 && (W = H(0, l[$ - 1] & 255), L = 0), ue(M == ct), t.avail_out === 0 ? M == ct ? kn : St : M == ct ? Os : Ts;
   }
   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;
   }
   e.deflateInit = function(M, K, W, Q, se, le) {
-    return Q || (Q = Ea), se || (se = $w), le || (le = xw), M.msg = null, K == oi && (K = 6), se < 1 || se > Aw || Q != Ea || W < 9 || W > 15 || K < 0 || K > 9 || le < 0 || le > Ps ? Nt : (M.dstate = e, n = W, s = 1 << n, o = s - 1, T = se + 7, y = 1 << T, g = y - 1, w = Math.floor((T + Ne - 1) / Ne), l = new Uint8Array(s * 2), c = [], d = [], X = 1 << se + 6, e.pending_buf = new Uint8Array(X * 4), i = X * 4, e.dist_buf = new Uint16Array(X), e.lc_buf = new Uint8Array(X), S = K, I = le, Hr(M));
+    return Q || (Q = Ea), se || (se = $w), le || (le = xw), M.msg = null, K == oi && (K = 6), se < 1 || se > Aw || Q != Ea || W < 9 || W > 15 || K < 0 || K > 9 || le < 0 || le > Ps ? Nt : (M.dstate = e, n = W, s = 1 << n, o = s - 1, S = se + 7, y = 1 << S, g = y - 1, w = Math.floor((S + Ne - 1) / Ne), l = new Uint8Array(s * 2), c = [], d = [], X = 1 << se + 6, e.pending_buf = new Uint8Array(X * 4), i = X * 4, e.dist_buf = new Uint16Array(X), e.lc_buf = new Uint8Array(X), T = K, j = le, Hr(M));
   }, e.deflateEnd = function() {
     return r != Pa && 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 ? Pw : 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(Tf)), S != K && (S = K, P = Lt[S].max_lazy, R = Lt[S].good_length, D = Lt[S].nice_length, F = Lt[S].max_chain), I = W, Q);
+    return K == oi && (K = 6), K < 0 || K > 9 || W < 0 || W > Ps ? Nt : (Lt[T].func != Lt[K].func && M.total_in !== 0 && (Q = M.deflate(Tf)), T != K && (T = K, P = Lt[T].max_lazy, R = Lt[T].good_length, D = Lt[T].nice_length, F = Lt[T].max_chain), j = W, Q);
   }, e.deflateSetDictionary = function(M, K, W) {
     let Q = W, se, le = 0;
     if (!K || r != Pa)
@@ -8089,15 +8089,15 @@ function Iw() {
       return M.msg = Ss[Es - Nt], Nt;
     if (M.avail_out === 0)
       return M.msg = Ss[Es - Yr], Yr;
-    if (t = M, le = a, a = K, r == Pa && (Q = Ea + (n - 8 << 4) << 8, se = (S - 1 & 255) >> 1, se > 3 && (se = 3), Q |= se << 6, $ !== 0 && (Q |= Rw), Q += 31 - Q % 31, r = As, pt(Q)), e.pending !== 0) {
+    if (t = M, le = a, a = K, r == Pa && (Q = Ea + (n - 8 << 4) << 8, se = (T - 1 & 255) >> 1, se > 3 && (se = 3), Q |= se << 6, $ !== 0 && (Q |= Rw), Q += 31 - Q % 31, r = As, pt(Q)), e.pending !== 0) {
       if (t.flush_pending(), t.avail_out === 0)
         return a = -1, Ct;
     } else if (t.avail_in === 0 && K <= le && K != ct)
       return t.msg = Ss[Es - Yr], Yr;
     if (r == Pn && t.avail_in !== 0)
       return M.msg = Ss[Es - Yr], Yr;
-    if (t.avail_in !== 0 || j !== 0 || K != en && r != Pn) {
-      switch (de = -1, Lt[S].func) {
+    if (t.avail_in !== 0 || C !== 0 || K != en && r != Pn) {
+      switch (de = -1, Lt[T].func) {
         case du:
           de = nt(K);
           break;
@@ -8176,17 +8176,17 @@ function Cw(e) {
   let n = e ? e.level : oi;
   typeof n > "u" && (n = oi), r.deflateInit(n), r.next_out = s, t.append = function(o, l) {
     let p, c, d = 0, m = 0, y = 0;
-    const T = [];
+    const S = [];
     if (o.length) {
       r.next_in_index = 0, r.next_in = o, r.avail_in = o.length;
       do {
         if (r.next_out_index = 0, r.avail_out = i, p = r.deflate(a), p != Ct)
           throw new Error("deflating: " + r.msg);
-        r.next_out_index && (r.next_out_index == i ? T.push(new Uint8Array(s)) : T.push(s.subarray(0, r.next_out_index))), y += r.next_out_index, l && r.next_in_index > 0 && r.next_in_index != d && (l(r.next_in_index), d = r.next_in_index);
+        r.next_out_index && (r.next_out_index == i ? S.push(new Uint8Array(s)) : S.push(s.subarray(0, r.next_out_index))), y += r.next_out_index, l && r.next_in_index > 0 && r.next_in_index != d && (l(r.next_in_index), d = r.next_in_index);
       } while (r.avail_in > 0 || r.avail_out === 0);
-      return T.length > 1 ? (c = new Uint8Array(y), T.forEach(function(g) {
+      return S.length > 1 ? (c = new Uint8Array(y), S.forEach(function(g) {
         c.set(g, m), m += g.length;
-      })) : c = T[0] ? new Uint8Array(T[0]) : new Uint8Array(), c;
+      })) : c = S[0] ? new Uint8Array(S[0]) : new Uint8Array(), c;
     }
   }, t.flush = function() {
     let o, l, p = 0, c = 0;
@@ -9991,19 +9991,19 @@ const Nw = 15, ve = 0, sr = 1, Dw = 2, dt = -2, Le = -3, $f = -4, ir = -5, _t =
 function io() {
   const e = this;
   let t, r, i, a, s, n;
-  function o(p, c, d, m, y, T, g, w, _, O, E) {
-    let C, $, L, j, b, F, P, S, I, R, D, V, B, Y, G;
+  function o(p, c, d, m, y, S, g, w, _, O, E) {
+    let L, $, I, C, b, F, P, T, j, R, D, V, B, Y, G;
     R = 0, b = d;
     do
       i[p[c + R]]++, R++, b--;
     while (b !== 0);
     if (i[0] == d)
       return g[0] = -1, w[0] = 0, ve;
-    for (S = w[0], F = 1; F <= fr && i[F] === 0; F++)
+    for (T = 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 (P = F, T < F && (T = 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, T > b && (T = b), w[0] = T, Y = 1 << F; F < b; F++, Y <<= 1)
       if ((Y -= i[F]) < 0)
         return Le;
     if ((Y -= i[b]) < 0)
@@ -10014,31 +10014,31 @@ function io() {
     do
       (F = p[c + R]) !== 0 && (E[n[F]++] = b), R++;
     while (++b < d);
-    for (d = n[L], n[0] = b = 0, R = 0, j = -1, V = -S, s[0] = 0, D = 0, G = 0; P <= L; P++)
-      for (C = i[P]; C-- !== 0; ) {
-        for (; P > V + S; ) {
-          if (j++, V += S, G = L - V, G = G > S ? S : G, ($ = 1 << (F = P - V)) > C + 1 && ($ -= C + 1, B = P, F < G))
+    for (d = n[I], n[0] = b = 0, R = 0, C = -1, V = -T, s[0] = 0, D = 0, G = 0; P <= I; P++)
+      for (L = i[P]; L-- !== 0; ) {
+        for (; P > V + T; ) {
+          if (C++, V += T, G = I - V, G = G > T ? T : G, ($ = 1 << (F = P - V)) > L + 1 && ($ -= L + 1, B = P, F < G))
             for (; ++F < G && !(($ <<= 1) <= i[++B]); )
               $ -= i[B];
           if (G = 1 << F, O[0] + G > mu)
             return Le;
-          s[j] = D = /* hp+ */
-          O[0], O[0] += G, j !== 0 ? (n[j] = b, a[0] = /* (byte) */
+          s[C] = D = /* hp+ */
+          O[0], O[0] += G, C !== 0 ? (n[C] = b, a[0] = /* (byte) */
           F, a[1] = /* (byte) */
-          S, F = b >>> V - S, a[2] = /* (int) */
-          D - s[j - 1] - F, _.set(a, (s[j - 1] + F) * 3)) : g[0] = D;
+          T, F = b >>> V - T, a[2] = /* (int) */
+          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) */
         E[R] < 256 ? 0 : 96, a[2] = E[R++]) : (a[0] = /* (byte) */
-        T[E[R] - m] + 16 + 64, a[2] = y[E[R++] - m]), $ = 1 << P - V, F = b >>> V; F < G; F += $)
+        S[E[R] - m] + 16 + 64, a[2] = y[E[R++] - m]), $ = 1 << P - V, F = b >>> V; F < G; F += $)
           _.set(a, (D + F) * 3);
         for (F = 1 << P - 1; b & F; F >>>= 1)
           b ^= F;
-        for (b ^= F, I = (1 << V) - 1; (b & I) != n[j]; )
-          j--, V -= S, I = (1 << V) - 1;
+        for (b ^= F, j = (1 << V) - 1; (b & j) != n[C]; )
+          C--, V -= T, j = (1 << V) - 1;
       }
-    return Y !== 0 && L != 1 ? ir : ve;
+    return Y !== 0 && I != 1 ? ir : ve;
   }
   function l(p) {
     let c;
@@ -10051,11 +10051,11 @@ function io() {
     s.set(i.subarray(0, fr), 0), n.set(i.subarray(0, fr + 1), 0);
   }
   e.inflate_trees_bits = function(p, c, d, m, y) {
-    let T;
-    return l(19), t[0] = 0, T = o(p, 0, 19, 19, null, null, d, c, m, t, r), T == Le ? y.msg = "oversubscribed dynamic bit lengths tree" : (T == ir || c[0] === 0) && (y.msg = "incomplete dynamic bit lengths tree", T = Le), T;
-  }, e.inflate_trees_dynamic = function(p, c, d, m, y, T, g, w, _) {
+    let S;
+    return l(19), t[0] = 0, S = o(p, 0, 19, 19, null, null, d, c, m, t, r), S == Le ? y.msg = "oversubscribed dynamic bit lengths tree" : (S == ir || c[0] === 0) && (y.msg = "incomplete dynamic bit lengths tree", S = Le), S;
+  }, e.inflate_trees_dynamic = function(p, c, d, m, y, S, g, w, _) {
     let O;
-    return l(288), t[0] = 0, O = o(d, 0, p, 257, zw, Vw, T, m, w, t, r), O != ve || m[0] === 0 ? (O == Le ? _.msg = "oversubscribed literal/length tree" : O != $f && (_.msg = "incomplete literal/length tree", O = Le), O) : (l(288), O = o(d, p, c, 0, Zw, Gw, g, y, w, t, r), O != ve || y[0] === 0 && p > 257 ? (O == Le ? _.msg = "oversubscribed distance tree" : O == ir ? (_.msg = "incomplete distance tree", O = Le) : O != $f && (_.msg = "empty distance tree with lengths", O = Le), O) : ve);
+    return l(288), t[0] = 0, O = o(d, 0, p, 257, zw, Vw, S, m, w, t, r), O != ve || m[0] === 0 ? (O == Le ? _.msg = "oversubscribed literal/length tree" : O != $f && (_.msg = "incomplete literal/length tree", O = Le), O) : (l(288), O = o(d, p, c, 0, Zw, Gw, g, y, w, t, r), O != ve || y[0] === 0 && p > 257 ? (O == Le ? _.msg = "oversubscribed distance tree" : O == ir ? (_.msg = "incomplete distance tree", O = Le) : O != $f && (_.msg = "empty distance tree with lengths", O = Le), O) : ve);
   };
 }
 io.inflate_trees_fixed = function(e, t, r, i) {
@@ -10064,170 +10064,170 @@ io.inflate_trees_fixed = function(e, t, r, i) {
 const $s = 0, Rf = 1, Ff = 2, Lf = 3, If = 4, Cf = 5, jf = 6, Ta = 7, Nf = 8, Rs = 9;
 function Yw() {
   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, T = 0;
-  function g(w, _, O, E, C, $, L, j) {
-    let b, F, P, S, I, R, D, V, B, Y, G, te, z, X, ee, Z;
-    D = j.next_in_index, V = j.avail_in, I = L.bitb, R = L.bitk, B = L.write, Y = B < L.read ? L.read - B - 1 : L.end - B, G = _t[w], te = _t[_];
+  let t, r = 0, i, a = 0, s = 0, n = 0, o = 0, l = 0, p = 0, c = 0, d, m = 0, y, S = 0;
+  function g(w, _, O, E, L, $, I, C) {
+    let b, F, P, T, 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--, I |= (j.read_byte(D++) & 255) << R, R += 8;
-      if (b = I & G, F = O, P = E, Z = (P + b) * 3, (S = F[Z]) === 0) {
-        I >>= F[Z + 1], R -= F[Z + 1], L.win[B++] = /* (byte) */
+        V--, j |= (C.read_byte(D++) & 255) << R, R += 8;
+      if (b = j & G, F = O, P = E, Z = (P + b) * 3, (T = F[Z]) === 0) {
+        j >>= F[Z + 1], R -= F[Z + 1], I.win[B++] = /* (byte) */
         F[Z + 2], Y--;
         continue;
       }
       do {
-        if (I >>= F[Z + 1], R -= F[Z + 1], S & 16) {
-          for (S &= 15, z = F[Z + 2] + /* (int) */
-          (I & _t[S]), I >>= S, R -= S; R < 15; )
-            V--, I |= (j.read_byte(D++) & 255) << R, R += 8;
-          b = I & te, F = C, P = $, Z = (P + b) * 3, S = F[Z];
+        if (j >>= F[Z + 1], R -= F[Z + 1], T & 16) {
+          for (T &= 15, z = F[Z + 2] + /* (int) */
+          (j & _t[T]), j >>= T, R -= T; R < 15; )
+            V--, j |= (C.read_byte(D++) & 255) << R, R += 8;
+          b = j & te, F = L, P = $, Z = (P + b) * 3, T = F[Z];
           do
-            if (I >>= F[Z + 1], R -= F[Z + 1], S & 16) {
-              for (S &= 15; R < S; )
-                V--, I |= (j.read_byte(D++) & 255) << R, R += 8;
-              if (X = F[Z + 2] + (I & _t[S]), I >>= 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);
+            if (j >>= F[Z + 1], R -= F[Z + 1], T & 16) {
+              for (T &= 15; R < T; )
+                V--, j |= (C.read_byte(D++) & 255) << R, R += 8;
+              if (X = F[Z + 2] + (j & _t[T]), j >>= T, R -= T, Y -= z, B >= X)
+                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 (z -= S, B - ee > 0 && S > B - ee)
+                if (T = I.end - ee, z > T) {
+                  if (z -= T, B - ee > 0 && T > B - ee)
                     do
-                      L.win[B++] = L.win[ee++];
-                    while (--S !== 0);
+                      I.win[B++] = I.win[ee++];
+                    while (--T !== 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 + T), B), B += T, ee += T, T = 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 += I & _t[S], Z = (P + b) * 3, S = F[Z];
+            } else if (!(T & 64))
+              b += F[Z + 2], b += j & _t[T], Z = (P + b) * 3, T = F[Z];
             else
-              return j.msg = "invalid distance code", z = j.avail_in - V, z = R >> 3 < z ? R >> 3 : z, V += z, D -= z, R -= z << 3, L.bitb = I, L.bitk = R, j.avail_in = V, j.total_in += D - j.next_in_index, j.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 = j.avail_in - V, z = R >> 3 < z ? R >> 3 : z, V += z, D -= z, R -= z << 3, L.bitb = I, L.bitk = R, j.avail_in = V, j.total_in += D - j.next_in_index, j.next_in_index = D, L.write = B, sr) : (j.msg = "invalid literal/length code", z = j.avail_in - V, z = R >> 3 < z ? R >> 3 : z, V += z, D -= z, R -= z << 3, L.bitb = I, L.bitk = R, j.avail_in = V, j.total_in += D - j.next_in_index, j.next_in_index = D, L.write = B, Le);
-        if (b += F[Z + 2], b += I & _t[S], Z = (P + b) * 3, (S = F[Z]) === 0) {
-          I >>= F[Z + 1], R -= F[Z + 1], L.win[B++] = /* (byte) */
+        if (T & 64)
+          return T & 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[T], Z = (P + b) * 3, (T = 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 = j.avail_in - V, z = R >> 3 < z ? R >> 3 : z, V += z, D -= z, R -= z << 3, L.bitb = I, L.bitk = R, j.avail_in = V, j.total_in += D - j.next_in_index, j.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, _, O, E, C, $) {
+  e.init = function(w, _, O, E, L, $) {
     t = $s, p = /* (byte) */
     w, c = /* (byte) */
-    _, d = O, m = E, y = C, T = $, i = null;
+    _, d = O, m = E, y = L, S = $, i = null;
   }, e.proc = function(w, _, O) {
-    let E, C, $, L = 0, j = 0, b = 0, F, P, S, I;
-    for (b = _.next_in_index, F = _.avail_in, L = w.bitb, j = 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, P, T, j;
+    for (b = _.next_in_index, F = _.avail_in, I = w.bitb, C = w.bitk, P = w.write, T = P < w.read ? w.read - P - 1 : w.end - P; ; )
       switch (t) {
         case $s:
-          if (S >= 258 && F >= 10 && (w.bitb = L, w.bitk = j, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = P, O = g(p, c, d, m, y, T, w, _), b = _.next_in_index, F = _.avail_in, L = w.bitb, j = w.bitk, P = w.write, S = P < w.read ? w.read - P - 1 : w.end - P, O != ve)) {
+          if (T >= 258 && F >= 10 && (w.bitb = I, w.bitk = C, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = P, O = g(p, c, d, m, y, S, w, _), b = _.next_in_index, F = _.avail_in, I = w.bitb, C = w.bitk, P = w.write, T = P < w.read ? w.read - P - 1 : w.end - P, O != ve)) {
             t = O == sr ? Ta : Rs;
             break;
           }
           s = p, i = d, a = m, t = Rf;
         case Rf:
-          for (E = s; j < E; ) {
+          for (E = s; C < E; ) {
             if (F !== 0)
               O = ve;
             else
-              return w.bitb = L, w.bitk = j, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = P, w.inflate_flush(_, O);
-            F--, L |= (_.read_byte(b++) & 255) << j, j += 8;
+              return w.bitb = I, w.bitk = C, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = P, w.inflate_flush(_, O);
+            F--, I |= (_.read_byte(b++) & 255) << C, C += 8;
           }
-          if (C = (a + (L & _t[E])) * 3, L >>>= i[C + 1], j -= i[C + 1], $ = i[C], $ === 0) {
-            n = i[C + 2], t = jf;
+          if (L = (a + (I & _t[E])) * 3, I >>>= i[L + 1], C -= i[L + 1], $ = i[L], $ === 0) {
+            n = i[L + 2], t = jf;
             break;
           }
           if ($ & 16) {
-            o = $ & 15, r = i[C + 2], t = Ff;
+            o = $ & 15, r = i[L + 2], t = Ff;
             break;
           }
           if (!($ & 64)) {
-            s = $, a = C / 3 + i[C + 2];
+            s = $, a = L / 3 + i[L + 2];
             break;
           }
           if ($ & 32) {
             t = Ta;
             break;
           }
-          return t = Rs, _.msg = "invalid literal/length code", O = Le, w.bitb = L, w.bitk = j, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = P, w.inflate_flush(_, O);
+          return t = Rs, _.msg = "invalid literal/length code", O = Le, w.bitb = I, w.bitk = C, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = P, w.inflate_flush(_, O);
         case Ff:
-          for (E = o; j < E; ) {
+          for (E = o; C < E; ) {
             if (F !== 0)
               O = ve;
             else
-              return w.bitb = L, w.bitk = j, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = P, w.inflate_flush(_, O);
-            F--, L |= (_.read_byte(b++) & 255) << j, j += 8;
+              return w.bitb = I, w.bitk = C, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = P, w.inflate_flush(_, O);
+            F--, I |= (_.read_byte(b++) & 255) << C, C += 8;
           }
-          r += L & _t[E], L >>= E, j -= E, s = c, i = y, a = T, t = Lf;
+          r += I & _t[E], I >>= E, C -= E, s = c, i = y, a = S, t = Lf;
         case Lf:
-          for (E = s; j < E; ) {
+          for (E = s; C < E; ) {
             if (F !== 0)
               O = ve;
             else
-              return w.bitb = L, w.bitk = j, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = P, w.inflate_flush(_, O);
-            F--, L |= (_.read_byte(b++) & 255) << j, j += 8;
+              return w.bitb = I, w.bitk = C, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = P, w.inflate_flush(_, O);
+            F--, I |= (_.read_byte(b++) & 255) << C, C += 8;
           }
-          if (C = (a + (L & _t[E])) * 3, L >>= i[C + 1], j -= i[C + 1], $ = i[C], $ & 16) {
-            o = $ & 15, l = i[C + 2], t = If;
+          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 = If;
             break;
           }
           if (!($ & 64)) {
-            s = $, a = C / 3 + i[C + 2];
+            s = $, a = L / 3 + i[L + 2];
             break;
           }
-          return t = Rs, _.msg = "invalid distance code", O = Le, w.bitb = L, w.bitk = j, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = P, w.inflate_flush(_, O);
+          return t = Rs, _.msg = "invalid distance code", O = Le, w.bitb = I, w.bitk = C, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = P, w.inflate_flush(_, O);
         case If:
-          for (E = o; j < E; ) {
+          for (E = o; C < E; ) {
             if (F !== 0)
               O = ve;
             else
-              return w.bitb = L, w.bitk = j, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = P, w.inflate_flush(_, O);
-            F--, L |= (_.read_byte(b++) & 255) << j, j += 8;
+              return w.bitb = I, w.bitk = C, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = P, w.inflate_flush(_, O);
+            F--, I |= (_.read_byte(b++) & 255) << C, C += 8;
           }
-          l += L & _t[E], L >>= E, j -= E, t = Cf;
+          l += I & _t[E], I >>= E, C -= E, t = Cf;
         case Cf:
-          for (I = P - l; I < 0; )
-            I += w.end;
+          for (j = P - 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, O = w.inflate_flush(_, O), 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 = j, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = P, w.inflate_flush(_, O);
-            w.win[P++] = w.win[I++], S--, I == w.end && (I = 0), r--;
+            if (T === 0 && (P == w.end && w.read !== 0 && (P = 0, T = P < w.read ? w.read - P - 1 : w.end - P), T === 0 && (w.write = P, O = w.inflate_flush(_, O), P = w.write, T = P < w.read ? w.read - P - 1 : w.end - P, P == w.end && w.read !== 0 && (P = 0, T = P < w.read ? w.read - P - 1 : w.end - P), T === 0)))
+              return w.bitb = I, w.bitk = C, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = P, w.inflate_flush(_, O);
+            w.win[P++] = w.win[j++], T--, j == w.end && (j = 0), r--;
           }
           t = $s;
           break;
         case jf:
-          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, O = w.inflate_flush(_, O), 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 = j, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = P, w.inflate_flush(_, O);
+          if (T === 0 && (P == w.end && w.read !== 0 && (P = 0, T = P < w.read ? w.read - P - 1 : w.end - P), T === 0 && (w.write = P, O = w.inflate_flush(_, O), P = w.write, T = P < w.read ? w.read - P - 1 : w.end - P, P == w.end && w.read !== 0 && (P = 0, T = P < w.read ? w.read - P - 1 : w.end - P), T === 0)))
+            return w.bitb = I, w.bitk = C, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = P, w.inflate_flush(_, O);
           O = ve, w.win[P++] = /* (byte) */
-          n, S--, t = $s;
+          n, T--, t = $s;
           break;
         case Ta:
-          if (j > 7 && (j -= 8, F++, b--), w.write = P, O = w.inflate_flush(_, O), P = w.write, S = P < w.read ? w.read - P - 1 : w.end - P, w.read != w.write)
-            return w.bitb = L, w.bitk = j, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = P, w.inflate_flush(_, O);
+          if (C > 7 && (C -= 8, F++, b--), w.write = P, O = w.inflate_flush(_, O), P = w.write, T = P < w.read ? w.read - P - 1 : w.end - P, 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 = P, w.inflate_flush(_, O);
           t = Nf;
         case Nf:
-          return O = sr, w.bitb = L, w.bitk = j, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = P, w.inflate_flush(_, O);
+          return O = sr, w.bitb = I, w.bitk = C, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = P, w.inflate_flush(_, O);
         case Rs:
-          return O = Le, w.bitb = L, w.bitk = j, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = P, w.inflate_flush(_, O);
+          return O = Le, w.bitb = I, w.bitk = C, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = P, w.inflate_flush(_, O);
         default:
-          return O = dt, w.bitb = L, w.bitk = j, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = P, w.inflate_flush(_, O);
+          return O = dt, w.bitb = I, w.bitk = C, _.avail_in = F, _.total_in += b - _.next_in_index, _.next_in_index = b, w.write = P, w.inflate_flush(_, O);
       }
   }, e.free = function() {
   };
@@ -10259,7 +10259,7 @@ function Kw(e, t) {
   let i = Kr, a = 0, s = 0, n = 0, o;
   const l = [0], p = [0], c = new Yw();
   let d = 0, m = new Int32Array(mu * 3);
-  const y = 0, T = new io();
+  const y = 0, S = new io();
   r.bitk = 0, r.bitb = 0, r.win = new Uint8Array(t), r.end = t, r.read = 0, r.write = 0, r.reset = function(g, w) {
     w && (w[0] = y), i == Fs && c.free(g), i = Kr, r.bitk = 0, r.bitb = 0, r.read = r.write = 0;
   }, r.reset(e, null), r.inflate_flush = function(g, w) {
@@ -10267,18 +10267,18 @@ function Kw(e, t) {
     return O = 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 + _), O), O += _, 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 + _), O), O += _, E += _), g.next_out_index = O, r.read = E, w;
   }, r.proc = function(g, w) {
-    let _, O, E, C, $, L, j, b;
-    for (C = g.next_in_index, $ = g.avail_in, O = r.bitb, E = r.bitk, L = r.write, j = /* (int) */
-    L < r.read ? r.read - L - 1 : r.end - L; ; ) {
-      let F, P, S, I, R, D, V, B;
+    let _, O, E, L, $, I, C, b;
+    for (L = g.next_in_index, $ = g.avail_in, O = r.bitb, E = r.bitk, I = r.write, C = /* (int) */
+    I < r.read ? r.read - I - 1 : r.end - I; ; ) {
+      let F, P, T, j, R, D, V, B;
       switch (i) {
         case Kr:
           for (; E < 3; ) {
             if ($ !== 0)
               w = ve;
             else
-              return r.bitb = O, r.bitk = E, g.avail_in = $, g.total_in += C - g.next_in_index, g.next_in_index = C, r.write = L, r.inflate_flush(g, w);
-            $--, O |= (g.read_byte(C++) & 255) << E, E += 8;
+              return r.bitb = O, 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);
+            $--, O |= (g.read_byte(L++) & 255) << E, E += 8;
           }
           switch (_ = /* (int) */
           O & 7, d = _ & 1, _ >>> 1) {
@@ -10286,13 +10286,13 @@ function Kw(e, t) {
               O >>>= 3, E -= 3, _ = E & 7, O >>>= _, E -= _, i = Oa;
               break;
             case 1:
-              F = [], P = [], S = [[]], I = [[]], io.inflate_trees_fixed(F, P, S, I), c.init(F[0], P[0], S[0], 0, I[0], 0), O >>>= 3, E -= 3, i = Fs;
+              F = [], P = [], T = [[]], j = [[]], io.inflate_trees_fixed(F, P, T, j), c.init(F[0], P[0], T[0], 0, j[0], 0), O >>>= 3, E -= 3, i = Fs;
               break;
             case 2:
               O >>>= 3, E -= 3, i = Bf;
               break;
             case 3:
-              return O >>>= 3, E -= 3, i = kr, g.msg = "invalid block type", w = Le, r.bitb = O, r.bitk = E, g.avail_in = $, g.total_in += C - g.next_in_index, g.next_in_index = C, r.write = L, r.inflate_flush(g, w);
+              return O >>>= 3, E -= 3, i = kr, g.msg = "invalid block type", w = Le, r.bitb = O, 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:
@@ -10300,20 +10300,20 @@ function Kw(e, t) {
             if ($ !== 0)
               w = ve;
             else
-              return r.bitb = O, r.bitk = E, g.avail_in = $, g.total_in += C - g.next_in_index, g.next_in_index = C, r.write = L, r.inflate_flush(g, w);
-            $--, O |= (g.read_byte(C++) & 255) << E, E += 8;
+              return r.bitb = O, 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);
+            $--, O |= (g.read_byte(L++) & 255) << E, E += 8;
           }
           if ((~O >>> 16 & 65535) != (O & 65535))
-            return i = kr, g.msg = "invalid stored block lengths", w = Le, r.bitb = O, r.bitk = E, g.avail_in = $, g.total_in += C - g.next_in_index, g.next_in_index = C, r.write = L, r.inflate_flush(g, w);
+            return i = kr, g.msg = "invalid stored block lengths", w = Le, r.bitb = O, 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 = O & 65535, O = E = 0, i = a !== 0 ? Uf : d !== 0 ? Ls : Kr;
           break;
         case Uf:
-          if ($ === 0 || j === 0 && (L == r.end && r.read !== 0 && (L = 0, j = /* (int) */
-          L < r.read ? r.read - L - 1 : r.end - L), j === 0 && (r.write = L, w = r.inflate_flush(g, w), L = r.write, j = /* (int) */
-          L < r.read ? r.read - L - 1 : r.end - L, L == r.end && r.read !== 0 && (L = 0, j = /* (int) */
-          L < r.read ? r.read - L - 1 : r.end - L), j === 0)))
-            return r.bitb = O, r.bitk = E, g.avail_in = $, g.total_in += C - g.next_in_index, g.next_in_index = C, r.write = L, r.inflate_flush(g, w);
-          if (w = ve, _ = a, _ > $ && (_ = $), _ > j && (_ = j), r.win.set(g.read_buf(C, _), L), C += _, $ -= _, L += _, j -= _, (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 = O, 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;
@@ -10322,11 +10322,11 @@ function Kw(e, t) {
             if ($ !== 0)
               w = ve;
             else
-              return r.bitb = O, r.bitk = E, g.avail_in = $, g.total_in += C - g.next_in_index, g.next_in_index = C, r.write = L, r.inflate_flush(g, w);
-            $--, O |= (g.read_byte(C++) & 255) << E, E += 8;
+              return r.bitb = O, 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);
+            $--, O |= (g.read_byte(L++) & 255) << E, E += 8;
           }
           if (s = _ = O & 16383, (_ & 31) > 29 || (_ >> 5 & 31) > 29)
-            return i = kr, g.msg = "too many length or distance symbols", w = Le, r.bitb = O, r.bitk = E, g.avail_in = $, g.total_in += C - g.next_in_index, g.next_in_index = C, r.write = L, r.inflate_flush(g, w);
+            return i = kr, g.msg = "too many length or distance symbols", w = Le, r.bitb = O, 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
@@ -10339,15 +10339,15 @@ function Kw(e, t) {
               if ($ !== 0)
                 w = ve;
               else
-                return r.bitb = O, r.bitk = E, g.avail_in = $, g.total_in += C - g.next_in_index, g.next_in_index = C, r.write = L, r.inflate_flush(g, w);
-              $--, O |= (g.read_byte(C++) & 255) << E, E += 8;
+                return r.bitb = O, 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);
+              $--, O |= (g.read_byte(L++) & 255) << E, E += 8;
             }
             o[Df[n++]] = O & 7, O >>>= 3, E -= 3;
           }
           for (; n < 19; )
             o[Df[n++]] = 0;
-          if (l[0] = 7, _ = T.inflate_trees_bits(o, l, p, m, g), _ != ve)
-            return w = _, w == Le && (o = null, i = kr), r.bitb = O, r.bitk = E, g.avail_in = $, g.total_in += C - g.next_in_index, g.next_in_index = C, r.write = L, r.inflate_flush(g, w);
+          if (l[0] = 7, _ = S.inflate_trees_bits(o, l, p, m, g), _ != ve)
+            return w = _, w == Le && (o = null, i = kr), r.bitb = O, 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 = Mf;
         case Mf:
           for (; _ = s, !(n >= 258 + (_ & 31) + (_ >> 5 & 31)); ) {
@@ -10356,8 +10356,8 @@ function Kw(e, t) {
               if ($ !== 0)
                 w = ve;
               else
-                return r.bitb = O, r.bitk = E, g.avail_in = $, g.total_in += C - g.next_in_index, g.next_in_index = C, r.write = L, r.inflate_flush(g, w);
-              $--, O |= (g.read_byte(C++) & 255) << E, E += 8;
+                return r.bitb = O, 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);
+              $--, O |= (g.read_byte(L++) & 255) << E, E += 8;
             }
             if (_ = m[(p[0] + (O & _t[_])) * 3 + 1], G = m[(p[0] + (O & _t[_])) * 3 + 2], G < 16)
               O >>>= _, E -= _, o[n++] = G;
@@ -10366,11 +10366,11 @@ function Kw(e, t) {
                 if ($ !== 0)
                   w = ve;
                 else
-                  return r.bitb = O, r.bitk = E, g.avail_in = $, g.total_in += C - g.next_in_index, g.next_in_index = C, r.write = L, r.inflate_flush(g, w);
-                $--, O |= (g.read_byte(C++) & 255) << E, E += 8;
+                  return r.bitb = O, 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);
+                $--, O |= (g.read_byte(L++) & 255) << E, E += 8;
               }
               if (O >>>= _, E -= _, Y += O & _t[b], O >>>= 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 = O, r.bitk = E, g.avail_in = $, g.total_in += C - g.next_in_index, g.next_in_index = C, r.write = L, r.inflate_flush(g, w);
+                return o = null, i = kr, g.msg = "invalid bit length repeat", w = Le, r.bitb = O, 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,29 +10378,29 @@ function Kw(e, t) {
               n = b;
             }
           }
-          if (p[0] = -1, R = [], D = [], V = [], B = [], R[0] = 9, D[0] = 6, _ = s, _ = T.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 = O, r.bitk = E, g.avail_in = $, g.total_in += C - g.next_in_index, g.next_in_index = C, r.write = L, r.inflate_flush(g, w);
+          if (p[0] = -1, R = [], D = [], V = [], B = [], R[0] = 9, D[0] = 6, _ = s, _ = S.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 = O, 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 = O, r.bitk = E, g.avail_in = $, g.total_in += C - g.next_in_index, g.next_in_index = C, r.write = L, (w = c.proc(r, g, w)) != sr)
+          if (r.bitb = O, 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), C = g.next_in_index, $ = g.avail_in, O = r.bitb, E = r.bitk, L = r.write, j = /* (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, O = 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, j = /* (int) */
-          L < r.read ? r.read - L - 1 : r.end - L, r.read != r.write)
-            return r.bitb = O, r.bitk = E, g.avail_in = $, g.total_in += C - g.next_in_index, g.next_in_index = C, 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 = O, 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 = Wf;
         case Wf:
-          return w = sr, r.bitb = O, r.bitk = E, g.avail_in = $, g.total_in += C - g.next_in_index, g.next_in_index = C, r.write = L, r.inflate_flush(g, w);
+          return w = sr, r.bitb = O, 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 = O, r.bitk = E, g.avail_in = $, g.total_in += C - g.next_in_index, g.next_in_index = C, r.write = L, r.inflate_flush(g, w);
+          return w = Le, r.bitb = O, 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 = dt, r.bitb = O, r.bitk = E, g.avail_in = $, g.total_in += C - g.next_in_index, g.next_in_index = C, r.write = L, r.inflate_flush(g, w);
+          return w = dt, r.bitb = O, 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) {
@@ -10542,7 +10542,7 @@ function r1(e) {
   let n = !1;
   r.inflateInit(), r.next_out = s, t.append = function(o, l) {
     const p = [];
-    let c, d, m = 0, y = 0, T = 0;
+    let c, d, m = 0, y = 0, S = 0;
     if (o.length !== 0) {
       r.next_in_index = 0, r.next_in = o, r.avail_in = o.length;
       do {
@@ -10553,9 +10553,9 @@ function r1(e) {
           throw new Error("inflating: " + r.msg);
         if ((n || c === sr) && r.avail_in === o.length)
           throw new Error("inflating: bad input");
-        r.next_out_index && (r.next_out_index === i ? p.push(new Uint8Array(s)) : p.push(s.subarray(0, r.next_out_index))), T += r.next_out_index, l && r.next_in_index > 0 && r.next_in_index != m && (l(r.next_in_index), m = r.next_in_index);
+        r.next_out_index && (r.next_out_index === i ? p.push(new Uint8Array(s)) : p.push(s.subarray(0, r.next_out_index))), S += r.next_out_index, l && r.next_in_index > 0 && r.next_in_index != m && (l(r.next_in_index), m = r.next_in_index);
       } while (r.avail_in > 0 || r.avail_out === 0);
-      return p.length > 1 ? (d = new Uint8Array(T), p.forEach(function(g) {
+      return p.length > 1 ? (d = new Uint8Array(S), p.forEach(function(g) {
         d.set(g, y), y += g.length;
       })) : d = p[0] ? new Uint8Array(p[0]) : new Uint8Array(), d;
     }
@@ -12506,8 +12506,8 @@ vu.aes = class {
       let d = n ^ n << 1 ^ n << 2 ^ n << 3 ^ n << 4;
       d = d >> 8 ^ d & 255 ^ 99, r[c] = d, i[d] = c, p = a[l = a[o = a[c]]];
       let m = p * 16843009 ^ l * 65537 ^ o * 257 ^ c * 16843008, y = a[d] * 257 ^ d * 16843008;
-      for (let T = 0; T < 4; T++)
-        e[T][c] = y = y << 24 ^ y >>> 8, t[T][d] = m = m << 24 ^ m >>> 8;
+      for (let S = 0; S < 4; S++)
+        e[S][c] = y = y << 24 ^ y >>> 8, t[S][d] = m = m << 24 ^ m >>> 8;
     }
     for (let c = 0; c < 5; c++)
       e[c] = e[c].slice(0), t[c] = t[c].slice(0);
@@ -12523,11 +12523,11 @@ vu.aes = class {
     if (e.length !== 4)
       throw new Error("invalid aes block size");
     const r = this._key[t], i = r.length / 4 - 2, a = [0, 0, 0, 0], s = this._tables[t], n = s[0], o = s[1], l = s[2], p = s[3], c = s[4];
-    let d = e[0] ^ r[0], m = e[t ? 3 : 1] ^ r[1], y = e[2] ^ r[2], T = e[t ? 1 : 3] ^ r[3], g = 4, w, _, O;
+    let d = e[0] ^ r[0], m = e[t ? 3 : 1] ^ r[1], y = e[2] ^ r[2], S = e[t ? 1 : 3] ^ r[3], g = 4, w, _, O;
     for (let E = 0; E < i; E++)
-      w = n[d >>> 24] ^ o[m >> 16 & 255] ^ l[y >> 8 & 255] ^ p[T & 255] ^ r[g], _ = n[m >>> 24] ^ o[y >> 16 & 255] ^ l[T >> 8 & 255] ^ p[d & 255] ^ r[g + 1], O = n[y >>> 24] ^ o[T >> 16 & 255] ^ l[d >> 8 & 255] ^ p[m & 255] ^ r[g + 2], T = n[T >>> 24] ^ o[d >> 16 & 255] ^ l[m >> 8 & 255] ^ p[y & 255] ^ r[g + 3], g += 4, d = w, m = _, y = O;
+      w = n[d >>> 24] ^ o[m >> 16 & 255] ^ l[y >> 8 & 255] ^ p[S & 255] ^ r[g], _ = n[m >>> 24] ^ o[y >> 16 & 255] ^ l[S >> 8 & 255] ^ p[d & 255] ^ r[g + 1], O = n[y >>> 24] ^ o[S >> 16 & 255] ^ l[d >> 8 & 255] ^ p[m & 255] ^ r[g + 2], S = n[S >>> 24] ^ o[d >> 16 & 255] ^ l[m >> 8 & 255] ^ p[y & 255] ^ r[g + 3], g += 4, d = w, m = _, y = O;
     for (let E = 0; E < 4; E++)
-      a[t ? 3 & -E : E] = c[d >>> 24] << 24 ^ c[m >> 16 & 255] << 16 ^ c[y >> 8 & 255] << 8 ^ c[T & 255] ^ r[g++], w = d, d = m, m = y, y = T, T = w;
+      a[t ? 3 & -E : E] = c[d >>> 24] << 24 ^ c[m >> 16 & 255] << 16 ^ c[y >> 8 & 255] << 8 ^ c[S & 255] ^ r[g++], w = d, d = m, m = y, y = S, S = w;
     return a;
   }
 };
@@ -12679,12 +12679,12 @@ class C1 extends TransformStream {
         if (p && l) {
           await d;
           const m = Ot(c, 0, c.length - hr), y = Ot(c, c.length - hr);
-          let T = new Uint8Array();
+          let S = new Uint8Array();
           if (m.length) {
             const g = Qn(Xt, m);
             p.update(g);
             const w = l.update(g);
-            T = Jn(Xt, w);
+            S = Jn(Xt, w);
           }
           if (o) {
             const g = Ot(Jn(Xt, p.digest()), 0, hr);
@@ -12692,7 +12692,7 @@ class C1 extends TransformStream {
               if (g[w] != y[w])
                 throw new Error(Pu);
           }
-          n.enqueue(T);
+          n.enqueue(S);
         }
       }
     });
@@ -12910,8 +12910,8 @@ class H1 extends TransformStream {
   constructor(t, { chunkSize: r, CompressionStream: i, CompressionStreamNative: a }) {
     super({});
     const { compressed: s, encrypted: n, useCompressionStream: o, zipCrypto: l, signed: p, level: c } = t, d = this;
-    let m, y, T = Iu(super.readable);
-    (!n || l) && p && (m = new bu(), T = Jt(T, m)), s && (T = ju(T, o, { level: c, chunkSize: r }, a, i)), n && (l ? T = Jt(T, new W1(t)) : (y = new j1(t), T = Jt(T, y))), Cu(d, T, () => {
+    let m, y, S = Iu(super.readable);
+    (!n || l) && p && (m = new bu(), S = Jt(S, m)), s && (S = ju(S, o, { level: c, chunkSize: r }, a, i)), n && (l ? S = Jt(S, new W1(t)) : (y = new j1(t), S = Jt(S, y))), Cu(d, S, () => {
       let g;
       n && !l && (g = y.signature), (!n || l) && p && (g = new DataView(m.value.buffer).getUint32(0)), d.signature = g;
     });
@@ -12924,8 +12924,8 @@ class z1 extends TransformStream {
     let d, m, y = Iu(super.readable);
     n && (s ? y = Jt(y, new M1(t)) : (m = new C1(t), y = Jt(y, m))), p && (y = ju(y, c, { chunkSize: r }, a, i)), (!n || s) && o && (d = new bu(), y = Jt(y, d)), Cu(this, y, () => {
       if ((!n || s) && o) {
-        const T = new DataView(d.value.buffer);
-        if (l != T.getUint32(0, !1))
+        const S = new DataView(d.value.buffer);
+        if (l != S.getUint32(0, !1))
           throw new Error(Pu);
       }
     });
@@ -13032,8 +13032,8 @@ class La {
       transferStreams: l,
       terminate() {
         return new Promise((m) => {
-          const { worker: y, busy: T } = t;
-          y ? (T ? t.resolveTerminated = m : (y.terminate(), m()), t.interface = null) : m();
+          const { worker: y, busy: S } = t;
+          y ? (S ? t.resolveTerminated = m : (y.terminate(), m()), t.interface = null) : m();
         });
       },
       onTaskFinished() {
@@ -13188,20 +13188,20 @@ async function ib({ data: e }, t) {
   const { type: r, value: i, messageId: a, result: s, error: n } = e, { reader: o, writer: l, resolveResult: p, rejectResult: c, onTaskFinished: d } = t;
   try {
     if (n) {
-      const { message: y, stack: T, code: g, name: w } = n, _ = new Error(y);
-      Object.assign(_, { stack: T, code: g, name: w }), m(_);
+      const { message: y, stack: S, code: g, name: w } = n, _ = new Error(y);
+      Object.assign(_, { stack: S, code: g, name: w }), m(_);
     } else {
       if (r == G1) {
-        const { value: y, done: T } = await o.read();
-        zs({ type: up, value: y, done: T, messageId: a }, t);
+        const { value: y, done: S } = await o.read();
+        zs({ type: up, value: y, done: S, messageId: a }, t);
       }
       r == up && (await l.ready, await l.write(new Uint8Array(i)), zs({ type: Y1, messageId: a }, t)), r == dp && m(null, s);
     }
   } catch (y) {
     zs({ type: dp, messageId: a }, t), m(y);
   }
-  function m(y, T) {
-    y ? c(y) : p(T), l && l.releaseLock(), d();
+  function m(y, S) {
+    y ? c(y) : p(S), l && l.releaseLock(), d();
   }
 }
 let Tr = [];
@@ -13211,8 +13211,8 @@ async function ab(e, t) {
   const { options: r, config: i } = t, { transferStreams: a, useWebWorkers: s, useCompressionStream: n, codecType: o, compressed: l, signed: p, encrypted: c } = r, { workerScripts: d, maxWorkers: m } = i;
   t.transferStreams = a || a === ft;
   const y = !l && !p && !c && !t.transferStreams;
-  return t.useWebWorkers = !y && (s || s === ft && i.useWebWorkers), t.scripts = t.useWebWorkers && d ? d[o] : [], r.useCompressionStream = n || n === ft && i.useCompressionStream, (await T()).run();
-  async function T() {
+  return t.useWebWorkers = !y && (s || s === ft && i.useWebWorkers), t.scripts = t.useWebWorkers && d ? d[o] : [], r.useCompressionStream = n || n === ft && i.useCompressionStream, (await S()).run();
+  async function S() {
     const w = Tr.find((_) => !_.busy);
     if (w)
       return gp(w), new La(w, e, t, g);
@@ -13483,53 +13483,53 @@ class Pp {
     i.chunkSize = x1(a);
     const s = await Zb(i, l1, i.size, Xr, mr * 16);
     if (!s) {
-      const P = await et(i, 0, 4), S = Ye(P);
-      throw Be(S) == o1 ? new Error(vp) : new Error(Lb);
+      const P = await et(i, 0, 4), T = Ye(P);
+      throw Be(T) == o1 ? new Error(vp) : new Error(Lb);
     }
     const n = Ye(s);
     let o = Be(n, 12), l = Be(n, 16);
     const p = s.offset, c = Ge(n, 20), d = p + Xr + c;
     let m = Ge(n, 4);
     const y = i.lastDiskNumber || 0;
-    let T = Ge(n, 6), g = Ge(n, 8), w = 0, _ = 0;
-    if (l == Fr || o == Fr || g == mr || T == mr) {
-      const P = await et(i, s.offset - $a, $a), S = Ye(P);
-      if (Be(S, 0) == f1) {
-        l = Zs(S, 8);
-        let I = await et(i, l, Ra, -1), R = Ye(I);
+    let S = Ge(n, 6), g = Ge(n, 8), w = 0, _ = 0;
+    if (l == Fr || o == Fr || g == mr || S == mr) {
+      const P = await et(i, s.offset - $a, $a), T = Ye(P);
+      if (Be(T, 0) == f1) {
+        l = Zs(T, 8);
+        let j = await et(i, l, Ra, -1), R = Ye(j);
         const D = s.offset - $a - Ra;
         if (Be(R, 0) != Xf && l != D) {
           const V = l;
-          l = D, w = l - V, I = await et(i, l, Ra, -1), R = Ye(I);
+          l = D, w = l - V, j = await et(i, l, Ra, -1), R = Ye(j);
         }
         if (Be(R, 0) != Xf)
           throw new Error(Ib);
-        m == mr && (m = Be(R, 16)), T == mr && (T = Be(R, 20)), g == mr && (g = Zs(R, 32)), o == Fr && (o = Zs(R, 40)), l -= o;
+        m == mr && (m = Be(R, 16)), S == mr && (S = Be(R, 20)), g == mr && (g = Zs(R, 32)), o == Fr && (o = Zs(R, 40)), l -= o;
       }
     }
     if (l >= i.size && (w = i.size - l - o - Xr, l = i.size - o - Xr), y != m)
       throw new Error(vp);
     if (l < 0)
       throw new Error(ja);
-    let O = 0, E = await et(i, l, o, T), C = Ye(E);
+    let O = 0, E = await et(i, l, o, S), L = Ye(E);
     if (o) {
       const P = s.offset - o;
-      if (Be(C, O) != Kf && l != P) {
-        const S = l;
-        l = P, w += l - S, E = await et(i, l, o, T), C = Ye(E);
+      if (Be(L, O) != Kf && l != P) {
+        const T = l;
+        l = P, w += l - T, E = await et(i, l, o, S), L = Ye(E);
       }
     }
     const $ = s.offset - l - (i.lastDiskOffset || 0);
-    if (o != $ && $ >= 0 && (o = $, E = await et(i, l, o, T), C = Ye(E)), l < 0 || l >= i.size)
+    if (o != $ && $ >= 0 && (o = $, E = await et(i, l, o, S), L = Ye(E)), l < 0 || l >= i.size)
       throw new Error(ja);
-    const L = at(r, t, "filenameEncoding"), j = at(r, t, "commentEncoding");
+    const I = at(r, t, "filenameEncoding"), C = at(r, t, "commentEncoding");
     for (let P = 0; P < g; P++) {
-      const S = new Mb(i, a, r.options);
-      if (Be(C, O) != Kf)
+      const T = new Mb(i, a, r.options);
+      if (Be(L, O) != Kf)
         throw new Error(Cb);
-      Ju(S, C, O + 6);
-      const I = !!S.bitFlag.languageEncodingFlag, R = O + 46, D = R + S.filenameLength, V = D + S.extraFieldLength, B = Ge(C, O + 4), Y = B >> 8 == 0, G = B >> 8 == 3, te = E.subarray(R, D), z = Ge(C, O + 32), X = V + z, ee = E.subarray(V, X), Z = I, fe = I, oe = Be(C, O + 38), ie = Y && (pn(C, O + 38) & tp) == tp || G && (oe >> 16 & rp) == rp || te.length && te[te.length - 1] == sp.charCodeAt(0), Ae = G && (oe >> 16 & np) == np, Oe = Be(C, O + 42) + w;
-      Object.assign(S, {
+      Ju(T, L, O + 6);
+      const j = !!T.bitFlag.languageEncodingFlag, R = O + 46, D = R + T.filenameLength, V = D + T.extraFieldLength, B = Ge(L, O + 4), Y = B >> 8 == 0, G = B >> 8 == 3, te = E.subarray(R, D), z = Ge(L, O + 32), X = V + z, ee = E.subarray(V, X), Z = j, fe = j, oe = Be(L, O + 38), ie = Y && (pn(L, O + 38) & tp) == tp || G && (oe >> 16 & rp) == rp || te.length && te[te.length - 1] == sp.charCodeAt(0), Ae = G && (oe >> 16 & np) == np, Oe = Be(L, O + 42) + w;
+      Object.assign(T, {
         versionMadeBy: B,
         msDosCompatible: Y,
         compressedSize: 0,
@@ -13537,31 +13537,31 @@ class Pp {
         commentLength: z,
         directory: ie,
         offset: Oe,
-        diskNumberStart: Ge(C, O + 34),
-        internalFileAttributes: Ge(C, O + 36),
+        diskNumberStart: Ge(L, O + 34),
+        internalFileAttributes: Ge(L, O + 36),
         externalFileAttributes: oe,
         rawFilename: te,
         filenameUTF8: Z,
         commentUTF8: fe,
         rawExtraField: E.subarray(D, V),
         executable: Ae
-      }), S.internalFileAttribute = S.internalFileAttributes, S.externalFileAttribute = S.externalFileAttributes;
-      const Xe = at(r, t, "decodeText") || Vs, rt = Z ? xp : L || kp, Et = fe ? xp : j || kp;
+      }), T.internalFileAttribute = T.internalFileAttributes, T.externalFileAttribute = T.externalFileAttributes;
+      const Xe = at(r, t, "decodeText") || Vs, rt = Z ? xp : I || kp, Et = fe ? xp : C || kp;
       let Ie = Xe(te, rt);
       Ie === ft && (Ie = Vs(te, rt));
       let Ce = Xe(ee, Et);
-      Ce === ft && (Ce = Vs(ee, Et)), Object.assign(S, {
+      Ce === ft && (Ce = Vs(ee, Et)), Object.assign(T, {
         rawComment: ee,
         filename: Ie,
         comment: Ce,
         directory: ie || Ie.endsWith(sp)
-      }), _ = Math.max(Oe, _), Qu(S, S, C, O + 6), S.zipCrypto = S.encrypted && !S.extraFieldAES;
-      const pt = new bp(S);
-      pt.getData = (x, u) => S.getData(x, pt, u), O = X;
+      }), _ = Math.max(Oe, _), Qu(T, T, L, O + 6), T.zipCrypto = T.encrypted && !T.extraFieldAES;
+      const pt = new bp(T);
+      pt.getData = (x, u) => T.getData(x, pt, u), O = X;
       const { onprogress: Re } = t;
       if (Re)
         try {
-          await Re(P + 1, g, new bp(S));
+          await Re(P + 1, g, new bp(T));
         } catch {
         }
       yield pt;
@@ -13597,12 +13597,12 @@ class Mb {
       bitFlag: d,
       signature: m,
       rawLastModDate: y,
-      uncompressedSize: T,
+      uncompressedSize: S,
       compressedSize: g
     } = a, w = r.localDirectory = {}, _ = await et(s, n, 30, o), O = Ye(_);
-    let E = at(a, i, "password"), C = at(a, i, "rawPassword");
+    let E = at(a, i, "password"), L = at(a, i, "rawPassword");
     const $ = at(a, i, "passThrough");
-    if (E = E && E.length && E, C = C && C.length && C, l && l.originalCompressionMethod != i1)
+    if (E = E && E.length && E, L = L && L.length && L, l && l.originalCompressionMethod != i1)
       throw new Error(_p);
     if (p != s1 && p != n1 && !$)
       throw new Error(_p);
@@ -13612,11 +13612,11 @@ class Mb {
       lastAccessDate: w.lastAccessDate,
       creationDate: w.creationDate
     });
-    const L = a.encrypted && w.encrypted && !$, j = L && !l;
-    if ($ || (r.zipCrypto = j), L) {
-      if (!j && l.strength === ft)
+    const I = a.encrypted && w.encrypted && !$, C = I && !l;
+    if ($ || (r.zipCrypto = C), I) {
+      if (!C && l.strength === ft)
         throw new Error(Ub);
-      if (!E && !C)
+      if (!E && !L)
         throw new Error(Db);
     }
     const b = n + 30 + w.filenameLength + w.extraFieldLength, F = g, P = s.readable;
@@ -13625,39 +13625,39 @@ class Mb {
       offset: b,
       size: F
     });
-    const S = at(a, i, "signal"), I = at(a, i, "checkPasswordOnly");
-    I && (t = new WritableStream()), t = mb(t), await pi(t, $ ? g : T);
+    const T = at(a, i, "signal"), j = at(a, i, "checkPasswordOnly");
+    j && (t = new WritableStream()), t = mb(t), await pi(t, $ ? g : S);
     const { writable: R } = t, { onstart: D, onprogress: V, onend: B } = i, Y = {
       options: {
         codecType: Nu,
         password: E,
-        rawPassword: C,
-        zipCrypto: j,
+        rawPassword: L,
+        zipCrypto: C,
         encryptionStrength: l && l.strength,
         signed: at(a, i, "checkSignature") && !$,
-        passwordVerification: j && (d.dataDescriptor ? y >>> 8 & 255 : m >>> 24 & 255),
+        passwordVerification: C && (d.dataDescriptor ? y >>> 8 & 255 : m >>> 24 & 255),
         signature: m,
         compressed: p != 0 && !$,
         encrypted: a.encrypted && !$,
         useWebWorkers: at(a, i, "useWebWorkers"),
         useCompressionStream: at(a, i, "useCompressionStream"),
         transferStreams: at(a, i, "transferStreams"),
-        checkPasswordOnly: I
+        checkPasswordOnly: j
       },
       config: c,
-      streamOptions: { signal: S, size: F, onstart: D, onprogress: V, onend: B }
+      streamOptions: { signal: T, size: F, onstart: D, onprogress: V, onend: B }
     };
     let G = 0;
     try {
       ({ outputSize: G } = await ab({ readable: P, writable: R }, Y));
     } catch (te) {
-      if (!I || te.message != Do)
+      if (!j || te.message != Do)
         throw te;
     } finally {
       const te = at(a, i, "preventClose");
       R.size += G, !te && !R.locked && await R.getWriter().close();
     }
-    return I ? ft : t.getData ? t.getData() : R;
+    return j ? ft : t.getData ? t.getData() : R;
   }
 }
 function Ju(e, t, r) {
@@ -13703,8 +13703,8 @@ function Qu(e, t, r, i, a) {
   m && (Ep(m, zu, Vu, t, e), t.extraFieldUnicodeComment = m);
   const y = n.get(c1);
   y ? (Hb(y, t, p), t.extraFieldAES = y) : t.compressionMethod = p;
-  const T = n.get(u1);
-  T && (zb(T, t), t.extraFieldNTFS = T);
+  const S = n.get(u1);
+  S && (zb(S, t), t.extraFieldNTFS = S);
   const g = n.get(h1);
   g && (Vb(g, t, a), t.extraFieldExtendedTimestamp = g);
   const w = n.get(g1);
@@ -14090,8 +14090,8 @@ async function n_(e, t, r, i) {
     const p = new Headers(a.headers), c = ((l = p.get("x-cors-proxy-allowed-request-headers")) == null ? void 0 : l.split(",")) || [], d = c.includes("authorization") || c.includes("cookie"), m = p.get("content-type");
     m && m.toLowerCase().includes("multipart/form-data") && (p.set("x-cors-proxy-content-type", m), p.set("content-type", "application/octet-stream"));
     let y = null;
-    const T = a.method.toUpperCase();
-    T !== "GET" && T !== "HEAD" && (await e_() ? y = o.body : y = await o.arrayBuffer()), y instanceof ReadableStream && new URL(r, import.meta.url).protocol === "http:" && (y = await new Response(y).arrayBuffer());
+    const S = a.method.toUpperCase();
+    S !== "GET" && S !== "HEAD" && (await e_() ? y = o.body : y = await o.arrayBuffer()), y instanceof ReadableStream && new URL(r, import.meta.url).protocol === "http:" && (y = await new Response(y).arrayBuffer());
     const g = await co(a, {
       url: `${r}${a.url}`,
       headers: p,
@@ -14184,10 +14184,10 @@ function u_(e) {
     return null;
   const s = i.get("release"), n = i.get("asset");
   if (s && n) {
-    const T = s === "latest" ? "releases/latest/download" : `releases/download/${s}`;
+    const S = s === "latest" ? "releases/latest/download" : `releases/download/${s}`;
     return {
       resource: "url",
-      url: `https://github.com/${a}/${T}/${n}`
+      url: `https://github.com/${a}/${S}/${n}`
     };
   }
   let o, l;
@@ -16152,13 +16152,13 @@ const ud = async (e, { themeSlug: t = "" }, r) => {
     }
   const o = Se(a, "wp-content"), l = Se(i, "wp-content");
   for (const y of dd) {
-    const T = Se(
+    const S = Se(
       o,
       y
     );
-    await Tp(e, T);
+    await Tp(e, S);
     const g = Se(l, y);
-    await e.fileExists(g) && (await e.mkdir(Un(T)), await e.mv(g, T));
+    await e.fileExists(g) && (await e.mkdir(Un(S)), await e.mv(g, S));
   }
   const p = Se(
     a,
@@ -16301,20 +16301,20 @@ async function hd(e, {
     const d = c.length === 1 && await e.isDir(c[0]);
     let m, y = "";
     d ? (y = c[0], m = c[0].split("/").pop()) : (y = p, m = n), a && a.length && (m = a);
-    const T = `${t}/${m}`;
-    if (await e.fileExists(T)) {
-      if (!await e.isDir(T))
+    const S = `${t}/${m}`;
+    if (await e.fileExists(S)) {
+      if (!await e.isDir(S))
         throw new Error(
-          `Cannot install asset ${m} to ${T} because a file with the same name already exists. Note it's a file, not a directory! Is this by mistake?`
+          `Cannot install asset ${m} to ${S} because a file with the same name already exists. Note it's a file, not a directory! Is this by mistake?`
         );
       if (i === "overwrite")
-        await e.rmdir(T, {
+        await e.rmdir(S, {
           recursive: !0
         });
       else {
         if (i === "skip")
           return {
-            assetFolderPath: T,
+            assetFolderPath: S,
             assetFolderName: m
           };
         throw new Error(
@@ -16322,8 +16322,8 @@ async function hd(e, {
         );
       }
     }
-    return await e.mv(y, T), {
-      assetFolderPath: T,
+    return await e.mv(y, S), {
+      assetFolderPath: S,
       assetFolderName: m
     };
   } finally {
@@ -16658,27 +16658,27 @@ const ov = async (e, t) => {
   const c = new rs({ concurrency: 5 }), d = s.map(
     ({ url: m, type: y }) => c.run(async () => {
       try {
-        const T = await fetch(m);
-        if (!T.ok)
+        const S = await fetch(m);
+        if (!S.ok)
           throw new Error(
-            `Failed to download translations for ${y}: ${T.statusText}`
+            `Failed to download translations for ${y}: ${S.statusText}`
           );
         let g = `${i}/wp-content/languages`;
         y === "plugin" ? g += "/plugins" : y === "theme" && (g += "/themes"), await ad(
           e,
           new File(
-            [await T.arrayBuffer()],
+            [await S.arrayBuffer()],
             `${t}-${y}.zip`
           ),
           g
         );
-      } catch (T) {
+      } catch (S) {
         if (y === "core")
           throw new Error(
             `Failed to download translations for WordPress. Please check if the language code ${t} is correct. You can find all available languages and translations on https://translate.wordpress.org/.`
           );
         Te.warn(
-          `Error downloading translations for ${y}: ${T}`
+          `Error downloading translations for ${y}: ${S}`
         );
       }
     })
@@ -17204,14 +17204,14 @@ function Lr(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
         let c = e[p];
         const d = n, m = n;
         let y = !1;
-        const T = n;
+        const S = n;
         Ba.validate(c, {
           instancePath: t + "/" + p.replace(/~/g, "~0").replace(/\//g, "~1"),
           parentData: e,
           parentDataProperty: p,
           rootData: a
         }) || (s = s === null ? Ba.validate.errors : s.concat(Ba.validate.errors), n = s.length);
-        var o = T === n;
+        var o = S === n;
         if (y = y || o, !y) {
           const g = n;
           if (!(c && typeof c == "object" && !Array.isArray(c)) && typeof c != "string") {
@@ -17453,7 +17453,7 @@ function jt(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
             if (e.inner !== void 0) {
               let d = e.inner;
               const m = n, y = n;
-              let T = !1;
+              let S = !1;
               const g = n;
               Ua.validate(d, {
                 instancePath: t + "/inner",
@@ -17464,7 +17464,7 @@ function jt(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                 Ua.validate.errors
               ), n = s.length);
               var l = g === n;
-              if (T = T || l, !T) {
+              if (S = S || l, !S) {
                 const _ = n;
                 ut(d, {
                   instancePath: t + "/inner",
@@ -17473,9 +17473,9 @@ function jt(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                   rootData: a
                 }) || (s = s === null ? ut.errors : s.concat(ut.errors), n = s.length);
                 var l = _ === n;
-                T = T || l;
+                S = S || l;
               }
-              if (T)
+              if (S)
                 n = y, s !== null && (y ? s.length = y : s = null);
               else {
                 const _ = {
@@ -17530,33 +17530,33 @@ 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;
-        for (const j in e)
-          if (!(j === "resource" || j === "path")) {
+        const I = n;
+        for (const C in e)
+          if (!(C === "resource" || C === "path")) {
             const b = {
               instancePath: t,
               schemaPath: "#/definitions/VFSReference/additionalProperties",
               keyword: "additionalProperties",
-              params: { additionalProperty: j },
+              params: { additionalProperty: C },
               message: "must NOT have additional properties"
             };
             s === null ? s = [b] : s.push(b), n++;
             break;
           }
-        if (L === n) {
+        if (I === n) {
           if (e.resource !== void 0) {
-            let j = e.resource;
+            let C = e.resource;
             const b = n;
-            if (typeof j != "string") {
+            if (typeof C != "string") {
               const F = {
                 instancePath: t + "/resource",
                 schemaPath: "#/definitions/VFSReference/properties/resource/type",
@@ -17566,7 +17566,7 @@ function _e(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
               };
               s === null ? s = [F] : s.push(F), n++;
             }
-            if (j !== "vfs") {
+            if (C !== "vfs") {
               const F = {
                 instancePath: t + "/resource",
                 schemaPath: "#/definitions/VFSReference/properties/resource/const",
@@ -17581,7 +17581,7 @@ function _e(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
             var d = !0;
           if (d)
             if (e.path !== void 0) {
-              const j = n;
+              const C = n;
               if (typeof e.path != "string") {
                 const F = {
                   instancePath: t + "/path",
@@ -17592,7 +17592,7 @@ function _e(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                 };
                 s === null ? s = [F] : s.push(F), n++;
               }
-              var d = j === n;
+              var d = C === n;
             } else
               var d = !0;
         }
@@ -17626,55 +17626,55 @@ function _e(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
           const F = n;
           for (const P in e)
             if (!(P === "resource" || P === "name" || P === "contents")) {
-              const S = {
+              const T = {
                 instancePath: t,
                 schemaPath: "#/definitions/LiteralReference/additionalProperties",
                 keyword: "additionalProperties",
                 params: { additionalProperty: P },
                 message: "must NOT have additional properties"
               };
-              s === null ? s = [S] : s.push(S), n++;
+              s === null ? s = [T] : s.push(T), n++;
               break;
             }
           if (F === n) {
             if (e.resource !== void 0) {
               let P = e.resource;
-              const S = n;
+              const T = n;
               if (typeof P != "string") {
-                const I = {
+                const j = {
                   instancePath: t + "/resource",
                   schemaPath: "#/definitions/LiteralReference/properties/resource/type",
                   keyword: "type",
                   params: { type: "string" },
                   message: "must be string"
                 };
-                s === null ? s = [I] : s.push(I), n++;
+                s === null ? s = [j] : s.push(j), n++;
               }
               if (P !== "literal") {
-                const I = {
+                const j = {
                   instancePath: t + "/resource",
                   schemaPath: "#/definitions/LiteralReference/properties/resource/const",
                   keyword: "const",
                   params: { allowedValue: "literal" },
                   message: "must be equal to constant"
                 };
-                s === null ? s = [I] : s.push(I), n++;
+                s === null ? s = [j] : s.push(j), n++;
               }
-              var y = S === n;
+              var y = T === n;
             } else
               var y = !0;
             if (y) {
               if (e.name !== void 0) {
                 const P = n;
                 if (typeof e.name != "string") {
-                  const I = {
+                  const j = {
                     instancePath: t + "/name",
                     schemaPath: "#/definitions/LiteralReference/properties/name/type",
                     keyword: "type",
                     params: { type: "string" },
                     message: "must be string"
                   };
-                  s === null ? s = [I] : s.push(I), n++;
+                  s === null ? s = [j] : s.push(j), n++;
                 }
                 var y = P === n;
               } else
@@ -17682,7 +17682,7 @@ function _e(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
               if (y)
                 if (e.contents !== void 0) {
                   let P = e.contents;
-                  const S = n, I = n;
+                  const T = n, j = n;
                   let R = !1;
                   const D = n;
                   if (typeof P != "string") {
@@ -17695,8 +17695,8 @@ function _e(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                     };
                     s === null ? s = [B] : s.push(B), n++;
                   }
-                  var T = D === n;
-                  if (R = R || T, !R) {
+                  var S = D === n;
+                  if (R = R || S, !R) {
                     const B = n;
                     if (n === B)
                       if (P && typeof P == "object" && !Array.isArray(P)) {
@@ -17946,11 +17946,11 @@ function _e(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                         };
                         s === null ? s = [G] : s.push(G), n++;
                       }
-                    var T = B === n;
-                    R = R || T;
+                    var S = B === n;
+                    R = R || S;
                   }
                   if (R)
-                    n = I, s !== null && (I ? s.length = I : s = null);
+                    n = j, s !== null && (j ? s.length = j : s = null);
                   else {
                     const B = {
                       instancePath: t + "/contents",
@@ -17961,7 +17961,7 @@ function _e(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                     };
                     s === null ? s = [B] : s.push(B), n++;
                   }
-                  var y = S === n;
+                  var y = T === n;
                 } else
                   var y = !0;
             }
@@ -17982,18 +17982,18 @@ function _e(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
       const b = n;
       if (n === n)
         if (e && typeof e == "object" && !Array.isArray(e)) {
-          let S;
-          if (e.resource === void 0 && (S = "resource") || e.slug === void 0 && (S = "slug")) {
-            const I = {
+          let T;
+          if (e.resource === void 0 && (T = "resource") || e.slug === void 0 && (T = "slug")) {
+            const j = {
               instancePath: t,
               schemaPath: "#/definitions/CoreThemeReference/required",
               keyword: "required",
-              params: { missingProperty: S },
-              message: "must have required property '" + S + "'"
+              params: { missingProperty: T },
+              message: "must have required property '" + T + "'"
             };
-            s === null ? s = [I] : s.push(I), n++;
+            s === null ? s = [j] : s.push(j), n++;
           } else {
-            const I = n;
+            const j = n;
             for (const R in e)
               if (!(R === "resource" || R === "slug")) {
                 const D = {
@@ -18006,7 +18006,7 @@ function _e(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                 s === null ? s = [D] : s.push(D), n++;
                 break;
               }
-            if (I === n) {
+            if (j === n) {
               if (e.resource !== void 0) {
                 let R = e.resource;
                 const D = n;
@@ -18054,18 +18054,18 @@ function _e(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
             }
           }
         } else {
-          const S = {
+          const T = {
             instancePath: t,
             schemaPath: "#/definitions/CoreThemeReference/type",
             keyword: "type",
             params: { type: "object" },
             message: "must be object"
           };
-          s === null ? s = [S] : s.push(S), n++;
+          s === null ? s = [T] : s.push(T), n++;
         }
       var m = b === n;
       if (l = l || m, !l) {
-        const S = n;
+        const T = n;
         if (n === n)
           if (e && typeof e == "object" && !Array.isArray(e)) {
             let D;
@@ -18149,7 +18149,7 @@ function _e(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
             };
             s === null ? s = [D] : s.push(D), n++;
           }
-        var m = S === n;
+        var m = T === n;
         if (l = l || m, !l) {
           const D = n;
           if (n === n)
@@ -18311,10 +18311,10 @@ function _e(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                         };
                         s === null ? s = [fe] : s.push(fe), n++;
                       }
-                      var C = Z === n;
+                      var L = Z === n;
                     } else
-                      var C = !0;
-                    if (C)
+                      var L = !0;
+                    if (L)
                       if (e.path !== void 0) {
                         const ee = n;
                         if (typeof e.path != "string") {
@@ -18329,9 +18329,9 @@ function _e(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                           };
                           s === null ? s = [fe] : s.push(fe), n++;
                         }
-                        var C = ee === n;
+                        var L = ee === n;
                       } else
-                        var C = !0;
+                        var L = !0;
                   }
                 }
               } else {
@@ -19130,7 +19130,7 @@ function vt(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
         if (O === n) {
           if (e.method !== void 0) {
             let E = e.method;
-            const C = n;
+            const L = n;
             if (typeof E != "string")
               return vt.errors = [
                 {
@@ -19151,7 +19151,7 @@ function vt(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                   message: "must be equal to one of the allowed values"
                 }
               ], !1;
-            var o = C === n;
+            var o = L === n;
           } else
             var o = !0;
           if (o) {
@@ -19173,15 +19173,15 @@ function vt(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
             if (o) {
               if (e.headers !== void 0) {
                 let E = e.headers;
-                const C = n;
+                const L = n;
                 if (n === n)
                   if (E && typeof E == "object" && !Array.isArray(E))
-                    for (const j in E) {
+                    for (const C in E) {
                       const b = n;
-                      if (typeof E[j] != "string")
+                      if (typeof E[C] != "string")
                         return vt.errors = [
                           {
-                            instancePath: t + "/headers/" + j.replace(
+                            instancePath: t + "/headers/" + C.replace(
                               /~/g,
                               "~0"
                             ).replace(
@@ -19210,15 +19210,15 @@ function vt(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                         message: "must be object"
                       }
                     ], !1;
-                var o = C === n;
+                var o = L === n;
               } else
                 var o = !0;
               if (o)
                 if (e.body !== void 0) {
                   let E = e.body;
-                  const C = n, $ = n;
-                  let L = !1;
-                  const j = n;
+                  const L = n, $ = n;
+                  let I = !1;
+                  const C = n;
                   if (typeof E != "string") {
                     const F = {
                       instancePath: t + "/body",
@@ -19229,25 +19229,25 @@ function vt(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                     };
                     s === null ? s = [F] : s.push(F), n++;
                   }
-                  var p = j === n;
-                  if (L = L || p, !L) {
+                  var p = C === n;
+                  if (I = I || p, !I) {
                     const F = n;
                     if (n === F)
                       if (E && typeof E == "object" && !Array.isArray(E)) {
-                        let S;
-                        if (E.BYTES_PER_ELEMENT === void 0 && (S = "BYTES_PER_ELEMENT") || E.buffer === void 0 && (S = "buffer") || E.byteLength === void 0 && (S = "byteLength") || E.byteOffset === void 0 && (S = "byteOffset") || E.length === void 0 && (S = "length")) {
-                          const I = {
+                        let T;
+                        if (E.BYTES_PER_ELEMENT === void 0 && (T = "BYTES_PER_ELEMENT") || E.buffer === void 0 && (T = "buffer") || E.byteLength === void 0 && (T = "byteLength") || E.byteOffset === void 0 && (T = "byteOffset") || E.length === void 0 && (T = "length")) {
+                          const j = {
                             instancePath: t + "/body",
                             schemaPath: "#/properties/body/anyOf/1/required",
                             keyword: "required",
                             params: {
-                              missingProperty: S
+                              missingProperty: T
                             },
-                            message: "must have required property '" + S + "'"
+                            message: "must have required property '" + T + "'"
                           };
-                          s === null ? s = [I] : s.push(I), n++;
+                          s === null ? s = [j] : s.push(j), n++;
                         } else {
-                          const I = n;
+                          const j = n;
                           for (const R in E)
                             if (!(R === "BYTES_PER_ELEMENT" || R === "buffer" || R === "byteLength" || R === "byteOffset" || R === "length")) {
                               let D = E[R];
@@ -19280,7 +19280,7 @@ function vt(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                               if (!c)
                                 break;
                             }
-                          if (I === n) {
+                          if (j === n) {
                             if (E.BYTES_PER_ELEMENT !== void 0) {
                               let R = E.BYTES_PER_ELEMENT;
                               const D = n;
@@ -19471,19 +19471,19 @@ function vt(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                           }
                         }
                       } else {
-                        const S = {
+                        const T = {
                           instancePath: t + "/body",
                           schemaPath: "#/properties/body/anyOf/1/type",
                           keyword: "type",
                           params: { type: "object" },
                           message: "must be object"
                         };
-                        s === null ? s = [S] : s.push(S), n++;
+                        s === null ? s = [T] : s.push(T), n++;
                       }
                     var p = F === n;
-                    if (L = L || p, !L) {
-                      const S = n;
-                      if (n === S)
+                    if (I = I || p, !I) {
+                      const T = n;
+                      if (n === T)
                         if (E && typeof E == "object" && !Array.isArray(E))
                           for (const R in E) {
                             let D = E[R];
@@ -19609,10 +19609,10 @@ function vt(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                                             oe
                                           ), n++;
                                         }
-                                        var T = fe === n;
+                                        var S = fe === n;
                                       } else
-                                        var T = !0;
-                                      if (T) {
+                                        var S = !0;
+                                      if (S) {
                                         if (D.buffer !== void 0) {
                                           let Z = D.buffer;
                                           const fe = n;
@@ -19718,10 +19718,10 @@ function vt(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                                                 ie
                                               ), n++;
                                             }
-                                          var T = fe === n;
+                                          var S = fe === n;
                                         } else
-                                          var T = !0;
-                                        if (T) {
+                                          var S = !0;
+                                        if (S) {
                                           if (D.byteLength !== void 0) {
                                             let Z = D.byteLength;
                                             const fe = n;
@@ -19749,10 +19749,10 @@ function vt(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                                                 ie
                                               ), n++;
                                             }
-                                            var T = fe === n;
+                                            var S = fe === n;
                                           } else
-                                            var T = !0;
-                                          if (T) {
+                                            var S = !0;
+                                          if (S) {
                                             if (D.byteOffset !== void 0) {
                                               let Z = D.byteOffset;
                                               const fe = n;
@@ -19780,10 +19780,10 @@ function vt(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                                                   ie
                                                 ), n++;
                                               }
-                                              var T = fe === n;
+                                              var S = fe === n;
                                             } else
-                                              var T = !0;
-                                            if (T)
+                                              var S = !0;
+                                            if (S)
                                               if (D.length !== void 0) {
                                                 let Z = D.length;
                                                 const fe = n;
@@ -19811,9 +19811,9 @@ function vt(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                                                     ie
                                                   ), n++;
                                                 }
-                                                var T = fe === n;
+                                                var S = fe === n;
                                               } else
-                                                var T = !0;
+                                                var S = !0;
                                           }
                                         }
                                       }
@@ -20111,11 +20111,11 @@ 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;
+                      var p = T === n;
+                      I = I || p;
                     }
                   }
-                  if (L)
+                  if (I)
                     n = $, s !== null && ($ ? s.length = $ : s = null);
                   else {
                     const F = {
@@ -20127,7 +20127,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 = C === n;
+                  var o = L === n;
                 } else
                   var o = !0;
             }
@@ -20214,7 +20214,7 @@ function We(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
   let s = null, n = 0;
   if (n === 0)
     if (e && typeof e == "object" && !Array.isArray(e)) {
-      const T = n;
+      const S = n;
       for (const g in e)
         if (!md.call(yv.properties, g))
           return We.errors = [
@@ -20226,7 +20226,7 @@ function We(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
               message: "must NOT have additional properties"
             }
           ], !1;
-      if (T === n) {
+      if (S === n) {
         if (e.relativeUri !== void 0) {
           const g = n;
           if (typeof e.relativeUri != "string")
@@ -20310,7 +20310,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 C = n;
+                        const L = n;
                         if (typeof g[E] != "string")
                           return We.errors = [
                             {
@@ -20329,7 +20329,7 @@ function We(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                               message: "must be string"
                             }
                           ], !1;
-                        var l = C === n;
+                        var l = L === n;
                         if (!l)
                           break;
                       }
@@ -20367,16 +20367,16 @@ function We(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                       const $ = n;
                       if (n === $)
                         if (g && typeof g == "object" && !Array.isArray(g)) {
-                          let j;
-                          if (g.BYTES_PER_ELEMENT === void 0 && (j = "BYTES_PER_ELEMENT") || g.buffer === void 0 && (j = "buffer") || g.byteLength === void 0 && (j = "byteLength") || g.byteOffset === void 0 && (j = "byteOffset") || g.length === void 0 && (j = "length")) {
+                          let C;
+                          if (g.BYTES_PER_ELEMENT === void 0 && (C = "BYTES_PER_ELEMENT") || g.buffer === void 0 && (C = "buffer") || g.byteLength === void 0 && (C = "byteLength") || g.byteOffset === void 0 && (C = "byteOffset") || g.length === void 0 && (C = "length")) {
                             const b = {
                               instancePath: t + "/body",
                               schemaPath: "#/properties/body/anyOf/1/required",
                               keyword: "required",
                               params: {
-                                missingProperty: j
+                                missingProperty: C
                               },
-                              message: "must have required property '" + j + "'"
+                              message: "must have required property '" + C + "'"
                             };
                             s === null ? s = [b] : s.push(b), n++;
                           } else {
@@ -20384,11 +20384,11 @@ function We(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                             for (const F in g)
                               if (!(F === "BYTES_PER_ELEMENT" || F === "buffer" || F === "byteLength" || F === "byteOffset" || F === "length")) {
                                 let P = g[F];
-                                const S = n;
+                                const T = n;
                                 if (!(typeof P == "number" && isFinite(
                                   P
                                 ))) {
-                                  const I = {
+                                  const j = {
                                     instancePath: t + "/body/" + F.replace(
                                       /~/g,
                                       "~0"
@@ -20404,12 +20404,12 @@ function We(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                                     message: "must be number"
                                   };
                                   s === null ? s = [
-                                    I
+                                    j
                                   ] : s.push(
-                                    I
+                                    j
                                   ), n++;
                                 }
-                                var c = S === n;
+                                var c = T === n;
                                 if (!c)
                                   break;
                               }
@@ -20420,7 +20420,7 @@ function We(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                                 if (!(typeof F == "number" && isFinite(
                                   F
                                 ))) {
-                                  const S = {
+                                  const T = {
                                     instancePath: t + "/body/BYTES_PER_ELEMENT",
                                     schemaPath: "#/properties/body/anyOf/1/properties/BYTES_PER_ELEMENT/type",
                                     keyword: "type",
@@ -20430,9 +20430,9 @@ function We(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                                     message: "must be number"
                                   };
                                   s === null ? s = [
-                                    S
+                                    T
                                   ] : s.push(
-                                    S
+                                    T
                                   ), n++;
                                 }
                                 var d = P === n;
@@ -20446,16 +20446,16 @@ function We(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                                     if (F && typeof F == "object" && !Array.isArray(
                                       F
                                     )) {
-                                      let I;
-                                      if (F.byteLength === void 0 && (I = "byteLength")) {
+                                      let j;
+                                      if (F.byteLength === void 0 && (j = "byteLength")) {
                                         const R = {
                                           instancePath: t + "/body/buffer",
                                           schemaPath: "#/properties/body/anyOf/1/properties/buffer/required",
                                           keyword: "required",
                                           params: {
-                                            missingProperty: I
+                                            missingProperty: j
                                           },
-                                          message: "must have required property '" + I + "'"
+                                          message: "must have required property '" + j + "'"
                                         };
                                         s === null ? s = [
                                           R
@@ -20505,7 +20505,7 @@ function We(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                                         }
                                       }
                                     } else {
-                                      const I = {
+                                      const j = {
                                         instancePath: t + "/body/buffer",
                                         schemaPath: "#/properties/body/anyOf/1/properties/buffer/type",
                                         keyword: "type",
@@ -20515,9 +20515,9 @@ function We(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                                         message: "must be object"
                                       };
                                       s === null ? s = [
-                                        I
+                                        j
                                       ] : s.push(
-                                        I
+                                        j
                                       ), n++;
                                     }
                                   var d = P === n;
@@ -20530,7 +20530,7 @@ function We(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                                     if (!(typeof F == "number" && isFinite(
                                       F
                                     ))) {
-                                      const I = {
+                                      const j = {
                                         instancePath: t + "/body/byteLength",
                                         schemaPath: "#/properties/body/anyOf/1/properties/byteLength/type",
                                         keyword: "type",
@@ -20540,9 +20540,9 @@ function We(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                                         message: "must be number"
                                       };
                                       s === null ? s = [
-                                        I
+                                        j
                                       ] : s.push(
-                                        I
+                                        j
                                       ), n++;
                                     }
                                     var d = P === n;
@@ -20555,7 +20555,7 @@ function We(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                                       if (!(typeof F == "number" && isFinite(
                                         F
                                       ))) {
-                                        const I = {
+                                        const j = {
                                           instancePath: t + "/body/byteOffset",
                                           schemaPath: "#/properties/body/anyOf/1/properties/byteOffset/type",
                                           keyword: "type",
@@ -20565,9 +20565,9 @@ function We(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                                           message: "must be number"
                                         };
                                         s === null ? s = [
-                                          I
+                                          j
                                         ] : s.push(
-                                          I
+                                          j
                                         ), n++;
                                       }
                                       var d = P === n;
@@ -20580,7 +20580,7 @@ function We(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                                         if (!(typeof F == "number" && isFinite(
                                           F
                                         ))) {
-                                          const I = {
+                                          const j = {
                                             instancePath: t + "/body/length",
                                             schemaPath: "#/properties/body/anyOf/1/properties/length/type",
                                             keyword: "type",
@@ -20590,9 +20590,9 @@ function We(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                                             message: "must be number"
                                           };
                                           s === null ? s = [
-                                            I
+                                            j
                                           ] : s.push(
-                                            I
+                                            j
                                           ), n++;
                                         }
                                         var d = P === n;
@@ -20604,7 +20604,7 @@ function We(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                             }
                           }
                         } else {
-                          const j = {
+                          const C = {
                             instancePath: t + "/body",
                             schemaPath: "#/properties/body/anyOf/1/type",
                             keyword: "type",
@@ -20613,7 +20613,7 @@ function We(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                             },
                             message: "must be object"
                           };
-                          s === null ? s = [j] : s.push(j), n++;
+                          s === null ? s = [C] : s.push(C), n++;
                         }
                       var p = $ === n;
                       O = O || p;
@@ -21424,10 +21424,10 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                               message: "must be object"
                             }
                           ], !1;
-                      var T = N === n;
+                      var S = N === n;
                     } else
-                      var T = !0;
-                    if (T) {
+                      var S = !0;
+                    if (S) {
                       if (e.step !== void 0) {
                         let f = e.step;
                         const N = n;
@@ -21455,10 +21455,10 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                               message: "must be equal to constant"
                             }
                           ], !1;
-                        var T = N === n;
+                        var S = N === n;
                       } else
-                        var T = !0;
-                      if (T) {
+                        var S = !0;
+                      if (S) {
                         if (e.consts !== void 0) {
                           let f = e.consts;
                           const N = n;
@@ -21476,10 +21476,10 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                 message: "must be object"
                               }
                             ], !1;
-                          var T = N === n;
+                          var S = N === n;
                         } else
-                          var T = !0;
-                        if (T) {
+                          var S = !0;
+                        if (S) {
                           if (e.method !== void 0) {
                             let f = e.method;
                             const N = n;
@@ -21507,10 +21507,10 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                   message: "must be equal to one of the allowed values"
                                 }
                               ], !1;
-                            var T = N === n;
+                            var S = N === n;
                           } else
-                            var T = !0;
-                          if (T)
+                            var S = !0;
+                          if (S)
                             if (e.virtualize !== void 0) {
                               const f = n;
                               if (typeof e.virtualize != "boolean")
@@ -21525,9 +21525,9 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                     message: "must be boolean"
                                   }
                                 ], !1;
-                              var T = f === n;
+                              var S = f === n;
                             } else
-                              var T = !0;
+                              var S = !0;
                         }
                       }
                     }
@@ -21982,10 +21982,10 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                               message: "must be object"
                             }
                           ], !1;
-                      var C = N === n;
+                      var L = N === n;
                     } else
-                      var C = !0;
-                    if (C) {
+                      var L = !0;
+                    if (L) {
                       if (e.step !== void 0) {
                         let f = e.step;
                         const N = n;
@@ -22013,10 +22013,10 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                               message: "must be equal to constant"
                             }
                           ], !1;
-                        var C = N === n;
+                        var L = N === n;
                       } else
-                        var C = !0;
-                      if (C) {
+                        var L = !0;
+                      if (L) {
                         if (e.file !== void 0) {
                           const f = n;
                           _e(e.file, {
@@ -22027,10 +22027,10 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                           }) || (s = s === null ? _e.errors : s.concat(
                             _e.errors
                           ), n = s.length);
-                          var C = f === n;
+                          var L = f === n;
                         } else
-                          var C = !0;
-                        if (C)
+                          var L = !0;
+                        if (L)
                           if (e.importer !== void 0) {
                             let f = e.importer;
                             const N = n;
@@ -22058,9 +22058,9 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                   message: "must be equal to one of the allowed values"
                                 }
                               ], !1;
-                            var C = N === n;
+                            var L = N === n;
                           } else
-                            var C = !0;
+                            var L = !0;
                       }
                     }
                   }
@@ -22178,10 +22178,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;
@@ -22209,10 +22209,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")
@@ -22227,9 +22227,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;
                     }
                   }
                 }
@@ -22312,10 +22312,10 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                     message: "must be number"
                                   }
                                 ], !1;
-                              var j = ne === n;
+                              var C = ne === n;
                             } else
-                              var j = !0;
-                            if (j)
+                              var C = !0;
+                            if (C)
                               if (f.caption !== void 0) {
                                 const k = n;
                                 if (typeof f.caption != "string")
@@ -22330,9 +22330,9 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                       message: "must be string"
                                     }
                                   ], !1;
-                                var j = k === n;
+                                var C = k === n;
                               } else
-                                var j = !0;
+                                var C = !0;
                           }
                         } else
                           return v.errors = [
@@ -22614,8 +22614,8 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                             ) || (s = s === null ? _e.errors : s.concat(
                               _e.errors
                             ), n = s.length);
-                            var S = ne === n;
-                            if (k = k || S, !k) {
+                            var T = ne === n;
+                            if (k = k || T, !k) {
                               const ke = n;
                               ut(
                                 f,
@@ -22628,8 +22628,8 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                               ) || (s = s === null ? ut.errors : s.concat(
                                 ut.errors
                               ), n = s.length);
-                              var S = ke === n;
-                              k = k || S;
+                              var T = ke === n;
+                              k = k || T;
                             }
                             if (k)
                               n = re, s !== null && (re ? s.length = re : s = null);
@@ -22704,10 +22704,10 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                               message: "must be boolean"
                                             }
                                           ], !1;
-                                        var I = $e === n;
+                                        var j = $e === n;
                                       } else
-                                        var I = !0;
-                                      if (I)
+                                        var j = !0;
+                                      if (j)
                                         if (f.targetFolderName !== void 0) {
                                           const $e = n;
                                           if (typeof f.targetFolderName != "string")
@@ -22722,9 +22722,9 @@ function v(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                                 message: "must be string"
                                               }
                                             ], !1;
-                                          var I = $e === n;
+                                          var j = $e === n;
                                         } else
-                                          var I = !0;
+                                          var j = !0;
                                     }
                                   } else
                                     return v.errors = [
@@ -26855,7 +26855,7 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
   let s = null, n = 0;
   if (n === 0)
     if (e && typeof e == "object" && !Array.isArray(e)) {
-      const j = n;
+      const C = n;
       for (const b in e)
         if (!md.call(pv.properties, b))
           return me.errors = [
@@ -26867,7 +26867,7 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
               message: "must NOT have additional properties"
             }
           ], !1;
-      if (j === n) {
+      if (C === n) {
         if (e.landingPage !== void 0) {
           const b = n;
           if (typeof e.landingPage != "string")
@@ -26905,21 +26905,21 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
               const F = n;
               if (n === F)
                 if (b && typeof b == "object" && !Array.isArray(b)) {
-                  let S;
-                  if (b.title === void 0 && (S = "title") || b.author === void 0 && (S = "author"))
+                  let T;
+                  if (b.title === void 0 && (T = "title") || b.author === void 0 && (T = "author"))
                     return me.errors = [
                       {
                         instancePath: t + "/meta",
                         schemaPath: "#/properties/meta/required",
                         keyword: "required",
                         params: {
-                          missingProperty: S
+                          missingProperty: T
                         },
-                        message: "must have required property '" + S + "'"
+                        message: "must have required property '" + T + "'"
                       }
                     ], !1;
                   {
-                    const I = n;
+                    const j = n;
                     for (const R in b)
                       if (!(R === "title" || R === "description" || R === "author" || R === "categories"))
                         return me.errors = [
@@ -26933,7 +26933,7 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                             message: "must NOT have additional properties"
                           }
                         ], !1;
-                    if (I === n) {
+                    if (j === n) {
                       if (b.title !== void 0) {
                         const R = n;
                         if (typeof b.title != "string")
@@ -27053,21 +27053,21 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                 const F = n;
                 if (n === F)
                   if (b && typeof b == "object" && !Array.isArray(b)) {
-                    let S;
-                    if (b.php === void 0 && (S = "php") || b.wp === void 0 && (S = "wp"))
+                    let T;
+                    if (b.php === void 0 && (T = "php") || b.wp === void 0 && (T = "wp"))
                       return me.errors = [
                         {
                           instancePath: t + "/preferredVersions",
                           schemaPath: "#/properties/preferredVersions/required",
                           keyword: "required",
                           params: {
-                            missingProperty: S
+                            missingProperty: T
                           },
-                          message: "must have required property '" + S + "'"
+                          message: "must have required property '" + T + "'"
                         }
                       ], !1;
                     {
-                      const I = n;
+                      const j = n;
                       for (const R in b)
                         if (!(R === "php" || R === "wp"))
                           return me.errors = [
@@ -27081,7 +27081,7 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                               message: "must NOT have additional properties"
                             }
                           ], !1;
-                      if (I === n) {
+                      if (j === n) {
                         if (b.php !== void 0) {
                           let R = b.php;
                           const D = n, V = n;
@@ -27284,23 +27284,23 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                   const F = n;
                   if (n === F)
                     if (b && typeof b == "object" && !Array.isArray(b)) {
-                      const S = n;
-                      for (const I in b)
-                        if (!(I === "intl" || I === "networking"))
+                      const T = n;
+                      for (const j in b)
+                        if (!(j === "intl" || j === "networking"))
                           return me.errors = [
                             {
                               instancePath: t + "/features",
                               schemaPath: "#/properties/features/additionalProperties",
                               keyword: "additionalProperties",
                               params: {
-                                additionalProperty: I
+                                additionalProperty: j
                               },
                               message: "must NOT have additional properties"
                             }
                           ], !1;
-                      if (S === n) {
+                      if (T === n) {
                         if (b.intl !== void 0) {
-                          const I = n;
+                          const j = n;
                           if (typeof b.intl != "boolean")
                             return me.errors = [
                               {
@@ -27313,12 +27313,12 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                                 message: "must be boolean"
                               }
                             ], !1;
-                          var y = I === n;
+                          var y = j === n;
                         } else
                           var y = !0;
                         if (y)
                           if (b.networking !== void 0) {
-                            const I = n;
+                            const j = n;
                             if (typeof b.networking != "boolean")
                               return me.errors = [
                                 {
@@ -27331,7 +27331,7 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                                   message: "must be boolean"
                                 }
                               ], !1;
-                            var y = I === n;
+                            var y = j === n;
                           } else
                             var y = !0;
                       }
@@ -27354,15 +27354,15 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                     const F = n;
                     if (n === F)
                       if (Array.isArray(b)) {
-                        var T = !0;
-                        const S = b.length;
-                        for (let I = 0; I < S; I++) {
-                          let R = b[I];
+                        var S = !0;
+                        const T = b.length;
+                        for (let j = 0; j < T; j++) {
+                          let R = b[j];
                           const D = n;
                           if (typeof R != "string")
                             return me.errors = [
                               {
-                                instancePath: t + "/extraLibraries/" + I,
+                                instancePath: t + "/extraLibraries/" + j,
                                 schemaPath: "#/definitions/ExtraLibrary/type",
                                 keyword: "type",
                                 params: {
@@ -27374,7 +27374,7 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                           if (R !== "wp-cli")
                             return me.errors = [
                               {
-                                instancePath: t + "/extraLibraries/" + I,
+                                instancePath: t + "/extraLibraries/" + j,
                                 schemaPath: "#/definitions/ExtraLibrary/const",
                                 keyword: "const",
                                 params: {
@@ -27383,8 +27383,8 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                                 message: "must be equal to constant"
                               }
                             ], !1;
-                          var T = D === n;
-                          if (!T)
+                          var S = D === n;
+                          if (!S)
                             break;
                         }
                       } else
@@ -27408,13 +27408,13 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                       const F = n;
                       if (n === n)
                         if (b && typeof b == "object" && !Array.isArray(b))
-                          for (const I in b) {
-                            let R = b[I];
+                          for (const j in b) {
+                            let R = b[j];
                             const D = n;
                             if (typeof R != "string" && typeof R != "boolean" && !(typeof R == "number" && isFinite(R)))
                               return me.errors = [
                                 {
-                                  instancePath: t + "/constants/" + I.replace(
+                                  instancePath: t + "/constants/" + j.replace(
                                     /~/g,
                                     "~0"
                                   ).replace(
@@ -27455,15 +27455,15 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                         if (n === F)
                           if (Array.isArray(b)) {
                             var w = !0;
-                            const S = b.length;
-                            for (let I = 0; I < S; I++) {
-                              let R = b[I];
+                            const T = b.length;
+                            for (let j = 0; j < T; j++) {
+                              let R = b[j];
                               const D = n, V = n;
                               let B = !1;
                               const Y = n;
                               if (typeof R != "string") {
                                 const te = {
-                                  instancePath: t + "/plugins/" + I,
+                                  instancePath: t + "/plugins/" + j,
                                   schemaPath: "#/properties/plugins/items/anyOf/0/type",
                                   keyword: "type",
                                   params: {
@@ -27483,9 +27483,9 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                                 _e(
                                   R,
                                   {
-                                    instancePath: t + "/plugins/" + I,
+                                    instancePath: t + "/plugins/" + j,
                                     parentData: b,
-                                    parentDataProperty: I,
+                                    parentDataProperty: j,
                                     rootData: a
                                   }
                                 ) || (s = s === null ? _e.errors : s.concat(
@@ -27498,7 +27498,7 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                                 n = V, s !== null && (V ? s.length = V : s = null);
                               else {
                                 const te = {
-                                  instancePath: t + "/plugins/" + I,
+                                  instancePath: t + "/plugins/" + j,
                                   schemaPath: "#/properties/plugins/items/anyOf",
                                   keyword: "anyOf",
                                   params: {},
@@ -27537,14 +27537,14 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                             if (b && typeof b == "object" && !Array.isArray(
                               b
                             )) {
-                              const S = n;
-                              for (const I in b)
-                                if (I !== "blogname") {
+                              const T = n;
+                              for (const j in b)
+                                if (j !== "blogname") {
                                   const R = n;
-                                  if (typeof b[I] != "string")
+                                  if (typeof b[j] != "string")
                                     return me.errors = [
                                       {
-                                        instancePath: t + "/siteOptions/" + I.replace(
+                                        instancePath: t + "/siteOptions/" + j.replace(
                                           /~/g,
                                           "~0"
                                         ).replace(
@@ -27563,7 +27563,7 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                                   if (!O)
                                     break;
                                 }
-                              if (S === n && b.blogname !== void 0 && typeof b.blogname != "string")
+                              if (T === n && b.blogname !== void 0 && typeof b.blogname != "string")
                                 return me.errors = [
                                   {
                                     instancePath: t + "/siteOptions/blogname",
@@ -27594,8 +27594,8 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                           if (e.login !== void 0) {
                             let b = e.login;
                             const F = n, P = n;
-                            let S = !1;
-                            const I = n;
+                            let T = !1;
+                            const j = n;
                             if (typeof b != "boolean") {
                               const D = {
                                 instancePath: t + "/login",
@@ -27612,8 +27612,8 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                                 D
                               ), n++;
                             }
-                            var E = I === n;
-                            if (S = S || E, !S) {
+                            var E = j === n;
+                            if (T = T || E, !T) {
                               const D = n;
                               if (n === D)
                                 if (b && typeof b == "object" && !Array.isArray(
@@ -27674,10 +27674,10 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                                             te
                                           ), n++;
                                         }
-                                        var C = G === n;
+                                        var L = G === n;
                                       } else
-                                        var C = !0;
-                                      if (C)
+                                        var L = !0;
+                                      if (L)
                                         if (b.password !== void 0) {
                                           const G = n;
                                           if (typeof b.password != "string") {
@@ -27696,9 +27696,9 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                                               z
                                             ), n++;
                                           }
-                                          var C = G === n;
+                                          var L = G === n;
                                         } else
-                                          var C = !0;
+                                          var L = !0;
                                     }
                                   }
                                 } else {
@@ -27718,9 +27718,9 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                                   ), n++;
                                 }
                               var E = D === n;
-                              S = S || E;
+                              T = T || E;
                             }
-                            if (S)
+                            if (T)
                               n = P, s !== null && (P ? s.length = P : s = null);
                             else {
                               const D = {
@@ -27748,29 +27748,29 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                                   b
                                 )) {
                                   var $ = !0;
-                                  const S = b.length;
-                                  for (let I = 0; I < S; I++) {
-                                    let R = b[I];
+                                  const T = b.length;
+                                  for (let j = 0; j < T; j++) {
+                                    let R = b[j];
                                     const D = n, V = n;
                                     let B = !1;
                                     const Y = n;
                                     v(
                                       R,
                                       {
-                                        instancePath: t + "/steps/" + I,
+                                        instancePath: t + "/steps/" + j,
                                         parentData: b,
-                                        parentDataProperty: I,
+                                        parentDataProperty: j,
                                         rootData: a
                                       }
                                     ) || (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 = {
-                                          instancePath: t + "/steps/" + I,
+                                          instancePath: t + "/steps/" + j,
                                           schemaPath: "#/properties/steps/items/anyOf/1/type",
                                           keyword: "type",
                                           params: {
@@ -27784,10 +27784,10 @@ 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/" + I,
+                                          instancePath: t + "/steps/" + j,
                                           schemaPath: "#/properties/steps/items/anyOf/2/not",
                                           keyword: "not",
                                           params: {},
@@ -27798,12 +27798,12 @@ 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 = {
-                                              instancePath: t + "/steps/" + I,
+                                              instancePath: t + "/steps/" + j,
                                               schemaPath: "#/properties/steps/items/anyOf/3/type",
                                               keyword: "type",
                                               params: {
@@ -27819,7 +27819,7 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                                           }
                                           if (R !== !1) {
                                             const ie = {
-                                              instancePath: t + "/steps/" + I,
+                                              instancePath: t + "/steps/" + j,
                                               schemaPath: "#/properties/steps/items/anyOf/3/const",
                                               keyword: "const",
                                               params: {
@@ -27833,12 +27833,12 @@ 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 Oe = {
-                                                instancePath: t + "/steps/" + I,
+                                                instancePath: t + "/steps/" + j,
                                                 schemaPath: "#/properties/steps/items/anyOf/4/type",
                                                 keyword: "type",
                                                 params: {
@@ -27852,8 +27852,8 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                                                 Oe
                                               ), n++;
                                             }
-                                            var L = ie === n;
-                                            B = B || L;
+                                            var I = ie === n;
+                                            B = B || I;
                                           }
                                         }
                                       }
@@ -27862,7 +27862,7 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
                                       n = V, s !== null && (V ? s.length = V : s = null);
                                     else {
                                       const te = {
-                                        instancePath: t + "/steps/" + I,
+                                        instancePath: t + "/steps/" + j,
                                         schemaPath: "#/properties/steps/items/anyOf",
                                         keyword: "anyOf",
                                         params: {},
@@ -27990,7 +27990,7 @@ function vv(e, {
   gitAdditionalHeadersCallback: o,
   additionalSteps: l
 } = {}) {
-  var g, w, _, O, E, C, $, L, j, b, F;
+  var g, w, _, O, E, L, $, I, C, b, F;
   e = structuredClone(e), e = {
     ...e,
     steps: (e.steps || []).filter(Ev).filter(Sv)
@@ -28010,22 +28010,22 @@ function vv(e, {
     step: "setSiteOptions",
     options: e.siteOptions
   }), e.plugins) {
-    const P = e.plugins.map((S) => typeof S == "string" ? Fv(S) ? {
+    const P = e.plugins.map((T) => typeof T == "string" ? Fv(T) ? {
       resource: "zip",
       inner: {
         resource: "git:directory",
-        url: S.trim().replace(/\/+$/, ""),
+        url: T.trim().replace(/\/+$/, ""),
         ref: "HEAD"
       }
-    } : S.startsWith("https://") ? {
+    } : T.startsWith("https://") ? {
       resource: "url",
-      url: S
+      url: T
     } : {
       resource: "wordpress.org/plugins",
-      slug: S
-    } : S).map((S) => ({
+      slug: T
+    } : T).map((T) => ({
       step: "installPlugin",
-      pluginData: S
+      pluginData: T
     }));
     e.steps.unshift(...P);
   }
@@ -28048,7 +28048,7 @@ function vv(e, {
       P
     );
   }
-  const c = (C = e.steps) == null ? void 0 : C.findIndex(
+  const c = (L = e.steps) == null ? void 0 : L.findIndex(
     (P) => typeof P == "object" && (P == null ? void 0 : P.step) === "importWxr"
   );
   c !== void 0 && c > -1 && (($ = e.steps) == null || $.splice(c, 0, {
@@ -28060,13 +28060,13 @@ function vv(e, {
   }));
   const d = kv(e);
   if (!d.valid) {
-    const { errors: P } = d, S = xv(e, P);
+    const { errors: P } = d, T = xv(e, P);
     throw new gd(
       `Invalid Blueprint: The Blueprint does not conform to the schema.
 
 Found ${P.length} validation error(s):
 
-${S}
+${T}
 
 Please review your Blueprint and fix these issues. Learn more about the Blueprint format: https://wordpress.github.io/wordpress-playground/blueprints/data-format`,
       P
@@ -28074,12 +28074,12 @@ Please review your Blueprint and fix these issues. Learn more about the Blueprin
   }
   a(e);
   const m = e.steps || [], y = m.reduce(
-    (P, S) => {
-      var I;
-      return P + (((I = S.progress) == null ? void 0 : I.weight) || 1);
+    (P, T) => {
+      var j;
+      return P + (((j = T.progress) == null ? void 0 : j.weight) || 1);
     },
     0
-  ), T = m.map(
+  ), S = m.map(
     (P) => Tv(P, {
       semaphore: r,
       rootProgressTracker: t,
@@ -28092,11 +28092,11 @@ Please review your Blueprint and fix these issues. Learn more about the Blueprin
   return {
     versions: {
       php: Pv(
-        (L = e.preferredVersions) == null ? void 0 : L.php,
+        (I = e.preferredVersions) == null ? void 0 : I.php,
         sh,
         rh
       ),
-      wp: ((j = e.preferredVersions) == null ? void 0 : j.wp) || "latest"
+      wp: ((C = e.preferredVersions) == null ? void 0 : C.wp) || "latest"
     },
     features: {
       // Disable intl by default to reduce the transfer size
@@ -28107,16 +28107,16 @@ Please review your Blueprint and fix these issues. Learn more about the Blueprin
     extraLibraries: e.extraLibraries || [],
     run: async (P) => {
       try {
-        for (const { resources: S } of T)
-          for (const I of S)
-            I.setPlayground(P), I.isAsync && I.resolve().catch(() => {
+        for (const { resources: T } of S)
+          for (const j of T)
+            j.setPlayground(P), j.isAsync && j.resolve().catch(() => {
             });
-        for (const [S, { run: I, step: R }] of Object.entries(T))
+        for (const [T, { run: j, step: R }] of Object.entries(S))
           try {
-            const D = await I(P);
+            const D = await j(P);
             i(D, R);
           } catch (D) {
-            const V = Number(S) + 1;
+            const V = Number(T) + 1;
             throw new bv({
               stepNumber: V,
               step: R,
@@ -28125,9 +28125,9 @@ Please review your Blueprint and fix these issues. Learn more about the Blueprin
           }
       } finally {
         try {
-          const S = await P.pathToInternalUrl(e.landingPage || "/");
+          const T = await P.pathToInternalUrl(e.landingPage || "/");
           await P.goTo(
-            "/index.php?playground-redirection-handler&next=" + encodeURIComponent(S)
+            "/index.php?playground-redirection-handler&next=" + encodeURIComponent(T)
           );
         } catch {
         }
@@ -28221,20 +28221,20 @@ function Tv(e, {
   const o = r.stage(
     (((y = e.progress) == null ? void 0 : y.weight) || 1) / i
   ), l = {};
-  for (const T of Object.keys(e)) {
-    let g = e[T];
+  for (const S of Object.keys(e)) {
+    let g = e[S];
     p_(g) && (g = Pt.create(g, {
       semaphore: t,
       corsProxy: a,
       streamBundledFile: s,
       gitAdditionalHeadersCallback: n
-    })), l[T] = g;
+    })), l[S] = g;
   }
-  const p = async (T) => {
+  const p = async (S) => {
     var g;
     try {
       return o.fillSlowly(), await wv[e.step](
-        T,
+        S,
         await Ov(l),
         {
           tracker: o,
@@ -28245,10 +28245,10 @@ function Tv(e, {
       o.finish();
     }
   }, c = Ap(l), d = Ap(l).filter(
-    (T) => T.isAsync
+    (S) => S.isAsync
   ), m = 1 / (d.length + 1);
-  for (const T of d)
-    T.progress = o.stage(m);
+  for (const S of d)
+    S.progress = o.stage(m);
   return { run: p, step: e, resources: c };
 }
 function Ap(e) {
@@ -28371,7 +28371,7 @@ async function Qv(e) {
       const y = typeof m == "string" ? JSON.parse(m) : m;
       if (!y)
         return;
-      await new Promise((T) => setTimeout(T, 0)), y.type.startsWith("blueprint.") && await a(y);
+      await new Promise((S) => setTimeout(S, 0)), y.type.startsWith("blueprint.") && await a(y);
     } catch (y) {
       Te.warn("Failed to parse message as JSON:", m, y);
     }
@@ -28589,7 +28589,7 @@ class Wv {
     this.options = t;
   }
   async bootPlayground(t, r) {
-    var S;
+    var j;
     const {
       onBlueprintValidated: i,
       onBlueprintStepCompleted: a,
@@ -28602,50 +28602,51 @@ class Wv {
       sqliteDriverVersion: d,
       wordpressInstallMode: m,
       onClientConnected: y,
-      pathAliases: T
-    } = this.options, g = r.stage(0.5), w = r.stage(), _ = this.options.blueprint || {}, O = Gp(
+      pathAliases: S,
+      disableProgressBar: g
+    } = this.options, w = r.stage(0.5), _ = r.stage(), O = this.options.blueprint || {}, E = Gp(
       t.contentWindow,
       t.ownerDocument.defaultView
     );
-    await O.isConnected(), r.pipe(O);
-    const E = await Uv(_), C = E.intl ? ["intl"] : [];
-    C.push(...this.options.extensions || []), await O.onDownloadProgress(w.loadingListener);
-    const $ = !Si(_) && ((S = _.preferredVersions) == null ? void 0 : S.wp) === !1, L = m ?? ($ ? "do-not-attempt-installing" : c === !1 ? "install-from-existing-files-if-needed" : "download-and-install");
-    if ($ && (c === !0 || m !== void 0 && m !== "do-not-attempt-installing"))
+    await E.isConnected(), g || r.pipe(E);
+    const L = await Uv(O), $ = L.intl ? ["intl"] : [];
+    $.push(...this.options.extensions || []), await E.onDownloadProgress(_.loadingListener);
+    const I = !Si(O) && ((j = O.preferredVersions) == null ? void 0 : j.wp) === !1, C = m ?? (I ? "do-not-attempt-installing" : c === !1 ? "install-from-existing-files-if-needed" : "download-and-install");
+    if (I && (c === !0 || m !== void 0 && m !== "do-not-attempt-installing"))
       throw new Error(
         "Conflicting options: WordPress was requested, but the Blueprint sets `preferredVersions.wp: false`. Pick one."
       );
-    if (await O.boot({
+    if (await E.boot({
       mounts: o,
       sapiName: l,
       scope: p ?? Math.random().toFixed(16),
-      wordpressInstallMode: L,
-      phpVersion: E.phpVersion,
-      wpVersion: E.wpVersion,
-      extensions: C,
-      withNetworking: E.networking,
+      wordpressInstallMode: C,
+      phpVersion: L.phpVersion,
+      wpVersion: L.wpVersion,
+      extensions: $,
+      withNetworking: L.networking,
       corsProxyUrl: s,
       sqliteDriverVersion: d,
-      pathAliases: T
-    }), await O.isReady(), w.finish(), Lp(Te, O), y == null || y(O), (await Dn.create(_)).getVersion() === 1) {
-      const I = await wd(_, {
-        progress: g,
+      pathAliases: S
+    }), await E.isReady(), _.finish(), Lp(Te, E), y == null || y(E), (await Dn.create(O)).getVersion() === 1) {
+      const R = await wd(O, {
+        progress: w,
         onStepCompleted: a,
         onBlueprintValidated: i,
         corsProxy: s,
         gitAdditionalHeadersCallback: n
       });
-      await Av(I, O);
+      await Av(R, E);
     }
-    const b = parseFloat(E.wpVersion), F = Number.isFinite(b) && b < 5.1;
-    if (E.networking && !F && L === "download-and-install")
-      if (await Hv(_))
-        await O.prefetchUpdateChecks();
+    const F = parseFloat(L.wpVersion), P = Number.isFinite(F) && F < 5.1;
+    if (L.networking && !P && C === "download-and-install")
+      if (await Hv(O))
+        await E.prefetchUpdateChecks();
       else {
-        const I = () => O.prefetchUpdateChecks();
-        globalThis.requestIdleCallback ? globalThis.requestIdleCallback(I, { timeout: 5e3 }) : setTimeout(I, 0);
+        const R = () => E.prefetchUpdateChecks();
+        globalThis.requestIdleCallback ? globalThis.requestIdleCallback(R, { timeout: 5e3 }) : setTimeout(R, 0);
       }
-    return O;
+    return E;
   }
 }
 async function Hv(e) {
@@ -28680,36 +28681,37 @@ class zv {
       mounts: n,
       sapiName: o,
       scope: l,
-      pathAliases: p
-    } = this.options, c = r.stage(0.25), d = r.stage(0.75), m = Gp(
+      pathAliases: p,
+      disableProgressBar: c
+    } = this.options, d = r.stage(0.25), m = r.stage(0.75), y = Gp(
       t.contentWindow,
       t.ownerDocument.defaultView
     );
-    return await m.isConnected(), r.pipe(m), await m.onDownloadProgress(c.loadingListener), await m.addEventListener(
+    return await y.isConnected(), c || r.pipe(y), await y.onDownloadProgress(d.loadingListener), await y.addEventListener(
       "blueprint.message",
-      ({ message: y }) => {
-        switch (y.type) {
+      ({ message: S }) => {
+        switch (S.type) {
           case "blueprint.target_resolved":
             break;
           case "blueprint.progress": {
-            d.set(y.progress), d.setCaption(y.caption);
+            m.set(S.progress), m.setCaption(S.caption);
             break;
           }
           case "blueprint.error": {
-            const T = "\x1B[31m", g = "\x1B[1m", w = "\x1B[0m";
-            throw y.details ? Te.error(
-              `${T}${g}Fatal error:${w} Uncaught ${y.details.exception}: ${y.details.message}
-  at ${y.details.file}:${y.details.line}
-` + (y.details.trace ? y.details.trace + `
+            const g = "\x1B[31m", w = "\x1B[1m", _ = "\x1B[0m";
+            throw S.details ? Te.error(
+              `${g}${w}Fatal error:${_} Uncaught ${S.details.exception}: ${S.details.message}
+  at ${S.details.file}:${S.details.line}
+` + (S.details.trace ? S.details.trace + `
 ` : "")
             ) : Te.error(
-              `${T}${g}Error:${w} ${y.message}
+              `${g}${w}Error:${_} ${S.message}
 `
-            ), new Error(y.message);
+            ), new Error(S.message);
           }
         }
       }
-    ), await m.boot({
+    ), await y.boot({
       mounts: n,
       sapiName: o,
       scope: l ?? Math.random().toFixed(16),
@@ -28719,7 +28721,7 @@ class zv {
       // Pass the declaration directly – the worker runs the V2 runner.
       blueprint: i,
       pathAliases: p
-    }), await m.isReady(), c.finish(), Lp(Te, m), a == null || a(m), m.goTo("/"), m;
+    }), await y.isReady(), d.finish(), Lp(Te, y), a == null || a(y), y.goTo("/"), y;
   }
 }
 async function r2(e) {