@bleedingdev/modern-js-utils 3.9.0-ultramodern.8 → 3.9.3-ultramodern.1

package/dist/compiled/semver/index.js

@@ -1,245 +1,7 @@
 (()=>{
+    "use strict";
     var e = {
-        844: (e, t, r)=>{
-            "use strict";
-            const s = r(605);
-            const n = Symbol("max");
-            const i = Symbol("length");
-            const o = Symbol("lengthCalculator");
-            const l = Symbol("allowStale");
-            const a = Symbol("maxAge");
-            const h = Symbol("dispose");
-            const c = Symbol("noDisposeOnSet");
-            const u = Symbol("lruList");
-            const f = Symbol("cache");
-            const p = Symbol("updateAgeOnGet");
-            const naiveLength = ()=>1;
-            class LRUCache {
-                constructor(e){
-                    if ("number" == typeof e) e = {
-                        max: e
-                    };
-                    if (!e) e = {};
-                    if (e.max && ("number" != typeof e.max || e.max < 0)) throw new TypeError("max must be a non-negative number");
-                    this[n] = e.max || 1 / 0;
-                    const r = e.length || naiveLength;
-                    this[o] = "function" != typeof r ? naiveLength : r;
-                    this[l] = e.stale || false;
-                    if (e.maxAge && "number" != typeof e.maxAge) throw new TypeError("maxAge must be a number");
-                    this[a] = e.maxAge || 0;
-                    this[h] = e.dispose;
-                    this[c] = e.noDisposeOnSet || false;
-                    this[p] = e.updateAgeOnGet || false;
-                    this.reset();
-                }
-                set max(e) {
-                    if ("number" != typeof e || e < 0) throw new TypeError("max must be a non-negative number");
-                    this[n] = e || 1 / 0;
-                    trim(this);
-                }
-                get max() {
-                    return this[n];
-                }
-                set allowStale(e) {
-                    this[l] = !!e;
-                }
-                get allowStale() {
-                    return this[l];
-                }
-                set maxAge(e) {
-                    if ("number" != typeof e) throw new TypeError("maxAge must be a non-negative number");
-                    this[a] = e;
-                    trim(this);
-                }
-                get maxAge() {
-                    return this[a];
-                }
-                set lengthCalculator(e) {
-                    if ("function" != typeof e) e = naiveLength;
-                    if (e !== this[o]) {
-                        this[o] = e;
-                        this[i] = 0;
-                        this[u].forEach((e)=>{
-                            e.length = this[o](e.value, e.key);
-                            this[i] += e.length;
-                        });
-                    }
-                    trim(this);
-                }
-                get lengthCalculator() {
-                    return this[o];
-                }
-                get length() {
-                    return this[i];
-                }
-                get itemCount() {
-                    return this[u].length;
-                }
-                rforEach(e, t) {
-                    t = t || this;
-                    for(let r = this[u].tail; null !== r;){
-                        const s = r.prev;
-                        forEachStep(this, e, r, t);
-                        r = s;
-                    }
-                }
-                forEach(e, t) {
-                    t = t || this;
-                    for(let r = this[u].head; null !== r;){
-                        const s = r.next;
-                        forEachStep(this, e, r, t);
-                        r = s;
-                    }
-                }
-                keys() {
-                    return this[u].toArray().map((e)=>e.key);
-                }
-                values() {
-                    return this[u].toArray().map((e)=>e.value);
-                }
-                reset() {
-                    if (this[h] && this[u] && this[u].length) this[u].forEach((e)=>this[h](e.key, e.value));
-                    this[f] = new Map;
-                    this[u] = new s;
-                    this[i] = 0;
-                }
-                dump() {
-                    return this[u].map((e)=>isStale(this, e) ? false : {
-                            k: e.key,
-                            v: e.value,
-                            e: e.now + (e.maxAge || 0)
-                        }).toArray().filter((e)=>e);
-                }
-                dumpLru() {
-                    return this[u];
-                }
-                set(e, t, r) {
-                    r = r || this[a];
-                    if (r && "number" != typeof r) throw new TypeError("maxAge must be a number");
-                    const s = r ? Date.now() : 0;
-                    const l = this[o](t, e);
-                    if (this[f].has(e)) {
-                        if (l > this[n]) {
-                            del(this, this[f].get(e));
-                            return false;
-                        }
-                        const o = this[f].get(e);
-                        const a = o.value;
-                        if (this[h]) {
-                            if (!this[c]) this[h](e, a.value);
-                        }
-                        a.now = s;
-                        a.maxAge = r;
-                        a.value = t;
-                        this[i] += l - a.length;
-                        a.length = l;
-                        this.get(e);
-                        trim(this);
-                        return true;
-                    }
-                    const p = new Entry(e, t, l, s, r);
-                    if (p.length > this[n]) {
-                        if (this[h]) this[h](e, t);
-                        return false;
-                    }
-                    this[i] += p.length;
-                    this[u].unshift(p);
-                    this[f].set(e, this[u].head);
-                    trim(this);
-                    return true;
-                }
-                has(e) {
-                    if (!this[f].has(e)) return false;
-                    const t = this[f].get(e).value;
-                    return !isStale(this, t);
-                }
-                get(e) {
-                    return get(this, e, true);
-                }
-                peek(e) {
-                    return get(this, e, false);
-                }
-                pop() {
-                    const e = this[u].tail;
-                    if (!e) return null;
-                    del(this, e);
-                    return e.value;
-                }
-                del(e) {
-                    del(this, this[f].get(e));
-                }
-                load(e) {
-                    this.reset();
-                    const t = Date.now();
-                    for(let r = e.length - 1; r >= 0; r--){
-                        const s = e[r];
-                        const n = s.e || 0;
-                        if (0 === n) this.set(s.k, s.v);
-                        else {
-                            const e = n - t;
-                            if (e > 0) this.set(s.k, s.v, e);
-                        }
-                    }
-                }
-                prune() {
-                    this[f].forEach((e, t)=>get(this, t, false));
-                }
-            }
-            const get = (e, t, r)=>{
-                const s = e[f].get(t);
-                if (s) {
-                    const t = s.value;
-                    if (isStale(e, t)) {
-                        del(e, s);
-                        if (!e[l]) return;
-                    } else if (r) {
-                        if (e[p]) s.value.now = Date.now();
-                        e[u].unshiftNode(s);
-                    }
-                    return t.value;
-                }
-            };
-            const isStale = (e, t)=>{
-                if (!t || !t.maxAge && !e[a]) return false;
-                const r = Date.now() - t.now;
-                return t.maxAge ? r > t.maxAge : e[a] && r > e[a];
-            };
-            const trim = (e)=>{
-                if (e[i] > e[n]) for(let t = e[u].tail; e[i] > e[n] && null !== t;){
-                    const r = t.prev;
-                    del(e, t);
-                    t = r;
-                }
-            };
-            const del = (e, t)=>{
-                if (t) {
-                    const r = t.value;
-                    if (e[h]) e[h](r.key, r.value);
-                    e[i] -= r.length;
-                    e[f].delete(r.key);
-                    e[u].removeNode(t);
-                }
-            };
-            class Entry {
-                constructor(e, t, r, s, n){
-                    this.key = e;
-                    this.value = t;
-                    this.length = r;
-                    this.now = s;
-                    this.maxAge = n || 0;
-                }
-            }
-            const forEachStep = (e, t, r, s)=>{
-                let n = r.value;
-                if (isStale(e, n)) {
-                    del(e, r);
-                    if (!e[l]) n = void 0;
-                }
-                if (n) t.call(s, n.value, n.key, e);
-            };
-            e.exports = LRUCache;
-        },
-        584: (e, t, r)=>{
+        296: (e, t, r)=>{
             const s = Symbol("SemVer ANY");
             class Comparator {
                 static get ANY() {
@@ -247,48 +9,47 @@
                 }
                 constructor(e, t){
                     t = n(t);
-                    if (e instanceof Comparator) if (!!t.loose === e.loose) return e;
+                    if (e instanceof Comparator) if (e.loose === !!t.loose) return e;
                     else e = e.value;
                     e = e.trim().split(/\s+/).join(" ");
-                    a("comparator", e, t);
+                    c("comparator", e, t);
                     this.options = t;
                     this.loose = !!t.loose;
                     this.parse(e);
                     if (this.semver === s) this.value = "";
                     else this.value = this.operator + this.semver.version;
-                    a("comp", this);
+                    c("comp", this);
                 }
                 parse(e) {
-                    const t = this.options.loose ? i[o.COMPARATORLOOSE] : i[o.COMPARATOR];
+                    const t = this.options.loose ? o[i.COMPARATORLOOSE] : o[i.COMPARATOR];
                     const r = e.match(t);
                     if (!r) throw new TypeError(`Invalid comparator: ${e}`);
                     this.operator = void 0 !== r[1] ? r[1] : "";
                     if ("=" === this.operator) this.operator = "";
-                    if (r[2]) this.semver = new h(r[2], this.options.loose);
+                    if (r[2]) this.semver = new l(r[2], this.options.loose);
                     else this.semver = s;
                 }
                 toString() {
                     return this.value;
                 }
                 test(e) {
-                    a("Comparator.test", e, this.options.loose);
+                    c("Comparator.test", e, this.options.loose);
                     if (this.semver === s || e === s) return true;
                     if ("string" == typeof e) try {
-                        e = new h(e, this.options);
+                        e = new l(e, this.options);
                     } catch (e) {
                         return false;
                     }
-                    return l(e, this.operator, this.semver, this.options);
+                    return a(e, this.operator, this.semver, this.options);
                 }
                 intersects(e, t) {
                     if (!(e instanceof Comparator)) throw new TypeError("a Comparator is required");
                     if ("" === this.operator) {
                         if ("" === this.value) return true;
-                        return new c(e.value, t).test(this.value);
-                    }
-                    if ("" === e.operator) {
+                        return new p(e.value, t).test(this.value);
+                    } else if ("" === e.operator) {
                         if ("" === e.value) return true;
-                        return new c(this.value, t).test(e.semver);
+                        return new p(this.value, t).test(e.semver);
                     }
                     t = n(t);
                     if (t.includePrerelease && ("<0.0.0-0" === this.value || "<0.0.0-0" === e.value)) return false;
@@ -296,39 +57,40 @@
                     if (this.operator.startsWith(">") && e.operator.startsWith(">")) return true;
                     if (this.operator.startsWith("<") && e.operator.startsWith("<")) return true;
                     if (this.semver.version === e.semver.version && this.operator.includes("=") && e.operator.includes("=")) return true;
-                    if (l(this.semver, "<", e.semver, t) && this.operator.startsWith(">") && e.operator.startsWith("<")) return true;
-                    if (l(this.semver, ">", e.semver, t) && this.operator.startsWith("<") && e.operator.startsWith(">")) return true;
+                    if (a(this.semver, "<", e.semver, t) && this.operator.startsWith(">") && e.operator.startsWith("<")) return true;
+                    if (a(this.semver, ">", e.semver, t) && this.operator.startsWith("<") && e.operator.startsWith(">")) return true;
                     return false;
                 }
             }
             e.exports = Comparator;
-            const n = r(110);
-            const { safeRe: i, t: o } = r(258);
-            const l = r(159);
-            const a = r(935);
-            const h = r(649);
-            const c = r(530);
+            const n = r(83);
+            const { safeRe: o, t: i } = r(302);
+            const a = r(279);
+            const c = r(600);
+            const l = r(628);
+            const p = r(991);
         },
-        530: (e, t, r)=>{
+        991: (e, t, r)=>{
+            const s = /\s+/g;
             class Range {
                 constructor(e, t){
                     t = i(t);
-                    if (e instanceof Range) if (!!t.loose === e.loose && !!t.includePrerelease === e.includePrerelease) return e;
+                    if (e instanceof Range) if (e.loose === !!t.loose && e.includePrerelease === !!t.includePrerelease) return e;
                     else return new Range(e.raw, t);
-                    if (e instanceof o) {
+                    if (e instanceof a) {
                         this.raw = e.value;
                         this.set = [
                             [
                                 e
                             ]
                         ];
-                        this.format();
+                        this.formatted = void 0;
                         return this;
                     }
                     this.options = t;
                     this.loose = !!t.loose;
                     this.includePrerelease = !!t.includePrerelease;
-                    this.raw = e.trim().split(/\s+/).join(" ");
+                    this.raw = e.trim().replace(s, " ");
                     this.set = this.raw.split("||").map((e)=>this.parseRange(e.trim())).filter((e)=>e.length);
                     if (!this.set.length) throw new TypeError(`Invalid SemVer Range: ${this.raw}`);
                     if (this.set.length > 1) {
@@ -346,49 +108,63 @@
                             }
                         }
                     }
-                    this.format();
+                    this.formatted = void 0;
+                }
+                get range() {
+                    if (void 0 === this.formatted) {
+                        this.formatted = "";
+                        for(let e = 0; e < this.set.length; e++){
+                            if (e > 0) this.formatted += "||";
+                            const t = this.set[e];
+                            for(let e = 0; e < t.length; e++){
+                                if (e > 0) this.formatted += " ";
+                                this.formatted += t[e].toString().trim();
+                            }
+                        }
+                    }
+                    return this.formatted;
                 }
                 format() {
-                    this.range = this.set.map((e)=>e.join(" ").trim()).join("||").trim();
                     return this.range;
                 }
                 toString() {
                     return this.range;
                 }
                 parseRange(e) {
-                    const t = (this.options.includePrerelease && E) | (this.options.loose && m);
+                    e = e.replace(I, "");
+                    const t = (this.options.includePrerelease && $) | (this.options.loose && R);
                     const r = t + ":" + e;
-                    const s = n.get(r);
+                    const s = o.get(r);
                     if (s) return s;
-                    const i = this.options.loose;
-                    const a = i ? h[c.HYPHENRANGELOOSE] : h[c.HYPHENRANGE];
-                    e = e.replace(a, hyphenReplace(this.options.includePrerelease));
-                    l("hyphen replace", e);
-                    e = e.replace(h[c.COMPARATORTRIM], u);
-                    l("comparator trim", e);
-                    e = e.replace(h[c.TILDETRIM], f);
-                    l("tilde trim", e);
-                    e = e.replace(h[c.CARETTRIM], p);
-                    l("caret trim", e);
-                    let v = e.split(" ").map((e)=>parseComparator(e, this.options)).join(" ").split(/\s+/).map((e)=>replaceGTE0(e, this.options));
-                    if (i) v = v.filter((e)=>{
-                        l("loose invalid filter", e, this.options);
-                        return !!e.match(h[c.COMPARATORLOOSE]);
+                    const n = this.options.loose;
+                    const i = n ? p[E.HYPHENRANGELOOSE] : p[E.HYPHENRANGE];
+                    e = e.replace(i, hyphenReplace(this.options.includePrerelease));
+                    c("hyphen replace", e);
+                    e = e.replace(p[E.COMPARATORTRIM], h);
+                    c("comparator trim", e);
+                    e = e.replace(p[E.TILDETRIM], u);
+                    c("tilde trim", e);
+                    e = e.replace(p[E.CARETTRIM], m);
+                    c("caret trim", e);
+                    let l = e.split(" ").map((e)=>parseComparator(e, this.options)).join(" ").split(/\s+/).map((e)=>replaceGTE0(e, this.options));
+                    if (n) l = l.filter((e)=>{
+                        c("loose invalid filter", e, this.options);
+                        return !!e.match(p[E.COMPARATORLOOSE]);
                     });
-                    l("range list", v);
-                    const $ = new Map;
-                    const R = v.map((e)=>new o(e, this.options));
-                    for (const e of R){
+                    c("range list", l);
+                    const f = new Map;
+                    const L = l.map((e)=>new a(e, this.options));
+                    for (const e of L){
                         if (isNullSet(e)) return [
                             e
                         ];
-                        $.set(e.value, e);
+                        f.set(e.value, e);
                     }
-                    if ($.size > 1 && $.has("")) $.delete("");
+                    if (f.size > 1 && f.has("")) f.delete("");
                     const d = [
-                        ...$.values()
+                        ...f.values()
                     ];
-                    n.set(r, d);
+                    o.set(r, d);
                     return d;
                 }
                 intersects(e, t) {
@@ -398,7 +174,7 @@
                 test(e) {
                     if (!e) return false;
                     if ("string" == typeof e) try {
-                        e = new a(e, this.options);
+                        e = new l(e, this.options);
                     } catch (e) {
                         return false;
                     }
@@ -407,16 +183,15 @@
                 }
             }
             e.exports = Range;
-            const s = r(844);
-            const n = new s({
-                max: 1e3
-            });
-            const i = r(110);
-            const o = r(584);
-            const l = r(935);
-            const a = r(649);
-            const { safeRe: h, t: c, comparatorTrimReplace: u, tildeTrimReplace: f, caretTrimReplace: p } = r(258);
-            const { FLAG_INCLUDE_PRERELEASE: E, FLAG_LOOSE: m } = r(745);
+            const n = r(26);
+            const o = new n;
+            const i = r(83);
+            const a = r(296);
+            const c = r(600);
+            const l = r(628);
+            const { safeRe: p, src: f, t: E, comparatorTrimReplace: h, tildeTrimReplace: u, caretTrimReplace: m } = r(302);
+            const { FLAG_INCLUDE_PRERELEASE: $, FLAG_LOOSE: R } = r(842);
+            const I = new RegExp(f[E.BUILD], "g");
             const isNullSet = (e)=>"<0.0.0-0" === e.value;
             const isAny = (e)=>"" === e.value;
             const isSatisfiable = (e, t)=>{
@@ -430,118 +205,122 @@
                 return r;
             };
             const parseComparator = (e, t)=>{
-                l("comp", e, t);
+                e = e.replace(p[E.BUILD], "");
+                c("comp", e, t);
                 e = replaceCarets(e, t);
-                l("caret", e);
+                c("caret", e);
                 e = replaceTildes(e, t);
-                l("tildes", e);
+                c("tildes", e);
                 e = replaceXRanges(e, t);
-                l("xrange", e);
+                c("xrange", e);
                 e = replaceStars(e, t);
-                l("stars", e);
+                c("stars", e);
                 return e;
             };
             const isX = (e)=>!e || "x" === e.toLowerCase() || "*" === e;
+            const invalidXRangeOrder = (e, t, r)=>isX(e) && !isX(t) || isX(t) && r && !isX(r);
             const replaceTildes = (e, t)=>e.trim().split(/\s+/).map((e)=>replaceTilde(e, t)).join(" ");
             const replaceTilde = (e, t)=>{
-                const r = t.loose ? h[c.TILDELOOSE] : h[c.TILDE];
-                return e.replace(r, (t, r, s, n, i)=>{
-                    l("tilde", e, t, r, s, n, i);
-                    let o;
-                    if (isX(r)) o = "";
-                    else if (isX(s)) o = `>=${r}.0.0 <${+r + 1}.0.0-0`;
-                    else if (isX(n)) o = `>=${r}.${s}.0 <${r}.${+s + 1}.0-0`;
+                const r = t.loose ? p[E.TILDELOOSE] : p[E.TILDE];
+                const s = t.includePrerelease ? "-0" : "";
+                return e.replace(r, (t, r, n, o, i)=>{
+                    c("tilde", e, t, r, n, o, i);
+                    let a;
+                    if (isX(r)) a = "";
+                    else if (isX(n)) a = `>=${r}.0.0${s} <${+r + 1}.0.0-0`;
+                    else if (isX(o)) a = `>=${r}.${n}.0${s} <${r}.${+n + 1}.0-0`;
                     else if (i) {
-                        l("replaceTilde pr", i);
-                        o = `>=${r}.${s}.${n}-${i} <${r}.${+s + 1}.0-0`;
-                    } else o = `>=${r}.${s}.${n} <${r}.${+s + 1}.0-0`;
-                    l("tilde return", o);
-                    return o;
+                        c("replaceTilde pr", i);
+                        a = `>=${r}.${n}.${o}-${i} <${r}.${+n + 1}.0-0`;
+                    } else a = `>=${r}.${n}.${o} <${r}.${+n + 1}.0-0`;
+                    c("tilde return", a);
+                    return a;
                 });
             };
             const replaceCarets = (e, t)=>e.trim().split(/\s+/).map((e)=>replaceCaret(e, t)).join(" ");
             const replaceCaret = (e, t)=>{
-                l("caret", e, t);
-                const r = t.loose ? h[c.CARETLOOSE] : h[c.CARET];
+                c("caret", e, t);
+                const r = t.loose ? p[E.CARETLOOSE] : p[E.CARET];
                 const s = t.includePrerelease ? "-0" : "";
-                return e.replace(r, (t, r, n, i, o)=>{
-                    l("caret", e, t, r, n, i, o);
+                return e.replace(r, (t, r, n, o, i)=>{
+                    c("caret", e, t, r, n, o, i);
                     let a;
                     if (isX(r)) a = "";
                     else if (isX(n)) a = `>=${r}.0.0${s} <${+r + 1}.0.0-0`;
-                    else if (isX(i)) a = "0" === r ? `>=${r}.${n}.0${s} <${r}.${+n + 1}.0-0` : `>=${r}.${n}.0${s} <${+r + 1}.0.0-0`;
-                    else if (o) {
-                        l("replaceCaret pr", o);
-                        a = "0" === r ? "0" === n ? `>=${r}.${n}.${i}-${o} <${r}.${n}.${+i + 1}-0` : `>=${r}.${n}.${i}-${o} <${r}.${+n + 1}.0-0` : `>=${r}.${n}.${i}-${o} <${+r + 1}.0.0-0`;
+                    else if (isX(o)) a = "0" === r ? `>=${r}.${n}.0${s} <${r}.${+n + 1}.0-0` : `>=${r}.${n}.0${s} <${+r + 1}.0.0-0`;
+                    else if (i) {
+                        c("replaceCaret pr", i);
+                        a = "0" === r ? "0" === n ? `>=${r}.${n}.${o}-${i} <${r}.${n}.${+o + 1}-0` : `>=${r}.${n}.${o}-${i} <${r}.${+n + 1}.0-0` : `>=${r}.${n}.${o}-${i} <${+r + 1}.0.0-0`;
                     } else {
-                        l("no pr");
-                        a = "0" === r ? "0" === n ? `>=${r}.${n}.${i}${s} <${r}.${n}.${+i + 1}-0` : `>=${r}.${n}.${i}${s} <${r}.${+n + 1}.0-0` : `>=${r}.${n}.${i} <${+r + 1}.0.0-0`;
+                        c("no pr");
+                        a = "0" === r ? "0" === n ? `>=${r}.${n}.${o} <${r}.${n}.${+o + 1}-0` : `>=${r}.${n}.${o} <${r}.${+n + 1}.0-0` : `>=${r}.${n}.${o} <${+r + 1}.0.0-0`;
                     }
-                    l("caret return", a);
+                    c("caret return", a);
                     return a;
                 });
             };
             const replaceXRanges = (e, t)=>{
-                l("replaceXRanges", e, t);
+                c("replaceXRanges", e, t);
                 return e.split(/\s+/).map((e)=>replaceXRange(e, t)).join(" ");
             };
             const replaceXRange = (e, t)=>{
                 e = e.trim();
-                const r = t.loose ? h[c.XRANGELOOSE] : h[c.XRANGE];
-                return e.replace(r, (r, s, n, i, o, a)=>{
-                    l("xRange", e, r, s, n, i, o, a);
-                    const h = isX(n);
-                    const c = h || isX(i);
-                    const u = c || isX(o);
-                    const f = u;
-                    if ("=" === s && f) s = "";
+                const r = t.loose ? p[E.XRANGELOOSE] : p[E.XRANGE];
+                return e.replace(r, (r, s, n, o, i, a)=>{
+                    c("xRange", e, r, s, n, o, i, a);
+                    if (invalidXRangeOrder(n, o, i)) return e;
+                    const l = isX(n);
+                    const p = l || isX(o);
+                    const f = p || isX(i);
+                    const E = f;
+                    if ("=" === s && E) s = "";
                     a = t.includePrerelease ? "-0" : "";
-                    if (h) r = ">" === s || "<" === s ? "<0.0.0-0" : "*";
-                    else if (s && f) {
-                        if (c) i = 0;
-                        o = 0;
+                    if (l) r = ">" === s || "<" === s ? "<0.0.0-0" : "*";
+                    else if (s && E) {
+                        if (p) o = 0;
+                        i = 0;
                         if (">" === s) {
                             s = ">=";
-                            if (c) {
+                            if (p) {
                                 n = +n + 1;
-                                i = 0;
                                 o = 0;
+                                i = 0;
                             } else {
-                                i = +i + 1;
-                                o = 0;
+                                o = +o + 1;
+                                i = 0;
                             }
                         } else if ("<=" === s) {
                             s = "<";
-                            if (c) n = +n + 1;
-                            else i = +i + 1;
+                            if (p) n = +n + 1;
+                            else o = +o + 1;
                         }
                         if ("<" === s) a = "-0";
-                        r = `${s + n}.${i}.${o}${a}`;
-                    } else if (c) r = `>=${n}.0.0${a} <${+n + 1}.0.0-0`;
-                    else if (u) r = `>=${n}.${i}.0${a} <${n}.${+i + 1}.0-0`;
-                    l("xRange return", r);
+                        r = `${s + n}.${o}.${i}${a}`;
+                    } else if (p) r = `>=${n}.0.0${a} <${+n + 1}.0.0-0`;
+                    else if (f) r = `>=${n}.${o}.0${a} <${n}.${+o + 1}.0-0`;
+                    c("xRange return", r);
                     return r;
                 });
             };
             const replaceStars = (e, t)=>{
-                l("replaceStars", e, t);
-                return e.trim().replace(h[c.STAR], "");
+                c("replaceStars", e, t);
+                return e.trim().replace(p[E.STAR], "");
             };
             const replaceGTE0 = (e, t)=>{
-                l("replaceGTE0", e, t);
-                return e.trim().replace(h[t.includePrerelease ? c.GTE0PRE : c.GTE0], "");
+                c("replaceGTE0", e, t);
+                return e.trim().replace(p[t.includePrerelease ? E.GTE0PRE : E.GTE0], "");
             };
-            const hyphenReplace = (e)=>(t, r, s, n, i, o, l, a, h, c, u, f, p)=>{
-                    r = isX(s) ? "" : isX(n) ? `>=${s}.0.0${e ? "-0" : ""}` : isX(i) ? `>=${s}.${n}.0${e ? "-0" : ""}` : o ? `>=${r}` : `>=${r}${e ? "-0" : ""}`;
-                    a = isX(h) ? "" : isX(c) ? `<${+h + 1}.0.0-0` : isX(u) ? `<${h}.${+c + 1}.0-0` : f ? `<=${h}.${c}.${u}-${f}` : e ? `<${h}.${c}.${+u + 1}-0` : `<=${a}`;
-                    return `${r} ${a}`.trim();
+            const hyphenReplace = (e)=>(t, r, s, n, o, i, a, c, l, p, f, E)=>{
+                    r = isX(s) ? "" : isX(n) ? `>=${s}.0.0${e ? "-0" : ""}` : isX(o) ? `>=${s}.${n}.0${e ? "-0" : ""}` : i ? `>=${r}` : `>=${r}${e ? "-0" : ""}`;
+                    c = isX(l) ? "" : isX(p) ? `<${+l + 1}.0.0-0` : isX(f) ? `<${l}.${+p + 1}.0-0` : E ? `<=${l}.${p}.${f}-${E}` : e ? `<${l}.${p}.${+f + 1}-0` : `<=${c}`;
+                    return `${r} ${c}`.trim();
                 };
             const testSet = (e, t, r)=>{
                 for(let r = 0; r < e.length; r++)if (!e[r].test(t)) return false;
                 if (t.prerelease.length && !r.includePrerelease) {
                     for(let r = 0; r < e.length; r++){
-                        l(e[r].semver);
-                        if (e[r].semver !== o.ANY) {
+                        c(e[r].semver);
+                        if (e[r].semver !== a.ANY) {
                             if (e[r].semver.prerelease.length > 0) {
                                 const s = e[r].semver;
                                 if (s.major === t.major && s.minor === t.minor && s.patch === t.patch) return true;
@@ -553,16 +332,22 @@
                 return true;
             };
         },
-        649: (e, t, r)=>{
-            const s = r(935);
-            const { MAX_LENGTH: n, MAX_SAFE_INTEGER: i } = r(745);
-            const { safeRe: o, t: l } = r(258);
-            const a = r(110);
-            const { compareIdentifiers: h } = r(74);
+        628: (e, t, r)=>{
+            const s = r(600);
+            const { MAX_LENGTH: n, MAX_SAFE_INTEGER: o } = r(842);
+            const { safeRe: i, t: a } = r(302);
+            const c = r(83);
+            const { compareIdentifiers: l } = r(859);
+            const isPrereleaseIdentifier = (e, t)=>{
+                const r = t.split(".");
+                if (r.length > e.length) return false;
+                for(let t = 0; t < r.length; t++)if (0 !== l(e[t], r[t])) return false;
+                return true;
+            };
             class SemVer {
                 constructor(e, t){
-                    t = a(t);
-                    if (e instanceof SemVer) if (!!t.loose === e.loose && !!t.includePrerelease === e.includePrerelease) return e;
+                    t = c(t);
+                    if (e instanceof SemVer) if (e.loose === !!t.loose && e.includePrerelease === !!t.includePrerelease) return e;
                     else e = e.version;
                     else if ("string" != typeof e) throw new TypeError(`Invalid version. Must be a string. Got type "${typeof e}".`);
                     if (e.length > n) throw new TypeError(`version is longer than ${n} characters`);
@@ -570,19 +355,19 @@
                     this.options = t;
                     this.loose = !!t.loose;
                     this.includePrerelease = !!t.includePrerelease;
-                    const r = e.trim().match(t.loose ? o[l.LOOSE] : o[l.FULL]);
+                    const r = e.trim().match(t.loose ? i[a.LOOSE] : i[a.FULL]);
                     if (!r) throw new TypeError(`Invalid Version: ${e}`);
                     this.raw = e;
                     this.major = +r[1];
                     this.minor = +r[2];
                     this.patch = +r[3];
-                    if (this.major > i || this.major < 0) throw new TypeError("Invalid major version");
-                    if (this.minor > i || this.minor < 0) throw new TypeError("Invalid minor version");
-                    if (this.patch > i || this.patch < 0) throw new TypeError("Invalid patch version");
+                    if (this.major > o || this.major < 0) throw new TypeError("Invalid major version");
+                    if (this.minor > o || this.minor < 0) throw new TypeError("Invalid minor version");
+                    if (this.patch > o || this.patch < 0) throw new TypeError("Invalid patch version");
                     if (r[4]) this.prerelease = r[4].split(".").map((e)=>{
                         if (/^[0-9]+$/.test(e)) {
                             const t = +e;
-                            if (t >= 0 && t < i) return t;
+                            if (t >= 0 && t < o) return t;
                         }
                         return e;
                     });
@@ -609,23 +394,29 @@
                 }
                 compareMain(e) {
                     if (!(e instanceof SemVer)) e = new SemVer(e, this.options);
-                    return h(this.major, e.major) || h(this.minor, e.minor) || h(this.patch, e.patch);
+                    if (this.major < e.major) return -1;
+                    if (this.major > e.major) return 1;
+                    if (this.minor < e.minor) return -1;
+                    if (this.minor > e.minor) return 1;
+                    if (this.patch < e.patch) return -1;
+                    if (this.patch > e.patch) return 1;
+                    return 0;
                 }
                 comparePre(e) {
                     if (!(e instanceof SemVer)) e = new SemVer(e, this.options);
                     if (this.prerelease.length && !e.prerelease.length) return -1;
-                    if (!this.prerelease.length && e.prerelease.length) return 1;
-                    if (!this.prerelease.length && !e.prerelease.length) return 0;
+                    else if (!this.prerelease.length && e.prerelease.length) return 1;
+                    else if (!this.prerelease.length && !e.prerelease.length) return 0;
                     let t = 0;
                     do {
                         const r = this.prerelease[t];
                         const n = e.prerelease[t];
                         s("prerelease compare", t, r, n);
                         if (void 0 === r && void 0 === n) return 0;
-                        if (void 0 === n) return 1;
-                        if (void 0 === r) return -1;
+                        else if (void 0 === n) return 1;
+                        else if (void 0 === r) return -1;
                         else if (r === n) continue;
-                        else return h(r, n);
+                        else return l(r, n);
                     }while (++t);
                 }
                 compareBuild(e) {
@@ -634,15 +425,22 @@
                     do {
                         const r = this.build[t];
                         const n = e.build[t];
-                        s("prerelease compare", t, r, n);
+                        s("build compare", t, r, n);
                         if (void 0 === r && void 0 === n) return 0;
-                        if (void 0 === n) return 1;
-                        if (void 0 === r) return -1;
+                        else if (void 0 === n) return 1;
+                        else if (void 0 === r) return -1;
                         else if (r === n) continue;
-                        else return h(r, n);
+                        else return l(r, n);
                     }while (++t);
                 }
                 inc(e, t, r) {
+                    if (e.startsWith("pre")) {
+                        if (!t && false === r) throw new Error("invalid increment argument: identifier is empty");
+                        if (t) {
+                            const e = `-${t}`.match(this.options.loose ? i[a.PRERELEASELOOSE] : i[a.PRERELEASE]);
+                            if (!e || e[1] !== t) throw new Error(`invalid identifier: ${t}`);
+                        }
+                    }
                     switch(e){
                         case "premajor":
                             this.prerelease.length = 0;
@@ -666,6 +464,10 @@
                             if (0 === this.prerelease.length) this.inc("patch", t, r);
                             this.inc("pre", t, r);
                             break;
+                        case "release":
+                            if (0 === this.prerelease.length) throw new Error(`version ${this.raw} is not a prerelease`);
+                            this.prerelease.length = 0;
+                            break;
                         case "major":
                             if (0 !== this.minor || 0 !== this.patch || 0 === this.prerelease.length) this.major++;
                             this.minor = 0;
@@ -684,7 +486,6 @@
                         case "pre":
                             {
                                 const e = Number(r) ? 1 : 0;
-                                if (!t && false === r) throw new Error("invalid increment argument: identifier is empty");
                                 if (0 === this.prerelease.length) this.prerelease = [
                                     e
                                 ];
@@ -707,8 +508,9 @@
                                     if (false === r) s = [
                                         t
                                     ];
-                                    if (0 === h(this.prerelease[0], t)) {
-                                        if (isNaN(this.prerelease[1])) this.prerelease = s;
+                                    if (isPrereleaseIdentifier(this.prerelease, t)) {
+                                        const e = this.prerelease[t.split(".").length];
+                                        if (isNaN(e)) this.prerelease = s;
                                     } else this.prerelease = s;
                                 }
                                 break;
@@ -723,22 +525,22 @@
             }
             e.exports = SemVer;
         },
-        640: (e, t, r)=>{
-            const s = r(447);
+        270: (e, t, r)=>{
+            const s = r(368);
             const clean = (e, t)=>{
                 const r = s(e.trim().replace(/^[=v]+/, ""), t);
                 return r ? r.version : null;
             };
             e.exports = clean;
         },
-        159: (e, t, r)=>{
-            const s = r(164);
-            const n = r(196);
-            const i = r(478);
-            const o = r(528);
-            const l = r(654);
-            const a = r(355);
-            const cmp = (e, t, r, h)=>{
+        279: (e, t, r)=>{
+            const s = r(265);
+            const n = r(551);
+            const o = r(292);
+            const i = r(953);
+            const a = r(651);
+            const c = r(16);
+            const cmp = (e, t, r, l)=>{
                 switch(t){
                     case "===":
                         if ("object" == typeof e) e = e.version;
@@ -751,27 +553,27 @@
                     case "":
                     case "=":
                     case "==":
-                        return s(e, r, h);
+                        return s(e, r, l);
                     case "!=":
-                        return n(e, r, h);
+                        return n(e, r, l);
                     case ">":
-                        return i(e, r, h);
+                        return o(e, r, l);
                     case ">=":
-                        return o(e, r, h);
+                        return i(e, r, l);
                     case "<":
-                        return l(e, r, h);
+                        return a(e, r, l);
                     case "<=":
-                        return a(e, r, h);
+                        return c(e, r, l);
                     default:
                         throw new TypeError(`Invalid operator: ${t}`);
                 }
             };
             e.exports = cmp;
         },
-        732: (e, t, r)=>{
-            const s = r(649);
-            const n = r(447);
-            const { safeRe: i, t: o } = r(258);
+        234: (e, t, r)=>{
+            const s = r(628);
+            const n = r(368);
+            const { safeRe: o, t: i } = r(302);
             const coerce = (e, t)=>{
                 if (e instanceof s) return e;
                 if ("number" == typeof e) e = String(e);
@@ -779,127 +581,128 @@
                 t = t || {};
                 let r = null;
                 if (t.rtl) {
-                    const s = t.includePrerelease ? i[o.COERCERTLFULL] : i[o.COERCERTL];
+                    const s = t.includePrerelease ? o[i.COERCERTLFULL] : o[i.COERCERTL];
                     let n;
                     while((n = s.exec(e)) && (!r || r.index + r[0].length !== e.length)){
                         if (!r || n.index + n[0].length !== r.index + r[0].length) r = n;
                         s.lastIndex = n.index + n[1].length + n[2].length;
                     }
                     s.lastIndex = -1;
-                } else r = e.match(t.includePrerelease ? i[o.COERCEFULL] : i[o.COERCE]);
+                } else r = e.match(t.includePrerelease ? o[i.COERCEFULL] : o[i.COERCE]);
                 if (null === r) return null;
-                const l = r[2];
-                const a = r[3] || "0";
-                const h = r[4] || "0";
-                const c = t.includePrerelease && r[5] ? `-${r[5]}` : "";
-                const u = t.includePrerelease && r[6] ? `+${r[6]}` : "";
-                return n(`${l}.${a}.${h}${c}${u}`, t);
+                const a = r[2];
+                const c = r[3] || "0";
+                const l = r[4] || "0";
+                const p = t.includePrerelease && r[5] ? `-${r[5]}` : "";
+                const f = t.includePrerelease && r[6] ? `+${r[6]}` : "";
+                return n(`${a}.${c}.${l}${p}${f}`, t);
             };
             e.exports = coerce;
         },
-        425: (e, t, r)=>{
-            const s = r(649);
+        653: (e, t, r)=>{
+            const s = r(628);
             const compareBuild = (e, t, r)=>{
                 const n = new s(e, r);
-                const i = new s(t, r);
-                return n.compare(i) || n.compareBuild(i);
+                const o = new s(t, r);
+                return n.compare(o) || n.compareBuild(o);
             };
             e.exports = compareBuild;
         },
-        59: (e, t, r)=>{
-            const s = r(936);
+        723: (e, t, r)=>{
+            const s = r(912);
             const compareLoose = (e, t)=>s(e, t, true);
             e.exports = compareLoose;
         },
-        936: (e, t, r)=>{
-            const s = r(649);
+        912: (e, t, r)=>{
+            const s = r(628);
             const compare = (e, t, r)=>new s(e, r).compare(new s(t, r));
             e.exports = compare;
         },
-        163: (e, t, r)=>{
-            const s = r(447);
+        848: (e, t, r)=>{
+            const s = r(368);
             const diff = (e, t)=>{
                 const r = s(e, null, true);
                 const n = s(t, null, true);
-                const i = r.compare(n);
-                if (0 === i) return null;
-                const o = i > 0;
-                const l = o ? r : n;
-                const a = o ? n : r;
-                const h = !!l.prerelease.length;
-                const c = !!a.prerelease.length;
-                if (c && !h) {
-                    if (!a.patch && !a.minor) return "major";
-                    if (l.patch) return "patch";
-                    if (l.minor) return "minor";
-                    return "major";
+                const o = r.compare(n);
+                if (0 === o) return null;
+                const i = o > 0;
+                const a = i ? r : n;
+                const c = i ? n : r;
+                const l = !!a.prerelease.length;
+                const p = !!c.prerelease.length;
+                if (p && !l) {
+                    if (!c.patch && !c.minor) return "major";
+                    if (0 === c.compareMain(a)) {
+                        if (c.minor && !c.patch) return "minor";
+                        return "patch";
+                    }
                 }
-                const u = h ? "pre" : "";
-                if (r.major !== n.major) return u + "major";
-                if (r.minor !== n.minor) return u + "minor";
-                if (r.patch !== n.patch) return u + "patch";
+                const f = l ? "pre" : "";
+                if (r.major !== n.major) return f + "major";
+                if (r.minor !== n.minor) return f + "minor";
+                if (r.patch !== n.patch) return f + "patch";
                 return "prerelease";
             };
             e.exports = diff;
         },
-        164: (e, t, r)=>{
-            const s = r(936);
+        265: (e, t, r)=>{
+            const s = r(912);
             const eq = (e, t, r)=>0 === s(e, t, r);
             e.exports = eq;
         },
-        478: (e, t, r)=>{
-            const s = r(936);
+        292: (e, t, r)=>{
+            const s = r(912);
             const gt = (e, t, r)=>s(e, t, r) > 0;
             e.exports = gt;
         },
-        528: (e, t, r)=>{
-            const s = r(936);
+        953: (e, t, r)=>{
+            const s = r(912);
             const gte = (e, t, r)=>s(e, t, r) >= 0;
             e.exports = gte;
         },
-        53: (e, t, r)=>{
-            const s = r(649);
-            const inc = (e, t, r, n, i)=>{
+        719: (e, t, r)=>{
+            const s = r(628);
+            const inc = (e, t, r, n, o)=>{
                 if ("string" == typeof r) {
-                    i = n;
+                    o = n;
                     n = r;
                     r = void 0;
                 }
                 try {
-                    return new s(e instanceof s ? e.version : e, r).inc(t, n, i).version;
+                    return new s(e instanceof s ? e.version : e, r).inc(t, n, o).version;
                 } catch (e) {
                     return null;
                 }
             };
             e.exports = inc;
         },
-        654: (e, t, r)=>{
-            const s = r(936);
+        651: (e, t, r)=>{
+            const s = r(912);
             const lt = (e, t, r)=>s(e, t, r) < 0;
             e.exports = lt;
         },
-        355: (e, t, r)=>{
-            const s = r(936);
+        16: (e, t, r)=>{
+            const s = r(912);
             const lte = (e, t, r)=>s(e, t, r) <= 0;
             e.exports = lte;
         },
-        86: (e, t, r)=>{
-            const s = r(649);
+        626: (e, t, r)=>{
+            const s = r(628);
             const major = (e, t)=>new s(e, t).major;
             e.exports = major;
         },
-        753: (e, t, r)=>{
-            const s = r(649);
+        6: (e, t, r)=>{
+            const s = r(628);
             const minor = (e, t)=>new s(e, t).minor;
             e.exports = minor;
         },
-        196: (e, t, r)=>{
-            const s = r(936);
+        551: (e, t, r)=>{
+            const s = r(912);
             const neq = (e, t, r)=>0 !== s(e, t, r);
             e.exports = neq;
         },
-        447: (e, t, r)=>{
-            const s = r(649);
+        368: (e, t, r)=>{
+            const s = r(628);
             const parse = (e, t, r = false)=>{
                 if (e instanceof s) return e;
                 try {
@@ -911,31 +714,31 @@
             };
             e.exports = parse;
         },
-        772: (e, t, r)=>{
-            const s = r(649);
+        461: (e, t, r)=>{
+            const s = r(628);
             const patch = (e, t)=>new s(e, t).patch;
             e.exports = patch;
         },
-        973: (e, t, r)=>{
-            const s = r(447);
+        913: (e, t, r)=>{
+            const s = r(368);
             const prerelease = (e, t)=>{
                 const r = s(e, t);
                 return r && r.prerelease.length ? r.prerelease : null;
             };
             e.exports = prerelease;
         },
-        580: (e, t, r)=>{
-            const s = r(936);
+        442: (e, t, r)=>{
+            const s = r(912);
             const rcompare = (e, t, r)=>s(t, e, r);
             e.exports = rcompare;
         },
-        573: (e, t, r)=>{
-            const s = r(425);
+        5: (e, t, r)=>{
+            const s = r(653);
             const rsort = (e, t)=>e.sort((e, r)=>s(r, e, t));
             e.exports = rsort;
         },
-        727: (e, t, r)=>{
-            const s = r(530);
+        854: (e, t, r)=>{
+            const s = r(991);
             const satisfies = (e, t, r)=>{
                 try {
                     t = new s(t, r);
@@ -946,116 +749,148 @@
             };
             e.exports = satisfies;
         },
-        318: (e, t, r)=>{
-            const s = r(425);
+        431: (e, t, r)=>{
+            const s = r(653);
             const sort = (e, t)=>e.sort((e, r)=>s(e, r, t));
             e.exports = sort;
         },
-        458: (e, t, r)=>{
-            const s = r(447);
+        569: (e, t, r)=>{
+            const s = r(368);
+            const n = r(842);
+            const o = r(628);
+            const truncate = (e, t, r)=>{
+                if (!n.RELEASE_TYPES.includes(t)) return null;
+                const s = cloneInputVersion(e, r);
+                return s && doTruncation(s, t);
+            };
+            const cloneInputVersion = (e, t)=>{
+                const r = e instanceof o ? e.version : e;
+                return s(r, t);
+            };
+            const doTruncation = (e, t)=>{
+                if (isPrerelease(t)) return e.version;
+                e.prerelease = [];
+                switch(t){
+                    case "major":
+                        e.minor = 0;
+                        e.patch = 0;
+                        break;
+                    case "minor":
+                        e.patch = 0;
+                        break;
+                }
+                return e.format();
+            };
+            const isPrerelease = (e)=>e.startsWith("pre");
+            e.exports = truncate;
+        },
+        9: (e, t, r)=>{
+            const s = r(368);
             const valid = (e, t)=>{
                 const r = s(e, t);
                 return r ? r.version : null;
             };
             e.exports = valid;
         },
-        921: (e, t, r)=>{
-            const s = r(258);
-            const n = r(745);
-            const i = r(649);
-            const o = r(74);
-            const l = r(447);
-            const a = r(458);
-            const h = r(640);
-            const c = r(53);
-            const u = r(163);
-            const f = r(86);
-            const p = r(753);
-            const E = r(772);
-            const m = r(973);
-            const v = r(936);
-            const $ = r(580);
-            const R = r(59);
-            const d = r(425);
-            const g = r(318);
-            const I = r(573);
-            const N = r(478);
-            const L = r(654);
-            const A = r(164);
-            const w = r(196);
-            const O = r(528);
-            const S = r(355);
-            const T = r(159);
-            const y = r(732);
-            const x = r(584);
-            const P = r(530);
-            const C = r(727);
-            const b = r(857);
-            const D = r(754);
-            const _ = r(786);
-            const G = r(200);
-            const M = r(115);
-            const F = r(443);
-            const j = r(490);
-            const Y = r(987);
-            const U = r(219);
-            const X = r(333);
-            const k = r(958);
+        621: (e, t, r)=>{
+            const s = r(302);
+            const n = r(842);
+            const o = r(628);
+            const i = r(859);
+            const a = r(368);
+            const c = r(9);
+            const l = r(270);
+            const p = r(719);
+            const f = r(848);
+            const E = r(626);
+            const h = r(6);
+            const u = r(461);
+            const m = r(913);
+            const $ = r(912);
+            const R = r(442);
+            const I = r(723);
+            const L = r(653);
+            const d = r(431);
+            const N = r(5);
+            const O = r(292);
+            const v = r(651);
+            const A = r(265);
+            const S = r(551);
+            const T = r(953);
+            const g = r(16);
+            const w = r(279);
+            const P = r(234);
+            const C = r(569);
+            const x = r(296);
+            const _ = r(991);
+            const D = r(854);
+            const G = r(271);
+            const M = r(692);
+            const y = r(54);
+            const F = r(325);
+            const j = r(466);
+            const b = r(419);
+            const U = r(291);
+            const X = r(982);
+            const V = r(604);
+            const k = r(69);
+            const B = r(760);
             e.exports = {
-                parse: l,
-                valid: a,
-                clean: h,
-                inc: c,
-                diff: u,
-                major: f,
-                minor: p,
-                patch: E,
+                parse: a,
+                valid: c,
+                clean: l,
+                inc: p,
+                diff: f,
+                major: E,
+                minor: h,
+                patch: u,
                 prerelease: m,
-                compare: v,
-                rcompare: $,
-                compareLoose: R,
-                compareBuild: d,
-                sort: g,
-                rsort: I,
-                gt: N,
-                lt: L,
+                compare: $,
+                rcompare: R,
+                compareLoose: I,
+                compareBuild: L,
+                sort: d,
+                rsort: N,
+                gt: O,
+                lt: v,
                 eq: A,
-                neq: w,
-                gte: O,
-                lte: S,
-                cmp: T,
-                coerce: y,
+                neq: S,
+                gte: T,
+                lte: g,
+                cmp: w,
+                coerce: P,
+                truncate: C,
                 Comparator: x,
-                Range: P,
-                satisfies: C,
-                toComparators: b,
-                maxSatisfying: D,
-                minSatisfying: _,
-                minVersion: G,
-                validRange: M,
-                outside: F,
-                gtr: j,
-                ltr: Y,
-                intersects: U,
-                simplifyRange: X,
-                subset: k,
-                SemVer: i,
+                Range: _,
+                satisfies: D,
+                toComparators: G,
+                maxSatisfying: M,
+                minSatisfying: y,
+                minVersion: F,
+                validRange: j,
+                outside: b,
+                gtr: U,
+                ltr: X,
+                intersects: V,
+                simplifyRange: k,
+                subset: B,
+                SemVer: o,
                 re: s.re,
                 src: s.src,
                 tokens: s.t,
                 SEMVER_SPEC_VERSION: n.SEMVER_SPEC_VERSION,
                 RELEASE_TYPES: n.RELEASE_TYPES,
-                compareIdentifiers: o.compareIdentifiers,
-                rcompareIdentifiers: o.rcompareIdentifiers
+                compareIdentifiers: i.compareIdentifiers,
+                rcompareIdentifiers: i.rcompareIdentifiers
             };
         },
-        745: (e)=>{
+        842: (e)=>{
             const t = "2.0.0";
             const r = 256;
             const s = Number.MAX_SAFE_INTEGER || 9007199254740991;
             const n = 16;
-            const i = r - 6;
-            const o = [
+            const o = r - 6;
+            const i = [
                 "major",
                 "premajor",
                 "minor",
@@ -1067,21 +902,22 @@
             e.exports = {
                 MAX_LENGTH: r,
                 MAX_SAFE_COMPONENT_LENGTH: n,
-                MAX_SAFE_BUILD_LENGTH: i,
+                MAX_SAFE_BUILD_LENGTH: o,
                 MAX_SAFE_INTEGER: s,
-                RELEASE_TYPES: o,
+                RELEASE_TYPES: i,
                 SEMVER_SPEC_VERSION: t,
                 FLAG_INCLUDE_PRERELEASE: 1,
                 FLAG_LOOSE: 2
             };
         },
-        935: (e)=>{
+        600: (e)=>{
             const t = "object" == typeof process && process.env && process.env.NODE_DEBUG && /\bsemver\b/i.test(process.env.NODE_DEBUG) ? (...e)=>console.error("SEMVER", ...e) : ()=>{};
             e.exports = t;
         },
-        74: (e)=>{
+        859: (e)=>{
             const t = /^[0-9]+$/;
             const compareIdentifiers = (e, r)=>{
+                if ("number" == typeof e && "number" == typeof r) return e === r ? 0 : e < r ? -1 : 1;
                 const s = t.test(e);
                 const n = t.test(r);
                 if (s && n) {
@@ -1096,7 +932,39 @@
                 rcompareIdentifiers: rcompareIdentifiers
             };
         },
-        110: (e)=>{
+        26: (e)=>{
+            class LRUCache {
+                constructor(){
+                    this.max = 1e3;
+                    this.map = new Map;
+                }
+                get(e) {
+                    const t = this.map.get(e);
+                    if (void 0 === t) return;
+                    else {
+                        this.map.delete(e);
+                        this.map.set(e, t);
+                        return t;
+                    }
+                }
+                delete(e) {
+                    return this.map.delete(e);
+                }
+                set(e, t) {
+                    const r = this.delete(e);
+                    if (!r && void 0 !== t) {
+                        if (this.map.size >= this.max) {
+                            const e = this.map.keys().next().value;
+                            this.delete(e);
+                        }
+                        this.map.set(e, t);
+                    }
+                    return this;
+                }
+            }
+            e.exports = LRUCache;
+        },
+        83: (e)=>{
             const t = Object.freeze({
                 loose: true
             });
@@ -1108,97 +976,99 @@
             };
             e.exports = parseOptions;
         },
-        258: (e, t, r)=>{
-            const { MAX_SAFE_COMPONENT_LENGTH: s, MAX_SAFE_BUILD_LENGTH: n, MAX_LENGTH: i } = r(745);
-            const o = r(935);
+        302: (e, t, r)=>{
+            const { MAX_SAFE_COMPONENT_LENGTH: s, MAX_SAFE_BUILD_LENGTH: n, MAX_LENGTH: o } = r(842);
+            const i = r(600);
             t = e.exports = {};
-            const l = t.re = [];
-            const a = t.safeRe = [];
-            const h = t.src = [];
-            const c = t.t = {};
-            let u = 0;
-            const f = "[a-zA-Z0-9-]";
-            const p = [
+            const a = t.re = [];
+            const c = t.safeRe = [];
+            const l = t.src = [];
+            const p = t.safeSrc = [];
+            const f = t.t = {};
+            let E = 0;
+            const h = "[a-zA-Z0-9-]";
+            const u = [
                 [
                     "\\s",
                     1
                 ],
                 [
                     "\\d",
-                    i
+                    o
                 ],
                 [
-                    f,
+                    h,
                     n
                 ]
             ];
             const makeSafeRegex = (e)=>{
-                for (const [t, r] of p)e = e.split(`${t}*`).join(`${t}{0,${r}}`).split(`${t}+`).join(`${t}{1,${r}}`);
+                for (const [t, r] of u)e = e.split(`${t}*`).join(`${t}{0,${r}}`).split(`${t}+`).join(`${t}{1,${r}}`);
                 return e;
             };
             const createToken = (e, t, r)=>{
                 const s = makeSafeRegex(t);
-                const n = u++;
-                o(e, n, t);
-                c[e] = n;
-                h[n] = t;
-                l[n] = new RegExp(t, r ? "g" : void 0);
-                a[n] = new RegExp(s, r ? "g" : void 0);
+                const n = E++;
+                i(e, n, t);
+                f[e] = n;
+                l[n] = t;
+                p[n] = s;
+                a[n] = new RegExp(t, r ? "g" : void 0);
+                c[n] = new RegExp(s, r ? "g" : void 0);
             };
             createToken("NUMERICIDENTIFIER", "0|[1-9]\\d*");
             createToken("NUMERICIDENTIFIERLOOSE", "\\d+");
-            createToken("NONNUMERICIDENTIFIER", `\\d*[a-zA-Z-]${f}*`);
-            createToken("MAINVERSION", `(${h[c.NUMERICIDENTIFIER]})\\.(${h[c.NUMERICIDENTIFIER]})\\.(${h[c.NUMERICIDENTIFIER]})`);
-            createToken("MAINVERSIONLOOSE", `(${h[c.NUMERICIDENTIFIERLOOSE]})\\.(${h[c.NUMERICIDENTIFIERLOOSE]})\\.(${h[c.NUMERICIDENTIFIERLOOSE]})`);
-            createToken("PRERELEASEIDENTIFIER", `(?:${h[c.NUMERICIDENTIFIER]}|${h[c.NONNUMERICIDENTIFIER]})`);
-            createToken("PRERELEASEIDENTIFIERLOOSE", `(?:${h[c.NUMERICIDENTIFIERLOOSE]}|${h[c.NONNUMERICIDENTIFIER]})`);
-            createToken("PRERELEASE", `(?:-(${h[c.PRERELEASEIDENTIFIER]}(?:\\.${h[c.PRERELEASEIDENTIFIER]})*))`);
-            createToken("PRERELEASELOOSE", `(?:-?(${h[c.PRERELEASEIDENTIFIERLOOSE]}(?:\\.${h[c.PRERELEASEIDENTIFIERLOOSE]})*))`);
-            createToken("BUILDIDENTIFIER", `${f}+`);
-            createToken("BUILD", `(?:\\+(${h[c.BUILDIDENTIFIER]}(?:\\.${h[c.BUILDIDENTIFIER]})*))`);
-            createToken("FULLPLAIN", `v?${h[c.MAINVERSION]}${h[c.PRERELEASE]}?${h[c.BUILD]}?`);
-            createToken("FULL", `^${h[c.FULLPLAIN]}$`);
-            createToken("LOOSEPLAIN", `[v=\\s]*${h[c.MAINVERSIONLOOSE]}${h[c.PRERELEASELOOSE]}?${h[c.BUILD]}?`);
-            createToken("LOOSE", `^${h[c.LOOSEPLAIN]}$`);
+            createToken("NONNUMERICIDENTIFIER", `\\d*[a-zA-Z-]${h}*`);
+            createToken("MAINVERSION", `(${l[f.NUMERICIDENTIFIER]})\\.(${l[f.NUMERICIDENTIFIER]})\\.(${l[f.NUMERICIDENTIFIER]})`);
+            createToken("MAINVERSIONLOOSE", `(${l[f.NUMERICIDENTIFIERLOOSE]})\\.(${l[f.NUMERICIDENTIFIERLOOSE]})\\.(${l[f.NUMERICIDENTIFIERLOOSE]})`);
+            createToken("PRERELEASEIDENTIFIER", `(?:${l[f.NONNUMERICIDENTIFIER]}|${l[f.NUMERICIDENTIFIER]})`);
+            createToken("PRERELEASEIDENTIFIERLOOSE", `(?:${l[f.NONNUMERICIDENTIFIER]}|${l[f.NUMERICIDENTIFIERLOOSE]})`);
+            createToken("PRERELEASE", `(?:-(${l[f.PRERELEASEIDENTIFIER]}(?:\\.${l[f.PRERELEASEIDENTIFIER]})*))`);
+            createToken("PRERELEASELOOSE", `(?:-?(${l[f.PRERELEASEIDENTIFIERLOOSE]}(?:\\.${l[f.PRERELEASEIDENTIFIERLOOSE]})*))`);
+            createToken("BUILDIDENTIFIER", `${h}+`);
+            createToken("BUILD", `(?:\\+(${l[f.BUILDIDENTIFIER]}(?:\\.${l[f.BUILDIDENTIFIER]})*))`);
+            createToken("FULLPLAIN", `v?${l[f.MAINVERSION]}${l[f.PRERELEASE]}?${l[f.BUILD]}?`);
+            createToken("FULL", `^${l[f.FULLPLAIN]}$`);
+            createToken("LOOSEPLAIN", `[v=\\s]*${l[f.MAINVERSIONLOOSE]}${l[f.PRERELEASELOOSE]}?${l[f.BUILD]}?`);
+            createToken("LOOSE", `^${l[f.LOOSEPLAIN]}$`);
             createToken("GTLT", "((?:<|>)?=?)");
-            createToken("XRANGEIDENTIFIERLOOSE", `${h[c.NUMERICIDENTIFIERLOOSE]}|x|X|\\*`);
-            createToken("XRANGEIDENTIFIER", `${h[c.NUMERICIDENTIFIER]}|x|X|\\*`);
-            createToken("XRANGEPLAIN", `[v=\\s]*(${h[c.XRANGEIDENTIFIER]})(?:\\.(${h[c.XRANGEIDENTIFIER]})(?:\\.(${h[c.XRANGEIDENTIFIER]})(?:${h[c.PRERELEASE]})?${h[c.BUILD]}?)?)?`);
-            createToken("XRANGEPLAINLOOSE", `[v=\\s]*(${h[c.XRANGEIDENTIFIERLOOSE]})(?:\\.(${h[c.XRANGEIDENTIFIERLOOSE]})(?:\\.(${h[c.XRANGEIDENTIFIERLOOSE]})(?:${h[c.PRERELEASELOOSE]})?${h[c.BUILD]}?)?)?`);
-            createToken("XRANGE", `^${h[c.GTLT]}\\s*${h[c.XRANGEPLAIN]}$`);
-            createToken("XRANGELOOSE", `^${h[c.GTLT]}\\s*${h[c.XRANGEPLAINLOOSE]}$`);
+            createToken("XRANGEIDENTIFIERLOOSE", `${l[f.NUMERICIDENTIFIERLOOSE]}|x|X|\\*`);
+            createToken("XRANGEIDENTIFIER", `${l[f.NUMERICIDENTIFIER]}|x|X|\\*`);
+            createToken("XRANGEPLAIN", `[v=\\s]*(${l[f.XRANGEIDENTIFIER]})(?:\\.(${l[f.XRANGEIDENTIFIER]})(?:\\.(${l[f.XRANGEIDENTIFIER]})(?:${l[f.PRERELEASE]})?${l[f.BUILD]}?)?)?`);
+            createToken("XRANGEPLAINLOOSE", `[v=\\s]*(${l[f.XRANGEIDENTIFIERLOOSE]})(?:\\.(${l[f.XRANGEIDENTIFIERLOOSE]})(?:\\.(${l[f.XRANGEIDENTIFIERLOOSE]})(?:${l[f.PRERELEASELOOSE]})?${l[f.BUILD]}?)?)?`);
+            createToken("XRANGE", `^${l[f.GTLT]}\\s*${l[f.XRANGEPLAIN]}$`);
+            createToken("XRANGELOOSE", `^${l[f.GTLT]}\\s*${l[f.XRANGEPLAINLOOSE]}$`);
             createToken("COERCEPLAIN", `(^|[^\\d])(\\d{1,${s}})(?:\\.(\\d{1,${s}}))?(?:\\.(\\d{1,${s}}))?`);
-            createToken("COERCE", `${h[c.COERCEPLAIN]}(?:$|[^\\d])`);
-            createToken("COERCEFULL", h[c.COERCEPLAIN] + `(?:${h[c.PRERELEASE]})?` + `(?:${h[c.BUILD]})?` + "(?:$|[^\\d])");
-            createToken("COERCERTL", h[c.COERCE], true);
-            createToken("COERCERTLFULL", h[c.COERCEFULL], true);
+            createToken("COERCE", `${l[f.COERCEPLAIN]}(?:$|[^\\d])`);
+            createToken("COERCEFULL", l[f.COERCEPLAIN] + `(?:${l[f.PRERELEASE]})?` + `(?:${l[f.BUILD]})?` + "(?:$|[^\\d])");
+            createToken("COERCERTL", l[f.COERCE], true);
+            createToken("COERCERTLFULL", l[f.COERCEFULL], true);
             createToken("LONETILDE", "(?:~>?)");
-            createToken("TILDETRIM", `(\\s*)${h[c.LONETILDE]}\\s+`, true);
+            createToken("TILDETRIM", `(\\s*)${l[f.LONETILDE]}\\s+`, true);
             t.tildeTrimReplace = "$1~";
-            createToken("TILDE", `^${h[c.LONETILDE]}${h[c.XRANGEPLAIN]}$`);
-            createToken("TILDELOOSE", `^${h[c.LONETILDE]}${h[c.XRANGEPLAINLOOSE]}$`);
+            createToken("TILDE", `^${l[f.LONETILDE]}${l[f.XRANGEPLAIN]}$`);
+            createToken("TILDELOOSE", `^${l[f.LONETILDE]}${l[f.XRANGEPLAINLOOSE]}$`);
             createToken("LONECARET", "(?:\\^)");
-            createToken("CARETTRIM", `(\\s*)${h[c.LONECARET]}\\s+`, true);
+            createToken("CARETTRIM", `(\\s*)${l[f.LONECARET]}\\s+`, true);
             t.caretTrimReplace = "$1^";
-            createToken("CARET", `^${h[c.LONECARET]}${h[c.XRANGEPLAIN]}$`);
-            createToken("CARETLOOSE", `^${h[c.LONECARET]}${h[c.XRANGEPLAINLOOSE]}$`);
-            createToken("COMPARATORLOOSE", `^${h[c.GTLT]}\\s*(${h[c.LOOSEPLAIN]})$|^$`);
-            createToken("COMPARATOR", `^${h[c.GTLT]}\\s*(${h[c.FULLPLAIN]})$|^$`);
-            createToken("COMPARATORTRIM", `(\\s*)${h[c.GTLT]}\\s*(${h[c.LOOSEPLAIN]}|${h[c.XRANGEPLAIN]})`, true);
+            createToken("CARET", `^${l[f.LONECARET]}${l[f.XRANGEPLAIN]}$`);
+            createToken("CARETLOOSE", `^${l[f.LONECARET]}${l[f.XRANGEPLAINLOOSE]}$`);
+            createToken("COMPARATORLOOSE", `^${l[f.GTLT]}\\s*(${l[f.LOOSEPLAIN]})$|^$`);
+            createToken("COMPARATOR", `^${l[f.GTLT]}\\s*(${l[f.FULLPLAIN]})$|^$`);
+            createToken("COMPARATORTRIM", `(\\s*)${l[f.GTLT]}\\s*(${l[f.LOOSEPLAIN]}|${l[f.XRANGEPLAIN]})`, true);
             t.comparatorTrimReplace = "$1$2$3";
-            createToken("HYPHENRANGE", `^\\s*(${h[c.XRANGEPLAIN]})\\s+-\\s+(${h[c.XRANGEPLAIN]})\\s*\$`);
-            createToken("HYPHENRANGELOOSE", `^\\s*(${h[c.XRANGEPLAINLOOSE]})\\s+-\\s+(${h[c.XRANGEPLAINLOOSE]})\\s*\$`);
+            createToken("HYPHENRANGE", `^\\s*(${l[f.XRANGEPLAIN]})\\s+-\\s+(${l[f.XRANGEPLAIN]})\\s*\$`);
+            createToken("HYPHENRANGELOOSE", `^\\s*(${l[f.XRANGEPLAINLOOSE]})\\s+-\\s+(${l[f.XRANGEPLAINLOOSE]})\\s*\$`);
             createToken("STAR", "(<|>)?=?\\s*\\*");
             createToken("GTE0", "^\\s*>=\\s*0\\.0\\.0\\s*$");
             createToken("GTE0PRE", "^\\s*>=\\s*0\\.0\\.0-0\\s*$");
         },
-        490: (e, t, r)=>{
-            const s = r(443);
+        291: (e, t, r)=>{
+            const s = r(419);
             const gtr = (e, t, r)=>s(e, t, ">", r);
             e.exports = gtr;
         },
-        219: (e, t, r)=>{
-            const s = r(530);
+        604: (e, t, r)=>{
+            const s = r(991);
             const intersects = (e, t, r)=>{
                 e = new s(e, r);
                 t = new s(t, r);
@@ -1206,63 +1076,63 @@
             };
             e.exports = intersects;
         },
-        987: (e, t, r)=>{
-            const s = r(443);
+        982: (e, t, r)=>{
+            const s = r(419);
             const ltr = (e, t, r)=>s(e, t, "<", r);
             e.exports = ltr;
         },
-        754: (e, t, r)=>{
-            const s = r(649);
-            const n = r(530);
+        692: (e, t, r)=>{
+            const s = r(628);
+            const n = r(991);
             const maxSatisfying = (e, t, r)=>{
-                let i = null;
                 let o = null;
-                let l = null;
+                let i = null;
+                let a = null;
                 try {
-                    l = new n(t, r);
+                    a = new n(t, r);
                 } catch (e) {
                     return null;
                 }
                 e.forEach((e)=>{
-                    if (l.test(e)) {
-                        if (!i || -1 === o.compare(e)) {
-                            i = e;
-                            o = new s(i, r);
+                    if (a.test(e)) {
+                        if (!o || -1 === i.compare(e)) {
+                            o = e;
+                            i = new s(o, r);
                         }
                     }
                 });
-                return i;
+                return o;
             };
             e.exports = maxSatisfying;
         },
-        786: (e, t, r)=>{
-            const s = r(649);
-            const n = r(530);
+        54: (e, t, r)=>{
+            const s = r(628);
+            const n = r(991);
             const minSatisfying = (e, t, r)=>{
-                let i = null;
                 let o = null;
-                let l = null;
+                let i = null;
+                let a = null;
                 try {
-                    l = new n(t, r);
+                    a = new n(t, r);
                 } catch (e) {
                     return null;
                 }
                 e.forEach((e)=>{
-                    if (l.test(e)) {
-                        if (!i || 1 === o.compare(e)) {
-                            i = e;
-                            o = new s(i, r);
+                    if (a.test(e)) {
+                        if (!o || 1 === i.compare(e)) {
+                            o = e;
+                            i = new s(o, r);
                         }
                     }
                 });
-                return i;
+                return o;
             };
             e.exports = minSatisfying;
         },
-        200: (e, t, r)=>{
-            const s = r(649);
-            const n = r(530);
-            const i = r(478);
+        325: (e, t, r)=>{
+            const s = r(628);
+            const n = r(991);
+            const o = r(292);
             const minVersion = (e, t)=>{
                 e = new n(e, t);
                 let r = new s("0.0.0");
@@ -1272,7 +1142,7 @@
                 r = null;
                 for(let t = 0; t < e.set.length; ++t){
                     const n = e.set[t];
-                    let o = null;
+                    let i = null;
                     n.forEach((e)=>{
                         const t = new s(e.semver.version);
                         switch(e.operator){
@@ -1282,7 +1152,7 @@
                                 t.raw = t.format();
                             case "":
                             case ">=":
-                                if (!o || i(t, o)) o = t;
+                                if (!i || o(t, i)) i = t;
                                 break;
                             case "<":
                             case "<=":
@@ -1291,108 +1161,108 @@
                                 throw new Error(`Unexpected operation: ${e.operator}`);
                         }
                     });
-                    if (o && (!r || i(r, o))) r = o;
+                    if (i && (!r || o(r, i))) r = i;
                 }
                 if (r && e.test(r)) return r;
                 return null;
             };
             e.exports = minVersion;
         },
-        443: (e, t, r)=>{
-            const s = r(649);
-            const n = r(584);
-            const { ANY: i } = n;
-            const o = r(530);
-            const l = r(727);
-            const a = r(478);
-            const h = r(654);
-            const c = r(355);
-            const u = r(528);
-            const outside = (e, t, r, f)=>{
-                e = new s(e, f);
-                t = new o(t, f);
-                let p, E, m, v, $;
+        419: (e, t, r)=>{
+            const s = r(628);
+            const n = r(296);
+            const { ANY: o } = n;
+            const i = r(991);
+            const a = r(854);
+            const c = r(292);
+            const l = r(651);
+            const p = r(16);
+            const f = r(953);
+            const outside = (e, t, r, E)=>{
+                e = new s(e, E);
+                t = new i(t, E);
+                let h, u, m, $, R;
                 switch(r){
                     case ">":
-                        p = a;
-                        E = c;
-                        m = h;
-                        v = ">";
-                        $ = ">=";
+                        h = c;
+                        u = p;
+                        m = l;
+                        $ = ">";
+                        R = ">=";
                         break;
                     case "<":
-                        p = h;
-                        E = u;
-                        m = a;
-                        v = "<";
-                        $ = "<=";
+                        h = l;
+                        u = f;
+                        m = c;
+                        $ = "<";
+                        R = "<=";
                         break;
                     default:
                         throw new TypeError('Must provide a hilo val of "<" or ">"');
                 }
-                if (l(e, t, f)) return false;
+                if (a(e, t, E)) return false;
                 for(let r = 0; r < t.set.length; ++r){
                     const s = t.set[r];
-                    let o = null;
-                    let l = null;
+                    let i = null;
+                    let a = null;
                     s.forEach((e)=>{
-                        if (e.semver === i) e = new n(">=0.0.0");
-                        o = o || e;
-                        l = l || e;
-                        if (p(e.semver, o.semver, f)) o = e;
-                        else if (m(e.semver, l.semver, f)) l = e;
+                        if (e.semver === o) e = new n(">=0.0.0");
+                        i = i || e;
+                        a = a || e;
+                        if (h(e.semver, i.semver, E)) i = e;
+                        else if (m(e.semver, a.semver, E)) a = e;
                     });
-                    if (o.operator === v || o.operator === $) return false;
-                    if ((!l.operator || l.operator === v) && E(e, l.semver)) return false;
-                    if (l.operator === $ && m(e, l.semver)) return false;
+                    if (i.operator === $ || i.operator === R) return false;
+                    if ((!a.operator || a.operator === $) && u(e, a.semver)) return false;
+                    else if (a.operator === R && m(e, a.semver)) return false;
                 }
                 return true;
             };
             e.exports = outside;
         },
-        333: (e, t, r)=>{
-            const s = r(727);
-            const n = r(936);
+        69: (e, t, r)=>{
+            const s = r(854);
+            const n = r(912);
             e.exports = (e, t, r)=>{
-                const i = [];
-                let o = null;
-                let l = null;
-                const a = e.sort((e, t)=>n(e, t, r));
-                for (const e of a){
+                const o = [];
+                let i = null;
+                let a = null;
+                const c = e.sort((e, t)=>n(e, t, r));
+                for (const e of c){
                     const n = s(e, t, r);
                     if (n) {
-                        l = e;
-                        if (!o) o = e;
+                        a = e;
+                        if (!i) i = e;
                     } else {
-                        if (l) i.push([
-                            o,
-                            l
+                        if (a) o.push([
+                            i,
+                            a
                         ]);
-                        l = null;
-                        o = null;
+                        a = null;
+                        i = null;
                     }
                 }
-                if (o) i.push([
-                    o,
+                if (i) o.push([
+                    i,
                     null
                 ]);
-                const h = [];
-                for (const [e, t] of i)if (e === t) h.push(e);
-                else if (t || e !== a[0]) if (t) if (e === a[0]) h.push(`<=${t}`);
-                else h.push(`${e} - ${t}`);
-                else h.push(`>=${e}`);
-                else h.push("*");
-                const c = h.join(" || ");
-                const u = "string" == typeof t.raw ? t.raw : String(t);
-                return c.length < u.length ? c : t;
+                const l = [];
+                for (const [e, t] of o)if (e === t) l.push(e);
+                else if (t || e !== c[0]) if (t) if (e === c[0]) l.push(`<=${t}`);
+                else l.push(`${e} - ${t}`);
+                else l.push(`>=${e}`);
+                else l.push("*");
+                const p = l.join(" || ");
+                const f = "string" == typeof t.raw ? t.raw : String(t);
+                return p.length < f.length ? p : t;
             };
         },
-        958: (e, t, r)=>{
-            const s = r(530);
-            const n = r(584);
-            const { ANY: i } = n;
-            const o = r(727);
-            const l = r(936);
+        760: (e, t, r)=>{
+            const s = r(991);
+            const n = r(296);
+            const { ANY: o } = n;
+            const i = r(854);
+            const a = r(912);
             const subset = (e, t, r = {})=>{
                 if (e === t) return true;
                 e = new s(e, r);
@@ -1408,88 +1278,88 @@
                 }
                 return true;
             };
-            const a = [
+            const c = [
                 new n(">=0.0.0-0")
             ];
-            const h = [
+            const l = [
                 new n(">=0.0.0")
             ];
             const simpleSubset = (e, t, r)=>{
                 if (e === t) return true;
-                if (1 === e.length && e[0].semver === i) if (1 === t.length && t[0].semver === i) return true;
-                else e = r.includePrerelease ? a : h;
-                if (1 === t.length && t[0].semver === i) if (r.includePrerelease) return true;
-                else t = h;
+                if (1 === e.length && e[0].semver === o) if (1 === t.length && t[0].semver === o) return true;
+                else e = r.includePrerelease ? c : l;
+                if (1 === t.length && t[0].semver === o) if (r.includePrerelease) return true;
+                else t = l;
                 const s = new Set;
-                let n, c;
+                let n, p;
                 for (const t of e)if (">" === t.operator || ">=" === t.operator) n = higherGT(n, t, r);
-                else if ("<" === t.operator || "<=" === t.operator) c = lowerLT(c, t, r);
+                else if ("<" === t.operator || "<=" === t.operator) p = lowerLT(p, t, r);
                 else s.add(t.semver);
                 if (s.size > 1) return null;
-                let u;
-                if (n && c) {
-                    u = l(n.semver, c.semver, r);
-                    if (u > 0) return null;
-                    if (0 === u && (">=" !== n.operator || "<=" !== c.operator)) return null;
+                let f;
+                if (n && p) {
+                    f = a(n.semver, p.semver, r);
+                    if (f > 0) return null;
+                    else if (0 === f && (">=" !== n.operator || "<=" !== p.operator)) return null;
                 }
                 for (const e of s){
-                    if (n && !o(e, String(n), r)) return null;
-                    if (c && !o(e, String(c), r)) return null;
-                    for (const s of t)if (!o(e, String(s), r)) return false;
+                    if (n && !i(e, String(n), r)) return null;
+                    if (p && !i(e, String(p), r)) return null;
+                    for (const s of t)if (!i(e, String(s), r)) return false;
                     return true;
                 }
-                let f, p;
-                let E, m;
-                let v = c && !r.includePrerelease && c.semver.prerelease.length ? c.semver : false;
-                let $ = n && !r.includePrerelease && n.semver.prerelease.length ? n.semver : false;
-                if (v && 1 === v.prerelease.length && "<" === c.operator && 0 === v.prerelease[0]) v = false;
+                let E, h;
+                let u, m;
+                let $ = p && !r.includePrerelease && p.semver.prerelease.length ? p.semver : false;
+                let R = n && !r.includePrerelease && n.semver.prerelease.length ? n.semver : false;
+                if ($ && 1 === $.prerelease.length && "<" === p.operator && 0 === $.prerelease[0]) $ = false;
                 for (const e of t){
                     m = m || ">" === e.operator || ">=" === e.operator;
-                    E = E || "<" === e.operator || "<=" === e.operator;
+                    u = u || "<" === e.operator || "<=" === e.operator;
                     if (n) {
-                        if ($) {
-                            if (e.semver.prerelease && e.semver.prerelease.length && e.semver.major === $.major && e.semver.minor === $.minor && e.semver.patch === $.patch) $ = false;
+                        if (R) {
+                            if (e.semver.prerelease && e.semver.prerelease.length && e.semver.major === R.major && e.semver.minor === R.minor && e.semver.patch === R.patch) R = false;
                         }
                         if (">" === e.operator || ">=" === e.operator) {
-                            f = higherGT(n, e, r);
-                            if (f === e && f !== n) return false;
-                        } else if (">=" === n.operator && !o(n.semver, String(e), r)) return false;
+                            E = higherGT(n, e, r);
+                            if (E === e && E !== n) return false;
+                        } else if (">=" === n.operator && !e.test(n.semver)) return false;
                     }
-                    if (c) {
-                        if (v) {
-                            if (e.semver.prerelease && e.semver.prerelease.length && e.semver.major === v.major && e.semver.minor === v.minor && e.semver.patch === v.patch) v = false;
+                    if (p) {
+                        if ($) {
+                            if (e.semver.prerelease && e.semver.prerelease.length && e.semver.major === $.major && e.semver.minor === $.minor && e.semver.patch === $.patch) $ = false;
                         }
                         if ("<" === e.operator || "<=" === e.operator) {
-                            p = lowerLT(c, e, r);
-                            if (p === e && p !== c) return false;
-                        } else if ("<=" === c.operator && !o(c.semver, String(e), r)) return false;
+                            h = lowerLT(p, e, r);
+                            if (h === e && h !== p) return false;
+                        } else if ("<=" === p.operator && !e.test(p.semver)) return false;
                     }
-                    if (!e.operator && (c || n) && 0 !== u) return false;
+                    if (!e.operator && (p || n) && 0 !== f) return false;
                 }
-                if (n && E && !c && 0 !== u) return false;
-                if (c && m && !n && 0 !== u) return false;
-                if ($ || v) return false;
+                if (n && u && !p && 0 !== f) return false;
+                if (p && m && !n && 0 !== f) return false;
+                if (R || $) return false;
                 return true;
             };
             const higherGT = (e, t, r)=>{
                 if (!e) return t;
-                const s = l(e.semver, t.semver, r);
+                const s = a(e.semver, t.semver, r);
                 return s > 0 ? e : s < 0 ? t : ">" === t.operator && ">=" === e.operator ? t : e;
             };
             const lowerLT = (e, t, r)=>{
                 if (!e) return t;
-                const s = l(e.semver, t.semver, r);
+                const s = a(e.semver, t.semver, r);
                 return s < 0 ? e : s > 0 ? t : "<" === t.operator && "<=" === e.operator ? t : e;
             };
             e.exports = subset;
         },
-        857: (e, t, r)=>{
-            const s = r(530);
+        271: (e, t, r)=>{
+            const s = r(991);
             const toComparators = (e, t)=>new s(e, t).set.map((e)=>e.map((e)=>e.value).join(" ").trim().split(" "));
             e.exports = toComparators;
         },
-        115: (e, t, r)=>{
-            const s = r(530);
+        466: (e, t, r)=>{
+            const s = r(991);
             const validRange = (e, t)=>{
                 try {
                     return new s(e, t).range || "*";
@@ -1498,263 +1368,6 @@
                 }
             };
             e.exports = validRange;
-        },
-        77: (e)=>{
-            "use strict";
-            e.exports = function(e) {
-                e.prototype[Symbol.iterator] = function*() {
-                    for(let e = this.head; e; e = e.next)yield e.value;
-                };
-            };
-        },
-        605: (e, t, r)=>{
-            "use strict";
-            e.exports = Yallist;
-            Yallist.Node = Node;
-            Yallist.create = Yallist;
-            function Yallist(e) {
-                var t = this;
-                if (!(t instanceof Yallist)) t = new Yallist;
-                t.tail = null;
-                t.head = null;
-                t.length = 0;
-                if (e && "function" == typeof e.forEach) e.forEach(function(e) {
-                    t.push(e);
-                });
-                else if (arguments.length > 0) for(var r = 0, s = arguments.length; r < s; r++)t.push(arguments[r]);
-                return t;
-            }
-            Yallist.prototype.removeNode = function(e) {
-                if (e.list !== this) throw new Error("removing node which does not belong to this list");
-                var t = e.next;
-                var r = e.prev;
-                if (t) t.prev = r;
-                if (r) r.next = t;
-                if (e === this.head) this.head = t;
-                if (e === this.tail) this.tail = r;
-                e.list.length--;
-                e.next = null;
-                e.prev = null;
-                e.list = null;
-                return t;
-            };
-            Yallist.prototype.unshiftNode = function(e) {
-                if (e === this.head) return;
-                if (e.list) e.list.removeNode(e);
-                var t = this.head;
-                e.list = this;
-                e.next = t;
-                if (t) t.prev = e;
-                this.head = e;
-                if (!this.tail) this.tail = e;
-                this.length++;
-            };
-            Yallist.prototype.pushNode = function(e) {
-                if (e === this.tail) return;
-                if (e.list) e.list.removeNode(e);
-                var t = this.tail;
-                e.list = this;
-                e.prev = t;
-                if (t) t.next = e;
-                this.tail = e;
-                if (!this.head) this.head = e;
-                this.length++;
-            };
-            Yallist.prototype.push = function() {
-                for(var e = 0, t = arguments.length; e < t; e++)push(this, arguments[e]);
-                return this.length;
-            };
-            Yallist.prototype.unshift = function() {
-                for(var e = 0, t = arguments.length; e < t; e++)unshift(this, arguments[e]);
-                return this.length;
-            };
-            Yallist.prototype.pop = function() {
-                if (!this.tail) return;
-                var e = this.tail.value;
-                this.tail = this.tail.prev;
-                if (this.tail) this.tail.next = null;
-                else this.head = null;
-                this.length--;
-                return e;
-            };
-            Yallist.prototype.shift = function() {
-                if (!this.head) return;
-                var e = this.head.value;
-                this.head = this.head.next;
-                if (this.head) this.head.prev = null;
-                else this.tail = null;
-                this.length--;
-                return e;
-            };
-            Yallist.prototype.forEach = function(e, t) {
-                t = t || this;
-                for(var r = this.head, s = 0; null !== r; s++){
-                    e.call(t, r.value, s, this);
-                    r = r.next;
-                }
-            };
-            Yallist.prototype.forEachReverse = function(e, t) {
-                t = t || this;
-                for(var r = this.tail, s = this.length - 1; null !== r; s--){
-                    e.call(t, r.value, s, this);
-                    r = r.prev;
-                }
-            };
-            Yallist.prototype.get = function(e) {
-                for(var t = 0, r = this.head; null !== r && t < e; t++)r = r.next;
-                if (t === e && null !== r) return r.value;
-            };
-            Yallist.prototype.getReverse = function(e) {
-                for(var t = 0, r = this.tail; null !== r && t < e; t++)r = r.prev;
-                if (t === e && null !== r) return r.value;
-            };
-            Yallist.prototype.map = function(e, t) {
-                t = t || this;
-                var r = new Yallist;
-                for(var s = this.head; null !== s;){
-                    r.push(e.call(t, s.value, this));
-                    s = s.next;
-                }
-                return r;
-            };
-            Yallist.prototype.mapReverse = function(e, t) {
-                t = t || this;
-                var r = new Yallist;
-                for(var s = this.tail; null !== s;){
-                    r.push(e.call(t, s.value, this));
-                    s = s.prev;
-                }
-                return r;
-            };
-            Yallist.prototype.reduce = function(e, t) {
-                var r;
-                var s = this.head;
-                if (arguments.length > 1) r = t;
-                else if (this.head) {
-                    s = this.head.next;
-                    r = this.head.value;
-                } else throw new TypeError("Reduce of empty list with no initial value");
-                for(var n = 0; null !== s; n++){
-                    r = e(r, s.value, n);
-                    s = s.next;
-                }
-                return r;
-            };
-            Yallist.prototype.reduceReverse = function(e, t) {
-                var r;
-                var s = this.tail;
-                if (arguments.length > 1) r = t;
-                else if (this.tail) {
-                    s = this.tail.prev;
-                    r = this.tail.value;
-                } else throw new TypeError("Reduce of empty list with no initial value");
-                for(var n = this.length - 1; null !== s; n--){
-                    r = e(r, s.value, n);
-                    s = s.prev;
-                }
-                return r;
-            };
-            Yallist.prototype.toArray = function() {
-                var e = new Array(this.length);
-                for(var t = 0, r = this.head; null !== r; t++){
-                    e[t] = r.value;
-                    r = r.next;
-                }
-                return e;
-            };
-            Yallist.prototype.toArrayReverse = function() {
-                var e = new Array(this.length);
-                for(var t = 0, r = this.tail; null !== r; t++){
-                    e[t] = r.value;
-                    r = r.prev;
-                }
-                return e;
-            };
-            Yallist.prototype.slice = function(e, t) {
-                t = t || this.length;
-                if (t < 0) t += this.length;
-                e = e || 0;
-                if (e < 0) e += this.length;
-                var r = new Yallist;
-                if (t < e || t < 0) return r;
-                if (e < 0) e = 0;
-                if (t > this.length) t = this.length;
-                for(var s = 0, n = this.head; null !== n && s < e; s++)n = n.next;
-                for(; null !== n && s < t; s++, n = n.next)r.push(n.value);
-                return r;
-            };
-            Yallist.prototype.sliceReverse = function(e, t) {
-                t = t || this.length;
-                if (t < 0) t += this.length;
-                e = e || 0;
-                if (e < 0) e += this.length;
-                var r = new Yallist;
-                if (t < e || t < 0) return r;
-                if (e < 0) e = 0;
-                if (t > this.length) t = this.length;
-                for(var s = this.length, n = this.tail; null !== n && s > t; s--)n = n.prev;
-                for(; null !== n && s > e; s--, n = n.prev)r.push(n.value);
-                return r;
-            };
-            Yallist.prototype.splice = function(e, t, ...r) {
-                if (e > this.length) e = this.length - 1;
-                if (e < 0) e = this.length + e;
-                for(var s = 0, n = this.head; null !== n && s < e; s++)n = n.next;
-                var i = [];
-                for(var s = 0; n && s < t; s++){
-                    i.push(n.value);
-                    n = this.removeNode(n);
-                }
-                if (null === n) n = this.tail;
-                if (n !== this.head && n !== this.tail) n = n.prev;
-                for(var s = 0; s < r.length; s++)n = insert(this, n, r[s]);
-                return i;
-            };
-            Yallist.prototype.reverse = function() {
-                var e = this.head;
-                var t = this.tail;
-                for(var r = e; null !== r; r = r.prev){
-                    var s = r.prev;
-                    r.prev = r.next;
-                    r.next = s;
-                }
-                this.head = t;
-                this.tail = e;
-                return this;
-            };
-            function insert(e, t, r) {
-                var s = t === e.head ? new Node(r, null, t, e) : new Node(r, t, t.next, e);
-                if (null === s.next) e.tail = s;
-                if (null === s.prev) e.head = s;
-                e.length++;
-                return s;
-            }
-            function push(e, t) {
-                e.tail = new Node(t, e.tail, null, e);
-                if (!e.head) e.head = e.tail;
-                e.length++;
-            }
-            function unshift(e, t) {
-                e.head = new Node(t, null, e.head, e);
-                if (!e.tail) e.tail = e.head;
-                e.length++;
-            }
-            function Node(e, t, r, s) {
-                if (!(this instanceof Node)) return new Node(e, t, r, s);
-                this.list = s;
-                this.value = e;
-                if (t) {
-                    t.next = this;
-                    this.prev = t;
-                } else this.prev = null;
-                if (r) {
-                    r.prev = this;
-                    this.next = r;
-                } else this.next = null;
-            }
-            try {
-                r(77)(Yallist);
-            } catch (e) {}
         }
     };
     var t = {};
@@ -1764,16 +1377,16 @@
         var n = t[r] = {
             exports: {}
         };
-        var i = true;
+        var o = true;
         try {
             e[r](n, n.exports, __nccwpck_require__);
-            i = false;
+            o = false;
         } finally{
-            if (i) delete t[r];
+            if (o) delete t[r];
         }
         return n.exports;
     }
     if (void 0 !== __nccwpck_require__) __nccwpck_require__.ab = __dirname + "/";
-    var r = __nccwpck_require__(921);
+    var r = __nccwpck_require__(621);
     module.exports = r;
 })();