@spaceandtimelabs/makeinfinite-ui 0.33.0 → 0.34.0

package/dist/makeinfinite-ui.es.js

@@ -1,4 +1,4 @@
-import Oe, { useContext as Jn, createElement as ph, createContext as fu, useState as ht, useCallback as hc, useEffect as du, useMemo as mh } from "react";
+import Oe, { useContext as Jn, createElement as ph, createContext as fu, useState as ct, useCallback as hc, useEffect as du, useMemo as mh } from "react";
 import * as hu from "@babel/standalone";
 import pu from "react-dom";
 var Hi = typeof globalThis < "u" ? globalThis : typeof window < "u" ? window : typeof global < "u" ? global : typeof self < "u" ? self : {};
@@ -45,21 +45,21 @@ function gh(e) {
     for (var _ = 0, R = Math.min(256 * 256, y.length + 1), O = new Uint16Array(R), x = [], C = 0; ; ) {
       var k = _ < y.length;
       if (!k || C >= R - 1) {
-        var S = O.subarray(0, C), P = S;
-        if (x.push(String.fromCharCode.apply(null, P)), !k) return x.join("");
+        var S = O.subarray(0, C), $ = S;
+        if (x.push(String.fromCharCode.apply(null, $)), !k) return x.join("");
         y = y.subarray(_), _ = 0, C = 0;
       }
       var A = y[_++];
       if (!(A & 128)) O[C++] = A;
       else if ((A & 224) === 192) {
-        var B = y[_++] & 63;
-        O[C++] = (A & 31) << 6 | B;
+        var I = y[_++] & 63;
+        O[C++] = (A & 31) << 6 | I;
       } else if ((A & 240) === 224) {
-        var B = y[_++] & 63, M = y[_++] & 63;
-        O[C++] = (A & 31) << 12 | B << 6 | M;
+        var I = y[_++] & 63, M = y[_++] & 63;
+        O[C++] = (A & 31) << 12 | I << 6 | M;
       } else if ((A & 248) === 240) {
-        var B = y[_++] & 63, M = y[_++] & 63, U = y[_++] & 63, Z = (A & 7) << 18 | B << 12 | M << 6 | U;
-        Z > 65535 && (Z -= 65536, O[C++] = Z >>> 10 & 1023 | 55296, Z = 56320 | Z & 1023), O[C++] = Z;
+        var I = y[_++] & 63, M = y[_++] & 63, H = y[_++] & 63, Y = (A & 7) << 18 | I << 12 | M << 6 | H;
+        Y > 65535 && (Y -= 65536, O[C++] = Y >>> 10 & 1023 | 55296, Y = 56320 | Y & 1023), O[C++] = Y;
       }
     }
   }
@@ -75,8 +75,8 @@ function gh(e) {
       }
       if (O + 4 > C.length) {
         x += 8, x *= 1 + _ / y.length * 2, x = x >>> 3 << 3;
-        var P = new Uint8Array(x);
-        P.set(C), C = P;
+        var $ = new Uint8Array(x);
+        $.set(C), C = $;
       }
       if (k & 4294967168)
         if (!(k & 4294965248)) C[O++] = k >>> 6 & 31 | 192;
