@wp-playground/client 1.0.11 → 1.0.12

package/index.js

@@ -1,4 +1,4 @@
-const Sn = function() {
+const ti = function() {
   var e;
   return typeof process < "u" && ((e = process.release) == null ? void 0 : e.name) === "node" ? "NODE" : typeof window < "u" ? "WEB" : (
     // @ts-ignore
@@ -6,7 +6,7 @@ const Sn = function() {
     self instanceof WorkerGlobalScope ? "WORKER" : "NODE"
   );
 }();
-if (Sn === "NODE") {
+if (ti === "NODE") {
   let e = function(s) {
     return new Promise(function(n, o) {
       s.onload = s.onerror = function(i) {
@@ -57,7 +57,7 @@ if (Sn === "NODE") {
     });
   });
 }
-if (Sn === "NODE" && typeof CustomEvent > "u") {
+if (ti === "NODE" && typeof CustomEvent > "u") {
   class e extends Event {
     constructor(s, n = {}) {
       super(s, n), this.detail = n.detail;
@@ -67,6 +67,13 @@ if (Sn === "NODE" && typeof CustomEvent > "u") {
   }
   globalThis.CustomEvent = e;
 }
+ti === "NODE" && typeof URL.canParse != "function" && (globalThis.URL.canParse = function(e) {
+  try {
+    return !!new URL(e);
+  } catch {
+    return !1;
+  }
+});
 const An = [
   "db.php",
   "plugins/akismet",
@@ -144,16 +151,16 @@ function _e(...e) {
   }
   let s = e.join("/");
   const n = s[0] === "/", o = r(s);
-  return s = ti(s), !s && !n && (s = "."), s && o && !r(s) && (s += "/"), s;
+  return s = si(s), !s && !n && (s = "."), s && o && !r(s) && (s += "/"), s;
 }
 function gt(e) {
   if (e === "/")
     return "/";
-  e = ti(e);
+  e = si(e);
   const r = e.lastIndexOf("/");
   return r === -1 ? "" : r === 0 ? "/" : e.substr(0, r);
 }
-function ti(e) {
+function si(e) {
   const r = e[0] === "/";
   return e = po(
     e.split("/").filter((s) => !!s),
@@ -199,7 +206,7 @@ function uo(e) {
   const r = String.fromCodePoint(...e);
   return btoa(r);
 }
-const co = "playground-log", bi = (e, ...r) => {
+const co = "playground-log", vi = (e, ...r) => {
   xe.dispatchEvent(
     new CustomEvent(co, {
       detail: {
@@ -233,22 +240,22 @@ const co = "playground-log", bi = (e, ...r) => {
       console.log(e.message, ...r);
   }
 }, yo = (e) => e instanceof Error ? [e.message, e.stack].join(`
-`) : JSON.stringify(e, null, 2), On = [], vi = (e) => {
+`) : JSON.stringify(e, null, 2), On = [], Pi = (e) => {
   On.push(e);
 }, Ws = (e) => {
   if (e.raw === !0)
-    vi(e.message);
+    Pi(e.message);
   else {
     const r = bo(
       typeof e.message == "object" ? yo(e.message) : e.message,
       e.severity ?? "Info",
       e.prefix ?? "JavaScript"
     );
-    vi(r);
+    Pi(r);
   }
 };
 let _s = 0;
-const Pi = "/wordpress/wp-content/debug.log", mo = async (e) => await e.fileExists(Pi) ? await e.readFileAsText(Pi) : "", _o = (e, r) => {
+const Ei = "/wordpress/wp-content/debug.log", mo = async (e) => await e.fileExists(Ei) ? await e.readFileAsText(Ei) : "", _o = (e, r) => {
   r.addEventListener("request.end", async () => {
     const s = await mo(r);
     if (s.length > _s) {
@@ -388,10 +395,10 @@ class go extends EventTarget {
 const wo = () => {
   try {
     if (process.env.NODE_ENV === "test")
-      return [Ws, bi];
+      return [Ws, vi];
   } catch {
   }
-  return [Ws, ho, bi];
+  return [Ws, ho, vi];
 }, xe = new go(wo()), Us = (e) => e.replace(/\t/g, ""), bo = (e, r, s) => {
   const n = /* @__PURE__ */ new Date(), o = new Intl.DateTimeFormat("en-GB", {
     year: "numeric",
@@ -852,7 +859,7 @@ function skip_whitespace($tokens) {
     }
     return $output;
 }
-`, si = async (e, { consts: r, method: s = "define-before-run" }) => {
+`, ii = async (e, { consts: r, method: s = "define-before-run" }) => {
   switch (s) {
     case "define-before-run":
       await Ao(e, r);
@@ -911,7 +918,7 @@ const Hn = async (e, { options: r }) => {
 		}
 		`
   });
-}, ii = "/tmp/wp-cli.phar", Oo = {
+}, ni = "/tmp/wp-cli.phar", Oo = {
   resource: "url",
   /**
    * Use compression for downloading the wp-cli.phar file.
@@ -924,7 +931,7 @@ const Hn = async (e, { options: r }) => {
    *        like the JavaScript parser or Composer are removed.
    */
   url: "https://playground.wordpress.net/wp-cli.phar"
-}, $n = async (e, r = ii) => {
+}, $n = async (e, r = ni) => {
   if (!await e.fileExists(r))
     throw new Error(`wp-cli.phar not found at ${r}.
 			You can enable wp-cli support by adding "wp-cli" to the list of extra libraries in your blueprint as follows:
@@ -933,7 +940,7 @@ const Hn = async (e, { options: r }) => {
 			}
 			Read more about it in the documentation.
 			https://wordpress.github.io/wordpress-playground/blueprints/data-format#extra-libraries`);
-}, Rn = async (e, { command: r, wpCliPath: s = ii }) => {
+}, Rn = async (e, { command: r, wpCliPath: s = ni }) => {
   await $n(e, s);
   let n;
   if (typeof r == "string" ? (r = r.trim(), n = xo(r)) : n = r, n.shift() !== "wp")
@@ -983,7 +990,7 @@ function xo(e) {
   return t && i.push(t), i;
 }
 const Lo = async (e, { wpCliPath: r }) => {
-  await $n(e, r), await si(e, {
+  await $n(e, r), await ii(e, {
     consts: {
       WP_ALLOW_MULTISITE: 1
     }
@@ -1345,8 +1352,8 @@ class Qt {
   var e;
   return typeof process < "u" && ((e = process.release) == null ? void 0 : e.name) === "node" ? "NODE" : typeof window < "u" ? "WEB" : typeof WorkerGlobalScope < "u" && self instanceof WorkerGlobalScope ? "WORKER" : "NODE";
 })();
-const Ei = "/internal/shared/php.ini";
-function ni(e) {
+const ki = "/internal/shared/php.ini";
+function ai(e) {
   return e && e.__esModule && Object.prototype.hasOwnProperty.call(e, "default") ? e.default : e;
 }
 const { hasOwnProperty: gs } = Object.prototype, qs = (e, r = {}) => {
@@ -1389,7 +1396,7 @@ function Bn(e, r) {
   while (o !== -1);
   return i.push(e.slice(n)), i;
 }
-const ki = (e, r = {}) => {
+const Si = (e, r = {}) => {
   r.bracketedArray = r.bracketedArray !== !1;
   const s = /* @__PURE__ */ Object.create(null);
   let n = s, o = null;
@@ -1454,19 +1461,19 @@ const ki = (e, r = {}) => {
   }
   return e;
 };
-var Si = {
-  parse: ki,
-  decode: ki,
+var Ai = {
+  parse: Si,
+  decode: Si,
   stringify: qs,
   encode: qs,
   safe: yr,
   unsafe: Ut
 };
 async function Xu(e, r) {
-  const s = Si.parse(await e.readFileAsText(Ei));
+  const s = Ai.parse(await e.readFileAsText(ki));
   for (const [n, o] of Object.entries(r))
     o == null ? delete s[n] : s[n] = o;
-  await e.writeFile(Ei, Si.stringify(s));
+  await e.writeFile(ki, Ai.stringify(s));
 }
 ReadableStream.prototype[Symbol.asyncIterator] || (ReadableStream.prototype[Symbol.asyncIterator] = async function* () {
   const e = this.getReader();
@@ -1482,7 +1489,7 @@ ReadableStream.prototype[Symbol.asyncIterator] || (ReadableStream.prototype[Symb
   }
 }, ReadableStream.prototype.iterate = // @ts-ignore
 ReadableStream.prototype[Symbol.asyncIterator]);
-const ai = [
+const oi = [
   "8.3",
   "8.2",
   "8.1",
@@ -1492,7 +1499,7 @@ const ai = [
   "7.2",
   "7.1",
   "7.0"
-], No = ai[0], Qu = ai;
+], No = oi[0], Qu = oi;
 async function as(e, r, s, { rmRoot: n = !1 } = {}) {
   n && await e.isDir(r) && await e.rmdir(r, { recursive: !0 });
   for (const [o, i] of Object.entries(s)) {
@@ -1503,7 +1510,7 @@ async function as(e, r, s, { rmRoot: n = !1 } = {}) {
 const Wo = async (e, { writeToPath: r, filesTree: s }) => {
   await as(e, r, s.files);
 }, jn = async (e, { siteUrl: r }) => {
-  await si(e, {
+  await ii(e, {
     consts: {
       WP_HOME: r,
       WP_SITEURL: r
@@ -1635,7 +1642,7 @@ const Wo = async (e, { writeToPath: r, filesTree: s }) => {
         unzip(${o.zipPath}, ${o.extractToPath}, ${o.overwriteFiles});
         `
   }), await e.fileExists(ws) && await e.unlink(ws);
-}, oi = async (e, { zipFile: r, zipPath: s, extractToPath: n }) => {
+}, pi = async (e, { zipFile: r, zipPath: s, extractToPath: n }) => {
   if (s)
     xe.warn(
       'The "zipPath" option of the unzip() Blueprint step is deprecated and will be removed. Use "zipFile" instead.'
@@ -1646,7 +1653,7 @@ const Wo = async (e, { writeToPath: r, filesTree: s }) => {
 }, qo = async (e, { wordPressFilesZip: r, pathInZip: s = "" }) => {
   const n = await e.documentRoot;
   let o = _e("/tmp", "import");
-  await e.mkdir(o), await oi(e, {
+  await e.mkdir(o), await pi(e, {
     zipFile: r,
     extractToPath: o
   }), o = _e(o, s);
@@ -1656,7 +1663,7 @@ const Wo = async (e, { writeToPath: r, filesTree: s }) => {
       i,
       d
     );
-    await Ai(e, g);
+    await Ti(e, g);
     const b = _e(t, d);
     await e.fileExists(b) && (await e.mkdir(gt(g)), await e.mv(b, g));
   }
@@ -1671,7 +1678,7 @@ const Wo = async (e, { writeToPath: r, filesTree: s }) => {
   );
   const y = await e.listFiles(o);
   for (const d of y)
-    await Ai(e, _e(n, d)), await e.mv(
+    await Ti(e, _e(n, d)), await e.mv(
       _e(o, d),
       _e(n, d)
     );
@@ -1688,7 +1695,7 @@ const Wo = async (e, { writeToPath: r, filesTree: s }) => {
             `
   });
 };
-async function Ai(e, r) {
+async function Ti(e, r) {
   await e.fileExists(r) && (await e.isDir(r) ? await e.rmdir(r) : await e.unlink(r));
 }
 async function Mo(e) {
@@ -1708,7 +1715,7 @@ async function Un(e, {
     recursive: !0
   }), await e.mkdir(y);
   try {
-    await oi(e, {
+    await pi(e, {
       zipFile: s,
       extractToPath: u
     });
@@ -2054,7 +2061,7 @@ const Jo = async (e, { language: r }, s) => {
   activateTheme: Ln,
   cp: Io,
   defineSiteUrl: jn,
-  defineWpConfigConsts: si,
+  defineWpConfigConsts: ii,
   enableMultisite: Lo,
   exportWXR: Mo,
   importThemeStarterContent: Nn,
@@ -2075,7 +2082,7 @@ const Jo = async (e, { language: r }, s) => {
   runWpInstallationWizard: Vo,
   setSiteLanguage: Jo,
   setSiteOptions: Hn,
-  unzip: oi,
+  unzip: pi,
   updateUserMeta: Co,
   wpCLI: Rn,
   writeFile: Dn,
@@ -2452,9 +2459,9 @@ function ap(e, r) {
   return Kn(e.path, r.path);
 }
 function op(e, r) {
-  return Kn(Ti(e), Ti(r));
+  return Kn(Ci(e), Ci(r));
 }
-function Ti(e) {
+function Ci(e) {
   return e.mode === "040000" ? e.path + "/" : e.path;
 }
 function zn(e) {
@@ -2512,7 +2519,7 @@ function fp(e) {
 function lp(e) {
   return !e.oid && e.sha && (e.oid = e.sha), e.mode = fp(e.mode), e.type || (e.type = zn(e.mode)), e;
 }
-class pi {
+class fi {
   constructor(r) {
     if (Buffer.isBuffer(r))
       this._entries = pp(r);
@@ -2523,7 +2530,7 @@ class pi {
     this._entries.sort(ap);
   }
   static from(r) {
-    return new pi(r);
+    return new fi(r);
   }
   render() {
     return this._entries.map((r) => `${r.mode} ${r.type} ${r.oid}    ${r.path}`).join(`
@@ -2850,7 +2857,7 @@ var Gn = {};
     r.table = n, r.bstr = O, r.buf = A, r.str = B;
   });
 })(Gn);
-const _p = /* @__PURE__ */ ni(Gn);
+const _p = /* @__PURE__ */ ai(Gn);
 class gp {
   static wrap({ type: r, object: s }) {
     return Buffer.concat([
@@ -2925,21 +2932,21 @@ class Lr {
   }
 }
 function wp(e, r) {
-  const s = new Lr(e), n = Ci(s);
+  const s = new Lr(e), n = Oi(s);
   if (n !== r.byteLength)
     throw new be(
       `applyDelta expected source buffer to be ${n} bytes but the provided buffer was ${r.length} bytes`
     );
-  const o = Ci(s);
+  const o = Oi(s);
   let i;
-  const t = xi(s, r);
+  const t = Li(s, r);
   if (t.byteLength === o)
     i = t;
   else {
     i = Buffer.alloc(o);
     const p = new Lr(i);
     for (p.copy(t); !s.eof(); )
-      p.copy(xi(s, r));
+      p.copy(Li(s, r));
     const y = p.tell();
     if (o !== y)
       throw new be(
@@ -2948,24 +2955,24 @@ function wp(e, r) {
   }
   return i;
 }
-function Ci(e) {
+function Oi(e) {
   let r = 0, s = 0, n = null;
   do
     n = e.readUInt8(), r |= (n & 127) << s, s += 7;
   while (n & 128);
   return r;
 }
-function Oi(e, r, s) {
+function xi(e, r, s) {
   let n = 0, o = 0;
   for (; s--; )
     r & 1 && (n |= e.readUInt8() << o), r >>= 1, o += 8;
   return n;
 }
-function xi(e, r) {
+function Li(e, r) {
   const s = e.readUInt8(), n = 128, o = 15, i = 112;
   if (s & n) {
-    const t = Oi(e, s & o, 4);
-    let p = Oi(e, (s & i) >> 4, 3);
+    const t = xi(e, s & o, 4);
+    let p = xi(e, (s & i) >> 4, 3);
     return p === 0 && (p = 65536), r.slice(t, t + p);
   } else
     return e.slice(s);
@@ -3022,12 +3029,12 @@ var wr = {};
     i ? (e.Buf8 = Uint8Array, e.Buf16 = Uint16Array, e.Buf32 = Int32Array, e.assign(e, n)) : (e.Buf8 = Array, e.Buf16 = Array, e.Buf32 = Array, e.assign(e, o));
   }, e.setTyped(r);
 })(wr);
-var Tt = {}, ur = {}, nt = {}, bp = wr, vp = 4, Li = 0, Ii = 1, Pp = 2;
+var Tt = {}, ur = {}, nt = {}, bp = wr, vp = 4, Ii = 0, Hi = 1, Pp = 2;
 function at(e) {
   for (var r = e.length; --r >= 0; )
     e[r] = 0;
 }
-var Ep = 0, Zn = 1, kp = 2, Sp = 3, Ap = 258, fi = 29, Ct = 256, wt = Ct + 1 + fi, rt = 30, li = 19, Vn = 2 * wt + 1, Hr = 15, Ps = 16, Tp = 7, ui = 256, Yn = 16, Xn = 17, Qn = 18, Ks = (
+var Ep = 0, Zn = 1, kp = 2, Sp = 3, Ap = 258, li = 29, Ct = 256, wt = Ct + 1 + li, rt = 30, ui = 19, Vn = 2 * wt + 1, Hr = 15, Ps = 16, Tp = 7, ci = 256, Yn = 16, Xn = 17, Qn = 18, Ks = (
   /* 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]
 ), qt = (
@@ -3044,8 +3051,8 @@ var bt = new Array(Op);
 at(bt);
 var vt = new Array(Ap - Sp + 1);
 at(vt);
-var ci = new Array(fi);
-at(ci);
+var di = new Array(li);
+at(di);
 var es = new Array(rt);
 at(es);
 function Es(e, r, s, n, o) {
@@ -3110,8 +3117,8 @@ function na(e, r, s) {
 }
 function Ip() {
   var e, r, s, n, o, i = new Array(Hr + 1);
-  for (s = 0, n = 0; n < fi - 1; n++)
-    for (ci[n] = s, e = 0; e < 1 << Ks[n]; e++)
+  for (s = 0, n = 0; n < li - 1; n++)
+    for (di[n] = s, e = 0; e < 1 << Ks[n]; e++)
       vt[s++] = n;
   for (vt[s - 1] = n, o = 0, n = 0; n < 16; n++)
     for (es[n] = o, e = 0; e < 1 << qt[n]; e++)
@@ -3131,7 +3138,7 @@ function Ip() {
     _r[e * 2 + 1] = 8, e++, i[8]++;
   for (na(_r, wt + 1, i), e = 0; e < rt; e++)
     dt[e * 2 + 1] = 5, dt[e * 2] = ia(e, 5);
-  ea = new Es(_r, Ks, Ct + 1, wt, Hr), ra = new Es(dt, qt, 0, rt, Hr), ta = new Es(new Array(0), Cp, 0, li, Tp);
+  ea = new Es(_r, Ks, Ct + 1, wt, Hr), ra = new Es(dt, qt, 0, rt, Hr), ta = new Es(new Array(0), Cp, 0, ui, Tp);
 }
 function aa(e) {
   var r;
@@ -3139,9 +3146,9 @@ function aa(e) {
     e.dyn_ltree[r * 2] = 0;
   for (r = 0; r < rt; r++)
     e.dyn_dtree[r * 2] = 0;
-  for (r = 0; r < li; r++)
+  for (r = 0; r < ui; r++)
     e.bl_tree[r * 2] = 0;
-  e.dyn_ltree[ui * 2] = 1, e.opt_len = e.static_len = 0, e.last_lit = e.matches = 0;
+  e.dyn_ltree[ci * 2] = 1, e.opt_len = e.static_len = 0, e.last_lit = e.matches = 0;
 }
 function oa(e) {
   e.bi_valid > 8 ? Pt(e, e.bi_buf) : e.bi_valid > 0 && (e.pending_buf[e.pending++] = e.bi_buf), e.bi_buf = 0, e.bi_valid = 0;
@@ -3149,22 +3156,22 @@ function oa(e) {
 function Hp(e, r, s, n) {
   oa(e), n && (Pt(e, s), Pt(e, ~s)), bp.arraySet(e.pending_buf, e.window, r, s, e.pending), e.pending += s;
 }
-function Hi(e, r, s, n) {
+function $i(e, r, s, n) {
   var o = r * 2, i = s * 2;
   return e[o] < e[i] || e[o] === e[i] && n[r] <= n[s];
 }
 function Ss(e, r, s) {
-  for (var n = e.heap[s], o = s << 1; o <= e.heap_len && (o < e.heap_len && Hi(r, e.heap[o + 1], e.heap[o], e.depth) && o++, !Hi(r, n, e.heap[o], e.depth)); )
+  for (var n = e.heap[s], o = s << 1; o <= e.heap_len && (o < e.heap_len && $i(r, e.heap[o + 1], e.heap[o], e.depth) && o++, !$i(r, n, e.heap[o], e.depth)); )
     e.heap[s] = e.heap[o], s = o, o <<= 1;
   e.heap[s] = n;
 }
-function $i(e, r, s) {
+function Ri(e, r, s) {
   var n, o, i = 0, t, p;
   if (e.last_lit !== 0)
     do
-      n = e.pending_buf[e.d_buf + i * 2] << 8 | e.pending_buf[e.d_buf + i * 2 + 1], o = e.pending_buf[e.l_buf + i], i++, n === 0 ? pr(e, o, r) : (t = vt[o], pr(e, t + Ct + 1, r), p = Ks[t], p !== 0 && (o -= ci[t], Be(e, o, p)), n--, t = sa(n), pr(e, t, s), p = qt[t], p !== 0 && (n -= es[t], Be(e, n, p)));
+      n = e.pending_buf[e.d_buf + i * 2] << 8 | e.pending_buf[e.d_buf + i * 2 + 1], o = e.pending_buf[e.l_buf + i], i++, n === 0 ? pr(e, o, r) : (t = vt[o], pr(e, t + Ct + 1, r), p = Ks[t], p !== 0 && (o -= di[t], Be(e, o, p)), n--, t = sa(n), pr(e, t, s), p = qt[t], p !== 0 && (n -= es[t], Be(e, n, p)));
     while (i < e.last_lit);
-  pr(e, ui, r);
+  pr(e, ci, r);
 }
 function zs(e, r) {
   var s = r.dyn_tree, n = r.stat_desc.static_tree, o = r.stat_desc.has_stree, i = r.stat_desc.elems, t, p, y = -1, u;
@@ -3205,12 +3212,12 @@ function zs(e, r) {
     /*SMALLEST*/
   ], Lp(e, r), na(s, y, e.bl_count);
 }
-function Ri(e, r, s) {
+function Di(e, r, s) {
   var n, o = -1, i, t = r[0 * 2 + 1], p = 0, y = 7, u = 4;
   for (t === 0 && (y = 138, u = 3), r[(s + 1) * 2 + 1] = 65535, n = 0; n <= s; n++)
     i = t, t = r[(n + 1) * 2 + 1], !(++p < y && i === t) && (p < u ? e.bl_tree[i * 2] += p : i !== 0 ? (i !== o && e.bl_tree[i * 2]++, e.bl_tree[Yn * 2]++) : p <= 10 ? e.bl_tree[Xn * 2]++ : e.bl_tree[Qn * 2]++, p = 0, o = i, t === 0 ? (y = 138, u = 3) : i === t ? (y = 6, u = 3) : (y = 7, u = 4));
 }
-function Di(e, r, s) {
+function Bi(e, r, s) {
   var n, o = -1, i, t = r[0 * 2 + 1], p = 0, y = 7, u = 4;
   for (t === 0 && (y = 138, u = 3), n = 0; n <= s; n++)
     if (i = t, t = r[(n + 1) * 2 + 1], !(++p < y && i === t)) {
@@ -3225,7 +3232,7 @@ function Di(e, r, s) {
 }
 function $p(e) {
   var r;
-  for (Ri(e, e.dyn_ltree, e.l_desc.max_code), Ri(e, e.dyn_dtree, e.d_desc.max_code), zs(e, e.bl_desc), r = li - 1; r >= 3 && e.bl_tree[Jn[r] * 2 + 1] === 0; r--)
+  for (Di(e, e.dyn_ltree, e.l_desc.max_code), Di(e, e.dyn_dtree, e.d_desc.max_code), zs(e, e.bl_desc), r = ui - 1; r >= 3 && e.bl_tree[Jn[r] * 2 + 1] === 0; r--)
     ;
   return e.opt_len += 3 * (r + 1) + 5 + 5 + 4, r;
 }
@@ -3233,33 +3240,33 @@ function Rp(e, r, s, n) {
   var o;
   for (Be(e, r - 257, 5), Be(e, s - 1, 5), Be(e, n - 4, 4), o = 0; o < n; o++)
     Be(e, e.bl_tree[Jn[o] * 2 + 1], 3);
-  Di(e, e.dyn_ltree, r - 1), Di(e, e.dyn_dtree, s - 1);
+  Bi(e, e.dyn_ltree, r - 1), Bi(e, e.dyn_dtree, s - 1);
 }
 function Dp(e) {
   var r = 4093624447, s;
   for (s = 0; s <= 31; s++, r >>>= 1)
     if (r & 1 && e.dyn_ltree[s * 2] !== 0)
-      return Li;
+      return Ii;
   if (e.dyn_ltree[9 * 2] !== 0 || e.dyn_ltree[10 * 2] !== 0 || e.dyn_ltree[13 * 2] !== 0)
-    return Ii;
+    return Hi;
   for (s = 32; s < Ct; s++)
     if (e.dyn_ltree[s * 2] !== 0)
-      return Ii;
-  return Li;
+      return Hi;
+  return Ii;
 }
-var Bi = !1;
+var Fi = !1;
 function Bp(e) {
-  Bi || (Ip(), Bi = !0), e.l_desc = new ks(e.dyn_ltree, ea), e.d_desc = new ks(e.dyn_dtree, ra), e.bl_desc = new ks(e.bl_tree, ta), e.bi_buf = 0, e.bi_valid = 0, aa(e);
+  Fi || (Ip(), Fi = !0), e.l_desc = new ks(e.dyn_ltree, ea), e.d_desc = new ks(e.dyn_dtree, ra), e.bl_desc = new ks(e.bl_tree, ta), e.bi_buf = 0, e.bi_valid = 0, aa(e);
 }
 function pa(e, r, s, n) {
   Be(e, (Ep << 1) + (n ? 1 : 0), 3), Hp(e, r, s, !0);
 }
 function Fp(e) {
-  Be(e, Zn << 1, 3), pr(e, ui, _r), xp(e);
+  Be(e, Zn << 1, 3), pr(e, ci, _r), xp(e);
 }
 function jp(e, r, s, n) {
   var o, i, t = 0;
-  e.level > 0 ? (e.strm.data_type === Pp && (e.strm.data_type = Dp(e)), zs(e, e.l_desc), zs(e, e.d_desc), t = $p(e), o = e.opt_len + 3 + 7 >>> 3, i = e.static_len + 3 + 7 >>> 3, i <= o && (o = i)) : o = i = s + 5, s + 4 <= o && r !== -1 ? pa(e, r, s, n) : e.strategy === vp || i === o ? (Be(e, (Zn << 1) + (n ? 1 : 0), 3), $i(e, _r, dt)) : (Be(e, (kp << 1) + (n ? 1 : 0), 3), Rp(e, e.l_desc.max_code + 1, e.d_desc.max_code + 1, t + 1), $i(e, e.dyn_ltree, e.dyn_dtree)), aa(e), n && oa(e);
+  e.level > 0 ? (e.strm.data_type === Pp && (e.strm.data_type = Dp(e)), zs(e, e.l_desc), zs(e, e.d_desc), t = $p(e), o = e.opt_len + 3 + 7 >>> 3, i = e.static_len + 3 + 7 >>> 3, i <= o && (o = i)) : o = i = s + 5, s + 4 <= o && r !== -1 ? pa(e, r, s, n) : e.strategy === vp || i === o ? (Be(e, (Zn << 1) + (n ? 1 : 0), 3), Ri(e, _r, dt)) : (Be(e, (kp << 1) + (n ? 1 : 0), 3), Rp(e, e.l_desc.max_code + 1, e.d_desc.max_code + 1, t + 1), Ri(e, e.dyn_ltree, e.dyn_dtree)), aa(e), n && oa(e);
 }
 function Np(e, r, s) {
   return e.pending_buf[e.d_buf + e.last_lit * 2] = r >>> 8 & 255, e.pending_buf[e.d_buf + e.last_lit * 2 + 1] = r & 255, e.pending_buf[e.l_buf + e.last_lit] = s & 255, e.last_lit++, r === 0 ? e.dyn_ltree[s * 2]++ : (e.matches++, r--, e.dyn_ltree[(vt[s] + Ct + 1) * 2]++, e.dyn_dtree[sa(r) * 2]++), e.last_lit === e.lit_bufsize - 1;
@@ -3297,7 +3304,7 @@ function Mp(e, r, s, n) {
     e = e >>> 8 ^ o[(e ^ r[t]) & 255];
   return e ^ -1;
 }
-var la = Mp, di = {
+var la = Mp, hi = {
   2: "need dictionary",
   /* Z_NEED_DICT       2  */
   1: "stream end",
@@ -3316,11 +3323,11 @@ var la = Mp, di = {
   /* Z_BUF_ERROR     (-5) */
   "-6": "incompatible version"
   /* Z_VERSION_ERROR (-6) */
-}, Re = wr, ze = nt, ua = fa, kr = la, Kp = di, Ur = 0, zp = 1, Gp = 3, Or = 4, Fi = 5, fr = 0, ji = 1, Ge = -2, Zp = -3, As = -5, Vp = -1, Yp = 1, Dt = 2, Xp = 3, Qp = 4, Jp = 0, ef = 2, ls = 8, rf = 9, tf = 15, sf = 8, nf = 29, af = 256, Gs = af + 1 + nf, of = 30, pf = 19, ff = 2 * Gs + 1, lf = 15, oe = 3, Tr = 258, er = Tr + oe + 1, uf = 32, us = 42, Zs = 69, Mt = 73, Kt = 91, zt = 103, $r = 113, ut = 666, Ae = 1, Ot = 2, Br = 3, ot = 4, cf = 3;
+}, Re = wr, ze = nt, ua = fa, kr = la, Kp = hi, Ur = 0, zp = 1, Gp = 3, Or = 4, ji = 5, fr = 0, Ni = 1, Ge = -2, Zp = -3, As = -5, Vp = -1, Yp = 1, Dt = 2, Xp = 3, Qp = 4, Jp = 0, ef = 2, ls = 8, rf = 9, tf = 15, sf = 8, nf = 29, af = 256, Gs = af + 1 + nf, of = 30, pf = 19, ff = 2 * Gs + 1, lf = 15, oe = 3, Tr = 258, er = Tr + oe + 1, uf = 32, us = 42, Zs = 69, Mt = 73, Kt = 91, zt = 103, $r = 113, ut = 666, Ae = 1, Ot = 2, Br = 3, ot = 4, cf = 3;
 function Cr(e, r) {
   return e.msg = Kp[r], r;
 }
-function Ni(e) {
+function Wi(e) {
   return (e << 1) - (e > 4 ? 9 : 0);
 }
 function Ar(e) {
@@ -3537,7 +3544,7 @@ function bf(e, r) {
 }
 function vf(e, r) {
   var s, n, o, i;
-  if (!e || !e.state || r > Fi || r < 0)
+  if (!e || !e.state || r > ji || r < 0)
     return e ? Cr(e, Ge) : Ge;
   if (n = e.state, !e.output || !e.input && e.avail_in !== 0 || n.status === ut && r !== Or)
     return Cr(e, e.avail_out === 0 ? As : Ge);
@@ -3587,7 +3594,7 @@ function vf(e, r) {
   if (n.status === zt && (n.gzhead.hcrc ? (n.pending + 2 > n.pending_buf_size && Sr(e), n.pending + 2 <= n.pending_buf_size && (fe(n, e.adler & 255), fe(n, e.adler >> 8 & 255), e.adler = 0, n.status = $r)) : n.status = $r), n.pending !== 0) {
     if (Sr(e), e.avail_out === 0)
       return n.last_flush = -1, fr;
-  } else if (e.avail_in === 0 && Ni(r) <= Ni(s) && r !== Or)
+  } else if (e.avail_in === 0 && Wi(r) <= Wi(s) && r !== Or)
     return Cr(e, As);
   if (n.status === ut && e.avail_in !== 0)
     return Cr(e, As);
@@ -3595,10 +3602,10 @@ function vf(e, r) {
     var y = n.strategy === Dt ? mf(n, r) : n.strategy === Xp ? yf(n, r) : Jr[n.level].func(n, r);
     if ((y === Br || y === ot) && (n.status = ut), y === Ae || y === Br)
       return e.avail_out === 0 && (n.last_flush = -1), fr;
-    if (y === Ot && (r === zp ? ze._tr_align(n) : r !== Fi && (ze._tr_stored_block(n, 0, 0, !1), r === Gp && (Ar(n.head), n.lookahead === 0 && (n.strstart = 0, n.block_start = 0, n.insert = 0))), Sr(e), e.avail_out === 0))
+    if (y === Ot && (r === zp ? ze._tr_align(n) : r !== ji && (ze._tr_stored_block(n, 0, 0, !1), r === Gp && (Ar(n.head), n.lookahead === 0 && (n.strstart = 0, n.block_start = 0, n.insert = 0))), Sr(e), e.avail_out === 0))
       return n.last_flush = -1, fr;
   }
-  return r !== Or ? fr : n.wrap <= 0 ? ji : (n.wrap === 2 ? (fe(n, e.adler & 255), fe(n, e.adler >> 8 & 255), fe(n, e.adler >> 16 & 255), fe(n, e.adler >> 24 & 255), fe(n, e.total_in & 255), fe(n, e.total_in >> 8 & 255), fe(n, e.total_in >> 16 & 255), fe(n, e.total_in >> 24 & 255)) : (lt(n, e.adler >>> 16), lt(n, e.adler & 65535)), Sr(e), n.wrap > 0 && (n.wrap = -n.wrap), n.pending !== 0 ? fr : ji);
+  return r !== Or ? fr : n.wrap <= 0 ? Ni : (n.wrap === 2 ? (fe(n, e.adler & 255), fe(n, e.adler >> 8 & 255), fe(n, e.adler >> 16 & 255), fe(n, e.adler >> 24 & 255), fe(n, e.total_in & 255), fe(n, e.total_in >> 8 & 255), fe(n, e.total_in >> 16 & 255), fe(n, e.total_in >> 24 & 255)) : (lt(n, e.adler >>> 16), lt(n, e.adler & 65535)), Sr(e), n.wrap > 0 && (n.wrap = -n.wrap), n.pending !== 0 ? fr : Ni);
 }
 function Pf(e) {
   var r;
@@ -3694,7 +3701,7 @@ qr.utf8border = function(e, r) {
 function kf() {
   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 wa = kf, ht = ur, yt = wr, Vs = qr, Ys = di, Sf = wa, ba = Object.prototype.toString, Af = 0, Cs = 4, tt = 0, Wi = 1, Ui = 2, Tf = -1, Cf = 0, Of = 8;
+var wa = kf, ht = ur, yt = wr, Vs = qr, Ys = hi, Sf = wa, ba = Object.prototype.toString, Af = 0, Cs = 4, tt = 0, Ui = 1, qi = 2, Tf = -1, Cf = 0, Of = 8;
 function jr(e) {
   if (!(this instanceof jr))
     return new jr(e);
@@ -3732,11 +3739,11 @@ jr.prototype.push = function(e, r) {
     return !1;
   i = r === ~~r ? r : r === !0 ? Cs : Af, typeof e == "string" ? s.input = Vs.string2buf(e) : ba.call(e) === "[object ArrayBuffer]" ? s.input = new Uint8Array(e) : s.input = e, s.next_in = 0, s.avail_in = s.input.length;
   do {
-    if (s.avail_out === 0 && (s.output = new yt.Buf8(n), s.next_out = 0, s.avail_out = n), o = ht.deflate(s, i), o !== Wi && o !== tt)
+    if (s.avail_out === 0 && (s.output = new yt.Buf8(n), s.next_out = 0, s.avail_out = n), o = ht.deflate(s, i), o !== Ui && o !== tt)
       return this.onEnd(o), this.ended = !0, !1;
-    (s.avail_out === 0 || s.avail_in === 0 && (i === Cs || i === Ui)) && (this.options.to === "string" ? this.onData(Vs.buf2binstring(yt.shrinkBuf(s.output, s.next_out))) : this.onData(yt.shrinkBuf(s.output, s.next_out)));
-  } while ((s.avail_in > 0 || s.avail_out === 0) && o !== Wi);
-  return i === Cs ? (o = ht.deflateEnd(this.strm), this.onEnd(o), this.ended = !0, o === tt) : (i === Ui && (this.onEnd(tt), s.avail_out = 0), !0);
+    (s.avail_out === 0 || s.avail_in === 0 && (i === Cs || i === qi)) && (this.options.to === "string" ? this.onData(Vs.buf2binstring(yt.shrinkBuf(s.output, s.next_out))) : this.onData(yt.shrinkBuf(s.output, s.next_out)));
+  } while ((s.avail_in > 0 || s.avail_out === 0) && o !== Ui);
+  return i === Cs ? (o = ht.deflateEnd(this.strm), this.onEnd(o), this.ended = !0, o === tt) : (i === qi && (this.onEnd(tt), s.avail_out = 0), !0);
 };
 jr.prototype.onData = function(e) {
   this.chunks.push(e);
@@ -3744,20 +3751,20 @@ jr.prototype.onData = function(e) {
 jr.prototype.onEnd = function(e) {
   e === tt && (this.options.to === "string" ? this.result = this.chunks.join("") : this.result = yt.flattenChunks(this.chunks)), this.chunks = [], this.err = e, this.msg = this.strm.msg;
 };
-function hi(e, r) {
+function yi(e, r) {
   var s = new jr(r);
   if (s.push(e, !0), s.err)
     throw s.msg || Ys[s.err];
   return s.result;
 }
 function xf(e, r) {
-  return r = r || {}, r.raw = !0, hi(e, r);
+  return r = r || {}, r.raw = !0, yi(e, r);
 }
 function Lf(e, r) {
-  return r = r || {}, r.gzip = !0, hi(e, r);
+  return r = r || {}, r.gzip = !0, yi(e, r);
 }
 Tt.Deflate = jr;
-Tt.deflate = hi;
+Tt.deflate = yi;
 Tt.deflateRaw = xf;
 Tt.gzip = Lf;
 var xt = {}, rr = {}, Bt = 30, If = 12, Hf = function(r, s) {
@@ -3848,7 +3855,7 @@ var xt = {}, rr = {}, Bt = 30, If = 12, Hf = function(r, s) {
         }
     } while (o < i && t < y);
   A = P >> 3, o -= A, P -= A << 3, H &= (1 << P) - 1, r.next_in = o, r.next_out = t, r.avail_in = o < i ? 5 + (i - o) : 5 - (o - i), r.avail_out = t < y ? 257 + (y - t) : 257 - (t - y), n.hold = H, n.bits = P;
-}, qi = wr, Yr = 15, Mi = 852, Ki = 592, zi = 0, Os = 1, Gi = 2, $f = [
+}, Mi = wr, Yr = 15, Ki = 852, zi = 592, Gi = 0, Os = 1, Zi = 2, $f = [
   /* Length codes 257..285 base */
   3,
   4,
@@ -3983,7 +3990,7 @@ var xt = {}, rr = {}, Bt = 30, If = 12, Hf = function(r, s) {
   64,
   64
 ], Ff = function(r, s, n, o, i, t, p, y) {
-  var u = y.bits, d = 0, g = 0, b = 0, w = 0, H = 0, P = 0, N = 0, j = 0, q = 0, $ = 0, W, O, A, B, x, T = null, k = 0, S, F = new qi.Buf16(Yr + 1), D = new qi.Buf16(Yr + 1), I = null, V = 0, z, K, Y;
+  var u = y.bits, d = 0, g = 0, b = 0, w = 0, H = 0, P = 0, N = 0, j = 0, q = 0, $ = 0, W, O, A, B, x, T = null, k = 0, S, F = new Mi.Buf16(Yr + 1), D = new Mi.Buf16(Yr + 1), I = null, V = 0, z, K, Y;
   for (d = 0; d <= Yr; d++)
     F[d] = 0;
   for (g = 0; g < o; g++)
@@ -3997,13 +4004,13 @@ var xt = {}, rr = {}, Bt = 30, If = 12, Hf = function(r, s) {
   for (H < b && (H = b), j = 1, d = 1; d <= Yr; d++)
     if (j <<= 1, j -= F[d], j < 0)
       return -1;
-  if (j > 0 && (r === zi || w !== 1))
+  if (j > 0 && (r === Gi || w !== 1))
     return -1;
   for (D[1] = 0, d = 1; d < Yr; d++)
     D[d + 1] = D[d] + F[d];
   for (g = 0; g < o; g++)
     s[n + g] !== 0 && (p[D[s[n + g]]++] = g);
-  if (r === zi ? (T = I = p, S = 19) : r === Os ? (T = $f, k -= 257, I = Rf, V -= 257, S = 256) : (T = Df, I = Bf, S = -1), $ = 0, g = 0, d = b, x = t, P = H, N = 0, A = -1, q = 1 << H, B = q - 1, r === Os && q > Mi || r === Gi && q > Ki)
+  if (r === Gi ? (T = I = p, S = 19) : r === Os ? (T = $f, k -= 257, I = Rf, V -= 257, S = 256) : (T = Df, I = Bf, S = -1), $ = 0, g = 0, d = b, x = t, P = H, N = 0, A = -1, q = 1 << H, B = q - 1, r === Os && q > Ki || r === Zi && q > zi)
     return 1;
   for (; ; ) {
     z = d - N, p[g] < S ? (K = 0, Y = p[g]) : p[g] > S ? (K = I[V + p[g]], Y = T[k + p[g]]) : (K = 32 + 64, Y = 0), W = 1 << d - N, O = 1 << P, b = O;
@@ -4020,14 +4027,14 @@ var xt = {}, rr = {}, Bt = 30, If = 12, Hf = function(r, s) {
     if (d > H && ($ & B) !== A) {
       for (N === 0 && (N = H), x += b, P = d - N, j = 1 << P; P + N < w && (j -= F[P + N], !(j <= 0)); )
         P++, j <<= 1;
-      if (q += 1 << P, r === Os && q > Mi || r === Gi && q > Ki)
+      if (q += 1 << P, r === Os && q > Ki || r === Zi && q > zi)
         return 1;
       A = $ & B, i[A] = H << 24 | P << 16 | x - t | 0;
     }
   }
   return $ !== 0 && (i[x + $] = d - N << 24 | 64 << 16 | 0), y.bits = H, 0;
-}, Ue = wr, Xs = fa, ar = la, jf = Hf, mt = Ff, Nf = 0, va = 1, Pa = 2, Zi = 4, Wf = 5, Ft = 6, Nr = 0, Uf = 1, qf = 2, Ze = -2, Ea = -3, ka = -4, Mf = -5, Vi = 8, Sa = 1, Yi = 2, Xi = 3, Qi = 4, Ji = 5, en = 6, rn = 7, tn = 8, sn = 9, nn = 10, rs = 11, hr = 12, xs = 13, an = 14, Ls = 15, on = 16, pn = 17, fn = 18, ln = 19, jt = 20, Nt = 21, un = 22, cn = 23, dn = 24, hn = 25, yn = 26, Is = 27, mn = 28, _n = 29, we = 30, Aa = 31, Kf = 32, zf = 852, Gf = 592, Zf = 15, Vf = Zf;
-function gn(e) {
+}, Ue = wr, Xs = fa, ar = la, jf = Hf, mt = Ff, Nf = 0, va = 1, Pa = 2, Vi = 4, Wf = 5, Ft = 6, Nr = 0, Uf = 1, qf = 2, Ze = -2, Ea = -3, ka = -4, Mf = -5, Yi = 8, Sa = 1, Xi = 2, Qi = 3, Ji = 4, en = 5, rn = 6, tn = 7, sn = 8, nn = 9, an = 10, rs = 11, hr = 12, xs = 13, on = 14, Ls = 15, pn = 16, fn = 17, ln = 18, un = 19, jt = 20, Nt = 21, cn = 22, dn = 23, hn = 24, yn = 25, mn = 26, Is = 27, _n = 28, gn = 29, we = 30, Aa = 31, Kf = 32, zf = 852, Gf = 592, Zf = 15, Vf = Zf;
+function wn(e) {
   return (e >>> 24 & 255) + (e >>> 8 & 65280) + ((e & 65280) << 8) + ((e & 255) << 24);
 }
 function Yf() {
@@ -4052,9 +4059,9 @@ function xa(e, r) {
 function Xf(e) {
   return xa(e, Vf);
 }
-var wn = !0, Hs, $s;
+var bn = !0, Hs, $s;
 function Qf(e) {
-  if (wn) {
+  if (bn) {
     var r;
     for (Hs = new Ue.Buf32(512), $s = new Ue.Buf32(32), r = 0; r < 144; )
       e.lens[r++] = 8;
@@ -4066,7 +4073,7 @@ function Qf(e) {
       e.lens[r++] = 8;
     for (mt(va, e.lens, 0, 288, Hs, 0, e.work, { bits: 9 }), r = 0; r < 32; )
       e.lens[r++] = 5;
-    mt(Pa, e.lens, 0, 32, $s, 0, e.work, { bits: 5 }), wn = !1;
+    mt(Pa, e.lens, 0, 32, $s, 0, e.work, { bits: 5 }), bn = !1;
   }
   e.lencode = Hs, e.lenbits = 9, e.distcode = $s, e.distbits = 5;
 }
@@ -4096,7 +4103,7 @@ function Jf(e, r) {
             p--, u += n[i++] << d, d += 8;
           }
           if (s.wrap & 2 && u === 35615) {
-            s.check = 0, T[0] = u & 255, T[1] = u >>> 8 & 255, s.check = ar(s.check, T, 2, 0), u = 0, d = 0, s.mode = Yi;
+            s.check = 0, T[0] = u & 255, T[1] = u >>> 8 & 255, s.check = ar(s.check, T, 2, 0), u = 0, d = 0, s.mode = Xi;
             break;
           }
           if (s.flags = 0, s.head && (s.head.done = !1), !(s.wrap & 1) || /* check if zlib header allowed */
@@ -4104,7 +4111,7 @@ function Jf(e, r) {
             e.msg = "incorrect header check", s.mode = we;
             break;
           }
-          if ((u & 15) !== Vi) {
+          if ((u & 15) !== Yi) {
             e.msg = "unknown compression method", s.mode = we;
             break;
           }
@@ -4114,15 +4121,15 @@ function Jf(e, r) {
             e.msg = "invalid window size", s.mode = we;
             break;
           }
-          s.dmax = 1 << B, e.adler = s.check = 1, s.mode = u & 512 ? nn : hr, u = 0, d = 0;
+          s.dmax = 1 << B, e.adler = s.check = 1, s.mode = u & 512 ? an : hr, u = 0, d = 0;
           break;
-        case Yi:
+        case Xi:
           for (; d < 16; ) {
             if (p === 0)
               break e;
             p--, u += n[i++] << d, d += 8;
           }
-          if (s.flags = u, (s.flags & 255) !== Vi) {
+          if (s.flags = u, (s.flags & 255) !== Yi) {
             e.msg = "unknown compression method", s.mode = we;
             break;
           }
@@ -4130,22 +4137,22 @@ function Jf(e, r) {
             e.msg = "unknown header flags set", s.mode = we;
             break;
           }
-          s.head && (s.head.text = u >> 8 & 1), s.flags & 512 && (T[0] = u & 255, T[1] = u >>> 8 & 255, s.check = ar(s.check, T, 2, 0)), u = 0, d = 0, s.mode = Xi;
-        case Xi:
+          s.head && (s.head.text = u >> 8 & 1), s.flags & 512 && (T[0] = u & 255, T[1] = u >>> 8 & 255, s.check = ar(s.check, T, 2, 0)), u = 0, d = 0, s.mode = Qi;
+        case Qi:
           for (; d < 32; ) {
             if (p === 0)
               break e;
             p--, u += n[i++] << d, d += 8;
           }
-          s.head && (s.head.time = u), s.flags & 512 && (T[0] = u & 255, T[1] = u >>> 8 & 255, T[2] = u >>> 16 & 255, T[3] = u >>> 24 & 255, s.check = ar(s.check, T, 4, 0)), u = 0, d = 0, s.mode = Qi;
-        case Qi:
+          s.head && (s.head.time = u), s.flags & 512 && (T[0] = u & 255, T[1] = u >>> 8 & 255, T[2] = u >>> 16 & 255, T[3] = u >>> 24 & 255, s.check = ar(s.check, T, 4, 0)), u = 0, d = 0, s.mode = Ji;
+        case Ji:
           for (; d < 16; ) {
             if (p === 0)
               break e;
             p--, u += n[i++] << d, d += 8;
           }
-          s.head && (s.head.xflags = u & 255, s.head.os = u >> 8), s.flags & 512 && (T[0] = u & 255, T[1] = u >>> 8 & 255, s.check = ar(s.check, T, 2, 0)), u = 0, d = 0, s.mode = Ji;
-        case Ji:
+          s.head && (s.head.xflags = u & 255, s.head.os = u >> 8), s.flags & 512 && (T[0] = u & 255, T[1] = u >>> 8 & 255, s.check = ar(s.check, T, 2, 0)), u = 0, d = 0, s.mode = en;
+        case en:
           if (s.flags & 1024) {
             for (; d < 16; ) {
               if (p === 0)
@@ -4155,8 +4162,8 @@ function Jf(e, r) {
             s.length = u, s.head && (s.head.extra_len = u), s.flags & 512 && (T[0] = u & 255, T[1] = u >>> 8 & 255, s.check = ar(s.check, T, 2, 0)), u = 0, d = 0;
           } else
             s.head && (s.head.extra = null);
-          s.mode = en;
-        case en:
+          s.mode = rn;
+        case rn:
           if (s.flags & 1024 && (w = s.length, w > p && (w = p), w && (s.head && (B = s.head.extra_len - s.length, s.head.extra || (s.head.extra = new Array(s.head.extra_len)), Ue.arraySet(
             s.head.extra,
             n,
@@ -4168,8 +4175,8 @@ function Jf(e, r) {
             B
           )), s.flags & 512 && (s.check = ar(s.check, n, w, i)), p -= w, i += w, s.length -= w), s.length))
             break e;
-          s.length = 0, s.mode = rn;
-        case rn:
+          s.length = 0, s.mode = tn;
+        case tn:
           if (s.flags & 2048) {
             if (p === 0)
               break e;
@@ -4181,8 +4188,8 @@ function Jf(e, r) {
               break e;
           } else
             s.head && (s.head.name = null);
-          s.length = 0, s.mode = tn;
-        case tn:
+          s.length = 0, s.mode = sn;
+        case sn:
           if (s.flags & 4096) {
             if (p === 0)
               break e;
@@ -4194,8 +4201,8 @@ function Jf(e, r) {
               break e;
           } else
             s.head && (s.head.comment = null);
-          s.mode = sn;
-        case sn:
+          s.mode = nn;
+        case nn:
           if (s.flags & 512) {
             for (; d < 16; ) {
               if (p === 0)
@@ -4210,13 +4217,13 @@ function Jf(e, r) {
           }
           s.head && (s.head.hcrc = s.flags >> 9 & 1, s.head.done = !0), e.adler = s.check = 0, s.mode = hr;
           break;
-        case nn:
+        case an:
           for (; d < 32; ) {
             if (p === 0)
               break e;
             p--, u += n[i++] << d, d += 8;
           }
-          e.adler = s.check = gn(u), u = 0, d = 0, s.mode = rs;
+          e.adler = s.check = wn(u), u = 0, d = 0, s.mode = rs;
         case rs:
           if (s.havedict === 0)
             return e.next_out = t, e.avail_out = y, e.next_in = i, e.avail_in = p, s.hold = u, s.bits = d, qf;
@@ -4236,7 +4243,7 @@ function Jf(e, r) {
           }
           switch (s.last = u & 1, u >>>= 1, d -= 1, u & 3) {
             case 0:
-              s.mode = an;
+              s.mode = on;
               break;
             case 1:
               if (Qf(s), s.mode = jt, r === Ft) {
@@ -4245,14 +4252,14 @@ function Jf(e, r) {
               }
               break;
             case 2:
-              s.mode = pn;
+              s.mode = fn;
               break;
             case 3:
               e.msg = "invalid block type", s.mode = we;
           }
           u >>>= 2, d -= 2;
           break;
-        case an:
+        case on:
           for (u >>>= d & 7, d -= d & 7; d < 32; ) {
             if (p === 0)
               break e;
@@ -4265,8 +4272,8 @@ function Jf(e, r) {
           if (s.length = u & 65535, u = 0, d = 0, s.mode = Ls, r === Ft)
             break e;
         case Ls:
-          s.mode = on;
-        case on:
+          s.mode = pn;
+        case pn:
           if (w = s.length, w) {
             if (w > p && (w = p), w > y && (w = y), w === 0)
               break e;
@@ -4275,7 +4282,7 @@ function Jf(e, r) {
           }
           s.mode = hr;
           break;
-        case pn:
+        case fn:
           for (; d < 14; ) {
             if (p === 0)
               break e;
@@ -4285,8 +4292,8 @@ function Jf(e, r) {
             e.msg = "too many length or distance symbols", s.mode = we;
             break;
           }
-          s.have = 0, s.mode = fn;
-        case fn:
+          s.have = 0, s.mode = ln;
+        case ln:
           for (; s.have < s.ncode; ) {
             for (; d < 3; ) {
               if (p === 0)
@@ -4301,8 +4308,8 @@ function Jf(e, r) {
             e.msg = "invalid code lengths set", s.mode = we;
             break;
           }
-          s.have = 0, s.mode = ln;
-        case ln:
+          s.have = 0, s.mode = un;
+        case un:
           for (; s.have < s.nlen + s.ndist; ) {
             for (; N = s.lencode[u & (1 << s.lenbits) - 1], j = N >>> 24, q = N >>> 16 & 255, $ = N & 65535, !(j <= d); ) {
               if (p === 0)
@@ -4383,7 +4390,7 @@ function Jf(e, r) {
             u >>>= W, d -= W, s.back += W;
           }
           if (u >>>= j, d -= j, s.back += j, s.length = $, q === 0) {
-            s.mode = yn;
+            s.mode = mn;
             break;
           }
           if (q & 32) {
@@ -4394,8 +4401,8 @@ function Jf(e, r) {
             e.msg = "invalid literal/length code", s.mode = we;
             break;
           }
-          s.extra = q & 15, s.mode = un;
-        case un:
+          s.extra = q & 15, s.mode = cn;
+        case cn:
           if (s.extra) {
             for (S = s.extra; d < S; ) {
               if (p === 0)
@@ -4404,8 +4411,8 @@ function Jf(e, r) {
             }
             s.length += u & (1 << s.extra) - 1, u >>>= s.extra, d -= s.extra, s.back += s.extra;
           }
-          s.was = s.length, s.mode = cn;
-        case cn:
+          s.was = s.length, s.mode = dn;
+        case dn:
           for (; N = s.distcode[u & (1 << s.distbits) - 1], j = N >>> 24, q = N >>> 16 & 255, $ = N & 65535, !(j <= d); ) {
             if (p === 0)
               break e;
@@ -4423,8 +4430,8 @@ function Jf(e, r) {
             e.msg = "invalid distance code", s.mode = we;
             break;
           }
-          s.offset = $, s.extra = q & 15, s.mode = dn;
-        case dn:
+          s.offset = $, s.extra = q & 15, s.mode = hn;
+        case hn:
           if (s.extra) {
             for (S = s.extra; d < S; ) {
               if (p === 0)
@@ -4437,8 +4444,8 @@ function Jf(e, r) {
             e.msg = "invalid distance too far back", s.mode = we;
             break;
           }
-          s.mode = hn;
-        case hn:
+          s.mode = yn;
+        case yn:
           if (y === 0)
             break e;
           if (w = b - y, s.offset > w) {
@@ -4455,7 +4462,7 @@ function Jf(e, r) {
           while (--w);
           s.length === 0 && (s.mode = Nt);
           break;
-        case yn:
+        case mn:
           if (y === 0)
             break e;
           o[t++] = s.length, y--, s.mode = Nt;
@@ -4468,14 +4475,14 @@ function Jf(e, r) {
               p--, u |= n[i++] << d, d += 8;
             }
             if (b -= y, e.total_out += b, s.total += b, b && (e.adler = s.check = /*UPDATE(state.check, put - _out, _out);*/
-            s.flags ? ar(s.check, o, b, t - b) : Xs(s.check, o, b, t - b)), b = y, (s.flags ? u : gn(u)) !== s.check) {
+            s.flags ? ar(s.check, o, b, t - b) : Xs(s.check, o, b, t - b)), b = y, (s.flags ? u : wn(u)) !== s.check) {
               e.msg = "incorrect data check", s.mode = we;
               break;
             }
             u = 0, d = 0;
           }
-          s.mode = mn;
-        case mn:
+          s.mode = _n;
+        case _n:
           if (s.wrap && s.flags) {
             for (; d < 32; ) {
               if (p === 0)
@@ -4488,8 +4495,8 @@ function Jf(e, r) {
             }
             u = 0, d = 0;
           }
-          s.mode = _n;
-        case _n:
+          s.mode = gn;
+        case gn:
           x = Uf;
           break e;
         case we:
@@ -4501,8 +4508,8 @@ function Jf(e, r) {
         default:
           return Ze;
       }
-  return e.next_out = t, e.avail_out = y, e.next_in = i, e.avail_in = p, s.hold = u, s.bits = d, (s.wsize || b !== e.avail_out && s.mode < we && (s.mode < Is || r !== Zi)) && La(e, e.output, e.next_out, b - e.avail_out), g -= e.avail_in, b -= e.avail_out, e.total_in += g, e.total_out += b, s.total += b, s.wrap && b && (e.adler = s.check = /*UPDATE(state.check, strm.next_out - _out, _out);*/
-  s.flags ? ar(s.check, o, b, e.next_out - b) : Xs(s.check, o, b, e.next_out - b)), e.data_type = s.bits + (s.last ? 64 : 0) + (s.mode === hr ? 128 : 0) + (s.mode === jt || s.mode === Ls ? 256 : 0), (g === 0 && b === 0 || r === Zi) && x === Nr && (x = Mf), x;
+  return e.next_out = t, e.avail_out = y, e.next_in = i, e.avail_in = p, s.hold = u, s.bits = d, (s.wsize || b !== e.avail_out && s.mode < we && (s.mode < Is || r !== Vi)) && La(e, e.output, e.next_out, b - e.avail_out), g -= e.avail_in, b -= e.avail_out, e.total_in += g, e.total_out += b, s.total += b, s.wrap && b && (e.adler = s.check = /*UPDATE(state.check, strm.next_out - _out, _out);*/
+  s.flags ? ar(s.check, o, b, e.next_out - b) : Xs(s.check, o, b, e.next_out - b)), e.data_type = s.bits + (s.last ? 64 : 0) + (s.mode === hr ? 128 : 0) + (s.mode === jt || s.mode === Ls ? 256 : 0), (g === 0 && b === 0 || r === Vi) && x === Nr && (x = Mf), x;
 }
 function el(e) {
   if (!e || !e.state)
@@ -4571,7 +4578,7 @@ var Ia = {
 function sl() {
   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 il = sl, st = rr, _t = wr, Gt = qr, Ee = Ia, Qs = di, nl = wa, al = il, Ha = Object.prototype.toString;
+var il = sl, st = rr, _t = wr, Gt = qr, Ee = Ia, Qs = hi, nl = wa, al = il, Ha = Object.prototype.toString;
 function Wr(e) {
   if (!(this instanceof Wr))
     return new Wr(e);
@@ -4609,23 +4616,23 @@ Wr.prototype.onData = function(e) {
 Wr.prototype.onEnd = function(e) {
   e === Ee.Z_OK && (this.options.to === "string" ? this.result = this.chunks.join("") : this.result = _t.flattenChunks(this.chunks)), this.chunks = [], this.err = e, this.msg = this.strm.msg;
 };
-function yi(e, r) {
+function mi(e, r) {
   var s = new Wr(r);
   if (s.push(e, !0), s.err)
     throw s.msg || Qs[s.err];
   return s.result;
 }
 function ol(e, r) {
-  return r = r || {}, r.raw = !0, yi(e, r);
+  return r = r || {}, r.raw = !0, mi(e, r);
 }
 xt.Inflate = Wr;
-xt.inflate = yi;
+xt.inflate = mi;
 xt.inflateRaw = ol;
-xt.ungzip = yi;
+xt.ungzip = mi;
 var pl = wr.assign, fl = Tt, ll = xt, ul = Ia, $a = {};
 pl($a, fl, ll, ul);
 var cl = $a;
-const Ra = /* @__PURE__ */ ni(cl);
+const Ra = /* @__PURE__ */ ai(cl);
 async function dl(e, r) {
   const s = new Mn(e);
   let n = await s.read(4);
@@ -4760,9 +4767,9 @@ function Al(e) {
     lr[r >> 10] + lr[r >> 4 & 63] + lr[r << 2 & 63] + "="
   )), o.join("");
 }
-var mi = {};
+var _i = {};
 /*! ieee754. BSD-3-Clause License. Feross Aboukhadijeh <https://feross.org/opensource> */
-mi.read = function(e, r, s, n, o) {
+_i.read = function(e, r, s, n, o) {
   var i, t, p = o * 8 - n - 1, y = (1 << p) - 1, u = y >> 1, d = -7, g = s ? o - 1 : 0, b = s ? -1 : 1, w = e[r + g];
   for (g += b, i = w & (1 << -d) - 1, w >>= -d, d += p; d > 0; i = i * 256 + e[r + g], g += b, d -= 8)
     ;
@@ -4777,7 +4784,7 @@ mi.read = function(e, r, s, n, o) {
   }
   return (w ? -1 : 1) * t * Math.pow(2, i - n);
 };
-mi.write = function(e, r, s, n, o, i) {
+_i.write = function(e, r, s, n, o, i) {
   var t, p, y, u = i * 8 - o - 1, d = (1 << u) - 1, g = d >> 1, b = o === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0, w = n ? 0 : i - 1, H = n ? 1 : -1, P = r < 0 || r === 0 && 1 / r < 0 ? 1 : 0;
   for (r = Math.abs(r), isNaN(r) || r === 1 / 0 ? (p = isNaN(r) ? 1 : 0, t = d) : (t = Math.floor(Math.log(r) / Math.LN2), r * (y = Math.pow(2, -t)) < 1 && (t--, y *= 2), t + g >= 1 ? r += b / y : r += b * Math.pow(2, 1 - g), r * y >= 2 && (t++, y /= 2), t + g >= d ? (p = 0, t = d) : t + g >= 1 ? (p = (r * y - 1) * Math.pow(2, o), t = t + g) : (p = r * Math.pow(2, g - 1) * Math.pow(2, o), t = 0)); o >= 8; e[s + w] = p & 255, w += H, p /= 256, o -= 8)
     ;
@@ -4792,7 +4799,7 @@ mi.write = function(e, r, s, n, o, i) {
  * @license  MIT
  */
 (function(e) {
-  const r = ds, s = mi, n = typeof Symbol == "function" && typeof Symbol.for == "function" ? Symbol.for("nodejs.util.inspect.custom") : null;
+  const r = ds, s = _i, n = typeof Symbol == "function" && typeof Symbol.for == "function" ? Symbol.for("nodejs.util.inspect.custom") : null;
   e.Buffer = p, e.SlowBuffer = q, e.INSPECT_MAX_BYTES = 50;
   const o = 2147483647;
   e.kMaxLength = o, p.TYPED_ARRAY_SUPPORT = i(), !p.TYPED_ARRAY_SUPPORT && typeof console < "u" && typeof console.error == "function" && console.error(
@@ -5862,7 +5869,7 @@ Lt.prototype._hash = function() {
   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 Dl = Lt;
-const Bl = /* @__PURE__ */ ni(Dl);
+const Bl = /* @__PURE__ */ ai(Dl);
 function Fl(e) {
   let r = "";
   for (const s of new Uint8Array(e))
@@ -5870,7 +5877,7 @@ function Fl(e) {
   return r;
 }
 let Ds = null;
-async function bn(e) {
+async function vn(e) {
   return Ds === null && (Ds = await Nl()), Ds ? Na(e) : jl(e);
 }
 function jl(e) {
@@ -6001,7 +6008,7 @@ class kt {
           w.readDepth = 0, w.externalReadDepth = 0;
           const { type: $, object: W } = await w.readSlice({ start: N });
           P[w.readDepth] += 1;
-          const O = await bn(gp.wrap({ type: $, object: W }));
+          const O = await vn(gp.wrap({ type: $, object: W }));
           q.oid = O, p.push(O), u.set(O, N), y[O] = q.crc;
         } catch {
           continue;
@@ -6032,7 +6039,7 @@ class kt {
     for (const u of this.hashes)
       i.writeUInt32BE(this.offsets.get(u));
     r.push(i.buffer), s(this.packfileSha, "hex");
-    const t = Buffer.concat(r), p = await bn(t), y = Buffer.alloc(20);
+    const t = Buffer.concat(r), p = await vn(t), y = Buffer.alloc(20);
     return y.write(p, "hex"), Buffer.concat([t, y]);
   }
   async load({ pack: r }) {
@@ -6492,7 +6499,7 @@ function Rr(e) {
         e.object = Ne.from(e.object).parse();
         break;
       case "tree":
-        e.object = pi.from(e.object).entries();
+        e.object = fi.from(e.object).entries();
         break;
       case "blob":
         e.object = new Uint8Array(e.object), e.format = "content";
@@ -6535,7 +6542,7 @@ function Ga(e) {
   };
 }
 function Yl(e, r) {
-  r = ti(r);
+  r = si(r);
   const s = ["", ".", "/"].includes(r);
   let n = e;
   if (s)
@@ -6700,7 +6707,7 @@ class eu extends br {
     return this.resource.name;
   }
 }
-class _i extends br {
+class gi extends br {
   /**
    * Creates a new instance of `FetchResource`.
    * @param progress The progress tracker.
@@ -6775,7 +6782,7 @@ class _i extends br {
 }
 const ru = () => {
 };
-class tu extends _i {
+class tu extends gi {
   /**
    * Creates a new instance of `UrlResource`.
    * @param resource The URL reference.
@@ -6833,7 +6840,7 @@ class iu extends br {
     return this.reference.name;
   }
 }
-class nu extends _i {
+class nu extends gi {
   constructor(r, s) {
     super(s), this.resource = r;
   }
@@ -6844,7 +6851,7 @@ class nu extends _i {
     return `https://downloads.wordpress.org/theme/${Va(this.resource.slug)}`;
   }
 }
-class au extends _i {
+class au extends gi {
   constructor(r, s) {
     super(s), this.resource = r;
   }
@@ -17369,10 +17376,10 @@ function Zt(e, { instancePath: r = "", parentData: s, parentDataProperty: n, roo
     rootData: o
   }) || (i = i === null ? ie.errors : i.concat(ie.errors), t = i.length), Zt.errors = i, t === 0;
 }
-const { wpCLI: hu, ...vn } = ep, yu = {
-  ...vn,
+const { wpCLI: hu, ...Pn } = ep, yu = {
+  ...Pn,
   "wp-cli": hu,
-  importFile: vn.importWxr
+  importFile: Pn.importWxr
 };
 function mu(e, {
   progress: r = new ps(),
@@ -17424,7 +17431,7 @@ function mu(e, {
     const O = {
       step: "writeFile",
       data: Oo,
-      path: ii
+      path: ni
     };
     i === -1 ? (H = e.steps) == null || H.push(O) : (P = e.steps) == null || P.splice(
       i,
@@ -17468,7 +17475,7 @@ function mu(e, {
     versions: {
       php: gu(
         (q = e.preferredVersions) == null ? void 0 : q.php,
-        ai,
+        oi,
         No
       ),
       wp: (($ = e.preferredVersions) == null ? void 0 : $.wp) || "latest"
@@ -17565,14 +17572,14 @@ function vu(e, {
     } finally {
       i.finish();
     }
-  }, y = Pn(t), u = Pn(t).filter(
+  }, y = En(t), u = En(t).filter(
     (b) => b.isAsync
   ), d = 1 / (u.length + 1);
   for (const b of u)
     b.progress = i.stage(d);
   return { run: p, step: e, resources: y };
 }
-function Pn(e) {
+function En(e) {
   const r = [];
   for (const s in e) {
     const n = e[s];
@@ -17602,10 +17609,10 @@ const Qa = Symbol("Comlink.proxy"), ku = Symbol("Comlink.endpoint"), Su = Symbol
   canHandle: (e) => Ja(e) && e[Qa],
   serialize(e) {
     const { port1: r, port2: s } = new MessageChannel();
-    return gi(e, r), [s, [s]];
+    return wi(e, r), [s, [s]];
   },
   deserialize(e) {
-    return e.start(), wi(e);
+    return e.start(), bi(e);
   }
 }, Tu = {
   canHandle: (e) => Ja(e) && Vt in e,
@@ -17633,7 +17640,7 @@ function Cu(e, r) {
       return !0;
   return !1;
 }
-function gi(e, r = globalThis, s = ["*"]) {
+function wi(e, r = globalThis, s = ["*"]) {
   r.addEventListener("message", function n(o) {
     if (!o || !o.data)
       return;
@@ -17664,7 +17671,7 @@ function gi(e, r = globalThis, s = ["*"]) {
         case "ENDPOINT":
           {
             const { port1: b, port2: w } = new MessageChannel();
-            gi(e, w), u = Hu(b, [b]);
+            wi(e, w), u = Hu(b, [b]);
           }
           break;
         case "RELEASE":
@@ -17694,7 +17701,7 @@ function Ou(e) {
 function eo(e) {
   Ou(e) && e.close();
 }
-function wi(e, r) {
+function bi(e, r) {
   return ri(e, [], r);
 }
 function Wt(e) {
@@ -17757,7 +17764,7 @@ function ri(e, r = [], s = function() {
         }).then(Ir);
       if (y === "bind")
         return ri(e, r.slice(0, -1));
-      const [u, d] = En(p);
+      const [u, d] = kn(p);
       return Qr(e, {
         type: "APPLY",
         path: r.map((g) => g.toString()),
@@ -17766,7 +17773,7 @@ function ri(e, r = [], s = function() {
     },
     construct(i, t) {
       Wt(n);
-      const [p, y] = En(t);
+      const [p, y] = kn(t);
       return Qr(e, {
         type: "CONSTRUCT",
         path: r.map((u) => u.toString()),
@@ -17779,7 +17786,7 @@ function ri(e, r = [], s = function() {
 function Iu(e) {
   return Array.prototype.concat.apply([], e);
 }
-function En(e) {
+function kn(e) {
   const r = e.map(is);
   return [r.map((s) => s[0]), Iu(r.map((s) => s[1]))];
 }
@@ -17839,7 +17846,7 @@ function Ru() {
 }
 function Du(e, r = void 0) {
   Fu();
-  const s = e instanceof Worker ? e : $u(e, r), n = wi(s), o = io(n);
+  const s = e instanceof Worker ? e : $u(e, r), n = bi(s), o = io(n);
   return new Proxy(o, {
     get: (i, t) => t === "isConnected" ? async () => {
       for (; ; )
@@ -17856,11 +17863,11 @@ async function Bu(e, r) {
     setTimeout(n, r), e.then(s);
   });
 }
-let kn = !1;
+let Sn = !1;
 function Fu() {
-  if (kn)
+  if (Sn)
     return;
-  kn = !0, et.set("EVENT", {
+  Sn = !0, et.set("EVENT", {
     canHandle: (s) => s instanceof CustomEvent,
     serialize: (s) => [
       {
@@ -17873,10 +17880,10 @@ function Fu() {
     canHandle: (s) => typeof s == "function",
     serialize(s) {
       const { port1: n, port2: o } = new MessageChannel();
-      return gi(s, n), [o, [o]];
+      return wi(s, n), [o, [o]];
     },
     deserialize(s) {
-      return s.start(), wi(s);
+      return s.start(), bi(s);
     }
   }), et.set("PHPResponse", {
     canHandle: (s) => typeof s == "object" && s !== null && "headers" in s && "bytes" in s && "errors" in s && "exitCode" in s && "httpStatusCode" in s,
@@ -18322,14 +18329,14 @@ function Yu(e, r) {
 }
 export {
   No as LatestSupportedPHPVersion,
-  ai as SupportedPHPVersions,
+  oi as SupportedPHPVersions,
   Qu as SupportedPHPVersionsList,
   xn as activatePlugin,
   Ln as activateTheme,
   mu as compileBlueprint,
   Io as cp,
   jn as defineSiteUrl,
-  si as defineWpConfigConsts,
+  ii as defineWpConfigConsts,
   Lo as enableMultisite,
   Mo as exportWXR,
   Nn as importThemeStarterContent,
@@ -18356,7 +18363,7 @@ export {
   Jo as setSiteLanguage,
   Hn as setSiteOptions,
   rc as startPlaygroundWeb,
-  oi as unzip,
+  pi as unzip,
   Co as updateUserMeta,
   Rn as wpCLI,
   An as wpContentFilesExcludedFromExport,