pangea-helpers 1.0.21 → 1.0.22
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/main.cjs.js +17 -0
- package/dist/main.es.js +6121 -0
- package/dist/types/main.d.ts +8 -0
- package/package.json +8 -42
- package/dist/animation-6901ffc4.cjs +0 -1
- package/dist/animation-af1322b3.js +0 -24
- package/dist/animation.cjs.js +0 -1
- package/dist/animation.es.js +0 -4
- package/dist/coin-251f810c.js +0 -1466
- package/dist/coin-fe1122f0.cjs +0 -6
- package/dist/coin.cjs.js +0 -1
- package/dist/coin.es.js +0 -6
- package/dist/datetime-9d947e21.cjs +0 -1
- package/dist/datetime-dbf7ffd9.js +0 -29
- package/dist/datetime.cjs.js +0 -1
- package/dist/datetime.es.js +0 -4
- package/dist/index.cjs.js +0 -1
- package/dist/index.es.js +0 -16
- package/dist/number-355de26b.js +0 -14
- package/dist/number-48ed1448.cjs +0 -1
- package/dist/number.cjs.js +0 -1
- package/dist/number.es.js +0 -4
- package/dist/object-7a404c78.js +0 -2610
- package/dist/object-d8cc8ea7.cjs +0 -10
- package/dist/object.cjs.js +0 -1
- package/dist/object.es.js +0 -5
- package/dist/token-3d1b3c32.cjs +0 -3
- package/dist/token-3f22e6d2.js +0 -1984
- package/dist/token.cjs.js +0 -1
- package/dist/token.es.js +0 -4
- package/dist/types/animation.d.ts +0 -1
- package/dist/types/coin.d.ts +0 -1
- package/dist/types/datetime.d.ts +0 -1
- package/dist/types/number.d.ts +0 -1
- package/dist/types/object.d.ts +0 -1
- package/dist/types/token.d.ts +0 -1
- package/dist/types/url.d.ts +0 -1
- package/dist/url-4fb04989.cjs +0 -1
- package/dist/url-9802dbc9.js +0 -24
- package/dist/url.cjs.js +0 -1
- package/dist/url.es.js +0 -4
package/dist/token-3f22e6d2.js
DELETED
|
@@ -1,1984 +0,0 @@
|
|
|
1
|
-
var Xt = Object.defineProperty;
|
|
2
|
-
var Kt = (e, t, r) => t in e ? Xt(e, t, { enumerable: !0, configurable: !0, writable: !0, value: r }) : e[t] = r;
|
|
3
|
-
var Ne = (e, t, r) => (Kt(e, typeof t != "symbol" ? t + "" : t, r), r);
|
|
4
|
-
function qt(e) {
|
|
5
|
-
return e && e.__esModule && Object.prototype.hasOwnProperty.call(e, "default") ? e.default : e;
|
|
6
|
-
}
|
|
7
|
-
function Wt(e) {
|
|
8
|
-
if (e.__esModule)
|
|
9
|
-
return e;
|
|
10
|
-
var t = e.default;
|
|
11
|
-
if (typeof t == "function") {
|
|
12
|
-
var r = function n() {
|
|
13
|
-
return this instanceof n ? Reflect.construct(t, arguments, this.constructor) : t.apply(this, arguments);
|
|
14
|
-
};
|
|
15
|
-
r.prototype = t.prototype;
|
|
16
|
-
} else
|
|
17
|
-
r = {};
|
|
18
|
-
return Object.defineProperty(r, "__esModule", { value: !0 }), Object.keys(e).forEach(function(n) {
|
|
19
|
-
var s = Object.getOwnPropertyDescriptor(e, n);
|
|
20
|
-
Object.defineProperty(r, n, s.get ? s : {
|
|
21
|
-
enumerable: !0,
|
|
22
|
-
get: function() {
|
|
23
|
-
return e[n];
|
|
24
|
-
}
|
|
25
|
-
});
|
|
26
|
-
}), r;
|
|
27
|
-
}
|
|
28
|
-
var F = {}, Be = { exports: {} };
|
|
29
|
-
const Jt = {}, Yt = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
|
|
30
|
-
__proto__: null,
|
|
31
|
-
default: Jt
|
|
32
|
-
}, Symbol.toStringTag, { value: "Module" })), j = /* @__PURE__ */ Wt(Yt);
|
|
33
|
-
/*! safe-buffer. MIT License. Feross Aboukhadijeh <https://feross.org/opensource> */
|
|
34
|
-
(function(e, t) {
|
|
35
|
-
var r = j, n = r.Buffer;
|
|
36
|
-
function s(c, l) {
|
|
37
|
-
for (var a in c)
|
|
38
|
-
l[a] = c[a];
|
|
39
|
-
}
|
|
40
|
-
n.from && n.alloc && n.allocUnsafe && n.allocUnsafeSlow ? e.exports = r : (s(r, t), t.Buffer = i);
|
|
41
|
-
function i(c, l, a) {
|
|
42
|
-
return n(c, l, a);
|
|
43
|
-
}
|
|
44
|
-
i.prototype = Object.create(n.prototype), s(n, i), i.from = function(c, l, a) {
|
|
45
|
-
if (typeof c == "number")
|
|
46
|
-
throw new TypeError("Argument must not be a number");
|
|
47
|
-
return n(c, l, a);
|
|
48
|
-
}, i.alloc = function(c, l, a) {
|
|
49
|
-
if (typeof c != "number")
|
|
50
|
-
throw new TypeError("Argument must be a number");
|
|
51
|
-
var o = n(c);
|
|
52
|
-
return l !== void 0 ? typeof a == "string" ? o.fill(l, a) : o.fill(l) : o.fill(0), o;
|
|
53
|
-
}, i.allocUnsafe = function(c) {
|
|
54
|
-
if (typeof c != "number")
|
|
55
|
-
throw new TypeError("Argument must be a number");
|
|
56
|
-
return n(c);
|
|
57
|
-
}, i.allocUnsafeSlow = function(c) {
|
|
58
|
-
if (typeof c != "number")
|
|
59
|
-
throw new TypeError("Argument must be a number");
|
|
60
|
-
return r.SlowBuffer(c);
|
|
61
|
-
};
|
|
62
|
-
})(Be, Be.exports);
|
|
63
|
-
var re = Be.exports, ue = re.Buffer, zt = j, Zt = j;
|
|
64
|
-
function ye(e) {
|
|
65
|
-
if (this.buffer = null, this.writable = !0, this.readable = !0, !e)
|
|
66
|
-
return this.buffer = ue.alloc(0), this;
|
|
67
|
-
if (typeof e.pipe == "function")
|
|
68
|
-
return this.buffer = ue.alloc(0), e.pipe(this), this;
|
|
69
|
-
if (e.length || typeof e == "object")
|
|
70
|
-
return this.buffer = e, this.writable = !1, process.nextTick((function() {
|
|
71
|
-
this.emit("end", e), this.readable = !1, this.emit("close");
|
|
72
|
-
}).bind(this)), this;
|
|
73
|
-
throw new TypeError("Unexpected data type (" + typeof e + ")");
|
|
74
|
-
}
|
|
75
|
-
Zt.inherits(ye, zt);
|
|
76
|
-
ye.prototype.write = function(t) {
|
|
77
|
-
this.buffer = ue.concat([this.buffer, ue.from(t)]), this.emit("data", t);
|
|
78
|
-
};
|
|
79
|
-
ye.prototype.end = function(t) {
|
|
80
|
-
t && this.write(t), this.emit("end", t), this.emit("close"), this.writable = !1, this.readable = !1;
|
|
81
|
-
};
|
|
82
|
-
var Xr = ye, ee = j.Buffer, Ue = j.SlowBuffer, Qt = le;
|
|
83
|
-
function le(e, t) {
|
|
84
|
-
if (!ee.isBuffer(e) || !ee.isBuffer(t) || e.length !== t.length)
|
|
85
|
-
return !1;
|
|
86
|
-
for (var r = 0, n = 0; n < e.length; n++)
|
|
87
|
-
r |= e[n] ^ t[n];
|
|
88
|
-
return r === 0;
|
|
89
|
-
}
|
|
90
|
-
le.install = function() {
|
|
91
|
-
ee.prototype.equal = Ue.prototype.equal = function(t) {
|
|
92
|
-
return le(this, t);
|
|
93
|
-
};
|
|
94
|
-
};
|
|
95
|
-
var en = ee.prototype.equal, rn = Ue.prototype.equal;
|
|
96
|
-
le.restore = function() {
|
|
97
|
-
ee.prototype.equal = en, Ue.prototype.equal = rn;
|
|
98
|
-
};
|
|
99
|
-
function Le(e) {
|
|
100
|
-
var t = (e / 8 | 0) + (e % 8 === 0 ? 0 : 1);
|
|
101
|
-
return t;
|
|
102
|
-
}
|
|
103
|
-
var tn = {
|
|
104
|
-
ES256: Le(256),
|
|
105
|
-
ES384: Le(384),
|
|
106
|
-
ES512: Le(521)
|
|
107
|
-
};
|
|
108
|
-
function nn(e) {
|
|
109
|
-
var t = tn[e];
|
|
110
|
-
if (t)
|
|
111
|
-
return t;
|
|
112
|
-
throw new Error('Unknown algorithm "' + e + '"');
|
|
113
|
-
}
|
|
114
|
-
var sn = nn, he = re.Buffer, Kr = sn, pe = 128, qr = 0, on = 32, an = 16, cn = 2, Wr = an | on | qr << 6, me = cn | qr << 6;
|
|
115
|
-
function fn(e) {
|
|
116
|
-
return e.replace(/=/g, "").replace(/\+/g, "-").replace(/\//g, "_");
|
|
117
|
-
}
|
|
118
|
-
function Jr(e) {
|
|
119
|
-
if (he.isBuffer(e))
|
|
120
|
-
return e;
|
|
121
|
-
if (typeof e == "string")
|
|
122
|
-
return he.from(e, "base64");
|
|
123
|
-
throw new TypeError("ECDSA signature must be a Base64 string or a Buffer");
|
|
124
|
-
}
|
|
125
|
-
function un(e, t) {
|
|
126
|
-
e = Jr(e);
|
|
127
|
-
var r = Kr(t), n = r + 1, s = e.length, i = 0;
|
|
128
|
-
if (e[i++] !== Wr)
|
|
129
|
-
throw new Error('Could not find expected "seq"');
|
|
130
|
-
var c = e[i++];
|
|
131
|
-
if (c === (pe | 1) && (c = e[i++]), s - i < c)
|
|
132
|
-
throw new Error('"seq" specified length of "' + c + '", only "' + (s - i) + '" remaining');
|
|
133
|
-
if (e[i++] !== me)
|
|
134
|
-
throw new Error('Could not find expected "int" for "r"');
|
|
135
|
-
var l = e[i++];
|
|
136
|
-
if (s - i - 2 < l)
|
|
137
|
-
throw new Error('"r" specified length of "' + l + '", only "' + (s - i - 2) + '" available');
|
|
138
|
-
if (n < l)
|
|
139
|
-
throw new Error('"r" specified length of "' + l + '", max of "' + n + '" is acceptable');
|
|
140
|
-
var a = i;
|
|
141
|
-
if (i += l, e[i++] !== me)
|
|
142
|
-
throw new Error('Could not find expected "int" for "s"');
|
|
143
|
-
var o = e[i++];
|
|
144
|
-
if (s - i !== o)
|
|
145
|
-
throw new Error('"s" specified length of "' + o + '", expected "' + (s - i) + '"');
|
|
146
|
-
if (n < o)
|
|
147
|
-
throw new Error('"s" specified length of "' + o + '", max of "' + n + '" is acceptable');
|
|
148
|
-
var f = i;
|
|
149
|
-
if (i += o, i !== s)
|
|
150
|
-
throw new Error('Expected to consume entire buffer, but "' + (s - i) + '" bytes remain');
|
|
151
|
-
var u = r - l, w = r - o, m = he.allocUnsafe(u + l + w + o);
|
|
152
|
-
for (i = 0; i < u; ++i)
|
|
153
|
-
m[i] = 0;
|
|
154
|
-
e.copy(m, i, a + Math.max(-u, 0), a + l), i = r;
|
|
155
|
-
for (var h = i; i < h + w; ++i)
|
|
156
|
-
m[i] = 0;
|
|
157
|
-
return e.copy(m, i, f + Math.max(-w, 0), f + o), m = m.toString("base64"), m = fn(m), m;
|
|
158
|
-
}
|
|
159
|
-
function sr(e, t, r) {
|
|
160
|
-
for (var n = 0; t + n < r && e[t + n] === 0; )
|
|
161
|
-
++n;
|
|
162
|
-
var s = e[t + n] >= pe;
|
|
163
|
-
return s && --n, n;
|
|
164
|
-
}
|
|
165
|
-
function ln(e, t) {
|
|
166
|
-
e = Jr(e);
|
|
167
|
-
var r = Kr(t), n = e.length;
|
|
168
|
-
if (n !== r * 2)
|
|
169
|
-
throw new TypeError('"' + t + '" signatures must be "' + r * 2 + '" bytes, saw "' + n + '"');
|
|
170
|
-
var s = sr(e, 0, r), i = sr(e, r, e.length), c = r - s, l = r - i, a = 1 + 1 + c + 1 + 1 + l, o = a < pe, f = he.allocUnsafe((o ? 2 : 3) + a), u = 0;
|
|
171
|
-
return f[u++] = Wr, o ? f[u++] = a : (f[u++] = pe | 1, f[u++] = a & 255), f[u++] = me, f[u++] = c, s < 0 ? (f[u++] = 0, u += e.copy(f, u, 0, r)) : u += e.copy(f, u, s, r), f[u++] = me, f[u++] = l, i < 0 ? (f[u++] = 0, e.copy(f, u, r)) : e.copy(f, u, r + i), f;
|
|
172
|
-
}
|
|
173
|
-
var hn = {
|
|
174
|
-
derToJose: un,
|
|
175
|
-
joseToDer: ln
|
|
176
|
-
}, pn = Qt, X = re.Buffer, G = j, Yr = hn, ir = j, mn = `"%s" is not a valid algorithm.
|
|
177
|
-
Supported algorithms are:
|
|
178
|
-
"HS256", "HS384", "HS512", "RS256", "RS384", "RS512", "PS256", "PS384", "PS512", "ES256", "ES384", "ES512" and "none".`, Q = "secret must be a string or buffer", M = "key must be a string or a buffer", dn = "key must be a string, a buffer or an object", He = typeof G.createPublicKey == "function";
|
|
179
|
-
He && (M += " or a KeyObject", Q += "or a KeyObject");
|
|
180
|
-
function zr(e) {
|
|
181
|
-
if (!X.isBuffer(e) && typeof e != "string" && (!He || typeof e != "object" || typeof e.type != "string" || typeof e.asymmetricKeyType != "string" || typeof e.export != "function"))
|
|
182
|
-
throw x(M);
|
|
183
|
-
}
|
|
184
|
-
function Zr(e) {
|
|
185
|
-
if (!X.isBuffer(e) && typeof e != "string" && typeof e != "object")
|
|
186
|
-
throw x(dn);
|
|
187
|
-
}
|
|
188
|
-
function En(e) {
|
|
189
|
-
if (!X.isBuffer(e)) {
|
|
190
|
-
if (typeof e == "string")
|
|
191
|
-
return e;
|
|
192
|
-
if (!He || typeof e != "object" || e.type !== "secret" || typeof e.export != "function")
|
|
193
|
-
throw x(Q);
|
|
194
|
-
}
|
|
195
|
-
}
|
|
196
|
-
function Me(e) {
|
|
197
|
-
return e.replace(/=/g, "").replace(/\+/g, "-").replace(/\//g, "_");
|
|
198
|
-
}
|
|
199
|
-
function Qr(e) {
|
|
200
|
-
e = e.toString();
|
|
201
|
-
var t = 4 - e.length % 4;
|
|
202
|
-
if (t !== 4)
|
|
203
|
-
for (var r = 0; r < t; ++r)
|
|
204
|
-
e += "=";
|
|
205
|
-
return e.replace(/\-/g, "+").replace(/_/g, "/");
|
|
206
|
-
}
|
|
207
|
-
function x(e) {
|
|
208
|
-
var t = [].slice.call(arguments, 1), r = ir.format.bind(ir, e).apply(null, t);
|
|
209
|
-
return new TypeError(r);
|
|
210
|
-
}
|
|
211
|
-
function $n(e) {
|
|
212
|
-
return X.isBuffer(e) || typeof e == "string";
|
|
213
|
-
}
|
|
214
|
-
function te(e) {
|
|
215
|
-
return $n(e) || (e = JSON.stringify(e)), e;
|
|
216
|
-
}
|
|
217
|
-
function et(e) {
|
|
218
|
-
return function(r, n) {
|
|
219
|
-
En(n), r = te(r);
|
|
220
|
-
var s = G.createHmac("sha" + e, n), i = (s.update(r), s.digest("base64"));
|
|
221
|
-
return Me(i);
|
|
222
|
-
};
|
|
223
|
-
}
|
|
224
|
-
function yn(e) {
|
|
225
|
-
return function(r, n, s) {
|
|
226
|
-
var i = et(e)(r, s);
|
|
227
|
-
return pn(X.from(n), X.from(i));
|
|
228
|
-
};
|
|
229
|
-
}
|
|
230
|
-
function rt(e) {
|
|
231
|
-
return function(r, n) {
|
|
232
|
-
Zr(n), r = te(r);
|
|
233
|
-
var s = G.createSign("RSA-SHA" + e), i = (s.update(r), s.sign(n, "base64"));
|
|
234
|
-
return Me(i);
|
|
235
|
-
};
|
|
236
|
-
}
|
|
237
|
-
function tt(e) {
|
|
238
|
-
return function(r, n, s) {
|
|
239
|
-
zr(s), r = te(r), n = Qr(n);
|
|
240
|
-
var i = G.createVerify("RSA-SHA" + e);
|
|
241
|
-
return i.update(r), i.verify(s, n, "base64");
|
|
242
|
-
};
|
|
243
|
-
}
|
|
244
|
-
function gn(e) {
|
|
245
|
-
return function(r, n) {
|
|
246
|
-
Zr(n), r = te(r);
|
|
247
|
-
var s = G.createSign("RSA-SHA" + e), i = (s.update(r), s.sign({
|
|
248
|
-
key: n,
|
|
249
|
-
padding: G.constants.RSA_PKCS1_PSS_PADDING,
|
|
250
|
-
saltLength: G.constants.RSA_PSS_SALTLEN_DIGEST
|
|
251
|
-
}, "base64"));
|
|
252
|
-
return Me(i);
|
|
253
|
-
};
|
|
254
|
-
}
|
|
255
|
-
function Sn(e) {
|
|
256
|
-
return function(r, n, s) {
|
|
257
|
-
zr(s), r = te(r), n = Qr(n);
|
|
258
|
-
var i = G.createVerify("RSA-SHA" + e);
|
|
259
|
-
return i.update(r), i.verify({
|
|
260
|
-
key: s,
|
|
261
|
-
padding: G.constants.RSA_PKCS1_PSS_PADDING,
|
|
262
|
-
saltLength: G.constants.RSA_PSS_SALTLEN_DIGEST
|
|
263
|
-
}, n, "base64");
|
|
264
|
-
};
|
|
265
|
-
}
|
|
266
|
-
function vn(e) {
|
|
267
|
-
var t = rt(e);
|
|
268
|
-
return function() {
|
|
269
|
-
var n = t.apply(null, arguments);
|
|
270
|
-
return n = Yr.derToJose(n, "ES" + e), n;
|
|
271
|
-
};
|
|
272
|
-
}
|
|
273
|
-
function wn(e) {
|
|
274
|
-
var t = tt(e);
|
|
275
|
-
return function(n, s, i) {
|
|
276
|
-
s = Yr.joseToDer(s, "ES" + e).toString("base64");
|
|
277
|
-
var c = t(n, s, i);
|
|
278
|
-
return c;
|
|
279
|
-
};
|
|
280
|
-
}
|
|
281
|
-
function bn() {
|
|
282
|
-
return function() {
|
|
283
|
-
return "";
|
|
284
|
-
};
|
|
285
|
-
}
|
|
286
|
-
function In() {
|
|
287
|
-
return function(t, r) {
|
|
288
|
-
return r === "";
|
|
289
|
-
};
|
|
290
|
-
}
|
|
291
|
-
var nt = function(t) {
|
|
292
|
-
var r = {
|
|
293
|
-
hs: et,
|
|
294
|
-
rs: rt,
|
|
295
|
-
ps: gn,
|
|
296
|
-
es: vn,
|
|
297
|
-
none: bn
|
|
298
|
-
}, n = {
|
|
299
|
-
hs: yn,
|
|
300
|
-
rs: tt,
|
|
301
|
-
ps: Sn,
|
|
302
|
-
es: wn,
|
|
303
|
-
none: In
|
|
304
|
-
}, s = t.match(/^(RS|PS|ES|HS)(256|384|512)$|^(none)$/i);
|
|
305
|
-
if (!s)
|
|
306
|
-
throw x(mn, t);
|
|
307
|
-
var i = (s[1] || s[3]).toLowerCase(), c = s[2];
|
|
308
|
-
return {
|
|
309
|
-
sign: r[i](c),
|
|
310
|
-
verify: n[i](c)
|
|
311
|
-
};
|
|
312
|
-
}, Rn = j.Buffer, st = function(t) {
|
|
313
|
-
return typeof t == "string" ? t : typeof t == "number" || Rn.isBuffer(t) ? t.toString() : JSON.stringify(t);
|
|
314
|
-
}, Tn = re.Buffer, or = Xr, An = nt, On = j, ar = st, Xe = j;
|
|
315
|
-
function cr(e, t) {
|
|
316
|
-
return Tn.from(e, t).toString("base64").replace(/=/g, "").replace(/\+/g, "-").replace(/\//g, "_");
|
|
317
|
-
}
|
|
318
|
-
function Nn(e, t, r) {
|
|
319
|
-
r = r || "utf8";
|
|
320
|
-
var n = cr(ar(e), "binary"), s = cr(ar(t), r);
|
|
321
|
-
return Xe.format("%s.%s", n, s);
|
|
322
|
-
}
|
|
323
|
-
function it(e) {
|
|
324
|
-
var t = e.header, r = e.payload, n = e.secret || e.privateKey, s = e.encoding, i = An(t.alg), c = Nn(t, r, s), l = i.sign(c, n);
|
|
325
|
-
return Xe.format("%s.%s", c, l);
|
|
326
|
-
}
|
|
327
|
-
function ge(e) {
|
|
328
|
-
var t = e.secret || e.privateKey || e.key, r = new or(t);
|
|
329
|
-
this.readable = !0, this.header = e.header, this.encoding = e.encoding, this.secret = this.privateKey = this.key = r, this.payload = new or(e.payload), this.secret.once("close", (function() {
|
|
330
|
-
!this.payload.writable && this.readable && this.sign();
|
|
331
|
-
}).bind(this)), this.payload.once("close", (function() {
|
|
332
|
-
!this.secret.writable && this.readable && this.sign();
|
|
333
|
-
}).bind(this));
|
|
334
|
-
}
|
|
335
|
-
Xe.inherits(ge, On);
|
|
336
|
-
ge.prototype.sign = function() {
|
|
337
|
-
try {
|
|
338
|
-
var t = it({
|
|
339
|
-
header: this.header,
|
|
340
|
-
payload: this.payload.buffer,
|
|
341
|
-
secret: this.secret.buffer,
|
|
342
|
-
encoding: this.encoding
|
|
343
|
-
});
|
|
344
|
-
return this.emit("done", t), this.emit("data", t), this.emit("end"), this.readable = !1, t;
|
|
345
|
-
} catch (r) {
|
|
346
|
-
this.readable = !1, this.emit("error", r), this.emit("close");
|
|
347
|
-
}
|
|
348
|
-
};
|
|
349
|
-
ge.sign = it;
|
|
350
|
-
var Ln = ge, ot = re.Buffer, fr = Xr, jn = nt, Pn = j, at = st, _n = j, xn = /^[a-zA-Z0-9\-_]+?\.[a-zA-Z0-9\-_]+?\.([a-zA-Z0-9\-_]+)?$/;
|
|
351
|
-
function Dn(e) {
|
|
352
|
-
return Object.prototype.toString.call(e) === "[object Object]";
|
|
353
|
-
}
|
|
354
|
-
function Cn(e) {
|
|
355
|
-
if (Dn(e))
|
|
356
|
-
return e;
|
|
357
|
-
try {
|
|
358
|
-
return JSON.parse(e);
|
|
359
|
-
} catch {
|
|
360
|
-
return;
|
|
361
|
-
}
|
|
362
|
-
}
|
|
363
|
-
function ct(e) {
|
|
364
|
-
var t = e.split(".", 1)[0];
|
|
365
|
-
return Cn(ot.from(t, "base64").toString("binary"));
|
|
366
|
-
}
|
|
367
|
-
function Bn(e) {
|
|
368
|
-
return e.split(".", 2).join(".");
|
|
369
|
-
}
|
|
370
|
-
function ft(e) {
|
|
371
|
-
return e.split(".")[2];
|
|
372
|
-
}
|
|
373
|
-
function Gn(e, t) {
|
|
374
|
-
t = t || "utf8";
|
|
375
|
-
var r = e.split(".")[1];
|
|
376
|
-
return ot.from(r, "base64").toString(t);
|
|
377
|
-
}
|
|
378
|
-
function ut(e) {
|
|
379
|
-
return xn.test(e) && !!ct(e);
|
|
380
|
-
}
|
|
381
|
-
function lt(e, t, r) {
|
|
382
|
-
if (!t) {
|
|
383
|
-
var n = new Error("Missing algorithm parameter for jws.verify");
|
|
384
|
-
throw n.code = "MISSING_ALGORITHM", n;
|
|
385
|
-
}
|
|
386
|
-
e = at(e);
|
|
387
|
-
var s = ft(e), i = Bn(e), c = jn(t);
|
|
388
|
-
return c.verify(i, s, r);
|
|
389
|
-
}
|
|
390
|
-
function ht(e, t) {
|
|
391
|
-
if (t = t || {}, e = at(e), !ut(e))
|
|
392
|
-
return null;
|
|
393
|
-
var r = ct(e);
|
|
394
|
-
if (!r)
|
|
395
|
-
return null;
|
|
396
|
-
var n = Gn(e);
|
|
397
|
-
return (r.typ === "JWT" || t.json) && (n = JSON.parse(n, t.encoding)), {
|
|
398
|
-
header: r,
|
|
399
|
-
payload: n,
|
|
400
|
-
signature: ft(e)
|
|
401
|
-
};
|
|
402
|
-
}
|
|
403
|
-
function J(e) {
|
|
404
|
-
e = e || {};
|
|
405
|
-
var t = e.secret || e.publicKey || e.key, r = new fr(t);
|
|
406
|
-
this.readable = !0, this.algorithm = e.algorithm, this.encoding = e.encoding, this.secret = this.publicKey = this.key = r, this.signature = new fr(e.signature), this.secret.once("close", (function() {
|
|
407
|
-
!this.signature.writable && this.readable && this.verify();
|
|
408
|
-
}).bind(this)), this.signature.once("close", (function() {
|
|
409
|
-
!this.secret.writable && this.readable && this.verify();
|
|
410
|
-
}).bind(this));
|
|
411
|
-
}
|
|
412
|
-
_n.inherits(J, Pn);
|
|
413
|
-
J.prototype.verify = function() {
|
|
414
|
-
try {
|
|
415
|
-
var t = lt(this.signature.buffer, this.algorithm, this.key.buffer), r = ht(this.signature.buffer, this.encoding);
|
|
416
|
-
return this.emit("done", t, r), this.emit("data", t), this.emit("end"), this.readable = !1, t;
|
|
417
|
-
} catch (n) {
|
|
418
|
-
this.readable = !1, this.emit("error", n), this.emit("close");
|
|
419
|
-
}
|
|
420
|
-
};
|
|
421
|
-
J.decode = ht;
|
|
422
|
-
J.isValid = ut;
|
|
423
|
-
J.verify = lt;
|
|
424
|
-
var Fn = J, pt = Ln, Se = Fn, Vn = [
|
|
425
|
-
"HS256",
|
|
426
|
-
"HS384",
|
|
427
|
-
"HS512",
|
|
428
|
-
"RS256",
|
|
429
|
-
"RS384",
|
|
430
|
-
"RS512",
|
|
431
|
-
"PS256",
|
|
432
|
-
"PS384",
|
|
433
|
-
"PS512",
|
|
434
|
-
"ES256",
|
|
435
|
-
"ES384",
|
|
436
|
-
"ES512"
|
|
437
|
-
];
|
|
438
|
-
F.ALGORITHMS = Vn;
|
|
439
|
-
F.sign = pt.sign;
|
|
440
|
-
F.verify = Se.verify;
|
|
441
|
-
F.decode = Se.decode;
|
|
442
|
-
F.isValid = Se.isValid;
|
|
443
|
-
F.createSign = function(t) {
|
|
444
|
-
return new pt(t);
|
|
445
|
-
};
|
|
446
|
-
F.createVerify = function(t) {
|
|
447
|
-
return new Se(t);
|
|
448
|
-
};
|
|
449
|
-
var kn = F, mt = function(e, t) {
|
|
450
|
-
t = t || {};
|
|
451
|
-
var r = kn.decode(e, t);
|
|
452
|
-
if (!r)
|
|
453
|
-
return null;
|
|
454
|
-
var n = r.payload;
|
|
455
|
-
if (typeof n == "string")
|
|
456
|
-
try {
|
|
457
|
-
var s = JSON.parse(n);
|
|
458
|
-
s !== null && typeof s == "object" && (n = s);
|
|
459
|
-
} catch {
|
|
460
|
-
}
|
|
461
|
-
return t.complete === !0 ? {
|
|
462
|
-
header: r.header,
|
|
463
|
-
payload: n,
|
|
464
|
-
signature: r.signature
|
|
465
|
-
} : n;
|
|
466
|
-
}, de = function(e, t) {
|
|
467
|
-
Error.call(this, e), Error.captureStackTrace && Error.captureStackTrace(this, this.constructor), this.name = "JsonWebTokenError", this.message = e, t && (this.inner = t);
|
|
468
|
-
};
|
|
469
|
-
de.prototype = Object.create(Error.prototype);
|
|
470
|
-
de.prototype.constructor = de;
|
|
471
|
-
var ve = de, dt = ve, Ee = function(e, t) {
|
|
472
|
-
dt.call(this, e), this.name = "NotBeforeError", this.date = t;
|
|
473
|
-
};
|
|
474
|
-
Ee.prototype = Object.create(dt.prototype);
|
|
475
|
-
Ee.prototype.constructor = Ee;
|
|
476
|
-
var Et = Ee, $t = ve, $e = function(e, t) {
|
|
477
|
-
$t.call(this, e), this.name = "TokenExpiredError", this.expiredAt = t;
|
|
478
|
-
};
|
|
479
|
-
$e.prototype = Object.create($t.prototype);
|
|
480
|
-
$e.prototype.constructor = $e;
|
|
481
|
-
var yt = $e, K = 1e3, q = K * 60, W = q * 60, U = W * 24, Un = U * 7, Hn = U * 365.25, Mn = function(e, t) {
|
|
482
|
-
t = t || {};
|
|
483
|
-
var r = typeof e;
|
|
484
|
-
if (r === "string" && e.length > 0)
|
|
485
|
-
return Xn(e);
|
|
486
|
-
if (r === "number" && isFinite(e))
|
|
487
|
-
return t.long ? qn(e) : Kn(e);
|
|
488
|
-
throw new Error(
|
|
489
|
-
"val is not a non-empty string or a valid number. val=" + JSON.stringify(e)
|
|
490
|
-
);
|
|
491
|
-
};
|
|
492
|
-
function Xn(e) {
|
|
493
|
-
if (e = String(e), !(e.length > 100)) {
|
|
494
|
-
var t = /^(-?(?:\d+)?\.?\d+) *(milliseconds?|msecs?|ms|seconds?|secs?|s|minutes?|mins?|m|hours?|hrs?|h|days?|d|weeks?|w|years?|yrs?|y)?$/i.exec(
|
|
495
|
-
e
|
|
496
|
-
);
|
|
497
|
-
if (t) {
|
|
498
|
-
var r = parseFloat(t[1]), n = (t[2] || "ms").toLowerCase();
|
|
499
|
-
switch (n) {
|
|
500
|
-
case "years":
|
|
501
|
-
case "year":
|
|
502
|
-
case "yrs":
|
|
503
|
-
case "yr":
|
|
504
|
-
case "y":
|
|
505
|
-
return r * Hn;
|
|
506
|
-
case "weeks":
|
|
507
|
-
case "week":
|
|
508
|
-
case "w":
|
|
509
|
-
return r * Un;
|
|
510
|
-
case "days":
|
|
511
|
-
case "day":
|
|
512
|
-
case "d":
|
|
513
|
-
return r * U;
|
|
514
|
-
case "hours":
|
|
515
|
-
case "hour":
|
|
516
|
-
case "hrs":
|
|
517
|
-
case "hr":
|
|
518
|
-
case "h":
|
|
519
|
-
return r * W;
|
|
520
|
-
case "minutes":
|
|
521
|
-
case "minute":
|
|
522
|
-
case "mins":
|
|
523
|
-
case "min":
|
|
524
|
-
case "m":
|
|
525
|
-
return r * q;
|
|
526
|
-
case "seconds":
|
|
527
|
-
case "second":
|
|
528
|
-
case "secs":
|
|
529
|
-
case "sec":
|
|
530
|
-
case "s":
|
|
531
|
-
return r * K;
|
|
532
|
-
case "milliseconds":
|
|
533
|
-
case "millisecond":
|
|
534
|
-
case "msecs":
|
|
535
|
-
case "msec":
|
|
536
|
-
case "ms":
|
|
537
|
-
return r;
|
|
538
|
-
default:
|
|
539
|
-
return;
|
|
540
|
-
}
|
|
541
|
-
}
|
|
542
|
-
}
|
|
543
|
-
}
|
|
544
|
-
function Kn(e) {
|
|
545
|
-
var t = Math.abs(e);
|
|
546
|
-
return t >= U ? Math.round(e / U) + "d" : t >= W ? Math.round(e / W) + "h" : t >= q ? Math.round(e / q) + "m" : t >= K ? Math.round(e / K) + "s" : e + "ms";
|
|
547
|
-
}
|
|
548
|
-
function qn(e) {
|
|
549
|
-
var t = Math.abs(e);
|
|
550
|
-
return t >= U ? se(e, t, U, "day") : t >= W ? se(e, t, W, "hour") : t >= q ? se(e, t, q, "minute") : t >= K ? se(e, t, K, "second") : e + " ms";
|
|
551
|
-
}
|
|
552
|
-
function se(e, t, r, n) {
|
|
553
|
-
var s = t >= r * 1.5;
|
|
554
|
-
return Math.round(e / r) + " " + n + (s ? "s" : "");
|
|
555
|
-
}
|
|
556
|
-
var Wn = Mn, gt = function(e, t) {
|
|
557
|
-
var r = t || Math.floor(Date.now() / 1e3);
|
|
558
|
-
if (typeof e == "string") {
|
|
559
|
-
var n = Wn(e);
|
|
560
|
-
return typeof n > "u" ? void 0 : Math.floor(r + n / 1e3);
|
|
561
|
-
} else
|
|
562
|
-
return typeof e == "number" ? r + e : void 0;
|
|
563
|
-
}, Ge = { exports: {} };
|
|
564
|
-
const Jn = "2.0.0", St = 256, Yn = Number.MAX_SAFE_INTEGER || /* istanbul ignore next */
|
|
565
|
-
9007199254740991, zn = 16, Zn = St - 6, Qn = [
|
|
566
|
-
"major",
|
|
567
|
-
"premajor",
|
|
568
|
-
"minor",
|
|
569
|
-
"preminor",
|
|
570
|
-
"patch",
|
|
571
|
-
"prepatch",
|
|
572
|
-
"prerelease"
|
|
573
|
-
];
|
|
574
|
-
var we = {
|
|
575
|
-
MAX_LENGTH: St,
|
|
576
|
-
MAX_SAFE_COMPONENT_LENGTH: zn,
|
|
577
|
-
MAX_SAFE_BUILD_LENGTH: Zn,
|
|
578
|
-
MAX_SAFE_INTEGER: Yn,
|
|
579
|
-
RELEASE_TYPES: Qn,
|
|
580
|
-
SEMVER_SPEC_VERSION: Jn,
|
|
581
|
-
FLAG_INCLUDE_PRERELEASE: 1,
|
|
582
|
-
FLAG_LOOSE: 2
|
|
583
|
-
};
|
|
584
|
-
const es = typeof process == "object" && process.env && process.env.NODE_DEBUG && /\bsemver\b/i.test(process.env.NODE_DEBUG) ? (...e) => console.error("SEMVER", ...e) : () => {
|
|
585
|
-
};
|
|
586
|
-
var be = es;
|
|
587
|
-
(function(e, t) {
|
|
588
|
-
const {
|
|
589
|
-
MAX_SAFE_COMPONENT_LENGTH: r,
|
|
590
|
-
MAX_SAFE_BUILD_LENGTH: n,
|
|
591
|
-
MAX_LENGTH: s
|
|
592
|
-
} = we, i = be;
|
|
593
|
-
t = e.exports = {};
|
|
594
|
-
const c = t.re = [], l = t.safeRe = [], a = t.src = [], o = t.t = {};
|
|
595
|
-
let f = 0;
|
|
596
|
-
const u = "[a-zA-Z0-9-]", w = [
|
|
597
|
-
["\\s", 1],
|
|
598
|
-
["\\d", s],
|
|
599
|
-
[u, n]
|
|
600
|
-
], m = (R) => {
|
|
601
|
-
for (const [L, V] of w)
|
|
602
|
-
R = R.split(`${L}*`).join(`${L}{0,${V}}`).split(`${L}+`).join(`${L}{1,${V}}`);
|
|
603
|
-
return R;
|
|
604
|
-
}, h = (R, L, V) => {
|
|
605
|
-
const A = m(L), _ = f++;
|
|
606
|
-
i(R, _, L), o[R] = _, a[_] = L, c[_] = new RegExp(L, V ? "g" : void 0), l[_] = new RegExp(A, V ? "g" : void 0);
|
|
607
|
-
};
|
|
608
|
-
h("NUMERICIDENTIFIER", "0|[1-9]\\d*"), h("NUMERICIDENTIFIERLOOSE", "\\d+"), h("NONNUMERICIDENTIFIER", `\\d*[a-zA-Z-]${u}*`), h("MAINVERSION", `(${a[o.NUMERICIDENTIFIER]})\\.(${a[o.NUMERICIDENTIFIER]})\\.(${a[o.NUMERICIDENTIFIER]})`), h("MAINVERSIONLOOSE", `(${a[o.NUMERICIDENTIFIERLOOSE]})\\.(${a[o.NUMERICIDENTIFIERLOOSE]})\\.(${a[o.NUMERICIDENTIFIERLOOSE]})`), h("PRERELEASEIDENTIFIER", `(?:${a[o.NUMERICIDENTIFIER]}|${a[o.NONNUMERICIDENTIFIER]})`), h("PRERELEASEIDENTIFIERLOOSE", `(?:${a[o.NUMERICIDENTIFIERLOOSE]}|${a[o.NONNUMERICIDENTIFIER]})`), h("PRERELEASE", `(?:-(${a[o.PRERELEASEIDENTIFIER]}(?:\\.${a[o.PRERELEASEIDENTIFIER]})*))`), h("PRERELEASELOOSE", `(?:-?(${a[o.PRERELEASEIDENTIFIERLOOSE]}(?:\\.${a[o.PRERELEASEIDENTIFIERLOOSE]})*))`), h("BUILDIDENTIFIER", `${u}+`), h("BUILD", `(?:\\+(${a[o.BUILDIDENTIFIER]}(?:\\.${a[o.BUILDIDENTIFIER]})*))`), h("FULLPLAIN", `v?${a[o.MAINVERSION]}${a[o.PRERELEASE]}?${a[o.BUILD]}?`), h("FULL", `^${a[o.FULLPLAIN]}$`), h("LOOSEPLAIN", `[v=\\s]*${a[o.MAINVERSIONLOOSE]}${a[o.PRERELEASELOOSE]}?${a[o.BUILD]}?`), h("LOOSE", `^${a[o.LOOSEPLAIN]}$`), h("GTLT", "((?:<|>)?=?)"), h("XRANGEIDENTIFIERLOOSE", `${a[o.NUMERICIDENTIFIERLOOSE]}|x|X|\\*`), h("XRANGEIDENTIFIER", `${a[o.NUMERICIDENTIFIER]}|x|X|\\*`), h("XRANGEPLAIN", `[v=\\s]*(${a[o.XRANGEIDENTIFIER]})(?:\\.(${a[o.XRANGEIDENTIFIER]})(?:\\.(${a[o.XRANGEIDENTIFIER]})(?:${a[o.PRERELEASE]})?${a[o.BUILD]}?)?)?`), h("XRANGEPLAINLOOSE", `[v=\\s]*(${a[o.XRANGEIDENTIFIERLOOSE]})(?:\\.(${a[o.XRANGEIDENTIFIERLOOSE]})(?:\\.(${a[o.XRANGEIDENTIFIERLOOSE]})(?:${a[o.PRERELEASELOOSE]})?${a[o.BUILD]}?)?)?`), h("XRANGE", `^${a[o.GTLT]}\\s*${a[o.XRANGEPLAIN]}$`), h("XRANGELOOSE", `^${a[o.GTLT]}\\s*${a[o.XRANGEPLAINLOOSE]}$`), h("COERCEPLAIN", `(^|[^\\d])(\\d{1,${r}})(?:\\.(\\d{1,${r}}))?(?:\\.(\\d{1,${r}}))?`), h("COERCE", `${a[o.COERCEPLAIN]}(?:$|[^\\d])`), h("COERCEFULL", a[o.COERCEPLAIN] + `(?:${a[o.PRERELEASE]})?(?:${a[o.BUILD]})?(?:$|[^\\d])`), h("COERCERTL", a[o.COERCE], !0), h("COERCERTLFULL", a[o.COERCEFULL], !0), h("LONETILDE", "(?:~>?)"), h("TILDETRIM", `(\\s*)${a[o.LONETILDE]}\\s+`, !0), t.tildeTrimReplace = "$1~", h("TILDE", `^${a[o.LONETILDE]}${a[o.XRANGEPLAIN]}$`), h("TILDELOOSE", `^${a[o.LONETILDE]}${a[o.XRANGEPLAINLOOSE]}$`), h("LONECARET", "(?:\\^)"), h("CARETTRIM", `(\\s*)${a[o.LONECARET]}\\s+`, !0), t.caretTrimReplace = "$1^", h("CARET", `^${a[o.LONECARET]}${a[o.XRANGEPLAIN]}$`), h("CARETLOOSE", `^${a[o.LONECARET]}${a[o.XRANGEPLAINLOOSE]}$`), h("COMPARATORLOOSE", `^${a[o.GTLT]}\\s*(${a[o.LOOSEPLAIN]})$|^$`), h("COMPARATOR", `^${a[o.GTLT]}\\s*(${a[o.FULLPLAIN]})$|^$`), h("COMPARATORTRIM", `(\\s*)${a[o.GTLT]}\\s*(${a[o.LOOSEPLAIN]}|${a[o.XRANGEPLAIN]})`, !0), t.comparatorTrimReplace = "$1$2$3", h("HYPHENRANGE", `^\\s*(${a[o.XRANGEPLAIN]})\\s+-\\s+(${a[o.XRANGEPLAIN]})\\s*$`), h("HYPHENRANGELOOSE", `^\\s*(${a[o.XRANGEPLAINLOOSE]})\\s+-\\s+(${a[o.XRANGEPLAINLOOSE]})\\s*$`), h("STAR", "(<|>)?=?\\s*\\*"), h("GTE0", "^\\s*>=\\s*0\\.0\\.0\\s*$"), h("GTE0PRE", "^\\s*>=\\s*0\\.0\\.0-0\\s*$");
|
|
609
|
-
})(Ge, Ge.exports);
|
|
610
|
-
var ne = Ge.exports;
|
|
611
|
-
const rs = Object.freeze({ loose: !0 }), ts = Object.freeze({}), ns = (e) => e ? typeof e != "object" ? rs : e : ts;
|
|
612
|
-
var Ke = ns;
|
|
613
|
-
const ur = /^[0-9]+$/, vt = (e, t) => {
|
|
614
|
-
const r = ur.test(e), n = ur.test(t);
|
|
615
|
-
return r && n && (e = +e, t = +t), e === t ? 0 : r && !n ? -1 : n && !r ? 1 : e < t ? -1 : 1;
|
|
616
|
-
}, ss = (e, t) => vt(t, e);
|
|
617
|
-
var wt = {
|
|
618
|
-
compareIdentifiers: vt,
|
|
619
|
-
rcompareIdentifiers: ss
|
|
620
|
-
};
|
|
621
|
-
const ie = be, { MAX_LENGTH: lr, MAX_SAFE_INTEGER: oe } = we, { safeRe: hr, t: pr } = ne, is = Ke, { compareIdentifiers: H } = wt;
|
|
622
|
-
let os = class B {
|
|
623
|
-
constructor(t, r) {
|
|
624
|
-
if (r = is(r), t instanceof B) {
|
|
625
|
-
if (t.loose === !!r.loose && t.includePrerelease === !!r.includePrerelease)
|
|
626
|
-
return t;
|
|
627
|
-
t = t.version;
|
|
628
|
-
} else if (typeof t != "string")
|
|
629
|
-
throw new TypeError(`Invalid version. Must be a string. Got type "${typeof t}".`);
|
|
630
|
-
if (t.length > lr)
|
|
631
|
-
throw new TypeError(
|
|
632
|
-
`version is longer than ${lr} characters`
|
|
633
|
-
);
|
|
634
|
-
ie("SemVer", t, r), this.options = r, this.loose = !!r.loose, this.includePrerelease = !!r.includePrerelease;
|
|
635
|
-
const n = t.trim().match(r.loose ? hr[pr.LOOSE] : hr[pr.FULL]);
|
|
636
|
-
if (!n)
|
|
637
|
-
throw new TypeError(`Invalid Version: ${t}`);
|
|
638
|
-
if (this.raw = t, this.major = +n[1], this.minor = +n[2], this.patch = +n[3], this.major > oe || this.major < 0)
|
|
639
|
-
throw new TypeError("Invalid major version");
|
|
640
|
-
if (this.minor > oe || this.minor < 0)
|
|
641
|
-
throw new TypeError("Invalid minor version");
|
|
642
|
-
if (this.patch > oe || this.patch < 0)
|
|
643
|
-
throw new TypeError("Invalid patch version");
|
|
644
|
-
n[4] ? this.prerelease = n[4].split(".").map((s) => {
|
|
645
|
-
if (/^[0-9]+$/.test(s)) {
|
|
646
|
-
const i = +s;
|
|
647
|
-
if (i >= 0 && i < oe)
|
|
648
|
-
return i;
|
|
649
|
-
}
|
|
650
|
-
return s;
|
|
651
|
-
}) : this.prerelease = [], this.build = n[5] ? n[5].split(".") : [], this.format();
|
|
652
|
-
}
|
|
653
|
-
format() {
|
|
654
|
-
return this.version = `${this.major}.${this.minor}.${this.patch}`, this.prerelease.length && (this.version += `-${this.prerelease.join(".")}`), this.version;
|
|
655
|
-
}
|
|
656
|
-
toString() {
|
|
657
|
-
return this.version;
|
|
658
|
-
}
|
|
659
|
-
compare(t) {
|
|
660
|
-
if (ie("SemVer.compare", this.version, this.options, t), !(t instanceof B)) {
|
|
661
|
-
if (typeof t == "string" && t === this.version)
|
|
662
|
-
return 0;
|
|
663
|
-
t = new B(t, this.options);
|
|
664
|
-
}
|
|
665
|
-
return t.version === this.version ? 0 : this.compareMain(t) || this.comparePre(t);
|
|
666
|
-
}
|
|
667
|
-
compareMain(t) {
|
|
668
|
-
return t instanceof B || (t = new B(t, this.options)), H(this.major, t.major) || H(this.minor, t.minor) || H(this.patch, t.patch);
|
|
669
|
-
}
|
|
670
|
-
comparePre(t) {
|
|
671
|
-
if (t instanceof B || (t = new B(t, this.options)), this.prerelease.length && !t.prerelease.length)
|
|
672
|
-
return -1;
|
|
673
|
-
if (!this.prerelease.length && t.prerelease.length)
|
|
674
|
-
return 1;
|
|
675
|
-
if (!this.prerelease.length && !t.prerelease.length)
|
|
676
|
-
return 0;
|
|
677
|
-
let r = 0;
|
|
678
|
-
do {
|
|
679
|
-
const n = this.prerelease[r], s = t.prerelease[r];
|
|
680
|
-
if (ie("prerelease compare", r, n, s), n === void 0 && s === void 0)
|
|
681
|
-
return 0;
|
|
682
|
-
if (s === void 0)
|
|
683
|
-
return 1;
|
|
684
|
-
if (n === void 0)
|
|
685
|
-
return -1;
|
|
686
|
-
if (n === s)
|
|
687
|
-
continue;
|
|
688
|
-
return H(n, s);
|
|
689
|
-
} while (++r);
|
|
690
|
-
}
|
|
691
|
-
compareBuild(t) {
|
|
692
|
-
t instanceof B || (t = new B(t, this.options));
|
|
693
|
-
let r = 0;
|
|
694
|
-
do {
|
|
695
|
-
const n = this.build[r], s = t.build[r];
|
|
696
|
-
if (ie("build compare", r, n, s), n === void 0 && s === void 0)
|
|
697
|
-
return 0;
|
|
698
|
-
if (s === void 0)
|
|
699
|
-
return 1;
|
|
700
|
-
if (n === void 0)
|
|
701
|
-
return -1;
|
|
702
|
-
if (n === s)
|
|
703
|
-
continue;
|
|
704
|
-
return H(n, s);
|
|
705
|
-
} while (++r);
|
|
706
|
-
}
|
|
707
|
-
// preminor will bump the version up to the next minor release, and immediately
|
|
708
|
-
// down to pre-release. premajor and prepatch work the same way.
|
|
709
|
-
inc(t, r, n) {
|
|
710
|
-
switch (t) {
|
|
711
|
-
case "premajor":
|
|
712
|
-
this.prerelease.length = 0, this.patch = 0, this.minor = 0, this.major++, this.inc("pre", r, n);
|
|
713
|
-
break;
|
|
714
|
-
case "preminor":
|
|
715
|
-
this.prerelease.length = 0, this.patch = 0, this.minor++, this.inc("pre", r, n);
|
|
716
|
-
break;
|
|
717
|
-
case "prepatch":
|
|
718
|
-
this.prerelease.length = 0, this.inc("patch", r, n), this.inc("pre", r, n);
|
|
719
|
-
break;
|
|
720
|
-
case "prerelease":
|
|
721
|
-
this.prerelease.length === 0 && this.inc("patch", r, n), this.inc("pre", r, n);
|
|
722
|
-
break;
|
|
723
|
-
case "major":
|
|
724
|
-
(this.minor !== 0 || this.patch !== 0 || this.prerelease.length === 0) && this.major++, this.minor = 0, this.patch = 0, this.prerelease = [];
|
|
725
|
-
break;
|
|
726
|
-
case "minor":
|
|
727
|
-
(this.patch !== 0 || this.prerelease.length === 0) && this.minor++, this.patch = 0, this.prerelease = [];
|
|
728
|
-
break;
|
|
729
|
-
case "patch":
|
|
730
|
-
this.prerelease.length === 0 && this.patch++, this.prerelease = [];
|
|
731
|
-
break;
|
|
732
|
-
case "pre": {
|
|
733
|
-
const s = Number(n) ? 1 : 0;
|
|
734
|
-
if (!r && n === !1)
|
|
735
|
-
throw new Error("invalid increment argument: identifier is empty");
|
|
736
|
-
if (this.prerelease.length === 0)
|
|
737
|
-
this.prerelease = [s];
|
|
738
|
-
else {
|
|
739
|
-
let i = this.prerelease.length;
|
|
740
|
-
for (; --i >= 0; )
|
|
741
|
-
typeof this.prerelease[i] == "number" && (this.prerelease[i]++, i = -2);
|
|
742
|
-
if (i === -1) {
|
|
743
|
-
if (r === this.prerelease.join(".") && n === !1)
|
|
744
|
-
throw new Error("invalid increment argument: identifier already exists");
|
|
745
|
-
this.prerelease.push(s);
|
|
746
|
-
}
|
|
747
|
-
}
|
|
748
|
-
if (r) {
|
|
749
|
-
let i = [r, s];
|
|
750
|
-
n === !1 && (i = [r]), H(this.prerelease[0], r) === 0 ? isNaN(this.prerelease[1]) && (this.prerelease = i) : this.prerelease = i;
|
|
751
|
-
}
|
|
752
|
-
break;
|
|
753
|
-
}
|
|
754
|
-
default:
|
|
755
|
-
throw new Error(`invalid increment argument: ${t}`);
|
|
756
|
-
}
|
|
757
|
-
return this.raw = this.format(), this.build.length && (this.raw += `+${this.build.join(".")}`), this;
|
|
758
|
-
}
|
|
759
|
-
};
|
|
760
|
-
var N = os;
|
|
761
|
-
const mr = N, as = (e, t, r = !1) => {
|
|
762
|
-
if (e instanceof mr)
|
|
763
|
-
return e;
|
|
764
|
-
try {
|
|
765
|
-
return new mr(e, t);
|
|
766
|
-
} catch (n) {
|
|
767
|
-
if (!r)
|
|
768
|
-
return null;
|
|
769
|
-
throw n;
|
|
770
|
-
}
|
|
771
|
-
};
|
|
772
|
-
var Y = as;
|
|
773
|
-
const cs = Y, fs = (e, t) => {
|
|
774
|
-
const r = cs(e, t);
|
|
775
|
-
return r ? r.version : null;
|
|
776
|
-
};
|
|
777
|
-
var us = fs;
|
|
778
|
-
const ls = Y, hs = (e, t) => {
|
|
779
|
-
const r = ls(e.trim().replace(/^[=v]+/, ""), t);
|
|
780
|
-
return r ? r.version : null;
|
|
781
|
-
};
|
|
782
|
-
var ps = hs;
|
|
783
|
-
const dr = N, ms = (e, t, r, n, s) => {
|
|
784
|
-
typeof r == "string" && (s = n, n = r, r = void 0);
|
|
785
|
-
try {
|
|
786
|
-
return new dr(
|
|
787
|
-
e instanceof dr ? e.version : e,
|
|
788
|
-
r
|
|
789
|
-
).inc(t, n, s).version;
|
|
790
|
-
} catch {
|
|
791
|
-
return null;
|
|
792
|
-
}
|
|
793
|
-
};
|
|
794
|
-
var ds = ms;
|
|
795
|
-
const Er = Y, Es = (e, t) => {
|
|
796
|
-
const r = Er(e, null, !0), n = Er(t, null, !0), s = r.compare(n);
|
|
797
|
-
if (s === 0)
|
|
798
|
-
return null;
|
|
799
|
-
const i = s > 0, c = i ? r : n, l = i ? n : r, a = !!c.prerelease.length;
|
|
800
|
-
if (!!l.prerelease.length && !a)
|
|
801
|
-
return !l.patch && !l.minor ? "major" : c.patch ? "patch" : c.minor ? "minor" : "major";
|
|
802
|
-
const f = a ? "pre" : "";
|
|
803
|
-
return r.major !== n.major ? f + "major" : r.minor !== n.minor ? f + "minor" : r.patch !== n.patch ? f + "patch" : "prerelease";
|
|
804
|
-
};
|
|
805
|
-
var $s = Es;
|
|
806
|
-
const ys = N, gs = (e, t) => new ys(e, t).major;
|
|
807
|
-
var Ss = gs;
|
|
808
|
-
const vs = N, ws = (e, t) => new vs(e, t).minor;
|
|
809
|
-
var bs = ws;
|
|
810
|
-
const Is = N, Rs = (e, t) => new Is(e, t).patch;
|
|
811
|
-
var Ts = Rs;
|
|
812
|
-
const As = Y, Os = (e, t) => {
|
|
813
|
-
const r = As(e, t);
|
|
814
|
-
return r && r.prerelease.length ? r.prerelease : null;
|
|
815
|
-
};
|
|
816
|
-
var Ns = Os;
|
|
817
|
-
const $r = N, Ls = (e, t, r) => new $r(e, r).compare(new $r(t, r));
|
|
818
|
-
var D = Ls;
|
|
819
|
-
const js = D, Ps = (e, t, r) => js(t, e, r);
|
|
820
|
-
var _s = Ps;
|
|
821
|
-
const xs = D, Ds = (e, t) => xs(e, t, !0);
|
|
822
|
-
var Cs = Ds;
|
|
823
|
-
const yr = N, Bs = (e, t, r) => {
|
|
824
|
-
const n = new yr(e, r), s = new yr(t, r);
|
|
825
|
-
return n.compare(s) || n.compareBuild(s);
|
|
826
|
-
};
|
|
827
|
-
var qe = Bs;
|
|
828
|
-
const Gs = qe, Fs = (e, t) => e.sort((r, n) => Gs(r, n, t));
|
|
829
|
-
var Vs = Fs;
|
|
830
|
-
const ks = qe, Us = (e, t) => e.sort((r, n) => ks(n, r, t));
|
|
831
|
-
var Hs = Us;
|
|
832
|
-
const Ms = D, Xs = (e, t, r) => Ms(e, t, r) > 0;
|
|
833
|
-
var Ie = Xs;
|
|
834
|
-
const Ks = D, qs = (e, t, r) => Ks(e, t, r) < 0;
|
|
835
|
-
var We = qs;
|
|
836
|
-
const Ws = D, Js = (e, t, r) => Ws(e, t, r) === 0;
|
|
837
|
-
var bt = Js;
|
|
838
|
-
const Ys = D, zs = (e, t, r) => Ys(e, t, r) !== 0;
|
|
839
|
-
var It = zs;
|
|
840
|
-
const Zs = D, Qs = (e, t, r) => Zs(e, t, r) >= 0;
|
|
841
|
-
var Je = Qs;
|
|
842
|
-
const ei = D, ri = (e, t, r) => ei(e, t, r) <= 0;
|
|
843
|
-
var Ye = ri;
|
|
844
|
-
const ti = bt, ni = It, si = Ie, ii = Je, oi = We, ai = Ye, ci = (e, t, r, n) => {
|
|
845
|
-
switch (t) {
|
|
846
|
-
case "===":
|
|
847
|
-
return typeof e == "object" && (e = e.version), typeof r == "object" && (r = r.version), e === r;
|
|
848
|
-
case "!==":
|
|
849
|
-
return typeof e == "object" && (e = e.version), typeof r == "object" && (r = r.version), e !== r;
|
|
850
|
-
case "":
|
|
851
|
-
case "=":
|
|
852
|
-
case "==":
|
|
853
|
-
return ti(e, r, n);
|
|
854
|
-
case "!=":
|
|
855
|
-
return ni(e, r, n);
|
|
856
|
-
case ">":
|
|
857
|
-
return si(e, r, n);
|
|
858
|
-
case ">=":
|
|
859
|
-
return ii(e, r, n);
|
|
860
|
-
case "<":
|
|
861
|
-
return oi(e, r, n);
|
|
862
|
-
case "<=":
|
|
863
|
-
return ai(e, r, n);
|
|
864
|
-
default:
|
|
865
|
-
throw new TypeError(`Invalid operator: ${t}`);
|
|
866
|
-
}
|
|
867
|
-
};
|
|
868
|
-
var Rt = ci;
|
|
869
|
-
const fi = N, ui = Y, { safeRe: ae, t: ce } = ne, li = (e, t) => {
|
|
870
|
-
if (e instanceof fi)
|
|
871
|
-
return e;
|
|
872
|
-
if (typeof e == "number" && (e = String(e)), typeof e != "string")
|
|
873
|
-
return null;
|
|
874
|
-
t = t || {};
|
|
875
|
-
let r = null;
|
|
876
|
-
if (!t.rtl)
|
|
877
|
-
r = e.match(t.includePrerelease ? ae[ce.COERCEFULL] : ae[ce.COERCE]);
|
|
878
|
-
else {
|
|
879
|
-
const a = t.includePrerelease ? ae[ce.COERCERTLFULL] : ae[ce.COERCERTL];
|
|
880
|
-
let o;
|
|
881
|
-
for (; (o = a.exec(e)) && (!r || r.index + r[0].length !== e.length); )
|
|
882
|
-
(!r || o.index + o[0].length !== r.index + r[0].length) && (r = o), a.lastIndex = o.index + o[1].length + o[2].length;
|
|
883
|
-
a.lastIndex = -1;
|
|
884
|
-
}
|
|
885
|
-
if (r === null)
|
|
886
|
-
return null;
|
|
887
|
-
const n = r[2], s = r[3] || "0", i = r[4] || "0", c = t.includePrerelease && r[5] ? `-${r[5]}` : "", l = t.includePrerelease && r[6] ? `+${r[6]}` : "";
|
|
888
|
-
return ui(`${n}.${s}.${i}${c}${l}`, t);
|
|
889
|
-
};
|
|
890
|
-
var hi = li;
|
|
891
|
-
class pi {
|
|
892
|
-
constructor() {
|
|
893
|
-
this.max = 1e3, this.map = /* @__PURE__ */ new Map();
|
|
894
|
-
}
|
|
895
|
-
get(t) {
|
|
896
|
-
const r = this.map.get(t);
|
|
897
|
-
if (r !== void 0)
|
|
898
|
-
return this.map.delete(t), this.map.set(t, r), r;
|
|
899
|
-
}
|
|
900
|
-
delete(t) {
|
|
901
|
-
return this.map.delete(t);
|
|
902
|
-
}
|
|
903
|
-
set(t, r) {
|
|
904
|
-
if (!this.delete(t) && r !== void 0) {
|
|
905
|
-
if (this.map.size >= this.max) {
|
|
906
|
-
const s = this.map.keys().next().value;
|
|
907
|
-
this.delete(s);
|
|
908
|
-
}
|
|
909
|
-
this.map.set(t, r);
|
|
910
|
-
}
|
|
911
|
-
return this;
|
|
912
|
-
}
|
|
913
|
-
}
|
|
914
|
-
var mi = pi, je, gr;
|
|
915
|
-
function C() {
|
|
916
|
-
if (gr)
|
|
917
|
-
return je;
|
|
918
|
-
gr = 1;
|
|
919
|
-
class e {
|
|
920
|
-
constructor(p, g) {
|
|
921
|
-
if (g = n(g), p instanceof e)
|
|
922
|
-
return p.loose === !!g.loose && p.includePrerelease === !!g.includePrerelease ? p : new e(p.raw, g);
|
|
923
|
-
if (p instanceof s)
|
|
924
|
-
return this.raw = p.value, this.set = [[p]], this.format(), this;
|
|
925
|
-
if (this.options = g, this.loose = !!g.loose, this.includePrerelease = !!g.includePrerelease, this.raw = p.trim().split(/\s+/).join(" "), this.set = this.raw.split("||").map(($) => this.parseRange($.trim())).filter(($) => $.length), !this.set.length)
|
|
926
|
-
throw new TypeError(`Invalid SemVer Range: ${this.raw}`);
|
|
927
|
-
if (this.set.length > 1) {
|
|
928
|
-
const $ = this.set[0];
|
|
929
|
-
if (this.set = this.set.filter((y) => !h(y[0])), this.set.length === 0)
|
|
930
|
-
this.set = [$];
|
|
931
|
-
else if (this.set.length > 1) {
|
|
932
|
-
for (const y of this.set)
|
|
933
|
-
if (y.length === 1 && R(y[0])) {
|
|
934
|
-
this.set = [y];
|
|
935
|
-
break;
|
|
936
|
-
}
|
|
937
|
-
}
|
|
938
|
-
}
|
|
939
|
-
this.format();
|
|
940
|
-
}
|
|
941
|
-
format() {
|
|
942
|
-
return this.range = this.set.map((p) => p.join(" ").trim()).join("||").trim(), this.range;
|
|
943
|
-
}
|
|
944
|
-
toString() {
|
|
945
|
-
return this.range;
|
|
946
|
-
}
|
|
947
|
-
parseRange(p) {
|
|
948
|
-
const $ = ((this.options.includePrerelease && w) | (this.options.loose && m)) + ":" + p, y = r.get($);
|
|
949
|
-
if (y)
|
|
950
|
-
return y;
|
|
951
|
-
const E = this.options.loose, S = E ? l[a.HYPHENRANGELOOSE] : l[a.HYPHENRANGE];
|
|
952
|
-
p = p.replace(S, Ht(this.options.includePrerelease)), i("hyphen replace", p), p = p.replace(l[a.COMPARATORTRIM], o), i("comparator trim", p), p = p.replace(l[a.TILDETRIM], f), i("tilde trim", p), p = p.replace(l[a.CARETTRIM], u), i("caret trim", p);
|
|
953
|
-
let b = p.split(" ").map((O) => V(O, this.options)).join(" ").split(/\s+/).map((O) => Ut(O, this.options));
|
|
954
|
-
E && (b = b.filter((O) => (i("loose invalid filter", O, this.options), !!O.match(l[a.COMPARATORLOOSE])))), i("range list", b);
|
|
955
|
-
const v = /* @__PURE__ */ new Map(), T = b.map((O) => new s(O, this.options));
|
|
956
|
-
for (const O of T) {
|
|
957
|
-
if (h(O))
|
|
958
|
-
return [O];
|
|
959
|
-
v.set(O.value, O);
|
|
960
|
-
}
|
|
961
|
-
v.size > 1 && v.has("") && v.delete("");
|
|
962
|
-
const P = [...v.values()];
|
|
963
|
-
return r.set($, P), P;
|
|
964
|
-
}
|
|
965
|
-
intersects(p, g) {
|
|
966
|
-
if (!(p instanceof e))
|
|
967
|
-
throw new TypeError("a Range is required");
|
|
968
|
-
return this.set.some(($) => L($, g) && p.set.some((y) => L(y, g) && $.every((E) => y.every((S) => E.intersects(S, g)))));
|
|
969
|
-
}
|
|
970
|
-
// if ANY of the sets match ALL of its comparators, then pass
|
|
971
|
-
test(p) {
|
|
972
|
-
if (!p)
|
|
973
|
-
return !1;
|
|
974
|
-
if (typeof p == "string")
|
|
975
|
-
try {
|
|
976
|
-
p = new c(p, this.options);
|
|
977
|
-
} catch {
|
|
978
|
-
return !1;
|
|
979
|
-
}
|
|
980
|
-
for (let g = 0; g < this.set.length; g++)
|
|
981
|
-
if (Mt(this.set[g], p, this.options))
|
|
982
|
-
return !0;
|
|
983
|
-
return !1;
|
|
984
|
-
}
|
|
985
|
-
}
|
|
986
|
-
je = e;
|
|
987
|
-
const t = mi, r = new t(), n = Ke, s = Re(), i = be, c = N, {
|
|
988
|
-
safeRe: l,
|
|
989
|
-
t: a,
|
|
990
|
-
comparatorTrimReplace: o,
|
|
991
|
-
tildeTrimReplace: f,
|
|
992
|
-
caretTrimReplace: u
|
|
993
|
-
} = ne, { FLAG_INCLUDE_PRERELEASE: w, FLAG_LOOSE: m } = we, h = (d) => d.value === "<0.0.0-0", R = (d) => d.value === "", L = (d, p) => {
|
|
994
|
-
let g = !0;
|
|
995
|
-
const $ = d.slice();
|
|
996
|
-
let y = $.pop();
|
|
997
|
-
for (; g && $.length; )
|
|
998
|
-
g = $.every((E) => y.intersects(E, p)), y = $.pop();
|
|
999
|
-
return g;
|
|
1000
|
-
}, V = (d, p) => (i("comp", d, p), d = Bt(d, p), i("caret", d), d = _(d, p), i("tildes", d), d = Ft(d, p), i("xrange", d), d = kt(d, p), i("stars", d), d), A = (d) => !d || d.toLowerCase() === "x" || d === "*", _ = (d, p) => d.trim().split(/\s+/).map((g) => Ct(g, p)).join(" "), Ct = (d, p) => {
|
|
1001
|
-
const g = p.loose ? l[a.TILDELOOSE] : l[a.TILDE];
|
|
1002
|
-
return d.replace(g, ($, y, E, S, b) => {
|
|
1003
|
-
i("tilde", d, $, y, E, S, b);
|
|
1004
|
-
let v;
|
|
1005
|
-
return A(y) ? v = "" : A(E) ? v = `>=${y}.0.0 <${+y + 1}.0.0-0` : A(S) ? v = `>=${y}.${E}.0 <${y}.${+E + 1}.0-0` : b ? (i("replaceTilde pr", b), v = `>=${y}.${E}.${S}-${b} <${y}.${+E + 1}.0-0`) : v = `>=${y}.${E}.${S} <${y}.${+E + 1}.0-0`, i("tilde return", v), v;
|
|
1006
|
-
});
|
|
1007
|
-
}, Bt = (d, p) => d.trim().split(/\s+/).map((g) => Gt(g, p)).join(" "), Gt = (d, p) => {
|
|
1008
|
-
i("caret", d, p);
|
|
1009
|
-
const g = p.loose ? l[a.CARETLOOSE] : l[a.CARET], $ = p.includePrerelease ? "-0" : "";
|
|
1010
|
-
return d.replace(g, (y, E, S, b, v) => {
|
|
1011
|
-
i("caret", d, y, E, S, b, v);
|
|
1012
|
-
let T;
|
|
1013
|
-
return A(E) ? T = "" : A(S) ? T = `>=${E}.0.0${$} <${+E + 1}.0.0-0` : A(b) ? E === "0" ? T = `>=${E}.${S}.0${$} <${E}.${+S + 1}.0-0` : T = `>=${E}.${S}.0${$} <${+E + 1}.0.0-0` : v ? (i("replaceCaret pr", v), E === "0" ? S === "0" ? T = `>=${E}.${S}.${b}-${v} <${E}.${S}.${+b + 1}-0` : T = `>=${E}.${S}.${b}-${v} <${E}.${+S + 1}.0-0` : T = `>=${E}.${S}.${b}-${v} <${+E + 1}.0.0-0`) : (i("no pr"), E === "0" ? S === "0" ? T = `>=${E}.${S}.${b}${$} <${E}.${S}.${+b + 1}-0` : T = `>=${E}.${S}.${b}${$} <${E}.${+S + 1}.0-0` : T = `>=${E}.${S}.${b} <${+E + 1}.0.0-0`), i("caret return", T), T;
|
|
1014
|
-
});
|
|
1015
|
-
}, Ft = (d, p) => (i("replaceXRanges", d, p), d.split(/\s+/).map((g) => Vt(g, p)).join(" ")), Vt = (d, p) => {
|
|
1016
|
-
d = d.trim();
|
|
1017
|
-
const g = p.loose ? l[a.XRANGELOOSE] : l[a.XRANGE];
|
|
1018
|
-
return d.replace(g, ($, y, E, S, b, v) => {
|
|
1019
|
-
i("xRange", d, $, y, E, S, b, v);
|
|
1020
|
-
const T = A(E), P = T || A(S), O = P || A(b), z = O;
|
|
1021
|
-
return y === "=" && z && (y = ""), v = p.includePrerelease ? "-0" : "", T ? y === ">" || y === "<" ? $ = "<0.0.0-0" : $ = "*" : y && z ? (P && (S = 0), b = 0, y === ">" ? (y = ">=", P ? (E = +E + 1, S = 0, b = 0) : (S = +S + 1, b = 0)) : y === "<=" && (y = "<", P ? E = +E + 1 : S = +S + 1), y === "<" && (v = "-0"), $ = `${y + E}.${S}.${b}${v}`) : P ? $ = `>=${E}.0.0${v} <${+E + 1}.0.0-0` : O && ($ = `>=${E}.${S}.0${v} <${E}.${+S + 1}.0-0`), i("xRange return", $), $;
|
|
1022
|
-
});
|
|
1023
|
-
}, kt = (d, p) => (i("replaceStars", d, p), d.trim().replace(l[a.STAR], "")), Ut = (d, p) => (i("replaceGTE0", d, p), d.trim().replace(l[p.includePrerelease ? a.GTE0PRE : a.GTE0], "")), Ht = (d) => (p, g, $, y, E, S, b, v, T, P, O, z) => (A($) ? g = "" : A(y) ? g = `>=${$}.0.0${d ? "-0" : ""}` : A(E) ? g = `>=${$}.${y}.0${d ? "-0" : ""}` : S ? g = `>=${g}` : g = `>=${g}${d ? "-0" : ""}`, A(T) ? v = "" : A(P) ? v = `<${+T + 1}.0.0-0` : A(O) ? v = `<${T}.${+P + 1}.0-0` : z ? v = `<=${T}.${P}.${O}-${z}` : d ? v = `<${T}.${P}.${+O + 1}-0` : v = `<=${v}`, `${g} ${v}`.trim()), Mt = (d, p, g) => {
|
|
1024
|
-
for (let $ = 0; $ < d.length; $++)
|
|
1025
|
-
if (!d[$].test(p))
|
|
1026
|
-
return !1;
|
|
1027
|
-
if (p.prerelease.length && !g.includePrerelease) {
|
|
1028
|
-
for (let $ = 0; $ < d.length; $++)
|
|
1029
|
-
if (i(d[$].semver), d[$].semver !== s.ANY && d[$].semver.prerelease.length > 0) {
|
|
1030
|
-
const y = d[$].semver;
|
|
1031
|
-
if (y.major === p.major && y.minor === p.minor && y.patch === p.patch)
|
|
1032
|
-
return !0;
|
|
1033
|
-
}
|
|
1034
|
-
return !1;
|
|
1035
|
-
}
|
|
1036
|
-
return !0;
|
|
1037
|
-
};
|
|
1038
|
-
return je;
|
|
1039
|
-
}
|
|
1040
|
-
var Pe, Sr;
|
|
1041
|
-
function Re() {
|
|
1042
|
-
if (Sr)
|
|
1043
|
-
return Pe;
|
|
1044
|
-
Sr = 1;
|
|
1045
|
-
const e = Symbol("SemVer ANY");
|
|
1046
|
-
class t {
|
|
1047
|
-
static get ANY() {
|
|
1048
|
-
return e;
|
|
1049
|
-
}
|
|
1050
|
-
constructor(f, u) {
|
|
1051
|
-
if (u = r(u), f instanceof t) {
|
|
1052
|
-
if (f.loose === !!u.loose)
|
|
1053
|
-
return f;
|
|
1054
|
-
f = f.value;
|
|
1055
|
-
}
|
|
1056
|
-
f = f.trim().split(/\s+/).join(" "), c("comparator", f, u), this.options = u, this.loose = !!u.loose, this.parse(f), this.semver === e ? this.value = "" : this.value = this.operator + this.semver.version, c("comp", this);
|
|
1057
|
-
}
|
|
1058
|
-
parse(f) {
|
|
1059
|
-
const u = this.options.loose ? n[s.COMPARATORLOOSE] : n[s.COMPARATOR], w = f.match(u);
|
|
1060
|
-
if (!w)
|
|
1061
|
-
throw new TypeError(`Invalid comparator: ${f}`);
|
|
1062
|
-
this.operator = w[1] !== void 0 ? w[1] : "", this.operator === "=" && (this.operator = ""), w[2] ? this.semver = new l(w[2], this.options.loose) : this.semver = e;
|
|
1063
|
-
}
|
|
1064
|
-
toString() {
|
|
1065
|
-
return this.value;
|
|
1066
|
-
}
|
|
1067
|
-
test(f) {
|
|
1068
|
-
if (c("Comparator.test", f, this.options.loose), this.semver === e || f === e)
|
|
1069
|
-
return !0;
|
|
1070
|
-
if (typeof f == "string")
|
|
1071
|
-
try {
|
|
1072
|
-
f = new l(f, this.options);
|
|
1073
|
-
} catch {
|
|
1074
|
-
return !1;
|
|
1075
|
-
}
|
|
1076
|
-
return i(f, this.operator, this.semver, this.options);
|
|
1077
|
-
}
|
|
1078
|
-
intersects(f, u) {
|
|
1079
|
-
if (!(f instanceof t))
|
|
1080
|
-
throw new TypeError("a Comparator is required");
|
|
1081
|
-
return this.operator === "" ? this.value === "" ? !0 : new a(f.value, u).test(this.value) : f.operator === "" ? f.value === "" ? !0 : new a(this.value, u).test(f.semver) : (u = r(u), u.includePrerelease && (this.value === "<0.0.0-0" || f.value === "<0.0.0-0") || !u.includePrerelease && (this.value.startsWith("<0.0.0") || f.value.startsWith("<0.0.0")) ? !1 : !!(this.operator.startsWith(">") && f.operator.startsWith(">") || this.operator.startsWith("<") && f.operator.startsWith("<") || this.semver.version === f.semver.version && this.operator.includes("=") && f.operator.includes("=") || i(this.semver, "<", f.semver, u) && this.operator.startsWith(">") && f.operator.startsWith("<") || i(this.semver, ">", f.semver, u) && this.operator.startsWith("<") && f.operator.startsWith(">")));
|
|
1082
|
-
}
|
|
1083
|
-
}
|
|
1084
|
-
Pe = t;
|
|
1085
|
-
const r = Ke, { safeRe: n, t: s } = ne, i = Rt, c = be, l = N, a = C();
|
|
1086
|
-
return Pe;
|
|
1087
|
-
}
|
|
1088
|
-
const di = C(), Ei = (e, t, r) => {
|
|
1089
|
-
try {
|
|
1090
|
-
t = new di(t, r);
|
|
1091
|
-
} catch {
|
|
1092
|
-
return !1;
|
|
1093
|
-
}
|
|
1094
|
-
return t.test(e);
|
|
1095
|
-
};
|
|
1096
|
-
var Te = Ei;
|
|
1097
|
-
const $i = C(), yi = (e, t) => new $i(e, t).set.map((r) => r.map((n) => n.value).join(" ").trim().split(" "));
|
|
1098
|
-
var gi = yi;
|
|
1099
|
-
const Si = N, vi = C(), wi = (e, t, r) => {
|
|
1100
|
-
let n = null, s = null, i = null;
|
|
1101
|
-
try {
|
|
1102
|
-
i = new vi(t, r);
|
|
1103
|
-
} catch {
|
|
1104
|
-
return null;
|
|
1105
|
-
}
|
|
1106
|
-
return e.forEach((c) => {
|
|
1107
|
-
i.test(c) && (!n || s.compare(c) === -1) && (n = c, s = new Si(n, r));
|
|
1108
|
-
}), n;
|
|
1109
|
-
};
|
|
1110
|
-
var bi = wi;
|
|
1111
|
-
const Ii = N, Ri = C(), Ti = (e, t, r) => {
|
|
1112
|
-
let n = null, s = null, i = null;
|
|
1113
|
-
try {
|
|
1114
|
-
i = new Ri(t, r);
|
|
1115
|
-
} catch {
|
|
1116
|
-
return null;
|
|
1117
|
-
}
|
|
1118
|
-
return e.forEach((c) => {
|
|
1119
|
-
i.test(c) && (!n || s.compare(c) === 1) && (n = c, s = new Ii(n, r));
|
|
1120
|
-
}), n;
|
|
1121
|
-
};
|
|
1122
|
-
var Ai = Ti;
|
|
1123
|
-
const _e = N, Oi = C(), vr = Ie, Ni = (e, t) => {
|
|
1124
|
-
e = new Oi(e, t);
|
|
1125
|
-
let r = new _e("0.0.0");
|
|
1126
|
-
if (e.test(r) || (r = new _e("0.0.0-0"), e.test(r)))
|
|
1127
|
-
return r;
|
|
1128
|
-
r = null;
|
|
1129
|
-
for (let n = 0; n < e.set.length; ++n) {
|
|
1130
|
-
const s = e.set[n];
|
|
1131
|
-
let i = null;
|
|
1132
|
-
s.forEach((c) => {
|
|
1133
|
-
const l = new _e(c.semver.version);
|
|
1134
|
-
switch (c.operator) {
|
|
1135
|
-
case ">":
|
|
1136
|
-
l.prerelease.length === 0 ? l.patch++ : l.prerelease.push(0), l.raw = l.format();
|
|
1137
|
-
case "":
|
|
1138
|
-
case ">=":
|
|
1139
|
-
(!i || vr(l, i)) && (i = l);
|
|
1140
|
-
break;
|
|
1141
|
-
case "<":
|
|
1142
|
-
case "<=":
|
|
1143
|
-
break;
|
|
1144
|
-
default:
|
|
1145
|
-
throw new Error(`Unexpected operation: ${c.operator}`);
|
|
1146
|
-
}
|
|
1147
|
-
}), i && (!r || vr(r, i)) && (r = i);
|
|
1148
|
-
}
|
|
1149
|
-
return r && e.test(r) ? r : null;
|
|
1150
|
-
};
|
|
1151
|
-
var Li = Ni;
|
|
1152
|
-
const ji = C(), Pi = (e, t) => {
|
|
1153
|
-
try {
|
|
1154
|
-
return new ji(e, t).range || "*";
|
|
1155
|
-
} catch {
|
|
1156
|
-
return null;
|
|
1157
|
-
}
|
|
1158
|
-
};
|
|
1159
|
-
var _i = Pi;
|
|
1160
|
-
const xi = N, Tt = Re(), { ANY: Di } = Tt, Ci = C(), Bi = Te, wr = Ie, br = We, Gi = Ye, Fi = Je, Vi = (e, t, r, n) => {
|
|
1161
|
-
e = new xi(e, n), t = new Ci(t, n);
|
|
1162
|
-
let s, i, c, l, a;
|
|
1163
|
-
switch (r) {
|
|
1164
|
-
case ">":
|
|
1165
|
-
s = wr, i = Gi, c = br, l = ">", a = ">=";
|
|
1166
|
-
break;
|
|
1167
|
-
case "<":
|
|
1168
|
-
s = br, i = Fi, c = wr, l = "<", a = "<=";
|
|
1169
|
-
break;
|
|
1170
|
-
default:
|
|
1171
|
-
throw new TypeError('Must provide a hilo val of "<" or ">"');
|
|
1172
|
-
}
|
|
1173
|
-
if (Bi(e, t, n))
|
|
1174
|
-
return !1;
|
|
1175
|
-
for (let o = 0; o < t.set.length; ++o) {
|
|
1176
|
-
const f = t.set[o];
|
|
1177
|
-
let u = null, w = null;
|
|
1178
|
-
if (f.forEach((m) => {
|
|
1179
|
-
m.semver === Di && (m = new Tt(">=0.0.0")), u = u || m, w = w || m, s(m.semver, u.semver, n) ? u = m : c(m.semver, w.semver, n) && (w = m);
|
|
1180
|
-
}), u.operator === l || u.operator === a || (!w.operator || w.operator === l) && i(e, w.semver))
|
|
1181
|
-
return !1;
|
|
1182
|
-
if (w.operator === a && c(e, w.semver))
|
|
1183
|
-
return !1;
|
|
1184
|
-
}
|
|
1185
|
-
return !0;
|
|
1186
|
-
};
|
|
1187
|
-
var ze = Vi;
|
|
1188
|
-
const ki = ze, Ui = (e, t, r) => ki(e, t, ">", r);
|
|
1189
|
-
var Hi = Ui;
|
|
1190
|
-
const Mi = ze, Xi = (e, t, r) => Mi(e, t, "<", r);
|
|
1191
|
-
var Ki = Xi;
|
|
1192
|
-
const Ir = C(), qi = (e, t, r) => (e = new Ir(e, r), t = new Ir(t, r), e.intersects(t, r));
|
|
1193
|
-
var Wi = qi;
|
|
1194
|
-
const Ji = Te, Yi = D;
|
|
1195
|
-
var zi = (e, t, r) => {
|
|
1196
|
-
const n = [];
|
|
1197
|
-
let s = null, i = null;
|
|
1198
|
-
const c = e.sort((f, u) => Yi(f, u, r));
|
|
1199
|
-
for (const f of c)
|
|
1200
|
-
Ji(f, t, r) ? (i = f, s || (s = f)) : (i && n.push([s, i]), i = null, s = null);
|
|
1201
|
-
s && n.push([s, null]);
|
|
1202
|
-
const l = [];
|
|
1203
|
-
for (const [f, u] of n)
|
|
1204
|
-
f === u ? l.push(f) : !u && f === c[0] ? l.push("*") : u ? f === c[0] ? l.push(`<=${u}`) : l.push(`${f} - ${u}`) : l.push(`>=${f}`);
|
|
1205
|
-
const a = l.join(" || "), o = typeof t.raw == "string" ? t.raw : String(t);
|
|
1206
|
-
return a.length < o.length ? a : t;
|
|
1207
|
-
};
|
|
1208
|
-
const Rr = C(), Ze = Re(), { ANY: xe } = Ze, Z = Te, Qe = D, Zi = (e, t, r = {}) => {
|
|
1209
|
-
if (e === t)
|
|
1210
|
-
return !0;
|
|
1211
|
-
e = new Rr(e, r), t = new Rr(t, r);
|
|
1212
|
-
let n = !1;
|
|
1213
|
-
e:
|
|
1214
|
-
for (const s of e.set) {
|
|
1215
|
-
for (const i of t.set) {
|
|
1216
|
-
const c = eo(s, i, r);
|
|
1217
|
-
if (n = n || c !== null, c)
|
|
1218
|
-
continue e;
|
|
1219
|
-
}
|
|
1220
|
-
if (n)
|
|
1221
|
-
return !1;
|
|
1222
|
-
}
|
|
1223
|
-
return !0;
|
|
1224
|
-
}, Qi = [new Ze(">=0.0.0-0")], Tr = [new Ze(">=0.0.0")], eo = (e, t, r) => {
|
|
1225
|
-
if (e === t)
|
|
1226
|
-
return !0;
|
|
1227
|
-
if (e.length === 1 && e[0].semver === xe) {
|
|
1228
|
-
if (t.length === 1 && t[0].semver === xe)
|
|
1229
|
-
return !0;
|
|
1230
|
-
r.includePrerelease ? e = Qi : e = Tr;
|
|
1231
|
-
}
|
|
1232
|
-
if (t.length === 1 && t[0].semver === xe) {
|
|
1233
|
-
if (r.includePrerelease)
|
|
1234
|
-
return !0;
|
|
1235
|
-
t = Tr;
|
|
1236
|
-
}
|
|
1237
|
-
const n = /* @__PURE__ */ new Set();
|
|
1238
|
-
let s, i;
|
|
1239
|
-
for (const m of e)
|
|
1240
|
-
m.operator === ">" || m.operator === ">=" ? s = Ar(s, m, r) : m.operator === "<" || m.operator === "<=" ? i = Or(i, m, r) : n.add(m.semver);
|
|
1241
|
-
if (n.size > 1)
|
|
1242
|
-
return null;
|
|
1243
|
-
let c;
|
|
1244
|
-
if (s && i) {
|
|
1245
|
-
if (c = Qe(s.semver, i.semver, r), c > 0)
|
|
1246
|
-
return null;
|
|
1247
|
-
if (c === 0 && (s.operator !== ">=" || i.operator !== "<="))
|
|
1248
|
-
return null;
|
|
1249
|
-
}
|
|
1250
|
-
for (const m of n) {
|
|
1251
|
-
if (s && !Z(m, String(s), r) || i && !Z(m, String(i), r))
|
|
1252
|
-
return null;
|
|
1253
|
-
for (const h of t)
|
|
1254
|
-
if (!Z(m, String(h), r))
|
|
1255
|
-
return !1;
|
|
1256
|
-
return !0;
|
|
1257
|
-
}
|
|
1258
|
-
let l, a, o, f, u = i && !r.includePrerelease && i.semver.prerelease.length ? i.semver : !1, w = s && !r.includePrerelease && s.semver.prerelease.length ? s.semver : !1;
|
|
1259
|
-
u && u.prerelease.length === 1 && i.operator === "<" && u.prerelease[0] === 0 && (u = !1);
|
|
1260
|
-
for (const m of t) {
|
|
1261
|
-
if (f = f || m.operator === ">" || m.operator === ">=", o = o || m.operator === "<" || m.operator === "<=", s) {
|
|
1262
|
-
if (w && m.semver.prerelease && m.semver.prerelease.length && m.semver.major === w.major && m.semver.minor === w.minor && m.semver.patch === w.patch && (w = !1), m.operator === ">" || m.operator === ">=") {
|
|
1263
|
-
if (l = Ar(s, m, r), l === m && l !== s)
|
|
1264
|
-
return !1;
|
|
1265
|
-
} else if (s.operator === ">=" && !Z(s.semver, String(m), r))
|
|
1266
|
-
return !1;
|
|
1267
|
-
}
|
|
1268
|
-
if (i) {
|
|
1269
|
-
if (u && m.semver.prerelease && m.semver.prerelease.length && m.semver.major === u.major && m.semver.minor === u.minor && m.semver.patch === u.patch && (u = !1), m.operator === "<" || m.operator === "<=") {
|
|
1270
|
-
if (a = Or(i, m, r), a === m && a !== i)
|
|
1271
|
-
return !1;
|
|
1272
|
-
} else if (i.operator === "<=" && !Z(i.semver, String(m), r))
|
|
1273
|
-
return !1;
|
|
1274
|
-
}
|
|
1275
|
-
if (!m.operator && (i || s) && c !== 0)
|
|
1276
|
-
return !1;
|
|
1277
|
-
}
|
|
1278
|
-
return !(s && o && !i && c !== 0 || i && f && !s && c !== 0 || w || u);
|
|
1279
|
-
}, Ar = (e, t, r) => {
|
|
1280
|
-
if (!e)
|
|
1281
|
-
return t;
|
|
1282
|
-
const n = Qe(e.semver, t.semver, r);
|
|
1283
|
-
return n > 0 ? e : n < 0 || t.operator === ">" && e.operator === ">=" ? t : e;
|
|
1284
|
-
}, Or = (e, t, r) => {
|
|
1285
|
-
if (!e)
|
|
1286
|
-
return t;
|
|
1287
|
-
const n = Qe(e.semver, t.semver, r);
|
|
1288
|
-
return n < 0 ? e : n > 0 || t.operator === "<" && e.operator === "<=" ? t : e;
|
|
1289
|
-
};
|
|
1290
|
-
var ro = Zi;
|
|
1291
|
-
const De = ne, Nr = we, to = N, Lr = wt, no = Y, so = us, io = ps, oo = ds, ao = $s, co = Ss, fo = bs, uo = Ts, lo = Ns, ho = D, po = _s, mo = Cs, Eo = qe, $o = Vs, yo = Hs, go = Ie, So = We, vo = bt, wo = It, bo = Je, Io = Ye, Ro = Rt, To = hi, Ao = Re(), Oo = C(), No = Te, Lo = gi, jo = bi, Po = Ai, _o = Li, xo = _i, Do = ze, Co = Hi, Bo = Ki, Go = Wi, Fo = zi, Vo = ro;
|
|
1292
|
-
var er = {
|
|
1293
|
-
parse: no,
|
|
1294
|
-
valid: so,
|
|
1295
|
-
clean: io,
|
|
1296
|
-
inc: oo,
|
|
1297
|
-
diff: ao,
|
|
1298
|
-
major: co,
|
|
1299
|
-
minor: fo,
|
|
1300
|
-
patch: uo,
|
|
1301
|
-
prerelease: lo,
|
|
1302
|
-
compare: ho,
|
|
1303
|
-
rcompare: po,
|
|
1304
|
-
compareLoose: mo,
|
|
1305
|
-
compareBuild: Eo,
|
|
1306
|
-
sort: $o,
|
|
1307
|
-
rsort: yo,
|
|
1308
|
-
gt: go,
|
|
1309
|
-
lt: So,
|
|
1310
|
-
eq: vo,
|
|
1311
|
-
neq: wo,
|
|
1312
|
-
gte: bo,
|
|
1313
|
-
lte: Io,
|
|
1314
|
-
cmp: Ro,
|
|
1315
|
-
coerce: To,
|
|
1316
|
-
Comparator: Ao,
|
|
1317
|
-
Range: Oo,
|
|
1318
|
-
satisfies: No,
|
|
1319
|
-
toComparators: Lo,
|
|
1320
|
-
maxSatisfying: jo,
|
|
1321
|
-
minSatisfying: Po,
|
|
1322
|
-
minVersion: _o,
|
|
1323
|
-
validRange: xo,
|
|
1324
|
-
outside: Do,
|
|
1325
|
-
gtr: Co,
|
|
1326
|
-
ltr: Bo,
|
|
1327
|
-
intersects: Go,
|
|
1328
|
-
simplifyRange: Fo,
|
|
1329
|
-
subset: Vo,
|
|
1330
|
-
SemVer: to,
|
|
1331
|
-
re: De.re,
|
|
1332
|
-
src: De.src,
|
|
1333
|
-
tokens: De.t,
|
|
1334
|
-
SEMVER_SPEC_VERSION: Nr.SEMVER_SPEC_VERSION,
|
|
1335
|
-
RELEASE_TYPES: Nr.RELEASE_TYPES,
|
|
1336
|
-
compareIdentifiers: Lr.compareIdentifiers,
|
|
1337
|
-
rcompareIdentifiers: Lr.rcompareIdentifiers
|
|
1338
|
-
};
|
|
1339
|
-
const ko = er;
|
|
1340
|
-
var Uo = ko.satisfies(process.version, ">=15.7.0");
|
|
1341
|
-
const Ho = er;
|
|
1342
|
-
var Mo = Ho.satisfies(process.version, ">=16.9.0");
|
|
1343
|
-
const Xo = Uo, Ko = Mo, qo = {
|
|
1344
|
-
ec: ["ES256", "ES384", "ES512"],
|
|
1345
|
-
rsa: ["RS256", "PS256", "RS384", "PS384", "RS512", "PS512"],
|
|
1346
|
-
"rsa-pss": ["PS256", "PS384", "PS512"]
|
|
1347
|
-
}, Wo = {
|
|
1348
|
-
ES256: "prime256v1",
|
|
1349
|
-
ES384: "secp384r1",
|
|
1350
|
-
ES512: "secp521r1"
|
|
1351
|
-
};
|
|
1352
|
-
var At = function(e, t) {
|
|
1353
|
-
if (!e || !t)
|
|
1354
|
-
return;
|
|
1355
|
-
const r = t.asymmetricKeyType;
|
|
1356
|
-
if (!r)
|
|
1357
|
-
return;
|
|
1358
|
-
const n = qo[r];
|
|
1359
|
-
if (!n)
|
|
1360
|
-
throw new Error(`Unknown key type "${r}".`);
|
|
1361
|
-
if (!n.includes(e))
|
|
1362
|
-
throw new Error(`"alg" parameter for "${r}" key type must be one of: ${n.join(", ")}.`);
|
|
1363
|
-
if (Xo)
|
|
1364
|
-
switch (r) {
|
|
1365
|
-
case "ec":
|
|
1366
|
-
const s = t.asymmetricKeyDetails.namedCurve, i = Wo[e];
|
|
1367
|
-
if (s !== i)
|
|
1368
|
-
throw new Error(`"alg" parameter "${e}" requires curve "${i}".`);
|
|
1369
|
-
break;
|
|
1370
|
-
case "rsa-pss":
|
|
1371
|
-
if (Ko) {
|
|
1372
|
-
const c = parseInt(e.slice(-3), 10), { hashAlgorithm: l, mgf1HashAlgorithm: a, saltLength: o } = t.asymmetricKeyDetails;
|
|
1373
|
-
if (l !== `sha${c}` || a !== l)
|
|
1374
|
-
throw new Error(`Invalid key for this operation, its RSA-PSS parameters do not meet the requirements of "alg" ${e}.`);
|
|
1375
|
-
if (o !== void 0 && o > c >> 3)
|
|
1376
|
-
throw new Error(`Invalid key for this operation, its RSA-PSS parameter saltLength does not meet the requirements of "alg" ${e}.`);
|
|
1377
|
-
}
|
|
1378
|
-
break;
|
|
1379
|
-
}
|
|
1380
|
-
}, Jo = er, Ot = Jo.satisfies(process.version, "^6.12.0 || >=8.0.0");
|
|
1381
|
-
const I = ve, Yo = Et, jr = yt, zo = mt, Zo = gt, Qo = At, ea = Ot, ra = F, { KeyObject: ta, createSecretKey: na, createPublicKey: sa } = j, Fe = ["RS256", "RS384", "RS512"], ia = ["ES256", "ES384", "ES512"], Ve = ["RS256", "RS384", "RS512"], oa = ["HS256", "HS384", "HS512"];
|
|
1382
|
-
ea && (Fe.splice(Fe.length, 0, "PS256", "PS384", "PS512"), Ve.splice(Ve.length, 0, "PS256", "PS384", "PS512"));
|
|
1383
|
-
var aa = function(e, t, r, n) {
|
|
1384
|
-
typeof r == "function" && !n && (n = r, r = {}), r || (r = {}), r = Object.assign({}, r);
|
|
1385
|
-
let s;
|
|
1386
|
-
if (n ? s = n : s = function(f, u) {
|
|
1387
|
-
if (f)
|
|
1388
|
-
throw f;
|
|
1389
|
-
return u;
|
|
1390
|
-
}, r.clockTimestamp && typeof r.clockTimestamp != "number")
|
|
1391
|
-
return s(new I("clockTimestamp must be a number"));
|
|
1392
|
-
if (r.nonce !== void 0 && (typeof r.nonce != "string" || r.nonce.trim() === ""))
|
|
1393
|
-
return s(new I("nonce must be a non-empty string"));
|
|
1394
|
-
if (r.allowInvalidAsymmetricKeyTypes !== void 0 && typeof r.allowInvalidAsymmetricKeyTypes != "boolean")
|
|
1395
|
-
return s(new I("allowInvalidAsymmetricKeyTypes must be a boolean"));
|
|
1396
|
-
const i = r.clockTimestamp || Math.floor(Date.now() / 1e3);
|
|
1397
|
-
if (!e)
|
|
1398
|
-
return s(new I("jwt must be provided"));
|
|
1399
|
-
if (typeof e != "string")
|
|
1400
|
-
return s(new I("jwt must be a string"));
|
|
1401
|
-
const c = e.split(".");
|
|
1402
|
-
if (c.length !== 3)
|
|
1403
|
-
return s(new I("jwt malformed"));
|
|
1404
|
-
let l;
|
|
1405
|
-
try {
|
|
1406
|
-
l = zo(e, { complete: !0 });
|
|
1407
|
-
} catch (f) {
|
|
1408
|
-
return s(f);
|
|
1409
|
-
}
|
|
1410
|
-
if (!l)
|
|
1411
|
-
return s(new I("invalid token"));
|
|
1412
|
-
const a = l.header;
|
|
1413
|
-
let o;
|
|
1414
|
-
if (typeof t == "function") {
|
|
1415
|
-
if (!n)
|
|
1416
|
-
return s(new I("verify must be called asynchronous if secret or public key is provided as a callback"));
|
|
1417
|
-
o = t;
|
|
1418
|
-
} else
|
|
1419
|
-
o = function(f, u) {
|
|
1420
|
-
return u(null, t);
|
|
1421
|
-
};
|
|
1422
|
-
return o(a, function(f, u) {
|
|
1423
|
-
if (f)
|
|
1424
|
-
return s(new I("error in secret or public key callback: " + f.message));
|
|
1425
|
-
const w = c[2].trim() !== "";
|
|
1426
|
-
if (!w && u)
|
|
1427
|
-
return s(new I("jwt signature is required"));
|
|
1428
|
-
if (w && !u)
|
|
1429
|
-
return s(new I("secret or public key must be provided"));
|
|
1430
|
-
if (!w && !r.algorithms)
|
|
1431
|
-
return s(new I('please specify "none" in "algorithms" to verify unsigned tokens'));
|
|
1432
|
-
if (u != null && !(u instanceof ta))
|
|
1433
|
-
try {
|
|
1434
|
-
u = sa(u);
|
|
1435
|
-
} catch {
|
|
1436
|
-
try {
|
|
1437
|
-
u = na(typeof u == "string" ? Buffer.from(u) : u);
|
|
1438
|
-
} catch {
|
|
1439
|
-
return s(new I("secretOrPublicKey is not valid key material"));
|
|
1440
|
-
}
|
|
1441
|
-
}
|
|
1442
|
-
if (r.algorithms || (u.type === "secret" ? r.algorithms = oa : ["rsa", "rsa-pss"].includes(u.asymmetricKeyType) ? r.algorithms = Ve : u.asymmetricKeyType === "ec" ? r.algorithms = ia : r.algorithms = Fe), r.algorithms.indexOf(l.header.alg) === -1)
|
|
1443
|
-
return s(new I("invalid algorithm"));
|
|
1444
|
-
if (a.alg.startsWith("HS") && u.type !== "secret")
|
|
1445
|
-
return s(new I(`secretOrPublicKey must be a symmetric key when using ${a.alg}`));
|
|
1446
|
-
if (/^(?:RS|PS|ES)/.test(a.alg) && u.type !== "public")
|
|
1447
|
-
return s(new I(`secretOrPublicKey must be an asymmetric key when using ${a.alg}`));
|
|
1448
|
-
if (!r.allowInvalidAsymmetricKeyTypes)
|
|
1449
|
-
try {
|
|
1450
|
-
Qo(a.alg, u);
|
|
1451
|
-
} catch (R) {
|
|
1452
|
-
return s(R);
|
|
1453
|
-
}
|
|
1454
|
-
let m;
|
|
1455
|
-
try {
|
|
1456
|
-
m = ra.verify(e, l.header.alg, u);
|
|
1457
|
-
} catch (R) {
|
|
1458
|
-
return s(R);
|
|
1459
|
-
}
|
|
1460
|
-
if (!m)
|
|
1461
|
-
return s(new I("invalid signature"));
|
|
1462
|
-
const h = l.payload;
|
|
1463
|
-
if (typeof h.nbf < "u" && !r.ignoreNotBefore) {
|
|
1464
|
-
if (typeof h.nbf != "number")
|
|
1465
|
-
return s(new I("invalid nbf value"));
|
|
1466
|
-
if (h.nbf > i + (r.clockTolerance || 0))
|
|
1467
|
-
return s(new Yo("jwt not active", new Date(h.nbf * 1e3)));
|
|
1468
|
-
}
|
|
1469
|
-
if (typeof h.exp < "u" && !r.ignoreExpiration) {
|
|
1470
|
-
if (typeof h.exp != "number")
|
|
1471
|
-
return s(new I("invalid exp value"));
|
|
1472
|
-
if (i >= h.exp + (r.clockTolerance || 0))
|
|
1473
|
-
return s(new jr("jwt expired", new Date(h.exp * 1e3)));
|
|
1474
|
-
}
|
|
1475
|
-
if (r.audience) {
|
|
1476
|
-
const R = Array.isArray(r.audience) ? r.audience : [r.audience];
|
|
1477
|
-
if (!(Array.isArray(h.aud) ? h.aud : [h.aud]).some(function(A) {
|
|
1478
|
-
return R.some(function(_) {
|
|
1479
|
-
return _ instanceof RegExp ? _.test(A) : _ === A;
|
|
1480
|
-
});
|
|
1481
|
-
}))
|
|
1482
|
-
return s(new I("jwt audience invalid. expected: " + R.join(" or ")));
|
|
1483
|
-
}
|
|
1484
|
-
if (r.issuer && (typeof r.issuer == "string" && h.iss !== r.issuer || Array.isArray(r.issuer) && r.issuer.indexOf(h.iss) === -1))
|
|
1485
|
-
return s(new I("jwt issuer invalid. expected: " + r.issuer));
|
|
1486
|
-
if (r.subject && h.sub !== r.subject)
|
|
1487
|
-
return s(new I("jwt subject invalid. expected: " + r.subject));
|
|
1488
|
-
if (r.jwtid && h.jti !== r.jwtid)
|
|
1489
|
-
return s(new I("jwt jwtid invalid. expected: " + r.jwtid));
|
|
1490
|
-
if (r.nonce && h.nonce !== r.nonce)
|
|
1491
|
-
return s(new I("jwt nonce invalid. expected: " + r.nonce));
|
|
1492
|
-
if (r.maxAge) {
|
|
1493
|
-
if (typeof h.iat != "number")
|
|
1494
|
-
return s(new I("iat required when maxAge is specified"));
|
|
1495
|
-
const R = Zo(r.maxAge, h.iat);
|
|
1496
|
-
if (typeof R > "u")
|
|
1497
|
-
return s(new I('"maxAge" should be a number of seconds or string representing a timespan eg: "1d", "20h", 60'));
|
|
1498
|
-
if (i >= R + (r.clockTolerance || 0))
|
|
1499
|
-
return s(new jr("maxAge exceeded", new Date(R * 1e3)));
|
|
1500
|
-
}
|
|
1501
|
-
if (r.complete === !0) {
|
|
1502
|
-
const R = l.signature;
|
|
1503
|
-
return s(null, {
|
|
1504
|
-
header: a,
|
|
1505
|
-
payload: h,
|
|
1506
|
-
signature: R
|
|
1507
|
-
});
|
|
1508
|
-
}
|
|
1509
|
-
return s(null, h);
|
|
1510
|
-
});
|
|
1511
|
-
}, Pr = 1 / 0, Nt = 9007199254740991, ca = 17976931348623157e292, _r = 0 / 0, fa = "[object Arguments]", ua = "[object Function]", la = "[object GeneratorFunction]", ha = "[object String]", pa = "[object Symbol]", ma = /^\s+|\s+$/g, da = /^[-+]0x[0-9a-f]+$/i, Ea = /^0b[01]+$/i, $a = /^0o[0-7]+$/i, ya = /^(?:0|[1-9]\d*)$/, ga = parseInt;
|
|
1512
|
-
function Sa(e, t) {
|
|
1513
|
-
for (var r = -1, n = e ? e.length : 0, s = Array(n); ++r < n; )
|
|
1514
|
-
s[r] = t(e[r], r, e);
|
|
1515
|
-
return s;
|
|
1516
|
-
}
|
|
1517
|
-
function va(e, t, r, n) {
|
|
1518
|
-
for (var s = e.length, i = r + (n ? 1 : -1); n ? i-- : ++i < s; )
|
|
1519
|
-
if (t(e[i], i, e))
|
|
1520
|
-
return i;
|
|
1521
|
-
return -1;
|
|
1522
|
-
}
|
|
1523
|
-
function wa(e, t, r) {
|
|
1524
|
-
if (t !== t)
|
|
1525
|
-
return va(e, ba, r);
|
|
1526
|
-
for (var n = r - 1, s = e.length; ++n < s; )
|
|
1527
|
-
if (e[n] === t)
|
|
1528
|
-
return n;
|
|
1529
|
-
return -1;
|
|
1530
|
-
}
|
|
1531
|
-
function ba(e) {
|
|
1532
|
-
return e !== e;
|
|
1533
|
-
}
|
|
1534
|
-
function Ia(e, t) {
|
|
1535
|
-
for (var r = -1, n = Array(e); ++r < e; )
|
|
1536
|
-
n[r] = t(r);
|
|
1537
|
-
return n;
|
|
1538
|
-
}
|
|
1539
|
-
function Ra(e, t) {
|
|
1540
|
-
return Sa(t, function(r) {
|
|
1541
|
-
return e[r];
|
|
1542
|
-
});
|
|
1543
|
-
}
|
|
1544
|
-
function Ta(e, t) {
|
|
1545
|
-
return function(r) {
|
|
1546
|
-
return e(t(r));
|
|
1547
|
-
};
|
|
1548
|
-
}
|
|
1549
|
-
var Ae = Object.prototype, rr = Ae.hasOwnProperty, Oe = Ae.toString, Aa = Ae.propertyIsEnumerable, Oa = Ta(Object.keys, Object), Na = Math.max;
|
|
1550
|
-
function La(e, t) {
|
|
1551
|
-
var r = Lt(e) || Da(e) ? Ia(e.length, String) : [], n = r.length, s = !!n;
|
|
1552
|
-
for (var i in e)
|
|
1553
|
-
(t || rr.call(e, i)) && !(s && (i == "length" || Pa(i, n))) && r.push(i);
|
|
1554
|
-
return r;
|
|
1555
|
-
}
|
|
1556
|
-
function ja(e) {
|
|
1557
|
-
if (!_a(e))
|
|
1558
|
-
return Oa(e);
|
|
1559
|
-
var t = [];
|
|
1560
|
-
for (var r in Object(e))
|
|
1561
|
-
rr.call(e, r) && r != "constructor" && t.push(r);
|
|
1562
|
-
return t;
|
|
1563
|
-
}
|
|
1564
|
-
function Pa(e, t) {
|
|
1565
|
-
return t = t ?? Nt, !!t && (typeof e == "number" || ya.test(e)) && e > -1 && e % 1 == 0 && e < t;
|
|
1566
|
-
}
|
|
1567
|
-
function _a(e) {
|
|
1568
|
-
var t = e && e.constructor, r = typeof t == "function" && t.prototype || Ae;
|
|
1569
|
-
return e === r;
|
|
1570
|
-
}
|
|
1571
|
-
function xa(e, t, r, n) {
|
|
1572
|
-
e = tr(e) ? e : Xa(e), r = r && !n ? Ua(r) : 0;
|
|
1573
|
-
var s = e.length;
|
|
1574
|
-
return r < 0 && (r = Na(s + r, 0)), Fa(e) ? r <= s && e.indexOf(t, r) > -1 : !!s && wa(e, t, r) > -1;
|
|
1575
|
-
}
|
|
1576
|
-
function Da(e) {
|
|
1577
|
-
return Ca(e) && rr.call(e, "callee") && (!Aa.call(e, "callee") || Oe.call(e) == fa);
|
|
1578
|
-
}
|
|
1579
|
-
var Lt = Array.isArray;
|
|
1580
|
-
function tr(e) {
|
|
1581
|
-
return e != null && Ga(e.length) && !Ba(e);
|
|
1582
|
-
}
|
|
1583
|
-
function Ca(e) {
|
|
1584
|
-
return nr(e) && tr(e);
|
|
1585
|
-
}
|
|
1586
|
-
function Ba(e) {
|
|
1587
|
-
var t = ke(e) ? Oe.call(e) : "";
|
|
1588
|
-
return t == ua || t == la;
|
|
1589
|
-
}
|
|
1590
|
-
function Ga(e) {
|
|
1591
|
-
return typeof e == "number" && e > -1 && e % 1 == 0 && e <= Nt;
|
|
1592
|
-
}
|
|
1593
|
-
function ke(e) {
|
|
1594
|
-
var t = typeof e;
|
|
1595
|
-
return !!e && (t == "object" || t == "function");
|
|
1596
|
-
}
|
|
1597
|
-
function nr(e) {
|
|
1598
|
-
return !!e && typeof e == "object";
|
|
1599
|
-
}
|
|
1600
|
-
function Fa(e) {
|
|
1601
|
-
return typeof e == "string" || !Lt(e) && nr(e) && Oe.call(e) == ha;
|
|
1602
|
-
}
|
|
1603
|
-
function Va(e) {
|
|
1604
|
-
return typeof e == "symbol" || nr(e) && Oe.call(e) == pa;
|
|
1605
|
-
}
|
|
1606
|
-
function ka(e) {
|
|
1607
|
-
if (!e)
|
|
1608
|
-
return e === 0 ? e : 0;
|
|
1609
|
-
if (e = Ha(e), e === Pr || e === -Pr) {
|
|
1610
|
-
var t = e < 0 ? -1 : 1;
|
|
1611
|
-
return t * ca;
|
|
1612
|
-
}
|
|
1613
|
-
return e === e ? e : 0;
|
|
1614
|
-
}
|
|
1615
|
-
function Ua(e) {
|
|
1616
|
-
var t = ka(e), r = t % 1;
|
|
1617
|
-
return t === t ? r ? t - r : t : 0;
|
|
1618
|
-
}
|
|
1619
|
-
function Ha(e) {
|
|
1620
|
-
if (typeof e == "number")
|
|
1621
|
-
return e;
|
|
1622
|
-
if (Va(e))
|
|
1623
|
-
return _r;
|
|
1624
|
-
if (ke(e)) {
|
|
1625
|
-
var t = typeof e.valueOf == "function" ? e.valueOf() : e;
|
|
1626
|
-
e = ke(t) ? t + "" : t;
|
|
1627
|
-
}
|
|
1628
|
-
if (typeof e != "string")
|
|
1629
|
-
return e === 0 ? e : +e;
|
|
1630
|
-
e = e.replace(ma, "");
|
|
1631
|
-
var r = Ea.test(e);
|
|
1632
|
-
return r || $a.test(e) ? ga(e.slice(2), r ? 2 : 8) : da.test(e) ? _r : +e;
|
|
1633
|
-
}
|
|
1634
|
-
function Ma(e) {
|
|
1635
|
-
return tr(e) ? La(e) : ja(e);
|
|
1636
|
-
}
|
|
1637
|
-
function Xa(e) {
|
|
1638
|
-
return e ? Ra(e, Ma(e)) : [];
|
|
1639
|
-
}
|
|
1640
|
-
var Ka = xa, qa = "[object Boolean]", Wa = Object.prototype, Ja = Wa.toString;
|
|
1641
|
-
function Ya(e) {
|
|
1642
|
-
return e === !0 || e === !1 || za(e) && Ja.call(e) == qa;
|
|
1643
|
-
}
|
|
1644
|
-
function za(e) {
|
|
1645
|
-
return !!e && typeof e == "object";
|
|
1646
|
-
}
|
|
1647
|
-
var Za = Ya, xr = 1 / 0, Qa = 17976931348623157e292, Dr = 0 / 0, ec = "[object Symbol]", rc = /^\s+|\s+$/g, tc = /^[-+]0x[0-9a-f]+$/i, nc = /^0b[01]+$/i, sc = /^0o[0-7]+$/i, ic = parseInt, oc = Object.prototype, ac = oc.toString;
|
|
1648
|
-
function cc(e) {
|
|
1649
|
-
return typeof e == "number" && e == hc(e);
|
|
1650
|
-
}
|
|
1651
|
-
function Cr(e) {
|
|
1652
|
-
var t = typeof e;
|
|
1653
|
-
return !!e && (t == "object" || t == "function");
|
|
1654
|
-
}
|
|
1655
|
-
function fc(e) {
|
|
1656
|
-
return !!e && typeof e == "object";
|
|
1657
|
-
}
|
|
1658
|
-
function uc(e) {
|
|
1659
|
-
return typeof e == "symbol" || fc(e) && ac.call(e) == ec;
|
|
1660
|
-
}
|
|
1661
|
-
function lc(e) {
|
|
1662
|
-
if (!e)
|
|
1663
|
-
return e === 0 ? e : 0;
|
|
1664
|
-
if (e = pc(e), e === xr || e === -xr) {
|
|
1665
|
-
var t = e < 0 ? -1 : 1;
|
|
1666
|
-
return t * Qa;
|
|
1667
|
-
}
|
|
1668
|
-
return e === e ? e : 0;
|
|
1669
|
-
}
|
|
1670
|
-
function hc(e) {
|
|
1671
|
-
var t = lc(e), r = t % 1;
|
|
1672
|
-
return t === t ? r ? t - r : t : 0;
|
|
1673
|
-
}
|
|
1674
|
-
function pc(e) {
|
|
1675
|
-
if (typeof e == "number")
|
|
1676
|
-
return e;
|
|
1677
|
-
if (uc(e))
|
|
1678
|
-
return Dr;
|
|
1679
|
-
if (Cr(e)) {
|
|
1680
|
-
var t = typeof e.valueOf == "function" ? e.valueOf() : e;
|
|
1681
|
-
e = Cr(t) ? t + "" : t;
|
|
1682
|
-
}
|
|
1683
|
-
if (typeof e != "string")
|
|
1684
|
-
return e === 0 ? e : +e;
|
|
1685
|
-
e = e.replace(rc, "");
|
|
1686
|
-
var r = nc.test(e);
|
|
1687
|
-
return r || sc.test(e) ? ic(e.slice(2), r ? 2 : 8) : tc.test(e) ? Dr : +e;
|
|
1688
|
-
}
|
|
1689
|
-
var mc = cc, dc = "[object Number]", Ec = Object.prototype, $c = Ec.toString;
|
|
1690
|
-
function yc(e) {
|
|
1691
|
-
return !!e && typeof e == "object";
|
|
1692
|
-
}
|
|
1693
|
-
function gc(e) {
|
|
1694
|
-
return typeof e == "number" || yc(e) && $c.call(e) == dc;
|
|
1695
|
-
}
|
|
1696
|
-
var Sc = gc, vc = "[object Object]";
|
|
1697
|
-
function wc(e) {
|
|
1698
|
-
var t = !1;
|
|
1699
|
-
if (e != null && typeof e.toString != "function")
|
|
1700
|
-
try {
|
|
1701
|
-
t = !!(e + "");
|
|
1702
|
-
} catch {
|
|
1703
|
-
}
|
|
1704
|
-
return t;
|
|
1705
|
-
}
|
|
1706
|
-
function bc(e, t) {
|
|
1707
|
-
return function(r) {
|
|
1708
|
-
return e(t(r));
|
|
1709
|
-
};
|
|
1710
|
-
}
|
|
1711
|
-
var Ic = Function.prototype, jt = Object.prototype, Pt = Ic.toString, Rc = jt.hasOwnProperty, Tc = Pt.call(Object), Ac = jt.toString, Oc = bc(Object.getPrototypeOf, Object);
|
|
1712
|
-
function Nc(e) {
|
|
1713
|
-
return !!e && typeof e == "object";
|
|
1714
|
-
}
|
|
1715
|
-
function Lc(e) {
|
|
1716
|
-
if (!Nc(e) || Ac.call(e) != vc || wc(e))
|
|
1717
|
-
return !1;
|
|
1718
|
-
var t = Oc(e);
|
|
1719
|
-
if (t === null)
|
|
1720
|
-
return !0;
|
|
1721
|
-
var r = Rc.call(t, "constructor") && t.constructor;
|
|
1722
|
-
return typeof r == "function" && r instanceof r && Pt.call(r) == Tc;
|
|
1723
|
-
}
|
|
1724
|
-
var jc = Lc, Pc = "[object String]", _c = Object.prototype, xc = _c.toString, Dc = Array.isArray;
|
|
1725
|
-
function Cc(e) {
|
|
1726
|
-
return !!e && typeof e == "object";
|
|
1727
|
-
}
|
|
1728
|
-
function Bc(e) {
|
|
1729
|
-
return typeof e == "string" || !Dc(e) && Cc(e) && xc.call(e) == Pc;
|
|
1730
|
-
}
|
|
1731
|
-
var Gc = Bc, Fc = "Expected a function", Br = 1 / 0, Vc = 17976931348623157e292, Gr = 0 / 0, kc = "[object Symbol]", Uc = /^\s+|\s+$/g, Hc = /^[-+]0x[0-9a-f]+$/i, Mc = /^0b[01]+$/i, Xc = /^0o[0-7]+$/i, Kc = parseInt, qc = Object.prototype, Wc = qc.toString;
|
|
1732
|
-
function Jc(e, t) {
|
|
1733
|
-
var r;
|
|
1734
|
-
if (typeof t != "function")
|
|
1735
|
-
throw new TypeError(Fc);
|
|
1736
|
-
return e = ef(e), function() {
|
|
1737
|
-
return --e > 0 && (r = t.apply(this, arguments)), e <= 1 && (t = void 0), r;
|
|
1738
|
-
};
|
|
1739
|
-
}
|
|
1740
|
-
function Yc(e) {
|
|
1741
|
-
return Jc(2, e);
|
|
1742
|
-
}
|
|
1743
|
-
function Fr(e) {
|
|
1744
|
-
var t = typeof e;
|
|
1745
|
-
return !!e && (t == "object" || t == "function");
|
|
1746
|
-
}
|
|
1747
|
-
function zc(e) {
|
|
1748
|
-
return !!e && typeof e == "object";
|
|
1749
|
-
}
|
|
1750
|
-
function Zc(e) {
|
|
1751
|
-
return typeof e == "symbol" || zc(e) && Wc.call(e) == kc;
|
|
1752
|
-
}
|
|
1753
|
-
function Qc(e) {
|
|
1754
|
-
if (!e)
|
|
1755
|
-
return e === 0 ? e : 0;
|
|
1756
|
-
if (e = rf(e), e === Br || e === -Br) {
|
|
1757
|
-
var t = e < 0 ? -1 : 1;
|
|
1758
|
-
return t * Vc;
|
|
1759
|
-
}
|
|
1760
|
-
return e === e ? e : 0;
|
|
1761
|
-
}
|
|
1762
|
-
function ef(e) {
|
|
1763
|
-
var t = Qc(e), r = t % 1;
|
|
1764
|
-
return t === t ? r ? t - r : t : 0;
|
|
1765
|
-
}
|
|
1766
|
-
function rf(e) {
|
|
1767
|
-
if (typeof e == "number")
|
|
1768
|
-
return e;
|
|
1769
|
-
if (Zc(e))
|
|
1770
|
-
return Gr;
|
|
1771
|
-
if (Fr(e)) {
|
|
1772
|
-
var t = typeof e.valueOf == "function" ? e.valueOf() : e;
|
|
1773
|
-
e = Fr(t) ? t + "" : t;
|
|
1774
|
-
}
|
|
1775
|
-
if (typeof e != "string")
|
|
1776
|
-
return e === 0 ? e : +e;
|
|
1777
|
-
e = e.replace(Uc, "");
|
|
1778
|
-
var r = Mc.test(e);
|
|
1779
|
-
return r || Xc.test(e) ? Kc(e.slice(2), r ? 2 : 8) : Hc.test(e) ? Gr : +e;
|
|
1780
|
-
}
|
|
1781
|
-
var tf = Yc;
|
|
1782
|
-
const Vr = gt, nf = Ot, sf = At, kr = F, of = Ka, fe = Za, Ur = mc, Ce = Sc, _t = jc, k = Gc, af = tf, { KeyObject: cf, createSecretKey: ff, createPrivateKey: uf } = j, xt = ["RS256", "RS384", "RS512", "ES256", "ES384", "ES512", "HS256", "HS384", "HS512", "none"];
|
|
1783
|
-
nf && xt.splice(3, 0, "PS256", "PS384", "PS512");
|
|
1784
|
-
const lf = {
|
|
1785
|
-
expiresIn: { isValid: function(e) {
|
|
1786
|
-
return Ur(e) || k(e) && e;
|
|
1787
|
-
}, message: '"expiresIn" should be a number of seconds or string representing a timespan' },
|
|
1788
|
-
notBefore: { isValid: function(e) {
|
|
1789
|
-
return Ur(e) || k(e) && e;
|
|
1790
|
-
}, message: '"notBefore" should be a number of seconds or string representing a timespan' },
|
|
1791
|
-
audience: { isValid: function(e) {
|
|
1792
|
-
return k(e) || Array.isArray(e);
|
|
1793
|
-
}, message: '"audience" must be a string or array' },
|
|
1794
|
-
algorithm: { isValid: of.bind(null, xt), message: '"algorithm" must be a valid string enum value' },
|
|
1795
|
-
header: { isValid: _t, message: '"header" must be an object' },
|
|
1796
|
-
encoding: { isValid: k, message: '"encoding" must be a string' },
|
|
1797
|
-
issuer: { isValid: k, message: '"issuer" must be a string' },
|
|
1798
|
-
subject: { isValid: k, message: '"subject" must be a string' },
|
|
1799
|
-
jwtid: { isValid: k, message: '"jwtid" must be a string' },
|
|
1800
|
-
noTimestamp: { isValid: fe, message: '"noTimestamp" must be a boolean' },
|
|
1801
|
-
keyid: { isValid: k, message: '"keyid" must be a string' },
|
|
1802
|
-
mutatePayload: { isValid: fe, message: '"mutatePayload" must be a boolean' },
|
|
1803
|
-
allowInsecureKeySizes: { isValid: fe, message: '"allowInsecureKeySizes" must be a boolean' },
|
|
1804
|
-
allowInvalidAsymmetricKeyTypes: { isValid: fe, message: '"allowInvalidAsymmetricKeyTypes" must be a boolean' }
|
|
1805
|
-
}, hf = {
|
|
1806
|
-
iat: { isValid: Ce, message: '"iat" should be a number of seconds' },
|
|
1807
|
-
exp: { isValid: Ce, message: '"exp" should be a number of seconds' },
|
|
1808
|
-
nbf: { isValid: Ce, message: '"nbf" should be a number of seconds' }
|
|
1809
|
-
};
|
|
1810
|
-
function Dt(e, t, r, n) {
|
|
1811
|
-
if (!_t(r))
|
|
1812
|
-
throw new Error('Expected "' + n + '" to be a plain object.');
|
|
1813
|
-
Object.keys(r).forEach(function(s) {
|
|
1814
|
-
const i = e[s];
|
|
1815
|
-
if (!i) {
|
|
1816
|
-
if (!t)
|
|
1817
|
-
throw new Error('"' + s + '" is not allowed in "' + n + '"');
|
|
1818
|
-
return;
|
|
1819
|
-
}
|
|
1820
|
-
if (!i.isValid(r[s]))
|
|
1821
|
-
throw new Error(i.message);
|
|
1822
|
-
});
|
|
1823
|
-
}
|
|
1824
|
-
function pf(e) {
|
|
1825
|
-
return Dt(lf, !1, e, "options");
|
|
1826
|
-
}
|
|
1827
|
-
function mf(e) {
|
|
1828
|
-
return Dt(hf, !0, e, "payload");
|
|
1829
|
-
}
|
|
1830
|
-
const Hr = {
|
|
1831
|
-
audience: "aud",
|
|
1832
|
-
issuer: "iss",
|
|
1833
|
-
subject: "sub",
|
|
1834
|
-
jwtid: "jti"
|
|
1835
|
-
}, df = [
|
|
1836
|
-
"expiresIn",
|
|
1837
|
-
"notBefore",
|
|
1838
|
-
"noTimestamp",
|
|
1839
|
-
"audience",
|
|
1840
|
-
"issuer",
|
|
1841
|
-
"subject",
|
|
1842
|
-
"jwtid"
|
|
1843
|
-
];
|
|
1844
|
-
var Ef = function(e, t, r, n) {
|
|
1845
|
-
typeof r == "function" ? (n = r, r = {}) : r = r || {};
|
|
1846
|
-
const s = typeof e == "object" && !Buffer.isBuffer(e), i = Object.assign({
|
|
1847
|
-
alg: r.algorithm || "HS256",
|
|
1848
|
-
typ: s ? "JWT" : void 0,
|
|
1849
|
-
kid: r.keyid
|
|
1850
|
-
}, r.header);
|
|
1851
|
-
function c(o) {
|
|
1852
|
-
if (n)
|
|
1853
|
-
return n(o);
|
|
1854
|
-
throw o;
|
|
1855
|
-
}
|
|
1856
|
-
if (!t && r.algorithm !== "none")
|
|
1857
|
-
return c(new Error("secretOrPrivateKey must have a value"));
|
|
1858
|
-
if (t != null && !(t instanceof cf))
|
|
1859
|
-
try {
|
|
1860
|
-
t = uf(t);
|
|
1861
|
-
} catch {
|
|
1862
|
-
try {
|
|
1863
|
-
t = ff(typeof t == "string" ? Buffer.from(t) : t);
|
|
1864
|
-
} catch {
|
|
1865
|
-
return c(new Error("secretOrPrivateKey is not valid key material"));
|
|
1866
|
-
}
|
|
1867
|
-
}
|
|
1868
|
-
if (i.alg.startsWith("HS") && t.type !== "secret")
|
|
1869
|
-
return c(new Error(`secretOrPrivateKey must be a symmetric key when using ${i.alg}`));
|
|
1870
|
-
if (/^(?:RS|PS|ES)/.test(i.alg)) {
|
|
1871
|
-
if (t.type !== "private")
|
|
1872
|
-
return c(new Error(`secretOrPrivateKey must be an asymmetric key when using ${i.alg}`));
|
|
1873
|
-
if (!r.allowInsecureKeySizes && !i.alg.startsWith("ES") && t.asymmetricKeyDetails !== void 0 && //KeyObject.asymmetricKeyDetails is supported in Node 15+
|
|
1874
|
-
t.asymmetricKeyDetails.modulusLength < 2048)
|
|
1875
|
-
return c(new Error(`secretOrPrivateKey has a minimum key size of 2048 bits for ${i.alg}`));
|
|
1876
|
-
}
|
|
1877
|
-
if (typeof e > "u")
|
|
1878
|
-
return c(new Error("payload is required"));
|
|
1879
|
-
if (s) {
|
|
1880
|
-
try {
|
|
1881
|
-
mf(e);
|
|
1882
|
-
} catch (o) {
|
|
1883
|
-
return c(o);
|
|
1884
|
-
}
|
|
1885
|
-
r.mutatePayload || (e = Object.assign({}, e));
|
|
1886
|
-
} else {
|
|
1887
|
-
const o = df.filter(function(f) {
|
|
1888
|
-
return typeof r[f] < "u";
|
|
1889
|
-
});
|
|
1890
|
-
if (o.length > 0)
|
|
1891
|
-
return c(new Error("invalid " + o.join(",") + " option for " + typeof e + " payload"));
|
|
1892
|
-
}
|
|
1893
|
-
if (typeof e.exp < "u" && typeof r.expiresIn < "u")
|
|
1894
|
-
return c(new Error('Bad "options.expiresIn" option the payload already has an "exp" property.'));
|
|
1895
|
-
if (typeof e.nbf < "u" && typeof r.notBefore < "u")
|
|
1896
|
-
return c(new Error('Bad "options.notBefore" option the payload already has an "nbf" property.'));
|
|
1897
|
-
try {
|
|
1898
|
-
pf(r);
|
|
1899
|
-
} catch (o) {
|
|
1900
|
-
return c(o);
|
|
1901
|
-
}
|
|
1902
|
-
if (!r.allowInvalidAsymmetricKeyTypes)
|
|
1903
|
-
try {
|
|
1904
|
-
sf(i.alg, t);
|
|
1905
|
-
} catch (o) {
|
|
1906
|
-
return c(o);
|
|
1907
|
-
}
|
|
1908
|
-
const l = e.iat || Math.floor(Date.now() / 1e3);
|
|
1909
|
-
if (r.noTimestamp ? delete e.iat : s && (e.iat = l), typeof r.notBefore < "u") {
|
|
1910
|
-
try {
|
|
1911
|
-
e.nbf = Vr(r.notBefore, l);
|
|
1912
|
-
} catch (o) {
|
|
1913
|
-
return c(o);
|
|
1914
|
-
}
|
|
1915
|
-
if (typeof e.nbf > "u")
|
|
1916
|
-
return c(new Error('"notBefore" should be a number of seconds or string representing a timespan eg: "1d", "20h", 60'));
|
|
1917
|
-
}
|
|
1918
|
-
if (typeof r.expiresIn < "u" && typeof e == "object") {
|
|
1919
|
-
try {
|
|
1920
|
-
e.exp = Vr(r.expiresIn, l);
|
|
1921
|
-
} catch (o) {
|
|
1922
|
-
return c(o);
|
|
1923
|
-
}
|
|
1924
|
-
if (typeof e.exp > "u")
|
|
1925
|
-
return c(new Error('"expiresIn" should be a number of seconds or string representing a timespan eg: "1d", "20h", 60'));
|
|
1926
|
-
}
|
|
1927
|
-
Object.keys(Hr).forEach(function(o) {
|
|
1928
|
-
const f = Hr[o];
|
|
1929
|
-
if (typeof r[o] < "u") {
|
|
1930
|
-
if (typeof e[f] < "u")
|
|
1931
|
-
return c(new Error('Bad "options.' + o + '" option. The payload already has an "' + f + '" property.'));
|
|
1932
|
-
e[f] = r[o];
|
|
1933
|
-
}
|
|
1934
|
-
});
|
|
1935
|
-
const a = r.encoding || "utf8";
|
|
1936
|
-
if (typeof n == "function")
|
|
1937
|
-
n = n && af(n), kr.createSign({
|
|
1938
|
-
header: i,
|
|
1939
|
-
privateKey: t,
|
|
1940
|
-
payload: e,
|
|
1941
|
-
encoding: a
|
|
1942
|
-
}).once("error", n).once("done", function(o) {
|
|
1943
|
-
if (!r.allowInsecureKeySizes && /^(?:RS|PS)/.test(i.alg) && o.length < 256)
|
|
1944
|
-
return n(new Error(`secretOrPrivateKey has a minimum key size of 2048 bits for ${i.alg}`));
|
|
1945
|
-
n(null, o);
|
|
1946
|
-
});
|
|
1947
|
-
else {
|
|
1948
|
-
let o = kr.sign({ header: i, payload: e, secret: t, encoding: a });
|
|
1949
|
-
if (!r.allowInsecureKeySizes && /^(?:RS|PS)/.test(i.alg) && o.length < 256)
|
|
1950
|
-
throw new Error(`secretOrPrivateKey has a minimum key size of 2048 bits for ${i.alg}`);
|
|
1951
|
-
return o;
|
|
1952
|
-
}
|
|
1953
|
-
}, $f = {
|
|
1954
|
-
decode: mt,
|
|
1955
|
-
verify: aa,
|
|
1956
|
-
sign: Ef,
|
|
1957
|
-
JsonWebTokenError: ve,
|
|
1958
|
-
NotBeforeError: Et,
|
|
1959
|
-
TokenExpiredError: yt
|
|
1960
|
-
};
|
|
1961
|
-
const Mr = /* @__PURE__ */ qt($f);
|
|
1962
|
-
class yf {
|
|
1963
|
-
constructor(t, r) {
|
|
1964
|
-
Ne(this, "secretPrivateKey", "secretPrivateKey");
|
|
1965
|
-
Ne(this, "daysToExpire", 30);
|
|
1966
|
-
this.secretPrivateKey = t, this.daysToExpire = r;
|
|
1967
|
-
}
|
|
1968
|
-
createAccessToken(t, r) {
|
|
1969
|
-
return Mr.sign({ [t]: r }, this.secretPrivateKey, {
|
|
1970
|
-
expiresIn: 60 * 60 * 24 * this.daysToExpire
|
|
1971
|
-
});
|
|
1972
|
-
}
|
|
1973
|
-
verifyAccessToken(t) {
|
|
1974
|
-
return Mr.verify(t, this.secretPrivateKey);
|
|
1975
|
-
}
|
|
1976
|
-
}
|
|
1977
|
-
const Sf = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
|
|
1978
|
-
__proto__: null,
|
|
1979
|
-
Token: yf
|
|
1980
|
-
}, Symbol.toStringTag, { value: "Module" }));
|
|
1981
|
-
export {
|
|
1982
|
-
yf as T,
|
|
1983
|
-
Sf as t
|
|
1984
|
-
};
|