@platforma-sdk/block-tools 2.5.53 → 2.5.55

package/dist/{config-DrI3vxIZ.mjs → config-7hVPHpfZ.mjs}

@@ -17,31 +17,31 @@ import { S3 as $s, paginateListObjectsV2 as Rs } from "@aws-sdk/client-s3";
 import * as K from "node:fs";
 function ws(t) {
   return L.string().transform((e, r) => {
-    const n = Vr(t, e);
-    return n === void 0 ? (r.addIssue({
+    const s = Vr(t, e);
+    return s === void 0 ? (r.addIssue({
       code: L.ZodIssueCode.custom,
       message: `Can't resolve ${e} against ${t}`
     }), L.NEVER) : {
       type: "absolute-file",
-      file: n
+      file: s
     };
   });
 }
 function Ss(t, ...e) {
-  return L.string().transform((r, n) => {
+  return L.string().transform((r, s) => {
     const a = r.endsWith("/") ? r : `${r}/`;
-    for (const l of e) {
-      const c = Vr(t, a + l);
+    for (const u of e) {
+      const c = Vr(t, a + u);
       if (c !== void 0) {
-        if (!c.endsWith(l))
-          throw new Error(`Unexpected resolve result ${c} with index file ${l}`);
+        if (!c.endsWith(u))
+          throw new Error(`Unexpected resolve result ${c} with index file ${u}`);
         return {
           type: "absolute-folder",
-          folder: c.slice(0, c.length - l.length)
+          folder: c.slice(0, c.length - u.length)
         };
       }
     }
-    return n.addIssue({
+    return s.addIssue({
       code: L.ZodIssueCode.custom,
       message: `Can't resolve ${r} folder against ${t}, no index file found (${e.join(", ")})`
     }), L.NEVER;
@@ -86,20 +86,20 @@ function Is() {
 function wt(t, e) {
   return async (r) => {
     if (r.type === "absolute-file") {
-      const n = B.basename(r.file), a = B.resolve(t, n);
-      return e == null || e.push(n), await V.cp(r.file, a), { type: "relative", path: n };
+      const s = B.basename(r.file), a = B.resolve(t, s);
+      return e == null || e.push(s), await V.cp(r.file, a), { type: "relative", path: s };
     } else return r;
   };
 }
 function Os(t, e, r) {
   if (!e.endsWith(".tgz")) throw new Error(`Unexpected tgz file name: ${e}`);
-  return async (n) => {
+  return async (s) => {
     const a = B.resolve(t, e);
     return await ms.create(
       {
         gzip: !0,
         file: a,
-        cwd: n.folder
+        cwd: s.folder
       },
       ["."]
     ), r == null || r.push(e), { type: "relative", path: e };
@@ -223,18 +223,18 @@ async function St(t) {
 }
 async function Wn(t, e) {
   await V.mkdir(e, { recursive: !0 });
-  const r = [], n = await Ts(e, r).parseAsync(t), a = await Promise.all(
+  const r = [], s = await Ts(e, r).parseAsync(t), a = await Promise.all(
     r.map(async (c) => {
-      const d = await V.readFile(B.resolve(e, c)), i = await St(d);
-      return { name: c, size: d.length, sha256: i };
+      const h = await V.readFile(B.resolve(e, c)), o = await St(h);
+      return { name: c, size: h.length, sha256: o };
     })
-  ), l = xr.parse({
+  ), u = xr.parse({
     schema: "v2",
-    description: n,
+    description: s,
     files: a,
     timestamp: Date.now()
   });
-  return await V.writeFile(B.resolve(e, ps), JSON.stringify(l)), l;
+  return await V.writeFile(B.resolve(e, ps), JSON.stringify(u)), u;
 }
 const yt = "block", As = /(?:@[a-zA-Z0-9-.]+\/)?(?<organization>[a-zA-Z0-9-]+)\.(?<name>[a-zA-Z0-9-]+)/;
 function Wr(t) {
@@ -243,44 +243,44 @@ function Wr(t) {
     throw new Error(
       `Malformed package name (${t}), can't infer organization and block pack name.`
     );
-  const { name: r, organization: n } = e.groups;
-  return { name: r, organization: n };
+  const { name: r, organization: s } = e.groups;
+  return { name: r, organization: s };
 }
 async function Hn(t, e) {
   const r = B.resolve(t, "package.json");
   try {
-    const n = await Ct(
+    const s = await Ct(
       r,
-      (d) => JSON.parse(d.toString("utf-8"))
+      (h) => JSON.parse(h.toString("utf-8"))
     );
-    if (n === void 0) return;
-    const a = n[yt];
+    if (s === void 0) return;
+    const a = s[yt];
     if (a === void 0) return;
-    const l = {
+    const u = {
       ...Ur.parse(a),
       id: {
         ...Wr(
-          Mr(n.name, `"name" not found in ${r}`)
+          Mr(s.name, `"name" not found in ${r}`)
         ),
-        version: kt.parse(n.version)
+        version: kt.parse(s.version)
       }
-    }, c = await Jr(t).safeParseAsync(l);
+    }, c = await Jr(t).safeParseAsync(u);
     if (c.success) return c.data;
     e == null || e.warn(c.error);
     return;
-  } catch (n) {
-    e == null || e.warn(n);
+  } catch (s) {
+    e == null || e.warn(s);
     return;
   }
 }
 async function Fs(t) {
-  const e = B.resolve(t, "package.json"), r = JSON.parse(await V.readFile(e, { encoding: "utf-8" })), n = r[yt];
-  if (n === void 0)
+  const e = B.resolve(t, "package.json"), r = JSON.parse(await V.readFile(e, { encoding: "utf-8" })), s = r[yt];
+  if (s === void 0)
     throw new Error(
       `Block description (field ${yt}) not found in ${e}.`
     );
   return {
-    ...Ur.parse(n),
+    ...Ur.parse(s),
     id: {
       ...Wr(
         Mr(r.name, `"name" not found in ${e}`)
@@ -301,10 +301,10 @@ function pe() {
   if (Vt) return Ie;
   Vt = 1;
   const t = "2.0.0", e = 256, r = Number.MAX_SAFE_INTEGER || /* istanbul ignore next */
-  9007199254740991, n = 16, a = e - 6;
+  9007199254740991, s = 16, a = e - 6;
   return Ie = {
     MAX_LENGTH: e,
-    MAX_SAFE_COMPONENT_LENGTH: n,
+    MAX_SAFE_COMPONENT_LENGTH: s,
     MAX_SAFE_BUILD_LENGTH: a,
     MAX_SAFE_INTEGER: r,
     RELEASE_TYPES: [
@@ -331,25 +331,25 @@ function ee() {
   return zt || (zt = 1, function(t, e) {
     const {
       MAX_SAFE_COMPONENT_LENGTH: r,
-      MAX_SAFE_BUILD_LENGTH: n,
+      MAX_SAFE_BUILD_LENGTH: s,
       MAX_LENGTH: a
-    } = pe(), l = de();
+    } = pe(), u = de();
     e = t.exports = {};
-    const c = e.re = [], d = e.safeRe = [], i = e.src = [], f = e.safeSrc = [], s = e.t = {};
-    let o = 0;
-    const u = "[a-zA-Z0-9-]", h = [
+    const c = e.re = [], h = e.safeRe = [], o = e.src = [], i = e.safeSrc = [], n = e.t = {};
+    let l = 0;
+    const f = "[a-zA-Z0-9-]", d = [
       ["\\s", 1],
       ["\\d", a],
-      [u, n]
-    ], m = (v) => {
-      for (const [$, N] of h)
-        v = v.split(`${$}*`).join(`${$}{0,${N}}`).split(`${$}+`).join(`${$}{1,${N}}`);
-      return v;
-    }, p = (v, $, N) => {
-      const I = m($), F = o++;
-      l(v, F, $), s[v] = F, i[F] = $, f[F] = I, c[F] = new RegExp($, N ? "g" : void 0), d[F] = new RegExp(I, N ? "g" : void 0);
+      [f, s]
+    ], w = (E) => {
+      for (const [v, N] of d)
+        E = E.split(`${v}*`).join(`${v}{0,${N}}`).split(`${v}+`).join(`${v}{1,${N}}`);
+      return E;
+    }, p = (E, v, N) => {
+      const I = w(v), F = l++;
+      u(E, F, v), n[E] = F, o[F] = v, i[F] = I, c[F] = new RegExp(v, N ? "g" : void 0), h[F] = new RegExp(I, N ? "g" : void 0);
     };
-    p("NUMERICIDENTIFIER", "0|[1-9]\\d*"), p("NUMERICIDENTIFIERLOOSE", "\\d+"), p("NONNUMERICIDENTIFIER", `\\d*[a-zA-Z-]${u}*`), p("MAINVERSION", `(${i[s.NUMERICIDENTIFIER]})\\.(${i[s.NUMERICIDENTIFIER]})\\.(${i[s.NUMERICIDENTIFIER]})`), p("MAINVERSIONLOOSE", `(${i[s.NUMERICIDENTIFIERLOOSE]})\\.(${i[s.NUMERICIDENTIFIERLOOSE]})\\.(${i[s.NUMERICIDENTIFIERLOOSE]})`), p("PRERELEASEIDENTIFIER", `(?:${i[s.NUMERICIDENTIFIER]}|${i[s.NONNUMERICIDENTIFIER]})`), p("PRERELEASEIDENTIFIERLOOSE", `(?:${i[s.NUMERICIDENTIFIERLOOSE]}|${i[s.NONNUMERICIDENTIFIER]})`), p("PRERELEASE", `(?:-(${i[s.PRERELEASEIDENTIFIER]}(?:\\.${i[s.PRERELEASEIDENTIFIER]})*))`), p("PRERELEASELOOSE", `(?:-?(${i[s.PRERELEASEIDENTIFIERLOOSE]}(?:\\.${i[s.PRERELEASEIDENTIFIERLOOSE]})*))`), p("BUILDIDENTIFIER", `${u}+`), p("BUILD", `(?:\\+(${i[s.BUILDIDENTIFIER]}(?:\\.${i[s.BUILDIDENTIFIER]})*))`), p("FULLPLAIN", `v?${i[s.MAINVERSION]}${i[s.PRERELEASE]}?${i[s.BUILD]}?`), p("FULL", `^${i[s.FULLPLAIN]}$`), p("LOOSEPLAIN", `[v=\\s]*${i[s.MAINVERSIONLOOSE]}${i[s.PRERELEASELOOSE]}?${i[s.BUILD]}?`), p("LOOSE", `^${i[s.LOOSEPLAIN]}$`), p("GTLT", "((?:<|>)?=?)"), p("XRANGEIDENTIFIERLOOSE", `${i[s.NUMERICIDENTIFIERLOOSE]}|x|X|\\*`), p("XRANGEIDENTIFIER", `${i[s.NUMERICIDENTIFIER]}|x|X|\\*`), p("XRANGEPLAIN", `[v=\\s]*(${i[s.XRANGEIDENTIFIER]})(?:\\.(${i[s.XRANGEIDENTIFIER]})(?:\\.(${i[s.XRANGEIDENTIFIER]})(?:${i[s.PRERELEASE]})?${i[s.BUILD]}?)?)?`), p("XRANGEPLAINLOOSE", `[v=\\s]*(${i[s.XRANGEIDENTIFIERLOOSE]})(?:\\.(${i[s.XRANGEIDENTIFIERLOOSE]})(?:\\.(${i[s.XRANGEIDENTIFIERLOOSE]})(?:${i[s.PRERELEASELOOSE]})?${i[s.BUILD]}?)?)?`), p("XRANGE", `^${i[s.GTLT]}\\s*${i[s.XRANGEPLAIN]}$`), p("XRANGELOOSE", `^${i[s.GTLT]}\\s*${i[s.XRANGEPLAINLOOSE]}$`), p("COERCEPLAIN", `(^|[^\\d])(\\d{1,${r}})(?:\\.(\\d{1,${r}}))?(?:\\.(\\d{1,${r}}))?`), p("COERCE", `${i[s.COERCEPLAIN]}(?:$|[^\\d])`), p("COERCEFULL", i[s.COERCEPLAIN] + `(?:${i[s.PRERELEASE]})?(?:${i[s.BUILD]})?(?:$|[^\\d])`), p("COERCERTL", i[s.COERCE], !0), p("COERCERTLFULL", i[s.COERCEFULL], !0), p("LONETILDE", "(?:~>?)"), p("TILDETRIM", `(\\s*)${i[s.LONETILDE]}\\s+`, !0), e.tildeTrimReplace = "$1~", p("TILDE", `^${i[s.LONETILDE]}${i[s.XRANGEPLAIN]}$`), p("TILDELOOSE", `^${i[s.LONETILDE]}${i[s.XRANGEPLAINLOOSE]}$`), p("LONECARET", "(?:\\^)"), p("CARETTRIM", `(\\s*)${i[s.LONECARET]}\\s+`, !0), e.caretTrimReplace = "$1^", p("CARET", `^${i[s.LONECARET]}${i[s.XRANGEPLAIN]}$`), p("CARETLOOSE", `^${i[s.LONECARET]}${i[s.XRANGEPLAINLOOSE]}$`), p("COMPARATORLOOSE", `^${i[s.GTLT]}\\s*(${i[s.LOOSEPLAIN]})$|^$`), p("COMPARATOR", `^${i[s.GTLT]}\\s*(${i[s.FULLPLAIN]})$|^$`), p("COMPARATORTRIM", `(\\s*)${i[s.GTLT]}\\s*(${i[s.LOOSEPLAIN]}|${i[s.XRANGEPLAIN]})`, !0), e.comparatorTrimReplace = "$1$2$3", p("HYPHENRANGE", `^\\s*(${i[s.XRANGEPLAIN]})\\s+-\\s+(${i[s.XRANGEPLAIN]})\\s*$`), p("HYPHENRANGELOOSE", `^\\s*(${i[s.XRANGEPLAINLOOSE]})\\s+-\\s+(${i[s.XRANGEPLAINLOOSE]})\\s*$`), p("STAR", "(<|>)?=?\\s*\\*"), p("GTE0", "^\\s*>=\\s*0\\.0\\.0\\s*$"), p("GTE0PRE", "^\\s*>=\\s*0\\.0\\.0-0\\s*$");
+    p("NUMERICIDENTIFIER", "0|[1-9]\\d*"), p("NUMERICIDENTIFIERLOOSE", "\\d+"), p("NONNUMERICIDENTIFIER", `\\d*[a-zA-Z-]${f}*`), p("MAINVERSION", `(${o[n.NUMERICIDENTIFIER]})\\.(${o[n.NUMERICIDENTIFIER]})\\.(${o[n.NUMERICIDENTIFIER]})`), p("MAINVERSIONLOOSE", `(${o[n.NUMERICIDENTIFIERLOOSE]})\\.(${o[n.NUMERICIDENTIFIERLOOSE]})\\.(${o[n.NUMERICIDENTIFIERLOOSE]})`), p("PRERELEASEIDENTIFIER", `(?:${o[n.NONNUMERICIDENTIFIER]}|${o[n.NUMERICIDENTIFIER]})`), p("PRERELEASEIDENTIFIERLOOSE", `(?:${o[n.NONNUMERICIDENTIFIER]}|${o[n.NUMERICIDENTIFIERLOOSE]})`), p("PRERELEASE", `(?:-(${o[n.PRERELEASEIDENTIFIER]}(?:\\.${o[n.PRERELEASEIDENTIFIER]})*))`), p("PRERELEASELOOSE", `(?:-?(${o[n.PRERELEASEIDENTIFIERLOOSE]}(?:\\.${o[n.PRERELEASEIDENTIFIERLOOSE]})*))`), p("BUILDIDENTIFIER", `${f}+`), p("BUILD", `(?:\\+(${o[n.BUILDIDENTIFIER]}(?:\\.${o[n.BUILDIDENTIFIER]})*))`), p("FULLPLAIN", `v?${o[n.MAINVERSION]}${o[n.PRERELEASE]}?${o[n.BUILD]}?`), p("FULL", `^${o[n.FULLPLAIN]}$`), p("LOOSEPLAIN", `[v=\\s]*${o[n.MAINVERSIONLOOSE]}${o[n.PRERELEASELOOSE]}?${o[n.BUILD]}?`), p("LOOSE", `^${o[n.LOOSEPLAIN]}$`), p("GTLT", "((?:<|>)?=?)"), p("XRANGEIDENTIFIERLOOSE", `${o[n.NUMERICIDENTIFIERLOOSE]}|x|X|\\*`), p("XRANGEIDENTIFIER", `${o[n.NUMERICIDENTIFIER]}|x|X|\\*`), p("XRANGEPLAIN", `[v=\\s]*(${o[n.XRANGEIDENTIFIER]})(?:\\.(${o[n.XRANGEIDENTIFIER]})(?:\\.(${o[n.XRANGEIDENTIFIER]})(?:${o[n.PRERELEASE]})?${o[n.BUILD]}?)?)?`), p("XRANGEPLAINLOOSE", `[v=\\s]*(${o[n.XRANGEIDENTIFIERLOOSE]})(?:\\.(${o[n.XRANGEIDENTIFIERLOOSE]})(?:\\.(${o[n.XRANGEIDENTIFIERLOOSE]})(?:${o[n.PRERELEASELOOSE]})?${o[n.BUILD]}?)?)?`), p("XRANGE", `^${o[n.GTLT]}\\s*${o[n.XRANGEPLAIN]}$`), p("XRANGELOOSE", `^${o[n.GTLT]}\\s*${o[n.XRANGEPLAINLOOSE]}$`), p("COERCEPLAIN", `(^|[^\\d])(\\d{1,${r}})(?:\\.(\\d{1,${r}}))?(?:\\.(\\d{1,${r}}))?`), p("COERCE", `${o[n.COERCEPLAIN]}(?:$|[^\\d])`), p("COERCEFULL", o[n.COERCEPLAIN] + `(?:${o[n.PRERELEASE]})?(?:${o[n.BUILD]})?(?:$|[^\\d])`), p("COERCERTL", o[n.COERCE], !0), p("COERCERTLFULL", o[n.COERCEFULL], !0), p("LONETILDE", "(?:~>?)"), p("TILDETRIM", `(\\s*)${o[n.LONETILDE]}\\s+`, !0), e.tildeTrimReplace = "$1~", p("TILDE", `^${o[n.LONETILDE]}${o[n.XRANGEPLAIN]}$`), p("TILDELOOSE", `^${o[n.LONETILDE]}${o[n.XRANGEPLAINLOOSE]}$`), p("LONECARET", "(?:\\^)"), p("CARETTRIM", `(\\s*)${o[n.LONECARET]}\\s+`, !0), e.caretTrimReplace = "$1^", p("CARET", `^${o[n.LONECARET]}${o[n.XRANGEPLAIN]}$`), p("CARETLOOSE", `^${o[n.LONECARET]}${o[n.XRANGEPLAINLOOSE]}$`), p("COMPARATORLOOSE", `^${o[n.GTLT]}\\s*(${o[n.LOOSEPLAIN]})$|^$`), p("COMPARATOR", `^${o[n.GTLT]}\\s*(${o[n.FULLPLAIN]})$|^$`), p("COMPARATORTRIM", `(\\s*)${o[n.GTLT]}\\s*(${o[n.LOOSEPLAIN]}|${o[n.XRANGEPLAIN]})`, !0), e.comparatorTrimReplace = "$1$2$3", p("HYPHENRANGE", `^\\s*(${o[n.XRANGEPLAIN]})\\s+-\\s+(${o[n.XRANGEPLAIN]})\\s*$`), p("HYPHENRANGELOOSE", `^\\s*(${o[n.XRANGEPLAINLOOSE]})\\s+-\\s+(${o[n.XRANGEPLAINLOOSE]})\\s*$`), p("STAR", "(<|>)?=?\\s*\\*"), p("GTE0", "^\\s*>=\\s*0\\.0\\.0\\s*$"), p("GTE0PRE", "^\\s*>=\\s*0\\.0\\.0-0\\s*$");
   }(se, se.exports)), se.exports;
 }
 var Pe, Xt;
@@ -357,56 +357,56 @@ function Tt() {
   if (Xt) return Pe;
   Xt = 1;
   const t = Object.freeze({ loose: !0 }), e = Object.freeze({});
-  return Pe = (n) => n ? typeof n != "object" ? t : n : e, Pe;
+  return Pe = (s) => s ? typeof s != "object" ? t : s : e, Pe;
 }
 var Ne, Jt;
 function Hr() {
   if (Jt) return Ne;
   Jt = 1;
-  const t = /^[0-9]+$/, e = (n, a) => {
-    const l = t.test(n), c = t.test(a);
-    return l && c && (n = +n, a = +a), n === a ? 0 : l && !c ? -1 : c && !l ? 1 : n < a ? -1 : 1;
+  const t = /^[0-9]+$/, e = (s, a) => {
+    const u = t.test(s), c = t.test(a);
+    return u && c && (s = +s, a = +a), s === a ? 0 : u && !c ? -1 : c && !u ? 1 : s < a ? -1 : 1;
   };
   return Ne = {
     compareIdentifiers: e,
-    rcompareIdentifiers: (n, a) => e(a, n)
+    rcompareIdentifiers: (s, a) => e(a, s)
   }, Ne;
 }
 var ke, Wt;
 function j() {
   if (Wt) return ke;
   Wt = 1;
-  const t = de(), { MAX_LENGTH: e, MAX_SAFE_INTEGER: r } = pe(), { safeRe: n, safeSrc: a, t: l } = ee(), c = Tt(), { compareIdentifiers: d } = Hr();
-  class i {
-    constructor(s, o) {
-      if (o = c(o), s instanceof i) {
-        if (s.loose === !!o.loose && s.includePrerelease === !!o.includePrerelease)
-          return s;
-        s = s.version;
-      } else if (typeof s != "string")
-        throw new TypeError(`Invalid version. Must be a string. Got type "${typeof s}".`);
-      if (s.length > e)
+  const t = de(), { MAX_LENGTH: e, MAX_SAFE_INTEGER: r } = pe(), { safeRe: s, t: a } = ee(), u = Tt(), { compareIdentifiers: c } = Hr();
+  class h {
+    constructor(i, n) {
+      if (n = u(n), i instanceof h) {
+        if (i.loose === !!n.loose && i.includePrerelease === !!n.includePrerelease)
+          return i;
+        i = i.version;
+      } else if (typeof i != "string")
+        throw new TypeError(`Invalid version. Must be a string. Got type "${typeof i}".`);
+      if (i.length > e)
         throw new TypeError(
           `version is longer than ${e} characters`
         );
-      t("SemVer", s, o), this.options = o, this.loose = !!o.loose, this.includePrerelease = !!o.includePrerelease;
-      const u = s.trim().match(o.loose ? n[l.LOOSE] : n[l.FULL]);
-      if (!u)
-        throw new TypeError(`Invalid Version: ${s}`);
-      if (this.raw = s, this.major = +u[1], this.minor = +u[2], this.patch = +u[3], this.major > r || this.major < 0)
+      t("SemVer", i, n), this.options = n, this.loose = !!n.loose, this.includePrerelease = !!n.includePrerelease;
+      const l = i.trim().match(n.loose ? s[a.LOOSE] : s[a.FULL]);
+      if (!l)
+        throw new TypeError(`Invalid Version: ${i}`);
+      if (this.raw = i, this.major = +l[1], this.minor = +l[2], this.patch = +l[3], this.major > r || this.major < 0)
         throw new TypeError("Invalid major version");
       if (this.minor > r || this.minor < 0)
         throw new TypeError("Invalid minor version");
       if (this.patch > r || this.patch < 0)
         throw new TypeError("Invalid patch version");
-      u[4] ? this.prerelease = u[4].split(".").map((h) => {
-        if (/^[0-9]+$/.test(h)) {
-          const m = +h;
-          if (m >= 0 && m < r)
-            return m;
+      l[4] ? this.prerelease = l[4].split(".").map((f) => {
+        if (/^[0-9]+$/.test(f)) {
+          const d = +f;
+          if (d >= 0 && d < r)
+            return d;
         }
-        return h;
-      }) : this.prerelease = [], this.build = u[5] ? u[5].split(".") : [], this.format();
+        return f;
+      }) : this.prerelease = [], this.build = l[5] ? l[5].split(".") : [], this.format();
     }
     format() {
       return this.version = `${this.major}.${this.minor}.${this.patch}`, this.prerelease.length && (this.version += `-${this.prerelease.join(".")}`), this.version;
@@ -414,80 +414,80 @@ function j() {
     toString() {
       return this.version;
     }
-    compare(s) {
-      if (t("SemVer.compare", this.version, this.options, s), !(s instanceof i)) {
-        if (typeof s == "string" && s === this.version)
+    compare(i) {
+      if (t("SemVer.compare", this.version, this.options, i), !(i instanceof h)) {
+        if (typeof i == "string" && i === this.version)
           return 0;
-        s = new i(s, this.options);
+        i = new h(i, this.options);
       }
-      return s.version === this.version ? 0 : this.compareMain(s) || this.comparePre(s);
+      return i.version === this.version ? 0 : this.compareMain(i) || this.comparePre(i);
     }
-    compareMain(s) {
-      return s instanceof i || (s = new i(s, this.options)), d(this.major, s.major) || d(this.minor, s.minor) || d(this.patch, s.patch);
+    compareMain(i) {
+      return i instanceof h || (i = new h(i, this.options)), c(this.major, i.major) || c(this.minor, i.minor) || c(this.patch, i.patch);
     }
-    comparePre(s) {
-      if (s instanceof i || (s = new i(s, this.options)), this.prerelease.length && !s.prerelease.length)
+    comparePre(i) {
+      if (i instanceof h || (i = new h(i, this.options)), this.prerelease.length && !i.prerelease.length)
         return -1;
-      if (!this.prerelease.length && s.prerelease.length)
+      if (!this.prerelease.length && i.prerelease.length)
         return 1;
-      if (!this.prerelease.length && !s.prerelease.length)
+      if (!this.prerelease.length && !i.prerelease.length)
         return 0;
-      let o = 0;
+      let n = 0;
       do {
-        const u = this.prerelease[o], h = s.prerelease[o];
-        if (t("prerelease compare", o, u, h), u === void 0 && h === void 0)
+        const l = this.prerelease[n], f = i.prerelease[n];
+        if (t("prerelease compare", n, l, f), l === void 0 && f === void 0)
           return 0;
-        if (h === void 0)
+        if (f === void 0)
           return 1;
-        if (u === void 0)
+        if (l === void 0)
           return -1;
-        if (u === h)
+        if (l === f)
           continue;
-        return d(u, h);
-      } while (++o);
+        return c(l, f);
+      } while (++n);
     }
-    compareBuild(s) {
-      s instanceof i || (s = new i(s, this.options));
-      let o = 0;
+    compareBuild(i) {
+      i instanceof h || (i = new h(i, this.options));
+      let n = 0;
       do {
-        const u = this.build[o], h = s.build[o];
-        if (t("build compare", o, u, h), u === void 0 && h === void 0)
+        const l = this.build[n], f = i.build[n];
+        if (t("build compare", n, l, f), l === void 0 && f === void 0)
           return 0;
-        if (h === void 0)
+        if (f === void 0)
           return 1;
-        if (u === void 0)
+        if (l === void 0)
           return -1;
-        if (u === h)
+        if (l === f)
           continue;
-        return d(u, h);
-      } while (++o);
+        return c(l, f);
+      } while (++n);
     }
     // preminor will bump the version up to the next minor release, and immediately
     // down to pre-release. premajor and prepatch work the same way.
-    inc(s, o, u) {
-      if (s.startsWith("pre")) {
-        if (!o && u === !1)
+    inc(i, n, l) {
+      if (i.startsWith("pre")) {
+        if (!n && l === !1)
           throw new Error("invalid increment argument: identifier is empty");
-        if (o) {
-          const h = new RegExp(`^${this.options.loose ? a[l.PRERELEASELOOSE] : a[l.PRERELEASE]}$`), m = `-${o}`.match(h);
-          if (!m || m[1] !== o)
-            throw new Error(`invalid identifier: ${o}`);
+        if (n) {
+          const f = `-${n}`.match(this.options.loose ? s[a.PRERELEASELOOSE] : s[a.PRERELEASE]);
+          if (!f || f[1] !== n)
+            throw new Error(`invalid identifier: ${n}`);
         }
       }
-      switch (s) {
+      switch (i) {
         case "premajor":
-          this.prerelease.length = 0, this.patch = 0, this.minor = 0, this.major++, this.inc("pre", o, u);
+          this.prerelease.length = 0, this.patch = 0, this.minor = 0, this.major++, this.inc("pre", n, l);
           break;
         case "preminor":
-          this.prerelease.length = 0, this.patch = 0, this.minor++, this.inc("pre", o, u);
+          this.prerelease.length = 0, this.patch = 0, this.minor++, this.inc("pre", n, l);
           break;
         case "prepatch":
-          this.prerelease.length = 0, this.inc("patch", o, u), this.inc("pre", o, u);
+          this.prerelease.length = 0, this.inc("patch", n, l), this.inc("pre", n, l);
           break;
         // If the input is a non-prerelease version, this acts the same as
         // prepatch.
         case "prerelease":
-          this.prerelease.length === 0 && this.inc("patch", o, u), this.inc("pre", o, u);
+          this.prerelease.length === 0 && this.inc("patch", n, l), this.inc("pre", n, l);
           break;
         case "release":
           if (this.prerelease.length === 0)
@@ -506,47 +506,47 @@ function j() {
         // This probably shouldn't be used publicly.
         // 1.0.0 'pre' would become 1.0.0-0 which is the wrong direction.
         case "pre": {
-          const h = Number(u) ? 1 : 0;
+          const f = Number(l) ? 1 : 0;
           if (this.prerelease.length === 0)
-            this.prerelease = [h];
+            this.prerelease = [f];
           else {
-            let m = this.prerelease.length;
-            for (; --m >= 0; )
-              typeof this.prerelease[m] == "number" && (this.prerelease[m]++, m = -2);
-            if (m === -1) {
-              if (o === this.prerelease.join(".") && u === !1)
+            let d = this.prerelease.length;
+            for (; --d >= 0; )
+              typeof this.prerelease[d] == "number" && (this.prerelease[d]++, d = -2);
+            if (d === -1) {
+              if (n === this.prerelease.join(".") && l === !1)
                 throw new Error("invalid increment argument: identifier already exists");
-              this.prerelease.push(h);
+              this.prerelease.push(f);
             }
           }
-          if (o) {
-            let m = [o, h];
-            u === !1 && (m = [o]), d(this.prerelease[0], o) === 0 ? isNaN(this.prerelease[1]) && (this.prerelease = m) : this.prerelease = m;
+          if (n) {
+            let d = [n, f];
+            l === !1 && (d = [n]), c(this.prerelease[0], n) === 0 ? isNaN(this.prerelease[1]) && (this.prerelease = d) : this.prerelease = d;
           }
           break;
         }
         default:
-          throw new Error(`invalid increment argument: ${s}`);
+          throw new Error(`invalid increment argument: ${i}`);
       }
       return this.raw = this.format(), this.build.length && (this.raw += `+${this.build.join(".")}`), this;
     }
   }
-  return ke = i, ke;
+  return ke = h, ke;
 }
 var Le, Ht;
 function W() {
   if (Ht) return Le;
   Ht = 1;
   const t = j();
-  return Le = (r, n, a = !1) => {
+  return Le = (r, s, a = !1) => {
     if (r instanceof t)
       return r;
     try {
-      return new t(r, n);
-    } catch (l) {
+      return new t(r, s);
+    } catch (u) {
       if (!a)
         return null;
-      throw l;
+      throw u;
     }
   }, Le;
 }
@@ -555,8 +555,8 @@ function qs() {
   if (Yt) return Ce;
   Yt = 1;
   const t = W();
-  return Ce = (r, n) => {
-    const a = t(r, n);
+  return Ce = (r, s) => {
+    const a = t(r, s);
     return a ? a.version : null;
   }, Ce;
 }
@@ -565,8 +565,8 @@ function Ds() {
   if (Kt) return Te;
   Kt = 1;
   const t = W();
-  return Te = (r, n) => {
-    const a = t(r.trim().replace(/^[=v]+/, ""), n);
+  return Te = (r, s) => {
+    const a = t(r.trim().replace(/^[=v]+/, ""), s);
     return a ? a.version : null;
   }, Te;
 }
@@ -575,13 +575,13 @@ function Bs() {
   if (Zt) return Ae;
   Zt = 1;
   const t = j();
-  return Ae = (r, n, a, l, c) => {
-    typeof a == "string" && (c = l, l = a, a = void 0);
+  return Ae = (r, s, a, u, c) => {
+    typeof a == "string" && (c = u, u = a, a = void 0);
     try {
       return new t(
         r instanceof t ? r.version : r,
         a
-      ).inc(n, l, c).version;
+      ).inc(s, u, c).version;
     } catch {
       return null;
     }
@@ -592,19 +592,19 @@ function _s() {
   if (Qt) return Fe;
   Qt = 1;
   const t = W();
-  return Fe = (r, n) => {
-    const a = t(r, null, !0), l = t(n, null, !0), c = a.compare(l);
+  return Fe = (r, s) => {
+    const a = t(r, null, !0), u = t(s, null, !0), c = a.compare(u);
     if (c === 0)
       return null;
-    const d = c > 0, i = d ? a : l, f = d ? l : a, s = !!i.prerelease.length;
-    if (!!f.prerelease.length && !s) {
-      if (!f.patch && !f.minor)
+    const h = c > 0, o = h ? a : u, i = h ? u : a, n = !!o.prerelease.length;
+    if (!!i.prerelease.length && !n) {
+      if (!i.patch && !i.minor)
         return "major";
-      if (f.compareMain(i) === 0)
-        return f.minor && !f.patch ? "minor" : "patch";
+      if (i.compareMain(o) === 0)
+        return i.minor && !i.patch ? "minor" : "patch";
     }
-    const u = s ? "pre" : "";
-    return a.major !== l.major ? u + "major" : a.minor !== l.minor ? u + "minor" : a.patch !== l.patch ? u + "patch" : "prerelease";
+    const f = n ? "pre" : "";
+    return a.major !== u.major ? f + "major" : a.minor !== u.minor ? f + "minor" : a.patch !== u.patch ? f + "patch" : "prerelease";
   }, Fe;
 }
 var be, er;
@@ -612,29 +612,29 @@ function js() {
   if (er) return be;
   er = 1;
   const t = j();
-  return be = (r, n) => new t(r, n).major, be;
+  return be = (r, s) => new t(r, s).major, be;
 }
 var qe, tr;
 function Gs() {
   if (tr) return qe;
   tr = 1;
   const t = j();
-  return qe = (r, n) => new t(r, n).minor, qe;
+  return qe = (r, s) => new t(r, s).minor, qe;
 }
 var De, rr;
 function xs() {
   if (rr) return De;
   rr = 1;
   const t = j();
-  return De = (r, n) => new t(r, n).patch, De;
+  return De = (r, s) => new t(r, s).patch, De;
 }
 var Be, sr;
 function Us() {
   if (sr) return Be;
   sr = 1;
   const t = W();
-  return Be = (r, n) => {
-    const a = t(r, n);
+  return Be = (r, s) => {
+    const a = t(r, s);
     return a && a.prerelease.length ? a.prerelease : null;
   }, Be;
 }
@@ -643,30 +643,30 @@ function G() {
   if (nr) return _e;
   nr = 1;
   const t = j();
-  return _e = (r, n, a) => new t(r, a).compare(new t(n, a)), _e;
+  return _e = (r, s, a) => new t(r, a).compare(new t(s, a)), _e;
 }
 var je, ir;
 function Vs() {
   if (ir) return je;
   ir = 1;
   const t = G();
-  return je = (r, n, a) => t(n, r, a), je;
+  return je = (r, s, a) => t(s, r, a), je;
 }
 var Ge, ar;
 function Ms() {
   if (ar) return Ge;
   ar = 1;
   const t = G();
-  return Ge = (r, n) => t(r, n, !0), Ge;
+  return Ge = (r, s) => t(r, s, !0), Ge;
 }
 var xe, or;
 function At() {
   if (or) return xe;
   or = 1;
   const t = j();
-  return xe = (r, n, a) => {
-    const l = new t(r, a), c = new t(n, a);
-    return l.compare(c) || l.compareBuild(c);
+  return xe = (r, s, a) => {
+    const u = new t(r, a), c = new t(s, a);
+    return u.compare(c) || u.compareBuild(c);
   }, xe;
 }
 var Ue, cr;
@@ -674,84 +674,84 @@ function zs() {
   if (cr) return Ue;
   cr = 1;
   const t = At();
-  return Ue = (r, n) => r.sort((a, l) => t(a, l, n)), Ue;
+  return Ue = (r, s) => r.sort((a, u) => t(a, u, s)), Ue;
 }
 var Ve, lr;
 function Xs() {
   if (lr) return Ve;
   lr = 1;
   const t = At();
-  return Ve = (r, n) => r.sort((a, l) => t(l, a, n)), Ve;
+  return Ve = (r, s) => r.sort((a, u) => t(u, a, s)), Ve;
 }
 var Me, ur;
 function ge() {
   if (ur) return Me;
   ur = 1;
   const t = G();
-  return Me = (r, n, a) => t(r, n, a) > 0, Me;
+  return Me = (r, s, a) => t(r, s, a) > 0, Me;
 }
 var ze, fr;
 function Ft() {
   if (fr) return ze;
   fr = 1;
   const t = G();
-  return ze = (r, n, a) => t(r, n, a) < 0, ze;
+  return ze = (r, s, a) => t(r, s, a) < 0, ze;
 }
 var Xe, hr;
 function Yr() {
   if (hr) return Xe;
   hr = 1;
   const t = G();
-  return Xe = (r, n, a) => t(r, n, a) === 0, Xe;
+  return Xe = (r, s, a) => t(r, s, a) === 0, Xe;
 }
 var Je, pr;
 function Kr() {
   if (pr) return Je;
   pr = 1;
   const t = G();
-  return Je = (r, n, a) => t(r, n, a) !== 0, Je;
+  return Je = (r, s, a) => t(r, s, a) !== 0, Je;
 }
 var We, dr;
 function bt() {
   if (dr) return We;
   dr = 1;
   const t = G();
-  return We = (r, n, a) => t(r, n, a) >= 0, We;
+  return We = (r, s, a) => t(r, s, a) >= 0, We;
 }
 var He, gr;
 function qt() {
   if (gr) return He;
   gr = 1;
   const t = G();
-  return He = (r, n, a) => t(r, n, a) <= 0, He;
+  return He = (r, s, a) => t(r, s, a) <= 0, He;
 }
 var Ye, mr;
 function Zr() {
   if (mr) return Ye;
   mr = 1;
-  const t = Yr(), e = Kr(), r = ge(), n = bt(), a = Ft(), l = qt();
-  return Ye = (d, i, f, s) => {
-    switch (i) {
+  const t = Yr(), e = Kr(), r = ge(), s = bt(), a = Ft(), u = qt();
+  return Ye = (h, o, i, n) => {
+    switch (o) {
       case "===":
-        return typeof d == "object" && (d = d.version), typeof f == "object" && (f = f.version), d === f;
+        return typeof h == "object" && (h = h.version), typeof i == "object" && (i = i.version), h === i;
       case "!==":
-        return typeof d == "object" && (d = d.version), typeof f == "object" && (f = f.version), d !== f;
+        return typeof h == "object" && (h = h.version), typeof i == "object" && (i = i.version), h !== i;
       case "":
       case "=":
       case "==":
-        return t(d, f, s);
+        return t(h, i, n);
       case "!=":
-        return e(d, f, s);
+        return e(h, i, n);
       case ">":
-        return r(d, f, s);
+        return r(h, i, n);
       case ">=":
-        return n(d, f, s);
+        return s(h, i, n);
       case "<":
-        return a(d, f, s);
+        return a(h, i, n);
       case "<=":
-        return l(d, f, s);
+        return u(h, i, n);
       default:
-        throw new TypeError(`Invalid operator: ${i}`);
+        throw new TypeError(`Invalid operator: ${o}`);
     }
   }, Ye;
 }
@@ -759,27 +759,27 @@ var Ke, Er;
 function Js() {
   if (Er) return Ke;
   Er = 1;
-  const t = j(), e = W(), { safeRe: r, t: n } = ee();
-  return Ke = (l, c) => {
-    if (l instanceof t)
-      return l;
-    if (typeof l == "number" && (l = String(l)), typeof l != "string")
+  const t = j(), e = W(), { safeRe: r, t: s } = ee();
+  return Ke = (u, c) => {
+    if (u instanceof t)
+      return u;
+    if (typeof u == "number" && (u = String(u)), typeof u != "string")
       return null;
     c = c || {};
-    let d = null;
+    let h = null;
     if (!c.rtl)
-      d = l.match(c.includePrerelease ? r[n.COERCEFULL] : r[n.COERCE]);
+      h = u.match(c.includePrerelease ? r[s.COERCEFULL] : r[s.COERCE]);
     else {
-      const h = c.includePrerelease ? r[n.COERCERTLFULL] : r[n.COERCERTL];
-      let m;
-      for (; (m = h.exec(l)) && (!d || d.index + d[0].length !== l.length); )
-        (!d || m.index + m[0].length !== d.index + d[0].length) && (d = m), h.lastIndex = m.index + m[1].length + m[2].length;
-      h.lastIndex = -1;
+      const d = c.includePrerelease ? r[s.COERCERTLFULL] : r[s.COERCERTL];
+      let w;
+      for (; (w = d.exec(u)) && (!h || h.index + h[0].length !== u.length); )
+        (!h || w.index + w[0].length !== h.index + h[0].length) && (h = w), d.lastIndex = w.index + w[1].length + w[2].length;
+      d.lastIndex = -1;
     }
-    if (d === null)
+    if (h === null)
       return null;
-    const i = d[2], f = d[3] || "0", s = d[4] || "0", o = c.includePrerelease && d[5] ? `-${d[5]}` : "", u = c.includePrerelease && d[6] ? `+${d[6]}` : "";
-    return e(`${i}.${f}.${s}${o}${u}`, c);
+    const o = h[2], i = h[3] || "0", n = h[4] || "0", l = c.includePrerelease && h[5] ? `-${h[5]}` : "", f = c.includePrerelease && h[6] ? `+${h[6]}` : "";
+    return e(`${o}.${i}.${n}${l}${f}`, c);
   }, Ke;
 }
 var Ze, vr;
@@ -791,20 +791,20 @@ function Ws() {
       this.max = 1e3, this.map = /* @__PURE__ */ new Map();
     }
     get(r) {
-      const n = this.map.get(r);
-      if (n !== void 0)
-        return this.map.delete(r), this.map.set(r, n), n;
+      const s = this.map.get(r);
+      if (s !== void 0)
+        return this.map.delete(r), this.map.set(r, s), s;
     }
     delete(r) {
       return this.map.delete(r);
     }
-    set(r, n) {
-      if (!this.delete(r) && n !== void 0) {
+    set(r, s) {
+      if (!this.delete(r) && s !== void 0) {
         if (this.map.size >= this.max) {
-          const l = this.map.keys().next().value;
-          this.delete(l);
+          const u = this.map.keys().next().value;
+          this.delete(u);
         }
-        this.map.set(r, n);
+        this.map.set(r, s);
       }
       return this;
     }
@@ -820,17 +820,17 @@ function x() {
     constructor(g, S) {
       if (S = a(S), g instanceof e)
         return g.loose === !!S.loose && g.includePrerelease === !!S.includePrerelease ? g : new e(g.raw, S);
-      if (g instanceof l)
+      if (g instanceof u)
         return this.raw = g.value, this.set = [[g]], this.formatted = void 0, this;
-      if (this.options = S, this.loose = !!S.loose, this.includePrerelease = !!S.includePrerelease, this.raw = g.trim().replace(t, " "), this.set = this.raw.split("||").map((R) => this.parseRange(R.trim())).filter((R) => R.length), !this.set.length)
+      if (this.options = S, this.loose = !!S.loose, this.includePrerelease = !!S.includePrerelease, this.raw = g.trim().replace(t, " "), this.set = this.raw.split("||").map(($) => this.parseRange($.trim())).filter(($) => $.length), !this.set.length)
         throw new TypeError(`Invalid SemVer Range: ${this.raw}`);
       if (this.set.length > 1) {
-        const R = this.set[0];
+        const $ = this.set[0];
         if (this.set = this.set.filter((y) => !p(y[0])), this.set.length === 0)
-          this.set = [R];
+          this.set = [$];
         else if (this.set.length > 1) {
           for (const y of this.set)
-            if (y.length === 1 && v(y[0])) {
+            if (y.length === 1 && E(y[0])) {
               this.set = [y];
               break;
             }
@@ -844,8 +844,8 @@ function x() {
         for (let g = 0; g < this.set.length; g++) {
           g > 0 && (this.formatted += "||");
           const S = this.set[g];
-          for (let R = 0; R < S.length; R++)
-            R > 0 && (this.formatted += " "), this.formatted += S[R].toString().trim();
+          for (let $ = 0; $ < S.length; $++)
+            $ > 0 && (this.formatted += " "), this.formatted += S[$].toString().trim();
         }
       }
       return this.formatted;
@@ -857,14 +857,14 @@ function x() {
       return this.range;
     }
     parseRange(g) {
-      const R = ((this.options.includePrerelease && h) | (this.options.loose && m)) + ":" + g, y = n.get(R);
+      const $ = ((this.options.includePrerelease && d) | (this.options.loose && w)) + ":" + g, y = s.get($);
       if (y)
         return y;
-      const w = this.options.loose, O = w ? i[f.HYPHENRANGELOOSE] : i[f.HYPHENRANGE];
-      g = g.replace(O, we(this.options.includePrerelease)), c("hyphen replace", g), g = g.replace(i[f.COMPARATORTRIM], s), c("comparator trim", g), g = g.replace(i[f.TILDETRIM], o), c("tilde trim", g), g = g.replace(i[f.CARETTRIM], u), c("caret trim", g);
+      const R = this.options.loose, O = R ? o[i.HYPHENRANGELOOSE] : o[i.HYPHENRANGE];
+      g = g.replace(O, we(this.options.includePrerelease)), c("hyphen replace", g), g = g.replace(o[i.COMPARATORTRIM], n), c("comparator trim", g), g = g.replace(o[i.TILDETRIM], l), c("tilde trim", g), g = g.replace(o[i.CARETTRIM], f), c("caret trim", g);
       let C = g.split(" ").map((q) => N(q, this.options)).join(" ").split(/\s+/).map((q) => Re(q, this.options));
-      w && (C = C.filter((q) => (c("loose invalid filter", q, this.options), !!q.match(i[f.COMPARATORLOOSE])))), c("range list", C);
-      const k = /* @__PURE__ */ new Map(), A = C.map((q) => new l(q, this.options));
+      R && (C = C.filter((q) => (c("loose invalid filter", q, this.options), !!q.match(o[i.COMPARATORLOOSE])))), c("range list", C);
+      const k = /* @__PURE__ */ new Map(), A = C.map((q) => new u(q, this.options));
       for (const q of A) {
         if (p(q))
           return [q];
@@ -872,12 +872,12 @@ function x() {
       }
       k.size > 1 && k.has("") && k.delete("");
       const _ = [...k.values()];
-      return n.set(R, _), _;
+      return s.set($, _), _;
     }
     intersects(g, S) {
       if (!(g instanceof e))
         throw new TypeError("a Range is required");
-      return this.set.some((R) => $(R, S) && g.set.some((y) => $(y, S) && R.every((w) => y.every((O) => w.intersects(O, S)))));
+      return this.set.some(($) => v($, S) && g.set.some((y) => v(y, S) && $.every((R) => y.every((O) => R.intersects(O, S)))));
     }
     // if ANY of the sets match ALL of its comparators, then pass
     test(g) {
@@ -885,7 +885,7 @@ function x() {
         return !1;
       if (typeof g == "string")
         try {
-          g = new d(g, this.options);
+          g = new h(g, this.options);
         } catch {
           return !1;
         }
@@ -896,50 +896,50 @@ function x() {
     }
   }
   Qe = e;
-  const r = Ws(), n = new r(), a = Tt(), l = me(), c = de(), d = j(), {
-    safeRe: i,
-    t: f,
-    comparatorTrimReplace: s,
-    tildeTrimReplace: o,
-    caretTrimReplace: u
-  } = ee(), { FLAG_INCLUDE_PRERELEASE: h, FLAG_LOOSE: m } = pe(), p = (E) => E.value === "<0.0.0-0", v = (E) => E.value === "", $ = (E, g) => {
+  const r = Ws(), s = new r(), a = Tt(), u = me(), c = de(), h = j(), {
+    safeRe: o,
+    t: i,
+    comparatorTrimReplace: n,
+    tildeTrimReplace: l,
+    caretTrimReplace: f
+  } = ee(), { FLAG_INCLUDE_PRERELEASE: d, FLAG_LOOSE: w } = pe(), p = (m) => m.value === "<0.0.0-0", E = (m) => m.value === "", v = (m, g) => {
     let S = !0;
-    const R = E.slice();
-    let y = R.pop();
-    for (; S && R.length; )
-      S = R.every((w) => y.intersects(w, g)), y = R.pop();
+    const $ = m.slice();
+    let y = $.pop();
+    for (; S && $.length; )
+      S = $.every((R) => y.intersects(R, g)), y = $.pop();
     return S;
-  }, N = (E, g) => (c("comp", E, g), E = T(E, g), c("caret", E), E = F(E, g), c("tildes", E), E = P(E, g), c("xrange", E), E = $e(E, g), c("stars", E), E), I = (E) => !E || E.toLowerCase() === "x" || E === "*", F = (E, g) => E.trim().split(/\s+/).map((S) => b(S, g)).join(" "), b = (E, g) => {
-    const S = g.loose ? i[f.TILDELOOSE] : i[f.TILDE];
-    return E.replace(S, (R, y, w, O, C) => {
-      c("tilde", E, R, y, w, O, C);
+  }, N = (m, g) => (c("comp", m, g), m = T(m, g), c("caret", m), m = F(m, g), c("tildes", m), m = P(m, g), c("xrange", m), m = $e(m, g), c("stars", m), m), I = (m) => !m || m.toLowerCase() === "x" || m === "*", F = (m, g) => m.trim().split(/\s+/).map((S) => b(S, g)).join(" "), b = (m, g) => {
+    const S = g.loose ? o[i.TILDELOOSE] : o[i.TILDE];
+    return m.replace(S, ($, y, R, O, C) => {
+      c("tilde", m, $, y, R, O, C);
       let k;
-      return I(y) ? k = "" : I(w) ? k = `>=${y}.0.0 <${+y + 1}.0.0-0` : I(O) ? k = `>=${y}.${w}.0 <${y}.${+w + 1}.0-0` : C ? (c("replaceTilde pr", C), k = `>=${y}.${w}.${O}-${C} <${y}.${+w + 1}.0-0`) : k = `>=${y}.${w}.${O} <${y}.${+w + 1}.0-0`, c("tilde return", k), k;
+      return I(y) ? k = "" : I(R) ? k = `>=${y}.0.0 <${+y + 1}.0.0-0` : I(O) ? k = `>=${y}.${R}.0 <${y}.${+R + 1}.0-0` : C ? (c("replaceTilde pr", C), k = `>=${y}.${R}.${O}-${C} <${y}.${+R + 1}.0-0`) : k = `>=${y}.${R}.${O} <${y}.${+R + 1}.0-0`, c("tilde return", k), k;
     });
-  }, T = (E, g) => E.trim().split(/\s+/).map((S) => D(S, g)).join(" "), D = (E, g) => {
-    c("caret", E, g);
-    const S = g.loose ? i[f.CARETLOOSE] : i[f.CARET], R = g.includePrerelease ? "-0" : "";
-    return E.replace(S, (y, w, O, C, k) => {
-      c("caret", E, y, w, O, C, k);
+  }, T = (m, g) => m.trim().split(/\s+/).map((S) => D(S, g)).join(" "), D = (m, g) => {
+    c("caret", m, g);
+    const S = g.loose ? o[i.CARETLOOSE] : o[i.CARET], $ = g.includePrerelease ? "-0" : "";
+    return m.replace(S, (y, R, O, C, k) => {
+      c("caret", m, y, R, O, C, k);
       let A;
-      return I(w) ? A = "" : I(O) ? A = `>=${w}.0.0${R} <${+w + 1}.0.0-0` : I(C) ? w === "0" ? A = `>=${w}.${O}.0${R} <${w}.${+O + 1}.0-0` : A = `>=${w}.${O}.0${R} <${+w + 1}.0.0-0` : k ? (c("replaceCaret pr", k), w === "0" ? O === "0" ? A = `>=${w}.${O}.${C}-${k} <${w}.${O}.${+C + 1}-0` : A = `>=${w}.${O}.${C}-${k} <${w}.${+O + 1}.0-0` : A = `>=${w}.${O}.${C}-${k} <${+w + 1}.0.0-0`) : (c("no pr"), w === "0" ? O === "0" ? A = `>=${w}.${O}.${C}${R} <${w}.${O}.${+C + 1}-0` : A = `>=${w}.${O}.${C}${R} <${w}.${+O + 1}.0-0` : A = `>=${w}.${O}.${C} <${+w + 1}.0.0-0`), c("caret return", A), A;
+      return I(R) ? A = "" : I(O) ? A = `>=${R}.0.0${$} <${+R + 1}.0.0-0` : I(C) ? R === "0" ? A = `>=${R}.${O}.0${$} <${R}.${+O + 1}.0-0` : A = `>=${R}.${O}.0${$} <${+R + 1}.0.0-0` : k ? (c("replaceCaret pr", k), R === "0" ? O === "0" ? A = `>=${R}.${O}.${C}-${k} <${R}.${O}.${+C + 1}-0` : A = `>=${R}.${O}.${C}-${k} <${R}.${+O + 1}.0-0` : A = `>=${R}.${O}.${C}-${k} <${+R + 1}.0.0-0`) : (c("no pr"), R === "0" ? O === "0" ? A = `>=${R}.${O}.${C}${$} <${R}.${O}.${+C + 1}-0` : A = `>=${R}.${O}.${C}${$} <${R}.${+O + 1}.0-0` : A = `>=${R}.${O}.${C} <${+R + 1}.0.0-0`), c("caret return", A), A;
     });
-  }, P = (E, g) => (c("replaceXRanges", E, g), E.split(/\s+/).map((S) => H(S, g)).join(" ")), H = (E, g) => {
-    E = E.trim();
-    const S = g.loose ? i[f.XRANGELOOSE] : i[f.XRANGE];
-    return E.replace(S, (R, y, w, O, C, k) => {
-      c("xRange", E, R, y, w, O, C, k);
-      const A = I(w), _ = A || I(O), q = _ || I(C), Y = q;
-      return y === "=" && Y && (y = ""), k = g.includePrerelease ? "-0" : "", A ? y === ">" || y === "<" ? R = "<0.0.0-0" : R = "*" : y && Y ? (_ && (O = 0), C = 0, y === ">" ? (y = ">=", _ ? (w = +w + 1, O = 0, C = 0) : (O = +O + 1, C = 0)) : y === "<=" && (y = "<", _ ? w = +w + 1 : O = +O + 1), y === "<" && (k = "-0"), R = `${y + w}.${O}.${C}${k}`) : _ ? R = `>=${w}.0.0${k} <${+w + 1}.0.0-0` : q && (R = `>=${w}.${O}.0${k} <${w}.${+O + 1}.0-0`), c("xRange return", R), R;
+  }, P = (m, g) => (c("replaceXRanges", m, g), m.split(/\s+/).map((S) => H(S, g)).join(" ")), H = (m, g) => {
+    m = m.trim();
+    const S = g.loose ? o[i.XRANGELOOSE] : o[i.XRANGE];
+    return m.replace(S, ($, y, R, O, C, k) => {
+      c("xRange", m, $, y, R, O, C, k);
+      const A = I(R), _ = A || I(O), q = _ || I(C), Y = q;
+      return y === "=" && Y && (y = ""), k = g.includePrerelease ? "-0" : "", A ? y === ">" || y === "<" ? $ = "<0.0.0-0" : $ = "*" : y && Y ? (_ && (O = 0), C = 0, y === ">" ? (y = ">=", _ ? (R = +R + 1, O = 0, C = 0) : (O = +O + 1, C = 0)) : y === "<=" && (y = "<", _ ? R = +R + 1 : O = +O + 1), y === "<" && (k = "-0"), $ = `${y + R}.${O}.${C}${k}`) : _ ? $ = `>=${R}.0.0${k} <${+R + 1}.0.0-0` : q && ($ = `>=${R}.${O}.0${k} <${R}.${+O + 1}.0-0`), c("xRange return", $), $;
     });
-  }, $e = (E, g) => (c("replaceStars", E, g), E.trim().replace(i[f.STAR], "")), Re = (E, g) => (c("replaceGTE0", E, g), E.trim().replace(i[g.includePrerelease ? f.GTE0PRE : f.GTE0], "")), we = (E) => (g, S, R, y, w, O, C, k, A, _, q, Y) => (I(R) ? S = "" : I(y) ? S = `>=${R}.0.0${E ? "-0" : ""}` : I(w) ? S = `>=${R}.${y}.0${E ? "-0" : ""}` : O ? S = `>=${S}` : S = `>=${S}${E ? "-0" : ""}`, I(A) ? k = "" : I(_) ? k = `<${+A + 1}.0.0-0` : I(q) ? k = `<${A}.${+_ + 1}.0-0` : Y ? k = `<=${A}.${_}.${q}-${Y}` : E ? k = `<${A}.${_}.${+q + 1}-0` : k = `<=${k}`, `${S} ${k}`.trim()), Se = (E, g, S) => {
-    for (let R = 0; R < E.length; R++)
-      if (!E[R].test(g))
+  }, $e = (m, g) => (c("replaceStars", m, g), m.trim().replace(o[i.STAR], "")), Re = (m, g) => (c("replaceGTE0", m, g), m.trim().replace(o[g.includePrerelease ? i.GTE0PRE : i.GTE0], "")), we = (m) => (g, S, $, y, R, O, C, k, A, _, q, Y) => (I($) ? S = "" : I(y) ? S = `>=${$}.0.0${m ? "-0" : ""}` : I(R) ? S = `>=${$}.${y}.0${m ? "-0" : ""}` : O ? S = `>=${S}` : S = `>=${S}${m ? "-0" : ""}`, I(A) ? k = "" : I(_) ? k = `<${+A + 1}.0.0-0` : I(q) ? k = `<${A}.${+_ + 1}.0-0` : Y ? k = `<=${A}.${_}.${q}-${Y}` : m ? k = `<${A}.${_}.${+q + 1}-0` : k = `<=${k}`, `${S} ${k}`.trim()), Se = (m, g, S) => {
+    for (let $ = 0; $ < m.length; $++)
+      if (!m[$].test(g))
         return !1;
     if (g.prerelease.length && !S.includePrerelease) {
-      for (let R = 0; R < E.length; R++)
-        if (c(E[R].semver), E[R].semver !== l.ANY && E[R].semver.prerelease.length > 0) {
-          const y = E[R].semver;
+      for (let $ = 0; $ < m.length; $++)
+        if (c(m[$].semver), m[$].semver !== u.ANY && m[$].semver.prerelease.length > 0) {
+          const y = m[$].semver;
           if (y.major === g.major && y.minor === g.minor && y.patch === g.patch)
             return !0;
         }
@@ -958,42 +958,42 @@ function me() {
     static get ANY() {
       return t;
     }
-    constructor(s, o) {
-      if (o = r(o), s instanceof e) {
-        if (s.loose === !!o.loose)
-          return s;
-        s = s.value;
+    constructor(n, l) {
+      if (l = r(l), n instanceof e) {
+        if (n.loose === !!l.loose)
+          return n;
+        n = n.value;
       }
-      s = s.trim().split(/\s+/).join(" "), c("comparator", s, o), this.options = o, this.loose = !!o.loose, this.parse(s), this.semver === t ? this.value = "" : this.value = this.operator + this.semver.version, c("comp", this);
+      n = n.trim().split(/\s+/).join(" "), c("comparator", n, l), this.options = l, this.loose = !!l.loose, this.parse(n), this.semver === t ? this.value = "" : this.value = this.operator + this.semver.version, c("comp", this);
     }
-    parse(s) {
-      const o = this.options.loose ? n[a.COMPARATORLOOSE] : n[a.COMPARATOR], u = s.match(o);
-      if (!u)
-        throw new TypeError(`Invalid comparator: ${s}`);
-      this.operator = u[1] !== void 0 ? u[1] : "", this.operator === "=" && (this.operator = ""), u[2] ? this.semver = new d(u[2], this.options.loose) : this.semver = t;
+    parse(n) {
+      const l = this.options.loose ? s[a.COMPARATORLOOSE] : s[a.COMPARATOR], f = n.match(l);
+      if (!f)
+        throw new TypeError(`Invalid comparator: ${n}`);
+      this.operator = f[1] !== void 0 ? f[1] : "", this.operator === "=" && (this.operator = ""), f[2] ? this.semver = new h(f[2], this.options.loose) : this.semver = t;
     }
     toString() {
       return this.value;
     }
-    test(s) {
-      if (c("Comparator.test", s, this.options.loose), this.semver === t || s === t)
+    test(n) {
+      if (c("Comparator.test", n, this.options.loose), this.semver === t || n === t)
         return !0;
-      if (typeof s == "string")
+      if (typeof n == "string")
         try {
-          s = new d(s, this.options);
+          n = new h(n, this.options);
         } catch {
           return !1;
         }
-      return l(s, this.operator, this.semver, this.options);
+      return u(n, this.operator, this.semver, this.options);
     }
-    intersects(s, o) {
-      if (!(s instanceof e))
+    intersects(n, l) {
+      if (!(n instanceof e))
         throw new TypeError("a Comparator is required");
-      return this.operator === "" ? this.value === "" ? !0 : new i(s.value, o).test(this.value) : s.operator === "" ? s.value === "" ? !0 : new i(this.value, o).test(s.semver) : (o = r(o), o.includePrerelease && (this.value === "<0.0.0-0" || s.value === "<0.0.0-0") || !o.includePrerelease && (this.value.startsWith("<0.0.0") || s.value.startsWith("<0.0.0")) ? !1 : !!(this.operator.startsWith(">") && s.operator.startsWith(">") || this.operator.startsWith("<") && s.operator.startsWith("<") || this.semver.version === s.semver.version && this.operator.includes("=") && s.operator.includes("=") || l(this.semver, "<", s.semver, o) && this.operator.startsWith(">") && s.operator.startsWith("<") || l(this.semver, ">", s.semver, o) && this.operator.startsWith("<") && s.operator.startsWith(">")));
+      return this.operator === "" ? this.value === "" ? !0 : new o(n.value, l).test(this.value) : n.operator === "" ? n.value === "" ? !0 : new o(this.value, l).test(n.semver) : (l = r(l), l.includePrerelease && (this.value === "<0.0.0-0" || n.value === "<0.0.0-0") || !l.includePrerelease && (this.value.startsWith("<0.0.0") || n.value.startsWith("<0.0.0")) ? !1 : !!(this.operator.startsWith(">") && n.operator.startsWith(">") || this.operator.startsWith("<") && n.operator.startsWith("<") || this.semver.version === n.semver.version && this.operator.includes("=") && n.operator.includes("=") || u(this.semver, "<", n.semver, l) && this.operator.startsWith(">") && n.operator.startsWith("<") || u(this.semver, ">", n.semver, l) && this.operator.startsWith("<") && n.operator.startsWith(">")));
     }
   }
   et = e;
-  const r = Tt(), { safeRe: n, t: a } = ee(), l = Zr(), c = de(), d = j(), i = x();
+  const r = Tt(), { safeRe: s, t: a } = ee(), u = Zr(), c = de(), h = j(), o = x();
   return et;
 }
 var tt, wr;
@@ -1001,13 +1001,13 @@ function Ee() {
   if (wr) return tt;
   wr = 1;
   const t = x();
-  return tt = (r, n, a) => {
+  return tt = (r, s, a) => {
     try {
-      n = new t(n, a);
+      s = new t(s, a);
     } catch {
       return !1;
     }
-    return n.test(r);
+    return s.test(r);
   }, tt;
 }
 var rt, Sr;
@@ -1015,22 +1015,22 @@ function Hs() {
   if (Sr) return rt;
   Sr = 1;
   const t = x();
-  return rt = (r, n) => new t(r, n).set.map((a) => a.map((l) => l.value).join(" ").trim().split(" ")), rt;
+  return rt = (r, s) => new t(r, s).set.map((a) => a.map((u) => u.value).join(" ").trim().split(" ")), rt;
 }
 var st, yr;
 function Ys() {
   if (yr) return st;
   yr = 1;
   const t = j(), e = x();
-  return st = (n, a, l) => {
-    let c = null, d = null, i = null;
+  return st = (s, a, u) => {
+    let c = null, h = null, o = null;
     try {
-      i = new e(a, l);
+      o = new e(a, u);
     } catch {
       return null;
     }
-    return n.forEach((f) => {
-      i.test(f) && (!c || d.compare(f) === -1) && (c = f, d = new t(c, l));
+    return s.forEach((i) => {
+      o.test(i) && (!c || h.compare(i) === -1) && (c = i, h = new t(c, u));
     }), c;
   }, st;
 }
@@ -1039,15 +1039,15 @@ function Ks() {
   if (Ir) return nt;
   Ir = 1;
   const t = j(), e = x();
-  return nt = (n, a, l) => {
-    let c = null, d = null, i = null;
+  return nt = (s, a, u) => {
+    let c = null, h = null, o = null;
     try {
-      i = new e(a, l);
+      o = new e(a, u);
     } catch {
       return null;
     }
-    return n.forEach((f) => {
-      i.test(f) && (!c || d.compare(f) === 1) && (c = f, d = new t(c, l));
+    return s.forEach((i) => {
+      o.test(i) && (!c || h.compare(i) === 1) && (c = i, h = new t(c, u));
     }), c;
   }, nt;
 }
@@ -1056,33 +1056,33 @@ function Zs() {
   if (Or) return it;
   Or = 1;
   const t = j(), e = x(), r = ge();
-  return it = (a, l) => {
-    a = new e(a, l);
+  return it = (a, u) => {
+    a = new e(a, u);
     let c = new t("0.0.0");
     if (a.test(c) || (c = new t("0.0.0-0"), a.test(c)))
       return c;
     c = null;
-    for (let d = 0; d < a.set.length; ++d) {
-      const i = a.set[d];
-      let f = null;
-      i.forEach((s) => {
-        const o = new t(s.semver.version);
-        switch (s.operator) {
+    for (let h = 0; h < a.set.length; ++h) {
+      const o = a.set[h];
+      let i = null;
+      o.forEach((n) => {
+        const l = new t(n.semver.version);
+        switch (n.operator) {
           case ">":
-            o.prerelease.length === 0 ? o.patch++ : o.prerelease.push(0), o.raw = o.format();
+            l.prerelease.length === 0 ? l.patch++ : l.prerelease.push(0), l.raw = l.format();
           /* fallthrough */
           case "":
           case ">=":
-            (!f || r(o, f)) && (f = o);
+            (!i || r(l, i)) && (i = l);
             break;
           case "<":
           case "<=":
             break;
           /* istanbul ignore next */
           default:
-            throw new Error(`Unexpected operation: ${s.operator}`);
+            throw new Error(`Unexpected operation: ${n.operator}`);
         }
-      }), f && (!c || r(c, f)) && (c = f);
+      }), i && (!c || r(c, i)) && (c = i);
     }
     return c && a.test(c) ? c : null;
   }, it;
@@ -1092,9 +1092,9 @@ function Qs() {
   if (Pr) return at;
   Pr = 1;
   const t = x();
-  return at = (r, n) => {
+  return at = (r, s) => {
     try {
-      return new t(r, n).range || "*";
+      return new t(r, s).range || "*";
     } catch {
       return null;
     }
@@ -1104,30 +1104,30 @@ var ot, Nr;
 function Dt() {
   if (Nr) return ot;
   Nr = 1;
-  const t = j(), e = me(), { ANY: r } = e, n = x(), a = Ee(), l = ge(), c = Ft(), d = qt(), i = bt();
-  return ot = (s, o, u, h) => {
-    s = new t(s, h), o = new n(o, h);
-    let m, p, v, $, N;
-    switch (u) {
+  const t = j(), e = me(), { ANY: r } = e, s = x(), a = Ee(), u = ge(), c = Ft(), h = qt(), o = bt();
+  return ot = (n, l, f, d) => {
+    n = new t(n, d), l = new s(l, d);
+    let w, p, E, v, N;
+    switch (f) {
       case ">":
-        m = l, p = d, v = c, $ = ">", N = ">=";
+        w = u, p = h, E = c, v = ">", N = ">=";
         break;
       case "<":
-        m = c, p = i, v = l, $ = "<", N = "<=";
+        w = c, p = o, E = u, v = "<", N = "<=";
         break;
       default:
         throw new TypeError('Must provide a hilo val of "<" or ">"');
     }
-    if (a(s, o, h))
+    if (a(n, l, d))
       return !1;
-    for (let I = 0; I < o.set.length; ++I) {
-      const F = o.set[I];
+    for (let I = 0; I < l.set.length; ++I) {
+      const F = l.set[I];
       let b = null, T = null;
       if (F.forEach((D) => {
-        D.semver === r && (D = new e(">=0.0.0")), b = b || D, T = T || D, m(D.semver, b.semver, h) ? b = D : v(D.semver, T.semver, h) && (T = D);
-      }), b.operator === $ || b.operator === N || (!T.operator || T.operator === $) && p(s, T.semver))
+        D.semver === r && (D = new e(">=0.0.0")), b = b || D, T = T || D, w(D.semver, b.semver, d) ? b = D : E(D.semver, T.semver, d) && (T = D);
+      }), b.operator === v || b.operator === N || (!T.operator || T.operator === v) && p(n, T.semver))
         return !1;
-      if (T.operator === N && v(s, T.semver))
+      if (T.operator === N && E(n, T.semver))
         return !1;
     }
     return !0;
@@ -1138,148 +1138,148 @@ function en() {
   if (kr) return ct;
   kr = 1;
   const t = Dt();
-  return ct = (r, n, a) => t(r, n, ">", a), ct;
+  return ct = (r, s, a) => t(r, s, ">", a), ct;
 }
 var lt, Lr;
 function tn() {
   if (Lr) return lt;
   Lr = 1;
   const t = Dt();
-  return lt = (r, n, a) => t(r, n, "<", a), lt;
+  return lt = (r, s, a) => t(r, s, "<", a), lt;
 }
 var ut, Cr;
 function rn() {
   if (Cr) return ut;
   Cr = 1;
   const t = x();
-  return ut = (r, n, a) => (r = new t(r, a), n = new t(n, a), r.intersects(n, a)), ut;
+  return ut = (r, s, a) => (r = new t(r, a), s = new t(s, a), r.intersects(s, a)), ut;
 }
 var ft, Tr;
 function sn() {
   if (Tr) return ft;
   Tr = 1;
   const t = Ee(), e = G();
-  return ft = (r, n, a) => {
-    const l = [];
-    let c = null, d = null;
-    const i = r.sort((u, h) => e(u, h, a));
-    for (const u of i)
-      t(u, n, a) ? (d = u, c || (c = u)) : (d && l.push([c, d]), d = null, c = null);
-    c && l.push([c, null]);
-    const f = [];
-    for (const [u, h] of l)
-      u === h ? f.push(u) : !h && u === i[0] ? f.push("*") : h ? u === i[0] ? f.push(`<=${h}`) : f.push(`${u} - ${h}`) : f.push(`>=${u}`);
-    const s = f.join(" || "), o = typeof n.raw == "string" ? n.raw : String(n);
-    return s.length < o.length ? s : n;
+  return ft = (r, s, a) => {
+    const u = [];
+    let c = null, h = null;
+    const o = r.sort((f, d) => e(f, d, a));
+    for (const f of o)
+      t(f, s, a) ? (h = f, c || (c = f)) : (h && u.push([c, h]), h = null, c = null);
+    c && u.push([c, null]);
+    const i = [];
+    for (const [f, d] of u)
+      f === d ? i.push(f) : !d && f === o[0] ? i.push("*") : d ? f === o[0] ? i.push(`<=${d}`) : i.push(`${f} - ${d}`) : i.push(`>=${f}`);
+    const n = i.join(" || "), l = typeof s.raw == "string" ? s.raw : String(s);
+    return n.length < l.length ? n : s;
   }, ft;
 }
 var ht, Ar;
 function nn() {
   if (Ar) return ht;
   Ar = 1;
-  const t = x(), e = me(), { ANY: r } = e, n = Ee(), a = G(), l = (o, u, h = {}) => {
-    if (o === u)
+  const t = x(), e = me(), { ANY: r } = e, s = Ee(), a = G(), u = (l, f, d = {}) => {
+    if (l === f)
       return !0;
-    o = new t(o, h), u = new t(u, h);
-    let m = !1;
-    e: for (const p of o.set) {
-      for (const v of u.set) {
-        const $ = i(p, v, h);
-        if (m = m || $ !== null, $)
+    l = new t(l, d), f = new t(f, d);
+    let w = !1;
+    e: for (const p of l.set) {
+      for (const E of f.set) {
+        const v = o(p, E, d);
+        if (w = w || v !== null, v)
           continue e;
       }
-      if (m)
+      if (w)
         return !1;
     }
     return !0;
-  }, c = [new e(">=0.0.0-0")], d = [new e(">=0.0.0")], i = (o, u, h) => {
-    if (o === u)
+  }, c = [new e(">=0.0.0-0")], h = [new e(">=0.0.0")], o = (l, f, d) => {
+    if (l === f)
       return !0;
-    if (o.length === 1 && o[0].semver === r) {
-      if (u.length === 1 && u[0].semver === r)
+    if (l.length === 1 && l[0].semver === r) {
+      if (f.length === 1 && f[0].semver === r)
         return !0;
-      h.includePrerelease ? o = c : o = d;
+      d.includePrerelease ? l = c : l = h;
     }
-    if (u.length === 1 && u[0].semver === r) {
-      if (h.includePrerelease)
+    if (f.length === 1 && f[0].semver === r) {
+      if (d.includePrerelease)
         return !0;
-      u = d;
+      f = h;
     }
-    const m = /* @__PURE__ */ new Set();
-    let p, v;
-    for (const P of o)
-      P.operator === ">" || P.operator === ">=" ? p = f(p, P, h) : P.operator === "<" || P.operator === "<=" ? v = s(v, P, h) : m.add(P.semver);
-    if (m.size > 1)
+    const w = /* @__PURE__ */ new Set();
+    let p, E;
+    for (const P of l)
+      P.operator === ">" || P.operator === ">=" ? p = i(p, P, d) : P.operator === "<" || P.operator === "<=" ? E = n(E, P, d) : w.add(P.semver);
+    if (w.size > 1)
       return null;
-    let $;
-    if (p && v) {
-      if ($ = a(p.semver, v.semver, h), $ > 0)
+    let v;
+    if (p && E) {
+      if (v = a(p.semver, E.semver, d), v > 0)
         return null;
-      if ($ === 0 && (p.operator !== ">=" || v.operator !== "<="))
+      if (v === 0 && (p.operator !== ">=" || E.operator !== "<="))
         return null;
     }
-    for (const P of m) {
-      if (p && !n(P, String(p), h) || v && !n(P, String(v), h))
+    for (const P of w) {
+      if (p && !s(P, String(p), d) || E && !s(P, String(E), d))
         return null;
-      for (const H of u)
-        if (!n(P, String(H), h))
+      for (const H of f)
+        if (!s(P, String(H), d))
           return !1;
       return !0;
     }
-    let N, I, F, b, T = v && !h.includePrerelease && v.semver.prerelease.length ? v.semver : !1, D = p && !h.includePrerelease && p.semver.prerelease.length ? p.semver : !1;
-    T && T.prerelease.length === 1 && v.operator === "<" && T.prerelease[0] === 0 && (T = !1);
-    for (const P of u) {
+    let N, I, F, b, T = E && !d.includePrerelease && E.semver.prerelease.length ? E.semver : !1, D = p && !d.includePrerelease && p.semver.prerelease.length ? p.semver : !1;
+    T && T.prerelease.length === 1 && E.operator === "<" && T.prerelease[0] === 0 && (T = !1);
+    for (const P of f) {
       if (b = b || P.operator === ">" || P.operator === ">=", F = F || P.operator === "<" || P.operator === "<=", p) {
         if (D && P.semver.prerelease && P.semver.prerelease.length && P.semver.major === D.major && P.semver.minor === D.minor && P.semver.patch === D.patch && (D = !1), P.operator === ">" || P.operator === ">=") {
-          if (N = f(p, P, h), N === P && N !== p)
+          if (N = i(p, P, d), N === P && N !== p)
             return !1;
-        } else if (p.operator === ">=" && !n(p.semver, String(P), h))
+        } else if (p.operator === ">=" && !s(p.semver, String(P), d))
           return !1;
       }
-      if (v) {
+      if (E) {
         if (T && P.semver.prerelease && P.semver.prerelease.length && P.semver.major === T.major && P.semver.minor === T.minor && P.semver.patch === T.patch && (T = !1), P.operator === "<" || P.operator === "<=") {
-          if (I = s(v, P, h), I === P && I !== v)
+          if (I = n(E, P, d), I === P && I !== E)
             return !1;
-        } else if (v.operator === "<=" && !n(v.semver, String(P), h))
+        } else if (E.operator === "<=" && !s(E.semver, String(P), d))
           return !1;
       }
-      if (!P.operator && (v || p) && $ !== 0)
+      if (!P.operator && (E || p) && v !== 0)
         return !1;
     }
-    return !(p && F && !v && $ !== 0 || v && b && !p && $ !== 0 || D || T);
-  }, f = (o, u, h) => {
-    if (!o)
-      return u;
-    const m = a(o.semver, u.semver, h);
-    return m > 0 ? o : m < 0 || u.operator === ">" && o.operator === ">=" ? u : o;
-  }, s = (o, u, h) => {
-    if (!o)
-      return u;
-    const m = a(o.semver, u.semver, h);
-    return m < 0 ? o : m > 0 || u.operator === "<" && o.operator === "<=" ? u : o;
+    return !(p && F && !E && v !== 0 || E && b && !p && v !== 0 || D || T);
+  }, i = (l, f, d) => {
+    if (!l)
+      return f;
+    const w = a(l.semver, f.semver, d);
+    return w > 0 ? l : w < 0 || f.operator === ">" && l.operator === ">=" ? f : l;
+  }, n = (l, f, d) => {
+    if (!l)
+      return f;
+    const w = a(l.semver, f.semver, d);
+    return w < 0 ? l : w > 0 || f.operator === "<" && l.operator === "<=" ? f : l;
   };
-  return ht = l, ht;
+  return ht = u, ht;
 }
 var pt, Fr;
 function an() {
   if (Fr) return pt;
   Fr = 1;
-  const t = ee(), e = pe(), r = j(), n = Hr(), a = W(), l = qs(), c = Ds(), d = Bs(), i = _s(), f = js(), s = Gs(), o = xs(), u = Us(), h = G(), m = Vs(), p = Ms(), v = At(), $ = zs(), N = Xs(), I = ge(), F = Ft(), b = Yr(), T = Kr(), D = bt(), P = qt(), H = Zr(), $e = Js(), Re = me(), we = x(), Se = Ee(), E = Hs(), g = Ys(), S = Ks(), R = Zs(), y = Qs(), w = Dt(), O = en(), C = tn(), k = rn(), A = sn(), _ = nn();
+  const t = ee(), e = pe(), r = j(), s = Hr(), a = W(), u = qs(), c = Ds(), h = Bs(), o = _s(), i = js(), n = Gs(), l = xs(), f = Us(), d = G(), w = Vs(), p = Ms(), E = At(), v = zs(), N = Xs(), I = ge(), F = Ft(), b = Yr(), T = Kr(), D = bt(), P = qt(), H = Zr(), $e = Js(), Re = me(), we = x(), Se = Ee(), m = Hs(), g = Ys(), S = Ks(), $ = Zs(), y = Qs(), R = Dt(), O = en(), C = tn(), k = rn(), A = sn(), _ = nn();
   return pt = {
     parse: a,
-    valid: l,
+    valid: u,
     clean: c,
-    inc: d,
-    diff: i,
-    major: f,
-    minor: s,
-    patch: o,
-    prerelease: u,
-    compare: h,
-    rcompare: m,
+    inc: h,
+    diff: o,
+    major: i,
+    minor: n,
+    patch: l,
+    prerelease: f,
+    compare: d,
+    rcompare: w,
     compareLoose: p,
-    compareBuild: v,
-    sort: $,
+    compareBuild: E,
+    sort: v,
     rsort: N,
     gt: I,
     lt: F,
@@ -1292,12 +1292,12 @@ function an() {
     Comparator: Re,
     Range: we,
     satisfies: Se,
-    toComparators: E,
+    toComparators: m,
     maxSatisfying: g,
     minSatisfying: S,
-    minVersion: R,
+    minVersion: $,
     validRange: y,
-    outside: w,
+    outside: R,
     gtr: O,
     ltr: C,
     intersects: k,
@@ -1309,8 +1309,8 @@ function an() {
     tokens: t.t,
     SEMVER_SPEC_VERSION: e.SEMVER_SPEC_VERSION,
     RELEASE_TYPES: e.RELEASE_TYPES,
-    compareIdentifiers: n.compareIdentifiers,
-    rcompareIdentifiers: n.rcompareIdentifiers
+    compareIdentifiers: s.compareIdentifiers,
+    rcompareIdentifiers: s.rcompareIdentifiers
   }, pt;
 }
 var Qr = an();
@@ -1366,7 +1366,7 @@ function ts(t) {
   });
   return e.transform((r) => r.allVersionsWithChannels ? r : {
     ...r,
-    allVersionsWithChannels: r.allVersions.map((n) => ({ version: n, channels: [] }))
+    allVersionsWithChannels: r.allVersions.map((s) => ({ version: s, channels: [] }))
   }).transform(
     (r) => r.latestByChannel[oe] ? r : {
       ...r,
@@ -1422,100 +1422,100 @@ class ti {
   }
   async updateRegistry(e = "normal") {
     this.logger.info("Initiating registry refresh...");
-    const r = /* @__PURE__ */ new Map(), n = [], a = await this.storage.listFiles(It), l = ({ organization: f, name: s, version: o }) => {
-      const u = `${f}:${s}`;
-      let h = r.get(u);
-      if (h) {
-        if (!h.versions.has(o))
-          return h.versions.add(o), !0;
-      } else return r.set(u, {
-        package: { organization: f, name: s },
-        versions: /* @__PURE__ */ new Set([o])
+    const r = /* @__PURE__ */ new Map(), s = [], a = await this.storage.listFiles(It), u = ({ organization: i, name: n, version: l }) => {
+      const f = `${i}:${n}`;
+      let d = r.get(f);
+      if (d) {
+        if (!d.versions.has(l))
+          return d.versions.add(l), !0;
+      } else return r.set(f, {
+        package: { organization: i, name: n },
+        versions: /* @__PURE__ */ new Set([l])
       }), !0;
       return !1;
     };
     this.logger.info("Packages to be updated:");
-    for (const f of a) {
-      const s = f.match(ln);
-      if (!s) continue;
-      n.push(f);
-      const { organization: o, name: u, version: h, seed: m } = s.groups, p = l({ organization: o, name: u, version: h });
-      this.logger.info(`  - ${o}:${u}:${h} added:${p}`);
+    for (const i of a) {
+      const n = i.match(ln);
+      if (!n) continue;
+      s.push(i);
+      const { organization: l, name: f, version: d, seed: w } = n.groups, p = u({ organization: l, name: f, version: d });
+      this.logger.info(`  - ${l}:${f}:${d} added:${p}`);
     }
     if (e === "force") {
-      const f = await this.storage.listFiles(te);
-      for (const s of f) {
-        const o = s.match(En);
-        if (!o) continue;
-        const { organization: u, name: h, version: m } = o.groups, p = l({ organization: u, name: h, version: m });
-        this.logger.info(`  - ${u}:${h}:${m} force_added:${p}`);
+      const i = await this.storage.listFiles(te);
+      for (const n of i) {
+        const l = n.match(En);
+        if (!l) continue;
+        const { organization: f, name: d, version: w } = l.groups, p = u({ organization: f, name: d, version: w });
+        this.logger.info(`  - ${f}:${d}:${w} force_added:${p}`);
       }
     }
     const c = await this.storage.getFile(mt);
-    let i = (c === void 0 ? { packages: [] } : Br.parse(JSON.parse(c.toString()))).packages;
-    this.logger.info(`Global overview loaded, ${i.length} records`);
-    for (const [, f] of r.entries()) {
-      const s = Dr(f.package), o = await this.storage.getFile(s), u = o === void 0 ? { versions: [] } : qr.parse(JSON.parse(o.toString()));
+    let o = (c === void 0 ? { packages: [] } : Br.parse(JSON.parse(c.toString()))).packages;
+    this.logger.info(`Global overview loaded, ${o.length} records`);
+    for (const [, i] of r.entries()) {
+      const n = Dr(i.package), l = await this.storage.getFile(n), f = l === void 0 ? { versions: [] } : qr.parse(JSON.parse(l.toString()));
       this.logger.info(
-        `Updating ${f.package.organization}:${f.package.name} overview, ${u.versions.length} records`
+        `Updating ${i.package.organization}:${i.package.name} overview, ${f.versions.length} records`
       );
-      const h = u.versions.filter(
-        (v) => !f.versions.has(v.description.id.version)
+      const d = f.versions.filter(
+        (E) => !i.versions.has(E.description.id.version)
       );
-      for (const [v] of f.versions.entries()) {
-        const $ = v.toString(), N = {
-          ...f.package,
-          version: $
+      for (const [E] of i.versions.entries()) {
+        const v = E.toString(), N = {
+          ...i.package,
+          version: v
         }, I = await this.storage.getFile(
           ne(N) + hn
         );
         if (!I) continue;
         const F = await St(I), b = (await this.storage.listFiles(mn(N))).filter((T) => T.match(gt) ? !0 : (this.logger.warn(`Unexpected channel in ${ye(N)}: ${T}`), !1));
-        h.push({
-          description: Ut($).parse(
+        d.push({
+          description: Ut(v).parse(
             xr.parse(JSON.parse(I.toString("utf8"))).description
           ),
           manifestSha256: F,
           channels: b
         });
       }
-      h.sort(
-        (v, $) => Qr.compare($.description.id.version, v.description.id.version)
+      d.sort(
+        (E, v) => Qr.compare(v.description.id.version, E.description.id.version)
       ), e !== "dry-run" && await this.storage.putFile(
-        s,
+        n,
         Buffer.from(
-          JSON.stringify({ schema: "v2", versions: h })
+          JSON.stringify({ schema: "v2", versions: d })
         )
-      ), this.logger.info(`Done (${h.length} records)`);
-      const m = /* @__PURE__ */ new Set();
-      for (const v of h) for (const $ of v.channels) m.add($);
-      i = i.filter(
-        (v) => v.id.organization !== f.package.organization || v.id.name !== f.package.name
+      ), this.logger.info(`Done (${d.length} records)`);
+      const w = /* @__PURE__ */ new Set();
+      for (const E of d) for (const v of E.channels) w.add(v);
+      o = o.filter(
+        (E) => E.id.organization !== i.package.organization || E.id.name !== i.package.name
       );
       const p = Ut(
-        `${f.package.organization}/${f.package.name}`
+        `${i.package.organization}/${i.package.name}`
       );
-      i.push({
+      o.push({
         id: {
-          organization: f.package.organization,
-          name: f.package.name
+          organization: i.package.organization,
+          name: i.package.name
         },
         // left for backward compatibility
-        allVersions: h.map((v) => v.description.id.version).reverse(),
-        allVersionsWithChannels: h.map((v) => ({ version: v.description.id.version, channels: v.channels })).reverse(),
+        allVersions: d.map((E) => E.description.id.version).reverse(),
+        allVersionsWithChannels: d.map((E) => ({ version: E.description.id.version, channels: E.channels })).reverse(),
         // left for backward compatibility
-        latest: p.parse(h[0].description),
+        latest: p.parse(d[0].description),
         // left for backward compatibility
-        latestManifestSha256: h[0].manifestSha256,
+        latestManifestSha256: d[0].manifestSha256,
         latestByChannel: Object.fromEntries(
-          [...m, oe].map((v) => {
-            const $ = h.find((N) => v === oe || N.channels.indexOf(v) !== -1);
-            if (!$) throw new Error("Assertion error");
+          [...w, oe].map((E) => {
+            const v = d.find((N) => E === oe || N.channels.indexOf(E) !== -1);
+            if (!v) throw new Error("Assertion error");
             return [
-              v,
+              E,
               {
-                description: p.parse($.description),
-                manifestSha256: $ == null ? void 0 : $.manifestSha256
+                description: p.parse(v.description),
+                manifestSha256: v == null ? void 0 : v.manifestSha256
               }
             ];
           })
@@ -1525,18 +1525,18 @@ class ti {
     e !== "dry-run" && await this.storage.putFile(
       mt,
       Buffer.from(
-        JSON.stringify({ schema: "v2", packages: i })
+        JSON.stringify({ schema: "v2", packages: o })
       )
-    ), this.logger.info(`Global overview updated (${i.length} records)`), e !== "dry-run" && await this.storage.deleteFiles(...n.map((f) => `${It}${f}`)), this.logger.info("Version update requests cleared");
+    ), this.logger.info(`Global overview updated (${o.length} records)`), e !== "dry-run" && await this.storage.deleteFiles(...s.map((i) => `${It}${i}`)), this.logger.info("Version update requests cleared");
   }
   async updateIfNeeded(e = "normal") {
     this.logger.info("Checking if registry requires refresh...");
-    const r = await this.storage.getFile(dt), n = await this.storage.getFile(br);
-    if (e !== "force" && r === void 0 && n === void 0) {
+    const r = await this.storage.getFile(dt), s = await this.storage.getFile(br);
+    if (e !== "force" && r === void 0 && s === void 0) {
       this.logger.info("No global seed files found, update not needed.");
       return;
     }
-    if (e !== "force" && r !== void 0 && n !== void 0 && r.equals(n)) {
+    if (e !== "force" && r !== void 0 && s !== void 0 && r.equals(s)) {
       this.logger.info("Registry is up to date.");
       return;
     }
@@ -1553,48 +1553,48 @@ class ti {
       return Br.parse(JSON.parse(e.toString()));
   }
   async marchChanged(e) {
-    const r = zr(), n = cn(e, r);
-    this.logger.info(`Creating update seed at ${n} ...`), await this.storage.putFile(n, Buffer.from(r)), this.logger.info(`Touching global update seed ${dt} ...`), await this.storage.putFile(dt, Buffer.from(r));
+    const r = zr(), s = cn(e, r);
+    this.logger.info(`Creating update seed at ${s} ...`), await this.storage.putFile(s, Buffer.from(r)), this.logger.info(`Touching global update seed ${dt} ...`), await this.storage.putFile(dt, Buffer.from(r));
   }
   async addPackageToChannel(e, r) {
     if (!r.match(gt))
       throw new Error(`Illegal characters in channel name: ${r}`);
-    const n = ne(e);
-    if (await this.storage.getFile(`${n}/${ie}`) === void 0)
+    const s = ne(e);
+    if (await this.storage.getFile(`${s}/${ie}`) === void 0)
       throw new Error(`Package ${ye(e)} not found in the registry.`);
-    await this.storage.putFile(`${n}/${Ot}/${r}`, Buffer.from(r)), await this.marchChanged(e);
+    await this.storage.putFile(`${s}/${Ot}/${r}`, Buffer.from(r)), await this.marchChanged(e);
   }
   async removePackageFromChannel(e, r) {
     if (!r.match(gt))
       throw new Error(`Illegal characters in channel name: ${r}`);
-    const n = ne(e);
-    if (await this.storage.getFile(`${n}/${ie}`) === void 0)
+    const s = ne(e);
+    if (await this.storage.getFile(`${s}/${ie}`) === void 0)
       throw new Error(`Package ${ye(e)} not found in the registry.`);
-    await this.storage.deleteFiles(`${n}/${Ot}/${r}`), await this.marchChanged(e);
+    await this.storage.deleteFiles(`${s}/${Ot}/${r}`), await this.marchChanged(e);
   }
   async publishPackage(e, r) {
-    const n = ne(e.description.id);
-    for (const l of e.files) {
-      const c = await r(l.name);
-      if (c.length !== l.size)
+    const s = ne(e.description.id);
+    for (const u of e.files) {
+      const c = await r(u.name);
+      if (c.length !== u.size)
         throw new Error(
-          `Actual file size don't match file size from the manifest file for ${l.name} (actual = ${c.length}; manifest = ${l.size})`
+          `Actual file size don't match file size from the manifest file for ${u.name} (actual = ${c.length}; manifest = ${u.size})`
         );
-      const d = await St(c);
-      if (d !== l.sha256.toUpperCase())
+      const h = await St(c);
+      if (h !== u.sha256.toUpperCase())
         throw new Error(
-          `Actual file SHA-256 don't match the checksum from the manifest file for ${l.name} (actual = ${d}; manifest = ${l.sha256.toUpperCase()})`
+          `Actual file SHA-256 don't match the checksum from the manifest file for ${u.name} (actual = ${h}; manifest = ${u.sha256.toUpperCase()})`
         );
-      const i = n + "/" + l.name;
-      this.logger.info(`Uploading ${l.name} -> ${i} ...`), await this.storage.putFile(i, c);
+      const o = s + "/" + u.name;
+      this.logger.info(`Uploading ${u.name} -> ${o} ...`), await this.storage.putFile(o, c);
     }
-    const a = n + "/" + ie;
+    const a = s + "/" + ie;
     this.logger.info(`Uploading manifest to ${a} ...`), await this.storage.putFile(a, Buffer.from(JSON.stringify(e))), await this.marchChanged(e.description.id);
   }
 }
 class vn {
-  constructor(e, r, n) {
-    this.client = e, this.bucket = r, this.root = n;
+  constructor(e, r, s) {
+    this.client = e, this.bucket = r, this.root = s;
   }
   async getFile(e) {
     try {
@@ -1610,15 +1610,15 @@ class vn {
     }
   }
   async listFiles(e) {
-    const r = U.join(this.root, e), n = Rs(
+    const r = U.join(this.root, e), s = Rs(
       { client: this.client },
       {
         Bucket: this.bucket,
         Prefix: r
       }
     ), a = [];
-    for await (const l of n)
-      a.push(...(l.Contents ?? []).map((c) => U.relative(r, c.Key)));
+    for await (const u of s)
+      a.push(...(u.Contents ?? []).map((c) => U.relative(r, c.Key)));
     return a;
   }
   async putFile(e, r) {
@@ -1632,8 +1632,8 @@ class vn {
     const r = await this.client.deleteObjects({
       Bucket: this.bucket,
       Delete: {
-        Objects: e.map((n) => ({
-          Key: U.join(this.root, n)
+        Objects: e.map((s) => ({
+          Key: U.join(this.root, s)
         }))
       }
     });
@@ -1663,8 +1663,8 @@ class $n {
   async listFiles(e) {
     try {
       const r = this.toAbsolutePath(e);
-      return (await K.promises.readdir(r, { recursive: !0, withFileTypes: !0 })).filter((n) => n.isFile()).map(
-        (n) => B.relative(r, B.resolve(n.path, n.name)).split(B.sep).join(U.sep)
+      return (await K.promises.readdir(r, { recursive: !0, withFileTypes: !0 })).filter((s) => s.isFile()).map(
+        (s) => B.relative(r, B.resolve(s.path, s.name)).split(B.sep).join(U.sep)
       );
     } catch (r) {
       if (r.code == "ENOENT") return [];
@@ -1672,8 +1672,8 @@ class $n {
     }
   }
   async putFile(e, r) {
-    const n = this.toAbsolutePath(e);
-    await K.promises.mkdir(B.dirname(n), { recursive: !0 }), await K.promises.writeFile(n, r);
+    const s = this.toAbsolutePath(e);
+    await K.promises.mkdir(B.dirname(s), { recursive: !0 }), await K.promises.writeFile(s, r);
   }
   async deleteFiles(...e) {
     for (const r of e) await K.promises.rm(this.toAbsolutePath(r));
@@ -1686,10 +1686,10 @@ function Rn(t) {
       const r = B.resolve(e.pathname);
       return new $n(r);
     case "s3:":
-      const n = {}, a = e.searchParams.get("region");
-      a && (n.region = a);
-      const l = e.hostname;
-      return new vn(new $s(n), l, e.pathname.replace(/^\//, ""));
+      const s = {}, a = e.searchParams.get("region");
+      a && (s.region = a);
+      const u = e.hostname;
+      return new vn(new $s(s), u, e.pathname.replace(/^\//, ""));
     default:
       throw new Error(`Unknown protocol: ${e.protocol}`);
   }
@@ -1731,59 +1731,59 @@ class kn {
     return new Ln(this.storage, e);
   }
   async updateRegistry() {
-    var c, d, i, f, s, o, u, h;
+    var c, h, o, i, n, l, f, d;
     (c = this.logger) == null || c.info("Initiating registry refresh...");
-    const e = /* @__PURE__ */ new Map(), r = [], n = await this.storage.listFiles(Pt);
-    (d = this.logger) == null || d.info("Packages to be updated:");
-    for (const m of n) {
-      const p = m.match(Nn);
+    const e = /* @__PURE__ */ new Map(), r = [], s = await this.storage.listFiles(Pt);
+    (h = this.logger) == null || h.info("Packages to be updated:");
+    for (const w of s) {
+      const p = w.match(Nn);
       if (!p) continue;
-      r.push(m);
-      const { packageKeyWithoutVersion: v, organization: $, pkg: N, version: I, seed: F } = p.groups;
-      let b = e.get(v);
-      b ? b.versions.has(I) || b.versions.add(I) : e.set(v, {
-        package: { organization: $, package: N },
+      r.push(w);
+      const { packageKeyWithoutVersion: E, organization: v, pkg: N, version: I, seed: F } = p.groups;
+      let b = e.get(E);
+      b ? b.versions.has(I) || b.versions.add(I) : e.set(E, {
+        package: { organization: v, package: N },
         versions: /* @__PURE__ */ new Set([I])
-      }), (i = this.logger) == null || i.info(`  - ${$}:${N}:${I}`);
+      }), (o = this.logger) == null || o.info(`  - ${v}:${N}:${I}`);
     }
     const a = await this.storage.getFile(Et);
-    let l = a === void 0 ? [] : JSON.parse(a.toString());
-    (f = this.logger) == null || f.info(`Global overview loaded, ${l.length} records`);
-    for (const [, m] of e.entries()) {
-      const p = _r(m.package), v = await this.storage.getFile(p);
-      let $ = v === void 0 ? [] : JSON.parse(v.toString());
-      (s = this.logger) == null || s.info(
-        `Updating ${m.package.organization}:${m.package.package} overview, ${$.length} records`
-      ), $ = $.filter((N) => !m.versions.has(N.version));
-      for (const [N] of m.versions.entries()) {
+    let u = a === void 0 ? [] : JSON.parse(a.toString());
+    (i = this.logger) == null || i.info(`Global overview loaded, ${u.length} records`);
+    for (const [, w] of e.entries()) {
+      const p = _r(w.package), E = await this.storage.getFile(p);
+      let v = E === void 0 ? [] : JSON.parse(E.toString());
+      (n = this.logger) == null || n.info(
+        `Updating ${w.package.organization}:${w.package.package} overview, ${v.length} records`
+      ), v = v.filter((N) => !w.versions.has(N.version));
+      for (const [N] of w.versions.entries()) {
         const I = N.toString(), F = await this.storage.getFile(
           ss(
             {
-              ...m.package,
+              ...w.package,
               version: I
             },
             ns
           )
         );
-        F && $.push({ version: I, meta: JSON.parse(F.toString()) });
+        F && v.push({ version: I, meta: JSON.parse(F.toString()) });
       }
-      $.sort((N, I) => on.compare(I.version, N.version)), await this.storage.putFile(p, Buffer.from(JSON.stringify($))), (o = this.logger) == null || o.info(`Done (${$.length} records)`), l = l.filter(
-        (N) => N.organization !== m.package.organization || N.package !== m.package.package
-      ), l.push({
-        organization: m.package.organization,
-        package: m.package.package,
-        allVersions: $.map((N) => N.version).reverse(),
-        latestVersion: $[0].version,
-        latestMeta: $[0].meta
+      v.sort((N, I) => on.compare(I.version, N.version)), await this.storage.putFile(p, Buffer.from(JSON.stringify(v))), (l = this.logger) == null || l.info(`Done (${v.length} records)`), u = u.filter(
+        (N) => N.organization !== w.package.organization || N.package !== w.package.package
+      ), u.push({
+        organization: w.package.organization,
+        package: w.package.package,
+        allVersions: v.map((N) => N.version).reverse(),
+        latestVersion: v[0].version,
+        latestMeta: v[0].meta
       });
     }
-    await this.storage.putFile(Et, Buffer.from(JSON.stringify(l))), (u = this.logger) == null || u.info(`Global overview updated (${l.length} records)`), await this.storage.deleteFiles(...r.map((m) => `${Pt}${m}`)), (h = this.logger) == null || h.info("Version update requests cleared");
+    await this.storage.putFile(Et, Buffer.from(JSON.stringify(u))), (f = this.logger) == null || f.info(`Global overview updated (${u.length} records)`), await this.storage.deleteFiles(...r.map((w) => `${Pt}${w}`)), (d = this.logger) == null || d.info("Version update requests cleared");
   }
   async updateIfNeeded(e = !1) {
-    var a, l;
+    var a, u;
     (a = this.logger) == null || a.info("Checking if registry requires refresh...");
-    const r = await this.storage.getFile(is), n = await this.storage.getFile(jr);
-    !e && r === void 0 && n === void 0 || !e && r !== void 0 && n !== void 0 && r.equals(n) || (await this.updateRegistry(), r && (await this.storage.putFile(jr, r), (l = this.logger) == null || l.info("Refresh finished")));
+    const r = await this.storage.getFile(is), s = await this.storage.getFile(jr);
+    !e && r === void 0 && s === void 0 || !e && r !== void 0 && s !== void 0 && r.equals(s) || (await this.updateRegistry(), r && (await this.storage.putFile(jr, r), (u = this.logger) == null || u.info("Refresh finished")));
   }
   async getPackageOverview(e) {
     const r = await this.storage.getFile(_r(e));
@@ -1838,9 +1838,9 @@ class Tn {
   createRegistry(e) {
     let r = this.conf.registry;
     if (!r.startsWith("file:") && !r.startsWith("s3:")) {
-      const n = this.conf.registries[r];
-      if (!n) throw new Error(`Registry with alias "${r}" not found`);
-      r = n;
+      const s = this.conf.registries[r];
+      if (!s) throw new Error(`Registry with alias "${r}" not found`);
+      r = s;
     }
     return new kn(Rn(r), e);
   }
@@ -1932,4 +1932,4 @@ export {
   _r as y,
   ss as z
 };
-//# sourceMappingURL=config-DrI3vxIZ.mjs.map
+//# sourceMappingURL=config-7hVPHpfZ.mjs.map