@nano-lib/util 1.1.11 → 1.1.12
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/lib/index.js +5 -5
- package/lib/index.mjs +454 -452
- package/lib/types/request.d.ts +6 -0
- package/lib/utils/common.d.ts +2 -0
- package/lib/utils/request/token.d.ts +2 -1
- package/package.json +1 -1
package/lib/index.mjs
CHANGED
|
@@ -1,7 +1,7 @@
|
|
|
1
1
|
var vs = Object.defineProperty;
|
|
2
|
-
var
|
|
3
|
-
var z = (t, e, n) =>
|
|
4
|
-
const
|
|
2
|
+
var Es = (t, e, n) => e in t ? vs(t, e, { enumerable: !0, configurable: !0, writable: !0, value: n }) : t[e] = n;
|
|
3
|
+
var z = (t, e, n) => Es(t, typeof e != "symbol" ? e + "" : e, n);
|
|
4
|
+
const Ts = (t, e, n, r) => (t /= r / 2, t < 1 ? n / 2 * t * t + e : (t--, -n / 2 * (t * (t - 2) - 1) + e)), Ss = window.requestAnimationFrame || window.webkitRequestAnimationFrame || window.mozRequestAnimationFrame || window.msRequestAnimationFrame || ((t) => window.setTimeout(t, 16.666666666666668));
|
|
5
5
|
function Rs(t, e) {
|
|
6
6
|
if (e) {
|
|
7
7
|
document.querySelector(e).scrollTop = t;
|
|
@@ -17,12 +17,12 @@ function Fs(t) {
|
|
|
17
17
|
let d = 0;
|
|
18
18
|
const h = function() {
|
|
19
19
|
d += f;
|
|
20
|
-
const l =
|
|
20
|
+
const l = Ts(d, o, c, r);
|
|
21
21
|
Rs(l, e), d < r ? Ss(h) : s && s();
|
|
22
22
|
};
|
|
23
23
|
h();
|
|
24
24
|
}
|
|
25
|
-
function
|
|
25
|
+
function _s(t, e) {
|
|
26
26
|
switch (arguments.length) {
|
|
27
27
|
case 1:
|
|
28
28
|
return parseInt((Math.random() * t + 1).toString(), 10);
|
|
@@ -32,7 +32,7 @@ function As(t, e) {
|
|
|
32
32
|
return 0;
|
|
33
33
|
}
|
|
34
34
|
}
|
|
35
|
-
function
|
|
35
|
+
function As() {
|
|
36
36
|
let t = "";
|
|
37
37
|
const e = [];
|
|
38
38
|
for (let n = 0; n <= 15; n++)
|
|
@@ -41,7 +41,7 @@ function _s() {
|
|
|
41
41
|
n === 9 || n === 14 || n === 19 || n === 24 ? t += "-" : n === 15 ? t += 4 : n === 20 ? t += e[Math.random() * 4 | 8] : t += e[Math.random() * 16 | 0];
|
|
42
42
|
return t;
|
|
43
43
|
}
|
|
44
|
-
function
|
|
44
|
+
function Yt(t, e) {
|
|
45
45
|
if (!t) return "-";
|
|
46
46
|
t.toString().length === 10 && (t = +t * 1e3), e ?? (e = "YYYY-MM-DD HH:mm:ss");
|
|
47
47
|
const n = new Date(t), r = (c, f, d = " ") => {
|
|
@@ -68,12 +68,12 @@ function Vt(t, e) {
|
|
|
68
68
|
function Is(t, e) {
|
|
69
69
|
`${t}`.length === 10 ? t = parseInt(t + "") * 1e3 : t = +t;
|
|
70
70
|
const n = new Date(t), s = (Date.now() - Number(n)) / 1e3;
|
|
71
|
-
return s < 30 ? "刚刚" : s < 3600 ? `${Math.ceil(s / 60)}分钟前` : s < 3600 * 24 ? `${Math.ceil(s / 3600)}小时前` : s < 3600 * 24 * 2 ? "1天前" : e ?
|
|
71
|
+
return s < 30 ? "刚刚" : s < 3600 ? `${Math.ceil(s / 60)}分钟前` : s < 3600 * 24 ? `${Math.ceil(s / 3600)}小时前` : s < 3600 * 24 * 2 ? "1天前" : e ? Yt(t, e) : `${n.getMonth() + 1}月${n.getDate()}日${n.getHours()}时${n.getMinutes()}分`;
|
|
72
72
|
}
|
|
73
73
|
function Bs(t) {
|
|
74
74
|
const e = t || /* @__PURE__ */ new Date(), n = new Date(e), r = new Date(e);
|
|
75
75
|
return n.setHours(0, 0, 0), r.setHours(23, 59, 59), {
|
|
76
|
-
dateRange: [
|
|
76
|
+
dateRange: [Yt(n), Yt(r)],
|
|
77
77
|
timestampRange: [n.getTime(), r.getTime()]
|
|
78
78
|
};
|
|
79
79
|
}
|
|
@@ -145,10 +145,10 @@ function Ps(t) {
|
|
|
145
145
|
}));
|
|
146
146
|
};
|
|
147
147
|
}
|
|
148
|
-
function
|
|
148
|
+
function Ns(t) {
|
|
149
149
|
t && (t.oncontextmenu = () => !1);
|
|
150
150
|
}
|
|
151
|
-
function
|
|
151
|
+
function Ms(t) {
|
|
152
152
|
return /^(http(s)?:\/\/)/.test(t);
|
|
153
153
|
}
|
|
154
154
|
function ks(t) {
|
|
@@ -175,13 +175,13 @@ function $s(t) {
|
|
|
175
175
|
function Re(t) {
|
|
176
176
|
return /^\d{6}((((((19|20)\d{2})(0[13-9]|1[012])(0[1-9]|[12]\d|30))|(((19|20)\d{2})(0[13578]|1[02])31)|((19|20)\d{2})02(0[1-9]|1\d|2[0-8])|((((19|20)([13579][26]|[2468][048]|0[48]))|(2000))0229))\d{3})|((((\d{2})(0[13-9]|1[012])(0[1-9]|[12]\d|30))|((\d{2})(0[13578]|1[02])31)|((\d{2})02(0[1-9]|1\d|2[0-8]))|(([13579][26]|[2468][048]|0[048])0229))\d{2}))(\d|X|x)$/.test(t);
|
|
177
177
|
}
|
|
178
|
-
function
|
|
178
|
+
function Ys(t) {
|
|
179
179
|
return /^0\d{2,3}-?\d{7,8}$/.test(t);
|
|
180
180
|
}
|
|
181
|
-
function
|
|
181
|
+
function Ks(t) {
|
|
182
182
|
return /^1[3-9]\d{9}$/.test(t);
|
|
183
183
|
}
|
|
184
|
-
const
|
|
184
|
+
const Ne = () => {
|
|
185
185
|
};
|
|
186
186
|
function Ia(t) {
|
|
187
187
|
return new Promise((e) => setTimeout(e, t));
|
|
@@ -225,24 +225,24 @@ function Pa(t) {
|
|
|
225
225
|
throw new Error("Please provide a valid ID number!");
|
|
226
226
|
return t.substring(6, 10) + "-" + t.substring(10, 12) + "-" + t.substring(12, 14);
|
|
227
227
|
}
|
|
228
|
-
function
|
|
229
|
-
const { baseUrl: e, initUrl: n, initParams: r, initFn: s } = t;
|
|
230
|
-
return new Promise((
|
|
228
|
+
function Na(t) {
|
|
229
|
+
const { baseUrl: e, initUrl: n, initParams: r, initFn: s, defaultHttpsPort: o, defaultHttpPort: c } = t;
|
|
230
|
+
return new Promise((f) => {
|
|
231
231
|
if (e) {
|
|
232
|
-
|
|
232
|
+
f(!0);
|
|
233
233
|
return;
|
|
234
234
|
}
|
|
235
|
-
const
|
|
235
|
+
const d = {};
|
|
236
236
|
if (r !== null && typeof r == "object")
|
|
237
|
-
Object.assign(
|
|
237
|
+
Object.assign(d, r);
|
|
238
238
|
else {
|
|
239
|
-
const { protocol:
|
|
240
|
-
Object.assign(
|
|
239
|
+
const { protocol: h, hostname: l, port: v, pathname: O } = Vs(o, c);
|
|
240
|
+
Object.assign(d, { frontendProtocol: h, frontendDomain: l, frontendPort: v, frontendContextPath: O });
|
|
241
241
|
}
|
|
242
|
-
s(n,
|
|
242
|
+
s(n, d).then((h) => f(h)).catch(() => f(!1));
|
|
243
243
|
});
|
|
244
244
|
}
|
|
245
|
-
const
|
|
245
|
+
const Vs = (t = "443", e = "80") => {
|
|
246
246
|
const { protocol: n, hostname: r, port: s, pathname: o } = window.location, c = n.replace(":", ""), f = s || (c === "https" ? t : e), d = Js(o);
|
|
247
247
|
return {
|
|
248
248
|
hostname: r,
|
|
@@ -259,7 +259,7 @@ const Ks = (t = "443", e = "80") => {
|
|
|
259
259
|
e || (e = location.origin);
|
|
260
260
|
const n = new RegExp(/^http(s)?:\/\//), r = new RegExp(/^((?:[a-z]+:)?\/\/|data:image\/)(.*)/i);
|
|
261
261
|
return n.test(t) || r.test(t) ? t : e + t;
|
|
262
|
-
},
|
|
262
|
+
}, Ma = (t, e = "") => {
|
|
263
263
|
typeof t == "string" && (t = t === "" ? [] : t.split(","));
|
|
264
264
|
for (const n in t)
|
|
265
265
|
t[n] = Ws(t[n], e);
|
|
@@ -279,10 +279,10 @@ function ka(t) {
|
|
|
279
279
|
n();
|
|
280
280
|
}
|
|
281
281
|
function La(t) {
|
|
282
|
-
let e =
|
|
282
|
+
let e = Ne;
|
|
283
283
|
return (...n) => new Promise((r, s) => {
|
|
284
284
|
e(), e = () => {
|
|
285
|
-
r = s =
|
|
285
|
+
r = s = Ne;
|
|
286
286
|
}, t(...n).then(
|
|
287
287
|
(o) => r(o),
|
|
288
288
|
(o) => s(o)
|
|
@@ -486,23 +486,23 @@ function vn(t, e) {
|
|
|
486
486
|
return t.apply(e, arguments);
|
|
487
487
|
};
|
|
488
488
|
}
|
|
489
|
-
const { toString: di } = Object.prototype, { getPrototypeOf: Oe } = Object, { iterator: Wt, toStringTag:
|
|
489
|
+
const { toString: di } = Object.prototype, { getPrototypeOf: Oe } = Object, { iterator: Wt, toStringTag: En } = Symbol, Zt = /* @__PURE__ */ ((t) => (e) => {
|
|
490
490
|
const n = di.call(e);
|
|
491
491
|
return t[n] || (t[n] = n.slice(8, -1).toLowerCase());
|
|
492
|
-
})(/* @__PURE__ */ Object.create(null)), ut = (t) => (t = t.toLowerCase(), (e) => Zt(e) === t), Gt = (t) => (e) => typeof e === t, { isArray: Rt } = Array,
|
|
492
|
+
})(/* @__PURE__ */ Object.create(null)), ut = (t) => (t = t.toLowerCase(), (e) => Zt(e) === t), Gt = (t) => (e) => typeof e === t, { isArray: Rt } = Array, Tt = Gt("undefined");
|
|
493
493
|
function Bt(t) {
|
|
494
|
-
return t !== null && !
|
|
494
|
+
return t !== null && !Tt(t) && t.constructor !== null && !Tt(t.constructor) && Q(t.constructor.isBuffer) && t.constructor.isBuffer(t);
|
|
495
495
|
}
|
|
496
|
-
const
|
|
496
|
+
const Tn = ut("ArrayBuffer");
|
|
497
497
|
function pi(t) {
|
|
498
498
|
let e;
|
|
499
|
-
return typeof ArrayBuffer < "u" && ArrayBuffer.isView ? e = ArrayBuffer.isView(t) : e = t && t.buffer &&
|
|
499
|
+
return typeof ArrayBuffer < "u" && ArrayBuffer.isView ? e = ArrayBuffer.isView(t) : e = t && t.buffer && Tn(t.buffer), e;
|
|
500
500
|
}
|
|
501
501
|
const mi = Gt("string"), Q = Gt("function"), Sn = Gt("number"), Ct = (t) => t !== null && typeof t == "object", gi = (t) => t === !0 || t === !1, Ht = (t) => {
|
|
502
502
|
if (Zt(t) !== "object")
|
|
503
503
|
return !1;
|
|
504
504
|
const e = Oe(t);
|
|
505
|
-
return (e === null || e === Object.prototype || Object.getPrototypeOf(e) === null) && !(
|
|
505
|
+
return (e === null || e === Object.prototype || Object.getPrototypeOf(e) === null) && !(En in t) && !(Wt in t);
|
|
506
506
|
}, yi = (t) => {
|
|
507
507
|
if (!Ct(t) || Bt(t))
|
|
508
508
|
return !1;
|
|
@@ -511,11 +511,11 @@ const mi = Gt("string"), Q = Gt("function"), Sn = Gt("number"), Ct = (t) => t !=
|
|
|
511
511
|
} catch {
|
|
512
512
|
return !1;
|
|
513
513
|
}
|
|
514
|
-
}, xi = ut("Date"), bi = ut("File"), wi = ut("Blob"), vi = ut("FileList"),
|
|
514
|
+
}, xi = ut("Date"), bi = ut("File"), wi = ut("Blob"), vi = ut("FileList"), Ei = (t) => Ct(t) && Q(t.pipe), Ti = (t) => {
|
|
515
515
|
let e;
|
|
516
516
|
return t && (typeof FormData == "function" && t instanceof FormData || Q(t.append) && ((e = Zt(t)) === "formdata" || // detect form-data instance
|
|
517
517
|
e === "object" && Q(t.toString) && t.toString() === "[object FormData]"));
|
|
518
|
-
}, Si = ut("URLSearchParams"), [Ri, Oi, Fi,
|
|
518
|
+
}, Si = ut("URLSearchParams"), [Ri, Oi, Fi, _i] = ["ReadableStream", "Request", "Response", "Headers"].map(ut), Ai = (t) => t.trim ? t.trim() : t.replace(/^[\s\uFEFF\xA0]+|[\s\uFEFF\xA0]+$/g, "");
|
|
519
519
|
function Dt(t, e, { allOwnKeys: n = !1 } = {}) {
|
|
520
520
|
if (t === null || typeof t > "u")
|
|
521
521
|
return;
|
|
@@ -543,11 +543,11 @@ function Rn(t, e) {
|
|
|
543
543
|
return s;
|
|
544
544
|
return null;
|
|
545
545
|
}
|
|
546
|
-
const xt = typeof globalThis < "u" ? globalThis : typeof self < "u" ? self : typeof window < "u" ? window : global, On = (t) => !
|
|
546
|
+
const xt = typeof globalThis < "u" ? globalThis : typeof self < "u" ? self : typeof window < "u" ? window : global, On = (t) => !Tt(t) && t !== xt;
|
|
547
547
|
function xe() {
|
|
548
548
|
const { caseless: t, skipUndefined: e } = On(this) && this || {}, n = {}, r = (s, o) => {
|
|
549
549
|
const c = t && Rn(n, o) || o;
|
|
550
|
-
Ht(n[c]) && Ht(s) ? n[c] = xe(n[c], s) : Ht(s) ? n[c] = xe({}, s) : Rt(s) ? n[c] = s.slice() : (!e || !
|
|
550
|
+
Ht(n[c]) && Ht(s) ? n[c] = xe(n[c], s) : Ht(s) ? n[c] = xe({}, s) : Rt(s) ? n[c] = s.slice() : (!e || !Tt(s)) && (n[c] = s);
|
|
551
551
|
};
|
|
552
552
|
for (let s = 0, o = arguments.length; s < o; s++)
|
|
553
553
|
arguments[s] && Dt(arguments[s], r);
|
|
@@ -582,7 +582,7 @@ const Ii = (t, e, n, { allOwnKeys: r } = {}) => (Dt(e, (s, o) => {
|
|
|
582
582
|
for (; e-- > 0; )
|
|
583
583
|
n[e] = t[e];
|
|
584
584
|
return n;
|
|
585
|
-
},
|
|
585
|
+
}, Ni = /* @__PURE__ */ ((t) => (e) => t && e instanceof t)(typeof Uint8Array < "u" && Oe(Uint8Array)), Mi = (t, e) => {
|
|
586
586
|
const r = (t && t[Wt]).call(t);
|
|
587
587
|
let s;
|
|
588
588
|
for (; (s = r.next()) && !s.done; ) {
|
|
@@ -600,7 +600,7 @@ const Ii = (t, e, n, { allOwnKeys: r } = {}) => (Dt(e, (s, o) => {
|
|
|
600
600
|
function(n, r, s) {
|
|
601
601
|
return r.toUpperCase() + s;
|
|
602
602
|
}
|
|
603
|
-
),
|
|
603
|
+
), Me = (({ hasOwnProperty: t }) => (e, n) => t.call(e, n))(Object.prototype), Hi = ut("RegExp"), Fn = (t, e) => {
|
|
604
604
|
const n = Object.getOwnPropertyDescriptors(t), r = {};
|
|
605
605
|
Dt(n, (s, o) => {
|
|
606
606
|
let c;
|
|
@@ -629,11 +629,11 @@ const Ii = (t, e, n, { allOwnKeys: r } = {}) => (Dt(e, (s, o) => {
|
|
|
629
629
|
};
|
|
630
630
|
return Rt(t) ? r(t) : r(String(t).split(e)), n;
|
|
631
631
|
}, $i = () => {
|
|
632
|
-
},
|
|
633
|
-
function
|
|
634
|
-
return !!(t && Q(t.append) && t[
|
|
632
|
+
}, Yi = (t, e) => t != null && Number.isFinite(t = +t) ? t : e;
|
|
633
|
+
function Ki(t) {
|
|
634
|
+
return !!(t && Q(t.append) && t[En] === "FormData" && t[Wt]);
|
|
635
635
|
}
|
|
636
|
-
const
|
|
636
|
+
const Vi = (t) => {
|
|
637
637
|
const e = new Array(10), n = (r, s) => {
|
|
638
638
|
if (Ct(r)) {
|
|
639
639
|
if (e.indexOf(r) >= 0)
|
|
@@ -645,25 +645,25 @@ const Ki = (t) => {
|
|
|
645
645
|
const o = Rt(r) ? [] : {};
|
|
646
646
|
return Dt(r, (c, f) => {
|
|
647
647
|
const d = n(c, s + 1);
|
|
648
|
-
!
|
|
648
|
+
!Tt(d) && (o[f] = d);
|
|
649
649
|
}), e[s] = void 0, o;
|
|
650
650
|
}
|
|
651
651
|
}
|
|
652
652
|
return r;
|
|
653
653
|
};
|
|
654
654
|
return n(t, 0);
|
|
655
|
-
}, Ji = ut("AsyncFunction"), Wi = (t) => t && (Ct(t) || Q(t)) && Q(t.then) && Q(t.catch),
|
|
655
|
+
}, Ji = ut("AsyncFunction"), Wi = (t) => t && (Ct(t) || Q(t)) && Q(t.then) && Q(t.catch), _n = ((t, e) => t ? setImmediate : e ? ((n, r) => (xt.addEventListener("message", ({ source: s, data: o }) => {
|
|
656
656
|
s === xt && o === n && r.length && r.shift()();
|
|
657
657
|
}, !1), (s) => {
|
|
658
658
|
r.push(s), xt.postMessage(n, "*");
|
|
659
659
|
}))(`axios@${Math.random()}`, []) : (n) => setTimeout(n))(
|
|
660
660
|
typeof setImmediate == "function",
|
|
661
661
|
Q(xt.postMessage)
|
|
662
|
-
), Zi = typeof queueMicrotask < "u" ? queueMicrotask.bind(xt) : typeof process < "u" && process.nextTick ||
|
|
662
|
+
), Zi = typeof queueMicrotask < "u" ? queueMicrotask.bind(xt) : typeof process < "u" && process.nextTick || _n, Gi = (t) => t != null && Q(t[Wt]), y = {
|
|
663
663
|
isArray: Rt,
|
|
664
|
-
isArrayBuffer:
|
|
664
|
+
isArrayBuffer: Tn,
|
|
665
665
|
isBuffer: Bt,
|
|
666
|
-
isFormData:
|
|
666
|
+
isFormData: Ti,
|
|
667
667
|
isArrayBufferView: pi,
|
|
668
668
|
isString: mi,
|
|
669
669
|
isNumber: Sn,
|
|
@@ -674,21 +674,21 @@ const Ki = (t) => {
|
|
|
674
674
|
isReadableStream: Ri,
|
|
675
675
|
isRequest: Oi,
|
|
676
676
|
isResponse: Fi,
|
|
677
|
-
isHeaders:
|
|
678
|
-
isUndefined:
|
|
677
|
+
isHeaders: _i,
|
|
678
|
+
isUndefined: Tt,
|
|
679
679
|
isDate: xi,
|
|
680
680
|
isFile: bi,
|
|
681
681
|
isBlob: wi,
|
|
682
682
|
isRegExp: Hi,
|
|
683
683
|
isFunction: Q,
|
|
684
|
-
isStream:
|
|
684
|
+
isStream: Ei,
|
|
685
685
|
isURLSearchParams: Si,
|
|
686
|
-
isTypedArray:
|
|
686
|
+
isTypedArray: Ni,
|
|
687
687
|
isFileList: vi,
|
|
688
688
|
forEach: Dt,
|
|
689
689
|
merge: xe,
|
|
690
690
|
extend: Ii,
|
|
691
|
-
trim:
|
|
691
|
+
trim: Ai,
|
|
692
692
|
stripBOM: Bi,
|
|
693
693
|
inherits: Ci,
|
|
694
694
|
toFlatObject: Di,
|
|
@@ -696,33 +696,33 @@ const Ki = (t) => {
|
|
|
696
696
|
kindOfTest: ut,
|
|
697
697
|
endsWith: qi,
|
|
698
698
|
toArray: Pi,
|
|
699
|
-
forEachEntry:
|
|
699
|
+
forEachEntry: Mi,
|
|
700
700
|
matchAll: ki,
|
|
701
701
|
isHTMLForm: Li,
|
|
702
|
-
hasOwnProperty:
|
|
703
|
-
hasOwnProp:
|
|
702
|
+
hasOwnProperty: Me,
|
|
703
|
+
hasOwnProp: Me,
|
|
704
704
|
// an alias to avoid ESLint no-prototype-builtins detection
|
|
705
705
|
reduceDescriptors: Fn,
|
|
706
706
|
freezeMethods: zi,
|
|
707
707
|
toObjectSet: ji,
|
|
708
708
|
toCamelCase: Ui,
|
|
709
709
|
noop: $i,
|
|
710
|
-
toFiniteNumber:
|
|
710
|
+
toFiniteNumber: Yi,
|
|
711
711
|
findKey: Rn,
|
|
712
712
|
global: xt,
|
|
713
713
|
isContextDefined: On,
|
|
714
|
-
isSpecCompliantForm:
|
|
715
|
-
toJSONObject:
|
|
714
|
+
isSpecCompliantForm: Ki,
|
|
715
|
+
toJSONObject: Vi,
|
|
716
716
|
isAsyncFn: Ji,
|
|
717
717
|
isThenable: Wi,
|
|
718
|
-
setImmediate:
|
|
718
|
+
setImmediate: _n,
|
|
719
719
|
asap: Zi,
|
|
720
720
|
isIterable: Gi
|
|
721
721
|
};
|
|
722
|
-
function
|
|
722
|
+
function N(t, e, n, r, s) {
|
|
723
723
|
Error.call(this), Error.captureStackTrace ? Error.captureStackTrace(this, this.constructor) : this.stack = new Error().stack, this.message = t, this.name = "AxiosError", e && (this.code = e), n && (this.config = n), r && (this.request = r), s && (this.response = s, this.status = s.status ? s.status : null);
|
|
724
724
|
}
|
|
725
|
-
y.inherits(
|
|
725
|
+
y.inherits(N, Error, {
|
|
726
726
|
toJSON: function() {
|
|
727
727
|
return {
|
|
728
728
|
// Standard
|
|
@@ -743,7 +743,7 @@ y.inherits(M, Error, {
|
|
|
743
743
|
};
|
|
744
744
|
}
|
|
745
745
|
});
|
|
746
|
-
const
|
|
746
|
+
const An = N.prototype, In = {};
|
|
747
747
|
[
|
|
748
748
|
"ERR_BAD_OPTION_VALUE",
|
|
749
749
|
"ERR_BAD_OPTION",
|
|
@@ -761,15 +761,15 @@ const _n = M.prototype, In = {};
|
|
|
761
761
|
].forEach((t) => {
|
|
762
762
|
In[t] = { value: t };
|
|
763
763
|
});
|
|
764
|
-
Object.defineProperties(
|
|
765
|
-
Object.defineProperty(
|
|
766
|
-
|
|
767
|
-
const c = Object.create(
|
|
764
|
+
Object.defineProperties(N, In);
|
|
765
|
+
Object.defineProperty(An, "isAxiosError", { value: !0 });
|
|
766
|
+
N.from = (t, e, n, r, s, o) => {
|
|
767
|
+
const c = Object.create(An);
|
|
768
768
|
y.toFlatObject(t, c, function(l) {
|
|
769
769
|
return l !== Error.prototype;
|
|
770
770
|
}, (h) => h !== "isAxiosError");
|
|
771
771
|
const f = t && t.message ? t.message : "Error", d = e == null && t ? t.code : e;
|
|
772
|
-
return
|
|
772
|
+
return N.call(c, f, d, n, r, s), t && c.cause == null && Object.defineProperty(c, "cause", { value: t, configurable: !0 }), c.name = t && t.name || "Error", o && Object.assign(c, o), c;
|
|
773
773
|
};
|
|
774
774
|
const Xi = null;
|
|
775
775
|
function be(t) {
|
|
@@ -809,16 +809,16 @@ function Xt(t, e, n) {
|
|
|
809
809
|
if (y.isBoolean(w))
|
|
810
810
|
return w.toString();
|
|
811
811
|
if (!d && y.isBlob(w))
|
|
812
|
-
throw new
|
|
812
|
+
throw new N("Blob is not supported. Use a Buffer instead.");
|
|
813
813
|
return y.isArrayBuffer(w) || y.isTypedArray(w) ? d && typeof Blob == "function" ? new Blob([w]) : Buffer.from(w) : w;
|
|
814
814
|
}
|
|
815
815
|
function l(w, F, m) {
|
|
816
|
-
let
|
|
816
|
+
let E = w;
|
|
817
817
|
if (w && !m && typeof w == "object") {
|
|
818
818
|
if (y.endsWith(F, "{}"))
|
|
819
819
|
F = r ? F : F.slice(0, -2), w = JSON.stringify(w);
|
|
820
|
-
else if (y.isArray(w) && Qi(w) || (y.isFileList(w) || y.endsWith(F, "[]")) && (
|
|
821
|
-
return F = Bn(F),
|
|
820
|
+
else if (y.isArray(w) && Qi(w) || (y.isFileList(w) || y.endsWith(F, "[]")) && (E = y.toArray(w)))
|
|
821
|
+
return F = Bn(F), E.forEach(function(g, S) {
|
|
822
822
|
!(y.isUndefined(g) || g === null) && e.append(
|
|
823
823
|
// eslint-disable-next-line no-nested-ternary
|
|
824
824
|
c === !0 ? ke([F], S, o) : c === null ? F : F + "[]",
|
|
@@ -837,14 +837,14 @@ function Xt(t, e, n) {
|
|
|
837
837
|
if (!y.isUndefined(w)) {
|
|
838
838
|
if (v.indexOf(w) !== -1)
|
|
839
839
|
throw Error("Circular reference detected in " + F.join("."));
|
|
840
|
-
v.push(w), y.forEach(w, function(
|
|
841
|
-
(!(y.isUndefined(
|
|
840
|
+
v.push(w), y.forEach(w, function(E, b) {
|
|
841
|
+
(!(y.isUndefined(E) || E === null) && s.call(
|
|
842
842
|
e,
|
|
843
|
-
|
|
843
|
+
E,
|
|
844
844
|
y.isString(b) ? b.trim() : b,
|
|
845
845
|
F,
|
|
846
846
|
O
|
|
847
|
-
)) === !0 && I(
|
|
847
|
+
)) === !0 && I(E, F ? F.concat(b) : [b]);
|
|
848
848
|
}), v.pop();
|
|
849
849
|
}
|
|
850
850
|
}
|
|
@@ -965,10 +965,10 @@ const qn = {
|
|
|
965
965
|
Blob: so
|
|
966
966
|
},
|
|
967
967
|
protocols: ["http", "https", "file", "blob", "url", "data"]
|
|
968
|
-
},
|
|
969
|
-
self instanceof WorkerGlobalScope && typeof self.importScripts == "function", co =
|
|
968
|
+
}, _e = typeof window < "u" && typeof document < "u", we = typeof navigator == "object" && navigator || void 0, oo = _e && (!we || ["ReactNative", "NativeScript", "NS"].indexOf(we.product) < 0), ao = typeof WorkerGlobalScope < "u" && // eslint-disable-next-line no-undef
|
|
969
|
+
self instanceof WorkerGlobalScope && typeof self.importScripts == "function", co = _e && window.location.href || "http://localhost", uo = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
|
|
970
970
|
__proto__: null,
|
|
971
|
-
hasBrowserEnv:
|
|
971
|
+
hasBrowserEnv: _e,
|
|
972
972
|
hasStandardBrowserEnv: oo,
|
|
973
973
|
hasStandardBrowserWebWorkerEnv: ao,
|
|
974
974
|
navigator: we,
|
|
@@ -1060,7 +1060,7 @@ const qt = {
|
|
|
1060
1060
|
return JSON.parse(e, this.parseReviver);
|
|
1061
1061
|
} catch (f) {
|
|
1062
1062
|
if (c)
|
|
1063
|
-
throw f.name === "SyntaxError" ?
|
|
1063
|
+
throw f.name === "SyntaxError" ? N.from(f, N.ERR_BAD_RESPONSE, this, null, this.response) : f;
|
|
1064
1064
|
}
|
|
1065
1065
|
}
|
|
1066
1066
|
return e;
|
|
@@ -1117,7 +1117,7 @@ const mo = y.toObjectSet([
|
|
|
1117
1117
|
s = c.indexOf(":"), n = c.substring(0, s).trim().toLowerCase(), r = c.substring(s + 1).trim(), !(!n || e[n] && mo[n]) && (n === "set-cookie" ? e[n] ? e[n].push(r) : e[n] = [r] : e[n] = e[n] ? e[n] + ", " + r : r);
|
|
1118
1118
|
}), e;
|
|
1119
1119
|
}, He = Symbol("internals");
|
|
1120
|
-
function
|
|
1120
|
+
function At(t) {
|
|
1121
1121
|
return t && String(t).trim().toLowerCase();
|
|
1122
1122
|
}
|
|
1123
1123
|
function zt(t) {
|
|
@@ -1162,7 +1162,7 @@ let tt = class {
|
|
|
1162
1162
|
set(e, n, r) {
|
|
1163
1163
|
const s = this;
|
|
1164
1164
|
function o(f, d, h) {
|
|
1165
|
-
const l =
|
|
1165
|
+
const l = At(d);
|
|
1166
1166
|
if (!l)
|
|
1167
1167
|
throw new Error("header name must be a non-empty string");
|
|
1168
1168
|
const v = y.findKey(s, l);
|
|
@@ -1186,7 +1186,7 @@ let tt = class {
|
|
|
1186
1186
|
return this;
|
|
1187
1187
|
}
|
|
1188
1188
|
get(e, n) {
|
|
1189
|
-
if (e =
|
|
1189
|
+
if (e = At(e), e) {
|
|
1190
1190
|
const r = y.findKey(this, e);
|
|
1191
1191
|
if (r) {
|
|
1192
1192
|
const s = this[r];
|
|
@@ -1203,7 +1203,7 @@ let tt = class {
|
|
|
1203
1203
|
}
|
|
1204
1204
|
}
|
|
1205
1205
|
has(e, n) {
|
|
1206
|
-
if (e =
|
|
1206
|
+
if (e = At(e), e) {
|
|
1207
1207
|
const r = y.findKey(this, e);
|
|
1208
1208
|
return !!(r && this[r] !== void 0 && (!n || oe(this, this[r], r, n)));
|
|
1209
1209
|
}
|
|
@@ -1213,7 +1213,7 @@ let tt = class {
|
|
|
1213
1213
|
const r = this;
|
|
1214
1214
|
let s = !1;
|
|
1215
1215
|
function o(c) {
|
|
1216
|
-
if (c =
|
|
1216
|
+
if (c = At(c), c) {
|
|
1217
1217
|
const f = y.findKey(r, c);
|
|
1218
1218
|
f && (!n || oe(r, r[f], f, n)) && (delete r[f], s = !0);
|
|
1219
1219
|
}
|
|
@@ -1275,7 +1275,7 @@ let tt = class {
|
|
|
1275
1275
|
accessors: {}
|
|
1276
1276
|
}).accessors, s = this.prototype;
|
|
1277
1277
|
function o(c) {
|
|
1278
|
-
const f =
|
|
1278
|
+
const f = At(c);
|
|
1279
1279
|
r[f] || (wo(s, c), r[f] = !0);
|
|
1280
1280
|
}
|
|
1281
1281
|
return y.isArray(e) ? e.forEach(o) : o(e), this;
|
|
@@ -1299,20 +1299,20 @@ function ae(t, e) {
|
|
|
1299
1299
|
o = f.call(n, o, s.normalize(), e ? e.status : void 0);
|
|
1300
1300
|
}), s.normalize(), o;
|
|
1301
1301
|
}
|
|
1302
|
-
function
|
|
1302
|
+
function Nn(t) {
|
|
1303
1303
|
return !!(t && t.__CANCEL__);
|
|
1304
1304
|
}
|
|
1305
1305
|
function Ot(t, e, n) {
|
|
1306
|
-
|
|
1306
|
+
N.call(this, t ?? "canceled", N.ERR_CANCELED, e, n), this.name = "CanceledError";
|
|
1307
1307
|
}
|
|
1308
|
-
y.inherits(Ot,
|
|
1308
|
+
y.inherits(Ot, N, {
|
|
1309
1309
|
__CANCEL__: !0
|
|
1310
1310
|
});
|
|
1311
|
-
function
|
|
1311
|
+
function Mn(t, e, n) {
|
|
1312
1312
|
const r = n.config.validateStatus;
|
|
1313
|
-
!n.status || !r || r(n.status) ? t(n) : e(new
|
|
1313
|
+
!n.status || !r || r(n.status) ? t(n) : e(new N(
|
|
1314
1314
|
"Request failed with status code " + n.status,
|
|
1315
|
-
[
|
|
1315
|
+
[N.ERR_BAD_REQUEST, N.ERR_BAD_RESPONSE][Math.floor(n.status / 100) - 4],
|
|
1316
1316
|
n.config,
|
|
1317
1317
|
n.request,
|
|
1318
1318
|
n
|
|
@@ -1322,7 +1322,7 @@ function vo(t) {
|
|
|
1322
1322
|
const e = /^([-+\w]{1,25})(:?\/\/|:)/.exec(t);
|
|
1323
1323
|
return e && e[1] || "";
|
|
1324
1324
|
}
|
|
1325
|
-
function
|
|
1325
|
+
function Eo(t, e) {
|
|
1326
1326
|
t = t || 10;
|
|
1327
1327
|
const n = new Array(t), r = new Array(t);
|
|
1328
1328
|
let s = 0, o = 0, c;
|
|
@@ -1338,7 +1338,7 @@ function To(t, e) {
|
|
|
1338
1338
|
return I ? Math.round(O * 1e3 / I) : void 0;
|
|
1339
1339
|
};
|
|
1340
1340
|
}
|
|
1341
|
-
function
|
|
1341
|
+
function To(t, e) {
|
|
1342
1342
|
let n = 0, r = 1e3 / e, s, o;
|
|
1343
1343
|
const c = (h, l = Date.now()) => {
|
|
1344
1344
|
n = l, s = null, o && (clearTimeout(o), o = null), t(...h);
|
|
@@ -1350,10 +1350,10 @@ function Eo(t, e) {
|
|
|
1350
1350
|
}, r - v)));
|
|
1351
1351
|
}, () => s && c(s)];
|
|
1352
1352
|
}
|
|
1353
|
-
const
|
|
1353
|
+
const Kt = (t, e, n = 3) => {
|
|
1354
1354
|
let r = 0;
|
|
1355
|
-
const s =
|
|
1356
|
-
return
|
|
1355
|
+
const s = Eo(50, 250);
|
|
1356
|
+
return To((o) => {
|
|
1357
1357
|
const c = o.loaded, f = o.lengthComputable ? o.total : void 0, d = c - r, h = s(d), l = c <= f;
|
|
1358
1358
|
r = c;
|
|
1359
1359
|
const v = {
|
|
@@ -1502,7 +1502,7 @@ const Ln = (t) => {
|
|
|
1502
1502
|
d && c.set(s, d);
|
|
1503
1503
|
}
|
|
1504
1504
|
return e;
|
|
1505
|
-
},
|
|
1505
|
+
}, _o = typeof XMLHttpRequest < "u", Ao = _o && function(t) {
|
|
1506
1506
|
return new Promise(function(n, r) {
|
|
1507
1507
|
const s = Ln(t);
|
|
1508
1508
|
let o = s.data;
|
|
@@ -1513,7 +1513,7 @@ const Ln = (t) => {
|
|
|
1513
1513
|
}
|
|
1514
1514
|
let m = new XMLHttpRequest();
|
|
1515
1515
|
m.open(s.method.toUpperCase(), s.url, !0), m.timeout = s.timeout;
|
|
1516
|
-
function
|
|
1516
|
+
function E() {
|
|
1517
1517
|
if (!m)
|
|
1518
1518
|
return;
|
|
1519
1519
|
const g = tt.from(
|
|
@@ -1526,36 +1526,36 @@ const Ln = (t) => {
|
|
|
1526
1526
|
config: t,
|
|
1527
1527
|
request: m
|
|
1528
1528
|
};
|
|
1529
|
-
|
|
1529
|
+
Mn(function(C) {
|
|
1530
1530
|
n(C), F();
|
|
1531
1531
|
}, function(C) {
|
|
1532
1532
|
r(C), F();
|
|
1533
1533
|
}, x), m = null;
|
|
1534
1534
|
}
|
|
1535
|
-
"onloadend" in m ? m.onloadend =
|
|
1536
|
-
!m || m.readyState !== 4 || m.status === 0 && !(m.responseURL && m.responseURL.indexOf("file:") === 0) || setTimeout(
|
|
1535
|
+
"onloadend" in m ? m.onloadend = E : m.onreadystatechange = function() {
|
|
1536
|
+
!m || m.readyState !== 4 || m.status === 0 && !(m.responseURL && m.responseURL.indexOf("file:") === 0) || setTimeout(E);
|
|
1537
1537
|
}, m.onabort = function() {
|
|
1538
|
-
m && (r(new
|
|
1538
|
+
m && (r(new N("Request aborted", N.ECONNABORTED, t, m)), m = null);
|
|
1539
1539
|
}, m.onerror = function(S) {
|
|
1540
|
-
const x = S && S.message ? S.message : "Network Error",
|
|
1541
|
-
|
|
1540
|
+
const x = S && S.message ? S.message : "Network Error", _ = new N(x, N.ERR_NETWORK, t, m);
|
|
1541
|
+
_.event = S || null, r(_), m = null;
|
|
1542
1542
|
}, m.ontimeout = function() {
|
|
1543
1543
|
let S = s.timeout ? "timeout of " + s.timeout + "ms exceeded" : "timeout exceeded";
|
|
1544
1544
|
const x = s.transitional || qn;
|
|
1545
|
-
s.timeoutErrorMessage && (S = s.timeoutErrorMessage), r(new
|
|
1545
|
+
s.timeoutErrorMessage && (S = s.timeoutErrorMessage), r(new N(
|
|
1546
1546
|
S,
|
|
1547
|
-
x.clarifyTimeoutError ?
|
|
1547
|
+
x.clarifyTimeoutError ? N.ETIMEDOUT : N.ECONNABORTED,
|
|
1548
1548
|
t,
|
|
1549
1549
|
m
|
|
1550
1550
|
)), m = null;
|
|
1551
1551
|
}, o === void 0 && c.setContentType(null), "setRequestHeader" in m && y.forEach(c.toJSON(), function(S, x) {
|
|
1552
1552
|
m.setRequestHeader(x, S);
|
|
1553
|
-
}), y.isUndefined(s.withCredentials) || (m.withCredentials = !!s.withCredentials), f && f !== "json" && (m.responseType = s.responseType), h && ([O, w] =
|
|
1553
|
+
}), y.isUndefined(s.withCredentials) || (m.withCredentials = !!s.withCredentials), f && f !== "json" && (m.responseType = s.responseType), h && ([O, w] = Kt(h, !0), m.addEventListener("progress", O)), d && m.upload && ([v, I] = Kt(d), m.upload.addEventListener("progress", v), m.upload.addEventListener("loadend", I)), (s.cancelToken || s.signal) && (l = (g) => {
|
|
1554
1554
|
m && (r(!g || g.type ? new Ot(null, t, m) : g), m.abort(), m = null);
|
|
1555
1555
|
}, s.cancelToken && s.cancelToken.subscribe(l), s.signal && (s.signal.aborted ? l() : s.signal.addEventListener("abort", l)));
|
|
1556
1556
|
const b = vo(s.url);
|
|
1557
1557
|
if (b && W.protocols.indexOf(b) === -1) {
|
|
1558
|
-
r(new
|
|
1558
|
+
r(new N("Unsupported protocol " + b + ":", N.ERR_BAD_REQUEST, t));
|
|
1559
1559
|
return;
|
|
1560
1560
|
}
|
|
1561
1561
|
m.send(o || null);
|
|
@@ -1568,11 +1568,11 @@ const Ln = (t) => {
|
|
|
1568
1568
|
if (!s) {
|
|
1569
1569
|
s = !0, f();
|
|
1570
1570
|
const l = h instanceof Error ? h : this.reason;
|
|
1571
|
-
r.abort(l instanceof
|
|
1571
|
+
r.abort(l instanceof N ? l : new Ot(l instanceof Error ? l.message : l));
|
|
1572
1572
|
}
|
|
1573
1573
|
};
|
|
1574
1574
|
let c = e && setTimeout(() => {
|
|
1575
|
-
c = null, o(new
|
|
1575
|
+
c = null, o(new N(`timeout ${e} of ms exceeded`, N.ETIMEDOUT));
|
|
1576
1576
|
}, e);
|
|
1577
1577
|
const f = () => {
|
|
1578
1578
|
t && (c && clearTimeout(c), c = null, t.forEach((h) => {
|
|
@@ -1611,7 +1611,7 @@ const Ln = (t) => {
|
|
|
1611
1611
|
} finally {
|
|
1612
1612
|
await e.cancel();
|
|
1613
1613
|
}
|
|
1614
|
-
},
|
|
1614
|
+
}, Ye = (t, e, n, r) => {
|
|
1615
1615
|
const s = Co(t, e);
|
|
1616
1616
|
let o = 0, c, f = (d) => {
|
|
1617
1617
|
c || (c = !0, r && r(d));
|
|
@@ -1640,11 +1640,11 @@ const Ln = (t) => {
|
|
|
1640
1640
|
}, {
|
|
1641
1641
|
highWaterMark: 2
|
|
1642
1642
|
});
|
|
1643
|
-
},
|
|
1643
|
+
}, Ke = 64 * 1024, { isFunction: Lt } = y, qo = (({ Request: t, Response: e }) => ({
|
|
1644
1644
|
Request: t,
|
|
1645
1645
|
Response: e
|
|
1646
1646
|
}))(y.global), {
|
|
1647
|
-
ReadableStream:
|
|
1647
|
+
ReadableStream: Ve,
|
|
1648
1648
|
TextEncoder: Je
|
|
1649
1649
|
} = y.global, We = (t, ...e) => {
|
|
1650
1650
|
try {
|
|
@@ -1659,10 +1659,10 @@ const Ln = (t) => {
|
|
|
1659
1659
|
const { fetch: e, Request: n, Response: r } = t, s = e ? Lt(e) : typeof fetch == "function", o = Lt(n), c = Lt(r);
|
|
1660
1660
|
if (!s)
|
|
1661
1661
|
return !1;
|
|
1662
|
-
const f = s && Lt(
|
|
1662
|
+
const f = s && Lt(Ve), d = s && (typeof Je == "function" ? /* @__PURE__ */ ((w) => (F) => w.encode(F))(new Je()) : async (w) => new Uint8Array(await new n(w).arrayBuffer())), h = o && f && We(() => {
|
|
1663
1663
|
let w = !1;
|
|
1664
1664
|
const F = new n(W.origin, {
|
|
1665
|
-
body: new
|
|
1665
|
+
body: new Ve(),
|
|
1666
1666
|
method: "POST",
|
|
1667
1667
|
get duplex() {
|
|
1668
1668
|
return w = !0, "half";
|
|
@@ -1674,10 +1674,10 @@ const Ln = (t) => {
|
|
|
1674
1674
|
};
|
|
1675
1675
|
s && ["text", "arrayBuffer", "blob", "formData", "stream"].forEach((w) => {
|
|
1676
1676
|
!v[w] && (v[w] = (F, m) => {
|
|
1677
|
-
let
|
|
1678
|
-
if (
|
|
1679
|
-
return
|
|
1680
|
-
throw new
|
|
1677
|
+
let E = F && F[w];
|
|
1678
|
+
if (E)
|
|
1679
|
+
return E.call(F);
|
|
1680
|
+
throw new N(`Response type '${w}' is not supported`, N.ERR_NOT_SUPPORT, m);
|
|
1681
1681
|
});
|
|
1682
1682
|
});
|
|
1683
1683
|
const O = async (w) => {
|
|
@@ -1702,15 +1702,15 @@ const Ln = (t) => {
|
|
|
1702
1702
|
let {
|
|
1703
1703
|
url: F,
|
|
1704
1704
|
method: m,
|
|
1705
|
-
data:
|
|
1705
|
+
data: E,
|
|
1706
1706
|
signal: b,
|
|
1707
1707
|
cancelToken: g,
|
|
1708
1708
|
timeout: S,
|
|
1709
1709
|
onDownloadProgress: x,
|
|
1710
|
-
onUploadProgress:
|
|
1710
|
+
onUploadProgress: _,
|
|
1711
1711
|
responseType: C,
|
|
1712
1712
|
headers: P,
|
|
1713
|
-
withCredentials:
|
|
1713
|
+
withCredentials: M = "same-origin",
|
|
1714
1714
|
fetchOptions: H
|
|
1715
1715
|
} = Ln(w), q = e || fetch;
|
|
1716
1716
|
C = C ? (C + "").toLowerCase() : "text";
|
|
@@ -1720,29 +1720,29 @@ const Ln = (t) => {
|
|
|
1720
1720
|
});
|
|
1721
1721
|
let J;
|
|
1722
1722
|
try {
|
|
1723
|
-
if (
|
|
1723
|
+
if (_ && h && m !== "get" && m !== "head" && (J = await I(P, E)) !== 0) {
|
|
1724
1724
|
let et = new n(F, {
|
|
1725
1725
|
method: "POST",
|
|
1726
|
-
body:
|
|
1726
|
+
body: E,
|
|
1727
1727
|
duplex: "half"
|
|
1728
1728
|
}), D;
|
|
1729
|
-
if (y.isFormData(
|
|
1730
|
-
const [Ft,
|
|
1729
|
+
if (y.isFormData(E) && (D = et.headers.get("content-type")) && P.setContentType(D), et.body) {
|
|
1730
|
+
const [Ft, Et] = ze(
|
|
1731
1731
|
J,
|
|
1732
|
-
|
|
1732
|
+
Kt(je(_))
|
|
1733
1733
|
);
|
|
1734
|
-
|
|
1734
|
+
E = Ye(et.body, Ke, Ft, Et);
|
|
1735
1735
|
}
|
|
1736
1736
|
}
|
|
1737
|
-
y.isString(
|
|
1738
|
-
const
|
|
1737
|
+
y.isString(M) || (M = M ? "include" : "omit");
|
|
1738
|
+
const Y = o && "credentials" in n.prototype, X = {
|
|
1739
1739
|
...H,
|
|
1740
1740
|
signal: k,
|
|
1741
1741
|
method: m.toUpperCase(),
|
|
1742
1742
|
headers: P.normalize().toJSON(),
|
|
1743
|
-
body:
|
|
1743
|
+
body: E,
|
|
1744
1744
|
duplex: "half",
|
|
1745
|
-
credentials:
|
|
1745
|
+
credentials: Y ? M : void 0
|
|
1746
1746
|
};
|
|
1747
1747
|
L = o && new n(F, X);
|
|
1748
1748
|
let Z = await (o ? q(L, H) : q(F, X));
|
|
@@ -1752,13 +1752,13 @@ const Ln = (t) => {
|
|
|
1752
1752
|
["status", "statusText", "headers"].forEach((Pt) => {
|
|
1753
1753
|
et[Pt] = Z[Pt];
|
|
1754
1754
|
});
|
|
1755
|
-
const D = y.toFiniteNumber(Z.headers.get("content-length")), [Ft,
|
|
1755
|
+
const D = y.toFiniteNumber(Z.headers.get("content-length")), [Ft, Et] = x && ze(
|
|
1756
1756
|
D,
|
|
1757
|
-
|
|
1757
|
+
Kt(je(x), !0)
|
|
1758
1758
|
) || [];
|
|
1759
1759
|
Z = new r(
|
|
1760
|
-
|
|
1761
|
-
|
|
1760
|
+
Ye(Z.body, Ke, Ft, () => {
|
|
1761
|
+
Et && Et(), U && U();
|
|
1762
1762
|
}),
|
|
1763
1763
|
et
|
|
1764
1764
|
);
|
|
@@ -1766,7 +1766,7 @@ const Ln = (t) => {
|
|
|
1766
1766
|
C = C || "text";
|
|
1767
1767
|
let vt = await v[y.findKey(v, C) || "text"](Z, w);
|
|
1768
1768
|
return !pt && U && U(), await new Promise((et, D) => {
|
|
1769
|
-
|
|
1769
|
+
Mn(et, D, {
|
|
1770
1770
|
data: vt,
|
|
1771
1771
|
headers: tt.from(Z.headers),
|
|
1772
1772
|
status: Z.status,
|
|
@@ -1775,23 +1775,23 @@ const Ln = (t) => {
|
|
|
1775
1775
|
request: L
|
|
1776
1776
|
});
|
|
1777
1777
|
});
|
|
1778
|
-
} catch (
|
|
1779
|
-
throw U && U(),
|
|
1780
|
-
new
|
|
1778
|
+
} catch (Y) {
|
|
1779
|
+
throw U && U(), Y && Y.name === "TypeError" && /Load failed|fetch/i.test(Y.message) ? Object.assign(
|
|
1780
|
+
new N("Network Error", N.ERR_NETWORK, w, L),
|
|
1781
1781
|
{
|
|
1782
|
-
cause:
|
|
1782
|
+
cause: Y.cause || Y
|
|
1783
1783
|
}
|
|
1784
|
-
) :
|
|
1784
|
+
) : N.from(Y, Y && Y.code, w, L);
|
|
1785
1785
|
}
|
|
1786
1786
|
};
|
|
1787
|
-
},
|
|
1787
|
+
}, No = /* @__PURE__ */ new Map(), Un = (t) => {
|
|
1788
1788
|
let e = t ? t.env : {};
|
|
1789
1789
|
const { fetch: n, Request: r, Response: s } = e, o = [
|
|
1790
1790
|
r,
|
|
1791
1791
|
s,
|
|
1792
1792
|
n
|
|
1793
1793
|
];
|
|
1794
|
-
let c = o.length, f = c, d, h, l =
|
|
1794
|
+
let c = o.length, f = c, d, h, l = No;
|
|
1795
1795
|
for (; f--; )
|
|
1796
1796
|
d = o[f], h = l.get(d), h === void 0 && l.set(d, h = f ? /* @__PURE__ */ new Map() : Po(e)), l = h;
|
|
1797
1797
|
return h;
|
|
@@ -1799,7 +1799,7 @@ const Ln = (t) => {
|
|
|
1799
1799
|
Un();
|
|
1800
1800
|
const ve = {
|
|
1801
1801
|
http: Xi,
|
|
1802
|
-
xhr:
|
|
1802
|
+
xhr: Ao,
|
|
1803
1803
|
fetch: {
|
|
1804
1804
|
get: Un
|
|
1805
1805
|
}
|
|
@@ -1813,7 +1813,7 @@ y.forEach(ve, (t, e) => {
|
|
|
1813
1813
|
Object.defineProperty(t, "adapterName", { value: e });
|
|
1814
1814
|
}
|
|
1815
1815
|
});
|
|
1816
|
-
const Ze = (t) => `- ${t}`,
|
|
1816
|
+
const Ze = (t) => `- ${t}`, Mo = (t) => y.isFunction(t) || t === null || t === !1, Hn = {
|
|
1817
1817
|
getAdapter: (t, e) => {
|
|
1818
1818
|
t = y.isArray(t) ? t : [t];
|
|
1819
1819
|
const { length: n } = t;
|
|
@@ -1822,8 +1822,8 @@ const Ze = (t) => `- ${t}`, No = (t) => y.isFunction(t) || t === null || t === !
|
|
|
1822
1822
|
for (let c = 0; c < n; c++) {
|
|
1823
1823
|
r = t[c];
|
|
1824
1824
|
let f;
|
|
1825
|
-
if (s = r, !
|
|
1826
|
-
throw new
|
|
1825
|
+
if (s = r, !Mo(r) && (s = ve[(f = String(r)).toLowerCase()], s === void 0))
|
|
1826
|
+
throw new N(`Unknown adapter '${f}'`);
|
|
1827
1827
|
if (s && (y.isFunction(s) || (s = s.get(e))))
|
|
1828
1828
|
break;
|
|
1829
1829
|
o[f || "#" + c] = s;
|
|
@@ -1835,7 +1835,7 @@ const Ze = (t) => `- ${t}`, No = (t) => y.isFunction(t) || t === null || t === !
|
|
|
1835
1835
|
let f = n ? c.length > 1 ? `since :
|
|
1836
1836
|
` + c.map(Ze).join(`
|
|
1837
1837
|
`) : " " + Ze(c[0]) : "as no adapter specified";
|
|
1838
|
-
throw new
|
|
1838
|
+
throw new N(
|
|
1839
1839
|
"There is no suitable adapter to dispatch the request " + f,
|
|
1840
1840
|
"ERR_NOT_SUPPORT"
|
|
1841
1841
|
);
|
|
@@ -1859,7 +1859,7 @@ function Ge(t) {
|
|
|
1859
1859
|
r
|
|
1860
1860
|
), r.headers = tt.from(r.headers), r;
|
|
1861
1861
|
}, function(r) {
|
|
1862
|
-
return
|
|
1862
|
+
return Nn(r) || (ce(t), r && r.response && (r.response.data = ae.call(
|
|
1863
1863
|
t,
|
|
1864
1864
|
t.transformResponse,
|
|
1865
1865
|
r.response
|
|
@@ -1879,9 +1879,9 @@ Qt.transitional = function(e, n, r) {
|
|
|
1879
1879
|
}
|
|
1880
1880
|
return (o, c, f) => {
|
|
1881
1881
|
if (e === !1)
|
|
1882
|
-
throw new
|
|
1882
|
+
throw new N(
|
|
1883
1883
|
s(c, " has been removed" + (n ? " in " + n : "")),
|
|
1884
|
-
|
|
1884
|
+
N.ERR_DEPRECATED
|
|
1885
1885
|
);
|
|
1886
1886
|
return n && !Xe[c] && (Xe[c] = !0, console.warn(
|
|
1887
1887
|
s(
|
|
@@ -1896,7 +1896,7 @@ Qt.spelling = function(e) {
|
|
|
1896
1896
|
};
|
|
1897
1897
|
function ko(t, e, n) {
|
|
1898
1898
|
if (typeof t != "object")
|
|
1899
|
-
throw new
|
|
1899
|
+
throw new N("options must be an object", N.ERR_BAD_OPTION_VALUE);
|
|
1900
1900
|
const r = Object.keys(t);
|
|
1901
1901
|
let s = r.length;
|
|
1902
1902
|
for (; s-- > 0; ) {
|
|
@@ -1904,11 +1904,11 @@ function ko(t, e, n) {
|
|
|
1904
1904
|
if (c) {
|
|
1905
1905
|
const f = t[o], d = f === void 0 || c(f, o, t);
|
|
1906
1906
|
if (d !== !0)
|
|
1907
|
-
throw new
|
|
1907
|
+
throw new N("option " + o + " must be " + d, N.ERR_BAD_OPTION_VALUE);
|
|
1908
1908
|
continue;
|
|
1909
1909
|
}
|
|
1910
1910
|
if (n !== !0)
|
|
1911
|
-
throw new
|
|
1911
|
+
throw new N("Unknown option " + o, N.ERR_BAD_OPTION);
|
|
1912
1912
|
}
|
|
1913
1913
|
}
|
|
1914
1914
|
const jt = {
|
|
@@ -2120,7 +2120,7 @@ function Uo(t) {
|
|
|
2120
2120
|
function Ho(t) {
|
|
2121
2121
|
return y.isObject(t) && t.isAxiosError === !0;
|
|
2122
2122
|
}
|
|
2123
|
-
const
|
|
2123
|
+
const Ee = {
|
|
2124
2124
|
Continue: 100,
|
|
2125
2125
|
SwitchingProtocols: 101,
|
|
2126
2126
|
Processing: 102,
|
|
@@ -2185,8 +2185,8 @@ const Te = {
|
|
|
2185
2185
|
NotExtended: 510,
|
|
2186
2186
|
NetworkAuthenticationRequired: 511
|
|
2187
2187
|
};
|
|
2188
|
-
Object.entries(
|
|
2189
|
-
|
|
2188
|
+
Object.entries(Ee).forEach(([t, e]) => {
|
|
2189
|
+
Ee[e] = t;
|
|
2190
2190
|
});
|
|
2191
2191
|
function $n(t) {
|
|
2192
2192
|
const e = new bt(t), n = vn(bt.prototype.request, e);
|
|
@@ -2198,10 +2198,10 @@ const $ = $n(qt);
|
|
|
2198
2198
|
$.Axios = bt;
|
|
2199
2199
|
$.CanceledError = Ot;
|
|
2200
2200
|
$.CancelToken = Lo;
|
|
2201
|
-
$.isCancel =
|
|
2201
|
+
$.isCancel = Nn;
|
|
2202
2202
|
$.VERSION = zn;
|
|
2203
2203
|
$.toFormData = Xt;
|
|
2204
|
-
$.AxiosError =
|
|
2204
|
+
$.AxiosError = N;
|
|
2205
2205
|
$.Cancel = $.CanceledError;
|
|
2206
2206
|
$.all = function(e) {
|
|
2207
2207
|
return Promise.all(e);
|
|
@@ -2212,10 +2212,10 @@ $.mergeConfig = wt;
|
|
|
2212
2212
|
$.AxiosHeaders = tt;
|
|
2213
2213
|
$.formToJSON = (t) => Pn(y.isHTMLForm(t) ? new FormData(t) : t);
|
|
2214
2214
|
$.getAdapter = Hn.getAdapter;
|
|
2215
|
-
$.HttpStatusCode =
|
|
2215
|
+
$.HttpStatusCode = Ee;
|
|
2216
2216
|
$.default = $;
|
|
2217
2217
|
const {
|
|
2218
|
-
Axios:
|
|
2218
|
+
Axios: Va,
|
|
2219
2219
|
AxiosError: Ja,
|
|
2220
2220
|
CanceledError: Wa,
|
|
2221
2221
|
isCancel: Za,
|
|
@@ -2262,12 +2262,14 @@ class zo {
|
|
|
2262
2262
|
}
|
|
2263
2263
|
}
|
|
2264
2264
|
class jo {
|
|
2265
|
-
constructor() {
|
|
2266
|
-
z(this, "TOKEN_KEY"
|
|
2267
|
-
z(this, "REFRESH_TOKEN_KEY"
|
|
2268
|
-
z(this, "TOKEN_EXPIRES_KEY"
|
|
2265
|
+
constructor(e = {}) {
|
|
2266
|
+
z(this, "TOKEN_KEY");
|
|
2267
|
+
z(this, "REFRESH_TOKEN_KEY");
|
|
2268
|
+
z(this, "TOKEN_EXPIRES_KEY");
|
|
2269
2269
|
z(this, "isRefreshing", !1);
|
|
2270
2270
|
z(this, "refreshSubscribers", []);
|
|
2271
|
+
const { TOKEN_KEY: n, REFRESH_TOKEN_KEY: r, TOKEN_EXPIRES_KEY: s } = e;
|
|
2272
|
+
this.TOKEN_KEY = n || "__AUTH_TOKEN", this.REFRESH_TOKEN_KEY = r || "__REFRESH_TOKEN", this.TOKEN_EXPIRES_KEY = s || "__TOKEN_EXPIRES_AT";
|
|
2271
2273
|
}
|
|
2272
2274
|
setToken({ accessToken: e, refreshToken: n, expiresIn: r }) {
|
|
2273
2275
|
if (ct.set(this.TOKEN_KEY, e), n && ct.set(this.REFRESH_TOKEN_KEY, n), r) {
|
|
@@ -2350,7 +2352,7 @@ class $o {
|
|
|
2350
2352
|
$.isAxiosError(e) ? e.response ? this.handleStatusError(e.response.status, ((r = e.response.data) == null ? void 0 : r.message) || e.message, n) : this.handleNetworkError(e, n) : (n && this.toastInstance.error((e == null ? void 0 : e.message) || "发生未知错误"), console.error("[Error]:", e));
|
|
2351
2353
|
}
|
|
2352
2354
|
}
|
|
2353
|
-
class
|
|
2355
|
+
class Yo {
|
|
2354
2356
|
constructor(e) {
|
|
2355
2357
|
z(this, "toastInstance");
|
|
2356
2358
|
z(this, "status", navigator.onLine ? "online" : "offline");
|
|
@@ -2441,8 +2443,8 @@ class uc {
|
|
|
2441
2443
|
"Content-Type": "application/json;charset=utf-8"
|
|
2442
2444
|
}
|
|
2443
2445
|
});
|
|
2444
|
-
const { config: n = {}, requestOptions: r = {}, toastInstance: s, loadingInstance: o } = e;
|
|
2445
|
-
this.errorInstance = new $o(s), this.networkInstance = new
|
|
2446
|
+
const { config: n = {}, requestOptions: r = {}, toastInstance: s, loadingInstance: o, tokenKeys: c } = e;
|
|
2447
|
+
this.errorInstance = new $o(s), this.networkInstance = new Yo(s), this.cancelInstance = new zo(), this.tokenInstance = new jo(c), o && (this.loadingInstance = o), this.requestOptions = { ...this.defaultRequestOptions, ...r }, this.axiosInstance = $.create({
|
|
2446
2448
|
...this.defaultConfig,
|
|
2447
2449
|
...n
|
|
2448
2450
|
}), this.setupInterceptors(), this.setupNetworkListener();
|
|
@@ -2497,7 +2499,7 @@ class uc {
|
|
|
2497
2499
|
return e.data;
|
|
2498
2500
|
},
|
|
2499
2501
|
async (e) => {
|
|
2500
|
-
var w, F, m,
|
|
2502
|
+
var w, F, m, E;
|
|
2501
2503
|
const n = e.config;
|
|
2502
2504
|
if (!n)
|
|
2503
2505
|
return (w = this.loadingInstance) == null || w.forceHide(), Promise.reject(e);
|
|
@@ -2525,7 +2527,7 @@ class uc {
|
|
|
2525
2527
|
} catch (b) {
|
|
2526
2528
|
return Promise.reject(b);
|
|
2527
2529
|
}
|
|
2528
|
-
return e.response && c ? this.errorInstance.handleStatusError(e.response.status, ((
|
|
2530
|
+
return e.response && c ? this.errorInstance.handleStatusError(e.response.status, ((E = e.response.data) == null ? void 0 : E.message) || e.message, o) : e.request ? this.errorInstance.handleNetworkError(e, o) : (this.errorInstance.handleStatusError(909090, e.message, o), console.error("[Request Error]:", e)), Promise.reject(e);
|
|
2529
2531
|
}
|
|
2530
2532
|
);
|
|
2531
2533
|
}
|
|
@@ -2702,7 +2704,7 @@ function lc(t) {
|
|
|
2702
2704
|
const { cacheKey: e, cacheMode: n = "session", saveState: r = !0, handler: s } = t;
|
|
2703
2705
|
return r && yt || (yt = n === "local" ? dn.get(e) : ct.get(e), yt && typeof s == "function" && (yt = s(yt))), yt;
|
|
2704
2706
|
}
|
|
2705
|
-
var
|
|
2707
|
+
var Yn = function() {
|
|
2706
2708
|
if (typeof Map < "u")
|
|
2707
2709
|
return Map;
|
|
2708
2710
|
function t(e, n) {
|
|
@@ -2748,27 +2750,27 @@ var Vn = function() {
|
|
|
2748
2750
|
}, e;
|
|
2749
2751
|
}()
|
|
2750
2752
|
);
|
|
2751
|
-
}(),
|
|
2753
|
+
}(), Te = typeof window < "u" && typeof document < "u" && window.document === document, Vt = function() {
|
|
2752
2754
|
return typeof global < "u" && global.Math === Math ? global : typeof self < "u" && self.Math === Math ? self : typeof window < "u" && window.Math === Math ? window : Function("return this")();
|
|
2753
|
-
}(),
|
|
2754
|
-
return typeof requestAnimationFrame == "function" ? requestAnimationFrame.bind(
|
|
2755
|
+
}(), Ko = function() {
|
|
2756
|
+
return typeof requestAnimationFrame == "function" ? requestAnimationFrame.bind(Vt) : function(t) {
|
|
2755
2757
|
return setTimeout(function() {
|
|
2756
2758
|
return t(Date.now());
|
|
2757
2759
|
}, 1e3 / 60);
|
|
2758
2760
|
};
|
|
2759
|
-
}(),
|
|
2761
|
+
}(), Vo = 2;
|
|
2760
2762
|
function Jo(t, e) {
|
|
2761
2763
|
var n = !1, r = !1, s = 0;
|
|
2762
2764
|
function o() {
|
|
2763
2765
|
n && (n = !1, t()), r && f();
|
|
2764
2766
|
}
|
|
2765
2767
|
function c() {
|
|
2766
|
-
|
|
2768
|
+
Ko(o);
|
|
2767
2769
|
}
|
|
2768
2770
|
function f() {
|
|
2769
2771
|
var d = Date.now();
|
|
2770
2772
|
if (n) {
|
|
2771
|
-
if (d - s <
|
|
2773
|
+
if (d - s < Vo)
|
|
2772
2774
|
return;
|
|
2773
2775
|
r = !0;
|
|
2774
2776
|
} else
|
|
@@ -2799,14 +2801,14 @@ var Wo = 20, Zo = ["top", "right", "bottom", "left", "width", "height", "size",
|
|
|
2799
2801
|
return n.broadcastActive();
|
|
2800
2802
|
}), e.length > 0;
|
|
2801
2803
|
}, t.prototype.connect_ = function() {
|
|
2802
|
-
!
|
|
2804
|
+
!Te || this.connected_ || (document.addEventListener("transitionend", this.onTransitionEnd_), window.addEventListener("resize", this.refresh), Go ? (this.mutationsObserver_ = new MutationObserver(this.refresh), this.mutationsObserver_.observe(document, {
|
|
2803
2805
|
attributes: !0,
|
|
2804
2806
|
childList: !0,
|
|
2805
2807
|
characterData: !0,
|
|
2806
2808
|
subtree: !0
|
|
2807
2809
|
})) : (document.addEventListener("DOMSubtreeModified", this.refresh), this.mutationEventsAdded_ = !0), this.connected_ = !0);
|
|
2808
2810
|
}, t.prototype.disconnect_ = function() {
|
|
2809
|
-
!
|
|
2811
|
+
!Te || !this.connected_ || (document.removeEventListener("transitionend", this.onTransitionEnd_), window.removeEventListener("resize", this.refresh), this.mutationsObserver_ && this.mutationsObserver_.disconnect(), this.mutationEventsAdded_ && document.removeEventListener("DOMSubtreeModified", this.refresh), this.mutationsObserver_ = null, this.mutationEventsAdded_ = !1, this.connected_ = !1);
|
|
2810
2812
|
}, t.prototype.onTransitionEnd_ = function(e) {
|
|
2811
2813
|
var n = e.propertyName, r = n === void 0 ? "" : n, s = Zo.some(function(o) {
|
|
2812
2814
|
return !!~r.indexOf(o);
|
|
@@ -2816,7 +2818,7 @@ var Wo = 20, Zo = ["top", "right", "bottom", "left", "width", "height", "size",
|
|
|
2816
2818
|
return this.instance_ || (this.instance_ = new t()), this.instance_;
|
|
2817
2819
|
}, t.instance_ = null, t;
|
|
2818
2820
|
}()
|
|
2819
|
-
),
|
|
2821
|
+
), Kn = function(t, e) {
|
|
2820
2822
|
for (var n = 0, r = Object.keys(e); n < r.length; n++) {
|
|
2821
2823
|
var s = r[n];
|
|
2822
2824
|
Object.defineProperty(t, s, {
|
|
@@ -2829,8 +2831,8 @@ var Wo = 20, Zo = ["top", "right", "bottom", "left", "width", "height", "size",
|
|
|
2829
2831
|
return t;
|
|
2830
2832
|
}, St = function(t) {
|
|
2831
2833
|
var e = t && t.ownerDocument && t.ownerDocument.defaultView;
|
|
2832
|
-
return e ||
|
|
2833
|
-
},
|
|
2834
|
+
return e || Vt;
|
|
2835
|
+
}, Vn = te(0, 0, 0, 0);
|
|
2834
2836
|
function Jt(t) {
|
|
2835
2837
|
return parseFloat(t) || 0;
|
|
2836
2838
|
}
|
|
@@ -2856,7 +2858,7 @@ function ta(t) {
|
|
|
2856
2858
|
function ea(t) {
|
|
2857
2859
|
var e = t.clientWidth, n = t.clientHeight;
|
|
2858
2860
|
if (!e && !n)
|
|
2859
|
-
return
|
|
2861
|
+
return Vn;
|
|
2860
2862
|
var r = St(t).getComputedStyle(t), s = Qo(r), o = s.left + s.right, c = s.top + s.bottom, f = Jt(r.width), d = Jt(r.height);
|
|
2861
2863
|
if (r.boxSizing === "border-box" && (Math.round(f + o) !== e && (f -= Qe(r, "left", "right") + o), Math.round(d + c) !== n && (d -= Qe(r, "top", "bottom") + c)), !ra(t)) {
|
|
2862
2864
|
var h = Math.round(f + o) - e, l = Math.round(d + c) - n;
|
|
@@ -2875,11 +2877,11 @@ function ra(t) {
|
|
|
2875
2877
|
return t === St(t).document.documentElement;
|
|
2876
2878
|
}
|
|
2877
2879
|
function sa(t) {
|
|
2878
|
-
return
|
|
2880
|
+
return Te ? na(t) ? ta(t) : ea(t) : Vn;
|
|
2879
2881
|
}
|
|
2880
2882
|
function ia(t) {
|
|
2881
2883
|
var e = t.x, n = t.y, r = t.width, s = t.height, o = typeof DOMRectReadOnly < "u" ? DOMRectReadOnly : Object, c = Object.create(o.prototype);
|
|
2882
|
-
return
|
|
2884
|
+
return Kn(c, {
|
|
2883
2885
|
x: e,
|
|
2884
2886
|
y: n,
|
|
2885
2887
|
width: r,
|
|
@@ -2912,7 +2914,7 @@ var oa = (
|
|
|
2912
2914
|
/* @__PURE__ */ function() {
|
|
2913
2915
|
function t(e, n) {
|
|
2914
2916
|
var r = ia(n);
|
|
2915
|
-
|
|
2917
|
+
Kn(this, { target: e, contentRect: r });
|
|
2916
2918
|
}
|
|
2917
2919
|
return t;
|
|
2918
2920
|
}()
|
|
@@ -2920,7 +2922,7 @@ var oa = (
|
|
|
2920
2922
|
/** @class */
|
|
2921
2923
|
function() {
|
|
2922
2924
|
function t(e, n, r) {
|
|
2923
|
-
if (this.activeObservations_ = [], this.observations_ = new
|
|
2925
|
+
if (this.activeObservations_ = [], this.observations_ = new Yn(), typeof e != "function")
|
|
2924
2926
|
throw new TypeError("The callback provided as parameter 1 is not a function.");
|
|
2925
2927
|
this.callback_ = e, this.controller_ = n, this.callbackCtx_ = r;
|
|
2926
2928
|
}
|
|
@@ -2962,7 +2964,7 @@ var oa = (
|
|
|
2962
2964
|
return this.activeObservations_.length > 0;
|
|
2963
2965
|
}, t;
|
|
2964
2966
|
}()
|
|
2965
|
-
), Jn = typeof WeakMap < "u" ? /* @__PURE__ */ new WeakMap() : new
|
|
2967
|
+
), Jn = typeof WeakMap < "u" ? /* @__PURE__ */ new WeakMap() : new Yn(), Wn = (
|
|
2966
2968
|
/** @class */
|
|
2967
2969
|
/* @__PURE__ */ function() {
|
|
2968
2970
|
function t(e) {
|
|
@@ -2987,7 +2989,7 @@ var oa = (
|
|
|
2987
2989
|
};
|
|
2988
2990
|
});
|
|
2989
2991
|
var ua = function() {
|
|
2990
|
-
return typeof
|
|
2992
|
+
return typeof Vt.ResizeObserver < "u" ? Vt.ResizeObserver : Wn;
|
|
2991
2993
|
}();
|
|
2992
2994
|
function fa(t) {
|
|
2993
2995
|
for (const e of t) {
|
|
@@ -3012,26 +3014,26 @@ function ee() {
|
|
|
3012
3014
|
function c() {
|
|
3013
3015
|
return new o(null);
|
|
3014
3016
|
}
|
|
3015
|
-
function f(i, a, u, p,
|
|
3017
|
+
function f(i, a, u, p, T, R) {
|
|
3016
3018
|
for (; --R >= 0; ) {
|
|
3017
|
-
var
|
|
3018
|
-
|
|
3019
|
+
var A = a * this[i++] + u[p] + T;
|
|
3020
|
+
T = Math.floor(A / 67108864), u[p++] = A & 67108863;
|
|
3019
3021
|
}
|
|
3020
|
-
return
|
|
3022
|
+
return T;
|
|
3021
3023
|
}
|
|
3022
|
-
function d(i, a, u, p,
|
|
3023
|
-
for (var
|
|
3024
|
-
var j = this[i] & 32767,
|
|
3025
|
-
j =
|
|
3024
|
+
function d(i, a, u, p, T, R) {
|
|
3025
|
+
for (var A = a & 32767, B = a >> 15; --R >= 0; ) {
|
|
3026
|
+
var j = this[i] & 32767, V = this[i++] >> 15, st = B * j + V * A;
|
|
3027
|
+
j = A * j + ((st & 32767) << 15) + u[p] + (T & 1073741823), T = (j >>> 30) + (st >>> 15) + B * V + (T >>> 30), u[p++] = j & 1073741823;
|
|
3026
3028
|
}
|
|
3027
|
-
return
|
|
3029
|
+
return T;
|
|
3028
3030
|
}
|
|
3029
|
-
function h(i, a, u, p,
|
|
3030
|
-
for (var
|
|
3031
|
-
var j = this[i] & 16383,
|
|
3032
|
-
j =
|
|
3031
|
+
function h(i, a, u, p, T, R) {
|
|
3032
|
+
for (var A = a & 16383, B = a >> 14; --R >= 0; ) {
|
|
3033
|
+
var j = this[i] & 16383, V = this[i++] >> 14, st = B * j + V * A;
|
|
3034
|
+
j = A * j + ((st & 16383) << 14) + u[p] + T, T = (j >> 28) + (st >> 14) + B * V, u[p++] = j & 268435455;
|
|
3033
3035
|
}
|
|
3034
|
-
return
|
|
3036
|
+
return T;
|
|
3035
3037
|
}
|
|
3036
3038
|
var l = typeof navigator < "u";
|
|
3037
3039
|
l && s && navigator.appName == "Microsoft Internet Explorer" ? (o.prototype.am = d, n = 30) : l && s && navigator.appName != "Netscape" ? (o.prototype.am = f, n = 26) : (o.prototype.am = h, n = 28), o.prototype.DB = n, o.prototype.DM = (1 << n) - 1, o.prototype.DV = 1 << n;
|
|
@@ -3044,7 +3046,7 @@ function ee() {
|
|
|
3044
3046
|
function m(i) {
|
|
3045
3047
|
return O.charAt(i);
|
|
3046
3048
|
}
|
|
3047
|
-
function
|
|
3049
|
+
function E(i, a) {
|
|
3048
3050
|
var u = I[i.charCodeAt(a)];
|
|
3049
3051
|
return u ?? -1;
|
|
3050
3052
|
}
|
|
@@ -3072,17 +3074,17 @@ function ee() {
|
|
|
3072
3074
|
return;
|
|
3073
3075
|
}
|
|
3074
3076
|
this.t = 0, this.s = 0;
|
|
3075
|
-
for (var p = i.length,
|
|
3076
|
-
var
|
|
3077
|
-
if (
|
|
3078
|
-
i.charAt(p) == "-" && (
|
|
3077
|
+
for (var p = i.length, T = !1, R = 0; --p >= 0; ) {
|
|
3078
|
+
var A = u == 8 ? i[p] & 255 : E(i, p);
|
|
3079
|
+
if (A < 0) {
|
|
3080
|
+
i.charAt(p) == "-" && (T = !0);
|
|
3079
3081
|
continue;
|
|
3080
3082
|
}
|
|
3081
|
-
|
|
3083
|
+
T = !1, R == 0 ? this[this.t++] = A : R + u > this.DB ? (this[this.t - 1] |= (A & (1 << this.DB - R) - 1) << R, this[this.t++] = A >> this.DB - R) : this[this.t - 1] |= A << R, R += u, R >= this.DB && (R -= this.DB);
|
|
3082
3084
|
}
|
|
3083
|
-
u == 8 && (i[0] & 128) != 0 && (this.s = -1, R > 0 && (this[this.t - 1] |= (1 << this.DB - R) - 1 << R)), this.clamp(),
|
|
3085
|
+
u == 8 && (i[0] & 128) != 0 && (this.s = -1, R > 0 && (this[this.t - 1] |= (1 << this.DB - R) - 1 << R)), this.clamp(), T && o.ZERO.subTo(this, this);
|
|
3084
3086
|
}
|
|
3085
|
-
function
|
|
3087
|
+
function _() {
|
|
3086
3088
|
for (var i = this.s & this.DM; this.t > 0 && this[this.t - 1] == i; ) --this.t;
|
|
3087
3089
|
}
|
|
3088
3090
|
function C(i) {
|
|
@@ -3094,17 +3096,17 @@ function ee() {
|
|
|
3094
3096
|
else if (i == 32) a = 5;
|
|
3095
3097
|
else if (i == 4) a = 2;
|
|
3096
3098
|
else return this.toRadix(i);
|
|
3097
|
-
var u = (1 << a) - 1, p,
|
|
3098
|
-
if (
|
|
3099
|
-
for (B < this.DB && (p = this[
|
|
3100
|
-
B < a ? (p = (this[
|
|
3101
|
-
return
|
|
3099
|
+
var u = (1 << a) - 1, p, T = !1, R = "", A = this.t, B = this.DB - A * this.DB % a;
|
|
3100
|
+
if (A-- > 0)
|
|
3101
|
+
for (B < this.DB && (p = this[A] >> B) > 0 && (T = !0, R = m(p)); A >= 0; )
|
|
3102
|
+
B < a ? (p = (this[A] & (1 << B) - 1) << a - B, p |= this[--A] >> (B += this.DB - a)) : (p = this[A] >> (B -= a) & u, B <= 0 && (B += this.DB, --A)), p > 0 && (T = !0), T && (R += m(p));
|
|
3103
|
+
return T ? R : "0";
|
|
3102
3104
|
}
|
|
3103
3105
|
function P() {
|
|
3104
3106
|
var i = c();
|
|
3105
3107
|
return o.ZERO.subTo(this, i), i;
|
|
3106
3108
|
}
|
|
3107
|
-
function
|
|
3109
|
+
function M() {
|
|
3108
3110
|
return this.s < 0 ? this.negate() : this;
|
|
3109
3111
|
}
|
|
3110
3112
|
function H(i) {
|
|
@@ -3133,27 +3135,27 @@ function ee() {
|
|
|
3133
3135
|
a.t = Math.max(this.t - i, 0), a.s = this.s;
|
|
3134
3136
|
}
|
|
3135
3137
|
function J(i, a) {
|
|
3136
|
-
var u = i % this.DB, p = this.DB - u,
|
|
3138
|
+
var u = i % this.DB, p = this.DB - u, T = (1 << p) - 1, R = Math.floor(i / this.DB), A = this.s << u & this.DM, B;
|
|
3137
3139
|
for (B = this.t - 1; B >= 0; --B)
|
|
3138
|
-
a[B + R + 1] = this[B] >> p |
|
|
3140
|
+
a[B + R + 1] = this[B] >> p | A, A = (this[B] & T) << u;
|
|
3139
3141
|
for (B = R - 1; B >= 0; --B) a[B] = 0;
|
|
3140
|
-
a[R] =
|
|
3142
|
+
a[R] = A, a.t = this.t + R + 1, a.s = this.s, a.clamp();
|
|
3141
3143
|
}
|
|
3142
|
-
function
|
|
3144
|
+
function Y(i, a) {
|
|
3143
3145
|
a.s = this.s;
|
|
3144
3146
|
var u = Math.floor(i / this.DB);
|
|
3145
3147
|
if (u >= this.t) {
|
|
3146
3148
|
a.t = 0;
|
|
3147
3149
|
return;
|
|
3148
3150
|
}
|
|
3149
|
-
var p = i % this.DB,
|
|
3151
|
+
var p = i % this.DB, T = this.DB - p, R = (1 << p) - 1;
|
|
3150
3152
|
a[0] = this[u] >> p;
|
|
3151
|
-
for (var
|
|
3152
|
-
a[
|
|
3153
|
-
p > 0 && (a[this.t - u - 1] |= (this.s & R) <<
|
|
3153
|
+
for (var A = u + 1; A < this.t; ++A)
|
|
3154
|
+
a[A - u - 1] |= (this[A] & R) << T, a[A - u] = this[A] >> p;
|
|
3155
|
+
p > 0 && (a[this.t - u - 1] |= (this.s & R) << T), a.t = this.t - u, a.clamp();
|
|
3154
3156
|
}
|
|
3155
3157
|
function X(i, a) {
|
|
3156
|
-
for (var u = 0, p = 0,
|
|
3158
|
+
for (var u = 0, p = 0, T = Math.min(i.t, this.t); u < T; )
|
|
3157
3159
|
p += this[u] - i[u], a[u++] = p & this.DM, p >>= this.DB;
|
|
3158
3160
|
if (i.t < this.t) {
|
|
3159
3161
|
for (p -= i.s; u < this.t; )
|
|
@@ -3167,9 +3169,9 @@ function ee() {
|
|
|
3167
3169
|
a.s = p < 0 ? -1 : 0, p < -1 ? a[u++] = this.DV + p : p > 0 && (a[u++] = p), a.t = u, a.clamp();
|
|
3168
3170
|
}
|
|
3169
3171
|
function Z(i, a) {
|
|
3170
|
-
var u = this.abs(), p = i.abs(),
|
|
3171
|
-
for (a.t =
|
|
3172
|
-
for (
|
|
3172
|
+
var u = this.abs(), p = i.abs(), T = u.t;
|
|
3173
|
+
for (a.t = T + p.t; --T >= 0; ) a[T] = 0;
|
|
3174
|
+
for (T = 0; T < p.t; ++T) a[T + u.t] = u.am(0, p[T], a, T, 0, u.t);
|
|
3173
3175
|
a.s = 0, a.clamp(), this.s != i.s && o.ZERO.subTo(a, a);
|
|
3174
3176
|
}
|
|
3175
3177
|
function pt(i) {
|
|
@@ -3183,24 +3185,24 @@ function ee() {
|
|
|
3183
3185
|
function vt(i, a, u) {
|
|
3184
3186
|
var p = i.abs();
|
|
3185
3187
|
if (!(p.t <= 0)) {
|
|
3186
|
-
var
|
|
3187
|
-
if (
|
|
3188
|
+
var T = this.abs();
|
|
3189
|
+
if (T.t < p.t) {
|
|
3188
3190
|
a != null && a.fromInt(0), u != null && this.copyTo(u);
|
|
3189
3191
|
return;
|
|
3190
3192
|
}
|
|
3191
3193
|
u == null && (u = c());
|
|
3192
|
-
var R = c(),
|
|
3193
|
-
j > 0 ? (p.lShiftTo(j, R),
|
|
3194
|
-
var
|
|
3194
|
+
var R = c(), A = this.s, B = i.s, j = this.DB - q(p[p.t - 1]);
|
|
3195
|
+
j > 0 ? (p.lShiftTo(j, R), T.lShiftTo(j, u)) : (p.copyTo(R), T.copyTo(u));
|
|
3196
|
+
var V = R.t, st = R[V - 1];
|
|
3195
3197
|
if (st != 0) {
|
|
3196
|
-
var rt = st * (1 << this.F1) + (
|
|
3197
|
-
for (R.dlShiftTo(kt, ht), u.compareTo(ht) >= 0 && (u[u.t++] = 1, u.subTo(ht, u)), o.ONE.dlShiftTo(
|
|
3198
|
+
var rt = st * (1 << this.F1) + (V > 1 ? R[V - 2] >> this.F2 : 0), lt = this.FV / rt, Mt = (1 << this.F1) / rt, ot = 1 << this.F2, at = u.t, kt = at - V, ht = a ?? c();
|
|
3199
|
+
for (R.dlShiftTo(kt, ht), u.compareTo(ht) >= 0 && (u[u.t++] = 1, u.subTo(ht, u)), o.ONE.dlShiftTo(V, ht), ht.subTo(R, R); R.t < V; ) R[R.t++] = 0;
|
|
3198
3200
|
for (; --kt >= 0; ) {
|
|
3199
|
-
var ie = u[--at] == st ? this.DM : Math.floor(u[at] * lt + (u[at - 1] + ot) *
|
|
3200
|
-
if ((u[at] += R.am(0, ie, u, kt, 0,
|
|
3201
|
+
var ie = u[--at] == st ? this.DM : Math.floor(u[at] * lt + (u[at - 1] + ot) * Mt);
|
|
3202
|
+
if ((u[at] += R.am(0, ie, u, kt, 0, V)) < ie)
|
|
3201
3203
|
for (R.dlShiftTo(kt, ht), u.subTo(ht, u); u[at] < --ie; ) u.subTo(ht, u);
|
|
3202
3204
|
}
|
|
3203
|
-
a != null && (u.drShiftTo(
|
|
3205
|
+
a != null && (u.drShiftTo(V, a), A != B && o.ZERO.subTo(a, a)), u.t = V, u.clamp(), j > 0 && u.rShiftTo(j, u), A < 0 && o.ZERO.subTo(u, u);
|
|
3204
3206
|
}
|
|
3205
3207
|
}
|
|
3206
3208
|
}
|
|
@@ -3214,7 +3216,7 @@ function ee() {
|
|
|
3214
3216
|
function Ft(i) {
|
|
3215
3217
|
return i.s < 0 || i.compareTo(this.m) >= 0 ? i.mod(this.m) : i;
|
|
3216
3218
|
}
|
|
3217
|
-
function
|
|
3219
|
+
function Et(i) {
|
|
3218
3220
|
return i;
|
|
3219
3221
|
}
|
|
3220
3222
|
function Pt(i) {
|
|
@@ -3226,7 +3228,7 @@ function ee() {
|
|
|
3226
3228
|
function er(i, a) {
|
|
3227
3229
|
i.squareTo(a), this.reduce(a);
|
|
3228
3230
|
}
|
|
3229
|
-
D.prototype.convert = Ft, D.prototype.revert =
|
|
3231
|
+
D.prototype.convert = Ft, D.prototype.revert = Et, D.prototype.reduce = Pt, D.prototype.mulTo = tr, D.prototype.sqrTo = er;
|
|
3230
3232
|
function nr() {
|
|
3231
3233
|
if (this.t < 1) return 0;
|
|
3232
3234
|
var i = this[0];
|
|
@@ -3267,12 +3269,12 @@ function ee() {
|
|
|
3267
3269
|
}
|
|
3268
3270
|
function ur(i, a) {
|
|
3269
3271
|
if (i > 4294967295 || i < 1) return o.ONE;
|
|
3270
|
-
var u = c(), p = c(),
|
|
3271
|
-
for (
|
|
3272
|
-
if (a.sqrTo(u, p), (i & 1 << R) > 0) a.mulTo(p,
|
|
3272
|
+
var u = c(), p = c(), T = a.convert(this), R = q(i) - 1;
|
|
3273
|
+
for (T.copyTo(u); --R >= 0; )
|
|
3274
|
+
if (a.sqrTo(u, p), (i & 1 << R) > 0) a.mulTo(p, T, u);
|
|
3273
3275
|
else {
|
|
3274
|
-
var
|
|
3275
|
-
u = p, p =
|
|
3276
|
+
var A = u;
|
|
3277
|
+
u = p, p = A;
|
|
3276
3278
|
}
|
|
3277
3279
|
return a.revert(u);
|
|
3278
3280
|
}
|
|
@@ -3280,7 +3282,7 @@ function ee() {
|
|
|
3280
3282
|
var u;
|
|
3281
3283
|
return i < 256 || a.isEven() ? u = new D(a) : u = new mt(a), this.exp(i, u);
|
|
3282
3284
|
}
|
|
3283
|
-
o.prototype.copyTo = b, o.prototype.fromInt = g, o.prototype.fromString = x, o.prototype.clamp =
|
|
3285
|
+
o.prototype.copyTo = b, o.prototype.fromInt = g, o.prototype.fromString = x, o.prototype.clamp = _, o.prototype.dlShiftTo = L, o.prototype.drShiftTo = U, o.prototype.lShiftTo = J, o.prototype.rShiftTo = Y, o.prototype.subTo = X, o.prototype.multiplyTo = Z, o.prototype.squareTo = pt, o.prototype.divRemTo = vt, o.prototype.invDigit = nr, o.prototype.isEven = cr, o.prototype.exp = ur, o.prototype.toString = C, o.prototype.negate = P, o.prototype.abs = M, o.prototype.compareTo = H, o.prototype.bitLength = k, o.prototype.mod = et, o.prototype.modPowInt = fr, o.ZERO = S(0), o.ONE = S(1);
|
|
3284
3286
|
function lr() {
|
|
3285
3287
|
var i = c();
|
|
3286
3288
|
return this.copyTo(i), i;
|
|
@@ -3309,22 +3311,22 @@ function ee() {
|
|
|
3309
3311
|
}
|
|
3310
3312
|
function yr(i) {
|
|
3311
3313
|
if (i == null && (i = 10), this.signum() == 0 || i < 2 || i > 36) return "0";
|
|
3312
|
-
var a = this.chunkSize(i), u = Math.pow(i, a), p = S(u),
|
|
3313
|
-
for (this.divRemTo(p,
|
|
3314
|
-
|
|
3315
|
-
return R.intValue().toString(i) +
|
|
3314
|
+
var a = this.chunkSize(i), u = Math.pow(i, a), p = S(u), T = c(), R = c(), A = "";
|
|
3315
|
+
for (this.divRemTo(p, T, R); T.signum() > 0; )
|
|
3316
|
+
A = (u + R.intValue()).toString(i).substr(1) + A, T.divRemTo(p, T, R);
|
|
3317
|
+
return R.intValue().toString(i) + A;
|
|
3316
3318
|
}
|
|
3317
3319
|
function xr(i, a) {
|
|
3318
3320
|
this.fromInt(0), a == null && (a = 10);
|
|
3319
|
-
for (var u = this.chunkSize(a), p = Math.pow(a, u),
|
|
3320
|
-
var j =
|
|
3321
|
+
for (var u = this.chunkSize(a), p = Math.pow(a, u), T = !1, R = 0, A = 0, B = 0; B < i.length; ++B) {
|
|
3322
|
+
var j = E(i, B);
|
|
3321
3323
|
if (j < 0) {
|
|
3322
|
-
i.charAt(B) == "-" && this.signum() == 0 && (
|
|
3324
|
+
i.charAt(B) == "-" && this.signum() == 0 && (T = !0);
|
|
3323
3325
|
continue;
|
|
3324
3326
|
}
|
|
3325
|
-
|
|
3327
|
+
A = a * A + j, ++R >= u && (this.dMultiply(p), this.dAddOffset(A, 0), R = 0, A = 0);
|
|
3326
3328
|
}
|
|
3327
|
-
R > 0 && (this.dMultiply(Math.pow(a, R)), this.dAddOffset(
|
|
3329
|
+
R > 0 && (this.dMultiply(Math.pow(a, R)), this.dAddOffset(A, 0)), T && o.ZERO.subTo(this, this);
|
|
3328
3330
|
}
|
|
3329
3331
|
function br(i, a, u) {
|
|
3330
3332
|
if (typeof a == "number")
|
|
@@ -3333,36 +3335,36 @@ function ee() {
|
|
|
3333
3335
|
for (this.fromNumber(i, u), this.testBit(i - 1) || this.bitwiseTo(o.ONE.shiftLeft(i - 1), ne, this), this.isEven() && this.dAddOffset(1, 0); !this.isProbablePrime(a); )
|
|
3334
3336
|
this.dAddOffset(2, 0), this.bitLength() > i && this.subTo(o.ONE.shiftLeft(i - 1), this);
|
|
3335
3337
|
else {
|
|
3336
|
-
var p = new Array(),
|
|
3337
|
-
p.length = (i >> 3) + 1, a.nextBytes(p),
|
|
3338
|
+
var p = new Array(), T = i & 7;
|
|
3339
|
+
p.length = (i >> 3) + 1, a.nextBytes(p), T > 0 ? p[0] &= (1 << T) - 1 : p[0] = 0, this.fromString(p, 256);
|
|
3338
3340
|
}
|
|
3339
3341
|
}
|
|
3340
3342
|
function wr() {
|
|
3341
3343
|
var i = this.t, a = new Array();
|
|
3342
3344
|
a[0] = this.s;
|
|
3343
|
-
var u = this.DB - i * this.DB % 8, p,
|
|
3345
|
+
var u = this.DB - i * this.DB % 8, p, T = 0;
|
|
3344
3346
|
if (i-- > 0)
|
|
3345
|
-
for (u < this.DB && (p = this[i] >> u) != (this.s & this.DM) >> u && (a[
|
|
3346
|
-
u < 8 ? (p = (this[i] & (1 << u) - 1) << 8 - u, p |= this[--i] >> (u += this.DB - 8)) : (p = this[i] >> (u -= 8) & 255, u <= 0 && (u += this.DB, --i)), (p & 128) != 0 && (p |= -256),
|
|
3347
|
+
for (u < this.DB && (p = this[i] >> u) != (this.s & this.DM) >> u && (a[T++] = p | this.s << this.DB - u); i >= 0; )
|
|
3348
|
+
u < 8 ? (p = (this[i] & (1 << u) - 1) << 8 - u, p |= this[--i] >> (u += this.DB - 8)) : (p = this[i] >> (u -= 8) & 255, u <= 0 && (u += this.DB, --i)), (p & 128) != 0 && (p |= -256), T == 0 && (this.s & 128) != (p & 128) && ++T, (T > 0 || p != this.s) && (a[T++] = p);
|
|
3347
3349
|
return a;
|
|
3348
3350
|
}
|
|
3349
3351
|
function vr(i) {
|
|
3350
3352
|
return this.compareTo(i) == 0;
|
|
3351
3353
|
}
|
|
3352
|
-
function
|
|
3354
|
+
function Er(i) {
|
|
3353
3355
|
return this.compareTo(i) < 0 ? this : i;
|
|
3354
3356
|
}
|
|
3355
|
-
function
|
|
3357
|
+
function Tr(i) {
|
|
3356
3358
|
return this.compareTo(i) > 0 ? this : i;
|
|
3357
3359
|
}
|
|
3358
3360
|
function Sr(i, a, u) {
|
|
3359
|
-
var p,
|
|
3361
|
+
var p, T, R = Math.min(i.t, this.t);
|
|
3360
3362
|
for (p = 0; p < R; ++p) u[p] = a(this[p], i[p]);
|
|
3361
3363
|
if (i.t < this.t) {
|
|
3362
|
-
for (
|
|
3364
|
+
for (T = i.s & this.DM, p = R; p < this.t; ++p) u[p] = a(this[p], T);
|
|
3363
3365
|
u.t = this.t;
|
|
3364
3366
|
} else {
|
|
3365
|
-
for (
|
|
3367
|
+
for (T = this.s & this.DM, p = R; p < i.t; ++p) u[p] = a(T, i[p]);
|
|
3366
3368
|
u.t = i.t;
|
|
3367
3369
|
}
|
|
3368
3370
|
u.s = a(this.s, i.s), u.clamp();
|
|
@@ -3381,17 +3383,17 @@ function ee() {
|
|
|
3381
3383
|
var a = c();
|
|
3382
3384
|
return this.bitwiseTo(i, ne, a), a;
|
|
3383
3385
|
}
|
|
3384
|
-
function
|
|
3386
|
+
function Ae(i, a) {
|
|
3385
3387
|
return i ^ a;
|
|
3386
3388
|
}
|
|
3387
|
-
function
|
|
3389
|
+
function _r(i) {
|
|
3388
3390
|
var a = c();
|
|
3389
|
-
return this.bitwiseTo(i,
|
|
3391
|
+
return this.bitwiseTo(i, Ae, a), a;
|
|
3390
3392
|
}
|
|
3391
3393
|
function Ie(i, a) {
|
|
3392
3394
|
return i & ~a;
|
|
3393
3395
|
}
|
|
3394
|
-
function
|
|
3396
|
+
function Ar(i) {
|
|
3395
3397
|
var a = c();
|
|
3396
3398
|
return this.bitwiseTo(i, Ie, a), a;
|
|
3397
3399
|
}
|
|
@@ -3422,11 +3424,11 @@ function ee() {
|
|
|
3422
3424
|
i &= i - 1, ++a;
|
|
3423
3425
|
return a;
|
|
3424
3426
|
}
|
|
3425
|
-
function
|
|
3427
|
+
function Nr() {
|
|
3426
3428
|
for (var i = 0, a = this.s & this.DM, u = 0; u < this.t; ++u) i += Pr(this[u] ^ a);
|
|
3427
3429
|
return i;
|
|
3428
3430
|
}
|
|
3429
|
-
function
|
|
3431
|
+
function Mr(i) {
|
|
3430
3432
|
var a = Math.floor(i / this.DB);
|
|
3431
3433
|
return a >= this.t ? this.s != 0 : (this[a] & 1 << i % this.DB) != 0;
|
|
3432
3434
|
}
|
|
@@ -3441,10 +3443,10 @@ function ee() {
|
|
|
3441
3443
|
return this.changeBit(i, Ie);
|
|
3442
3444
|
}
|
|
3443
3445
|
function Hr(i) {
|
|
3444
|
-
return this.changeBit(i,
|
|
3446
|
+
return this.changeBit(i, Ae);
|
|
3445
3447
|
}
|
|
3446
3448
|
function zr(i, a) {
|
|
3447
|
-
for (var u = 0, p = 0,
|
|
3449
|
+
for (var u = 0, p = 0, T = Math.min(i.t, this.t); u < T; )
|
|
3448
3450
|
p += this[u] + i[u], a[u++] = p & this.DM, p >>= this.DB;
|
|
3449
3451
|
if (i.t < this.t) {
|
|
3450
3452
|
for (p += i.s; u < this.t; )
|
|
@@ -3465,15 +3467,15 @@ function ee() {
|
|
|
3465
3467
|
var a = c();
|
|
3466
3468
|
return this.subTo(i, a), a;
|
|
3467
3469
|
}
|
|
3468
|
-
function
|
|
3470
|
+
function Yr(i) {
|
|
3469
3471
|
var a = c();
|
|
3470
3472
|
return this.multiplyTo(i, a), a;
|
|
3471
3473
|
}
|
|
3472
|
-
function
|
|
3474
|
+
function Kr() {
|
|
3473
3475
|
var i = c();
|
|
3474
3476
|
return this.squareTo(i), i;
|
|
3475
3477
|
}
|
|
3476
|
-
function
|
|
3478
|
+
function Vr(i) {
|
|
3477
3479
|
var a = c();
|
|
3478
3480
|
return this.divRemTo(i, a, null), a;
|
|
3479
3481
|
}
|
|
@@ -3495,7 +3497,7 @@ function ee() {
|
|
|
3495
3497
|
this[a] -= this.DV, ++a >= this.t && (this[this.t++] = 0), ++this[a];
|
|
3496
3498
|
}
|
|
3497
3499
|
}
|
|
3498
|
-
function
|
|
3500
|
+
function _t() {
|
|
3499
3501
|
}
|
|
3500
3502
|
function Be(i) {
|
|
3501
3503
|
return i;
|
|
@@ -3506,16 +3508,16 @@ function ee() {
|
|
|
3506
3508
|
function Qr(i, a) {
|
|
3507
3509
|
i.squareTo(a);
|
|
3508
3510
|
}
|
|
3509
|
-
|
|
3511
|
+
_t.prototype.convert = Be, _t.prototype.revert = Be, _t.prototype.mulTo = Xr, _t.prototype.sqrTo = Qr;
|
|
3510
3512
|
function ts(i) {
|
|
3511
|
-
return this.exp(i, new
|
|
3513
|
+
return this.exp(i, new _t());
|
|
3512
3514
|
}
|
|
3513
3515
|
function es(i, a, u) {
|
|
3514
3516
|
var p = Math.min(this.t + i.t, a);
|
|
3515
3517
|
for (u.s = 0, u.t = p; p > 0; ) u[--p] = 0;
|
|
3516
|
-
var
|
|
3517
|
-
for (
|
|
3518
|
-
for (
|
|
3518
|
+
var T;
|
|
3519
|
+
for (T = u.t - this.t; p < T; ++p) u[p + this.t] = this.am(0, i[p], u, p, 0, this.t);
|
|
3520
|
+
for (T = Math.min(i.t, a); p < T; ++p) this.am(0, i[p], u, p, 0, a - p);
|
|
3519
3521
|
u.clamp();
|
|
3520
3522
|
}
|
|
3521
3523
|
function ns(i, a, u) {
|
|
@@ -3550,30 +3552,30 @@ function ee() {
|
|
|
3550
3552
|
}
|
|
3551
3553
|
gt.prototype.convert = rs, gt.prototype.revert = ss, gt.prototype.reduce = is, gt.prototype.mulTo = as, gt.prototype.sqrTo = os;
|
|
3552
3554
|
function cs(i, a) {
|
|
3553
|
-
var u = i.bitLength(), p,
|
|
3554
|
-
if (u <= 0) return
|
|
3555
|
+
var u = i.bitLength(), p, T = S(1), R;
|
|
3556
|
+
if (u <= 0) return T;
|
|
3555
3557
|
u < 18 ? p = 1 : u < 48 ? p = 3 : u < 144 ? p = 4 : u < 768 ? p = 5 : p = 6, u < 8 ? R = new D(a) : a.isEven() ? R = new gt(a) : R = new mt(a);
|
|
3556
|
-
var
|
|
3557
|
-
if (
|
|
3558
|
+
var A = new Array(), B = 3, j = p - 1, V = (1 << p) - 1;
|
|
3559
|
+
if (A[1] = R.convert(this), p > 1) {
|
|
3558
3560
|
var st = c();
|
|
3559
|
-
for (R.sqrTo(
|
|
3560
|
-
|
|
3561
|
+
for (R.sqrTo(A[1], st); B <= V; )
|
|
3562
|
+
A[B] = c(), R.mulTo(st, A[B - 2], A[B]), B += 2;
|
|
3561
3563
|
}
|
|
3562
|
-
var rt = i.t - 1, lt,
|
|
3564
|
+
var rt = i.t - 1, lt, Mt = !0, ot = c(), at;
|
|
3563
3565
|
for (u = q(i[rt]) - 1; rt >= 0; ) {
|
|
3564
|
-
for (u >= j ? lt = i[rt] >> u - j &
|
|
3566
|
+
for (u >= j ? lt = i[rt] >> u - j & V : (lt = (i[rt] & (1 << u + 1) - 1) << j - u, rt > 0 && (lt |= i[rt - 1] >> this.DB + u - j)), B = p; (lt & 1) == 0; )
|
|
3565
3567
|
lt >>= 1, --B;
|
|
3566
|
-
if ((u -= B) < 0 && (u += this.DB, --rt),
|
|
3567
|
-
|
|
3568
|
+
if ((u -= B) < 0 && (u += this.DB, --rt), Mt)
|
|
3569
|
+
A[lt].copyTo(T), Mt = !1;
|
|
3568
3570
|
else {
|
|
3569
3571
|
for (; B > 1; )
|
|
3570
|
-
R.sqrTo(
|
|
3571
|
-
B > 0 ? R.sqrTo(
|
|
3572
|
+
R.sqrTo(T, ot), R.sqrTo(ot, T), B -= 2;
|
|
3573
|
+
B > 0 ? R.sqrTo(T, ot) : (at = T, T = ot, ot = at), R.mulTo(ot, A[lt], T);
|
|
3572
3574
|
}
|
|
3573
3575
|
for (; rt >= 0 && (i[rt] & 1 << u) == 0; )
|
|
3574
|
-
R.sqrTo(
|
|
3576
|
+
R.sqrTo(T, ot), at = T, T = ot, ot = at, --u < 0 && (u = this.DB - 1, --rt);
|
|
3575
3577
|
}
|
|
3576
|
-
return R.revert(
|
|
3578
|
+
return R.revert(T);
|
|
3577
3579
|
}
|
|
3578
3580
|
function us(i) {
|
|
3579
3581
|
var a = this.s < 0 ? this.negate() : this.clone(), u = i.s < 0 ? i.negate() : i.clone();
|
|
@@ -3581,10 +3583,10 @@ function ee() {
|
|
|
3581
3583
|
var p = a;
|
|
3582
3584
|
a = u, u = p;
|
|
3583
3585
|
}
|
|
3584
|
-
var
|
|
3586
|
+
var T = a.getLowestSetBit(), R = u.getLowestSetBit();
|
|
3585
3587
|
if (R < 0) return a;
|
|
3586
|
-
for (
|
|
3587
|
-
(
|
|
3588
|
+
for (T < R && (R = T), R > 0 && (a.rShiftTo(R, a), u.rShiftTo(R, u)); a.signum() > 0; )
|
|
3589
|
+
(T = a.getLowestSetBit()) > 0 && a.rShiftTo(T, a), (T = u.getLowestSetBit()) > 0 && u.rShiftTo(T, u), a.compareTo(u) >= 0 ? (a.subTo(u, a), a.rShiftTo(1, a)) : (u.subTo(a, u), u.rShiftTo(1, u));
|
|
3588
3590
|
return R > 0 && u.lShiftTo(R, u), u;
|
|
3589
3591
|
}
|
|
3590
3592
|
function fs(i) {
|
|
@@ -3598,12 +3600,12 @@ function ee() {
|
|
|
3598
3600
|
function ls(i) {
|
|
3599
3601
|
var a = i.isEven();
|
|
3600
3602
|
if (this.isEven() && a || i.signum() == 0) return o.ZERO;
|
|
3601
|
-
for (var u = i.clone(), p = this.clone(),
|
|
3603
|
+
for (var u = i.clone(), p = this.clone(), T = S(1), R = S(0), A = S(0), B = S(1); u.signum() != 0; ) {
|
|
3602
3604
|
for (; u.isEven(); )
|
|
3603
|
-
u.rShiftTo(1, u), a ? ((!
|
|
3605
|
+
u.rShiftTo(1, u), a ? ((!T.isEven() || !R.isEven()) && (T.addTo(this, T), R.subTo(i, R)), T.rShiftTo(1, T)) : R.isEven() || R.subTo(i, R), R.rShiftTo(1, R);
|
|
3604
3606
|
for (; p.isEven(); )
|
|
3605
|
-
p.rShiftTo(1, p), a ? ((!
|
|
3606
|
-
u.compareTo(p) >= 0 ? (u.subTo(p, u), a &&
|
|
3607
|
+
p.rShiftTo(1, p), a ? ((!A.isEven() || !B.isEven()) && (A.addTo(this, A), B.subTo(i, B)), A.rShiftTo(1, A)) : B.isEven() || B.subTo(i, B), B.rShiftTo(1, B);
|
|
3608
|
+
u.compareTo(p) >= 0 ? (u.subTo(p, u), a && T.subTo(A, T), R.subTo(B, R)) : (p.subTo(u, p), a && A.subTo(T, A), B.subTo(R, B));
|
|
3607
3609
|
}
|
|
3608
3610
|
if (p.compareTo(o.ONE) != 0) return o.ZERO;
|
|
3609
3611
|
if (B.compareTo(i) >= 0) return B.subtract(i);
|
|
@@ -3621,8 +3623,8 @@ function ee() {
|
|
|
3621
3623
|
}
|
|
3622
3624
|
if (u.isEven()) return !1;
|
|
3623
3625
|
for (a = 1; a < G.length; ) {
|
|
3624
|
-
for (var p = G[a],
|
|
3625
|
-
for (p = u.modInt(p); a <
|
|
3626
|
+
for (var p = G[a], T = a + 1; T < G.length && p < hs; ) p *= G[T++];
|
|
3627
|
+
for (p = u.modInt(p); a < T; ) if (p % G[a++] == 0) return !1;
|
|
3626
3628
|
}
|
|
3627
3629
|
return u.millerRabin(i);
|
|
3628
3630
|
}
|
|
@@ -3631,50 +3633,50 @@ function ee() {
|
|
|
3631
3633
|
if (u <= 0) return !1;
|
|
3632
3634
|
var p = a.shiftRight(u);
|
|
3633
3635
|
i = i + 1 >> 1, i > G.length && (i = G.length);
|
|
3634
|
-
for (var
|
|
3635
|
-
|
|
3636
|
-
var
|
|
3637
|
-
if (
|
|
3638
|
-
for (var B = 1; B++ < u &&
|
|
3639
|
-
if (
|
|
3640
|
-
if (
|
|
3636
|
+
for (var T = c(), R = 0; R < i; ++R) {
|
|
3637
|
+
T.fromInt(G[Math.floor(Math.random() * G.length)]);
|
|
3638
|
+
var A = T.modPow(p, this);
|
|
3639
|
+
if (A.compareTo(o.ONE) != 0 && A.compareTo(a) != 0) {
|
|
3640
|
+
for (var B = 1; B++ < u && A.compareTo(a) != 0; )
|
|
3641
|
+
if (A = A.modPowInt(2, this), A.compareTo(o.ONE) == 0) return !1;
|
|
3642
|
+
if (A.compareTo(a) != 0) return !1;
|
|
3641
3643
|
}
|
|
3642
3644
|
}
|
|
3643
3645
|
return !0;
|
|
3644
3646
|
}
|
|
3645
|
-
o.prototype.chunkSize = mr, o.prototype.toRadix = yr, o.prototype.fromRadix = xr, o.prototype.fromNumber = br, o.prototype.bitwiseTo = Sr, o.prototype.changeBit = kr, o.prototype.addTo = zr, o.prototype.dMultiply = Zr, o.prototype.dAddOffset = Gr, o.prototype.multiplyLowerTo = es, o.prototype.multiplyUpperTo = ns, o.prototype.modInt = fs, o.prototype.millerRabin = ps, o.prototype.clone = lr, o.prototype.intValue = hr, o.prototype.byteValue = dr, o.prototype.shortValue = pr, o.prototype.signum = gr, o.prototype.toByteArray = wr, o.prototype.equals = vr, o.prototype.min =
|
|
3646
|
-
var
|
|
3647
|
+
o.prototype.chunkSize = mr, o.prototype.toRadix = yr, o.prototype.fromRadix = xr, o.prototype.fromNumber = br, o.prototype.bitwiseTo = Sr, o.prototype.changeBit = kr, o.prototype.addTo = zr, o.prototype.dMultiply = Zr, o.prototype.dAddOffset = Gr, o.prototype.multiplyLowerTo = es, o.prototype.multiplyUpperTo = ns, o.prototype.modInt = fs, o.prototype.millerRabin = ps, o.prototype.clone = lr, o.prototype.intValue = hr, o.prototype.byteValue = dr, o.prototype.shortValue = pr, o.prototype.signum = gr, o.prototype.toByteArray = wr, o.prototype.equals = vr, o.prototype.min = Er, o.prototype.max = Tr, o.prototype.and = Or, o.prototype.or = Fr, o.prototype.xor = _r, o.prototype.andNot = Ar, o.prototype.not = Ir, o.prototype.shiftLeft = Br, o.prototype.shiftRight = Cr, o.prototype.getLowestSetBit = qr, o.prototype.bitCount = Nr, o.prototype.testBit = Mr, o.prototype.setBit = Lr, o.prototype.clearBit = Ur, o.prototype.flipBit = Hr, o.prototype.add = jr, o.prototype.subtract = $r, o.prototype.multiply = Yr, o.prototype.divide = Vr, o.prototype.remainder = Jr, o.prototype.divideAndRemainder = Wr, o.prototype.modPow = cs, o.prototype.modInverse = ls, o.prototype.pow = ts, o.prototype.gcd = us, o.prototype.isProbablePrime = ds, o.prototype.square = Kr, o.prototype.Barrett = gt;
|
|
3648
|
+
var Nt, nt, K;
|
|
3647
3649
|
function ms(i) {
|
|
3648
|
-
nt[
|
|
3650
|
+
nt[K++] ^= i & 255, nt[K++] ^= i >> 8 & 255, nt[K++] ^= i >> 16 & 255, nt[K++] ^= i >> 24 & 255, K >= se && (K -= se);
|
|
3649
3651
|
}
|
|
3650
3652
|
function Ce() {
|
|
3651
3653
|
ms((/* @__PURE__ */ new Date()).getTime());
|
|
3652
3654
|
}
|
|
3653
3655
|
if (nt == null) {
|
|
3654
|
-
nt = new Array(),
|
|
3656
|
+
nt = new Array(), K = 0;
|
|
3655
3657
|
var it;
|
|
3656
3658
|
if (typeof window < "u" && window.crypto) {
|
|
3657
3659
|
if (window.crypto.getRandomValues) {
|
|
3658
3660
|
var De = new Uint8Array(32);
|
|
3659
3661
|
for (window.crypto.getRandomValues(De), it = 0; it < 32; ++it)
|
|
3660
|
-
nt[
|
|
3662
|
+
nt[K++] = De[it];
|
|
3661
3663
|
} else if (navigator.appName == "Netscape" && navigator.appVersion < "5") {
|
|
3662
3664
|
var qe = window.crypto.random(32);
|
|
3663
3665
|
for (it = 0; it < qe.length; ++it)
|
|
3664
|
-
nt[
|
|
3666
|
+
nt[K++] = qe.charCodeAt(it) & 255;
|
|
3665
3667
|
}
|
|
3666
3668
|
}
|
|
3667
|
-
for (;
|
|
3668
|
-
it = Math.floor(65536 * Math.random()), nt[
|
|
3669
|
-
|
|
3669
|
+
for (; K < se; )
|
|
3670
|
+
it = Math.floor(65536 * Math.random()), nt[K++] = it >>> 8, nt[K++] = it & 255;
|
|
3671
|
+
K = 0, Ce();
|
|
3670
3672
|
}
|
|
3671
3673
|
function gs() {
|
|
3672
|
-
if (
|
|
3673
|
-
for (Ce(),
|
|
3674
|
-
nt[
|
|
3675
|
-
|
|
3674
|
+
if (Nt == null) {
|
|
3675
|
+
for (Ce(), Nt = ws(), Nt.init(nt), K = 0; K < nt.length; ++K)
|
|
3676
|
+
nt[K] = 0;
|
|
3677
|
+
K = 0;
|
|
3676
3678
|
}
|
|
3677
|
-
return
|
|
3679
|
+
return Nt.next();
|
|
3678
3680
|
}
|
|
3679
3681
|
function ys(i) {
|
|
3680
3682
|
var a;
|
|
@@ -3788,8 +3790,8 @@ function ha() {
|
|
|
3788
3790
|
* 解析 ASN.1 der,针对 sm2 验签
|
|
3789
3791
|
*/
|
|
3790
3792
|
decodeDer(d) {
|
|
3791
|
-
const h = f(d, 0), l = f(d, h), v = c(d, h), O = d.substr(l, v * 2), I = l + O.length, w = f(d, I), F = c(d, I), m = d.substr(w, F * 2),
|
|
3792
|
-
return { r:
|
|
3793
|
+
const h = f(d, 0), l = f(d, h), v = c(d, h), O = d.substr(l, v * 2), I = l + O.length, w = f(d, I), F = c(d, I), m = d.substr(w, F * 2), E = new t(O, 16), b = new t(m, 16);
|
|
3794
|
+
return { r: E, s: b };
|
|
3793
3795
|
}
|
|
3794
3796
|
}, ue;
|
|
3795
3797
|
}
|
|
@@ -3902,10 +3904,10 @@ function da() {
|
|
|
3902
3904
|
add(f) {
|
|
3903
3905
|
if (this.isInfinity()) return f;
|
|
3904
3906
|
if (f.isInfinity()) return this;
|
|
3905
|
-
const d = this.x.toBigInteger(), h = this.y.toBigInteger(), l = this.z, v = f.x.toBigInteger(), O = f.y.toBigInteger(), I = f.z, w = this.curve.q, F = d.multiply(I).mod(w), m = v.multiply(l).mod(w),
|
|
3906
|
-
if (t.ZERO.equals(
|
|
3907
|
+
const d = this.x.toBigInteger(), h = this.y.toBigInteger(), l = this.z, v = f.x.toBigInteger(), O = f.y.toBigInteger(), I = f.z, w = this.curve.q, F = d.multiply(I).mod(w), m = v.multiply(l).mod(w), E = F.subtract(m), b = h.multiply(I).mod(w), g = O.multiply(l).mod(w), S = b.subtract(g);
|
|
3908
|
+
if (t.ZERO.equals(E))
|
|
3907
3909
|
return t.ZERO.equals(S) ? this.twice() : this.curve.infinity;
|
|
3908
|
-
const x = F.add(m),
|
|
3910
|
+
const x = F.add(m), _ = l.multiply(I).mod(w), C = E.square().mod(w), P = E.multiply(C).mod(w), M = _.multiply(S.square()).subtract(x.multiply(C)).mod(w), H = E.multiply(M).mod(w), q = S.multiply(C.multiply(F).subtract(M)).subtract(b.multiply(P)).mod(w), k = P.multiply(_).mod(w);
|
|
3909
3911
|
return new s(this.curve, this.curve.fromBigInteger(H), this.curve.fromBigInteger(q), k);
|
|
3910
3912
|
}
|
|
3911
3913
|
/**
|
|
@@ -3926,7 +3928,7 @@ function da() {
|
|
|
3926
3928
|
twice() {
|
|
3927
3929
|
if (this.isInfinity()) return this;
|
|
3928
3930
|
if (!this.y.toBigInteger().signum()) return this.curve.infinity;
|
|
3929
|
-
const f = this.x.toBigInteger(), d = this.y.toBigInteger(), h = this.z, l = this.curve.q, v = this.curve.a.toBigInteger(), O = f.square().multiply(n).add(v.multiply(h.square())).mod(l), I = d.shiftLeft(1).multiply(h).mod(l), w = d.square().mod(l), F = w.multiply(f).multiply(h).mod(l), m = I.square().mod(l),
|
|
3931
|
+
const f = this.x.toBigInteger(), d = this.y.toBigInteger(), h = this.z, l = this.curve.q, v = this.curve.a.toBigInteger(), O = f.square().multiply(n).add(v.multiply(h.square())).mod(l), I = d.shiftLeft(1).multiply(h).mod(l), w = d.square().mod(l), F = w.multiply(f).multiply(h).mod(l), m = I.square().mod(l), E = O.square().subtract(F.shiftLeft(3)).mod(l), b = I.multiply(E).mod(l), g = O.multiply(F.shiftLeft(2).subtract(E)).subtract(m.shiftLeft(1).multiply(w)).mod(l), S = I.multiply(m).mod(l);
|
|
3930
3932
|
return new s(this.curve, this.curve.fromBigInteger(b), this.curve.fromBigInteger(g), S);
|
|
3931
3933
|
}
|
|
3932
3934
|
/**
|
|
@@ -4003,27 +4005,27 @@ function pa() {
|
|
|
4003
4005
|
return s;
|
|
4004
4006
|
}
|
|
4005
4007
|
function d() {
|
|
4006
|
-
const b = new t("FFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF00000000FFFFFFFFFFFFFFFF", 16), g = new t("FFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF00000000FFFFFFFFFFFFFFFC", 16), S = new t("28E9FA9E9D9F5E344D5A9E4BCF6509A7F39789F515AB8F92DDBCBD414D940E93", 16), x = new n(b, g, S), P = x.decodePointHex("04" + "32C4AE2C1F1981195F9904466A39C9948FE30BBFF2660BE1715A4589334C74C7" + "BC3736A2F4F6779C59BDCEE36B692153D0A9877CC62A474002DF32E52139F0A0"),
|
|
4007
|
-
return { curve: x, G: P, n:
|
|
4008
|
+
const b = new t("FFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF00000000FFFFFFFFFFFFFFFF", 16), g = new t("FFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF00000000FFFFFFFFFFFFFFFC", 16), S = new t("28E9FA9E9D9F5E344D5A9E4BCF6509A7F39789F515AB8F92DDBCBD414D940E93", 16), x = new n(b, g, S), P = x.decodePointHex("04" + "32C4AE2C1F1981195F9904466A39C9948FE30BBFF2660BE1715A4589334C74C7" + "BC3736A2F4F6779C59BDCEE36B692153D0A9877CC62A474002DF32E52139F0A0"), M = new t("FFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFF7203DF6B21C6052B53BBF40939D54123", 16);
|
|
4009
|
+
return { curve: x, G: P, n: M };
|
|
4008
4010
|
}
|
|
4009
4011
|
function h(b, g, S) {
|
|
4010
|
-
const
|
|
4012
|
+
const _ = (b ? new t(b, g, S) : new t(c.bitLength(), r)).mod(c.subtract(t.ONE)).add(t.ONE), C = O(_.toString(16), 64), P = o.multiply(_), M = O(P.getX().toBigInteger().toString(16), 64), H = O(P.getY().toBigInteger().toString(16), 64), q = "04" + M + H;
|
|
4011
4013
|
return { privateKey: C, publicKey: q };
|
|
4012
4014
|
}
|
|
4013
4015
|
function l(b) {
|
|
4014
4016
|
if (b.length !== 130) throw new Error("Invalid public key to compress");
|
|
4015
4017
|
const g = (b.length - 2) / 2, S = b.substr(2, g), x = new t(b.substr(g + 2, g), 16);
|
|
4016
|
-
let
|
|
4017
|
-
return x.mod(new t("2")).equals(t.ZERO) && (
|
|
4018
|
+
let _ = "03";
|
|
4019
|
+
return x.mod(new t("2")).equals(t.ZERO) && (_ = "02"), _ + S;
|
|
4018
4020
|
}
|
|
4019
4021
|
function v(b) {
|
|
4020
4022
|
b = unescape(encodeURIComponent(b));
|
|
4021
4023
|
const g = b.length, S = [];
|
|
4022
|
-
for (let
|
|
4023
|
-
S[
|
|
4024
|
+
for (let _ = 0; _ < g; _++)
|
|
4025
|
+
S[_ >>> 2] |= (b.charCodeAt(_) & 255) << 24 - _ % 4 * 8;
|
|
4024
4026
|
const x = [];
|
|
4025
|
-
for (let
|
|
4026
|
-
const C = S[
|
|
4027
|
+
for (let _ = 0; _ < g; _++) {
|
|
4028
|
+
const C = S[_ >>> 2] >>> 24 - _ % 4 * 8 & 255;
|
|
4027
4029
|
x.push((C >>> 4).toString(16)), x.push((C & 15).toString(16));
|
|
4028
4030
|
}
|
|
4029
4031
|
return x.join("");
|
|
@@ -4041,8 +4043,8 @@ function pa() {
|
|
|
4041
4043
|
g[x >>> 3] |= parseInt(b[S], 10) << 24 - x % 8 * 4, S++;
|
|
4042
4044
|
try {
|
|
4043
4045
|
const x = [];
|
|
4044
|
-
for (let
|
|
4045
|
-
const C = g[
|
|
4046
|
+
for (let _ = 0; _ < b.length; _++) {
|
|
4047
|
+
const C = g[_ >>> 2] >>> 24 - _ % 4 * 8 & 255;
|
|
4046
4048
|
x.push(String.fromCharCode(C));
|
|
4047
4049
|
}
|
|
4048
4050
|
return decodeURIComponent(escape(x.join("")));
|
|
@@ -4064,7 +4066,7 @@ function pa() {
|
|
|
4064
4066
|
const S = g.getX();
|
|
4065
4067
|
return g.getY().square().equals(S.multiply(S.square()).add(S.multiply(s.a)).add(s.b));
|
|
4066
4068
|
}
|
|
4067
|
-
function
|
|
4069
|
+
function E(b, g) {
|
|
4068
4070
|
const S = s.decodePointHex(b);
|
|
4069
4071
|
if (!S) return !1;
|
|
4070
4072
|
const x = s.decodePointHex(g);
|
|
@@ -4081,7 +4083,7 @@ function pa() {
|
|
|
4081
4083
|
arrayToUtf8: w,
|
|
4082
4084
|
hexToArray: F,
|
|
4083
4085
|
verifyPublicKey: m,
|
|
4084
|
-
comparePublicKeyHex:
|
|
4086
|
+
comparePublicKeyHex: E
|
|
4085
4087
|
}, le;
|
|
4086
4088
|
}
|
|
4087
4089
|
var he, sn;
|
|
@@ -4108,32 +4110,32 @@ function Zn() {
|
|
|
4108
4110
|
let O = v.length * 8, I = O % 512;
|
|
4109
4111
|
I = I >= 448 ? 512 - I % 448 - 1 : 448 - I - 1;
|
|
4110
4112
|
const w = new Array((I - 7) / 8), F = new Array(8);
|
|
4111
|
-
for (let x = 0,
|
|
4112
|
-
for (let x = 0,
|
|
4113
|
+
for (let x = 0, _ = w.length; x < _; x++) w[x] = 0;
|
|
4114
|
+
for (let x = 0, _ = F.length; x < _; x++) F[x] = 0;
|
|
4113
4115
|
O = O.toString(2);
|
|
4114
4116
|
for (let x = 7; x >= 0; x--)
|
|
4115
4117
|
if (O.length > 8) {
|
|
4116
|
-
const
|
|
4117
|
-
F[x] = parseInt(O.substr(
|
|
4118
|
+
const _ = O.length - 8;
|
|
4119
|
+
F[x] = parseInt(O.substr(_), 2), O = O.substr(0, _);
|
|
4118
4120
|
} else O.length > 0 && (F[x] = parseInt(O, 2), O = "");
|
|
4119
|
-
const m = new Uint8Array([...v, 128, ...w, ...F]),
|
|
4121
|
+
const m = new Uint8Array([...v, 128, ...w, ...F]), E = new DataView(m.buffer, 0), b = m.length / 64, g = new Uint32Array([1937774191, 1226093241, 388252375, 3666478592, 2842636476, 372324522, 3817729613, 2969243214]);
|
|
4120
4122
|
for (let x = 0; x < b; x++) {
|
|
4121
4123
|
t.fill(0), e.fill(0);
|
|
4122
|
-
const
|
|
4124
|
+
const _ = 16 * x;
|
|
4123
4125
|
for (let D = 0; D < 16; D++)
|
|
4124
|
-
t[D] =
|
|
4126
|
+
t[D] = E.getUint32((_ + D) * 4, !1);
|
|
4125
4127
|
for (let D = 16; D < 68; D++)
|
|
4126
4128
|
t[D] = o(t[D - 16] ^ t[D - 9] ^ n(t[D - 3], 15)) ^ n(t[D - 13], 7) ^ t[D - 6];
|
|
4127
4129
|
for (let D = 0; D < 64; D++)
|
|
4128
4130
|
e[D] = t[D] ^ t[D + 4];
|
|
4129
4131
|
const C = 2043430169, P = 2055708042;
|
|
4130
|
-
let
|
|
4132
|
+
let M = g[0], H = g[1], q = g[2], k = g[3], L = g[4], U = g[5], J = g[6], Y = g[7], X, Z, pt, vt, et;
|
|
4131
4133
|
for (let D = 0; D < 64; D++)
|
|
4132
|
-
et = D >= 0 && D <= 15 ? C : P, X = n(n(
|
|
4133
|
-
g[0] ^=
|
|
4134
|
+
et = D >= 0 && D <= 15 ? C : P, X = n(n(M, 12) + L + n(et, D), 7), Z = X ^ n(M, 12), pt = (D >= 0 && D <= 15 ? M ^ H ^ q : M & H | M & q | H & q) + k + Z + e[D], vt = (D >= 0 && D <= 15 ? L ^ U ^ J : L & U | ~L & J) + Y + X + t[D], k = q, q = n(H, 9), H = M, M = pt, Y = J, J = n(U, 19), U = L, L = s(vt);
|
|
4135
|
+
g[0] ^= M, g[1] ^= H, g[2] ^= q, g[3] ^= k, g[4] ^= L, g[5] ^= U, g[6] ^= J, g[7] ^= Y;
|
|
4134
4136
|
}
|
|
4135
4137
|
const S = [];
|
|
4136
|
-
for (let x = 0,
|
|
4138
|
+
for (let x = 0, _ = g.length; x < _; x++) {
|
|
4137
4139
|
const C = g[x];
|
|
4138
4140
|
S.push((C & 4278190080) >>> 24, (C & 16711680) >>> 16, (C & 65280) >>> 8, C & 255);
|
|
4139
4141
|
}
|
|
@@ -4157,94 +4159,94 @@ function ma() {
|
|
|
4157
4159
|
if (on) return de;
|
|
4158
4160
|
on = 1;
|
|
4159
4161
|
const { BigInteger: t } = ee(), { encodeDer: e, decodeDer: n } = ha(), r = pa(), s = Zn().sm3, { G: o, curve: c, n: f } = r.generateEcparam(), d = 0;
|
|
4160
|
-
function h(m,
|
|
4161
|
-
m = typeof m == "string" ? r.hexToArray(r.utf8ToHex(m)) : Array.prototype.slice.call(m),
|
|
4162
|
+
function h(m, E, b = 1) {
|
|
4163
|
+
m = typeof m == "string" ? r.hexToArray(r.utf8ToHex(m)) : Array.prototype.slice.call(m), E = r.getGlobalCurve().decodePointHex(E);
|
|
4162
4164
|
const g = r.generateKeyPairHex(), S = new t(g.privateKey, 16);
|
|
4163
4165
|
let x = g.publicKey;
|
|
4164
4166
|
x.length > 128 && (x = x.substr(x.length - 128));
|
|
4165
|
-
const
|
|
4167
|
+
const _ = E.multiply(S), C = r.hexToArray(r.leftPad(_.getX().toBigInteger().toRadix(16), 64)), P = r.hexToArray(r.leftPad(_.getY().toBigInteger().toRadix(16), 64)), M = r.arrayToHex(s([].concat(C, m, P)));
|
|
4166
4168
|
let H = 1, q = 0, k = [];
|
|
4167
4169
|
const L = [].concat(C, P), U = () => {
|
|
4168
4170
|
k = s([...L, H >> 24 & 255, H >> 16 & 255, H >> 8 & 255, H & 255]), H++, q = 0;
|
|
4169
4171
|
};
|
|
4170
4172
|
U();
|
|
4171
|
-
for (let
|
|
4172
|
-
q === k.length && U(), m[
|
|
4173
|
+
for (let Y = 0, X = m.length; Y < X; Y++)
|
|
4174
|
+
q === k.length && U(), m[Y] ^= k[q++] & 255;
|
|
4173
4175
|
const J = r.arrayToHex(m);
|
|
4174
|
-
return b === d ? x + J +
|
|
4176
|
+
return b === d ? x + J + M : x + M + J;
|
|
4175
4177
|
}
|
|
4176
|
-
function l(m,
|
|
4178
|
+
function l(m, E, b = 1, {
|
|
4177
4179
|
output: g = "string"
|
|
4178
4180
|
} = {}) {
|
|
4179
|
-
|
|
4181
|
+
E = new t(E, 16);
|
|
4180
4182
|
let S = m.substr(128, 64), x = m.substr(192);
|
|
4181
4183
|
b === d && (S = m.substr(m.length - 64), x = m.substr(128, m.length - 128 - 64));
|
|
4182
|
-
const
|
|
4184
|
+
const _ = r.hexToArray(x), P = r.getGlobalCurve().decodePointHex("04" + m.substr(0, 128)).multiply(E), M = r.hexToArray(r.leftPad(P.getX().toBigInteger().toRadix(16), 64)), H = r.hexToArray(r.leftPad(P.getY().toBigInteger().toRadix(16), 64));
|
|
4183
4185
|
let q = 1, k = 0, L = [];
|
|
4184
|
-
const U = [].concat(
|
|
4186
|
+
const U = [].concat(M, H), J = () => {
|
|
4185
4187
|
L = s([...U, q >> 24 & 255, q >> 16 & 255, q >> 8 & 255, q & 255]), q++, k = 0;
|
|
4186
4188
|
};
|
|
4187
4189
|
J();
|
|
4188
|
-
for (let X = 0, Z =
|
|
4189
|
-
k === L.length && J(),
|
|
4190
|
-
return r.arrayToHex(s([].concat(
|
|
4190
|
+
for (let X = 0, Z = _.length; X < Z; X++)
|
|
4191
|
+
k === L.length && J(), _[X] ^= L[k++] & 255;
|
|
4192
|
+
return r.arrayToHex(s([].concat(M, _, H))) === S.toLowerCase() ? g === "array" ? _ : r.arrayToUtf8(_) : g === "array" ? [] : "";
|
|
4191
4193
|
}
|
|
4192
|
-
function v(m,
|
|
4194
|
+
function v(m, E, {
|
|
4193
4195
|
pointPool: b,
|
|
4194
4196
|
der: g,
|
|
4195
4197
|
hash: S,
|
|
4196
4198
|
publicKey: x,
|
|
4197
|
-
userId:
|
|
4199
|
+
userId: _
|
|
4198
4200
|
} = {}) {
|
|
4199
4201
|
let C = typeof m == "string" ? r.utf8ToHex(m) : r.arrayToHex(m);
|
|
4200
|
-
S && (x = x || w(
|
|
4201
|
-
const P = new t(
|
|
4202
|
+
S && (x = x || w(E), C = I(C, x, _));
|
|
4203
|
+
const P = new t(E, 16), M = new t(C, 16);
|
|
4202
4204
|
let H = null, q = null, k = null;
|
|
4203
4205
|
do {
|
|
4204
4206
|
do {
|
|
4205
4207
|
let L;
|
|
4206
|
-
b && b.length ? L = b.pop() : L = F(), H = L.k, q =
|
|
4208
|
+
b && b.length ? L = b.pop() : L = F(), H = L.k, q = M.add(L.x1).mod(f);
|
|
4207
4209
|
} while (q.equals(t.ZERO) || q.add(H).equals(f));
|
|
4208
4210
|
k = P.add(t.ONE).modInverse(f).multiply(H.subtract(q.multiply(P))).mod(f);
|
|
4209
4211
|
} while (k.equals(t.ZERO));
|
|
4210
4212
|
return g ? e(q, k) : r.leftPad(q.toString(16), 64) + r.leftPad(k.toString(16), 64);
|
|
4211
4213
|
}
|
|
4212
|
-
function O(m,
|
|
4213
|
-
let
|
|
4214
|
-
S && (
|
|
4214
|
+
function O(m, E, b, { der: g, hash: S, userId: x } = {}) {
|
|
4215
|
+
let _ = typeof m == "string" ? r.utf8ToHex(m) : r.arrayToHex(m);
|
|
4216
|
+
S && (_ = I(_, b, x));
|
|
4215
4217
|
let C, P;
|
|
4216
4218
|
if (g) {
|
|
4217
|
-
const U = n(
|
|
4219
|
+
const U = n(E);
|
|
4218
4220
|
C = U.r, P = U.s;
|
|
4219
4221
|
} else
|
|
4220
|
-
C = new t(
|
|
4221
|
-
const
|
|
4222
|
+
C = new t(E.substring(0, 64), 16), P = new t(E.substring(64), 16);
|
|
4223
|
+
const M = c.decodePointHex(b), H = new t(_, 16), q = C.add(P).mod(f);
|
|
4222
4224
|
if (q.equals(t.ZERO)) return !1;
|
|
4223
|
-
const k = o.multiply(P).add(
|
|
4225
|
+
const k = o.multiply(P).add(M.multiply(q)), L = H.add(k.getX().toBigInteger()).mod(f);
|
|
4224
4226
|
return C.equals(L);
|
|
4225
4227
|
}
|
|
4226
|
-
function I(m,
|
|
4228
|
+
function I(m, E, b = "1234567812345678") {
|
|
4227
4229
|
b = r.utf8ToHex(b);
|
|
4228
|
-
const g = r.leftPad(o.curve.a.toBigInteger().toRadix(16), 64), S = r.leftPad(o.curve.b.toBigInteger().toRadix(16), 64), x = r.leftPad(o.getX().toBigInteger().toRadix(16), 64),
|
|
4230
|
+
const g = r.leftPad(o.curve.a.toBigInteger().toRadix(16), 64), S = r.leftPad(o.curve.b.toBigInteger().toRadix(16), 64), x = r.leftPad(o.getX().toBigInteger().toRadix(16), 64), _ = r.leftPad(o.getY().toBigInteger().toRadix(16), 64);
|
|
4229
4231
|
let C, P;
|
|
4230
|
-
if (
|
|
4231
|
-
C =
|
|
4232
|
+
if (E.length === 128)
|
|
4233
|
+
C = E.substr(0, 64), P = E.substr(64, 64);
|
|
4232
4234
|
else {
|
|
4233
|
-
const k = o.curve.decodePointHex(
|
|
4235
|
+
const k = o.curve.decodePointHex(E);
|
|
4234
4236
|
C = r.leftPad(k.getX().toBigInteger().toRadix(16), 64), P = r.leftPad(k.getY().toBigInteger().toRadix(16), 64);
|
|
4235
4237
|
}
|
|
4236
|
-
const
|
|
4237
|
-
|
|
4238
|
-
const q = s(
|
|
4238
|
+
const M = r.hexToArray(b + g + S + x + _ + C + P), H = b.length * 4;
|
|
4239
|
+
M.unshift(H & 255), M.unshift(H >> 8 & 255);
|
|
4240
|
+
const q = s(M);
|
|
4239
4241
|
return r.arrayToHex(s(q.concat(r.hexToArray(m))));
|
|
4240
4242
|
}
|
|
4241
4243
|
function w(m) {
|
|
4242
|
-
const
|
|
4244
|
+
const E = o.multiply(new t(m, 16)), b = r.leftPad(E.getX().toBigInteger().toString(16), 64), g = r.leftPad(E.getY().toBigInteger().toString(16), 64);
|
|
4243
4245
|
return "04" + b + g;
|
|
4244
4246
|
}
|
|
4245
4247
|
function F() {
|
|
4246
|
-
const m = r.generateKeyPairHex(),
|
|
4247
|
-
return m.k = new t(m.privateKey, 16), m.x1 =
|
|
4248
|
+
const m = r.generateKeyPairHex(), E = c.decodePointHex(m.publicKey);
|
|
4249
|
+
return m.k = new t(m.privateKey, 16), m.x1 = E.getX().toBigInteger(), m;
|
|
4248
4250
|
}
|
|
4249
4251
|
return de = {
|
|
4250
4252
|
generateKeyPairHex: r.generateKeyPairHex,
|
|
@@ -4601,39 +4603,39 @@ function ya() {
|
|
|
4601
4603
|
1684763257
|
|
4602
4604
|
];
|
|
4603
4605
|
function o(m) {
|
|
4604
|
-
const
|
|
4606
|
+
const E = [];
|
|
4605
4607
|
for (let b = 0, g = m.length; b < g; b += 2)
|
|
4606
|
-
|
|
4607
|
-
return
|
|
4608
|
+
E.push(parseInt(m.substr(b, 2), 16));
|
|
4609
|
+
return E;
|
|
4608
4610
|
}
|
|
4609
4611
|
function c(m) {
|
|
4610
|
-
return m.map((
|
|
4612
|
+
return m.map((E) => (E = E.toString(16), E.length === 1 ? "0" + E : E)).join("");
|
|
4611
4613
|
}
|
|
4612
4614
|
function f(m) {
|
|
4613
|
-
const
|
|
4615
|
+
const E = [];
|
|
4614
4616
|
for (let b = 0, g = m.length; b < g; b++) {
|
|
4615
4617
|
const S = m.codePointAt(b);
|
|
4616
4618
|
if (S <= 127)
|
|
4617
|
-
|
|
4619
|
+
E.push(S);
|
|
4618
4620
|
else if (S <= 2047)
|
|
4619
|
-
|
|
4621
|
+
E.push(192 | S >>> 6), E.push(128 | S & 63);
|
|
4620
4622
|
else if (S <= 55295 || S >= 57344 && S <= 65535)
|
|
4621
|
-
|
|
4623
|
+
E.push(224 | S >>> 12), E.push(128 | S >>> 6 & 63), E.push(128 | S & 63);
|
|
4622
4624
|
else if (S >= 65536 && S <= 1114111)
|
|
4623
|
-
b++,
|
|
4625
|
+
b++, E.push(240 | S >>> 18 & 28), E.push(128 | S >>> 12 & 63), E.push(128 | S >>> 6 & 63), E.push(128 | S & 63);
|
|
4624
4626
|
else
|
|
4625
|
-
throw
|
|
4627
|
+
throw E.push(S), new Error("input is not supported");
|
|
4626
4628
|
}
|
|
4627
|
-
return
|
|
4629
|
+
return E;
|
|
4628
4630
|
}
|
|
4629
4631
|
function d(m) {
|
|
4630
|
-
const
|
|
4632
|
+
const E = [];
|
|
4631
4633
|
for (let b = 0, g = m.length; b < g; b++)
|
|
4632
|
-
m[b] >= 240 && m[b] <= 247 ? (
|
|
4633
|
-
return
|
|
4634
|
+
m[b] >= 240 && m[b] <= 247 ? (E.push(String.fromCodePoint(((m[b] & 7) << 18) + ((m[b + 1] & 63) << 12) + ((m[b + 2] & 63) << 6) + (m[b + 3] & 63))), b += 3) : m[b] >= 224 && m[b] <= 239 ? (E.push(String.fromCodePoint(((m[b] & 15) << 12) + ((m[b + 1] & 63) << 6) + (m[b + 2] & 63))), b += 2) : m[b] >= 192 && m[b] <= 223 ? (E.push(String.fromCodePoint(((m[b] & 31) << 6) + (m[b + 1] & 63))), b++) : E.push(String.fromCodePoint(m[b]));
|
|
4635
|
+
return E.join("");
|
|
4634
4636
|
}
|
|
4635
|
-
function h(m,
|
|
4636
|
-
const b =
|
|
4637
|
+
function h(m, E) {
|
|
4638
|
+
const b = E & 31;
|
|
4637
4639
|
return m << b | m >>> 32 - b;
|
|
4638
4640
|
}
|
|
4639
4641
|
function l(m) {
|
|
@@ -4645,53 +4647,53 @@ function ya() {
|
|
|
4645
4647
|
function O(m) {
|
|
4646
4648
|
return m ^ h(m, 13) ^ h(m, 23);
|
|
4647
4649
|
}
|
|
4648
|
-
function I(m,
|
|
4650
|
+
function I(m, E, b) {
|
|
4649
4651
|
const g = new Array(4), S = new Array(4);
|
|
4650
4652
|
for (let x = 0; x < 4; x++)
|
|
4651
4653
|
S[0] = m[4 * x] & 255, S[1] = m[4 * x + 1] & 255, S[2] = m[4 * x + 2] & 255, S[3] = m[4 * x + 3] & 255, g[x] = S[0] << 24 | S[1] << 16 | S[2] << 8 | S[3];
|
|
4652
|
-
for (let x = 0,
|
|
4653
|
-
|
|
4654
|
+
for (let x = 0, _; x < 32; x += 4)
|
|
4655
|
+
_ = g[1] ^ g[2] ^ g[3] ^ b[x + 0], g[0] ^= v(l(_)), _ = g[2] ^ g[3] ^ g[0] ^ b[x + 1], g[1] ^= v(l(_)), _ = g[3] ^ g[0] ^ g[1] ^ b[x + 2], g[2] ^= v(l(_)), _ = g[0] ^ g[1] ^ g[2] ^ b[x + 3], g[3] ^= v(l(_));
|
|
4654
4656
|
for (let x = 0; x < 16; x += 4)
|
|
4655
|
-
|
|
4657
|
+
E[x] = g[3 - x / 4] >>> 24 & 255, E[x + 1] = g[3 - x / 4] >>> 16 & 255, E[x + 2] = g[3 - x / 4] >>> 8 & 255, E[x + 3] = g[3 - x / 4] & 255;
|
|
4656
4658
|
}
|
|
4657
|
-
function w(m,
|
|
4659
|
+
function w(m, E, b) {
|
|
4658
4660
|
const g = new Array(4), S = new Array(4);
|
|
4659
4661
|
for (let x = 0; x < 4; x++)
|
|
4660
4662
|
S[0] = m[0 + 4 * x] & 255, S[1] = m[1 + 4 * x] & 255, S[2] = m[2 + 4 * x] & 255, S[3] = m[3 + 4 * x] & 255, g[x] = S[0] << 24 | S[1] << 16 | S[2] << 8 | S[3];
|
|
4661
4663
|
g[0] ^= 2746333894, g[1] ^= 1453994832, g[2] ^= 1736282519, g[3] ^= 2993693404;
|
|
4662
|
-
for (let x = 0,
|
|
4663
|
-
|
|
4664
|
+
for (let x = 0, _; x < 32; x += 4)
|
|
4665
|
+
_ = g[1] ^ g[2] ^ g[3] ^ s[x + 0], E[x + 0] = g[0] ^= O(l(_)), _ = g[2] ^ g[3] ^ g[0] ^ s[x + 1], E[x + 1] = g[1] ^= O(l(_)), _ = g[3] ^ g[0] ^ g[1] ^ s[x + 2], E[x + 2] = g[2] ^= O(l(_)), _ = g[0] ^ g[1] ^ g[2] ^ s[x + 3], E[x + 3] = g[3] ^= O(l(_));
|
|
4664
4666
|
if (b === t)
|
|
4665
|
-
for (let x = 0,
|
|
4666
|
-
|
|
4667
|
+
for (let x = 0, _; x < 16; x++)
|
|
4668
|
+
_ = E[x], E[x] = E[31 - x], E[31 - x] = _;
|
|
4667
4669
|
}
|
|
4668
|
-
function F(m,
|
|
4670
|
+
function F(m, E, b, {
|
|
4669
4671
|
padding: g = "pkcs#7",
|
|
4670
4672
|
mode: S,
|
|
4671
4673
|
iv: x = [],
|
|
4672
|
-
output:
|
|
4674
|
+
output: _ = "string"
|
|
4673
4675
|
} = {}) {
|
|
4674
4676
|
if (S === "cbc" && (typeof x == "string" && (x = o(x)), x.length !== 128 / 8))
|
|
4675
4677
|
throw new Error("iv is invalid");
|
|
4676
|
-
if (typeof
|
|
4678
|
+
if (typeof E == "string" && (E = o(E)), E.length !== 128 / 8)
|
|
4677
4679
|
throw new Error("key is invalid");
|
|
4678
4680
|
if (typeof m == "string" ? b !== t ? m = f(m) : m = o(m) : m = [...m], (g === "pkcs#5" || g === "pkcs#7") && b !== t) {
|
|
4679
4681
|
const k = n - m.length % n;
|
|
4680
4682
|
for (let L = 0; L < k; L++) m.push(k);
|
|
4681
4683
|
}
|
|
4682
4684
|
const C = new Array(e);
|
|
4683
|
-
w(
|
|
4685
|
+
w(E, C, b);
|
|
4684
4686
|
const P = [];
|
|
4685
|
-
let
|
|
4687
|
+
let M = x, H = m.length, q = 0;
|
|
4686
4688
|
for (; H >= n; ) {
|
|
4687
4689
|
const k = m.slice(q, q + 16), L = new Array(16);
|
|
4688
4690
|
if (S === "cbc")
|
|
4689
4691
|
for (let U = 0; U < n; U++)
|
|
4690
|
-
b !== t && (k[U] ^=
|
|
4692
|
+
b !== t && (k[U] ^= M[U]);
|
|
4691
4693
|
I(k, L, C);
|
|
4692
4694
|
for (let U = 0; U < n; U++)
|
|
4693
|
-
S === "cbc" && b === t && (L[U] ^=
|
|
4694
|
-
S === "cbc" && (b !== t ?
|
|
4695
|
+
S === "cbc" && b === t && (L[U] ^= M[U]), P[q + U] = L[U];
|
|
4696
|
+
S === "cbc" && (b !== t ? M = L : M = k), H -= n, q += n;
|
|
4695
4697
|
}
|
|
4696
4698
|
if ((g === "pkcs#5" || g === "pkcs#7") && b === t) {
|
|
4697
4699
|
const k = P.length, L = P[k - 1];
|
|
@@ -4699,14 +4701,14 @@ function ya() {
|
|
|
4699
4701
|
if (P[k - U] !== L) throw new Error("padding is invalid");
|
|
4700
4702
|
P.splice(k - L, L);
|
|
4701
4703
|
}
|
|
4702
|
-
return
|
|
4704
|
+
return _ !== "array" ? b !== t ? c(P) : d(P) : P;
|
|
4703
4705
|
}
|
|
4704
4706
|
return me = {
|
|
4705
|
-
encrypt(m,
|
|
4706
|
-
return F(m,
|
|
4707
|
+
encrypt(m, E, b) {
|
|
4708
|
+
return F(m, E, 1, b);
|
|
4707
4709
|
},
|
|
4708
|
-
decrypt(m,
|
|
4709
|
-
return F(m,
|
|
4710
|
+
decrypt(m, E, b) {
|
|
4711
|
+
return F(m, E, 0, b);
|
|
4710
4712
|
}
|
|
4711
4713
|
}, me;
|
|
4712
4714
|
}
|
|
@@ -4722,7 +4724,7 @@ var Gn = xa();
|
|
|
4722
4724
|
const Xn = Gn.sm2, Qn = Gn.sm4, pc = (t, e, n = "04") => n + Xn.doEncrypt(t, e), mc = (t, e, n = "04") => Xn.doDecrypt(t.startsWith(n) ? t.slice(2) : t, e), gc = (t, e) => Qn.encrypt(t, e), yc = (t, e) => Qn.decrypt(t, e);
|
|
4723
4725
|
let It = [], ba = { consecutiveFrames: 0, lastBlinkTime: 0 }, wa = { consecutiveFrames: 0, lastBlinkTime: 0 };
|
|
4724
4726
|
const va = /* @__PURE__ */ new Map([
|
|
4725
|
-
["nod", [
|
|
4727
|
+
["nod", [_a, 30]],
|
|
4726
4728
|
["shake", [Fa, 7]],
|
|
4727
4729
|
["mouth", [Oa, 0.35]],
|
|
4728
4730
|
["eye", [Ra, 0.3]]
|
|
@@ -4739,7 +4741,7 @@ function fn(t, e) {
|
|
|
4739
4741
|
n.map((s, o) => s - r[o]).reduce((s, o) => s + Math.pow(o, 2), 0)
|
|
4740
4742
|
);
|
|
4741
4743
|
}
|
|
4742
|
-
function*
|
|
4744
|
+
function* Ea(t, e, n, r, s) {
|
|
4743
4745
|
for (let o = n; o > 0; o--)
|
|
4744
4746
|
yield t(e, s, r);
|
|
4745
4747
|
}
|
|
@@ -4754,7 +4756,7 @@ function ln(t) {
|
|
|
4754
4756
|
const e = ye(t[1], t[5]), n = ye(t[2], t[4]), r = ye(t[0], t[3]);
|
|
4755
4757
|
return (e + n) / (2 * r);
|
|
4756
4758
|
}
|
|
4757
|
-
function
|
|
4759
|
+
function Ta(t) {
|
|
4758
4760
|
const e = fn(Ut(t[13]), Ut(t[19])), n = fn(Ut(t[0]), Ut(t[6]));
|
|
4759
4761
|
return e / n;
|
|
4760
4762
|
}
|
|
@@ -4774,13 +4776,13 @@ function hn(t, e, n, r) {
|
|
|
4774
4776
|
return !1;
|
|
4775
4777
|
}
|
|
4776
4778
|
function Oa(t, e) {
|
|
4777
|
-
return
|
|
4779
|
+
return Ta(t.getMouth()) > e;
|
|
4778
4780
|
}
|
|
4779
4781
|
function Fa(t, e) {
|
|
4780
4782
|
const n = Sa(t);
|
|
4781
4783
|
return Math.abs(n) > e;
|
|
4782
4784
|
}
|
|
4783
|
-
function
|
|
4785
|
+
function _a(t, e) {
|
|
4784
4786
|
const n = It.length, r = t.positions[33];
|
|
4785
4787
|
if (n < 5)
|
|
4786
4788
|
It.push(r.y);
|
|
@@ -4808,7 +4810,7 @@ function wc(t, e = "blob", n = 1) {
|
|
|
4808
4810
|
async function vc(t) {
|
|
4809
4811
|
const { landmarksFn: e, videoEl: n, gesture: r, gestureThreshold: s, generatedNumber: o = 5, waitTime: c = 100, detectionScore: f = 0.5 } = t, [d, h] = va.get(r);
|
|
4810
4812
|
if (!d) return !1;
|
|
4811
|
-
const l = [], v =
|
|
4813
|
+
const l = [], v = Ea(e, n, o, c, f);
|
|
4812
4814
|
for (const O of v) {
|
|
4813
4815
|
const I = await O;
|
|
4814
4816
|
if (!I) continue;
|
|
@@ -4817,7 +4819,7 @@ async function vc(t) {
|
|
|
4817
4819
|
}
|
|
4818
4820
|
return l.includes(!0);
|
|
4819
4821
|
}
|
|
4820
|
-
const
|
|
4822
|
+
const Ec = { DATE_VALUE_FORMAT: ti, COMMON_TEXT: dt, IMAGE_TYPE: pn, MEDIA_TYPE: mn, DOC_TYPE: gn, FILE_TYPE: ni }, Tc = {
|
|
4821
4823
|
encodeURIToParams: wn,
|
|
4822
4824
|
paramsToQueryString: li,
|
|
4823
4825
|
queryStringToParams: hi,
|
|
@@ -4833,7 +4835,7 @@ const Tc = { DATE_VALUE_FORMAT: ti, COMMON_TEXT: dt, IMAGE_TYPE: pn, MEDIA_TYPE:
|
|
|
4833
4835
|
firstLetterToUpperCase: xn,
|
|
4834
4836
|
firstLetterToLowerCase: ai
|
|
4835
4837
|
}, Sc = {
|
|
4836
|
-
validHttp:
|
|
4838
|
+
validHttp: Ms,
|
|
4837
4839
|
validExternal: ks,
|
|
4838
4840
|
validString: Ls,
|
|
4839
4841
|
validNumberStr: Us,
|
|
@@ -4842,14 +4844,14 @@ const Tc = { DATE_VALUE_FORMAT: ti, COMMON_TEXT: dt, IMAGE_TYPE: pn, MEDIA_TYPE:
|
|
|
4842
4844
|
validPassword: js,
|
|
4843
4845
|
validEmail: $s,
|
|
4844
4846
|
validIdNumber: Re,
|
|
4845
|
-
validPhone:
|
|
4846
|
-
validTel:
|
|
4847
|
-
}, Rc = { scrollTo: Fs, addClass: Ds, removeClass: qs, hasClass: Se, toggleClass: Cs, noContextmenu:
|
|
4847
|
+
validPhone: Ks,
|
|
4848
|
+
validTel: Ys
|
|
4849
|
+
}, Rc = { scrollTo: Fs, addClass: Ds, removeClass: qs, hasClass: Se, toggleClass: Cs, noContextmenu: Ns, useRafThrottle: Ps }, Oc = { parseTime: Yt, getTimeDistance: Is, getDayRange: Bs }, Fc = { local: dn, session: ct }, _c = { uuid: As, randomNum: _s };
|
|
4848
4850
|
export {
|
|
4849
|
-
|
|
4851
|
+
Ec as CONSTANTS,
|
|
4850
4852
|
fc as CommonRequest,
|
|
4851
|
-
|
|
4852
|
-
|
|
4853
|
+
Ne as NOOP,
|
|
4854
|
+
Yo as NetworkManager,
|
|
4853
4855
|
uc as Request,
|
|
4854
4856
|
jo as TokenManager,
|
|
4855
4857
|
hc as addResizeListener,
|
|
@@ -4862,21 +4864,21 @@ export {
|
|
|
4862
4864
|
Rc as elementUtil,
|
|
4863
4865
|
xc as faceLivingEvent,
|
|
4864
4866
|
bc as faceLivingEventHint,
|
|
4865
|
-
|
|
4867
|
+
Ma as getArrayFullUrl,
|
|
4866
4868
|
Pa as getBirthdayByIdNumber,
|
|
4867
4869
|
vc as getFaceGestureResult,
|
|
4868
4870
|
wc as getFaceVideoFrame,
|
|
4869
4871
|
Ws as getFullUrl,
|
|
4870
4872
|
qa as getGenderByIdNumber,
|
|
4871
|
-
|
|
4873
|
+
Vs as getLocationConfig,
|
|
4872
4874
|
$a as getMapLocationIcon,
|
|
4873
4875
|
Ha as getPercentage,
|
|
4874
4876
|
Ca as getRandomItemInArray,
|
|
4875
4877
|
lc as getRequestBaseUrl,
|
|
4876
|
-
|
|
4878
|
+
Na as getSystemConfig,
|
|
4877
4879
|
za as loadCss,
|
|
4878
4880
|
ja as loadJs,
|
|
4879
|
-
|
|
4881
|
+
_c as randomUtil,
|
|
4880
4882
|
dc as removeResizeListener,
|
|
4881
4883
|
ka as ricTask,
|
|
4882
4884
|
Ia as sleep,
|
|
@@ -4886,7 +4888,7 @@ export {
|
|
|
4886
4888
|
Qn as sm4Crypto,
|
|
4887
4889
|
yc as sm4Decrypt,
|
|
4888
4890
|
gc as sm4Encrypt,
|
|
4889
|
-
|
|
4891
|
+
Tc as toUtil,
|
|
4890
4892
|
Js as transformPathName,
|
|
4891
4893
|
Zs as trimArray,
|
|
4892
4894
|
Sc as validUtil
|