@@ -1220,14 +1220,14 @@ ws.write = function(e, t, r, n, i, a) {
           return Ye(this, f, h);
         case "utf8":
         case "utf-8":
-          return Z(this, f, h);
+          return Y(this, f, h);
         case "ascii":
           return me(this, f, h);
         case "latin1":
         case "binary":
           return be(this, f, h);
         case "base64":
-          return U(this, f, h);
+          return H(this, f, h);
         case "ucs2":
         case "ucs-2":
         case "utf16le":
@@ -1266,7 +1266,7 @@ ws.write = function(e, t, r, n, i, a) {
     return this;
   }, s.prototype.toString = function() {
     const f = this.length;
-    return f === 0 ? "" : arguments.length === 0 ? Z(this, 0, f) : O.apply(this, arguments);
+    return f === 0 ? "" : arguments.length === 0 ? Y(this, 0, f) : O.apply(this, arguments);
   }, s.prototype.toLocaleString = s.prototype.toString, s.prototype.equals = function(f) {
     if (!s.isBuffer(f)) throw new TypeError("Argument must be a Buffer");
     return this === f ? !0 : s.compare(this, f) === 0;
@@ -1362,13 +1362,13 @@ ws.write = function(e, t, r, n, i, a) {
     }
     return z;
   }
-  function P(w, f, h, E) {
+  function $(w, f, h, E) {
     return yt(re(f, w.length - h), w, h, E);
   }
   function A(w, f, h, E) {
     return yt(ne(f), w, h, E);
   }
-  function B(w, f, h, E) {
+  function I(w, f, h, E) {
     return yt(_e(f), w, h, E);
   }
   function M(w, f, h, E) {
@@ -1396,13 +1396,13 @@ ws.write = function(e, t, r, n, i, a) {
           return S(this, f, h, E);
         case "utf8":
         case "utf-8":
-          return P(this, f, h, E);
+          return $(this, f, h, E);
         case "ascii":
         case "latin1":
         case "binary":
           return A(this, f, h, E);
         case "base64":
-          return B(this, f, h, E);
+          return I(this, f, h, E);
         case "ucs2":
         case "ucs-2":
         case "utf16le":
@@ -1418,10 +1418,10 @@ ws.write = function(e, t, r, n, i, a) {
       data: Array.prototype.slice.call(this._arr || this, 0)
     };
   };
-  function U(w, f, h) {
+  function H(w, f, h) {
     return f === 0 && h === w.length ? t.fromByteArray(w) : t.fromByteArray(w.slice(f, h));
   }
-  function Z(w, f, h) {
+  function Y(w, f, h) {
     h = Math.min(w.length, h);
     const E = [];
     let T = f;
@@ -1448,16 +1448,16 @@ ws.write = function(e, t, r, n, i, a) {
     }
     return Pe(E);
   }
-  const fe = 4096;
+  const oe = 4096;
   function Pe(w) {
     const f = w.length;
-    if (f <= fe)
+    if (f <= oe)
       return String.fromCharCode.apply(String, w);
     let h = "", E = 0;
     for (; E < f; )
       h += String.fromCharCode.apply(
         String,
-        w.slice(E, E += fe)
+        w.slice(E, E += oe)
       );
     return h;
   }
@@ -1496,32 +1496,32 @@ ws.write = function(e, t, r, n, i, a) {
     const T = this.subarray(f, h);
     return Object.setPrototypeOf(T, s.prototype), T;
   };
-  function le(w, f, h) {
+  function ue(w, f, h) {
     if (w % 1 !== 0 || w < 0) throw new RangeError("offset is not uint");
     if (w + f > h) throw new RangeError("Trying to access beyond buffer length");
   }
   s.prototype.readUintLE = s.prototype.readUIntLE = function(f, h, E) {
-    f = f >>> 0, h = h >>> 0, E || le(f, h, this.length);
+    f = f >>> 0, h = h >>> 0, E || ue(f, h, this.length);
     let T = this[f], j = 1, z = 0;
     for (; ++z < h && (j *= 256); )
       T += this[f + z] * j;
     return T;
   }, s.prototype.readUintBE = s.prototype.readUIntBE = function(f, h, E) {
-    f = f >>> 0, h = h >>> 0, E || le(f, h, this.length);
+    f = f >>> 0, h = h >>> 0, E || ue(f, h, this.length);
     let T = this[f + --h], j = 1;
     for (; h > 0 && (j *= 256); )
       T += this[f + --h] * j;
     return T;
   }, s.prototype.readUint8 = s.prototype.readUInt8 = function(f, h) {
-    return f = f >>> 0, h || le(f, 1, this.length), this[f];
+    return f = f >>> 0, h || ue(f, 1, this.length), this[f];
   }, s.prototype.readUint16LE = s.prototype.readUInt16LE = function(f, h) {
-    return f = f >>> 0, h || le(f, 2, this.length), this[f] | this[f + 1] << 8;
+    return f = f >>> 0, h || ue(f, 2, this.length), this[f] | this[f + 1] << 8;
   }, s.prototype.readUint16BE = s.prototype.readUInt16BE = function(f, h) {
-    return f = f >>> 0, h || le(f, 2, this.length), this[f] << 8 | this[f + 1];
+    return f = f >>> 0, h || ue(f, 2, this.length), this[f] << 8 | this[f + 1];
   }, s.prototype.readUint32LE = s.prototype.readUInt32LE = function(f, h) {
-    return f = f >>> 0, h || le(f, 4, this.length), (this[f] | this[f + 1] << 8 | this[f + 2] << 16) + this[f + 3] * 16777216;
+    return f = f >>> 0, h || ue(f, 4, this.length), (this[f] | this[f + 1] << 8 | this[f + 2] << 16) + this[f + 3] * 16777216;
   }, s.prototype.readUint32BE = s.prototype.readUInt32BE = function(f, h) {
-    return f = f >>> 0, h || le(f, 4, this.length), this[f] * 16777216 + (this[f + 1] << 16 | this[f + 2] << 8 | this[f + 3]);
+    return f = f >>> 0, h || ue(f, 4, this.length), this[f] * 16777216 + (this[f + 1] << 16 | this[f + 2] << 8 | this[f + 3]);
   }, s.prototype.readBigUInt64LE = xe(function(f) {
     f = f >>> 0, V(f, "offset");
     const h = this[f], E = this[f + 7];
@@ -1535,31 +1535,31 @@ ws.write = function(e, t, r, n, i, a) {
     const T = h * 2 ** 24 + this[++f] * 2 ** 16 + this[++f] * 2 ** 8 + this[++f], j = this[++f] * 2 ** 24 + this[++f] * 2 ** 16 + this[++f] * 2 ** 8 + E;
     return (BigInt(T) << BigInt(32)) + BigInt(j);
   }), s.prototype.readIntLE = function(f, h, E) {
-    f = f >>> 0, h = h >>> 0, E || le(f, h, this.length);
+    f = f >>> 0, h = h >>> 0, E || ue(f, h, this.length);
     let T = this[f], j = 1, z = 0;
     for (; ++z < h && (j *= 256); )
       T += this[f + z] * j;
     return j *= 128, T >= j && (T -= Math.pow(2, 8 * h)), T;
   }, s.prototype.readIntBE = function(f, h, E) {
-    f = f >>> 0, h = h >>> 0, E || le(f, h, this.length);
+    f = f >>> 0, h = h >>> 0, E || ue(f, h, this.length);
     let T = h, j = 1, z = this[f + --T];
     for (; T > 0 && (j *= 256); )
       z += this[f + --T] * j;
     return j *= 128, z >= j && (z -= Math.pow(2, 8 * h)), z;
   }, s.prototype.readInt8 = function(f, h) {
-    return f = f >>> 0, h || le(f, 1, this.length), this[f] & 128 ? (255 - this[f] + 1) * -1 : this[f];
+    return f = f >>> 0, h || ue(f, 1, this.length), this[f] & 128 ? (255 - this[f] + 1) * -1 : this[f];
   }, s.prototype.readInt16LE = function(f, h) {
-    f = f >>> 0, h || le(f, 2, this.length);
+    f = f >>> 0, h || ue(f, 2, this.length);
     const E = this[f] | this[f + 1] << 8;
     return E & 32768 ? E | 4294901760 : E;
   }, s.prototype.readInt16BE = function(f, h) {
-    f = f >>> 0, h || le(f, 2, this.length);
+    f = f >>> 0, h || ue(f, 2, this.length);
     const E = this[f + 1] | this[f] << 8;
     return E & 32768 ? E | 4294901760 : E;
   }, s.prototype.readInt32LE = function(f, h) {
-    return f = f >>> 0, h || le(f, 4, this.length), this[f] | this[f + 1] << 8 | this[f + 2] << 16 | this[f + 3] << 24;
+    return f = f >>> 0, h || ue(f, 4, this.length), this[f] | this[f + 1] << 8 | this[f + 2] << 16 | this[f + 3] << 24;
   }, s.prototype.readInt32BE = function(f, h) {
-    return f = f >>> 0, h || le(f, 4, this.length), this[f] << 24 | this[f + 1] << 16 | this[f + 2] << 8 | this[f + 3];
+    return f = f >>> 0, h || ue(f, 4, this.length), this[f] << 24 | this[f + 1] << 16 | this[f + 2] << 8 | this[f + 3];
   }, s.prototype.readBigInt64LE = xe(function(f) {
     f = f >>> 0, V(f, "offset");
     const h = this[f], E = this[f + 7];
@@ -1574,13 +1574,13 @@ ws.write = function(e, t, r, n, i, a) {
     this[++f] * 2 ** 16 + this[++f] * 2 ** 8 + this[++f];
     return (BigInt(T) << BigInt(32)) + BigInt(this[++f] * 2 ** 24 + this[++f] * 2 ** 16 + this[++f] * 2 ** 8 + E);
   }), s.prototype.readFloatLE = function(f, h) {
-    return f = f >>> 0, h || le(f, 4, this.length), r.read(this, f, !0, 23, 4);
+    return f = f >>> 0, h || ue(f, 4, this.length), r.read(this, f, !0, 23, 4);
   }, s.prototype.readFloatBE = function(f, h) {
-    return f = f >>> 0, h || le(f, 4, this.length), r.read(this, f, !1, 23, 4);
+    return f = f >>> 0, h || ue(f, 4, this.length), r.read(this, f, !1, 23, 4);
   }, s.prototype.readDoubleLE = function(f, h) {
-    return f = f >>> 0, h || le(f, 8, this.length), r.read(this, f, !0, 52, 8);
+    return f = f >>> 0, h || ue(f, 8, this.length), r.read(this, f, !0, 52, 8);
   }, s.prototype.readDoubleBE = function(f, h) {
-    return f = f >>> 0, h || le(f, 8, this.length), r.read(this, f, !1, 52, 8);
+    return f = f >>> 0, h || ue(f, 8, this.length), r.read(this, f, !1, 52, 8);
   };
   function F(w, f, h, E, T, j) {
     if (!s.isBuffer(w)) throw new TypeError('"buffer" argument must be a Buffer instance');
@@ -1671,13 +1671,13 @@ ws.write = function(e, t, r, n, i, a) {
     if (h + E > w.length) throw new RangeError("Index out of range");
     if (h < 0) throw new RangeError("Index out of range");
   }
-  function I(w, f, h, E, T) {
+  function B(w, f, h, E, T) {
     return f = +f, h = h >>> 0, T || ee(w, f, h, 4), r.write(w, f, h, E, 23, 4), h + 4;
   }
   s.prototype.writeFloatLE = function(f, h, E) {
-    return I(this, f, h, !0, E);
+    return B(this, f, h, !0, E);
   }, s.prototype.writeFloatBE = function(f, h, E) {
-    return I(this, f, h, !1, E);
+    return B(this, f, h, !1, E);
   };
   function Q(w, f, h, E, T) {
     return f = +f, h = h >>> 0, T || ee(w, f, h, 8), r.write(w, f, h, E, 52, 8), h + 8;
@@ -1782,7 +1782,7 @@ ws.write = function(e, t, r, n, i, a) {
       f = `_${w.slice(h - 3, h)}${f}`;
     return `${w.slice(0, h)}${f}`;
   }
-  function Y(w, f, h) {
+  function Z(w, f, h) {
     V(f, "offset"), (w[f] === void 0 || w[f + h] === void 0) && te(f, w.length - (h + 1));
   }
   function L(w, f, h, E, T, j) {
@@ -1791,7 +1791,7 @@ ws.write = function(e, t, r, n, i, a) {
       let he;
       throw f === 0 || f === BigInt(0) ? he = `>= 0${z} and < 2${z} ** ${(j + 1) * 8}${z}` : he = `>= -(2${z} ** ${(j + 1) * 8 - 1}${z}) and < 2 ** ${(j + 1) * 8 - 1}${z}`, new D.ERR_OUT_OF_RANGE("value", he, w);
     }
-    Y(E, T, j);
+    Z(E, T, j);
   }
   function V(w, f) {
     if (typeof w != "number")
@@ -1805,7 +1805,7 @@ ws.write = function(e, t, r, n, i, a) {
     );
   }
   const J = /[^+/0-9A-Za-z-_]/g;
-  function oe(w) {
+  function se(w) {
     if (w = w.split("=")[0], w = w.trim().replace(J, ""), w.length < 2) return "";
     for (; w.length % 4 !== 0; )
       w = w + "=";
@@ -1879,7 +1879,7 @@ ws.write = function(e, t, r, n, i, a) {
     return j;
   }
   function _e(w) {
-    return t.toByteArray(oe(w));
+    return t.toByteArray(se(w));
   }
   function yt(w, f, h, E) {
     let T;
@@ -2396,33 +2396,33 @@ var N = Jr, ku = {};
   })(function(t) {
     t.version = "1.2.2";
     function r() {
-      for (var S = 0, P = new Array(256), A = 0; A != 256; ++A)
-        S = A, S = S & 1 ? -306674912 ^ S >>> 1 : S >>> 1, S = S & 1 ? -306674912 ^ S >>> 1 : S >>> 1, S = S & 1 ? -306674912 ^ S >>> 1 : S >>> 1, S = S & 1 ? -306674912 ^ S >>> 1 : S >>> 1, S = S & 1 ? -306674912 ^ S >>> 1 : S >>> 1, S = S & 1 ? -306674912 ^ S >>> 1 : S >>> 1, S = S & 1 ? -306674912 ^ S >>> 1 : S >>> 1, S = S & 1 ? -306674912 ^ S >>> 1 : S >>> 1, P[A] = S;
-      return typeof Int32Array < "u" ? new Int32Array(P) : P;
+      for (var S = 0, $ = new Array(256), A = 0; A != 256; ++A)
+        S = A, S = S & 1 ? -306674912 ^ S >>> 1 : S >>> 1, S = S & 1 ? -306674912 ^ S >>> 1 : S >>> 1, S = S & 1 ? -306674912 ^ S >>> 1 : S >>> 1, S = S & 1 ? -306674912 ^ S >>> 1 : S >>> 1, S = S & 1 ? -306674912 ^ S >>> 1 : S >>> 1, S = S & 1 ? -306674912 ^ S >>> 1 : S >>> 1, S = S & 1 ? -306674912 ^ S >>> 1 : S >>> 1, S = S & 1 ? -306674912 ^ S >>> 1 : S >>> 1, $[A] = S;
+      return typeof Int32Array < "u" ? new Int32Array($) : $;
     }
     var n = r();
     function i(S) {
-      var P = 0, A = 0, B = 0, M = typeof Int32Array < "u" ? new Int32Array(4096) : new Array(4096);
-      for (B = 0; B != 256; ++B) M[B] = S[B];
-      for (B = 0; B != 256; ++B)
-        for (A = S[B], P = 256 + B; P < 4096; P += 256) A = M[P] = A >>> 8 ^ S[A & 255];
-      var U = [];
-      for (B = 1; B != 16; ++B) U[B - 1] = typeof Int32Array < "u" ? M.subarray(B * 256, B * 256 + 256) : M.slice(B * 256, B * 256 + 256);
-      return U;
+      var $ = 0, A = 0, I = 0, M = typeof Int32Array < "u" ? new Int32Array(4096) : new Array(4096);
+      for (I = 0; I != 256; ++I) M[I] = S[I];
+      for (I = 0; I != 256; ++I)
+        for (A = S[I], $ = 256 + I; $ < 4096; $ += 256) A = M[$] = A >>> 8 ^ S[A & 255];
+      var H = [];
+      for (I = 1; I != 16; ++I) H[I - 1] = typeof Int32Array < "u" ? M.subarray(I * 256, I * 256 + 256) : M.slice(I * 256, I * 256 + 256);
+      return H;
     }
     var a = i(n), o = a[0], s = a[1], l = a[2], c = a[3], u = a[4], d = a[5], p = a[6], m = a[7], g = a[8], b = a[9], v = a[10], y = a[11], _ = a[12], R = a[13], O = a[14];
-    function x(S, P) {
-      for (var A = P ^ -1, B = 0, M = S.length; B < M; ) A = A >>> 8 ^ n[(A ^ S.charCodeAt(B++)) & 255];
+    function x(S, $) {
+      for (var A = $ ^ -1, I = 0, M = S.length; I < M; ) A = A >>> 8 ^ n[(A ^ S.charCodeAt(I++)) & 255];
       return ~A;
     }
-    function C(S, P) {
-      for (var A = P ^ -1, B = S.length - 15, M = 0; M < B; ) A = O[S[M++] ^ A & 255] ^ R[S[M++] ^ A >> 8 & 255] ^ _[S[M++] ^ A >> 16 & 255] ^ y[S[M++] ^ A >>> 24] ^ v[S[M++]] ^ b[S[M++]] ^ g[S[M++]] ^ m[S[M++]] ^ p[S[M++]] ^ d[S[M++]] ^ u[S[M++]] ^ c[S[M++]] ^ l[S[M++]] ^ s[S[M++]] ^ o[S[M++]] ^ n[S[M++]];
-      for (B += 15; M < B; ) A = A >>> 8 ^ n[(A ^ S[M++]) & 255];
+    function C(S, $) {
+      for (var A = $ ^ -1, I = S.length - 15, M = 0; M < I; ) A = O[S[M++] ^ A & 255] ^ R[S[M++] ^ A >> 8 & 255] ^ _[S[M++] ^ A >> 16 & 255] ^ y[S[M++] ^ A >>> 24] ^ v[S[M++]] ^ b[S[M++]] ^ g[S[M++]] ^ m[S[M++]] ^ p[S[M++]] ^ d[S[M++]] ^ u[S[M++]] ^ c[S[M++]] ^ l[S[M++]] ^ s[S[M++]] ^ o[S[M++]] ^ n[S[M++]];
+      for (I += 15; M < I; ) A = A >>> 8 ^ n[(A ^ S[M++]) & 255];
       return ~A;
     }
-    function k(S, P) {
-      for (var A = P ^ -1, B = 0, M = S.length, U = 0, Z = 0; B < M; )
-        U = S.charCodeAt(B++), U < 128 ? A = A >>> 8 ^ n[(A ^ U) & 255] : U < 2048 ? (A = A >>> 8 ^ n[(A ^ (192 | U >> 6 & 31)) & 255], A = A >>> 8 ^ n[(A ^ (128 | U & 63)) & 255]) : U >= 55296 && U < 57344 ? (U = (U & 1023) + 64, Z = S.charCodeAt(B++) & 1023, A = A >>> 8 ^ n[(A ^ (240 | U >> 8 & 7)) & 255], A = A >>> 8 ^ n[(A ^ (128 | U >> 2 & 63)) & 255], A = A >>> 8 ^ n[(A ^ (128 | Z >> 6 & 15 | (U & 3) << 4)) & 255], A = A >>> 8 ^ n[(A ^ (128 | Z & 63)) & 255]) : (A = A >>> 8 ^ n[(A ^ (224 | U >> 12 & 15)) & 255], A = A >>> 8 ^ n[(A ^ (128 | U >> 6 & 63)) & 255], A = A >>> 8 ^ n[(A ^ (128 | U & 63)) & 255]);
+    function k(S, $) {
+      for (var A = $ ^ -1, I = 0, M = S.length, H = 0, Y = 0; I < M; )
+        H = S.charCodeAt(I++), H < 128 ? A = A >>> 8 ^ n[(A ^ H) & 255] : H < 2048 ? (A = A >>> 8 ^ n[(A ^ (192 | H >> 6 & 31)) & 255], A = A >>> 8 ^ n[(A ^ (128 | H & 63)) & 255]) : H >= 55296 && H < 57344 ? (H = (H & 1023) + 64, Y = S.charCodeAt(I++) & 1023, A = A >>> 8 ^ n[(A ^ (240 | H >> 8 & 7)) & 255], A = A >>> 8 ^ n[(A ^ (128 | H >> 2 & 63)) & 255], A = A >>> 8 ^ n[(A ^ (128 | Y >> 6 & 15 | (H & 3) << 4)) & 255], A = A >>> 8 ^ n[(A ^ (128 | Y & 63)) & 255]) : (A = A >>> 8 ^ n[(A ^ (224 | H >> 12 & 15)) & 255], A = A >>> 8 ^ n[(A ^ (128 | H >> 6 & 63)) & 255], A = A >>> 8 ^ n[(A ^ (128 | H & 63)) & 255]);
       return ~A;
     }
     t.table = n, t.bstr = x, t.buf = C, t.str = k;
@@ -2520,11 +2520,11 @@ function Bu(e) {
 function Yn(e, t) {
   e.pending_buf[e.pending++] = t & 255, e.pending_buf[e.pending++] = t >>> 8 & 255;
 }
-function ct(e, t, r) {
+function lt(e, t, r) {
   e.bi_valid > Ka - r ? (e.bi_buf |= t << e.bi_valid & 65535, Yn(e, e.bi_buf), e.bi_buf = t >> Ka - e.bi_valid, e.bi_valid += r - Ka) : (e.bi_buf |= t << e.bi_valid & 65535, e.bi_valid += r);
 }
 function Nt(e, t, r) {
-  ct(
+  lt(
     e,
     r[t * 2],
     r[t * 2 + 1]
@@ -2621,7 +2621,7 @@ function Ec(e, t, r) {
   var n, i, a = 0, o, s;
   if (e.last_lit !== 0)
     do
-      n = e.pending_buf[e.d_buf + a * 2] << 8 | e.pending_buf[e.d_buf + a * 2 + 1], i = e.pending_buf[e.l_buf + a], a++, n === 0 ? Nt(e, i, t) : (o = Gn[i], Nt(e, o + ri + 1, t), s = jo[o], s !== 0 && (i -= vs[o], ct(e, i, s)), n--, o = Bu(n), Nt(e, o, r), s = Wi[o], s !== 0 && (n -= Ji[o], ct(e, n, s)));
+      n = e.pending_buf[e.d_buf + a * 2] << 8 | e.pending_buf[e.d_buf + a * 2 + 1], i = e.pending_buf[e.l_buf + a], a++, n === 0 ? Nt(e, i, t) : (o = Gn[i], Nt(e, o + ri + 1, t), s = jo[o], s !== 0 && (i -= vs[o], lt(e, i, s)), n--, o = Bu(n), Nt(e, o, r), s = Wi[o], s !== 0 && (n -= Ji[o], lt(e, n, s)));
     while (a < e.last_lit);
   Nt(e, _s, t);
 }
@@ -2677,7 +2677,7 @@ function kc(e, t, r) {
         do
           Nt(e, a, e.bl_tree);
         while (--s !== 0);
-      else a !== 0 ? (a !== i && (Nt(e, a, e.bl_tree), s--), Nt(e, Cu, e.bl_tree), ct(e, s - 3, 2)) : s <= 10 ? (Nt(e, Pu, e.bl_tree), ct(e, s - 3, 3)) : (Nt(e, $u, e.bl_tree), ct(e, s - 11, 7));
+      else a !== 0 ? (a !== i && (Nt(e, a, e.bl_tree), s--), Nt(e, Cu, e.bl_tree), lt(e, s - 3, 2)) : s <= 10 ? (Nt(e, Pu, e.bl_tree), lt(e, s - 3, 3)) : (Nt(e, $u, e.bl_tree), lt(e, s - 11, 7));
       s = 0, i = a, o === 0 ? (l = 138, c = 3) : a === o ? (l = 6, c = 3) : (l = 7, c = 4);
     }
 }
@@ -2689,8 +2689,8 @@ function e0(e) {
 }
 function t0(e, t, r, n) {
   var i;
-  for (ct(e, t - 257, 5), ct(e, r - 1, 5), ct(e, n - 4, 4), i = 0; i < n; i++)
-    ct(e, e.bl_tree[Tu[i] * 2 + 1], 3);
+  for (lt(e, t - 257, 5), lt(e, r - 1, 5), lt(e, n - 4, 4), i = 0; i < n; i++)
+    lt(e, e.bl_tree[Tu[i] * 2 + 1], 3);
   kc(e, e.dyn_ltree, t - 1), kc(e, e.dyn_dtree, r - 1);
 }
 function r0(e) {
@@ -2710,14 +2710,14 @@ function n0(e) {
   Rc || (Jp(), Rc = !0), e.l_desc = new Qa(e.dyn_ltree, Au), e.d_desc = new Qa(e.dyn_dtree, Du), e.bl_desc = new Qa(e.bl_tree, Iu), e.bi_buf = 0, e.bi_valid = 0, Nu(e);
 }
 function Lu(e, t, r, n) {
-  ct(e, (Hp << 1) + (n ? 1 : 0), 3), Qp(e, t, r);
+  lt(e, (Hp << 1) + (n ? 1 : 0), 3), Qp(e, t, r);
 }
 function i0(e) {
-  ct(e, Ru << 1, 3), Nt(e, _s, Yt), Vp(e);
+  lt(e, Ru << 1, 3), Nt(e, _s, Yt), Vp(e);
 }
 function a0(e, t, r, n) {
   var i, a, o = 0;
-  e.level > 0 ? (e.strm.data_type === Up && (e.strm.data_type = r0(e)), zo(e, e.l_desc), zo(e, e.d_desc), o = e0(e), i = e.opt_len + 3 + 7 >>> 3, a = e.static_len + 3 + 7 >>> 3, a <= i && (i = a)) : i = a = r + 5, r + 4 <= i && t !== -1 ? Lu(e, t, r, n) : e.strategy === Fp || a === i ? (ct(e, (Ru << 1) + (n ? 1 : 0), 3), Ec(e, Yt, zn)) : (ct(e, (Wp << 1) + (n ? 1 : 0), 3), t0(e, e.l_desc.max_code + 1, e.d_desc.max_code + 1, o + 1), Ec(e, e.dyn_ltree, e.dyn_dtree)), Nu(e), n && Mu(e);
+  e.level > 0 ? (e.strm.data_type === Up && (e.strm.data_type = r0(e)), zo(e, e.l_desc), zo(e, e.d_desc), o = e0(e), i = e.opt_len + 3 + 7 >>> 3, a = e.static_len + 3 + 7 >>> 3, a <= i && (i = a)) : i = a = r + 5, r + 4 <= i && t !== -1 ? Lu(e, t, r, n) : e.strategy === Fp || a === i ? (lt(e, (Ru << 1) + (n ? 1 : 0), 3), Ec(e, Yt, zn)) : (lt(e, (Wp << 1) + (n ? 1 : 0), 3), t0(e, e.l_desc.max_code + 1, e.d_desc.max_code + 1, o + 1), Ec(e, e.dyn_ltree, e.dyn_dtree)), Nu(e), n && Mu(e);
 }
 function o0(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[(Gn[r] + ri + 1) * 2]++, e.dyn_dtree[Bu(t) * 2]++), e.last_lit === e.lit_bufsize - 1;
@@ -3218,15 +3218,15 @@ ti.deflate = Es;
 ti.deflateRaw = X0;
 ti.gzip = V0;
 var ii = {}, Ct = {}, $i = 30, K0 = 12, J0 = function(t, r) {
-  var n, i, a, o, s, l, c, u, d, p, m, g, b, v, y, _, R, O, x, C, k, S, P, A, B;
-  n = t.state, i = t.next_in, A = t.input, a = i + (t.avail_in - 5), o = t.next_out, B = t.output, s = o - (r - t.avail_out), l = o + (t.avail_out - 257), c = n.dmax, u = n.wsize, d = n.whave, p = n.wnext, m = n.window, g = n.hold, b = n.bits, v = n.lencode, y = n.distcode, _ = (1 << n.lenbits) - 1, R = (1 << n.distbits) - 1;
+  var n, i, a, o, s, l, c, u, d, p, m, g, b, v, y, _, R, O, x, C, k, S, $, A, I;
+  n = t.state, i = t.next_in, A = t.input, a = i + (t.avail_in - 5), o = t.next_out, I = t.output, s = o - (r - t.avail_out), l = o + (t.avail_out - 257), c = n.dmax, u = n.wsize, d = n.whave, p = n.wnext, m = n.window, g = n.hold, b = n.bits, v = n.lencode, y = n.distcode, _ = (1 << n.lenbits) - 1, R = (1 << n.distbits) - 1;
   e:
     do {
       b < 15 && (g += A[i++] << b, b += 8, g += A[i++] << b, b += 8), O = v[g & _];
       t:
         for (; ; ) {
           if (x = O >>> 24, g >>>= x, b -= x, x = O >>> 16 & 255, x === 0)
-            B[o++] = O & 65535;
+            I[o++] = O & 65535;
           else if (x & 16) {
             C = O & 65535, x &= 15, x && (b < x && (g += A[i++] << b, b += 8), C += g & (1 << x) - 1, g >>>= x, b -= x), b < 15 && (g += A[i++] << b, b += 8, g += A[i++] << b, b += 8), O = y[g & R];
             r:
@@ -3241,44 +3241,44 @@ var ii = {}, Ct = {}, $i = 30, K0 = 12, J0 = function(t, r) {
                       t.msg = "invalid distance too far back", n.mode = $i;
                       break e;
                     }
-                    if (S = 0, P = m, p === 0) {
+                    if (S = 0, $ = m, p === 0) {
                       if (S += u - x, x < C) {
                         C -= x;
                         do
-                          B[o++] = m[S++];
+                          I[o++] = m[S++];
                         while (--x);
-                        S = o - k, P = B;
+                        S = o - k, $ = I;
                       }
                     } else if (p < x) {
                       if (S += u + p - x, x -= p, x < C) {
                         C -= x;
                         do
-                          B[o++] = m[S++];
+                          I[o++] = m[S++];
                         while (--x);
                         if (S = 0, p < C) {
                           x = p, C -= x;
                           do
-                            B[o++] = m[S++];
+                            I[o++] = m[S++];
                           while (--x);
-                          S = o - k, P = B;
+                          S = o - k, $ = I;
                         }
                       }
                     } else if (S += p - x, x < C) {
                       C -= x;
                       do
-                        B[o++] = m[S++];
+                        I[o++] = m[S++];
                       while (--x);
-                      S = o - k, P = B;
+                      S = o - k, $ = I;
                     }
                     for (; C > 2; )
-                      B[o++] = P[S++], B[o++] = P[S++], B[o++] = P[S++], C -= 3;
-                    C && (B[o++] = P[S++], C > 1 && (B[o++] = P[S++]));
+                      I[o++] = $[S++], I[o++] = $[S++], I[o++] = $[S++], C -= 3;
+                    C && (I[o++] = $[S++], C > 1 && (I[o++] = $[S++]));
                   } else {
                     S = o - k;
                     do
-                      B[o++] = B[S++], B[o++] = B[S++], B[o++] = B[S++], C -= 3;
+                      I[o++] = I[S++], I[o++] = I[S++], I[o++] = I[S++], C -= 3;
                     while (C > 2);
-                    C && (B[o++] = B[S++], C > 1 && (B[o++] = B[S++]));
+                    C && (I[o++] = I[S++], C > 1 && (I[o++] = I[S++]));
                   }
                 } else if (x & 64) {
                   t.msg = "invalid distance code", n.mode = $i;
@@ -3440,7 +3440,7 @@ var ii = {}, Ct = {}, $i = 30, K0 = 12, J0 = function(t, r) {
   64,
   64
 ], nm = function(t, r, n, i, a, o, s, l) {
-  var c = l.bits, u = 0, d = 0, p = 0, m = 0, g = 0, b = 0, v = 0, y = 0, _ = 0, R = 0, O, x, C, k, S, P = null, A = 0, B, M = new Ac.Buf16(Wr + 1), U = new Ac.Buf16(Wr + 1), Z = null, fe = 0, Pe, me, be;
+  var c = l.bits, u = 0, d = 0, p = 0, m = 0, g = 0, b = 0, v = 0, y = 0, _ = 0, R = 0, O, x, C, k, S, $ = null, A = 0, I, M = new Ac.Buf16(Wr + 1), H = new Ac.Buf16(Wr + 1), Y = null, oe = 0, Pe, me, be;
   for (u = 0; u <= Wr; u++)
     M[u] = 0;
   for (d = 0; d < i; d++)
@@ -3456,14 +3456,14 @@ var ii = {}, Ct = {}, $i = 30, K0 = 12, J0 = function(t, r) {
       return -1;
   if (y > 0 && (t === Bc || m !== 1))
     return -1;
-  for (U[1] = 0, u = 1; u < Wr; u++)
-    U[u + 1] = U[u] + M[u];
+  for (H[1] = 0, u = 1; u < Wr; u++)
+    H[u + 1] = H[u] + M[u];
   for (d = 0; d < i; d++)
-    r[n + d] !== 0 && (s[U[r[n + d]]++] = d);
-  if (t === Bc ? (P = Z = s, B = 19) : t === io ? (P = Q0, A -= 257, Z = em, fe -= 257, B = 256) : (P = tm, Z = rm, B = -1), R = 0, d = 0, u = p, S = o, b = g, v = 0, C = -1, _ = 1 << g, k = _ - 1, t === io && _ > Dc || t === jc && _ > Ic)
+    r[n + d] !== 0 && (s[H[r[n + d]]++] = d);
+  if (t === Bc ? ($ = Y = s, I = 19) : t === io ? ($ = Q0, A -= 257, Y = em, oe -= 257, I = 256) : ($ = tm, Y = rm, I = -1), R = 0, d = 0, u = p, S = o, b = g, v = 0, C = -1, _ = 1 << g, k = _ - 1, t === io && _ > Dc || t === jc && _ > Ic)
     return 1;
   for (; ; ) {
-    Pe = u - v, s[d] < B ? (me = 0, be = s[d]) : s[d] > B ? (me = Z[fe + s[d]], be = P[A + s[d]]) : (me = 96, be = 0), O = 1 << u - v, x = 1 << b, p = x;
+    Pe = u - v, s[d] < I ? (me = 0, be = s[d]) : s[d] > I ? (me = Y[oe + s[d]], be = $[A + s[d]]) : (me = 96, be = 0), O = 1 << u - v, x = 1 << b, p = x;
     do
       x -= O, a[S + (R >> v) + x] = Pe << 24 | me << 16 | be | 0;
     while (x !== 0);
@@ -3532,7 +3532,7 @@ function uf(e, t, r, n) {
   return a.window === null && (a.wsize = 1 << a.wbits, a.wnext = 0, a.whave = 0, a.window = new mt.Buf8(a.wsize)), n >= a.wsize ? (mt.arraySet(a.window, t, r - a.wsize, a.wsize, 0), a.wnext = 0, a.whave = a.wsize) : (i = a.wsize - a.wnext, i > n && (i = n), mt.arraySet(a.window, t, r - n, i, a.wnext), n -= i, n ? (mt.arraySet(a.window, t, r - n, n, 0), a.wnext = n, a.whave = a.wsize) : (a.wnext += i, a.wnext === a.wsize && (a.wnext = 0), a.whave < a.wsize && (a.whave += i))), 0;
 }
 function ym(e, t) {
-  var r, n, i, a, o, s, l, c, u, d, p, m, g, b, v = 0, y, _, R, O, x, C, k, S, P = new mt.Buf8(4), A, B, M = (
+  var r, n, i, a, o, s, l, c, u, d, p, m, g, b, v = 0, y, _, R, O, x, C, k, S, $ = new mt.Buf8(4), A, I, M = (
     /* permutation of code lengths */
     [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]
   );
@@ -3553,7 +3553,7 @@ function ym(e, t) {
             s--, c += n[a++] << u, u += 8;
           }
           if (r.wrap & 2 && c === 35615) {
-            r.check = 0, P[0] = c & 255, P[1] = c >>> 8 & 255, r.check = Dt(r.check, P, 2, 0), c = 0, u = 0, r.mode = Mc;
+            r.check = 0, $[0] = c & 255, $[1] = c >>> 8 & 255, r.check = Dt(r.check, $, 2, 0), c = 0, u = 0, r.mode = Mc;
             break;
           }
           if (r.flags = 0, r.head && (r.head.done = !1), !(r.wrap & 1) || /* check if zlib header allowed */
@@ -3587,21 +3587,21 @@ function ym(e, t) {
             e.msg = "unknown header flags set", r.mode = Te;
             break;
           }
-          r.head && (r.head.text = c >> 8 & 1), r.flags & 512 && (P[0] = c & 255, P[1] = c >>> 8 & 255, r.check = Dt(r.check, P, 2, 0)), c = 0, u = 0, r.mode = Lc;
+          r.head && (r.head.text = c >> 8 & 1), r.flags & 512 && ($[0] = c & 255, $[1] = c >>> 8 & 255, r.check = Dt(r.check, $, 2, 0)), c = 0, u = 0, r.mode = Lc;
         case Lc:
           for (; u < 32; ) {
             if (s === 0)
               break e;
             s--, c += n[a++] << u, u += 8;
           }
-          r.head && (r.head.time = c), r.flags & 512 && (P[0] = c & 255, P[1] = c >>> 8 & 255, P[2] = c >>> 16 & 255, P[3] = c >>> 24 & 255, r.check = Dt(r.check, P, 4, 0)), c = 0, u = 0, r.mode = Fc;
+          r.head && (r.head.time = c), r.flags & 512 && ($[0] = c & 255, $[1] = c >>> 8 & 255, $[2] = c >>> 16 & 255, $[3] = c >>> 24 & 255, r.check = Dt(r.check, $, 4, 0)), c = 0, u = 0, r.mode = Fc;
         case Fc:
           for (; u < 16; ) {
             if (s === 0)
               break e;
             s--, c += n[a++] << u, u += 8;
           }
-          r.head && (r.head.xflags = c & 255, r.head.os = c >> 8), r.flags & 512 && (P[0] = c & 255, P[1] = c >>> 8 & 255, r.check = Dt(r.check, P, 2, 0)), c = 0, u = 0, r.mode = Uc;
+          r.head && (r.head.xflags = c & 255, r.head.os = c >> 8), r.flags & 512 && ($[0] = c & 255, $[1] = c >>> 8 & 255, r.check = Dt(r.check, $, 2, 0)), c = 0, u = 0, r.mode = Uc;
         case Uc:
           if (r.flags & 1024) {
             for (; u < 16; ) {
@@ -3609,7 +3609,7 @@ function ym(e, t) {
                 break e;
               s--, c += n[a++] << u, u += 8;
             }
-            r.length = c, r.head && (r.head.extra_len = c), r.flags & 512 && (P[0] = c & 255, P[1] = c >>> 8 & 255, r.check = Dt(r.check, P, 2, 0)), c = 0, u = 0;
+            r.length = c, r.head && (r.head.extra_len = c), r.flags & 512 && ($[0] = c & 255, $[1] = c >>> 8 & 255, r.check = Dt(r.check, $, 2, 0)), c = 0, u = 0;
           } else r.head && (r.head.extra = null);
           r.mode = Hc;
         case Hc:
@@ -3767,7 +3767,7 @@ function ym(e, t) {
               c >>>= y, u -= y, r.lens[r.have++] = R;
             else {
               if (R === 16) {
-                for (B = y + 2; u < B; ) {
+                for (I = y + 2; u < I; ) {
                   if (s === 0)
                     break e;
                   s--, c += n[a++] << u, u += 8;
@@ -3778,14 +3778,14 @@ function ym(e, t) {
                 }
                 k = r.lens[r.have - 1], m = 3 + (c & 3), c >>>= 2, u -= 2;
               } else if (R === 17) {
-                for (B = y + 3; u < B; ) {
+                for (I = y + 3; u < I; ) {
                   if (s === 0)
                     break e;
                   s--, c += n[a++] << u, u += 8;
                 }
                 c >>>= y, u -= y, k = 0, m = 3 + (c & 7), c >>>= 3, u -= 3;
               } else {
-                for (B = y + 7; u < B; ) {
+                for (I = y + 7; u < I; ) {
                   if (s === 0)
                     break e;
                   s--, c += n[a++] << u, u += 8;
@@ -3851,7 +3851,7 @@ function ym(e, t) {
           r.extra = _ & 15, r.mode = Qc;
         case Qc:
           if (r.extra) {
-            for (B = r.extra; u < B; ) {
+            for (I = r.extra; u < I; ) {
               if (s === 0)
                 break e;
               s--, c += n[a++] << u, u += 8;
@@ -3880,7 +3880,7 @@ function ym(e, t) {
           r.offset = R, r.extra = _ & 15, r.mode = tl;
         case tl:
           if (r.extra) {
-            for (B = r.extra; u < B; ) {
+            for (I = r.extra; u < I; ) {
               if (s === 0)
                 break e;
               s--, c += n[a++] << u, u += 8;
@@ -4433,27 +4433,27 @@ const Ft = /* @__PURE__ */ Ot(rw);
 var nw = function(e, t) {
   var r = e, n = t, i = r.length, a = n.length, o = !1, s = null, l = i + 1, c = [], u = [], d = [], p = "", m = -1, g = 0, b = 1, v, y, _ = function() {
     i >= a && (v = r, y = i, r = n, n = v, i = a, a = y, o = !0, l = i + 1);
-  }, R = function(k, S, P) {
+  }, R = function(k, S, $) {
     return {
       x: k,
       y: S,
-      k: P
+      k: $
     };
   }, O = function(k, S) {
     return {
       elem: k,
       t: S
     };
-  }, x = function(k, S, P) {
-    var A, B, M;
-    for (S > P ? A = c[k - 1 + l] : A = c[k + 1 + l], M = Math.max(S, P), B = M - k; B < i && M < a && r[B] === n[M]; )
-      ++B, ++M;
-    return c[k + l] = u.length, u[u.length] = new R(B, M, A), M;
+  }, x = function(k, S, $) {
+    var A, I, M;
+    for (S > $ ? A = c[k - 1 + l] : A = c[k + 1 + l], M = Math.max(S, $), I = M - k; I < i && M < a && r[I] === n[M]; )
+      ++I, ++M;
+    return c[k + l] = u.length, u[u.length] = new R(I, M, A), M;
   }, C = function(k) {
-    var S, P, A;
-    for (S = P = 0, A = k.length - 1; A >= 0; --A)
-      for (; S < k[A].x || P < k[A].y; )
-        k[A].y - k[A].x > P - S ? (o ? d[d.length] = new O(n[P], m) : d[d.length] = new O(n[P], b), ++P) : k[A].y - k[A].x < P - S ? (o ? d[d.length] = new O(r[S], b) : d[d.length] = new O(r[S], m), ++S) : (d[d.length] = new O(r[S], g), p += r[S], ++S, ++P);
+    var S, $, A;
+    for (S = $ = 0, A = k.length - 1; A >= 0; --A)
+      for (; S < k[A].x || $ < k[A].y; )
+        k[A].y - k[A].x > $ - S ? (o ? d[d.length] = new O(n[$], m) : d[d.length] = new O(n[$], b), ++$) : k[A].y - k[A].x < $ - S ? (o ? d[d.length] = new O(r[S], b) : d[d.length] = new O(r[S], m), ++S) : (d[d.length] = new O(r[S], g), p += r[S], ++S, ++$);
   };
   return _(), {
     SES_DELETE: -1,
@@ -4469,19 +4469,19 @@ var nw = function(e, t) {
       return d;
     },
     compose: function() {
-      var k, S, P, A, B, M, U, Z;
-      for (k = a - i, S = i + a + 3, P = {}, U = 0; U < S; ++U)
-        P[U] = -1, c[U] = -1;
+      var k, S, $, A, I, M, H, Y;
+      for (k = a - i, S = i + a + 3, $ = {}, H = 0; H < S; ++H)
+        $[H] = -1, c[H] = -1;
       A = -1;
       do {
-        for (++A, Z = -A; Z <= k - 1; ++Z)
-          P[Z + l] = x(Z, P[Z - 1 + l] + 1, P[Z + 1 + l]);
-        for (Z = k + A; Z >= k + 1; --Z)
-          P[Z + l] = x(Z, P[Z - 1 + l] + 1, P[Z + 1 + l]);
-        P[k + l] = x(k, P[k - 1 + l] + 1, P[k + 1 + l]);
-      } while (P[k + l] !== a);
-      for (s = k + 2 * A, B = c[k + l], M = []; B !== -1; )
-        M[M.length] = new R(u[B].x, u[B].y, null), B = u[B].k;
+        for (++A, Y = -A; Y <= k - 1; ++Y)
+          $[Y + l] = x(Y, $[Y - 1 + l] + 1, $[Y + 1 + l]);
+        for (Y = k + A; Y >= k + 1; --Y)
+          $[Y + l] = x(Y, $[Y - 1 + l] + 1, $[Y + 1 + l]);
+        $[k + l] = x(k, $[k - 1 + l] + 1, $[k + 1 + l]);
+      } while ($[k + l] !== a);
+      for (s = k + 2 * A, I = c[k + l], M = []; I !== -1; )
+        M[M.length] = new R(u[I].x, u[I].y, null), I = u[I].k;
       C(M);
     }
   };
@@ -4518,19 +4518,19 @@ function hl(e, t) {
 }
 function ow(e, t, r) {
   var n, i = hl(t, e), a = hl(t, r), o = [];
-  function s(U, Z) {
-    o.push([U.file1[0], Z, U.file1[1], U.file2[0], U.file2[1]]);
+  function s(H, Y) {
+    o.push([H.file1[0], Y, H.file1[1], H.file2[0], H.file2[1]]);
   }
   for (n = 0; n < i.length; n++)
     s(i[n], 0);
   for (n = 0; n < a.length; n++)
     s(a[n], 2);
-  o.sort(function(U, Z) {
-    return U[0] - Z[0];
+  o.sort(function(H, Y) {
+    return H[0] - Y[0];
   });
   var l = [], c = 0;
-  function u(U) {
-    U > c && (l.push([1, c, U - c]), c = U);
+  function u(H) {
+    H > c && (l.push([1, c, H - c]), c = H);
   }
   for (var d = 0; d < o.length; d++) {
     for (var p = d, m = o[d], g = m[0], b = g + m[2]; d < o.length - 1; ) {
@@ -4550,15 +4550,15 @@ function ow(e, t, r) {
         var R = m[1], O = _[R], x = m[0], C = x + m[2], k = m[3], S = k + m[4];
         O[0] = Math.min(k, O[0]), O[1] = Math.max(S, O[1]), O[2] = Math.min(x, O[2]), O[3] = Math.max(C, O[3]);
       }
-      var P = _[0][0] + (g - _[0][2]), A = _[0][1] + (b - _[0][3]), B = _[2][0] + (g - _[2][2]), M = _[2][1] + (b - _[2][3]);
+      var $ = _[0][0] + (g - _[0][2]), A = _[0][1] + (b - _[0][3]), I = _[2][0] + (g - _[2][2]), M = _[2][1] + (b - _[2][3]);
       l.push([
         -1,
-        P,
-        A - P,
+        $,
+        A - $,
         g,
         b - g,
-        B,
-        M - B
+        I,
+        M - I
       ]);
     }
     c = b;
@@ -4631,17 +4631,17 @@ class ai extends we {
   }
 }
 ai.code = "UnmergedPathsError";
-class se extends we {
+class ce extends we {
   /**
    * @param {string} message
    */
   constructor(t) {
     super(
       `An internal error caused this command to fail. Please file a bug report at https://github.com/isomorphic-git/isomorphic-git/issues with this error message: ${t}`
-    ), this.code = this.name = se.code, this.data = { message: t };
+    ), this.code = this.name = ce.code, this.data = { message: t };
   }
 }
-se.code = "InternalError";
+ce.code = "InternalError";
 class bn extends we {
   /**
    * @param {string} filepath
@@ -4809,22 +4809,22 @@ class Sr {
       return Sr.fromBuffer(t);
     if (t === null)
       return new Sr(null);
-    throw new se("invalid type passed to GitIndex.from");
+    throw new ce("invalid type passed to GitIndex.from");
   }
   static async fromBuffer(t) {
     if (t.length === 0)
-      throw new se("Index file is empty (.git/index)");
+      throw new ce("Index file is empty (.git/index)");
     const r = new Sr(), n = new Lt(t), i = n.toString("utf8", 4);
     if (i !== "DIRC")
-      throw new se(`Invalid dircache magic file number: ${i}`);
+      throw new ce(`Invalid dircache magic file number: ${i}`);
     const a = await Qt(t.slice(0, -20)), o = t.slice(-20).toString("hex");
     if (o !== a)
-      throw new se(
+      throw new ce(
         `Invalid checksum in GitIndex buffer: expected ${o} but saw ${a}`
       );
     const s = n.readUInt32BE();
     if (s !== 2)
-      throw new se(`Unsupported dircache version: ${s}`);
+      throw new ce(`Unsupported dircache version: ${s}`);
     const l = n.readUInt32BE();
     let c = 0;
     for (; !n.eof() && c < l; ) {
@@ -4834,18 +4834,18 @@ class Sr {
       u.flags = hw(d);
       const p = t.indexOf(0, n.tell() + 1) - n.tell();
       if (p < 1)
-        throw new se(`Got a path length of: ${p}`);
+        throw new ce(`Got a path length of: ${p}`);
       if (u.path = n.toString("utf8", p), u.path.includes("..\\") || u.path.includes("../"))
         throw new bn(u.path);
       let m = 8 - (n.tell() - 12) % 8;
       for (m === 0 && (m = 8); m--; ) {
         const g = n.readUInt8();
         if (g !== 0)
-          throw new se(
+          throw new ce(
             `Expected 1-8 null characters but got '${g}' after ${u.path}`
           );
         if (n.eof())
-          throw new se("Unexpected end of file");
+          throw new ce("Unexpected end of file");
       }
       u.stages = [], r._addEntry(u), c++;
     }
@@ -5044,7 +5044,7 @@ function yw(e) {
     case 57344:
       return "commit";
   }
-  throw new se(`Unexpected GitTree entry mode: ${e.toString(8)}`);
+  throw new ce(`Unexpected GitTree entry mode: ${e.toString(8)}`);
 }
 class bw {
   constructor({ fs: t, gitdir: r, cache: n }) {
@@ -5215,7 +5215,7 @@ class ia {
       o
     ] = t.match(/^(\+?)(.*?)(\*?):(.*?)(\*?)$/).slice(1), s = r === "+", l = i === "*";
     if (l !== (o === "*"))
-      throw new se("Invalid refspec");
+      throw new ce("Invalid refspec");
     return new ia({
       remotePath: n,
       localPath: a,
@@ -5443,7 +5443,7 @@ let wo;
 async function nr(e, t) {
   return wo === void 0 && (wo = new Hn()), wo.acquire(e, t);
 }
-class H {
+class U {
   static async updateRemoteRefs({
     fs: t,
     gitdir: r,
@@ -5466,12 +5466,12 @@ class H {
     }
     const d = Os.from(s), p = /* @__PURE__ */ new Map();
     if (c) {
-      const v = await H.listRefs({
+      const v = await U.listRefs({
         fs: t,
         gitdir: r,
         filepath: "refs/tags"
       });
-      await H.deleteRefs({
+      await U.deleteRefs({
         fs: t,
         gitdir: r,
         refs: v.map((y) => `refs/tags/${y}`)
@@ -5479,7 +5479,7 @@ class H {
     }
     if (o) {
       for (const v of i.keys())
-        if (v.startsWith("refs/tags") && !v.endsWith("^{}") && !await H.exists({ fs: t, gitdir: r, ref: v })) {
+        if (v.startsWith("refs/tags") && !v.endsWith("^{}") && !await U.exists({ fs: t, gitdir: r, ref: v })) {
           const y = i.get(v);
           p.set(v, y);
         }
@@ -5497,7 +5497,7 @@ class H {
     const b = [];
     if (l) {
       for (const v of d.localNamespaces()) {
-        const y = (await H.listRefs({
+        const y = (await U.listRefs({
           fs: t,
           gitdir: r,
           filepath: v
@@ -5505,7 +5505,7 @@ class H {
         for (const _ of y)
           p.has(_) || b.push(_);
       }
-      b.length > 0 && await H.deleteRefs({ fs: t, gitdir: r, refs: b });
+      b.length > 0 && await U.deleteRefs({ fs: t, gitdir: r, refs: b });
     }
     for (const [v, y] of p)
       await nr(
@@ -5533,7 +5533,7 @@ class H {
     );
   }
   static async deleteRef({ fs: t, gitdir: r, ref: n }) {
-    return H.deleteRefs({ fs: t, gitdir: r, refs: [n] });
+    return U.deleteRefs({ fs: t, gitdir: r, refs: [n] });
   }
   static async deleteRefs({ fs: t, gitdir: r, refs: n }) {
     await Promise.all(n.map((s) => t.rm(N.join(r, s))));
@@ -5561,23 +5561,23 @@ class H {
     if (i !== void 0 && (i--, i === -1))
       return n;
     if (n.startsWith("ref: "))
-      return n = n.slice(5), H.resolve({ fs: t, gitdir: r, ref: n, depth: i });
+      return n = n.slice(5), U.resolve({ fs: t, gitdir: r, ref: n, depth: i });
     if (n.length === 40 && /[0-9a-f]{40}/.test(n))
       return n;
-    const a = await H.packedRefs({ fs: t, gitdir: r }), o = Ii(n).filter((s) => !Aw.includes(s));
+    const a = await U.packedRefs({ fs: t, gitdir: r }), o = Ii(n).filter((s) => !Aw.includes(s));
     for (const s of o) {
       const l = await nr(
         s,
         async () => await t.read(`${r}/${s}`, { encoding: "utf8" }) || a.get(s)
       );
       if (l)
-        return H.resolve({ fs: t, gitdir: r, ref: l.trim(), depth: i });
+        return U.resolve({ fs: t, gitdir: r, ref: l.trim(), depth: i });
     }
     throw new ke(n);
   }
   static async exists({ fs: t, gitdir: r, ref: n }) {
     try {
-      return await H.expand({ fs: t, gitdir: r, ref: n }), !0;
+      return await U.expand({ fs: t, gitdir: r, ref: n }), !0;
     } catch {
       return !1;
     }
@@ -5585,7 +5585,7 @@ class H {
   static async expand({ fs: t, gitdir: r, ref: n }) {
     if (n.length === 40 && /[0-9a-f]{40}/.test(n))
       return n;
-    const i = await H.packedRefs({ fs: t, gitdir: r }), a = Ii(n);
+    const i = await U.packedRefs({ fs: t, gitdir: r }), a = Ii(n);
     for (const o of a)
       if (await nr(
         o,
@@ -5603,14 +5603,14 @@ class H {
     if (n !== void 0 && (n--, n === -1))
       return { fullref: r, oid: t };
     if (t.startsWith("ref: "))
-      return t = t.slice(5), H.resolveAgainstMap({ ref: t, fullref: r, depth: n, map: i });
+      return t = t.slice(5), U.resolveAgainstMap({ ref: t, fullref: r, depth: n, map: i });
     if (t.length === 40 && /[0-9a-f]{40}/.test(t))
       return { fullref: r, oid: t };
     const a = Ii(t);
     for (const o of a) {
       const s = i.get(o);
       if (s)
-        return H.resolveAgainstMap({
+        return U.resolveAgainstMap({
           ref: s.trim(),
           fullref: o,
           depth: n,
@@ -5628,7 +5628,7 @@ class H {
   }
   // List all the refs that match the `filepath` prefix
   static async listRefs({ fs: t, gitdir: r, filepath: n }) {
-    const i = H.packedRefs({ fs: t, gitdir: r });
+    const i = U.packedRefs({ fs: t, gitdir: r });
     let a = null;
     try {
       a = await t.readdirDeep(`${r}/${n}`), a = a.map((o) => o.replace(`${r}/${n}/`, ""));
@@ -5640,14 +5640,14 @@ class H {
     return a.sort(_w), a;
   }
   static async listBranches({ fs: t, gitdir: r, remote: n }) {
-    return n ? H.listRefs({
+    return n ? U.listRefs({
       fs: t,
       gitdir: r,
       filepath: `refs/remotes/${n}`
-    }) : H.listRefs({ fs: t, gitdir: r, filepath: "refs/heads" });
+    }) : U.listRefs({ fs: t, gitdir: r, filepath: "refs/heads" });
   }
   static async listTags({ fs: t, gitdir: r }) {
-    return (await H.listRefs({
+    return (await U.listRefs({
       fs: t,
       gitdir: r,
       filepath: "refs/tags"
@@ -5673,7 +5673,7 @@ function vf(e) {
     case "160000":
       return "commit";
   }
-  throw new se(`Unexpected GitTree entry mode: ${e}`);
+  throw new ce(`Unexpected GitTree entry mode: ${e}`);
 }
 function Iw(e) {
   const t = [];
@@ -5681,12 +5681,12 @@ function Iw(e) {
   for (; r < e.length; ) {
     const n = e.indexOf(32, r);
     if (n === -1)
-      throw new se(
+      throw new ce(
         `GitTree: Error parsing buffer at byte location ${r}: Could not find the next space character.`
       );
     const i = e.indexOf(0, r);
     if (i === -1)
-      throw new se(
+      throw new ce(
         `GitTree: Error parsing buffer at byte location ${r}: Could not find the next null character.`
       );
     let a = e.slice(r, n).toString("utf8");
@@ -5705,23 +5705,23 @@ function Bw(e) {
   if (e.match(/^1007.*/)) return "100755";
   if (e.match(/^120.*/)) return "120000";
   if (e.match(/^160.*/)) return "160000";
-  throw new se(`Could not understand file mode: ${e}`);
+  throw new ce(`Could not understand file mode: ${e}`);
 }
 function jw(e) {
   return !e.oid && e.sha && (e.oid = e.sha), e.mode = Bw(e.mode), e.type || (e.type = vf(e.mode)), e;
 }
-class ut {
+class ft {
   constructor(t) {
     if (Buffer.isBuffer(t))
       this._entries = Iw(t);
     else if (Array.isArray(t))
       this._entries = t.map(jw);
     else
-      throw new se("invalid type passed to GitTree constructor");
+      throw new ce("invalid type passed to GitTree constructor");
     this._entries.sort(gf);
   }
   static from(t) {
-    return new ut(t);
+    return new ft(t);
   }
   render() {
     return this._entries.map((t) => `${t.mode} ${t.type} ${t.oid}    ${t.path}`).join(`
@@ -5757,7 +5757,7 @@ class vn {
   static unwrap(t) {
     const r = t.indexOf(32), n = t.indexOf(0), i = t.slice(0, r).toString("utf8"), a = t.slice(r + 1, n).toString("utf8"), o = t.length - (n + 1);
     if (parseInt(a) !== o)
-      throw new se(
+      throw new ce(
         `Length mismatch: expected ${a} bytes but got ${o} instead.`
       );
     return {
@@ -5773,7 +5773,7 @@ async function xf({ fs: e, gitdir: t, oid: r }) {
 function zw(e, t) {
   const r = new Lt(e), n = _l(r);
   if (n !== t.byteLength)
-    throw new se(
+    throw new ce(
       `applyDelta expected source buffer to be ${n} bytes but the provided buffer was ${t.length} bytes`
     );
   const i = _l(r);
@@ -5788,7 +5788,7 @@ function zw(e, t) {
       s.copy(xl(r, t));
     const l = s.tell();
     if (i !== l)
-      throw new se(
+      throw new ce(
         `applyDelta expected target buffer to be ${i} bytes but the resulting buffer was ${l} bytes`
       );
   }
@@ -5898,10 +5898,10 @@ async function Lw(e, t) {
   const r = new Sf(e);
   let n = await r.read(4);
   if (n = n.toString("utf8"), n !== "PACK")
-    throw new se(`Invalid PACK header '${n}'`);
+    throw new ce(`Invalid PACK header '${n}'`);
   let i = await r.read(4);
   if (i = i.readUInt32BE(0), i !== 2)
-    throw new se(`Invalid packfile version: ${i}`);
+    throw new ce(`Invalid packfile version: ${i}`);
   let a = await r.read(4);
   if (a = a.readUInt32BE(0), !(a < 1))
     for (; !r.eof() && a--; ) {
@@ -5910,10 +5910,10 @@ async function Lw(e, t) {
         const p = await r.chunk();
         if (!p) break;
         if (d.push(p, !1), d.err)
-          throw new se(`Pako error: ${d.msg}`);
+          throw new ce(`Pako error: ${d.msg}`);
         if (d.result) {
           if (d.result.length !== l)
-            throw new se(
+            throw new ce(
               "Inflated object size is different from that stated in packfile."
             );
           await r.undo(), await r.read(p.length - d.strm.avail_in);
@@ -5983,11 +5983,11 @@ class on {
       return;
     const a = n.readUInt32BE();
     if (a !== 2)
-      throw new se(
+      throw new ce(
         `Unable to read version ${a} packfile IDX. (Only version 2 supported)`
       );
     if (t.byteLength > 2048 * 1024 * 1024)
-      throw new se(
+      throw new ce(
         "To keep implementation simple, I haven't implemented the layer 5 feature needed to support packfiles > 2GB in size."
       );
     n.seek(n.tell() + 4 * 255);
@@ -6113,7 +6113,7 @@ class on {
     if (!this.offsets.get(t)) {
       if (this.getExternalRefDelta)
         return this.externalReadDepth++, this.getExternalRefDelta(t);
-      throw new se(`Could not read object ${t} from packfile`);
+      throw new ce(`Could not read object ${t} from packfile`);
     }
     const r = this.offsets.get(t);
     return this.readSlice({ start: r });
@@ -6131,13 +6131,13 @@ class on {
       112: "ref_delta"
     };
     if (!this.pack)
-      throw new se(
+      throw new ce(
         "Tried to read from a GitPackIndex with no packfile loaded into memory"
       );
     const n = (await this.pack).slice(t), i = new Lt(n), a = i.readUInt8(), o = a & 112;
     let s = r[o];
     if (s === void 0)
-      throw new se("Unrecognized type: 0b" + o.toString(2));
+      throw new ce("Unrecognized type: 0b" + o.toString(2));
     const l = a & 15;
     let c = l;
     a & 128 && (c = Hw(i, l));
@@ -6152,7 +6152,7 @@ class on {
     }
     const m = n.slice(i.tell());
     if (p = Buffer.from(await kf(m)), p.byteLength !== c)
-      throw new se(
+      throw new ce(
         `Packfile told us object would have length ${c} but it had length ${p.byteLength}`
       );
     return d && (p = Buffer.from(zw(p, d))), this.readDepth > 3 && (this.offsetCache[t] = { type: s, object: p }), { type: s, format: "content", object: p };
@@ -6204,7 +6204,7 @@ async function qw({
       filename: l,
       getExternalRefDelta: a
     });
-    if (c.error) throw new se(c.error);
+    if (c.error) throw new ce(c.error);
     if (c.offsets.has(n)) {
       if (!c.pack) {
         const d = l.replace(/idx$/, "pack");
@@ -6240,13 +6240,13 @@ async function De({
     return o;
   const s = await Qt(o.object);
   if (s !== n)
-    throw new se(
+    throw new ce(
       `SHA check failed! Expected ${n}, computed ${s}`
     );
   const { object: l, type: c } = vn.unwrap(o.object);
   if (o.type = c, o.object = l, o.format = "content", i === "content")
     return o;
-  throw new se(`invalid requested format "${i}"`);
+  throw new ce(`invalid requested format "${i}"`);
 }
 class Pt extends we {
   /**
@@ -6397,17 +6397,17 @@ class Je extends we {
   }
 }
 Je.code = "MissingNameError";
-class lt extends we {
+class ut extends we {
   /**
    * @param {string} parameter
    */
   constructor(t) {
     super(
       `The function requires a "${t}" parameter but none was provided.`
-    ), this.code = this.name = lt.code, this.data = { parameter: t };
+    ), this.code = this.name = ut.code, this.data = { parameter: t };
   }
 }
-lt.code = "MissingParameterError";
+ut.code = "MissingParameterError";
 class pi extends we {
   /**
    * @param {Error[]} errors
@@ -6524,7 +6524,7 @@ var Gw = /* @__PURE__ */ Object.freeze({
   FastForwardError: fi,
   GitPushError: di,
   HttpError: sn,
-  InternalError: se,
+  InternalError: ce,
   InvalidFilepathError: mr,
   InvalidOidError: pr,
   InvalidRefNameError: Rt,
@@ -6532,7 +6532,7 @@ var Gw = /* @__PURE__ */ Object.freeze({
   MergeNotSupportedError: xn,
   MergeConflictError: En,
   MissingNameError: Je,
-  MissingParameterError: lt,
+  MissingParameterError: ut,
   MultipleGitError: pi,
   NoRefspecError: oi,
   NotFoundError: ke,
@@ -6597,7 +6597,7 @@ class nt {
     else if (typeof t == "object")
       this._tag = nt.render(t);
     else
-      throw new se(
+      throw new ce(
         "invalid type passed to GitAnnotatedTag constructor"
       );
   }
@@ -6696,7 +6696,7 @@ class Ae {
     else if (typeof t == "object")
       this._commit = Ae.render(t);
     else
-      throw new se("invalid type passed to GitCommit constructor");
+      throw new ce("invalid type passed to GitCommit constructor");
   }
   static fromPayloadSignature({ payload: t, signature: r }) {
     const n = Ae.justHeaders(t), i = Ae.justMessage(t), a = Zt(
@@ -6754,7 +6754,7 @@ gpgsig` + go(r) + `
 ` : r += `tree 4b825dc642cb6eb9a060e54bf8d69288fbee4904
 `, t.parent) {
       if (t.parent.length === void 0)
-        throw new se("commit 'parent' property should be an array");
+        throw new ce("commit 'parent' property should be an array");
       for (const a of t.parent)
         r += `parent ${a}
 `;
@@ -6804,7 +6804,7 @@ gpgsig` + go(o) + `
 }
 async function ln({ fs: e, cache: t, gitdir: r, oid: n }) {
   if (n === "4b825dc642cb6eb9a060e54bf8d69288fbee4904")
-    return { tree: ut.from([]), oid: n };
+    return { tree: ft.from([]), oid: n };
   const { type: i, object: a } = await De({ fs: e, cache: t, gitdir: r, oid: n });
   if (i === "tag")
     return n = nt.from(a).parse().object, ln({ fs: e, cache: t, gitdir: r, oid: n });
@@ -6812,7 +6812,7 @@ async function ln({ fs: e, cache: t, gitdir: r, oid: n }) {
     return n = Ae.from(a).parse().tree, ln({ fs: e, cache: t, gitdir: r, oid: n });
   if (i !== "tree")
     throw new it(n, i, "tree");
-  return { tree: ut.from(a), oid: n };
+  return { tree: ft.from(a), oid: n };
 }
 class Qw {
   constructor({ fs: t, gitdir: r, ref: n, cache: i }) {
@@ -6820,7 +6820,7 @@ class Qw {
       const o = /* @__PURE__ */ new Map();
       let s;
       try {
-        s = await H.resolve({ fs: t, gitdir: r, ref: n });
+        s = await U.resolve({ fs: t, gitdir: r, ref: n });
       } catch (c) {
         c instanceof ke && (s = "4b825dc642cb6eb9a060e54bf8d69288fbee4904");
       }
@@ -6859,7 +6859,7 @@ class Qw {
     const { type: c, object: u } = await De({ fs: n, cache: i, gitdir: a, oid: l });
     if (c !== s.type)
       throw new it(l, c, s.type);
-    const d = ut.from(u);
+    const d = ft.from(u);
     for (const p of d)
       o.set(N.join(r, p.path), p);
     return d.entries().map((p) => N.join(r, p.path));
@@ -7262,9 +7262,9 @@ class K {
     return this._symlink(r.toString("utf8"), t);
   }
 }
-function $(e, t) {
+function P(e, t) {
   if (t === void 0)
-    throw new lt(e);
+    throw new ut(e);
 }
 async function oa(e, t) {
   return !e && !t ? !1 : e && !t || !e && t ? !0 : !(await e.type() === "tree" && await t.type() === "tree" || await e.type() === await t.type() && await e.mode() === await t.mode() && await e.oid() === await t.oid());
@@ -7277,7 +7277,7 @@ async function og({
   cache: i = {}
 }) {
   try {
-    $("fs", e), $("dir", t), $("gitdir", r);
+    P("fs", e), P("dir", t), P("gitdir", r);
     const a = new K(e), o = [_t({ ref: n }), _i(), _n()];
     let s = [];
     await Ue.acquire({ fs: a, gitdir: r, cache: i }, async function(c) {
@@ -7363,7 +7363,7 @@ class kn {
 }
 async function sg({ fs: e, gitdir: t, object: r, format: n, oid: i }) {
   if (n !== "deflated")
-    throw new se(
+    throw new ce(
       "GitObjectStoreLoose expects objects to write to be in deflated format"
     );
   const a = `objects/${i.slice(0, 2)}/${i.slice(2)}`, o = `${t}/${a}`;
@@ -7384,7 +7384,7 @@ function lg() {
     return !1;
   }
 }
-async function ft({
+async function dt({
   fs: e,
   gitdir: t,
   type: r,
@@ -7410,7 +7410,7 @@ async function ug({
   parallel: o = !0
 }) {
   try {
-    $("fs", e), $("dir", t), $("gitdir", r), $("filepath", n);
+    P("fs", e), P("dir", t), P("gitdir", r), P("filepath", n);
     const s = new K(e);
     await Ue.acquire({ fs: s, gitdir: r, cache: i }, async (l) => Zo({
       dir: t,
@@ -7474,7 +7474,7 @@ async function Zo({
     } else {
       const g = await (await Me.get({ fs: r, gitdir: t })).get("core.autocrlf"), b = p.isSymbolicLink() ? await r.readlink(N.join(e, d)).then(Cf) : await r.read(N.join(e, d), { autocrlf: g });
       if (b === null) throw new ke(d);
-      const v = await ft({ fs: r, gitdir: t, type: "blob", object: b });
+      const v = await dt({ fs: r, gitdir: t, type: "blob", object: b });
       i.insert({ filepath: d, stats: p, oid: v });
     }
   }), l = await Promise.allSettled(s), c = l.filter((d) => d.status === "rejected").map((d) => d.reason);
@@ -7573,7 +7573,7 @@ async function Sa({
   tree: m
 }) {
   let g = !1;
-  d || (d = await H.resolve({
+  d || (d = await U.resolve({
     fs: e,
     gitdir: n,
     ref: "HEAD",
@@ -7581,7 +7581,7 @@ async function Sa({
   }));
   let b, v;
   try {
-    b = await H.resolve({
+    b = await U.resolve({
       fs: e,
       gitdir: n,
       ref: d
@@ -7616,12 +7616,12 @@ async function Sa({
     async function(R) {
       const x = _f(R.entries).get(".");
       if (m || (m = await Tf({ fs: e, gitdir: n, inode: x, dryRun: c })), p ? p = await Promise.all(
-        p.map((S) => H.resolve({ fs: e, gitdir: n, ref: S }))
+        p.map((S) => U.resolve({ fs: e, gitdir: n, ref: S }))
       ) : l ? p = v.commit.parent : p = b ? [b] : [], !i)
         if (l)
           i = v.commit.message;
         else
-          throw new lt("message");
+          throw new ut("message");
       let C = Ae.from({
         tree: m,
         parent: p,
@@ -7630,14 +7630,14 @@ async function Sa({
         message: i
       });
       s && (C = await Ae.sign(C, r, s));
-      const k = await ft({
+      const k = await dt({
         fs: e,
         gitdir: n,
         type: "commit",
         object: C.toObject(),
         dryRun: c
       });
-      return !u && !c && await H.writeRef({
+      return !u && !c && await U.writeRef({
         fs: e,
         gitdir: n,
         ref: d,
@@ -7655,8 +7655,8 @@ async function Tf({ fs: e, gitdir: t, inode: r, dryRun: n }) {
     path: l.basename,
     oid: l.metadata.oid,
     type: l.type
-  })), o = ut.from(a);
-  return await ft({
+  })), o = ft.from(a);
+  return await dt({
     fs: e,
     gitdir: t,
     type: "tree",
@@ -7709,7 +7709,7 @@ async function Af({
         });
         if (c !== "tree")
           throw new it(a, c, "tree", o);
-        return n = ut.from(u), Af({
+        return n = ft.from(u), Af({
           fs: e,
           cache: t,
           gitdir: r,
@@ -7737,8 +7737,8 @@ async function Rn({
   };
 }
 async function xi({ fs: e, gitdir: t, tree: r }) {
-  const n = ut.from(r).toObject();
-  return await ft({
+  const n = ft.from(r).toObject();
+  return await dt({
     fs: e,
     gitdir: t,
     type: "tree",
@@ -7761,7 +7761,7 @@ async function fg({
 }) {
   let d;
   try {
-    d = await H.resolve({ gitdir: n, fs: e, ref: i });
+    d = await U.resolve({ gitdir: n, fs: e, ref: i });
   } catch (y) {
     if (!(y instanceof ke))
       throw y;
@@ -7779,7 +7779,7 @@ async function fg({
       if (y.path === a)
         throw new Pt("note", a);
   typeof o == "string" && (o = Buffer.from(o, "utf8"));
-  const g = await ft({
+  const g = await dt({
     fs: e,
     gitdir: n,
     type: "blob",
@@ -7822,7 +7822,7 @@ async function dg({
   cache: d = {}
 }) {
   try {
-    $("fs", e), $("gitdir", n), $("oid", a), $("note", o), u && $("onSign", t);
+    P("fs", e), P("gitdir", n), P("oid", a), P("note", o), u && P("onSign", t);
     const p = new K(e), m = await gr({ fs: p, gitdir: n, author: l });
     if (!m) throw new Je("author");
     const g = await un({
@@ -7869,7 +7869,7 @@ async function hg({
   force: a = !1
 }) {
   try {
-    return $("fs", e), $("gitdir", r), $("remote", n), $("url", i), await Df({
+    return P("fs", e), P("gitdir", r), P("remote", n), P("url", i), await Df({
       fs: new K(e),
       gitdir: r,
       remote: n,
@@ -7893,9 +7893,9 @@ async function pg({
   signingKey: c,
   force: u = !1
 }) {
-  if (i = i.startsWith("refs/tags/") ? i : `refs/tags/${i}`, !u && await H.exists({ fs: e, gitdir: n, ref: i }))
+  if (i = i.startsWith("refs/tags/") ? i : `refs/tags/${i}`, !u && await U.exists({ fs: e, gitdir: n, ref: i }))
     throw new Pt("tag", i);
-  const d = await H.resolve({
+  const d = await U.resolve({
     fs: e,
     gitdir: n,
     ref: l || "HEAD"
@@ -7909,13 +7909,13 @@ async function pg({
     gpgsig: s
   });
   c && (m = await nt.sign(m, r, c));
-  const g = await ft({
+  const g = await dt({
     fs: e,
     gitdir: n,
     type: "tag",
     object: m.toObject()
   });
-  await H.writeRef({ fs: e, gitdir: n, ref: i, value: g });
+  await U.writeRef({ fs: e, gitdir: n, ref: i, value: g });
 }
 async function mg({
   fs: e,
@@ -7932,7 +7932,7 @@ async function mg({
   cache: d = {}
 }) {
   try {
-    $("fs", e), $("gitdir", n), $("ref", i), c && $("onSign", t);
+    P("fs", e), P("gitdir", n), P("ref", i), c && P("onSign", t);
     const p = new K(e), m = await gr({ fs: p, gitdir: n, author: a });
     if (!m) throw new Je("tagger");
     return await pg({
@@ -7963,14 +7963,14 @@ async function wg({
   if (r !== Ft.clean(r))
     throw new Rt(r, Ft.clean(r));
   const o = `refs/heads/${r}`;
-  if (!a && await H.exists({ fs: e, gitdir: t, ref: o }))
+  if (!a && await U.exists({ fs: e, gitdir: t, ref: o }))
     throw new Pt("branch", r, !1);
   let s;
   try {
-    s = await H.resolve({ fs: e, gitdir: t, ref: n || "HEAD" });
+    s = await U.resolve({ fs: e, gitdir: t, ref: n || "HEAD" });
   } catch {
   }
-  s && await H.writeRef({ fs: e, gitdir: t, ref: o, value: s }), i && await H.writeSymbolicRef({
+  s && await U.writeRef({ fs: e, gitdir: t, ref: o, value: s }), i && await U.writeSymbolicRef({
     fs: e,
     gitdir: t,
     ref: "HEAD",
@@ -7987,7 +7987,7 @@ async function gg({
   force: o = !1
 }) {
   try {
-    return $("fs", e), $("gitdir", r), $("ref", n), await wg({
+    return P("fs", e), P("gitdir", r), P("ref", n), await wg({
       fs: new K(e),
       gitdir: r,
       ref: n,
@@ -8019,17 +8019,17 @@ async function $s({
   let g;
   if (n)
     try {
-      g = await H.resolve({ fs: e, gitdir: a, ref: "HEAD" });
+      g = await U.resolve({ fs: e, gitdir: a, ref: "HEAD" });
     } catch {
       g = "0000000000000000000000000000000000000000";
     }
   let b;
   try {
-    b = await H.resolve({ fs: e, gitdir: a, ref: s });
+    b = await U.resolve({ fs: e, gitdir: a, ref: s });
   } catch (v) {
     if (s === "HEAD") throw v;
     const y = `${o}/${s}`;
-    if (b = await H.resolve({
+    if (b = await U.resolve({
       fs: e,
       gitdir: a,
       ref: y
@@ -8037,7 +8037,7 @@ async function $s({
       const _ = await Me.get({ fs: e, gitdir: a });
       await _.set(`branch.${s}.remote`, o), await _.set(`branch.${s}.merge`, `refs/heads/${s}`), await Me.save({ fs: e, gitdir: a, config: _ });
     }
-    await H.writeRef({
+    await U.writeRef({
       fs: e,
       gitdir: a,
       ref: `refs/heads/${s}`,
@@ -8065,7 +8065,7 @@ async function $s({
       throw new ci(y);
     const _ = v.filter(([x]) => x === "error").map(([x, C]) => C);
     if (_.length > 0)
-      throw new se(_.join(", "));
+      throw new ce(_.join(", "));
     if (d) {
       n && await n({
         previousHead: g,
@@ -8099,13 +8099,13 @@ async function $s({
               loaded: ++R,
               total: O
             });
-          } catch (P) {
-            if (P.code === "ENOTEMPTY")
+          } catch ($) {
+            if ($.code === "ENOTEMPTY")
               console.log(
                 `Did not delete ${k} because directory is not empty`
               );
             else
-              throw P;
+              throw $;
           }
         }
     }), await Promise.all(
@@ -8121,24 +8121,24 @@ async function $s({
       await Promise.all(
         v.filter(
           ([C]) => C === "create" || C === "create-index" || C === "update" || C === "mkdir-index"
-        ).map(async function([C, k, S, P, A]) {
-          const B = `${i}/${k}`;
+        ).map(async function([C, k, S, $, A]) {
+          const I = `${i}/${k}`;
           try {
             if (C !== "create-index" && C !== "mkdir-index") {
-              const { object: U } = await De({ fs: e, cache: t, gitdir: a, oid: S });
-              if (A && await e.rm(B), P === 33188)
-                await e.write(B, U);
-              else if (P === 33261)
-                await e.write(B, U, { mode: 511 });
-              else if (P === 40960)
-                await e.writelink(B, U);
+              const { object: H } = await De({ fs: e, cache: t, gitdir: a, oid: S });
+              if (A && await e.rm(I), $ === 33188)
+                await e.write(I, H);
+              else if ($ === 33261)
+                await e.write(I, H, { mode: 511 });
+              else if ($ === 40960)
+                await e.writelink(I, H);
               else
-                throw new se(
-                  `Invalid mode 0o${P.toString(8)} detected in blob ${S}`
+                throw new ce(
+                  `Invalid mode 0o${$.toString(8)} detected in blob ${S}`
                 );
             }
-            const M = await e.lstat(B);
-            P === 33261 && (M.mode = 493), C === "mkdir-index" && (M.mode = 57344), x.insert({
+            const M = await e.lstat(I);
+            $ === 33261 && (M.mode = 493), C === "mkdir-index" && (M.mode = 57344), x.insert({
               filepath: k,
               stats: M,
               oid: S
@@ -8159,13 +8159,13 @@ async function $s({
     });
   }
   if (!u) {
-    const v = await H.expand({ fs: e, gitdir: a, ref: s });
-    v.startsWith("refs/heads") ? await H.writeSymbolicRef({
+    const v = await U.expand({ fs: e, gitdir: a, ref: s });
+    v.startsWith("refs/heads") ? await U.writeSymbolicRef({
       fs: e,
       gitdir: a,
       ref: "HEAD",
       value: v
-    }) : await H.writeRef({ fs: e, gitdir: a, ref: "HEAD", value: b });
+    }) : await U.writeRef({ fs: e, gitdir: a, ref: "HEAD", value: b });
   }
 }
 async function yg({
@@ -8348,7 +8348,7 @@ async function Bf({
   cache: m = {}
 }) {
   try {
-    $("fs", e), $("dir", n), $("gitdir", i);
+    P("fs", e), P("dir", n), P("gitdir", i);
     const g = o || "HEAD";
     return await $s({
       fs: new K(e),
@@ -8381,7 +8381,7 @@ async function br({
   fullname: r = !1,
   test: n = !1
 }) {
-  const i = await H.resolve({
+  const i = await U.resolve({
     fs: e,
     gitdir: t,
     ref: "HEAD",
@@ -8389,7 +8389,7 @@ async function br({
   });
   if (n)
     try {
-      await H.resolve({ fs: e, gitdir: t, ref: i });
+      await U.resolve({ fs: e, gitdir: t, ref: i });
     } catch {
       return;
     }
@@ -8718,7 +8718,7 @@ async function Eg({
       filename: s,
       getExternalRefDelta: i
     });
-    if (l.error) throw new se(l.error);
+    if (l.error) throw new ce(l.error);
     if (l.offsets.has(n))
       return !0;
   }
@@ -8991,12 +8991,12 @@ async function Ts({
   prune: x = !1,
   pruneTags: C = !1
 }) {
-  const k = c || await br({ fs: e, gitdir: l, test: !0 }), S = await Me.get({ fs: e, gitdir: l }), P = d || k && await S.get(`branch.${k}.remote`) || "origin", A = p || await S.get(`remote.${P}.url`);
+  const k = c || await br({ fs: e, gitdir: l, test: !0 }), S = await Me.get({ fs: e, gitdir: l }), $ = d || k && await S.get(`branch.${k}.remote`) || "origin", A = p || await S.get(`remote.${$}.url`);
   if (typeof A > "u")
-    throw new lt("remote OR url");
-  const B = u || k && await S.get(`branch.${k}.merge`) || c || "HEAD";
+    throw new ut("remote OR url");
+  const I = u || k && await S.get(`branch.${k}.merge`) || c || "HEAD";
   m === void 0 && (m = await S.get("http.corsProxy"));
-  const M = ka.getRemoteHelperFor({ url: A }), U = await M.discover({
+  const M = ka.getRemoteHelperFor({ url: A }), H = await M.discover({
     http: r,
     onAuth: a,
     onAuthSuccess: o,
@@ -9006,29 +9006,29 @@ async function Ts({
     url: A,
     headers: O,
     protocolVersion: 1
-  }), Z = U.auth, fe = U.refs;
-  if (fe.size === 0)
+  }), Y = H.auth, oe = H.refs;
+  if (oe.size === 0)
     return {
       defaultBranch: null,
       fetchHead: null,
       fetchHeadDescription: null
     };
-  if (g !== null && !U.capabilities.has("shallow"))
+  if (g !== null && !H.capabilities.has("shallow"))
     throw new fr("shallow", "depth");
-  if (b !== null && !U.capabilities.has("deepen-since"))
+  if (b !== null && !H.capabilities.has("deepen-since"))
     throw new fr("deepen-since", "since");
-  if (v.length > 0 && !U.capabilities.has("deepen-not"))
+  if (v.length > 0 && !H.capabilities.has("deepen-not"))
     throw new fr("deepen-not", "exclude");
-  if (y === !0 && !U.capabilities.has("deepen-relative"))
+  if (y === !0 && !H.capabilities.has("deepen-relative"))
     throw new fr("deepen-relative", "relative");
-  const { oid: Pe, fullref: me } = H.resolveAgainstMap({
-    ref: B,
-    map: fe
+  const { oid: Pe, fullref: me } = U.resolveAgainstMap({
+    ref: I,
+    map: oe
   });
-  for (const L of fe.keys())
-    L === me || L === "HEAD" || L.startsWith("refs/heads/") || _ && L.startsWith("refs/tags/") || fe.delete(L);
+  for (const L of oe.keys())
+    L === me || L === "HEAD" || L.startsWith("refs/heads/") || _ && L.startsWith("refs/tags/") || oe.delete(L);
   const be = zf(
-    [...U.capabilities],
+    [...H.capabilities],
     [
       "multi_ack_detailed",
       "no-done",
@@ -9043,39 +9043,39 @@ async function Ts({
     ]
   );
   y && be.push("deepen-relative");
-  const Ye = R ? [Pe] : fe.values(), Ze = R ? [k] : await H.listRefs({
+  const Ye = R ? [Pe] : oe.values(), Ze = R ? [k] : await U.listRefs({
     fs: e,
     gitdir: l,
     filepath: "refs"
   });
-  let le = [];
+  let ue = [];
   for (let L of Ze)
     try {
-      L = await H.expand({ fs: e, gitdir: l, ref: L });
-      const V = await H.resolve({ fs: e, gitdir: l, ref: L });
-      await Al({ fs: e, cache: t, gitdir: l, oid: V }) && le.push(V);
+      L = await U.expand({ fs: e, gitdir: l, ref: L });
+      const V = await U.resolve({ fs: e, gitdir: l, ref: L });
+      await Al({ fs: e, cache: t, gitdir: l, oid: V }) && ue.push(V);
     } catch {
     }
-  le = [...new Set(le)];
-  const F = await Vn.read({ fs: e, gitdir: l }), q = U.capabilities.has("shallow") ? [...F] : [], W = Og({
+  ue = [...new Set(ue)];
+  const F = await Vn.read({ fs: e, gitdir: l }), q = H.capabilities.has("shallow") ? [...F] : [], W = Og({
     capabilities: be,
     wants: Ye,
-    haves: le,
+    haves: ue,
     shallows: q,
     depth: g,
     since: b,
     exclude: v
-  }), ee = Buffer.from(await sa(W)), I = await M.connect({
+  }), ee = Buffer.from(await sa(W)), B = await M.connect({
     http: r,
     onProgress: n,
     corsProxy: m,
     service: "git-upload-pack",
     url: A,
-    auth: Z,
+    auth: Y,
     body: [ee],
     headers: O
-  }), Q = await Rg(I.body);
-  I.headers && (Q.headers = I.headers);
+  }), Q = await Rg(B.body);
+  B.headers && (Q.headers = B.headers);
   for (const L of Q.shallows)
     if (!F.has(L))
       try {
@@ -9092,16 +9092,16 @@ async function Ts({
     const L = /* @__PURE__ */ new Map([[me, Pe]]), V = /* @__PURE__ */ new Map();
     let te = 10, J = me;
     for (; te--; ) {
-      const ne = U.symrefs.get(J);
+      const ne = H.symrefs.get(J);
       if (ne === void 0) break;
       V.set(J, ne), J = ne;
     }
-    const oe = fe.get(J);
-    oe && L.set(J, oe);
-    const { pruned: re } = await H.updateRemoteRefs({
+    const se = oe.get(J);
+    se && L.set(J, se);
+    const { pruned: re } = await U.updateRemoteRefs({
       fs: e,
       gitdir: l,
-      remote: P,
+      remote: $,
       refs: L,
       symrefs: V,
       tags: _,
@@ -9109,24 +9109,24 @@ async function Ts({
     });
     x && (Q.pruned = re);
   } else {
-    const { pruned: L } = await H.updateRemoteRefs({
+    const { pruned: L } = await U.updateRemoteRefs({
       fs: e,
       gitdir: l,
-      remote: P,
-      refs: fe,
-      symrefs: U.symrefs,
+      remote: $,
+      refs: oe,
+      symrefs: H.symrefs,
       tags: _,
       prune: x,
       pruneTags: C
     });
     x && (Q.pruned = L);
   }
-  if (Q.HEAD = U.symrefs.get("HEAD"), Q.HEAD === void 0) {
-    const { oid: L } = H.resolveAgainstMap({
+  if (Q.HEAD = H.symrefs.get("HEAD"), Q.HEAD === void 0) {
+    const { oid: L } = U.resolveAgainstMap({
       ref: "HEAD",
-      map: fe
+      map: oe
     });
-    for (const [V, te] of fe.entries())
+    for (const [V, te] of oe.entries())
       if (V !== "HEAD" && te === L) {
         Q.HEAD = V;
         break;
@@ -9150,15 +9150,15 @@ async function Ts({
     });
   }
   const G = Buffer.from(await sa(Q.packfile));
-  if (I.body.error) throw I.body.error;
-  const X = G.slice(-20).toString("hex"), Y = {
+  if (B.body.error) throw B.body.error;
+  const X = G.slice(-20).toString("hex"), Z = {
     defaultBranch: Q.HEAD,
     fetchHead: Q.FETCH_HEAD.oid,
     fetchHeadDescription: Q.FETCH_HEAD.description
   };
-  if (Q.headers && (Y.headers = Q.headers), x && (Y.pruned = Q.pruned), X !== "" && !Sg(G)) {
-    Y.packfile = `objects/pack/pack-${X}.pack`;
-    const L = N.join(l, Y.packfile);
+  if (Q.headers && (Z.headers = Q.headers), x && (Z.pruned = Q.pruned), X !== "" && !Sg(G)) {
+    Z.packfile = `objects/pack/pack-${X}.pack`;
+    const L = N.join(l, Z.packfile);
     await e.write(L, G);
     const V = (J) => De({ fs: e, cache: t, gitdir: l, oid: J }), te = await on.fromPack({
       pack: G,
@@ -9167,7 +9167,7 @@ async function Ts({
     });
     await e.write(L.replace(/\.pack$/, ".idx"), await te.toBuffer());
   }
-  return Y;
+  return Z;
 }
 async function Lf({
   fs: e,
@@ -9228,8 +9228,8 @@ async function Cg({
 }) {
   try {
     if (await Lf({ fs: e, gitdir: u }), await Df({ fs: e, gitdir: u, remote: g, url: d, force: !1 }), p) {
-      const P = await Me.get({ fs: e, gitdir: u });
-      await P.set("http.corsProxy", p), await Me.save({ fs: e, gitdir: u, config: P });
+      const $ = await Me.get({ fs: e, gitdir: u });
+      await $.set("http.corsProxy", p), await Me.save({ fs: e, gitdir: u, config: $ });
     }
     const { defaultBranch: k, fetchHead: S } = await Ts({
       fs: e,
@@ -9295,7 +9295,7 @@ async function Pg({
   cache: C = {}
 }) {
   try {
-    return $("fs", e), $("http", t), $("gitdir", c), R || $("dir", l), $("url", u), await Cg({
+    return P("fs", e), P("http", t), P("gitdir", c), R || P("dir", l), P("url", u), await Cg({
       fs: new K(e),
       cache: C,
       http: t,
@@ -9342,7 +9342,7 @@ async function $g({
   cache: g = {}
 }) {
   try {
-    $("fs", e), l || $("message", i), s && $("onSign", t);
+    P("fs", e), l || P("message", i), s && P("onSign", t);
     const b = new K(e);
     return await Sa({
       fs: b,
@@ -9372,7 +9372,7 @@ async function Tg({
   test: i = !1
 }) {
   try {
-    return $("fs", e), $("gitdir", r), await br({
+    return P("fs", e), P("gitdir", r), await br({
       fs: new K(e),
       gitdir: r,
       fullname: n,
@@ -9383,14 +9383,14 @@ async function Tg({
   }
 }
 async function Ag({ fs: e, gitdir: t, ref: r }) {
-  if (r = r.startsWith("refs/heads/") ? r : `refs/heads/${r}`, !await H.exists({ fs: e, gitdir: t, ref: r }))
+  if (r = r.startsWith("refs/heads/") ? r : `refs/heads/${r}`, !await U.exists({ fs: e, gitdir: t, ref: r }))
     throw new ke(r);
-  const i = await H.expand({ fs: e, gitdir: t, ref: r }), a = await br({ fs: e, gitdir: t, fullname: !0 });
+  const i = await U.expand({ fs: e, gitdir: t, ref: r }), a = await br({ fs: e, gitdir: t, fullname: !0 });
   if (i === a) {
-    const l = await H.resolve({ fs: e, gitdir: t, ref: i });
-    await H.writeRef({ fs: e, gitdir: t, ref: "HEAD", value: l });
+    const l = await U.resolve({ fs: e, gitdir: t, ref: i });
+    await U.writeRef({ fs: e, gitdir: t, ref: "HEAD", value: l });
   }
-  await H.deleteRef({ fs: e, gitdir: t, ref: i });
+  await U.deleteRef({ fs: e, gitdir: t, ref: i });
   const o = Or(r), s = await Me.get({ fs: e, gitdir: t });
   await s.deleteSection("branch", o), await Me.save({ fs: e, gitdir: t, config: s });
 }
@@ -9401,7 +9401,7 @@ async function Dg({
   ref: n
 }) {
   try {
-    return $("fs", e), $("ref", n), await Ag({
+    return P("fs", e), P("ref", n), await Ag({
       fs: new K(e),
       gitdir: r,
       ref: n
@@ -9412,7 +9412,7 @@ async function Dg({
 }
 async function Ig({ fs: e, dir: t, gitdir: r = N.join(t, ".git"), ref: n }) {
   try {
-    $("fs", e), $("ref", n), await H.deleteRef({ fs: new K(e), gitdir: r, ref: n });
+    P("fs", e), P("ref", n), await U.deleteRef({ fs: new K(e), gitdir: r, ref: n });
   } catch (i) {
     throw i.caller = "git.deleteRef", i;
   }
@@ -9428,7 +9428,7 @@ async function jg({
   remote: n
 }) {
   try {
-    return $("fs", e), $("remote", n), await Bg({
+    return P("fs", e), P("remote", n), await Bg({
       fs: new K(e),
       gitdir: r,
       remote: n
@@ -9438,11 +9438,11 @@ async function jg({
   }
 }
 async function zg({ fs: e, gitdir: t, ref: r }) {
-  r = r.startsWith("refs/tags/") ? r : `refs/tags/${r}`, await H.deleteRef({ fs: e, gitdir: t, ref: r });
+  r = r.startsWith("refs/tags/") ? r : `refs/tags/${r}`, await U.deleteRef({ fs: e, gitdir: t, ref: r });
 }
 async function Ng({ fs: e, dir: t, gitdir: r = N.join(t, ".git"), ref: n }) {
   try {
-    return $("fs", e), $("ref", n), await zg({
+    return P("fs", e), P("ref", n), await zg({
       fs: new K(e),
       gitdir: r,
       ref: n
@@ -9472,7 +9472,7 @@ async function Lg({
       filename: l,
       getExternalRefDelta: i
     });
-    if (c.error) throw new se(c.error);
+    if (c.error) throw new ce(c.error);
     for (const u of c.offsets.keys())
       u.startsWith(n) && a.push(u);
   }
@@ -9500,7 +9500,7 @@ async function Ug({
   cache: i = {}
 }) {
   try {
-    return $("fs", e), $("gitdir", r), $("oid", n), await Fg({
+    return P("fs", e), P("gitdir", r), P("oid", n), await Fg({
       fs: new K(e),
       cache: i,
       gitdir: r,
@@ -9512,7 +9512,7 @@ async function Ug({
 }
 async function Hg({ fs: e, dir: t, gitdir: r = N.join(t, ".git"), ref: n }) {
   try {
-    return $("fs", e), $("gitdir", r), $("ref", n), await H.expand({
+    return P("fs", e), P("gitdir", r), P("ref", n), await U.expand({
       fs: new K(e),
       gitdir: r,
       ref: n
@@ -9575,9 +9575,9 @@ async function qg({
     dir: r,
     gitdir: n,
     trees: [g, b, v],
-    map: async function(C, [k, S, P]) {
-      const A = ra(C), B = await oa(k, S), M = await oa(P, S);
-      switch (`${B}-${M}`) {
+    map: async function(C, [k, S, $]) {
+      const A = ra(C), I = await oa(k, S), M = await oa($, S);
+      switch (`${I}-${M}`) {
         case "false-false":
           return {
             mode: await S.mode(),
@@ -9586,11 +9586,11 @@ async function qg({
             type: await S.type()
           };
         case "false-true":
-          return P ? {
-            mode: await P.mode(),
+          return $ ? {
+            mode: await $.mode(),
             path: A,
-            oid: await P.oid(),
-            type: await P.type()
+            oid: await $.oid(),
+            type: await $.type()
           } : void 0;
         case "true-false":
           return k ? {
@@ -9600,43 +9600,43 @@ async function qg({
             type: await k.type()
           } : void 0;
         case "true-true": {
-          if (k && S && P && await k.type() === "blob" && await S.type() === "blob" && await P.type() === "blob")
+          if (k && S && $ && await k.type() === "blob" && await S.type() === "blob" && await $.type() === "blob")
             return Gg({
               fs: e,
               gitdir: n,
               path: A,
               ours: k,
               base: S,
-              theirs: P,
+              theirs: $,
               ourName: l,
               baseName: c,
               theirName: u,
               mergeDriver: m
-            }).then(async (U) => {
-              if (U.cleanMerge)
-                p || i.insert({ filepath: C, oid: U.mergeResult.oid, stage: 0 });
+            }).then(async (H) => {
+              if (H.cleanMerge)
+                p || i.insert({ filepath: C, oid: H.mergeResult.oid, stage: 0 });
               else if (y.push(C), _.push(C), !p) {
-                const Z = await S.oid(), fe = await k.oid(), Pe = await P.oid();
-                i.delete({ filepath: C }), i.insert({ filepath: C, oid: Z, stage: 1 }), i.insert({ filepath: C, oid: fe, stage: 2 }), i.insert({ filepath: C, oid: Pe, stage: 3 });
+                const Y = await S.oid(), oe = await k.oid(), Pe = await $.oid();
+                i.delete({ filepath: C }), i.insert({ filepath: C, oid: Y, stage: 1 }), i.insert({ filepath: C, oid: oe, stage: 2 }), i.insert({ filepath: C, oid: Pe, stage: 3 });
               }
-              return U.mergeResult;
+              return H.mergeResult;
             });
-          if (S && !k && P && await S.type() === "blob" && await P.type() === "blob") {
+          if (S && !k && $ && await S.type() === "blob" && await $.type() === "blob") {
             if (y.push(C), R.push(C), !p) {
-              const U = await S.oid(), Z = await P.oid();
-              i.delete({ filepath: C }), i.insert({ filepath: C, oid: U, stage: 1 }), i.insert({ filepath: C, oid: Z, stage: 3 });
+              const H = await S.oid(), Y = await $.oid();
+              i.delete({ filepath: C }), i.insert({ filepath: C, oid: H, stage: 1 }), i.insert({ filepath: C, oid: Y, stage: 3 });
             }
             return {
-              mode: await P.mode(),
-              oid: await P.oid(),
+              mode: await $.mode(),
+              oid: await $.oid(),
               type: "blob",
               path: A
             };
           }
-          if (S && k && !P && await S.type() === "blob" && await k.type() === "blob") {
+          if (S && k && !$ && await S.type() === "blob" && await k.type() === "blob") {
             if (y.push(C), O.push(C), !p) {
-              const U = await S.oid(), Z = await k.oid();
-              i.delete({ filepath: C }), i.insert({ filepath: C, oid: U, stage: 1 }), i.insert({ filepath: C, oid: Z, stage: 2 });
+              const H = await S.oid(), Y = await k.oid();
+              i.delete({ filepath: C }), i.insert({ filepath: C, oid: H, stage: 1 }), i.insert({ filepath: C, oid: Y, stage: 2 });
             }
             return {
               mode: await k.mode(),
@@ -9645,7 +9645,7 @@ async function qg({
               path: A
             };
           }
-          if (S && !k && !P && await S.type() === "blob")
+          if (S && !k && !$ && await S.type() === "blob")
             return;
           throw new xn();
         }
@@ -9659,14 +9659,14 @@ async function qg({
       const S = k.filter(Boolean);
       if (C && !(C && C.type === "tree" && S.length === 0)) {
         if (S.length > 0) {
-          const A = new ut(S).toObject(), B = await ft({
+          const A = new ft(S).toObject(), I = await dt({
             fs: e,
             gitdir: n,
             type: "tree",
             object: A,
             dryRun: d
           });
-          C.oid = B;
+          C.oid = I;
         }
         return C;
       }
@@ -9681,8 +9681,8 @@ async function qg({
     map: async function(C, [k]) {
       const S = `${r}/${C}`;
       if (await k.type() === "blob") {
-        const P = await k.mode(), A = new TextDecoder().decode(await k.content());
-        await e.write(S, A, { mode: P });
+        const $ = await k.mode(), A = new TextDecoder().decode(await k.content());
+        await e.write(S, A, { mode: $ });
       }
       return !0;
     }
@@ -9726,7 +9726,7 @@ async function Gg({
     branches: [l, o, s],
     contents: [g, m, b],
     path: r
-  }), _ = await ft({
+  }), _ = await dt({
     fs: e,
     gitdir: t,
     type: "blob",
@@ -9754,20 +9754,20 @@ async function Ff({
   onSign: b,
   mergeDriver: v
 }) {
-  i === void 0 && (i = await br({ fs: e, gitdir: n, fullname: !0 })), i = await H.expand({
+  i === void 0 && (i = await br({ fs: e, gitdir: n, fullname: !0 })), i = await U.expand({
     fs: e,
     gitdir: n,
     ref: i
-  }), a = await H.expand({
+  }), a = await U.expand({
     fs: e,
     gitdir: n,
     ref: a
   });
-  const y = await H.resolve({
+  const y = await U.resolve({
     fs: e,
     gitdir: n,
     ref: i
-  }), _ = await H.resolve({
+  }), _ = await U.resolve({
     fs: e,
     gitdir: n,
     ref: a
@@ -9786,7 +9786,7 @@ async function Ff({
       alreadyMerged: !0
     };
   if (o && O === y)
-    return !l && !c && await H.writeRef({ fs: e, gitdir: n, ref: i, value: _ }), {
+    return !l && !c && await U.writeRef({ fs: e, gitdir: n, ref: i, value: _ }), {
       oid: _,
       fastForward: !0
     };
@@ -9866,10 +9866,10 @@ async function Uf({
     if (!u) {
       const A = await br({ fs: e, gitdir: c });
       if (!A)
-        throw new lt("ref");
+        throw new ut("ref");
       u = A;
     }
-    const { fetchHead: S, fetchHeadDescription: P } = await Ts({
+    const { fetchHead: S, fetchHeadDescription: $ } = await Ts({
       fs: e,
       cache: t,
       http: r,
@@ -9897,7 +9897,7 @@ async function Uf({
       theirs: S,
       fastForward: v,
       fastForwardOnly: y,
-      message: `Merge ${P}`,
+      message: `Merge ${$}`,
       author: x,
       committer: C,
       signingKey: k,
@@ -9937,7 +9937,7 @@ async function Yg({
   cache: v = {}
 }) {
   try {
-    $("fs", e), $("http", t), $("gitdir", l);
+    P("fs", e), P("http", t), P("gitdir", l);
     const y = {
       name: "",
       email: "",
@@ -9997,7 +9997,7 @@ async function Zg({
   cache: k = {}
 }) {
   try {
-    return $("fs", e), $("http", t), $("gitdir", l), await Ts({
+    return P("fs", e), P("http", t), P("gitdir", l), await Ts({
       fs: new K(e),
       cache: k,
       http: t,
@@ -10034,7 +10034,7 @@ async function Xg({
   cache: i = {}
 }) {
   try {
-    return $("fs", e), $("gitdir", r), $("oids", n), await As({
+    return P("fs", e), P("gitdir", r), P("oids", n), await As({
       fs: new K(e),
       cache: i,
       gitdir: r,
@@ -10056,14 +10056,14 @@ async function Hf({ fs: e, filepath: t }) {
 }
 async function Vg({ fs: e, filepath: t }) {
   try {
-    return $("fs", e), $("filepath", t), await Hf({ fs: new K(e), filepath: t });
+    return P("fs", e), P("filepath", t), await Hf({ fs: new K(e), filepath: t });
   } catch (r) {
     throw r.caller = "git.findRoot", r;
   }
 }
 async function Kg({ fs: e, dir: t, gitdir: r = N.join(t, ".git"), path: n }) {
   try {
-    return $("fs", e), $("gitdir", r), $("path", n), await Xn({
+    return P("fs", e), P("gitdir", r), P("path", n), await Xn({
       fs: new K(e),
       gitdir: r,
       path: n
@@ -10082,7 +10082,7 @@ async function Qg({
   path: n
 }) {
   try {
-    return $("fs", e), $("gitdir", r), $("path", n), await Jg({
+    return P("fs", e), P("gitdir", r), P("path", n), await Jg({
       fs: new K(e),
       gitdir: r,
       path: n
@@ -10102,7 +10102,7 @@ async function ey({
   forPush: s = !1
 }) {
   try {
-    $("http", e), $("url", a);
+    P("http", e), P("url", a);
     const c = await ka.getRemoteHelperFor({ url: a }).discover({
       http: e,
       onAuth: t,
@@ -10165,7 +10165,7 @@ async function ty({
   protocolVersion: l = 2
 }) {
   try {
-    $("http", e), $("url", a);
+    P("http", e), P("url", a);
     const u = await ka.getRemoteHelperFor({ url: a }).discover({
       http: e,
       onAuth: t,
@@ -10206,7 +10206,7 @@ async function ry({
 }
 async function ny({ object: e }) {
   try {
-    $("object", e), typeof e == "string" ? e = Buffer.from(e, "utf8") : e = Buffer.from(e);
+    P("object", e), typeof e == "string" ? e = Buffer.from(e, "utf8") : e = Buffer.from(e);
     const t = "blob", { oid: r, object: n } = await ry({
       type: "blob",
       format: "content",
@@ -10248,7 +10248,7 @@ async function ay({
   cache: a = {}
 }) {
   try {
-    return $("fs", e), $("dir", r), $("gitdir", r), $("filepath", i), await iy({
+    return P("fs", e), P("dir", r), P("gitdir", r), P("filepath", i), await iy({
       fs: new K(e),
       cache: a,
       onProgress: t,
@@ -10268,7 +10268,7 @@ async function oy({
   defaultBranch: i = "master"
 }) {
   try {
-    return $("fs", e), $("gitdir", n), t || $("dir", r), await Lf({
+    return P("fs", e), P("gitdir", n), t || P("dir", r), await Lf({
       fs: new K(e),
       bare: t,
       dir: r,
@@ -10289,9 +10289,9 @@ async function qf({
 }) {
   const o = await Vn.read({ fs: e, gitdir: r });
   if (!n)
-    throw new lt("oid");
+    throw new ut("oid");
   if (!i)
-    throw new lt("ancestor");
+    throw new ut("ancestor");
   if (n === i) return !1;
   const s = [n], l = /* @__PURE__ */ new Set();
   let c = 0;
@@ -10325,7 +10325,7 @@ async function sy({
   cache: o = {}
 }) {
   try {
-    return $("fs", e), $("gitdir", r), $("oid", n), $("ancestor", i), await qf({
+    return P("fs", e), P("gitdir", r), P("oid", n), P("ancestor", i), await qf({
       fs: new K(e),
       cache: o,
       gitdir: r,
@@ -10344,7 +10344,7 @@ async function cy({
   filepath: n
 }) {
   try {
-    return $("fs", e), $("dir", t), $("gitdir", r), $("filepath", n), kn.isIgnored({
+    return P("fs", e), P("dir", t), P("gitdir", r), P("filepath", n), kn.isIgnored({
       fs: new K(e),
       dir: t,
       gitdir: r,
@@ -10361,7 +10361,7 @@ async function ly({
   remote: n
 }) {
   try {
-    return $("fs", e), $("gitdir", r), H.listBranches({
+    return P("fs", e), P("gitdir", r), U.listBranches({
       fs: new K(e),
       gitdir: r,
       remote: n
@@ -10372,7 +10372,7 @@ async function ly({
 }
 async function uy({ fs: e, gitdir: t, ref: r, cache: n }) {
   if (r) {
-    const i = await H.resolve({ gitdir: t, fs: e, ref: r }), a = [];
+    const i = await U.resolve({ gitdir: t, fs: e, ref: r }), a = [];
     return await Gf({
       fs: e,
       cache: n,
@@ -10413,7 +10413,7 @@ async function fy({
   cache: i = {}
 }) {
   try {
-    return $("fs", e), $("gitdir", r), await uy({
+    return P("fs", e), P("gitdir", r), await uy({
       fs: new K(e),
       cache: i,
       gitdir: r,
@@ -10426,7 +10426,7 @@ async function fy({
 async function dy({ fs: e, cache: t, gitdir: r, ref: n }) {
   let i;
   try {
-    i = await H.resolve({ gitdir: r, fs: e, ref: n });
+    i = await U.resolve({ gitdir: r, fs: e, ref: n });
   } catch (s) {
     if (s instanceof ke)
       return [];
@@ -10449,7 +10449,7 @@ async function hy({
   cache: i = {}
 }) {
   try {
-    return $("fs", e), $("gitdir", r), $("ref", n), await dy({
+    return P("fs", e), P("gitdir", r), P("ref", n), await dy({
       fs: new K(e),
       cache: i,
       gitdir: r,
@@ -10466,7 +10466,7 @@ async function py({
   filepath: n
 }) {
   try {
-    return $("fs", e), $("gitdir", r), H.listRefs({ fs: new K(e), gitdir: r, filepath: n });
+    return P("fs", e), P("gitdir", r), U.listRefs({ fs: new K(e), gitdir: r, filepath: n });
   } catch (i) {
     throw i.caller = "git.listRefs", i;
   }
@@ -10482,7 +10482,7 @@ async function my({ fs: e, gitdir: t }) {
 }
 async function wy({ fs: e, dir: t, gitdir: r = N.join(t, ".git") }) {
   try {
-    return $("fs", e), $("gitdir", r), await my({
+    return P("fs", e), P("gitdir", r), await my({
       fs: new K(e),
       gitdir: r
     });
@@ -10526,7 +10526,7 @@ async function by({
   peelTags: d
 }) {
   try {
-    $("http", e), $("url", a);
+    P("http", e), P("url", a);
     const p = await ca.discover({
       http: e,
       onAuth: t,
@@ -10556,7 +10556,7 @@ async function by({
 }
 async function _y({ fs: e, dir: t, gitdir: r = N.join(t, ".git") }) {
   try {
-    return $("fs", e), $("gitdir", r), H.listTags({ fs: new K(e), gitdir: r });
+    return P("fs", e), P("gitdir", r), U.listTags({ fs: new K(e), gitdir: r });
   } catch (n) {
     throw n.caller = "git.listTags", n;
   }
@@ -10601,7 +10601,7 @@ async function Yf({
         fs: e,
         cache: t,
         gitdir: r,
-        tree: ut.from(d),
+        tree: ft.from(d),
         fileId: i,
         oid: a,
         filepaths: o,
@@ -10622,7 +10622,7 @@ async function Ey({
   force: s,
   follow: l
 }) {
-  const c = typeof o > "u" ? void 0 : Math.floor(o.valueOf() / 1e3), u = [], d = await Vn.read({ fs: e, gitdir: r }), p = await H.resolve({ fs: e, gitdir: r, ref: i }), m = [await fn({ fs: e, cache: t, gitdir: r, oid: p })];
+  const c = typeof o > "u" ? void 0 : Math.floor(o.valueOf() / 1e3), u = [], d = await Vn.read({ fs: e, gitdir: r }), p = await U.resolve({ fs: e, gitdir: r, ref: i }), m = [await fn({ fs: e, cache: t, gitdir: r, oid: p })];
   let g, b, v;
   function y(_) {
     v && n && u.push(_);
@@ -10707,7 +10707,7 @@ async function Sy({
   cache: c = {}
 }) {
   try {
-    return $("fs", e), $("gitdir", r), $("ref", i), await Ey({
+    return P("fs", e), P("gitdir", r), P("ref", i), await Ey({
       fs: new K(e),
       cache: c,
       gitdir: r,
@@ -10742,7 +10742,7 @@ async function ky({
   mergeDriver: v
 }) {
   try {
-    $("fs", e), g && $("onSign", t);
+    P("fs", e), g && P("onSign", t);
     const y = new K(e), _ = await gr({ fs: y, gitdir: n, author: p });
     if (!_ && (!s || !o))
       throw new Je("author");
@@ -10831,7 +10831,7 @@ async function Cy({
   cache: a = {}
 }) {
   try {
-    return $("fs", e), $("gitdir", r), $("oids", n), await Oy({
+    return P("fs", e), P("gitdir", r), P("oids", n), await Oy({
       fs: new K(e),
       cache: a,
       gitdir: r,
@@ -10869,13 +10869,13 @@ async function Py({
   cache: k = {}
 }) {
   try {
-    $("fs", e), $("gitdir", l);
-    const S = new K(e), P = await gr({ fs: S, gitdir: l, author: O });
-    if (!P) throw new Je("author");
+    P("fs", e), P("gitdir", l);
+    const S = new K(e), $ = await gr({ fs: S, gitdir: l, author: O });
+    if (!$) throw new Je("author");
     const A = await un({
       fs: S,
       gitdir: l,
-      author: P,
+      author: $,
       committer: x
     });
     if (!A) throw new Je("committer");
@@ -10899,7 +10899,7 @@ async function Py({
       corsProxy: y,
       singleBranch: _,
       headers: R,
-      author: P,
+      author: $,
       committer: A,
       signingKey: C,
       prune: m,
@@ -10919,10 +10919,10 @@ async function $y({
 }) {
   const o = await Vn.read({ fs: e, gitdir: n }), s = /* @__PURE__ */ new Set(), l = /* @__PURE__ */ new Set();
   for (const d of i)
-    s.add(await H.resolve({ fs: e, gitdir: n, ref: d }));
+    s.add(await U.resolve({ fs: e, gitdir: n, ref: d }));
   for (const d of a)
     try {
-      const p = await H.resolve({ fs: e, gitdir: n, ref: d });
+      const p = await U.resolve({ fs: e, gitdir: n, ref: d });
       l.add(p);
     } catch {
     }
@@ -10965,7 +10965,7 @@ async function xo({
       const d = Ae.from(c).headers().tree;
       await o(d);
     } else if (l === "tree") {
-      const u = ut.from(c);
+      const u = ft.from(c);
       for (const d of u)
         d.type === "blob" && a.add(d.oid), d.type === "tree" && await o(d.oid);
     }
@@ -11037,17 +11037,17 @@ async function Dy({
 }) {
   const _ = u || await br({ fs: e, gitdir: c });
   if (typeof _ > "u")
-    throw new lt("ref");
+    throw new ut("ref");
   const R = await Me.get({ fs: e, gitdir: c });
   p = p || await R.get(`branch.${_}.pushRemote`) || await R.get("remote.pushDefault") || await R.get(`branch.${_}.remote`) || "origin";
   const O = m || await R.get(`remote.${p}.pushurl`) || await R.get(`remote.${p}.url`);
   if (typeof O > "u")
-    throw new lt("remote OR url");
+    throw new ut("remote OR url");
   const x = d || await R.get(`branch.${_}.merge`);
   if (typeof O > "u")
-    throw new lt("remoteRef");
+    throw new ut("remoteRef");
   v === void 0 && (v = await R.get("http.corsProxy"));
-  const C = await H.expand({ fs: e, gitdir: c, ref: _ }), k = b ? "0000000000000000000000000000000000000000" : await H.resolve({ fs: e, gitdir: c, ref: C }), S = ka.getRemoteHelperFor({ url: O }), P = await S.discover({
+  const C = await U.expand({ fs: e, gitdir: c, ref: _ }), k = b ? "0000000000000000000000000000000000000000" : await U.resolve({ fs: e, gitdir: c, ref: C }), S = ka.getRemoteHelperFor({ url: O }), $ = await S.discover({
     http: r,
     onAuth: a,
     onAuthSuccess: o,
@@ -11057,34 +11057,34 @@ async function Dy({
     url: O,
     headers: y,
     protocolVersion: 1
-  }), A = P.auth;
-  let B;
+  }), A = $.auth;
+  let I;
   if (!x)
-    B = C;
+    I = C;
   else
     try {
-      B = await H.expandAgainstMap({
+      I = await U.expandAgainstMap({
         ref: x,
-        map: P.refs
+        map: $.refs
       });
     } catch (F) {
       if (F instanceof ke)
-        B = x.startsWith("refs/") ? x : `refs/heads/${x}`;
+        I = x.startsWith("refs/") ? x : `refs/heads/${x}`;
       else
         throw F;
     }
-  const M = P.refs.get(B) || "0000000000000000000000000000000000000000";
+  const M = $.refs.get(I) || "0000000000000000000000000000000000000000";
   if (l && !await l({
     remote: p,
     url: O,
     localRef: { ref: b ? "(delete)" : C, oid: k },
-    remoteRef: { ref: B, oid: M }
+    remoteRef: { ref: I, oid: M }
   }))
     throw new Sn();
-  const U = !P.capabilities.has("no-thin");
-  let Z = /* @__PURE__ */ new Set();
+  const H = !$.capabilities.has("no-thin");
+  let Y = /* @__PURE__ */ new Set();
   if (!b) {
-    const F = [...P.refs.values()];
+    const F = [...$.refs.values()];
     let q = /* @__PURE__ */ new Set();
     if (M !== "0000000000000000000000000000000000000000") {
       const W = await As({
@@ -11094,7 +11094,7 @@ async function Dy({
         oids: [k, M]
       });
       for (const ee of W) F.push(ee);
-      U && (q = await xo({ fs: e, cache: t, gitdir: c, oids: W }));
+      H && (q = await xo({ fs: e, cache: t, gitdir: c, oids: W }));
     }
     if (!F.includes(k)) {
       const W = await $y({
@@ -11104,26 +11104,26 @@ async function Dy({
         start: [k],
         finish: F
       });
-      Z = await xo({ fs: e, cache: t, gitdir: c, oids: W });
+      Y = await xo({ fs: e, cache: t, gitdir: c, oids: W });
     }
-    if (U) {
+    if (H) {
       try {
-        const W = await H.resolve({
+        const W = await U.resolve({
           fs: e,
           gitdir: c,
           ref: `refs/remotes/${p}/HEAD`,
           depth: 2
-        }), { oid: ee } = await H.resolveAgainstMap({
+        }), { oid: ee } = await U.resolveAgainstMap({
           ref: W.replace(`refs/remotes/${p}/`, ""),
           fullref: W,
-          map: P.refs
-        }), I = [ee];
-        for (const Q of await xo({ fs: e, cache: t, gitdir: c, oids: I }))
+          map: $.refs
+        }), B = [ee];
+        for (const Q of await xo({ fs: e, cache: t, gitdir: c, oids: B }))
           q.add(Q);
       } catch {
       }
       for (const W of q)
-        Z.delete(W);
+        Y.delete(W);
     }
     if (k === M && (g = !0), !g) {
       if (C.startsWith("refs/tags") && M !== "0000000000000000000000000000000000000000")
@@ -11139,17 +11139,17 @@ async function Dy({
         throw new cn("not-fast-forward");
     }
   }
-  const fe = zf(
-    [...P.capabilities],
+  const oe = zf(
+    [...$.capabilities],
     ["report-status", "side-band-64k", `agent=${Ra.agent}`]
   ), Pe = await Ay({
-    capabilities: fe,
-    triplets: [{ oldoid: M, oid: k, fullRef: B }]
+    capabilities: oe,
+    triplets: [{ oldoid: M, oid: k, fullRef: I }]
   }), me = b ? [] : await Zf({
     fs: e,
     cache: t,
     gitdir: c,
-    oids: [...Z]
+    oids: [...Y]
   }), be = await S.connect({
     http: r,
     onProgress: n,
@@ -11166,20 +11166,20 @@ async function Dy({
       await i(q);
     });
   }
-  const le = await Ty(Ye);
-  if (be.headers && (le.headers = be.headers), p && le.ok && le.refs[B].ok && !C.startsWith("refs/tags")) {
-    const F = `refs/remotes/${p}/${B.replace(
+  const ue = await Ty(Ye);
+  if (be.headers && (ue.headers = be.headers), p && ue.ok && ue.refs[I].ok && !C.startsWith("refs/tags")) {
+    const F = `refs/remotes/${p}/${I.replace(
       "refs/heads",
       ""
     )}`;
-    b ? await H.deleteRef({ fs: e, gitdir: c, ref: F }) : await H.writeRef({ fs: e, gitdir: c, ref: F, value: k });
+    b ? await U.deleteRef({ fs: e, gitdir: c, ref: F }) : await U.writeRef({ fs: e, gitdir: c, ref: F, value: k });
   }
-  if (le.ok && Object.values(le.refs).every((F) => F.ok))
-    return le;
+  if (ue.ok && Object.values(ue.refs).every((F) => F.ok))
+    return ue;
   {
-    const F = Object.entries(le.refs).filter(([q, W]) => !W.ok).map(([q, W]) => `
+    const F = Object.entries(ue.refs).filter(([q, W]) => !W.ok).map(([q, W]) => `
   - ${q}: ${W.error}`).join("");
-    throw new di(F, le);
+    throw new di(F, ue);
   }
 }
 async function Iy({
@@ -11204,7 +11204,7 @@ async function Iy({
   cache: _ = {}
 }) {
   try {
-    return $("fs", e), $("http", t), $("gitdir", c), await Dy({
+    return P("fs", e), P("http", t), P("gitdir", c), await Dy({
       fs: new K(e),
       cache: _,
       http: t,
@@ -11259,7 +11259,7 @@ async function By({
   cache: a = {}
 }) {
   try {
-    return $("fs", e), $("gitdir", r), $("oid", n), await Vf({
+    return P("fs", e), P("gitdir", r), P("oid", n), await Vf({
       fs: new K(e),
       cache: a,
       gitdir: r,
@@ -11278,7 +11278,7 @@ async function Kf({
   cache: i = {}
 }) {
   try {
-    return $("fs", e), $("gitdir", r), $("oid", n), await fn({
+    return P("fs", e), P("gitdir", r), P("oid", n), await fn({
       fs: new K(e),
       cache: i,
       gitdir: r,
@@ -11295,7 +11295,7 @@ async function jy({
   ref: n = "refs/notes/commits",
   oid: i
 }) {
-  const a = await H.resolve({ gitdir: r, fs: e, ref: n }), { blob: o } = await Vf({
+  const a = await U.resolve({ gitdir: r, fs: e, ref: n }), { blob: o } = await Vf({
     fs: e,
     cache: t,
     gitdir: r,
@@ -11313,7 +11313,7 @@ async function zy({
   cache: a = {}
 }) {
   try {
-    return $("fs", e), $("gitdir", r), $("ref", n), $("oid", i), await jy({
+    return P("fs", e), P("gitdir", r), P("ref", n), P("oid", i), await jy({
       fs: new K(e),
       cache: a,
       gitdir: r,
@@ -11335,7 +11335,7 @@ async function Ny({
   cache: s = {}
 }) {
   try {
-    $("fs", e), $("gitdir", r), $("oid", n);
+    P("fs", e), P("gitdir", r), P("oid", n);
     const l = new K(e);
     a !== void 0 && (n = await vi({
       fs: l,
@@ -11357,7 +11357,7 @@ async function Ny({
           u.object = Ae.from(u.object).parse();
           break;
         case "tree":
-          u.object = ut.from(u.object).entries();
+          u.object = ft.from(u.object).entries();
           break;
         case "blob":
           o ? u.object = u.object.toString(o) : (u.object = new Uint8Array(u.object), u.format = "content");
@@ -11403,7 +11403,7 @@ async function Ly({
   cache: i = {}
 }) {
   try {
-    return $("fs", e), $("gitdir", r), $("oid", n), await My({
+    return P("fs", e), P("gitdir", r), P("oid", n), await My({
       fs: new K(e),
       cache: i,
       gitdir: r,
@@ -11422,7 +11422,7 @@ async function Fy({
   cache: a = {}
 }) {
   try {
-    return $("fs", e), $("gitdir", r), $("oid", n), await Rn({
+    return P("fs", e), P("gitdir", r), P("oid", n), await Rn({
       fs: new K(e),
       cache: a,
       gitdir: r,
@@ -11441,7 +11441,7 @@ async function Uy({
   cache: i = {}
 }) {
   try {
-    $("fs", e), $("gitdir", r), $("filepath", n), await Ue.acquire(
+    P("fs", e), P("gitdir", r), P("filepath", n), await Ue.acquire(
       { fs: new K(e), gitdir: r, cache: i },
       async function(a) {
         a.delete({ filepath: n });
@@ -11464,7 +11464,7 @@ async function Hy({
 }) {
   let c;
   try {
-    c = await H.resolve({ gitdir: n, fs: e, ref: i });
+    c = await U.resolve({ gitdir: n, fs: e, ref: i });
   } catch (g) {
     if (!(g instanceof ke))
       throw g;
@@ -11508,7 +11508,7 @@ async function Wy({
   cache: c = {}
 }) {
   try {
-    $("fs", e), $("gitdir", n), $("oid", a);
+    P("fs", e), P("gitdir", n), P("oid", a);
     const u = new K(e), d = await gr({ fs: u, gitdir: n, author: o });
     if (!d) throw new Je("author");
     const p = await un({
@@ -11545,21 +11545,21 @@ async function qy({
   if (r !== Ft.clean(r))
     throw new Rt(r, Ft.clean(r));
   const a = `refs/heads/${r}`, o = `refs/heads/${n}`;
-  if (await H.exists({ fs: e, gitdir: t, ref: o }))
+  if (await U.exists({ fs: e, gitdir: t, ref: o }))
     throw new Pt("branch", n, !1);
-  const l = await H.resolve({
+  const l = await U.resolve({
     fs: e,
     gitdir: t,
     ref: a,
     depth: 1
   });
-  await H.writeRef({ fs: e, gitdir: t, ref: o, value: l }), await H.deleteRef({ fs: e, gitdir: t, ref: a });
+  await U.writeRef({ fs: e, gitdir: t, ref: o, value: l }), await U.deleteRef({ fs: e, gitdir: t, ref: a });
   const u = await br({
     fs: e,
     gitdir: t,
     fullname: !0
   }) === a;
-  (i || u) && await H.writeSymbolicRef({
+  (i || u) && await U.writeSymbolicRef({
     fs: e,
     gitdir: t,
     ref: "HEAD",
@@ -11575,7 +11575,7 @@ async function Gy({
   checkout: a = !1
 }) {
   try {
-    return $("fs", e), $("gitdir", r), $("ref", n), $("oldref", i), await qy({
+    return P("fs", e), P("gitdir", r), P("ref", n), P("oldref", i), await qy({
       fs: new K(e),
       gitdir: r,
       ref: n,
@@ -11598,11 +11598,11 @@ async function Yy({
   cache: a = {}
 }) {
   try {
-    $("fs", e), $("gitdir", r), $("filepath", n);
+    P("fs", e), P("gitdir", r), P("filepath", n);
     const o = new K(e);
     let s, l;
     try {
-      s = await H.resolve({ fs: o, gitdir: r, ref: i || "HEAD" });
+      s = await U.resolve({ fs: o, gitdir: r, ref: i || "HEAD" });
     } catch (d) {
       if (i)
         throw d;
@@ -11649,7 +11649,7 @@ async function Zy({
   depth: i
 }) {
   try {
-    return $("fs", e), $("gitdir", r), $("ref", n), await H.resolve({
+    return P("fs", e), P("gitdir", r), P("ref", n), await U.resolve({
       fs: new K(e),
       gitdir: r,
       ref: n,
@@ -11668,7 +11668,7 @@ async function Xy({
   append: a = !1
 }) {
   try {
-    $("fs", e), $("gitdir", r), $("path", n);
+    P("fs", e), P("gitdir", r), P("path", n);
     const o = new K(e), s = await Me.get({ fs: o, gitdir: r });
     a ? await s.append(n, i) : await s.set(n, i), await Me.save({ fs: o, gitdir: r, config: s });
   } catch (o) {
@@ -11677,7 +11677,7 @@ async function Xy({
 }
 async function Qf({ fs: e, gitdir: t, commit: r }) {
   const n = Ae.from(r).toObject();
-  return await ft({
+  return await dt({
     fs: e,
     gitdir: t,
     type: "commit",
@@ -11715,7 +11715,7 @@ async function Ky(e, t, r, n, i = null) {
   const a = N.join(r, n), o = await e.lstat(a);
   if (!o) throw new ke(a);
   if (o.isDirectory())
-    throw new se(
+    throw new ce(
       `${a}: file expected, but found directory`
     );
   const s = i ? await xf({ fs: e, gitdir: t, oid: i }) : void 0;
@@ -11723,7 +11723,7 @@ async function Ky(e, t, r, n, i = null) {
   return s || await dn({ fs: e, gitdir: t, currentFilepath: a }, async () => {
     const c = o.isSymbolicLink() ? await e.readlink(a).then(Cf) : await e.read(a);
     if (c === null) throw new ke(a);
-    l = await ft({ fs: e, gitdir: t, type: "blob", object: c });
+    l = await dt({ fs: e, gitdir: t, type: "blob", object: c });
   }), l;
 }
 async function Jy({ fs: e, dir: t, gitdir: r, entries: n }) {
@@ -11928,7 +11928,7 @@ class Vt {
     }) : {};
   }
   async writeStashRef(t) {
-    return H.writeRef({
+    return U.writeRef({
       fs: this.fs,
       gitdir: this.gitdir,
       ref: Vt.refStash,
@@ -11960,7 +11960,7 @@ async function eb({ fs: e, dir: t, gitdir: r, message: n = "" }) {
     fs: e,
     gitdir: r,
     fullname: !1
-  }), o = await H.resolve({
+  }), o = await U.resolve({
     fs: e,
     gitdir: r,
     ref: "HEAD"
@@ -12085,7 +12085,7 @@ async function ib({
   message: i = "",
   refIdx: a = 0
 }) {
-  $("fs", e), $("dir", t), $("gitdir", r), $("op", n);
+  P("fs", e), P("dir", t), P("gitdir", r), P("op", n);
   const o = {
     push: eb,
     apply: ed,
@@ -12121,7 +12121,7 @@ async function ab({
   cache: i = {}
 }) {
   try {
-    $("fs", e), $("gitdir", r), $("filepath", n);
+    P("fs", e), P("gitdir", r), P("filepath", n);
     const a = new K(e);
     if (await kn.isIgnored({
       fs: a,
@@ -12189,7 +12189,7 @@ async function rd({ fs: e, cache: t, gitdir: r, tree: n, path: i }) {
         oid: o.oid
       });
       if (s === "tree") {
-        const c = ut.from(l);
+        const c = ft.from(l);
         return rd({ fs: e, cache: t, gitdir: r, tree: c, path: i });
       }
       if (s === "blob")
@@ -12200,7 +12200,7 @@ async function rd({ fs: e, cache: t, gitdir: r, tree: n, path: i }) {
 async function ob({ fs: e, cache: t, gitdir: r }) {
   let n;
   try {
-    n = await H.resolve({ fs: e, gitdir: r, ref: "HEAD" });
+    n = await U.resolve({ fs: e, gitdir: r, ref: "HEAD" });
   } catch (a) {
     if (a instanceof ke)
       return [];
@@ -12219,7 +12219,7 @@ async function sb({
   ignored: s = !1
 }) {
   try {
-    $("fs", e), $("gitdir", r), $("ref", n);
+    P("fs", e), P("gitdir", r), P("ref", n);
     const l = new K(e);
     return await wr({
       fs: l,
@@ -12267,19 +12267,19 @@ async function cb({
   force: a = !1
 }) {
   try {
-    $("fs", e), $("gitdir", r), $("ref", n);
+    P("fs", e), P("gitdir", r), P("ref", n);
     const o = new K(e);
     if (n === void 0)
-      throw new lt("ref");
+      throw new ut("ref");
     n = n.startsWith("refs/tags/") ? n : `refs/tags/${n}`;
-    const s = await H.resolve({
+    const s = await U.resolve({
       fs: o,
       gitdir: r,
       ref: i || "HEAD"
     });
-    if (!a && await H.exists({ fs: o, gitdir: r, ref: n }))
+    if (!a && await U.exists({ fs: o, gitdir: r, ref: n }))
       throw new Pt("tag", n);
-    await H.writeRef({ fs: o, gitdir: r, ref: n, value: s });
+    await U.writeRef({ fs: o, gitdir: r, ref: n, value: s });
   } catch (o) {
     throw o.caller = "git.tag", o;
   }
@@ -12297,7 +12297,7 @@ async function lb({
   force: c
 }) {
   try {
-    $("fs", e), $("gitdir", r), $("filepath", i);
+    P("fs", e), P("gitdir", r), P("filepath", i);
     const u = new K(e);
     if (l)
       return await Ue.acquire(
@@ -12341,7 +12341,7 @@ async function lb({
       if (!a) {
         m = d;
         const g = m.isSymbolicLink() ? await u.readlink(N.join(t, i)) : await u.read(N.join(t, i));
-        a = await ft({
+        a = await dt({
           fs: u,
           gitdir: r,
           type: "blob",
@@ -12377,7 +12377,7 @@ async function fb({
   cache: s = {}
 }) {
   try {
-    return $("fs", e), $("gitdir", r), $("trees", n), await wr({
+    return P("fs", e), P("gitdir", r), P("trees", n), await wr({
       fs: new K(e),
       cache: s,
       dir: t,
@@ -12393,7 +12393,7 @@ async function fb({
 }
 async function db({ fs: e, dir: t, gitdir: r = N.join(t, ".git"), blob: n }) {
   try {
-    return $("fs", e), $("gitdir", r), $("blob", n), await ft({
+    return P("fs", e), P("gitdir", r), P("blob", n), await dt({
       fs: new K(e),
       gitdir: r,
       type: "blob",
@@ -12411,7 +12411,7 @@ async function hb({
   commit: n
 }) {
   try {
-    return $("fs", e), $("gitdir", r), $("commit", n), await Qf({
+    return P("fs", e), P("gitdir", r), P("commit", n), await Qf({
       fs: new K(e),
       gitdir: r,
       commit: n
@@ -12438,7 +12438,7 @@ async function pb({
           i = Ae.from(i).toObject();
           break;
         case "tree":
-          i = ut.from(i).toObject();
+          i = ft.from(i).toObject();
           break;
         case "blob":
           i = Buffer.from(i, s);
@@ -12451,7 +12451,7 @@ async function pb({
       }
       a = "content";
     }
-    return o = await ft({
+    return o = await dt({
       fs: l,
       gitdir: r,
       type: n,
@@ -12473,22 +12473,22 @@ async function mb({
   symbolic: o = !1
 }) {
   try {
-    $("fs", e), $("gitdir", r), $("ref", n), $("value", i);
+    P("fs", e), P("gitdir", r), P("ref", n), P("value", i);
     const s = new K(e);
     if (n !== Ft.clean(n))
       throw new Rt(n, Ft.clean(n));
-    if (!a && await H.exists({ fs: s, gitdir: r, ref: n }))
+    if (!a && await U.exists({ fs: s, gitdir: r, ref: n }))
       throw new Pt("ref", n);
-    o ? await H.writeSymbolicRef({
+    o ? await U.writeSymbolicRef({
       fs: s,
       gitdir: r,
       ref: n,
       value: i
-    }) : (i = await H.resolve({
+    }) : (i = await U.resolve({
       fs: s,
       gitdir: r,
       ref: i
-    }), await H.writeRef({
+    }), await U.writeRef({
       fs: s,
       gitdir: r,
       ref: n,
@@ -12500,7 +12500,7 @@ async function mb({
 }
 async function wb({ fs: e, gitdir: t, tag: r }) {
   const n = nt.from(r).toObject();
-  return await ft({
+  return await dt({
     fs: e,
     gitdir: t,
     type: "tag",
@@ -12510,7 +12510,7 @@ async function wb({ fs: e, gitdir: t, tag: r }) {
 }
 async function gb({ fs: e, dir: t, gitdir: r = N.join(t, ".git"), tag: n }) {
   try {
-    return $("fs", e), $("gitdir", r), $("tag", n), await wb({
+    return P("fs", e), P("gitdir", r), P("tag", n), await wb({
       fs: new K(e),
       gitdir: r,
       tag: n
@@ -12521,7 +12521,7 @@ async function gb({ fs: e, dir: t, gitdir: r = N.join(t, ".git"), tag: n }) {
 }
 async function yb({ fs: e, dir: t, gitdir: r = N.join(t, ".git"), tree: n }) {
   try {
-    return $("fs", e), $("gitdir", r), $("tree", n), await xi({
+    return P("fs", e), P("gitdir", r), P("tree", n), await xi({
       fs: new K(e),
       gitdir: r,
       tree: n
@@ -13014,8 +13014,8 @@ Se.typeOf = gt;
 ld.exports = Se;
 var zs = ld.exports;
 function Ub(e) {
-  function t(F, q, W, ee, I) {
-    for (var Q = 0, D = 0, G = 0, X = 0, Y, L, V = 0, te = 0, J, oe = J = Y = 0, re = 0, ne = 0, Ee = 0, _e = 0, yt = W.length, Le = yt - 1, Ce, ie = "", xe = "", On = "", w = "", f; re < yt; ) {
+  function t(F, q, W, ee, B) {
+    for (var Q = 0, D = 0, G = 0, X = 0, Z, L, V = 0, te = 0, J, se = J = Z = 0, re = 0, ne = 0, Ee = 0, _e = 0, yt = W.length, Le = yt - 1, Ce, ie = "", xe = "", On = "", w = "", f; re < yt; ) {
       if (L = W.charCodeAt(re), re === Le && D + X + G + Q !== 0 && (D !== 0 && (L = D === 47 ? 10 : 47), X = G = Q = 0, yt++, Le++), D + X + G + Q === 0) {
         if (re === Le && (0 < ne && (ie = ie.replace(p, "")), 0 < ie.trim().length)) {
           switch (L) {
@@ -13032,7 +13032,7 @@ function Ub(e) {
         }
         switch (L) {
           case 123:
-            for (ie = ie.trim(), Y = ie.charCodeAt(0), J = 1, _e = ++re; re < yt; ) {
+            for (ie = ie.trim(), Z = ie.charCodeAt(0), J = 1, _e = ++re; re < yt; ) {
               switch (L = W.charCodeAt(re)) {
                 case 123:
                   J++;
@@ -13045,21 +13045,21 @@ function Ub(e) {
                     case 42:
                     case 47:
                       e: {
-                        for (oe = re + 1; oe < Le; ++oe)
-                          switch (W.charCodeAt(oe)) {
+                        for (se = re + 1; se < Le; ++se)
+                          switch (W.charCodeAt(se)) {
                             case 47:
-                              if (L === 42 && W.charCodeAt(oe - 1) === 42 && re + 2 !== oe) {
-                                re = oe + 1;
+                              if (L === 42 && W.charCodeAt(se - 1) === 42 && re + 2 !== se) {
+                                re = se + 1;
                                 break e;
                               }
                               break;
                             case 10:
                               if (L === 47) {
-                                re = oe + 1;
+                                re = se + 1;
                                 break e;
                               }
                           }
-                        re = oe;
+                        re = se;
                       }
                   }
                   break;
@@ -13075,7 +13075,7 @@ function Ub(e) {
               if (J === 0) break;
               re++;
             }
-            switch (J = W.substring(_e, re), Y === 0 && (Y = (ie = ie.replace(d, "").trim()).charCodeAt(0)), Y) {
+            switch (J = W.substring(_e, re), Z === 0 && (Z = (ie = ie.replace(d, "").trim()).charCodeAt(0)), Z) {
               case 64:
                 switch (0 < ne && (ie = ie.replace(p, "")), L = ie.charCodeAt(1), L) {
                   case 100:
@@ -13087,7 +13087,7 @@ function Ub(e) {
                   default:
                     ne = Pe;
                 }
-                if (J = t(q, ne, J, L, I + 1), _e = J.length, 0 < be && (ne = r(Pe, ie, Ee), f = s(3, J, ne, q, U, M, _e, L, I, ee), ie = ne.join(""), f !== void 0 && (_e = (J = f.trim()).length) === 0 && (L = 0, J = "")), 0 < _e) switch (L) {
+                if (J = t(q, ne, J, L, B + 1), _e = J.length, 0 < be && (ne = r(Pe, ie, Ee), f = s(3, J, ne, q, H, M, _e, L, B, ee), ie = ne.join(""), f !== void 0 && (_e = (J = f.trim()).length) === 0 && (L = 0, J = "")), 0 < _e) switch (L) {
                   case 115:
                     ie = ie.replace(C, o);
                   case 100:
@@ -13096,7 +13096,7 @@ function Ub(e) {
                     J = ie + "{" + J + "}";
                     break;
                   case 107:
-                    ie = ie.replace(_, "$1 $2"), J = ie + "{" + J + "}", J = fe === 1 || fe === 2 && a("@" + J, 3) ? "@-webkit-" + J + "@" + J : "@" + J;
+                    ie = ie.replace(_, "$1 $2"), J = ie + "{" + J + "}", J = oe === 1 || oe === 2 && a("@" + J, 3) ? "@-webkit-" + J + "@" + J : "@" + J;
                     break;
                   default:
                     J = ie + J, ee === 112 && (J = (xe += J, ""));
@@ -13104,13 +13104,13 @@ function Ub(e) {
                 else J = "";
                 break;
               default:
-                J = t(q, r(q, ie, Ee), J, ee, I + 1);
+                J = t(q, r(q, ie, Ee), J, ee, B + 1);
             }
-            On += J, J = Ee = ne = oe = Y = 0, ie = "", L = W.charCodeAt(++re);
+            On += J, J = Ee = ne = se = Z = 0, ie = "", L = W.charCodeAt(++re);
             break;
           case 125:
           case 59:
-            if (ie = (0 < ne ? ie.replace(p, "") : ie).trim(), 1 < (_e = ie.length)) switch (oe === 0 && (Y = ie.charCodeAt(0), Y === 45 || 96 < Y && 123 > Y) && (_e = (ie = ie.replace(" ", ":")).length), 0 < be && (f = s(1, ie, q, F, U, M, xe.length, ee, I, ee)) !== void 0 && (_e = (ie = f.trim()).length) === 0 && (ie = "\0\0"), Y = ie.charCodeAt(0), L = ie.charCodeAt(1), Y) {
+            if (ie = (0 < ne ? ie.replace(p, "") : ie).trim(), 1 < (_e = ie.length)) switch (se === 0 && (Z = ie.charCodeAt(0), Z === 45 || 96 < Z && 123 > Z) && (_e = (ie = ie.replace(" ", ":")).length), 0 < be && (f = s(1, ie, q, F, H, M, xe.length, ee, B, ee)) !== void 0 && (_e = (ie = f.trim()).length) === 0 && (ie = "\0\0"), Z = ie.charCodeAt(0), L = ie.charCodeAt(1), Z) {
               case 0:
                 break;
               case 64:
@@ -13119,15 +13119,15 @@ function Ub(e) {
                   break;
                 }
               default:
-                ie.charCodeAt(_e - 1) !== 58 && (xe += i(ie, Y, L, ie.charCodeAt(2)));
+                ie.charCodeAt(_e - 1) !== 58 && (xe += i(ie, Z, L, ie.charCodeAt(2)));
             }
-            Ee = ne = oe = Y = 0, ie = "", L = W.charCodeAt(++re);
+            Ee = ne = se = Z = 0, ie = "", L = W.charCodeAt(++re);
         }
       }
       switch (L) {
         case 13:
         case 10:
-          D === 47 ? D = 0 : 1 + Y === 0 && ee !== 107 && 0 < ie.length && (ne = 1, ie += "\0"), 0 < be * Ze && s(0, ie, q, F, U, M, xe.length, ee, I, ee), M = 1, U++;
+          D === 47 ? D = 0 : 1 + Z === 0 && ee !== 107 && 0 < ie.length && (ne = 1, ie += "\0"), 0 < be * Ze && s(0, ie, q, F, H, M, xe.length, ee, B, ee), M = 1, H++;
           break;
         case 59:
         case 125:
@@ -13163,15 +13163,15 @@ function Ub(e) {
               X + D + Q === 0 && (ne = Ee = 1, Ce = "\f" + Ce);
               break;
             case 108:
-              if (X + D + Q + Z === 0 && 0 < oe) switch (re - oe) {
+              if (X + D + Q + Y === 0 && 0 < se) switch (re - se) {
                 case 2:
-                  V === 112 && W.charCodeAt(re - 3) === 58 && (Z = V);
+                  V === 112 && W.charCodeAt(re - 3) === 58 && (Y = V);
                 case 8:
-                  te === 111 && (Z = te);
+                  te === 111 && (Y = te);
               }
               break;
             case 58:
-              X + D + Q === 0 && (oe = re);
+              X + D + Q === 0 && (se = re);
               break;
             case 44:
               D + G + X + Q === 0 && (ne = 1, Ce += "\r");
@@ -13191,17 +13191,17 @@ function Ub(e) {
               break;
             case 40:
               if (X + D + Q === 0) {
-                if (Y === 0) switch (2 * V + 3 * te) {
+                if (Z === 0) switch (2 * V + 3 * te) {
                   case 533:
                     break;
                   default:
-                    Y = 1;
+                    Z = 1;
                 }
                 G++;
               }
               break;
             case 64:
-              D + G + X + Q + oe + J === 0 && (J = 1);
+              D + G + X + Q + se + J === 0 && (J = 1);
               break;
             case 42:
             case 47:
@@ -13224,16 +13224,16 @@ function Ub(e) {
       te = V, V = L, re++;
     }
     if (_e = xe.length, 0 < _e) {
-      if (ne = q, 0 < be && (f = s(2, xe, ne, F, U, M, _e, ee, I, ee), f !== void 0 && (xe = f).length === 0)) return w + xe + On;
-      if (xe = ne.join(",") + "{" + xe + "}", fe * Z !== 0) {
-        switch (fe !== 2 || a(xe, 2) || (Z = 0), Z) {
+      if (ne = q, 0 < be && (f = s(2, xe, ne, F, H, M, _e, ee, B, ee), f !== void 0 && (xe = f).length === 0)) return w + xe + On;
+      if (xe = ne.join(",") + "{" + xe + "}", oe * Y !== 0) {
+        switch (oe !== 2 || a(xe, 2) || (Y = 0), Y) {
           case 111:
             xe = xe.replace(O, ":-moz-$1") + xe;
             break;
           case 112:
             xe = xe.replace(R, "::-webkit-input-$1") + xe.replace(R, "::-moz-$1") + xe.replace(R, ":-ms-input-$1") + xe;
         }
-        Z = 0;
+        Y = 0;
       }
     }
     return w + xe + On;
@@ -13241,17 +13241,17 @@ function Ub(e) {
   function r(F, q, W) {
     var ee = q.trim().split(v);
     q = ee;
-    var I = ee.length, Q = F.length;
+    var B = ee.length, Q = F.length;
     switch (Q) {
       case 0:
       case 1:
         var D = 0;
-        for (F = Q === 0 ? "" : F[0] + " "; D < I; ++D)
+        for (F = Q === 0 ? "" : F[0] + " "; D < B; ++D)
           q[D] = n(F, q[D], W).trim();
         break;
       default:
         var G = D = 0;
-        for (q = []; D < I; ++D)
+        for (q = []; D < B; ++D)
           for (var X = 0; X < Q; ++X)
             q[G++] = n(F[X] + " ", ee[D], W).trim();
     }
@@ -13270,113 +13270,113 @@ function Ub(e) {
     return F + q;
   }
   function i(F, q, W, ee) {
-    var I = F + ";", Q = 2 * q + 3 * W + 4 * ee;
+    var B = F + ";", Q = 2 * q + 3 * W + 4 * ee;
     if (Q === 944) {
-      F = I.indexOf(":", 9) + 1;
-      var D = I.substring(F, I.length - 1).trim();
-      return D = I.substring(0, F).trim() + D + ";", fe === 1 || fe === 2 && a(D, 1) ? "-webkit-" + D + D : D;
+      F = B.indexOf(":", 9) + 1;
+      var D = B.substring(F, B.length - 1).trim();
+      return D = B.substring(0, F).trim() + D + ";", oe === 1 || oe === 2 && a(D, 1) ? "-webkit-" + D + D : D;
     }
-    if (fe === 0 || fe === 2 && !a(I, 1)) return I;
+    if (oe === 0 || oe === 2 && !a(B, 1)) return B;
     switch (Q) {
       case 1015:
-        return I.charCodeAt(10) === 97 ? "-webkit-" + I + I : I;
+        return B.charCodeAt(10) === 97 ? "-webkit-" + B + B : B;
       case 951:
-        return I.charCodeAt(3) === 116 ? "-webkit-" + I + I : I;
+        return B.charCodeAt(3) === 116 ? "-webkit-" + B + B : B;
       case 963:
-        return I.charCodeAt(5) === 110 ? "-webkit-" + I + I : I;
+        return B.charCodeAt(5) === 110 ? "-webkit-" + B + B : B;
       case 1009:
-        if (I.charCodeAt(4) !== 100) break;
+        if (B.charCodeAt(4) !== 100) break;
       case 969:
       case 942:
-        return "-webkit-" + I + I;
+        return "-webkit-" + B + B;
       case 978:
-        return "-webkit-" + I + "-moz-" + I + I;
+        return "-webkit-" + B + "-moz-" + B + B;
       case 1019:
       case 983:
-        return "-webkit-" + I + "-moz-" + I + "-ms-" + I + I;
+        return "-webkit-" + B + "-moz-" + B + "-ms-" + B + B;
       case 883:
-        if (I.charCodeAt(8) === 45) return "-webkit-" + I + I;
-        if (0 < I.indexOf("image-set(", 11)) return I.replace(B, "$1-webkit-$2") + I;
+        if (B.charCodeAt(8) === 45) return "-webkit-" + B + B;
+        if (0 < B.indexOf("image-set(", 11)) return B.replace(I, "$1-webkit-$2") + B;
         break;
       case 932:
-        if (I.charCodeAt(4) === 45) switch (I.charCodeAt(5)) {
+        if (B.charCodeAt(4) === 45) switch (B.charCodeAt(5)) {
           case 103:
-            return "-webkit-box-" + I.replace("-grow", "") + "-webkit-" + I + "-ms-" + I.replace("grow", "positive") + I;
+            return "-webkit-box-" + B.replace("-grow", "") + "-webkit-" + B + "-ms-" + B.replace("grow", "positive") + B;
           case 115:
-            return "-webkit-" + I + "-ms-" + I.replace("shrink", "negative") + I;
+            return "-webkit-" + B + "-ms-" + B.replace("shrink", "negative") + B;
           case 98:
-            return "-webkit-" + I + "-ms-" + I.replace("basis", "preferred-size") + I;
+            return "-webkit-" + B + "-ms-" + B.replace("basis", "preferred-size") + B;
         }
-        return "-webkit-" + I + "-ms-" + I + I;
+        return "-webkit-" + B + "-ms-" + B + B;
       case 964:
-        return "-webkit-" + I + "-ms-flex-" + I + I;
+        return "-webkit-" + B + "-ms-flex-" + B + B;
       case 1023:
-        if (I.charCodeAt(8) !== 99) break;
-        return D = I.substring(I.indexOf(":", 15)).replace("flex-", "").replace("space-between", "justify"), "-webkit-box-pack" + D + "-webkit-" + I + "-ms-flex-pack" + D + I;
+        if (B.charCodeAt(8) !== 99) break;
+        return D = B.substring(B.indexOf(":", 15)).replace("flex-", "").replace("space-between", "justify"), "-webkit-box-pack" + D + "-webkit-" + B + "-ms-flex-pack" + D + B;
       case 1005:
-        return g.test(I) ? I.replace(m, ":-webkit-") + I.replace(m, ":-moz-") + I : I;
+        return g.test(B) ? B.replace(m, ":-webkit-") + B.replace(m, ":-moz-") + B : B;
       case 1e3:
-        switch (D = I.substring(13).trim(), q = D.indexOf("-") + 1, D.charCodeAt(0) + D.charCodeAt(q)) {
+        switch (D = B.substring(13).trim(), q = D.indexOf("-") + 1, D.charCodeAt(0) + D.charCodeAt(q)) {
           case 226:
-            D = I.replace(x, "tb");
+            D = B.replace(x, "tb");
             break;
           case 232:
-            D = I.replace(x, "tb-rl");
+            D = B.replace(x, "tb-rl");
             break;
           case 220:
-            D = I.replace(x, "lr");
+            D = B.replace(x, "lr");
             break;
           default:
-            return I;
+            return B;
         }
-        return "-webkit-" + I + "-ms-" + D + I;
+        return "-webkit-" + B + "-ms-" + D + B;
       case 1017:
-        if (I.indexOf("sticky", 9) === -1) break;
+        if (B.indexOf("sticky", 9) === -1) break;
       case 975:
-        switch (q = (I = F).length - 10, D = (I.charCodeAt(q) === 33 ? I.substring(0, q) : I).substring(F.indexOf(":", 7) + 1).trim(), Q = D.charCodeAt(0) + (D.charCodeAt(7) | 0)) {
+        switch (q = (B = F).length - 10, D = (B.charCodeAt(q) === 33 ? B.substring(0, q) : B).substring(F.indexOf(":", 7) + 1).trim(), Q = D.charCodeAt(0) + (D.charCodeAt(7) | 0)) {
           case 203:
             if (111 > D.charCodeAt(8)) break;
           case 115:
-            I = I.replace(D, "-webkit-" + D) + ";" + I;
+            B = B.replace(D, "-webkit-" + D) + ";" + B;
             break;
           case 207:
           case 102:
-            I = I.replace(D, "-webkit-" + (102 < Q ? "inline-" : "") + "box") + ";" + I.replace(D, "-webkit-" + D) + ";" + I.replace(D, "-ms-" + D + "box") + ";" + I;
+            B = B.replace(D, "-webkit-" + (102 < Q ? "inline-" : "") + "box") + ";" + B.replace(D, "-webkit-" + D) + ";" + B.replace(D, "-ms-" + D + "box") + ";" + B;
         }
-        return I + ";";
+        return B + ";";
       case 938:
-        if (I.charCodeAt(5) === 45) switch (I.charCodeAt(6)) {
+        if (B.charCodeAt(5) === 45) switch (B.charCodeAt(6)) {
           case 105:
-            return D = I.replace("-items", ""), "-webkit-" + I + "-webkit-box-" + D + "-ms-flex-" + D + I;
+            return D = B.replace("-items", ""), "-webkit-" + B + "-webkit-box-" + D + "-ms-flex-" + D + B;
           case 115:
-            return "-webkit-" + I + "-ms-flex-item-" + I.replace(S, "") + I;
+            return "-webkit-" + B + "-ms-flex-item-" + B.replace(S, "") + B;
           default:
-            return "-webkit-" + I + "-ms-flex-line-pack" + I.replace("align-content", "").replace(S, "") + I;
+            return "-webkit-" + B + "-ms-flex-line-pack" + B.replace("align-content", "").replace(S, "") + B;
         }
         break;
       case 973:
       case 989:
-        if (I.charCodeAt(3) !== 45 || I.charCodeAt(4) === 122) break;
+        if (B.charCodeAt(3) !== 45 || B.charCodeAt(4) === 122) break;
       case 931:
       case 953:
-        if (A.test(F) === !0) return (D = F.substring(F.indexOf(":") + 1)).charCodeAt(0) === 115 ? i(F.replace("stretch", "fill-available"), q, W, ee).replace(":fill-available", ":stretch") : I.replace(D, "-webkit-" + D) + I.replace(D, "-moz-" + D.replace("fill-", "")) + I;
+        if (A.test(F) === !0) return (D = F.substring(F.indexOf(":") + 1)).charCodeAt(0) === 115 ? i(F.replace("stretch", "fill-available"), q, W, ee).replace(":fill-available", ":stretch") : B.replace(D, "-webkit-" + D) + B.replace(D, "-moz-" + D.replace("fill-", "")) + B;
         break;
       case 962:
-        if (I = "-webkit-" + I + (I.charCodeAt(5) === 102 ? "-ms-" + I : "") + I, W + ee === 211 && I.charCodeAt(13) === 105 && 0 < I.indexOf("transform", 10)) return I.substring(0, I.indexOf(";", 27) + 1).replace(b, "$1-webkit-$2") + I;
+        if (B = "-webkit-" + B + (B.charCodeAt(5) === 102 ? "-ms-" + B : "") + B, W + ee === 211 && B.charCodeAt(13) === 105 && 0 < B.indexOf("transform", 10)) return B.substring(0, B.indexOf(";", 27) + 1).replace(b, "$1-webkit-$2") + B;
     }
-    return I;
+    return B;
   }
   function a(F, q) {
     var W = F.indexOf(q === 1 ? ":" : "{"), ee = F.substring(0, q !== 3 ? W : 10);
-    return W = F.substring(W + 1, F.length - 1), Ye(q !== 2 ? ee : ee.replace(P, "$1"), W, q);
+    return W = F.substring(W + 1, F.length - 1), Ye(q !== 2 ? ee : ee.replace($, "$1"), W, q);
   }
   function o(F, q) {
     var W = i(q, q.charCodeAt(0), q.charCodeAt(1), q.charCodeAt(2));
     return W !== q + ";" ? W.replace(k, " or ($1)").substring(4) : "(" + q + ")";
   }
-  function s(F, q, W, ee, I, Q, D, G, X, Y) {
+  function s(F, q, W, ee, B, Q, D, G, X, Z) {
     for (var L = 0, V = q, te; L < be; ++L)
-      switch (te = me[L].call(u, F, V, W, ee, I, Q, D, G, X, Y)) {
+      switch (te = me[L].call(u, F, V, W, ee, B, Q, D, G, X, Z)) {
         case void 0:
         case !1:
         case !0:
@@ -13402,18 +13402,18 @@ function Ub(e) {
     return l;
   }
   function c(F) {
-    return F = F.prefix, F !== void 0 && (Ye = null, F ? typeof F != "function" ? fe = 1 : (fe = 2, Ye = F) : fe = 0), c;
+    return F = F.prefix, F !== void 0 && (Ye = null, F ? typeof F != "function" ? oe = 1 : (oe = 2, Ye = F) : oe = 0), c;
   }
   function u(F, q) {
     var W = F;
-    if (33 > W.charCodeAt(0) && (W = W.trim()), le = W, W = [le], 0 < be) {
-      var ee = s(-1, q, W, W, U, M, 0, 0, 0, 0);
+    if (33 > W.charCodeAt(0) && (W = W.trim()), ue = W, W = [ue], 0 < be) {
+      var ee = s(-1, q, W, W, H, M, 0, 0, 0, 0);
       ee !== void 0 && typeof ee == "string" && (q = ee);
     }
-    var I = t(Pe, W, q, 0, 0);
-    return 0 < be && (ee = s(-2, I, W, W, U, M, I.length, 0, 0, 0), ee !== void 0 && (I = ee)), le = "", Z = 0, M = U = 1, I;
+    var B = t(Pe, W, q, 0, 0);
+    return 0 < be && (ee = s(-2, B, W, W, H, M, B.length, 0, 0, 0), ee !== void 0 && (B = ee)), ue = "", Y = 0, M = H = 1, B;
   }
-  var d = /^\0+/g, p = /[\0\r\f]/g, m = /: */g, g = /zoo|gra/, b = /([,: ])(transform)/g, v = /,\r+?/g, y = /([\t\r\n ])*\f?&/g, _ = /@(k\w+)\s*(\S*)\s*/, R = /::(place)/g, O = /:(read-only)/g, x = /[svh]\w+-[tblr]{2}/, C = /\(\s*(.*)\s*\)/g, k = /([\s\S]*?);/g, S = /-self|flex-/g, P = /[^]*?(:[rp][el]a[\w-]+)[^]*/, A = /stretch|:\s*\w+\-(?:conte|avail)/, B = /([^-])(image-set\()/, M = 1, U = 1, Z = 0, fe = 1, Pe = [], me = [], be = 0, Ye = null, Ze = 0, le = "";
+  var d = /^\0+/g, p = /[\0\r\f]/g, m = /: */g, g = /zoo|gra/, b = /([,: ])(transform)/g, v = /,\r+?/g, y = /([\t\r\n ])*\f?&/g, _ = /@(k\w+)\s*(\S*)\s*/, R = /::(place)/g, O = /:(read-only)/g, x = /[svh]\w+-[tblr]{2}/, C = /\(\s*(.*)\s*\)/g, k = /([\s\S]*?);/g, S = /-self|flex-/g, $ = /[^]*?(:[rp][el]a[\w-]+)[^]*/, A = /stretch|:\s*\w+\-(?:conte|avail)/, I = /([^-])(image-set\()/, M = 1, H = 1, Y = 0, oe = 1, Pe = [], me = [], be = 0, Ye = null, Ze = 0, ue = "";
   return u.use = l, u.set = c, e !== void 0 && c(e), u;
 }
 var Hb = {
@@ -13803,10 +13803,10 @@ function __(e) {
       } catch {
       }
     }
-    return function(y, _, R, O, x, C, k, S, P, A) {
+    return function(y, _, R, O, x, C, k, S, $, A) {
       switch (y) {
         case 1:
-          if (P === 0 && _.charCodeAt(0) === 64) return b(_ + ";"), "";
+          if ($ === 0 && _.charCodeAt(0) === 64) return b(_ + ";"), "";
           break;
         case 2:
           if (S === 0) return _ + "/*|*/";
@@ -13948,26 +13948,26 @@ function _d(e, t, r) {
   } : e.shouldForwardProp);
   var g, b = new g_(r, d, n ? e.componentStyle : void 0), v = b.isStatic && o.length === 0, y = function(_, R) {
     return function(O, x, C, k) {
-      var S = O.attrs, P = O.componentStyle, A = O.defaultProps, B = O.foldedComponentIds, M = O.shouldForwardProp, U = O.styledComponentId, Z = O.target, fe = function(ee, I, Q) {
+      var S = O.attrs, $ = O.componentStyle, A = O.defaultProps, I = O.foldedComponentIds, M = O.shouldForwardProp, H = O.styledComponentId, Y = O.target, oe = function(ee, B, Q) {
         ee === void 0 && (ee = hr);
-        var D = Xt({}, I, { theme: ee }), G = {};
+        var D = Xt({}, B, { theme: ee }), G = {};
         return Q.forEach(function(X) {
-          var Y, L, V, te = X;
-          for (Y in Kn(te) && (te = te(D)), te) D[Y] = G[Y] = Y === "className" ? (L = G[Y], V = te[Y], L && V ? L + " " + V : L || V) : te[Y];
+          var Z, L, V, te = X;
+          for (Z in Kn(te) && (te = te(D)), te) D[Z] = G[Z] = Z === "className" ? (L = G[Z], V = te[Z], L && V ? L + " " + V : L || V) : te[Z];
         }), [D, G];
-      }($_(x, Jn(bd), A) || hr, x, S), Pe = fe[0], me = fe[1], be = function(ee, I, Q, D) {
-        var G = x_(), X = E_(), Y = I ? ee.generateAndInjectStyles(hr, G, X) : ee.generateAndInjectStyles(Q, G, X);
-        return Y;
-      }(P, k, Pe), Ye = C, Ze = me.$as || x.$as || me.as || x.as || Z, le = zi(Ze), F = me !== x ? Xt({}, x, {}, me) : x, q = {};
-      for (var W in F) W[0] !== "$" && W !== "as" && (W === "forwardedAs" ? q.as = F[W] : (M ? M(W, zl, Ze) : !le || zl(W)) && (q[W] = F[W]));
-      return x.style && me.style !== x.style && (q.style = Xt({}, x.style, {}, me.style)), q.className = Array.prototype.concat(B, U, be !== U ? be : null, x.className, me.className).filter(Boolean).join(" "), q.ref = Ye, ph(Ze, q);
+      }($_(x, Jn(bd), A) || hr, x, S), Pe = oe[0], me = oe[1], be = function(ee, B, Q, D) {
+        var G = x_(), X = E_(), Z = B ? ee.generateAndInjectStyles(hr, G, X) : ee.generateAndInjectStyles(Q, G, X);
+        return Z;
+      }($, k, Pe), Ye = C, Ze = me.$as || x.$as || me.as || x.as || Y, ue = zi(Ze), F = me !== x ? Xt({}, x, {}, me) : x, q = {};
+      for (var W in F) W[0] !== "$" && W !== "as" && (W === "forwardedAs" ? q.as = F[W] : (M ? M(W, zl, Ze) : !ue || zl(W)) && (q[W] = F[W]));
+      return x.style && me.style !== x.style && (q.style = Xt({}, x.style, {}, me.style)), q.className = Array.prototype.concat(I, H, be !== H ? be : null, x.className, me.className).filter(Boolean).join(" "), q.ref = Ye, ph(Ze, q);
     }(g, _, R, v);
   };
   return y.displayName = u, (g = Oe.forwardRef(y)).attrs = p, g.componentStyle = b, g.displayName = u, g.shouldForwardProp = m, g.foldedComponentIds = n ? Array.prototype.concat(e.foldedComponentIds, e.styledComponentId) : fa, g.styledComponentId = d, g.target = n ? e.target : e, g.withComponent = function(_) {
     var R = t.componentId, O = function(C, k) {
       if (C == null) return {};
-      var S, P, A = {}, B = Object.keys(C);
-      for (P = 0; P < B.length; P++) S = B[P], k.indexOf(S) >= 0 || (A[S] = C[S]);
+      var S, $, A = {}, I = Object.keys(C);
+      for ($ = 0; $ < I.length; $++) S = I[$], k.indexOf(S) >= 0 || (A[S] = C[S]);
       return A;
     }(t, ["componentId"]), x = R && R + "-" + (zi(_) ? _ : So(Ul(_)));
     return _d(_, Xt({}, O, { attrs: p, componentId: x }), r);
@@ -14028,7 +14028,7 @@ const j_ = yr.div`
     throw new Error("useAPI must be used within an APIProvider");
   return e;
 }, M_ = ({ children: e }) => {
-  const [t, r] = ht(0), n = hc(
+  const [t, r] = ct(0), n = hc(
     async (a) => {
       r((o) => o + 1);
       try {
@@ -14079,7 +14079,7 @@ const j_ = yr.div`
   const t = e;
   return {
     createProject: async (k, S) => {
-      const P = {
+      const $ = {
         description: k,
         component_namespace: S
       };
@@ -14088,7 +14088,7 @@ const j_ = yr.div`
         headers: {
           "Content-Type": "application/json"
         },
-        body: JSON.stringify(P)
+        body: JSON.stringify($)
       });
     },
     getProjects: async () => await fetch(`${t}/fetch_projects`, {
@@ -14107,7 +14107,7 @@ const j_ = yr.div`
       }
     ),
     allocateSubdomain: async (k, S) => {
-      const P = {
+      const $ = {
         project_name: k,
         subdomain: S
       };
@@ -14116,11 +14116,11 @@ const j_ = yr.div`
         headers: {
           "Content-Type": "application/json"
         },
-        body: JSON.stringify(P)
+        body: JSON.stringify($)
       });
     },
     updateSubdomain: async (k, S) => {
-      const P = {
+      const $ = {
         project_name: k,
         subdomain: S
       };
@@ -14129,11 +14129,11 @@ const j_ = yr.div`
         headers: {
           "Content-Type": "application/json"
         },
-        body: JSON.stringify(P)
+        body: JSON.stringify($)
       });
     },
     releaseSubdomain: async (k, S) => {
-      const P = {
+      const $ = {
         project_name: k,
         subdomain: S
       };
@@ -14142,11 +14142,11 @@ const j_ = yr.div`
         headers: {
           "Content-Type": "application/json"
         },
-        body: JSON.stringify(P)
+        body: JSON.stringify($)
       });
     },
     publishProject: async (k, S) => {
-      const P = {
+      const $ = {
         project_name: k,
         git_ref: S
       };
@@ -14155,7 +14155,7 @@ const j_ = yr.div`
         headers: {
           "Content-Type": "application/json"
         },
-        body: JSON.stringify(P)
+        body: JSON.stringify($)
       });
     },
     unpublishProject: async (k) => {
@@ -14170,11 +14170,11 @@ const j_ = yr.div`
         body: JSON.stringify(S)
       });
     },
-    tagCommit: async (k, S, P) => {
+    tagCommit: async (k, S, $) => {
       const A = {
         project_name: k,
         commit_hash: S,
-        tag_name: P
+        tag_name: $
       };
       return await fetch(`${t}/tag_project_commit`, {
         method: "POST",
@@ -14193,11 +14193,11 @@ const j_ = yr.div`
         }
       }
     ),
-    addProjectComponent: async (k, S, P, A) => {
-      const B = {
+    addProjectComponent: async (k, S, $, A) => {
+      const I = {
         project_name: k,
         component_namespace: S,
-        component_name: P,
+        component_name: $,
         layout_metadata: A
       };
       return await fetch(`${t}/add_project_component`, {
@@ -14205,14 +14205,14 @@ const j_ = yr.div`
         headers: {
           "Content-Type": "application/json"
         },
-        body: JSON.stringify(B)
+        body: JSON.stringify(I)
       });
     },
-    addProjectChart: async (k, S, P) => {
+    addProjectChart: async (k, S, $) => {
       const A = {
         project_name: k,
         visual_id: S,
-        layout_metadata: P
+        layout_metadata: $
       };
       return await fetch(`${t}/add_project_chart`, {
         method: "POST",
@@ -14222,11 +14222,11 @@ const j_ = yr.div`
         body: JSON.stringify(A)
       });
     },
-    updateProjectComponentLayoutMetadata: async (k, S, P) => {
+    updateProjectComponentLayoutMetadata: async (k, S, $) => {
       const A = {
         project_name: k,
         component_id: S,
-        layout_metadata: P
+        layout_metadata: $
       };
       return await fetch(
         `${t}/update_project_component_layout_metadata`,
@@ -14239,11 +14239,11 @@ const j_ = yr.div`
         }
       );
     },
-    updateProjectComponentSourceCode: async (k, S, P) => {
+    updateProjectComponentSourceCode: async (k, S, $) => {
       const A = {
         project_name: k,
         component_id: S,
-        source_code: P
+        source_code: $
       };
       return await fetch(`${t}/update_project_component_source_code`, {
         method: "POST",
@@ -14253,11 +14253,11 @@ const j_ = yr.div`
         body: JSON.stringify(A)
       });
     },
-    updateApplicationMetadata: async (k, S, P, A) => {
-      const B = {
+    updateApplicationMetadata: async (k, S, $, A) => {
+      const I = {
         project_name: k,
         application_name: S,
-        application_description: P,
+        application_description: $,
         application_category: A
       };
       return await fetch(`${t}/update_application_metadata`, {
@@ -14265,11 +14265,11 @@ const j_ = yr.div`
         headers: {
           "Content-Type": "application/json"
         },
-        body: JSON.stringify(B)
+        body: JSON.stringify(I)
       });
     },
     updateApplicationSettings: async (k, S) => {
-      const P = {
+      const $ = {
         project_name: k,
         application_login_enabled: S
       };
@@ -14278,11 +14278,11 @@ const j_ = yr.div`
         headers: {
           "Content-Type": "application/json"
         },
-        body: JSON.stringify(P)
+        body: JSON.stringify($)
       });
     },
     deleteProjectFile: async (k, S) => {
-      const P = {
+      const $ = {
         project_name: k,
         file_path: S
       };
@@ -14291,16 +14291,16 @@ const j_ = yr.div`
         headers: {
           "Content-Type": "application/json"
         },
-        body: JSON.stringify(P)
+        body: JSON.stringify($)
       });
     },
-    resetProjectFile: async (k, S, P, A, B) => {
+    resetProjectFile: async (k, S, $, A, I) => {
       let M = {
         project_name: k,
         file_path: S,
-        git_ref: P
+        git_ref: $
       };
-      return A && (M.prune = A), B && (M.extra_metadata = B), await fetch(`${t}/reset_project_file`, {
+      return A && (M.prune = A), I && (M.extra_metadata = I), await fetch(`${t}/reset_project_file`, {
         method: "POST",
         headers: {
           "Content-Type": "application/json"
@@ -14320,11 +14320,11 @@ const j_ = yr.div`
         body: JSON.stringify(S)
       });
     },
-    requestErrorCorrection: async (k, S, P) => {
+    requestErrorCorrection: async (k, S, $) => {
       const A = {
         project_name: k,
         component_id: S,
-        error_message: P
+        error_message: $
       };
       return await fetch(`${t}/error_correction`, {
         method: "POST",
@@ -14425,40 +14425,40 @@ const q_ = (e) => {
 }, Us = fu(null);
 Us.Consumer;
 const G_ = (e) => {
-  const [t, r] = ht({
+  const [t, r] = ct({
     projectName: null,
     projectURL: null
-  }), [n, i] = ht({
+  }), [n, i] = ct({
     API_BASE_URL: null,
     WS_BASE_URL: null,
     GW_BASE_URL: null
-  }), [a, o] = ht(
+  }), [a, o] = ct(
     () => Zl(e.config.GW_BASE_URL)
-  ), [s, l] = ht(""), [c, u] = ht(""), [d, p] = ht(""), [m, g] = ht(Vl()), b = q_(e.config.API_BASE_URL), v = Ed(e.config.API_BASE_URL), y = b || v, [_, R] = ht(), [O, x] = ht(!1), C = () => {
-    g(Vl());
-  }, k = (S, P) => {
-    if (!S) return;
-    _ && (_.close(), x(!1));
-    const A = localStorage.getItem("accessToken") || "", B = `${n.WS_BASE_URL}/ws/chat/${S}?token=${A}`;
-    if (!B.startsWith("ws://") && !B.startsWith("wss://")) {
-      P.onerror({
+  ), [s, l] = ct(!1), [c, u] = ct(""), [d, p] = ct(""), [m, g] = ct(""), [b, v] = ct(Vl()), y = q_(e.config.API_BASE_URL), _ = Ed(e.config.API_BASE_URL), R = y || _, [O, x] = ct(), [C, k] = ct(!1), S = () => {
+    v(Vl());
+  }, $ = (A, I) => {
+    if (!A) return;
+    O && (O.close(), k(!1));
+    const M = localStorage.getItem("accessToken") || "", H = `${n.WS_BASE_URL}/ws/chat/${A}?token=${M}`;
+    if (!H.startsWith("ws://") && !H.startsWith("wss://")) {
+      I.onerror({
         customWebsocketError: "INVALID_URL"
       });
       return;
     }
-    const M = new WebSocket(B);
-    M.onopen = () => {
-      x(!0), P.onopen();
-    }, M.onclose = (U) => {
-      x(!1), P.onclose(U);
-    }, M.onerror = (U) => {
-      P.onerror(U);
-    }, M.onmessage = (U) => {
-      P.onmessage(U);
-    }, R(M);
+    const Y = new WebSocket(H);
+    Y.onopen = () => {
+      k(!0), I.onopen();
+    }, Y.onclose = (oe) => {
+      k(!1), I.onclose(oe);
+    }, Y.onerror = (oe) => {
+      I.onerror(oe);
+    }, Y.onmessage = (oe) => {
+      I.onmessage(oe);
+    }, x(Y);
   };
   return du(() => (i(e.config), o(Zl(e.config.GW_BASE_URL)), e.metadata && r(e.metadata), () => {
-    _ && _.close();
+    O && O.close();
   }), [e.config]), /* @__PURE__ */ ge.jsx(
     Us.Provider,
     {
@@ -14466,19 +14466,21 @@ const G_ = (e) => {
         config: n,
         projectMetadata: t,
         setProjectMetadata: r,
-        syncToken: m,
-        setSyncToken: C,
-        selectedComponentId: s,
-        setSelectedComponentId: l,
-        selectedComponentXPath: c,
-        setSelectedComponentXPath: u,
-        selectedComponentHTML: d,
-        setSelectedComponentHTML: p,
-        APIHandler: y,
+        syncToken: b,
+        setSyncToken: S,
+        selectedComponentId: c,
+        setSelectedComponentId: u,
+        selectedComponentXPath: d,
+        setSelectedComponentXPath: p,
+        selectedComponentHTML: m,
+        setSelectedComponentHTML: g,
+        isComponentSubselected: s,
+        setIsComponentSubselected: l,
+        APIHandler: R,
         gwAPIHandler: a,
-        startChatbot: k,
-        chatbotWebsocket: _,
-        chatbotWebsocketConnected: O
+        startChatbot: $,
+        chatbotWebsocket: O,
+        chatbotWebsocketConnected: C
       },
       children: e.children
     }
@@ -14674,28 +14676,28 @@ var kd = { exports: {} }, Ri = {}, es = { exports: {} };
     n(t);
   })(Hi, function(r) {
     function n(D) {
-      return function(X, Y, L, V, te, J, oe) {
-        return D(X, Y, oe);
+      return function(X, Z, L, V, te, J, se) {
+        return D(X, Z, se);
       };
     }
     function i(D) {
-      return function(X, Y, L, V) {
-        if (!X || !Y || typeof X != "object" || typeof Y != "object")
-          return D(X, Y, L, V);
-        var te = V.get(X), J = V.get(Y);
+      return function(X, Z, L, V) {
+        if (!X || !Z || typeof X != "object" || typeof Z != "object")
+          return D(X, Z, L, V);
+        var te = V.get(X), J = V.get(Z);
         if (te && J)
-          return te === Y && J === X;
-        V.set(X, Y), V.set(Y, X);
-        var oe = D(X, Y, L, V);
-        return V.delete(X), V.delete(Y), oe;
+          return te === Z && J === X;
+        V.set(X, Z), V.set(Z, X);
+        var se = D(X, Z, L, V);
+        return V.delete(X), V.delete(Z), se;
       };
     }
     function a(D, G) {
       var X = {};
-      for (var Y in D)
-        X[Y] = D[Y];
-      for (var Y in G)
-        X[Y] = G[Y];
+      for (var Z in D)
+        X[Z] = D[Z];
+      for (var Z in G)
+        X[Z] = G[Z];
       return X;
     }
     function o(D) {
@@ -14709,28 +14711,28 @@ var kd = { exports: {} }, Ri = {}, es = { exports: {} };
     }
     var c = "[object Arguments]", u = "[object Boolean]", d = "[object Date]", p = "[object RegExp]", m = "[object Map]", g = "[object Number]", b = "[object Object]", v = "[object Set]", y = "[object String]", _ = Object.prototype.toString;
     function R(D) {
-      var G = D.areArraysEqual, X = D.areDatesEqual, Y = D.areMapsEqual, L = D.areObjectsEqual, V = D.areRegExpsEqual, te = D.areSetsEqual, J = D.createIsNestedEqual, oe = J(re);
+      var G = D.areArraysEqual, X = D.areDatesEqual, Z = D.areMapsEqual, L = D.areObjectsEqual, V = D.areRegExpsEqual, te = D.areSetsEqual, J = D.createIsNestedEqual, se = J(re);
       function re(ne, Ee, _e) {
         if (ne === Ee)
           return !0;
         if (!ne || !Ee || typeof ne != "object" || typeof Ee != "object")
           return ne !== ne && Ee !== Ee;
         if (o(ne) && o(Ee))
-          return L(ne, Ee, oe, _e);
+          return L(ne, Ee, se, _e);
         var yt = Array.isArray(ne), Le = Array.isArray(Ee);
         if (yt || Le)
-          return yt === Le && G(ne, Ee, oe, _e);
+          return yt === Le && G(ne, Ee, se, _e);
         var Ce = _.call(ne);
-        return Ce !== _.call(Ee) ? !1 : Ce === d ? X(ne, Ee, oe, _e) : Ce === p ? V(ne, Ee, oe, _e) : Ce === m ? Y(ne, Ee, oe, _e) : Ce === v ? te(ne, Ee, oe, _e) : Ce === b || Ce === c ? s(ne) || s(Ee) ? !1 : L(ne, Ee, oe, _e) : Ce === u || Ce === g || Ce === y ? l(ne.valueOf(), Ee.valueOf()) : !1;
+        return Ce !== _.call(Ee) ? !1 : Ce === d ? X(ne, Ee, se, _e) : Ce === p ? V(ne, Ee, se, _e) : Ce === m ? Z(ne, Ee, se, _e) : Ce === v ? te(ne, Ee, se, _e) : Ce === b || Ce === c ? s(ne) || s(Ee) ? !1 : L(ne, Ee, se, _e) : Ce === u || Ce === g || Ce === y ? l(ne.valueOf(), Ee.valueOf()) : !1;
       }
       return re;
     }
-    function O(D, G, X, Y) {
+    function O(D, G, X, Z) {
       var L = D.length;
       if (G.length !== L)
         return !1;
       for (; L-- > 0; )
-        if (!X(D[L], G[L], L, L, D, G, Y))
+        if (!X(D[L], G[L], L, L, D, G, Z))
           return !1;
       return !0;
     }
@@ -14738,43 +14740,43 @@ var kd = { exports: {} }, Ri = {}, es = { exports: {} };
     function C(D, G) {
       return l(D.valueOf(), G.valueOf());
     }
-    function k(D, G, X, Y) {
+    function k(D, G, X, Z) {
       var L = D.size === G.size;
       if (!L)
         return !1;
       if (!D.size)
         return !0;
       var V = {}, te = 0;
-      return D.forEach(function(J, oe) {
+      return D.forEach(function(J, se) {
         if (L) {
           var re = !1, ne = 0;
           G.forEach(function(Ee, _e) {
-            !re && !V[ne] && (re = X(oe, _e, te, ne, D, G, Y) && X(J, Ee, oe, _e, D, G, Y)) && (V[ne] = !0), ne++;
+            !re && !V[ne] && (re = X(se, _e, te, ne, D, G, Z) && X(J, Ee, se, _e, D, G, Z)) && (V[ne] = !0), ne++;
           }), te++, L = re;
         }
       }), L;
     }
-    var S = i(k), P = "_owner", A = Object.prototype.hasOwnProperty;
-    function B(D, G, X, Y) {
+    var S = i(k), $ = "_owner", A = Object.prototype.hasOwnProperty;
+    function I(D, G, X, Z) {
       var L = Object.keys(D), V = L.length;
       if (Object.keys(G).length !== V)
         return !1;
       for (var te; V-- > 0; ) {
-        if (te = L[V], te === P) {
-          var J = !!D.$$typeof, oe = !!G.$$typeof;
-          if ((J || oe) && J !== oe)
+        if (te = L[V], te === $) {
+          var J = !!D.$$typeof, se = !!G.$$typeof;
+          if ((J || se) && J !== se)
             return !1;
         }
-        if (!A.call(G, te) || !X(D[te], G[te], te, te, D, G, Y))
+        if (!A.call(G, te) || !X(D[te], G[te], te, te, D, G, Z))
           return !1;
       }
       return !0;
     }
-    var M = i(B);
-    function U(D, G) {
+    var M = i(I);
+    function H(D, G) {
       return D.source === G.source && D.flags === G.flags;
     }
-    function Z(D, G, X, Y) {
+    function Y(D, G, X, Z) {
       var L = D.size === G.size;
       if (!L)
         return !1;
@@ -14783,28 +14785,28 @@ var kd = { exports: {} }, Ri = {}, es = { exports: {} };
       var V = {};
       return D.forEach(function(te, J) {
         if (L) {
-          var oe = !1, re = 0;
+          var se = !1, re = 0;
           G.forEach(function(ne, Ee) {
-            !oe && !V[re] && (oe = X(te, ne, J, Ee, D, G, Y)) && (V[re] = !0), re++;
-          }), L = oe;
+            !se && !V[re] && (se = X(te, ne, J, Ee, D, G, Z)) && (V[re] = !0), re++;
+          }), L = se;
         }
       }), L;
     }
-    var fe = i(Z), Pe = Object.freeze({
+    var oe = i(Y), Pe = Object.freeze({
       areArraysEqual: O,
       areDatesEqual: C,
       areMapsEqual: k,
-      areObjectsEqual: B,
-      areRegExpsEqual: U,
-      areSetsEqual: Z,
+      areObjectsEqual: I,
+      areRegExpsEqual: H,
+      areSetsEqual: Y,
       createIsNestedEqual: n
     }), me = Object.freeze({
       areArraysEqual: x,
       areDatesEqual: C,
       areMapsEqual: S,
       areObjectsEqual: M,
-      areRegExpsEqual: U,
-      areSetsEqual: fe,
+      areRegExpsEqual: H,
+      areSetsEqual: oe,
       createIsNestedEqual: n
     }), be = R(Pe);
     function Ye(D, G) {
@@ -14813,7 +14815,7 @@ var kd = { exports: {} }, Ri = {}, es = { exports: {} };
     var Ze = R(a(Pe, { createIsNestedEqual: function() {
       return l;
     } }));
-    function le(D, G) {
+    function ue(D, G) {
       return Ze(D, G, void 0);
     }
     var F = R(me);
@@ -14828,16 +14830,16 @@ var kd = { exports: {} }, Ri = {}, es = { exports: {} };
     function ee(D, G) {
       return W(D, G, /* @__PURE__ */ new WeakMap());
     }
-    function I(D) {
+    function B(D) {
       return R(a(Pe, D(Pe)));
     }
     function Q(D) {
       var G = R(a(me, D(me)));
-      return function(X, Y, L) {
-        return L === void 0 && (L = /* @__PURE__ */ new WeakMap()), G(X, Y, L);
+      return function(X, Z, L) {
+        return L === void 0 && (L = /* @__PURE__ */ new WeakMap()), G(X, Z, L);
       };
     }
-    r.circularDeepEqual = q, r.circularShallowEqual = ee, r.createCustomCircularEqual = Q, r.createCustomEqual = I, r.deepEqual = Ye, r.sameValueZeroEqual = l, r.shallowEqual = le, Object.defineProperty(r, "__esModule", { value: !0 });
+    r.circularDeepEqual = q, r.circularShallowEqual = ee, r.createCustomCircularEqual = Q, r.createCustomEqual = B, r.deepEqual = Ye, r.sameValueZeroEqual = l, r.shallowEqual = ue, Object.defineProperty(r, "__esModule", { value: !0 });
   });
 })(es, es.exports);
 var Hs = es.exports, ts = { exports: {} };
@@ -15575,7 +15577,7 @@ qt.createDraggableData = Jv;
 qt.getBoundPosition = Gv;
 qt.getControlPosition = Vv;
 qt.snapToGrid = Yv;
-var dt = Wt, Kr = je;
+var ht = Wt, Kr = je;
 function Gv(e, t, r) {
   if (!e.props.bounds) return [t, r];
   let {
@@ -15592,13 +15594,13 @@ function Gv(e, t, r) {
       throw new Error('Bounds selector "' + n + '" could not find an element.');
     const l = s, c = o.getComputedStyle(i), u = o.getComputedStyle(l);
     n = {
-      left: -i.offsetLeft + (0, dt.int)(u.paddingLeft) + (0, dt.int)(c.marginLeft),
-      top: -i.offsetTop + (0, dt.int)(u.paddingTop) + (0, dt.int)(c.marginTop),
-      right: (0, Kr.innerWidth)(l) - (0, Kr.outerWidth)(i) - i.offsetLeft + (0, dt.int)(u.paddingRight) - (0, dt.int)(c.marginRight),
-      bottom: (0, Kr.innerHeight)(l) - (0, Kr.outerHeight)(i) - i.offsetTop + (0, dt.int)(u.paddingBottom) - (0, dt.int)(c.marginBottom)
+      left: -i.offsetLeft + (0, ht.int)(u.paddingLeft) + (0, ht.int)(c.marginLeft),
+      top: -i.offsetTop + (0, ht.int)(u.paddingTop) + (0, ht.int)(c.marginTop),
+      right: (0, Kr.innerWidth)(l) - (0, Kr.outerWidth)(i) - i.offsetLeft + (0, ht.int)(u.paddingRight) - (0, ht.int)(c.marginRight),
+      bottom: (0, Kr.innerHeight)(l) - (0, Kr.outerHeight)(i) - i.offsetTop + (0, ht.int)(u.paddingBottom) - (0, ht.int)(c.marginBottom)
     };
   }
-  return (0, dt.isNum)(n.right) && (t = Math.min(t, n.right)), (0, dt.isNum)(n.bottom) && (r = Math.min(r, n.bottom)), (0, dt.isNum)(n.left) && (t = Math.max(t, n.left)), (0, dt.isNum)(n.top) && (r = Math.max(r, n.top)), [t, r];
+  return (0, ht.isNum)(n.right) && (t = Math.min(t, n.right)), (0, ht.isNum)(n.bottom) && (r = Math.min(r, n.bottom)), (0, ht.isNum)(n.left) && (t = Math.max(t, n.left)), (0, ht.isNum)(n.top) && (r = Math.max(r, n.top)), [t, r];
 }
 function Yv(e, t, r) {
   const n = Math.round(t / e[0]) * e[0], i = Math.round(r / e[1]) * e[1];
@@ -15617,7 +15619,7 @@ function Vv(e, t, r) {
   return (0, Kr.offsetXYFromParent)(n || e, a, r.props.scale);
 }
 function Kv(e, t, r) {
-  const n = !(0, dt.isNum)(e.lastX), i = tc(e);
+  const n = !(0, ht.isNum)(e.lastX), i = tc(e);
   return n ? {
     node: i,
     deltaX: 0,
@@ -16071,12 +16073,12 @@ et(Ha, "defaultProps", {
         };
         if (this.props.bounds) {
           const {
-            x: P,
+            x: $,
             y: A
           } = k;
           k.x += this.state.slackX, k.y += this.state.slackY;
-          const [B, M] = (0, o.getBoundPosition)(this, k.x, k.y);
-          k.x = B, k.y = M, k.slackX = this.state.slackX + (P - k.x), k.slackY = this.state.slackY + (A - k.y), C.x = k.x, C.y = k.y, C.deltaX = k.x - this.state.x, C.deltaY = k.y - this.state.y;
+          const [I, M] = (0, o.getBoundPosition)(this, k.x, k.y);
+          k.x = I, k.y = M, k.slackX = this.state.slackX + ($ - k.x), k.slackY = this.state.slackY + (A - k.y), C.x = k.x, C.y = k.y, C.deltaX = k.x - this.state.x, C.deltaY = k.y - this.state.y;
         }
         if (this.props.onDrag(O, C) === !1) return !1;
         this.setState(k);
@@ -16090,10 +16092,10 @@ et(Ha, "defaultProps", {
         };
         if (!!this.props.position) {
           const {
-            x: P,
+            x: $,
             y: A
           } = this.props.position;
-          k.x = P, k.y = A;
+          k.x = $, k.y = A;
         }
         this.setState(k);
       }), this.state = {
@@ -16138,25 +16140,25 @@ et(Ha, "defaultProps", {
         defaultPosition: C,
         defaultClassName: k,
         defaultClassNameDragging: S,
-        defaultClassNameDragged: P,
+        defaultClassNameDragged: $,
         position: A,
-        positionOffset: B,
+        positionOffset: I,
         scale: M,
-        ...U
+        ...H
       } = this.props;
-      let Z = {}, fe = null;
+      let Y = {}, oe = null;
       const me = !!!A || this.state.dragging, be = A || C, Ye = {
         // Set left if horizontal drag is enabled
         x: (0, o.canDragX)(this) && me ? this.state.x : be.x,
         // Set top if vertical drag is enabled
         y: (0, o.canDragY)(this) && me ? this.state.y : be.y
       };
-      this.state.isElementSVG ? fe = (0, a.createSVGTransform)(Ye, B) : Z = (0, a.createCSSTransform)(Ye, B);
+      this.state.isElementSVG ? oe = (0, a.createSVGTransform)(Ye, I) : Y = (0, a.createCSSTransform)(Ye, I);
       const Ze = (0, i.default)(x.props.className || "", k, {
         [S]: this.state.dragging,
-        [P]: this.state.dragged
+        [$]: this.state.dragged
       });
-      return /* @__PURE__ */ t.createElement(l.default, m({}, U, {
+      return /* @__PURE__ */ t.createElement(l.default, m({}, H, {
         onStart: this.onDragStart,
         onDrag: this.onDrag,
         onStop: this.onDragStop
@@ -16164,9 +16166,9 @@ et(Ha, "defaultProps", {
         className: Ze,
         style: {
           ...x.props.style,
-          ...Z
+          ...Y
         },
-        transform: fe
+        transform: oe
       }));
     }
   }
@@ -16349,7 +16351,7 @@ function f1(e, t) {
 var Ci = {};
 Ci.__esModule = !0;
 Ci.resizableProps = void 0;
-var ce = d1(_r);
+var le = d1(_r);
 function d1(e) {
   return e && e.__esModule ? e : { default: e };
 }
@@ -16361,30 +16363,30 @@ var h1 = {
   * 'y' - only allows the height to be changed
   * 'none' - disables resizing altogether
   * */
-  axis: ce.default.oneOf(["both", "x", "y", "none"]),
-  className: ce.default.string,
+  axis: le.default.oneOf(["both", "x", "y", "none"]),
+  className: le.default.string,
   /*
   * Require that one and only one child be present.
   * */
-  children: ce.default.element.isRequired,
+  children: le.default.element.isRequired,
   /*
   * These will be passed wholesale to react-draggable's DraggableCore
   * */
-  draggableOpts: ce.default.shape({
-    allowAnyClick: ce.default.bool,
-    cancel: ce.default.string,
-    children: ce.default.node,
-    disabled: ce.default.bool,
-    enableUserSelectHack: ce.default.bool,
-    offsetParent: ce.default.node,
-    grid: ce.default.arrayOf(ce.default.number),
-    handle: ce.default.string,
-    nodeRef: ce.default.object,
-    onStart: ce.default.func,
-    onDrag: ce.default.func,
-    onStop: ce.default.func,
-    onMouseDown: ce.default.func,
-    scale: ce.default.number
+  draggableOpts: le.default.shape({
+    allowAnyClick: le.default.bool,
+    cancel: le.default.string,
+    children: le.default.node,
+    disabled: le.default.bool,
+    enableUserSelectHack: le.default.bool,
+    offsetParent: le.default.node,
+    grid: le.default.arrayOf(le.default.number),
+    handle: le.default.string,
+    nodeRef: le.default.object,
+    onStart: le.default.func,
+    onDrag: le.default.func,
+    onStop: le.default.func,
+    onMouseDown: le.default.func,
+    scale: le.default.number
   }),
   /*
   * Initial height
@@ -16395,39 +16397,39 @@ var h1 = {
     var i = r[0];
     if (i.axis === "both" || i.axis === "y") {
       var a;
-      return (a = ce.default.number).isRequired.apply(a, r);
+      return (a = le.default.number).isRequired.apply(a, r);
     }
-    return ce.default.number.apply(ce.default, r);
+    return le.default.number.apply(le.default, r);
   },
   /*
   * Customize cursor resize handle
   * */
-  handle: ce.default.oneOfType([ce.default.node, ce.default.func]),
+  handle: le.default.oneOfType([le.default.node, le.default.func]),
   /*
   * If you change this, be sure to update your css
   * */
-  handleSize: ce.default.arrayOf(ce.default.number),
-  lockAspectRatio: ce.default.bool,
+  handleSize: le.default.arrayOf(le.default.number),
+  lockAspectRatio: le.default.bool,
   /*
   * Max X & Y measure
   * */
-  maxConstraints: ce.default.arrayOf(ce.default.number),
+  maxConstraints: le.default.arrayOf(le.default.number),
   /*
   * Min X & Y measure
   * */
-  minConstraints: ce.default.arrayOf(ce.default.number),
+  minConstraints: le.default.arrayOf(le.default.number),
   /*
   * Called on stop resize event
   * */
-  onResizeStop: ce.default.func,
+  onResizeStop: le.default.func,
   /*
   * Called on start resize event
   * */
-  onResizeStart: ce.default.func,
+  onResizeStart: le.default.func,
   /*
   * Called on resize event
   * */
-  onResize: ce.default.func,
+  onResize: le.default.func,
   /*
   * Defines which resize handles should be rendered (default: 'se')
   * 's' - South handle (bottom-center)
@@ -16439,11 +16441,11 @@ var h1 = {
   * 'se' - Southeast handle (bottom-right)
   * 'ne' - Northeast handle (top-center)
   * */
-  resizeHandles: ce.default.arrayOf(ce.default.oneOf(["s", "w", "e", "n", "sw", "nw", "se", "ne"])),
+  resizeHandles: le.default.arrayOf(le.default.oneOf(["s", "w", "e", "n", "sw", "nw", "se", "ne"])),
   /*
   * If `transform: scale(n)` is set on the parent, this should be set to `n`.
   * */
-  transformScale: ce.default.number,
+  transformScale: le.default.number,
   /*
    * Initial width
    */
@@ -16453,9 +16455,9 @@ var h1 = {
     var i = r[0];
     if (i.axis === "both" || i.axis === "x") {
       var a;
-      return (a = ce.default.number).isRequired.apply(a, r);
+      return (a = le.default.number).isRequired.apply(a, r);
     }
-    return ce.default.number.apply(ce.default, r);
+    return le.default.number.apply(le.default, r);
   }
 };
 Ci.resizableProps = h1;
@@ -16810,35 +16812,35 @@ Object.defineProperty(Kt, "__esModule", {
   value: !0
 });
 Kt.resizeHandleType = Kt.resizeHandleAxesType = Kt.default = void 0;
-var ue = rh(_r), B1 = rh(Oe);
+var fe = rh(_r), B1 = rh(Oe);
 function rh(e) {
   return e && e.__esModule ? e : { default: e };
 }
-const j1 = Kt.resizeHandleAxesType = ue.default.arrayOf(ue.default.oneOf(["s", "w", "e", "n", "sw", "nw", "se", "ne"])), z1 = Kt.resizeHandleType = ue.default.oneOfType([ue.default.node, ue.default.func]);
+const j1 = Kt.resizeHandleAxesType = fe.default.arrayOf(fe.default.oneOf(["s", "w", "e", "n", "sw", "nw", "se", "ne"])), z1 = Kt.resizeHandleType = fe.default.oneOfType([fe.default.node, fe.default.func]);
 Kt.default = {
   //
   // Basic props
   //
-  className: ue.default.string,
-  style: ue.default.object,
+  className: fe.default.string,
+  style: fe.default.object,
   // This can be set explicitly. If it is not set, it will automatically
   // be set to the container width. Note that resizes will *not* cause this to adjust.
   // If you need that behavior, use WidthProvider.
-  width: ue.default.number,
+  width: fe.default.number,
   // If true, the container height swells and contracts to fit contents
-  autoSize: ue.default.bool,
+  autoSize: fe.default.bool,
   // # of cols.
-  cols: ue.default.number,
+  cols: fe.default.number,
   // A selector that will not be draggable.
-  draggableCancel: ue.default.string,
+  draggableCancel: fe.default.string,
   // A selector for the draggable handler
-  draggableHandle: ue.default.string,
+  draggableHandle: fe.default.string,
   // Deprecated
   verticalCompact: function(e) {
     e.verticalCompact;
   },
   // Choose vertical or hotizontal compaction
-  compactType: ue.default.oneOf(["vertical", "horizontal"]),
+  compactType: fe.default.oneOf(["vertical", "horizontal"]),
   // layout is an array of object with the format:
   // {x: Number, y: Number, w: Number, h: Number, i: String}
   layout: function(e) {
@@ -16849,33 +16851,33 @@ Kt.default = {
   // Grid Dimensions
   //
   // Margin between items [x, y] in px
-  margin: ue.default.arrayOf(ue.default.number),
+  margin: fe.default.arrayOf(fe.default.number),
   // Padding inside the container [x, y] in px
-  containerPadding: ue.default.arrayOf(ue.default.number),
+  containerPadding: fe.default.arrayOf(fe.default.number),
   // Rows have a static height, but you can change this based on breakpoints if you like
-  rowHeight: ue.default.number,
+  rowHeight: fe.default.number,
   // Default Infinity, but you can specify a max here if you like.
   // Note that this isn't fully fleshed out and won't error if you specify a layout that
   // extends beyond the row capacity. It will, however, not allow users to drag/resize
   // an item past the barrier. They can push items beyond the barrier, though.
   // Intentionally not documented for this reason.
-  maxRows: ue.default.number,
+  maxRows: fe.default.number,
   //
   // Flags
   //
-  isBounded: ue.default.bool,
-  isDraggable: ue.default.bool,
-  isResizable: ue.default.bool,
+  isBounded: fe.default.bool,
+  isDraggable: fe.default.bool,
+  isResizable: fe.default.bool,
   // If true, grid can be placed one over the other.
-  allowOverlap: ue.default.bool,
+  allowOverlap: fe.default.bool,
   // If true, grid items won't change position when being dragged over.
-  preventCollision: ue.default.bool,
+  preventCollision: fe.default.bool,
   // Use CSS transforms instead of top/left
-  useCSSTransforms: ue.default.bool,
+  useCSSTransforms: fe.default.bool,
   // parent layout transform scale
-  transformScale: ue.default.number,
+  transformScale: fe.default.number,
   // If true, an external element can trigger onDrop callback with a specific grid position as a parameter
-  isDroppable: ue.default.bool,
+  isDroppable: fe.default.bool,
   // Resize handle options
   resizeHandles: j1,
   resizeHandle: z1,
@@ -16883,29 +16885,29 @@ Kt.default = {
   // Callbacks
   //
   // Callback so you can save the layout. Calls after each drag & resize stops.
-  onLayoutChange: ue.default.func,
+  onLayoutChange: fe.default.func,
   // Calls when drag starts. Callback is of the signature (layout, oldItem, newItem, placeholder, e, ?node).
   // All callbacks below have the same signature. 'start' and 'stop' callbacks omit the 'placeholder'.
-  onDragStart: ue.default.func,
+  onDragStart: fe.default.func,
   // Calls on each drag movement.
-  onDrag: ue.default.func,
+  onDrag: fe.default.func,
   // Calls when drag is complete.
-  onDragStop: ue.default.func,
+  onDragStop: fe.default.func,
   //Calls when resize starts.
-  onResizeStart: ue.default.func,
+  onResizeStart: fe.default.func,
   // Calls when resize movement happens.
-  onResize: ue.default.func,
+  onResize: fe.default.func,
   // Calls when resize is complete.
-  onResizeStop: ue.default.func,
+  onResizeStop: fe.default.func,
   // Calls when some element is dropped.
-  onDrop: ue.default.func,
+  onDrop: fe.default.func,
   //
   // Other validations
   //
-  droppingItem: ue.default.shape({
-    i: ue.default.string.isRequired,
-    w: ue.default.number.isRequired,
-    h: ue.default.number.isRequired
+  droppingItem: fe.default.shape({
+    i: fe.default.string.isRequired,
+    w: fe.default.number.isRequired,
+    h: fe.default.number.isRequired
   }),
   // Children must not have duplicate keys.
   children: function(e, t) {
@@ -16919,7 +16921,7 @@ Kt.default = {
     });
   },
   // Optional ref for getting a reference for the wrapping div.
-  innerRef: ue.default.any
+  innerRef: fe.default.any
 };
 Object.defineProperty(Ma, "__esModule", {
   value: !0
@@ -18597,7 +18599,7 @@ const hh = /* @__PURE__ */ Ot(dc), $x = dc.WidthProvider(hh), Tx = yr.div`
     overflow: auto;
   }
 `, uE = () => {
-  const [e, t] = ht([]), [r, n] = ht([]), [i, a] = ht(!1), { projectMetadata: o } = Sd(), s = async () => {
+  const [e, t] = ct([]), [r, n] = ct([]), [i, a] = ct(!1), { projectMetadata: o } = Sd(), s = async () => {
     a(!0), await Cb(o.projectName, o.projectURL), a(!1), await ad(o.projectName, o.projectURL), await Sb(o.projectName);
     const l = await Z_(
       o.projectName