updates 16.3.2 → 16.3.4

package/dist/index.js

@@ -1,24 +1,24 @@
 #!/usr/bin/env node
 import Gr from "url";
-import vs from "fs";
+import ws from "fs";
 import Ur from "path";
-import sn, { argv as As, env as Me, stdout as Rs, exit as Rn, cwd as bs } from "node:process";
-import { dirname as Mr, resolve as rt, basename as st, join as on } from "node:path";
-import { readFileSync as bn, truncateSync as Ss, writeFileSync as _s, lstatSync as Sn, accessSync as Os } from "node:fs";
-import Ts from "node:os";
+import rn, { argv as vs, env as Pe, stdout as As, exit as Rn, cwd as Rs } from "node:process";
+import { dirname as sn, resolve as rt, basename as st, join as on } from "node:path";
+import { readFileSync as bn, truncateSync as bs, writeFileSync as Ss, lstatSync as Sn, accessSync as _s } from "node:fs";
+import Os from "node:os";
 import _n from "node:tty";
-import { execFileSync as xs } from "node:child_process";
-function Is({ onlyFirst: t = !1 } = {}) {
+import { execFileSync as Ts } from "node:child_process";
+function xs({ onlyFirst: t = !1 } = {}) {
   const e = [
     "[\\u001B\\u009B][[\\]()#;?]*(?:(?:(?:(?:;[-a-zA-Z\\d\\/#&.:=?%@~_]+)*|[a-zA-Z\\d]+(?:;[-a-zA-Z\\d\\/#&.:=?%@~_]*)*)?\\u0007)",
     "(?:(?:\\d{1,4}(?:;\\d{0,4})*)?[\\dA-PR-TZcf-ntqry=><~]))"
   ].join("|");
   return new RegExp(e, t ? void 0 : "g");
 }
-function Ve(t) {
+function Xe(t) {
   return t && t.__esModule && Object.prototype.hasOwnProperty.call(t, "default") ? t.default : t;
 }
-function Cs(t, e) {
+function Is(t, e) {
   var n = t;
   e.slice(0, -1).forEach(function(i) {
     n = n[i] || {};
@@ -32,7 +32,7 @@ function On(t) {
 function Tn(t, e) {
   return e === "constructor" && typeof t[e] == "function" || e === "__proto__";
 }
-var Br = function(t, e) {
+var Mr = function(t, e) {
   e || (e = {});
   var n = {
     bools: {},
@@ -124,25 +124,25 @@ var Br = function(t, e) {
     }
   }
   return Object.keys(s).forEach(function(b) {
-    Cs(o, b.split(".")) || (l(o, b.split("."), s[b]), (r[b] || []).forEach(function(L) {
+    Is(o, b.split(".")) || (l(o, b.split("."), s[b]), (r[b] || []).forEach(function(L) {
       l(o, L.split("."), s[b]);
     }));
   }), e["--"] ? o["--"] = c.slice() : c.forEach(function(b) {
     o._.push(b);
   }), o;
 };
-const Ls = /* @__PURE__ */ Ve(Br);
-function Ns(t) {
+const Cs = /* @__PURE__ */ Xe(Mr);
+function Ls(t) {
   return Buffer.from(t, "base64").toString("utf8");
 }
-function Ds(t) {
+function Ns(t) {
   return Buffer.from(t, "utf8").toString("base64");
 }
-var Ps = {
-  decodeBase64: Ns,
-  encodeBase64: Ds
+var Ds = {
+  decodeBase64: Ls,
+  encodeBase64: Ns
 }, be = {}, we = {}, xn;
-function Hs() {
+function Ps() {
   if (xn) return we;
   xn = 1, we.parse = we.decode = r, we.stringify = we.encode = e, we.safe = s, we.unsafe = o;
   var t = typeof process < "u" && process.platform === "win32" ? `\r
@@ -248,7 +248,7 @@ function Hs() {
   return we;
 }
 var _t, In;
-function Fs() {
+function Hs() {
   if (In) return _t;
   In = 1;
   var t = 1, e = 2;
@@ -288,10 +288,10 @@ function Fs() {
   }, _t;
 }
 var Cn;
-function js() {
+function Fs() {
   if (Cn) return be;
   Cn = 1;
-  var t = vs, e = Hs(), n = Ur, r = Fs(), i = be.parse = function(o) {
+  var t = ws, e = Ps(), n = Ur, r = Hs(), i = be.parse = function(o) {
     return /^\s*{/.test(o) ? JSON.parse(r(o)) : e.parse(o);
   }, s = be.file = function() {
     var o = [].slice.call(arguments).filter(function(u) {
@@ -339,7 +339,7 @@ function js() {
 }
 var Ot = { exports: {} };
 var Ln;
-function Gs() {
+function js() {
   if (Ln) return Ot.exports;
   Ln = 1;
   function t(s) {
@@ -397,14 +397,14 @@ function Gs() {
   return Ot.exports;
 }
 var Tt, Nn;
-function zr() {
+function Br() {
   if (Nn) return Tt;
   Nn = 1;
-  var t = js(), e = Ur.join, n = Gs(), r = "/etc", i = process.platform === "win32", s = i ? process.env.USERPROFILE : process.env.HOME;
+  var t = Fs(), e = Ur.join, n = js(), r = "/etc", i = process.platform === "win32", s = i ? process.env.USERPROFILE : process.env.HOME;
   return Tt = function(o, a, l, u) {
     if (typeof o != "string")
       throw new Error("rc(name): name *must* be string");
-    l || (l = Br(process.argv.slice(2))), a = (typeof a == "string" ? t.json(a) : a) || {}, u = u || t.parse;
+    l || (l = Mr(process.argv.slice(2))), a = (typeof a == "string" ? t.json(a) : a) || {}, u = u || t.parse;
     var c = t.env(o + "_"), p = [a], g = [];
     function f(S) {
       if (!(g.indexOf(S) >= 0)) {
@@ -427,40 +427,40 @@ function zr() {
     ]));
   }, Tt;
 }
-var xt = Gr, kr = Ps, Us = kr.decodeBase64, Ms = kr.encodeBase64, Dn = ":_authToken", Pn = ":_auth", Hn = ":username", Fn = ":_password", Bs = function() {
+var xt = Gr, zr = Ds, Gs = zr.decodeBase64, Us = zr.encodeBase64, Dn = ":_authToken", Pn = ":_auth", Hn = ":username", Fn = ":_password", Ms = function() {
   var t, e;
-  return arguments.length >= 2 ? (t = arguments[0], e = arguments[1]) : typeof arguments[0] == "string" ? t = arguments[0] : e = arguments[0], e = e || {}, e.npmrc = e.npmrc || zr()("npm", { registry: "https://registry.npmjs.org/" }, {
+  return arguments.length >= 2 ? (t = arguments[0], e = arguments[1]) : typeof arguments[0] == "string" ? t = arguments[0] : e = arguments[0], e = e || {}, e.npmrc = e.npmrc || Br()("npm", { registry: "https://registry.npmjs.org/" }, {
     config: process.env.npm_config_userconfig || process.env.NPM_CONFIG_USERCONFIG
-  }), t = t || e.npmrc.registry, Wr(t, e) || zs(e.npmrc);
+  }), t = t || e.npmrc.registry, kr(t, e) || Bs(e.npmrc);
 };
-function Wr(t, e) {
+function kr(t, e) {
   for (var n = xt.parse(t, !1, !0), r; r !== "/" && n.pathname !== r; ) {
     r = n.pathname || "/";
-    var i = "//" + n.host + r.replace(/\/$/, ""), s = Ws(i, e.npmrc);
+    var i = "//" + n.host + r.replace(/\/$/, ""), s = ks(i, e.npmrc);
     if (s)
       return s;
     if (!e.recursive)
-      return /\/$/.test(t) ? void 0 : Wr(xt.resolve(t, "."), e);
-    n.pathname = xt.resolve(ks(r), "..") || "/";
+      return /\/$/.test(t) ? void 0 : kr(xt.resolve(t, "."), e);
+    n.pathname = xt.resolve(zs(r), "..") || "/";
   }
 }
-function zs(t) {
+function Bs(t) {
   if (t._auth) {
     var e = dt(t._auth);
     return { token: e, type: "Basic" };
   }
 }
-function ks(t) {
+function zs(t) {
   return t[t.length - 1] === "/" ? t : t + "/";
 }
-function Ws(t, e) {
+function ks(t, e) {
   var n = Vs(e[t + Dn] || e[t + "/" + Dn]);
   if (n)
     return n;
-  var r = e[t + Hn] || e[t + "/" + Hn], i = e[t + Fn] || e[t + "/" + Fn], s = Xs(r, i);
+  var r = e[t + Hn] || e[t + "/" + Hn], i = e[t + Fn] || e[t + "/" + Fn], s = Ws(r, i);
   if (s)
     return s;
-  var o = qs(e[t + Pn] || e[t + "/" + Pn]);
+  var o = Xs(e[t + Pn] || e[t + "/" + Pn]);
   if (o)
     return o;
 }
@@ -475,9 +475,9 @@ function Vs(t) {
     return { token: e, type: "Bearer" };
   }
 }
-function Xs(t, e) {
+function Ws(t, e) {
   if (!(!t || !e)) {
-    var n = Us(dt(e)), r = Ms(t + ":" + n);
+    var n = Gs(dt(e)), r = Us(t + ":" + n);
     return {
       token: r,
       type: "Basic",
@@ -486,27 +486,27 @@ function Xs(t, e) {
     };
   }
 }
-function qs(t) {
+function Xs(t) {
   if (t) {
     var e = dt(t);
     return { token: e, type: "Basic" };
   }
 }
-const Ks = /* @__PURE__ */ Ve(Bs);
-var Ys = zr();
-const Zs = /* @__PURE__ */ Ve(Ys);
+const qs = /* @__PURE__ */ Xe(Ms);
+var Ks = Br();
+const Ys = /* @__PURE__ */ Xe(Ks);
 var Yt = { exports: {} };
-const Qs = "2.0.0", Js = 256, ei = Number.MAX_SAFE_INTEGER || /* istanbul ignore next */
-9007199254740991, ti = 16;
+const Zs = "2.0.0", Qs = 256, Js = Number.MAX_SAFE_INTEGER || /* istanbul ignore next */
+9007199254740991, ei = 16;
 var gt = {
-  SEMVER_SPEC_VERSION: Qs,
-  MAX_LENGTH: Js,
-  MAX_SAFE_INTEGER: ei,
-  MAX_SAFE_COMPONENT_LENGTH: ti
+  SEMVER_SPEC_VERSION: Zs,
+  MAX_LENGTH: Qs,
+  MAX_SAFE_INTEGER: Js,
+  MAX_SAFE_COMPONENT_LENGTH: ei
 };
-const ni = typeof process == "object" && process.env && process.env.NODE_DEBUG && /\bsemver\b/i.test(process.env.NODE_DEBUG) ? (...t) => console.error("SEMVER", ...t) : () => {
+const ti = typeof process == "object" && process.env && process.env.NODE_DEBUG && /\bsemver\b/i.test(process.env.NODE_DEBUG) ? (...t) => console.error("SEMVER", ...t) : () => {
 };
-var mt = ni;
+var mt = ti;
 (function(t, e) {
   const { MAX_SAFE_COMPONENT_LENGTH: n } = gt, r = mt;
   e = t.exports = {};
@@ -518,21 +518,21 @@ var mt = ni;
   };
   l("NUMERICIDENTIFIER", "0|[1-9]\\d*"), l("NUMERICIDENTIFIERLOOSE", "[0-9]+"), l("NONNUMERICIDENTIFIER", "\\d*[a-zA-Z-][a-zA-Z0-9-]*"), l("MAINVERSION", `(${s[o.NUMERICIDENTIFIER]})\\.(${s[o.NUMERICIDENTIFIER]})\\.(${s[o.NUMERICIDENTIFIER]})`), l("MAINVERSIONLOOSE", `(${s[o.NUMERICIDENTIFIERLOOSE]})\\.(${s[o.NUMERICIDENTIFIERLOOSE]})\\.(${s[o.NUMERICIDENTIFIERLOOSE]})`), l("PRERELEASEIDENTIFIER", `(?:${s[o.NUMERICIDENTIFIER]}|${s[o.NONNUMERICIDENTIFIER]})`), l("PRERELEASEIDENTIFIERLOOSE", `(?:${s[o.NUMERICIDENTIFIERLOOSE]}|${s[o.NONNUMERICIDENTIFIER]})`), l("PRERELEASE", `(?:-(${s[o.PRERELEASEIDENTIFIER]}(?:\\.${s[o.PRERELEASEIDENTIFIER]})*))`), l("PRERELEASELOOSE", `(?:-?(${s[o.PRERELEASEIDENTIFIERLOOSE]}(?:\\.${s[o.PRERELEASEIDENTIFIERLOOSE]})*))`), l("BUILDIDENTIFIER", "[0-9A-Za-z-]+"), l("BUILD", `(?:\\+(${s[o.BUILDIDENTIFIER]}(?:\\.${s[o.BUILDIDENTIFIER]})*))`), l("FULLPLAIN", `v?${s[o.MAINVERSION]}${s[o.PRERELEASE]}?${s[o.BUILD]}?`), l("FULL", `^${s[o.FULLPLAIN]}$`), l("LOOSEPLAIN", `[v=\\s]*${s[o.MAINVERSIONLOOSE]}${s[o.PRERELEASELOOSE]}?${s[o.BUILD]}?`), l("LOOSE", `^${s[o.LOOSEPLAIN]}$`), l("GTLT", "((?:<|>)?=?)"), l("XRANGEIDENTIFIERLOOSE", `${s[o.NUMERICIDENTIFIERLOOSE]}|x|X|\\*`), l("XRANGEIDENTIFIER", `${s[o.NUMERICIDENTIFIER]}|x|X|\\*`), l("XRANGEPLAIN", `[v=\\s]*(${s[o.XRANGEIDENTIFIER]})(?:\\.(${s[o.XRANGEIDENTIFIER]})(?:\\.(${s[o.XRANGEIDENTIFIER]})(?:${s[o.PRERELEASE]})?${s[o.BUILD]}?)?)?`), l("XRANGEPLAINLOOSE", `[v=\\s]*(${s[o.XRANGEIDENTIFIERLOOSE]})(?:\\.(${s[o.XRANGEIDENTIFIERLOOSE]})(?:\\.(${s[o.XRANGEIDENTIFIERLOOSE]})(?:${s[o.PRERELEASELOOSE]})?${s[o.BUILD]}?)?)?`), l("XRANGE", `^${s[o.GTLT]}\\s*${s[o.XRANGEPLAIN]}$`), l("XRANGELOOSE", `^${s[o.GTLT]}\\s*${s[o.XRANGEPLAINLOOSE]}$`), l("COERCE", `(^|[^\\d])(\\d{1,${n}})(?:\\.(\\d{1,${n}}))?(?:\\.(\\d{1,${n}}))?(?:$|[^\\d])`), l("COERCERTL", s[o.COERCE], !0), l("LONETILDE", "(?:~>?)"), l("TILDETRIM", `(\\s*)${s[o.LONETILDE]}\\s+`, !0), e.tildeTrimReplace = "$1~", l("TILDE", `^${s[o.LONETILDE]}${s[o.XRANGEPLAIN]}$`), l("TILDELOOSE", `^${s[o.LONETILDE]}${s[o.XRANGEPLAINLOOSE]}$`), l("LONECARET", "(?:\\^)"), l("CARETTRIM", `(\\s*)${s[o.LONECARET]}\\s+`, !0), e.caretTrimReplace = "$1^", l("CARET", `^${s[o.LONECARET]}${s[o.XRANGEPLAIN]}$`), l("CARETLOOSE", `^${s[o.LONECARET]}${s[o.XRANGEPLAINLOOSE]}$`), l("COMPARATORLOOSE", `^${s[o.GTLT]}\\s*(${s[o.LOOSEPLAIN]})$|^$`), l("COMPARATOR", `^${s[o.GTLT]}\\s*(${s[o.FULLPLAIN]})$|^$`), l("COMPARATORTRIM", `(\\s*)${s[o.GTLT]}\\s*(${s[o.LOOSEPLAIN]}|${s[o.XRANGEPLAIN]})`, !0), e.comparatorTrimReplace = "$1$2$3", l("HYPHENRANGE", `^\\s*(${s[o.XRANGEPLAIN]})\\s+-\\s+(${s[o.XRANGEPLAIN]})\\s*$`), l("HYPHENRANGELOOSE", `^\\s*(${s[o.XRANGEPLAINLOOSE]})\\s+-\\s+(${s[o.XRANGEPLAINLOOSE]})\\s*$`), l("STAR", "(<|>)?=?\\s*\\*"), l("GTE0", "^\\s*>=\\s*0\\.0\\.0\\s*$"), l("GTE0PRE", "^\\s*>=\\s*0\\.0\\.0-0\\s*$");
 })(Yt, Yt.exports);
-var Fe = Yt.exports;
-const ri = ["includePrerelease", "loose", "rtl"], si = (t) => t ? typeof t != "object" ? { loose: !0 } : ri.filter((e) => t[e]).reduce((e, n) => (e[n] = !0, e), {}) : {};
-var $t = si;
+var Ge = Yt.exports;
+const ni = ["includePrerelease", "loose", "rtl"], ri = (t) => t ? typeof t != "object" ? { loose: !0 } : ni.filter((e) => t[e]).reduce((e, n) => (e[n] = !0, e), {}) : {};
+var $t = ri;
 const jn = /^[0-9]+$/, Vr = (t, e) => {
   const n = jn.test(t), r = jn.test(e);
   return n && r && (t = +t, e = +e), t === e ? 0 : n && !r ? -1 : r && !n ? 1 : t < e ? -1 : 1;
-}, ii = (t, e) => Vr(e, t);
-var Xr = {
+}, si = (t, e) => Vr(e, t);
+var Wr = {
   compareIdentifiers: Vr,
-  rcompareIdentifiers: ii
+  rcompareIdentifiers: si
 };
-const Qe = mt, { MAX_LENGTH: Gn, MAX_SAFE_INTEGER: Je } = gt, { re: Un, t: Mn } = Fe, oi = $t, { compareIdentifiers: Ie } = Xr;
-let ai = class fe {
+const Je = mt, { MAX_LENGTH: Gn, MAX_SAFE_INTEGER: et } = gt, { re: Un, t: Mn } = Ge, ii = $t, { compareIdentifiers: Ie } = Wr;
+let oi = class fe {
   constructor(e, n) {
-    if (n = oi(n), e instanceof fe) {
+    if (n = ii(n), e instanceof fe) {
       if (e.loose === !!n.loose && e.includePrerelease === !!n.includePrerelease)
         return e;
       e = e.version;
@@ -542,20 +542,20 @@ let ai = class fe {
       throw new TypeError(
         `version is longer than ${Gn} characters`
       );
-    Qe("SemVer", e, n), this.options = n, this.loose = !!n.loose, this.includePrerelease = !!n.includePrerelease;
+    Je("SemVer", e, n), this.options = n, this.loose = !!n.loose, this.includePrerelease = !!n.includePrerelease;
     const r = e.trim().match(n.loose ? Un[Mn.LOOSE] : Un[Mn.FULL]);
     if (!r)
       throw new TypeError(`Invalid Version: ${e}`);
-    if (this.raw = e, this.major = +r[1], this.minor = +r[2], this.patch = +r[3], this.major > Je || this.major < 0)
+    if (this.raw = e, this.major = +r[1], this.minor = +r[2], this.patch = +r[3], this.major > et || this.major < 0)
       throw new TypeError("Invalid major version");
-    if (this.minor > Je || this.minor < 0)
+    if (this.minor > et || this.minor < 0)
       throw new TypeError("Invalid minor version");
-    if (this.patch > Je || this.patch < 0)
+    if (this.patch > et || this.patch < 0)
       throw new TypeError("Invalid patch version");
     r[4] ? this.prerelease = r[4].split(".").map((i) => {
       if (/^[0-9]+$/.test(i)) {
         const s = +i;
-        if (s >= 0 && s < Je)
+        if (s >= 0 && s < et)
           return s;
       }
       return i;
@@ -568,7 +568,7 @@ let ai = class fe {
     return this.version;
   }
   compare(e) {
-    if (Qe("SemVer.compare", this.version, this.options, e), !(e instanceof fe)) {
+    if (Je("SemVer.compare", this.version, this.options, e), !(e instanceof fe)) {
       if (typeof e == "string" && e === this.version)
         return 0;
       e = new fe(e, this.options);
@@ -588,7 +588,7 @@ let ai = class fe {
     let n = 0;
     do {
       const r = this.prerelease[n], i = e.prerelease[n];
-      if (Qe("prerelease compare", n, r, i), r === void 0 && i === void 0)
+      if (Je("prerelease compare", n, r, i), r === void 0 && i === void 0)
         return 0;
       if (i === void 0)
         return 1;
@@ -604,7 +604,7 @@ let ai = class fe {
     let n = 0;
     do {
       const r = this.build[n], i = e.build[n];
-      if (Qe("prerelease compare", n, r, i), r === void 0 && i === void 0)
+      if (Je("prerelease compare", n, r, i), r === void 0 && i === void 0)
         return 0;
       if (i === void 0)
         return 1;
@@ -657,11 +657,11 @@ let ai = class fe {
     return this.format(), this.raw = this.version, this;
   }
 };
-var se = ai;
-const { MAX_LENGTH: li } = gt, { re: Bn, t: zn } = Fe, kn = se, ci = $t, ui = (t, e) => {
-  if (e = ci(e), t instanceof kn)
+var se = oi;
+const { MAX_LENGTH: ai } = gt, { re: Bn, t: zn } = Ge, kn = se, li = $t, ci = (t, e) => {
+  if (e = li(e), t instanceof kn)
     return t;
-  if (typeof t != "string" || t.length > li || !(e.loose ? Bn[zn.LOOSE] : Bn[zn.FULL]).test(t))
+  if (typeof t != "string" || t.length > ai || !(e.loose ? Bn[zn.LOOSE] : Bn[zn.FULL]).test(t))
     return null;
   try {
     return new kn(t, e);
@@ -669,35 +669,35 @@ const { MAX_LENGTH: li } = gt, { re: Bn, t: zn } = Fe, kn = se, ci = $t, ui = (t
     return null;
   }
 };
-var je = ui;
-const fi = je, hi = (t, e) => {
-  const n = fi(t, e);
+var Ue = ci;
+const ui = Ue, fi = (t, e) => {
+  const n = ui(t, e);
   return n ? n.version : null;
 };
-var pi = hi;
-const di = je, gi = (t, e) => {
-  const n = di(t.trim().replace(/^[=v]+/, ""), e);
+var hi = fi;
+const pi = Ue, di = (t, e) => {
+  const n = pi(t.trim().replace(/^[=v]+/, ""), e);
   return n ? n.version : null;
 };
-var mi = gi;
-const Wn = se, $i = (t, e, n, r) => {
+var gi = di;
+const Vn = se, mi = (t, e, n, r) => {
   typeof n == "string" && (r = n, n = void 0);
   try {
-    return new Wn(
-      t instanceof Wn ? t.version : t,
+    return new Vn(
+      t instanceof Vn ? t.version : t,
       n
     ).inc(e, r).version;
   } catch {
     return null;
   }
 };
-var Ei = $i;
-const Vn = se, yi = (t, e, n) => new Vn(t, n).compare(new Vn(e, n));
-var ce = yi;
-const wi = ce, vi = (t, e, n) => wi(t, e, n) === 0;
-var an = vi;
-const Xn = je, Ai = an, Ri = (t, e) => {
-  if (Ai(t, e))
+var $i = mi;
+const Wn = se, Ei = (t, e, n) => new Wn(t, n).compare(new Wn(e, n));
+var ce = Ei;
+const yi = ce, wi = (t, e, n) => yi(t, e, n) === 0;
+var an = wi;
+const Xn = Ue, vi = an, Ai = (t, e) => {
+  if (vi(t, e))
     return null;
   {
     const n = Xn(t), r = Xn(e), i = n.prerelease.length || r.prerelease.length, s = i ? "pre" : "", o = i ? "prerelease" : "";
@@ -707,42 +707,42 @@ const Xn = je, Ai = an, Ri = (t, e) => {
     return o;
   }
 };
-var bi = Ri;
-const Si = se, _i = (t, e) => new Si(t, e).major;
-var Oi = _i;
-const Ti = se, xi = (t, e) => new Ti(t, e).minor;
-var Ii = xi;
-const Ci = se, Li = (t, e) => new Ci(t, e).patch;
-var Ni = Li;
-const Di = je, Pi = (t, e) => {
-  const n = Di(t, e);
+var Ri = Ai;
+const bi = se, Si = (t, e) => new bi(t, e).major;
+var _i = Si;
+const Oi = se, Ti = (t, e) => new Oi(t, e).minor;
+var xi = Ti;
+const Ii = se, Ci = (t, e) => new Ii(t, e).patch;
+var Li = Ci;
+const Ni = Ue, Di = (t, e) => {
+  const n = Ni(t, e);
   return n && n.prerelease.length ? n.prerelease : null;
 };
-var Hi = Pi;
-const Fi = ce, ji = (t, e, n) => Fi(e, t, n);
-var Gi = ji;
-const Ui = ce, Mi = (t, e) => Ui(t, e, !0);
-var Bi = Mi;
-const qn = se, zi = (t, e, n) => {
+var Pi = Di;
+const Hi = ce, Fi = (t, e, n) => Hi(e, t, n);
+var ji = Fi;
+const Gi = ce, Ui = (t, e) => Gi(t, e, !0);
+var Mi = Ui;
+const qn = se, Bi = (t, e, n) => {
   const r = new qn(t, n), i = new qn(e, n);
   return r.compare(i) || r.compareBuild(i);
 };
-var ln = zi;
-const ki = ln, Wi = (t, e) => t.sort((n, r) => ki(n, r, e));
-var Vi = Wi;
-const Xi = ln, qi = (t, e) => t.sort((n, r) => Xi(r, n, e));
-var Ki = qi;
-const Yi = ce, Zi = (t, e, n) => Yi(t, e, n) > 0;
-var Et = Zi;
-const Qi = ce, Ji = (t, e, n) => Qi(t, e, n) < 0;
-var cn = Ji;
-const eo = ce, to = (t, e, n) => eo(t, e, n) !== 0;
-var qr = to;
-const no = ce, ro = (t, e, n) => no(t, e, n) >= 0;
-var un = ro;
-const so = ce, io = (t, e, n) => so(t, e, n) <= 0;
-var fn = io;
-const oo = an, ao = qr, lo = Et, co = un, uo = cn, fo = fn, ho = (t, e, n, r) => {
+var ln = Bi;
+const zi = ln, ki = (t, e) => t.sort((n, r) => zi(n, r, e));
+var Vi = ki;
+const Wi = ln, Xi = (t, e) => t.sort((n, r) => Wi(r, n, e));
+var qi = Xi;
+const Ki = ce, Yi = (t, e, n) => Ki(t, e, n) > 0;
+var Et = Yi;
+const Zi = ce, Qi = (t, e, n) => Zi(t, e, n) < 0;
+var cn = Qi;
+const Ji = ce, eo = (t, e, n) => Ji(t, e, n) !== 0;
+var Xr = eo;
+const to = ce, no = (t, e, n) => to(t, e, n) >= 0;
+var un = no;
+const ro = ce, so = (t, e, n) => ro(t, e, n) <= 0;
+var fn = so;
+const io = an, oo = Xr, ao = Et, lo = un, co = cn, uo = fn, fo = (t, e, n, r) => {
   switch (e) {
     case "===":
       return typeof t == "object" && (t = t.version), typeof n == "object" && (n = n.version), t === n;
@@ -751,41 +751,41 @@ const oo = an, ao = qr, lo = Et, co = un, uo = cn, fo = fn, ho = (t, e, n, r) =>
     case "":
     case "=":
     case "==":
-      return oo(t, n, r);
+      return io(t, n, r);
     case "!=":
-      return ao(t, n, r);
+      return oo(t, n, r);
     case ">":
-      return lo(t, n, r);
+      return ao(t, n, r);
     case ">=":
-      return co(t, n, r);
+      return lo(t, n, r);
     case "<":
-      return uo(t, n, r);
+      return co(t, n, r);
     case "<=":
-      return fo(t, n, r);
+      return uo(t, n, r);
     default:
       throw new TypeError(`Invalid operator: ${e}`);
   }
 };
-var Kr = ho;
-const po = se, go = je, { re: et, t: tt } = Fe, mo = (t, e) => {
-  if (t instanceof po)
+var qr = fo;
+const ho = se, po = Ue, { re: tt, t: nt } = Ge, go = (t, e) => {
+  if (t instanceof ho)
     return t;
   if (typeof t == "number" && (t = String(t)), typeof t != "string")
     return null;
   e = e || {};
   let n = null;
   if (!e.rtl)
-    n = t.match(et[tt.COERCE]);
+    n = t.match(tt[nt.COERCE]);
   else {
     let r;
-    for (; (r = et[tt.COERCERTL].exec(t)) && (!n || n.index + n[0].length !== t.length); )
-      (!n || r.index + r[0].length !== n.index + n[0].length) && (n = r), et[tt.COERCERTL].lastIndex = r.index + r[1].length + r[2].length;
-    et[tt.COERCERTL].lastIndex = -1;
+    for (; (r = tt[nt.COERCERTL].exec(t)) && (!n || n.index + n[0].length !== t.length); )
+      (!n || r.index + r[0].length !== n.index + n[0].length) && (n = r), tt[nt.COERCERTL].lastIndex = r.index + r[1].length + r[2].length;
+    tt[nt.COERCERTL].lastIndex = -1;
   }
-  return n === null ? null : go(`${n[2]}.${n[3] || "0"}.${n[4] || "0"}`, e);
+  return n === null ? null : po(`${n[2]}.${n[3] || "0"}.${n[4] || "0"}`, e);
 };
-var $o = mo, It, Kn;
-function Eo() {
+var mo = go, It, Kn;
+function $o() {
   return Kn || (Kn = 1, It = function(t) {
     t.prototype[Symbol.iterator] = function* () {
       for (let e = this.head; e; e = e.next)
@@ -793,7 +793,7 @@ function Eo() {
     };
   }), It;
 }
-var yo = k;
+var Eo = k;
 k.Node = xe;
 k.create = k;
 function k(t) {
@@ -829,12 +829,12 @@ k.prototype.pushNode = function(t) {
 };
 k.prototype.push = function() {
   for (var t = 0, e = arguments.length; t < e; t++)
-    vo(this, arguments[t]);
+    wo(this, arguments[t]);
   return this.length;
 };
 k.prototype.unshift = function() {
   for (var t = 0, e = arguments.length; t < e; t++)
-    Ao(this, arguments[t]);
+    vo(this, arguments[t]);
   return this.length;
 };
 k.prototype.pop = function() {
@@ -949,7 +949,7 @@ k.prototype.splice = function(t, e, ...n) {
     s.push(i.value), i = this.removeNode(i);
   i === null && (i = this.tail), i !== this.head && i !== this.tail && (i = i.prev);
   for (var r = 0; r < n.length; r++)
-    i = wo(this, i, n[r]);
+    i = yo(this, i, n[r]);
   return s;
 };
 k.prototype.reverse = function() {
@@ -959,14 +959,14 @@ k.prototype.reverse = function() {
   }
   return this.head = e, this.tail = t, this;
 };
-function wo(t, e, n) {
+function yo(t, e, n) {
   var r = e === t.head ? new xe(n, null, e, t) : new xe(n, e, e.next, t);
   return r.next === null && (t.tail = r), r.prev === null && (t.head = r), t.length++, r;
 }
-function vo(t, e) {
+function wo(t, e) {
   t.tail = new xe(e, t.tail, null, t), t.head || (t.head = t.tail), t.length++;
 }
-function Ao(t, e) {
+function vo(t, e) {
   t.head = new xe(e, null, t.head, t), t.tail || (t.tail = t.head), t.length++;
 }
 function xe(t, e, n, r) {
@@ -975,39 +975,39 @@ function xe(t, e, n, r) {
   this.list = r, this.value = t, e ? (e.next = this, this.prev = e) : this.prev = null, n ? (n.prev = this, this.next = n) : this.next = null;
 }
 try {
-  Eo()(k);
+  $o()(k);
 } catch {
 }
-const Ro = yo, _e = Symbol("max"), me = Symbol("length"), Ce = Symbol("lengthCalculator"), ze = Symbol("allowStale"), Oe = Symbol("maxAge"), ge = Symbol("dispose"), Yn = Symbol("noDisposeOnSet"), te = Symbol("lruList"), ae = Symbol("cache"), Yr = Symbol("updateAgeOnGet"), Ct = () => 1;
-let bo = class {
+const Ao = Eo, _e = Symbol("max"), me = Symbol("length"), Ce = Symbol("lengthCalculator"), ke = Symbol("allowStale"), Oe = Symbol("maxAge"), ge = Symbol("dispose"), Yn = Symbol("noDisposeOnSet"), te = Symbol("lruList"), ae = Symbol("cache"), Kr = Symbol("updateAgeOnGet"), Ct = () => 1;
+let Ro = class {
   constructor(e) {
     if (typeof e == "number" && (e = { max: e }), e || (e = {}), e.max && (typeof e.max != "number" || e.max < 0))
       throw new TypeError("max must be a non-negative number");
     this[_e] = e.max || 1 / 0;
     const n = e.length || Ct;
-    if (this[Ce] = typeof n != "function" ? Ct : n, this[ze] = e.stale || !1, e.maxAge && typeof e.maxAge != "number")
+    if (this[Ce] = typeof n != "function" ? Ct : n, this[ke] = e.stale || !1, e.maxAge && typeof e.maxAge != "number")
       throw new TypeError("maxAge must be a number");
-    this[Oe] = e.maxAge || 0, this[ge] = e.dispose, this[Yn] = e.noDisposeOnSet || !1, this[Yr] = e.updateAgeOnGet || !1, this.reset();
+    this[Oe] = e.maxAge || 0, this[ge] = e.dispose, this[Yn] = e.noDisposeOnSet || !1, this[Kr] = e.updateAgeOnGet || !1, this.reset();
   }
   // resize the cache when the max changes.
   set max(e) {
     if (typeof e != "number" || e < 0)
       throw new TypeError("max must be a non-negative number");
-    this[_e] = e || 1 / 0, Ge(this);
+    this[_e] = e || 1 / 0, Me(this);
   }
   get max() {
     return this[_e];
   }
   set allowStale(e) {
-    this[ze] = !!e;
+    this[ke] = !!e;
   }
   get allowStale() {
-    return this[ze];
+    return this[ke];
   }
   set maxAge(e) {
     if (typeof e != "number")
       throw new TypeError("maxAge must be a non-negative number");
-    this[Oe] = e, Ge(this);
+    this[Oe] = e, Me(this);
   }
   get maxAge() {
     return this[Oe];
@@ -1016,7 +1016,7 @@ let bo = class {
   set lengthCalculator(e) {
     typeof e != "function" && (e = Ct), e !== this[Ce] && (this[Ce] = e, this[me] = 0, this[te].forEach((n) => {
       n.length = this[Ce](n.value, n.key), this[me] += n.length;
-    })), Ge(this);
+    })), Me(this);
   }
   get lengthCalculator() {
     return this[Ce];
@@ -1048,7 +1048,7 @@ let bo = class {
     return this[te].toArray().map((e) => e.value);
   }
   reset() {
-    this[ge] && this[te] && this[te].length && this[te].forEach((e) => this[ge](e.key, e.value)), this[ae] = /* @__PURE__ */ new Map(), this[te] = new Ro(), this[me] = 0;
+    this[ge] && this[te] && this[te].length && this[te].forEach((e) => this[ge](e.key, e.value)), this[ae] = /* @__PURE__ */ new Map(), this[te] = new Ao(), this[me] = 0;
   }
   dump() {
     return this[te].map((e) => at(this, e) ? !1 : {
@@ -1066,12 +1066,12 @@ let bo = class {
     const i = r ? Date.now() : 0, s = this[Ce](n, e);
     if (this[ae].has(e)) {
       if (s > this[_e])
-        return He(this, this[ae].get(e)), !1;
+        return je(this, this[ae].get(e)), !1;
       const l = this[ae].get(e).value;
-      return this[ge] && (this[Yn] || this[ge](e, l.value)), l.now = i, l.maxAge = r, l.value = n, this[me] += s - l.length, l.length = s, this.get(e), Ge(this), !0;
+      return this[ge] && (this[Yn] || this[ge](e, l.value)), l.now = i, l.maxAge = r, l.value = n, this[me] += s - l.length, l.length = s, this.get(e), Me(this), !0;
     }
-    const o = new So(e, n, s, i, r);
-    return o.length > this[_e] ? (this[ge] && this[ge](e, n), !1) : (this[me] += o.length, this[te].unshift(o), this[ae].set(e, this[te].head), Ge(this), !0);
+    const o = new bo(e, n, s, i, r);
+    return o.length > this[_e] ? (this[ge] && this[ge](e, n), !1) : (this[me] += o.length, this[te].unshift(o), this[ae].set(e, this[te].head), Me(this), !0);
   }
   has(e) {
     if (!this[ae].has(e)) return !1;
@@ -1086,10 +1086,10 @@ let bo = class {
   }
   pop() {
     const e = this[te].tail;
-    return e ? (He(this, e), e.value) : null;
+    return e ? (je(this, e), e.value) : null;
   }
   del(e) {
-    He(this, this[ae].get(e));
+    je(this, this[ae].get(e));
   }
   load(e) {
     this.reset();
@@ -1113,10 +1113,10 @@ const Lt = (t, e, n) => {
   if (r) {
     const i = r.value;
     if (at(t, i)) {
-      if (He(t, r), !t[ze])
+      if (je(t, r), !t[ke])
         return;
     } else
-      n && (t[Yr] && (r.value.now = Date.now()), t[te].unshiftNode(r));
+      n && (t[Kr] && (r.value.now = Date.now()), t[te].unshiftNode(r));
     return i.value;
   }
 }, at = (t, e) => {
@@ -1124,28 +1124,28 @@ const Lt = (t, e, n) => {
     return !1;
   const n = Date.now() - e.now;
   return e.maxAge ? n > e.maxAge : t[Oe] && n > t[Oe];
-}, Ge = (t) => {
+}, Me = (t) => {
   if (t[me] > t[_e])
     for (let e = t[te].tail; t[me] > t[_e] && e !== null; ) {
       const n = e.prev;
-      He(t, e), e = n;
+      je(t, e), e = n;
     }
-}, He = (t, e) => {
+}, je = (t, e) => {
   if (e) {
     const n = e.value;
     t[ge] && t[ge](n.key, n.value), t[me] -= n.length, t[ae].delete(n.key), t[te].removeNode(e);
   }
 };
-class So {
+class bo {
   constructor(e, n, r, i, s) {
     this.key = e, this.value = n, this.length = r, this.now = i, this.maxAge = s || 0;
   }
 }
 const Zn = (t, e, n, r) => {
   let i = n.value;
-  at(t, i) && (He(t, n), t[ze] || (i = void 0)), i && e.call(r, i.value, i.key, t);
+  at(t, i) && (je(t, n), t[ke] || (i = void 0)), i && e.call(r, i.value, i.key, t);
 };
-var _o = bo, Nt, Qn;
+var So = Ro, Nt, Qn;
 function ue() {
   if (Qn) return Nt;
   Qn = 1;
@@ -1184,13 +1184,13 @@ function ue() {
         return d;
       const $ = this.options.loose, R = $ ? a[l.HYPHENRANGELOOSE] : a[l.HYPHENRANGE];
       E = E.replace(R, D(this.options.includePrerelease)), s("hyphen replace", E), E = E.replace(a[l.COMPARATORTRIM], u), s("comparator trim", E), E = E.replace(a[l.TILDETRIM], c), E = E.replace(a[l.CARETTRIM], p), E = E.split(/\s+/).join(" ");
-      let x = E.split(" ").map((V) => v(V, this.options)).join(" ").split(/\s+/).map((V) => H(V, this.options));
-      $ && (x = x.filter((V) => (s("loose invalid filter", V, this.options), !!V.match(a[l.COMPARATORLOOSE])))), s("range list", x);
-      const N = /* @__PURE__ */ new Map(), F = x.map((V) => new i(V, this.options));
-      for (const V of F) {
-        if (g(V))
-          return [V];
-        N.set(V.value, V);
+      let x = E.split(" ").map((W) => v(W, this.options)).join(" ").split(/\s+/).map((W) => H(W, this.options));
+      $ && (x = x.filter((W) => (s("loose invalid filter", W, this.options), !!W.match(a[l.COMPARATORLOOSE])))), s("range list", x);
+      const N = /* @__PURE__ */ new Map(), F = x.map((W) => new i(W, this.options));
+      for (const W of F) {
+        if (g(W))
+          return [W];
+        N.set(W.value, W);
       }
       N.size > 1 && N.has("") && N.delete("");
       const X = [...N.values()];
@@ -1218,13 +1218,13 @@ function ue() {
     }
   }
   Nt = t;
-  const e = _o, n = new e({ max: 1e3 }), r = $t, i = yt(), s = mt, o = se, {
+  const e = So, n = new e({ max: 1e3 }), r = $t, i = yt(), s = mt, o = se, {
     re: a,
     t: l,
     comparatorTrimReplace: u,
     tildeTrimReplace: c,
     caretTrimReplace: p
-  } = Fe, g = (_) => _.value === "<0.0.0-0", f = (_) => _.value === "", S = (_, E) => {
+  } = Ge, g = (_) => _.value === "<0.0.0-0", f = (_) => _.value === "", S = (_, E) => {
     let T = !0;
     const h = _.slice();
     let d = h.pop();
@@ -1251,10 +1251,10 @@ function ue() {
     const T = E.loose ? a[l.XRANGELOOSE] : a[l.XRANGE];
     return _.replace(T, (h, d, $, R, x, N) => {
       s("xRange", _, h, d, $, R, x, N);
-      const F = w($), X = F || w(R), V = X || w(x), J = V;
-      return d === "=" && J && (d = ""), N = E.includePrerelease ? "-0" : "", F ? d === ">" || d === "<" ? h = "<0.0.0-0" : h = "*" : d && J ? (X && (R = 0), x = 0, d === ">" ? (d = ">=", X ? ($ = +$ + 1, R = 0, x = 0) : (R = +R + 1, x = 0)) : d === "<=" && (d = "<", X ? $ = +$ + 1 : R = +R + 1), d === "<" && (N = "-0"), h = `${d + $}.${R}.${x}${N}`) : X ? h = `>=${$}.0.0${N} <${+$ + 1}.0.0-0` : V && (h = `>=${$}.${R}.0${N} <${$}.${+R + 1}.0-0`), s("xRange return", h), h;
+      const F = w($), X = F || w(R), W = X || w(x), J = W;
+      return d === "=" && J && (d = ""), N = E.includePrerelease ? "-0" : "", F ? d === ">" || d === "<" ? h = "<0.0.0-0" : h = "*" : d && J ? (X && (R = 0), x = 0, d === ">" ? (d = ">=", X ? ($ = +$ + 1, R = 0, x = 0) : (R = +R + 1, x = 0)) : d === "<=" && (d = "<", X ? $ = +$ + 1 : R = +R + 1), d === "<" && (N = "-0"), h = `${d + $}.${R}.${x}${N}`) : X ? h = `>=${$}.0.0${N} <${+$ + 1}.0.0-0` : W && (h = `>=${$}.${R}.0${N} <${$}.${+R + 1}.0-0`), s("xRange return", h), h;
     });
-  }, P = (_, E) => (s("replaceStars", _, E), _.trim().replace(a[l.STAR], "")), H = (_, E) => (s("replaceGTE0", _, E), _.trim().replace(a[E.includePrerelease ? l.GTE0PRE : l.GTE0], "")), D = (_) => (E, T, h, d, $, R, x, N, F, X, V, J, Z) => (w(h) ? T = "" : w(d) ? T = `>=${h}.0.0${_ ? "-0" : ""}` : w($) ? T = `>=${h}.${d}.0${_ ? "-0" : ""}` : R ? T = `>=${T}` : T = `>=${T}${_ ? "-0" : ""}`, w(F) ? N = "" : w(X) ? N = `<${+F + 1}.0.0-0` : w(V) ? N = `<${F}.${+X + 1}.0-0` : J ? N = `<=${F}.${X}.${V}-${J}` : _ ? N = `<${F}.${X}.${+V + 1}-0` : N = `<=${N}`, `${T} ${N}`.trim()), m = (_, E, T) => {
+  }, P = (_, E) => (s("replaceStars", _, E), _.trim().replace(a[l.STAR], "")), H = (_, E) => (s("replaceGTE0", _, E), _.trim().replace(a[E.includePrerelease ? l.GTE0PRE : l.GTE0], "")), D = (_) => (E, T, h, d, $, R, x, N, F, X, W, J, Z) => (w(h) ? T = "" : w(d) ? T = `>=${h}.0.0${_ ? "-0" : ""}` : w($) ? T = `>=${h}.${d}.0${_ ? "-0" : ""}` : R ? T = `>=${T}` : T = `>=${T}${_ ? "-0" : ""}`, w(F) ? N = "" : w(X) ? N = `<${+F + 1}.0.0-0` : w(W) ? N = `<${F}.${+X + 1}.0-0` : J ? N = `<=${F}.${X}.${W}-${J}` : _ ? N = `<${F}.${X}.${+W + 1}-0` : N = `<=${N}`, `${T} ${N}`.trim()), m = (_, E, T) => {
     for (let h = 0; h < _.length; h++)
       if (!_[h].test(E))
         return !1;
@@ -1323,46 +1323,46 @@ function yt() {
     }
   }
   Dt = e;
-  const n = $t, { re: r, t: i } = Fe, s = Kr, o = mt, a = se, l = ue();
+  const n = $t, { re: r, t: i } = Ge, s = qr, o = mt, a = se, l = ue();
   return Dt;
 }
-const Oo = ue(), To = (t, e, n) => {
+const _o = ue(), Oo = (t, e, n) => {
   try {
-    e = new Oo(e, n);
+    e = new _o(e, n);
   } catch {
     return !1;
   }
   return e.test(t);
 };
-var wt = To;
-const xo = ue(), Io = (t, e) => new xo(t, e).set.map((n) => n.map((r) => r.value).join(" ").trim().split(" "));
-var Co = Io;
-const Lo = se, No = ue(), Do = (t, e, n) => {
+var wt = Oo;
+const To = ue(), xo = (t, e) => new To(t, e).set.map((n) => n.map((r) => r.value).join(" ").trim().split(" "));
+var Io = xo;
+const Co = se, Lo = ue(), No = (t, e, n) => {
   let r = null, i = null, s = null;
   try {
-    s = new No(e, n);
+    s = new Lo(e, n);
   } catch {
     return null;
   }
   return t.forEach((o) => {
-    s.test(o) && (!r || i.compare(o) === -1) && (r = o, i = new Lo(r, n));
+    s.test(o) && (!r || i.compare(o) === -1) && (r = o, i = new Co(r, n));
   }), r;
 };
-var Po = Do;
-const Ho = se, Fo = ue(), jo = (t, e, n) => {
+var Do = No;
+const Po = se, Ho = ue(), Fo = (t, e, n) => {
   let r = null, i = null, s = null;
   try {
-    s = new Fo(e, n);
+    s = new Ho(e, n);
   } catch {
     return null;
   }
   return t.forEach((o) => {
-    s.test(o) && (!r || i.compare(o) === 1) && (r = o, i = new Ho(r, n));
+    s.test(o) && (!r || i.compare(o) === 1) && (r = o, i = new Po(r, n));
   }), r;
 };
-var Go = jo;
-const Pt = se, Uo = ue(), er = Et, Mo = (t, e) => {
-  t = new Uo(t, e);
+var jo = Fo;
+const Pt = se, Go = ue(), er = Et, Uo = (t, e) => {
+  t = new Go(t, e);
   let n = new Pt("0.0.0");
   if (t.test(n) || (n = new Pt("0.0.0-0"), t.test(n)))
     return n;
@@ -1389,35 +1389,35 @@ const Pt = se, Uo = ue(), er = Et, Mo = (t, e) => {
   }
   return n && t.test(n) ? n : null;
 };
-var Bo = Mo;
-const zo = ue(), ko = (t, e) => {
+var Mo = Uo;
+const Bo = ue(), zo = (t, e) => {
   try {
-    return new zo(t, e).range || "*";
+    return new Bo(t, e).range || "*";
   } catch {
     return null;
   }
 };
-var Wo = ko;
-const Vo = se, Zr = yt(), { ANY: Xo } = Zr, qo = ue(), Ko = wt, tr = Et, nr = cn, Yo = fn, Zo = un, Qo = (t, e, n, r) => {
-  t = new Vo(t, r), e = new qo(e, r);
+var ko = zo;
+const Vo = se, Yr = yt(), { ANY: Wo } = Yr, Xo = ue(), qo = wt, tr = Et, nr = cn, Ko = fn, Yo = un, Zo = (t, e, n, r) => {
+  t = new Vo(t, r), e = new Xo(e, r);
   let i, s, o, a, l;
   switch (n) {
     case ">":
-      i = tr, s = Yo, o = nr, a = ">", l = ">=";
+      i = tr, s = Ko, o = nr, a = ">", l = ">=";
       break;
     case "<":
-      i = nr, s = Zo, o = tr, a = "<", l = "<=";
+      i = nr, s = Yo, o = tr, a = "<", l = "<=";
       break;
     default:
       throw new TypeError('Must provide a hilo val of "<" or ">"');
   }
-  if (Ko(t, e, r))
+  if (qo(t, e, r))
     return !1;
   for (let u = 0; u < e.set.length; ++u) {
     const c = e.set[u];
     let p = null, g = null;
     if (c.forEach((f) => {
-      f.semver === Xo && (f = new Zr(">=0.0.0")), p = p || f, g = g || f, i(f.semver, p.semver, r) ? p = f : o(f.semver, g.semver, r) && (g = f);
+      f.semver === Wo && (f = new Yr(">=0.0.0")), p = p || f, g = g || f, i(f.semver, p.semver, r) ? p = f : o(f.semver, g.semver, r) && (g = f);
     }), p.operator === a || p.operator === l || (!g.operator || g.operator === a) && s(t, g.semver))
       return !1;
     if (g.operator === l && o(t, g.semver))
@@ -1425,20 +1425,20 @@ const Vo = se, Zr = yt(), { ANY: Xo } = Zr, qo = ue(), Ko = wt, tr = Et, nr = cn
   }
   return !0;
 };
-var hn = Qo;
-const Jo = hn, ea = (t, e, n) => Jo(t, e, ">", n);
-var ta = ea;
-const na = hn, ra = (t, e, n) => na(t, e, "<", n);
-var sa = ra;
-const rr = ue(), ia = (t, e, n) => (t = new rr(t, n), e = new rr(e, n), t.intersects(e));
-var oa = ia;
-const aa = wt, la = ce;
-var ca = (t, e, n) => {
+var hn = Zo;
+const Qo = hn, Jo = (t, e, n) => Qo(t, e, ">", n);
+var ea = Jo;
+const ta = hn, na = (t, e, n) => ta(t, e, "<", n);
+var ra = na;
+const rr = ue(), sa = (t, e, n) => (t = new rr(t, n), e = new rr(e, n), t.intersects(e));
+var ia = sa;
+const oa = wt, aa = ce;
+var la = (t, e, n) => {
   const r = [];
   let i = null, s = null;
-  const o = t.sort((c, p) => la(c, p, n));
+  const o = t.sort((c, p) => aa(c, p, n));
   for (const c of o)
-    aa(c, e, n) ? (s = c, i || (i = c)) : (s && r.push([i, s]), s = null, i = null);
+    oa(c, e, n) ? (s = c, i || (i = c)) : (s && r.push([i, s]), s = null, i = null);
   i && r.push([i, null]);
   const a = [];
   for (const [c, p] of r)
@@ -1446,14 +1446,14 @@ var ca = (t, e, n) => {
   const l = a.join(" || "), u = typeof e.raw == "string" ? e.raw : String(e);
   return l.length < u.length ? l : e;
 };
-const sr = ue(), it = yt(), { ANY: Ht } = it, Ue = wt, pn = ce, ua = (t, e, n = {}) => {
+const sr = ue(), it = yt(), { ANY: Ht } = it, Be = wt, pn = ce, ca = (t, e, n = {}) => {
   if (t === e)
     return !0;
   t = new sr(t, n), e = new sr(e, n);
   let r = !1;
   e: for (const i of t.set) {
     for (const s of e.set) {
-      const o = fa(i, s, n);
+      const o = ua(i, s, n);
       if (r = r || o !== null, o)
         continue e;
     }
@@ -1461,7 +1461,7 @@ const sr = ue(), it = yt(), { ANY: Ht } = it, Ue = wt, pn = ce, ua = (t, e, n =
       return !1;
   }
   return !0;
-}, fa = (t, e, n) => {
+}, ua = (t, e, n) => {
   if (t === e)
     return !0;
   if (t.length === 1 && t[0].semver === Ht) {
@@ -1488,10 +1488,10 @@ const sr = ue(), it = yt(), { ANY: Ht } = it, Ue = wt, pn = ce, ua = (t, e, n =
       return null;
   }
   for (const f of r) {
-    if (i && !Ue(f, String(i), n) || s && !Ue(f, String(s), n))
+    if (i && !Be(f, String(i), n) || s && !Be(f, String(s), n))
       return null;
     for (const S of e)
-      if (!Ue(f, String(S), n))
+      if (!Be(f, String(S), n))
         return !1;
     return !0;
   }
@@ -1502,14 +1502,14 @@ const sr = ue(), it = yt(), { ANY: Ht } = it, Ue = wt, pn = ce, ua = (t, e, n =
       if (g && f.semver.prerelease && f.semver.prerelease.length && f.semver.major === g.major && f.semver.minor === g.minor && f.semver.patch === g.patch && (g = !1), f.operator === ">" || f.operator === ">=") {
         if (a = ir(i, f, n), a === f && a !== i)
           return !1;
-      } else if (i.operator === ">=" && !Ue(i.semver, String(f), n))
+      } else if (i.operator === ">=" && !Be(i.semver, String(f), n))
         return !1;
     }
     if (s) {
       if (p && f.semver.prerelease && f.semver.prerelease.length && f.semver.major === p.major && f.semver.minor === p.minor && f.semver.patch === p.patch && (p = !1), f.operator === "<" || f.operator === "<=") {
         if (l = or(s, f, n), l === f && l !== s)
           return !1;
-      } else if (s.operator === "<=" && !Ue(s.semver, String(f), n))
+      } else if (s.operator === "<=" && !Be(s.semver, String(f), n))
         return !1;
     }
     if (!f.operator && (s || i) && o !== 0)
@@ -1527,57 +1527,57 @@ const sr = ue(), it = yt(), { ANY: Ht } = it, Ue = wt, pn = ce, ua = (t, e, n =
   const r = pn(t.semver, e.semver, n);
   return r < 0 ? t : r > 0 || e.operator === "<" && t.operator === "<=" ? e : t;
 };
-var ha = ua;
-const Ft = Fe, pa = gt, da = se, ar = Xr, ga = je, ma = pi, $a = mi, Ea = Ei, ya = bi, wa = Oi, va = Ii, Aa = Ni, Ra = Hi, ba = ce, Sa = Gi, _a = Bi, Oa = ln, Ta = Vi, xa = Ki, Ia = Et, Ca = cn, La = an, Na = qr, Da = un, Pa = fn, Ha = Kr, Fa = $o, ja = yt(), Ga = ue(), Ua = wt, Ma = Co, Ba = Po, za = Go, ka = Bo, Wa = Wo, Va = hn, Xa = ta, qa = sa, Ka = oa, Ya = ca, Za = ha;
+var fa = ca;
+const Ft = Ge, ha = gt, pa = se, ar = Wr, da = Ue, ga = hi, ma = gi, $a = $i, Ea = Ri, ya = _i, wa = xi, va = Li, Aa = Pi, Ra = ce, ba = ji, Sa = Mi, _a = ln, Oa = Vi, Ta = qi, xa = Et, Ia = cn, Ca = an, La = Xr, Na = un, Da = fn, Pa = qr, Ha = mo, Fa = yt(), ja = ue(), Ga = wt, Ua = Io, Ma = Do, Ba = jo, za = Mo, ka = ko, Va = hn, Wa = ea, Xa = ra, qa = ia, Ka = la, Ya = fa;
 var ne = {
-  parse: ga,
-  valid: ma,
-  clean: $a,
-  inc: Ea,
-  diff: ya,
-  major: wa,
-  minor: va,
-  patch: Aa,
-  prerelease: Ra,
-  compare: ba,
-  rcompare: Sa,
-  compareLoose: _a,
-  compareBuild: Oa,
-  sort: Ta,
-  rsort: xa,
-  gt: Ia,
-  lt: Ca,
-  eq: La,
-  neq: Na,
-  gte: Da,
-  lte: Pa,
-  cmp: Ha,
-  coerce: Fa,
-  Comparator: ja,
-  Range: Ga,
-  satisfies: Ua,
-  toComparators: Ma,
-  maxSatisfying: Ba,
-  minSatisfying: za,
-  minVersion: ka,
-  validRange: Wa,
+  parse: da,
+  valid: ga,
+  clean: ma,
+  inc: $a,
+  diff: Ea,
+  major: ya,
+  minor: wa,
+  patch: va,
+  prerelease: Aa,
+  compare: Ra,
+  rcompare: ba,
+  compareLoose: Sa,
+  compareBuild: _a,
+  sort: Oa,
+  rsort: Ta,
+  gt: xa,
+  lt: Ia,
+  eq: Ca,
+  neq: La,
+  gte: Na,
+  lte: Da,
+  cmp: Pa,
+  coerce: Ha,
+  Comparator: Fa,
+  Range: ja,
+  satisfies: Ga,
+  toComparators: Ua,
+  maxSatisfying: Ma,
+  minSatisfying: Ba,
+  minVersion: za,
+  validRange: ka,
   outside: Va,
-  gtr: Xa,
-  ltr: qa,
-  intersects: Ka,
-  simplifyRange: Ya,
-  subset: Za,
-  SemVer: da,
+  gtr: Wa,
+  ltr: Xa,
+  intersects: qa,
+  simplifyRange: Ka,
+  subset: Ya,
+  SemVer: pa,
   re: Ft.re,
   src: Ft.src,
   tokens: Ft.t,
-  SEMVER_SPEC_VERSION: pa.SEMVER_SPEC_VERSION,
+  SEMVER_SPEC_VERSION: ha.SEMVER_SPEC_VERSION,
   compareIdentifiers: ar.compareIdentifiers,
   rcompareIdentifiers: ar.rcompareIdentifiers
 }, vt = {};
 Object.defineProperty(vt, "__esModule", { value: !0 });
 vt.LRUCache = void 0;
-const Le = typeof performance == "object" && performance && typeof performance.now == "function" ? performance : Date, Qr = /* @__PURE__ */ new Set(), Zt = typeof process == "object" && process ? process : {}, Jr = (t, e, n, r) => {
+const Le = typeof performance == "object" && performance && typeof performance.now == "function" ? performance : Date, Zr = /* @__PURE__ */ new Set(), Zt = typeof process == "object" && process ? process : {}, Qr = (t, e, n, r) => {
   typeof Zt.emitWarning == "function" ? Zt.emitWarning(t, e, n, r) : console.error(`[${n}] ${e}: ${t}`);
 };
 let lt = globalThis.AbortController, lr = globalThis.AbortSignal;
@@ -1606,30 +1606,30 @@ if (typeof lt > "u") {
   };
   let t = Zt.env?.LRU_CACHE_IGNORE_AC_WARNING !== "1";
   const e = () => {
-    t && (t = !1, Jr("AbortController is not defined. If using lru-cache in node 14, load an AbortController polyfill from the `node-abort-controller` package. A minimal polyfill is provided for use by LRUCache.fetch(), but it should not be relied upon in other contexts (eg, passing it to other APIs that use AbortController/AbortSignal might have undesirable effects). You may disable this with LRU_CACHE_IGNORE_AC_WARNING=1 in the env.", "NO_ABORT_CONTROLLER", "ENOTSUP", e));
+    t && (t = !1, Qr("AbortController is not defined. If using lru-cache in node 14, load an AbortController polyfill from the `node-abort-controller` package. A minimal polyfill is provided for use by LRUCache.fetch(), but it should not be relied upon in other contexts (eg, passing it to other APIs that use AbortController/AbortSignal might have undesirable effects). You may disable this with LRU_CACHE_IGNORE_AC_WARNING=1 in the env.", "NO_ABORT_CONTROLLER", "ENOTSUP", e));
   };
 }
-const Qa = (t) => !Qr.has(t), ve = (t) => t && t === Math.floor(t) && t > 0 && isFinite(t), es = (t) => ve(t) ? t <= Math.pow(2, 8) ? Uint8Array : t <= Math.pow(2, 16) ? Uint16Array : t <= Math.pow(2, 32) ? Uint32Array : t <= Number.MAX_SAFE_INTEGER ? ot : null : null;
+const Za = (t) => !Zr.has(t), ve = (t) => t && t === Math.floor(t) && t > 0 && isFinite(t), Jr = (t) => ve(t) ? t <= Math.pow(2, 8) ? Uint8Array : t <= Math.pow(2, 16) ? Uint16Array : t <= Math.pow(2, 32) ? Uint32Array : t <= Number.MAX_SAFE_INTEGER ? ot : null : null;
 class ot extends Array {
   constructor(e) {
     super(e), this.fill(0);
   }
 }
-class Pe {
+class He {
   heap;
   length;
   // private constructor
   static #n = !1;
   static create(e) {
-    const n = es(e);
+    const n = Jr(e);
     if (!n)
       return [];
-    Pe.#n = !0;
-    const r = new Pe(e, n);
-    return Pe.#n = !1, r;
+    He.#n = !0;
+    const r = new He(e, n);
+    return He.#n = !1, r;
   }
   constructor(e, n) {
-    if (!Pe.#n)
+    if (!He.#n)
       throw new TypeError("instantiate Stack using Stack.create(n)");
     this.heap = new n(e), this.length = 0;
   }
@@ -1640,7 +1640,7 @@ class Pe {
     return this.heap[--this.length];
   }
 }
-let Ja = class ts {
+let Qa = class es {
   // options that cannot be changed without disaster
   #n;
   #i;
@@ -1812,7 +1812,7 @@ let Ja = class ts {
     const { max: n = 0, ttl: r, ttlResolution: i = 1, ttlAutopurge: s, updateAgeOnGet: o, updateAgeOnHas: a, allowStale: l, dispose: u, disposeAfter: c, noDisposeOnSet: p, noUpdateTTL: g, maxSize: f = 0, maxEntrySize: S = 0, sizeCalculation: v, fetchMethod: w, memoMethod: y, noDeleteOnFetchRejection: I, noDeleteOnStaleGet: A, allowStaleOnFetchRejection: b, allowStaleOnFetchAbort: L, ignoreFetchAbort: j } = e;
     if (n !== 0 && !ve(n))
       throw new TypeError("max option must be a nonnegative integer");
-    const P = n ? es(n) : Array;
+    const P = n ? Jr(n) : Array;
     if (!P)
       throw new Error("invalid max value: " + n);
     if (this.#n = n, this.#i = f, this.maxEntrySize = S || this.#i, this.sizeCalculation = v, this.sizeCalculation) {
@@ -1825,7 +1825,7 @@ let Ja = class ts {
       throw new TypeError("memoMethod must be a function if defined");
     if (this.#C = y, w !== void 0 && typeof w != "function")
       throw new TypeError("fetchMethod must be a function if specified");
-    if (this.#I = w, this.#_ = !!w, this.#o = /* @__PURE__ */ new Map(), this.#s = new Array(n).fill(void 0), this.#e = new Array(n).fill(void 0), this.#f = new P(n), this.#p = new P(n), this.#u = 0, this.#l = 0, this.#E = Pe.create(n), this.#a = 0, this.#$ = 0, typeof u == "function" && (this.#t = u), typeof c == "function" ? (this.#m = c, this.#c = []) : (this.#m = void 0, this.#c = void 0), this.#v = !!this.#t, this.#h = !!this.#m, this.noDisposeOnSet = !!p, this.noUpdateTTL = !!g, this.noDeleteOnFetchRejection = !!I, this.allowStaleOnFetchRejection = !!b, this.allowStaleOnFetchAbort = !!L, this.ignoreFetchAbort = !!j, this.maxEntrySize !== 0) {
+    if (this.#I = w, this.#_ = !!w, this.#o = /* @__PURE__ */ new Map(), this.#s = new Array(n).fill(void 0), this.#e = new Array(n).fill(void 0), this.#f = new P(n), this.#p = new P(n), this.#u = 0, this.#l = 0, this.#E = He.create(n), this.#a = 0, this.#$ = 0, typeof u == "function" && (this.#t = u), typeof c == "function" ? (this.#m = c, this.#c = []) : (this.#m = void 0, this.#c = void 0), this.#v = !!this.#t, this.#h = !!this.#m, this.noDisposeOnSet = !!p, this.noUpdateTTL = !!g, this.noDeleteOnFetchRejection = !!I, this.allowStaleOnFetchRejection = !!b, this.allowStaleOnFetchAbort = !!L, this.ignoreFetchAbort = !!j, this.maxEntrySize !== 0) {
       if (this.#i !== 0 && !ve(this.#i))
         throw new TypeError("maxSize must be a positive integer if specified");
       if (!ve(this.maxEntrySize))
@@ -1841,7 +1841,7 @@ let Ja = class ts {
       throw new TypeError("At least one of max, maxSize, or ttl is required");
     if (!this.ttlAutopurge && !this.#n && !this.#i) {
       const H = "LRU_CACHE_UNBOUNDED";
-      Qa(H) && (Qr.add(H), Jr("TTL caching without ttlAutopurge, max, or maxSize can result in unbounded memory consumption.", "UnboundedCacheWarning", H, ts));
+      Za(H) && (Zr.add(H), Qr("TTL caching without ttlAutopurge, max, or maxSize can result in unbounded memory consumption.", "UnboundedCacheWarning", H, es));
     }
   }
   /**
@@ -2490,8 +2490,8 @@ let Ja = class ts {
     }
   }
 };
-vt.LRUCache = Ja;
-const z = (...t) => t.every((e) => e) ? t.join("") : "", Q = (t) => t ? encodeURIComponent(t) : "", ns = (t) => t.toLowerCase().replace(/^\W+|\/|\W+$/g, "").replace(/\W+/g, "-"), el = {
+vt.LRUCache = Qa;
+const z = (...t) => t.every((e) => e) ? t.join("") : "", Q = (t) => t ? encodeURIComponent(t) : "", ts = (t) => t.toLowerCase().replace(/^\W+|\/|\W+$/g, "").replace(/\W+/g, "-"), Ja = {
   sshtemplate: ({ domain: t, user: e, project: n, committish: r }) => `git@${t}:${e}/${n}.git${z("#", r)}`,
   sshurltemplate: ({ domain: t, user: e, project: n, committish: r }) => `git+ssh://git@${t}/${e}/${n}.git${z("#", r)}`,
   edittemplate: ({ domain: t, user: e, project: n, committish: r, editpath: i, path: s }) => `https://${t}/${e}/${n}${z("/", i, "/", Q(r || "HEAD"), "/", s)}`,
@@ -2504,7 +2504,7 @@ const z = (...t) => t.every((e) => e) ? t.join("") : "", Q = (t) => t ? encodeUR
   shortcuttemplate: ({ type: t, user: e, project: n, committish: r }) => `${t}:${e}/${n}${z("#", r)}`,
   pathtemplate: ({ user: t, project: e, committish: n }) => `${t}/${e}${z("#", n)}`,
   bugstemplate: ({ domain: t, user: e, project: n }) => `https://${t}/${e}/${n}/issues`,
-  hashformat: ns
+  hashformat: ts
 }, Ae = {};
 Ae.github = {
   // First two are insecure and generally shouldn't be used any more, but
@@ -2587,7 +2587,7 @@ Ae.gist = {
     }
   },
   hashformat: function(t) {
-    return t && "file-" + ns(t);
+    return t && "file-" + ts(t);
   }
 };
 Ae.sourcehut = {
@@ -2606,38 +2606,38 @@ Ae.sourcehut = {
   }
 };
 for (const [t, e] of Object.entries(Ae))
-  Ae[t] = Object.assign({}, el, e);
-var tl = Ae;
-const nl = Gr, jt = (t, e, n) => {
+  Ae[t] = Object.assign({}, Ja, e);
+var el = Ae;
+const tl = Gr, jt = (t, e, n) => {
   const r = t.indexOf(n);
   return t.lastIndexOf(e, r > -1 ? r : 1 / 0);
 }, cr = (t) => {
   try {
-    return new nl.URL(t);
+    return new tl.URL(t);
   } catch {
   }
-}, rl = (t, e) => {
+}, nl = (t, e) => {
   const n = t.indexOf(":"), r = t.slice(0, n + 1);
   if (Object.prototype.hasOwnProperty.call(e, r))
     return t;
   const i = t.indexOf("@");
   return i > -1 ? i > n ? `git+ssh://${t}` : t : t.indexOf("//") === n + 1 ? t : `${t.slice(0, n + 1)}//${t.slice(n + 1)}`;
-}, sl = (t) => {
+}, rl = (t) => {
   const e = jt(t, "@", "#"), n = jt(t, ":", "#");
   return n > e && (t = t.slice(0, n) + "/" + t.slice(n + 1)), jt(t, ":", "#") === -1 && t.indexOf("//") === -1 && (t = `git+ssh://${t}`), t;
 };
-var rs = (t, e) => {
-  const n = e ? rl(t, e) : t;
-  return cr(n) || cr(sl(n));
+var ns = (t, e) => {
+  const n = e ? nl(t, e) : t;
+  return cr(n) || cr(rl(n));
 };
-const il = rs, ol = (t) => {
+const sl = ns, il = (t) => {
   const e = t.indexOf("#"), n = t.indexOf("/"), r = t.indexOf("/", n + 1), i = t.indexOf(":"), s = /\s/.exec(t), o = t.indexOf("@"), a = !s || e > -1 && s.index > e, l = o === -1 || e > -1 && o > e, u = i === -1 || e > -1 && i > e, c = r === -1 || e > -1 && r > e, p = n > 0, g = e > -1 ? t[e - 1] !== "/" : !t.endsWith("/"), f = !t.startsWith(".");
   return a && p && g && f && l && u && c;
 };
-var al = (t, e, { gitHosts: n, protocols: r }) => {
+var ol = (t, e, { gitHosts: n, protocols: r }) => {
   if (!t)
     return;
-  const i = ol(t) ? `github:${t}` : t, s = il(i, r);
+  const i = il(t) ? `github:${t}` : t, s = sl(i, r);
   if (!s)
     return;
   const o = n.byShortcut[s.protocol], a = n.byDomain[s.hostname.startsWith("www.") ? s.hostname.slice(4) : s.hostname], l = o || a;
@@ -2669,7 +2669,7 @@ var al = (t, e, { gitHosts: n, protocols: r }) => {
   }
   return [l, g, c, f, p, S, e];
 };
-const { LRUCache: ll } = vt, cl = tl, ul = al, fl = rs, Gt = new ll({ max: 1e3 });
+const { LRUCache: al } = vt, ll = el, cl = ol, ul = ns, Gt = new al({ max: 1e3 });
 class le {
   constructor(e, n, r, i, s, o, a = {}) {
     Object.assign(this, le.#n[e], {
@@ -2700,7 +2700,7 @@ class le {
       return;
     const r = e + JSON.stringify(n || {});
     if (!Gt.has(r)) {
-      const i = ul(e, n, {
+      const i = cl(e, n, {
         gitHosts: le.#n,
         protocols: le.#i
       });
@@ -2709,7 +2709,7 @@ class le {
     return Gt.get(r);
   }
   static parseUrl(e) {
-    return fl(e);
+    return ul(e);
   }
   #t(e, n) {
     if (typeof e != "function")
@@ -2773,10 +2773,10 @@ class le {
     return this.default && typeof this[this.default] == "function" ? this[this.default](e) : this.sshurl(e);
   }
 }
-for (const [t, e] of Object.entries(cl))
+for (const [t, e] of Object.entries(ll))
   le.addHost(t, e);
-var hl = le;
-const pl = /* @__PURE__ */ Ve(hl), dl = [
+var fl = le;
+const hl = /* @__PURE__ */ Xe(fl), pl = [
   [1e3, 6e4, "sec"],
   [6e4, 36e5, "min"],
   [36e5, 864e5, "hour"],
@@ -2784,7 +2784,7 @@ const pl = /* @__PURE__ */ Ve(hl), dl = [
   [6048e5, 2628e6, "week"],
   [2628e6, 31536e6, "month"],
   [31536e6, 1 / 0, "year"]
-], gl = {
+], dl = {
   "1 day ago": "yesterday",
   "1 week ago": "last week",
   "1 month ago": "last month",
@@ -2793,14 +2793,14 @@ const pl = /* @__PURE__ */ Ve(hl), dl = [
   "in 1 week": "next week",
   "in 1 month": "next month",
   "in 1 year": "next year"
-}, ml = {
+}, gl = {
   sec: "second",
   min: "minute"
 };
 function ur(t) {
   return t instanceof Date ? t.getTime() : typeof t == "string" ? Date.parse(t) : t;
 }
-function fr(t, { now: e, noAffix: n = !1, times: r = dl, nowThreshold: i = 2e3, nowString: s = "now", unknownString: o = "", aliases: a = !1, aliasesMap: l = gl, longUnits: u = !1 } = {}) {
+function fr(t, { now: e, noAffix: n = !1, times: r = pl, nowThreshold: i = 2e3, nowString: s = "now", unknownString: o = "", aliases: a = !1, aliasesMap: l = dl, longUnits: u = !1 } = {}) {
   const c = ur(t);
   if (e = e !== void 0 ? ur(e) : Date.now(), Number.isNaN(c))
     return o || String(t);
@@ -2811,25 +2811,25 @@ function fr(t, { now: e, noAffix: n = !1, times: r = dl, nowThreshold: i = 2e3,
   for (let w = 0, y = r.length; w < y; w++) {
     const I = r[w];
     if (!(g >= I[1])) {
-      f = Math.floor(g / I[0]), S = (u && ml[I[2]] || I[2]) + (f > 1 ? "s" : "");
+      f = Math.floor(g / I[0]), S = (u && gl[I[2]] || I[2]) + (f > 1 ? "s" : "");
       break;
     }
   }
   const v = `${p && !n ? "in " : ""}${f} ${S}${!p && !n ? " ago" : ""}`;
   return a ? l[v] ?? v : v;
 }
-function oe(t, e = globalThis.Deno ? globalThis.Deno.args : sn.argv) {
+function oe(t, e = globalThis.Deno ? globalThis.Deno.args : rn.argv) {
   const n = t.startsWith("-") ? "" : t.length === 1 ? "-" : "--", r = e.indexOf(n + t), i = e.indexOf("--");
   return r !== -1 && (i === -1 || r < i);
 }
-const { env: K } = sn;
+const { env: K } = rn;
 let ct;
 oe("no-color") || oe("no-colors") || oe("color=false") || oe("color=never") ? ct = 0 : (oe("color") || oe("colors") || oe("color=true") || oe("color=always")) && (ct = 1);
-function $l() {
+function ml() {
   if ("FORCE_COLOR" in K)
     return K.FORCE_COLOR === "true" ? 1 : K.FORCE_COLOR === "false" ? 0 : K.FORCE_COLOR.length === 0 ? 1 : Math.min(Number.parseInt(K.FORCE_COLOR, 10), 3);
 }
-function El(t) {
+function $l(t) {
   return t === 0 ? !1 : {
     level: t,
     hasBasic: !0,
@@ -2837,8 +2837,8 @@ function El(t) {
     has16m: t >= 3
   };
 }
-function yl(t, { streamIsTTY: e, sniffFlags: n = !0 } = {}) {
-  const r = $l();
+function El(t, { streamIsTTY: e, sniffFlags: n = !0 } = {}) {
+  const r = ml();
   r !== void 0 && (ct = r);
   const i = n ? ct : r;
   if (i === 0)
@@ -2856,8 +2856,8 @@ function yl(t, { streamIsTTY: e, sniffFlags: n = !0 } = {}) {
   const s = i || 0;
   if (K.TERM === "dumb")
     return s;
-  if (sn.platform === "win32") {
-    const o = Ts.release().split(".");
+  if (rn.platform === "win32") {
+    const o = Os.release().split(".");
     return Number(o[0]) >= 10 && Number(o[2]) >= 10586 ? Number(o[2]) >= 14931 ? 3 : 2 : 1;
   }
   if ("CI" in K)
@@ -2878,33 +2878,33 @@ function yl(t, { streamIsTTY: e, sniffFlags: n = !0 } = {}) {
   return /-256(color)?$/i.test(K.TERM) ? 2 : /^screen|^xterm|^vt100|^vt220|^rxvt|color|ansi|cygwin|linux/i.test(K.TERM) || "COLORTERM" in K ? 1 : s;
 }
 function hr(t, e = {}) {
-  const n = yl(t, {
+  const n = El(t, {
     streamIsTTY: t && t.isTTY,
     ...e
   });
-  return El(n);
+  return $l(n);
 }
-const wl = {
+const yl = {
   stdout: hr({ isTTY: _n.isatty(1) }),
   stderr: hr({ isTTY: _n.isatty(2) })
 };
-let ss = !0;
-function vl() {
-  ss = !1;
+let rs = !0;
+function wl() {
+  rs = !1;
 }
 function dn(t, e, n) {
   const r = t.join(" ");
-  return ss ? `\x1B[${e}m${r}\x1B[${n}m` : r;
+  return rs ? `\x1B[${e}m${r}\x1B[${n}m` : r;
 }
-const gn = (...t) => dn(t, 31, 39), mn = (...t) => dn(t, 32, 39), Al = (...t) => dn(t, 35, 39), Rl = (t) => {
+const gn = (...t) => dn(t, 31, 39), mn = (...t) => dn(t, 32, 39), vl = (...t) => dn(t, 35, 39), Al = (t) => {
   const e = typeof t;
   return t !== null && (e === "object" || e === "function");
 }, Ut = /* @__PURE__ */ new Set([
   "__proto__",
   "prototype",
   "constructor"
-]), bl = new Set("0123456789");
-function Sl(t) {
+]), Rl = new Set("0123456789");
+function bl(t) {
   const e = [];
   let n = "", r = "start", i = !1;
   for (const s of t)
@@ -2961,7 +2961,7 @@ function Sl(t) {
           throw new Error("Invalid character after an index");
       }
       default: {
-        if (r === "index" && !bl.has(s))
+        if (r === "index" && !Rl.has(s))
           throw new Error("Invalid character in an index");
         if (r === "indexEnd")
           throw new Error("Invalid character after an index");
@@ -2984,22 +2984,22 @@ function Sl(t) {
   }
   return e;
 }
-function _l(t, e) {
+function Sl(t, e) {
   if (typeof e != "number" && Array.isArray(t)) {
     const n = Number.parseInt(e, 10);
     return Number.isInteger(n) && t[n] === t[e];
   }
   return !1;
 }
-function Ol(t, e, n) {
-  if (!Rl(t) || typeof e != "string")
+function _l(t, e, n) {
+  if (!Al(t) || typeof e != "string")
     return n === void 0 ? t : n;
-  const r = Sl(e);
+  const r = bl(e);
   if (r.length === 0)
     return n;
   for (let i = 0; i < r.length; i++) {
     const s = r[i];
-    if (_l(t, s) ? t = i === r.length - 1 ? void 0 : null : t = t[s], t == null) {
+    if (Sl(t, s) ? t = i === r.length - 1 ? void 0 : null : t = t[s], t == null) {
       if (i !== r.length - 1)
         return n;
       break;
@@ -3007,16 +3007,16 @@ function Ol(t, e, n) {
   }
   return t === void 0 ? n : t;
 }
-class Tl extends Error {
+class Ol extends Error {
   constructor(e) {
     super(), this.name = "AbortError", this.message = e;
   }
 }
-const pr = (t) => globalThis.DOMException === void 0 ? new Tl(t) : new DOMException(t), dr = (t) => {
+const pr = (t) => globalThis.DOMException === void 0 ? new Ol(t) : new DOMException(t), dr = (t) => {
   const e = t.reason === void 0 ? pr("This operation was aborted.") : t.reason;
   return e instanceof Error ? e : pr(e);
 };
-async function xl(t, e, {
+async function Tl(t, e, {
   concurrency: n = Number.POSITIVE_INFINITY,
   stopOnError: r = !0,
   signal: i
@@ -3094,9 +3094,9 @@ async function xl(t, e, {
 }
 const gr = Symbol("skip");
 async function mr(t, e) {
-  return xl(t, (n) => n(), e);
+  return Tl(t, (n) => n(), e);
 }
-function Xe(t, e) {
+function qe(t, e) {
   var n = 0, r, i;
   e = e || {};
   function s() {
@@ -3127,26 +3127,26 @@ function Xe(t, e) {
     r = null, i = null, n = 0;
   }, s;
 }
-var qe = {};
-const he = "\\\\/", $r = `[^${he}]`, $e = "\\.", Il = "\\+", Cl = "\\?", At = "\\/", Ll = "(?=.)", is = "[^/]", $n = `(?:${At}|$)`, os = `(?:^|${At})`, En = `${$e}{1,2}${$n}`, Nl = `(?!${$e})`, Dl = `(?!${os}${En})`, Pl = `(?!${$e}{0,1}${$n})`, Hl = `(?!${En})`, Fl = `[^.${At}]`, jl = `${is}*?`, Gl = "/", as = {
+var Ke = {};
+const he = "\\\\/", $r = `[^${he}]`, $e = "\\.", xl = "\\+", Il = "\\?", At = "\\/", Cl = "(?=.)", ss = "[^/]", $n = `(?:${At}|$)`, is = `(?:^|${At})`, En = `${$e}{1,2}${$n}`, Ll = `(?!${$e})`, Nl = `(?!${is}${En})`, Dl = `(?!${$e}{0,1}${$n})`, Pl = `(?!${En})`, Hl = `[^.${At}]`, Fl = `${ss}*?`, jl = "/", os = {
   DOT_LITERAL: $e,
-  PLUS_LITERAL: Il,
-  QMARK_LITERAL: Cl,
+  PLUS_LITERAL: xl,
+  QMARK_LITERAL: Il,
   SLASH_LITERAL: At,
-  ONE_CHAR: Ll,
-  QMARK: is,
+  ONE_CHAR: Cl,
+  QMARK: ss,
   END_ANCHOR: $n,
   DOTS_SLASH: En,
-  NO_DOT: Nl,
-  NO_DOTS: Dl,
-  NO_DOT_SLASH: Pl,
-  NO_DOTS_SLASH: Hl,
-  QMARK_NO_DOT: Fl,
-  STAR: jl,
-  START_ANCHOR: os,
-  SEP: Gl
-}, Ul = {
-  ...as,
+  NO_DOT: Ll,
+  NO_DOTS: Nl,
+  NO_DOT_SLASH: Dl,
+  NO_DOTS_SLASH: Pl,
+  QMARK_NO_DOT: Hl,
+  STAR: Fl,
+  START_ANCHOR: is,
+  SEP: jl
+}, Gl = {
+  ...os,
   SLASH_LITERAL: `[${he}]`,
   QMARK: $r,
   STAR: `${$r}*?`,
@@ -3159,7 +3159,7 @@ const he = "\\\\/", $r = `[^${he}]`, $e = "\\.", Il = "\\+", Cl = "\\?", At = "\
   START_ANCHOR: `(?:^|[${he}])`,
   END_ANCHOR: `(?:[${he}]|$)`,
   SEP: "\\"
-}, Ml = {
+}, Ul = {
   alnum: "a-zA-Z0-9",
   alpha: "a-zA-Z",
   ascii: "\\x00-\\x7F",
@@ -3177,7 +3177,7 @@ const he = "\\\\/", $r = `[^${he}]`, $e = "\\.", Il = "\\+", Cl = "\\?", At = "\
 };
 var Rt = {
   MAX_LENGTH: 1024 * 64,
-  POSIX_REGEX_SOURCE: Ml,
+  POSIX_REGEX_SOURCE: Ul,
   // regular expressions
   REGEX_BACKSLASH: /\\(?![*+?^${}(|)[\]])/g,
   REGEX_NON_SPECIAL_CHARS: /^[^@![\].,$*+?^{}()|\\/]+/,
@@ -3296,7 +3296,7 @@ var Rt = {
    * Create GLOB_CHARS
    */
   globChars(t) {
-    return t === !0 ? Ul : as;
+    return t === !0 ? Gl : os;
   }
 };
 (function(t) {
@@ -3326,29 +3326,29 @@ var Rt = {
     const a = s.split(o ? /[\\/]/ : "/"), l = a[a.length - 1];
     return l === "" ? a[a.length - 2] : l;
   };
-})(qe);
-const Er = qe, {
+})(Ke);
+const Er = Ke, {
   CHAR_ASTERISK: Mt,
   /* * */
-  CHAR_AT: Bl,
+  CHAR_AT: Ml,
   /* @ */
-  CHAR_BACKWARD_SLASH: Be,
+  CHAR_BACKWARD_SLASH: ze,
   /* \ */
-  CHAR_COMMA: zl,
+  CHAR_COMMA: Bl,
   /* , */
   CHAR_DOT: Bt,
   /* . */
   CHAR_EXCLAMATION_MARK: zt,
   /* ! */
-  CHAR_FORWARD_SLASH: ls,
+  CHAR_FORWARD_SLASH: as,
   /* / */
   CHAR_LEFT_CURLY_BRACE: kt,
   /* { */
-  CHAR_LEFT_PARENTHESES: Wt,
+  CHAR_LEFT_PARENTHESES: Vt,
   /* ( */
-  CHAR_LEFT_SQUARE_BRACKET: kl,
+  CHAR_LEFT_SQUARE_BRACKET: zl,
   /* [ */
-  CHAR_PLUS: Wl,
+  CHAR_PLUS: kl,
   /* + */
   CHAR_QUESTION_MARK: yr,
   /* ? */
@@ -3356,24 +3356,24 @@ const Er = qe, {
   /* } */
   CHAR_RIGHT_PARENTHESES: wr,
   /* ) */
-  CHAR_RIGHT_SQUARE_BRACKET: Xl
+  CHAR_RIGHT_SQUARE_BRACKET: Wl
   /* ] */
-} = Rt, vr = (t) => t === ls || t === Be, Ar = (t) => {
+} = Rt, vr = (t) => t === as || t === ze, Ar = (t) => {
   t.isPrefix !== !0 && (t.depth = t.isGlobstar ? 1 / 0 : 1);
-}, ql = (t, e) => {
+}, Xl = (t, e) => {
   const n = e || {}, r = t.length - 1, i = n.parts === !0 || n.scanToEnd === !0, s = [], o = [], a = [];
   let l = t, u = -1, c = 0, p = 0, g = !1, f = !1, S = !1, v = !1, w = !1, y = !1, I = !1, A = !1, b = !1, L = !1, j = 0, P, H, D = { value: "", depth: 0, isGlob: !1 };
   const m = () => u >= r, _ = () => l.charCodeAt(u + 1), E = () => (P = H, l.charCodeAt(++u));
   for (; u < r; ) {
     H = E();
     let R;
-    if (H === Be) {
+    if (H === ze) {
       I = D.backslashes = !0, H = E(), H === kt && (y = !0);
       continue;
     }
     if (y === !0 || H === kt) {
       for (j++; m() !== !0 && (H = E()); ) {
-        if (H === Be) {
+        if (H === ze) {
           I = D.backslashes = !0, E();
           continue;
         }
@@ -3386,7 +3386,7 @@ const Er = qe, {
             continue;
           break;
         }
-        if (y !== !0 && H === zl) {
+        if (y !== !0 && H === Bl) {
           if (g = D.isBrace = !0, S = D.isGlob = !0, L = !0, i === !0)
             continue;
           break;
@@ -3400,7 +3400,7 @@ const Er = qe, {
         continue;
       break;
     }
-    if (H === ls) {
+    if (H === as) {
       if (s.push(u), o.push(D), D = { value: "", depth: 0, isGlob: !1 }, L === !0) continue;
       if (P === Bt && u === c + 1) {
         c += 2;
@@ -3409,10 +3409,10 @@ const Er = qe, {
       p = u + 1;
       continue;
     }
-    if (n.noext !== !0 && (H === Wl || H === Bl || H === Mt || H === yr || H === zt) === !0 && _() === Wt) {
+    if (n.noext !== !0 && (H === kl || H === Ml || H === Mt || H === yr || H === zt) === !0 && _() === Vt) {
       if (S = D.isGlob = !0, v = D.isExtglob = !0, L = !0, H === zt && u === c && (b = !0), i === !0) {
         for (; m() !== !0 && (H = E()); ) {
-          if (H === Be) {
+          if (H === ze) {
             I = D.backslashes = !0, H = E();
             continue;
           }
@@ -3435,13 +3435,13 @@ const Er = qe, {
         continue;
       break;
     }
-    if (H === kl) {
+    if (H === zl) {
       for (; m() !== !0 && (R = E()); ) {
-        if (R === Be) {
+        if (R === ze) {
           I = D.backslashes = !0, E();
           continue;
         }
-        if (R === Xl) {
+        if (R === Wl) {
           f = D.isBracket = !0, S = D.isGlob = !0, L = !0;
           break;
         }
@@ -3454,10 +3454,10 @@ const Er = qe, {
       A = D.negated = !0, c++;
       continue;
     }
-    if (n.noparen !== !0 && H === Wt) {
+    if (n.noparen !== !0 && H === Vt) {
       if (S = D.isGlob = !0, i === !0) {
         for (; m() !== !0 && (H = E()); ) {
-          if (H === Wt) {
+          if (H === Vt) {
             I = D.backslashes = !0, H = E();
             continue;
           }
@@ -3507,14 +3507,14 @@ const Er = qe, {
   }
   return $;
 };
-var Kl = ql;
-const ut = Rt, pe = qe, {
+var ql = Xl;
+const ut = Rt, pe = Ke, {
   MAX_LENGTH: ft,
-  POSIX_REGEX_SOURCE: Yl,
-  REGEX_NON_SPECIAL_CHARS: Zl,
-  REGEX_SPECIAL_CHARS_BACKREF: Ql,
-  REPLACEMENTS: cs
-} = ut, Jl = (t, e) => {
+  POSIX_REGEX_SOURCE: Kl,
+  REGEX_NON_SPECIAL_CHARS: Yl,
+  REGEX_SPECIAL_CHARS_BACKREF: Zl,
+  REPLACEMENTS: ls
+} = ut, Ql = (t, e) => {
   if (typeof e.expandRange == "function")
     return e.expandRange(...t, e);
   t.sort();
@@ -3528,7 +3528,7 @@ const ut = Rt, pe = qe, {
 }, Ne = (t, e) => `Missing ${t}: "${e}" - use "\\\\${e}" to match literal characters`, yn = (t, e) => {
   if (typeof t != "string")
     throw new TypeError("Expected a string");
-  t = cs[t] || t;
+  t = ls[t] || t;
   const n = { ...e }, r = typeof n.maxLength == "number" ? Math.min(ft, n.maxLength) : ft;
   let i = t.length;
   if (i > r)
@@ -3569,11 +3569,11 @@ const ut = Rt, pe = qe, {
   t = pe.removePrefix(t, m), i = t.length;
   const _ = [], E = [], T = [];
   let h = s, d;
-  const $ = () => m.index === i - 1, R = m.peek = (C = 1) => t[m.index + C], x = m.advance = () => t[++m.index] || "", N = () => t.slice(m.index + 1), F = (C = "", W = 0) => {
-    m.consumed += C, m.index += W;
+  const $ = () => m.index === i - 1, R = m.peek = (C = 1) => t[m.index + C], x = m.advance = () => t[++m.index] || "", N = () => t.slice(m.index + 1), F = (C = "", V = 0) => {
+    m.consumed += C, m.index += V;
   }, X = (C) => {
     m.output += C.output != null ? C.output : C.value, F(C.value);
-  }, V = () => {
+  }, W = () => {
     let C = 1;
     for (; R() === "!" && (R(2) !== "(" || R(3) === "?"); )
       x(), m.start++, C++;
@@ -3584,34 +3584,34 @@ const ut = Rt, pe = qe, {
     m[C]--, T.pop();
   }, G = (C) => {
     if (h.type === "globstar") {
-      const W = m.braces > 0 && (C.type === "comma" || C.type === "brace"), O = C.extglob === !0 || _.length && (C.type === "pipe" || C.type === "paren");
-      C.type !== "slash" && C.type !== "paren" && !W && !O && (m.output = m.output.slice(0, -h.output.length), h.type = "star", h.value = "*", h.output = D, m.output += h.output);
+      const V = m.braces > 0 && (C.type === "comma" || C.type === "brace"), O = C.extglob === !0 || _.length && (C.type === "pipe" || C.type === "paren");
+      C.type !== "slash" && C.type !== "paren" && !V && !O && (m.output = m.output.slice(0, -h.output.length), h.type = "star", h.value = "*", h.output = D, m.output += h.output);
     }
     if (_.length && C.type !== "paren" && (_[_.length - 1].inner += C.value), (C.value || C.output) && X(C), h && h.type === "text" && C.type === "text") {
       h.output = (h.output || h.value) + C.value, h.value += C.value;
       return;
     }
     C.prev = h, o.push(C), h = C;
-  }, ye = (C, W) => {
-    const O = { ...u[W], conditions: 1, inner: "" };
+  }, ye = (C, V) => {
+    const O = { ...u[V], conditions: 1, inner: "" };
     O.prev = h, O.parens = m.parens, O.output = m.output;
     const U = (n.capture ? "(" : "") + O.open;
-    J("parens"), G({ type: C, value: W, output: m.output ? "" : f }), G({ type: "paren", extglob: !0, value: x(), output: U }), _.push(O);
+    J("parens"), G({ type: C, value: V, output: m.output ? "" : f }), G({ type: "paren", extglob: !0, value: x(), output: U }), _.push(O);
   }, ie = (C) => {
-    let W = C.close + (n.capture ? ")" : ""), O;
+    let V = C.close + (n.capture ? ")" : ""), O;
     if (C.type === "negate") {
       let U = D;
-      if (C.inner && C.inner.length > 1 && C.inner.includes("/") && (U = j(n)), (U !== D || $() || /^\)+$/.test(N())) && (W = C.close = `)$))${U}`), C.inner.includes("*") && (O = N()) && /^\.[^\\/.]+$/.test(O)) {
+      if (C.inner && C.inner.length > 1 && C.inner.includes("/") && (U = j(n)), (U !== D || $() || /^\)+$/.test(N())) && (V = C.close = `)$))${U}`), C.inner.includes("*") && (O = N()) && /^\.[^\\/.]+$/.test(O)) {
         const q = yn(O, { ...e, fastpaths: !1 }).output;
-        W = C.close = `)${q})${U})`;
+        V = C.close = `)${q})${U})`;
       }
       C.prev.type === "bos" && (m.negatedExtglob = !0);
     }
-    G({ type: "paren", extglob: !0, value: d, output: W }), Z("parens");
+    G({ type: "paren", extglob: !0, value: d, output: V }), Z("parens");
   };
   if (n.fastpaths !== !1 && !/(^[*!]|[/()[\]{}"])/.test(t)) {
-    let C = !1, W = t.replace(Ql, (O, U, q, re, ee, St) => re === "\\" ? (C = !0, O) : re === "?" ? U ? U + re + (ee ? I.repeat(ee.length) : "") : St === 0 ? H + (ee ? I.repeat(ee.length) : "") : I.repeat(q.length) : re === "." ? c.repeat(q.length) : re === "*" ? U ? U + re + (ee ? D : "") : D : U ? O : `\\${O}`);
-    return C === !0 && (n.unescape === !0 ? W = W.replace(/\\/g, "") : W = W.replace(/\\+/g, (O) => O.length % 2 === 0 ? "\\\\" : O ? "\\" : "")), W === t && n.contains === !0 ? (m.output = t, m) : (m.output = pe.wrapOutput(W, m, e), m);
+    let C = !1, V = t.replace(Zl, (O, U, q, re, ee, St) => re === "\\" ? (C = !0, O) : re === "?" ? U ? U + re + (ee ? I.repeat(ee.length) : "") : St === 0 ? H + (ee ? I.repeat(ee.length) : "") : I.repeat(q.length) : re === "." ? c.repeat(q.length) : re === "*" ? U ? U + re + (ee ? D : "") : D : U ? O : `\\${O}`);
+    return C === !0 && (n.unescape === !0 ? V = V.replace(/\\/g, "") : V = V.replace(/\\+/g, (O) => O.length % 2 === 0 ? "\\\\" : O ? "\\" : "")), V === t && n.contains === !0 ? (m.output = t, m) : (m.output = pe.wrapOutput(V, m, e), m);
   }
   for (; !$(); ) {
     if (d = x(), d === "\0")
@@ -3635,7 +3635,7 @@ const ut = Rt, pe = qe, {
       if (n.posix !== !1 && d === ":") {
         const O = h.value.slice(1);
         if (O.includes("[") && (h.posix = !0, O.includes(":"))) {
-          const U = h.value.lastIndexOf("["), q = h.value.slice(0, U), re = h.value.slice(U + 2), ee = Yl[re];
+          const U = h.value.lastIndexOf("["), q = h.value.slice(0, U), re = h.value.slice(U + 2), ee = Kl[re];
           if (ee) {
             h.value = q + ee, m.backtrack = !0, x(), !s.output && o.indexOf(h) === 1 && (s.output = f);
             continue;
@@ -3724,7 +3724,7 @@ const ut = Rt, pe = qe, {
         const q = o.slice(), re = [];
         for (let ee = q.length - 1; ee >= 0 && (o.pop(), q[ee].type !== "brace"); ee--)
           q[ee].type !== "dots" && re.unshift(q[ee].value);
-        U = Jl(re, n), m.backtrack = !0;
+        U = Ql(re, n), m.backtrack = !0;
       }
       if (O.comma !== !0 && O.dots !== !0) {
         const q = m.output.slice(0, O.outputIndex), re = m.tokens.slice(O.tokensIndex);
@@ -3791,7 +3791,7 @@ const ut = Rt, pe = qe, {
         continue;
       }
       if (n.nonegate !== !0 && m.index === 0) {
-        V();
+        W();
         continue;
       }
     }
@@ -3821,7 +3821,7 @@ const ut = Rt, pe = qe, {
     }
     if (d !== "*") {
       (d === "$" || d === "^") && (d = `\\${d}`);
-      const O = Zl.exec(N());
+      const O = Yl.exec(N());
       O && (d += O[0], m.index += O[0].length), G({ type: "text", value: d });
       continue;
     }
@@ -3850,8 +3850,8 @@ const ut = Rt, pe = qe, {
         continue;
       }
       for (; C.slice(0, 3) === "/**"; ) {
-        const Ze = t[m.index + 4];
-        if (Ze && Ze !== "/")
+        const Qe = t[m.index + 4];
+        if (Qe && Qe !== "/")
           break;
         C = C.slice(3), F("/**", 3);
       }
@@ -3864,8 +3864,8 @@ const ut = Rt, pe = qe, {
         continue;
       }
       if (O.type === "slash" && O.prev.type !== "bos" && C[0] === "/") {
-        const Ze = C[1] !== void 0 ? "|$" : "";
-        m.output = m.output.slice(0, -(O.output + h.output).length), O.output = `(?:${O.output}`, h.type = "globstar", h.output = `${j(n)}${g}|${g}${Ze})`, h.value += d, m.output += O.output + h.output, m.globstar = !0, F(d + x()), G({ type: "slash", value: "/", output: "" });
+        const Qe = C[1] !== void 0 ? "|$" : "";
+        m.output = m.output.slice(0, -(O.output + h.output).length), O.output = `(?:${O.output}`, h.type = "globstar", h.output = `${j(n)}${g}|${g}${Qe})`, h.value += d, m.output += O.output + h.output, m.globstar = !0, F(d + x()), G({ type: "slash", value: "/", output: "" });
         continue;
       }
       if (O.type === "bos" && C[0] === "/") {
@@ -3875,16 +3875,16 @@ const ut = Rt, pe = qe, {
       m.output = m.output.slice(0, -h.output.length), h.type = "globstar", h.output = j(n), h.value += d, m.output += h.output, m.globstar = !0, F(d);
       continue;
     }
-    const W = { type: "star", value: d, output: D };
+    const V = { type: "star", value: d, output: D };
     if (n.bash === !0) {
-      W.output = ".*?", (h.type === "bos" || h.type === "slash") && (W.output = P + W.output), G(W);
+      V.output = ".*?", (h.type === "bos" || h.type === "slash") && (V.output = P + V.output), G(V);
       continue;
     }
     if (h && (h.type === "bracket" || h.type === "paren") && n.regex === !0) {
-      W.output = d, G(W);
+      V.output = d, G(V);
       continue;
     }
-    (m.index === m.start || h.type === "slash" || h.type === "dot") && (h.type === "dot" ? (m.output += w, h.output += w) : n.dot === !0 ? (m.output += y, h.output += y) : (m.output += P, h.output += P), R() !== "*" && (m.output += f, h.output += f)), G(W);
+    (m.index === m.start || h.type === "slash" || h.type === "dot") && (h.type === "dot" ? (m.output += w, h.output += w) : n.dot === !0 ? (m.output += y, h.output += y) : (m.output += P, h.output += P), R() !== "*" && (m.output += f, h.output += f)), G(V);
   }
   for (; m.brackets > 0; ) {
     if (n.strictBrackets === !0) throw new SyntaxError(Ne("closing", "]"));
@@ -3909,7 +3909,7 @@ yn.fastpaths = (t, e) => {
   const n = { ...e }, r = typeof n.maxLength == "number" ? Math.min(ft, n.maxLength) : ft, i = t.length;
   if (i > r)
     throw new SyntaxError(`Input length: ${i}, exceeds maximum allowed length: ${r}`);
-  t = cs[t] || t;
+  t = ls[t] || t;
   const {
     DOT_LITERAL: s,
     SLASH_LITERAL: o,
@@ -3952,8 +3952,8 @@ yn.fastpaths = (t, e) => {
   let j = b(L);
   return j && n.strictSlashes !== !0 && (j += `${o}?`), j;
 };
-var ec = yn;
-const tc = Kl, Qt = ec, us = qe, nc = Rt, rc = (t) => t && typeof t == "object" && !Array.isArray(t), Y = (t, e, n = !1) => {
+var Jl = yn;
+const ec = ql, Qt = Jl, cs = Ke, tc = Rt, nc = (t) => t && typeof t == "object" && !Array.isArray(t), Y = (t, e, n = !1) => {
   if (Array.isArray(t)) {
     const c = t.map((g) => Y(g, e, n));
     return (g) => {
@@ -3964,7 +3964,7 @@ const tc = Kl, Qt = ec, us = qe, nc = Rt, rc = (t) => t && typeof t == "object"
       return !1;
     };
   }
-  const r = rc(t) && t.tokens && t.input;
+  const r = nc(t) && t.tokens && t.input;
   if (t === "" || typeof t != "string" && !r)
     throw new TypeError("Expected pattern to be a non-empty string");
   const i = e || {}, s = i.windows, o = r ? Y.compileRe(t, e) : Y.makeRe(t, e, !1, !0), a = o.state;
@@ -3985,14 +3985,14 @@ Y.test = (t, e, n, { glob: r, posix: i } = {}) => {
     throw new TypeError("Expected input to be a string");
   if (t === "")
     return { isMatch: !1, output: "" };
-  const s = n || {}, o = s.format || (i ? us.toPosixSlashes : null);
+  const s = n || {}, o = s.format || (i ? cs.toPosixSlashes : null);
   let a = t === r, l = a && o ? o(t) : t;
   return a === !1 && (l = o ? o(t) : t, a = l === r), (a === !1 || s.capture === !0) && (s.matchBase === !0 || s.basename === !0 ? a = Y.matchBase(t, e, n, i) : a = e.exec(l)), { isMatch: !!a, match: a, output: l };
 };
-Y.matchBase = (t, e, n) => (e instanceof RegExp ? e : Y.makeRe(e, n)).test(us.basename(t));
+Y.matchBase = (t, e, n) => (e instanceof RegExp ? e : Y.makeRe(e, n)).test(cs.basename(t));
 Y.isMatch = (t, e, n) => Y(e, n)(t);
 Y.parse = (t, e) => Array.isArray(t) ? t.map((n) => Y.parse(n, e)) : Qt(t, { ...e, fastpaths: !1 });
-Y.scan = (t, e) => tc(t, e);
+Y.scan = (t, e) => ec(t, e);
 Y.compileRe = (t, e, n = !1, r = !1) => {
   if (n === !0)
     return t.output;
@@ -4017,19 +4017,19 @@ Y.toRegex = (t, e) => {
     return /$^/;
   }
 };
-Y.constants = nc;
-var sc = Y;
-const fs = sc, ic = qe;
-function hs(t, e, n = !1) {
-  return e && (e.windows === null || e.windows === void 0) && (e = { ...e, windows: ic.isWindows() }), fs(t, e, n);
+Y.constants = tc;
+var rc = Y;
+const us = rc, sc = Ke;
+function fs(t, e, n = !1) {
+  return e && (e.windows === null || e.windows === void 0) && (e = { ...e, windows: sc.isWindows() }), us(t, e, n);
 }
-Object.assign(hs, fs);
-var oc = hs;
-const Rr = /* @__PURE__ */ Ve(oc), ac = "updates", lc = "16.3.1", cc = "Flexible npm and poetry dependency update tool", uc = "silverwind", fc = "silverwind/updates", hc = "BSD-2-Clause", pc = "dist/index.js", dc = "module", gc = [
+Object.assign(fs, us);
+var ic = fs;
+const Rr = /* @__PURE__ */ Xe(ic), oc = "updates", ac = "16.3.3", lc = "Flexible npm and poetry dependency update tool", cc = "silverwind", uc = "silverwind/updates", fc = "BSD-2-Clause", hc = "dist/index.js", pc = "module", dc = [
   "dist"
-], mc = {
+], gc = {
   node: ">=18"
-}, $c = {
+}, mc = {
   "@swc-node/register": "1.10.9",
   "@types/hosted-git-info": "3.0.5",
   "@types/minimist": "1.2.5",
@@ -4064,23 +4064,23 @@ const Rr = /* @__PURE__ */ Ve(oc), ac = "updates", lc = "16.3.1", cc = "Flexible
   "vite-config-silverwind": "3.0.0",
   vitest: "2.0.4",
   "vitest-config-silverwind": "9.1.0"
-}, Ec = {
-  name: ac,
-  version: lc,
-  description: cc,
-  author: uc,
-  repository: fc,
-  license: hc,
-  bin: pc,
-  type: dc,
-  files: gc,
-  engines: mc,
-  devDependencies: $c
-}, yc = /^.*?:\/\/(.*?@)?(github\.com[:/])/i, wc = /^([^/]+)\/([^/#]+)?.*?\/([0-9a-f]+|v?[0-9]+\.[0-9]+\.[0-9]+)$/i, Jt = /^[0-9a-f]{7,}$/i, br = /[0-9]+(\.[0-9]+)?(\.[0-9]+)?/g, ht = (t) => t.replace(/[|\\{}()[\]^$+*?.-]/g, "\\$&"), vc = Xe(pl.fromUrl), Vt = Xe(Ks), Ke = Xe((t) => t.endsWith("/") ? t.substring(0, t.length - 1) : t), ps = Ec.version, de = "\0", en = {
+}, $c = {
+  name: oc,
+  version: ac,
+  description: lc,
+  author: cc,
+  repository: uc,
+  license: fc,
+  bin: hc,
+  type: pc,
+  files: dc,
+  engines: gc,
+  devDependencies: mc
+}, Ec = /^.*?:\/\/(.*?@)?(github\.com[:/])/i, yc = /^([^/]+)\/([^/#]+)?.*?\/([0-9a-f]+|v?[0-9]+\.[0-9]+\.[0-9]+)$/i, Jt = /^[0-9a-f]{7,}$/i, br = /[0-9]+(\.[0-9]+)?(\.[0-9]+)?/g, ht = (t) => t.replace(/[|\\{}()[\]^$+*?.-]/g, "\\$&"), wc = qe(hl.fromUrl), Wt = qe(qs), Ye = qe((t) => t.endsWith("/") ? t.substring(0, t.length - 1) : t), hs = $c.version, de = "\0", en = {
   "package.json": "npm",
   "pyproject.toml": "pypi",
   "go.mod": "go"
-}, B = Ls(As.slice(2), {
+}, B = Cs(vs.slice(2), {
   boolean: [
     "E",
     "error-on-outdated",
@@ -4152,73 +4152,79 @@ const Rr = /* @__PURE__ */ Ve(oc), ac = "updates", lc = "16.3.1", cc = "Flexible
     V: "verbose"
   }
 });
-(B["no-color"] || !wl.stdout) && vl();
-const De = Ye(Re(B.greatest)), Xt = Ye(Re(B.prerelease)), qt = Ye(Re(B.release)), Sr = Ye(Re(B.patch)), _r = Ye(Re(B.minor)), Or = Re(B["allow-downgrade"]), Ac = Re(B.modes) || /* @__PURE__ */ new Set(["npm", "pypi"]), ds = B.githubapi ? Ke(B.githubapi) : "https://api.github.com", Rc = B.pypiapi ? Ke(B.pypiapi) : "https://pypi.org", tn = "https://proxy.golang.org", bc = B.goproxy ? Ke(B.goproxy) : Me.GOPROXY || tn, nt = (t) => t.replace(/^v/, "");
+(B["no-color"] || !yl.stdout) && wl();
+const De = Ze(Re(B.greatest)), Xt = Ze(Re(B.prerelease)), qt = Ze(Re(B.release)), Sr = Ze(Re(B.patch)), _r = Ze(Re(B.minor)), Or = Re(B["allow-downgrade"]), vc = Re(B.modes) || /* @__PURE__ */ new Set(["npm", "pypi"]), ps = B.githubapi ? Ye(B.githubapi) : "https://api.github.com", Ac = B.pypiapi ? Ye(B.pypiapi) : "https://pypi.org", Rc = "https://proxy.golang.org", bc = B.goproxy ? Ye(B.goproxy) : _c(), Fe = (t) => t.replace(/^v/, "");
 function Se(t, e) {
   for (const n of e instanceof Set ? e : [])
     if (n.test(t)) return !0;
   return !1;
 }
-const Sc = Xe((t, e) => {
+const Sc = qe((t, e) => {
   const n = e[`${t}:registry`] || e.registry;
   return n.endsWith("/") ? n : `${n}/`;
 });
-function gs(t, e) {
+function _c() {
+  return Pe.GOPROXY ? Pe.GOPROXY.split(/[,|]/).map((t) => t.trim()).filter((t) => !!t && t !== "direct") : [Rc];
+}
+function ds(t, e) {
   const n = on(e, t);
   try {
-    return Os(n), n;
+    return _s(n), n;
   } catch {
   }
-  const r = Mr(e);
-  return r === e ? null : gs(t, r);
+  const r = sn(e);
+  return r === e ? null : ds(t, r);
 }
-function _c(t, e, n, r) {
+function Oc(t, e, n, r) {
   if (t.startsWith("@")) {
-    const i = (/@[a-z0-9][\w-.]+/.exec(t) || [""])[0], s = Ke(Sc(i, r));
+    const i = (/@[a-z0-9][\w-.]+/.exec(t) || [""])[0], s = Ye(Sc(i, r));
     if (s !== e)
       try {
-        const o = Vt(s, n);
+        const o = Wt(s, n);
         if (o?.token) return { auth: o, registry: s };
       } catch {
       }
-    return { auth: Vt(e, n), registry: e };
+    return { auth: Wt(e, n), registry: e };
   } else
-    return { auth: Vt(e, n), registry: e };
+    return { auth: Wt(e, n), registry: e };
 }
-const wn = Xe((t, e, n) => ({
+const wn = qe((t, e, n) => ({
   ...Object.keys(t).length && { agentOpts: t },
   headers: {
-    "user-agent": `updates/${ps}`,
+    "user-agent": `updates/${hs}`,
     ...n && { Authorization: `${e} ${n}` }
   }
 }));
 async function bt(t, e) {
-  B.verbose && console.error(`${Al("fetch")} ${t}`);
+  B.verbose && console.error(`${vl("fetch")} ${t}`);
   const n = await fetch(t, e);
   return B.verbose && console.error(`${n.ok ? mn(n.status) : gn(n.status)} ${t}`), n;
 }
-async function Oc(t, e, n, r, i, s) {
-  const { auth: o, registry: a } = _c(t, n, i, s), l = e === "resolutions" ? st(t) : t, u = `${a}/${l.replace(/\//g, "%2f")}`, c = await bt(u, wn(r, o?.type, o?.token));
+async function Tc(t, e, n, r, i, s) {
+  const { auth: o, registry: a } = Oc(t, n, i, s), l = e === "resolutions" ? st(t) : t, u = `${a}/${l.replace(/\//g, "%2f")}`, c = await bt(u, wn(r, o?.type, o?.token));
   if (c?.ok)
     return [await c.json(), e, a, t];
   throw c?.status && c?.statusText ? new Error(`Received ${c.status} ${c.statusText} from ${u}`) : new Error(`Unable to fetch ${t} from ${a}`);
 }
-async function Tc(t, e, n) {
-  const r = `${Rc}/pypi/${t}/json`, i = await bt(r, wn(n));
+async function xc(t, e, n) {
+  const r = `${Ac}/pypi/${t}/json`, i = await bt(r, wn(n));
   if (i?.ok)
     return [await i.json(), e, null, t];
   throw i?.status && i?.statusText ? new Error(`Received ${i.status} ${i.statusText} from ${r}`) : new Error(`Unable to fetch ${t} from PyPi`);
 }
-function xc(t) {
+function Ic(t) {
   return t.split(/\r?\n/).map((e) => e.trim()).filter(Boolean);
 }
-async function ms(t, e, n, r) {
-  const i = `${r}/${t.toLowerCase()}/@latest`, s = await bt(i, wn(n));
-  if ([404, 410].includes(s.status) && r !== tn)
-    return ms(t, e, n, tn);
-  if (s?.ok)
-    return s.json();
-  throw s?.status && s?.statusText ? new Error(`Received ${s.status} ${s.statusText} from ${i}`) : new Error(`Unable to fetch ${t} from PyPi`);
+async function gs(t, e, n, r) {
+  const i = r.shift();
+  if (!i)
+    throw new Error("No more go proxies available");
+  const s = `${i}/${t.toLowerCase()}/@latest`, o = await bt(s, wn(n));
+  if ([404, 410].includes(o.status) && r.length)
+    return gs(t, e, n, r);
+  if (o?.ok)
+    return o.json();
+  throw o?.status && o?.statusText ? new Error(`Received ${o.status} ${o.statusText} from ${s}`) : new Error(`Unable to fetch ${t} from PyPi`);
 }
 function Tr({ repository: t, homepage: e, info: n }, r, i) {
   n && (t = n.project_urls.repository || n.project_urls.Repository || n.project_urls.repo || n.project_urls.Repo || n.project_urls.source || n.project_urls.Source || n.project_urls["source code"] || n.project_urls["Source Code"] || n.project_urls.homepage || n.project_urls.Homepage || `https://pypi.org/project/${i}/`);
@@ -4226,22 +4232,22 @@ function Tr({ repository: t, homepage: e, info: n }, r, i) {
   if (r === "https://npm.pkg.github.com")
     return `https://github.com/${i.replace(/^@/, "")}`;
   if (t) {
-    const o = typeof t == "string" ? t : t.url, a = vc(o), l = a?.browse?.();
+    const o = typeof t == "string" ? t : t.url, a = wc(o), l = a?.browse?.();
     l && (s = l), s && typeof t != "string" && t.directory && a?.treepath && (s = `${s}/${a.treepath}/HEAD/${t.directory}`), !s && typeof t != "string" && t?.url && /^https?:/.test(t.url) && (s = t.url), !s && o && (s = o);
   }
   return s || e || "";
 }
 function xr(t) {
-  console.info(B.json ? JSON.stringify({ message: t }) : t), ke();
+  console.info(B.json ? JSON.stringify({ message: t }) : t), Ve();
 }
-function ke(t) {
+function Ve(t) {
   if (t) {
     const e = t.stack ?? t.message;
     console.info(B.json ? JSON.stringify({ error: e }) : gn(e));
   }
   process.exit(t ? 1 : 0);
 }
-function Ic(t = {}) {
+function Cc(t = {}) {
   for (const n of Object.keys(t))
     for (const r of Object.values(t[n]))
       typeof r.oldPrint == "string" && (r.old = r.oldPrint, delete r.oldPrint), typeof r.newPrint == "string" && (r.new = r.newPrint, delete r.newPrint), typeof r.oldOriginal == "string" && (r.old = r.oldOriginal, delete r.oldOriginal);
@@ -4256,12 +4262,12 @@ function Ic(t = {}) {
         n.results[r] || (n.results[r] = {}), n.results[r][o] || (n.results[r][o] = {}), n.results[r][o][a] = s;
       }
     console.info(JSON.stringify(n));
-  } else e && console.info(Nc(t));
+  } else e && console.info(Pc(t));
   return B["error-on-outdated"] ? e ? 2 : 0 : B["error-on-unchanged"] ? e ? 0 : 2 : 0;
 }
-async function Cc(t, e) {
+async function Lc(t, e) {
   const { platform: n } = await import("node:os"), r = n() === "win32";
-  r && Ss(t, 0), _s(t, e, r ? { flag: "r+" } : void 0);
+  r && bs(t, 0), Ss(t, e, r ? { flag: "r+" } : void 0);
 }
 function Ir(t, e, n) {
   if (t === e) return t;
@@ -4275,8 +4281,8 @@ function Ir(t, e, n) {
       o += `${r[a]}.`;
   return o.replace(/\.$/, "");
 }
-const Cr = (t) => t.replace(Is(), "").length;
-function Lc(t, e = " ") {
+const Cr = (t) => t.replace(xs(), "").length;
+function Nc(t, e = " ") {
   let n = "";
   const r = new Array(t[0].length).fill(0);
   for (const i of t)
@@ -4295,22 +4301,25 @@ function Lc(t, e = " ") {
   }
   return n;
 }
-function Nc(t) {
+function Dc(t) {
+  return /\/v[0-9]$/.test(t) && (t = sn(t)), t;
+}
+function Pc(t) {
   const e = [["NAME", "OLD", "NEW", "AGE", "INFO"]], n = /* @__PURE__ */ new Set();
   for (const r of Object.keys(t))
     for (const [i, s] of Object.entries(t[r])) {
       const o = i.split(de)[1], a = `${r}|${o}`;
       n.has(a) || (n.add(a), e.push([
-        o,
+        r === "go" ? Dc(o) : o,
         Ir(s.old, s.new, gn),
         Ir(s.new, s.old, mn),
         s.age || "",
         s.info || ""
       ]));
     }
-  return Lc(e);
+  return Nc(e);
 }
-function Dc(t, e) {
+function Hc(t, e) {
   let n = t;
   for (const r of Object.keys(e)) {
     const i = r.split(de)[1], s = e[r].oldOriginal || e[r].old, o = new RegExp(`"${ht(i)}": *"${ht(s)}"`, "g");
@@ -4318,7 +4327,7 @@ function Dc(t, e) {
   }
   return n;
 }
-function Pc(t, e) {
+function Fc(t, e) {
   let n = t;
   for (const r of Object.keys(e)) {
     const i = r.split(de)[1], s = e[r].oldOriginal || e[r].old, o = new RegExp(`${ht(i)} *= *"${ht(s)}"`, "g");
@@ -4326,7 +4335,7 @@ function Pc(t, e) {
   }
   return n;
 }
-function Hc(t, e, n) {
+function jc(t, e, n) {
   let r = t.replace(/[0-9]+\.[0-9]+\.[0-9]+(-.+)?/g, e);
   if (n && n !== t && /^[\^~]/.test(r)) {
     const i = n.substring(1).split("."), s = r.substring(1).split(".");
@@ -4338,7 +4347,7 @@ function Kt(t) {
   const e = ne.parse(t);
   return e ? !!e.prerelease.length : !1;
 }
-function $s(t) {
+function ms(t) {
   return /[0-9]+\.[0-9]+\.[0-9]+-.+/.test(t);
 }
 function We(t) {
@@ -4348,9 +4357,9 @@ function We(t) {
     return "";
   }
 }
-function Fc(t, e, { range: n, semvers: r, usePre: i, useRel: s, useGreatest: o }) {
+function Gc(t, e, { range: n, semvers: r, usePre: i, useRel: s, useGreatest: o }) {
   let a = We(n), l = 0;
-  i = $s(n) || i, i && (r.add("prerelease"), r.has("patch") && r.add("prepatch"), r.has("minor") && r.add("preminor"), r.has("major") && r.add("premajor"));
+  i = ms(n) || i, i && (r.add("prerelease"), r.has("patch") && r.add("prepatch"), r.has("minor") && r.add("preminor"), r.has("major") && r.add("premajor"));
   for (const u of e) {
     const c = ne.parse(u);
     if (!c || !a || c.prerelease.length && (!i || s)) continue;
@@ -4365,19 +4374,20 @@ function Fc(t, e, { range: n, semvers: r, usePre: i, useRel: s, useGreatest: o }
   }
   return a || null;
 }
-function jc(t, { mode: e, range: n, useGreatest: r, useRel: i, usePre: s, semvers: o }) {
-  if (e === "go") return t.Version;
+function Uc(t, { mode: e, range: n, useGreatest: r, useRel: i, usePre: s, semvers: o }) {
+  if (e === "go")
+    return ne.gt(Fe(t.Version), Fe(n)) ? t.Version : null;
   if (n === "*" || n.includes("||")) return null;
   let a = [];
   e === "pypi" ? a = Object.keys(t.releases).filter((u) => ne.valid(u)) : e === "npm" && (a = Object.keys(t.versions).filter((u) => ne.valid(u)));
-  const l = Fc(t, a, { range: n, semvers: o, usePre: s, useRel: i, useGreatest: r });
+  const l = Gc(t, a, { range: n, semvers: o, usePre: s, useRel: i, useGreatest: r });
   if (!l) return null;
   if (r)
     return l;
   {
     let u = "", c = "";
     e === "pypi" ? (c = t.info.version, u = We(t.info.version)) : u = t["dist-tags"].latest;
-    const p = We(n), g = $s(n), f = Kt(l), S = Kt(u), v = ne.gt(l, p);
+    const p = We(n), g = ms(n), f = Kt(l), S = Kt(u), v = ne.gt(l, p);
     if (!i && s || g && f || i && !v && g && !f || g && !f && v)
       return l;
     if (g && !f && !v)
@@ -4386,27 +4396,27 @@ function jc(t, { mode: e, range: n, useGreatest: r, useRel: i, usePre: s, semver
     return w && w !== "prerelease" && !o.has(w.replace(/^pre/, "")) || i && Kt(u) ? l : ne.lt(u, p) && !S ? Or === !0 || Se(t.name, Or) ? u : null : c || u;
   }
 }
-function Es(t) {
-  const e = {}, n = Me.UPDATES_GITHUB_API_TOKEN || Me.GITHUB_API_TOKEN || Me.GH_TOKEN || Me.HOMEBREW_GITHUB_API_TOKEN;
+function $s(t) {
+  const e = {}, n = Pe.UPDATES_GITHUB_API_TOKEN || Pe.GITHUB_API_TOKEN || Pe.GH_TOKEN || Pe.HOMEBREW_GITHUB_API_TOKEN;
   return n && (e.headers = { Authorization: `Bearer ${n}` }), bt(t, e);
 }
-async function Gc(t, e) {
-  const n = `${ds}/repos/${t}/${e}/commits`, r = await Es(n);
+async function Mc(t, e) {
+  const n = `${ps}/repos/${t}/${e}/commits`, r = await $s(n);
   if (!r?.ok) return { hash: "", commit: {} };
   const i = await r.json(), { sha: s, commit: o } = i[0];
   return { hash: s, commit: o };
 }
-async function Uc(t, e) {
-  const n = await Es(`${ds}/repos/${t}/${e}/git/refs/tags`);
+async function Bc(t, e) {
+  const n = await $s(`${ps}/repos/${t}/${e}/git/refs/tags`);
   return n?.ok ? (await n.json()).map((s) => s.ref.replace(/^refs\/tags\//, "")) : [];
 }
-function Mc(t, e, n) {
-  const r = nt(e);
+function zc(t, e, n) {
+  const r = Fe(e);
   if (ne.valid(r))
     if (n) {
-      let i = e, s = nt(e);
+      let i = e, s = Fe(e);
       for (const o of t) {
-        const a = nt(o);
+        const a = Fe(o);
         ne.valid(a) && (!i || ne.gt(a, s)) && (i = o, s = a);
       }
       if (ne.neq(r, s))
@@ -4414,17 +4424,17 @@ function Mc(t, e, n) {
     } else {
       const i = t.at(-1);
       if (!i) return;
-      const s = nt(i);
+      const s = Fe(i);
       if (!ne.valid(s)) return;
       if (ne.neq(r, s))
         return i;
     }
 }
-async function Bc(t, e, n) {
-  const r = e.old.replace(yc, ""), [i, s, o, a] = wc.exec(r) || [];
+async function kc(t, e, n) {
+  const r = e.old.replace(Ec, ""), [i, s, o, a] = yc.exec(r) || [];
   if (!(!s || !o || !a))
     if (Jt.test(a)) {
-      const { hash: l, commit: u } = await Gc(s, o);
+      const { hash: l, commit: u } = await Mc(s, o);
       if (!l) return;
       const c = u?.committer?.date ?? u?.author?.date, p = l.substring(0, a.length);
       if (a !== p) {
@@ -4432,12 +4442,15 @@ async function Bc(t, e, n) {
         return { key: t, newRange: g, user: s, repo: o, oldRef: a, newRef: p, newDate: c };
       }
     } else {
-      const l = await Uc(s, o), u = Mc(l, a, n);
+      const l = await Bc(s, o), u = zc(l, a, n);
       if (u)
         return { key: t, newRange: u, user: s, repo: o, oldRef: a, newRef: u };
     }
 }
-function zc(t) {
+function Vc(t) {
+  return t.replace(/-.*/, "");
+}
+function Wc(t) {
   const e = t.match(br);
   return e?.length !== 1 ? t : t.replace(br, We(e[0]));
 }
@@ -4450,14 +4463,14 @@ function Lr(t) {
 async function Nr(t = []) {
   return [...(await import("node:tls")).rootCertificates, ...t];
 }
-function nn(t, e) {
+function tn(t, e) {
   return e && typeof t == "string" ? /\/.+\//.test(t) ? new RegExp(t.slice(1, -1)) : Rr.makeRe(t) : t instanceof RegExp ? t : Rr.makeRe(t);
 }
-function Ye(t) {
+function Ze(t) {
   if (t instanceof Set) {
     const e = /* @__PURE__ */ new Set();
     for (const n of t)
-      e.add(nn(n, !0));
+      e.add(tn(n, !0));
     return e;
   }
   return t;
@@ -4465,9 +4478,9 @@ function Ye(t) {
 function Dr(t, e) {
   const n = /* @__PURE__ */ new Set();
   for (const r of t || [])
-    n.add(nn(r, !0));
+    n.add(tn(r, !0));
   for (const r of e || [])
-    n.add(nn(r, !1));
+    n.add(tn(r, !1));
   return n;
 }
 function Pr(t, e, n, r) {
@@ -4479,7 +4492,7 @@ function Pr(t, e, n, r) {
     if (i.test(t)) return !0;
   return !n.size;
 }
-function kc(t) {
+function Xc(t) {
   const e = /* @__PURE__ */ new Set(), n = /* @__PURE__ */ new Set();
   if (t)
     for (const r of t) {
@@ -4507,16 +4520,16 @@ function kc(t) {
     }
   else
     for (const r of Object.keys(en)) {
-      const i = gs(r, bs());
+      const i = ds(r, Rs());
       i && e.add(rt(i));
     }
   return [e, n];
 }
-async function Wc() {
+async function qc() {
   for (const w of [process.stdout, process.stderr])
     w?._handle?.setBlocking?.(!0);
   const t = 96, e = typeof B.sockets == "number" ? B.sockets : t, { help: n, version: r, file: i, types: s, update: o } = B;
-  n && (Rs.write(`usage: updates [options]
+  n && (As.write(`usage: updates [options]
 
   Options:
     -u, --update                       Update versions and write package file
@@ -4548,13 +4561,13 @@ async function Wc() {
     $ updates -e '/^react-(dom)?/'
     $ updates -f package.json
     $ updates -f pyproject.toml
-`), Rn(0)), r && (console.info(ps), Rn(0));
+`), Rn(0)), r && (console.info(hs), Rn(0));
   const a = {}, l = {}, u = {}, c = {};
   let p = 0;
-  const [g, f] = kc(Re(i));
+  const [g, f] = Xc(Re(i));
   for (const w of g) {
-    const y = Mr(rt(w)), I = st(w), A = en[I];
-    if (!Ac.has(A) && !f.has(w)) continue;
+    const y = sn(rt(w)), I = st(w), A = en[I];
+    if (!vc.has(A) && !f.has(w)) continue;
     c[A] = w, a[A] || (a[A] = {});
     let b = {};
     try {
@@ -4572,7 +4585,7 @@ async function Wc() {
     }
     let L = [], j = [];
     B.include && B.include !== !0 && (L = (Array.isArray(B.include) ? B.include : [B.include]).flatMap(($) => $.split(","))), B.exclude && B.exclude !== !0 && (j = (Array.isArray(B.exclude) ? B.exclude : [B.exclude]).flatMap(($) => $.split(",")));
-    const P = Dr(L, b?.include), H = Dr(j, b?.exclude), D = {}, m = Zs("npm", { registry: "https://registry.npmjs.org" }), _ = { npmrc: m, recursive: !0 };
+    const P = Dr(L, b?.include), H = Dr(j, b?.exclude), D = {}, m = Ys("npm", { registry: "https://registry.npmjs.org" }), _ = { npmrc: m, recursive: !0 };
     if (A === "npm" && (m["strict-ssl"] === !1 && (D.rejectUnauthorized = !1), m?.cafile && (D.ca = await Nr(Lr(bn(m.cafile, "utf8")))), m?.ca)) {
       const $ = Array.isArray(m.ca) ? m.ca : [m.ca];
       D.ca = await Nr($.flatMap((R) => Lr(R)));
@@ -4595,7 +4608,7 @@ async function Wc() {
     ]);
     let T = {};
     if (A === "go")
-      u[A] = xs("go", [
+      u[A] = Ts("go", [
         "list",
         "-m",
         "-f",
@@ -4612,10 +4625,10 @@ async function Wc() {
       if (A === "npm")
         T = JSON.parse(u[A]);
       else if (A === "pypi")
-        T = (await Promise.resolve().then(() => iu)).parse(u[A]);
+        T = (await Promise.resolve().then(() => lu)).parse(u[A]);
       else {
         T.deps = {};
-        for (const $ of xc(u[A])) {
+        for (const $ of Ic(u[A])) {
           const [R, x] = $.split("@");
           x && (T.deps[R] = x);
         }
@@ -4625,59 +4638,66 @@ async function Wc() {
     }
     for (const $ of E) {
       let R;
-      A === "npm" || A === "go" ? R = T[$] || {} : R = Ol(T, $) || {};
+      A === "npm" || A === "go" ? R = T[$] || {} : R = _l(T, $) || {};
       for (const [x, N] of Object.entries(R))
         A !== "go" && ne.validRange(N) && Pr(x, A, P, H) ? a[A][`${$}${de}${x}`] = {
-          old: zc(N),
+          old: Wc(N),
           oldOriginal: N
         } : A === "npm" && Pr(x, A, P, H) ? l[`${$}${de}${x}`] = {
           old: N
         } : A === "go" && (a[A][`${$}${de}${x}`] = {
-          old: N,
+          old: Vc(N),
           oldOriginal: N
         });
     }
     if (p += Object.keys(a[A]).length + Object.keys(l).length, !p) continue;
     let h;
-    A === "npm" && (h = Ke(B.registry || b.registry || m.registry));
+    A === "npm" && (h = Ye(B.registry || b.registry || m.registry));
     const d = await mr(Object.keys(a[A]).map(($) => async () => {
       const [R, x] = $.split(de);
-      return A === "npm" ? Oc(x, R, h, D, _, m) : A === "pypi" ? Tc(x, R, D) : [await ms(x, "latest", D, bc), "deps", null, x];
+      if (A === "npm")
+        return Tc(x, R, h, D, _, m);
+      if (A === "pypi")
+        return xc(x, R, D);
+      {
+        const N = Array.from(bc);
+        return [await gs(x, "latest", D, N), "deps", null, x];
+      }
     }), { concurrency: e });
     for (const [$, R, x, N] of d) {
       if ($?.error) throw new Error($.error);
-      const F = typeof De == "boolean" ? De : Se($.name, De), X = typeof Xt == "boolean" ? Xt : Se($.name, Xt), V = typeof qt == "boolean" ? qt : Se($.name, qt);
+      const F = typeof De == "boolean" ? De : Se($.name, De), X = typeof Xt == "boolean" ? Xt : Se($.name, Xt), W = typeof qt == "boolean" ? qt : Se($.name, qt);
       let J;
       Sr === !0 || Se($.name, Sr) ? J = /* @__PURE__ */ new Set(["patch"]) : _r === !0 || Se($.name, _r) ? J = /* @__PURE__ */ new Set(["patch", "minor"]) : J = /* @__PURE__ */ new Set(["patch", "minor", "major"]);
-      const Z = `${R}${de}${N}`, G = a[A][Z].old, ye = a[A][Z].oldOriginal, ie = jc($, {
+      const Z = `${R}${de}${N}`, G = a[A][Z].old, ye = a[A][Z].oldOriginal, ie = Uc($, {
         usePre: X,
-        useRel: V,
+        useRel: W,
         useGreatest: F,
         semvers: J,
         range: G,
         mode: A
       });
       let C = "";
-      if (A === "go" && ie ? C = ie : ie && (C = Hc(G, ie, ye)), !ie || ye && ye === C)
+      if (A === "go" && ie ? C = ie : ie && (C = jc(G, ie, ye)), !ie || ye && ye === C)
         delete a[A][Z];
       else {
         a[A][Z].new = C, A === "npm" ? a[A][Z].info = Tr($?.versions?.[ie], x, $.name) : A === "pypi" ? a[A][Z].info = Tr($, x, $.info.name) : a[A][Z].info = $?.Origin?.URL ?? `https://${N}`;
-        let W = "";
-        A === "npm" && $.time?.[ie] ? W = $.time[ie] : A === "pypi" && $.releases?.[ie]?.[0]?.upload_time_iso_8601 ? W = $.releases[ie][0].upload_time_iso_8601 : A === "go" && $.Time && (W = $.Time), W && (a[A][Z].age = fr(W, { noAffix: !0 }));
+        let V = "";
+        A === "npm" && $.time?.[ie] ? V = $.time[ie] : A === "pypi" && $.releases?.[ie]?.[0]?.upload_time_iso_8601 ? V = $.releases[ie][0].upload_time_iso_8601 : A === "go" && $.Time && (V = $.Time), V && (a[A][Z].age = fr(V, { noAffix: !0 }));
       }
     }
     if (Object.keys(l).length) {
       const $ = await mr(Object.entries(l).map(([R, x]) => () => {
         const N = R.split(de)[1], F = typeof De == "boolean" ? De : Se(N, De);
-        return Bc(R, x, F);
+        return kc(R, x, F);
       }), { concurrency: e });
       for (const R of ($ || []).filter(Boolean)) {
-        const { key: x, newRange: N, user: F, repo: X, oldRef: V, newRef: J, newDate: Z } = R;
+        const { key: x, newRange: N, user: F, repo: X, oldRef: W, newRef: J, newDate: Z } = R;
         a[A][x] = {
           // @ts-expect-error
           old: l[x].old,
           new: N,
-          oldPrint: Jt.test(V) ? V.substring(0, 7) : V,
+          oldPrint: Jt.test(W) ? W.substring(0, 7) : W,
           newPrint: Jt.test(J) ? J.substring(0, 7) : J,
           info: `https://github.com/${F}/${X}`,
           ...Z ? { age: fr(Z, { noAffix: !0 }) } : {}
@@ -4685,18 +4705,18 @@ async function Wc() {
       }
     }
   }
-  p === 0 && (xr("No dependencies found, nothing to do."), ke());
+  p === 0 && (xr("No dependencies found, nothing to do."), Ve());
   let S = 0;
   for (const w of Object.keys(a))
     S += Object.keys(a[w]).length;
-  S || (xr("All dependencies are up to date."), ke());
-  const v = Ic(a);
+  S || (xr("All dependencies are up to date."), Ve());
+  const v = Cc(a);
   if (o) {
     for (const w of Object.keys(a))
       if (Object.keys(a[w]).length) {
         try {
-          const y = w === "npm" ? Dc : Pc;
-          await Cc(c[w], y(u[w], a[w]));
+          const y = w === "npm" ? Hc : Fc;
+          await Lc(c[w], y(u[w], a[w]));
         } catch (y) {
           throw new Error(`Error writing ${st(c[w])}: ${y.message}`);
         }
@@ -4705,12 +4725,12 @@ async function Wc() {
   }
   process.exit(v);
 }
-Wc().catch(ke).then(ke);
-function Vc(t, e) {
+qc().catch(Ve).then(Ve);
+function Kc(t, e) {
   let n = t.slice(0, e).split(/\r\n|\n|\r/g);
   return [n.length, n.pop().length + 1];
 }
-function Xc(t, e, n) {
+function Yc(t, e, n) {
   let r = t.split(/\r\n|\n|\r/g), i = "", s = (Math.log10(e + 1) | 0) + 1;
   for (let o = e - 1; o <= e + 1; o++) {
     let a = r[o - 1];
@@ -4725,7 +4745,7 @@ class M extends Error {
   column;
   codeblock;
   constructor(e, n) {
-    const [r, i] = Vc(n.toml, n.ptr), s = Xc(n.toml, r, i);
+    const [r, i] = Kc(n.toml, n.ptr), s = Yc(n.toml, r, i);
     super(`Invalid TOML document: ${e}
 
 ${s}`, n), this.line = r, this.column = i, this.codeblock = s;
@@ -4784,7 +4804,7 @@ function Hr(t, e, n, r, i = !1) {
     ptr: e
   });
 }
-function ys(t, e) {
+function Es(t, e) {
   let n = t[e], r = n === t[e + 1] && t[e + 1] === t[e + 2] ? t.slice(e, e + 3) : n;
   e += r.length - 1;
   do
@@ -4792,7 +4812,7 @@ function ys(t, e) {
   while (e > -1 && n !== "'" && t[e - 1] === "\\" && t[e - 2] !== "\\");
   return e > -1 && (e += r.length, r.length > 1 && (t[e] === n && e++, t[e] === n && e++)), e;
 }
-let qc = /^(\d{4}-\d{2}-\d{2})?[T ]?(?:(\d{2}):\d{2}:\d{2}(?:\.\d+)?)?(Z|[-+]\d{2}:\d{2})?$/i;
+let Zc = /^(\d{4}-\d{2}-\d{2})?[T ]?(?:(\d{2}):\d{2}:\d{2}(?:\.\d+)?)?(Z|[-+]\d{2}:\d{2})?$/i;
 class Te extends Date {
   #n = !1;
   #i = !1;
@@ -4800,7 +4820,7 @@ class Te extends Date {
   constructor(e) {
     let n = !0, r = !0, i = "Z";
     if (typeof e == "string") {
-      let s = e.match(qc);
+      let s = e.match(Zc);
       s ? (s[1] || (n = !1, e = `0000-01-01T${e}`), r = !!s[2], s[2] && +s[2] > 23 ? e = "" : (i = s[3] || null, e = e.toUpperCase(), !i && r && (e += "Z"))) : e = "";
     }
     super(e), isNaN(this.getTime()) || (this.#n = n, this.#i = r, this.#t = i);
@@ -4850,7 +4870,7 @@ class Te extends Date {
     return n.#n = !1, n.#t = null, n;
   }
 }
-let Kc = /^((0x[0-9a-fA-F](_?[0-9a-fA-F])*)|(([+-]|0[ob])?\d(_?\d)*))$/, Yc = /^[+-]?\d(_?\d)*(\.\d(_?\d)*)?([eE][+-]?\d(_?\d)*)?$/, Zc = /^[+-]?0[0-9_]/, Qc = /^[0-9a-f]{4,8}$/i, Fr = {
+let Qc = /^((0x[0-9a-fA-F](_?[0-9a-fA-F])*)|(([+-]|0[ob])?\d(_?\d)*))$/, Jc = /^[+-]?\d(_?\d)*(\.\d(_?\d)*)?([eE][+-]?\d(_?\d)*)?$/, eu = /^[+-]?0[0-9_]/, tu = /^[0-9a-f]{4,8}$/i, Fr = {
   b: "\b",
   t: "	",
   n: `
@@ -4860,7 +4880,7 @@ let Kc = /^((0x[0-9a-fA-F](_?[0-9a-fA-F])*)|(([+-]|0[ob])?\d(_?\d)*))$/, Yc = /^
   '"': '"',
   "\\": "\\"
 };
-function ws(t, e = 0, n = t.length) {
+function ys(t, e = 0, n = t.length) {
   let r = t[e] === "'", i = t[e++] === t[e] && t[e] === t[e + 1];
   i && (n -= 2, t[e += 2] === "\r" && e++, t[e] === `
 ` && e++);
@@ -4883,7 +4903,7 @@ function ws(t, e = 0, n = t.length) {
     if (o) {
       if (o = !1, u === "u" || u === "U") {
         let c = t.slice(e, e += u === "u" ? 4 : 8);
-        if (!Qc.test(c))
+        if (!tu.test(c))
           throw new M("invalid unicode escape", {
             toml: t,
             ptr: s
@@ -4917,7 +4937,7 @@ function ws(t, e = 0, n = t.length) {
   }
   return a + t.slice(l, n - 1);
 }
-function Jc(t, e, n) {
+function nu(t, e, n) {
   if (t === "true")
     return !0;
   if (t === "false")
@@ -4931,8 +4951,8 @@ function Jc(t, e, n) {
   if (t === "-0")
     return 0;
   let r;
-  if ((r = Kc.test(t)) || Yc.test(t)) {
-    if (Zc.test(t))
+  if ((r = Qc.test(t)) || Jc.test(t)) {
+    if (eu.test(t))
       throw new M("leading zeroes are not allowed", {
         toml: e,
         ptr: n
@@ -4958,7 +4978,7 @@ function Jc(t, e, n) {
     });
   return i;
 }
-function eu(t, e, n, r) {
+function ru(t, e, n, r) {
   let i = t.slice(e, n), s = i.indexOf("#");
   s > -1 && (vn(t, s), i = i.slice(0, s));
   let o = i.trimEnd();
@@ -4976,7 +4996,7 @@ function eu(t, e, n, r) {
 function An(t, e, n) {
   let r = t[e];
   if (r === "[" || r === "{") {
-    let [o, a] = r === "[" ? ru(t, e) : nu(t, e), l = Hr(t, a, ",", n);
+    let [o, a] = r === "[" ? ou(t, e) : iu(t, e), l = Hr(t, a, ",", n);
     if (n === "}") {
       let u = pt(t, a, l);
       if (u > -1)
@@ -4989,8 +5009,8 @@ function An(t, e, n) {
   }
   let i;
   if (r === '"' || r === "'") {
-    i = ys(t, e);
-    let o = ws(t, e, i);
+    i = Es(t, e);
+    let o = ys(t, e, i);
     if (n) {
       if (i = Ee(t, i, n !== "]"), t[i] && t[i] !== "," && t[i] !== n && t[i] !== `
 ` && t[i] !== "\r")
@@ -5003,19 +5023,19 @@ function An(t, e, n) {
     return [o, i];
   }
   i = Hr(t, e, ",", n);
-  let s = eu(t, e, i - +(t[i - 1] === ","), n === "]");
+  let s = ru(t, e, i - +(t[i - 1] === ","), n === "]");
   if (!s[0])
     throw new M("incomplete key-value declaration: no value specified", {
       toml: t,
       ptr: e
     });
   return n && s[1] > -1 && (i = Ee(t, e + s[1]), i += +(t[i] === ",")), [
-    Jc(s[0], t, e),
+    nu(s[0], t, e),
     i
   ];
 }
-let tu = /^[a-zA-Z0-9-_]+[ \t]*$/;
-function rn(t, e, n = "=") {
+let su = /^[a-zA-Z0-9-_]+[ \t]*$/;
+function nn(t, e, n = "=") {
   let r = e - 1, i = [], s = t.indexOf(n, e);
   if (s < 0)
     throw new M("incomplete key-value: cannot find end of key", {
@@ -5031,7 +5051,7 @@ function rn(t, e, n = "=") {
             toml: t,
             ptr: e
           });
-        let a = ys(t, e);
+        let a = Es(t, e);
         if (a < 0)
           throw new M("unfinished string encountered", {
             toml: t,
@@ -5054,11 +5074,11 @@ function rn(t, e, n = "=") {
             toml: t,
             ptr: e
           });
-        i.push(ws(t, e, a));
+        i.push(ys(t, e, a));
       } else {
         r = t.indexOf(".", e);
         let a = t.slice(e, r < 0 || r > s ? s : r);
-        if (!tu.test(a))
+        if (!su.test(a))
           throw new M("only letter, numbers, dashes and underscores are allowed in keys", {
             toml: t,
             ptr: e
@@ -5068,7 +5088,7 @@ function rn(t, e, n = "=") {
   } while (r + 1 && r < s);
   return [i, Ee(t, s + 1, !0, !0)];
 }
-function nu(t, e) {
+function iu(t, e) {
   let n = {}, r = /* @__PURE__ */ new Set(), i, s = 0;
   for (e++; (i = t[e++]) !== "}" && i; ) {
     if (i === `
@@ -5088,7 +5108,7 @@ function nu(t, e) {
         ptr: e - 1
       });
     if (i !== " " && i !== "	") {
-      let o, a = n, l = !1, [u, c] = rn(t, e - 1);
+      let o, a = n, l = !1, [u, c] = nn(t, e - 1);
       for (let f = 0; f < u.length; f++) {
         if (f && (a = l ? a[o] : a[o] = {}), o = u[f], (l = Object.hasOwn(a, o)) && (typeof a[o] != "object" || r.has(a[o])))
           throw new M("trying to redefine an already defined value", {
@@ -5118,7 +5138,7 @@ function nu(t, e) {
     });
   return [n, e];
 }
-function ru(t, e) {
+function ou(t, e) {
   let n = [], r;
   for (e++; (r = t[e++]) !== "]" && r; ) {
     if (r === ",")
@@ -5169,11 +5189,11 @@ function jr(t, e, n, r) {
     return null;
   return [o, i, l.c];
 }
-function su(t) {
+function au(t) {
   let e = {}, n = {}, r = e, i = n;
   for (let s = Ee(t, 0); s < t.length; ) {
     if (t[s] === "[") {
-      let o = t[++s] === "[", a = rn(t, s += +o, "]");
+      let o = t[++s] === "[", a = nn(t, s += +o, "]");
       if (o) {
         if (t[a[1] - 1] !== "]")
           throw new M("expected end of table declaration", {
@@ -5196,7 +5216,7 @@ function su(t) {
         });
       i = l[2], r = l[1], s = a[1];
     } else {
-      let o = rn(t, s), a = jr(
+      let o = nn(t, s), a = jr(
         o[0],
         r,
         i,
@@ -5221,9 +5241,9 @@ function su(t) {
   }
   return e;
 }
-const iu = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const lu = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   TomlDate: Te,
   TomlError: M,
-  parse: su
+  parse: au
 }, Symbol.toStringTag, { value: "Module" }));