import { p as Ee } from "./en_US-M4RYPLCZ-DRBKitl3.js";
var Ae = {}, Pr;
function $n() {
  return Pr || (Pr = 1, function(c) {
    Object.defineProperties(c, { __esModule: { value: !0 }, [Symbol.toStringTag]: { value: "Module" } });
    var E = {}, f = {};
    f.byteLength = i, f.toByteArray = w, f.fromByteArray = x;
    for (var a = [], h = [], $ = typeof Uint8Array < "u" ? Uint8Array : Array, d = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/", g = 0, l = d.length; g < l; ++g)
      a[g] = d[g], h[d.charCodeAt(g)] = g;
    h[45] = 62, h[95] = 63;
    function L(T) {
      var y = T.length;
      if (y % 4 > 0)
        throw new Error("Invalid string. Length must be a multiple of 4");
      var P = T.indexOf("=");
      P === -1 && (P = y);
      var b = P === y ? 0 : 4 - P % 4;
      return [P, b];
    }
    function i(T) {
      var y = L(T), P = y[0], b = y[1];
      return (P + b) * 3 / 4 - b;
    }
    function m(T, y, P) {
      return (y + P) * 3 / 4 - P;
    }
    function w(T) {
      var y, P = L(T), b = P[0], C = P[1], B = new $(m(T, b, C)), I = 0, H = C > 0 ? b - 4 : b, k;
      for (k = 0; k < H; k += 4)
        y = h[T.charCodeAt(k)] << 18 | h[T.charCodeAt(k + 1)] << 12 | h[T.charCodeAt(k + 2)] << 6 | h[T.charCodeAt(k + 3)], B[I++] = y >> 16 & 255, B[I++] = y >> 8 & 255, B[I++] = y & 255;
      return C === 2 && (y = h[T.charCodeAt(k)] << 2 | h[T.charCodeAt(k + 1)] >> 4, B[I++] = y & 255), C === 1 && (y = h[T.charCodeAt(k)] << 10 | h[T.charCodeAt(k + 1)] << 4 | h[T.charCodeAt(k + 2)] >> 2, B[I++] = y >> 8 & 255, B[I++] = y & 255), B;
    }
    function S(T) {
      return a[T >> 18 & 63] + a[T >> 12 & 63] + a[T >> 6 & 63] + a[T & 63];
    }
    function U(T, y, P) {
      for (var b, C = [], B = y; B < P; B += 3)
        b = (T[B] << 16 & 16711680) + (T[B + 1] << 8 & 65280) + (T[B + 2] & 255), C.push(S(b));
      return C.join("");
    }
    function x(T) {
      for (var y, P = T.length, b = P % 3, C = [], B = 16383, I = 0, H = P - b; I < H; I += B)
        C.push(U(T, I, I + B > H ? H : I + B));
      return b === 1 ? (y = T[P - 1], C.push(
        a[y >> 2] + a[y << 4 & 63] + "=="
      )) : b === 2 && (y = (T[P - 2] << 8) + T[P - 1], C.push(
        a[y >> 10] + a[y >> 4 & 63] + a[y << 2 & 63] + "="
      )), C.join("");
    }
    var D = {};
    /*! ieee754. BSD-3-Clause License. Feross Aboukhadijeh <https://feross.org/opensource> */
    D.read = function(T, y, P, b, C) {
      var B, I, H = C * 8 - b - 1, k = (1 << H) - 1, K = k >> 1, o = -7, Z = P ? C - 1 : 0, A = P ? -1 : 1, R = T[y + Z];
      for (Z += A, B = R & (1 << -o) - 1, R >>= -o, o += H; o > 0; B = B * 256 + T[y + Z], Z += A, o -= 8)
        ;
      for (I = B & (1 << -o) - 1, B >>= -o, o += b; o > 0; I = I * 256 + T[y + Z], Z += A, o -= 8)
        ;
      if (B === 0)
        B = 1 - K;
      else {
        if (B === k)
          return I ? NaN : (R ? -1 : 1) * (1 / 0);
        I = I + Math.pow(2, b), B = B - K;
      }
      return (R ? -1 : 1) * I * Math.pow(2, B - b);
    }, D.write = function(T, y, P, b, C, B) {
      var I, H, k, K = B * 8 - C - 1, o = (1 << K) - 1, Z = o >> 1, A = C === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0, R = b ? 0 : B - 1, F = b ? 1 : -1, N = y < 0 || y === 0 && 1 / y < 0 ? 1 : 0;
      for (y = Math.abs(y), isNaN(y) || y === 1 / 0 ? (H = isNaN(y) ? 1 : 0, I = o) : (I = Math.floor(Math.log(y) / Math.LN2), y * (k = Math.pow(2, -I)) < 1 && (I--, k *= 2), I + Z >= 1 ? y += A / k : y += A * Math.pow(2, 1 - Z), y * k >= 2 && (I++, k /= 2), I + Z >= o ? (H = 0, I = o) : I + Z >= 1 ? (H = (y * k - 1) * Math.pow(2, C), I = I + Z) : (H = y * Math.pow(2, Z - 1) * Math.pow(2, C), I = 0)); C >= 8; T[P + R] = H & 255, R += F, H /= 256, C -= 8)
        ;
      for (I = I << C | H, K += C; K > 0; T[P + R] = I & 255, R += F, I /= 256, K -= 8)
        ;
      T[P + R - F] |= N * 128;
    };
    /*!
     * The buffer module from node.js, for the browser.
     *
     * @author   Feross Aboukhadijeh <https://feross.org>
     * @license  MIT
     */
    (function(T) {
      const y = f, P = D, b = typeof Symbol == "function" && typeof Symbol.for == "function" ? Symbol.for("nodejs.util.inspect.custom") : null;
      T.Buffer = o, T.SlowBuffer = X, T.INSPECT_MAX_BYTES = 50;
      const C = 2147483647;
      T.kMaxLength = C;
      const { Uint8Array: B, ArrayBuffer: I, SharedArrayBuffer: H } = globalThis;
      o.TYPED_ARRAY_SUPPORT = k(), !o.TYPED_ARRAY_SUPPORT && typeof console < "u" && typeof console.error == "function" && console.error(
        "This browser lacks typed array (Uint8Array) support which is required by `buffer` v5.x. Use `buffer` v4.x if you require old browser support."
      );
      function k() {
        try {
          const t = new B(1), e = { foo: function() {
            return 42;
          } };
          return Object.setPrototypeOf(e, B.prototype), Object.setPrototypeOf(t, e), t.foo() === 42;
        } catch {
          return !1;
        }
      }
      Object.defineProperty(o.prototype, "parent", {
        enumerable: !0,
        get: function() {
          if (o.isBuffer(this))
            return this.buffer;
        }
      }), Object.defineProperty(o.prototype, "offset", {
        enumerable: !0,
        get: function() {
          if (o.isBuffer(this))
            return this.byteOffset;
        }
      });
      function K(t) {
        if (t > C)
          throw new RangeError('The value "' + t + '" is invalid for option "size"');
        const e = new B(t);
        return Object.setPrototypeOf(e, o.prototype), e;
      }
      function o(t, e, r) {
        if (typeof t == "number") {
          if (typeof e == "string")
            throw new TypeError(
              'The "string" argument must be of type string. Received type number'
            );
          return F(t);
        }
        return Z(t, e, r);
      }
      o.poolSize = 8192;
      function Z(t, e, r) {
        if (typeof t == "string")
          return N(t, e);
        if (I.isView(t))
          return O(t);
        if (t == null)
          throw new TypeError(
            "The first argument must be one of type string, Buffer, ArrayBuffer, Array, or Array-like Object. Received type " + typeof t
          );
        if (oe(t, I) || t && oe(t.buffer, I) || typeof H < "u" && (oe(t, H) || t && oe(t.buffer, H)))
          return _(t, e, r);
        if (typeof t == "number")
          throw new TypeError(
            'The "value" argument must not be of type number. Received type number'
          );
        const n = t.valueOf && t.valueOf();
        if (n != null && n !== t)
          return o.from(n, e, r);
        const s = M(t);
        if (s) return s;
        if (typeof Symbol < "u" && Symbol.toPrimitive != null && typeof t[Symbol.toPrimitive] == "function")
          return o.from(t[Symbol.toPrimitive]("string"), e, r);
        throw new TypeError(
          "The first argument must be one of type string, Buffer, ArrayBuffer, Array, or Array-like Object. Received type " + typeof t
        );
      }
      o.from = function(t, e, r) {
        return Z(t, e, r);
      }, Object.setPrototypeOf(o.prototype, B.prototype), Object.setPrototypeOf(o, B);
      function A(t) {
        if (typeof t != "number")
          throw new TypeError('"size" argument must be of type number');
        if (t < 0)
          throw new RangeError('The value "' + t + '" is invalid for option "size"');
      }
      function R(t, e, r) {
        return A(t), t <= 0 ? K(t) : e !== void 0 ? typeof r == "string" ? K(t).fill(e, r) : K(t).fill(e) : K(t);
      }
      o.alloc = function(t, e, r) {
        return R(t, e, r);
      };
      function F(t) {
        return A(t), K(t < 0 ? 0 : q(t) | 0);
      }
      o.allocUnsafe = function(t) {
        return F(t);
      }, o.allocUnsafeSlow = function(t) {
        return F(t);
      };
      function N(t, e) {
        if ((typeof e != "string" || e === "") && (e = "utf8"), !o.isEncoding(e))
          throw new TypeError("Unknown encoding: " + e);
        const r = Q(t, e) | 0;
        let n = K(r);
        const s = n.write(t, e);
        return s !== r && (n = n.slice(0, s)), n;
      }
      function v(t) {
        const e = t.length < 0 ? 0 : q(t.length) | 0, r = K(e);
        for (let n = 0; n < e; n += 1)
          r[n] = t[n] & 255;
        return r;
      }
      function O(t) {
        if (oe(t, B)) {
          const e = new B(t);
          return _(e.buffer, e.byteOffset, e.byteLength);
        }
        return v(t);
      }
      function _(t, e, r) {
        if (e < 0 || t.byteLength < e)
          throw new RangeError('"offset" is outside of buffer bounds');
        if (t.byteLength < e + (r || 0))
          throw new RangeError('"length" is outside of buffer bounds');
        let n;
        return e === void 0 && r === void 0 ? n = new B(t) : r === void 0 ? n = new B(t, e) : n = new B(t, e, r), Object.setPrototypeOf(n, o.prototype), n;
      }
      function M(t) {
        if (o.isBuffer(t)) {
          const e = q(t.length) | 0, r = K(e);
          return r.length === 0 || t.copy(r, 0, 0, e), r;
        }
        if (t.length !== void 0)
          return typeof t.length != "number" || Le(t.length) ? K(0) : v(t);
        if (t.type === "Buffer" && Array.isArray(t.data))
          return v(t.data);
      }
      function q(t) {
        if (t >= C)
          throw new RangeError("Attempt to allocate Buffer larger than maximum size: 0x" + C.toString(16) + " bytes");
        return t | 0;
      }
      function X(t) {
        return +t != t && (t = 0), o.alloc(+t);
      }
      o.isBuffer = function(e) {
        return e != null && e._isBuffer === !0 && e !== o.prototype;
      }, o.compare = function(e, r) {
        if (oe(e, B) && (e = o.from(e, e.offset, e.byteLength)), oe(r, B) && (r = o.from(r, r.offset, r.byteLength)), !o.isBuffer(e) || !o.isBuffer(r))
          throw new TypeError(
            'The "buf1", "buf2" arguments must be one of type Buffer or Uint8Array'
          );
        if (e === r) return 0;
        let n = e.length, s = r.length;
        for (let u = 0, p = Math.min(n, s); u < p; ++u)
          if (e[u] !== r[u]) {
            n = e[u], s = r[u];
            break;
          }
        return n < s ? -1 : s < n ? 1 : 0;
      }, o.isEncoding = function(e) {
        switch (String(e).toLowerCase()) {
          case "hex":
          case "utf8":
          case "utf-8":
          case "ascii":
          case "latin1":
          case "binary":
          case "base64":
          case "ucs2":
          case "ucs-2":
          case "utf16le":
          case "utf-16le":
            return !0;
          default:
            return !1;
        }
      }, o.concat = function(e, r) {
        if (!Array.isArray(e))
          throw new TypeError('"list" argument must be an Array of Buffers');
        if (e.length === 0)
          return o.alloc(0);
        let n;
        if (r === void 0)
          for (r = 0, n = 0; n < e.length; ++n)
            r += e[n].length;
        const s = o.allocUnsafe(r);
        let u = 0;
        for (n = 0; n < e.length; ++n) {
          let p = e[n];
          if (oe(p, B))
            u + p.length > s.length ? (o.isBuffer(p) || (p = o.from(p)), p.copy(s, u)) : B.prototype.set.call(
              s,
              p,
              u
            );
          else if (o.isBuffer(p))
            p.copy(s, u);
          else
            throw new TypeError('"list" argument must be an Array of Buffers');
          u += p.length;
        }
        return s;
      };
      function Q(t, e) {
        if (o.isBuffer(t))
          return t.length;
        if (I.isView(t) || oe(t, I))
          return t.byteLength;
        if (typeof t != "string")
          throw new TypeError(
            'The "string" argument must be one of type string, Buffer, or ArrayBuffer. Received type ' + typeof t
          );
        const r = t.length, n = arguments.length > 2 && arguments[2] === !0;
        if (!n && r === 0) return 0;
        let s = !1;
        for (; ; )
          switch (e) {
            case "ascii":
            case "latin1":
            case "binary":
              return r;
            case "utf8":
            case "utf-8":
              return xe(t).length;
            case "ucs2":
            case "ucs-2":
            case "utf16le":
            case "utf-16le":
              return r * 2;
            case "hex":
              return r >>> 1;
            case "base64":
              return vr(t).length;
            default:
              if (s)
                return n ? -1 : xe(t).length;
              e = ("" + e).toLowerCase(), s = !0;
          }
      }
      o.byteLength = Q;
      function W(t, e, r) {
        let n = !1;
        if ((e === void 0 || e < 0) && (e = 0), e > this.length || ((r === void 0 || r > this.length) && (r = this.length), r <= 0) || (r >>>= 0, e >>>= 0, r <= e))
          return "";
        for (t || (t = "utf8"); ; )
          switch (t) {
            case "hex":
              return Gt(this, e, r);
            case "utf8":
            case "utf-8":
              return Lr(this, e, r);
            case "ascii":
              return Dt(this, e, r);
            case "latin1":
            case "binary":
              return bt(this, e, r);
            case "base64":
              return _t(this, e, r);
            case "ucs2":
            case "ucs-2":
            case "utf16le":
            case "utf-16le":
              return Mt(this, e, r);
            default:
              if (n) throw new TypeError("Unknown encoding: " + t);
              t = (t + "").toLowerCase(), n = !0;
          }
      }
      o.prototype._isBuffer = !0;
      function ne(t, e, r) {
        const n = t[e];
        t[e] = t[r], t[r] = n;
      }
      o.prototype.swap16 = function() {
        const e = this.length;
        if (e % 2 !== 0)
          throw new RangeError("Buffer size must be a multiple of 16-bits");
        for (let r = 0; r < e; r += 2)
          ne(this, r, r + 1);
        return this;
      }, o.prototype.swap32 = function() {
        const e = this.length;
        if (e % 4 !== 0)
          throw new RangeError("Buffer size must be a multiple of 32-bits");
        for (let r = 0; r < e; r += 4)
          ne(this, r, r + 3), ne(this, r + 1, r + 2);
        return this;
      }, o.prototype.swap64 = function() {
        const e = this.length;
        if (e % 8 !== 0)
          throw new RangeError("Buffer size must be a multiple of 64-bits");
        for (let r = 0; r < e; r += 8)
          ne(this, r, r + 7), ne(this, r + 1, r + 6), ne(this, r + 2, r + 5), ne(this, r + 3, r + 4);
        return this;
      }, o.prototype.toString = function() {
        const e = this.length;
        return e === 0 ? "" : arguments.length === 0 ? Lr(this, 0, e) : W.apply(this, arguments);
      }, o.prototype.toLocaleString = o.prototype.toString, o.prototype.equals = function(e) {
        if (!o.isBuffer(e)) throw new TypeError("Argument must be a Buffer");
        return this === e ? !0 : o.compare(this, e) === 0;
      }, o.prototype.inspect = function() {
        let e = "";
        const r = T.INSPECT_MAX_BYTES;
        return e = this.toString("hex", 0, r).replace(/(.{2})/g, "$1 ").trim(), this.length > r && (e += " ... "), "<Buffer " + e + ">";
      }, b && (o.prototype[b] = o.prototype.inspect), o.prototype.compare = function(e, r, n, s, u) {
        if (oe(e, B) && (e = o.from(e, e.offset, e.byteLength)), !o.isBuffer(e))
          throw new TypeError(
            'The "target" argument must be one of type Buffer or Uint8Array. Received type ' + typeof e
          );
        if (r === void 0 && (r = 0), n === void 0 && (n = e ? e.length : 0), s === void 0 && (s = 0), u === void 0 && (u = this.length), r < 0 || n > e.length || s < 0 || u > this.length)
          throw new RangeError("out of range index");
        if (s >= u && r >= n)
          return 0;
        if (s >= u)
          return -1;
        if (r >= n)
          return 1;
        if (r >>>= 0, n >>>= 0, s >>>= 0, u >>>= 0, this === e) return 0;
        let p = u - s, G = n - r;
        const z = Math.min(p, G), Y = this.slice(s, u), J = e.slice(r, n);
        for (let V = 0; V < z; ++V)
          if (Y[V] !== J[V]) {
            p = Y[V], G = J[V];
            break;
          }
        return p < G ? -1 : G < p ? 1 : 0;
      };
      function $r(t, e, r, n, s) {
        if (t.length === 0) return -1;
        if (typeof r == "string" ? (n = r, r = 0) : r > 2147483647 ? r = 2147483647 : r < -2147483648 && (r = -2147483648), r = +r, Le(r) && (r = s ? 0 : t.length - 1), r < 0 && (r = t.length + r), r >= t.length) {
          if (s) return -1;
          r = t.length - 1;
        } else if (r < 0)
          if (s) r = 0;
          else return -1;
        if (typeof e == "string" && (e = o.from(e, n)), o.isBuffer(e))
          return e.length === 0 ? -1 : xr(t, e, r, n, s);
        if (typeof e == "number")
          return e = e & 255, typeof B.prototype.indexOf == "function" ? s ? B.prototype.indexOf.call(t, e, r) : B.prototype.lastIndexOf.call(t, e, r) : xr(t, [e], r, n, s);
        throw new TypeError("val must be string, number or Buffer");
      }
      function xr(t, e, r, n, s) {
        let u = 1, p = t.length, G = e.length;
        if (n !== void 0 && (n = String(n).toLowerCase(), n === "ucs2" || n === "ucs-2" || n === "utf16le" || n === "utf-16le")) {
          if (t.length < 2 || e.length < 2)
            return -1;
          u = 2, p /= 2, G /= 2, r /= 2;
        }
        function z(J, V) {
          return u === 1 ? J[V] : J.readUInt16BE(V * u);
        }
        let Y;
        if (s) {
          let J = -1;
          for (Y = r; Y < p; Y++)
            if (z(t, Y) === z(e, J === -1 ? 0 : Y - J)) {
              if (J === -1 && (J = Y), Y - J + 1 === G) return J * u;
            } else
              J !== -1 && (Y -= Y - J), J = -1;
        } else
          for (r + G > p && (r = p - G), Y = r; Y >= 0; Y--) {
            let J = !0;
            for (let V = 0; V < G; V++)
              if (z(t, Y + V) !== z(e, V)) {
                J = !1;
                break;
              }
            if (J) return Y;
          }
        return -1;
      }
      o.prototype.includes = function(e, r, n) {
        return this.indexOf(e, r, n) !== -1;
      }, o.prototype.indexOf = function(e, r, n) {
        return $r(this, e, r, n, !0);
      }, o.prototype.lastIndexOf = function(e, r, n) {
        return $r(this, e, r, n, !1);
      };
      function Ot(t, e, r, n) {
        r = Number(r) || 0;
        const s = t.length - r;
        n ? (n = Number(n), n > s && (n = s)) : n = s;
        const u = e.length;
        n > u / 2 && (n = u / 2);
        let p;
        for (p = 0; p < n; ++p) {
          const G = parseInt(e.substr(p * 2, 2), 16);
          if (Le(G)) return p;
          t[r + p] = G;
        }
        return p;
      }
      function Ct(t, e, r, n) {
        return pe(xe(e, t.length - r), t, r, n);
      }
      function vt(t, e, r, n) {
        return pe(Vt(e), t, r, n);
      }
      function Pt(t, e, r, n) {
        return pe(vr(e), t, r, n);
      }
      function Ut(t, e, r, n) {
        return pe(Ht(e, t.length - r), t, r, n);
      }
      o.prototype.write = function(e, r, n, s) {
        if (r === void 0)
          s = "utf8", n = this.length, r = 0;
        else if (n === void 0 && typeof r == "string")
          s = r, n = this.length, r = 0;
        else if (isFinite(r))
          r = r >>> 0, isFinite(n) ? (n = n >>> 0, s === void 0 && (s = "utf8")) : (s = n, n = void 0);
        else
          throw new Error(
            "Buffer.write(string, encoding, offset[, length]) is no longer supported"
          );
        const u = this.length - r;
        if ((n === void 0 || n > u) && (n = u), e.length > 0 && (n < 0 || r < 0) || r > this.length)
          throw new RangeError("Attempt to write outside buffer bounds");
        s || (s = "utf8");
        let p = !1;
        for (; ; )
          switch (s) {
            case "hex":
              return Ot(this, e, r, n);
            case "utf8":
            case "utf-8":
              return Ct(this, e, r, n);
            case "ascii":
            case "latin1":
            case "binary":
              return vt(this, e, r, n);
            case "base64":
              return Pt(this, e, r, n);
            case "ucs2":
            case "ucs-2":
            case "utf16le":
            case "utf-16le":
              return Ut(this, e, r, n);
            default:
              if (p) throw new TypeError("Unknown encoding: " + s);
              s = ("" + s).toLowerCase(), p = !0;
          }
      }, o.prototype.toJSON = function() {
        return {
          type: "Buffer",
          data: Array.prototype.slice.call(this._arr || this, 0)
        };
      };
      function _t(t, e, r) {
        return e === 0 && r === t.length ? y.fromByteArray(t) : y.fromByteArray(t.slice(e, r));
      }
      function Lr(t, e, r) {
        r = Math.min(t.length, r);
        const n = [];
        let s = e;
        for (; s < r; ) {
          const u = t[s];
          let p = null, G = u > 239 ? 4 : u > 223 ? 3 : u > 191 ? 2 : 1;
          if (s + G <= r) {
            let z, Y, J, V;
            switch (G) {
              case 1:
                u < 128 && (p = u);
                break;
              case 2:
                z = t[s + 1], (z & 192) === 128 && (V = (u & 31) << 6 | z & 63, V > 127 && (p = V));
                break;
              case 3:
                z = t[s + 1], Y = t[s + 2], (z & 192) === 128 && (Y & 192) === 128 && (V = (u & 15) << 12 | (z & 63) << 6 | Y & 63, V > 2047 && (V < 55296 || V > 57343) && (p = V));
                break;
              case 4:
                z = t[s + 1], Y = t[s + 2], J = t[s + 3], (z & 192) === 128 && (Y & 192) === 128 && (J & 192) === 128 && (V = (u & 15) << 18 | (z & 63) << 12 | (Y & 63) << 6 | J & 63, V > 65535 && V < 1114112 && (p = V));
            }
          }
          p === null ? (p = 65533, G = 1) : p > 65535 && (p -= 65536, n.push(p >>> 10 & 1023 | 55296), p = 56320 | p & 1023), n.push(p), s += G;
        }
        return qt(n);
      }
      const Ar = 4096;
      function qt(t) {
        const e = t.length;
        if (e <= Ar)
          return String.fromCharCode.apply(String, t);
        let r = "", n = 0;
        for (; n < e; )
          r += String.fromCharCode.apply(
            String,
            t.slice(n, n += Ar)
          );
        return r;
      }
      function Dt(t, e, r) {
        let n = "";
        r = Math.min(t.length, r);
        for (let s = e; s < r; ++s)
          n += String.fromCharCode(t[s] & 127);
        return n;
      }
      function bt(t, e, r) {
        let n = "";
        r = Math.min(t.length, r);
        for (let s = e; s < r; ++s)
          n += String.fromCharCode(t[s]);
        return n;
      }
      function Gt(t, e, r) {
        const n = t.length;
        (!e || e < 0) && (e = 0), (!r || r < 0 || r > n) && (r = n);
        let s = "";
        for (let u = e; u < r; ++u)
          s += Yt[t[u]];
        return s;
      }
      function Mt(t, e, r) {
        const n = t.slice(e, r);
        let s = "";
        for (let u = 0; u < n.length - 1; u += 2)
          s += String.fromCharCode(n[u] + n[u + 1] * 256);
        return s;
      }
      o.prototype.slice = function(e, r) {
        const n = this.length;
        e = ~~e, r = r === void 0 ? n : ~~r, e < 0 ? (e += n, e < 0 && (e = 0)) : e > n && (e = n), r < 0 ? (r += n, r < 0 && (r = 0)) : r > n && (r = n), r < e && (r = e);
        const s = this.subarray(e, r);
        return Object.setPrototypeOf(s, o.prototype), s;
      };
      function ee(t, e, r) {
        if (t % 1 !== 0 || t < 0) throw new RangeError("offset is not uint");
        if (t + e > r) throw new RangeError("Trying to access beyond buffer length");
      }
      o.prototype.readUintLE = o.prototype.readUIntLE = function(e, r, n) {
        e = e >>> 0, r = r >>> 0, n || ee(e, r, this.length);
        let s = this[e], u = 1, p = 0;
        for (; ++p < r && (u *= 256); )
          s += this[e + p] * u;
        return s;
      }, o.prototype.readUintBE = o.prototype.readUIntBE = function(e, r, n) {
        e = e >>> 0, r = r >>> 0, n || ee(e, r, this.length);
        let s = this[e + --r], u = 1;
        for (; r > 0 && (u *= 256); )
          s += this[e + --r] * u;
        return s;
      }, o.prototype.readUint8 = o.prototype.readUInt8 = function(e, r) {
        return e = e >>> 0, r || ee(e, 1, this.length), this[e];
      }, o.prototype.readUint16LE = o.prototype.readUInt16LE = function(e, r) {
        return e = e >>> 0, r || ee(e, 2, this.length), this[e] | this[e + 1] << 8;
      }, o.prototype.readUint16BE = o.prototype.readUInt16BE = function(e, r) {
        return e = e >>> 0, r || ee(e, 2, this.length), this[e] << 8 | this[e + 1];
      }, o.prototype.readUint32LE = o.prototype.readUInt32LE = function(e, r) {
        return e = e >>> 0, r || ee(e, 4, this.length), (this[e] | this[e + 1] << 8 | this[e + 2] << 16) + this[e + 3] * 16777216;
      }, o.prototype.readUint32BE = o.prototype.readUInt32BE = function(e, r) {
        return e = e >>> 0, r || ee(e, 4, this.length), this[e] * 16777216 + (this[e + 1] << 16 | this[e + 2] << 8 | this[e + 3]);
      }, o.prototype.readBigUInt64LE = ue(function(e) {
        e = e >>> 0, ce(e, "offset");
        const r = this[e], n = this[e + 7];
        (r === void 0 || n === void 0) && fe(e, this.length - 8);
        const s = r + this[++e] * 2 ** 8 + this[++e] * 2 ** 16 + this[++e] * 2 ** 24, u = this[++e] + this[++e] * 2 ** 8 + this[++e] * 2 ** 16 + n * 2 ** 24;
        return BigInt(s) + (BigInt(u) << BigInt(32));
      }), o.prototype.readBigUInt64BE = ue(function(e) {
        e = e >>> 0, ce(e, "offset");
        const r = this[e], n = this[e + 7];
        (r === void 0 || n === void 0) && fe(e, this.length - 8);
        const s = r * 2 ** 24 + this[++e] * 2 ** 16 + this[++e] * 2 ** 8 + this[++e], u = this[++e] * 2 ** 24 + this[++e] * 2 ** 16 + this[++e] * 2 ** 8 + n;
        return (BigInt(s) << BigInt(32)) + BigInt(u);
      }), o.prototype.readIntLE = function(e, r, n) {
        e = e >>> 0, r = r >>> 0, n || ee(e, r, this.length);
        let s = this[e], u = 1, p = 0;
        for (; ++p < r && (u *= 256); )
          s += this[e + p] * u;
        return u *= 128, s >= u && (s -= Math.pow(2, 8 * r)), s;
      }, o.prototype.readIntBE = function(e, r, n) {
        e = e >>> 0, r = r >>> 0, n || ee(e, r, this.length);
        let s = r, u = 1, p = this[e + --s];
        for (; s > 0 && (u *= 256); )
          p += this[e + --s] * u;
        return u *= 128, p >= u && (p -= Math.pow(2, 8 * r)), p;
      }, o.prototype.readInt8 = function(e, r) {
        return e = e >>> 0, r || ee(e, 1, this.length), this[e] & 128 ? (255 - this[e] + 1) * -1 : this[e];
      }, o.prototype.readInt16LE = function(e, r) {
        e = e >>> 0, r || ee(e, 2, this.length);
        const n = this[e] | this[e + 1] << 8;
        return n & 32768 ? n | 4294901760 : n;
      }, o.prototype.readInt16BE = function(e, r) {
        e = e >>> 0, r || ee(e, 2, this.length);
        const n = this[e + 1] | this[e] << 8;
        return n & 32768 ? n | 4294901760 : n;
      }, o.prototype.readInt32LE = function(e, r) {
        return e = e >>> 0, r || ee(e, 4, this.length), this[e] | this[e + 1] << 8 | this[e + 2] << 16 | this[e + 3] << 24;
      }, o.prototype.readInt32BE = function(e, r) {
        return e = e >>> 0, r || ee(e, 4, this.length), this[e] << 24 | this[e + 1] << 16 | this[e + 2] << 8 | this[e + 3];
      }, o.prototype.readBigInt64LE = ue(function(e) {
        e = e >>> 0, ce(e, "offset");
        const r = this[e], n = this[e + 7];
        (r === void 0 || n === void 0) && fe(e, this.length - 8);
        const s = this[e + 4] + this[e + 5] * 2 ** 8 + this[e + 6] * 2 ** 16 + (n << 24);
        return (BigInt(s) << BigInt(32)) + BigInt(r + this[++e] * 2 ** 8 + this[++e] * 2 ** 16 + this[++e] * 2 ** 24);
      }), o.prototype.readBigInt64BE = ue(function(e) {
        e = e >>> 0, ce(e, "offset");
        const r = this[e], n = this[e + 7];
        (r === void 0 || n === void 0) && fe(e, this.length - 8);
        const s = (r << 24) + // Overflow
        this[++e] * 2 ** 16 + this[++e] * 2 ** 8 + this[++e];
        return (BigInt(s) << BigInt(32)) + BigInt(this[++e] * 2 ** 24 + this[++e] * 2 ** 16 + this[++e] * 2 ** 8 + n);
      }), o.prototype.readFloatLE = function(e, r) {
        return e = e >>> 0, r || ee(e, 4, this.length), P.read(this, e, !0, 23, 4);
      }, o.prototype.readFloatBE = function(e, r) {
        return e = e >>> 0, r || ee(e, 4, this.length), P.read(this, e, !1, 23, 4);
      }, o.prototype.readDoubleLE = function(e, r) {
        return e = e >>> 0, r || ee(e, 8, this.length), P.read(this, e, !0, 52, 8);
      }, o.prototype.readDoubleBE = function(e, r) {
        return e = e >>> 0, r || ee(e, 8, this.length), P.read(this, e, !1, 52, 8);
      };
      function te(t, e, r, n, s, u) {
        if (!o.isBuffer(t)) throw new TypeError('"buffer" argument must be a Buffer instance');
        if (e > s || e < u) throw new RangeError('"value" argument is out of bounds');
        if (r + n > t.length) throw new RangeError("Index out of range");
      }
      o.prototype.writeUintLE = o.prototype.writeUIntLE = function(e, r, n, s) {
        if (e = +e, r = r >>> 0, n = n >>> 0, !s) {
          const G = Math.pow(2, 8 * n) - 1;
          te(this, e, r, n, G, 0);
        }
        let u = 1, p = 0;
        for (this[r] = e & 255; ++p < n && (u *= 256); )
          this[r + p] = e / u & 255;
        return r + n;
      }, o.prototype.writeUintBE = o.prototype.writeUIntBE = function(e, r, n, s) {
        if (e = +e, r = r >>> 0, n = n >>> 0, !s) {
          const G = Math.pow(2, 8 * n) - 1;
          te(this, e, r, n, G, 0);
        }
        let u = n - 1, p = 1;
        for (this[r + u] = e & 255; --u >= 0 && (p *= 256); )
          this[r + u] = e / p & 255;
        return r + n;
      }, o.prototype.writeUint8 = o.prototype.writeUInt8 = function(e, r, n) {
        return e = +e, r = r >>> 0, n || te(this, e, r, 1, 255, 0), this[r] = e & 255, r + 1;
      }, o.prototype.writeUint16LE = o.prototype.writeUInt16LE = function(e, r, n) {
        return e = +e, r = r >>> 0, n || te(this, e, r, 2, 65535, 0), this[r] = e & 255, this[r + 1] = e >>> 8, r + 2;
      }, o.prototype.writeUint16BE = o.prototype.writeUInt16BE = function(e, r, n) {
        return e = +e, r = r >>> 0, n || te(this, e, r, 2, 65535, 0), this[r] = e >>> 8, this[r + 1] = e & 255, r + 2;
      }, o.prototype.writeUint32LE = o.prototype.writeUInt32LE = function(e, r, n) {
        return e = +e, r = r >>> 0, n || te(this, e, r, 4, 4294967295, 0), this[r + 3] = e >>> 24, this[r + 2] = e >>> 16, this[r + 1] = e >>> 8, this[r] = e & 255, r + 4;
      }, o.prototype.writeUint32BE = o.prototype.writeUInt32BE = function(e, r, n) {
        return e = +e, r = r >>> 0, n || te(this, e, r, 4, 4294967295, 0), this[r] = e >>> 24, this[r + 1] = e >>> 16, this[r + 2] = e >>> 8, this[r + 3] = e & 255, r + 4;
      };
      function Br(t, e, r, n, s) {
        Cr(e, n, s, t, r, 7);
        let u = Number(e & BigInt(4294967295));
        t[r++] = u, u = u >> 8, t[r++] = u, u = u >> 8, t[r++] = u, u = u >> 8, t[r++] = u;
        let p = Number(e >> BigInt(32) & BigInt(4294967295));
        return t[r++] = p, p = p >> 8, t[r++] = p, p = p >> 8, t[r++] = p, p = p >> 8, t[r++] = p, r;
      }
      function Sr(t, e, r, n, s) {
        Cr(e, n, s, t, r, 7);
        let u = Number(e & BigInt(4294967295));
        t[r + 7] = u, u = u >> 8, t[r + 6] = u, u = u >> 8, t[r + 5] = u, u = u >> 8, t[r + 4] = u;
        let p = Number(e >> BigInt(32) & BigInt(4294967295));
        return t[r + 3] = p, p = p >> 8, t[r + 2] = p, p = p >> 8, t[r + 1] = p, p = p >> 8, t[r] = p, r + 8;
      }
      o.prototype.writeBigUInt64LE = ue(function(e, r = 0) {
        return Br(this, e, r, BigInt(0), BigInt("0xffffffffffffffff"));
      }), o.prototype.writeBigUInt64BE = ue(function(e, r = 0) {
        return Sr(this, e, r, BigInt(0), BigInt("0xffffffffffffffff"));
      }), o.prototype.writeIntLE = function(e, r, n, s) {
        if (e = +e, r = r >>> 0, !s) {
          const z = Math.pow(2, 8 * n - 1);
          te(this, e, r, n, z - 1, -z);
        }
        let u = 0, p = 1, G = 0;
        for (this[r] = e & 255; ++u < n && (p *= 256); )
          e < 0 && G === 0 && this[r + u - 1] !== 0 && (G = 1), this[r + u] = (e / p >> 0) - G & 255;
        return r + n;
      }, o.prototype.writeIntBE = function(e, r, n, s) {
        if (e = +e, r = r >>> 0, !s) {
          const z = Math.pow(2, 8 * n - 1);
          te(this, e, r, n, z - 1, -z);
        }
        let u = n - 1, p = 1, G = 0;
        for (this[r + u] = e & 255; --u >= 0 && (p *= 256); )
          e < 0 && G === 0 && this[r + u + 1] !== 0 && (G = 1), this[r + u] = (e / p >> 0) - G & 255;
        return r + n;
      }, o.prototype.writeInt8 = function(e, r, n) {
        return e = +e, r = r >>> 0, n || te(this, e, r, 1, 127, -128), e < 0 && (e = 255 + e + 1), this[r] = e & 255, r + 1;
      }, o.prototype.writeInt16LE = function(e, r, n) {
        return e = +e, r = r >>> 0, n || te(this, e, r, 2, 32767, -32768), this[r] = e & 255, this[r + 1] = e >>> 8, r + 2;
      }, o.prototype.writeInt16BE = function(e, r, n) {
        return e = +e, r = r >>> 0, n || te(this, e, r, 2, 32767, -32768), this[r] = e >>> 8, this[r + 1] = e & 255, r + 2;
      }, o.prototype.writeInt32LE = function(e, r, n) {
        return e = +e, r = r >>> 0, n || te(this, e, r, 4, 2147483647, -2147483648), this[r] = e & 255, this[r + 1] = e >>> 8, this[r + 2] = e >>> 16, this[r + 3] = e >>> 24, r + 4;
      }, o.prototype.writeInt32BE = function(e, r, n) {
        return e = +e, r = r >>> 0, n || te(this, e, r, 4, 2147483647, -2147483648), e < 0 && (e = 4294967295 + e + 1), this[r] = e >>> 24, this[r + 1] = e >>> 16, this[r + 2] = e >>> 8, this[r + 3] = e & 255, r + 4;
      }, o.prototype.writeBigInt64LE = ue(function(e, r = 0) {
        return Br(this, e, r, -BigInt("0x8000000000000000"), BigInt("0x7fffffffffffffff"));
      }), o.prototype.writeBigInt64BE = ue(function(e, r = 0) {
        return Sr(this, e, r, -BigInt("0x8000000000000000"), BigInt("0x7fffffffffffffff"));
      });
      function Tr(t, e, r, n, s, u) {
        if (r + n > t.length) throw new RangeError("Index out of range");
        if (r < 0) throw new RangeError("Index out of range");
      }
      function Nr(t, e, r, n, s) {
        return e = +e, r = r >>> 0, s || Tr(t, e, r, 4), P.write(t, e, r, n, 23, 4), r + 4;
      }
      o.prototype.writeFloatLE = function(e, r, n) {
        return Nr(this, e, r, !0, n);
      }, o.prototype.writeFloatBE = function(e, r, n) {
        return Nr(this, e, r, !1, n);
      };
      function Fr(t, e, r, n, s) {
        return e = +e, r = r >>> 0, s || Tr(t, e, r, 8), P.write(t, e, r, n, 52, 8), r + 8;
      }
      o.prototype.writeDoubleLE = function(e, r, n) {
        return Fr(this, e, r, !0, n);
      }, o.prototype.writeDoubleBE = function(e, r, n) {
        return Fr(this, e, r, !1, n);
      }, o.prototype.copy = function(e, r, n, s) {
        if (!o.isBuffer(e)) throw new TypeError("argument should be a Buffer");
        if (n || (n = 0), !s && s !== 0 && (s = this.length), r >= e.length && (r = e.length), r || (r = 0), s > 0 && s < n && (s = n), s === n || e.length === 0 || this.length === 0) return 0;
        if (r < 0)
          throw new RangeError("targetStart out of bounds");
        if (n < 0 || n >= this.length) throw new RangeError("Index out of range");
        if (s < 0) throw new RangeError("sourceEnd out of bounds");
        s > this.length && (s = this.length), e.length - r < s - n && (s = e.length - r + n);
        const u = s - n;
        return this === e && typeof B.prototype.copyWithin == "function" ? this.copyWithin(r, n, s) : B.prototype.set.call(
          e,
          this.subarray(n, s),
          r
        ), u;
      }, o.prototype.fill = function(e, r, n, s) {
        if (typeof e == "string") {
          if (typeof r == "string" ? (s = r, r = 0, n = this.length) : typeof n == "string" && (s = n, n = this.length), s !== void 0 && typeof s != "string")
            throw new TypeError("encoding must be a string");
          if (typeof s == "string" && !o.isEncoding(s))
            throw new TypeError("Unknown encoding: " + s);
          if (e.length === 1) {
            const p = e.charCodeAt(0);
            (s === "utf8" && p < 128 || s === "latin1") && (e = p);
          }
        } else typeof e == "number" ? e = e & 255 : typeof e == "boolean" && (e = Number(e));
        if (r < 0 || this.length < r || this.length < n)
          throw new RangeError("Out of range index");
        if (n <= r)
          return this;
        r = r >>> 0, n = n === void 0 ? this.length : n >>> 0, e || (e = 0);
        let u;
        if (typeof e == "number")
          for (u = r; u < n; ++u)
            this[u] = e;
        else {
          const p = o.isBuffer(e) ? e : o.from(e, s), G = p.length;
          if (G === 0)
            throw new TypeError('The value "' + e + '" is invalid for argument "value"');
          for (u = 0; u < n - r; ++u)
            this[u + r] = p[u % G];
        }
        return this;
      };
      const ae = {};
      function $e(t, e, r) {
        ae[t] = class extends r {
          constructor() {
            super(), Object.defineProperty(this, "message", {
              value: e.apply(this, arguments),
              writable: !0,
              configurable: !0
            }), this.name = `${this.name} [${t}]`, this.stack, delete this.name;
          }
          get code() {
            return t;
          }
          set code(s) {
            Object.defineProperty(this, "code", {
              configurable: !0,
              enumerable: !0,
              value: s,
              writable: !0
            });
          }
          toString() {
            return `${this.name} [${t}]: ${this.message}`;
          }
        };
      }
      $e(
        "ERR_BUFFER_OUT_OF_BOUNDS",
        function(t) {
          return t ? `${t} is outside of buffer bounds` : "Attempt to access memory outside buffer bounds";
        },
        RangeError
      ), $e(
        "ERR_INVALID_ARG_TYPE",
        function(t, e) {
          return `The "${t}" argument must be of type number. Received type ${typeof e}`;
        },
        TypeError
      ), $e(
        "ERR_OUT_OF_RANGE",
        function(t, e, r) {
          let n = `The value of "${t}" is out of range.`, s = r;
          return Number.isInteger(r) && Math.abs(r) > 2 ** 32 ? s = Or(String(r)) : typeof r == "bigint" && (s = String(r), (r > BigInt(2) ** BigInt(32) || r < -(BigInt(2) ** BigInt(32))) && (s = Or(s)), s += "n"), n += ` It must be ${e}. Received ${s}`, n;
        },
        RangeError
      );
      function Or(t) {
        let e = "", r = t.length;
        const n = t[0] === "-" ? 1 : 0;
        for (; r >= n + 4; r -= 3)
          e = `_${t.slice(r - 3, r)}${e}`;
        return `${t.slice(0, r)}${e}`;
      }
      function jt(t, e, r) {
        ce(e, "offset"), (t[e] === void 0 || t[e + r] === void 0) && fe(e, t.length - (r + 1));
      }
      function Cr(t, e, r, n, s, u) {
        if (t > r || t < e) {
          const p = typeof e == "bigint" ? "n" : "";
          let G;
          throw e === 0 || e === BigInt(0) ? G = `>= 0${p} and < 2${p} ** ${(u + 1) * 8}${p}` : G = `>= -(2${p} ** ${(u + 1) * 8 - 1}${p}) and < 2 ** ${(u + 1) * 8 - 1}${p}`, new ae.ERR_OUT_OF_RANGE("value", G, t);
        }
        jt(n, s, u);
      }
      function ce(t, e) {
        if (typeof t != "number")
          throw new ae.ERR_INVALID_ARG_TYPE(e, "number", t);
      }
      function fe(t, e, r) {
        throw Math.floor(t) !== t ? (ce(t, r), new ae.ERR_OUT_OF_RANGE("offset", "an integer", t)) : e < 0 ? new ae.ERR_BUFFER_OUT_OF_BOUNDS() : new ae.ERR_OUT_OF_RANGE(
          "offset",
          `>= 0 and <= ${e}`,
          t
        );
      }
      const kt = /[^+/0-9A-Za-z-_]/g;
      function Xt(t) {
        if (t = t.split("=")[0], t = t.trim().replace(kt, ""), t.length < 2) return "";
        for (; t.length % 4 !== 0; )
          t = t + "=";
        return t;
      }
      function xe(t, e) {
        e = e || 1 / 0;
        let r;
        const n = t.length;
        let s = null;
        const u = [];
        for (let p = 0; p < n; ++p) {
          if (r = t.charCodeAt(p), r > 55295 && r < 57344) {
            if (!s) {
              if (r > 56319) {
                (e -= 3) > -1 && u.push(239, 191, 189);
                continue;
              } else if (p + 1 === n) {
                (e -= 3) > -1 && u.push(239, 191, 189);
                continue;
              }
              s = r;
              continue;
            }
            if (r < 56320) {
              (e -= 3) > -1 && u.push(239, 191, 189), s = r;
              continue;
            }
            r = (s - 55296 << 10 | r - 56320) + 65536;
          } else s && (e -= 3) > -1 && u.push(239, 191, 189);
          if (s = null, r < 128) {
            if ((e -= 1) < 0) break;
            u.push(r);
          } else if (r < 2048) {
            if ((e -= 2) < 0) break;
            u.push(
              r >> 6 | 192,
              r & 63 | 128
            );
          } else if (r < 65536) {
            if ((e -= 3) < 0) break;
            u.push(
              r >> 12 | 224,
              r >> 6 & 63 | 128,
              r & 63 | 128
            );
          } else if (r < 1114112) {
            if ((e -= 4) < 0) break;
            u.push(
              r >> 18 | 240,
              r >> 12 & 63 | 128,
              r >> 6 & 63 | 128,
              r & 63 | 128
            );
          } else
            throw new Error("Invalid code point");
        }
        return u;
      }
      function Vt(t) {
        const e = [];
        for (let r = 0; r < t.length; ++r)
          e.push(t.charCodeAt(r) & 255);
        return e;
      }
      function Ht(t, e) {
        let r, n, s;
        const u = [];
        for (let p = 0; p < t.length && !((e -= 2) < 0); ++p)
          r = t.charCodeAt(p), n = r >> 8, s = r % 256, u.push(s), u.push(n);
        return u;
      }
      function vr(t) {
        return y.toByteArray(Xt(t));
      }
      function pe(t, e, r, n) {
        let s;
        for (s = 0; s < n && !(s + r >= e.length || s >= t.length); ++s)
          e[s + r] = t[s];
        return s;
      }
      function oe(t, e) {
        return t instanceof e || t != null && t.constructor != null && t.constructor.name != null && t.constructor.name === e.name;
      }
      function Le(t) {
        return t !== t;
      }
      const Yt = function() {
        const t = "0123456789abcdef", e = new Array(256);
        for (let r = 0; r < 16; ++r) {
          const n = r * 16;
          for (let s = 0; s < 16; ++s)
            e[n + s] = t[r] + t[s];
        }
        return e;
      }();
      function ue(t) {
        return typeof BigInt > "u" ? Wt : t;
      }
      function Wt() {
        throw new Error("BigInt not supported");
      }
    })(E);
    const j = E.Buffer;
    c.Blob = E.Blob, c.BlobOptions = E.BlobOptions, c.Buffer = E.Buffer, c.File = E.File, c.FileOptions = E.FileOptions, c.INSPECT_MAX_BYTES = E.INSPECT_MAX_BYTES, c.SlowBuffer = E.SlowBuffer, c.TranscodeEncoding = E.TranscodeEncoding, c.atob = E.atob, c.btoa = E.btoa, c.constants = E.constants, c.default = j, c.isAscii = E.isAscii, c.isUtf8 = E.isUtf8, c.kMaxLength = E.kMaxLength, c.kStringMaxLength = E.kStringMaxLength, c.resolveObjectURL = E.resolveObjectURL, c.transcode = E.transcode;
  }(Ae)), Ae;
}
var me = { exports: {} }, Ur;
function xn() {
  return Ur || (Ur = 1, typeof Object.create == "function" ? me.exports = function(E, f) {
    f && (E.super_ = f, E.prototype = Object.create(f.prototype, {
      constructor: {
        value: E,
        enumerable: !1,
        writable: !0,
        configurable: !0
      }
    }));
  } : me.exports = function(E, f) {
    if (f) {
      E.super_ = f;
      var a = function() {
      };
      a.prototype = f.prototype, E.prototype = new a(), E.prototype.constructor = E;
    }
  }), me.exports;
}
var de = { exports: {} }, Be, _r;
function we() {
  if (_r) return Be;
  _r = 1;
  const c = "2.0.0", E = 256, f = Number.MAX_SAFE_INTEGER || /* istanbul ignore next */
  9007199254740991, a = 16, h = E - 6;
  return Be = {
    MAX_LENGTH: E,
    MAX_SAFE_COMPONENT_LENGTH: a,
    MAX_SAFE_BUILD_LENGTH: h,
    MAX_SAFE_INTEGER: f,
    RELEASE_TYPES: [
      "major",
      "premajor",
      "minor",
      "preminor",
      "patch",
      "prepatch",
      "prerelease"
    ],
    SEMVER_SPEC_VERSION: c,
    FLAG_INCLUDE_PRERELEASE: 1,
    FLAG_LOOSE: 2
  }, Be;
}
var Se, qr;
function Re() {
  return qr || (qr = 1, Se = typeof Ee == "object" && Ee.env && Ee.env.NODE_DEBUG && /\bsemver\b/i.test(Ee.env.NODE_DEBUG) ? (...E) => console.error("SEMVER", ...E) : () => {
  }), Se;
}
var Dr;
function he() {
  return Dr || (Dr = 1, function(c, E) {
    const {
      MAX_SAFE_COMPONENT_LENGTH: f,
      MAX_SAFE_BUILD_LENGTH: a,
      MAX_LENGTH: h
    } = we(), $ = Re();
    E = c.exports = {};
    const d = E.re = [], g = E.safeRe = [], l = E.src = [], L = E.safeSrc = [], i = E.t = {};
    let m = 0;
    const w = "[a-zA-Z0-9-]", S = [
      ["\\s", 1],
      ["\\d", h],
      [w, a]
    ], U = (D) => {
      for (const [j, T] of S)
        D = D.split(`${j}*`).join(`${j}{0,${T}}`).split(`${j}+`).join(`${j}{1,${T}}`);
      return D;
    }, x = (D, j, T) => {
      const y = U(j), P = m++;
      $(D, P, j), i[D] = P, l[P] = j, L[P] = y, d[P] = new RegExp(j, T ? "g" : void 0), g[P] = new RegExp(y, T ? "g" : void 0);
    };
    x("NUMERICIDENTIFIER", "0|[1-9]\\d*"), x("NUMERICIDENTIFIERLOOSE", "\\d+"), x("NONNUMERICIDENTIFIER", `\\d*[a-zA-Z-]${w}*`), x("MAINVERSION", `(${l[i.NUMERICIDENTIFIER]})\\.(${l[i.NUMERICIDENTIFIER]})\\.(${l[i.NUMERICIDENTIFIER]})`), x("MAINVERSIONLOOSE", `(${l[i.NUMERICIDENTIFIERLOOSE]})\\.(${l[i.NUMERICIDENTIFIERLOOSE]})\\.(${l[i.NUMERICIDENTIFIERLOOSE]})`), x("PRERELEASEIDENTIFIER", `(?:${l[i.NUMERICIDENTIFIER]}|${l[i.NONNUMERICIDENTIFIER]})`), x("PRERELEASEIDENTIFIERLOOSE", `(?:${l[i.NUMERICIDENTIFIERLOOSE]}|${l[i.NONNUMERICIDENTIFIER]})`), x("PRERELEASE", `(?:-(${l[i.PRERELEASEIDENTIFIER]}(?:\\.${l[i.PRERELEASEIDENTIFIER]})*))`), x("PRERELEASELOOSE", `(?:-?(${l[i.PRERELEASEIDENTIFIERLOOSE]}(?:\\.${l[i.PRERELEASEIDENTIFIERLOOSE]})*))`), x("BUILDIDENTIFIER", `${w}+`), x("BUILD", `(?:\\+(${l[i.BUILDIDENTIFIER]}(?:\\.${l[i.BUILDIDENTIFIER]})*))`), x("FULLPLAIN", `v?${l[i.MAINVERSION]}${l[i.PRERELEASE]}?${l[i.BUILD]}?`), x("FULL", `^${l[i.FULLPLAIN]}$`), x("LOOSEPLAIN", `[v=\\s]*${l[i.MAINVERSIONLOOSE]}${l[i.PRERELEASELOOSE]}?${l[i.BUILD]}?`), x("LOOSE", `^${l[i.LOOSEPLAIN]}$`), x("GTLT", "((?:<|>)?=?)"), x("XRANGEIDENTIFIERLOOSE", `${l[i.NUMERICIDENTIFIERLOOSE]}|x|X|\\*`), x("XRANGEIDENTIFIER", `${l[i.NUMERICIDENTIFIER]}|x|X|\\*`), x("XRANGEPLAIN", `[v=\\s]*(${l[i.XRANGEIDENTIFIER]})(?:\\.(${l[i.XRANGEIDENTIFIER]})(?:\\.(${l[i.XRANGEIDENTIFIER]})(?:${l[i.PRERELEASE]})?${l[i.BUILD]}?)?)?`), x("XRANGEPLAINLOOSE", `[v=\\s]*(${l[i.XRANGEIDENTIFIERLOOSE]})(?:\\.(${l[i.XRANGEIDENTIFIERLOOSE]})(?:\\.(${l[i.XRANGEIDENTIFIERLOOSE]})(?:${l[i.PRERELEASELOOSE]})?${l[i.BUILD]}?)?)?`), x("XRANGE", `^${l[i.GTLT]}\\s*${l[i.XRANGEPLAIN]}$`), x("XRANGELOOSE", `^${l[i.GTLT]}\\s*${l[i.XRANGEPLAINLOOSE]}$`), x("COERCEPLAIN", `(^|[^\\d])(\\d{1,${f}})(?:\\.(\\d{1,${f}}))?(?:\\.(\\d{1,${f}}))?`), x("COERCE", `${l[i.COERCEPLAIN]}(?:$|[^\\d])`), x("COERCEFULL", l[i.COERCEPLAIN] + `(?:${l[i.PRERELEASE]})?(?:${l[i.BUILD]})?(?:$|[^\\d])`), x("COERCERTL", l[i.COERCE], !0), x("COERCERTLFULL", l[i.COERCEFULL], !0), x("LONETILDE", "(?:~>?)"), x("TILDETRIM", `(\\s*)${l[i.LONETILDE]}\\s+`, !0), E.tildeTrimReplace = "$1~", x("TILDE", `^${l[i.LONETILDE]}${l[i.XRANGEPLAIN]}$`), x("TILDELOOSE", `^${l[i.LONETILDE]}${l[i.XRANGEPLAINLOOSE]}$`), x("LONECARET", "(?:\\^)"), x("CARETTRIM", `(\\s*)${l[i.LONECARET]}\\s+`, !0), E.caretTrimReplace = "$1^", x("CARET", `^${l[i.LONECARET]}${l[i.XRANGEPLAIN]}$`), x("CARETLOOSE", `^${l[i.LONECARET]}${l[i.XRANGEPLAINLOOSE]}$`), x("COMPARATORLOOSE", `^${l[i.GTLT]}\\s*(${l[i.LOOSEPLAIN]})$|^$`), x("COMPARATOR", `^${l[i.GTLT]}\\s*(${l[i.FULLPLAIN]})$|^$`), x("COMPARATORTRIM", `(\\s*)${l[i.GTLT]}\\s*(${l[i.LOOSEPLAIN]}|${l[i.XRANGEPLAIN]})`, !0), E.comparatorTrimReplace = "$1$2$3", x("HYPHENRANGE", `^\\s*(${l[i.XRANGEPLAIN]})\\s+-\\s+(${l[i.XRANGEPLAIN]})\\s*$`), x("HYPHENRANGELOOSE", `^\\s*(${l[i.XRANGEPLAINLOOSE]})\\s+-\\s+(${l[i.XRANGEPLAINLOOSE]})\\s*$`), x("STAR", "(<|>)?=?\\s*\\*"), x("GTE0", "^\\s*>=\\s*0\\.0\\.0\\s*$"), x("GTE0PRE", "^\\s*>=\\s*0\\.0\\.0-0\\s*$");
  }(de, de.exports)), de.exports;
}
var Te, br;
function dr() {
  if (br) return Te;
  br = 1;
  const c = Object.freeze({ loose: !0 }), E = Object.freeze({});
  return Te = (a) => a ? typeof a != "object" ? c : a : E, Te;
}
var Ne, Gr;
function St() {
  if (Gr) return Ne;
  Gr = 1;
  const c = /^[0-9]+$/, E = (a, h) => {
    const $ = c.test(a), d = c.test(h);
    return $ && d && (a = +a, h = +h), a === h ? 0 : $ && !d ? -1 : d && !$ ? 1 : a < h ? -1 : 1;
  };
  return Ne = {
    compareIdentifiers: E,
    rcompareIdentifiers: (a, h) => E(h, a)
  }, Ne;
}
var Fe, Mr;
function re() {
  if (Mr) return Fe;
  Mr = 1;
  const c = Re(), { MAX_LENGTH: E, MAX_SAFE_INTEGER: f } = we(), { safeRe: a, safeSrc: h, t: $ } = he(), d = dr(), { compareIdentifiers: g } = St();
  class l {
    constructor(i, m) {
      if (m = d(m), i instanceof l) {
        if (i.loose === !!m.loose && i.includePrerelease === !!m.includePrerelease)
          return i;
        i = i.version;
      } else if (typeof i != "string")
        throw new TypeError(`Invalid version. Must be a string. Got type "${typeof i}".`);
      if (i.length > E)
        throw new TypeError(
          `version is longer than ${E} characters`
        );
      c("SemVer", i, m), this.options = m, this.loose = !!m.loose, this.includePrerelease = !!m.includePrerelease;
      const w = i.trim().match(m.loose ? a[$.LOOSE] : a[$.FULL]);
      if (!w)
        throw new TypeError(`Invalid Version: ${i}`);
      if (this.raw = i, this.major = +w[1], this.minor = +w[2], this.patch = +w[3], this.major > f || this.major < 0)
        throw new TypeError("Invalid major version");
      if (this.minor > f || this.minor < 0)
        throw new TypeError("Invalid minor version");
      if (this.patch > f || this.patch < 0)
        throw new TypeError("Invalid patch version");
      w[4] ? this.prerelease = w[4].split(".").map((S) => {
        if (/^[0-9]+$/.test(S)) {
          const U = +S;
          if (U >= 0 && U < f)
            return U;
        }
        return S;
      }) : this.prerelease = [], this.build = w[5] ? w[5].split(".") : [], this.format();
    }
    format() {
      return this.version = `${this.major}.${this.minor}.${this.patch}`, this.prerelease.length && (this.version += `-${this.prerelease.join(".")}`), this.version;
    }
    toString() {
      return this.version;
    }
    compare(i) {
      if (c("SemVer.compare", this.version, this.options, i), !(i instanceof l)) {
        if (typeof i == "string" && i === this.version)
          return 0;
        i = new l(i, this.options);
      }
      return i.version === this.version ? 0 : this.compareMain(i) || this.comparePre(i);
    }
    compareMain(i) {
      return i instanceof l || (i = new l(i, this.options)), g(this.major, i.major) || g(this.minor, i.minor) || g(this.patch, i.patch);
    }
    comparePre(i) {
      if (i instanceof l || (i = new l(i, this.options)), this.prerelease.length && !i.prerelease.length)
        return -1;
      if (!this.prerelease.length && i.prerelease.length)
        return 1;
      if (!this.prerelease.length && !i.prerelease.length)
        return 0;
      let m = 0;
      do {
        const w = this.prerelease[m], S = i.prerelease[m];
        if (c("prerelease compare", m, w, S), w === void 0 && S === void 0)
          return 0;
        if (S === void 0)
          return 1;
        if (w === void 0)
          return -1;
        if (w === S)
          continue;
        return g(w, S);
      } while (++m);
    }
    compareBuild(i) {
      i instanceof l || (i = new l(i, this.options));
      let m = 0;
      do {
        const w = this.build[m], S = i.build[m];
        if (c("build compare", m, w, S), w === void 0 && S === void 0)
          return 0;
        if (S === void 0)
          return 1;
        if (w === void 0)
          return -1;
        if (w === S)
          continue;
        return g(w, S);
      } while (++m);
    }
    // preminor will bump the version up to the next minor release, and immediately
    // down to pre-release. premajor and prepatch work the same way.
    inc(i, m, w) {
      if (i.startsWith("pre")) {
        if (!m && w === !1)
          throw new Error("invalid increment argument: identifier is empty");
        if (m) {
          const S = new RegExp(`^${this.options.loose ? h[$.PRERELEASELOOSE] : h[$.PRERELEASE]}$`), U = `-${m}`.match(S);
          if (!U || U[1] !== m)
            throw new Error(`invalid identifier: ${m}`);
        }
      }
      switch (i) {
        case "premajor":
          this.prerelease.length = 0, this.patch = 0, this.minor = 0, this.major++, this.inc("pre", m, w);
          break;
        case "preminor":
          this.prerelease.length = 0, this.patch = 0, this.minor++, this.inc("pre", m, w);
          break;
        case "prepatch":
          this.prerelease.length = 0, this.inc("patch", m, w), this.inc("pre", m, w);
          break;
        // If the input is a non-prerelease version, this acts the same as
        // prepatch.
        case "prerelease":
          this.prerelease.length === 0 && this.inc("patch", m, w), this.inc("pre", m, w);
          break;
        case "release":
          if (this.prerelease.length === 0)
            throw new Error(`version ${this.raw} is not a prerelease`);
          this.prerelease.length = 0;
          break;
        case "major":
          (this.minor !== 0 || this.patch !== 0 || this.prerelease.length === 0) && this.major++, this.minor = 0, this.patch = 0, this.prerelease = [];
          break;
        case "minor":
          (this.patch !== 0 || this.prerelease.length === 0) && this.minor++, this.patch = 0, this.prerelease = [];
          break;
        case "patch":
          this.prerelease.length === 0 && this.patch++, this.prerelease = [];
          break;
        // This probably shouldn't be used publicly.
        // 1.0.0 'pre' would become 1.0.0-0 which is the wrong direction.
        case "pre": {
          const S = Number(w) ? 1 : 0;
          if (this.prerelease.length === 0)
            this.prerelease = [S];
          else {
            let U = this.prerelease.length;
            for (; --U >= 0; )
              typeof this.prerelease[U] == "number" && (this.prerelease[U]++, U = -2);
            if (U === -1) {
              if (m === this.prerelease.join(".") && w === !1)
                throw new Error("invalid increment argument: identifier already exists");
              this.prerelease.push(S);
            }
          }
          if (m) {
            let U = [m, S];
            w === !1 && (U = [m]), g(this.prerelease[0], m) === 0 ? isNaN(this.prerelease[1]) && (this.prerelease = U) : this.prerelease = U;
          }
          break;
        }
        default:
          throw new Error(`invalid increment argument: ${i}`);
      }
      return this.raw = this.format(), this.build.length && (this.raw += `+${this.build.join(".")}`), this;
    }
  }
  return Fe = l, Fe;
}
var Oe, jr;
function le() {
  if (jr) return Oe;
  jr = 1;
  const c = re();
  return Oe = (f, a, h = !1) => {
    if (f instanceof c)
      return f;
    try {
      return new c(f, a);
    } catch ($) {
      if (!h)
        return null;
      throw $;
    }
  }, Oe;
}
var Ce, kr;
function zt() {
  if (kr) return Ce;
  kr = 1;
  const c = le();
  return Ce = (f, a) => {
    const h = c(f, a);
    return h ? h.version : null;
  }, Ce;
}
var ve, Xr;
function Jt() {
  if (Xr) return ve;
  Xr = 1;
  const c = le();
  return ve = (f, a) => {
    const h = c(f.trim().replace(/^[=v]+/, ""), a);
    return h ? h.version : null;
  }, ve;
}
var Pe, Vr;
function Kt() {
  if (Vr) return Pe;
  Vr = 1;
  const c = re();
  return Pe = (f, a, h, $, d) => {
    typeof h == "string" && (d = $, $ = h, h = void 0);
    try {
      return new c(
        f instanceof c ? f.version : f,
        h
      ).inc(a, $, d).version;
    } catch {
      return null;
    }
  }, Pe;
}
var Ue, Hr;
function Zt() {
  if (Hr) return Ue;
  Hr = 1;
  const c = le();
  return Ue = (f, a) => {
    const h = c(f, null, !0), $ = c(a, null, !0), d = h.compare($);
    if (d === 0)
      return null;
    const g = d > 0, l = g ? h : $, L = g ? $ : h, i = !!l.prerelease.length;
    if (!!L.prerelease.length && !i) {
      if (!L.patch && !L.minor)
        return "major";
      if (L.compareMain(l) === 0)
        return L.minor && !L.patch ? "minor" : "patch";
    }
    const w = i ? "pre" : "";
    return h.major !== $.major ? w + "major" : h.minor !== $.minor ? w + "minor" : h.patch !== $.patch ? w + "patch" : "prerelease";
  }, Ue;
}
var _e, Yr;
function Qt() {
  if (Yr) return _e;
  Yr = 1;
  const c = re();
  return _e = (f, a) => new c(f, a).major, _e;
}
var qe, Wr;
function en() {
  if (Wr) return qe;
  Wr = 1;
  const c = re();
  return qe = (f, a) => new c(f, a).minor, qe;
}
var De, zr;
function rn() {
  if (zr) return De;
  zr = 1;
  const c = re();
  return De = (f, a) => new c(f, a).patch, De;
}
var be, Jr;
function tn() {
  if (Jr) return be;
  Jr = 1;
  const c = le();
  return be = (f, a) => {
    const h = c(f, a);
    return h && h.prerelease.length ? h.prerelease : null;
  }, be;
}
var Ge, Kr;
function ie() {
  if (Kr) return Ge;
  Kr = 1;
  const c = re();
  return Ge = (f, a, h) => new c(f, h).compare(new c(a, h)), Ge;
}
var Me, Zr;
function nn() {
  if (Zr) return Me;
  Zr = 1;
  const c = ie();
  return Me = (f, a, h) => c(a, f, h), Me;
}
var je, Qr;
function sn() {
  if (Qr) return je;
  Qr = 1;
  const c = ie();
  return je = (f, a) => c(f, a, !0), je;
}
var ke, et;
function wr() {
  if (et) return ke;
  et = 1;
  const c = re();
  return ke = (f, a, h) => {
    const $ = new c(f, h), d = new c(a, h);
    return $.compare(d) || $.compareBuild(d);
  }, ke;
}
var Xe, rt;
function on() {
  if (rt) return Xe;
  rt = 1;
  const c = wr();
  return Xe = (f, a) => f.sort((h, $) => c(h, $, a)), Xe;
}
var Ve, tt;
function un() {
  if (tt) return Ve;
  tt = 1;
  const c = wr();
  return Ve = (f, a) => f.sort((h, $) => c($, h, a)), Ve;
}
var He, nt;
function Ie() {
  if (nt) return He;
  nt = 1;
  const c = ie();
  return He = (f, a, h) => c(f, a, h) > 0, He;
}
var Ye, it;
function Rr() {
  if (it) return Ye;
  it = 1;
  const c = ie();
  return Ye = (f, a, h) => c(f, a, h) < 0, Ye;
}
var We, st;
function Tt() {
  if (st) return We;
  st = 1;
  const c = ie();
  return We = (f, a, h) => c(f, a, h) === 0, We;
}
var ze, ot;
function Nt() {
  if (ot) return ze;
  ot = 1;
  const c = ie();
  return ze = (f, a, h) => c(f, a, h) !== 0, ze;
}
var Je, ut;
function Ir() {
  if (ut) return Je;
  ut = 1;
  const c = ie();
  return Je = (f, a, h) => c(f, a, h) >= 0, Je;
}
var Ke, at;
function yr() {
  if (at) return Ke;
  at = 1;
  const c = ie();
  return Ke = (f, a, h) => c(f, a, h) <= 0, Ke;
}
var Ze, ct;
function Ft() {
  if (ct) return Ze;
  ct = 1;
  const c = Tt(), E = Nt(), f = Ie(), a = Ir(), h = Rr(), $ = yr();
  return Ze = (g, l, L, i) => {
    switch (l) {
      case "===":
        return typeof g == "object" && (g = g.version), typeof L == "object" && (L = L.version), g === L;
      case "!==":
        return typeof g == "object" && (g = g.version), typeof L == "object" && (L = L.version), g !== L;
      case "":
      case "=":
      case "==":
        return c(g, L, i);
      case "!=":
        return E(g, L, i);
      case ">":
        return f(g, L, i);
      case ">=":
        return a(g, L, i);
      case "<":
        return h(g, L, i);
      case "<=":
        return $(g, L, i);
      default:
        throw new TypeError(`Invalid operator: ${l}`);
    }
  }, Ze;
}
var Qe, lt;
function an() {
  if (lt) return Qe;
  lt = 1;
  const c = re(), E = le(), { safeRe: f, t: a } = he();
  return Qe = ($, d) => {
    if ($ instanceof c)
      return $;
    if (typeof $ == "number" && ($ = String($)), typeof $ != "string")
      return null;
    d = d || {};
    let g = null;
    if (!d.rtl)
      g = $.match(d.includePrerelease ? f[a.COERCEFULL] : f[a.COERCE]);
    else {
      const S = d.includePrerelease ? f[a.COERCERTLFULL] : f[a.COERCERTL];
      let U;
      for (; (U = S.exec($)) && (!g || g.index + g[0].length !== $.length); )
        (!g || U.index + U[0].length !== g.index + g[0].length) && (g = U), S.lastIndex = U.index + U[1].length + U[2].length;
      S.lastIndex = -1;
    }
    if (g === null)
      return null;
    const l = g[2], L = g[3] || "0", i = g[4] || "0", m = d.includePrerelease && g[5] ? `-${g[5]}` : "", w = d.includePrerelease && g[6] ? `+${g[6]}` : "";
    return E(`${l}.${L}.${i}${m}${w}`, d);
  }, Qe;
}
var er, ft;
function cn() {
  if (ft) return er;
  ft = 1;
  class c {
    constructor() {
      this.max = 1e3, this.map = /* @__PURE__ */ new Map();
    }
    get(f) {
      const a = this.map.get(f);
      if (a !== void 0)
        return this.map.delete(f), this.map.set(f, a), a;
    }
    delete(f) {
      return this.map.delete(f);
    }
    set(f, a) {
      if (!this.delete(f) && a !== void 0) {
        if (this.map.size >= this.max) {
          const $ = this.map.keys().next().value;
          this.delete($);
        }
        this.map.set(f, a);
      }
      return this;
    }
  }
  return er = c, er;
}
var rr, ht;
function se() {
  if (ht) return rr;
  ht = 1;
  const c = /\s+/g;
  class E {
    constructor(R, F) {
      if (F = h(F), R instanceof E)
        return R.loose === !!F.loose && R.includePrerelease === !!F.includePrerelease ? R : new E(R.raw, F);
      if (R instanceof $)
        return this.raw = R.value, this.set = [[R]], this.formatted = void 0, this;
      if (this.options = F, this.loose = !!F.loose, this.includePrerelease = !!F.includePrerelease, this.raw = R.trim().replace(c, " "), this.set = this.raw.split("||").map((N) => this.parseRange(N.trim())).filter((N) => N.length), !this.set.length)
        throw new TypeError(`Invalid SemVer Range: ${this.raw}`);
      if (this.set.length > 1) {
        const N = this.set[0];
        if (this.set = this.set.filter((v) => !x(v[0])), this.set.length === 0)
          this.set = [N];
        else if (this.set.length > 1) {
          for (const v of this.set)
            if (v.length === 1 && D(v[0])) {
              this.set = [v];
              break;
            }
        }
      }
      this.formatted = void 0;
    }
    get range() {
      if (this.formatted === void 0) {
        this.formatted = "";
        for (let R = 0; R < this.set.length; R++) {
          R > 0 && (this.formatted += "||");
          const F = this.set[R];
          for (let N = 0; N < F.length; N++)
            N > 0 && (this.formatted += " "), this.formatted += F[N].toString().trim();
        }
      }
      return this.formatted;
    }
    format() {
      return this.range;
    }
    toString() {
      return this.range;
    }
    parseRange(R) {
      const N = ((this.options.includePrerelease && S) | (this.options.loose && U)) + ":" + R, v = a.get(N);
      if (v)
        return v;
      const O = this.options.loose, _ = O ? l[L.HYPHENRANGELOOSE] : l[L.HYPHENRANGE];
      R = R.replace(_, o(this.options.includePrerelease)), d("hyphen replace", R), R = R.replace(l[L.COMPARATORTRIM], i), d("comparator trim", R), R = R.replace(l[L.TILDETRIM], m), d("tilde trim", R), R = R.replace(l[L.CARETTRIM], w), d("caret trim", R);
      let M = R.split(" ").map((W) => T(W, this.options)).join(" ").split(/\s+/).map((W) => K(W, this.options));
      O && (M = M.filter((W) => (d("loose invalid filter", W, this.options), !!W.match(l[L.COMPARATORLOOSE])))), d("range list", M);
      const q = /* @__PURE__ */ new Map(), X = M.map((W) => new $(W, this.options));
      for (const W of X) {
        if (x(W))
          return [W];
        q.set(W.value, W);
      }
      q.size > 1 && q.has("") && q.delete("");
      const Q = [...q.values()];
      return a.set(N, Q), Q;
    }
    intersects(R, F) {
      if (!(R instanceof E))
        throw new TypeError("a Range is required");
      return this.set.some((N) => j(N, F) && R.set.some((v) => j(v, F) && N.every((O) => v.every((_) => O.intersects(_, F)))));
    }
    // if ANY of the sets match ALL of its comparators, then pass
    test(R) {
      if (!R)
        return !1;
      if (typeof R == "string")
        try {
          R = new g(R, this.options);
        } catch {
          return !1;
        }
      for (let F = 0; F < this.set.length; F++)
        if (Z(this.set[F], R, this.options))
          return !0;
      return !1;
    }
  }
  rr = E;
  const f = cn(), a = new f(), h = dr(), $ = ye(), d = Re(), g = re(), {
    safeRe: l,
    t: L,
    comparatorTrimReplace: i,
    tildeTrimReplace: m,
    caretTrimReplace: w
  } = he(), { FLAG_INCLUDE_PRERELEASE: S, FLAG_LOOSE: U } = we(), x = (A) => A.value === "<0.0.0-0", D = (A) => A.value === "", j = (A, R) => {
    let F = !0;
    const N = A.slice();
    let v = N.pop();
    for (; F && N.length; )
      F = N.every((O) => v.intersects(O, R)), v = N.pop();
    return F;
  }, T = (A, R) => (d("comp", A, R), A = C(A, R), d("caret", A), A = P(A, R), d("tildes", A), A = I(A, R), d("xrange", A), A = k(A, R), d("stars", A), A), y = (A) => !A || A.toLowerCase() === "x" || A === "*", P = (A, R) => A.trim().split(/\s+/).map((F) => b(F, R)).join(" "), b = (A, R) => {
    const F = R.loose ? l[L.TILDELOOSE] : l[L.TILDE];
    return A.replace(F, (N, v, O, _, M) => {
      d("tilde", A, N, v, O, _, M);
      let q;
      return y(v) ? q = "" : y(O) ? q = `>=${v}.0.0 <${+v + 1}.0.0-0` : y(_) ? q = `>=${v}.${O}.0 <${v}.${+O + 1}.0-0` : M ? (d("replaceTilde pr", M), q = `>=${v}.${O}.${_}-${M} <${v}.${+O + 1}.0-0`) : q = `>=${v}.${O}.${_} <${v}.${+O + 1}.0-0`, d("tilde return", q), q;
    });
  }, C = (A, R) => A.trim().split(/\s+/).map((F) => B(F, R)).join(" "), B = (A, R) => {
    d("caret", A, R);
    const F = R.loose ? l[L.CARETLOOSE] : l[L.CARET], N = R.includePrerelease ? "-0" : "";
    return A.replace(F, (v, O, _, M, q) => {
      d("caret", A, v, O, _, M, q);
      let X;
      return y(O) ? X = "" : y(_) ? X = `>=${O}.0.0${N} <${+O + 1}.0.0-0` : y(M) ? O === "0" ? X = `>=${O}.${_}.0${N} <${O}.${+_ + 1}.0-0` : X = `>=${O}.${_}.0${N} <${+O + 1}.0.0-0` : q ? (d("replaceCaret pr", q), O === "0" ? _ === "0" ? X = `>=${O}.${_}.${M}-${q} <${O}.${_}.${+M + 1}-0` : X = `>=${O}.${_}.${M}-${q} <${O}.${+_ + 1}.0-0` : X = `>=${O}.${_}.${M}-${q} <${+O + 1}.0.0-0`) : (d("no pr"), O === "0" ? _ === "0" ? X = `>=${O}.${_}.${M}${N} <${O}.${_}.${+M + 1}-0` : X = `>=${O}.${_}.${M}${N} <${O}.${+_ + 1}.0-0` : X = `>=${O}.${_}.${M} <${+O + 1}.0.0-0`), d("caret return", X), X;
    });
  }, I = (A, R) => (d("replaceXRanges", A, R), A.split(/\s+/).map((F) => H(F, R)).join(" ")), H = (A, R) => {
    A = A.trim();
    const F = R.loose ? l[L.XRANGELOOSE] : l[L.XRANGE];
    return A.replace(F, (N, v, O, _, M, q) => {
      d("xRange", A, N, v, O, _, M, q);
      const X = y(O), Q = X || y(_), W = Q || y(M), ne = W;
      return v === "=" && ne && (v = ""), q = R.includePrerelease ? "-0" : "", X ? v === ">" || v === "<" ? N = "<0.0.0-0" : N = "*" : v && ne ? (Q && (_ = 0), M = 0, v === ">" ? (v = ">=", Q ? (O = +O + 1, _ = 0, M = 0) : (_ = +_ + 1, M = 0)) : v === "<=" && (v = "<", Q ? O = +O + 1 : _ = +_ + 1), v === "<" && (q = "-0"), N = `${v + O}.${_}.${M}${q}`) : Q ? N = `>=${O}.0.0${q} <${+O + 1}.0.0-0` : W && (N = `>=${O}.${_}.0${q} <${O}.${+_ + 1}.0-0`), d("xRange return", N), N;
    });
  }, k = (A, R) => (d("replaceStars", A, R), A.trim().replace(l[L.STAR], "")), K = (A, R) => (d("replaceGTE0", A, R), A.trim().replace(l[R.includePrerelease ? L.GTE0PRE : L.GTE0], "")), o = (A) => (R, F, N, v, O, _, M, q, X, Q, W, ne) => (y(N) ? F = "" : y(v) ? F = `>=${N}.0.0${A ? "-0" : ""}` : y(O) ? F = `>=${N}.${v}.0${A ? "-0" : ""}` : _ ? F = `>=${F}` : F = `>=${F}${A ? "-0" : ""}`, y(X) ? q = "" : y(Q) ? q = `<${+X + 1}.0.0-0` : y(W) ? q = `<${X}.${+Q + 1}.0-0` : ne ? q = `<=${X}.${Q}.${W}-${ne}` : A ? q = `<${X}.${Q}.${+W + 1}-0` : q = `<=${q}`, `${F} ${q}`.trim()), Z = (A, R, F) => {
    for (let N = 0; N < A.length; N++)
      if (!A[N].test(R))
        return !1;
    if (R.prerelease.length && !F.includePrerelease) {
      for (let N = 0; N < A.length; N++)
        if (d(A[N].semver), A[N].semver !== $.ANY && A[N].semver.prerelease.length > 0) {
          const v = A[N].semver;
          if (v.major === R.major && v.minor === R.minor && v.patch === R.patch)
            return !0;
        }
      return !1;
    }
    return !0;
  };
  return rr;
}
var tr, pt;
function ye() {
  if (pt) return tr;
  pt = 1;
  const c = Symbol("SemVer ANY");
  class E {
    static get ANY() {
      return c;
    }
    constructor(i, m) {
      if (m = f(m), i instanceof E) {
        if (i.loose === !!m.loose)
          return i;
        i = i.value;
      }
      i = i.trim().split(/\s+/).join(" "), d("comparator", i, m), this.options = m, this.loose = !!m.loose, this.parse(i), this.semver === c ? this.value = "" : this.value = this.operator + this.semver.version, d("comp", this);
    }
    parse(i) {
      const m = this.options.loose ? a[h.COMPARATORLOOSE] : a[h.COMPARATOR], w = i.match(m);
      if (!w)
        throw new TypeError(`Invalid comparator: ${i}`);
      this.operator = w[1] !== void 0 ? w[1] : "", this.operator === "=" && (this.operator = ""), w[2] ? this.semver = new g(w[2], this.options.loose) : this.semver = c;
    }
    toString() {
      return this.value;
    }
    test(i) {
      if (d("Comparator.test", i, this.options.loose), this.semver === c || i === c)
        return !0;
      if (typeof i == "string")
        try {
          i = new g(i, this.options);
        } catch {
          return !1;
        }
      return $(i, this.operator, this.semver, this.options);
    }
    intersects(i, m) {
      if (!(i instanceof E))
        throw new TypeError("a Comparator is required");
      return this.operator === "" ? this.value === "" ? !0 : new l(i.value, m).test(this.value) : i.operator === "" ? i.value === "" ? !0 : new l(this.value, m).test(i.semver) : (m = f(m), m.includePrerelease && (this.value === "<0.0.0-0" || i.value === "<0.0.0-0") || !m.includePrerelease && (this.value.startsWith("<0.0.0") || i.value.startsWith("<0.0.0")) ? !1 : !!(this.operator.startsWith(">") && i.operator.startsWith(">") || this.operator.startsWith("<") && i.operator.startsWith("<") || this.semver.version === i.semver.version && this.operator.includes("=") && i.operator.includes("=") || $(this.semver, "<", i.semver, m) && this.operator.startsWith(">") && i.operator.startsWith("<") || $(this.semver, ">", i.semver, m) && this.operator.startsWith("<") && i.operator.startsWith(">")));
    }
  }
  tr = E;
  const f = dr(), { safeRe: a, t: h } = he(), $ = Ft(), d = Re(), g = re(), l = se();
  return tr;
}
var nr, Et;
function ge() {
  if (Et) return nr;
  Et = 1;
  const c = se();
  return nr = (f, a, h) => {
    try {
      a = new c(a, h);
    } catch {
      return !1;
    }
    return a.test(f);
  }, nr;
}
var ir, mt;
function ln() {
  if (mt) return ir;
  mt = 1;
  const c = se();
  return ir = (f, a) => new c(f, a).set.map((h) => h.map(($) => $.value).join(" ").trim().split(" ")), ir;
}
var sr, dt;
function fn() {
  if (dt) return sr;
  dt = 1;
  const c = re(), E = se();
  return sr = (a, h, $) => {
    let d = null, g = null, l = null;
    try {
      l = new E(h, $);
    } catch {
      return null;
    }
    return a.forEach((L) => {
      l.test(L) && (!d || g.compare(L) === -1) && (d = L, g = new c(d, $));
    }), d;
  }, sr;
}
var or, wt;
function hn() {
  if (wt) return or;
  wt = 1;
  const c = re(), E = se();
  return or = (a, h, $) => {
    let d = null, g = null, l = null;
    try {
      l = new E(h, $);
    } catch {
      return null;
    }
    return a.forEach((L) => {
      l.test(L) && (!d || g.compare(L) === 1) && (d = L, g = new c(d, $));
    }), d;
  }, or;
}
var ur, Rt;
function pn() {
  if (Rt) return ur;
  Rt = 1;
  const c = re(), E = se(), f = Ie();
  return ur = (h, $) => {
    h = new E(h, $);
    let d = new c("0.0.0");
    if (h.test(d) || (d = new c("0.0.0-0"), h.test(d)))
      return d;
    d = null;
    for (let g = 0; g < h.set.length; ++g) {
      const l = h.set[g];
      let L = null;
      l.forEach((i) => {
        const m = new c(i.semver.version);
        switch (i.operator) {
          case ">":
            m.prerelease.length === 0 ? m.patch++ : m.prerelease.push(0), m.raw = m.format();
          /* fallthrough */
          case "":
          case ">=":
            (!L || f(m, L)) && (L = m);
            break;
          case "<":
          case "<=":
            break;
          /* istanbul ignore next */
          default:
            throw new Error(`Unexpected operation: ${i.operator}`);
        }
      }), L && (!d || f(d, L)) && (d = L);
    }
    return d && h.test(d) ? d : null;
  }, ur;
}
var ar, It;
function En() {
  if (It) return ar;
  It = 1;
  const c = se();
  return ar = (f, a) => {
    try {
      return new c(f, a).range || "*";
    } catch {
      return null;
    }
  }, ar;
}
var cr, yt;
function gr() {
  if (yt) return cr;
  yt = 1;
  const c = re(), E = ye(), { ANY: f } = E, a = se(), h = ge(), $ = Ie(), d = Rr(), g = yr(), l = Ir();
  return cr = (i, m, w, S) => {
    i = new c(i, S), m = new a(m, S);
    let U, x, D, j, T;
    switch (w) {
      case ">":
        U = $, x = g, D = d, j = ">", T = ">=";
        break;
      case "<":
        U = d, x = l, D = $, j = "<", T = "<=";
        break;
      default:
        throw new TypeError('Must provide a hilo val of "<" or ">"');
    }
    if (h(i, m, S))
      return !1;
    for (let y = 0; y < m.set.length; ++y) {
      const P = m.set[y];
      let b = null, C = null;
      if (P.forEach((B) => {
        B.semver === f && (B = new E(">=0.0.0")), b = b || B, C = C || B, U(B.semver, b.semver, S) ? b = B : D(B.semver, C.semver, S) && (C = B);
      }), b.operator === j || b.operator === T || (!C.operator || C.operator === j) && x(i, C.semver))
        return !1;
      if (C.operator === T && D(i, C.semver))
        return !1;
    }
    return !0;
  }, cr;
}
var lr, gt;
function mn() {
  if (gt) return lr;
  gt = 1;
  const c = gr();
  return lr = (f, a, h) => c(f, a, ">", h), lr;
}
var fr, $t;
function dn() {
  if ($t) return fr;
  $t = 1;
  const c = gr();
  return fr = (f, a, h) => c(f, a, "<", h), fr;
}
var hr, xt;
function wn() {
  if (xt) return hr;
  xt = 1;
  const c = se();
  return hr = (f, a, h) => (f = new c(f, h), a = new c(a, h), f.intersects(a, h)), hr;
}
var pr, Lt;
function Rn() {
  if (Lt) return pr;
  Lt = 1;
  const c = ge(), E = ie();
  return pr = (f, a, h) => {
    const $ = [];
    let d = null, g = null;
    const l = f.sort((w, S) => E(w, S, h));
    for (const w of l)
      c(w, a, h) ? (g = w, d || (d = w)) : (g && $.push([d, g]), g = null, d = null);
    d && $.push([d, null]);
    const L = [];
    for (const [w, S] of $)
      w === S ? L.push(w) : !S && w === l[0] ? L.push("*") : S ? w === l[0] ? L.push(`<=${S}`) : L.push(`${w} - ${S}`) : L.push(`>=${w}`);
    const i = L.join(" || "), m = typeof a.raw == "string" ? a.raw : String(a);
    return i.length < m.length ? i : a;
  }, pr;
}
var Er, At;
function In() {
  if (At) return Er;
  At = 1;
  const c = se(), E = ye(), { ANY: f } = E, a = ge(), h = ie(), $ = (m, w, S = {}) => {
    if (m === w)
      return !0;
    m = new c(m, S), w = new c(w, S);
    let U = !1;
    e: for (const x of m.set) {
      for (const D of w.set) {
        const j = l(x, D, S);
        if (U = U || j !== null, j)
          continue e;
      }
      if (U)
        return !1;
    }
    return !0;
  }, d = [new E(">=0.0.0-0")], g = [new E(">=0.0.0")], l = (m, w, S) => {
    if (m === w)
      return !0;
    if (m.length === 1 && m[0].semver === f) {
      if (w.length === 1 && w[0].semver === f)
        return !0;
      S.includePrerelease ? m = d : m = g;
    }
    if (w.length === 1 && w[0].semver === f) {
      if (S.includePrerelease)
        return !0;
      w = g;
    }
    const U = /* @__PURE__ */ new Set();
    let x, D;
    for (const I of m)
      I.operator === ">" || I.operator === ">=" ? x = L(x, I, S) : I.operator === "<" || I.operator === "<=" ? D = i(D, I, S) : U.add(I.semver);
    if (U.size > 1)
      return null;
    let j;
    if (x && D) {
      if (j = h(x.semver, D.semver, S), j > 0)
        return null;
      if (j === 0 && (x.operator !== ">=" || D.operator !== "<="))
        return null;
    }
    for (const I of U) {
      if (x && !a(I, String(x), S) || D && !a(I, String(D), S))
        return null;
      for (const H of w)
        if (!a(I, String(H), S))
          return !1;
      return !0;
    }
    let T, y, P, b, C = D && !S.includePrerelease && D.semver.prerelease.length ? D.semver : !1, B = x && !S.includePrerelease && x.semver.prerelease.length ? x.semver : !1;
    C && C.prerelease.length === 1 && D.operator === "<" && C.prerelease[0] === 0 && (C = !1);
    for (const I of w) {
      if (b = b || I.operator === ">" || I.operator === ">=", P = P || I.operator === "<" || I.operator === "<=", x) {
        if (B && I.semver.prerelease && I.semver.prerelease.length && I.semver.major === B.major && I.semver.minor === B.minor && I.semver.patch === B.patch && (B = !1), I.operator === ">" || I.operator === ">=") {
          if (T = L(x, I, S), T === I && T !== x)
            return !1;
        } else if (x.operator === ">=" && !a(x.semver, String(I), S))
          return !1;
      }
      if (D) {
        if (C && I.semver.prerelease && I.semver.prerelease.length && I.semver.major === C.major && I.semver.minor === C.minor && I.semver.patch === C.patch && (C = !1), I.operator === "<" || I.operator === "<=") {
          if (y = i(D, I, S), y === I && y !== D)
            return !1;
        } else if (D.operator === "<=" && !a(D.semver, String(I), S))
          return !1;
      }
      if (!I.operator && (D || x) && j !== 0)
        return !1;
    }
    return !(x && P && !D && j !== 0 || D && b && !x && j !== 0 || B || C);
  }, L = (m, w, S) => {
    if (!m)
      return w;
    const U = h(m.semver, w.semver, S);
    return U > 0 ? m : U < 0 || w.operator === ">" && m.operator === ">=" ? w : m;
  }, i = (m, w, S) => {
    if (!m)
      return w;
    const U = h(m.semver, w.semver, S);
    return U < 0 ? m : U > 0 || w.operator === "<" && m.operator === "<=" ? w : m;
  };
  return Er = $, Er;
}
var mr, Bt;
function Ln() {
  if (Bt) return mr;
  Bt = 1;
  const c = he(), E = we(), f = re(), a = St(), h = le(), $ = zt(), d = Jt(), g = Kt(), l = Zt(), L = Qt(), i = en(), m = rn(), w = tn(), S = ie(), U = nn(), x = sn(), D = wr(), j = on(), T = un(), y = Ie(), P = Rr(), b = Tt(), C = Nt(), B = Ir(), I = yr(), H = Ft(), k = an(), K = ye(), o = se(), Z = ge(), A = ln(), R = fn(), F = hn(), N = pn(), v = En(), O = gr(), _ = mn(), M = dn(), q = wn(), X = Rn(), Q = In();
  return mr = {
    parse: h,
    valid: $,
    clean: d,
    inc: g,
    diff: l,
    major: L,
    minor: i,
    patch: m,
    prerelease: w,
    compare: S,
    rcompare: U,
    compareLoose: x,
    compareBuild: D,
    sort: j,
    rsort: T,
    gt: y,
    lt: P,
    eq: b,
    neq: C,
    gte: B,
    lte: I,
    cmp: H,
    coerce: k,
    Comparator: K,
    Range: o,
    satisfies: Z,
    toComparators: A,
    maxSatisfying: R,
    minSatisfying: F,
    minVersion: N,
    validRange: v,
    outside: O,
    gtr: _,
    ltr: M,
    intersects: q,
    simplifyRange: X,
    subset: Q,
    SemVer: f,
    re: c.re,
    src: c.src,
    tokens: c.t,
    SEMVER_SPEC_VERSION: E.SEMVER_SPEC_VERSION,
    RELEASE_TYPES: E.RELEASE_TYPES,
    compareIdentifiers: a.compareIdentifiers,
    rcompareIdentifiers: a.rcompareIdentifiers
  }, mr;
}
export {
  xn as a,
  Ln as b,
  $n as r
};
//# sourceMappingURL=index-a-G6xH7c.js.map
