@wp-playground/client 3.0.3 → 3.0.4

package/index.js

@@ -76,16 +76,16 @@ async function _c(e) {
   const r = await (await e.read("blueprint.json")).text();
   return JSON.parse(r);
 }
-class ws {
+class gs {
   constructor(t, r, i) {
     this.declaration = t, this.bundle = r, this.version = i;
   }
   static async create(t) {
     const r = await _c(t), i = jl(t) ? t : void 0;
-    return ws.createFromDeclaration(r, i);
+    return gs.createFromDeclaration(r, i);
   }
   static createFromDeclaration(t, r = void 0) {
-    return new ws(
+    return new gs(
       t,
       r,
       t.version || 1
@@ -117,10 +117,10 @@ const gc = "playground-log", Ta = (e, ...t) => {
     })
   );
 }, wc = (e, ...t) => {
-  switch (typeof e.message == "string" ? Reflect.set(e, "message", Ri(e.message)) : e.message.message && typeof e.message.message == "string" && Reflect.set(
+  switch (typeof e.message == "string" ? Reflect.set(e, "message", Li(e.message)) : e.message.message && typeof e.message.message == "string" && Reflect.set(
     e.message,
     "message",
-    Ri(e.message.message)
+    Li(e.message.message)
   ), e.severity) {
     case ft.Debug:
       console.debug(e.message, ...t);
@@ -143,35 +143,35 @@ const gc = "playground-log", Ta = (e, ...t) => {
 }, bc = (e) => e instanceof Error ? [e.message, e.stack].join(`
 `) : JSON.stringify(e, null, 2), Wl = [], Ca = (e) => {
   Wl.push(e);
-}, Li = (e) => {
+}, Oi = (e) => {
   if (e.raw === !0)
     Ca(e.message);
   else {
     const t = Sc(
       typeof e.message == "object" ? bc(e.message) : e.message,
       e.severity,
-      e.prefix ?? ur.JS
+      e.prefix ?? cr.JS
     );
     Ca(t);
   }
 };
-let Vn = 0;
+let Zn = 0;
 const Oa = "/wordpress/wp-content/debug.log", vc = async (e) => await e.fileExists(Oa) ? await e.readFileAsText(Oa) : "", Ul = (e, t) => {
   t.addEventListener("request.end", async () => {
     const r = await vc(t);
-    if (r.length > Vn) {
-      const i = r.substring(Vn);
+    if (r.length > Zn) {
+      const i = r.substring(Zn);
       e.logMessage({
         message: i,
         severity: ft.Log,
         raw: !0
-      }), Vn = r.length;
+      }), Zn = r.length;
     }
   }), t.addEventListener("request.error", (r) => {
     r = r, r.error && (e.logMessage({
       message: `${r.error.message} ${r.error.stack}`,
       severity: ft.Fatal,
-      prefix: r.source === "request" ? ur.PHP : ur.WASM
+      prefix: r.source === "request" ? cr.PHP : cr.WASM
     }), e.dispatchEvent(
       new CustomEvent(e.fatalErrorEvent, {
         detail: {
@@ -188,7 +188,7 @@ const Oa = "/wordpress/wp-content/debug.log", vc = async (e) => await e.fileExis
   Log: { name: "log", level: 3 },
   Info: { name: "info", level: 4 },
   Debug: { name: "debug", level: 5 }
-}, ur = {
+}, cr = {
   WASM: "Wasm Crash",
   PHP: "PHP",
   JS: "JavaScript"
@@ -203,7 +203,7 @@ class xc extends EventTarget {
    * @returns string[]
    */
   getLogs() {
-    return this.handlers.includes(Li) ? [...Wl] : (this.error(`Logs aren't stored because the logToMemory handler isn't registered.
+    return this.handlers.includes(Oi) ? [...Wl] : (this.error(`Logs aren't stored because the logToMemory handler isn't registered.
 				If you're using a custom logger instance, make sure to register logToMemory handler.
 			`), []);
   }
@@ -239,7 +239,7 @@ class xc extends EventTarget {
       {
         message: t,
         severity: ft.Log,
-        prefix: ur.JS,
+        prefix: cr.JS,
         raw: !1
       },
       ...r
@@ -256,7 +256,7 @@ class xc extends EventTarget {
       {
         message: t,
         severity: ft.Debug,
-        prefix: ur.JS,
+        prefix: cr.JS,
         raw: !1
       },
       ...r
@@ -273,7 +273,7 @@ class xc extends EventTarget {
       {
         message: t,
         severity: ft.Info,
-        prefix: ur.JS,
+        prefix: cr.JS,
         raw: !1
       },
       ...r
@@ -290,7 +290,7 @@ class xc extends EventTarget {
       {
         message: t,
         severity: ft.Warn,
-        prefix: ur.JS,
+        prefix: cr.JS,
         raw: !1
       },
       ...r
@@ -307,7 +307,7 @@ class xc extends EventTarget {
       {
         message: t,
         severity: ft.Error,
-        prefix: ur.JS,
+        prefix: cr.JS,
         raw: !1
       },
       ...r
@@ -317,11 +317,11 @@ class xc extends EventTarget {
 const kc = () => {
   try {
     if (process.env.NODE_ENV === "test")
-      return [Li, Ta];
+      return [Oi, Ta];
   } catch {
   }
-  return [Li, wc, Ta];
-}, Pe = new xc(kc()), Ri = (e) => e.replace(/\t/g, ""), Sc = (e, t, r) => {
+  return [Oi, wc, Ta];
+}, Pe = new xc(kc()), Li = (e) => e.replace(/\t/g, ""), Sc = (e, t, r) => {
   const i = /* @__PURE__ */ new Date(), a = new Intl.DateTimeFormat("en-GB", {
     year: "numeric",
     month: "short",
@@ -335,7 +335,7 @@ const kc = () => {
     timeZone: "UTC",
     timeZoneName: "short"
   }).format(i), s = a + " " + n;
-  return e = Ri(e), `[${s}] ${r} ${t.name}: ${e}`;
+  return e = Li(e), `[${s}] ${r} ${t.name}: ${e}`;
 }, Ec = 5 * 1024 * 1024;
 function Pc(e, t) {
   const r = e.headers.get("content-length") || "", i = parseInt(r, 10) || Ec;
@@ -383,7 +383,7 @@ function Ml(e, t, r) {
   });
 }
 const La = 1e-5;
-class In extends EventTarget {
+class Rn extends EventTarget {
   constructor({
     weight: t = 1,
     caption: r = "",
@@ -432,7 +432,7 @@ class In extends EventTarget {
         `Cannot add a stage with weight ${t} as the total weight of registered stages would exceed 1.`
       );
     this._selfWeight -= t;
-    const i = new In({
+    const i = new Rn({
       caption: r,
       weight: t,
       fillTime: this._fillTime
@@ -560,7 +560,7 @@ class Tc extends Error {
     super("Acquiring lock timed out");
   }
 }
-class Jr {
+class Xr {
   constructor({ concurrency: t, timeout: r }) {
     this._running = 0, this.concurrency = t, this.timeout = r, this.queue = [];
   }
@@ -605,16 +605,16 @@ function Ee(...e) {
   }
   let r = e.join("/");
   const i = r[0] === "/", a = t(r);
-  return r = Dn(r), !r && !i && (r = "."), r && a && !t(r) && (r += "/"), r;
+  return r = In(r), !r && !i && (r = "."), r && a && !t(r) && (r += "/"), r;
 }
-function wn(e) {
+function gn(e) {
   if (e === "/")
     return "/";
-  e = Dn(e);
+  e = In(e);
   const t = e.lastIndexOf("/");
   return t === -1 ? "" : t === 0 ? "/" : e.substr(0, t);
 }
-function Dn(e) {
+function In(e) {
   const t = e[0] === "/";
   return e = Cc(
     e.split("/").filter((r) => !!r),
@@ -647,7 +647,7 @@ function wt(e) {
     JSON.stringify(e)
   )}'), true)`;
 }
-function $n(e) {
+function Dn(e) {
   const t = {};
   for (const r in e)
     t[r] = wt(e[r]);
@@ -688,12 +688,12 @@ const Dc = {
   201: "Created",
   200: "OK"
 };
-class us {
+class cs {
   constructor(t, r, i, a = "", n = 0) {
     this.httpStatusCode = t, this.headers = r, this.bytes = i, this.exitCode = n, this.errors = a;
   }
   static forHttpCode(t, r = "") {
-    return new us(
+    return new cs(
       t,
       {},
       new TextEncoder().encode(
@@ -702,7 +702,7 @@ class us {
     );
   }
   static fromRawData(t) {
-    return new us(
+    return new cs(
       t.httpStatusCode,
       t.headers,
       t.bytes,
@@ -711,7 +711,7 @@ class us {
     );
   }
   static async fromStreamedResponse(t) {
-    return await t.finished, new us(
+    return await t.finished, new cs(
       await t.httpStatusCode,
       await t.headers,
       await t.stdoutBytes,
@@ -749,10 +749,10 @@ class us {
   }
 }
 const Ra = "/internal/shared/php.ini";
-function ra(e) {
+function ta(e) {
   return e && e.__esModule && Object.prototype.hasOwnProperty.call(e, "default") ? e.default : e;
 }
-const { hasOwnProperty: Yn } = Object.prototype, Ii = (e, t = {}) => {
+const { hasOwnProperty: Vn } = Object.prototype, Ri = (e, t = {}) => {
   typeof t == "string" && (t = { section: t }), t.align = t.align === !0, t.newline = t.newline === !0, t.sort = t.sort === !0, t.whitespace = t.whitespace === !0 || t.align === !0, t.platform = t.platform || typeof process < "u" && process.platform, t.bracketedArray = t.bracketedArray !== !1;
   const r = t.platform === "win32" ? `\r
 ` : `
@@ -772,7 +772,7 @@ const { hasOwnProperty: Yn } = Object.prototype, Ii = (e, t = {}) => {
   }
   t.section && o.length && (o = "[" + Zt(t.section) + "]" + (t.newline ? r + r : r) + o);
   for (const p of a) {
-    const c = zl(p, ".").join("\\."), m = (t.section ? t.section + "." : "") + c, h = Ii(e[p], {
+    const c = zl(p, ".").join("\\."), m = (t.section ? t.section + "." : "") + c, h = Ri(e[p], {
       ...t,
       section: m
     });
@@ -803,37 +803,37 @@ const Ia = (e, t = {}) => {
     if (!c)
       continue;
     if (c[1] !== void 0) {
-      if (a = an(c[1]), a === "__proto__") {
+      if (a = nn(c[1]), a === "__proto__") {
         i = /* @__PURE__ */ Object.create(null);
         continue;
       }
       i = r[a] = r[a] || /* @__PURE__ */ Object.create(null);
       continue;
     }
-    const m = an(c[2]);
+    const m = nn(c[2]);
     let h;
     t.bracketedArray ? h = m.length > 2 && m.slice(-2) === "[]" : (o[m] = ((o == null ? void 0 : o[m]) || 0) + 1, h = o[m] > 1);
     const _ = h ? m.slice(0, -2) : m;
     if (_ === "__proto__")
       continue;
-    const L = c[3] ? an(c[4]) : !0, y = L === "true" || L === "false" || L === "null" ? JSON.parse(L) : L;
-    h && (Yn.call(i, _) ? Array.isArray(i[_]) || (i[_] = [i[_]]) : i[_] = []), Array.isArray(i[_]) ? i[_].push(y) : i[_] = y;
+    const L = c[3] ? nn(c[4]) : !0, y = L === "true" || L === "false" || L === "null" ? JSON.parse(L) : L;
+    h && (Vn.call(i, _) ? Array.isArray(i[_]) || (i[_] = [i[_]]) : i[_] = []), Array.isArray(i[_]) ? i[_].push(y) : i[_] = y;
   }
   const f = [];
   for (const p of Object.keys(r)) {
-    if (!Yn.call(r, p) || typeof r[p] != "object" || Array.isArray(r[p]))
+    if (!Vn.call(r, p) || typeof r[p] != "object" || Array.isArray(r[p]))
       continue;
     const c = zl(p, ".");
     i = r;
     const m = c.pop(), h = m.replace(/\\\./g, ".");
     for (const _ of c)
-      _ !== "__proto__" && ((!Yn.call(i, _) || typeof i[_] != "object") && (i[_] = /* @__PURE__ */ Object.create(null)), i = i[_]);
+      _ !== "__proto__" && ((!Vn.call(i, _) || typeof i[_] != "object") && (i[_] = /* @__PURE__ */ Object.create(null)), i = i[_]);
     i === r && h === m || (i[h] = r[p], f.push(p));
   }
   for (const p of f)
     delete r[p];
   return r;
-}, Gl = (e) => e.startsWith('"') && e.endsWith('"') || e.startsWith("'") && e.endsWith("'"), Zt = (e) => typeof e != "string" || e.match(/[=\r\n]/) || e.match(/^\[/) || e.length > 1 && Gl(e) || e !== e.trim() ? JSON.stringify(e) : e.split(";").join("\\;").split("#").join("\\#"), an = (e) => {
+}, Gl = (e) => e.startsWith('"') && e.endsWith('"') || e.startsWith("'") && e.endsWith("'"), Zt = (e) => typeof e != "string" || e.match(/[=\r\n]/) || e.match(/^\[/) || e.length > 1 && Gl(e) || e !== e.trim() ? JSON.stringify(e) : e.split(";").join("\\;").split("#").join("\\#"), nn = (e) => {
   if (e = (e || "").trim(), Gl(e)) {
     e.charAt(0) === "'" && (e = e.slice(1, -1));
     try {
@@ -859,10 +859,10 @@ const Ia = (e, t = {}) => {
 var Da = {
   parse: Ia,
   decode: Ia,
-  stringify: Ii,
-  encode: Ii,
+  stringify: Ri,
+  encode: Ri,
   safe: Zt,
-  unsafe: an
+  unsafe: nn
 };
 async function mg(e, t) {
   const r = Da.parse(await e.readFileAsText(Ra));
@@ -895,7 +895,7 @@ function Hc(e) {
 async function Fc(e, t) {
   return await e.pipeThrough(Hc()).getReader().read().then(({ value: r }) => r);
 }
-class bs extends File {
+class ws extends File {
   /**
    * Creates a new StreamedFile instance.
    *
@@ -953,8 +953,8 @@ ReadableStream.prototype[Symbol.asyncIterator] || (ReadableStream.prototype[Symb
   }
 }, ReadableStream.prototype.iterate = // @ts-ignore
 ReadableStream.prototype[Symbol.asyncIterator]);
-new Jr({ concurrency: 10 });
-const sa = [
+new Xr({ concurrency: 10 });
+const ra = [
   "8.4",
   "8.3",
   "8.2",
@@ -963,12 +963,12 @@ const sa = [
   "7.4",
   "7.3",
   "7.2"
-], Nc = sa[0], yg = sa;
-async function Hn(e, t, r, { rmRoot: i = !1 } = {}) {
+], Nc = ra[0], yg = ra;
+async function $n(e, t, r, { rmRoot: i = !1 } = {}) {
   i && await e.isDir(t) && await e.rmdir(t, { recursive: !0 });
   for (const [a, n] of Object.entries(r)) {
     const s = Ee(t, a);
-    await e.fileExists(wn(s)) || await e.mkdir(wn(s)), n instanceof Uint8Array || typeof n == "string" ? await e.writeFile(s, n) : await Hn(e, s, n);
+    await e.fileExists(gn(s)) || await e.mkdir(gn(s)), n instanceof Uint8Array || typeof n == "string" ? await e.writeFile(s, n) : await $n(e, s, n);
   }
 }
 /**
@@ -978,13 +978,13 @@ async function Hn(e, t, r, { rmRoot: i = !1 } = {}) {
  * Copyright 2019 Google LLC
  * SPDX-License-Identifier: Apache-2.0
  */
-const Zl = Symbol("Comlink.proxy"), Bc = Symbol("Comlink.endpoint"), jc = Symbol("Comlink.releaseProxy"), Xn = Symbol("Comlink.finalizer"), on = Symbol("Comlink.thrown");
+const Zl = Symbol("Comlink.proxy"), Bc = Symbol("Comlink.endpoint"), jc = Symbol("Comlink.releaseProxy"), Yn = Symbol("Comlink.finalizer"), an = Symbol("Comlink.thrown");
 /**
  * @license
  * Copyright 2019 Google LLC
  * SPDX-License-Identifier: Apache-2.0
  */
-const bn = {
+const wn = {
   RAW: "RAW",
   HANDLER: "HANDLER"
 }, _t = {
@@ -998,13 +998,13 @@ const bn = {
   canHandle: (e) => Vl(e) && e[Zl],
   serialize(e) {
     const { port1: t, port2: r } = new MessageChannel();
-    return na(e, t), [r, [r]];
+    return sa(e, t), [r, [r]];
   },
   deserialize(e) {
-    return e.start(), ia(e);
+    return e.start(), na(e);
   }
 }, Uc = {
-  canHandle: (e) => Vl(e) && on in e,
+  canHandle: (e) => Vl(e) && an in e,
   serialize({ value: e }) {
     let t;
     return e instanceof Error ? t = {
@@ -1032,7 +1032,7 @@ function Mc(e, t) {
       return !0;
   return !1;
 }
-function na(e, t = globalThis, r = ["*"], i) {
+function sa(e, t = globalThis, r = ["*"], i) {
   t.addEventListener("message", function a(n) {
     if (!n || !n.data)
       return;
@@ -1043,7 +1043,7 @@ function na(e, t = globalThis, r = ["*"], i) {
     const { id: s, type: o, path: f } = {
       path: [],
       ...n.data
-    }, p = (n.data.argumentList || []).map(br);
+    }, p = (n.data.argumentList || []).map(wr);
     let c;
     try {
       const m = f.slice(0, -1).reduce((_, L) => _[L], e), h = f.reduce((_, L) => _[L], e);
@@ -1052,7 +1052,7 @@ function na(e, t = globalThis, r = ["*"], i) {
           c = h;
           break;
         case _t.SET:
-          m[f.slice(-1)[0]] = br(
+          m[f.slice(-1)[0]] = wr(
             n.data.value
           ), c = !0;
           break;
@@ -1068,7 +1068,7 @@ function na(e, t = globalThis, r = ["*"], i) {
         case _t.ENDPOINT:
           {
             const { port1: _, port2: L } = new MessageChannel();
-            na(e, L), c = Zc(_, [_]);
+            sa(e, L), c = Zc(_, [_]);
           }
           break;
         case _t.RELEASE:
@@ -1078,15 +1078,15 @@ function na(e, t = globalThis, r = ["*"], i) {
           return;
       }
     } catch (m) {
-      c = { value: m, [on]: 0 };
+      c = { value: m, [an]: 0 };
     }
-    Promise.resolve(c).catch((m) => ({ value: m, [on]: 0 })).then((m) => {
-      const [h, _] = kn(m);
-      t.postMessage({ ...h, id: s }, _), o === _t.RELEASE && (t.removeEventListener("message", a), Yl(t), Xn in e && typeof e[Xn] == "function" && e[Xn]());
+    Promise.resolve(c).catch((m) => ({ value: m, [an]: 0 })).then((m) => {
+      const [h, _] = xn(m);
+      t.postMessage({ ...h, id: s }, _), o === _t.RELEASE && (t.removeEventListener("message", a), Yl(t), Yn in e && typeof e[Yn] == "function" && e[Yn]());
     }).catch(() => {
-      const [m, h] = kn({
+      const [m, h] = xn({
         value: new TypeError("Unserializable return value"),
-        [on]: 0
+        [an]: 0
       });
       t.postMessage({ ...m, id: s }, h);
     }).finally(() => {
@@ -1099,7 +1099,7 @@ function qc(e) {
 function Yl(e) {
   qc(e) && e.close();
 }
-function ia(e, t) {
+function na(e, t) {
   const r = /* @__PURE__ */ new Map();
   return e.addEventListener("message", function(a) {
     const { data: n } = a;
@@ -1112,54 +1112,54 @@ function ia(e, t) {
       } finally {
         r.delete(n.id);
       }
-  }), Di(e, r, [], t);
+  }), Ii(e, r, [], t);
 }
-function Us(e) {
+function Ws(e) {
   if (e)
     throw new Error("Proxy has been released and is not useable");
 }
 function Xl(e) {
-  return Mr(e, /* @__PURE__ */ new Map(), {
+  return Ur(e, /* @__PURE__ */ new Map(), {
     type: _t.RELEASE
   }).then(() => {
     Yl(e);
   });
 }
-const vn = /* @__PURE__ */ new WeakMap(), xn = "FinalizationRegistry" in globalThis && new FinalizationRegistry((e) => {
-  const t = (vn.get(e) || 0) - 1;
-  vn.set(e, t), t === 0 && Xl(e);
+const bn = /* @__PURE__ */ new WeakMap(), vn = "FinalizationRegistry" in globalThis && new FinalizationRegistry((e) => {
+  const t = (bn.get(e) || 0) - 1;
+  bn.set(e, t), t === 0 && Xl(e);
 });
 function Kc(e, t) {
-  const r = (vn.get(t) || 0) + 1;
-  vn.set(t, r), xn && xn.register(e, t, e);
+  const r = (bn.get(t) || 0) + 1;
+  bn.set(t, r), vn && vn.register(e, t, e);
 }
 function zc(e) {
-  xn && xn.unregister(e);
+  vn && vn.unregister(e);
 }
-function Di(e, t, r = [], i = function() {
+function Ii(e, t, r = [], i = function() {
 }) {
   let a = !1;
   const n = new Proxy(i, {
     get(s, o) {
-      if (Us(a), o === jc)
+      if (Ws(a), o === jc)
         return () => {
           zc(n), Xl(e), t.clear(), a = !0;
         };
       if (o === "then") {
         if (r.length === 0)
           return { then: () => n };
-        const f = Mr(e, t, {
+        const f = Ur(e, t, {
           type: _t.GET,
           path: r.map((p) => p.toString())
-        }).then(br);
+        }).then(wr);
         return f.then.bind(f);
       }
-      return Di(e, t, [...r, o]);
+      return Ii(e, t, [...r, o]);
     },
     set(s, o, f) {
-      Us(a);
-      const [p, c] = kn(f);
-      return Mr(
+      Ws(a);
+      const [p, c] = xn(f);
+      return Ur(
         e,
         t,
         {
@@ -1168,19 +1168,19 @@ function Di(e, t, r = [], i = function() {
           value: p
         },
         c
-      ).then(br);
+      ).then(wr);
     },
     apply(s, o, f) {
-      Us(a);
+      Ws(a);
       const p = r[r.length - 1];
       if (p === Bc)
-        return Mr(e, t, {
+        return Ur(e, t, {
           type: _t.ENDPOINT
-        }).then(br);
+        }).then(wr);
       if (p === "bind")
-        return Di(e, t, r.slice(0, -1));
+        return Ii(e, t, r.slice(0, -1));
       const [c, m] = $a(f);
-      return Mr(
+      return Ur(
         e,
         t,
         {
@@ -1189,12 +1189,12 @@ function Di(e, t, r = [], i = function() {
           argumentList: c
         },
         m
-      ).then(br);
+      ).then(wr);
     },
     construct(s, o) {
-      Us(a);
+      Ws(a);
       const [f, p] = $a(o);
-      return Mr(
+      return Ur(
         e,
         t,
         {
@@ -1203,7 +1203,7 @@ function Di(e, t, r = [], i = function() {
           argumentList: f
         },
         p
-      ).then(br);
+      ).then(wr);
     }
   });
   return Kc(n, e), n;
@@ -1212,7 +1212,7 @@ function Gc(e) {
   return Array.prototype.concat.apply([], e);
 }
 function $a(e) {
-  const t = e.map(kn);
+  const t = e.map(xn);
   return [t.map((r) => r[0]), Gc(t.map((r) => r[1]))];
 }
 const Jl = /* @__PURE__ */ new WeakMap();
@@ -1229,13 +1229,13 @@ function Vc(e, t = globalThis, r = "*") {
     removeEventListener: t.removeEventListener.bind(t)
   };
 }
-function kn(e) {
+function xn(e) {
   for (const [t, r] of Xt)
     if (r.canHandle(e)) {
       const [i, a] = r.serialize(e);
       return [
         {
-          type: bn.HANDLER,
+          type: wn.HANDLER,
           name: t,
           value: i
         },
@@ -1244,21 +1244,21 @@ function kn(e) {
     }
   return [
     {
-      type: bn.RAW,
+      type: wn.RAW,
       value: e
     },
     Jl.get(e) || []
   ];
 }
-function br(e) {
+function wr(e) {
   switch (e.type) {
-    case bn.HANDLER:
+    case wn.HANDLER:
       return Xt.get(e.name).deserialize(e.value);
-    case bn.RAW:
+    case wn.RAW:
       return e.value;
   }
 }
-function Mr(e, t, r, i) {
+function Ur(e, t, r, i) {
   return new Promise((a) => {
     const n = Yc();
     t.set(n, a), e.start && e.start(), e.postMessage({ id: n, ...r }, i);
@@ -1303,9 +1303,9 @@ const Jc = [
   globalThis.AssertionError,
   globalThis.SystemError
 ].filter(Boolean).map((e) => [e.name, e]), Qc = new Map(Jc);
-class aa extends Error {
+class ia extends Error {
   constructor(t) {
-    super(aa._prepareSuperMessage(t)), this.name = "NonError";
+    super(ia._prepareSuperMessage(t)), this.name = "NonError";
   }
   static _prepareSuperMessage(t) {
     try {
@@ -1340,14 +1340,14 @@ const eu = [
     property: "errors",
     enumerable: !1
   }
-], $i = /* @__PURE__ */ new WeakSet(), tu = (e) => {
-  $i.add(e);
+], Di = /* @__PURE__ */ new WeakSet(), tu = (e) => {
+  Di.add(e);
   const t = e.toJSON();
-  return $i.delete(e), t;
+  return Di.delete(e), t;
 }, ef = (e) => {
   const t = Qc.get(e) ?? Error;
   return t === AggregateError ? new t([]) : new t();
-}, oa = ({
+}, aa = ({
   from: e,
   seen: t,
   to: r,
@@ -1359,9 +1359,9 @@ const eu = [
 }) => {
   if (r || (Array.isArray(e) ? r = [] : !o && Ha(e) ? r = ef(e.name) : r = {}), t.push(e), n >= a)
     return r;
-  if (s && typeof e.toJSON == "function" && !$i.has(e))
+  if (s && typeof e.toJSON == "function" && !Di.has(e))
     return tu(e);
-  const f = (p) => oa({
+  const f = (p) => aa({
     from: p,
     seen: [...t],
     forceEnumerable: i,
@@ -1406,7 +1406,7 @@ const eu = [
 };
 function ru(e, t = {}) {
   const { maxDepth: r = Number.POSITIVE_INFINITY, useToJSON: i = !0 } = t;
-  return typeof e == "object" && e !== null ? oa({
+  return typeof e == "object" && e !== null ? aa({
     from: e,
     seen: [],
     forceEnumerable: !0,
@@ -1418,14 +1418,14 @@ function ru(e, t = {}) {
 }
 function su(e, t = {}) {
   const { maxDepth: r = Number.POSITIVE_INFINITY } = t;
-  return e instanceof Error ? e : nu(e) ? oa({
+  return e instanceof Error ? e : nu(e) ? aa({
     from: e,
     seen: [],
     to: ef(e.name),
     maxDepth: r,
     depth: 0,
     serialize: !1
-  }) : new aa(e);
+  }) : new ia(e);
 }
 function Ha(e) {
   return !!e && typeof e == "object" && typeof e.name == "string" && typeof e.message == "string" && typeof e.stack == "string";
@@ -1437,7 +1437,7 @@ function tf(e, t = void 0) {
   au();
   let r;
   import.meta.url.startsWith("file://") ? r = Xc(e) : r = e instanceof Worker ? e : Vc(e, t);
-  const a = ia(r), n = rf(a);
+  const a = na(r), n = rf(a);
   return new Proxy(n, {
     get: (s, o) => o === "isConnected" ? async () => {
       for (; ; )
@@ -1473,10 +1473,10 @@ function au() {
     // eslint-disable-next-line @typescript-eslint/no-unsafe-function-type
     serialize(r) {
       const { port1: i, port2: a } = new MessageChannel();
-      return na(r, i), [a, [a]];
+      return sa(r, i), [a, [a]];
     },
     deserialize(r) {
-      return r.start(), ia(r);
+      return r.start(), na(r);
     }
   }), Xt.set("MESSAGE_PORT", {
     canHandle: (r) => r instanceof MessagePort,
@@ -1492,7 +1492,7 @@ function au() {
       return [r.toRawData(), []];
     },
     deserialize(r) {
-      return us.fromRawData(r);
+      return cs.fromRawData(r);
     }
   });
   const e = Xt.get("throw"), t = e == null ? void 0 : e.serialize;
@@ -1542,8 +1542,8 @@ function rf(e) {
     }
   });
 }
-new Jr({ concurrency: 15 });
-new Jr({ concurrency: 10 });
+new Xr({ concurrency: 15 });
+new Xr({ concurrency: 10 });
 function fu(e) {
   let t = [e];
   return {
@@ -1653,7 +1653,7 @@ class Ze {
     };
   }
 }
-class Qr extends Error {
+class Jr extends Error {
   constructor(t) {
     super(t), this.caller = "";
   }
@@ -1667,14 +1667,14 @@ class Qr extends Error {
     };
   }
   fromJSON(t) {
-    const r = new Qr(t.message);
+    const r = new Jr(t.message);
     return r.code = t.code, r.data = t.data, r.caller = t.caller, r.stack = t.stack, r;
   }
   get isIsomorphicGitError() {
     return !0;
   }
 }
-class He extends Qr {
+class He extends Jr {
   /**
    * @param {string} message
    */
@@ -1685,15 +1685,15 @@ class He extends Qr {
   }
 }
 He.code = "InternalError";
-class Fn extends Qr {
+class Hn extends Jr {
   /**
    * @param {string} filepath
    */
   constructor(t) {
-    super(`The filepath "${t}" contains unsafe character sequences`), this.code = this.name = Fn.code, this.data = { filepath: t };
+    super(`The filepath "${t}" contains unsafe character sequences`), this.code = this.name = Hn.code, this.data = { filepath: t };
   }
 }
-Fn.code = "UnsafeFilepathError";
+Hn.code = "UnsafeFilepathError";
 function af(e, t) {
   return -(e < t) || +(e > t);
 }
@@ -1739,7 +1739,7 @@ function hu(e) {
     n === "40000" && (n = "040000");
     const s = of(n), o = e.slice(i + 1, a).toString("utf8");
     if (o.includes("\\") || o.includes("/"))
-      throw new Fn(o);
+      throw new Hn(o);
     const f = e.slice(a + 1, a + 21).toString("hex");
     r = a + 21, t.push({ mode: n, path: o, oid: f, type: s });
   }
@@ -1756,7 +1756,7 @@ function mu(e) {
 function yu(e) {
   return !e.oid && e.sha && (e.oid = e.sha), e.mode = mu(e.mode), e.type || (e.type = of(e.mode)), e;
 }
-class la {
+class oa {
   constructor(t) {
     if (Buffer.isBuffer(t))
       this._entries = hu(t);
@@ -1767,7 +1767,7 @@ class la {
     this._entries.sort(uu);
   }
   static from(t) {
-    return new la(t);
+    return new oa(t);
   }
   render() {
     return this._entries.map((t) => `${t.mode} ${t.type} ${t.oid}    ${t.path}`).join(`
@@ -1793,7 +1793,7 @@ class la {
       yield t;
   }
 }
-function Hi({ name: e, email: t, timestamp: r, timezoneOffset: i }) {
+function $i({ name: e, email: t, timestamp: r, timezoneOffset: i }) {
   return i = _u(i), `${e} <${t}> ${r} ${i}`;
 }
 function _u(e) {
@@ -1814,7 +1814,7 @@ function Vt(e) {
   return e = e.replace(/\r/g, ""), e = e.replace(/^\n+/, ""), e = e.replace(/\n+$/, "") + `
 `, e;
 }
-function Sn(e) {
+function kn(e) {
   const [, t, r, i, a] = e.match(
     /^(.*) <(.*)> (.*) (.*)$/
   );
@@ -1832,27 +1832,27 @@ function bu(e) {
 function vu(e) {
   return e === 0 ? e : -e;
 }
-class ds {
+class us {
   constructor(t) {
     if (typeof t == "string")
       this._tag = t;
     else if (Buffer.isBuffer(t))
       this._tag = t.toString("utf8");
     else if (typeof t == "object")
-      this._tag = ds.render(t);
+      this._tag = us.render(t);
     else
       throw new He(
         "invalid type passed to GitAnnotatedTag constructor"
       );
   }
   static from(t) {
-    return new ds(t);
+    return new us(t);
   }
   static render(t) {
     return `object ${t.object}
 type ${t.type}
 tag ${t.tag}
-tagger ${Hi(t.tagger)}
+tagger ${$i(t.tagger)}
 
 ${t.message}
 ${t.gpgsig ? t.gpgsig : ""}`;
@@ -1888,7 +1888,7 @@ ${t.gpgsig ? t.gpgsig : ""}`;
       const n = a.slice(0, a.indexOf(" ")), s = a.slice(a.indexOf(" ") + 1);
       Array.isArray(i[n]) ? i[n].push(s) : i[n] = s;
     }
-    return i.tagger && (i.tagger = Sn(i.tagger)), i.committer && (i.committer = Sn(i.committer)), i;
+    return i.tagger && (i.tagger = kn(i.tagger)), i.committer && (i.committer = kn(i.committer)), i;
   }
   withoutSignature() {
     const t = Vt(this._tag);
@@ -1917,10 +1917,10 @@ ${t.gpgsig ? t.gpgsig : ""}`;
     let { signature: n } = await r({ payload: a, secretKey: i });
     n = Vt(n);
     const s = a + n;
-    return ds.from(s);
+    return us.from(s);
   }
 }
-function Jn(e) {
+function Xn(e) {
   return e.trim().split(`
 `).map((t) => " " + t).join(`
 `) + `
@@ -1945,7 +1945,7 @@ class ht {
   static fromPayloadSignature({ payload: t, signature: r }) {
     const i = ht.justHeaders(t), a = ht.justMessage(t), n = Vt(
       i + `
-gpgsig` + Jn(r) + `
+gpgsig` + Xn(r) + `
 ` + a
     );
     return new ht(n);
@@ -1990,7 +1990,7 @@ gpgsig` + Jn(r) + `
       const n = a.slice(0, a.indexOf(" ")), s = a.slice(a.indexOf(" ") + 1);
       Array.isArray(i[n]) ? i[n].push(s) : i[n] = s;
     }
-    return i.author && (i.author = Sn(i.author)), i.committer && (i.committer = Sn(i.committer)), i;
+    return i.author && (i.author = kn(i.author)), i.committer && (i.committer = kn(i.committer)), i;
   }
   static renderHeaders(t) {
     let r = "";
@@ -2004,11 +2004,11 @@ gpgsig` + Jn(r) + `
 `;
     }
     const i = t.author;
-    r += `author ${Hi(i)}
+    r += `author ${$i(i)}
 `;
     const a = t.committer || t.author;
-    return r += `committer ${Hi(a)}
-`, t.gpgsig && (r += "gpgsig" + Jn(t.gpgsig)), r;
+    return r += `committer ${$i(a)}
+`, t.gpgsig && (r += "gpgsig" + Xn(t.gpgsig)), r;
   }
   static render(t) {
     return ht.renderHeaders(t) + `
@@ -2041,7 +2041,7 @@ gpgsig`)), i = t.slice(
     let { signature: s } = await r({ payload: a, secretKey: i });
     s = Vt(s);
     const f = ht.justHeaders(t._commit) + `
-gpgsig` + Jn(s) + `
+gpgsig` + Xn(s) + `
 ` + n;
     return ht.from(f);
   }
@@ -2086,7 +2086,7 @@ var lf = {};
     t.table = i, t.bstr = A, t.buf = $, t.str = S;
   });
 })(lf);
-const ku = /* @__PURE__ */ ra(lf);
+const ku = /* @__PURE__ */ ta(lf);
 class Su {
   static wrap({ type: t, object: r }) {
     return Buffer.concat([
@@ -2106,7 +2106,7 @@ class Su {
     };
   }
 }
-class vr {
+class br {
   constructor(t) {
     this.buffer = t, this._start = 0;
   }
@@ -2161,7 +2161,7 @@ class vr {
   }
 }
 function Eu(e, t) {
-  const r = new vr(e), i = Ba(r);
+  const r = new br(e), i = Ba(r);
   if (i !== t.byteLength)
     throw new He(
       `applyDelta expected source buffer to be ${i} bytes but the provided buffer was ${t.length} bytes`
@@ -2173,7 +2173,7 @@ function Eu(e, t) {
     n = s;
   else {
     n = Buffer.alloc(a);
-    const o = new vr(n);
+    const o = new br(n);
     for (o.copy(s); !r.eof(); )
       o.copy(Wa(r, t));
     const f = o.tell();
@@ -2206,7 +2206,7 @@ function Wa(e, t) {
   } else
     return e.slice(r);
 }
-var tr = {};
+var er = {};
 (function(e) {
   var t = typeof Uint8Array < "u" && typeof Uint16Array < "u" && typeof Int32Array < "u";
   function r(n, s) {
@@ -2257,48 +2257,48 @@ var tr = {};
   e.setTyped = function(n) {
     n ? (e.Buf8 = Uint8Array, e.Buf16 = Uint16Array, e.Buf32 = Int32Array, e.assign(e, i)) : (e.Buf8 = Array, e.Buf16 = Array, e.Buf32 = Array, e.assign(e, a));
   }, e.setTyped(t);
-})(tr);
-var Is = {}, qt = {}, es = {}, Pu = tr, Au = 4, Ua = 0, Ma = 1, Tu = 2;
-function ts(e) {
+})(er);
+var Rs = {}, qt = {}, Qr = {}, Pu = er, Au = 4, Ua = 0, Ma = 1, Tu = 2;
+function es(e) {
   for (var t = e.length; --t >= 0; )
     e[t] = 0;
 }
-var Cu = 0, ff = 1, Ou = 2, Lu = 3, Ru = 258, fa = 29, Ds = 256, vs = Ds + 1 + fa, Gr = 30, pa = 19, pf = 2 * vs + 1, kr = 15, Qn = 16, Iu = 7, ca = 256, cf = 16, uf = 17, df = 18, Fi = (
+var Cu = 0, ff = 1, Ou = 2, Lu = 3, Ru = 258, la = 29, Is = 256, bs = Is + 1 + la, zr = 30, fa = 19, pf = 2 * bs + 1, xr = 15, Jn = 16, Iu = 7, pa = 256, cf = 16, uf = 17, df = 18, Hi = (
   /* extra bits for each length code */
   [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0]
-), ln = (
+), on = (
   /* extra bits for each distance code */
   [0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13]
 ), Du = (
   /* extra bits for each bit length code */
   [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7]
-), hf = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15], $u = 512, Yt = new Array((vs + 2) * 2);
-ts(Yt);
-var hs = new Array(Gr * 2);
-ts(hs);
-var xs = new Array($u);
-ts(xs);
-var ks = new Array(Ru - Lu + 1);
-ts(ks);
-var ua = new Array(fa);
-ts(ua);
-var En = new Array(Gr);
-ts(En);
-function ei(e, t, r, i, a) {
+), hf = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15], $u = 512, Yt = new Array((bs + 2) * 2);
+es(Yt);
+var ds = new Array(zr * 2);
+es(ds);
+var vs = new Array($u);
+es(vs);
+var xs = new Array(Ru - Lu + 1);
+es(xs);
+var ca = new Array(la);
+es(ca);
+var Sn = new Array(zr);
+es(Sn);
+function Qn(e, t, r, i, a) {
   this.static_tree = e, this.extra_bits = t, this.extra_base = r, this.elems = i, this.max_length = a, this.has_stree = e && e.length;
 }
 var mf, yf, _f;
-function ti(e, t) {
+function ei(e, t) {
   this.dyn_tree = e, this.max_code = 0, this.stat_desc = t;
 }
 function gf(e) {
-  return e < 256 ? xs[e] : xs[256 + (e >>> 7)];
+  return e < 256 ? vs[e] : vs[256 + (e >>> 7)];
 }
-function Ss(e, t) {
+function ks(e, t) {
   e.pending_buf[e.pending++] = t & 255, e.pending_buf[e.pending++] = t >>> 8 & 255;
 }
 function pt(e, t, r) {
-  e.bi_valid > Qn - r ? (e.bi_buf |= t << e.bi_valid & 65535, Ss(e, e.bi_buf), e.bi_buf = t >> Qn - e.bi_valid, e.bi_valid += r - Qn) : (e.bi_buf |= t << e.bi_valid & 65535, e.bi_valid += r);
+  e.bi_valid > Jn - r ? (e.bi_buf |= t << e.bi_valid & 65535, ks(e, e.bi_buf), e.bi_buf = t >> Jn - e.bi_valid, e.bi_valid += r - Jn) : (e.bi_buf |= t << e.bi_valid & 65535, e.bi_valid += r);
 }
 function Bt(e, t, r) {
   pt(
@@ -2316,11 +2316,11 @@ function wf(e, t) {
   return r >>> 1;
 }
 function Hu(e) {
-  e.bi_valid === 16 ? (Ss(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);
+  e.bi_valid === 16 ? (ks(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 Fu(e, t) {
   var r = t.dyn_tree, i = t.max_code, a = t.stat_desc.static_tree, n = t.stat_desc.has_stree, s = t.stat_desc.extra_bits, o = t.stat_desc.extra_base, f = t.stat_desc.max_length, p, c, m, h, _, L, y = 0;
-  for (h = 0; h <= kr; h++)
+  for (h = 0; h <= xr; h++)
     e.bl_count[h] = 0;
   for (r[e.heap[e.heap_max] * 2 + 1] = 0, p = e.heap_max + 1; p < pf; p++)
     c = e.heap[p], h = r[r[c * 2 + 1] * 2 + 1] + 1, h > f && (h = f, y++), r[c * 2 + 1] = h, !(c > i) && (e.bl_count[h]++, _ = 0, c >= o && (_ = s[c - o]), L = r[c * 2], e.opt_len += L * (h + _), n && (e.static_len += L * (a[c * 2 + 1] + _)));
@@ -2336,8 +2336,8 @@ function Fu(e, t) {
   }
 }
 function bf(e, t, r) {
-  var i = new Array(kr + 1), a = 0, n, s;
-  for (n = 1; n <= kr; n++)
+  var i = new Array(xr + 1), a = 0, n, s;
+  for (n = 1; n <= xr; n++)
     i[n] = a = a + r[n - 1] << 1;
   for (s = 0; s <= t; s++) {
     var o = e[s * 2 + 1];
@@ -2345,17 +2345,17 @@ function bf(e, t, r) {
   }
 }
 function Nu() {
-  var e, t, r, i, a, n = new Array(kr + 1);
-  for (r = 0, i = 0; i < fa - 1; i++)
-    for (ua[i] = r, e = 0; e < 1 << Fi[i]; e++)
-      ks[r++] = i;
-  for (ks[r - 1] = i, a = 0, i = 0; i < 16; i++)
-    for (En[i] = a, e = 0; e < 1 << ln[i]; e++)
-      xs[a++] = i;
-  for (a >>= 7; i < Gr; i++)
-    for (En[i] = a << 7, e = 0; e < 1 << ln[i] - 7; e++)
-      xs[256 + a++] = i;
-  for (t = 0; t <= kr; t++)
+  var e, t, r, i, a, n = new Array(xr + 1);
+  for (r = 0, i = 0; i < la - 1; i++)
+    for (ca[i] = r, e = 0; e < 1 << Hi[i]; e++)
+      xs[r++] = i;
+  for (xs[r - 1] = i, a = 0, i = 0; i < 16; i++)
+    for (Sn[i] = a, e = 0; e < 1 << on[i]; e++)
+      vs[a++] = i;
+  for (a >>= 7; i < zr; i++)
+    for (Sn[i] = a << 7, e = 0; e < 1 << on[i] - 7; e++)
+      vs[256 + a++] = i;
+  for (t = 0; t <= xr; t++)
     n[t] = 0;
   for (e = 0; e <= 143; )
     Yt[e * 2 + 1] = 8, e++, n[8]++;
@@ -2365,31 +2365,31 @@ function Nu() {
     Yt[e * 2 + 1] = 7, e++, n[7]++;
   for (; e <= 287; )
     Yt[e * 2 + 1] = 8, e++, n[8]++;
-  for (bf(Yt, vs + 1, n), e = 0; e < Gr; e++)
-    hs[e * 2 + 1] = 5, hs[e * 2] = wf(e, 5);
-  mf = new ei(Yt, Fi, Ds + 1, vs, kr), yf = new ei(hs, ln, 0, Gr, kr), _f = new ei(new Array(0), Du, 0, pa, Iu);
+  for (bf(Yt, bs + 1, n), e = 0; e < zr; e++)
+    ds[e * 2 + 1] = 5, ds[e * 2] = wf(e, 5);
+  mf = new Qn(Yt, Hi, Is + 1, bs, xr), yf = new Qn(ds, on, 0, zr, xr), _f = new Qn(new Array(0), Du, 0, fa, Iu);
 }
 function vf(e) {
   var t;
-  for (t = 0; t < vs; t++)
+  for (t = 0; t < bs; t++)
     e.dyn_ltree[t * 2] = 0;
-  for (t = 0; t < Gr; t++)
+  for (t = 0; t < zr; t++)
     e.dyn_dtree[t * 2] = 0;
-  for (t = 0; t < pa; t++)
+  for (t = 0; t < fa; t++)
     e.bl_tree[t * 2] = 0;
-  e.dyn_ltree[ca * 2] = 1, e.opt_len = e.static_len = 0, e.last_lit = e.matches = 0;
+  e.dyn_ltree[pa * 2] = 1, e.opt_len = e.static_len = 0, e.last_lit = e.matches = 0;
 }
 function xf(e) {
-  e.bi_valid > 8 ? Ss(e, e.bi_buf) : e.bi_valid > 0 && (e.pending_buf[e.pending++] = e.bi_buf), e.bi_buf = 0, e.bi_valid = 0;
+  e.bi_valid > 8 ? ks(e, e.bi_buf) : e.bi_valid > 0 && (e.pending_buf[e.pending++] = e.bi_buf), e.bi_buf = 0, e.bi_valid = 0;
 }
 function Bu(e, t, r, i) {
-  xf(e), Ss(e, r), Ss(e, ~r), Pu.arraySet(e.pending_buf, e.window, t, r, e.pending), e.pending += r;
+  xf(e), ks(e, r), ks(e, ~r), Pu.arraySet(e.pending_buf, e.window, t, r, e.pending), e.pending += r;
 }
 function qa(e, t, r, i) {
   var a = t * 2, n = r * 2;
   return e[a] < e[n] || e[a] === e[n] && i[t] <= i[r];
 }
-function ri(e, t, r) {
+function ti(e, t, r) {
   for (var i = e.heap[r], a = r << 1; a <= e.heap_len && (a < e.heap_len && qa(t, e.heap[a + 1], e.heap[a], e.depth) && a++, !qa(t, i, e.heap[a], e.depth)); )
     e.heap[r] = e.heap[a], r = a, a <<= 1;
   e.heap[r] = i;
@@ -2398,18 +2398,18 @@ function Ka(e, t, r) {
   var i, a, n = 0, s, o;
   if (e.last_lit !== 0)
     do
-      i = e.pending_buf[e.d_buf + n * 2] << 8 | e.pending_buf[e.d_buf + n * 2 + 1], a = e.pending_buf[e.l_buf + n], n++, i === 0 ? Bt(e, a, t) : (s = ks[a], Bt(e, s + Ds + 1, t), o = Fi[s], o !== 0 && (a -= ua[s], pt(e, a, o)), i--, s = gf(i), Bt(e, s, r), o = ln[s], o !== 0 && (i -= En[s], pt(e, i, o)));
+      i = e.pending_buf[e.d_buf + n * 2] << 8 | e.pending_buf[e.d_buf + n * 2 + 1], a = e.pending_buf[e.l_buf + n], n++, i === 0 ? Bt(e, a, t) : (s = xs[a], Bt(e, s + Is + 1, t), o = Hi[s], o !== 0 && (a -= ca[s], pt(e, a, o)), i--, s = gf(i), Bt(e, s, r), o = on[s], o !== 0 && (i -= Sn[s], pt(e, i, o)));
     while (n < e.last_lit);
-  Bt(e, ca, t);
+  Bt(e, pa, t);
 }
-function Ni(e, t) {
+function Fi(e, t) {
   var r = t.dyn_tree, i = t.stat_desc.static_tree, a = t.stat_desc.has_stree, n = t.stat_desc.elems, s, o, f = -1, p;
   for (e.heap_len = 0, e.heap_max = pf, s = 0; s < n; s++)
     r[s * 2] !== 0 ? (e.heap[++e.heap_len] = f = s, e.depth[s] = 0) : r[s * 2 + 1] = 0;
   for (; e.heap_len < 2; )
     p = e.heap[++e.heap_len] = f < 2 ? ++f : 0, r[p * 2] = 1, e.depth[p] = 0, e.opt_len--, a && (e.static_len -= i[p * 2 + 1]);
   for (t.max_code = f, s = e.heap_len >> 1; s >= 1; s--)
-    ri(e, r, s);
+    ti(e, r, s);
   p = n;
   do
     s = e.heap[
@@ -2418,7 +2418,7 @@ function Ni(e, t) {
     ], e.heap[
       1
       /*SMALLEST*/
-    ] = e.heap[e.heap_len--], ri(
+    ] = e.heap[e.heap_len--], ti(
       e,
       r,
       1
@@ -2429,7 +2429,7 @@ function Ni(e, t) {
     ], e.heap[--e.heap_max] = s, e.heap[--e.heap_max] = o, r[p * 2] = r[s * 2] + r[o * 2], e.depth[p] = (e.depth[s] >= e.depth[o] ? e.depth[s] : e.depth[o]) + 1, r[s * 2 + 1] = r[o * 2 + 1] = p, e.heap[
       1
       /*SMALLEST*/
-    ] = p++, ri(
+    ] = p++, ti(
       e,
       r,
       1
@@ -2460,7 +2460,7 @@ function Ga(e, t, r) {
 }
 function ju(e) {
   var t;
-  for (za(e, e.dyn_ltree, e.l_desc.max_code), za(e, e.dyn_dtree, e.d_desc.max_code), Ni(e, e.bl_desc), t = pa - 1; t >= 3 && e.bl_tree[hf[t] * 2 + 1] === 0; t--)
+  for (za(e, e.dyn_ltree, e.l_desc.max_code), za(e, e.dyn_dtree, e.d_desc.max_code), Fi(e, e.bl_desc), t = fa - 1; t >= 3 && e.bl_tree[hf[t] * 2 + 1] === 0; t--)
     ;
   return e.opt_len += 3 * (t + 1) + 5 + 5 + 4, t;
 }
@@ -2477,33 +2477,33 @@ function Uu(e) {
       return Ua;
   if (e.dyn_ltree[9 * 2] !== 0 || e.dyn_ltree[10 * 2] !== 0 || e.dyn_ltree[13 * 2] !== 0)
     return Ma;
-  for (r = 32; r < Ds; r++)
+  for (r = 32; r < Is; r++)
     if (e.dyn_ltree[r * 2] !== 0)
       return Ma;
   return Ua;
 }
 var Za = !1;
 function Mu(e) {
-  Za || (Nu(), Za = !0), e.l_desc = new ti(e.dyn_ltree, mf), e.d_desc = new ti(e.dyn_dtree, yf), e.bl_desc = new ti(e.bl_tree, _f), e.bi_buf = 0, e.bi_valid = 0, vf(e);
+  Za || (Nu(), Za = !0), e.l_desc = new ei(e.dyn_ltree, mf), e.d_desc = new ei(e.dyn_dtree, yf), e.bl_desc = new ei(e.bl_tree, _f), e.bi_buf = 0, e.bi_valid = 0, vf(e);
 }
 function kf(e, t, r, i) {
   pt(e, (Cu << 1) + (i ? 1 : 0), 3), Bu(e, t, r);
 }
 function qu(e) {
-  pt(e, ff << 1, 3), Bt(e, ca, Yt), Hu(e);
+  pt(e, ff << 1, 3), Bt(e, pa, Yt), Hu(e);
 }
 function Ku(e, t, r, i) {
   var a, n, s = 0;
-  e.level > 0 ? (e.strm.data_type === Tu && (e.strm.data_type = Uu(e)), Ni(e, e.l_desc), Ni(e, e.d_desc), s = ju(e), a = e.opt_len + 3 + 7 >>> 3, n = e.static_len + 3 + 7 >>> 3, n <= a && (a = n)) : a = n = r + 5, r + 4 <= a && t !== -1 ? kf(e, t, r, i) : e.strategy === Au || n === a ? (pt(e, (ff << 1) + (i ? 1 : 0), 3), Ka(e, Yt, hs)) : (pt(e, (Ou << 1) + (i ? 1 : 0), 3), Wu(e, e.l_desc.max_code + 1, e.d_desc.max_code + 1, s + 1), Ka(e, e.dyn_ltree, e.dyn_dtree)), vf(e), i && xf(e);
+  e.level > 0 ? (e.strm.data_type === Tu && (e.strm.data_type = Uu(e)), Fi(e, e.l_desc), Fi(e, e.d_desc), s = ju(e), a = e.opt_len + 3 + 7 >>> 3, n = e.static_len + 3 + 7 >>> 3, n <= a && (a = n)) : a = n = r + 5, r + 4 <= a && t !== -1 ? kf(e, t, r, i) : e.strategy === Au || n === a ? (pt(e, (ff << 1) + (i ? 1 : 0), 3), Ka(e, Yt, ds)) : (pt(e, (Ou << 1) + (i ? 1 : 0), 3), Wu(e, e.l_desc.max_code + 1, e.d_desc.max_code + 1, s + 1), Ka(e, e.dyn_ltree, e.dyn_dtree)), vf(e), i && xf(e);
 }
 function zu(e, t, r) {
-  return e.pending_buf[e.d_buf + e.last_lit * 2] = t >>> 8 & 255, e.pending_buf[e.d_buf + e.last_lit * 2 + 1] = t & 255, e.pending_buf[e.l_buf + e.last_lit] = r & 255, e.last_lit++, t === 0 ? e.dyn_ltree[r * 2]++ : (e.matches++, t--, e.dyn_ltree[(ks[r] + Ds + 1) * 2]++, e.dyn_dtree[gf(t) * 2]++), e.last_lit === e.lit_bufsize - 1;
+  return e.pending_buf[e.d_buf + e.last_lit * 2] = t >>> 8 & 255, e.pending_buf[e.d_buf + e.last_lit * 2 + 1] = t & 255, e.pending_buf[e.l_buf + e.last_lit] = r & 255, e.last_lit++, t === 0 ? e.dyn_ltree[r * 2]++ : (e.matches++, t--, e.dyn_ltree[(xs[r] + Is + 1) * 2]++, e.dyn_dtree[gf(t) * 2]++), e.last_lit === e.lit_bufsize - 1;
 }
-es._tr_init = Mu;
-es._tr_stored_block = kf;
-es._tr_flush_block = Ku;
-es._tr_tally = zu;
-es._tr_align = qu;
+Qr._tr_init = Mu;
+Qr._tr_stored_block = kf;
+Qr._tr_flush_block = Ku;
+Qr._tr_tally = zu;
+Qr._tr_align = qu;
 function Gu(e, t, r, i) {
   for (var a = e & 65535 | 0, n = e >>> 16 & 65535 | 0, s = 0; r !== 0; ) {
     s = r > 2e3 ? 2e3 : r, r -= s;
@@ -2532,7 +2532,7 @@ function Yu(e, t, r, i) {
     e = e >>> 8 ^ a[(e ^ t[s]) & 255];
   return e ^ -1;
 }
-var Ef = Yu, da = {
+var Ef = Yu, ua = {
   2: "need dictionary",
   /* Z_NEED_DICT       2  */
   1: "stream end",
@@ -2551,36 +2551,36 @@ var Ef = Yu, da = {
   /* Z_BUF_ERROR     (-5) */
   "-6": "incompatible version"
   /* Z_VERSION_ERROR (-6) */
-}, st = tr, St = es, Pf = Sf, or = Ef, Xu = da, Dr = 0, Ju = 1, Qu = 3, yr = 4, Va = 5, jt = 0, Ya = 1, Et = -2, ed = -3, si = -5, td = -1, rd = 1, Ms = 2, sd = 3, nd = 4, id = 0, ad = 2, Nn = 8, od = 9, ld = 15, fd = 8, pd = 29, cd = 256, Bi = cd + 1 + pd, ud = 30, dd = 19, hd = 2 * Bi + 1, md = 15, ye = 3, hr = 258, Rt = hr + ye + 1, yd = 32, Bn = 42, ji = 69, fn = 73, pn = 91, cn = 103, Sr = 113, cs = 666, Me = 1, $s = 2, Tr = 3, rs = 4, _d = 3;
-function mr(e, t) {
+}, st = er, St = Qr, Pf = Sf, ar = Ef, Xu = ua, Ir = 0, Ju = 1, Qu = 3, mr = 4, Va = 5, jt = 0, Ya = 1, Et = -2, ed = -3, ri = -5, td = -1, rd = 1, Us = 2, sd = 3, nd = 4, id = 0, ad = 2, Fn = 8, od = 9, ld = 15, fd = 8, pd = 29, cd = 256, Ni = cd + 1 + pd, ud = 30, dd = 19, hd = 2 * Ni + 1, md = 15, ye = 3, dr = 258, Rt = dr + ye + 1, yd = 32, Nn = 42, Bi = 69, ln = 73, fn = 91, pn = 103, kr = 113, ps = 666, Me = 1, Ds = 2, Ar = 3, ts = 4, _d = 3;
+function hr(e, t) {
   return e.msg = Xu[t], t;
 }
 function Xa(e) {
   return (e << 1) - (e > 4 ? 9 : 0);
 }
-function dr(e) {
+function ur(e) {
   for (var t = e.length; --t >= 0; )
     e[t] = 0;
 }
-function lr(e) {
+function or(e) {
   var t = e.state, r = t.pending;
   r > e.avail_out && (r = e.avail_out), r !== 0 && (st.arraySet(e.output, t.pending_buf, t.pending_out, r, e.next_out), e.next_out += r, t.pending_out += r, e.total_out += r, e.avail_out -= r, t.pending -= r, t.pending === 0 && (t.pending_out = 0));
 }
 function Xe(e, t) {
-  St._tr_flush_block(e, e.block_start >= 0 ? e.block_start : -1, e.strstart - e.block_start, t), e.block_start = e.strstart, lr(e.strm);
+  St._tr_flush_block(e, e.block_start >= 0 ? e.block_start : -1, e.strstart - e.block_start, t), e.block_start = e.strstart, or(e.strm);
 }
 function xe(e, t) {
   e.pending_buf[e.pending++] = t;
 }
-function is(e, t) {
+function ns(e, t) {
   e.pending_buf[e.pending++] = t >>> 8 & 255, e.pending_buf[e.pending++] = t & 255;
 }
 function gd(e, t, r, i) {
   var a = e.avail_in;
-  return a > i && (a = i), a === 0 ? 0 : (e.avail_in -= a, st.arraySet(t, e.input, e.next_in, a, r), e.state.wrap === 1 ? e.adler = Pf(e.adler, t, a, r) : e.state.wrap === 2 && (e.adler = or(e.adler, t, a, r)), e.next_in += a, e.total_in += a, a);
+  return a > i && (a = i), a === 0 ? 0 : (e.avail_in -= a, st.arraySet(t, e.input, e.next_in, a, r), e.state.wrap === 1 ? e.adler = Pf(e.adler, t, a, r) : e.state.wrap === 2 && (e.adler = ar(e.adler, t, a, r)), e.next_in += a, e.total_in += a, a);
 }
 function Af(e, t) {
-  var r = e.max_chain_length, i = e.strstart, a, n, s = e.prev_length, o = e.nice_match, f = e.strstart > e.w_size - Rt ? e.strstart - (e.w_size - Rt) : 0, p = e.window, c = e.w_mask, m = e.prev, h = e.strstart + hr, _ = p[i + s - 1], L = p[i + s];
+  var r = e.max_chain_length, i = e.strstart, a, n, s = e.prev_length, o = e.nice_match, f = e.strstart > e.w_size - Rt ? e.strstart - (e.w_size - Rt) : 0, p = e.window, c = e.w_mask, m = e.prev, h = e.strstart + dr, _ = p[i + s - 1], L = p[i + s];
   e.prev_length >= e.good_match && (r >>= 2), o > e.lookahead && (o = e.lookahead);
   do
     if (a = t, !(p[a + s] !== L || p[a + s - 1] !== _ || p[a] !== p[i] || p[++a] !== p[i + 1])) {
@@ -2588,7 +2588,7 @@ function Af(e, t) {
       do
         ;
       while (p[++i] === p[++a] && p[++i] === p[++a] && p[++i] === p[++a] && p[++i] === p[++a] && p[++i] === p[++a] && p[++i] === p[++a] && p[++i] === p[++a] && p[++i] === p[++a] && i < h);
-      if (n = hr - (h - i), i = h - hr, n > s) {
+      if (n = dr - (h - i), i = h - dr, n > s) {
         if (e.match_start = t, s = n, n >= o)
           break;
         _ = p[i + s - 1], L = p[i + s];
@@ -2597,7 +2597,7 @@ function Af(e, t) {
   while ((t = m[t & c]) > f && --r !== 0);
   return s <= e.lookahead ? s : e.lookahead;
 }
-function Cr(e) {
+function Tr(e) {
   var t = e.w_size, r, i, a, n, s;
   do {
     if (n = e.window_size - e.lookahead - e.strstart, e.strstart >= t + (t - Rt)) {
@@ -2622,7 +2622,7 @@ function wd(e, t) {
   var r = 65535;
   for (r > e.pending_buf_size - 5 && (r = e.pending_buf_size - 5); ; ) {
     if (e.lookahead <= 1) {
-      if (Cr(e), e.lookahead === 0 && t === Dr)
+      if (Tr(e), e.lookahead === 0 && t === Ir)
         return Me;
       if (e.lookahead === 0)
         break;
@@ -2632,12 +2632,12 @@ function wd(e, t) {
     if ((e.strstart === 0 || e.strstart >= i) && (e.lookahead = e.strstart - i, e.strstart = i, Xe(e, !1), e.strm.avail_out === 0) || e.strstart - e.block_start >= e.w_size - Rt && (Xe(e, !1), e.strm.avail_out === 0))
       return Me;
   }
-  return e.insert = 0, t === yr ? (Xe(e, !0), e.strm.avail_out === 0 ? Tr : rs) : (e.strstart > e.block_start && (Xe(e, !1), e.strm.avail_out === 0), Me);
+  return e.insert = 0, t === mr ? (Xe(e, !0), e.strm.avail_out === 0 ? Ar : ts) : (e.strstart > e.block_start && (Xe(e, !1), e.strm.avail_out === 0), Me);
 }
-function ni(e, t) {
+function si(e, t) {
   for (var r, i; ; ) {
     if (e.lookahead < Rt) {
-      if (Cr(e), e.lookahead < Rt && t === Dr)
+      if (Tr(e), e.lookahead < Rt && t === Ir)
         return Me;
       if (e.lookahead === 0)
         break;
@@ -2656,12 +2656,12 @@ function ni(e, t) {
     if (i && (Xe(e, !1), e.strm.avail_out === 0))
       return Me;
   }
-  return e.insert = e.strstart < ye - 1 ? e.strstart : ye - 1, t === yr ? (Xe(e, !0), e.strm.avail_out === 0 ? Tr : rs) : e.last_lit && (Xe(e, !1), e.strm.avail_out === 0) ? Me : $s;
+  return e.insert = e.strstart < ye - 1 ? e.strstart : ye - 1, t === mr ? (Xe(e, !0), e.strm.avail_out === 0 ? Ar : ts) : e.last_lit && (Xe(e, !1), e.strm.avail_out === 0) ? Me : Ds;
 }
-function Fr(e, t) {
+function Hr(e, t) {
   for (var r, i, a; ; ) {
     if (e.lookahead < Rt) {
-      if (Cr(e), e.lookahead < Rt && t === Dr)
+      if (Tr(e), e.lookahead < Rt && t === Ir)
         return Me;
       if (e.lookahead === 0)
         break;
@@ -2679,76 +2679,76 @@ function Fr(e, t) {
     } else
       e.match_available = 1, e.strstart++, e.lookahead--;
   }
-  return e.match_available && (i = St._tr_tally(e, 0, e.window[e.strstart - 1]), e.match_available = 0), e.insert = e.strstart < ye - 1 ? e.strstart : ye - 1, t === yr ? (Xe(e, !0), e.strm.avail_out === 0 ? Tr : rs) : e.last_lit && (Xe(e, !1), e.strm.avail_out === 0) ? Me : $s;
+  return e.match_available && (i = St._tr_tally(e, 0, e.window[e.strstart - 1]), e.match_available = 0), e.insert = e.strstart < ye - 1 ? e.strstart : ye - 1, t === mr ? (Xe(e, !0), e.strm.avail_out === 0 ? Ar : ts) : e.last_lit && (Xe(e, !1), e.strm.avail_out === 0) ? Me : Ds;
 }
 function bd(e, t) {
   for (var r, i, a, n, s = e.window; ; ) {
-    if (e.lookahead <= hr) {
-      if (Cr(e), e.lookahead <= hr && t === Dr)
+    if (e.lookahead <= dr) {
+      if (Tr(e), e.lookahead <= dr && t === Ir)
         return Me;
       if (e.lookahead === 0)
         break;
     }
     if (e.match_length = 0, e.lookahead >= ye && e.strstart > 0 && (a = e.strstart - 1, i = s[a], i === s[++a] && i === s[++a] && i === s[++a])) {
-      n = e.strstart + hr;
+      n = e.strstart + dr;
       do
         ;
       while (i === s[++a] && i === s[++a] && i === s[++a] && i === s[++a] && i === s[++a] && i === s[++a] && i === s[++a] && i === s[++a] && a < n);
-      e.match_length = hr - (n - a), e.match_length > e.lookahead && (e.match_length = e.lookahead);
+      e.match_length = dr - (n - a), e.match_length > e.lookahead && (e.match_length = e.lookahead);
     }
     if (e.match_length >= ye ? (r = St._tr_tally(e, 1, e.match_length - ye), e.lookahead -= e.match_length, e.strstart += e.match_length, e.match_length = 0) : (r = St._tr_tally(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++), r && (Xe(e, !1), e.strm.avail_out === 0))
       return Me;
   }
-  return e.insert = 0, t === yr ? (Xe(e, !0), e.strm.avail_out === 0 ? Tr : rs) : e.last_lit && (Xe(e, !1), e.strm.avail_out === 0) ? Me : $s;
+  return e.insert = 0, t === mr ? (Xe(e, !0), e.strm.avail_out === 0 ? Ar : ts) : e.last_lit && (Xe(e, !1), e.strm.avail_out === 0) ? Me : Ds;
 }
 function vd(e, t) {
   for (var r; ; ) {
-    if (e.lookahead === 0 && (Cr(e), e.lookahead === 0)) {
-      if (t === Dr)
+    if (e.lookahead === 0 && (Tr(e), e.lookahead === 0)) {
+      if (t === Ir)
         return Me;
       break;
     }
     if (e.match_length = 0, r = St._tr_tally(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++, r && (Xe(e, !1), e.strm.avail_out === 0))
       return Me;
   }
-  return e.insert = 0, t === yr ? (Xe(e, !0), e.strm.avail_out === 0 ? Tr : rs) : e.last_lit && (Xe(e, !1), e.strm.avail_out === 0) ? Me : $s;
+  return e.insert = 0, t === mr ? (Xe(e, !0), e.strm.avail_out === 0 ? Ar : ts) : e.last_lit && (Xe(e, !1), e.strm.avail_out === 0) ? Me : Ds;
 }
 function $t(e, t, r, i, a) {
   this.good_length = e, this.max_lazy = t, this.nice_length = r, this.max_chain = i, this.func = a;
 }
-var Kr;
-Kr = [
+var qr;
+qr = [
   /*      good lazy nice chain */
   new $t(0, 0, 0, 0, wd),
   /* 0 store only */
-  new $t(4, 4, 8, 4, ni),
+  new $t(4, 4, 8, 4, si),
   /* 1 max speed, no lazy matches */
-  new $t(4, 5, 16, 8, ni),
+  new $t(4, 5, 16, 8, si),
   /* 2 */
-  new $t(4, 6, 32, 32, ni),
+  new $t(4, 6, 32, 32, si),
   /* 3 */
-  new $t(4, 4, 16, 16, Fr),
+  new $t(4, 4, 16, 16, Hr),
   /* 4 lazy matches */
-  new $t(8, 16, 32, 32, Fr),
+  new $t(8, 16, 32, 32, Hr),
   /* 5 */
-  new $t(8, 16, 128, 128, Fr),
+  new $t(8, 16, 128, 128, Hr),
   /* 6 */
-  new $t(8, 32, 128, 256, Fr),
+  new $t(8, 32, 128, 256, Hr),
   /* 7 */
-  new $t(32, 128, 258, 1024, Fr),
+  new $t(32, 128, 258, 1024, Hr),
   /* 8 */
-  new $t(32, 258, 258, 4096, Fr)
+  new $t(32, 258, 258, 4096, Hr)
   /* 9 max compression */
 ];
 function xd(e) {
-  e.window_size = 2 * e.w_size, dr(e.head), e.max_lazy_match = Kr[e.level].max_lazy, e.good_match = Kr[e.level].good_length, e.nice_match = Kr[e.level].nice_length, e.max_chain_length = Kr[e.level].max_chain, e.strstart = 0, e.block_start = 0, e.lookahead = 0, e.insert = 0, e.match_length = e.prev_length = ye - 1, e.match_available = 0, e.ins_h = 0;
+  e.window_size = 2 * e.w_size, ur(e.head), e.max_lazy_match = qr[e.level].max_lazy, e.good_match = qr[e.level].good_length, e.nice_match = qr[e.level].nice_length, e.max_chain_length = qr[e.level].max_chain, e.strstart = 0, e.block_start = 0, e.lookahead = 0, e.insert = 0, e.match_length = e.prev_length = ye - 1, e.match_available = 0, e.ins_h = 0;
 }
 function kd() {
-  this.strm = null, this.status = 0, this.pending_buf = null, this.pending_buf_size = 0, this.pending_out = 0, this.pending = 0, this.wrap = 0, this.gzhead = null, this.gzindex = 0, this.method = Nn, this.last_flush = -1, this.w_size = 0, this.w_bits = 0, this.w_mask = 0, this.window = null, this.window_size = 0, this.prev = null, this.head = null, this.ins_h = 0, this.hash_size = 0, this.hash_bits = 0, this.hash_mask = 0, this.hash_shift = 0, this.block_start = 0, this.match_length = 0, this.prev_match = 0, this.match_available = 0, this.strstart = 0, this.match_start = 0, this.lookahead = 0, this.prev_length = 0, this.max_chain_length = 0, this.max_lazy_match = 0, this.level = 0, this.strategy = 0, this.good_match = 0, this.nice_match = 0, this.dyn_ltree = new st.Buf16(hd * 2), this.dyn_dtree = new st.Buf16((2 * ud + 1) * 2), this.bl_tree = new st.Buf16((2 * dd + 1) * 2), dr(this.dyn_ltree), dr(this.dyn_dtree), dr(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new st.Buf16(md + 1), this.heap = new st.Buf16(2 * Bi + 1), dr(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new st.Buf16(2 * Bi + 1), dr(this.depth), this.l_buf = 0, this.lit_bufsize = 0, this.last_lit = 0, this.d_buf = 0, this.opt_len = 0, this.static_len = 0, this.matches = 0, this.insert = 0, this.bi_buf = 0, this.bi_valid = 0;
+  this.strm = null, this.status = 0, this.pending_buf = null, this.pending_buf_size = 0, this.pending_out = 0, this.pending = 0, this.wrap = 0, this.gzhead = null, this.gzindex = 0, this.method = Fn, this.last_flush = -1, this.w_size = 0, this.w_bits = 0, this.w_mask = 0, this.window = null, this.window_size = 0, this.prev = null, this.head = null, this.ins_h = 0, this.hash_size = 0, this.hash_bits = 0, this.hash_mask = 0, this.hash_shift = 0, this.block_start = 0, this.match_length = 0, this.prev_match = 0, this.match_available = 0, this.strstart = 0, this.match_start = 0, this.lookahead = 0, this.prev_length = 0, this.max_chain_length = 0, this.max_lazy_match = 0, this.level = 0, this.strategy = 0, this.good_match = 0, this.nice_match = 0, this.dyn_ltree = new st.Buf16(hd * 2), this.dyn_dtree = new st.Buf16((2 * ud + 1) * 2), this.bl_tree = new st.Buf16((2 * dd + 1) * 2), ur(this.dyn_ltree), ur(this.dyn_dtree), ur(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new st.Buf16(md + 1), this.heap = new st.Buf16(2 * Ni + 1), ur(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new st.Buf16(2 * Ni + 1), ur(this.depth), this.l_buf = 0, this.lit_bufsize = 0, this.last_lit = 0, this.d_buf = 0, this.opt_len = 0, this.static_len = 0, this.matches = 0, this.insert = 0, this.bi_buf = 0, this.bi_valid = 0;
 }
 function Tf(e) {
   var t;
-  return !e || !e.state ? mr(e, Et) : (e.total_in = e.total_out = 0, e.data_type = ad, t = e.state, t.pending = 0, t.pending_out = 0, t.wrap < 0 && (t.wrap = -t.wrap), t.status = t.wrap ? Bn : Sr, e.adler = t.wrap === 2 ? 0 : 1, t.last_flush = Dr, St._tr_init(t), jt);
+  return !e || !e.state ? hr(e, Et) : (e.total_in = e.total_out = 0, e.data_type = ad, t = e.state, t.pending = 0, t.pending_out = 0, t.wrap < 0 && (t.wrap = -t.wrap), t.status = t.wrap ? Nn : kr, e.adler = t.wrap === 2 ? 0 : 1, t.last_flush = Ir, St._tr_init(t), jt);
 }
 function Cf(e) {
   var t = Tf(e);
@@ -2761,94 +2761,94 @@ function Of(e, t, r, i, a, n) {
   if (!e)
     return Et;
   var s = 1;
-  if (t === td && (t = 6), i < 0 ? (s = 0, i = -i) : i > 15 && (s = 2, i -= 16), a < 1 || a > od || r !== Nn || i < 8 || i > 15 || t < 0 || t > 9 || n < 0 || n > nd)
-    return mr(e, Et);
+  if (t === td && (t = 6), i < 0 ? (s = 0, i = -i) : i > 15 && (s = 2, i -= 16), a < 1 || a > od || r !== Fn || i < 8 || i > 15 || t < 0 || t > 9 || n < 0 || n > nd)
+    return hr(e, Et);
   i === 8 && (i = 9);
   var o = new kd();
   return e.state = o, o.strm = e, o.wrap = s, o.gzhead = null, o.w_bits = i, o.w_size = 1 << o.w_bits, o.w_mask = o.w_size - 1, o.hash_bits = a + 7, o.hash_size = 1 << o.hash_bits, o.hash_mask = o.hash_size - 1, o.hash_shift = ~~((o.hash_bits + ye - 1) / ye), o.window = new st.Buf8(o.w_size * 2), o.head = new st.Buf16(o.hash_size), o.prev = new st.Buf16(o.w_size), o.lit_bufsize = 1 << a + 6, o.pending_buf_size = o.lit_bufsize * 4, o.pending_buf = new st.Buf8(o.pending_buf_size), o.d_buf = 1 * o.lit_bufsize, o.l_buf = 3 * o.lit_bufsize, o.level = t, o.strategy = n, o.method = r, Cf(e);
 }
 function Ed(e, t) {
-  return Of(e, t, Nn, ld, fd, id);
+  return Of(e, t, Fn, ld, fd, id);
 }
 function Pd(e, t) {
   var r, i, a, n;
   if (!e || !e.state || t > Va || t < 0)
-    return e ? mr(e, Et) : Et;
-  if (i = e.state, !e.output || !e.input && e.avail_in !== 0 || i.status === cs && t !== yr)
-    return mr(e, e.avail_out === 0 ? si : Et);
-  if (i.strm = e, r = i.last_flush, i.last_flush = t, i.status === Bn)
+    return e ? hr(e, Et) : Et;
+  if (i = e.state, !e.output || !e.input && e.avail_in !== 0 || i.status === ps && t !== mr)
+    return hr(e, e.avail_out === 0 ? ri : Et);
+  if (i.strm = e, r = i.last_flush, i.last_flush = t, i.status === Nn)
     if (i.wrap === 2)
       e.adler = 0, xe(i, 31), xe(i, 139), xe(i, 8), i.gzhead ? (xe(
         i,
         (i.gzhead.text ? 1 : 0) + (i.gzhead.hcrc ? 2 : 0) + (i.gzhead.extra ? 4 : 0) + (i.gzhead.name ? 8 : 0) + (i.gzhead.comment ? 16 : 0)
-      ), xe(i, i.gzhead.time & 255), xe(i, i.gzhead.time >> 8 & 255), xe(i, i.gzhead.time >> 16 & 255), xe(i, i.gzhead.time >> 24 & 255), xe(i, i.level === 9 ? 2 : i.strategy >= Ms || i.level < 2 ? 4 : 0), xe(i, i.gzhead.os & 255), i.gzhead.extra && i.gzhead.extra.length && (xe(i, i.gzhead.extra.length & 255), xe(i, i.gzhead.extra.length >> 8 & 255)), i.gzhead.hcrc && (e.adler = or(e.adler, i.pending_buf, i.pending, 0)), i.gzindex = 0, i.status = ji) : (xe(i, 0), xe(i, 0), xe(i, 0), xe(i, 0), xe(i, 0), xe(i, i.level === 9 ? 2 : i.strategy >= Ms || i.level < 2 ? 4 : 0), xe(i, _d), i.status = Sr);
+      ), xe(i, i.gzhead.time & 255), xe(i, i.gzhead.time >> 8 & 255), xe(i, i.gzhead.time >> 16 & 255), xe(i, i.gzhead.time >> 24 & 255), xe(i, i.level === 9 ? 2 : i.strategy >= Us || i.level < 2 ? 4 : 0), xe(i, i.gzhead.os & 255), i.gzhead.extra && i.gzhead.extra.length && (xe(i, i.gzhead.extra.length & 255), xe(i, i.gzhead.extra.length >> 8 & 255)), i.gzhead.hcrc && (e.adler = ar(e.adler, i.pending_buf, i.pending, 0)), i.gzindex = 0, i.status = Bi) : (xe(i, 0), xe(i, 0), xe(i, 0), xe(i, 0), xe(i, 0), xe(i, i.level === 9 ? 2 : i.strategy >= Us || i.level < 2 ? 4 : 0), xe(i, _d), i.status = kr);
     else {
-      var s = Nn + (i.w_bits - 8 << 4) << 8, o = -1;
-      i.strategy >= Ms || i.level < 2 ? o = 0 : i.level < 6 ? o = 1 : i.level === 6 ? o = 2 : o = 3, s |= o << 6, i.strstart !== 0 && (s |= yd), s += 31 - s % 31, i.status = Sr, is(i, s), i.strstart !== 0 && (is(i, e.adler >>> 16), is(i, e.adler & 65535)), e.adler = 1;
+      var s = Fn + (i.w_bits - 8 << 4) << 8, o = -1;
+      i.strategy >= Us || i.level < 2 ? o = 0 : i.level < 6 ? o = 1 : i.level === 6 ? o = 2 : o = 3, s |= o << 6, i.strstart !== 0 && (s |= yd), s += 31 - s % 31, i.status = kr, ns(i, s), i.strstart !== 0 && (ns(i, e.adler >>> 16), ns(i, e.adler & 65535)), e.adler = 1;
     }
-  if (i.status === ji)
+  if (i.status === Bi)
     if (i.gzhead.extra) {
-      for (a = i.pending; i.gzindex < (i.gzhead.extra.length & 65535) && !(i.pending === i.pending_buf_size && (i.gzhead.hcrc && i.pending > a && (e.adler = or(e.adler, i.pending_buf, i.pending - a, a)), lr(e), a = i.pending, i.pending === i.pending_buf_size)); )
+      for (a = i.pending; i.gzindex < (i.gzhead.extra.length & 65535) && !(i.pending === i.pending_buf_size && (i.gzhead.hcrc && i.pending > a && (e.adler = ar(e.adler, i.pending_buf, i.pending - a, a)), or(e), a = i.pending, i.pending === i.pending_buf_size)); )
         xe(i, i.gzhead.extra[i.gzindex] & 255), i.gzindex++;
-      i.gzhead.hcrc && i.pending > a && (e.adler = or(e.adler, i.pending_buf, i.pending - a, a)), i.gzindex === i.gzhead.extra.length && (i.gzindex = 0, i.status = fn);
+      i.gzhead.hcrc && i.pending > a && (e.adler = ar(e.adler, i.pending_buf, i.pending - a, a)), i.gzindex === i.gzhead.extra.length && (i.gzindex = 0, i.status = ln);
     } else
-      i.status = fn;
-  if (i.status === fn)
+      i.status = ln;
+  if (i.status === ln)
     if (i.gzhead.name) {
       a = i.pending;
       do {
-        if (i.pending === i.pending_buf_size && (i.gzhead.hcrc && i.pending > a && (e.adler = or(e.adler, i.pending_buf, i.pending - a, a)), lr(e), a = i.pending, i.pending === i.pending_buf_size)) {
+        if (i.pending === i.pending_buf_size && (i.gzhead.hcrc && i.pending > a && (e.adler = ar(e.adler, i.pending_buf, i.pending - a, a)), or(e), a = i.pending, i.pending === i.pending_buf_size)) {
           n = 1;
           break;
         }
         i.gzindex < i.gzhead.name.length ? n = i.gzhead.name.charCodeAt(i.gzindex++) & 255 : n = 0, xe(i, n);
       } while (n !== 0);
-      i.gzhead.hcrc && i.pending > a && (e.adler = or(e.adler, i.pending_buf, i.pending - a, a)), n === 0 && (i.gzindex = 0, i.status = pn);
+      i.gzhead.hcrc && i.pending > a && (e.adler = ar(e.adler, i.pending_buf, i.pending - a, a)), n === 0 && (i.gzindex = 0, i.status = fn);
     } else
-      i.status = pn;
-  if (i.status === pn)
+      i.status = fn;
+  if (i.status === fn)
     if (i.gzhead.comment) {
       a = i.pending;
       do {
-        if (i.pending === i.pending_buf_size && (i.gzhead.hcrc && i.pending > a && (e.adler = or(e.adler, i.pending_buf, i.pending - a, a)), lr(e), a = i.pending, i.pending === i.pending_buf_size)) {
+        if (i.pending === i.pending_buf_size && (i.gzhead.hcrc && i.pending > a && (e.adler = ar(e.adler, i.pending_buf, i.pending - a, a)), or(e), a = i.pending, i.pending === i.pending_buf_size)) {
           n = 1;
           break;
         }
         i.gzindex < i.gzhead.comment.length ? n = i.gzhead.comment.charCodeAt(i.gzindex++) & 255 : n = 0, xe(i, n);
       } while (n !== 0);
-      i.gzhead.hcrc && i.pending > a && (e.adler = or(e.adler, i.pending_buf, i.pending - a, a)), n === 0 && (i.status = cn);
+      i.gzhead.hcrc && i.pending > a && (e.adler = ar(e.adler, i.pending_buf, i.pending - a, a)), n === 0 && (i.status = pn);
     } else
-      i.status = cn;
-  if (i.status === cn && (i.gzhead.hcrc ? (i.pending + 2 > i.pending_buf_size && lr(e), i.pending + 2 <= i.pending_buf_size && (xe(i, e.adler & 255), xe(i, e.adler >> 8 & 255), e.adler = 0, i.status = Sr)) : i.status = Sr), i.pending !== 0) {
-    if (lr(e), e.avail_out === 0)
+      i.status = pn;
+  if (i.status === pn && (i.gzhead.hcrc ? (i.pending + 2 > i.pending_buf_size && or(e), i.pending + 2 <= i.pending_buf_size && (xe(i, e.adler & 255), xe(i, e.adler >> 8 & 255), e.adler = 0, i.status = kr)) : i.status = kr), i.pending !== 0) {
+    if (or(e), e.avail_out === 0)
       return i.last_flush = -1, jt;
-  } else if (e.avail_in === 0 && Xa(t) <= Xa(r) && t !== yr)
-    return mr(e, si);
-  if (i.status === cs && e.avail_in !== 0)
-    return mr(e, si);
-  if (e.avail_in !== 0 || i.lookahead !== 0 || t !== Dr && i.status !== cs) {
-    var f = i.strategy === Ms ? vd(i, t) : i.strategy === sd ? bd(i, t) : Kr[i.level].func(i, t);
-    if ((f === Tr || f === rs) && (i.status = cs), f === Me || f === Tr)
+  } else if (e.avail_in === 0 && Xa(t) <= Xa(r) && t !== mr)
+    return hr(e, ri);
+  if (i.status === ps && e.avail_in !== 0)
+    return hr(e, ri);
+  if (e.avail_in !== 0 || i.lookahead !== 0 || t !== Ir && i.status !== ps) {
+    var f = i.strategy === Us ? vd(i, t) : i.strategy === sd ? bd(i, t) : qr[i.level].func(i, t);
+    if ((f === Ar || f === ts) && (i.status = ps), f === Me || f === Ar)
       return e.avail_out === 0 && (i.last_flush = -1), jt;
-    if (f === $s && (t === Ju ? St._tr_align(i) : t !== Va && (St._tr_stored_block(i, 0, 0, !1), t === Qu && (dr(i.head), i.lookahead === 0 && (i.strstart = 0, i.block_start = 0, i.insert = 0))), lr(e), e.avail_out === 0))
+    if (f === Ds && (t === Ju ? St._tr_align(i) : t !== Va && (St._tr_stored_block(i, 0, 0, !1), t === Qu && (ur(i.head), i.lookahead === 0 && (i.strstart = 0, i.block_start = 0, i.insert = 0))), or(e), e.avail_out === 0))
       return i.last_flush = -1, jt;
   }
-  return t !== yr ? jt : i.wrap <= 0 ? Ya : (i.wrap === 2 ? (xe(i, e.adler & 255), xe(i, e.adler >> 8 & 255), xe(i, e.adler >> 16 & 255), xe(i, e.adler >> 24 & 255), xe(i, e.total_in & 255), xe(i, e.total_in >> 8 & 255), xe(i, e.total_in >> 16 & 255), xe(i, e.total_in >> 24 & 255)) : (is(i, e.adler >>> 16), is(i, e.adler & 65535)), lr(e), i.wrap > 0 && (i.wrap = -i.wrap), i.pending !== 0 ? jt : Ya);
+  return t !== mr ? jt : i.wrap <= 0 ? Ya : (i.wrap === 2 ? (xe(i, e.adler & 255), xe(i, e.adler >> 8 & 255), xe(i, e.adler >> 16 & 255), xe(i, e.adler >> 24 & 255), xe(i, e.total_in & 255), xe(i, e.total_in >> 8 & 255), xe(i, e.total_in >> 16 & 255), xe(i, e.total_in >> 24 & 255)) : (ns(i, e.adler >>> 16), ns(i, e.adler & 65535)), or(e), i.wrap > 0 && (i.wrap = -i.wrap), i.pending !== 0 ? jt : Ya);
 }
 function Ad(e) {
   var t;
-  return !e || !e.state ? Et : (t = e.state.status, t !== Bn && t !== ji && t !== fn && t !== pn && t !== cn && t !== Sr && t !== cs ? mr(e, Et) : (e.state = null, t === Sr ? mr(e, ed) : jt));
+  return !e || !e.state ? Et : (t = e.state.status, t !== Nn && t !== Bi && t !== ln && t !== fn && t !== pn && t !== kr && t !== ps ? hr(e, Et) : (e.state = null, t === kr ? hr(e, ed) : jt));
 }
 function Td(e, t) {
   var r = t.length, i, a, n, s, o, f, p, c;
-  if (!e || !e.state || (i = e.state, s = i.wrap, s === 2 || s === 1 && i.status !== Bn || i.lookahead))
+  if (!e || !e.state || (i = e.state, s = i.wrap, s === 2 || s === 1 && i.status !== Nn || i.lookahead))
     return Et;
-  for (s === 1 && (e.adler = Pf(e.adler, t, r, 0)), i.wrap = 0, r >= i.w_size && (s === 0 && (dr(i.head), i.strstart = 0, i.block_start = 0, i.insert = 0), c = new st.Buf8(i.w_size), st.arraySet(c, t, r - i.w_size, i.w_size, 0), t = c, r = i.w_size), o = e.avail_in, f = e.next_in, p = e.input, e.avail_in = r, e.next_in = 0, e.input = t, Cr(i); i.lookahead >= ye; ) {
+  for (s === 1 && (e.adler = Pf(e.adler, t, r, 0)), i.wrap = 0, r >= i.w_size && (s === 0 && (ur(i.head), i.strstart = 0, i.block_start = 0, i.insert = 0), c = new st.Buf8(i.w_size), st.arraySet(c, t, r - i.w_size, i.w_size, 0), t = c, r = i.w_size), o = e.avail_in, f = e.next_in, p = e.input, e.avail_in = r, e.next_in = 0, e.input = t, Tr(i); i.lookahead >= ye; ) {
     a = i.strstart, n = i.lookahead - (ye - 1);
     do
       i.ins_h = (i.ins_h << i.hash_shift ^ i.window[a + ye - 1]) & i.hash_mask, i.prev[a & i.w_mask] = i.head[i.ins_h], i.head[i.ins_h] = a, a++;
     while (--n);
-    i.strstart = a, i.lookahead = ye - 1, Cr(i);
+    i.strstart = a, i.lookahead = ye - 1, Tr(i);
   }
   return i.strstart += i.lookahead, i.block_start = i.strstart, i.insert = i.lookahead, i.lookahead = 0, i.match_length = i.prev_length = ye - 1, i.match_available = 0, e.next_in = f, e.input = p, e.avail_in = o, i.wrap = s, jt;
 }
@@ -2861,7 +2861,7 @@ qt.deflate = Pd;
 qt.deflateEnd = Ad;
 qt.deflateSetDictionary = Td;
 qt.deflateInfo = "pako deflate (from Nodeca project)";
-var $r = {}, jn = tr, Lf = !0, Rf = !0;
+var Dr = {}, Bn = er, Lf = !0, Rf = !0;
 try {
   String.fromCharCode.apply(null, [0]);
 } catch {
@@ -2872,41 +2872,41 @@ try {
 } catch {
   Rf = !1;
 }
-var Es = new jn.Buf8(256);
-for (var sr = 0; sr < 256; sr++)
-  Es[sr] = sr >= 252 ? 6 : sr >= 248 ? 5 : sr >= 240 ? 4 : sr >= 224 ? 3 : sr >= 192 ? 2 : 1;
-Es[254] = Es[254] = 1;
-$r.string2buf = function(e) {
+var Ss = new Bn.Buf8(256);
+for (var rr = 0; rr < 256; rr++)
+  Ss[rr] = rr >= 252 ? 6 : rr >= 248 ? 5 : rr >= 240 ? 4 : rr >= 224 ? 3 : rr >= 192 ? 2 : 1;
+Ss[254] = Ss[254] = 1;
+Dr.string2buf = function(e) {
   var t, r, i, a, n, s = e.length, o = 0;
   for (a = 0; a < s; a++)
     r = e.charCodeAt(a), (r & 64512) === 55296 && a + 1 < s && (i = e.charCodeAt(a + 1), (i & 64512) === 56320 && (r = 65536 + (r - 55296 << 10) + (i - 56320), a++)), o += r < 128 ? 1 : r < 2048 ? 2 : r < 65536 ? 3 : 4;
-  for (t = new jn.Buf8(o), n = 0, a = 0; n < o; a++)
+  for (t = new Bn.Buf8(o), n = 0, a = 0; n < o; a++)
     r = e.charCodeAt(a), (r & 64512) === 55296 && a + 1 < s && (i = e.charCodeAt(a + 1), (i & 64512) === 56320 && (r = 65536 + (r - 55296 << 10) + (i - 56320), a++)), r < 128 ? t[n++] = r : r < 2048 ? (t[n++] = 192 | r >>> 6, t[n++] = 128 | r & 63) : r < 65536 ? (t[n++] = 224 | r >>> 12, t[n++] = 128 | r >>> 6 & 63, t[n++] = 128 | r & 63) : (t[n++] = 240 | r >>> 18, t[n++] = 128 | r >>> 12 & 63, t[n++] = 128 | r >>> 6 & 63, t[n++] = 128 | r & 63);
   return t;
 };
 function If(e, t) {
   if (t < 65534 && (e.subarray && Rf || !e.subarray && Lf))
-    return String.fromCharCode.apply(null, jn.shrinkBuf(e, t));
+    return String.fromCharCode.apply(null, Bn.shrinkBuf(e, t));
   for (var r = "", i = 0; i < t; i++)
     r += String.fromCharCode(e[i]);
   return r;
 }
-$r.buf2binstring = function(e) {
+Dr.buf2binstring = function(e) {
   return If(e, e.length);
 };
-$r.binstring2buf = function(e) {
-  for (var t = new jn.Buf8(e.length), r = 0, i = t.length; r < i; r++)
+Dr.binstring2buf = function(e) {
+  for (var t = new Bn.Buf8(e.length), r = 0, i = t.length; r < i; r++)
     t[r] = e.charCodeAt(r);
   return t;
 };
-$r.buf2string = function(e, t) {
+Dr.buf2string = function(e, t) {
   var r, i, a, n, s = t || e.length, o = new Array(s * 2);
   for (i = 0, r = 0; r < s; ) {
     if (a = e[r++], a < 128) {
       o[i++] = a;
       continue;
     }
-    if (n = Es[a], n > 4) {
+    if (n = Ss[a], n > 4) {
       o[i++] = 65533, r += n - 1;
       continue;
     }
@@ -2920,19 +2920,19 @@ $r.buf2string = function(e, t) {
   }
   return If(o, i);
 };
-$r.utf8border = function(e, t) {
+Dr.utf8border = function(e, t) {
   var r;
   for (t = t || e.length, t > e.length && (t = e.length), r = t - 1; r >= 0 && (e[r] & 192) === 128; )
     r--;
-  return r < 0 || r === 0 ? t : r + Es[e[r]] > t ? r : t;
+  return r < 0 || r === 0 ? t : r + Ss[e[r]] > t ? r : t;
 };
 function Cd() {
   this.input = null, this.next_in = 0, this.avail_in = 0, this.total_in = 0, this.output = null, this.next_out = 0, this.avail_out = 0, this.total_out = 0, this.msg = "", this.state = null, this.data_type = 2, this.adler = 0;
 }
-var Df = Cd, ms = qt, ys = tr, Wi = $r, Ui = da, Od = Df, $f = Object.prototype.toString, Ld = 0, ii = 4, Zr = 0, Ja = 1, Qa = 2, Rd = -1, Id = 0, Dd = 8;
-function Or(e) {
-  if (!(this instanceof Or)) return new Or(e);
-  this.options = ys.assign({
+var Df = Cd, hs = qt, ms = er, ji = Dr, Wi = ua, Od = Df, $f = Object.prototype.toString, Ld = 0, ni = 4, Gr = 0, Ja = 1, Qa = 2, Rd = -1, Id = 0, Dd = 8;
+function Cr(e) {
+  if (!(this instanceof Cr)) return new Cr(e);
+  this.options = ms.assign({
     level: Rd,
     method: Dd,
     chunkSize: 16384,
@@ -2943,7 +2943,7 @@ function Or(e) {
   }, e || {});
   var t = this.options;
   t.raw && t.windowBits > 0 ? t.windowBits = -t.windowBits : t.gzip && t.windowBits > 0 && t.windowBits < 16 && (t.windowBits += 16), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new Od(), this.strm.avail_out = 0;
-  var r = ms.deflateInit2(
+  var r = hs.deflateInit2(
     this.strm,
     t.level,
     t.method,
@@ -2951,50 +2951,50 @@ function Or(e) {
     t.memLevel,
     t.strategy
   );
-  if (r !== Zr)
-    throw new Error(Ui[r]);
-  if (t.header && ms.deflateSetHeader(this.strm, t.header), t.dictionary) {
+  if (r !== Gr)
+    throw new Error(Wi[r]);
+  if (t.header && hs.deflateSetHeader(this.strm, t.header), t.dictionary) {
     var i;
-    if (typeof t.dictionary == "string" ? i = Wi.string2buf(t.dictionary) : $f.call(t.dictionary) === "[object ArrayBuffer]" ? i = new Uint8Array(t.dictionary) : i = t.dictionary, r = ms.deflateSetDictionary(this.strm, i), r !== Zr)
-      throw new Error(Ui[r]);
+    if (typeof t.dictionary == "string" ? i = ji.string2buf(t.dictionary) : $f.call(t.dictionary) === "[object ArrayBuffer]" ? i = new Uint8Array(t.dictionary) : i = t.dictionary, r = hs.deflateSetDictionary(this.strm, i), r !== Gr)
+      throw new Error(Wi[r]);
     this._dict_set = !0;
   }
 }
-Or.prototype.push = function(e, t) {
+Cr.prototype.push = function(e, t) {
   var r = this.strm, i = this.options.chunkSize, a, n;
   if (this.ended)
     return !1;
-  n = t === ~~t ? t : t === !0 ? ii : Ld, typeof e == "string" ? r.input = Wi.string2buf(e) : $f.call(e) === "[object ArrayBuffer]" ? r.input = new Uint8Array(e) : r.input = e, r.next_in = 0, r.avail_in = r.input.length;
+  n = t === ~~t ? t : t === !0 ? ni : Ld, typeof e == "string" ? r.input = ji.string2buf(e) : $f.call(e) === "[object ArrayBuffer]" ? r.input = new Uint8Array(e) : r.input = e, r.next_in = 0, r.avail_in = r.input.length;
   do {
-    if (r.avail_out === 0 && (r.output = new ys.Buf8(i), r.next_out = 0, r.avail_out = i), a = ms.deflate(r, n), a !== Ja && a !== Zr)
+    if (r.avail_out === 0 && (r.output = new ms.Buf8(i), r.next_out = 0, r.avail_out = i), a = hs.deflate(r, n), a !== Ja && a !== Gr)
       return this.onEnd(a), this.ended = !0, !1;
-    (r.avail_out === 0 || r.avail_in === 0 && (n === ii || n === Qa)) && (this.options.to === "string" ? this.onData(Wi.buf2binstring(ys.shrinkBuf(r.output, r.next_out))) : this.onData(ys.shrinkBuf(r.output, r.next_out)));
+    (r.avail_out === 0 || r.avail_in === 0 && (n === ni || n === Qa)) && (this.options.to === "string" ? this.onData(ji.buf2binstring(ms.shrinkBuf(r.output, r.next_out))) : this.onData(ms.shrinkBuf(r.output, r.next_out)));
   } while ((r.avail_in > 0 || r.avail_out === 0) && a !== Ja);
-  return n === ii ? (a = ms.deflateEnd(this.strm), this.onEnd(a), this.ended = !0, a === Zr) : (n === Qa && (this.onEnd(Zr), r.avail_out = 0), !0);
+  return n === ni ? (a = hs.deflateEnd(this.strm), this.onEnd(a), this.ended = !0, a === Gr) : (n === Qa && (this.onEnd(Gr), r.avail_out = 0), !0);
 };
-Or.prototype.onData = function(e) {
+Cr.prototype.onData = function(e) {
   this.chunks.push(e);
 };
-Or.prototype.onEnd = function(e) {
-  e === Zr && (this.options.to === "string" ? this.result = this.chunks.join("") : this.result = ys.flattenChunks(this.chunks)), this.chunks = [], this.err = e, this.msg = this.strm.msg;
+Cr.prototype.onEnd = function(e) {
+  e === Gr && (this.options.to === "string" ? this.result = this.chunks.join("") : this.result = ms.flattenChunks(this.chunks)), this.chunks = [], this.err = e, this.msg = this.strm.msg;
 };
-function ha(e, t) {
-  var r = new Or(t);
+function da(e, t) {
+  var r = new Cr(t);
   if (r.push(e, !0), r.err)
-    throw r.msg || Ui[r.err];
+    throw r.msg || Wi[r.err];
   return r.result;
 }
 function $d(e, t) {
-  return t = t || {}, t.raw = !0, ha(e, t);
+  return t = t || {}, t.raw = !0, da(e, t);
 }
 function Hd(e, t) {
-  return t = t || {}, t.gzip = !0, ha(e, t);
+  return t = t || {}, t.gzip = !0, da(e, t);
 }
-Is.Deflate = Or;
-Is.deflate = ha;
-Is.deflateRaw = $d;
-Is.gzip = Hd;
-var Hs = {}, It = {}, qs = 30, Fd = 12, Nd = function(t, r) {
+Rs.Deflate = Cr;
+Rs.deflate = da;
+Rs.deflateRaw = $d;
+Rs.gzip = Hd;
+var $s = {}, It = {}, Ms = 30, Fd = 12, Nd = function(t, r) {
   var i, a, n, s, o, f, p, c, m, h, _, L, y, g, b, R, O, H, A, $, S, P, C, k, E;
   i = t.state, a = t.next_in, k = t.input, n = a + (t.avail_in - 5), s = t.next_out, E = t.output, o = s - (r - t.avail_out), f = s + (t.avail_out - 257), p = i.dmax, c = i.wsize, m = i.whave, h = i.wnext, _ = i.window, L = i.hold, y = i.bits, g = i.lencode, b = i.distcode, R = (1 << i.lenbits) - 1, O = (1 << i.distbits) - 1;
   e:
@@ -3010,12 +3010,12 @@ var Hs = {}, It = {}, qs = 30, Fd = 12, Nd = function(t, r) {
               for (; ; ) {
                 if (A = H >>> 24, L >>>= A, y -= A, A = H >>> 16 & 255, A & 16) {
                   if (S = H & 65535, A &= 15, y < A && (L += k[a++] << y, y += 8, y < A && (L += k[a++] << y, y += 8)), S += L & (1 << A) - 1, S > p) {
-                    t.msg = "invalid distance too far back", i.mode = qs;
+                    t.msg = "invalid distance too far back", i.mode = Ms;
                     break e;
                   }
                   if (L >>>= A, y -= A, A = s - o, S > A) {
                     if (A = S - A, A > m && i.sane) {
-                      t.msg = "invalid distance too far back", i.mode = qs;
+                      t.msg = "invalid distance too far back", i.mode = Ms;
                       break e;
                     }
                     if (P = 0, C = _, h === 0) {
@@ -3058,7 +3058,7 @@ var Hs = {}, It = {}, qs = 30, Fd = 12, Nd = function(t, r) {
                     $ && (E[s++] = E[P++], $ > 1 && (E[s++] = E[P++]));
                   }
                 } else if (A & 64) {
-                  t.msg = "invalid distance code", i.mode = qs;
+                  t.msg = "invalid distance code", i.mode = Ms;
                   break e;
                 } else {
                   H = b[(H & 65535) + (L & (1 << A) - 1)];
@@ -3071,7 +3071,7 @@ var Hs = {}, It = {}, qs = 30, Fd = 12, Nd = function(t, r) {
               i.mode = Fd;
               break e;
             } else {
-              t.msg = "invalid literal/length code", i.mode = qs;
+              t.msg = "invalid literal/length code", i.mode = Ms;
               break e;
             }
           else {
@@ -3082,7 +3082,7 @@ var Hs = {}, It = {}, qs = 30, Fd = 12, Nd = function(t, r) {
         }
     } while (a < n && s < f);
   $ = y >> 3, a -= $, y -= $ << 3, L &= (1 << y) - 1, t.next_in = a, t.next_out = s, t.avail_in = a < n ? 5 + (n - a) : 5 - (a - n), t.avail_out = s < f ? 257 + (f - s) : 257 - (s - f), i.hold = L, i.bits = y;
-}, eo = tr, Nr = 15, to = 852, ro = 592, so = 0, ai = 1, no = 2, Bd = [
+}, eo = er, Fr = 15, to = 852, ro = 592, so = 0, ii = 1, no = 2, Bd = [
   /* Length codes 257..285 base */
   3,
   4,
@@ -3217,27 +3217,27 @@ var Hs = {}, It = {}, qs = 30, Fd = 12, Nd = function(t, r) {
   64,
   64
 ], Md = function(t, r, i, a, n, s, o, f) {
-  var p = f.bits, c = 0, m = 0, h = 0, _ = 0, L = 0, y = 0, g = 0, b = 0, R = 0, O = 0, H, A, $, S, P, C = null, k = 0, E, D = new eo.Buf16(Nr + 1), I = new eo.Buf16(Nr + 1), B = null, W = 0, M, V, z;
-  for (c = 0; c <= Nr; c++)
+  var p = f.bits, c = 0, m = 0, h = 0, _ = 0, L = 0, y = 0, g = 0, b = 0, R = 0, O = 0, H, A, $, S, P, C = null, k = 0, E, D = new eo.Buf16(Fr + 1), I = new eo.Buf16(Fr + 1), B = null, W = 0, M, V, z;
+  for (c = 0; c <= Fr; c++)
     D[c] = 0;
   for (m = 0; m < a; m++)
     D[r[i + m]]++;
-  for (L = p, _ = Nr; _ >= 1 && D[_] === 0; _--)
+  for (L = p, _ = Fr; _ >= 1 && D[_] === 0; _--)
     ;
   if (L > _ && (L = _), _ === 0)
     return n[s++] = 1 << 24 | 64 << 16 | 0, n[s++] = 1 << 24 | 64 << 16 | 0, f.bits = 1, 0;
   for (h = 1; h < _ && D[h] === 0; h++)
     ;
-  for (L < h && (L = h), b = 1, c = 1; c <= Nr; c++)
+  for (L < h && (L = h), b = 1, c = 1; c <= Fr; c++)
     if (b <<= 1, b -= D[c], b < 0)
       return -1;
   if (b > 0 && (t === so || _ !== 1))
     return -1;
-  for (I[1] = 0, c = 1; c < Nr; c++)
+  for (I[1] = 0, c = 1; c < Fr; c++)
     I[c + 1] = I[c] + D[c];
   for (m = 0; m < a; m++)
     r[i + m] !== 0 && (o[I[r[i + m]]++] = m);
-  if (t === so ? (C = B = o, E = 19) : t === ai ? (C = Bd, k -= 257, B = jd, W -= 257, E = 256) : (C = Wd, B = Ud, E = -1), O = 0, m = 0, c = h, P = s, y = L, g = 0, $ = -1, R = 1 << L, S = R - 1, t === ai && R > to || t === no && R > ro)
+  if (t === so ? (C = B = o, E = 19) : t === ii ? (C = Bd, k -= 257, B = jd, W -= 257, E = 256) : (C = Wd, B = Ud, E = -1), O = 0, m = 0, c = h, P = s, y = L, g = 0, $ = -1, R = 1 << L, S = R - 1, t === ii && R > to || t === no && R > ro)
     return 1;
   for (; ; ) {
     M = c - g, o[m] < E ? (V = 0, z = o[m]) : o[m] > E ? (V = B[W + o[m]], z = C[k + o[m]]) : (V = 96, z = 0), H = 1 << c - g, A = 1 << y, h = A;
@@ -3254,13 +3254,13 @@ var Hs = {}, It = {}, qs = 30, Fd = 12, Nd = function(t, r) {
     if (c > L && (O & S) !== $) {
       for (g === 0 && (g = L), P += h, y = c - g, b = 1 << y; y + g < _ && (b -= D[y + g], !(b <= 0)); )
         y++, b <<= 1;
-      if (R += 1 << y, t === ai && R > to || t === no && R > ro)
+      if (R += 1 << y, t === ii && R > to || t === no && R > ro)
         return 1;
       $ = O & S, n[$] = L << 24 | y << 16 | P - s | 0;
     }
   }
   return O !== 0 && (n[P + O] = c - g << 24 | 64 << 16 | 0), f.bits = L, 0;
-}, gt = tr, Mi = Sf, Ht = Ef, qd = Nd, _s = Md, Kd = 0, Hf = 1, Ff = 2, io = 4, zd = 5, Ks = 6, Lr = 0, Gd = 1, Zd = 2, Pt = -2, Nf = -3, Bf = -4, Vd = -5, ao = 8, jf = 1, oo = 2, lo = 3, fo = 4, po = 5, co = 6, uo = 7, ho = 8, mo = 9, yo = 10, Pn = 11, Gt = 12, oi = 13, _o = 14, li = 15, go = 16, wo = 17, bo = 18, vo = 19, zs = 20, Gs = 21, xo = 22, ko = 23, So = 24, Eo = 25, Po = 26, fi = 27, Ao = 28, To = 29, De = 30, Wf = 31, Yd = 32, Xd = 852, Jd = 592, Qd = 15, eh = Qd;
+}, gt = er, Ui = Sf, Ht = Ef, qd = Nd, ys = Md, Kd = 0, Hf = 1, Ff = 2, io = 4, zd = 5, qs = 6, Or = 0, Gd = 1, Zd = 2, Pt = -2, Nf = -3, Bf = -4, Vd = -5, ao = 8, jf = 1, oo = 2, lo = 3, fo = 4, po = 5, co = 6, uo = 7, ho = 8, mo = 9, yo = 10, En = 11, Gt = 12, ai = 13, _o = 14, oi = 15, go = 16, wo = 17, bo = 18, vo = 19, Ks = 20, zs = 21, xo = 22, ko = 23, So = 24, Eo = 25, Po = 26, li = 27, Ao = 28, To = 29, De = 30, Wf = 31, Yd = 32, Xd = 852, Jd = 592, Qd = 15, eh = Qd;
 function Co(e) {
   return (e >>> 24 & 255) + (e >>> 8 & 65280) + ((e & 65280) << 8) + ((e & 255) << 24);
 }
@@ -3269,7 +3269,7 @@ function th() {
 }
 function Uf(e) {
   var t;
-  return !e || !e.state ? Pt : (t = e.state, e.total_in = e.total_out = t.total = 0, e.msg = "", t.wrap && (e.adler = t.wrap & 1), t.mode = jf, t.last = 0, t.havedict = 0, t.dmax = 32768, t.head = null, t.hold = 0, t.bits = 0, t.lencode = t.lendyn = new gt.Buf32(Xd), t.distcode = t.distdyn = new gt.Buf32(Jd), t.sane = 1, t.back = -1, Lr);
+  return !e || !e.state ? Pt : (t = e.state, e.total_in = e.total_out = t.total = 0, e.msg = "", t.wrap && (e.adler = t.wrap & 1), t.mode = jf, t.last = 0, t.havedict = 0, t.dmax = 32768, t.head = null, t.hold = 0, t.bits = 0, t.lencode = t.lendyn = new gt.Buf32(Xd), t.distcode = t.distdyn = new gt.Buf32(Jd), t.sane = 1, t.back = -1, Or);
 }
 function Mf(e) {
   var t;
@@ -3281,16 +3281,16 @@ function qf(e, t) {
 }
 function Kf(e, t) {
   var r, i;
-  return e ? (i = new th(), e.state = i, i.window = null, r = qf(e, t), r !== Lr && (e.state = null), r) : Pt;
+  return e ? (i = new th(), e.state = i, i.window = null, r = qf(e, t), r !== Or && (e.state = null), r) : Pt;
 }
 function rh(e) {
   return Kf(e, eh);
 }
-var Oo = !0, pi, ci;
+var Oo = !0, fi, pi;
 function sh(e) {
   if (Oo) {
     var t;
-    for (pi = new gt.Buf32(512), ci = new gt.Buf32(32), t = 0; t < 144; )
+    for (fi = new gt.Buf32(512), pi = new gt.Buf32(32), t = 0; t < 144; )
       e.lens[t++] = 8;
     for (; t < 256; )
       e.lens[t++] = 9;
@@ -3298,11 +3298,11 @@ function sh(e) {
       e.lens[t++] = 7;
     for (; t < 288; )
       e.lens[t++] = 8;
-    for (_s(Hf, e.lens, 0, 288, pi, 0, e.work, { bits: 9 }), t = 0; t < 32; )
+    for (ys(Hf, e.lens, 0, 288, fi, 0, e.work, { bits: 9 }), t = 0; t < 32; )
       e.lens[t++] = 5;
-    _s(Ff, e.lens, 0, 32, ci, 0, e.work, { bits: 5 }), Oo = !1;
+    ys(Ff, e.lens, 0, 32, pi, 0, e.work, { bits: 5 }), Oo = !1;
   }
-  e.lencode = pi, e.lenbits = 9, e.distcode = ci, e.distbits = 5;
+  e.lencode = fi, e.lenbits = 9, e.distcode = pi, e.distbits = 5;
 }
 function zf(e, t, r, i) {
   var a, n = e.state;
@@ -3315,13 +3315,13 @@ function nh(e, t) {
   );
   if (!e || !e.state || !e.output || !e.input && e.avail_in !== 0)
     return Pt;
-  r = e.state, r.mode === Gt && (r.mode = oi), s = e.next_out, a = e.output, f = e.avail_out, n = e.next_in, i = e.input, o = e.avail_in, p = r.hold, c = r.bits, m = o, h = f, P = Lr;
+  r = e.state, r.mode === Gt && (r.mode = ai), s = e.next_out, a = e.output, f = e.avail_out, n = e.next_in, i = e.input, o = e.avail_in, p = r.hold, c = r.bits, m = o, h = f, P = Or;
   e:
     for (; ; )
       switch (r.mode) {
         case jf:
           if (r.wrap === 0) {
-            r.mode = oi;
+            r.mode = ai;
             break;
           }
           for (; c < 16; ) {
@@ -3447,17 +3447,17 @@ function nh(e, t) {
               break e;
             o--, p += i[n++] << c, c += 8;
           }
-          e.adler = r.check = Co(p), p = 0, c = 0, r.mode = Pn;
-        case Pn:
+          e.adler = r.check = Co(p), p = 0, c = 0, r.mode = En;
+        case En:
           if (r.havedict === 0)
             return e.next_out = s, e.avail_out = f, e.next_in = n, e.avail_in = o, r.hold = p, r.bits = c, Zd;
           e.adler = r.check = 1, r.mode = Gt;
         case Gt:
-          if (t === zd || t === Ks)
+          if (t === zd || t === qs)
             break e;
-        case oi:
+        case ai:
           if (r.last) {
-            p >>>= c & 7, c -= c & 7, r.mode = fi;
+            p >>>= c & 7, c -= c & 7, r.mode = li;
             break;
           }
           for (; c < 3; ) {
@@ -3470,7 +3470,7 @@ function nh(e, t) {
               r.mode = _o;
               break;
             case 1:
-              if (sh(r), r.mode = zs, t === Ks) {
+              if (sh(r), r.mode = Ks, t === qs) {
                 p >>>= 2, c -= 2;
                 break e;
               }
@@ -3493,9 +3493,9 @@ function nh(e, t) {
             e.msg = "invalid stored block lengths", r.mode = De;
             break;
           }
-          if (r.length = p & 65535, p = 0, c = 0, r.mode = li, t === Ks)
+          if (r.length = p & 65535, p = 0, c = 0, r.mode = oi, t === qs)
             break e;
-        case li:
+        case oi:
           r.mode = go;
         case go:
           if (_ = r.length, _) {
@@ -3528,7 +3528,7 @@ function nh(e, t) {
           }
           for (; r.have < 19; )
             r.lens[D[r.have++]] = 0;
-          if (r.lencode = r.lendyn, r.lenbits = 7, k = { bits: r.lenbits }, P = _s(Kd, r.lens, 0, 19, r.lencode, 0, r.work, k), r.lenbits = k.bits, P) {
+          if (r.lencode = r.lendyn, r.lenbits = 7, k = { bits: r.lenbits }, P = ys(Kd, r.lens, 0, 19, r.lencode, 0, r.work, k), r.lenbits = k.bits, P) {
             e.msg = "invalid code lengths set", r.mode = De;
             break;
           }
@@ -3583,19 +3583,19 @@ function nh(e, t) {
             e.msg = "invalid code -- missing end-of-block", r.mode = De;
             break;
           }
-          if (r.lenbits = 9, k = { bits: r.lenbits }, P = _s(Hf, r.lens, 0, r.nlen, r.lencode, 0, r.work, k), r.lenbits = k.bits, P) {
+          if (r.lenbits = 9, k = { bits: r.lenbits }, P = ys(Hf, r.lens, 0, r.nlen, r.lencode, 0, r.work, k), r.lenbits = k.bits, P) {
             e.msg = "invalid literal/lengths set", r.mode = De;
             break;
           }
-          if (r.distbits = 6, r.distcode = r.distdyn, k = { bits: r.distbits }, P = _s(Ff, r.lens, r.nlen, r.ndist, r.distcode, 0, r.work, k), r.distbits = k.bits, P) {
+          if (r.distbits = 6, r.distcode = r.distdyn, k = { bits: r.distbits }, P = ys(Ff, r.lens, r.nlen, r.ndist, r.distcode, 0, r.work, k), r.distbits = k.bits, P) {
             e.msg = "invalid distances set", r.mode = De;
             break;
           }
-          if (r.mode = zs, t === Ks)
+          if (r.mode = Ks, t === qs)
             break e;
+        case Ks:
+          r.mode = zs;
         case zs:
-          r.mode = Gs;
-        case Gs:
           if (o >= 6 && f >= 258) {
             e.next_out = s, e.avail_out = f, e.next_in = n, e.avail_in = o, r.hold = p, r.bits = c, qd(e, h), s = e.next_out, a = e.output, f = e.avail_out, n = e.next_in, i = e.input, o = e.avail_in, p = r.hold, c = r.bits, r.mode === Gt && (r.back = -1);
             break;
@@ -3684,14 +3684,14 @@ function nh(e, t) {
           do
             a[s++] = y[L++];
           while (--_);
-          r.length === 0 && (r.mode = Gs);
+          r.length === 0 && (r.mode = zs);
           break;
         case Po:
           if (f === 0)
             break e;
-          a[s++] = r.length, f--, r.mode = Gs;
+          a[s++] = r.length, f--, r.mode = zs;
           break;
-        case fi:
+        case li:
           if (r.wrap) {
             for (; c < 32; ) {
               if (o === 0)
@@ -3699,7 +3699,7 @@ function nh(e, t) {
               o--, p |= i[n++] << c, c += 8;
             }
             if (h -= f, e.total_out += h, r.total += h, h && (e.adler = r.check = /*UPDATE(state.check, put - _out, _out);*/
-            r.flags ? Ht(r.check, a, h, s - h) : Mi(r.check, a, h, s - h)), h = f, (r.flags ? p : Co(p)) !== r.check) {
+            r.flags ? Ht(r.check, a, h, s - h) : Ui(r.check, a, h, s - h)), h = f, (r.flags ? p : Co(p)) !== r.check) {
               e.msg = "incorrect data check", r.mode = De;
               break;
             }
@@ -3732,22 +3732,22 @@ function nh(e, t) {
         default:
           return Pt;
       }
-  return e.next_out = s, e.avail_out = f, e.next_in = n, e.avail_in = o, r.hold = p, r.bits = c, (r.wsize || h !== e.avail_out && r.mode < De && (r.mode < fi || t !== io)) && zf(e, e.output, e.next_out, h - e.avail_out), m -= e.avail_in, h -= e.avail_out, e.total_in += m, e.total_out += h, r.total += h, r.wrap && h && (e.adler = r.check = /*UPDATE(state.check, strm.next_out - _out, _out);*/
-  r.flags ? Ht(r.check, a, h, e.next_out - h) : Mi(r.check, a, h, e.next_out - h)), e.data_type = r.bits + (r.last ? 64 : 0) + (r.mode === Gt ? 128 : 0) + (r.mode === zs || r.mode === li ? 256 : 0), (m === 0 && h === 0 || t === io) && P === Lr && (P = Vd), P;
+  return e.next_out = s, e.avail_out = f, e.next_in = n, e.avail_in = o, r.hold = p, r.bits = c, (r.wsize || h !== e.avail_out && r.mode < De && (r.mode < li || t !== io)) && zf(e, e.output, e.next_out, h - e.avail_out), m -= e.avail_in, h -= e.avail_out, e.total_in += m, e.total_out += h, r.total += h, r.wrap && h && (e.adler = r.check = /*UPDATE(state.check, strm.next_out - _out, _out);*/
+  r.flags ? Ht(r.check, a, h, e.next_out - h) : Ui(r.check, a, h, e.next_out - h)), e.data_type = r.bits + (r.last ? 64 : 0) + (r.mode === Gt ? 128 : 0) + (r.mode === Ks || r.mode === oi ? 256 : 0), (m === 0 && h === 0 || t === io) && P === Or && (P = Vd), P;
 }
 function ih(e) {
   if (!e || !e.state)
     return Pt;
   var t = e.state;
-  return t.window && (t.window = null), e.state = null, Lr;
+  return t.window && (t.window = null), e.state = null, Or;
 }
 function ah(e, t) {
   var r;
-  return !e || !e.state || (r = e.state, !(r.wrap & 2)) ? Pt : (r.head = t, t.done = !1, Lr);
+  return !e || !e.state || (r = e.state, !(r.wrap & 2)) ? Pt : (r.head = t, t.done = !1, Or);
 }
 function oh(e, t) {
   var r = t.length, i, a, n;
-  return !e || !e.state || (i = e.state, i.wrap !== 0 && i.mode !== Pn) ? Pt : i.mode === Pn && (a = 1, a = Mi(a, t, r, 0), a !== i.check) ? Nf : (n = zf(e, t, r, r), n ? (i.mode = Wf, Bf) : (i.havedict = 1, Lr));
+  return !e || !e.state || (i = e.state, i.wrap !== 0 && i.mode !== En) ? Pt : i.mode === En && (a = 1, a = Ui(a, t, r, 0), a !== i.check) ? Nf : (n = zf(e, t, r, r), n ? (i.mode = Wf, Bf) : (i.havedict = 1, Or));
 }
 It.inflateReset = Mf;
 It.inflateReset2 = qf;
@@ -3802,60 +3802,60 @@ var Gf = {
 function lh() {
   this.text = 0, this.time = 0, this.xflags = 0, this.os = 0, this.extra = null, this.extra_len = 0, this.name = "", this.comment = "", this.hcrc = 0, this.done = !1;
 }
-var fh = lh, Vr = It, gs = tr, un = $r, Ne = Gf, qi = da, ph = Df, ch = fh, Zf = Object.prototype.toString;
-function Rr(e) {
-  if (!(this instanceof Rr)) return new Rr(e);
-  this.options = gs.assign({
+var fh = lh, Zr = It, _s = er, cn = Dr, Ne = Gf, Mi = ua, ph = Df, ch = fh, Zf = Object.prototype.toString;
+function Lr(e) {
+  if (!(this instanceof Lr)) return new Lr(e);
+  this.options = _s.assign({
     chunkSize: 16384,
     windowBits: 0,
     to: ""
   }, e || {});
   var t = this.options;
   t.raw && t.windowBits >= 0 && t.windowBits < 16 && (t.windowBits = -t.windowBits, t.windowBits === 0 && (t.windowBits = -15)), t.windowBits >= 0 && t.windowBits < 16 && !(e && e.windowBits) && (t.windowBits += 32), t.windowBits > 15 && t.windowBits < 48 && (t.windowBits & 15 || (t.windowBits |= 15)), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new ph(), this.strm.avail_out = 0;
-  var r = Vr.inflateInit2(
+  var r = Zr.inflateInit2(
     this.strm,
     t.windowBits
   );
   if (r !== Ne.Z_OK)
-    throw new Error(qi[r]);
-  if (this.header = new ch(), Vr.inflateGetHeader(this.strm, this.header), t.dictionary && (typeof t.dictionary == "string" ? t.dictionary = un.string2buf(t.dictionary) : Zf.call(t.dictionary) === "[object ArrayBuffer]" && (t.dictionary = new Uint8Array(t.dictionary)), t.raw && (r = Vr.inflateSetDictionary(this.strm, t.dictionary), r !== Ne.Z_OK)))
-    throw new Error(qi[r]);
+    throw new Error(Mi[r]);
+  if (this.header = new ch(), Zr.inflateGetHeader(this.strm, this.header), t.dictionary && (typeof t.dictionary == "string" ? t.dictionary = cn.string2buf(t.dictionary) : Zf.call(t.dictionary) === "[object ArrayBuffer]" && (t.dictionary = new Uint8Array(t.dictionary)), t.raw && (r = Zr.inflateSetDictionary(this.strm, t.dictionary), r !== Ne.Z_OK)))
+    throw new Error(Mi[r]);
 }
-Rr.prototype.push = function(e, t) {
+Lr.prototype.push = function(e, t) {
   var r = this.strm, i = this.options.chunkSize, a = this.options.dictionary, n, s, o, f, p, c = !1;
   if (this.ended)
     return !1;
-  s = t === ~~t ? t : t === !0 ? Ne.Z_FINISH : Ne.Z_NO_FLUSH, typeof e == "string" ? r.input = un.binstring2buf(e) : Zf.call(e) === "[object ArrayBuffer]" ? r.input = new Uint8Array(e) : r.input = e, r.next_in = 0, r.avail_in = r.input.length;
+  s = t === ~~t ? t : t === !0 ? Ne.Z_FINISH : Ne.Z_NO_FLUSH, typeof e == "string" ? r.input = cn.binstring2buf(e) : Zf.call(e) === "[object ArrayBuffer]" ? r.input = new Uint8Array(e) : r.input = e, r.next_in = 0, r.avail_in = r.input.length;
   do {
-    if (r.avail_out === 0 && (r.output = new gs.Buf8(i), r.next_out = 0, r.avail_out = i), n = Vr.inflate(r, Ne.Z_NO_FLUSH), n === Ne.Z_NEED_DICT && a && (n = Vr.inflateSetDictionary(this.strm, a)), n === Ne.Z_BUF_ERROR && c === !0 && (n = Ne.Z_OK, c = !1), n !== Ne.Z_STREAM_END && n !== Ne.Z_OK)
+    if (r.avail_out === 0 && (r.output = new _s.Buf8(i), r.next_out = 0, r.avail_out = i), n = Zr.inflate(r, Ne.Z_NO_FLUSH), n === Ne.Z_NEED_DICT && a && (n = Zr.inflateSetDictionary(this.strm, a)), n === Ne.Z_BUF_ERROR && c === !0 && (n = Ne.Z_OK, c = !1), n !== Ne.Z_STREAM_END && n !== Ne.Z_OK)
       return this.onEnd(n), this.ended = !0, !1;
-    r.next_out && (r.avail_out === 0 || n === Ne.Z_STREAM_END || r.avail_in === 0 && (s === Ne.Z_FINISH || s === Ne.Z_SYNC_FLUSH)) && (this.options.to === "string" ? (o = un.utf8border(r.output, r.next_out), f = r.next_out - o, p = un.buf2string(r.output, o), r.next_out = f, r.avail_out = i - f, f && gs.arraySet(r.output, r.output, o, f, 0), this.onData(p)) : this.onData(gs.shrinkBuf(r.output, r.next_out))), r.avail_in === 0 && r.avail_out === 0 && (c = !0);
+    r.next_out && (r.avail_out === 0 || n === Ne.Z_STREAM_END || r.avail_in === 0 && (s === Ne.Z_FINISH || s === Ne.Z_SYNC_FLUSH)) && (this.options.to === "string" ? (o = cn.utf8border(r.output, r.next_out), f = r.next_out - o, p = cn.buf2string(r.output, o), r.next_out = f, r.avail_out = i - f, f && _s.arraySet(r.output, r.output, o, f, 0), this.onData(p)) : this.onData(_s.shrinkBuf(r.output, r.next_out))), r.avail_in === 0 && r.avail_out === 0 && (c = !0);
   } while ((r.avail_in > 0 || r.avail_out === 0) && n !== Ne.Z_STREAM_END);
-  return n === Ne.Z_STREAM_END && (s = Ne.Z_FINISH), s === Ne.Z_FINISH ? (n = Vr.inflateEnd(this.strm), this.onEnd(n), this.ended = !0, n === Ne.Z_OK) : (s === Ne.Z_SYNC_FLUSH && (this.onEnd(Ne.Z_OK), r.avail_out = 0), !0);
+  return n === Ne.Z_STREAM_END && (s = Ne.Z_FINISH), s === Ne.Z_FINISH ? (n = Zr.inflateEnd(this.strm), this.onEnd(n), this.ended = !0, n === Ne.Z_OK) : (s === Ne.Z_SYNC_FLUSH && (this.onEnd(Ne.Z_OK), r.avail_out = 0), !0);
 };
-Rr.prototype.onData = function(e) {
+Lr.prototype.onData = function(e) {
   this.chunks.push(e);
 };
-Rr.prototype.onEnd = function(e) {
-  e === Ne.Z_OK && (this.options.to === "string" ? this.result = this.chunks.join("") : this.result = gs.flattenChunks(this.chunks)), this.chunks = [], this.err = e, this.msg = this.strm.msg;
+Lr.prototype.onEnd = function(e) {
+  e === Ne.Z_OK && (this.options.to === "string" ? this.result = this.chunks.join("") : this.result = _s.flattenChunks(this.chunks)), this.chunks = [], this.err = e, this.msg = this.strm.msg;
 };
-function ma(e, t) {
-  var r = new Rr(t);
+function ha(e, t) {
+  var r = new Lr(t);
   if (r.push(e, !0), r.err)
-    throw r.msg || qi[r.err];
+    throw r.msg || Mi[r.err];
   return r.result;
 }
 function uh(e, t) {
-  return t = t || {}, t.raw = !0, ma(e, t);
+  return t = t || {}, t.raw = !0, ha(e, t);
 }
-Hs.Inflate = Rr;
-Hs.inflate = ma;
-Hs.inflateRaw = uh;
-Hs.ungzip = ma;
-var dh = tr.assign, hh = Is, mh = Hs, yh = Gf, Vf = {};
+$s.Inflate = Lr;
+$s.inflate = ha;
+$s.inflateRaw = uh;
+$s.ungzip = ha;
+var dh = er.assign, hh = Rs, mh = $s, yh = Gf, Vf = {};
 dh(Vf, hh, mh, yh);
 var _h = Vf;
-const Yf = /* @__PURE__ */ ra(_h);
+const Yf = /* @__PURE__ */ ta(_h);
 async function gh(e, t) {
   const r = new nf(e);
   let i = await r.read(4);
@@ -3918,8 +3918,8 @@ async function wh(e) {
 async function bh(e) {
   return Yf.inflate(e);
 }
-var Ki = { exports: {} };
-typeof Object.create == "function" ? Ki.exports = function(t, r) {
+var qi = { exports: {} };
+typeof Object.create == "function" ? qi.exports = function(t, r) {
   r && (t.super_ = r, t.prototype = Object.create(r.prototype, {
     constructor: {
       value: t,
@@ -3928,7 +3928,7 @@ typeof Object.create == "function" ? Ki.exports = function(t, r) {
       configurable: !0
     }
   }));
-} : Ki.exports = function(t, r) {
+} : qi.exports = function(t, r) {
   if (r) {
     t.super_ = r;
     var i = function() {
@@ -3936,13 +3936,13 @@ typeof Object.create == "function" ? Ki.exports = function(t, r) {
     i.prototype = r.prototype, t.prototype = new i(), t.prototype.constructor = t;
   }
 };
-var vh = Ki.exports, zi = { exports: {} }, er = {}, Wn = {};
-Wn.byteLength = Sh;
-Wn.toByteArray = Ph;
-Wn.fromByteArray = Ch;
-var Wt = [], xt = [], xh = typeof Uint8Array < "u" ? Uint8Array : Array, ui = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
-for (var Br = 0, kh = ui.length; Br < kh; ++Br)
-  Wt[Br] = ui[Br], xt[ui.charCodeAt(Br)] = Br;
+var vh = qi.exports, Ki = { exports: {} }, ma = {}, jn = {};
+jn.byteLength = Sh;
+jn.toByteArray = Ph;
+jn.fromByteArray = Ch;
+var Wt = [], xt = [], xh = typeof Uint8Array < "u" ? Uint8Array : Array, ci = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
+for (var Nr = 0, kh = ci.length; Nr < kh; ++Nr)
+  Wt[Nr] = ci[Nr], xt[ci.charCodeAt(Nr)] = Nr;
 xt[45] = 62;
 xt[95] = 63;
 function Xf(e) {
@@ -4016,7 +4016,7 @@ ya.write = function(e, t, r, i, a, n) {
  * @license  MIT
  */
 (function(e) {
-  var t = Wn, r = ya, i = typeof Symbol == "function" && typeof Symbol.for == "function" ? Symbol.for("nodejs.util.inspect.custom") : null;
+  var t = jn, r = ya, i = typeof Symbol == "function" && typeof Symbol.for == "function" ? Symbol.for("nodejs.util.inspect.custom") : null;
   e.Buffer = o, e.SlowBuffer = R, e.INSPECT_MAX_BYTES = 50;
   var a = 2147483647;
   e.kMaxLength = a, o.TYPED_ARRAY_SUPPORT = n(), !o.TYPED_ARRAY_SUPPORT && typeof console < "u" && typeof console.error == "function" && console.error(
@@ -4793,10 +4793,10 @@ ya.write = function(e, t, r, i, a, n) {
         u[T + N] = v[d] + v[N];
     return u;
   }();
-})(er);
+})(ma);
 /*! safe-buffer. MIT License. Feross Aboukhadijeh <https://feross.org/opensource> */
 (function(e, t) {
-  var r = er, i = r.Buffer;
+  var r = ma, i = r.Buffer;
   function a(s, o) {
     for (var f in s)
       o[f] = s[f];
@@ -4823,12 +4823,12 @@ ya.write = function(e, t, r, i, a, n) {
       throw new TypeError("Argument must be a number");
     return r.SlowBuffer(s);
   };
-})(zi, zi.exports);
-var Jf = zi.exports, Qf = Jf.Buffer;
-function Un(e, t) {
+})(Ki, Ki.exports);
+var Jf = Ki.exports, Qf = Jf.Buffer;
+function Wn(e, t) {
   this._block = Qf.alloc(e), this._finalSize = t, this._blockSize = e, this._len = 0;
 }
-Un.prototype.update = function(e, t) {
+Wn.prototype.update = function(e, t) {
   typeof e == "string" && (t = t || "utf8", e = Qf.from(e, t));
   for (var r = this._block, i = this._blockSize, a = e.length, n = this._len, s = 0; s < a; ) {
     for (var o = n % i, f = Math.min(a - s, i - o), p = 0; p < f; p++)
@@ -4837,7 +4837,7 @@ Un.prototype.update = function(e, t) {
   }
   return this._len += a, this;
 };
-Un.prototype.digest = function(e) {
+Wn.prototype.digest = function(e) {
   var t = this._len % this._blockSize;
   this._block[t] = 128, this._block.fill(0, t + 1), t >= this._finalSize && (this._update(this._block), this._block.fill(0));
   var r = this._len * 8;
@@ -4851,20 +4851,20 @@ Un.prototype.digest = function(e) {
   var n = this._hash();
   return e ? n.toString(e) : n;
 };
-Un.prototype._update = function() {
+Wn.prototype._update = function() {
   throw new Error("_update must be implemented by subclass");
 };
-var Oh = Un, Lh = vh, ep = Oh, Rh = Jf.Buffer, Ih = [
+var Oh = Wn, Lh = vh, ep = Oh, Rh = Jf.Buffer, Ih = [
   1518500249,
   1859775393,
   -1894007588,
   -899497514
 ], Dh = new Array(80);
-function Fs() {
+function Hs() {
   this.init(), this._w = Dh, ep.call(this, 64, 56);
 }
-Lh(Fs, ep);
-Fs.prototype.init = function() {
+Lh(Hs, ep);
+Hs.prototype.init = function() {
   return this._a = 1732584193, this._b = 4023233417, this._c = 2562383102, this._d = 271733878, this._e = 3285377520, this;
 };
 function $h(e) {
@@ -4879,7 +4879,7 @@ function Fh(e) {
 function Nh(e, t, r, i) {
   return e === 0 ? t & r | ~t & i : e === 2 ? t & r | t & i | r & i : t ^ r ^ i;
 }
-Fs.prototype._update = function(e) {
+Hs.prototype._update = function(e) {
   for (var t = this._w, r = this._a | 0, i = this._b | 0, a = this._c | 0, n = this._d | 0, s = this._e | 0, o = 0; o < 16; ++o) t[o] = e.readInt32BE(o * 4);
   for (; o < 80; ++o) t[o] = $h(t[o - 3] ^ t[o - 8] ^ t[o - 14] ^ t[o - 16]);
   for (var f = 0; f < 80; ++f) {
@@ -4888,21 +4888,21 @@ Fs.prototype._update = function(e) {
   }
   this._a = r + this._a | 0, this._b = i + this._b | 0, this._c = a + this._c | 0, this._d = n + this._d | 0, this._e = s + this._e | 0;
 };
-Fs.prototype._hash = function() {
+Hs.prototype._hash = function() {
   var e = Rh.allocUnsafe(20);
   return e.writeInt32BE(this._a | 0, 0), e.writeInt32BE(this._b | 0, 4), e.writeInt32BE(this._c | 0, 8), e.writeInt32BE(this._d | 0, 12), e.writeInt32BE(this._e | 0, 16), e;
 };
-var Bh = Fs;
-const jh = /* @__PURE__ */ ra(Bh);
+var Bh = Hs;
+const jh = /* @__PURE__ */ ta(Bh);
 function Wh(e) {
   let t = "";
   for (const r of new Uint8Array(e))
     r < 16 && (t += "0"), t += r.toString(16);
   return t;
 }
-let di = null;
+let ui = null;
 async function Lo(e) {
-  return di === null && (di = await Mh()), di ? tp(e) : Uh(e);
+  return ui === null && (ui = await Mh()), ui ? tp(e) : Uh(e);
 }
 function Uh(e) {
   return new jh().update(e).digest("hex");
@@ -4935,12 +4935,12 @@ function Kh(e, t) {
   while (a & 128);
   return r;
 }
-class Ps {
+class Es {
   constructor(t) {
     Object.assign(this, t), this.offsetCache = {};
   }
   static async fromIdx({ idx: t, getExternalRefDelta: r }) {
-    const i = new vr(t);
+    const i = new br(t);
     if (i.slice(4).toString("hex") !== "ff744f63")
       return;
     const n = i.readUInt32BE();
@@ -4963,7 +4963,7 @@ class Ps {
     for (let c = 0; c < s; c++)
       f.set(o[c], i.readUInt32BE());
     const p = i.slice(20).toString("hex");
-    return new Ps({
+    return new Es({
       hashes: o,
       crcs: {},
       offsets: f,
@@ -5006,7 +5006,7 @@ class Ps {
       const R = g + 1 === h.length ? t.byteLength - 20 : h[g + 1], O = n[b], H = ku.buf(t.slice(b, R)) >>> 0;
       O.end = R, O.crc = H;
     }
-    const _ = new Ps({
+    const _ = new Es({
       pack: Promise.resolve(t),
       packfileSha: s,
       crcs: f,
@@ -5044,7 +5044,7 @@ class Ps {
       t.push(Buffer.from(p, c));
     };
     r("ff744f63", "hex"), r("00000002", "hex");
-    const i = new vr(Buffer.alloc(256 * 4));
+    const i = new br(Buffer.alloc(256 * 4));
     for (let p = 0; p < 256; p++) {
       let c = 0;
       for (const m of this.hashes)
@@ -5054,11 +5054,11 @@ class Ps {
     t.push(i.buffer);
     for (const p of this.hashes)
       r(p, "hex");
-    const a = new vr(Buffer.alloc(this.hashes.length * 4));
+    const a = new br(Buffer.alloc(this.hashes.length * 4));
     for (const p of this.hashes)
       a.writeUInt32BE(this.crcs[p]);
     t.push(a.buffer);
-    const n = new vr(Buffer.alloc(this.hashes.length * 4));
+    const n = new br(Buffer.alloc(this.hashes.length * 4));
     for (const p of this.hashes)
       n.writeUInt32BE(this.offsets.get(p));
     t.push(n.buffer), r(this.packfileSha, "hex");
@@ -5096,7 +5096,7 @@ class Ps {
       throw new He(
         "Tried to read from a GitPackIndex with no packfile loaded into memory"
       );
-    const i = (await this.pack).slice(t), a = new vr(i), n = a.readUInt8(), s = n & 112;
+    const i = (await this.pack).slice(t), a = new br(i), n = a.readUInt8(), s = n & 112;
     let o = r[s];
     if (o === void 0)
       throw new He("Unrecognized type: 0b" + s.toString(2));
@@ -5120,16 +5120,16 @@ class Ps {
     return m && (h = Buffer.from(Eu(h, m))), this.readDepth > 3 && (this.offsetCache[t] = { type: o, object: h }), { type: o, format: "content", object: h };
   }
 }
-class As extends Qr {
+class Ps extends Jr {
   /**
    * @param {string} value
    */
   constructor(t) {
-    super(`Expected a 40-char hex object id but saw "${t}".`), this.code = this.name = As.code, this.data = { value: t };
+    super(`Expected a 40-char hex object id but saw "${t}".`), this.code = this.name = Ps.code, this.data = { value: t };
   }
 }
-As.code = "InvalidOidError";
-class Mn extends Qr {
+Ps.code = "InvalidOidError";
+class Un extends Jr {
   /**
    * @param {string} oid
    * @param {'blob'|'commit'|'tag'|'tree'} actual
@@ -5139,10 +5139,10 @@ class Mn extends Qr {
   constructor(t, r, i, a) {
     super(
       `Object ${t} ${a ? `at ${a}` : ""}was anticipated to be a ${i} but it is a ${r}.`
-    ), this.code = this.name = Mn.code, this.data = { oid: t, actual: r, expected: i, filepath: a };
+    ), this.code = this.name = Un.code, this.data = { oid: t, actual: r, expected: i, filepath: a };
   }
 }
-Mn.code = "ObjectTypeError";
+Un.code = "ObjectTypeError";
 async function rp(e, t) {
   const r = sf(e);
   for (; ; ) {
@@ -5151,7 +5151,7 @@ async function rp(e, t) {
   }
   r.return && r.return();
 }
-async function Ts(e) {
+async function As(e) {
   let t = 0;
   const r = [];
   await rp(e, (n) => {
@@ -5163,7 +5163,7 @@ async function Ts(e) {
     i.set(n, a), a += n.byteLength;
   return i;
 }
-class hi {
+class di {
   constructor() {
     this._queue = [];
   }
@@ -5201,7 +5201,7 @@ class hi {
 }
 class zh {
   static demux(t) {
-    const r = Ze.streamReader(t), i = new hi(), a = new hi(), n = new hi(), s = async function() {
+    const r = Ze.streamReader(t), i = new di(), a = new di(), n = new di(), s = async function() {
       const o = await r();
       if (o === null) return s();
       if (o === !0) {
@@ -5309,10 +5309,10 @@ async function sp(e) {
       const h = m.toString("utf8").trim();
       if (h.startsWith("shallow")) {
         const _ = h.slice(-41).trim();
-        _.length !== 40 && c(new As(_)), a.push(_);
+        _.length !== 40 && c(new Ps(_)), a.push(_);
       } else if (h.startsWith("unshallow")) {
         const _ = h.slice(-41).trim();
-        _.length !== 40 && c(new As(_)), n.push(_);
+        _.length !== 40 && c(new Ps(_)), n.push(_);
       } else if (h.startsWith("ACK")) {
         const [, _, L] = h.split(" ");
         s.push({ oid: _, status: L }), L || (f = !0);
@@ -5323,7 +5323,7 @@ async function sp(e) {
     });
   });
 }
-typeof window < "u" && (window.Buffer = er.Buffer);
+typeof globalThis.Buffer > "u" && (globalThis.Buffer = ma.Buffer);
 async function Gh(e, t, r) {
   const i = await ip(e, t), a = await Jh(i, t, r), n = await Qh(
     e,
@@ -5381,8 +5381,8 @@ function np(e) {
   }).filter((t) => !!(t != null && t.name));
 }
 async function Yh(e, t) {
-  const r = er.Buffer.from(
-    await Ts([
+  const r = Buffer.from(
+    await As([
       Ze.encode(`command=ls-refs
 `),
       Ze.encode(`agent=git/2.37.3
@@ -5413,8 +5413,8 @@ async function Yh(e, t) {
   return a;
 }
 async function ip(e, t) {
-  const r = er.Buffer.from(
-    await Ts([
+  const r = Buffer.from(
+    await As([
       Ze.encode(
         `want ${t} multi_ack_detailed no-done side-band-64k thin-pack ofs-delta agent=git/2.37.3 filter 
 `
@@ -5439,7 +5439,7 @@ async function ip(e, t) {
       "Content-Length": `${r.length}`
     },
     body: r
-  }), a = op(i.body), n = await sp(a), s = er.Buffer.from(await Ts(n.packfile)), o = await Ps.fromPack({
+  }), a = op(i.body), n = await sp(a), s = Buffer.from(await As(n.packfile)), o = await Es.fromPack({
     pack: s
   }), f = o.read;
   return o.read = async function({ oid: p, ...c }) {
@@ -5451,11 +5451,11 @@ async function Xh(e, t) {
   const r = await e.read({
     oid: t
   });
-  Er(r);
+  Sr(r);
   const i = await e.read({ oid: r.object.tree }), a = [i];
   for (; a.length > 0; ) {
     const n = a.pop(), s = await e.read({ oid: n.oid });
-    if (Er(s), n.object = s.object, s.type === "tree")
+    if (Sr(s), n.object = s.object, s.type === "tree")
       for (const o of s.object)
         o.type === "tree" && a.push(o);
   }
@@ -5465,9 +5465,9 @@ async function Jh(e, t, r) {
   const i = await e.read({
     oid: t
   });
-  Er(i);
+  Sr(i);
   const a = await e.read({ oid: i.object.tree });
-  Er(a);
+  Sr(a);
   const n = {};
   for (const s of r) {
     let o = a;
@@ -5479,7 +5479,7 @@ async function Jh(e, t, r) {
       for (const m of o.object)
         if (m.path === p) {
           try {
-            o = await e.read({ oid: m.oid }), Er(o);
+            o = await e.read({ oid: m.oid }), Sr(o);
           } catch {
             o = m;
           }
@@ -5494,8 +5494,8 @@ async function Jh(e, t, r) {
   return n;
 }
 async function Qh(e, t) {
-  const r = er.Buffer.from(
-    await Ts([
+  const r = Buffer.from(
+    await As([
       ...t.map(
         (o) => Ze.encode(
           `want ${o} multi_ack_detailed no-done side-band-64k thin-pack ofs-delta agent=git/2.37.3 
@@ -5514,40 +5514,40 @@ async function Qh(e, t) {
       "Content-Length": `${r.length}`
     },
     body: r
-  }), a = op(i.body), n = await sp(a), s = er.Buffer.from(await Ts(n.packfile));
-  return await Ps.fromPack({
+  }), a = op(i.body), n = await sp(a), s = Buffer.from(await As(n.packfile));
+  return await Es.fromPack({
     pack: s
   });
 }
 async function ap(e, t) {
   const r = await e.read({ oid: t });
-  if (Er(r), r.type === "blob")
+  if (Sr(r), r.type === "blob")
     return r.object;
   const i = {};
   for (const { path: a, oid: n, type: s } of r.object)
     if (s === "blob") {
       const o = await e.read({ oid: n });
-      Er(o), i[a] = o.object;
+      Sr(o), i[a] = o.object;
     } else s === "tree" && (i[a] = await ap(e, n));
   return i;
 }
-function Er(e) {
-  if (e.object instanceof er.Buffer)
+function Sr(e) {
+  if (e.object instanceof Buffer)
     switch (e.type) {
       case "commit":
         e.object = ht.from(e.object).parse();
         break;
       case "tree":
-        e.object = la.from(e.object).entries();
+        e.object = oa.from(e.object).entries();
         break;
       case "blob":
         e.object = new Uint8Array(e.object), e.format = "content";
         break;
       case "tag":
-        e.object = ds.from(e.object).parse();
+        e.object = us.from(e.object).parse();
         break;
       default:
-        throw new Mn(
+        throw new Un(
           e.oid,
           e.type,
           "blob|commit|tag|tree"
@@ -5581,7 +5581,7 @@ function op(e) {
   };
 }
 function tm(e, t) {
-  t = Dn(t);
+  t = In(t);
   const r = ["", ".", "/"].includes(t);
   let i = e;
   if (r)
@@ -5610,14 +5610,14 @@ function tm(e, t) {
   }
   return a;
 }
-const Cs = 15, Gi = 30, Zi = 19, rm = 29, An = 256, _a = An + 1 + rm, Ro = 2 * _a + 1, as = 256, sm = 7, Io = 16, Do = 17, $o = 18, mi = 8 * 2, Tn = -1, nm = 1, Zs = 2, im = 0, qr = 0, Ho = 1, am = 3, ot = 4, Ct = 0, lp = 1, Vs = 2, Lt = -2, om = -3, jr = -5;
-function qn(e) {
-  return Kn(e.map(([t, r]) => new Array(t).fill(r, 0, t)));
+const Ts = 15, zi = 30, Gi = 19, rm = 29, Pn = 256, _a = Pn + 1 + rm, Ro = 2 * _a + 1, is = 256, sm = 7, Io = 16, Do = 17, $o = 18, hi = 8 * 2, An = -1, nm = 1, Gs = 2, im = 0, Mr = 0, Ho = 1, am = 3, ot = 4, Ct = 0, lp = 1, Zs = 2, Lt = -2, om = -3, Br = -5;
+function Mn(e) {
+  return qn(e.map(([t, r]) => new Array(t).fill(r, 0, t)));
 }
-function Kn(e) {
-  return e.reduce((t, r) => t.concat(Array.isArray(r) ? Kn(r) : r), []);
+function qn(e) {
+  return e.reduce((t, r) => t.concat(Array.isArray(r) ? qn(r) : r), []);
 }
-const Fo = [0, 1, 2, 3].concat(...qn([
+const Fo = [0, 1, 2, 3].concat(...Mn([
   [2, 4],
   [2, 5],
   [4, 6],
@@ -5651,7 +5651,7 @@ function Oe() {
   function t(a) {
     const n = e.dyn_tree, s = e.stat_desc.static_tree, o = e.stat_desc.extra_bits, f = e.stat_desc.extra_base, p = e.stat_desc.max_length;
     let c, m, h, _, L, y, g = 0;
-    for (_ = 0; _ <= Cs; _++)
+    for (_ = 0; _ <= Ts; _++)
       a.bl_count[_] = 0;
     for (n[a.heap[a.heap_max] * 2 + 1] = 0, c = a.heap_max + 1; c < Ro; c++)
       m = a.heap[c], _ = n[n[m * 2 + 1] * 2 + 1] + 1, _ > p && (_ = p, g++), n[m * 2 + 1] = _, !(m > e.max_code) && (a.bl_count[_]++, L = 0, m >= f && (L = o[m - f]), y = n[m * 2], a.opt_len += y * (_ + L), s && (a.static_len += y * (s[m * 2 + 1] + L)));
@@ -5676,7 +5676,7 @@ function Oe() {
   function i(a, n, s) {
     const o = [];
     let f = 0, p, c, m;
-    for (p = 1; p <= Cs; p++)
+    for (p = 1; p <= Ts; p++)
       o[p] = f = f + s[p - 1] << 1;
     for (c = 0; c <= n; c++)
       m = a[c * 2 + 1], m !== 0 && (a[c * 2] = r(o[m]++, m));
@@ -5697,7 +5697,7 @@ function Oe() {
     a.heap[--a.heap_max] = a.heap[1], t(a), i(n, e.max_code, a.bl_count);
   };
 }
-Oe._length_code = [0, 1, 2, 3, 4, 5, 6, 7].concat(...qn([
+Oe._length_code = [0, 1, 2, 3, 4, 5, 6, 7].concat(...Mn([
   [2, 8],
   [2, 9],
   [2, 10],
@@ -6053,30 +6053,30 @@ const lm = [
   163,
   99,
   227
-], fm = qn([[144, 8], [112, 9], [24, 7], [8, 8]]);
-Ye.static_ltree = Kn(lm.map((e, t) => [e, fm[t]]));
-const pm = [0, 16, 8, 24, 4, 20, 12, 28, 2, 18, 10, 26, 6, 22, 14, 30, 1, 17, 9, 25, 5, 21, 13, 29, 3, 19, 11, 27, 7, 23], cm = qn([[30, 5]]);
-Ye.static_dtree = Kn(pm.map((e, t) => [e, cm[t]]));
-Ye.static_l_desc = new Ye(Ye.static_ltree, Oe.extra_lbits, An + 1, _a, Cs);
-Ye.static_d_desc = new Ye(Ye.static_dtree, Oe.extra_dbits, 0, Gi, Cs);
-Ye.static_bl_desc = new Ye(null, Oe.extra_blbits, 0, Zi, sm);
+], fm = Mn([[144, 8], [112, 9], [24, 7], [8, 8]]);
+Ye.static_ltree = qn(lm.map((e, t) => [e, fm[t]]));
+const pm = [0, 16, 8, 24, 4, 20, 12, 28, 2, 18, 10, 26, 6, 22, 14, 30, 1, 17, 9, 25, 5, 21, 13, 29, 3, 19, 11, 27, 7, 23], cm = Mn([[30, 5]]);
+Ye.static_dtree = qn(pm.map((e, t) => [e, cm[t]]));
+Ye.static_l_desc = new Ye(Ye.static_ltree, Oe.extra_lbits, Pn + 1, _a, Ts);
+Ye.static_d_desc = new Ye(Ye.static_dtree, Oe.extra_dbits, 0, zi, Ts);
+Ye.static_bl_desc = new Ye(null, Oe.extra_blbits, 0, Gi, sm);
 const um = 9, dm = 8;
 function Ft(e, t, r, i, a) {
   const n = this;
   n.good_length = e, n.max_lazy = t, n.nice_length = r, n.max_chain = i, n.func = a;
 }
-const fp = 0, dn = 1, wr = 2, Tt = [
+const fp = 0, un = 1, gr = 2, Tt = [
   new Ft(0, 0, 0, 0, fp),
-  new Ft(4, 4, 8, 4, dn),
-  new Ft(4, 5, 16, 8, dn),
-  new Ft(4, 6, 32, 32, dn),
-  new Ft(4, 4, 16, 16, wr),
-  new Ft(8, 16, 32, 32, wr),
-  new Ft(8, 16, 128, 128, wr),
-  new Ft(8, 32, 128, 256, wr),
-  new Ft(32, 128, 258, 1024, wr),
-  new Ft(32, 258, 258, 4096, wr)
-], Ys = [
+  new Ft(4, 4, 8, 4, un),
+  new Ft(4, 5, 16, 8, un),
+  new Ft(4, 6, 32, 32, un),
+  new Ft(4, 4, 16, 16, gr),
+  new Ft(8, 16, 32, 32, gr),
+  new Ft(8, 16, 128, 128, gr),
+  new Ft(8, 32, 128, 256, gr),
+  new Ft(32, 128, 258, 1024, gr),
+  new Ft(32, 258, 258, 4096, gr)
+], Vs = [
   "need dictionary",
   // Z_NEED_DICT
   // 2
@@ -6097,7 +6097,7 @@ const fp = 0, dn = 1, wr = 2, Tt = [
   "",
   // Z_VERSION_ERROR (-6)
   ""
-], vt = 0, Xs = 1, os = 2, Js = 3, hm = 32, yi = 42, Qs = 113, ls = 666, _i = 8, mm = 0, gi = 1, ym = 2, $e = 3, hn = 258, dt = hn + $e + 1;
+], vt = 0, Ys = 1, as = 2, Xs = 3, hm = 32, mi = 42, Js = 113, os = 666, yi = 8, mm = 0, _i = 1, ym = 2, $e = 3, dn = 258, dt = dn + $e + 1;
 function No(e, t, r, i) {
   const a = e[t * 2], n = e[r * 2];
   return a < n || a == n && i[t] <= i[r];
@@ -6119,11 +6119,11 @@ function _m() {
     let U;
     for (U = 0; U < _a; U++)
       W[U * 2] = 0;
-    for (U = 0; U < Gi; U++)
+    for (U = 0; U < zi; U++)
       M[U * 2] = 0;
-    for (U = 0; U < Zi; U++)
+    for (U = 0; U < Gi; U++)
       V[U * 2] = 0;
-    W[as * 2] = 1, e.opt_len = e.static_len = 0, ee = Z = 0;
+    W[is * 2] = 1, e.opt_len = e.static_len = 0, ee = Z = 0;
   }
   function Ve() {
     z.dyn_tree = W, z.stat_desc = Ye.static_l_desc, ne.dyn_tree = M, ne.stat_desc = Ye.static_d_desc, G.dyn_tree = V, G.stat_desc = Ye.static_bl_desc, ie = 0, ae = 0, fe = 8, Ae();
@@ -6143,7 +6143,7 @@ function _m() {
   }
   function bt() {
     let U;
-    for (Qe(W, z.max_code), Qe(M, ne.max_code), G.build_tree(e), U = Zi - 1; U >= 3 && V[Oe.bl_order[U] * 2 + 1] === 0; U--)
+    for (Qe(W, z.max_code), Qe(M, ne.max_code), G.build_tree(e), U = Gi - 1; U >= 3 && V[Oe.bl_order[U] * 2 + 1] === 0; U--)
       ;
     return e.opt_len += 3 * (U + 1) + 5 + 5 + 4, U;
   }
@@ -6159,7 +6159,7 @@ function _m() {
   function Ce(U, Y) {
     let q;
     const J = Y;
-    ae > mi - J ? (q = U, ie |= q << ae & 65535, Ie(ie), ie = q >>> mi - ae, ae += J - mi) : (ie |= U << ae & 65535, ae += J);
+    ae > hi - J ? (q = U, ie |= q << ae & 65535, Ie(ie), ie = q >>> hi - ae, ae += J - hi) : (ie |= U << ae & 65535, ae += J);
   }
   function v(U, Y) {
     const q = U * 2;
@@ -6187,12 +6187,12 @@ function _m() {
     ae == 16 ? (Ie(ie), ie = 0, ae = 0) : ae >= 8 && (Re(ie & 255), ie >>>= 8, ae -= 8);
   }
   function N() {
-    Ce(gi << 1, 3), v(as, Ye.static_ltree), T(), 1 + fe + 10 - ae < 9 && (Ce(gi << 1, 3), v(as, Ye.static_ltree), T()), fe = 7;
+    Ce(_i << 1, 3), v(is, Ye.static_ltree), T(), 1 + fe + 10 - ae < 9 && (Ce(_i << 1, 3), v(is, Ye.static_ltree), T()), fe = 7;
   }
   function K(U, Y) {
     let q, J, se;
-    if (e.dist_buf[ee] = U, e.lc_buf[ee] = Y & 255, ee++, U === 0 ? W[Y * 2]++ : (Z++, U--, W[(Oe._length_code[Y] + An + 1) * 2]++, M[Oe.d_code(U) * 2]++), !(ee & 8191) && E > 2) {
-      for (q = ee * 8, J = A - b, se = 0; se < Gi; se++)
+    if (e.dist_buf[ee] = U, e.lc_buf[ee] = Y & 255, ee++, U === 0 ? W[Y * 2]++ : (Z++, U--, W[(Oe._length_code[Y] + Pn + 1) * 2]++, M[Oe.d_code(U) * 2]++), !(ee & 8191) && E > 2) {
+      for (q = ee * 8, J = A - b, se = 0; se < zi; se++)
         q += M[se * 2] * (5 + Oe.extra_dbits[se]);
       if (q >>>= 3, Z < Math.floor(ee / 2) && q < Math.floor(J / 2))
         return !0;
@@ -6203,9 +6203,9 @@ function _m() {
     let q, J, se = 0, le, de;
     if (ee !== 0)
       do
-        q = e.dist_buf[se], J = e.lc_buf[se], se++, q === 0 ? v(J, U) : (le = Oe._length_code[J], v(le + An + 1, U), de = Oe.extra_lbits[le], de !== 0 && (J -= Oe.base_length[le], Ce(J, de)), q--, le = Oe.d_code(q), v(le, Y), de = Oe.extra_dbits[le], de !== 0 && (q -= Oe.base_dist[le], Ce(q, de)));
+        q = e.dist_buf[se], J = e.lc_buf[se], se++, q === 0 ? v(J, U) : (le = Oe._length_code[J], v(le + Pn + 1, U), de = Oe.extra_lbits[le], de !== 0 && (J -= Oe.base_length[le], Ce(J, de)), q--, le = Oe.d_code(q), v(le, Y), de = Oe.extra_dbits[le], de !== 0 && (q -= Oe.base_dist[le], Ce(q, de)));
       while (se < ee);
-    v(as, U), fe = U[as * 2 + 1];
+    v(is, U), fe = U[is * 2 + 1];
   }
   function pe() {
     ae > 8 ? Ie(ie) : ae > 0 && Re(ie & 255), ie = 0, ae = 0;
@@ -6218,7 +6218,7 @@ function _m() {
   }
   function Fe(U, Y, q) {
     let J, se, le = 0;
-    E > 0 ? (z.build_tree(e), ne.build_tree(e), le = bt(), J = e.opt_len + 3 + 7 >>> 3, se = e.static_len + 3 + 7 >>> 3, se <= J && (J = se)) : J = se = Y + 5, Y + 4 <= J && U != -1 ? he(U, Y, q) : se == J ? (Ce((gi << 1) + (q ? 1 : 0), 3), X(Ye.static_ltree, Ye.static_dtree)) : (Ce((ym << 1) + (q ? 1 : 0), 3), d(z.max_code + 1, ne.max_code + 1, le + 1), X(W, M)), Ae(), q && pe();
+    E > 0 ? (z.build_tree(e), ne.build_tree(e), le = bt(), J = e.opt_len + 3 + 7 >>> 3, se = e.static_len + 3 + 7 >>> 3, se <= J && (J = se)) : J = se = Y + 5, Y + 4 <= J && U != -1 ? he(U, Y, q) : se == J ? (Ce((_i << 1) + (q ? 1 : 0), 3), X(Ye.static_ltree, Ye.static_dtree)) : (Ce((ym << 1) + (q ? 1 : 0), 3), d(z.max_code + 1, ne.max_code + 1, le + 1), X(W, M)), Ae(), q && pe();
   }
   function ue(U) {
     Fe(b >= 0 ? b : -1, A - b, U), b = A, t.flush_pending();
@@ -6250,7 +6250,7 @@ function _m() {
     let Y = 65535, q;
     for (Y > i - 5 && (Y = i - 5); ; ) {
       if (S <= 1) {
-        if (ct(), S === 0 && U == qr)
+        if (ct(), S === 0 && U == Mr)
           return vt;
         if (S === 0)
           break;
@@ -6258,13 +6258,13 @@ function _m() {
       if (A += S, S = 0, q = b + Y, (A === 0 || A >= q) && (S = A - q, A = q, ue(!1), t.avail_out === 0) || A - b >= n - dt && (ue(!1), t.avail_out === 0))
         return vt;
     }
-    return ue(U == ot), t.avail_out === 0 ? U == ot ? os : vt : U == ot ? Js : Xs;
+    return ue(U == ot), t.avail_out === 0 ? U == ot ? as : vt : U == ot ? Xs : Ys;
   }
   function At(U) {
     let Y = C, q = A, J, se, le = P;
     const de = A > n - dt ? A - (n - dt) : 0;
     let We = B;
-    const ce = o, be = A + hn;
+    const ce = o, be = A + dn;
     let j = f[q + le - 1], oe = f[q + le];
     P >= I && (Y >>= 2), We > S && (We = S);
     do
@@ -6273,7 +6273,7 @@ function _m() {
         do
           ;
         while (f[++q] == f[++J] && f[++q] == f[++J] && f[++q] == f[++J] && f[++q] == f[++J] && f[++q] == f[++J] && f[++q] == f[++J] && f[++q] == f[++J] && f[++q] == f[++J] && q < be);
-        if (se = hn - (be - q), q = be - hn, se > le) {
+        if (se = dn - (be - q), q = be - dn, se > le) {
           if ($ = U, le = se, se >= We)
             break;
           j = f[q + le - 1], oe = f[q + le];
@@ -6282,16 +6282,16 @@ function _m() {
     while ((U = c[U & ce] & 65535) > de && --Y !== 0);
     return le <= S ? le : S;
   }
-  function Zn(U) {
+  function Gn(U) {
     let Y = 0, q;
     for (; ; ) {
       if (S < dt) {
-        if (ct(), S < dt && U == qr)
+        if (ct(), S < dt && U == Mr)
           return vt;
         if (S === 0)
           break;
       }
-      if (S >= $e && (h = (h << g ^ f[A + ($e - 1)] & 255) & y, Y = m[h] & 65535, c[A & o] = m[h], m[h] = A), Y !== 0 && (A - Y & 65535) <= n - dt && D != Zs && (R = At(Y)), R >= $e)
+      if (S >= $e && (h = (h << g ^ f[A + ($e - 1)] & 255) & y, Y = m[h] & 65535, c[A & o] = m[h], m[h] = A), Y !== 0 && (A - Y & 65535) <= n - dt && D != Gs && (R = At(Y)), R >= $e)
         if (q = K(A - $, R - $e), S -= R, R <= k && S >= $e) {
           R--;
           do
@@ -6305,18 +6305,18 @@ function _m() {
       if (q && (ue(!1), t.avail_out === 0))
         return vt;
     }
-    return ue(U == ot), t.avail_out === 0 ? U == ot ? os : vt : U == ot ? Js : Xs;
+    return ue(U == ot), t.avail_out === 0 ? U == ot ? as : vt : U == ot ? Xs : Ys;
   }
   function tt(U) {
     let Y = 0, q, J;
     for (; ; ) {
       if (S < dt) {
-        if (ct(), S < dt && U == qr)
+        if (ct(), S < dt && U == Mr)
           return vt;
         if (S === 0)
           break;
       }
-      if (S >= $e && (h = (h << g ^ f[A + ($e - 1)] & 255) & y, Y = m[h] & 65535, c[A & o] = m[h], m[h] = A), P = R, O = $, R = $e - 1, Y !== 0 && P < k && (A - Y & 65535) <= n - dt && (D != Zs && (R = At(Y)), R <= 5 && (D == nm || R == $e && A - $ > 4096) && (R = $e - 1)), P >= $e && R <= P) {
+      if (S >= $e && (h = (h << g ^ f[A + ($e - 1)] & 255) & y, Y = m[h] & 65535, c[A & o] = m[h], m[h] = A), P = R, O = $, R = $e - 1, Y !== 0 && P < k && (A - Y & 65535) <= n - dt && (D != Gs && (R = At(Y)), R <= 5 && (D == nm || R == $e && A - $ > 4096) && (R = $e - 1)), P >= $e && R <= P) {
         J = A + S - $e, q = K(A - 1 - O, P - $e), S -= P - 1, P -= 2;
         do
           ++A <= J && (h = (h << g ^ f[A + ($e - 1)] & 255) & y, Y = m[h] & 65535, c[A & o] = m[h], m[h] = A);
@@ -6329,21 +6329,21 @@ function _m() {
       } else
         H = 1, A++, S--;
     }
-    return H !== 0 && (q = K(0, f[A - 1] & 255), H = 0), ue(U == ot), t.avail_out === 0 ? U == ot ? os : vt : U == ot ? Js : Xs;
+    return H !== 0 && (q = K(0, f[A - 1] & 255), H = 0), ue(U == ot), t.avail_out === 0 ? U == ot ? as : vt : U == ot ? Xs : Ys;
   }
-  function Hr(U) {
-    return U.total_in = U.total_out = 0, U.msg = null, e.pending = 0, e.pending_out = 0, r = Qs, a = qr, Ve(), Se(), Ct;
+  function $r(U) {
+    return U.total_in = U.total_out = 0, U.msg = null, e.pending = 0, e.pending_out = 0, r = Js, a = Mr, Ve(), Se(), Ct;
   }
   e.deflateInit = function(U, Y, q, J, se, le) {
-    return J || (J = _i), se || (se = dm), le || (le = im), U.msg = null, Y == Tn && (Y = 6), se < 1 || se > um || J != _i || q < 9 || q > 15 || Y < 0 || Y > 9 || le < 0 || le > Zs ? Lt : (U.dstate = e, s = q, n = 1 << s, o = n - 1, L = se + 7, _ = 1 << L, y = _ - 1, g = Math.floor((L + $e - 1) / $e), f = new Uint8Array(n * 2), c = [], m = [], Q = 1 << se + 6, e.pending_buf = new Uint8Array(Q * 4), i = Q * 4, e.dist_buf = new Uint16Array(Q), e.lc_buf = new Uint8Array(Q), E = Y, D = le, Hr(U));
+    return J || (J = yi), se || (se = dm), le || (le = im), U.msg = null, Y == An && (Y = 6), se < 1 || se > um || J != yi || q < 9 || q > 15 || Y < 0 || Y > 9 || le < 0 || le > Gs ? Lt : (U.dstate = e, s = q, n = 1 << s, o = n - 1, L = se + 7, _ = 1 << L, y = _ - 1, g = Math.floor((L + $e - 1) / $e), f = new Uint8Array(n * 2), c = [], m = [], Q = 1 << se + 6, e.pending_buf = new Uint8Array(Q * 4), i = Q * 4, e.dist_buf = new Uint16Array(Q), e.lc_buf = new Uint8Array(Q), E = Y, D = le, $r(U));
   }, e.deflateEnd = function() {
-    return r != yi && r != Qs && r != ls ? Lt : (e.lc_buf = null, e.dist_buf = null, e.pending_buf = null, m = null, c = null, f = null, e.dstate = null, r == Qs ? om : Ct);
+    return r != mi && r != Js && r != os ? Lt : (e.lc_buf = null, e.dist_buf = null, e.pending_buf = null, m = null, c = null, f = null, e.dstate = null, r == Js ? om : Ct);
   }, e.deflateParams = function(U, Y, q) {
     let J = Ct;
-    return Y == Tn && (Y = 6), Y < 0 || Y > 9 || q < 0 || q > Zs ? Lt : (Tt[E].func != Tt[Y].func && U.total_in !== 0 && (J = U.deflate(Ho)), E != Y && (E = Y, k = Tt[E].max_lazy, I = Tt[E].good_length, B = Tt[E].nice_length, C = Tt[E].max_chain), D = q, J);
+    return Y == An && (Y = 6), Y < 0 || Y > 9 || q < 0 || q > Gs ? Lt : (Tt[E].func != Tt[Y].func && U.total_in !== 0 && (J = U.deflate(Ho)), E != Y && (E = Y, k = Tt[E].max_lazy, I = Tt[E].good_length, B = Tt[E].nice_length, C = Tt[E].max_chain), D = q, J);
   }, e.deflateSetDictionary = function(U, Y, q) {
     let J = q, se, le = 0;
-    if (!Y || r != yi)
+    if (!Y || r != mi)
       return Lt;
     if (J < $e)
       return Ct;
@@ -6354,32 +6354,32 @@ function _m() {
     let q, J, se, le, de;
     if (Y > ot || Y < 0)
       return Lt;
-    if (!U.next_out || !U.next_in && U.avail_in !== 0 || r == ls && Y != ot)
-      return U.msg = Ys[Vs - Lt], Lt;
+    if (!U.next_out || !U.next_in && U.avail_in !== 0 || r == os && Y != ot)
+      return U.msg = Vs[Zs - Lt], Lt;
     if (U.avail_out === 0)
-      return U.msg = Ys[Vs - jr], jr;
-    if (t = U, le = a, a = Y, r == yi && (J = _i + (s - 8 << 4) << 8, se = (E - 1 & 255) >> 1, se > 3 && (se = 3), J |= se << 6, A !== 0 && (J |= hm), J += 31 - J % 31, r = Qs, at(J)), e.pending !== 0) {
+      return U.msg = Vs[Zs - Br], Br;
+    if (t = U, le = a, a = Y, r == mi && (J = yi + (s - 8 << 4) << 8, se = (E - 1 & 255) >> 1, se > 3 && (se = 3), J |= se << 6, A !== 0 && (J |= hm), J += 31 - J % 31, r = Js, at(J)), e.pending !== 0) {
       if (t.flush_pending(), t.avail_out === 0)
         return a = -1, Ct;
     } else if (t.avail_in === 0 && Y <= le && Y != ot)
-      return t.msg = Ys[Vs - jr], jr;
-    if (r == ls && t.avail_in !== 0)
-      return U.msg = Ys[Vs - jr], jr;
-    if (t.avail_in !== 0 || S !== 0 || Y != qr && r != ls) {
+      return t.msg = Vs[Zs - Br], Br;
+    if (r == os && t.avail_in !== 0)
+      return U.msg = Vs[Zs - Br], Br;
+    if (t.avail_in !== 0 || S !== 0 || Y != Mr && r != os) {
       switch (de = -1, Tt[E].func) {
         case fp:
           de = et(Y);
           break;
-        case dn:
-          de = Zn(Y);
+        case un:
+          de = Gn(Y);
           break;
-        case wr:
+        case gr:
           de = tt(Y);
           break;
       }
-      if ((de == os || de == Js) && (r = ls), de == vt || de == os)
+      if ((de == as || de == Xs) && (r = os), de == vt || de == as)
         return t.avail_out === 0 && (a = -1), Ct;
-      if (de == Xs) {
+      if (de == Ys) {
         if (Y == Ho)
           N();
         else if (he(0, 0, !1), Y == am)
@@ -6399,7 +6399,7 @@ function pp() {
 pp.prototype = {
   deflateInit(e, t) {
     const r = this;
-    return r.dstate = new _m(), t || (t = Cs), r.dstate.deflateInit(r, e, t);
+    return r.dstate = new _m(), t || (t = Ts), r.dstate.deflateInit(r, e, t);
   },
   deflate(e) {
     const t = this;
@@ -6441,9 +6441,9 @@ pp.prototype = {
   }
 };
 function gm(e) {
-  const t = this, r = new pp(), i = wm(e && e.chunkSize ? e.chunkSize : 64 * 1024), a = qr, n = new Uint8Array(i);
-  let s = e ? e.level : Tn;
-  typeof s > "u" && (s = Tn), r.deflateInit(s), r.next_out = n, t.append = function(o, f) {
+  const t = this, r = new pp(), i = wm(e && e.chunkSize ? e.chunkSize : 64 * 1024), a = Mr, n = new Uint8Array(i);
+  let s = e ? e.level : An;
+  typeof s > "u" && (s = An), r.deflateInit(s), r.next_out = n, t.append = function(o, f) {
     let p, c, m = 0, h = 0, _ = 0;
     const L = [];
     if (o.length) {
@@ -8256,8 +8256,8 @@ const bm = 15, we = 0, Jt = 1, vm = 2, lt = -2, Le = -3, Bo = -4, Qt = -5, mt =
   12,
   13,
   13
-], nr = 15;
-function Vi() {
+], sr = 15;
+function Zi() {
   const e = this;
   let t, r, i, a, n, s;
   function o(p, c, m, h, _, L, y, g, b, R, O) {
@@ -8268,9 +8268,9 @@ function Vi() {
     while (P !== 0);
     if (i[0] == m)
       return y[0] = -1, g[0] = 0, we;
-    for (E = g[0], C = 1; C <= nr && i[C] === 0; C++)
+    for (E = g[0], C = 1; C <= sr && i[C] === 0; C++)
       ;
-    for (k = C, E < C && (E = C), P = nr; P !== 0 && i[P] === 0; P--)
+    for (k = C, E < C && (E = C), P = sr; P !== 0 && i[P] === 0; P--)
       ;
     for ($ = P, E > P && (E = P), g[0] = E, V = 1 << C; C < P; C++, V <<= 1)
       if ((V -= i[C]) < 0)
@@ -8311,13 +8311,13 @@ function Vi() {
   }
   function f(p) {
     let c;
-    for (t || (t = [], r = [], i = new Int32Array(nr + 1), a = [], n = new Int32Array(nr), s = new Int32Array(nr + 1)), r.length < p && (r = []), c = 0; c < p; c++)
+    for (t || (t = [], r = [], i = new Int32Array(sr + 1), a = [], n = new Int32Array(sr), s = new Int32Array(sr + 1)), r.length < p && (r = []), c = 0; c < p; c++)
       r[c] = 0;
-    for (c = 0; c < nr + 1; c++)
+    for (c = 0; c < sr + 1; c++)
       i[c] = 0;
     for (c = 0; c < 3; c++)
       a[c] = 0;
-    n.set(i.subarray(0, nr), 0), s.set(i.subarray(0, nr + 1), 0);
+    n.set(i.subarray(0, sr), 0), s.set(i.subarray(0, sr + 1), 0);
   }
   e.inflate_trees_bits = function(p, c, m, h, _) {
     let L;
@@ -8327,10 +8327,10 @@ function Vi() {
     return f(288), t[0] = 0, R = o(m, 0, p, 257, Tm, Cm, L, h, g, t, r), R != we || h[0] === 0 ? (R == Le ? b.msg = "oversubscribed literal/length tree" : R != Bo && (b.msg = "incomplete literal/length tree", R = Le), R) : (f(288), R = o(m, p, c, 0, Om, Lm, y, _, g, t, r), R != we || _[0] === 0 && p > 257 ? (R == Le ? b.msg = "oversubscribed distance tree" : R == Qt ? (b.msg = "incomplete distance tree", R = Le) : R != Bo && (b.msg = "empty distance tree with lengths", R = Le), R) : we);
   };
 }
-Vi.inflate_trees_fixed = function(e, t, r, i) {
+Zi.inflate_trees_fixed = function(e, t, r, i) {
   return e[0] = Sm, t[0] = Em, r[0] = Pm, i[0] = Am, we;
 };
-const en = 0, jo = 1, Wo = 2, Uo = 3, Mo = 4, qo = 5, Ko = 6, wi = 7, zo = 8, tn = 9;
+const Qs = 0, jo = 1, Wo = 2, Uo = 3, Mo = 4, qo = 5, Ko = 6, gi = 7, zo = 8, en = 9;
 function Rm() {
   const e = this;
   let t, r = 0, i, a = 0, n = 0, s = 0, o = 0, f = 0, p = 0, c = 0, m, h = 0, _, L = 0;
@@ -8398,16 +8398,16 @@ function Rm() {
     return G = S.avail_in - W, G = I >> 3 < G ? I >> 3 : G, W += G, B -= G, I -= G << 3, $.bitb = D, $.bitk = I, S.avail_in = W, S.total_in += B - S.next_in_index, S.next_in_index = B, $.write = M, we;
   }
   e.init = function(g, b, R, O, H, A) {
-    t = en, p = /* (byte) */
+    t = Qs, p = /* (byte) */
     g, c = /* (byte) */
     b, m = R, h = O, _ = H, L = A, i = null;
   }, e.proc = function(g, b, R) {
     let O, H, A, $ = 0, S = 0, P = 0, C, k, E, D;
     for (P = b.next_in_index, C = b.avail_in, $ = g.bitb, S = g.bitk, k = g.write, E = k < g.read ? g.read - k - 1 : g.end - k; ; )
       switch (t) {
-        case en:
+        case Qs:
           if (E >= 258 && C >= 10 && (g.bitb = $, g.bitk = S, b.avail_in = C, b.total_in += P - b.next_in_index, b.next_in_index = P, g.write = k, R = y(p, c, m, h, _, L, g, b), P = b.next_in_index, C = b.avail_in, $ = g.bitb, S = g.bitk, k = g.write, E = k < g.read ? g.read - k - 1 : g.end - k, R != we)) {
-            t = R == Jt ? wi : tn;
+            t = R == Jt ? gi : en;
             break;
           }
           n = p, i = m, a = h, t = jo;
@@ -8432,10 +8432,10 @@ function Rm() {
             break;
           }
           if (A & 32) {
-            t = wi;
+            t = gi;
             break;
           }
-          return t = tn, b.msg = "invalid literal/length code", R = Le, g.bitb = $, g.bitk = S, b.avail_in = C, b.total_in += P - b.next_in_index, b.next_in_index = P, g.write = k, g.inflate_flush(b, R);
+          return t = en, b.msg = "invalid literal/length code", R = Le, g.bitb = $, g.bitk = S, b.avail_in = C, b.total_in += P - b.next_in_index, b.next_in_index = P, g.write = k, g.inflate_flush(b, R);
         case Wo:
           for (O = o; S < O; ) {
             if (C !== 0)
@@ -8461,7 +8461,7 @@ function Rm() {
             n = A, a = H / 3 + i[H + 2];
             break;
           }
-          return t = tn, b.msg = "invalid distance code", R = Le, g.bitb = $, g.bitk = S, b.avail_in = C, b.total_in += P - b.next_in_index, b.next_in_index = P, g.write = k, g.inflate_flush(b, R);
+          return t = en, b.msg = "invalid distance code", R = Le, g.bitb = $, g.bitk = S, b.avail_in = C, b.total_in += P - b.next_in_index, b.next_in_index = P, g.write = k, g.inflate_flush(b, R);
         case Mo:
           for (O = o; S < O; ) {
             if (C !== 0)
@@ -8479,21 +8479,21 @@ function Rm() {
               return g.bitb = $, g.bitk = S, b.avail_in = C, b.total_in += P - b.next_in_index, b.next_in_index = P, g.write = k, g.inflate_flush(b, R);
             g.win[k++] = g.win[D++], E--, D == g.end && (D = 0), r--;
           }
-          t = en;
+          t = Qs;
           break;
         case Ko:
           if (E === 0 && (k == g.end && g.read !== 0 && (k = 0, E = k < g.read ? g.read - k - 1 : g.end - k), E === 0 && (g.write = k, R = g.inflate_flush(b, R), k = g.write, E = k < g.read ? g.read - k - 1 : g.end - k, k == g.end && g.read !== 0 && (k = 0, E = k < g.read ? g.read - k - 1 : g.end - k), E === 0)))
             return g.bitb = $, g.bitk = S, b.avail_in = C, b.total_in += P - b.next_in_index, b.next_in_index = P, g.write = k, g.inflate_flush(b, R);
           R = we, g.win[k++] = /* (byte) */
-          s, E--, t = en;
+          s, E--, t = Qs;
           break;
-        case wi:
+        case gi:
           if (S > 7 && (S -= 8, C++, P--), g.write = k, R = g.inflate_flush(b, R), k = g.write, E = k < g.read ? g.read - k - 1 : g.end - k, g.read != g.write)
             return g.bitb = $, g.bitk = S, b.avail_in = C, b.total_in += P - b.next_in_index, b.next_in_index = P, g.write = k, g.inflate_flush(b, R);
           t = zo;
         case zo:
           return R = Jt, g.bitb = $, g.bitk = S, b.avail_in = C, b.total_in += P - b.next_in_index, b.next_in_index = P, g.write = k, g.inflate_flush(b, R);
-        case tn:
+        case en:
           return R = Le, g.bitb = $, g.bitk = S, b.avail_in = C, b.total_in += P - b.next_in_index, b.next_in_index = P, g.write = k, g.inflate_flush(b, R);
         default:
           return R = lt, g.bitb = $, g.bitk = S, b.avail_in = C, b.total_in += P - b.next_in_index, b.next_in_index = P, g.write = k, g.inflate_flush(b, R);
@@ -8522,15 +8522,15 @@ const Go = [
   14,
   1,
   15
-], Wr = 0, bi = 1, Zo = 2, Vo = 3, Yo = 4, Xo = 5, rn = 6, sn = 7, Jo = 8, gr = 9;
+], jr = 0, wi = 1, Zo = 2, Vo = 3, Yo = 4, Xo = 5, tn = 6, rn = 7, Jo = 8, _r = 9;
 function Im(e, t) {
   const r = this;
-  let i = Wr, a = 0, n = 0, s = 0, o;
+  let i = jr, a = 0, n = 0, s = 0, o;
   const f = [0], p = [0], c = new Rm();
   let m = 0, h = new Int32Array(cp * 3);
-  const _ = 0, L = new Vi();
+  const _ = 0, L = new Zi();
   r.bitk = 0, r.bitb = 0, r.win = new Uint8Array(t), r.end = t, r.read = 0, r.write = 0, r.reset = function(y, g) {
-    g && (g[0] = _), i == rn && c.free(y), i = Wr, r.bitk = 0, r.bitb = 0, r.read = r.write = 0;
+    g && (g[0] = _), i == tn && c.free(y), i = jr, r.bitk = 0, r.bitb = 0, r.read = r.write = 0;
   }, r.reset(e, null), r.inflate_flush = function(y, g) {
     let b, R, O;
     return R = y.next_out_index, O = r.read, b = /* (int) */
@@ -8541,7 +8541,7 @@ function Im(e, t) {
     $ < r.read ? r.read - $ - 1 : r.end - $; ; ) {
       let C, k, E, D, I, B, W, M;
       switch (i) {
-        case Wr:
+        case jr:
           for (; O < 3; ) {
             if (A !== 0)
               g = we;
@@ -8552,19 +8552,19 @@ function Im(e, t) {
           switch (b = /* (int) */
           R & 7, m = b & 1, b >>> 1) {
             case 0:
-              R >>>= 3, O -= 3, b = O & 7, R >>>= b, O -= b, i = bi;
+              R >>>= 3, O -= 3, b = O & 7, R >>>= b, O -= b, i = wi;
               break;
             case 1:
-              C = [], k = [], E = [[]], D = [[]], Vi.inflate_trees_fixed(C, k, E, D), c.init(C[0], k[0], E[0], 0, D[0], 0), R >>>= 3, O -= 3, i = rn;
+              C = [], k = [], E = [[]], D = [[]], Zi.inflate_trees_fixed(C, k, E, D), c.init(C[0], k[0], E[0], 0, D[0], 0), R >>>= 3, O -= 3, i = tn;
               break;
             case 2:
               R >>>= 3, O -= 3, i = Vo;
               break;
             case 3:
-              return R >>>= 3, O -= 3, i = gr, y.msg = "invalid block type", g = Le, r.bitb = R, r.bitk = O, y.avail_in = A, y.total_in += H - y.next_in_index, y.next_in_index = H, r.write = $, r.inflate_flush(y, g);
+              return R >>>= 3, O -= 3, i = _r, y.msg = "invalid block type", g = Le, r.bitb = R, r.bitk = O, y.avail_in = A, y.total_in += H - y.next_in_index, y.next_in_index = H, r.write = $, r.inflate_flush(y, g);
           }
           break;
-        case bi:
+        case wi:
           for (; O < 32; ) {
             if (A !== 0)
               g = we;
@@ -8573,8 +8573,8 @@ function Im(e, t) {
             A--, R |= (y.read_byte(H++) & 255) << O, O += 8;
           }
           if ((~R >>> 16 & 65535) != (R & 65535))
-            return i = gr, y.msg = "invalid stored block lengths", g = Le, r.bitb = R, r.bitk = O, y.avail_in = A, y.total_in += H - y.next_in_index, y.next_in_index = H, r.write = $, r.inflate_flush(y, g);
-          a = R & 65535, R = O = 0, i = a !== 0 ? Zo : m !== 0 ? sn : Wr;
+            return i = _r, y.msg = "invalid stored block lengths", g = Le, r.bitb = R, r.bitk = O, y.avail_in = A, y.total_in += H - y.next_in_index, y.next_in_index = H, r.write = $, r.inflate_flush(y, g);
+          a = R & 65535, R = O = 0, i = a !== 0 ? Zo : m !== 0 ? rn : jr;
           break;
         case Zo:
           if (A === 0 || S === 0 && ($ == r.end && r.read !== 0 && ($ = 0, S = /* (int) */
@@ -8584,7 +8584,7 @@ function Im(e, t) {
             return r.bitb = R, r.bitk = O, y.avail_in = A, y.total_in += H - y.next_in_index, y.next_in_index = H, r.write = $, r.inflate_flush(y, g);
           if (g = we, b = a, b > A && (b = A), b > S && (b = S), r.win.set(y.read_buf(H, b), $), H += b, A -= b, $ += b, S -= b, (a -= b) !== 0)
             break;
-          i = m !== 0 ? sn : Wr;
+          i = m !== 0 ? rn : jr;
           break;
         case Vo:
           for (; O < 14; ) {
@@ -8595,7 +8595,7 @@ function Im(e, t) {
             A--, R |= (y.read_byte(H++) & 255) << O, O += 8;
           }
           if (n = b = R & 16383, (b & 31) > 29 || (b >> 5 & 31) > 29)
-            return i = gr, y.msg = "too many length or distance symbols", g = Le, r.bitb = R, r.bitk = O, y.avail_in = A, y.total_in += H - y.next_in_index, y.next_in_index = H, r.write = $, r.inflate_flush(y, g);
+            return i = _r, y.msg = "too many length or distance symbols", g = Le, r.bitb = R, r.bitk = O, y.avail_in = A, y.total_in += H - y.next_in_index, y.next_in_index = H, r.write = $, r.inflate_flush(y, g);
           if (b = 258 + (b & 31) + (b >> 5 & 31), !o || o.length < b)
             o = [];
           else
@@ -8616,7 +8616,7 @@ function Im(e, t) {
           for (; s < 19; )
             o[Go[s++]] = 0;
           if (f[0] = 7, b = L.inflate_trees_bits(o, f, p, h, y), b != we)
-            return g = b, g == Le && (o = null, i = gr), r.bitb = R, r.bitk = O, y.avail_in = A, y.total_in += H - y.next_in_index, y.next_in_index = H, r.write = $, r.inflate_flush(y, g);
+            return g = b, g == Le && (o = null, i = _r), r.bitb = R, r.bitk = O, y.avail_in = A, y.total_in += H - y.next_in_index, y.next_in_index = H, r.write = $, r.inflate_flush(y, g);
           s = 0, i = Xo;
         case Xo:
           for (; b = n, !(s >= 258 + (b & 31) + (b >> 5 & 31)); ) {
@@ -8639,7 +8639,7 @@ function Im(e, t) {
                 A--, R |= (y.read_byte(H++) & 255) << O, O += 8;
               }
               if (R >>>= b, O -= b, V += R & mt[P], R >>>= P, O -= P, P = s, b = n, P + V > 258 + (b & 31) + (b >> 5 & 31) || z == 16 && P < 1)
-                return o = null, i = gr, y.msg = "invalid bit length repeat", g = Le, r.bitb = R, r.bitk = O, y.avail_in = A, y.total_in += H - y.next_in_index, y.next_in_index = H, r.write = $, r.inflate_flush(y, g);
+                return o = null, i = _r, y.msg = "invalid bit length repeat", g = Le, r.bitb = R, r.bitk = O, y.avail_in = A, y.total_in += H - y.next_in_index, y.next_in_index = H, r.write = $, r.inflate_flush(y, g);
               z = z == 16 ? o[P - 1] : 0;
               do
                 o[P++] = z;
@@ -8648,25 +8648,25 @@ function Im(e, t) {
             }
           }
           if (p[0] = -1, I = [], B = [], W = [], M = [], I[0] = 9, B[0] = 6, b = n, b = L.inflate_trees_dynamic(257 + (b & 31), 1 + (b >> 5 & 31), o, I, B, W, M, h, y), b != we)
-            return b == Le && (o = null, i = gr), g = b, r.bitb = R, r.bitk = O, y.avail_in = A, y.total_in += H - y.next_in_index, y.next_in_index = H, r.write = $, r.inflate_flush(y, g);
-          c.init(I[0], B[0], h, W[0], h, M[0]), i = rn;
-        case rn:
+            return b == Le && (o = null, i = _r), g = b, r.bitb = R, r.bitk = O, y.avail_in = A, y.total_in += H - y.next_in_index, y.next_in_index = H, r.write = $, r.inflate_flush(y, g);
+          c.init(I[0], B[0], h, W[0], h, M[0]), i = tn;
+        case tn:
           if (r.bitb = R, r.bitk = O, y.avail_in = A, y.total_in += H - y.next_in_index, y.next_in_index = H, r.write = $, (g = c.proc(r, y, g)) != Jt)
             return r.inflate_flush(y, g);
           if (g = we, c.free(y), H = y.next_in_index, A = y.avail_in, R = r.bitb, O = r.bitk, $ = r.write, S = /* (int) */
           $ < r.read ? r.read - $ - 1 : r.end - $, m === 0) {
-            i = Wr;
+            i = jr;
             break;
           }
-          i = sn;
-        case sn:
+          i = rn;
+        case rn:
           if (r.write = $, g = r.inflate_flush(y, g), $ = r.write, S = /* (int) */
           $ < r.read ? r.read - $ - 1 : r.end - $, r.read != r.write)
             return r.bitb = R, r.bitk = O, y.avail_in = A, y.total_in += H - y.next_in_index, y.next_in_index = H, r.write = $, r.inflate_flush(y, g);
           i = Jo;
         case Jo:
           return g = Jt, r.bitb = R, r.bitk = O, y.avail_in = A, y.total_in += H - y.next_in_index, y.next_in_index = H, r.write = $, r.inflate_flush(y, g);
-        case gr:
+        case _r:
           return g = Le, r.bitb = R, r.bitk = O, y.avail_in = A, y.total_in += H - y.next_in_index, y.next_in_index = H, r.write = $, r.inflate_flush(y, g);
         default:
           return g = lt, r.bitb = R, r.bitk = O, y.avail_in = A, y.total_in += H - y.next_in_index, y.next_in_index = H, r.write = $, r.inflate_flush(y, g);
@@ -8677,15 +8677,15 @@ function Im(e, t) {
   }, r.set_dictionary = function(y, g, b) {
     r.win.set(y.subarray(g, g + b), 0), r.read = r.write = b;
   }, r.sync_point = function() {
-    return i == bi ? 1 : 0;
+    return i == wi ? 1 : 0;
   };
 }
-const Dm = 32, $m = 8, Hm = 0, Qo = 1, el = 2, tl = 3, rl = 4, sl = 5, vi = 6, fs = 7, nl = 12, ir = 13, Fm = [0, 0, 255, 255];
+const Dm = 32, $m = 8, Hm = 0, Qo = 1, el = 2, tl = 3, rl = 4, sl = 5, bi = 6, ls = 7, nl = 12, nr = 13, Fm = [0, 0, 255, 255];
 function Nm() {
   const e = this;
   e.mode = 0, e.method = 0, e.was = [0], e.need = 0, e.marker = 0, e.wbits = 0;
   function t(r) {
-    return !r || !r.istate ? lt : (r.total_in = r.total_out = 0, r.msg = null, r.istate.mode = fs, r.istate.blocks.reset(r, null), we);
+    return !r || !r.istate ? lt : (r.total_in = r.total_out = 0, r.msg = null, r.istate.mode = ls, r.istate.blocks.reset(r, null), we);
   }
   e.inflateEnd = function(r) {
     return e.blocks && e.blocks.free(r), e.blocks = null, we;
@@ -8702,11 +8702,11 @@ function Nm() {
           if (r.avail_in === 0)
             return a;
           if (a = i, r.avail_in--, r.total_in++, ((s.method = r.read_byte(r.next_in_index++)) & 15) != $m) {
-            s.mode = ir, r.msg = "unknown compression method", s.marker = 5;
+            s.mode = nr, r.msg = "unknown compression method", s.marker = 5;
             break;
           }
           if ((s.method >> 4) + 8 > s.wbits) {
-            s.mode = ir, r.msg = "invalid win size", s.marker = 5;
+            s.mode = nr, r.msg = "invalid win size", s.marker = 5;
             break;
           }
           s.mode = Qo;
@@ -8714,11 +8714,11 @@ function Nm() {
           if (r.avail_in === 0)
             return a;
           if (a = i, r.avail_in--, r.total_in++, n = r.read_byte(r.next_in_index++) & 255, ((s.method << 8) + n) % 31 !== 0) {
-            s.mode = ir, r.msg = "incorrect header check", s.marker = 5;
+            s.mode = nr, r.msg = "incorrect header check", s.marker = 5;
             break;
           }
           if (!(n & Dm)) {
-            s.mode = fs;
+            s.mode = ls;
             break;
           }
           s.mode = el;
@@ -8735,12 +8735,12 @@ function Nm() {
             return a;
           a = i, r.avail_in--, r.total_in++, s.need += (r.read_byte(r.next_in_index++) & 255) << 8 & 65280, s.mode = sl;
         case sl:
-          return r.avail_in === 0 ? a : (a = i, r.avail_in--, r.total_in++, s.need += r.read_byte(r.next_in_index++) & 255, s.mode = vi, vm);
-        case vi:
-          return s.mode = ir, r.msg = "need dictionary", s.marker = 0, lt;
-        case fs:
+          return r.avail_in === 0 ? a : (a = i, r.avail_in--, r.total_in++, s.need += r.read_byte(r.next_in_index++) & 255, s.mode = bi, vm);
+        case bi:
+          return s.mode = nr, r.msg = "need dictionary", s.marker = 0, lt;
+        case ls:
           if (a = s.blocks.proc(r, a), a == Le) {
-            s.mode = ir, s.marker = 0;
+            s.mode = nr, s.marker = 0;
             break;
           }
           if (a == we && (a = i), a != Jt)
@@ -8748,27 +8748,27 @@ function Nm() {
           a = i, s.blocks.reset(r, s.was), s.mode = nl;
         case nl:
           return r.avail_in = 0, Jt;
-        case ir:
+        case nr:
           return Le;
         default:
           return lt;
       }
   }, e.inflateSetDictionary = function(r, i, a) {
     let n = 0, s = a;
-    if (!r || !r.istate || r.istate.mode != vi)
+    if (!r || !r.istate || r.istate.mode != bi)
       return lt;
     const o = r.istate;
-    return s >= 1 << o.wbits && (s = (1 << o.wbits) - 1, n = a - s), o.blocks.set_dictionary(i, n, s), o.mode = fs, we;
+    return s >= 1 << o.wbits && (s = (1 << o.wbits) - 1, n = a - s), o.blocks.set_dictionary(i, n, s), o.mode = ls, we;
   }, e.inflateSync = function(r) {
     let i, a, n, s, o;
     if (!r || !r.istate)
       return lt;
     const f = r.istate;
-    if (f.mode != ir && (f.mode = ir, f.marker = 0), (i = r.avail_in) === 0)
+    if (f.mode != nr && (f.mode = nr, f.marker = 0), (i = r.avail_in) === 0)
       return Qt;
     for (a = r.next_in_index, n = f.marker; i !== 0 && n < 4; )
       r.read_byte(a) == Fm[n] ? n++ : r.read_byte(a) !== 0 ? n = 0 : n = 4 - n, a++, i--;
-    return r.total_in += a - r.next_in_index, r.next_in_index = a, r.avail_in = i, f.marker = n, n != 4 ? Le : (s = r.total_in, o = r.total_out, t(r), r.total_in = s, r.total_out = o, f.mode = fs, we);
+    return r.total_in += a - r.next_in_index, r.next_in_index = a, r.avail_in = i, f.marker = n, n != 4 ? Le : (s = r.total_in, o = r.total_out, t(r), r.total_in = s, r.total_out = o, f.mode = ls, we);
   }, e.inflateSyncPoint = function(r) {
     return !r || !r.istate || !r.istate.blocks ? lt : r.istate.blocks.sync_point();
   };
@@ -8832,7 +8832,7 @@ function Bm(e) {
     r.inflateEnd();
   };
 }
-const Pr = 4294967295, pr = 65535, jm = 8, Wm = 0, Um = 99, Mm = 67324752, qm = 134695760, il = 33639248, Km = 101010256, al = 101075792, zm = 117853008, Ur = 22, xi = 20, ki = 56, Gm = 1, Zm = 39169, Vm = 10, Ym = 1, Xm = 21589, Jm = 28789, Qm = 25461, e0 = 6534, ol = 1, t0 = 6, ll = 8, fl = 2048, pl = 16, cl = 16384, ul = 73, dl = "/", it = void 0, _r = "undefined", Ns = "function";
+const Er = 4294967295, fr = 65535, jm = 8, Wm = 0, Um = 99, Mm = 67324752, qm = 134695760, il = 33639248, Km = 101010256, al = 101075792, zm = 117853008, Wr = 22, vi = 20, xi = 56, Gm = 1, Zm = 39169, Vm = 10, Ym = 1, Xm = 21589, Jm = 28789, Qm = 25461, e0 = 6534, ol = 1, t0 = 6, ll = 8, fl = 2048, pl = 16, cl = 16384, ul = 73, dl = "/", it = void 0, yr = "undefined", Fs = "function";
 class hl {
   constructor(t) {
     return class extends TransformStream {
@@ -8854,7 +8854,7 @@ class hl {
 const r0 = 64;
 let dp = 2;
 try {
-  typeof navigator != _r && navigator.hardwareConcurrency && (dp = navigator.hardwareConcurrency);
+  typeof navigator != yr && navigator.hardwareConcurrency && (dp = navigator.hardwareConcurrency);
 } catch {
 }
 const s0 = {
@@ -8864,11 +8864,11 @@ const s0 = {
   useWebWorkers: !0,
   useCompressionStream: !0,
   workerScripts: it,
-  CompressionStreamNative: typeof CompressionStream != _r && CompressionStream,
-  DecompressionStreamNative: typeof DecompressionStream != _r && DecompressionStream
-}, cr = Object.assign({}, s0);
+  CompressionStreamNative: typeof CompressionStream != yr && CompressionStream,
+  DecompressionStreamNative: typeof DecompressionStream != yr && DecompressionStream
+}, pr = Object.assign({}, s0);
 function n0() {
-  return cr;
+  return pr;
 }
 function i0(e) {
   return Math.max(e.chunkSize, r0);
@@ -8887,24 +8887,24 @@ function ga(e) {
     DecompressionStream: c,
     workerScripts: m
   } = e;
-  if (ar("baseURL", t), ar("chunkSize", r), ar("maxWorkers", i), ar("terminateWorkerTimeout", a), ar("useCompressionStream", n), ar("useWebWorkers", s), o && (cr.CompressionStream = new hl(o)), f && (cr.DecompressionStream = new hl(f)), ar("CompressionStream", p), ar("DecompressionStream", c), m !== it) {
+  if (ir("baseURL", t), ir("chunkSize", r), ir("maxWorkers", i), ir("terminateWorkerTimeout", a), ir("useCompressionStream", n), ir("useWebWorkers", s), o && (pr.CompressionStream = new hl(o)), f && (pr.DecompressionStream = new hl(f)), ir("CompressionStream", p), ir("DecompressionStream", c), m !== it) {
     const { deflate: h, inflate: _ } = m;
-    if ((h || _) && (cr.workerScripts || (cr.workerScripts = {})), h) {
+    if ((h || _) && (pr.workerScripts || (pr.workerScripts = {})), h) {
       if (!Array.isArray(h))
         throw new Error("workerScripts.deflate must be an array");
-      cr.workerScripts.deflate = h;
+      pr.workerScripts.deflate = h;
     }
     if (_) {
       if (!Array.isArray(_))
         throw new Error("workerScripts.inflate must be an array");
-      cr.workerScripts.inflate = _;
+      pr.workerScripts.inflate = _;
     }
   }
 }
-function ar(e, t) {
-  t !== it && (cr[e] = t);
+function ir(e, t) {
+  t !== it && (pr[e] = t);
 }
-const Si = {
+const ki = {
   application: {
     "andrew-inset": "ez",
     annodex: "anx",
@@ -10487,9 +10487,9 @@ const Si = {
 };
 (() => {
   const e = {};
-  for (const t of Object.keys(Si))
-    for (const r of Object.keys(Si[t])) {
-      const i = Si[t][r];
+  for (const t of Object.keys(ki))
+    for (const r of Object.keys(ki[t])) {
+      const i = ki[t][r];
       if (typeof i == "string")
         e[i] = t + "/" + r;
       else
@@ -10505,7 +10505,7 @@ for (let e = 0; e < 256; e++) {
     t & 1 ? t = t >>> 1 ^ 3988292384 : t = t >>> 1;
   hp[e] = t;
 }
-class Cn {
+class Tn {
   constructor(t) {
     this.crc = t || -1;
   }
@@ -10522,7 +10522,7 @@ class Cn {
 class mp extends TransformStream {
   constructor() {
     let t;
-    const r = new Cn();
+    const r = new Tn();
     super({
       transform(i, a) {
         r.append(i), a.enqueue(i);
@@ -10535,7 +10535,7 @@ class mp extends TransformStream {
   }
 }
 function a0(e) {
-  if (typeof TextEncoder == _r) {
+  if (typeof TextEncoder == yr) {
     e = unescape(encodeURIComponent(e));
     const t = new Uint8Array(e.length);
     for (let r = 0; r < t.length; r++)
@@ -10617,7 +10617,7 @@ const nt = {
     const a = e.length ? e[e.length - 1] : 0, n = nt.getPartial(a);
     return i.push(nt.partial(t + n & 31, t + n > 32 ? r : i.pop(), 1)), i;
   }
-}, On = {
+}, Cn = {
   bytes: {
     /** Convert from a bitArray to an array of bytes. */
     fromBits(e) {
@@ -10657,7 +10657,7 @@ yp.sha1 = class {
    */
   update(e) {
     const t = this;
-    typeof e == "string" && (e = On.utf8String.toBits(e));
+    typeof e == "string" && (e = Cn.utf8String.toBits(e));
     const r = t._buffer = nt.concat(t._buffer, e), i = t._length, a = t._length = i + nt.bitLength(e);
     if (a > 9007199254740991)
       throw new Error("Cannot hash more than 2^53 - 1 bits");
@@ -10858,9 +10858,9 @@ gp.ctrGladman = class {
     return nt.clamp(t, a);
   }
 };
-const Ir = {
+const Rr = {
   importKey(e) {
-    return new Ir.hmacSha1(On.bytes.toBits(e));
+    return new Rr.hmacSha1(Cn.bytes.toBits(e));
   },
   pbkdf2(e, t, r, i) {
     if (r = r || 1e4, i < 0 || r < 0)
@@ -10870,7 +10870,7 @@ const Ir = {
     const c = new ArrayBuffer(a), m = new DataView(c);
     let h = 0;
     const _ = nt;
-    for (t = On.bytes.toBits(t), p = 1; h < (a || 1); p++) {
+    for (t = Cn.bytes.toBits(t), p = 1; h < (a || 1); p++) {
       for (n = s = e.encrypt(_.concat(t, [p])), o = 1; o < r; o++)
         for (s = e.encrypt(s), f = 0; f < s.length; f++)
           n[f] ^= s[f];
@@ -10880,7 +10880,7 @@ const Ir = {
     return c.slice(0, i / 8);
   }
 };
-Ir.hmacSha1 = class {
+Rr.hmacSha1 = class {
   constructor(e) {
     const t = this, r = t._hash = yp.sha1, i = [[], []];
     t._baseHash = [new r(), new r()];
@@ -10908,12 +10908,12 @@ Ir.hmacSha1 = class {
     return this.update(e), this.digest(e);
   }
 };
-const l0 = typeof crypto != _r && typeof crypto.getRandomValues == Ns, wp = "Invalid password", bp = "Invalid signature", wa = "zipjs-abort-check-password";
+const l0 = typeof crypto != yr && typeof crypto.getRandomValues == Fs, wp = "Invalid password", bp = "Invalid signature", wa = "zipjs-abort-check-password";
 function vp(e) {
   return l0 ? crypto.getRandomValues(e) : o0.getRandomValues(e);
 }
-const zr = 16, f0 = "raw", xp = { name: "PBKDF2" }, p0 = { name: "HMAC" }, c0 = "SHA-1", u0 = Object.assign({ hash: p0 }, xp), Yi = Object.assign({ iterations: 1e3, hash: { name: c0 } }, xp), d0 = ["deriveBits"], Os = [8, 12, 16], ps = [16, 24, 32], fr = 10, h0 = [0, 0, 0, 0], zn = typeof crypto != _r, Bs = zn && crypto.subtle, kp = zn && typeof Bs != _r, Ut = On.bytes, m0 = _p.aes, y0 = gp.ctrGladman, _0 = Ir.hmacSha1;
-let ml = zn && kp && typeof Bs.importKey == Ns, yl = zn && kp && typeof Bs.deriveBits == Ns;
+const Kr = 16, f0 = "raw", xp = { name: "PBKDF2" }, p0 = { name: "HMAC" }, c0 = "SHA-1", u0 = Object.assign({ hash: p0 }, xp), Vi = Object.assign({ iterations: 1e3, hash: { name: c0 } }, xp), d0 = ["deriveBits"], Cs = [8, 12, 16], fs = [16, 24, 32], lr = 10, h0 = [0, 0, 0, 0], Kn = typeof crypto != yr, Ns = Kn && crypto.subtle, kp = Kn && typeof Ns != yr, Ut = Cn.bytes, m0 = _p.aes, y0 = gp.ctrGladman, _0 = Rr.hmacSha1;
+let ml = Kn && kp && typeof Ns.importKey == Fs, yl = Kn && kp && typeof Ns.deriveBits == Fs;
 class g0 extends TransformStream {
   constructor({ password: t, rawPassword: r, signed: i, encryptionStrength: a, checkPasswordOnly: n }) {
     super({
@@ -10933,9 +10933,9 @@ class g0 extends TransformStream {
           resolveReady: m,
           ready: h
         } = f;
-        p ? (await b0(f, c, p, kt(s, 0, Os[c] + 2)), s = kt(s, Os[c] + 2), n ? o.error(new Error(wa)) : m()) : await h;
-        const _ = new Uint8Array(s.length - fr - (s.length - fr) % zr);
-        o.enqueue(Sp(f, s, _, 0, fr, !0));
+        p ? (await b0(f, c, p, kt(s, 0, Cs[c] + 2)), s = kt(s, Cs[c] + 2), n ? o.error(new Error(wa)) : m()) : await h;
+        const _ = new Uint8Array(s.length - lr - (s.length - lr) % Kr);
+        o.enqueue(Sp(f, s, _, 0, lr, !0));
       },
       async flush(s) {
         const {
@@ -10947,17 +10947,17 @@ class g0 extends TransformStream {
         } = this;
         if (p && f) {
           await m;
-          const h = kt(c, 0, c.length - fr), _ = kt(c, c.length - fr);
+          const h = kt(c, 0, c.length - lr), _ = kt(c, c.length - lr);
           let L = new Uint8Array();
           if (h.length) {
-            const y = Rs(Ut, h);
+            const y = Ls(Ut, h);
             p.update(y);
             const g = f.update(y);
-            L = Ls(Ut, g);
+            L = Os(Ut, g);
           }
           if (o) {
-            const y = kt(Ls(Ut, p.digest()), 0, fr);
-            for (let g = 0; g < fr; g++)
+            const y = kt(Os(Ut, p.digest()), 0, lr);
+            for (let g = 0; g < lr; g++)
               if (y[g] != _[g])
                 throw new Error(bp);
           }
@@ -10988,7 +10988,7 @@ class w0 extends TransformStream {
         } = o;
         let h = new Uint8Array();
         f ? (h = await v0(o, p, f), c()) : await m;
-        const _ = new Uint8Array(h.length + n.length - n.length % zr);
+        const _ = new Uint8Array(h.length + n.length - n.length % Kr);
         _.set(h, 0), s.enqueue(Sp(o, n, _, h.length, 0));
       },
       async flush(n) {
@@ -11002,10 +11002,10 @@ class w0 extends TransformStream {
           await p;
           let c = new Uint8Array();
           if (f.length) {
-            const m = s.update(Rs(Ut, f));
-            o.update(m), c = Ls(Ut, m);
+            const m = s.update(Ls(Ut, f));
+            o.update(m), c = Os(Ut, m);
           }
-          a.signature = Ls(Ut, o.digest()).slice(0, fr), n.enqueue(ba(c, a.signature));
+          a.signature = Os(Ut, o.digest()).slice(0, lr), n.enqueue(ba(c, a.signature));
         }
       }
     }), a = this;
@@ -11017,28 +11017,28 @@ function Sp(e, t, r, i, a, n) {
     hmac: o,
     pending: f
   } = e, p = t.length - a;
-  f.length && (t = ba(f, t), r = S0(r, p - p % zr));
+  f.length && (t = ba(f, t), r = S0(r, p - p % Kr));
   let c;
-  for (c = 0; c <= p - zr; c += zr) {
-    const m = Rs(Ut, kt(t, c, c + zr));
+  for (c = 0; c <= p - Kr; c += Kr) {
+    const m = Ls(Ut, kt(t, c, c + Kr));
     n && o.update(m);
     const h = s.update(m);
-    n || o.update(h), r.set(Ls(Ut, h), c + i);
+    n || o.update(h), r.set(Os(Ut, h), c + i);
   }
   return e.pending = kt(t, c), r;
 }
 async function b0(e, t, r, i) {
-  const a = await Ep(e, t, r, kt(i, 0, Os[t])), n = kt(i, Os[t]);
+  const a = await Ep(e, t, r, kt(i, 0, Cs[t])), n = kt(i, Cs[t]);
   if (a[0] != n[0] || a[1] != n[1])
     throw new Error(wp);
 }
 async function v0(e, t, r) {
-  const i = vp(new Uint8Array(Os[t])), a = await Ep(e, t, r, i);
+  const i = vp(new Uint8Array(Cs[t])), a = await Ep(e, t, r, i);
   return ba(i, a);
 }
 async function Ep(e, t, r, i) {
   e.password = null;
-  const a = await x0(f0, r, u0, !1, d0), n = await k0(Object.assign({ salt: i }, Yi), a, 8 * (ps[t] * 2 + 2)), s = new Uint8Array(n), o = Rs(Ut, kt(s, 0, ps[t])), f = Rs(Ut, kt(s, ps[t], ps[t] * 2)), p = kt(s, ps[t] * 2);
+  const a = await x0(f0, r, u0, !1, d0), n = await k0(Object.assign({ salt: i }, Vi), a, 8 * (fs[t] * 2 + 2)), s = new Uint8Array(n), o = Ls(Ut, kt(s, 0, fs[t])), f = Ls(Ut, kt(s, fs[t], fs[t] * 2)), p = kt(s, fs[t] * 2);
   return Object.assign(e, {
     keys: {
       key: o,
@@ -11052,22 +11052,22 @@ async function Ep(e, t, r, i) {
 async function x0(e, t, r, i, a) {
   if (ml)
     try {
-      return await Bs.importKey(e, t, r, i, a);
+      return await Ns.importKey(e, t, r, i, a);
     } catch {
-      return ml = !1, Ir.importKey(t);
+      return ml = !1, Rr.importKey(t);
     }
   else
-    return Ir.importKey(t);
+    return Rr.importKey(t);
 }
 async function k0(e, t, r) {
   if (yl)
     try {
-      return await Bs.deriveBits(e, t, r);
+      return await Ns.deriveBits(e, t, r);
     } catch {
-      return yl = !1, Ir.pbkdf2(t, e.salt, Yi.iterations, r);
+      return yl = !1, Rr.pbkdf2(t, e.salt, Vi.iterations, r);
     }
   else
-    return Ir.pbkdf2(t, e.salt, Yi.iterations, r);
+    return Rr.pbkdf2(t, e.salt, Vi.iterations, r);
 }
 function Pp(e, t) {
   return t === it ? a0(e) : t;
@@ -11086,13 +11086,13 @@ function S0(e, t) {
 function kt(e, t, r) {
   return e.subarray(t, r);
 }
-function Ls(e, t) {
+function Os(e, t) {
   return e.fromBits(t);
 }
-function Rs(e, t) {
+function Ls(e, t) {
   return e.toBits(t);
 }
-const Yr = 12;
+const Vr = 12;
 class E0 extends TransformStream {
   constructor({ password: t, passwordVerification: r, checkPasswordOnly: i }) {
     super({
@@ -11105,10 +11105,10 @@ class E0 extends TransformStream {
       transform(a, n) {
         const s = this;
         if (s.password) {
-          const o = _l(s, a.subarray(0, Yr));
-          if (s.password = null, o[Yr - 1] != s.passwordVerification)
+          const o = _l(s, a.subarray(0, Vr));
+          if (s.password = null, o[Vr - 1] != s.passwordVerification)
             throw new Error(wp);
-          a = a.subarray(Yr);
+          a = a.subarray(Vr);
         }
         i ? n.error(new Error(wa)) : n.enqueue(_l(s, a));
       }
@@ -11129,8 +11129,8 @@ class P0 extends TransformStream {
         let s, o;
         if (n.password) {
           n.password = null;
-          const f = vp(new Uint8Array(Yr));
-          f[Yr - 1] = n.passwordVerification, s = new Uint8Array(i.length + f.length), s.set(gl(n, f), 0), o = Yr;
+          const f = vp(new Uint8Array(Vr));
+          f[Vr - 1] = n.passwordVerification, s = new Uint8Array(i.length + f.length), s.set(gl(n, f), 0), o = Vr;
         } else
           s = new Uint8Array(i.length), o = 0;
         s.set(gl(n, i), o), a.enqueue(s);
@@ -11154,8 +11154,8 @@ function Ap(e, t) {
   const r = [305419896, 591751049, 878082192];
   Object.assign(e, {
     keys: r,
-    crcKey0: new Cn(r[0]),
-    crcKey2: new Cn(r[2])
+    crcKey0: new Tn(r[0]),
+    crcKey2: new Tn(r[2])
   });
   for (let i = 0; i < t.length; i++)
     va(e, t.charCodeAt(i));
@@ -11288,8 +11288,8 @@ class $0 extends TransformStream {
     }
   }
 }
-let Dp = typeof Worker != _r;
-class Ei {
+let Dp = typeof Worker != yr;
+class Si {
   constructor(t, { readable: r, writable: i }, { options: a, config: n, streamOptions: s, useWebWorkers: o, transferStreams: f, scripts: p }, c) {
     const { signal: m } = s;
     return Object.assign(t, {
@@ -11317,18 +11317,18 @@ class H0 extends TransformStream {
     let s = 0;
     super({
       async start() {
-        r && await Pi(r, a);
+        r && await Ei(r, a);
       },
       async transform(o, f) {
-        s += o.length, i && await Pi(i, s, a), f.enqueue(o);
+        s += o.length, i && await Ei(i, s, a), f.enqueue(o);
       },
       async flush() {
-        t.size = s, n && await Pi(n, s);
+        t.size = s, n && await Ei(n, s);
       }
     });
   }
 }
-async function Pi(e, ...t) {
+async function Ei(e, ...t) {
   try {
     await e(...t);
   } catch {
@@ -11387,7 +11387,7 @@ async function B0(e, t) {
     rejectResult: i,
     result: a
   });
-  const { readable: n, options: s, scripts: o } = e, { writable: f, closed: p } = j0(e.writable), c = mn({
+  const { readable: n, options: s, scripts: o } = e, { writable: f, closed: p } = j0(e.writable), c = hn({
     type: O0,
     scripts: o.slice(1),
     options: s,
@@ -11422,7 +11422,7 @@ let kl = !0, Sl = !0;
 function W0(e, t, r) {
   const i = { type: "module" };
   let a, n;
-  typeof e == Ns && (e = e());
+  typeof e == Fs && (e = e());
   try {
     a = new URL(e, t);
   } catch {
@@ -11438,7 +11438,7 @@ function W0(e, t, r) {
     n = new Worker(a, i);
   return n.addEventListener(C0, (s) => U0(s, r)), n;
 }
-function mn(e, { worker: t, writer: r, onTaskFinished: i, transferStreams: a }) {
+function hn(e, { worker: t, writer: r, onTaskFinished: i, transferStreams: a }) {
   try {
     const { value: n, readable: s, writable: o } = e, f = [];
     if (n && (n.byteLength < n.buffer.byteLength ? e.value = n.buffer.slice(0, n.byteLength) : e.value = n.buffer, f.push(e.value)), a && Sl ? (s && f.push(s), o && f.push(o)) : e.readable = e.writable = null, f.length)
@@ -11462,19 +11462,19 @@ async function U0({ data: e }, t) {
     } else {
       if (r == L0) {
         const { value: _, done: L } = await o.read();
-        mn({ type: vl, value: _, done: L, messageId: a }, t);
+        hn({ type: vl, value: _, done: L, messageId: a }, t);
       }
-      r == vl && (await f.ready, await f.write(new Uint8Array(i)), mn({ type: R0, messageId: a }, t)), r == xl && h(null, n);
+      r == vl && (await f.ready, await f.write(new Uint8Array(i)), hn({ type: R0, messageId: a }, t)), r == xl && h(null, n);
     }
   } catch (_) {
-    mn({ type: xl, messageId: a }, t), h(_);
+    hn({ type: xl, messageId: a }, t), h(_);
   }
   function h(_, L) {
     _ ? c(_) : p(L), f && f.releaseLock(), m();
   }
 }
-let xr = [];
-const Ai = [];
+let vr = [];
+const Pi = [];
 let El = 0;
 async function M0(e, t) {
   const { options: r, config: i } = t, { transferStreams: a, useWebWorkers: n, useCompressionStream: s, codecType: o, compressed: f, signed: p, encrypted: c } = r, { workerScripts: m, maxWorkers: h } = i;
@@ -11482,26 +11482,26 @@ async function M0(e, t) {
   const _ = !f && !p && !c && !t.transferStreams;
   return t.useWebWorkers = !_ && (n || n === it && i.useWebWorkers), t.scripts = t.useWebWorkers && m ? m[o] : [], r.useCompressionStream = s || s === it && i.useCompressionStream, (await L()).run();
   async function L() {
-    const g = xr.find((b) => !b.busy);
+    const g = vr.find((b) => !b.busy);
     if (g)
-      return Pl(g), new Ei(g, e, t, y);
-    if (xr.length < h) {
+      return Pl(g), new Si(g, e, t, y);
+    if (vr.length < h) {
       const b = { indexWorker: El };
-      return El++, xr.push(b), new Ei(b, e, t, y);
+      return El++, vr.push(b), new Si(b, e, t, y);
     } else
-      return new Promise((b) => Ai.push({ resolve: b, stream: e, workerOptions: t }));
+      return new Promise((b) => Pi.push({ resolve: b, stream: e, workerOptions: t }));
   }
   function y(g) {
-    if (Ai.length) {
-      const [{ resolve: b, stream: R, workerOptions: O }] = Ai.splice(0, 1);
-      b(new Ei(g, R, O, y));
-    } else g.worker ? (Pl(g), q0(g, t)) : xr = xr.filter((b) => b != g);
+    if (Pi.length) {
+      const [{ resolve: b, stream: R, workerOptions: O }] = Pi.splice(0, 1);
+      b(new Si(g, R, O, y));
+    } else g.worker ? (Pl(g), q0(g, t)) : vr = vr.filter((b) => b != g);
   }
 }
 function q0(e, t) {
   const { config: r } = t, { terminateWorkerTimeout: i } = r;
   Number.isFinite(i) && i >= 0 && (e.terminated ? e.terminated = !1 : e.terminateTimeout = setTimeout(async () => {
-    xr = xr.filter((a) => a != e);
+    vr = vr.filter((a) => a != e);
     try {
       await e.terminate();
     } catch {
@@ -11540,7 +11540,7 @@ class Fp extends xa {
     return i;
   }
 }
-class Xi extends Fp {
+class Yi extends Fp {
   constructor(t) {
     super(), Object.assign(this, {
       blob: t,
@@ -11615,7 +11615,7 @@ class Al extends xa {
           const { value: h, done: _ } = await t.next();
           if (_ && !h)
             throw new Error(z0);
-          a = h, a.size = 0, a.maxSize && (i.maxSize = a.maxSize), i.availableSize = i.maxSize, await Ln(a), n = h.writable, s = n.getWriter(), await this.write(c);
+          a = h, a.size = 0, a.maxSize && (i.maxSize = a.maxSize), i.availableSize = i.maxSize, await On(a), n = h.writable, s = n.getWriter(), await this.write(c);
         }
       },
       async close() {
@@ -11636,7 +11636,7 @@ class Al extends xa {
     }
   }
 }
-async function Ln(e, t) {
+async function On(e, t) {
   if (e.init && !e.initialized)
     await e.init(t);
   else
@@ -11648,7 +11648,7 @@ function X0(e) {
   }), e;
 }
 function J0(e) {
-  e.writable === it && typeof e.next == Ns && (e = new Al(e)), e instanceof WritableStream && (e = {
+  e.writable === it && typeof e.next == Fs && (e = new Al(e)), e instanceof WritableStream && (e = {
     writable: e
   });
   const { writable: t } = e;
@@ -11672,23 +11672,23 @@ function ey(e) {
   } else
     return new TextDecoder().decode(e);
 }
-function yn(e, t) {
+function mn(e, t) {
   return t && t.trim().toLowerCase() == "cp437" ? ey(e) : new TextDecoder(t).decode(e);
 }
-const Bp = "filename", jp = "rawFilename", Wp = "comment", Up = "rawComment", Mp = "uncompressedSize", qp = "compressedSize", Kp = "offset", Ji = "diskNumberStart", Qi = "lastModDate", ea = "rawLastModDate", zp = "lastAccessDate", ty = "rawLastAccessDate", Gp = "creationDate", ry = "rawCreationDate", sy = "internalFileAttribute", ny = "internalFileAttributes", iy = "externalFileAttribute", ay = "externalFileAttributes", oy = "msDosCompatible", ly = "zip64", fy = "encrypted", py = "version", cy = "versionMadeBy", uy = "zipCrypto", dy = "directory", hy = "executable", my = [
+const Bp = "filename", jp = "rawFilename", Wp = "comment", Up = "rawComment", Mp = "uncompressedSize", qp = "compressedSize", Kp = "offset", Xi = "diskNumberStart", Ji = "lastModDate", Qi = "rawLastModDate", zp = "lastAccessDate", ty = "rawLastAccessDate", Gp = "creationDate", ry = "rawCreationDate", sy = "internalFileAttribute", ny = "internalFileAttributes", iy = "externalFileAttribute", ay = "externalFileAttributes", oy = "msDosCompatible", ly = "zip64", fy = "encrypted", py = "version", cy = "versionMadeBy", uy = "zipCrypto", dy = "directory", hy = "executable", my = [
   Bp,
   jp,
   qp,
   Mp,
+  Ji,
   Qi,
-  ea,
   Wp,
   Up,
   zp,
   Gp,
   Kp,
-  Ji,
-  Ji,
+  Xi,
+  Xi,
   sy,
   ny,
   iy,
@@ -11720,18 +11720,18 @@ class Tl {
     my.forEach((r) => this[r] = t[r]);
   }
 }
-const Ti = "File format is not recognized", yy = "End of central directory not found", _y = "End of Zip64 central directory locator not found", gy = "Central directory header not found", wy = "Local file header not found", by = "Zip64 extra field not found", vy = "File contains encrypted entry", xy = "Encryption method not supported", Cl = "Compression method not supported", Ol = "Split zip file", Ll = "utf-8", Rl = "cp437", ky = [
-  [Mp, Pr],
-  [qp, Pr],
-  [Kp, Pr],
-  [Ji, pr]
+const Ai = "File format is not recognized", yy = "End of central directory not found", _y = "End of Zip64 central directory locator not found", gy = "Central directory header not found", wy = "Local file header not found", by = "Zip64 extra field not found", vy = "File contains encrypted entry", xy = "Encryption method not supported", Cl = "Compression method not supported", Ol = "Split zip file", Ll = "utf-8", Rl = "cp437", ky = [
+  [Mp, Er],
+  [qp, Er],
+  [Kp, Er],
+  [Xi, fr]
 ], Sy = {
-  [pr]: {
+  [fr]: {
     getValue: Be,
     bytes: 4
   },
-  [Pr]: {
-    getValue: _n,
+  [Er]: {
+    getValue: yn,
     bytes: 8
   }
 };
@@ -11747,39 +11747,39 @@ class Il {
     const r = this;
     let { reader: i } = r;
     const { config: a } = r;
-    if (await Ln(i), (i.size === it || !i.readUint8Array) && (i = new Xi(await new Response(i.readable).blob()), await Ln(i)), i.size < Ur)
-      throw new Error(Ti);
+    if (await On(i), (i.size === it || !i.readUint8Array) && (i = new Yi(await new Response(i.readable).blob()), await On(i)), i.size < Wr)
+      throw new Error(Ai);
     i.chunkSize = i0(a);
-    const n = await Oy(i, Km, i.size, Ur, pr * 16);
+    const n = await Oy(i, Km, i.size, Wr, fr * 16);
     if (!n) {
       const k = await Je(i, 0, 4), E = Ge(k);
       throw Be(E) == qm ? new Error(Ol) : new Error(yy);
     }
     const s = Ge(n);
     let o = Be(s, 12), f = Be(s, 16);
-    const p = n.offset, c = ze(s, 20), m = p + Ur + c;
+    const p = n.offset, c = ze(s, 20), m = p + Wr + c;
     let h = ze(s, 4);
     const _ = i.lastDiskNumber || 0;
     let L = ze(s, 6), y = ze(s, 8), g = 0, b = 0;
-    if (f == Pr || o == Pr || y == pr || L == pr) {
-      const k = await Je(i, n.offset - xi, xi), E = Ge(k);
+    if (f == Er || o == Er || y == fr || L == fr) {
+      const k = await Je(i, n.offset - vi, vi), E = Ge(k);
       if (Be(E, 0) == zm) {
-        f = _n(E, 8);
-        let D = await Je(i, f, ki, -1), I = Ge(D);
-        const B = n.offset - xi - ki;
+        f = yn(E, 8);
+        let D = await Je(i, f, xi, -1), I = Ge(D);
+        const B = n.offset - vi - xi;
         if (Be(I, 0) != al && f != B) {
           const W = f;
-          f = B, g = f - W, D = await Je(i, f, ki, -1), I = Ge(D);
+          f = B, g = f - W, D = await Je(i, f, xi, -1), I = Ge(D);
         }
         if (Be(I, 0) != al)
           throw new Error(_y);
-        h == pr && (h = Be(I, 16)), L == pr && (L = Be(I, 20)), y == pr && (y = _n(I, 32)), o == Pr && (o = _n(I, 40)), f -= o;
+        h == fr && (h = Be(I, 16)), L == fr && (L = Be(I, 20)), y == fr && (y = yn(I, 32)), o == Er && (o = yn(I, 40)), f -= o;
       }
     }
-    if (f >= i.size && (g = i.size - f - o - Ur, f = i.size - o - Ur), _ != h)
+    if (f >= i.size && (g = i.size - f - o - Wr, f = i.size - o - Wr), _ != h)
       throw new Error(Ol);
     if (f < 0)
-      throw new Error(Ti);
+      throw new Error(Ai);
     let R = 0, O = await Je(i, f, o, L), H = Ge(O);
     if (o) {
       const k = n.offset - o;
@@ -11790,14 +11790,14 @@ class Il {
     }
     const A = n.offset - f - (i.lastDiskOffset || 0);
     if (o != A && A >= 0 && (o = A, O = await Je(i, f, o, L), H = Ge(O)), f < 0 || f >= i.size)
-      throw new Error(Ti);
+      throw new Error(Ai);
     const $ = rt(r, t, "filenameEncoding"), S = rt(r, t, "commentEncoding");
     for (let k = 0; k < y; k++) {
       const E = new Ey(i, a, r.options);
       if (Be(H, R) != il)
         throw new Error(gy);
       Zp(E, H, R + 6);
-      const D = !!E.bitFlag.languageEncodingFlag, I = R + 46, B = I + E.filenameLength, W = B + E.extraFieldLength, M = ze(H, R + 4), V = M >> 8 == 0, z = M >> 8 == 3, ne = O.subarray(I, B), G = ze(H, R + 32), Q = W + G, ee = O.subarray(W, Q), Z = D, fe = D, ie = Be(H, R + 38), ae = V && (Xr(H, R + 38) & pl) == pl || z && (ie >> 16 & cl) == cl || ne.length && ne[ne.length - 1] == dl.charCodeAt(0), Se = z && (ie >> 16 & ul) == ul, Ae = Be(H, R + 42) + g;
+      const D = !!E.bitFlag.languageEncodingFlag, I = R + 46, B = I + E.filenameLength, W = B + E.extraFieldLength, M = ze(H, R + 4), V = M >> 8 == 0, z = M >> 8 == 3, ne = O.subarray(I, B), G = ze(H, R + 32), Q = W + G, ee = O.subarray(W, Q), Z = D, fe = D, ie = Be(H, R + 38), ae = V && (Yr(H, R + 38) & pl) == pl || z && (ie >> 16 & cl) == cl || ne.length && ne[ne.length - 1] == dl.charCodeAt(0), Se = z && (ie >> 16 & ul) == ul, Ae = Be(H, R + 42) + g;
       Object.assign(E, {
         versionMadeBy: M,
         msDosCompatible: V,
@@ -11815,11 +11815,11 @@ class Il {
         rawExtraField: O.subarray(B, W),
         executable: Se
       }), E.internalFileAttribute = E.internalFileAttributes, E.externalFileAttribute = E.externalFileAttributes;
-      const Ve = rt(r, t, "decodeText") || yn, Qe = Z ? Ll : $ || Rl, bt = fe ? Ll : S || Rl;
+      const Ve = rt(r, t, "decodeText") || mn, Qe = Z ? Ll : $ || Rl, bt = fe ? Ll : S || Rl;
       let Re = Ve(ne, Qe);
-      Re === it && (Re = yn(ne, Qe));
+      Re === it && (Re = mn(ne, Qe));
       let Ie = Ve(ee, bt);
-      Ie === it && (Ie = yn(ee, bt)), Object.assign(E, {
+      Ie === it && (Ie = mn(ee, bt)), Object.assign(E, {
         rawComment: ee,
         filename: Re,
         comment: Ie,
@@ -11836,7 +11836,7 @@ class Il {
       yield at;
     }
     const P = rt(r, t, "extractPrependedData"), C = rt(r, t, "extractAppendedData");
-    return P && (r.prependedData = b > 0 ? await Je(i, 0, b) : new Uint8Array()), r.comment = c ? await Je(i, p + Ur, c) : new Uint8Array(), C && (r.appendedData = m < i.size ? await Je(i, m, i.size - m) : new Uint8Array()), !0;
+    return P && (r.prependedData = b > 0 ? await Je(i, 0, b) : new Uint8Array()), r.comment = c ? await Je(i, p + Wr, c) : new Uint8Array(), C && (r.appendedData = m < i.size ? await Je(i, m, i.size - m) : new Uint8Array()), !0;
   }
   async getEntries(t = {}) {
     const r = [];
@@ -11895,7 +11895,7 @@ class Ey {
       size: C
     });
     const E = rt(a, i, "signal"), D = rt(a, i, "checkPasswordOnly");
-    D && (t = new WritableStream()), t = J0(t), await Ln(t, A ? y : L);
+    D && (t = new WritableStream()), t = J0(t), await On(t, A ? y : L);
     const { writable: I } = t, { onstart: B, onprogress: W, onend: M } = i, V = {
       options: {
         codecType: Ip,
@@ -11992,22 +11992,22 @@ function Py(e, t) {
   }
 }
 function Dl(e, t, r, i, a) {
-  const n = Ge(e.data), s = new Cn();
+  const n = Ge(e.data), s = new Tn();
   s.append(a[r]);
   const o = Ge(new Uint8Array(4));
   o.setUint32(0, s.get(), !0);
   const f = Be(n, 1);
   Object.assign(e, {
-    version: Xr(n, 0),
-    [t]: yn(e.data.subarray(5)),
+    version: Yr(n, 0),
+    [t]: mn(e.data.subarray(5)),
     valid: !a.bitFlag.languageEncodingFlag && f == Be(o, 0)
   }), e.valid && (i[t] = e[t], i[t + "UTF8"] = !0);
 }
 function Ay(e, t, r) {
-  const i = Ge(e.data), a = Xr(i, 4);
+  const i = Ge(e.data), a = Yr(i, 4);
   Object.assign(e, {
-    vendorVersion: Xr(i, 0),
-    vendorId: Xr(i, 2),
+    vendorVersion: Yr(i, 0),
+    vendorId: Yr(i, 2),
     strength: a,
     originalCompressionMethod: r,
     compressionMethod: ze(i, 5)
@@ -12031,15 +12031,15 @@ function Ty(e, t) {
         rawLastAccessDate: o,
         rawCreationDate: f
       });
-      const p = Ci(s), c = Ci(o), m = Ci(f), h = { lastModDate: p, lastAccessDate: c, creationDate: m };
+      const p = Ti(s), c = Ti(o), m = Ti(f), h = { lastModDate: p, lastAccessDate: c, creationDate: m };
       Object.assign(e, h), Object.assign(t, h);
     }
   } catch {
   }
 }
 function Cy(e, t, r) {
-  const i = Ge(e.data), a = Xr(i, 0), n = [], s = [];
-  r ? ((a & 1) == 1 && (n.push(Qi), s.push(ea)), (a & 2) == 2 && (n.push(zp), s.push(ty)), (a & 4) == 4 && (n.push(Gp), s.push(ry))) : e.data.length >= 5 && (n.push(Qi), s.push(ea));
+  const i = Ge(e.data), a = Yr(i, 0), n = [], s = [];
+  r ? ((a & 1) == 1 && (n.push(Ji), s.push(Qi)), (a & 2) == 2 && (n.push(zp), s.push(ty)), (a & 4) == 4 && (n.push(Gp), s.push(ry))) : e.data.length >= 5 && (n.push(Ji), s.push(Qi));
   let o = 1;
   n.forEach((f, p) => {
     if (e.data.length >= o + 4) {
@@ -12076,10 +12076,10 @@ function Ly(e) {
   } catch {
   }
 }
-function Ci(e) {
+function Ti(e) {
   return new Date(Number(e / BigInt(1e4) - BigInt(116444736e5)));
 }
-function Xr(e, t) {
+function Yr(e, t) {
   return e.getUint8(t);
 }
 function ze(e, t) {
@@ -12088,7 +12088,7 @@ function ze(e, t) {
 function Be(e, t) {
   return e.getUint32(t, !0);
 }
-function _n(e, t) {
+function yn(e, t) {
   return Number(e.getBigUint64(t, !0));
 }
 function Ry(e, t, r) {
@@ -12120,7 +12120,7 @@ class Iy {
         a.enqueue(r), a.close();
       }
     });
-    return new bs(i, t, {
+    return new ws(i, t, {
       filesize: r.byteLength
     });
   }
@@ -12137,25 +12137,25 @@ class Iy {
     throw new Error(`File not found at ${t}`);
   }
 }
-class Rn {
+class Ln {
   constructor(t) {
     this.entries = /* @__PURE__ */ new Map(), this.zipReader = t;
   }
   static fromStream(t) {
     const r = new Il(
-      new Xi(new bs(t, "archive.zip"))
+      new Yi(new ws(t, "archive.zip"))
     );
-    return new Rn(r);
+    return new Ln(r);
   }
   static fromArrayBuffer(t) {
     const r = new Il(
-      new Xi(new Blob([t]))
+      new Yi(new Blob([t]))
     );
-    return new Rn(r);
+    return new Ln(r);
   }
   async read(t) {
     const r = await this.getEntry(t), i = await r.getData(new V0());
-    return new bs(i.stream(), t, {
+    return new ws(i.stream(), t, {
       filesize: r.uncompressedSize
     });
   }
@@ -12230,7 +12230,7 @@ class $y {
       throw new Error(
         "FetchFilesystem cannot fetch files from data URLs"
       );
-    t = Dn(t);
+    t = In(t);
     const r = t.replace(/^\//, ""), i = new URL(r, this.baseUrl).toString();
     if (!i.startsWith(this.baseUrl))
       throw new Error(
@@ -12242,14 +12242,14 @@ class $y {
         `Failed to fetch file at ${t}: ${n.statusText}`
       );
     const s = n.headers.get("content-length") ? parseInt(n.headers.get("content-length"), 10) : void 0;
-    return new bs(n.body, t, { filesize: s });
+    return new ws(n.body, t, { filesize: s });
   }
 }
-function Gn(e) {
+function zn(e) {
   const t = e.split(".").shift().replace(/-/g, " ");
   return t.charAt(0).toUpperCase() + t.slice(1).toLowerCase();
 }
-function rr(e) {
+function tr(e) {
   return Object.fromEntries(Object.entries(e).map(([t, r]) => [r, t]));
 }
 const Hy = {
@@ -12307,11 +12307,11 @@ const Hy = {
   transparency_info: 52,
   connection_id: 54
 };
-rr(Hy);
+tr(Hy);
 const Fy = {
   host_name: 0
 };
-rr(Fy);
+tr(Fy);
 const Ny = {
   TLS1_CK_PSK_WITH_RC4_128_SHA: 138,
   TLS1_CK_PSK_WITH_3DES_EDE_CBC_SHA: 139,
@@ -12516,7 +12516,7 @@ const Ny = {
   TLS1_CK_DHE_PSK_WITH_CHACHA20_POLY1305: 52397,
   TLS1_CK_RSA_PSK_WITH_CHACHA20_POLY1305: 52398
 };
-rr(Ny);
+tr(Ny);
 const By = {
   secp256r1: 23,
   secp384r1: 24,
@@ -12524,20 +12524,20 @@ const By = {
   x25519: 29,
   x448: 30
 };
-rr(By);
+tr(By);
 const jy = {
   uncompressed: 0,
   ansiX962_compressed_prime: 1,
   ansiX962_compressed_char2: 2
 };
-rr(jy);
+tr(jy);
 const Wy = {
   anonymous: 0,
   rsa: 1,
   dsa: 2,
   ecdsa: 3
 };
-rr(Wy);
+tr(Wy);
 const Uy = {
   none: 0,
   md5: 1,
@@ -12547,12 +12547,12 @@ const Uy = {
   sha384: 5,
   sha512: 6
 };
-rr(Uy);
+tr(Uy);
 const My = {
   Warning: 1,
   Fatal: 2
 };
-rr(My);
+tr(My);
 const qy = {
   CloseNotify: 0,
   UnexpectedMessage: 10,
@@ -12580,7 +12580,7 @@ const qy = {
   NoRenegotiation: 100,
   UnsupportedExtension: 110
 };
-rr(qy);
+tr(qy);
 crypto.subtle.generateKey(
   {
     name: "ECDH",
@@ -12592,7 +12592,7 @@ crypto.subtle.generateKey(
   ["deriveKey", "deriveBits"]
   // Key usage
 );
-async function ta(e, t) {
+async function ea(e, t) {
   const r = ["GET", "HEAD"].includes(e.method) || "body" in t ? void 0 : await e.blob();
   return new Request(t.url || e.url, {
     body: r,
@@ -12613,8 +12613,8 @@ async function Ky(e) {
     return [e, e];
   const [t, r] = e.body.tee();
   return [
-    await ta(e, { body: t, duplex: "half" }),
-    await ta(e, { body: r, duplex: "half" })
+    await ea(e, { body: t, duplex: "half" }),
+    await ea(e, { body: r, duplex: "half" })
   ];
 }
 async function zy(e, t, r, i) {
@@ -12632,7 +12632,7 @@ async function zy(e, t, r, i) {
   try {
     return await fetch(o);
   } catch {
-    const m = ((p = new Headers(f.headers).get("x-cors-proxy-allowed-request-headers")) == null ? void 0 : p.split(",")) || [], h = m.includes("authorization") || m.includes("cookie"), _ = await ta(f, {
+    const m = ((p = new Headers(f.headers).get("x-cors-proxy-allowed-request-headers")) == null ? void 0 : p.split(",")) || [], h = m.includes("authorization") || m.includes("cookie"), _ = await ea(f, {
       url: `${r}${a.url}`,
       ...h && { credentials: "include" }
     });
@@ -12692,7 +12692,7 @@ class _g extends TransformStream {
     });
   }
 }
-new Jr({ concurrency: 15 });
+new Xr({ concurrency: 15 });
 const Gy = [
   "vfs",
   "literal",
@@ -12984,7 +12984,7 @@ class e_ extends Kt {
       s,
       (f) => f.substring(a.length).replace(/^\/+/, "")
     ), {
-      name: wn(this.reference.path) || this.reference.url.replaceAll(/[^a-zA-Z0-9-.]/g, "-").replaceAll(/-+/g, "-"),
+      name: gn(this.reference.path) || this.reference.url.replaceAll(/[^a-zA-Z0-9-.]/g, "-").replaceAll(/-+/g, "-"),
       files: s
     };
   }
@@ -13015,7 +13015,7 @@ class s_ extends ka {
     super(r), this.resource = t;
   }
   get name() {
-    return Gn(this.resource.slug);
+    return zn(this.resource.slug);
   }
   getURL() {
     return `https://downloads.wordpress.org/theme/${Jp(this.resource.slug)}`;
@@ -13027,7 +13027,7 @@ class n_ extends ka {
   }
   /** @inheritDoc */
   get name() {
-    return Gn(this.resource.slug);
+    return zn(this.resource.slug);
   }
   /** @inheritDoc */
   getURL() {
@@ -13084,7 +13084,7 @@ class o_ extends Kt {
           );
         }
       );
-      return new bs(s, this.name, {
+      return new ws(s, this.name, {
         filesize: n
       });
     } catch (a) {
@@ -13281,7 +13281,7 @@ This will ensure your code works reliably regardless of the current working dire
     i,
     new Uint8Array(await t.arrayBuffer())
   );
-  const a = await e.documentRoot, n = $n({ docroot: a, sqlFilename: i }), s = await e.run({
+  const a = await e.documentRoot, n = Dn({ docroot: a, sqlFilename: i }), s = await e.run({
     code: `<?php
 		require_once ${n.docroot} . '/wp-load.php';
 
@@ -13319,7 +13319,7 @@ This will ensure your code works reliably regardless of the current working dire
       new Uint8Array(await s.arrayBuffer())
     );
   }
-  const n = $n({
+  const n = Dn({
     zipPath: t,
     extractToPath: r,
     overwriteFiles: i
@@ -13700,7 +13700,7 @@ function skip_whitespace($tokens) {
 }
 `;
 async function sc(e, t, r, i = "rewrite") {
-  const a = $n({ wpConfigPath: t, constants: r, whenAlreadyDefined: i });
+  const a = Dn({ wpConfigPath: t, constants: r, whenAlreadyDefined: i });
   if ((await e.run({
     code: `<?php ob_start(); ?>
 			${d_}
@@ -14003,7 +14003,7 @@ Use:         writeFiles({ writeToPath: '/wordpress/wp-content/plugins/my-plugin'
 
 This will ensure your code works reliably regardless of the current working directory.
 		`.trim()
-  ), t = `/${t}`), await Hn(e, t, r.files);
+  ), t = `/${t}`), await $n(e, t, r.files);
 }, oc = async (e, { siteUrl: t }) => {
   await Sa(e, {
     consts: {
@@ -14174,7 +14174,7 @@ const lc = async (e, { themeSlug: t = "" }, r) => {
     );
     await $l(e, m);
     const h = Ee(s, c);
-    await e.fileExists(h) && (await e.mkdir(wn(m)), await e.mv(h, m));
+    await e.fileExists(h) && (await e.mkdir(gn(m)), await e.mv(h, m));
   }
   const o = Ee(
     a,
@@ -14285,7 +14285,7 @@ const C_ = async (e, { pluginData: t, pluginZipFile: r, ifAlreadyInstalled: i, o
   if (t instanceof File)
     if (await c(t)) {
       const h = t.name.split("/").pop() || "plugin.zip";
-      p = Gn(h), n == null || n.tracker.setCaption(
+      p = zn(h), n == null || n.tracker.setCaption(
         `Installing the ${p} plugin`
       );
       const _ = await pc(e, {
@@ -14314,7 +14314,7 @@ const C_ = async (e, { pluginData: t, pluginZipFile: r, ifAlreadyInstalled: i, o
       s,
       o || t.name
     );
-    await Hn(e, h, t.files, {
+    await $n(e, h, t.files, {
       rmRoot: !0
     }), f = h;
   }
@@ -14334,7 +14334,7 @@ const C_ = async (e, { pluginData: t, pluginZipFile: r, ifAlreadyInstalled: i, o
   let o = "", f = "";
   if (t instanceof File) {
     const m = t.name.split("/").pop() || "theme.zip";
-    f = Gn(m), n == null || n.tracker.setCaption(`Installing the ${f} theme`), o = (await pc(e, {
+    f = zn(m), n == null || n.tracker.setCaption(`Installing the ${f} theme`), o = (await pc(e, {
       ifAlreadyInstalled: i,
       zipFile: t,
       targetPath: `${await e.documentRoot}/wp-content/themes`,
@@ -14348,7 +14348,7 @@ const C_ = async (e, { pluginData: t, pluginZipFile: r, ifAlreadyInstalled: i, o
       "themes",
       o
     );
-    await Hn(e, m, t.files, {
+    await $n(e, m, t.files, {
       rmRoot: !0
     });
   }
@@ -14414,7 +14414,7 @@ const C_ = async (e, { pluginData: t, pluginZipFile: r, ifAlreadyInstalled: i, o
   t && (n = n.filter((f) => !f.startsWith("themes/twenty")).filter(
     (f) => f !== "mu-plugins/sqlite-database-integration"
   ));
-  const s = $n({
+  const s = Dn({
     zipPath: r,
     wpContentPath: a,
     documentRoot: i,
@@ -14576,7 +14576,7 @@ const F_ = async (e, t) => {
       type: "theme"
     });
   await e.isDir(`${i}/wp-content/languages/plugins`) || await e.mkdir(`${i}/wp-content/languages/plugins`), await e.isDir(`${i}/wp-content/languages/themes`) || await e.mkdir(`${i}/wp-content/languages/themes`);
-  const c = new Jr({ concurrency: 5 }), m = n.map(
+  const c = new Xr({ concurrency: 5 }), m = n.map(
     ({ url: h, type: _ }) => c.run(async () => {
       try {
         const L = await fetch(h);
@@ -15613,7 +15613,7 @@ function ke(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
   }
   return ke.errors = n, s === 0;
 }
-const nn = {
+const sn = {
   oneOf: [
     {
       type: "object",
@@ -16341,8 +16341,8 @@ Only the username field is required for user authentication.`
       { type: ["object", "string"] }
     ]
   }
-}, Oi = { validate: Ar };
-function Ar(e, { instancePath: t = "", parentData: r, parentDataProperty: i, rootData: a = e } = {}) {
+}, Ci = { validate: Pr };
+function Pr(e, { instancePath: t = "", parentData: r, parentDataProperty: i, rootData: a = e } = {}) {
   let n = null, s = 0;
   if (s === 0)
     if (e && typeof e == "object" && !Array.isArray(e))
@@ -16351,12 +16351,12 @@ function Ar(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
         const m = s, h = s;
         let _ = !1;
         const L = s;
-        Oi.validate(c, {
+        Ci.validate(c, {
           instancePath: t + "/" + p.replace(/~/g, "~0").replace(/\//g, "~1"),
           parentData: e,
           parentDataProperty: p,
           rootData: a
-        }) || (n = n === null ? Oi.validate.errors : n.concat(Oi.validate.errors), s = n.length);
+        }) || (n = n === null ? Ci.validate.errors : n.concat(Ci.validate.errors), s = n.length);
         var o = L === s;
         if (_ = _ || o, !_) {
           const y = s;
@@ -16385,14 +16385,14 @@ function Ar(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
             params: {},
             message: "must match a schema in anyOf"
           };
-          return n === null ? n = [y] : n.push(y), s++, Ar.errors = n, !1;
+          return n === null ? n = [y] : n.push(y), s++, Pr.errors = n, !1;
         }
         var f = m === s;
         if (!f)
           break;
       }
     else
-      return Ar.errors = [
+      return Pr.errors = [
         {
           instancePath: t,
           schemaPath: "#/type",
@@ -16401,7 +16401,7 @@ function Ar(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
           message: "must be object"
         }
       ], !1;
-  return Ar.errors = n, s === 0;
+  return Pr.errors = n, s === 0;
 }
 function Nt(e, { instancePath: t = "", parentData: r, parentDataProperty: i, rootData: a = e } = {}) {
   let n = null, s = 0;
@@ -16463,12 +16463,12 @@ function Nt(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
           if (o) {
             if (e.files !== void 0) {
               const c = s;
-              Ar(e.files, {
+              Pr(e.files, {
                 instancePath: t + "/files",
                 parentData: e,
                 parentDataProperty: "files",
                 rootData: a
-              }) || (n = n === null ? Ar.errors : n.concat(Ar.errors), s = n.length);
+              }) || (n = n === null ? Pr.errors : n.concat(Pr.errors), s = n.length);
               var o = c === s;
             } else
               var o = !0;
@@ -19055,7 +19055,7 @@ function w(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                   schemaPath: "#/oneOf/3/properties/method/enum",
                                   keyword: "enum",
                                   params: {
-                                    allowedValues: nn.oneOf[3].properties.method.enum
+                                    allowedValues: sn.oneOf[3].properties.method.enum
                                   },
                                   message: "must be equal to one of the allowed values"
                                 }
@@ -19606,7 +19606,7 @@ function w(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                   schemaPath: "#/oneOf/6/properties/importer/enum",
                                   keyword: "enum",
                                   params: {
-                                    allowedValues: nn.oneOf[6].properties.importer.enum
+                                    allowedValues: sn.oneOf[6].properties.importer.enum
                                   },
                                   message: "must be equal to one of the allowed values"
                                 }
@@ -20111,7 +20111,7 @@ function w(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                               schemaPath: "#/oneOf/9/properties/ifAlreadyInstalled/enum",
                               keyword: "enum",
                               params: {
-                                allowedValues: nn.oneOf[9].properties.ifAlreadyInstalled.enum
+                                allowedValues: sn.oneOf[9].properties.ifAlreadyInstalled.enum
                               },
                               message: "must be equal to one of the allowed values"
                             }
@@ -20439,7 +20439,7 @@ function w(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                               schemaPath: "#/oneOf/10/properties/ifAlreadyInstalled/enum",
                               keyword: "enum",
                               params: {
-                                allowedValues: nn.oneOf[10].properties.ifAlreadyInstalled.enum
+                                allowedValues: sn.oneOf[10].properties.ifAlreadyInstalled.enum
                               },
                               message: "must be equal to one of the allowed values"
                             }
@@ -23485,7 +23485,7 @@ function w(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                       for (const ge in l)
                                         if (!(ge === "BYTES_PER_ELEMENT" || ge === "buffer" || ge === "byteLength" || ge === "byteOffset" || ge === "length")) {
                                           let ut = l[ge];
-                                          const js = s;
+                                          const Bs = s;
                                           if (!(typeof ut == "number" && isFinite(
                                             ut
                                           ))) {
@@ -23510,8 +23510,8 @@ function w(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                               Ke
                                             ), s++;
                                           }
-                                          var Zn = js === s;
-                                          if (!Zn)
+                                          var Gn = Bs === s;
+                                          if (!Gn)
                                             break;
                                         }
                                       if (Dt === s) {
@@ -23521,7 +23521,7 @@ function w(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                           if (!(typeof ge == "number" && isFinite(
                                             ge
                                           ))) {
-                                            const js = {
+                                            const Bs = {
                                               instancePath: t + "/data/BYTES_PER_ELEMENT",
                                               schemaPath: "#/oneOf/25/properties/data/anyOf/2/properties/BYTES_PER_ELEMENT/type",
                                               keyword: "type",
@@ -23531,9 +23531,9 @@ function w(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                               message: "must be number"
                                             };
                                             n === null ? n = [
-                                              js
+                                              Bs
                                             ] : n.push(
-                                              js
+                                              Bs
                                             ), s++;
                                           }
                                           var tt = ut === s;
@@ -23549,7 +23549,7 @@ function w(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                               )) {
                                                 let Ke;
                                                 if (ge.byteLength === void 0 && (Ke = "byteLength")) {
-                                                  const Ws = {
+                                                  const js = {
                                                     instancePath: t + "/data/buffer",
                                                     schemaPath: "#/oneOf/25/properties/data/anyOf/2/properties/buffer/required",
                                                     keyword: "required",
@@ -23559,36 +23559,36 @@ function w(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                                     message: "must have required property '" + Ke + "'"
                                                   };
                                                   n === null ? n = [
-                                                    Ws
+                                                    js
                                                   ] : n.push(
-                                                    Ws
+                                                    js
                                                   ), s++;
                                                 } else {
-                                                  const Ws = s;
-                                                  for (const ss in ge)
-                                                    if (ss !== "byteLength") {
-                                                      const ns = {
+                                                  const js = s;
+                                                  for (const rs in ge)
+                                                    if (rs !== "byteLength") {
+                                                      const ss = {
                                                         instancePath: t + "/data/buffer",
                                                         schemaPath: "#/oneOf/25/properties/data/anyOf/2/properties/buffer/additionalProperties",
                                                         keyword: "additionalProperties",
                                                         params: {
-                                                          additionalProperty: ss
+                                                          additionalProperty: rs
                                                         },
                                                         message: "must NOT have additional properties"
                                                       };
                                                       n === null ? n = [
-                                                        ns
+                                                        ss
                                                       ] : n.push(
-                                                        ns
+                                                        ss
                                                       ), s++;
                                                       break;
                                                     }
-                                                  if (Ws === s && ge.byteLength !== void 0) {
-                                                    let ss = ge.byteLength;
-                                                    if (!(typeof ss == "number" && isFinite(
-                                                      ss
+                                                  if (js === s && ge.byteLength !== void 0) {
+                                                    let rs = ge.byteLength;
+                                                    if (!(typeof rs == "number" && isFinite(
+                                                      rs
                                                     ))) {
-                                                      const ns = {
+                                                      const ss = {
                                                         instancePath: t + "/data/buffer/byteLength",
                                                         schemaPath: "#/oneOf/25/properties/data/anyOf/2/properties/buffer/properties/byteLength/type",
                                                         keyword: "type",
@@ -23598,9 +23598,9 @@ function w(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                                         message: "must be number"
                                                       };
                                                       n === null ? n = [
-                                                        ns
+                                                        ss
                                                       ] : n.push(
-                                                        ns
+                                                        ss
                                                       ), s++;
                                                     }
                                                   }
@@ -23826,10 +23826,10 @@ function w(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                     message: "must be number"
                                   }
                                 ], !1;
-                              var Hr = re === s;
+                              var $r = re === s;
                             } else
-                              var Hr = !0;
-                            if (Hr)
+                              var $r = !0;
+                            if ($r)
                               if (l.caption !== void 0) {
                                 const x = s;
                                 if (typeof l.caption != "string")
@@ -23844,9 +23844,9 @@ function w(e, { instancePath: t = "", parentData: r, parentDataProperty: i, root
                                       message: "must be string"
                                     }
                                   ], !1;
-                                var Hr = x === s;
+                                var $r = x === s;
                               } else
-                                var Hr = !0;
+                                var $r = !0;
                           }
                         } else
                           return w.errors = [
@@ -25406,14 +25406,14 @@ function me(e, { instancePath: t = "", parentData: r, parentDataProperty: i, roo
       ], !1;
   return me.errors = n, s === 0;
 }
-function gn(e, { instancePath: t = "", parentData: r, parentDataProperty: i, rootData: a = e } = {}) {
+function _n(e, { instancePath: t = "", parentData: r, parentDataProperty: i, rootData: a = e } = {}) {
   let n = null, s = 0;
   return me(e, {
     instancePath: t,
     parentData: r,
     parentDataProperty: i,
     rootData: a
-  }) || (n = n === null ? me.errors : n.concat(me.errors), s = n.length), gn.errors = n, s === 0;
+  }) || (n = n === null ? me.errors : n.concat(me.errors), s = n.length), _n.errors = n, s === 0;
 }
 const { wpCLI: K_, ...Hl } = B_, z_ = {
   ...Hl,
@@ -25439,8 +25439,8 @@ async function G_(e) {
   return JSON.parse(r);
 }
 function Z_(e, {
-  progress: t = new In(),
-  semaphore: r = new Jr({ concurrency: 3 }),
+  progress: t = new Rn(),
+  semaphore: r = new Xr({ concurrency: 3 }),
   onStepCompleted: i = () => {
   },
   onBlueprintValidated: a = () => {
@@ -25537,7 +25537,7 @@ function Z_(e, {
     versions: {
       php: Y_(
         (A = e.preferredVersions) == null ? void 0 : A.php,
-        sa,
+        ra,
         Nc
       ),
       wp: (($ = e.preferredVersions) == null ? void 0 : $.wp) || "latest"
@@ -25582,13 +25582,13 @@ function Z_(e, {
 }
 function V_(e) {
   var a;
-  const t = gn(e);
+  const t = _n(e);
   if (t)
     return { valid: t };
   const r = /* @__PURE__ */ new Set();
-  for (const n of gn.errors)
+  for (const n of _n.errors)
     n.schemaPath.startsWith("#/properties/steps/items/anyOf") || r.add(n.instancePath);
-  const i = (a = gn.errors) == null ? void 0 : a.filter(
+  const i = (a = _n.errors) == null ? void 0 : a.filter(
     (n) => !(n.schemaPath.startsWith("#/properties/steps/items/anyOf") && r.has(n.instancePath))
   );
   return {
@@ -25857,7 +25857,7 @@ async function wg(e) {
     ]);
   } catch {
     if (await ng(r))
-      return Rn.fromArrayBuffer(r);
+      return Ln.fromArrayBuffer(r);
     throw new Error(
       `Blueprint file at ${e} is neither a valid JSON nor a ZIP file.`
     );
@@ -25870,7 +25870,7 @@ async function ng(e) {
   return t[0] === 80 && t[1] === 75 && t[2] === 3 && t[3] === 4;
 }
 async function ig(e) {
-  if ((await ws.create(e)).getVersion() === 1) {
+  if ((await gs.create(e)).getVersion() === 1) {
     const r = await dc(
       e
     );
@@ -25938,7 +25938,7 @@ class fg {
       withNetworking: g.networking,
       corsProxyUrl: n,
       sqliteDriverVersion: c
-    }), await y.isReady(), _.finish(), Ul(Pe, y), m == null || m(y), (await ws.create(L)).getVersion() === 1) {
+    }), await y.isReady(), _.finish(), Ul(Pe, y), m == null || m(y), (await gs.create(L)).getVersion() === 1) {
       const R = await dc(L, {
         progress: h,
         onStepCompleted: a,
@@ -26004,7 +26004,7 @@ class pg {
 async function vg(e) {
   const {
     iframe: t,
-    progressTracker: r = new In(),
+    progressTracker: r = new Rn(),
     disableProgressBar: i
   } = e;
   let { remoteUrl: a } = e;
@@ -26057,9 +26057,9 @@ function hg(e, t) {
   return r.search = i.toString(), r.toString();
 }
 export {
-  ws as BlueprintReflection,
+  gs as BlueprintReflection,
   Nc as LatestSupportedPHPVersion,
-  sa as SupportedPHPVersions,
+  ra as SupportedPHPVersions,
   yg as SupportedPHPVersionsList,
   Qp as activatePlugin,
   ec as activateTheme,
@@ -26082,7 +26082,7 @@ export {
   x_ as mkdir,
   v_ as mv,
   wt as phpVar,
-  $n as phpVars,
+  Dn as phpVars,
   c_ as request,
   R_ as resetData,
   wg as resolveRemoteBlueprint,