@wormhole-foundation/wormhole-connect 2.1.0-beta.1-development → 2.1.0-beta.2-development
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/assets/{ccip-j5QHovIT.js → ccip-DfI9A4kL.js} +1 -1
- package/dist/assets/{evm-B5I5ieRn.js → evm-CYICYl2d.js} +3 -3
- package/dist/assets/index-26ve8f2n.js +531 -0
- package/dist/assets/index-NqsKKz5-.js +14 -0
- package/dist/assets/index.es-CephYdxr.js +47 -0
- package/dist/assets/{solana-c_vE3Ye5.js → solana-DXbD7wpn.js} +2 -2
- package/dist/assets/{solanaEmbed.esm-Bx0ME0S1.js → solanaEmbed.esm-CcwIvLto.js} +10 -10
- package/dist/main.js +3 -3
- package/lib/{aptos-CzT6f7Ba.js → aptos-7G9wZkGW.js} +2 -2
- package/lib/{aptos-wFa1-xae.mjs → aptos-BlOWGpyT.mjs} +2 -2
- package/lib/{aptos-CqfHXKy7.js → aptos-CYxRBLR_.js} +1 -1
- package/lib/{aptos-DxhN-FI3.mjs → aptos-Ckopfy7I.mjs} +5 -5
- package/lib/{base64-C_XWimVd.js → base64-CFR5QWTY.js} +1 -1
- package/lib/{base64-L1vzz0KI.mjs → base64-HSuzVIKw.mjs} +1 -1
- package/lib/{ccip-z81HbzxN.mjs → ccip-Bntg_vPp.mjs} +1 -1
- package/lib/{ccip-D6aPw5Ue.js → ccip-CVUhxB0q.js} +1 -1
- package/lib/{chunk-IMTC3J2M-CazR2ogu.mjs → chunk-IMTC3J2M-BADDWO3l.mjs} +3 -3
- package/lib/{chunk-IMTC3J2M-WMj1Jt5m.js → chunk-IMTC3J2M-ByR5Yjf4.js} +1 -1
- package/lib/{events-D4Mv_WYU.js → events-jATx_JnD.js} +1 -1
- package/lib/{events-BrdIAbQL.mjs → events-lD3LhLH0.mjs} +1 -1
- package/lib/{evm-CB6zu7io.mjs → evm-BW0CHBCG.mjs} +5 -5
- package/lib/{evm-Fk4wBAda.js → evm-Bh1Y4eUx.js} +1 -1
- package/lib/{evm-CULALpUt.mjs → evm-ColKfWEz.mjs} +10 -6
- package/lib/{evm-BJL8RjTB.js → evm-z5yFHxM9.js} +3 -3
- package/lib/{index-D2y7My6x.mjs → index-2fBRXVP8.mjs} +2 -2
- package/lib/{index-Cuov-W4s.js → index-8-70GvMi.js} +1 -1
- package/lib/{index-Xy8XaqU-.js → index-8JCep4IW.js} +1 -1
- package/lib/{index-BTmEJpYG.mjs → index-B9GU1bLs.mjs} +1 -1
- package/lib/{index-CS3t6bxx.mjs → index-BXkdaYu_.mjs} +1 -1
- package/lib/{index-DEpSdwA-.mjs → index-BZ0W_BZS.mjs} +2 -2
- package/lib/{index-CtpCK8QC.js → index-BcdbCktu.js} +1 -1
- package/lib/{index-BnVRRJvv.js → index-BhexWYVn.js} +1 -1
- package/lib/{index-BT_eiQVC.js → index-C-OIv0gT.js} +1 -1
- package/lib/{index-CAqS4koK.js → index-C6WDEDwO.js} +1 -1
- package/lib/{index-BqaYMlOq.mjs → index-CAUvtNGE.mjs} +3 -3
- package/lib/{index-DpfI-2hT.mjs → index-CBxgME-2.mjs} +2 -2
- package/lib/{index-Dtg6idl8.js → index-CCUy1jes.js} +1 -1
- package/lib/{index-DGcrnWdu.mjs → index-CYBM2IeY.mjs} +13 -12
- package/lib/{index-DJJ3umH8.mjs → index-CcFpkXPM.mjs} +2 -2
- package/lib/{index-BqCducVx.mjs → index-CfnNi3Zd.mjs} +3 -3
- package/lib/{index-DdRe9fUB.mjs → index-Cl6LSKsg.mjs} +1 -1
- package/lib/{index-DtqIOAjg.mjs → index-CxQ-swIQ.mjs} +1 -1
- package/lib/index-Cxw9PIcl.js +531 -0
- package/lib/{index-CGdGYg5B.mjs → index-D0XcjaUl.mjs} +2 -2
- package/lib/{index-B9FwYN90.js → index-D7IcLxQc.js} +1 -1
- package/lib/index-DAzDpd7U.js +14 -0
- package/lib/{index-jC1hUxPJ.mjs → index-DB_r424l.mjs} +1 -1
- package/lib/{index-C_2eG0Va.mjs → index-DECw2aR6.mjs} +1 -1
- package/lib/{index-CuPOodtE.js → index-DGgQSMuG.js} +1 -1
- package/lib/{index-BsmdxKnE.mjs → index-DIAuhm70.mjs} +3008 -3525
- package/lib/{index-CuWt4RaJ.js → index-DOXMkFA4.js} +1 -1
- package/lib/{index-BGZONAdj.js → index-DQVQrflZ.js} +1 -1
- package/lib/{index-GM4m48QO.js → index-DUXnbpVg.js} +1 -1
- package/lib/{index-DUGwXho3.js → index-DZvLy2Dr.js} +3 -3
- package/lib/{index-BsYhqVq_.js → index-DjkMeATf.js} +1 -1
- package/lib/{index-C0MgLwy8.js → index-DleO04Ea.js} +1 -1
- package/lib/{index-HeldZ3mJ.mjs → index-InC6In6o.mjs} +2 -2
- package/lib/{index-CkUMgihl.js → index-V7kxzAZX.js} +1 -1
- package/lib/{index-B5TOuhBB.js → index-WLqZ1uO7.js} +1 -1
- package/lib/{index-Cf2BEUjb.mjs → index-gd_dleYk.mjs} +1 -1
- package/lib/{index-CayMgbM_.js → index-l0NqjNj9.js} +1 -1
- package/lib/{index-wAClTIQn.mjs → index-lEBTHIqm.mjs} +2 -2
- package/lib/{index-DsYAlD9Y.mjs → index-lHA40g0z.mjs} +2 -2
- package/lib/index-oPxOJfPK.mjs +3236 -0
- package/lib/{index-ChzkRsG0.js → index-rFhS51F6.js} +1 -1
- package/lib/{index-DXIpHh2N.mjs → index-y_DeeCWD.mjs} +4 -4
- package/lib/index.es-Doowrf9a.js +46 -0
- package/lib/index.es-YqKQxHG6.mjs +7725 -0
- package/lib/index.js +1 -1
- package/lib/index.mjs +1 -1
- package/lib/{signer-BBJR-S7u.mjs → signer-CfU9wW3f.mjs} +1 -1
- package/lib/{signer-D8m72nd4.js → signer-eoVHaZz7.js} +1 -1
- package/lib/{solana-DB5vwgKO.mjs → solana-CHUnEnef.mjs} +4 -4
- package/lib/{solana-tZZpsxE8.js → solana-C_d_AKET.js} +1 -1
- package/lib/solana-SFHXHGL2.js +1 -0
- package/lib/{solana-DdLCPKF2.mjs → solana-y-l38J4U.mjs} +5 -5
- package/lib/{solanaEmbed.esm-TpsYEDsw.js → solanaEmbed.esm-B4tNQ7S7.js} +10 -10
- package/lib/{solanaEmbed.esm-ANGjgiaN.mjs → solanaEmbed.esm-DVOHg5WI.mjs} +1559 -1560
- package/lib/{sui-BFNsLy1t.mjs → sui-1fbLRIUL.mjs} +5 -5
- package/lib/{sui-UELhAZj0.js → sui-BN1m6APK.js} +1 -1
- package/lib/{sui-DKw9LmTC.mjs → sui-D9frS9ki.mjs} +1 -1
- package/lib/{sui-D9F11hKw.js → sui-K20aVxqE.js} +2 -2
- package/package.json +5 -1
- package/dist/assets/index-BUd_4Lqz.js +0 -14
- package/dist/assets/index-Db_i6Hbk.js +0 -531
- package/dist/assets/index.es-BYwyqXqm.js +0 -47
- package/lib/index-5EBn2EJL.mjs +0 -2709
- package/lib/index-CYpOkqEl.js +0 -14
- package/lib/index-Cst2493l.js +0 -531
- package/lib/index.es-DG7BWZ8R.js +0 -46
- package/lib/index.es-IbuqEs8_.mjs +0 -8242
- package/lib/solana-521ACL4P.js +0 -1
package/lib/index-5EBn2EJL.mjs
DELETED
|
@@ -1,2709 +0,0 @@
|
|
|
1
|
-
import { b as io, d as oo, f as so, g as ao, i as uo, j as co, k as fo, l as lo, m as ho, n as bo, c as po } from "./index-DtqIOAjg.mjs";
|
|
2
|
-
import { V as je, X as yn, cr as go, aB as ge } from "./index-DGcrnWdu.mjs";
|
|
3
|
-
function mn(e = 0) {
|
|
4
|
-
return globalThis.Buffer != null && globalThis.Buffer.allocUnsafe != null ? globalThis.Buffer.allocUnsafe(e) : new Uint8Array(e);
|
|
5
|
-
}
|
|
6
|
-
function Kc(e, t) {
|
|
7
|
-
t || (t = e.reduce((i, o) => i + o.length, 0));
|
|
8
|
-
const r = mn(t);
|
|
9
|
-
let n = 0;
|
|
10
|
-
for (const i of e)
|
|
11
|
-
r.set(i, n), n += i.length;
|
|
12
|
-
return r;
|
|
13
|
-
}
|
|
14
|
-
const Mr = {
|
|
15
|
-
...bo,
|
|
16
|
-
...ho,
|
|
17
|
-
...lo,
|
|
18
|
-
...fo,
|
|
19
|
-
...co,
|
|
20
|
-
...uo,
|
|
21
|
-
...ao,
|
|
22
|
-
...so,
|
|
23
|
-
...oo,
|
|
24
|
-
...io
|
|
25
|
-
};
|
|
26
|
-
function vn(e, t, r, n) {
|
|
27
|
-
return {
|
|
28
|
-
name: e,
|
|
29
|
-
prefix: t,
|
|
30
|
-
encoder: {
|
|
31
|
-
name: e,
|
|
32
|
-
prefix: t,
|
|
33
|
-
encode: r
|
|
34
|
-
},
|
|
35
|
-
decoder: { decode: n }
|
|
36
|
-
};
|
|
37
|
-
}
|
|
38
|
-
const Hr = vn("utf8", "u", (e) => "u" + new TextDecoder("utf8").decode(e), (e) => new TextEncoder().encode(e.substring(1))), Kt = vn("ascii", "a", (e) => {
|
|
39
|
-
let t = "a";
|
|
40
|
-
for (let r = 0; r < e.length; r++)
|
|
41
|
-
t += String.fromCharCode(e[r]);
|
|
42
|
-
return t;
|
|
43
|
-
}, (e) => {
|
|
44
|
-
e = e.substring(1);
|
|
45
|
-
const t = mn(e.length);
|
|
46
|
-
for (let r = 0; r < e.length; r++)
|
|
47
|
-
t[r] = e.charCodeAt(r);
|
|
48
|
-
return t;
|
|
49
|
-
}), _n = {
|
|
50
|
-
utf8: Hr,
|
|
51
|
-
"utf-8": Hr,
|
|
52
|
-
hex: Mr.base16,
|
|
53
|
-
latin1: Kt,
|
|
54
|
-
ascii: Kt,
|
|
55
|
-
binary: Kt,
|
|
56
|
-
...Mr
|
|
57
|
-
};
|
|
58
|
-
function Jc(e, t = "utf8") {
|
|
59
|
-
const r = _n[t];
|
|
60
|
-
if (!r)
|
|
61
|
-
throw new Error(`Unsupported encoding "${t}"`);
|
|
62
|
-
return (t === "utf8" || t === "utf-8") && globalThis.Buffer != null && globalThis.Buffer.from != null ? globalThis.Buffer.from(e, "utf8") : r.decoder.decode(`${r.prefix}${e}`);
|
|
63
|
-
}
|
|
64
|
-
function Zc(e, t = "utf8") {
|
|
65
|
-
const r = _n[t];
|
|
66
|
-
if (!r)
|
|
67
|
-
throw new Error(`Unsupported encoding "${t}"`);
|
|
68
|
-
return (t === "utf8" || t === "utf-8") && globalThis.Buffer != null && globalThis.Buffer.from != null ? globalThis.Buffer.from(e.buffer, e.byteOffset, e.byteLength).toString("utf8") : r.encoder.encode(e).substring(1);
|
|
69
|
-
}
|
|
70
|
-
var $r = function(e, t, r) {
|
|
71
|
-
if (r || arguments.length === 2) for (var n = 0, i = t.length, o; n < i; n++)
|
|
72
|
-
(o || !(n in t)) && (o || (o = Array.prototype.slice.call(t, 0, n)), o[n] = t[n]);
|
|
73
|
-
return e.concat(o || Array.prototype.slice.call(t));
|
|
74
|
-
}, wo = (
|
|
75
|
-
/** @class */
|
|
76
|
-
/* @__PURE__ */ function() {
|
|
77
|
-
function e(t, r, n) {
|
|
78
|
-
this.name = t, this.version = r, this.os = n, this.type = "browser";
|
|
79
|
-
}
|
|
80
|
-
return e;
|
|
81
|
-
}()
|
|
82
|
-
), yo = (
|
|
83
|
-
/** @class */
|
|
84
|
-
/* @__PURE__ */ function() {
|
|
85
|
-
function e(t) {
|
|
86
|
-
this.version = t, this.type = "node", this.name = "node", this.os = je.process.platform;
|
|
87
|
-
}
|
|
88
|
-
return e;
|
|
89
|
-
}()
|
|
90
|
-
), mo = (
|
|
91
|
-
/** @class */
|
|
92
|
-
/* @__PURE__ */ function() {
|
|
93
|
-
function e(t, r, n, i) {
|
|
94
|
-
this.name = t, this.version = r, this.os = n, this.bot = i, this.type = "bot-device";
|
|
95
|
-
}
|
|
96
|
-
return e;
|
|
97
|
-
}()
|
|
98
|
-
), vo = (
|
|
99
|
-
/** @class */
|
|
100
|
-
/* @__PURE__ */ function() {
|
|
101
|
-
function e() {
|
|
102
|
-
this.type = "bot", this.bot = !0, this.name = "bot", this.version = null, this.os = null;
|
|
103
|
-
}
|
|
104
|
-
return e;
|
|
105
|
-
}()
|
|
106
|
-
), _o = (
|
|
107
|
-
/** @class */
|
|
108
|
-
/* @__PURE__ */ function() {
|
|
109
|
-
function e() {
|
|
110
|
-
this.type = "react-native", this.name = "react-native", this.version = null, this.os = null;
|
|
111
|
-
}
|
|
112
|
-
return e;
|
|
113
|
-
}()
|
|
114
|
-
), xo = /alexa|bot|crawl(er|ing)|facebookexternalhit|feedburner|google web preview|nagios|postrank|pingdom|slurp|spider|yahoo!|yandex/, Eo = /(nuhk|curl|Googlebot|Yammybot|Openbot|Slurp|MSNBot|Ask\ Jeeves\/Teoma|ia_archiver)/, kr = 3, Fo = [
|
|
115
|
-
["aol", /AOLShield\/([0-9\._]+)/],
|
|
116
|
-
["edge", /Edge\/([0-9\._]+)/],
|
|
117
|
-
["edge-ios", /EdgiOS\/([0-9\._]+)/],
|
|
118
|
-
["yandexbrowser", /YaBrowser\/([0-9\._]+)/],
|
|
119
|
-
["kakaotalk", /KAKAOTALK\s([0-9\.]+)/],
|
|
120
|
-
["samsung", /SamsungBrowser\/([0-9\.]+)/],
|
|
121
|
-
["silk", /\bSilk\/([0-9._-]+)\b/],
|
|
122
|
-
["miui", /MiuiBrowser\/([0-9\.]+)$/],
|
|
123
|
-
["beaker", /BeakerBrowser\/([0-9\.]+)/],
|
|
124
|
-
["edge-chromium", /EdgA?\/([0-9\.]+)/],
|
|
125
|
-
[
|
|
126
|
-
"chromium-webview",
|
|
127
|
-
/(?!Chrom.*OPR)wv\).*Chrom(?:e|ium)\/([0-9\.]+)(:?\s|$)/
|
|
128
|
-
],
|
|
129
|
-
["chrome", /(?!Chrom.*OPR)Chrom(?:e|ium)\/([0-9\.]+)(:?\s|$)/],
|
|
130
|
-
["phantomjs", /PhantomJS\/([0-9\.]+)(:?\s|$)/],
|
|
131
|
-
["crios", /CriOS\/([0-9\.]+)(:?\s|$)/],
|
|
132
|
-
["firefox", /Firefox\/([0-9\.]+)(?:\s|$)/],
|
|
133
|
-
["fxios", /FxiOS\/([0-9\.]+)/],
|
|
134
|
-
["opera-mini", /Opera Mini.*Version\/([0-9\.]+)/],
|
|
135
|
-
["opera", /Opera\/([0-9\.]+)(?:\s|$)/],
|
|
136
|
-
["opera", /OPR\/([0-9\.]+)(:?\s|$)/],
|
|
137
|
-
["pie", /^Microsoft Pocket Internet Explorer\/(\d+\.\d+)$/],
|
|
138
|
-
["pie", /^Mozilla\/\d\.\d+\s\(compatible;\s(?:MSP?IE|MSInternet Explorer) (\d+\.\d+);.*Windows CE.*\)$/],
|
|
139
|
-
["netfront", /^Mozilla\/\d\.\d+.*NetFront\/(\d.\d)/],
|
|
140
|
-
["ie", /Trident\/7\.0.*rv\:([0-9\.]+).*\).*Gecko$/],
|
|
141
|
-
["ie", /MSIE\s([0-9\.]+);.*Trident\/[4-7].0/],
|
|
142
|
-
["ie", /MSIE\s(7\.0)/],
|
|
143
|
-
["bb10", /BB10;\sTouch.*Version\/([0-9\.]+)/],
|
|
144
|
-
["android", /Android\s([0-9\.]+)/],
|
|
145
|
-
["ios", /Version\/([0-9\._]+).*Mobile.*Safari.*/],
|
|
146
|
-
["safari", /Version\/([0-9\._]+).*Safari/],
|
|
147
|
-
["facebook", /FB[AS]V\/([0-9\.]+)/],
|
|
148
|
-
["instagram", /Instagram\s([0-9\.]+)/],
|
|
149
|
-
["ios-webview", /AppleWebKit\/([0-9\.]+).*Mobile/],
|
|
150
|
-
["ios-webview", /AppleWebKit\/([0-9\.]+).*Gecko\)$/],
|
|
151
|
-
["curl", /^curl\/([0-9\.]+)$/],
|
|
152
|
-
["searchbot", xo]
|
|
153
|
-
], Gr = [
|
|
154
|
-
["iOS", /iP(hone|od|ad)/],
|
|
155
|
-
["Android OS", /Android/],
|
|
156
|
-
["BlackBerry OS", /BlackBerry|BB10/],
|
|
157
|
-
["Windows Mobile", /IEMobile/],
|
|
158
|
-
["Amazon OS", /Kindle/],
|
|
159
|
-
["Windows 3.11", /Win16/],
|
|
160
|
-
["Windows 95", /(Windows 95)|(Win95)|(Windows_95)/],
|
|
161
|
-
["Windows 98", /(Windows 98)|(Win98)/],
|
|
162
|
-
["Windows 2000", /(Windows NT 5.0)|(Windows 2000)/],
|
|
163
|
-
["Windows XP", /(Windows NT 5.1)|(Windows XP)/],
|
|
164
|
-
["Windows Server 2003", /(Windows NT 5.2)/],
|
|
165
|
-
["Windows Vista", /(Windows NT 6.0)/],
|
|
166
|
-
["Windows 7", /(Windows NT 6.1)/],
|
|
167
|
-
["Windows 8", /(Windows NT 6.2)/],
|
|
168
|
-
["Windows 8.1", /(Windows NT 6.3)/],
|
|
169
|
-
["Windows 10", /(Windows NT 10.0)/],
|
|
170
|
-
["Windows ME", /Windows ME/],
|
|
171
|
-
["Windows CE", /Windows CE|WinCE|Microsoft Pocket Internet Explorer/],
|
|
172
|
-
["Open BSD", /OpenBSD/],
|
|
173
|
-
["Sun OS", /SunOS/],
|
|
174
|
-
["Chrome OS", /CrOS/],
|
|
175
|
-
["Linux", /(Linux)|(X11)/],
|
|
176
|
-
["Mac OS", /(Mac_PowerPC)|(Macintosh)/],
|
|
177
|
-
["QNX", /QNX/],
|
|
178
|
-
["BeOS", /BeOS/],
|
|
179
|
-
["OS/2", /OS\/2/]
|
|
180
|
-
];
|
|
181
|
-
function Yc(e) {
|
|
182
|
-
return typeof document > "u" && typeof navigator < "u" && navigator.product === "ReactNative" ? new _o() : typeof navigator < "u" ? Bo(navigator.userAgent) : Oo();
|
|
183
|
-
}
|
|
184
|
-
function Ao(e) {
|
|
185
|
-
return e !== "" && Fo.reduce(function(t, r) {
|
|
186
|
-
var n = r[0], i = r[1];
|
|
187
|
-
if (t)
|
|
188
|
-
return t;
|
|
189
|
-
var o = i.exec(e);
|
|
190
|
-
return !!o && [n, o];
|
|
191
|
-
}, !1);
|
|
192
|
-
}
|
|
193
|
-
function Bo(e) {
|
|
194
|
-
var t = Ao(e);
|
|
195
|
-
if (!t)
|
|
196
|
-
return null;
|
|
197
|
-
var r = t[0], n = t[1];
|
|
198
|
-
if (r === "searchbot")
|
|
199
|
-
return new vo();
|
|
200
|
-
var i = n[1] && n[1].split(".").join("_").split("_").slice(0, 3);
|
|
201
|
-
i ? i.length < kr && (i = $r($r([], i, !0), To(kr - i.length), !0)) : i = [];
|
|
202
|
-
var o = i.join("."), a = So(e), l = Eo.exec(e);
|
|
203
|
-
return l && l[1] ? new mo(r, o, a, l[1]) : new wo(r, o, a);
|
|
204
|
-
}
|
|
205
|
-
function So(e) {
|
|
206
|
-
for (var t = 0, r = Gr.length; t < r; t++) {
|
|
207
|
-
var n = Gr[t], i = n[0], o = n[1], a = o.exec(e);
|
|
208
|
-
if (a)
|
|
209
|
-
return i;
|
|
210
|
-
}
|
|
211
|
-
return null;
|
|
212
|
-
}
|
|
213
|
-
function Oo() {
|
|
214
|
-
var e = typeof je.process < "u" && je.process.version;
|
|
215
|
-
return e ? new yo(je.process.version.slice(1)) : null;
|
|
216
|
-
}
|
|
217
|
-
function To(e) {
|
|
218
|
-
for (var t = [], r = 0; r < e; r++)
|
|
219
|
-
t.push("0");
|
|
220
|
-
return t;
|
|
221
|
-
}
|
|
222
|
-
const Xc = { waku: { publish: "waku_publish", batchPublish: "waku_batchPublish", subscribe: "waku_subscribe", batchSubscribe: "waku_batchSubscribe", subscription: "waku_subscription", unsubscribe: "waku_unsubscribe", batchUnsubscribe: "waku_batchUnsubscribe", batchFetchMessages: "waku_batchFetchMessages" }, irn: { publish: "irn_publish", batchPublish: "irn_batchPublish", subscribe: "irn_subscribe", batchSubscribe: "irn_batchSubscribe", subscription: "irn_subscription", unsubscribe: "irn_unsubscribe", batchUnsubscribe: "irn_batchUnsubscribe", batchFetchMessages: "irn_batchFetchMessages" }, iridium: { publish: "iridium_publish", batchPublish: "iridium_batchPublish", subscribe: "iridium_subscribe", batchSubscribe: "iridium_batchSubscribe", subscription: "iridium_subscription", unsubscribe: "iridium_unsubscribe", batchUnsubscribe: "iridium_batchUnsubscribe", batchFetchMessages: "iridium_batchFetchMessages" } }, Co = /"(?:_|\\u0{2}5[Ff]){2}(?:p|\\u0{2}70)(?:r|\\u0{2}72)(?:o|\\u0{2}6[Ff])(?:t|\\u0{2}74)(?:o|\\u0{2}6[Ff])(?:_|\\u0{2}5[Ff]){2}"\s*:/, Io = /"(?:c|\\u0063)(?:o|\\u006[Ff])(?:n|\\u006[Ee])(?:s|\\u0073)(?:t|\\u0074)(?:r|\\u0072)(?:u|\\u0075)(?:c|\\u0063)(?:t|\\u0074)(?:o|\\u006[Ff])(?:r|\\u0072)"\s*:/, Ro = /^\s*["[{]|^\s*-?\d{1,16}(\.\d{1,17})?([Ee][+-]?\d+)?\s*$/;
|
|
223
|
-
function Lo(e, t) {
|
|
224
|
-
if (e === "__proto__" || e === "constructor" && t && typeof t == "object" && "prototype" in t) {
|
|
225
|
-
Po(e);
|
|
226
|
-
return;
|
|
227
|
-
}
|
|
228
|
-
return t;
|
|
229
|
-
}
|
|
230
|
-
function Po(e) {
|
|
231
|
-
console.warn(`[destr] Dropping "${e}" key to prevent prototype pollution.`);
|
|
232
|
-
}
|
|
233
|
-
function Qc(e, t = {}) {
|
|
234
|
-
if (typeof e != "string")
|
|
235
|
-
return e;
|
|
236
|
-
const r = e.trim();
|
|
237
|
-
if (
|
|
238
|
-
// eslint-disable-next-line unicorn/prefer-at
|
|
239
|
-
e[0] === '"' && e.endsWith('"') && !e.includes("\\")
|
|
240
|
-
)
|
|
241
|
-
return r.slice(1, -1);
|
|
242
|
-
if (r.length <= 9) {
|
|
243
|
-
const n = r.toLowerCase();
|
|
244
|
-
if (n === "true")
|
|
245
|
-
return !0;
|
|
246
|
-
if (n === "false")
|
|
247
|
-
return !1;
|
|
248
|
-
if (n === "undefined")
|
|
249
|
-
return;
|
|
250
|
-
if (n === "null")
|
|
251
|
-
return null;
|
|
252
|
-
if (n === "nan")
|
|
253
|
-
return Number.NaN;
|
|
254
|
-
if (n === "infinity")
|
|
255
|
-
return Number.POSITIVE_INFINITY;
|
|
256
|
-
if (n === "-infinity")
|
|
257
|
-
return Number.NEGATIVE_INFINITY;
|
|
258
|
-
}
|
|
259
|
-
if (!Ro.test(e)) {
|
|
260
|
-
if (t.strict)
|
|
261
|
-
throw new SyntaxError("[destr] Invalid JSON");
|
|
262
|
-
return e;
|
|
263
|
-
}
|
|
264
|
-
try {
|
|
265
|
-
if (Co.test(e) || Io.test(e)) {
|
|
266
|
-
if (t.strict)
|
|
267
|
-
throw new Error("[destr] Possible prototype pollution");
|
|
268
|
-
return JSON.parse(e, Lo);
|
|
269
|
-
}
|
|
270
|
-
return JSON.parse(e);
|
|
271
|
-
} catch (n) {
|
|
272
|
-
if (t.strict)
|
|
273
|
-
throw n;
|
|
274
|
-
return e;
|
|
275
|
-
}
|
|
276
|
-
}
|
|
277
|
-
function ze(e) {
|
|
278
|
-
return new Promise((t, r) => {
|
|
279
|
-
e.oncomplete = e.onsuccess = () => t(e.result), e.onabort = e.onerror = () => r(e.error);
|
|
280
|
-
});
|
|
281
|
-
}
|
|
282
|
-
function No(e, t) {
|
|
283
|
-
const r = indexedDB.open(e);
|
|
284
|
-
r.onupgradeneeded = () => r.result.createObjectStore(t);
|
|
285
|
-
const n = ze(r);
|
|
286
|
-
return (i, o) => n.then((a) => o(a.transaction(t, i).objectStore(t)));
|
|
287
|
-
}
|
|
288
|
-
let Jt;
|
|
289
|
-
function st() {
|
|
290
|
-
return Jt || (Jt = No("keyval-store", "keyval")), Jt;
|
|
291
|
-
}
|
|
292
|
-
function ef(e, t = st()) {
|
|
293
|
-
return t("readonly", (r) => ze(r.get(e)));
|
|
294
|
-
}
|
|
295
|
-
function tf(e, t, r = st()) {
|
|
296
|
-
return r("readwrite", (n) => (n.put(t, e), ze(n.transaction)));
|
|
297
|
-
}
|
|
298
|
-
function rf(e, t = st()) {
|
|
299
|
-
return t("readwrite", (r) => (r.delete(e), ze(r.transaction)));
|
|
300
|
-
}
|
|
301
|
-
function nf(e = st()) {
|
|
302
|
-
return e("readwrite", (t) => (t.clear(), ze(t.transaction)));
|
|
303
|
-
}
|
|
304
|
-
function Uo(e, t) {
|
|
305
|
-
return e.openCursor().onsuccess = function() {
|
|
306
|
-
this.result && (t(this.result), this.result.continue());
|
|
307
|
-
}, ze(e.transaction);
|
|
308
|
-
}
|
|
309
|
-
function of(e = st()) {
|
|
310
|
-
return e("readonly", (t) => {
|
|
311
|
-
if (t.getAllKeys)
|
|
312
|
-
return ze(t.getAllKeys());
|
|
313
|
-
const r = [];
|
|
314
|
-
return Uo(t, (n) => r.push(n.key)).then(() => r);
|
|
315
|
-
});
|
|
316
|
-
}
|
|
317
|
-
class sf {
|
|
318
|
-
}
|
|
319
|
-
function jo(e) {
|
|
320
|
-
try {
|
|
321
|
-
return JSON.stringify(e);
|
|
322
|
-
} catch {
|
|
323
|
-
return '"[Circular]"';
|
|
324
|
-
}
|
|
325
|
-
}
|
|
326
|
-
var zo = Do;
|
|
327
|
-
function Do(e, t, r) {
|
|
328
|
-
var n = r && r.stringify || jo, i = 1;
|
|
329
|
-
if (typeof e == "object" && e !== null) {
|
|
330
|
-
var o = t.length + i;
|
|
331
|
-
if (o === 1) return e;
|
|
332
|
-
var a = new Array(o);
|
|
333
|
-
a[0] = n(e);
|
|
334
|
-
for (var l = 1; l < o; l++)
|
|
335
|
-
a[l] = n(t[l]);
|
|
336
|
-
return a.join(" ");
|
|
337
|
-
}
|
|
338
|
-
if (typeof e != "string")
|
|
339
|
-
return e;
|
|
340
|
-
var u = t.length;
|
|
341
|
-
if (u === 0) return e;
|
|
342
|
-
for (var h = "", f = 1 - i, b = -1, y = e && e.length || 0, g = 0; g < y; ) {
|
|
343
|
-
if (e.charCodeAt(g) === 37 && g + 1 < y) {
|
|
344
|
-
switch (b = b > -1 ? b : 0, e.charCodeAt(g + 1)) {
|
|
345
|
-
case 100:
|
|
346
|
-
case 102:
|
|
347
|
-
if (f >= u || t[f] == null) break;
|
|
348
|
-
b < g && (h += e.slice(b, g)), h += Number(t[f]), b = g + 2, g++;
|
|
349
|
-
break;
|
|
350
|
-
case 105:
|
|
351
|
-
if (f >= u || t[f] == null) break;
|
|
352
|
-
b < g && (h += e.slice(b, g)), h += Math.floor(Number(t[f])), b = g + 2, g++;
|
|
353
|
-
break;
|
|
354
|
-
case 79:
|
|
355
|
-
case 111:
|
|
356
|
-
case 106:
|
|
357
|
-
if (f >= u || t[f] === void 0) break;
|
|
358
|
-
b < g && (h += e.slice(b, g));
|
|
359
|
-
var p = typeof t[f];
|
|
360
|
-
if (p === "string") {
|
|
361
|
-
h += "'" + t[f] + "'", b = g + 2, g++;
|
|
362
|
-
break;
|
|
363
|
-
}
|
|
364
|
-
if (p === "function") {
|
|
365
|
-
h += t[f].name || "<anonymous>", b = g + 2, g++;
|
|
366
|
-
break;
|
|
367
|
-
}
|
|
368
|
-
h += n(t[f]), b = g + 2, g++;
|
|
369
|
-
break;
|
|
370
|
-
case 115:
|
|
371
|
-
if (f >= u)
|
|
372
|
-
break;
|
|
373
|
-
b < g && (h += e.slice(b, g)), h += String(t[f]), b = g + 2, g++;
|
|
374
|
-
break;
|
|
375
|
-
case 37:
|
|
376
|
-
b < g && (h += e.slice(b, g)), h += "%", b = g + 2, g++, f--;
|
|
377
|
-
break;
|
|
378
|
-
}
|
|
379
|
-
++f;
|
|
380
|
-
}
|
|
381
|
-
++g;
|
|
382
|
-
}
|
|
383
|
-
return b === -1 ? e : (b < y && (h += e.slice(b)), h);
|
|
384
|
-
}
|
|
385
|
-
const Vr = zo;
|
|
386
|
-
var Ge = we;
|
|
387
|
-
const nt = Jo().console || {}, Mo = {
|
|
388
|
-
mapHttpRequest: Ft,
|
|
389
|
-
mapHttpResponse: Ft,
|
|
390
|
-
wrapRequestSerializer: Zt,
|
|
391
|
-
wrapResponseSerializer: Zt,
|
|
392
|
-
wrapErrorSerializer: Zt,
|
|
393
|
-
req: Ft,
|
|
394
|
-
res: Ft,
|
|
395
|
-
err: Vo
|
|
396
|
-
};
|
|
397
|
-
function Ho(e, t) {
|
|
398
|
-
return Array.isArray(e) ? e.filter(function(n) {
|
|
399
|
-
return n !== "!stdSerializers.err";
|
|
400
|
-
}) : e === !0 ? Object.keys(t) : !1;
|
|
401
|
-
}
|
|
402
|
-
function we(e) {
|
|
403
|
-
e = e || {}, e.browser = e.browser || {};
|
|
404
|
-
const t = e.browser.transmit;
|
|
405
|
-
if (t && typeof t.send != "function")
|
|
406
|
-
throw Error("pino: transmit option must have a send function");
|
|
407
|
-
const r = e.browser.write || nt;
|
|
408
|
-
e.browser.write && (e.browser.asObject = !0);
|
|
409
|
-
const n = e.serializers || {}, i = Ho(e.browser.serialize, n);
|
|
410
|
-
let o = e.browser.serialize;
|
|
411
|
-
Array.isArray(e.browser.serialize) && e.browser.serialize.indexOf("!stdSerializers.err") > -1 && (o = !1);
|
|
412
|
-
const a = ["error", "fatal", "warn", "info", "debug", "trace"];
|
|
413
|
-
typeof r == "function" && (r.error = r.fatal = r.warn = r.info = r.debug = r.trace = r), e.enabled === !1 && (e.level = "silent");
|
|
414
|
-
const l = e.level || "info", u = Object.create(r);
|
|
415
|
-
u.log || (u.log = it), Object.defineProperty(u, "levelVal", {
|
|
416
|
-
get: f
|
|
417
|
-
}), Object.defineProperty(u, "level", {
|
|
418
|
-
get: b,
|
|
419
|
-
set: y
|
|
420
|
-
});
|
|
421
|
-
const h = {
|
|
422
|
-
transmit: t,
|
|
423
|
-
serialize: i,
|
|
424
|
-
asObject: e.browser.asObject,
|
|
425
|
-
levels: a,
|
|
426
|
-
timestamp: Wo(e)
|
|
427
|
-
};
|
|
428
|
-
u.levels = we.levels, u.level = l, u.setMaxListeners = u.getMaxListeners = u.emit = u.addListener = u.on = u.prependListener = u.once = u.prependOnceListener = u.removeListener = u.removeAllListeners = u.listeners = u.listenerCount = u.eventNames = u.write = u.flush = it, u.serializers = n, u._serialize = i, u._stdErrSerialize = o, u.child = g, t && (u._logEvent = or());
|
|
429
|
-
function f() {
|
|
430
|
-
return this.level === "silent" ? 1 / 0 : this.levels.values[this.level];
|
|
431
|
-
}
|
|
432
|
-
function b() {
|
|
433
|
-
return this._level;
|
|
434
|
-
}
|
|
435
|
-
function y(p) {
|
|
436
|
-
if (p !== "silent" && !this.levels.values[p])
|
|
437
|
-
throw Error("unknown level " + p);
|
|
438
|
-
this._level = p, He(h, u, "error", "log"), He(h, u, "fatal", "error"), He(h, u, "warn", "error"), He(h, u, "info", "log"), He(h, u, "debug", "log"), He(h, u, "trace", "log");
|
|
439
|
-
}
|
|
440
|
-
function g(p, _) {
|
|
441
|
-
if (!p)
|
|
442
|
-
throw new Error("missing bindings for child Pino");
|
|
443
|
-
_ = _ || {}, i && p.serializers && (_.serializers = p.serializers);
|
|
444
|
-
const R = _.serializers;
|
|
445
|
-
if (i && R) {
|
|
446
|
-
var P = Object.assign({}, n, R), I = e.browser.serialize === !0 ? Object.keys(P) : i;
|
|
447
|
-
delete p.serializers, Pt([p], I, P, this._stdErrSerialize);
|
|
448
|
-
}
|
|
449
|
-
function m(O) {
|
|
450
|
-
this._childLevel = (O._childLevel | 0) + 1, this.error = $e(O, p, "error"), this.fatal = $e(O, p, "fatal"), this.warn = $e(O, p, "warn"), this.info = $e(O, p, "info"), this.debug = $e(O, p, "debug"), this.trace = $e(O, p, "trace"), P && (this.serializers = P, this._serialize = I), t && (this._logEvent = or(
|
|
451
|
-
[].concat(O._logEvent.bindings, p)
|
|
452
|
-
));
|
|
453
|
-
}
|
|
454
|
-
return m.prototype = this, new m(this);
|
|
455
|
-
}
|
|
456
|
-
return u;
|
|
457
|
-
}
|
|
458
|
-
we.levels = {
|
|
459
|
-
values: {
|
|
460
|
-
fatal: 60,
|
|
461
|
-
error: 50,
|
|
462
|
-
warn: 40,
|
|
463
|
-
info: 30,
|
|
464
|
-
debug: 20,
|
|
465
|
-
trace: 10
|
|
466
|
-
},
|
|
467
|
-
labels: {
|
|
468
|
-
10: "trace",
|
|
469
|
-
20: "debug",
|
|
470
|
-
30: "info",
|
|
471
|
-
40: "warn",
|
|
472
|
-
50: "error",
|
|
473
|
-
60: "fatal"
|
|
474
|
-
}
|
|
475
|
-
};
|
|
476
|
-
we.stdSerializers = Mo;
|
|
477
|
-
we.stdTimeFunctions = Object.assign({}, { nullTime: xn, epochTime: En, unixTime: qo, isoTime: Ko });
|
|
478
|
-
function He(e, t, r, n) {
|
|
479
|
-
const i = Object.getPrototypeOf(t);
|
|
480
|
-
t[r] = t.levelVal > t.levels.values[r] ? it : i[r] ? i[r] : nt[r] || nt[n] || it, $o(e, t, r);
|
|
481
|
-
}
|
|
482
|
-
function $o(e, t, r) {
|
|
483
|
-
!e.transmit && t[r] === it || (t[r] = /* @__PURE__ */ function(n) {
|
|
484
|
-
return function() {
|
|
485
|
-
const o = e.timestamp(), a = new Array(arguments.length), l = Object.getPrototypeOf && Object.getPrototypeOf(this) === nt ? nt : this;
|
|
486
|
-
for (var u = 0; u < a.length; u++) a[u] = arguments[u];
|
|
487
|
-
if (e.serialize && !e.asObject && Pt(a, this._serialize, this.serializers, this._stdErrSerialize), e.asObject ? n.call(l, ko(this, r, a, o)) : n.apply(l, a), e.transmit) {
|
|
488
|
-
const h = e.transmit.level || t.level, f = we.levels.values[h], b = we.levels.values[r];
|
|
489
|
-
if (b < f) return;
|
|
490
|
-
Go(this, {
|
|
491
|
-
ts: o,
|
|
492
|
-
methodLevel: r,
|
|
493
|
-
methodValue: b,
|
|
494
|
-
transmitValue: we.levels.values[e.transmit.level || t.level],
|
|
495
|
-
send: e.transmit.send,
|
|
496
|
-
val: t.levelVal
|
|
497
|
-
}, a);
|
|
498
|
-
}
|
|
499
|
-
};
|
|
500
|
-
}(t[r]));
|
|
501
|
-
}
|
|
502
|
-
function ko(e, t, r, n) {
|
|
503
|
-
e._serialize && Pt(r, e._serialize, e.serializers, e._stdErrSerialize);
|
|
504
|
-
const i = r.slice();
|
|
505
|
-
let o = i[0];
|
|
506
|
-
const a = {};
|
|
507
|
-
n && (a.time = n), a.level = we.levels.values[t];
|
|
508
|
-
let l = (e._childLevel | 0) + 1;
|
|
509
|
-
if (l < 1 && (l = 1), o !== null && typeof o == "object") {
|
|
510
|
-
for (; l-- && typeof i[0] == "object"; )
|
|
511
|
-
Object.assign(a, i.shift());
|
|
512
|
-
o = i.length ? Vr(i.shift(), i) : void 0;
|
|
513
|
-
} else typeof o == "string" && (o = Vr(i.shift(), i));
|
|
514
|
-
return o !== void 0 && (a.msg = o), a;
|
|
515
|
-
}
|
|
516
|
-
function Pt(e, t, r, n) {
|
|
517
|
-
for (const i in e)
|
|
518
|
-
if (n && e[i] instanceof Error)
|
|
519
|
-
e[i] = we.stdSerializers.err(e[i]);
|
|
520
|
-
else if (typeof e[i] == "object" && !Array.isArray(e[i]))
|
|
521
|
-
for (const o in e[i])
|
|
522
|
-
t && t.indexOf(o) > -1 && o in r && (e[i][o] = r[o](e[i][o]));
|
|
523
|
-
}
|
|
524
|
-
function $e(e, t, r) {
|
|
525
|
-
return function() {
|
|
526
|
-
const n = new Array(1 + arguments.length);
|
|
527
|
-
n[0] = t;
|
|
528
|
-
for (var i = 1; i < n.length; i++)
|
|
529
|
-
n[i] = arguments[i - 1];
|
|
530
|
-
return e[r].apply(this, n);
|
|
531
|
-
};
|
|
532
|
-
}
|
|
533
|
-
function Go(e, t, r) {
|
|
534
|
-
const n = t.send, i = t.ts, o = t.methodLevel, a = t.methodValue, l = t.val, u = e._logEvent.bindings;
|
|
535
|
-
Pt(
|
|
536
|
-
r,
|
|
537
|
-
e._serialize || Object.keys(e.serializers),
|
|
538
|
-
e.serializers,
|
|
539
|
-
e._stdErrSerialize === void 0 ? !0 : e._stdErrSerialize
|
|
540
|
-
), e._logEvent.ts = i, e._logEvent.messages = r.filter(function(h) {
|
|
541
|
-
return u.indexOf(h) === -1;
|
|
542
|
-
}), e._logEvent.level.label = o, e._logEvent.level.value = a, n(o, e._logEvent, l), e._logEvent = or(u);
|
|
543
|
-
}
|
|
544
|
-
function or(e) {
|
|
545
|
-
return {
|
|
546
|
-
ts: 0,
|
|
547
|
-
messages: [],
|
|
548
|
-
bindings: e || [],
|
|
549
|
-
level: { label: "", value: 0 }
|
|
550
|
-
};
|
|
551
|
-
}
|
|
552
|
-
function Vo(e) {
|
|
553
|
-
const t = {
|
|
554
|
-
type: e.constructor.name,
|
|
555
|
-
msg: e.message,
|
|
556
|
-
stack: e.stack
|
|
557
|
-
};
|
|
558
|
-
for (const r in e)
|
|
559
|
-
t[r] === void 0 && (t[r] = e[r]);
|
|
560
|
-
return t;
|
|
561
|
-
}
|
|
562
|
-
function Wo(e) {
|
|
563
|
-
return typeof e.timestamp == "function" ? e.timestamp : e.timestamp === !1 ? xn : En;
|
|
564
|
-
}
|
|
565
|
-
function Ft() {
|
|
566
|
-
return {};
|
|
567
|
-
}
|
|
568
|
-
function Zt(e) {
|
|
569
|
-
return e;
|
|
570
|
-
}
|
|
571
|
-
function it() {
|
|
572
|
-
}
|
|
573
|
-
function xn() {
|
|
574
|
-
return !1;
|
|
575
|
-
}
|
|
576
|
-
function En() {
|
|
577
|
-
return Date.now();
|
|
578
|
-
}
|
|
579
|
-
function qo() {
|
|
580
|
-
return Math.round(Date.now() / 1e3);
|
|
581
|
-
}
|
|
582
|
-
function Ko() {
|
|
583
|
-
return new Date(Date.now()).toISOString();
|
|
584
|
-
}
|
|
585
|
-
function Jo() {
|
|
586
|
-
function e(t) {
|
|
587
|
-
return typeof t < "u" && t;
|
|
588
|
-
}
|
|
589
|
-
try {
|
|
590
|
-
return typeof globalThis < "u" || Object.defineProperty(Object.prototype, "globalThis", {
|
|
591
|
-
get: function() {
|
|
592
|
-
return delete Object.prototype.globalThis, this.globalThis = this;
|
|
593
|
-
},
|
|
594
|
-
configurable: !0
|
|
595
|
-
}), globalThis;
|
|
596
|
-
} catch {
|
|
597
|
-
return e(self) || e(window) || e(this) || {};
|
|
598
|
-
}
|
|
599
|
-
}
|
|
600
|
-
const Fn = /* @__PURE__ */ yn(Ge), Zo = (e) => JSON.stringify(e, (t, r) => typeof r == "bigint" ? r.toString() + "n" : r);
|
|
601
|
-
function Wr(e) {
|
|
602
|
-
return typeof e == "string" ? e : Zo(e) || "";
|
|
603
|
-
}
|
|
604
|
-
const Yo = { level: "info" }, at = "custom_context", br = 1e3 * 1024;
|
|
605
|
-
class Xo {
|
|
606
|
-
constructor(t) {
|
|
607
|
-
this.nodeValue = t, this.sizeInBytes = new TextEncoder().encode(this.nodeValue).length, this.next = null;
|
|
608
|
-
}
|
|
609
|
-
get value() {
|
|
610
|
-
return this.nodeValue;
|
|
611
|
-
}
|
|
612
|
-
get size() {
|
|
613
|
-
return this.sizeInBytes;
|
|
614
|
-
}
|
|
615
|
-
}
|
|
616
|
-
class qr {
|
|
617
|
-
constructor(t) {
|
|
618
|
-
this.head = null, this.tail = null, this.lengthInNodes = 0, this.maxSizeInBytes = t, this.sizeInBytes = 0;
|
|
619
|
-
}
|
|
620
|
-
append(t) {
|
|
621
|
-
const r = new Xo(t);
|
|
622
|
-
if (r.size > this.maxSizeInBytes) throw new Error(`[LinkedList] Value too big to insert into list: ${t} with size ${r.size}`);
|
|
623
|
-
for (; this.size + r.size > this.maxSizeInBytes; ) this.shift();
|
|
624
|
-
this.head ? (this.tail && (this.tail.next = r), this.tail = r) : (this.head = r, this.tail = r), this.lengthInNodes++, this.sizeInBytes += r.size;
|
|
625
|
-
}
|
|
626
|
-
shift() {
|
|
627
|
-
if (!this.head) return;
|
|
628
|
-
const t = this.head;
|
|
629
|
-
this.head = this.head.next, this.head || (this.tail = null), this.lengthInNodes--, this.sizeInBytes -= t.size;
|
|
630
|
-
}
|
|
631
|
-
toArray() {
|
|
632
|
-
const t = [];
|
|
633
|
-
let r = this.head;
|
|
634
|
-
for (; r !== null; ) t.push(r.value), r = r.next;
|
|
635
|
-
return t;
|
|
636
|
-
}
|
|
637
|
-
get length() {
|
|
638
|
-
return this.lengthInNodes;
|
|
639
|
-
}
|
|
640
|
-
get size() {
|
|
641
|
-
return this.sizeInBytes;
|
|
642
|
-
}
|
|
643
|
-
toOrderedArray() {
|
|
644
|
-
return Array.from(this);
|
|
645
|
-
}
|
|
646
|
-
[Symbol.iterator]() {
|
|
647
|
-
let t = this.head;
|
|
648
|
-
return { next: () => {
|
|
649
|
-
if (!t) return { done: !0, value: null };
|
|
650
|
-
const r = t.value;
|
|
651
|
-
return t = t.next, { done: !1, value: r };
|
|
652
|
-
} };
|
|
653
|
-
}
|
|
654
|
-
}
|
|
655
|
-
class An {
|
|
656
|
-
constructor(t, r = br) {
|
|
657
|
-
this.level = t ?? "error", this.levelValue = Ge.levels.values[this.level], this.MAX_LOG_SIZE_IN_BYTES = r, this.logs = new qr(this.MAX_LOG_SIZE_IN_BYTES);
|
|
658
|
-
}
|
|
659
|
-
forwardToConsole(t, r) {
|
|
660
|
-
r === Ge.levels.values.error ? console.error(t) : r === Ge.levels.values.warn ? console.warn(t) : r === Ge.levels.values.debug ? console.debug(t) : r === Ge.levels.values.trace ? console.trace(t) : console.log(t);
|
|
661
|
-
}
|
|
662
|
-
appendToLogs(t) {
|
|
663
|
-
this.logs.append(Wr({ timestamp: (/* @__PURE__ */ new Date()).toISOString(), log: t }));
|
|
664
|
-
const r = typeof t == "string" ? JSON.parse(t).level : t.level;
|
|
665
|
-
r >= this.levelValue && this.forwardToConsole(t, r);
|
|
666
|
-
}
|
|
667
|
-
getLogs() {
|
|
668
|
-
return this.logs;
|
|
669
|
-
}
|
|
670
|
-
clearLogs() {
|
|
671
|
-
this.logs = new qr(this.MAX_LOG_SIZE_IN_BYTES);
|
|
672
|
-
}
|
|
673
|
-
getLogArray() {
|
|
674
|
-
return Array.from(this.logs);
|
|
675
|
-
}
|
|
676
|
-
logsToBlob(t) {
|
|
677
|
-
const r = this.getLogArray();
|
|
678
|
-
return r.push(Wr({ extraMetadata: t })), new Blob(r, { type: "application/json" });
|
|
679
|
-
}
|
|
680
|
-
}
|
|
681
|
-
class Qo {
|
|
682
|
-
constructor(t, r = br) {
|
|
683
|
-
this.baseChunkLogger = new An(t, r);
|
|
684
|
-
}
|
|
685
|
-
write(t) {
|
|
686
|
-
this.baseChunkLogger.appendToLogs(t);
|
|
687
|
-
}
|
|
688
|
-
getLogs() {
|
|
689
|
-
return this.baseChunkLogger.getLogs();
|
|
690
|
-
}
|
|
691
|
-
clearLogs() {
|
|
692
|
-
this.baseChunkLogger.clearLogs();
|
|
693
|
-
}
|
|
694
|
-
getLogArray() {
|
|
695
|
-
return this.baseChunkLogger.getLogArray();
|
|
696
|
-
}
|
|
697
|
-
logsToBlob(t) {
|
|
698
|
-
return this.baseChunkLogger.logsToBlob(t);
|
|
699
|
-
}
|
|
700
|
-
downloadLogsBlobInBrowser(t) {
|
|
701
|
-
const r = URL.createObjectURL(this.logsToBlob(t)), n = document.createElement("a");
|
|
702
|
-
n.href = r, n.download = `walletconnect-logs-${(/* @__PURE__ */ new Date()).toISOString()}.txt`, document.body.appendChild(n), n.click(), document.body.removeChild(n), URL.revokeObjectURL(r);
|
|
703
|
-
}
|
|
704
|
-
}
|
|
705
|
-
class es {
|
|
706
|
-
constructor(t, r = br) {
|
|
707
|
-
this.baseChunkLogger = new An(t, r);
|
|
708
|
-
}
|
|
709
|
-
write(t) {
|
|
710
|
-
this.baseChunkLogger.appendToLogs(t);
|
|
711
|
-
}
|
|
712
|
-
getLogs() {
|
|
713
|
-
return this.baseChunkLogger.getLogs();
|
|
714
|
-
}
|
|
715
|
-
clearLogs() {
|
|
716
|
-
this.baseChunkLogger.clearLogs();
|
|
717
|
-
}
|
|
718
|
-
getLogArray() {
|
|
719
|
-
return this.baseChunkLogger.getLogArray();
|
|
720
|
-
}
|
|
721
|
-
logsToBlob(t) {
|
|
722
|
-
return this.baseChunkLogger.logsToBlob(t);
|
|
723
|
-
}
|
|
724
|
-
}
|
|
725
|
-
var ts = Object.defineProperty, rs = Object.defineProperties, ns = Object.getOwnPropertyDescriptors, Kr = Object.getOwnPropertySymbols, is = Object.prototype.hasOwnProperty, os = Object.prototype.propertyIsEnumerable, Jr = (e, t, r) => t in e ? ts(e, t, { enumerable: !0, configurable: !0, writable: !0, value: r }) : e[t] = r, Tt = (e, t) => {
|
|
726
|
-
for (var r in t || (t = {})) is.call(t, r) && Jr(e, r, t[r]);
|
|
727
|
-
if (Kr) for (var r of Kr(t)) os.call(t, r) && Jr(e, r, t[r]);
|
|
728
|
-
return e;
|
|
729
|
-
}, Ct = (e, t) => rs(e, ns(t));
|
|
730
|
-
function af(e) {
|
|
731
|
-
return Ct(Tt({}, e), { level: (e == null ? void 0 : e.level) || Yo.level });
|
|
732
|
-
}
|
|
733
|
-
function ss(e, t = at) {
|
|
734
|
-
return e[t] || "";
|
|
735
|
-
}
|
|
736
|
-
function as(e, t, r = at) {
|
|
737
|
-
return e[r] = t, e;
|
|
738
|
-
}
|
|
739
|
-
function us(e, t = at) {
|
|
740
|
-
let r = "";
|
|
741
|
-
return typeof e.bindings > "u" ? r = ss(e, t) : r = e.bindings().context || "", r;
|
|
742
|
-
}
|
|
743
|
-
function cs(e, t, r = at) {
|
|
744
|
-
const n = us(e, r);
|
|
745
|
-
return n.trim() ? `${n}/${t}` : t;
|
|
746
|
-
}
|
|
747
|
-
function uf(e, t, r = at) {
|
|
748
|
-
const n = cs(e, t, r), i = e.child({ context: n });
|
|
749
|
-
return as(i, n, r);
|
|
750
|
-
}
|
|
751
|
-
function fs(e) {
|
|
752
|
-
var t, r;
|
|
753
|
-
const n = new Qo((t = e.opts) == null ? void 0 : t.level, e.maxSizeInBytes);
|
|
754
|
-
return { logger: Fn(Ct(Tt({}, e.opts), { level: "trace", browser: Ct(Tt({}, (r = e.opts) == null ? void 0 : r.browser), { write: (i) => n.write(i) }) })), chunkLoggerController: n };
|
|
755
|
-
}
|
|
756
|
-
function ls(e) {
|
|
757
|
-
var t;
|
|
758
|
-
const r = new es((t = e.opts) == null ? void 0 : t.level, e.maxSizeInBytes);
|
|
759
|
-
return { logger: Fn(Ct(Tt({}, e.opts), { level: "trace" }), r), chunkLoggerController: r };
|
|
760
|
-
}
|
|
761
|
-
function cf(e) {
|
|
762
|
-
return typeof e.loggerOverride < "u" && typeof e.loggerOverride != "string" ? { logger: e.loggerOverride, chunkLoggerController: null } : typeof window < "u" ? fs(e) : ls(e);
|
|
763
|
-
}
|
|
764
|
-
const hs = (e) => JSON.stringify(e, (t, r) => typeof r == "bigint" ? r.toString() + "n" : r), ds = (e) => {
|
|
765
|
-
const t = /([\[:])?(\d{17,}|(?:[9](?:[1-9]07199254740991|0[1-9]7199254740991|00[8-9]199254740991|007[2-9]99254740991|007199[3-9]54740991|0071992[6-9]4740991|00719925[5-9]740991|007199254[8-9]40991|0071992547[5-9]0991|00719925474[1-9]991|00719925474099[2-9])))([,\}\]])/g, r = e.replace(t, '$1"$2n"$3');
|
|
766
|
-
return JSON.parse(r, (n, i) => typeof i == "string" && i.match(/^\d+n$/) ? BigInt(i.substring(0, i.length - 1)) : i);
|
|
767
|
-
};
|
|
768
|
-
function bs(e) {
|
|
769
|
-
if (typeof e != "string")
|
|
770
|
-
throw new Error(`Cannot safe json parse value of type ${typeof e}`);
|
|
771
|
-
try {
|
|
772
|
-
return ds(e);
|
|
773
|
-
} catch {
|
|
774
|
-
return e;
|
|
775
|
-
}
|
|
776
|
-
}
|
|
777
|
-
function ps(e) {
|
|
778
|
-
return typeof e == "string" ? e : hs(e) || "";
|
|
779
|
-
}
|
|
780
|
-
function gs(e) {
|
|
781
|
-
return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array";
|
|
782
|
-
}
|
|
783
|
-
function Bn(e, ...t) {
|
|
784
|
-
if (!gs(e)) throw new Error("Uint8Array expected");
|
|
785
|
-
if (t.length > 0 && !t.includes(e.length)) throw new Error("Uint8Array expected of length " + t + ", got length=" + e.length);
|
|
786
|
-
}
|
|
787
|
-
function Zr(e, t = !0) {
|
|
788
|
-
if (e.destroyed) throw new Error("Hash instance has been destroyed");
|
|
789
|
-
if (t && e.finished) throw new Error("Hash#digest() has already been called");
|
|
790
|
-
}
|
|
791
|
-
function ws(e, t) {
|
|
792
|
-
Bn(e);
|
|
793
|
-
const r = t.outputLen;
|
|
794
|
-
if (e.length < r) throw new Error("digestInto() expects output buffer of length at least " + r);
|
|
795
|
-
}
|
|
796
|
-
const ke = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
|
|
797
|
-
/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
|
|
798
|
-
const Yt = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength);
|
|
799
|
-
function ys(e) {
|
|
800
|
-
if (typeof e != "string") throw new Error("utf8ToBytes expected string, got " + typeof e);
|
|
801
|
-
return new Uint8Array(new TextEncoder().encode(e));
|
|
802
|
-
}
|
|
803
|
-
function Sn(e) {
|
|
804
|
-
return typeof e == "string" && (e = ys(e)), Bn(e), e;
|
|
805
|
-
}
|
|
806
|
-
class ms {
|
|
807
|
-
clone() {
|
|
808
|
-
return this._cloneInto();
|
|
809
|
-
}
|
|
810
|
-
}
|
|
811
|
-
function vs(e) {
|
|
812
|
-
const t = (n) => e().update(Sn(n)).digest(), r = e();
|
|
813
|
-
return t.outputLen = r.outputLen, t.blockLen = r.blockLen, t.create = () => e(), t;
|
|
814
|
-
}
|
|
815
|
-
function On(e = 32) {
|
|
816
|
-
if (ke && typeof ke.getRandomValues == "function") return ke.getRandomValues(new Uint8Array(e));
|
|
817
|
-
if (ke && typeof ke.randomBytes == "function") return ke.randomBytes(e);
|
|
818
|
-
throw new Error("crypto.getRandomValues must be defined");
|
|
819
|
-
}
|
|
820
|
-
function _s(e, t, r, n) {
|
|
821
|
-
if (typeof e.setBigUint64 == "function") return e.setBigUint64(t, r, n);
|
|
822
|
-
const i = BigInt(32), o = BigInt(4294967295), a = Number(r >> i & o), l = Number(r & o), u = n ? 4 : 0, h = n ? 0 : 4;
|
|
823
|
-
e.setUint32(t + u, a, n), e.setUint32(t + h, l, n);
|
|
824
|
-
}
|
|
825
|
-
class xs extends ms {
|
|
826
|
-
constructor(t, r, n, i) {
|
|
827
|
-
super(), this.blockLen = t, this.outputLen = r, this.padOffset = n, this.isLE = i, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(t), this.view = Yt(this.buffer);
|
|
828
|
-
}
|
|
829
|
-
update(t) {
|
|
830
|
-
Zr(this);
|
|
831
|
-
const { view: r, buffer: n, blockLen: i } = this;
|
|
832
|
-
t = Sn(t);
|
|
833
|
-
const o = t.length;
|
|
834
|
-
for (let a = 0; a < o; ) {
|
|
835
|
-
const l = Math.min(i - this.pos, o - a);
|
|
836
|
-
if (l === i) {
|
|
837
|
-
const u = Yt(t);
|
|
838
|
-
for (; i <= o - a; a += i) this.process(u, a);
|
|
839
|
-
continue;
|
|
840
|
-
}
|
|
841
|
-
n.set(t.subarray(a, a + l), this.pos), this.pos += l, a += l, this.pos === i && (this.process(r, 0), this.pos = 0);
|
|
842
|
-
}
|
|
843
|
-
return this.length += t.length, this.roundClean(), this;
|
|
844
|
-
}
|
|
845
|
-
digestInto(t) {
|
|
846
|
-
Zr(this), ws(t, this), this.finished = !0;
|
|
847
|
-
const { buffer: r, view: n, blockLen: i, isLE: o } = this;
|
|
848
|
-
let { pos: a } = this;
|
|
849
|
-
r[a++] = 128, this.buffer.subarray(a).fill(0), this.padOffset > i - a && (this.process(n, 0), a = 0);
|
|
850
|
-
for (let b = a; b < i; b++) r[b] = 0;
|
|
851
|
-
_s(n, i - 8, BigInt(this.length * 8), o), this.process(n, 0);
|
|
852
|
-
const l = Yt(t), u = this.outputLen;
|
|
853
|
-
if (u % 4) throw new Error("_sha2: outputLen should be aligned to 32bit");
|
|
854
|
-
const h = u / 4, f = this.get();
|
|
855
|
-
if (h > f.length) throw new Error("_sha2: outputLen bigger than state");
|
|
856
|
-
for (let b = 0; b < h; b++) l.setUint32(4 * b, f[b], o);
|
|
857
|
-
}
|
|
858
|
-
digest() {
|
|
859
|
-
const { buffer: t, outputLen: r } = this;
|
|
860
|
-
this.digestInto(t);
|
|
861
|
-
const n = t.slice(0, r);
|
|
862
|
-
return this.destroy(), n;
|
|
863
|
-
}
|
|
864
|
-
_cloneInto(t) {
|
|
865
|
-
t || (t = new this.constructor()), t.set(...this.get());
|
|
866
|
-
const { blockLen: r, buffer: n, length: i, finished: o, destroyed: a, pos: l } = this;
|
|
867
|
-
return t.length = i, t.pos = l, t.finished = o, t.destroyed = a, i % r && t.buffer.set(n), t;
|
|
868
|
-
}
|
|
869
|
-
}
|
|
870
|
-
const At = BigInt(2 ** 32 - 1), sr = BigInt(32);
|
|
871
|
-
function Tn(e, t = !1) {
|
|
872
|
-
return t ? { h: Number(e & At), l: Number(e >> sr & At) } : { h: Number(e >> sr & At) | 0, l: Number(e & At) | 0 };
|
|
873
|
-
}
|
|
874
|
-
function Es(e, t = !1) {
|
|
875
|
-
let r = new Uint32Array(e.length), n = new Uint32Array(e.length);
|
|
876
|
-
for (let i = 0; i < e.length; i++) {
|
|
877
|
-
const { h: o, l: a } = Tn(e[i], t);
|
|
878
|
-
[r[i], n[i]] = [o, a];
|
|
879
|
-
}
|
|
880
|
-
return [r, n];
|
|
881
|
-
}
|
|
882
|
-
const Fs = (e, t) => BigInt(e >>> 0) << sr | BigInt(t >>> 0), As = (e, t, r) => e >>> r, Bs = (e, t, r) => e << 32 - r | t >>> r, Ss = (e, t, r) => e >>> r | t << 32 - r, Os = (e, t, r) => e << 32 - r | t >>> r, Ts = (e, t, r) => e << 64 - r | t >>> r - 32, Cs = (e, t, r) => e >>> r - 32 | t << 64 - r, Is = (e, t) => t, Rs = (e, t) => e, Ls = (e, t, r) => e << r | t >>> 32 - r, Ps = (e, t, r) => t << r | e >>> 32 - r, Ns = (e, t, r) => t << r - 32 | e >>> 64 - r, Us = (e, t, r) => e << r - 32 | t >>> 64 - r;
|
|
883
|
-
function js(e, t, r, n) {
|
|
884
|
-
const i = (t >>> 0) + (n >>> 0);
|
|
885
|
-
return { h: e + r + (i / 2 ** 32 | 0) | 0, l: i | 0 };
|
|
886
|
-
}
|
|
887
|
-
const zs = (e, t, r) => (e >>> 0) + (t >>> 0) + (r >>> 0), Ds = (e, t, r, n) => t + r + n + (e / 2 ** 32 | 0) | 0, Ms = (e, t, r, n) => (e >>> 0) + (t >>> 0) + (r >>> 0) + (n >>> 0), Hs = (e, t, r, n, i) => t + r + n + i + (e / 2 ** 32 | 0) | 0, $s = (e, t, r, n, i) => (e >>> 0) + (t >>> 0) + (r >>> 0) + (n >>> 0) + (i >>> 0), ks = (e, t, r, n, i, o) => t + r + n + i + o + (e / 2 ** 32 | 0) | 0, S = { fromBig: Tn, split: Es, toBig: Fs, shrSH: As, shrSL: Bs, rotrSH: Ss, rotrSL: Os, rotrBH: Ts, rotrBL: Cs, rotr32H: Is, rotr32L: Rs, rotlSH: Ls, rotlSL: Ps, rotlBH: Ns, rotlBL: Us, add: js, add3L: zs, add3H: Ds, add4L: Ms, add4H: Hs, add5H: ks, add5L: $s }, [Gs, Vs] = S.split(["0x428a2f98d728ae22", "0x7137449123ef65cd", "0xb5c0fbcfec4d3b2f", "0xe9b5dba58189dbbc", "0x3956c25bf348b538", "0x59f111f1b605d019", "0x923f82a4af194f9b", "0xab1c5ed5da6d8118", "0xd807aa98a3030242", "0x12835b0145706fbe", "0x243185be4ee4b28c", "0x550c7dc3d5ffb4e2", "0x72be5d74f27b896f", "0x80deb1fe3b1696b1", "0x9bdc06a725c71235", "0xc19bf174cf692694", "0xe49b69c19ef14ad2", "0xefbe4786384f25e3", "0x0fc19dc68b8cd5b5", "0x240ca1cc77ac9c65", "0x2de92c6f592b0275", "0x4a7484aa6ea6e483", "0x5cb0a9dcbd41fbd4", "0x76f988da831153b5", "0x983e5152ee66dfab", "0xa831c66d2db43210", "0xb00327c898fb213f", "0xbf597fc7beef0ee4", "0xc6e00bf33da88fc2", "0xd5a79147930aa725", "0x06ca6351e003826f", "0x142929670a0e6e70", "0x27b70a8546d22ffc", "0x2e1b21385c26c926", "0x4d2c6dfc5ac42aed", "0x53380d139d95b3df", "0x650a73548baf63de", "0x766a0abb3c77b2a8", "0x81c2c92e47edaee6", "0x92722c851482353b", "0xa2bfe8a14cf10364", "0xa81a664bbc423001", "0xc24b8b70d0f89791", "0xc76c51a30654be30", "0xd192e819d6ef5218", "0xd69906245565a910", "0xf40e35855771202a", "0x106aa07032bbd1b8", "0x19a4c116b8d2d0c8", "0x1e376c085141ab53", "0x2748774cdf8eeb99", "0x34b0bcb5e19b48a8", "0x391c0cb3c5c95a63", "0x4ed8aa4ae3418acb", "0x5b9cca4f7763e373", "0x682e6ff3d6b2b8a3", "0x748f82ee5defb2fc", "0x78a5636f43172f60", "0x84c87814a1f0ab72", "0x8cc702081a6439ec", "0x90befffa23631e28", "0xa4506cebde82bde9", "0xbef9a3f7b2c67915", "0xc67178f2e372532b", "0xca273eceea26619c", "0xd186b8c721c0c207", "0xeada7dd6cde0eb1e", "0xf57d4f7fee6ed178", "0x06f067aa72176fba", "0x0a637dc5a2c898a6", "0x113f9804bef90dae", "0x1b710b35131c471b", "0x28db77f523047d84", "0x32caab7b40c72493", "0x3c9ebe0a15c9bebc", "0x431d67c49c100d4c", "0x4cc5d4becb3e42b6", "0x597f299cfc657e2a", "0x5fcb6fab3ad6faec", "0x6c44198c4a475817"].map((e) => BigInt(e))), Oe = new Uint32Array(80), Te = new Uint32Array(80);
|
|
888
|
-
class Ws extends xs {
|
|
889
|
-
constructor() {
|
|
890
|
-
super(128, 64, 16, !1), this.Ah = 1779033703, this.Al = -205731576, this.Bh = -1150833019, this.Bl = -2067093701, this.Ch = 1013904242, this.Cl = -23791573, this.Dh = -1521486534, this.Dl = 1595750129, this.Eh = 1359893119, this.El = -1377402159, this.Fh = -1694144372, this.Fl = 725511199, this.Gh = 528734635, this.Gl = -79577749, this.Hh = 1541459225, this.Hl = 327033209;
|
|
891
|
-
}
|
|
892
|
-
get() {
|
|
893
|
-
const { Ah: t, Al: r, Bh: n, Bl: i, Ch: o, Cl: a, Dh: l, Dl: u, Eh: h, El: f, Fh: b, Fl: y, Gh: g, Gl: p, Hh: _, Hl: R } = this;
|
|
894
|
-
return [t, r, n, i, o, a, l, u, h, f, b, y, g, p, _, R];
|
|
895
|
-
}
|
|
896
|
-
set(t, r, n, i, o, a, l, u, h, f, b, y, g, p, _, R) {
|
|
897
|
-
this.Ah = t | 0, this.Al = r | 0, this.Bh = n | 0, this.Bl = i | 0, this.Ch = o | 0, this.Cl = a | 0, this.Dh = l | 0, this.Dl = u | 0, this.Eh = h | 0, this.El = f | 0, this.Fh = b | 0, this.Fl = y | 0, this.Gh = g | 0, this.Gl = p | 0, this.Hh = _ | 0, this.Hl = R | 0;
|
|
898
|
-
}
|
|
899
|
-
process(t, r) {
|
|
900
|
-
for (let m = 0; m < 16; m++, r += 4) Oe[m] = t.getUint32(r), Te[m] = t.getUint32(r += 4);
|
|
901
|
-
for (let m = 16; m < 80; m++) {
|
|
902
|
-
const O = Oe[m - 15] | 0, j = Te[m - 15] | 0, $ = S.rotrSH(O, j, 1) ^ S.rotrSH(O, j, 8) ^ S.shrSH(O, j, 7), G = S.rotrSL(O, j, 1) ^ S.rotrSL(O, j, 8) ^ S.shrSL(O, j, 7), z = Oe[m - 2] | 0, V = Te[m - 2] | 0, he = S.rotrSH(z, V, 19) ^ S.rotrBH(z, V, 61) ^ S.shrSH(z, V, 6), de = S.rotrSL(z, V, 19) ^ S.rotrBL(z, V, 61) ^ S.shrSL(z, V, 6), ae = S.add4L(G, de, Te[m - 7], Te[m - 16]), Ce = S.add4H(ae, $, he, Oe[m - 7], Oe[m - 16]);
|
|
903
|
-
Oe[m] = Ce | 0, Te[m] = ae | 0;
|
|
904
|
-
}
|
|
905
|
-
let { Ah: n, Al: i, Bh: o, Bl: a, Ch: l, Cl: u, Dh: h, Dl: f, Eh: b, El: y, Fh: g, Fl: p, Gh: _, Gl: R, Hh: P, Hl: I } = this;
|
|
906
|
-
for (let m = 0; m < 80; m++) {
|
|
907
|
-
const O = S.rotrSH(b, y, 14) ^ S.rotrSH(b, y, 18) ^ S.rotrBH(b, y, 41), j = S.rotrSL(b, y, 14) ^ S.rotrSL(b, y, 18) ^ S.rotrBL(b, y, 41), $ = b & g ^ ~b & _, G = y & p ^ ~y & R, z = S.add5L(I, j, G, Vs[m], Te[m]), V = S.add5H(z, P, O, $, Gs[m], Oe[m]), he = z | 0, de = S.rotrSH(n, i, 28) ^ S.rotrBH(n, i, 34) ^ S.rotrBH(n, i, 39), ae = S.rotrSL(n, i, 28) ^ S.rotrBL(n, i, 34) ^ S.rotrBL(n, i, 39), Ce = n & o ^ n & l ^ o & l, We = i & a ^ i & u ^ a & u;
|
|
908
|
-
P = _ | 0, I = R | 0, _ = g | 0, R = p | 0, g = b | 0, p = y | 0, { h: b, l: y } = S.add(h | 0, f | 0, V | 0, he | 0), h = l | 0, f = u | 0, l = o | 0, u = a | 0, o = n | 0, a = i | 0;
|
|
909
|
-
const E = S.add3L(he, ae, We);
|
|
910
|
-
n = S.add3H(E, V, de, Ce), i = E | 0;
|
|
911
|
-
}
|
|
912
|
-
({ h: n, l: i } = S.add(this.Ah | 0, this.Al | 0, n | 0, i | 0)), { h: o, l: a } = S.add(this.Bh | 0, this.Bl | 0, o | 0, a | 0), { h: l, l: u } = S.add(this.Ch | 0, this.Cl | 0, l | 0, u | 0), { h, l: f } = S.add(this.Dh | 0, this.Dl | 0, h | 0, f | 0), { h: b, l: y } = S.add(this.Eh | 0, this.El | 0, b | 0, y | 0), { h: g, l: p } = S.add(this.Fh | 0, this.Fl | 0, g | 0, p | 0), { h: _, l: R } = S.add(this.Gh | 0, this.Gl | 0, _ | 0, R | 0), { h: P, l: I } = S.add(this.Hh | 0, this.Hl | 0, P | 0, I | 0), this.set(n, i, o, a, l, u, h, f, b, y, g, p, _, R, P, I);
|
|
913
|
-
}
|
|
914
|
-
roundClean() {
|
|
915
|
-
Oe.fill(0), Te.fill(0);
|
|
916
|
-
}
|
|
917
|
-
destroy() {
|
|
918
|
-
this.buffer.fill(0), this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
|
|
919
|
-
}
|
|
920
|
-
}
|
|
921
|
-
const qs = vs(() => new Ws());
|
|
922
|
-
/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
|
|
923
|
-
const pr = BigInt(0), Cn = BigInt(1), Ks = BigInt(2);
|
|
924
|
-
function gr(e) {
|
|
925
|
-
return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array";
|
|
926
|
-
}
|
|
927
|
-
function wr(e) {
|
|
928
|
-
if (!gr(e)) throw new Error("Uint8Array expected");
|
|
929
|
-
}
|
|
930
|
-
function Xt(e, t) {
|
|
931
|
-
if (typeof t != "boolean") throw new Error(e + " boolean expected, got " + t);
|
|
932
|
-
}
|
|
933
|
-
const Js = Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
|
|
934
|
-
function yr(e) {
|
|
935
|
-
wr(e);
|
|
936
|
-
let t = "";
|
|
937
|
-
for (let r = 0; r < e.length; r++) t += Js[e[r]];
|
|
938
|
-
return t;
|
|
939
|
-
}
|
|
940
|
-
function In(e) {
|
|
941
|
-
if (typeof e != "string") throw new Error("hex string expected, got " + typeof e);
|
|
942
|
-
return e === "" ? pr : BigInt("0x" + e);
|
|
943
|
-
}
|
|
944
|
-
const ve = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };
|
|
945
|
-
function Yr(e) {
|
|
946
|
-
if (e >= ve._0 && e <= ve._9) return e - ve._0;
|
|
947
|
-
if (e >= ve.A && e <= ve.F) return e - (ve.A - 10);
|
|
948
|
-
if (e >= ve.a && e <= ve.f) return e - (ve.a - 10);
|
|
949
|
-
}
|
|
950
|
-
function Rn(e) {
|
|
951
|
-
if (typeof e != "string") throw new Error("hex string expected, got " + typeof e);
|
|
952
|
-
const t = e.length, r = t / 2;
|
|
953
|
-
if (t % 2) throw new Error("hex string expected, got unpadded hex of length " + t);
|
|
954
|
-
const n = new Uint8Array(r);
|
|
955
|
-
for (let i = 0, o = 0; i < r; i++, o += 2) {
|
|
956
|
-
const a = Yr(e.charCodeAt(o)), l = Yr(e.charCodeAt(o + 1));
|
|
957
|
-
if (a === void 0 || l === void 0) {
|
|
958
|
-
const u = e[o] + e[o + 1];
|
|
959
|
-
throw new Error('hex string expected, got non-hex character "' + u + '" at index ' + o);
|
|
960
|
-
}
|
|
961
|
-
n[i] = a * 16 + l;
|
|
962
|
-
}
|
|
963
|
-
return n;
|
|
964
|
-
}
|
|
965
|
-
function Zs(e) {
|
|
966
|
-
return In(yr(e));
|
|
967
|
-
}
|
|
968
|
-
function Ot(e) {
|
|
969
|
-
return wr(e), In(yr(Uint8Array.from(e).reverse()));
|
|
970
|
-
}
|
|
971
|
-
function Ln(e, t) {
|
|
972
|
-
return Rn(e.toString(16).padStart(t * 2, "0"));
|
|
973
|
-
}
|
|
974
|
-
function ar(e, t) {
|
|
975
|
-
return Ln(e, t).reverse();
|
|
976
|
-
}
|
|
977
|
-
function _e(e, t, r) {
|
|
978
|
-
let n;
|
|
979
|
-
if (typeof t == "string") try {
|
|
980
|
-
n = Rn(t);
|
|
981
|
-
} catch (o) {
|
|
982
|
-
throw new Error(e + " must be hex string or Uint8Array, cause: " + o);
|
|
983
|
-
}
|
|
984
|
-
else if (gr(t)) n = Uint8Array.from(t);
|
|
985
|
-
else throw new Error(e + " must be hex string or Uint8Array");
|
|
986
|
-
const i = n.length;
|
|
987
|
-
if (typeof r == "number" && i !== r) throw new Error(e + " of length " + r + " expected, got " + i);
|
|
988
|
-
return n;
|
|
989
|
-
}
|
|
990
|
-
function Xr(...e) {
|
|
991
|
-
let t = 0;
|
|
992
|
-
for (let n = 0; n < e.length; n++) {
|
|
993
|
-
const i = e[n];
|
|
994
|
-
wr(i), t += i.length;
|
|
995
|
-
}
|
|
996
|
-
const r = new Uint8Array(t);
|
|
997
|
-
for (let n = 0, i = 0; n < e.length; n++) {
|
|
998
|
-
const o = e[n];
|
|
999
|
-
r.set(o, i), i += o.length;
|
|
1000
|
-
}
|
|
1001
|
-
return r;
|
|
1002
|
-
}
|
|
1003
|
-
const Qt = (e) => typeof e == "bigint" && pr <= e;
|
|
1004
|
-
function Ys(e, t, r) {
|
|
1005
|
-
return Qt(e) && Qt(t) && Qt(r) && t <= e && e < r;
|
|
1006
|
-
}
|
|
1007
|
-
function tt(e, t, r, n) {
|
|
1008
|
-
if (!Ys(t, r, n)) throw new Error("expected valid " + e + ": " + r + " <= n < " + n + ", got " + t);
|
|
1009
|
-
}
|
|
1010
|
-
function Xs(e) {
|
|
1011
|
-
let t;
|
|
1012
|
-
for (t = 0; e > pr; e >>= Cn, t += 1) ;
|
|
1013
|
-
return t;
|
|
1014
|
-
}
|
|
1015
|
-
const Qs = (e) => (Ks << BigInt(e - 1)) - Cn, ea = { bigint: (e) => typeof e == "bigint", function: (e) => typeof e == "function", boolean: (e) => typeof e == "boolean", string: (e) => typeof e == "string", stringOrUint8Array: (e) => typeof e == "string" || gr(e), isSafeInteger: (e) => Number.isSafeInteger(e), array: (e) => Array.isArray(e), field: (e, t) => t.Fp.isValid(e), hash: (e) => typeof e == "function" && Number.isSafeInteger(e.outputLen) };
|
|
1016
|
-
function mr(e, t, r = {}) {
|
|
1017
|
-
const n = (i, o, a) => {
|
|
1018
|
-
const l = ea[o];
|
|
1019
|
-
if (typeof l != "function") throw new Error("invalid validator function");
|
|
1020
|
-
const u = e[i];
|
|
1021
|
-
if (!(a && u === void 0) && !l(u, e)) throw new Error("param " + String(i) + " is invalid. Expected " + o + ", got " + u);
|
|
1022
|
-
};
|
|
1023
|
-
for (const [i, o] of Object.entries(t)) n(i, o, !1);
|
|
1024
|
-
for (const [i, o] of Object.entries(r)) n(i, o, !0);
|
|
1025
|
-
return e;
|
|
1026
|
-
}
|
|
1027
|
-
function Qr(e) {
|
|
1028
|
-
const t = /* @__PURE__ */ new WeakMap();
|
|
1029
|
-
return (r, ...n) => {
|
|
1030
|
-
const i = t.get(r);
|
|
1031
|
-
if (i !== void 0) return i;
|
|
1032
|
-
const o = e(r, ...n);
|
|
1033
|
-
return t.set(r, o), o;
|
|
1034
|
-
};
|
|
1035
|
-
}
|
|
1036
|
-
const Z = BigInt(0), W = BigInt(1), Ue = BigInt(2), ta = BigInt(3), ur = BigInt(4), en = BigInt(5), tn = BigInt(8);
|
|
1037
|
-
function K(e, t) {
|
|
1038
|
-
const r = e % t;
|
|
1039
|
-
return r >= Z ? r : t + r;
|
|
1040
|
-
}
|
|
1041
|
-
function ra(e, t, r) {
|
|
1042
|
-
if (t < Z) throw new Error("invalid exponent, negatives unsupported");
|
|
1043
|
-
if (r <= Z) throw new Error("invalid modulus");
|
|
1044
|
-
if (r === W) return Z;
|
|
1045
|
-
let n = W;
|
|
1046
|
-
for (; t > Z; ) t & W && (n = n * e % r), e = e * e % r, t >>= W;
|
|
1047
|
-
return n;
|
|
1048
|
-
}
|
|
1049
|
-
function pe(e, t, r) {
|
|
1050
|
-
let n = e;
|
|
1051
|
-
for (; t-- > Z; ) n *= n, n %= r;
|
|
1052
|
-
return n;
|
|
1053
|
-
}
|
|
1054
|
-
function rn(e, t) {
|
|
1055
|
-
if (e === Z) throw new Error("invert: expected non-zero number");
|
|
1056
|
-
if (t <= Z) throw new Error("invert: expected positive modulus, got " + t);
|
|
1057
|
-
let r = K(e, t), n = t, i = Z, o = W;
|
|
1058
|
-
for (; r !== Z; ) {
|
|
1059
|
-
const a = n / r, l = n % r, u = i - o * a;
|
|
1060
|
-
n = r, r = l, i = o, o = u;
|
|
1061
|
-
}
|
|
1062
|
-
if (n !== W) throw new Error("invert: does not exist");
|
|
1063
|
-
return K(i, t);
|
|
1064
|
-
}
|
|
1065
|
-
function na(e) {
|
|
1066
|
-
const t = (e - W) / Ue;
|
|
1067
|
-
let r, n, i;
|
|
1068
|
-
for (r = e - W, n = 0; r % Ue === Z; r /= Ue, n++) ;
|
|
1069
|
-
for (i = Ue; i < e && ra(i, t, e) !== e - W; i++) if (i > 1e3) throw new Error("Cannot find square root: likely non-prime P");
|
|
1070
|
-
if (n === 1) {
|
|
1071
|
-
const a = (e + W) / ur;
|
|
1072
|
-
return function(l, u) {
|
|
1073
|
-
const h = l.pow(u, a);
|
|
1074
|
-
if (!l.eql(l.sqr(h), u)) throw new Error("Cannot find square root");
|
|
1075
|
-
return h;
|
|
1076
|
-
};
|
|
1077
|
-
}
|
|
1078
|
-
const o = (r + W) / Ue;
|
|
1079
|
-
return function(a, l) {
|
|
1080
|
-
if (a.pow(l, t) === a.neg(a.ONE)) throw new Error("Cannot find square root");
|
|
1081
|
-
let u = n, h = a.pow(a.mul(a.ONE, i), r), f = a.pow(l, o), b = a.pow(l, r);
|
|
1082
|
-
for (; !a.eql(b, a.ONE); ) {
|
|
1083
|
-
if (a.eql(b, a.ZERO)) return a.ZERO;
|
|
1084
|
-
let y = 1;
|
|
1085
|
-
for (let p = a.sqr(b); y < u && !a.eql(p, a.ONE); y++) p = a.sqr(p);
|
|
1086
|
-
const g = a.pow(h, W << BigInt(u - y - 1));
|
|
1087
|
-
h = a.sqr(g), f = a.mul(f, g), b = a.mul(b, h), u = y;
|
|
1088
|
-
}
|
|
1089
|
-
return f;
|
|
1090
|
-
};
|
|
1091
|
-
}
|
|
1092
|
-
function ia(e) {
|
|
1093
|
-
if (e % ur === ta) {
|
|
1094
|
-
const t = (e + W) / ur;
|
|
1095
|
-
return function(r, n) {
|
|
1096
|
-
const i = r.pow(n, t);
|
|
1097
|
-
if (!r.eql(r.sqr(i), n)) throw new Error("Cannot find square root");
|
|
1098
|
-
return i;
|
|
1099
|
-
};
|
|
1100
|
-
}
|
|
1101
|
-
if (e % tn === en) {
|
|
1102
|
-
const t = (e - en) / tn;
|
|
1103
|
-
return function(r, n) {
|
|
1104
|
-
const i = r.mul(n, Ue), o = r.pow(i, t), a = r.mul(n, o), l = r.mul(r.mul(a, Ue), o), u = r.mul(a, r.sub(l, r.ONE));
|
|
1105
|
-
if (!r.eql(r.sqr(u), n)) throw new Error("Cannot find square root");
|
|
1106
|
-
return u;
|
|
1107
|
-
};
|
|
1108
|
-
}
|
|
1109
|
-
return na(e);
|
|
1110
|
-
}
|
|
1111
|
-
const oa = (e, t) => (K(e, t) & W) === W, sa = ["create", "isValid", "is0", "neg", "inv", "sqrt", "sqr", "eql", "add", "sub", "mul", "pow", "div", "addN", "subN", "mulN", "sqrN"];
|
|
1112
|
-
function aa(e) {
|
|
1113
|
-
const t = { ORDER: "bigint", MASK: "bigint", BYTES: "isSafeInteger", BITS: "isSafeInteger" }, r = sa.reduce((n, i) => (n[i] = "function", n), t);
|
|
1114
|
-
return mr(e, r);
|
|
1115
|
-
}
|
|
1116
|
-
function ua(e, t, r) {
|
|
1117
|
-
if (r < Z) throw new Error("invalid exponent, negatives unsupported");
|
|
1118
|
-
if (r === Z) return e.ONE;
|
|
1119
|
-
if (r === W) return t;
|
|
1120
|
-
let n = e.ONE, i = t;
|
|
1121
|
-
for (; r > Z; ) r & W && (n = e.mul(n, i)), i = e.sqr(i), r >>= W;
|
|
1122
|
-
return n;
|
|
1123
|
-
}
|
|
1124
|
-
function ca(e, t) {
|
|
1125
|
-
const r = new Array(t.length), n = t.reduce((o, a, l) => e.is0(a) ? o : (r[l] = o, e.mul(o, a)), e.ONE), i = e.inv(n);
|
|
1126
|
-
return t.reduceRight((o, a, l) => e.is0(a) ? o : (r[l] = e.mul(o, r[l]), e.mul(o, a)), i), r;
|
|
1127
|
-
}
|
|
1128
|
-
function Pn(e, t) {
|
|
1129
|
-
const r = t !== void 0 ? t : e.toString(2).length, n = Math.ceil(r / 8);
|
|
1130
|
-
return { nBitLength: r, nByteLength: n };
|
|
1131
|
-
}
|
|
1132
|
-
function Nn(e, t, r = !1, n = {}) {
|
|
1133
|
-
if (e <= Z) throw new Error("invalid field: expected ORDER > 0, got " + e);
|
|
1134
|
-
const { nBitLength: i, nByteLength: o } = Pn(e, t);
|
|
1135
|
-
if (o > 2048) throw new Error("invalid field: expected ORDER of <= 2048 bytes");
|
|
1136
|
-
let a;
|
|
1137
|
-
const l = Object.freeze({ ORDER: e, isLE: r, BITS: i, BYTES: o, MASK: Qs(i), ZERO: Z, ONE: W, create: (u) => K(u, e), isValid: (u) => {
|
|
1138
|
-
if (typeof u != "bigint") throw new Error("invalid field element: expected bigint, got " + typeof u);
|
|
1139
|
-
return Z <= u && u < e;
|
|
1140
|
-
}, is0: (u) => u === Z, isOdd: (u) => (u & W) === W, neg: (u) => K(-u, e), eql: (u, h) => u === h, sqr: (u) => K(u * u, e), add: (u, h) => K(u + h, e), sub: (u, h) => K(u - h, e), mul: (u, h) => K(u * h, e), pow: (u, h) => ua(l, u, h), div: (u, h) => K(u * rn(h, e), e), sqrN: (u) => u * u, addN: (u, h) => u + h, subN: (u, h) => u - h, mulN: (u, h) => u * h, inv: (u) => rn(u, e), sqrt: n.sqrt || ((u) => (a || (a = ia(e)), a(l, u))), invertBatch: (u) => ca(l, u), cmov: (u, h, f) => f ? h : u, toBytes: (u) => r ? ar(u, o) : Ln(u, o), fromBytes: (u) => {
|
|
1141
|
-
if (u.length !== o) throw new Error("Field.fromBytes: expected " + o + " bytes, got " + u.length);
|
|
1142
|
-
return r ? Ot(u) : Zs(u);
|
|
1143
|
-
} });
|
|
1144
|
-
return Object.freeze(l);
|
|
1145
|
-
}
|
|
1146
|
-
const nn = BigInt(0), Bt = BigInt(1);
|
|
1147
|
-
function er(e, t) {
|
|
1148
|
-
const r = t.negate();
|
|
1149
|
-
return e ? r : t;
|
|
1150
|
-
}
|
|
1151
|
-
function Un(e, t) {
|
|
1152
|
-
if (!Number.isSafeInteger(e) || e <= 0 || e > t) throw new Error("invalid window size, expected [1.." + t + "], got W=" + e);
|
|
1153
|
-
}
|
|
1154
|
-
function tr(e, t) {
|
|
1155
|
-
Un(e, t);
|
|
1156
|
-
const r = Math.ceil(t / e) + 1, n = 2 ** (e - 1);
|
|
1157
|
-
return { windows: r, windowSize: n };
|
|
1158
|
-
}
|
|
1159
|
-
function fa(e, t) {
|
|
1160
|
-
if (!Array.isArray(e)) throw new Error("array expected");
|
|
1161
|
-
e.forEach((r, n) => {
|
|
1162
|
-
if (!(r instanceof t)) throw new Error("invalid point at index " + n);
|
|
1163
|
-
});
|
|
1164
|
-
}
|
|
1165
|
-
function la(e, t) {
|
|
1166
|
-
if (!Array.isArray(e)) throw new Error("array of scalars expected");
|
|
1167
|
-
e.forEach((r, n) => {
|
|
1168
|
-
if (!t.isValid(r)) throw new Error("invalid scalar at index " + n);
|
|
1169
|
-
});
|
|
1170
|
-
}
|
|
1171
|
-
const rr = /* @__PURE__ */ new WeakMap(), jn = /* @__PURE__ */ new WeakMap();
|
|
1172
|
-
function nr(e) {
|
|
1173
|
-
return jn.get(e) || 1;
|
|
1174
|
-
}
|
|
1175
|
-
function ha(e, t) {
|
|
1176
|
-
return { constTimeNegate: er, hasPrecomputes(r) {
|
|
1177
|
-
return nr(r) !== 1;
|
|
1178
|
-
}, unsafeLadder(r, n, i = e.ZERO) {
|
|
1179
|
-
let o = r;
|
|
1180
|
-
for (; n > nn; ) n & Bt && (i = i.add(o)), o = o.double(), n >>= Bt;
|
|
1181
|
-
return i;
|
|
1182
|
-
}, precomputeWindow(r, n) {
|
|
1183
|
-
const { windows: i, windowSize: o } = tr(n, t), a = [];
|
|
1184
|
-
let l = r, u = l;
|
|
1185
|
-
for (let h = 0; h < i; h++) {
|
|
1186
|
-
u = l, a.push(u);
|
|
1187
|
-
for (let f = 1; f < o; f++) u = u.add(l), a.push(u);
|
|
1188
|
-
l = u.double();
|
|
1189
|
-
}
|
|
1190
|
-
return a;
|
|
1191
|
-
}, wNAF(r, n, i) {
|
|
1192
|
-
const { windows: o, windowSize: a } = tr(r, t);
|
|
1193
|
-
let l = e.ZERO, u = e.BASE;
|
|
1194
|
-
const h = BigInt(2 ** r - 1), f = 2 ** r, b = BigInt(r);
|
|
1195
|
-
for (let y = 0; y < o; y++) {
|
|
1196
|
-
const g = y * a;
|
|
1197
|
-
let p = Number(i & h);
|
|
1198
|
-
i >>= b, p > a && (p -= f, i += Bt);
|
|
1199
|
-
const _ = g, R = g + Math.abs(p) - 1, P = y % 2 !== 0, I = p < 0;
|
|
1200
|
-
p === 0 ? u = u.add(er(P, n[_])) : l = l.add(er(I, n[R]));
|
|
1201
|
-
}
|
|
1202
|
-
return { p: l, f: u };
|
|
1203
|
-
}, wNAFUnsafe(r, n, i, o = e.ZERO) {
|
|
1204
|
-
const { windows: a, windowSize: l } = tr(r, t), u = BigInt(2 ** r - 1), h = 2 ** r, f = BigInt(r);
|
|
1205
|
-
for (let b = 0; b < a; b++) {
|
|
1206
|
-
const y = b * l;
|
|
1207
|
-
if (i === nn) break;
|
|
1208
|
-
let g = Number(i & u);
|
|
1209
|
-
if (i >>= f, g > l && (g -= h, i += Bt), g === 0) continue;
|
|
1210
|
-
let p = n[y + Math.abs(g) - 1];
|
|
1211
|
-
g < 0 && (p = p.negate()), o = o.add(p);
|
|
1212
|
-
}
|
|
1213
|
-
return o;
|
|
1214
|
-
}, getPrecomputes(r, n, i) {
|
|
1215
|
-
let o = rr.get(n);
|
|
1216
|
-
return o || (o = this.precomputeWindow(n, r), r !== 1 && rr.set(n, i(o))), o;
|
|
1217
|
-
}, wNAFCached(r, n, i) {
|
|
1218
|
-
const o = nr(r);
|
|
1219
|
-
return this.wNAF(o, this.getPrecomputes(o, r, i), n);
|
|
1220
|
-
}, wNAFCachedUnsafe(r, n, i, o) {
|
|
1221
|
-
const a = nr(r);
|
|
1222
|
-
return a === 1 ? this.unsafeLadder(r, n, o) : this.wNAFUnsafe(a, this.getPrecomputes(a, r, i), n, o);
|
|
1223
|
-
}, setWindowSize(r, n) {
|
|
1224
|
-
Un(n, t), jn.set(r, n), rr.delete(r);
|
|
1225
|
-
} };
|
|
1226
|
-
}
|
|
1227
|
-
function da(e, t, r, n) {
|
|
1228
|
-
if (fa(r, e), la(n, t), r.length !== n.length) throw new Error("arrays of points and scalars must have equal length");
|
|
1229
|
-
const i = e.ZERO, o = Xs(BigInt(r.length)), a = o > 12 ? o - 3 : o > 4 ? o - 2 : o ? 2 : 1, l = (1 << a) - 1, u = new Array(l + 1).fill(i), h = Math.floor((t.BITS - 1) / a) * a;
|
|
1230
|
-
let f = i;
|
|
1231
|
-
for (let b = h; b >= 0; b -= a) {
|
|
1232
|
-
u.fill(i);
|
|
1233
|
-
for (let g = 0; g < n.length; g++) {
|
|
1234
|
-
const p = n[g], _ = Number(p >> BigInt(b) & BigInt(l));
|
|
1235
|
-
u[_] = u[_].add(r[g]);
|
|
1236
|
-
}
|
|
1237
|
-
let y = i;
|
|
1238
|
-
for (let g = u.length - 1, p = i; g > 0; g--) p = p.add(u[g]), y = y.add(p);
|
|
1239
|
-
if (f = f.add(y), b !== 0) for (let g = 0; g < a; g++) f = f.double();
|
|
1240
|
-
}
|
|
1241
|
-
return f;
|
|
1242
|
-
}
|
|
1243
|
-
function ba(e) {
|
|
1244
|
-
return aa(e.Fp), mr(e, { n: "bigint", h: "bigint", Gx: "field", Gy: "field" }, { nBitLength: "isSafeInteger", nByteLength: "isSafeInteger" }), Object.freeze({ ...Pn(e.n, e.nBitLength), ...e, p: e.Fp.ORDER });
|
|
1245
|
-
}
|
|
1246
|
-
const le = BigInt(0), re = BigInt(1), St = BigInt(2), pa = BigInt(8), ga = { zip215: !0 };
|
|
1247
|
-
function wa(e) {
|
|
1248
|
-
const t = ba(e);
|
|
1249
|
-
return mr(e, { hash: "function", a: "bigint", d: "bigint", randomBytes: "function" }, { adjustScalarBytes: "function", domain: "function", uvRatio: "function", mapToCurve: "function" }), Object.freeze({ ...t });
|
|
1250
|
-
}
|
|
1251
|
-
function ya(e) {
|
|
1252
|
-
const t = wa(e), { Fp: r, n, prehash: i, hash: o, randomBytes: a, nByteLength: l, h: u } = t, h = St << BigInt(l * 8) - re, f = r.create, b = Nn(t.n, t.nBitLength), y = t.uvRatio || ((E, w) => {
|
|
1253
|
-
try {
|
|
1254
|
-
return { isValid: !0, value: r.sqrt(E * r.inv(w)) };
|
|
1255
|
-
} catch {
|
|
1256
|
-
return { isValid: !1, value: le };
|
|
1257
|
-
}
|
|
1258
|
-
}), g = t.adjustScalarBytes || ((E) => E), p = t.domain || ((E, w, x) => {
|
|
1259
|
-
if (Xt("phflag", x), w.length || x) throw new Error("Contexts/pre-hash are not supported");
|
|
1260
|
-
return E;
|
|
1261
|
-
});
|
|
1262
|
-
function _(E, w) {
|
|
1263
|
-
tt("coordinate " + E, w, le, h);
|
|
1264
|
-
}
|
|
1265
|
-
function R(E) {
|
|
1266
|
-
if (!(E instanceof m)) throw new Error("ExtendedPoint expected");
|
|
1267
|
-
}
|
|
1268
|
-
const P = Qr((E, w) => {
|
|
1269
|
-
const { ex: x, ey: F, ez: T } = E, C = E.is0();
|
|
1270
|
-
w == null && (w = C ? pa : r.inv(T));
|
|
1271
|
-
const L = f(x * w), D = f(F * w), N = f(T * w);
|
|
1272
|
-
if (C) return { x: le, y: re };
|
|
1273
|
-
if (N !== re) throw new Error("invZ was invalid");
|
|
1274
|
-
return { x: L, y: D };
|
|
1275
|
-
}), I = Qr((E) => {
|
|
1276
|
-
const { a: w, d: x } = t;
|
|
1277
|
-
if (E.is0()) throw new Error("bad point: ZERO");
|
|
1278
|
-
const { ex: F, ey: T, ez: C, et: L } = E, D = f(F * F), N = f(T * T), M = f(C * C), A = f(M * M), Y = f(D * w), ue = f(M * f(Y + N)), q = f(A + f(x * f(D * N)));
|
|
1279
|
-
if (ue !== q) throw new Error("bad point: equation left != right (1)");
|
|
1280
|
-
const te = f(F * T), ce = f(C * L);
|
|
1281
|
-
if (te !== ce) throw new Error("bad point: equation left != right (2)");
|
|
1282
|
-
return !0;
|
|
1283
|
-
});
|
|
1284
|
-
class m {
|
|
1285
|
-
constructor(w, x, F, T) {
|
|
1286
|
-
this.ex = w, this.ey = x, this.ez = F, this.et = T, _("x", w), _("y", x), _("z", F), _("t", T), Object.freeze(this);
|
|
1287
|
-
}
|
|
1288
|
-
get x() {
|
|
1289
|
-
return this.toAffine().x;
|
|
1290
|
-
}
|
|
1291
|
-
get y() {
|
|
1292
|
-
return this.toAffine().y;
|
|
1293
|
-
}
|
|
1294
|
-
static fromAffine(w) {
|
|
1295
|
-
if (w instanceof m) throw new Error("extended point not allowed");
|
|
1296
|
-
const { x, y: F } = w || {};
|
|
1297
|
-
return _("x", x), _("y", F), new m(x, F, re, f(x * F));
|
|
1298
|
-
}
|
|
1299
|
-
static normalizeZ(w) {
|
|
1300
|
-
const x = r.invertBatch(w.map((F) => F.ez));
|
|
1301
|
-
return w.map((F, T) => F.toAffine(x[T])).map(m.fromAffine);
|
|
1302
|
-
}
|
|
1303
|
-
static msm(w, x) {
|
|
1304
|
-
return da(m, b, w, x);
|
|
1305
|
-
}
|
|
1306
|
-
_setWindowSize(w) {
|
|
1307
|
-
$.setWindowSize(this, w);
|
|
1308
|
-
}
|
|
1309
|
-
assertValidity() {
|
|
1310
|
-
I(this);
|
|
1311
|
-
}
|
|
1312
|
-
equals(w) {
|
|
1313
|
-
R(w);
|
|
1314
|
-
const { ex: x, ey: F, ez: T } = this, { ex: C, ey: L, ez: D } = w, N = f(x * D), M = f(C * T), A = f(F * D), Y = f(L * T);
|
|
1315
|
-
return N === M && A === Y;
|
|
1316
|
-
}
|
|
1317
|
-
is0() {
|
|
1318
|
-
return this.equals(m.ZERO);
|
|
1319
|
-
}
|
|
1320
|
-
negate() {
|
|
1321
|
-
return new m(f(-this.ex), this.ey, this.ez, f(-this.et));
|
|
1322
|
-
}
|
|
1323
|
-
double() {
|
|
1324
|
-
const { a: w } = t, { ex: x, ey: F, ez: T } = this, C = f(x * x), L = f(F * F), D = f(St * f(T * T)), N = f(w * C), M = x + F, A = f(f(M * M) - C - L), Y = N + L, ue = Y - D, q = N - L, te = f(A * ue), ce = f(Y * q), be = f(A * q), Fe = f(ue * Y);
|
|
1325
|
-
return new m(te, ce, Fe, be);
|
|
1326
|
-
}
|
|
1327
|
-
add(w) {
|
|
1328
|
-
R(w);
|
|
1329
|
-
const { a: x, d: F } = t, { ex: T, ey: C, ez: L, et: D } = this, { ex: N, ey: M, ez: A, et: Y } = w;
|
|
1330
|
-
if (x === BigInt(-1)) {
|
|
1331
|
-
const ct = f((C - T) * (M + N)), ft = f((C + T) * (M - N)), Je = f(ft - ct);
|
|
1332
|
-
if (Je === le) return this.double();
|
|
1333
|
-
const lt = f(L * St * Y), ht = f(D * St * A), dt = ht + lt, bt = ft + ct, pt = ht - lt, De = f(dt * Je), Ze = f(bt * pt), gt = f(dt * pt), ie = f(Je * bt);
|
|
1334
|
-
return new m(De, Ze, ie, gt);
|
|
1335
|
-
}
|
|
1336
|
-
const ue = f(T * N), q = f(C * M), te = f(D * F * Y), ce = f(L * A), be = f((T + C) * (N + M) - ue - q), Fe = ce - te, qe = ce + te, Ke = f(q - x * ue), zt = f(be * Fe), Dt = f(qe * Ke), Mt = f(be * Ke), Ht = f(Fe * qe);
|
|
1337
|
-
return new m(zt, Dt, Ht, Mt);
|
|
1338
|
-
}
|
|
1339
|
-
subtract(w) {
|
|
1340
|
-
return this.add(w.negate());
|
|
1341
|
-
}
|
|
1342
|
-
wNAF(w) {
|
|
1343
|
-
return $.wNAFCached(this, w, m.normalizeZ);
|
|
1344
|
-
}
|
|
1345
|
-
multiply(w) {
|
|
1346
|
-
const x = w;
|
|
1347
|
-
tt("scalar", x, re, n);
|
|
1348
|
-
const { p: F, f: T } = this.wNAF(x);
|
|
1349
|
-
return m.normalizeZ([F, T])[0];
|
|
1350
|
-
}
|
|
1351
|
-
multiplyUnsafe(w, x = m.ZERO) {
|
|
1352
|
-
const F = w;
|
|
1353
|
-
return tt("scalar", F, le, n), F === le ? j : this.is0() || F === re ? this : $.wNAFCachedUnsafe(this, F, m.normalizeZ, x);
|
|
1354
|
-
}
|
|
1355
|
-
isSmallOrder() {
|
|
1356
|
-
return this.multiplyUnsafe(u).is0();
|
|
1357
|
-
}
|
|
1358
|
-
isTorsionFree() {
|
|
1359
|
-
return $.unsafeLadder(this, n).is0();
|
|
1360
|
-
}
|
|
1361
|
-
toAffine(w) {
|
|
1362
|
-
return P(this, w);
|
|
1363
|
-
}
|
|
1364
|
-
clearCofactor() {
|
|
1365
|
-
const { h: w } = t;
|
|
1366
|
-
return w === re ? this : this.multiplyUnsafe(w);
|
|
1367
|
-
}
|
|
1368
|
-
static fromHex(w, x = !1) {
|
|
1369
|
-
const { d: F, a: T } = t, C = r.BYTES;
|
|
1370
|
-
w = _e("pointHex", w, C), Xt("zip215", x);
|
|
1371
|
-
const L = w.slice(), D = w[C - 1];
|
|
1372
|
-
L[C - 1] = D & -129;
|
|
1373
|
-
const N = Ot(L), M = x ? h : r.ORDER;
|
|
1374
|
-
tt("pointHex.y", N, le, M);
|
|
1375
|
-
const A = f(N * N), Y = f(A - re), ue = f(F * A - T);
|
|
1376
|
-
let { isValid: q, value: te } = y(Y, ue);
|
|
1377
|
-
if (!q) throw new Error("Point.fromHex: invalid y coordinate");
|
|
1378
|
-
const ce = (te & re) === re, be = (D & 128) !== 0;
|
|
1379
|
-
if (!x && te === le && be) throw new Error("Point.fromHex: x=0 and x_0=1");
|
|
1380
|
-
return be !== ce && (te = f(-te)), m.fromAffine({ x: te, y: N });
|
|
1381
|
-
}
|
|
1382
|
-
static fromPrivateKey(w) {
|
|
1383
|
-
return V(w).point;
|
|
1384
|
-
}
|
|
1385
|
-
toRawBytes() {
|
|
1386
|
-
const { x: w, y: x } = this.toAffine(), F = ar(x, r.BYTES);
|
|
1387
|
-
return F[F.length - 1] |= w & re ? 128 : 0, F;
|
|
1388
|
-
}
|
|
1389
|
-
toHex() {
|
|
1390
|
-
return yr(this.toRawBytes());
|
|
1391
|
-
}
|
|
1392
|
-
}
|
|
1393
|
-
m.BASE = new m(t.Gx, t.Gy, re, f(t.Gx * t.Gy)), m.ZERO = new m(le, re, re, le);
|
|
1394
|
-
const { BASE: O, ZERO: j } = m, $ = ha(m, l * 8);
|
|
1395
|
-
function G(E) {
|
|
1396
|
-
return K(E, n);
|
|
1397
|
-
}
|
|
1398
|
-
function z(E) {
|
|
1399
|
-
return G(Ot(E));
|
|
1400
|
-
}
|
|
1401
|
-
function V(E) {
|
|
1402
|
-
const w = r.BYTES;
|
|
1403
|
-
E = _e("private key", E, w);
|
|
1404
|
-
const x = _e("hashed private key", o(E), 2 * w), F = g(x.slice(0, w)), T = x.slice(w, 2 * w), C = z(F), L = O.multiply(C), D = L.toRawBytes();
|
|
1405
|
-
return { head: F, prefix: T, scalar: C, point: L, pointBytes: D };
|
|
1406
|
-
}
|
|
1407
|
-
function he(E) {
|
|
1408
|
-
return V(E).pointBytes;
|
|
1409
|
-
}
|
|
1410
|
-
function de(E = new Uint8Array(), ...w) {
|
|
1411
|
-
const x = Xr(...w);
|
|
1412
|
-
return z(o(p(x, _e("context", E), !!i)));
|
|
1413
|
-
}
|
|
1414
|
-
function ae(E, w, x = {}) {
|
|
1415
|
-
E = _e("message", E), i && (E = i(E));
|
|
1416
|
-
const { prefix: F, scalar: T, pointBytes: C } = V(w), L = de(x.context, F, E), D = O.multiply(L).toRawBytes(), N = de(x.context, D, C, E), M = G(L + N * T);
|
|
1417
|
-
tt("signature.s", M, le, n);
|
|
1418
|
-
const A = Xr(D, ar(M, r.BYTES));
|
|
1419
|
-
return _e("result", A, r.BYTES * 2);
|
|
1420
|
-
}
|
|
1421
|
-
const Ce = ga;
|
|
1422
|
-
function We(E, w, x, F = Ce) {
|
|
1423
|
-
const { context: T, zip215: C } = F, L = r.BYTES;
|
|
1424
|
-
E = _e("signature", E, 2 * L), w = _e("message", w), x = _e("publicKey", x, L), C !== void 0 && Xt("zip215", C), i && (w = i(w));
|
|
1425
|
-
const D = Ot(E.slice(L, 2 * L));
|
|
1426
|
-
let N, M, A;
|
|
1427
|
-
try {
|
|
1428
|
-
N = m.fromHex(x, C), M = m.fromHex(E.slice(0, L), C), A = O.multiplyUnsafe(D);
|
|
1429
|
-
} catch {
|
|
1430
|
-
return !1;
|
|
1431
|
-
}
|
|
1432
|
-
if (!C && N.isSmallOrder()) return !1;
|
|
1433
|
-
const Y = de(T, M.toRawBytes(), N.toRawBytes(), w);
|
|
1434
|
-
return M.add(N.multiplyUnsafe(Y)).subtract(A).clearCofactor().equals(m.ZERO);
|
|
1435
|
-
}
|
|
1436
|
-
return O._setWindowSize(8), { CURVE: t, getPublicKey: he, sign: ae, verify: We, ExtendedPoint: m, utils: { getExtendedPublicKey: V, randomPrivateKey: () => a(r.BYTES), precompute(E = 8, w = m.BASE) {
|
|
1437
|
-
return w._setWindowSize(E), w.multiply(BigInt(3)), w;
|
|
1438
|
-
} } };
|
|
1439
|
-
}
|
|
1440
|
-
BigInt(0), BigInt(1);
|
|
1441
|
-
const vr = BigInt("57896044618658097711785492504343953926634992332820282019728792003956564819949"), on = BigInt("19681161376707505956807079304988542015446066515923890162744021073123829784752");
|
|
1442
|
-
BigInt(0);
|
|
1443
|
-
const ma = BigInt(1), sn = BigInt(2);
|
|
1444
|
-
BigInt(3);
|
|
1445
|
-
const va = BigInt(5), _a = BigInt(8);
|
|
1446
|
-
function xa(e) {
|
|
1447
|
-
const t = BigInt(10), r = BigInt(20), n = BigInt(40), i = BigInt(80), o = vr, a = e * e % o * e % o, l = pe(a, sn, o) * a % o, u = pe(l, ma, o) * e % o, h = pe(u, va, o) * u % o, f = pe(h, t, o) * h % o, b = pe(f, r, o) * f % o, y = pe(b, n, o) * b % o, g = pe(y, i, o) * y % o, p = pe(g, i, o) * y % o, _ = pe(p, t, o) * h % o;
|
|
1448
|
-
return { pow_p_5_8: pe(_, sn, o) * e % o, b2: a };
|
|
1449
|
-
}
|
|
1450
|
-
function Ea(e) {
|
|
1451
|
-
return e[0] &= 248, e[31] &= 127, e[31] |= 64, e;
|
|
1452
|
-
}
|
|
1453
|
-
function Fa(e, t) {
|
|
1454
|
-
const r = vr, n = K(t * t * t, r), i = K(n * n * t, r), o = xa(e * i).pow_p_5_8;
|
|
1455
|
-
let a = K(e * n * o, r);
|
|
1456
|
-
const l = K(t * a * a, r), u = a, h = K(a * on, r), f = l === e, b = l === K(-e, r), y = l === K(-e * on, r);
|
|
1457
|
-
return f && (a = u), (b || y) && (a = h), oa(a, r) && (a = K(-a, r)), { isValid: f || b, value: a };
|
|
1458
|
-
}
|
|
1459
|
-
const Aa = Nn(vr, void 0, !0), Ba = { a: BigInt(-1), d: BigInt("37095705934669439343138083508754565189542113879843219016388785533085940283555"), Fp: Aa, n: BigInt("7237005577332262213973186563042994240857116359379907606001950938285454250989"), h: _a, Gx: BigInt("15112221349535400772501151409588531511454012693041857206046113283949847762202"), Gy: BigInt("46316835694926478169428394003475163141307993866256225615783033603165251855960"), hash: qs, randomBytes: On, adjustScalarBytes: Ea, uvRatio: Fa }, zn = ya(Ba), Sa = "EdDSA", Oa = "JWT", It = ".", Nt = "base64url", Dn = "utf8", Mn = "utf8", Ta = ":", Ca = "did", Ia = "key", an = "base58btc", Ra = "z", La = "K36", Pa = 32;
|
|
1460
|
-
function _r(e) {
|
|
1461
|
-
return globalThis.Buffer != null ? new Uint8Array(e.buffer, e.byteOffset, e.byteLength) : e;
|
|
1462
|
-
}
|
|
1463
|
-
function Hn(e = 0) {
|
|
1464
|
-
return globalThis.Buffer != null && globalThis.Buffer.allocUnsafe != null ? _r(globalThis.Buffer.allocUnsafe(e)) : new Uint8Array(e);
|
|
1465
|
-
}
|
|
1466
|
-
function $n(e, t) {
|
|
1467
|
-
t || (t = e.reduce((i, o) => i + o.length, 0));
|
|
1468
|
-
const r = Hn(t);
|
|
1469
|
-
let n = 0;
|
|
1470
|
-
for (const i of e) r.set(i, n), n += i.length;
|
|
1471
|
-
return _r(r);
|
|
1472
|
-
}
|
|
1473
|
-
function Na(e, t) {
|
|
1474
|
-
if (e.length >= 255) throw new TypeError("Alphabet too long");
|
|
1475
|
-
for (var r = new Uint8Array(256), n = 0; n < r.length; n++) r[n] = 255;
|
|
1476
|
-
for (var i = 0; i < e.length; i++) {
|
|
1477
|
-
var o = e.charAt(i), a = o.charCodeAt(0);
|
|
1478
|
-
if (r[a] !== 255) throw new TypeError(o + " is ambiguous");
|
|
1479
|
-
r[a] = i;
|
|
1480
|
-
}
|
|
1481
|
-
var l = e.length, u = e.charAt(0), h = Math.log(l) / Math.log(256), f = Math.log(256) / Math.log(l);
|
|
1482
|
-
function b(p) {
|
|
1483
|
-
if (p instanceof Uint8Array || (ArrayBuffer.isView(p) ? p = new Uint8Array(p.buffer, p.byteOffset, p.byteLength) : Array.isArray(p) && (p = Uint8Array.from(p))), !(p instanceof Uint8Array)) throw new TypeError("Expected Uint8Array");
|
|
1484
|
-
if (p.length === 0) return "";
|
|
1485
|
-
for (var _ = 0, R = 0, P = 0, I = p.length; P !== I && p[P] === 0; ) P++, _++;
|
|
1486
|
-
for (var m = (I - P) * f + 1 >>> 0, O = new Uint8Array(m); P !== I; ) {
|
|
1487
|
-
for (var j = p[P], $ = 0, G = m - 1; (j !== 0 || $ < R) && G !== -1; G--, $++) j += 256 * O[G] >>> 0, O[G] = j % l >>> 0, j = j / l >>> 0;
|
|
1488
|
-
if (j !== 0) throw new Error("Non-zero carry");
|
|
1489
|
-
R = $, P++;
|
|
1490
|
-
}
|
|
1491
|
-
for (var z = m - R; z !== m && O[z] === 0; ) z++;
|
|
1492
|
-
for (var V = u.repeat(_); z < m; ++z) V += e.charAt(O[z]);
|
|
1493
|
-
return V;
|
|
1494
|
-
}
|
|
1495
|
-
function y(p) {
|
|
1496
|
-
if (typeof p != "string") throw new TypeError("Expected String");
|
|
1497
|
-
if (p.length === 0) return new Uint8Array();
|
|
1498
|
-
var _ = 0;
|
|
1499
|
-
if (p[_] !== " ") {
|
|
1500
|
-
for (var R = 0, P = 0; p[_] === u; ) R++, _++;
|
|
1501
|
-
for (var I = (p.length - _) * h + 1 >>> 0, m = new Uint8Array(I); p[_]; ) {
|
|
1502
|
-
var O = r[p.charCodeAt(_)];
|
|
1503
|
-
if (O === 255) return;
|
|
1504
|
-
for (var j = 0, $ = I - 1; (O !== 0 || j < P) && $ !== -1; $--, j++) O += l * m[$] >>> 0, m[$] = O % 256 >>> 0, O = O / 256 >>> 0;
|
|
1505
|
-
if (O !== 0) throw new Error("Non-zero carry");
|
|
1506
|
-
P = j, _++;
|
|
1507
|
-
}
|
|
1508
|
-
if (p[_] !== " ") {
|
|
1509
|
-
for (var G = I - P; G !== I && m[G] === 0; ) G++;
|
|
1510
|
-
for (var z = new Uint8Array(R + (I - G)), V = R; G !== I; ) z[V++] = m[G++];
|
|
1511
|
-
return z;
|
|
1512
|
-
}
|
|
1513
|
-
}
|
|
1514
|
-
}
|
|
1515
|
-
function g(p) {
|
|
1516
|
-
var _ = y(p);
|
|
1517
|
-
if (_) return _;
|
|
1518
|
-
throw new Error(`Non-${t} character`);
|
|
1519
|
-
}
|
|
1520
|
-
return { encode: b, decodeUnsafe: y, decode: g };
|
|
1521
|
-
}
|
|
1522
|
-
var Ua = Na, ja = Ua;
|
|
1523
|
-
const kn = (e) => {
|
|
1524
|
-
if (e instanceof Uint8Array && e.constructor.name === "Uint8Array") return e;
|
|
1525
|
-
if (e instanceof ArrayBuffer) return new Uint8Array(e);
|
|
1526
|
-
if (ArrayBuffer.isView(e)) return new Uint8Array(e.buffer, e.byteOffset, e.byteLength);
|
|
1527
|
-
throw new Error("Unknown type, must be binary type");
|
|
1528
|
-
}, za = (e) => new TextEncoder().encode(e), Da = (e) => new TextDecoder().decode(e);
|
|
1529
|
-
class Ma {
|
|
1530
|
-
constructor(t, r, n) {
|
|
1531
|
-
this.name = t, this.prefix = r, this.baseEncode = n;
|
|
1532
|
-
}
|
|
1533
|
-
encode(t) {
|
|
1534
|
-
if (t instanceof Uint8Array) return `${this.prefix}${this.baseEncode(t)}`;
|
|
1535
|
-
throw Error("Unknown type, must be binary type");
|
|
1536
|
-
}
|
|
1537
|
-
}
|
|
1538
|
-
class Ha {
|
|
1539
|
-
constructor(t, r, n) {
|
|
1540
|
-
if (this.name = t, this.prefix = r, r.codePointAt(0) === void 0) throw new Error("Invalid prefix character");
|
|
1541
|
-
this.prefixCodePoint = r.codePointAt(0), this.baseDecode = n;
|
|
1542
|
-
}
|
|
1543
|
-
decode(t) {
|
|
1544
|
-
if (typeof t == "string") {
|
|
1545
|
-
if (t.codePointAt(0) !== this.prefixCodePoint) throw Error(`Unable to decode multibase string ${JSON.stringify(t)}, ${this.name} decoder only supports inputs prefixed with ${this.prefix}`);
|
|
1546
|
-
return this.baseDecode(t.slice(this.prefix.length));
|
|
1547
|
-
} else throw Error("Can only multibase decode strings");
|
|
1548
|
-
}
|
|
1549
|
-
or(t) {
|
|
1550
|
-
return Gn(this, t);
|
|
1551
|
-
}
|
|
1552
|
-
}
|
|
1553
|
-
class $a {
|
|
1554
|
-
constructor(t) {
|
|
1555
|
-
this.decoders = t;
|
|
1556
|
-
}
|
|
1557
|
-
or(t) {
|
|
1558
|
-
return Gn(this, t);
|
|
1559
|
-
}
|
|
1560
|
-
decode(t) {
|
|
1561
|
-
const r = t[0], n = this.decoders[r];
|
|
1562
|
-
if (n) return n.decode(t);
|
|
1563
|
-
throw RangeError(`Unable to decode multibase string ${JSON.stringify(t)}, only inputs prefixed with ${Object.keys(this.decoders)} are supported`);
|
|
1564
|
-
}
|
|
1565
|
-
}
|
|
1566
|
-
const Gn = (e, t) => new $a({ ...e.decoders || { [e.prefix]: e }, ...t.decoders || { [t.prefix]: t } });
|
|
1567
|
-
class ka {
|
|
1568
|
-
constructor(t, r, n, i) {
|
|
1569
|
-
this.name = t, this.prefix = r, this.baseEncode = n, this.baseDecode = i, this.encoder = new Ma(t, r, n), this.decoder = new Ha(t, r, i);
|
|
1570
|
-
}
|
|
1571
|
-
encode(t) {
|
|
1572
|
-
return this.encoder.encode(t);
|
|
1573
|
-
}
|
|
1574
|
-
decode(t) {
|
|
1575
|
-
return this.decoder.decode(t);
|
|
1576
|
-
}
|
|
1577
|
-
}
|
|
1578
|
-
const Ut = ({ name: e, prefix: t, encode: r, decode: n }) => new ka(e, t, r, n), ut = ({ prefix: e, name: t, alphabet: r }) => {
|
|
1579
|
-
const { encode: n, decode: i } = ja(r, t);
|
|
1580
|
-
return Ut({ prefix: e, name: t, encode: n, decode: (o) => kn(i(o)) });
|
|
1581
|
-
}, Ga = (e, t, r, n) => {
|
|
1582
|
-
const i = {};
|
|
1583
|
-
for (let f = 0; f < t.length; ++f) i[t[f]] = f;
|
|
1584
|
-
let o = e.length;
|
|
1585
|
-
for (; e[o - 1] === "="; ) --o;
|
|
1586
|
-
const a = new Uint8Array(o * r / 8 | 0);
|
|
1587
|
-
let l = 0, u = 0, h = 0;
|
|
1588
|
-
for (let f = 0; f < o; ++f) {
|
|
1589
|
-
const b = i[e[f]];
|
|
1590
|
-
if (b === void 0) throw new SyntaxError(`Non-${n} character`);
|
|
1591
|
-
u = u << r | b, l += r, l >= 8 && (l -= 8, a[h++] = 255 & u >> l);
|
|
1592
|
-
}
|
|
1593
|
-
if (l >= r || 255 & u << 8 - l) throw new SyntaxError("Unexpected end of data");
|
|
1594
|
-
return a;
|
|
1595
|
-
}, Va = (e, t, r) => {
|
|
1596
|
-
const n = t[t.length - 1] === "=", i = (1 << r) - 1;
|
|
1597
|
-
let o = "", a = 0, l = 0;
|
|
1598
|
-
for (let u = 0; u < e.length; ++u) for (l = l << 8 | e[u], a += 8; a > r; ) a -= r, o += t[i & l >> a];
|
|
1599
|
-
if (a && (o += t[i & l << r - a]), n) for (; o.length * r & 7; ) o += "=";
|
|
1600
|
-
return o;
|
|
1601
|
-
}, Q = ({ name: e, prefix: t, bitsPerChar: r, alphabet: n }) => Ut({ prefix: t, name: e, encode(i) {
|
|
1602
|
-
return Va(i, n, r);
|
|
1603
|
-
}, decode(i) {
|
|
1604
|
-
return Ga(i, n, r, e);
|
|
1605
|
-
} }), Wa = Ut({ prefix: "\0", name: "identity", encode: (e) => Da(e), decode: (e) => za(e) });
|
|
1606
|
-
var qa = Object.freeze({ __proto__: null, identity: Wa });
|
|
1607
|
-
const Ka = Q({ prefix: "0", name: "base2", alphabet: "01", bitsPerChar: 1 });
|
|
1608
|
-
var Ja = Object.freeze({ __proto__: null, base2: Ka });
|
|
1609
|
-
const Za = Q({ prefix: "7", name: "base8", alphabet: "01234567", bitsPerChar: 3 });
|
|
1610
|
-
var Ya = Object.freeze({ __proto__: null, base8: Za });
|
|
1611
|
-
const Xa = ut({ prefix: "9", name: "base10", alphabet: "0123456789" });
|
|
1612
|
-
var Qa = Object.freeze({ __proto__: null, base10: Xa });
|
|
1613
|
-
const eu = Q({ prefix: "f", name: "base16", alphabet: "0123456789abcdef", bitsPerChar: 4 }), tu = Q({ prefix: "F", name: "base16upper", alphabet: "0123456789ABCDEF", bitsPerChar: 4 });
|
|
1614
|
-
var ru = Object.freeze({ __proto__: null, base16: eu, base16upper: tu });
|
|
1615
|
-
const nu = Q({ prefix: "b", name: "base32", alphabet: "abcdefghijklmnopqrstuvwxyz234567", bitsPerChar: 5 }), iu = Q({ prefix: "B", name: "base32upper", alphabet: "ABCDEFGHIJKLMNOPQRSTUVWXYZ234567", bitsPerChar: 5 }), ou = Q({ prefix: "c", name: "base32pad", alphabet: "abcdefghijklmnopqrstuvwxyz234567=", bitsPerChar: 5 }), su = Q({ prefix: "C", name: "base32padupper", alphabet: "ABCDEFGHIJKLMNOPQRSTUVWXYZ234567=", bitsPerChar: 5 }), au = Q({ prefix: "v", name: "base32hex", alphabet: "0123456789abcdefghijklmnopqrstuv", bitsPerChar: 5 }), uu = Q({ prefix: "V", name: "base32hexupper", alphabet: "0123456789ABCDEFGHIJKLMNOPQRSTUV", bitsPerChar: 5 }), cu = Q({ prefix: "t", name: "base32hexpad", alphabet: "0123456789abcdefghijklmnopqrstuv=", bitsPerChar: 5 }), fu = Q({ prefix: "T", name: "base32hexpadupper", alphabet: "0123456789ABCDEFGHIJKLMNOPQRSTUV=", bitsPerChar: 5 }), lu = Q({ prefix: "h", name: "base32z", alphabet: "ybndrfg8ejkmcpqxot1uwisza345h769", bitsPerChar: 5 });
|
|
1616
|
-
var hu = Object.freeze({ __proto__: null, base32: nu, base32upper: iu, base32pad: ou, base32padupper: su, base32hex: au, base32hexupper: uu, base32hexpad: cu, base32hexpadupper: fu, base32z: lu });
|
|
1617
|
-
const du = ut({ prefix: "k", name: "base36", alphabet: "0123456789abcdefghijklmnopqrstuvwxyz" }), bu = ut({ prefix: "K", name: "base36upper", alphabet: "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ" });
|
|
1618
|
-
var pu = Object.freeze({ __proto__: null, base36: du, base36upper: bu });
|
|
1619
|
-
const gu = ut({ name: "base58btc", prefix: "z", alphabet: "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz" }), wu = ut({ name: "base58flickr", prefix: "Z", alphabet: "123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ" });
|
|
1620
|
-
var yu = Object.freeze({ __proto__: null, base58btc: gu, base58flickr: wu });
|
|
1621
|
-
const mu = Q({ prefix: "m", name: "base64", alphabet: "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/", bitsPerChar: 6 }), vu = Q({ prefix: "M", name: "base64pad", alphabet: "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=", bitsPerChar: 6 }), _u = Q({ prefix: "u", name: "base64url", alphabet: "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_", bitsPerChar: 6 }), xu = Q({ prefix: "U", name: "base64urlpad", alphabet: "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_=", bitsPerChar: 6 });
|
|
1622
|
-
var Eu = Object.freeze({ __proto__: null, base64: mu, base64pad: vu, base64url: _u, base64urlpad: xu });
|
|
1623
|
-
const Vn = Array.from("🚀🪐☄🛰🌌🌑🌒🌓🌔🌕🌖🌗🌘🌍🌏🌎🐉☀💻🖥💾💿😂❤😍🤣😊🙏💕😭😘👍😅👏😁🔥🥰💔💖💙😢🤔😆🙄💪😉☺👌🤗💜😔😎😇🌹🤦🎉💞✌✨🤷😱😌🌸🙌😋💗💚😏💛🙂💓🤩😄😀🖤😃💯🙈👇🎶😒🤭❣😜💋👀😪😑💥🙋😞😩😡🤪👊🥳😥🤤👉💃😳✋😚😝😴🌟😬🙃🍀🌷😻😓⭐✅🥺🌈😈🤘💦✔😣🏃💐☹🎊💘😠☝😕🌺🎂🌻😐🖕💝🙊😹🗣💫💀👑🎵🤞😛🔴😤🌼😫⚽🤙☕🏆🤫👈😮🙆🍻🍃🐶💁😲🌿🧡🎁⚡🌞🎈❌✊👋😰🤨😶🤝🚶💰🍓💢🤟🙁🚨💨🤬✈🎀🍺🤓😙💟🌱😖👶🥴▶➡❓💎💸⬇😨🌚🦋😷🕺⚠🙅😟😵👎🤲🤠🤧📌🔵💅🧐🐾🍒😗🤑🌊🤯🐷☎💧😯💆👆🎤🙇🍑❄🌴💣🐸💌📍🥀🤢👅💡💩👐📸👻🤐🤮🎼🥵🚩🍎🍊👼💍📣🥂"), Fu = Vn.reduce((e, t, r) => (e[r] = t, e), []), Au = Vn.reduce((e, t, r) => (e[t.codePointAt(0)] = r, e), []);
|
|
1624
|
-
function Bu(e) {
|
|
1625
|
-
return e.reduce((t, r) => (t += Fu[r], t), "");
|
|
1626
|
-
}
|
|
1627
|
-
function Su(e) {
|
|
1628
|
-
const t = [];
|
|
1629
|
-
for (const r of e) {
|
|
1630
|
-
const n = Au[r.codePointAt(0)];
|
|
1631
|
-
if (n === void 0) throw new Error(`Non-base256emoji character: ${r}`);
|
|
1632
|
-
t.push(n);
|
|
1633
|
-
}
|
|
1634
|
-
return new Uint8Array(t);
|
|
1635
|
-
}
|
|
1636
|
-
const Ou = Ut({ prefix: "🚀", name: "base256emoji", encode: Bu, decode: Su });
|
|
1637
|
-
var Tu = Object.freeze({ __proto__: null, base256emoji: Ou }), Cu = Wn, un = 128, Iu = -128, Ru = Math.pow(2, 31);
|
|
1638
|
-
function Wn(e, t, r) {
|
|
1639
|
-
t = t || [], r = r || 0;
|
|
1640
|
-
for (var n = r; e >= Ru; ) t[r++] = e & 255 | un, e /= 128;
|
|
1641
|
-
for (; e & Iu; ) t[r++] = e & 255 | un, e >>>= 7;
|
|
1642
|
-
return t[r] = e | 0, Wn.bytes = r - n + 1, t;
|
|
1643
|
-
}
|
|
1644
|
-
var Lu = cr, Pu = 128, cn = 127;
|
|
1645
|
-
function cr(e, n) {
|
|
1646
|
-
var r = 0, n = n || 0, i = 0, o = n, a, l = e.length;
|
|
1647
|
-
do {
|
|
1648
|
-
if (o >= l) throw cr.bytes = 0, new RangeError("Could not decode varint");
|
|
1649
|
-
a = e[o++], r += i < 28 ? (a & cn) << i : (a & cn) * Math.pow(2, i), i += 7;
|
|
1650
|
-
} while (a >= Pu);
|
|
1651
|
-
return cr.bytes = o - n, r;
|
|
1652
|
-
}
|
|
1653
|
-
var Nu = Math.pow(2, 7), Uu = Math.pow(2, 14), ju = Math.pow(2, 21), zu = Math.pow(2, 28), Du = Math.pow(2, 35), Mu = Math.pow(2, 42), Hu = Math.pow(2, 49), $u = Math.pow(2, 56), ku = Math.pow(2, 63), Gu = function(e) {
|
|
1654
|
-
return e < Nu ? 1 : e < Uu ? 2 : e < ju ? 3 : e < zu ? 4 : e < Du ? 5 : e < Mu ? 6 : e < Hu ? 7 : e < $u ? 8 : e < ku ? 9 : 10;
|
|
1655
|
-
}, Vu = { encode: Cu, decode: Lu, encodingLength: Gu }, qn = Vu;
|
|
1656
|
-
const fn = (e, t, r = 0) => (qn.encode(e, t, r), t), ln = (e) => qn.encodingLength(e), fr = (e, t) => {
|
|
1657
|
-
const r = t.byteLength, n = ln(e), i = n + ln(r), o = new Uint8Array(i + r);
|
|
1658
|
-
return fn(e, o, 0), fn(r, o, n), o.set(t, i), new Wu(e, r, t, o);
|
|
1659
|
-
};
|
|
1660
|
-
class Wu {
|
|
1661
|
-
constructor(t, r, n, i) {
|
|
1662
|
-
this.code = t, this.size = r, this.digest = n, this.bytes = i;
|
|
1663
|
-
}
|
|
1664
|
-
}
|
|
1665
|
-
const Kn = ({ name: e, code: t, encode: r }) => new qu(e, t, r);
|
|
1666
|
-
class qu {
|
|
1667
|
-
constructor(t, r, n) {
|
|
1668
|
-
this.name = t, this.code = r, this.encode = n;
|
|
1669
|
-
}
|
|
1670
|
-
digest(t) {
|
|
1671
|
-
if (t instanceof Uint8Array) {
|
|
1672
|
-
const r = this.encode(t);
|
|
1673
|
-
return r instanceof Uint8Array ? fr(this.code, r) : r.then((n) => fr(this.code, n));
|
|
1674
|
-
} else throw Error("Unknown type, must be binary type");
|
|
1675
|
-
}
|
|
1676
|
-
}
|
|
1677
|
-
const Jn = (e) => async (t) => new Uint8Array(await crypto.subtle.digest(e, t)), Ku = Kn({ name: "sha2-256", code: 18, encode: Jn("SHA-256") }), Ju = Kn({ name: "sha2-512", code: 19, encode: Jn("SHA-512") });
|
|
1678
|
-
var Zu = Object.freeze({ __proto__: null, sha256: Ku, sha512: Ju });
|
|
1679
|
-
const Zn = 0, Yu = "identity", Yn = kn, Xu = (e) => fr(Zn, Yn(e)), Qu = { code: Zn, name: Yu, encode: Yn, digest: Xu };
|
|
1680
|
-
var ec = Object.freeze({ __proto__: null, identity: Qu });
|
|
1681
|
-
new TextEncoder(), new TextDecoder();
|
|
1682
|
-
const hn = { ...qa, ...Ja, ...Ya, ...Qa, ...ru, ...hu, ...pu, ...yu, ...Eu, ...Tu };
|
|
1683
|
-
({ ...Zu, ...ec });
|
|
1684
|
-
function Xn(e, t, r, n) {
|
|
1685
|
-
return { name: e, prefix: t, encoder: { name: e, prefix: t, encode: r }, decoder: { decode: n } };
|
|
1686
|
-
}
|
|
1687
|
-
const dn = Xn("utf8", "u", (e) => "u" + new TextDecoder("utf8").decode(e), (e) => new TextEncoder().encode(e.substring(1))), ir = Xn("ascii", "a", (e) => {
|
|
1688
|
-
let t = "a";
|
|
1689
|
-
for (let r = 0; r < e.length; r++) t += String.fromCharCode(e[r]);
|
|
1690
|
-
return t;
|
|
1691
|
-
}, (e) => {
|
|
1692
|
-
e = e.substring(1);
|
|
1693
|
-
const t = Hn(e.length);
|
|
1694
|
-
for (let r = 0; r < e.length; r++) t[r] = e.charCodeAt(r);
|
|
1695
|
-
return t;
|
|
1696
|
-
}), Qn = { utf8: dn, "utf-8": dn, hex: hn.base16, latin1: ir, ascii: ir, binary: ir, ...hn };
|
|
1697
|
-
function jt(e, t = "utf8") {
|
|
1698
|
-
const r = Qn[t];
|
|
1699
|
-
if (!r) throw new Error(`Unsupported encoding "${t}"`);
|
|
1700
|
-
return (t === "utf8" || t === "utf-8") && globalThis.Buffer != null && globalThis.Buffer.from != null ? globalThis.Buffer.from(e.buffer, e.byteOffset, e.byteLength).toString("utf8") : r.encoder.encode(e).substring(1);
|
|
1701
|
-
}
|
|
1702
|
-
function Ve(e, t = "utf8") {
|
|
1703
|
-
const r = Qn[t];
|
|
1704
|
-
if (!r) throw new Error(`Unsupported encoding "${t}"`);
|
|
1705
|
-
return (t === "utf8" || t === "utf-8") && globalThis.Buffer != null && globalThis.Buffer.from != null ? _r(globalThis.Buffer.from(e, "utf-8")) : r.decoder.decode(`${r.prefix}${e}`);
|
|
1706
|
-
}
|
|
1707
|
-
function bn(e) {
|
|
1708
|
-
return bs(jt(Ve(e, Nt), Dn));
|
|
1709
|
-
}
|
|
1710
|
-
function Rt(e) {
|
|
1711
|
-
return jt(Ve(ps(e), Dn), Nt);
|
|
1712
|
-
}
|
|
1713
|
-
function tc(e) {
|
|
1714
|
-
const t = Ve(La, an), r = Ra + jt($n([t, e]), an);
|
|
1715
|
-
return [Ca, Ia, r].join(Ta);
|
|
1716
|
-
}
|
|
1717
|
-
function rc(e) {
|
|
1718
|
-
return jt(e, Nt);
|
|
1719
|
-
}
|
|
1720
|
-
function nc(e) {
|
|
1721
|
-
return Ve(e, Nt);
|
|
1722
|
-
}
|
|
1723
|
-
function ic(e) {
|
|
1724
|
-
return Ve([Rt(e.header), Rt(e.payload)].join(It), Mn);
|
|
1725
|
-
}
|
|
1726
|
-
function oc(e) {
|
|
1727
|
-
return [Rt(e.header), Rt(e.payload), rc(e.signature)].join(It);
|
|
1728
|
-
}
|
|
1729
|
-
function ff(e) {
|
|
1730
|
-
const t = e.split(It), r = bn(t[0]), n = bn(t[1]), i = nc(t[2]), o = Ve(t.slice(0, 2).join(It), Mn);
|
|
1731
|
-
return { header: r, payload: n, signature: i, data: o };
|
|
1732
|
-
}
|
|
1733
|
-
function lf(e = On(Pa)) {
|
|
1734
|
-
const t = zn.getPublicKey(e);
|
|
1735
|
-
return { secretKey: $n([e, t]), publicKey: t };
|
|
1736
|
-
}
|
|
1737
|
-
async function hf(e, t, r, n, i = po.fromMiliseconds(Date.now())) {
|
|
1738
|
-
const o = { alg: Sa, typ: Oa }, a = tc(n.publicKey), l = i + r, u = { iss: a, sub: e, aud: t, iat: i, exp: l }, h = ic({ header: o, payload: u }), f = zn.sign(h, n.secretKey.slice(0, 32));
|
|
1739
|
-
return oc({ header: o, payload: u, signature: f });
|
|
1740
|
-
}
|
|
1741
|
-
const sc = "PARSE_ERROR", ac = "INVALID_REQUEST", uc = "METHOD_NOT_FOUND", cc = "INVALID_PARAMS", ei = "INTERNAL_ERROR", xr = "SERVER_ERROR", fc = [-32700, -32600, -32601, -32602, -32603], rt = {
|
|
1742
|
-
[sc]: { code: -32700, message: "Parse error" },
|
|
1743
|
-
[ac]: { code: -32600, message: "Invalid Request" },
|
|
1744
|
-
[uc]: { code: -32601, message: "Method not found" },
|
|
1745
|
-
[cc]: { code: -32602, message: "Invalid params" },
|
|
1746
|
-
[ei]: { code: -32603, message: "Internal error" },
|
|
1747
|
-
[xr]: { code: -32e3, message: "Server error" }
|
|
1748
|
-
}, ti = xr;
|
|
1749
|
-
function lc(e) {
|
|
1750
|
-
return fc.includes(e);
|
|
1751
|
-
}
|
|
1752
|
-
function pn(e) {
|
|
1753
|
-
return Object.keys(rt).includes(e) ? rt[e] : rt[ti];
|
|
1754
|
-
}
|
|
1755
|
-
function hc(e) {
|
|
1756
|
-
const t = Object.values(rt).find((r) => r.code === e);
|
|
1757
|
-
return t || rt[ti];
|
|
1758
|
-
}
|
|
1759
|
-
function df(e, t, r) {
|
|
1760
|
-
return e.message.includes("getaddrinfo ENOTFOUND") || e.message.includes("connect ECONNREFUSED") ? new Error(`Unavailable ${r} RPC url at ${t}`) : e;
|
|
1761
|
-
}
|
|
1762
|
-
var dc = {};
|
|
1763
|
-
/*! *****************************************************************************
|
|
1764
|
-
Copyright (c) Microsoft Corporation.
|
|
1765
|
-
|
|
1766
|
-
Permission to use, copy, modify, and/or distribute this software for any
|
|
1767
|
-
purpose with or without fee is hereby granted.
|
|
1768
|
-
|
|
1769
|
-
THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
|
|
1770
|
-
REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
|
|
1771
|
-
AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
|
|
1772
|
-
INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
|
|
1773
|
-
LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
|
|
1774
|
-
OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
|
|
1775
|
-
PERFORMANCE OF THIS SOFTWARE.
|
|
1776
|
-
***************************************************************************** */
|
|
1777
|
-
var lr = function(e, t) {
|
|
1778
|
-
return lr = Object.setPrototypeOf || { __proto__: [] } instanceof Array && function(r, n) {
|
|
1779
|
-
r.__proto__ = n;
|
|
1780
|
-
} || function(r, n) {
|
|
1781
|
-
for (var i in n) n.hasOwnProperty(i) && (r[i] = n[i]);
|
|
1782
|
-
}, lr(e, t);
|
|
1783
|
-
};
|
|
1784
|
-
function bc(e, t) {
|
|
1785
|
-
lr(e, t);
|
|
1786
|
-
function r() {
|
|
1787
|
-
this.constructor = e;
|
|
1788
|
-
}
|
|
1789
|
-
e.prototype = t === null ? Object.create(t) : (r.prototype = t.prototype, new r());
|
|
1790
|
-
}
|
|
1791
|
-
var hr = function() {
|
|
1792
|
-
return hr = Object.assign || function(t) {
|
|
1793
|
-
for (var r, n = 1, i = arguments.length; n < i; n++) {
|
|
1794
|
-
r = arguments[n];
|
|
1795
|
-
for (var o in r) Object.prototype.hasOwnProperty.call(r, o) && (t[o] = r[o]);
|
|
1796
|
-
}
|
|
1797
|
-
return t;
|
|
1798
|
-
}, hr.apply(this, arguments);
|
|
1799
|
-
};
|
|
1800
|
-
function pc(e, t) {
|
|
1801
|
-
var r = {};
|
|
1802
|
-
for (var n in e) Object.prototype.hasOwnProperty.call(e, n) && t.indexOf(n) < 0 && (r[n] = e[n]);
|
|
1803
|
-
if (e != null && typeof Object.getOwnPropertySymbols == "function")
|
|
1804
|
-
for (var i = 0, n = Object.getOwnPropertySymbols(e); i < n.length; i++)
|
|
1805
|
-
t.indexOf(n[i]) < 0 && Object.prototype.propertyIsEnumerable.call(e, n[i]) && (r[n[i]] = e[n[i]]);
|
|
1806
|
-
return r;
|
|
1807
|
-
}
|
|
1808
|
-
function gc(e, t, r, n) {
|
|
1809
|
-
var i = arguments.length, o = i < 3 ? t : n === null ? n = Object.getOwnPropertyDescriptor(t, r) : n, a;
|
|
1810
|
-
if (typeof Reflect == "object" && typeof Reflect.decorate == "function") o = Reflect.decorate(e, t, r, n);
|
|
1811
|
-
else for (var l = e.length - 1; l >= 0; l--) (a = e[l]) && (o = (i < 3 ? a(o) : i > 3 ? a(t, r, o) : a(t, r)) || o);
|
|
1812
|
-
return i > 3 && o && Object.defineProperty(t, r, o), o;
|
|
1813
|
-
}
|
|
1814
|
-
function wc(e, t) {
|
|
1815
|
-
return function(r, n) {
|
|
1816
|
-
t(r, n, e);
|
|
1817
|
-
};
|
|
1818
|
-
}
|
|
1819
|
-
function yc(e, t) {
|
|
1820
|
-
if (typeof Reflect == "object" && typeof Reflect.metadata == "function") return Reflect.metadata(e, t);
|
|
1821
|
-
}
|
|
1822
|
-
function mc(e, t, r, n) {
|
|
1823
|
-
function i(o) {
|
|
1824
|
-
return o instanceof r ? o : new r(function(a) {
|
|
1825
|
-
a(o);
|
|
1826
|
-
});
|
|
1827
|
-
}
|
|
1828
|
-
return new (r || (r = Promise))(function(o, a) {
|
|
1829
|
-
function l(f) {
|
|
1830
|
-
try {
|
|
1831
|
-
h(n.next(f));
|
|
1832
|
-
} catch (b) {
|
|
1833
|
-
a(b);
|
|
1834
|
-
}
|
|
1835
|
-
}
|
|
1836
|
-
function u(f) {
|
|
1837
|
-
try {
|
|
1838
|
-
h(n.throw(f));
|
|
1839
|
-
} catch (b) {
|
|
1840
|
-
a(b);
|
|
1841
|
-
}
|
|
1842
|
-
}
|
|
1843
|
-
function h(f) {
|
|
1844
|
-
f.done ? o(f.value) : i(f.value).then(l, u);
|
|
1845
|
-
}
|
|
1846
|
-
h((n = n.apply(e, t || [])).next());
|
|
1847
|
-
});
|
|
1848
|
-
}
|
|
1849
|
-
function vc(e, t) {
|
|
1850
|
-
var r = { label: 0, sent: function() {
|
|
1851
|
-
if (o[0] & 1) throw o[1];
|
|
1852
|
-
return o[1];
|
|
1853
|
-
}, trys: [], ops: [] }, n, i, o, a;
|
|
1854
|
-
return a = { next: l(0), throw: l(1), return: l(2) }, typeof Symbol == "function" && (a[Symbol.iterator] = function() {
|
|
1855
|
-
return this;
|
|
1856
|
-
}), a;
|
|
1857
|
-
function l(h) {
|
|
1858
|
-
return function(f) {
|
|
1859
|
-
return u([h, f]);
|
|
1860
|
-
};
|
|
1861
|
-
}
|
|
1862
|
-
function u(h) {
|
|
1863
|
-
if (n) throw new TypeError("Generator is already executing.");
|
|
1864
|
-
for (; r; ) try {
|
|
1865
|
-
if (n = 1, i && (o = h[0] & 2 ? i.return : h[0] ? i.throw || ((o = i.return) && o.call(i), 0) : i.next) && !(o = o.call(i, h[1])).done) return o;
|
|
1866
|
-
switch (i = 0, o && (h = [h[0] & 2, o.value]), h[0]) {
|
|
1867
|
-
case 0:
|
|
1868
|
-
case 1:
|
|
1869
|
-
o = h;
|
|
1870
|
-
break;
|
|
1871
|
-
case 4:
|
|
1872
|
-
return r.label++, { value: h[1], done: !1 };
|
|
1873
|
-
case 5:
|
|
1874
|
-
r.label++, i = h[1], h = [0];
|
|
1875
|
-
continue;
|
|
1876
|
-
case 7:
|
|
1877
|
-
h = r.ops.pop(), r.trys.pop();
|
|
1878
|
-
continue;
|
|
1879
|
-
default:
|
|
1880
|
-
if (o = r.trys, !(o = o.length > 0 && o[o.length - 1]) && (h[0] === 6 || h[0] === 2)) {
|
|
1881
|
-
r = 0;
|
|
1882
|
-
continue;
|
|
1883
|
-
}
|
|
1884
|
-
if (h[0] === 3 && (!o || h[1] > o[0] && h[1] < o[3])) {
|
|
1885
|
-
r.label = h[1];
|
|
1886
|
-
break;
|
|
1887
|
-
}
|
|
1888
|
-
if (h[0] === 6 && r.label < o[1]) {
|
|
1889
|
-
r.label = o[1], o = h;
|
|
1890
|
-
break;
|
|
1891
|
-
}
|
|
1892
|
-
if (o && r.label < o[2]) {
|
|
1893
|
-
r.label = o[2], r.ops.push(h);
|
|
1894
|
-
break;
|
|
1895
|
-
}
|
|
1896
|
-
o[2] && r.ops.pop(), r.trys.pop();
|
|
1897
|
-
continue;
|
|
1898
|
-
}
|
|
1899
|
-
h = t.call(e, r);
|
|
1900
|
-
} catch (f) {
|
|
1901
|
-
h = [6, f], i = 0;
|
|
1902
|
-
} finally {
|
|
1903
|
-
n = o = 0;
|
|
1904
|
-
}
|
|
1905
|
-
if (h[0] & 5) throw h[1];
|
|
1906
|
-
return { value: h[0] ? h[1] : void 0, done: !0 };
|
|
1907
|
-
}
|
|
1908
|
-
}
|
|
1909
|
-
function _c(e, t, r, n) {
|
|
1910
|
-
n === void 0 && (n = r), e[n] = t[r];
|
|
1911
|
-
}
|
|
1912
|
-
function xc(e, t) {
|
|
1913
|
-
for (var r in e) r !== "default" && !t.hasOwnProperty(r) && (t[r] = e[r]);
|
|
1914
|
-
}
|
|
1915
|
-
function dr(e) {
|
|
1916
|
-
var t = typeof Symbol == "function" && Symbol.iterator, r = t && e[t], n = 0;
|
|
1917
|
-
if (r) return r.call(e);
|
|
1918
|
-
if (e && typeof e.length == "number") return {
|
|
1919
|
-
next: function() {
|
|
1920
|
-
return e && n >= e.length && (e = void 0), { value: e && e[n++], done: !e };
|
|
1921
|
-
}
|
|
1922
|
-
};
|
|
1923
|
-
throw new TypeError(t ? "Object is not iterable." : "Symbol.iterator is not defined.");
|
|
1924
|
-
}
|
|
1925
|
-
function ri(e, t) {
|
|
1926
|
-
var r = typeof Symbol == "function" && e[Symbol.iterator];
|
|
1927
|
-
if (!r) return e;
|
|
1928
|
-
var n = r.call(e), i, o = [], a;
|
|
1929
|
-
try {
|
|
1930
|
-
for (; (t === void 0 || t-- > 0) && !(i = n.next()).done; ) o.push(i.value);
|
|
1931
|
-
} catch (l) {
|
|
1932
|
-
a = { error: l };
|
|
1933
|
-
} finally {
|
|
1934
|
-
try {
|
|
1935
|
-
i && !i.done && (r = n.return) && r.call(n);
|
|
1936
|
-
} finally {
|
|
1937
|
-
if (a) throw a.error;
|
|
1938
|
-
}
|
|
1939
|
-
}
|
|
1940
|
-
return o;
|
|
1941
|
-
}
|
|
1942
|
-
function Ec() {
|
|
1943
|
-
for (var e = [], t = 0; t < arguments.length; t++)
|
|
1944
|
-
e = e.concat(ri(arguments[t]));
|
|
1945
|
-
return e;
|
|
1946
|
-
}
|
|
1947
|
-
function Fc() {
|
|
1948
|
-
for (var e = 0, t = 0, r = arguments.length; t < r; t++) e += arguments[t].length;
|
|
1949
|
-
for (var n = Array(e), i = 0, t = 0; t < r; t++)
|
|
1950
|
-
for (var o = arguments[t], a = 0, l = o.length; a < l; a++, i++)
|
|
1951
|
-
n[i] = o[a];
|
|
1952
|
-
return n;
|
|
1953
|
-
}
|
|
1954
|
-
function ot(e) {
|
|
1955
|
-
return this instanceof ot ? (this.v = e, this) : new ot(e);
|
|
1956
|
-
}
|
|
1957
|
-
function Ac(e, t, r) {
|
|
1958
|
-
if (!Symbol.asyncIterator) throw new TypeError("Symbol.asyncIterator is not defined.");
|
|
1959
|
-
var n = r.apply(e, t || []), i, o = [];
|
|
1960
|
-
return i = {}, a("next"), a("throw"), a("return"), i[Symbol.asyncIterator] = function() {
|
|
1961
|
-
return this;
|
|
1962
|
-
}, i;
|
|
1963
|
-
function a(y) {
|
|
1964
|
-
n[y] && (i[y] = function(g) {
|
|
1965
|
-
return new Promise(function(p, _) {
|
|
1966
|
-
o.push([y, g, p, _]) > 1 || l(y, g);
|
|
1967
|
-
});
|
|
1968
|
-
});
|
|
1969
|
-
}
|
|
1970
|
-
function l(y, g) {
|
|
1971
|
-
try {
|
|
1972
|
-
u(n[y](g));
|
|
1973
|
-
} catch (p) {
|
|
1974
|
-
b(o[0][3], p);
|
|
1975
|
-
}
|
|
1976
|
-
}
|
|
1977
|
-
function u(y) {
|
|
1978
|
-
y.value instanceof ot ? Promise.resolve(y.value.v).then(h, f) : b(o[0][2], y);
|
|
1979
|
-
}
|
|
1980
|
-
function h(y) {
|
|
1981
|
-
l("next", y);
|
|
1982
|
-
}
|
|
1983
|
-
function f(y) {
|
|
1984
|
-
l("throw", y);
|
|
1985
|
-
}
|
|
1986
|
-
function b(y, g) {
|
|
1987
|
-
y(g), o.shift(), o.length && l(o[0][0], o[0][1]);
|
|
1988
|
-
}
|
|
1989
|
-
}
|
|
1990
|
-
function Bc(e) {
|
|
1991
|
-
var t, r;
|
|
1992
|
-
return t = {}, n("next"), n("throw", function(i) {
|
|
1993
|
-
throw i;
|
|
1994
|
-
}), n("return"), t[Symbol.iterator] = function() {
|
|
1995
|
-
return this;
|
|
1996
|
-
}, t;
|
|
1997
|
-
function n(i, o) {
|
|
1998
|
-
t[i] = e[i] ? function(a) {
|
|
1999
|
-
return (r = !r) ? { value: ot(e[i](a)), done: i === "return" } : o ? o(a) : a;
|
|
2000
|
-
} : o;
|
|
2001
|
-
}
|
|
2002
|
-
}
|
|
2003
|
-
function Sc(e) {
|
|
2004
|
-
if (!Symbol.asyncIterator) throw new TypeError("Symbol.asyncIterator is not defined.");
|
|
2005
|
-
var t = e[Symbol.asyncIterator], r;
|
|
2006
|
-
return t ? t.call(e) : (e = typeof dr == "function" ? dr(e) : e[Symbol.iterator](), r = {}, n("next"), n("throw"), n("return"), r[Symbol.asyncIterator] = function() {
|
|
2007
|
-
return this;
|
|
2008
|
-
}, r);
|
|
2009
|
-
function n(o) {
|
|
2010
|
-
r[o] = e[o] && function(a) {
|
|
2011
|
-
return new Promise(function(l, u) {
|
|
2012
|
-
a = e[o](a), i(l, u, a.done, a.value);
|
|
2013
|
-
});
|
|
2014
|
-
};
|
|
2015
|
-
}
|
|
2016
|
-
function i(o, a, l, u) {
|
|
2017
|
-
Promise.resolve(u).then(function(h) {
|
|
2018
|
-
o({ value: h, done: l });
|
|
2019
|
-
}, a);
|
|
2020
|
-
}
|
|
2021
|
-
}
|
|
2022
|
-
function Oc(e, t) {
|
|
2023
|
-
return Object.defineProperty ? Object.defineProperty(e, "raw", { value: t }) : e.raw = t, e;
|
|
2024
|
-
}
|
|
2025
|
-
function Tc(e) {
|
|
2026
|
-
if (e && e.__esModule) return e;
|
|
2027
|
-
var t = {};
|
|
2028
|
-
if (e != null) for (var r in e) Object.hasOwnProperty.call(e, r) && (t[r] = e[r]);
|
|
2029
|
-
return t.default = e, t;
|
|
2030
|
-
}
|
|
2031
|
-
function Cc(e) {
|
|
2032
|
-
return e && e.__esModule ? e : { default: e };
|
|
2033
|
-
}
|
|
2034
|
-
function Ic(e, t) {
|
|
2035
|
-
if (!t.has(e))
|
|
2036
|
-
throw new TypeError("attempted to get private field on non-instance");
|
|
2037
|
-
return t.get(e);
|
|
2038
|
-
}
|
|
2039
|
-
function Rc(e, t, r) {
|
|
2040
|
-
if (!t.has(e))
|
|
2041
|
-
throw new TypeError("attempted to set private field on non-instance");
|
|
2042
|
-
return t.set(e, r), r;
|
|
2043
|
-
}
|
|
2044
|
-
const Lc = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
|
|
2045
|
-
__proto__: null,
|
|
2046
|
-
get __assign() {
|
|
2047
|
-
return hr;
|
|
2048
|
-
},
|
|
2049
|
-
__asyncDelegator: Bc,
|
|
2050
|
-
__asyncGenerator: Ac,
|
|
2051
|
-
__asyncValues: Sc,
|
|
2052
|
-
__await: ot,
|
|
2053
|
-
__awaiter: mc,
|
|
2054
|
-
__classPrivateFieldGet: Ic,
|
|
2055
|
-
__classPrivateFieldSet: Rc,
|
|
2056
|
-
__createBinding: _c,
|
|
2057
|
-
__decorate: gc,
|
|
2058
|
-
__exportStar: xc,
|
|
2059
|
-
__extends: bc,
|
|
2060
|
-
__generator: vc,
|
|
2061
|
-
__importDefault: Cc,
|
|
2062
|
-
__importStar: Tc,
|
|
2063
|
-
__makeTemplateObject: Oc,
|
|
2064
|
-
__metadata: yc,
|
|
2065
|
-
__param: wc,
|
|
2066
|
-
__read: ri,
|
|
2067
|
-
__rest: pc,
|
|
2068
|
-
__spread: Ec,
|
|
2069
|
-
__spreadArrays: Fc,
|
|
2070
|
-
__values: dr
|
|
2071
|
-
}, Symbol.toStringTag, { value: "Module" })), Pc = /* @__PURE__ */ go(Lc);
|
|
2072
|
-
var xe = {}, gn;
|
|
2073
|
-
function Nc() {
|
|
2074
|
-
if (gn) return xe;
|
|
2075
|
-
gn = 1, Object.defineProperty(xe, "__esModule", { value: !0 }), xe.isBrowserCryptoAvailable = xe.getSubtleCrypto = xe.getBrowerCrypto = void 0;
|
|
2076
|
-
function e() {
|
|
2077
|
-
return (ge === null || ge === void 0 ? void 0 : ge.crypto) || (ge === null || ge === void 0 ? void 0 : ge.msCrypto) || {};
|
|
2078
|
-
}
|
|
2079
|
-
xe.getBrowerCrypto = e;
|
|
2080
|
-
function t() {
|
|
2081
|
-
const n = e();
|
|
2082
|
-
return n.subtle || n.webkitSubtle;
|
|
2083
|
-
}
|
|
2084
|
-
xe.getSubtleCrypto = t;
|
|
2085
|
-
function r() {
|
|
2086
|
-
return !!e() && !!t();
|
|
2087
|
-
}
|
|
2088
|
-
return xe.isBrowserCryptoAvailable = r, xe;
|
|
2089
|
-
}
|
|
2090
|
-
var Ee = {}, wn;
|
|
2091
|
-
function Uc() {
|
|
2092
|
-
if (wn) return Ee;
|
|
2093
|
-
wn = 1, Object.defineProperty(Ee, "__esModule", { value: !0 }), Ee.isBrowser = Ee.isNode = Ee.isReactNative = void 0;
|
|
2094
|
-
function e() {
|
|
2095
|
-
return typeof document > "u" && typeof navigator < "u" && navigator.product === "ReactNative";
|
|
2096
|
-
}
|
|
2097
|
-
Ee.isReactNative = e;
|
|
2098
|
-
function t() {
|
|
2099
|
-
return typeof je.process < "u" && typeof je.process.versions < "u" && typeof je.process.versions.node < "u";
|
|
2100
|
-
}
|
|
2101
|
-
Ee.isNode = t;
|
|
2102
|
-
function r() {
|
|
2103
|
-
return !e() && !t();
|
|
2104
|
-
}
|
|
2105
|
-
return Ee.isBrowser = r, Ee;
|
|
2106
|
-
}
|
|
2107
|
-
(function(e) {
|
|
2108
|
-
Object.defineProperty(e, "__esModule", { value: !0 });
|
|
2109
|
-
const t = Pc;
|
|
2110
|
-
t.__exportStar(Nc(), e), t.__exportStar(Uc(), e);
|
|
2111
|
-
})(dc);
|
|
2112
|
-
function ni(e = 3) {
|
|
2113
|
-
const t = Date.now() * Math.pow(10, e), r = Math.floor(Math.random() * Math.pow(10, e));
|
|
2114
|
-
return t + r;
|
|
2115
|
-
}
|
|
2116
|
-
function bf(e = 6) {
|
|
2117
|
-
return BigInt(ni(e));
|
|
2118
|
-
}
|
|
2119
|
-
function pf(e, t, r) {
|
|
2120
|
-
return {
|
|
2121
|
-
id: r || ni(),
|
|
2122
|
-
jsonrpc: "2.0",
|
|
2123
|
-
method: e,
|
|
2124
|
-
params: t
|
|
2125
|
-
};
|
|
2126
|
-
}
|
|
2127
|
-
function gf(e, t) {
|
|
2128
|
-
return {
|
|
2129
|
-
id: e,
|
|
2130
|
-
jsonrpc: "2.0",
|
|
2131
|
-
result: t
|
|
2132
|
-
};
|
|
2133
|
-
}
|
|
2134
|
-
function wf(e, t, r) {
|
|
2135
|
-
return {
|
|
2136
|
-
id: e,
|
|
2137
|
-
jsonrpc: "2.0",
|
|
2138
|
-
error: jc(t)
|
|
2139
|
-
};
|
|
2140
|
-
}
|
|
2141
|
-
function jc(e, t) {
|
|
2142
|
-
return typeof e > "u" ? pn(ei) : (typeof e == "string" && (e = Object.assign(Object.assign({}, pn(xr)), { message: e })), lc(e.code) && (e = hc(e.code)), e);
|
|
2143
|
-
}
|
|
2144
|
-
class zc {
|
|
2145
|
-
}
|
|
2146
|
-
class Dc extends zc {
|
|
2147
|
-
constructor() {
|
|
2148
|
-
super();
|
|
2149
|
-
}
|
|
2150
|
-
}
|
|
2151
|
-
class yf extends Dc {
|
|
2152
|
-
constructor(t) {
|
|
2153
|
-
super();
|
|
2154
|
-
}
|
|
2155
|
-
}
|
|
2156
|
-
const Mc = "^https?:", Hc = "^wss?:";
|
|
2157
|
-
function $c(e) {
|
|
2158
|
-
const t = e.match(new RegExp(/^\w+:/, "gi"));
|
|
2159
|
-
if (!(!t || !t.length))
|
|
2160
|
-
return t[0];
|
|
2161
|
-
}
|
|
2162
|
-
function ii(e, t) {
|
|
2163
|
-
const r = $c(e);
|
|
2164
|
-
return typeof r > "u" ? !1 : new RegExp(t).test(r);
|
|
2165
|
-
}
|
|
2166
|
-
function mf(e) {
|
|
2167
|
-
return ii(e, Mc);
|
|
2168
|
-
}
|
|
2169
|
-
function vf(e) {
|
|
2170
|
-
return ii(e, Hc);
|
|
2171
|
-
}
|
|
2172
|
-
function _f(e) {
|
|
2173
|
-
return new RegExp("wss?://localhost(:d{2,5})?").test(e);
|
|
2174
|
-
}
|
|
2175
|
-
function oi(e) {
|
|
2176
|
-
return typeof e == "object" && "id" in e && "jsonrpc" in e && e.jsonrpc === "2.0";
|
|
2177
|
-
}
|
|
2178
|
-
function xf(e) {
|
|
2179
|
-
return oi(e) && "method" in e;
|
|
2180
|
-
}
|
|
2181
|
-
function Ef(e) {
|
|
2182
|
-
return oi(e) && (kc(e) || Gc(e));
|
|
2183
|
-
}
|
|
2184
|
-
function kc(e) {
|
|
2185
|
-
return "result" in e;
|
|
2186
|
-
}
|
|
2187
|
-
function Gc(e) {
|
|
2188
|
-
return "error" in e;
|
|
2189
|
-
}
|
|
2190
|
-
var Lt = { exports: {} };
|
|
2191
|
-
Lt.exports;
|
|
2192
|
-
(function(e, t) {
|
|
2193
|
-
var r = 200, n = "__lodash_hash_undefined__", i = 1, o = 2, a = 9007199254740991, l = "[object Arguments]", u = "[object Array]", h = "[object AsyncFunction]", f = "[object Boolean]", b = "[object Date]", y = "[object Error]", g = "[object Function]", p = "[object GeneratorFunction]", _ = "[object Map]", R = "[object Number]", P = "[object Null]", I = "[object Object]", m = "[object Promise]", O = "[object Proxy]", j = "[object RegExp]", $ = "[object Set]", G = "[object String]", z = "[object Symbol]", V = "[object Undefined]", he = "[object WeakMap]", de = "[object ArrayBuffer]", ae = "[object DataView]", Ce = "[object Float32Array]", We = "[object Float64Array]", E = "[object Int8Array]", w = "[object Int16Array]", x = "[object Int32Array]", F = "[object Uint8Array]", T = "[object Uint8ClampedArray]", C = "[object Uint16Array]", L = "[object Uint32Array]", D = /[\\^$.*+?()[\]{}|]/g, N = /^\[object .+?Constructor\]$/, M = /^(?:0|[1-9]\d*)$/, A = {};
|
|
2194
|
-
A[Ce] = A[We] = A[E] = A[w] = A[x] = A[F] = A[T] = A[C] = A[L] = !0, A[l] = A[u] = A[de] = A[f] = A[ae] = A[b] = A[y] = A[g] = A[_] = A[R] = A[I] = A[j] = A[$] = A[G] = A[he] = !1;
|
|
2195
|
-
var Y = typeof ge == "object" && ge && ge.Object === Object && ge, ue = typeof self == "object" && self && self.Object === Object && self, q = Y || ue || Function("return this")(), te = t && !t.nodeType && t, ce = te && !0 && e && !e.nodeType && e, be = ce && ce.exports === te, Fe = be && Y.process, qe = function() {
|
|
2196
|
-
try {
|
|
2197
|
-
return Fe && Fe.binding && Fe.binding("util");
|
|
2198
|
-
} catch {
|
|
2199
|
-
}
|
|
2200
|
-
}(), Ke = qe && qe.isTypedArray;
|
|
2201
|
-
function zt(s, c) {
|
|
2202
|
-
for (var d = -1, v = s == null ? 0 : s.length, U = 0, B = []; ++d < v; ) {
|
|
2203
|
-
var k = s[d];
|
|
2204
|
-
c(k, d, s) && (B[U++] = k);
|
|
2205
|
-
}
|
|
2206
|
-
return B;
|
|
2207
|
-
}
|
|
2208
|
-
function Dt(s, c) {
|
|
2209
|
-
for (var d = -1, v = c.length, U = s.length; ++d < v; )
|
|
2210
|
-
s[U + d] = c[d];
|
|
2211
|
-
return s;
|
|
2212
|
-
}
|
|
2213
|
-
function Mt(s, c) {
|
|
2214
|
-
for (var d = -1, v = s == null ? 0 : s.length; ++d < v; )
|
|
2215
|
-
if (c(s[d], d, s))
|
|
2216
|
-
return !0;
|
|
2217
|
-
return !1;
|
|
2218
|
-
}
|
|
2219
|
-
function Ht(s, c) {
|
|
2220
|
-
for (var d = -1, v = Array(s); ++d < s; )
|
|
2221
|
-
v[d] = c(d);
|
|
2222
|
-
return v;
|
|
2223
|
-
}
|
|
2224
|
-
function ct(s) {
|
|
2225
|
-
return function(c) {
|
|
2226
|
-
return s(c);
|
|
2227
|
-
};
|
|
2228
|
-
}
|
|
2229
|
-
function ft(s, c) {
|
|
2230
|
-
return s.has(c);
|
|
2231
|
-
}
|
|
2232
|
-
function Je(s, c) {
|
|
2233
|
-
return s == null ? void 0 : s[c];
|
|
2234
|
-
}
|
|
2235
|
-
function lt(s) {
|
|
2236
|
-
var c = -1, d = Array(s.size);
|
|
2237
|
-
return s.forEach(function(v, U) {
|
|
2238
|
-
d[++c] = [U, v];
|
|
2239
|
-
}), d;
|
|
2240
|
-
}
|
|
2241
|
-
function ht(s, c) {
|
|
2242
|
-
return function(d) {
|
|
2243
|
-
return s(c(d));
|
|
2244
|
-
};
|
|
2245
|
-
}
|
|
2246
|
-
function dt(s) {
|
|
2247
|
-
var c = -1, d = Array(s.size);
|
|
2248
|
-
return s.forEach(function(v) {
|
|
2249
|
-
d[++c] = v;
|
|
2250
|
-
}), d;
|
|
2251
|
-
}
|
|
2252
|
-
var bt = Array.prototype, pt = Function.prototype, De = Object.prototype, Ze = q["__core-js_shared__"], gt = pt.toString, ie = De.hasOwnProperty, Er = function() {
|
|
2253
|
-
var s = /[^.]+$/.exec(Ze && Ze.keys && Ze.keys.IE_PROTO || "");
|
|
2254
|
-
return s ? "Symbol(src)_1." + s : "";
|
|
2255
|
-
}(), Fr = De.toString, si = RegExp(
|
|
2256
|
-
"^" + gt.call(ie).replace(D, "\\$&").replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g, "$1.*?") + "$"
|
|
2257
|
-
), Ar = be ? q.Buffer : void 0, wt = q.Symbol, Br = q.Uint8Array, Sr = De.propertyIsEnumerable, ai = bt.splice, Ie = wt ? wt.toStringTag : void 0, Or = Object.getOwnPropertySymbols, ui = Ar ? Ar.isBuffer : void 0, ci = ht(Object.keys, Object), $t = Me(q, "DataView"), Ye = Me(q, "Map"), kt = Me(q, "Promise"), Gt = Me(q, "Set"), Vt = Me(q, "WeakMap"), Xe = Me(Object, "create"), fi = Pe($t), li = Pe(Ye), hi = Pe(kt), di = Pe(Gt), bi = Pe(Vt), Tr = wt ? wt.prototype : void 0, Wt = Tr ? Tr.valueOf : void 0;
|
|
2258
|
-
function Re(s) {
|
|
2259
|
-
var c = -1, d = s == null ? 0 : s.length;
|
|
2260
|
-
for (this.clear(); ++c < d; ) {
|
|
2261
|
-
var v = s[c];
|
|
2262
|
-
this.set(v[0], v[1]);
|
|
2263
|
-
}
|
|
2264
|
-
}
|
|
2265
|
-
function pi() {
|
|
2266
|
-
this.__data__ = Xe ? Xe(null) : {}, this.size = 0;
|
|
2267
|
-
}
|
|
2268
|
-
function gi(s) {
|
|
2269
|
-
var c = this.has(s) && delete this.__data__[s];
|
|
2270
|
-
return this.size -= c ? 1 : 0, c;
|
|
2271
|
-
}
|
|
2272
|
-
function wi(s) {
|
|
2273
|
-
var c = this.__data__;
|
|
2274
|
-
if (Xe) {
|
|
2275
|
-
var d = c[s];
|
|
2276
|
-
return d === n ? void 0 : d;
|
|
2277
|
-
}
|
|
2278
|
-
return ie.call(c, s) ? c[s] : void 0;
|
|
2279
|
-
}
|
|
2280
|
-
function yi(s) {
|
|
2281
|
-
var c = this.__data__;
|
|
2282
|
-
return Xe ? c[s] !== void 0 : ie.call(c, s);
|
|
2283
|
-
}
|
|
2284
|
-
function mi(s, c) {
|
|
2285
|
-
var d = this.__data__;
|
|
2286
|
-
return this.size += this.has(s) ? 0 : 1, d[s] = Xe && c === void 0 ? n : c, this;
|
|
2287
|
-
}
|
|
2288
|
-
Re.prototype.clear = pi, Re.prototype.delete = gi, Re.prototype.get = wi, Re.prototype.has = yi, Re.prototype.set = mi;
|
|
2289
|
-
function ye(s) {
|
|
2290
|
-
var c = -1, d = s == null ? 0 : s.length;
|
|
2291
|
-
for (this.clear(); ++c < d; ) {
|
|
2292
|
-
var v = s[c];
|
|
2293
|
-
this.set(v[0], v[1]);
|
|
2294
|
-
}
|
|
2295
|
-
}
|
|
2296
|
-
function vi() {
|
|
2297
|
-
this.__data__ = [], this.size = 0;
|
|
2298
|
-
}
|
|
2299
|
-
function _i(s) {
|
|
2300
|
-
var c = this.__data__, d = mt(c, s);
|
|
2301
|
-
if (d < 0)
|
|
2302
|
-
return !1;
|
|
2303
|
-
var v = c.length - 1;
|
|
2304
|
-
return d == v ? c.pop() : ai.call(c, d, 1), --this.size, !0;
|
|
2305
|
-
}
|
|
2306
|
-
function xi(s) {
|
|
2307
|
-
var c = this.__data__, d = mt(c, s);
|
|
2308
|
-
return d < 0 ? void 0 : c[d][1];
|
|
2309
|
-
}
|
|
2310
|
-
function Ei(s) {
|
|
2311
|
-
return mt(this.__data__, s) > -1;
|
|
2312
|
-
}
|
|
2313
|
-
function Fi(s, c) {
|
|
2314
|
-
var d = this.__data__, v = mt(d, s);
|
|
2315
|
-
return v < 0 ? (++this.size, d.push([s, c])) : d[v][1] = c, this;
|
|
2316
|
-
}
|
|
2317
|
-
ye.prototype.clear = vi, ye.prototype.delete = _i, ye.prototype.get = xi, ye.prototype.has = Ei, ye.prototype.set = Fi;
|
|
2318
|
-
function Le(s) {
|
|
2319
|
-
var c = -1, d = s == null ? 0 : s.length;
|
|
2320
|
-
for (this.clear(); ++c < d; ) {
|
|
2321
|
-
var v = s[c];
|
|
2322
|
-
this.set(v[0], v[1]);
|
|
2323
|
-
}
|
|
2324
|
-
}
|
|
2325
|
-
function Ai() {
|
|
2326
|
-
this.size = 0, this.__data__ = {
|
|
2327
|
-
hash: new Re(),
|
|
2328
|
-
map: new (Ye || ye)(),
|
|
2329
|
-
string: new Re()
|
|
2330
|
-
};
|
|
2331
|
-
}
|
|
2332
|
-
function Bi(s) {
|
|
2333
|
-
var c = vt(this, s).delete(s);
|
|
2334
|
-
return this.size -= c ? 1 : 0, c;
|
|
2335
|
-
}
|
|
2336
|
-
function Si(s) {
|
|
2337
|
-
return vt(this, s).get(s);
|
|
2338
|
-
}
|
|
2339
|
-
function Oi(s) {
|
|
2340
|
-
return vt(this, s).has(s);
|
|
2341
|
-
}
|
|
2342
|
-
function Ti(s, c) {
|
|
2343
|
-
var d = vt(this, s), v = d.size;
|
|
2344
|
-
return d.set(s, c), this.size += d.size == v ? 0 : 1, this;
|
|
2345
|
-
}
|
|
2346
|
-
Le.prototype.clear = Ai, Le.prototype.delete = Bi, Le.prototype.get = Si, Le.prototype.has = Oi, Le.prototype.set = Ti;
|
|
2347
|
-
function yt(s) {
|
|
2348
|
-
var c = -1, d = s == null ? 0 : s.length;
|
|
2349
|
-
for (this.__data__ = new Le(); ++c < d; )
|
|
2350
|
-
this.add(s[c]);
|
|
2351
|
-
}
|
|
2352
|
-
function Ci(s) {
|
|
2353
|
-
return this.__data__.set(s, n), this;
|
|
2354
|
-
}
|
|
2355
|
-
function Ii(s) {
|
|
2356
|
-
return this.__data__.has(s);
|
|
2357
|
-
}
|
|
2358
|
-
yt.prototype.add = yt.prototype.push = Ci, yt.prototype.has = Ii;
|
|
2359
|
-
function Ae(s) {
|
|
2360
|
-
var c = this.__data__ = new ye(s);
|
|
2361
|
-
this.size = c.size;
|
|
2362
|
-
}
|
|
2363
|
-
function Ri() {
|
|
2364
|
-
this.__data__ = new ye(), this.size = 0;
|
|
2365
|
-
}
|
|
2366
|
-
function Li(s) {
|
|
2367
|
-
var c = this.__data__, d = c.delete(s);
|
|
2368
|
-
return this.size = c.size, d;
|
|
2369
|
-
}
|
|
2370
|
-
function Pi(s) {
|
|
2371
|
-
return this.__data__.get(s);
|
|
2372
|
-
}
|
|
2373
|
-
function Ni(s) {
|
|
2374
|
-
return this.__data__.has(s);
|
|
2375
|
-
}
|
|
2376
|
-
function Ui(s, c) {
|
|
2377
|
-
var d = this.__data__;
|
|
2378
|
-
if (d instanceof ye) {
|
|
2379
|
-
var v = d.__data__;
|
|
2380
|
-
if (!Ye || v.length < r - 1)
|
|
2381
|
-
return v.push([s, c]), this.size = ++d.size, this;
|
|
2382
|
-
d = this.__data__ = new Le(v);
|
|
2383
|
-
}
|
|
2384
|
-
return d.set(s, c), this.size = d.size, this;
|
|
2385
|
-
}
|
|
2386
|
-
Ae.prototype.clear = Ri, Ae.prototype.delete = Li, Ae.prototype.get = Pi, Ae.prototype.has = Ni, Ae.prototype.set = Ui;
|
|
2387
|
-
function ji(s, c) {
|
|
2388
|
-
var d = _t(s), v = !d && Xi(s), U = !d && !v && qt(s), B = !d && !v && !U && zr(s), k = d || v || U || B, J = k ? Ht(s.length, String) : [], X = J.length;
|
|
2389
|
-
for (var H in s)
|
|
2390
|
-
ie.call(s, H) && !(k && // Safari 9 has enumerable `arguments.length` in strict mode.
|
|
2391
|
-
(H == "length" || // Node.js 0.10 has enumerable non-index properties on buffers.
|
|
2392
|
-
U && (H == "offset" || H == "parent") || // PhantomJS 2 has enumerable non-index properties on typed arrays.
|
|
2393
|
-
B && (H == "buffer" || H == "byteLength" || H == "byteOffset") || // Skip index properties.
|
|
2394
|
-
qi(H, X))) && J.push(H);
|
|
2395
|
-
return J;
|
|
2396
|
-
}
|
|
2397
|
-
function mt(s, c) {
|
|
2398
|
-
for (var d = s.length; d--; )
|
|
2399
|
-
if (Pr(s[d][0], c))
|
|
2400
|
-
return d;
|
|
2401
|
-
return -1;
|
|
2402
|
-
}
|
|
2403
|
-
function zi(s, c, d) {
|
|
2404
|
-
var v = c(s);
|
|
2405
|
-
return _t(s) ? v : Dt(v, d(s));
|
|
2406
|
-
}
|
|
2407
|
-
function Qe(s) {
|
|
2408
|
-
return s == null ? s === void 0 ? V : P : Ie && Ie in Object(s) ? Vi(s) : Yi(s);
|
|
2409
|
-
}
|
|
2410
|
-
function Cr(s) {
|
|
2411
|
-
return et(s) && Qe(s) == l;
|
|
2412
|
-
}
|
|
2413
|
-
function Ir(s, c, d, v, U) {
|
|
2414
|
-
return s === c ? !0 : s == null || c == null || !et(s) && !et(c) ? s !== s && c !== c : Di(s, c, d, v, Ir, U);
|
|
2415
|
-
}
|
|
2416
|
-
function Di(s, c, d, v, U, B) {
|
|
2417
|
-
var k = _t(s), J = _t(c), X = k ? u : Be(s), H = J ? u : Be(c);
|
|
2418
|
-
X = X == l ? I : X, H = H == l ? I : H;
|
|
2419
|
-
var ne = X == I, fe = H == I, ee = X == H;
|
|
2420
|
-
if (ee && qt(s)) {
|
|
2421
|
-
if (!qt(c))
|
|
2422
|
-
return !1;
|
|
2423
|
-
k = !0, ne = !1;
|
|
2424
|
-
}
|
|
2425
|
-
if (ee && !ne)
|
|
2426
|
-
return B || (B = new Ae()), k || zr(s) ? Rr(s, c, d, v, U, B) : ki(s, c, X, d, v, U, B);
|
|
2427
|
-
if (!(d & i)) {
|
|
2428
|
-
var oe = ne && ie.call(s, "__wrapped__"), se = fe && ie.call(c, "__wrapped__");
|
|
2429
|
-
if (oe || se) {
|
|
2430
|
-
var Se = oe ? s.value() : s, me = se ? c.value() : c;
|
|
2431
|
-
return B || (B = new Ae()), U(Se, me, d, v, B);
|
|
2432
|
-
}
|
|
2433
|
-
}
|
|
2434
|
-
return ee ? (B || (B = new Ae()), Gi(s, c, d, v, U, B)) : !1;
|
|
2435
|
-
}
|
|
2436
|
-
function Mi(s) {
|
|
2437
|
-
if (!jr(s) || Ji(s))
|
|
2438
|
-
return !1;
|
|
2439
|
-
var c = Nr(s) ? si : N;
|
|
2440
|
-
return c.test(Pe(s));
|
|
2441
|
-
}
|
|
2442
|
-
function Hi(s) {
|
|
2443
|
-
return et(s) && Ur(s.length) && !!A[Qe(s)];
|
|
2444
|
-
}
|
|
2445
|
-
function $i(s) {
|
|
2446
|
-
if (!Zi(s))
|
|
2447
|
-
return ci(s);
|
|
2448
|
-
var c = [];
|
|
2449
|
-
for (var d in Object(s))
|
|
2450
|
-
ie.call(s, d) && d != "constructor" && c.push(d);
|
|
2451
|
-
return c;
|
|
2452
|
-
}
|
|
2453
|
-
function Rr(s, c, d, v, U, B) {
|
|
2454
|
-
var k = d & i, J = s.length, X = c.length;
|
|
2455
|
-
if (J != X && !(k && X > J))
|
|
2456
|
-
return !1;
|
|
2457
|
-
var H = B.get(s);
|
|
2458
|
-
if (H && B.get(c))
|
|
2459
|
-
return H == c;
|
|
2460
|
-
var ne = -1, fe = !0, ee = d & o ? new yt() : void 0;
|
|
2461
|
-
for (B.set(s, c), B.set(c, s); ++ne < J; ) {
|
|
2462
|
-
var oe = s[ne], se = c[ne];
|
|
2463
|
-
if (v)
|
|
2464
|
-
var Se = k ? v(se, oe, ne, c, s, B) : v(oe, se, ne, s, c, B);
|
|
2465
|
-
if (Se !== void 0) {
|
|
2466
|
-
if (Se)
|
|
2467
|
-
continue;
|
|
2468
|
-
fe = !1;
|
|
2469
|
-
break;
|
|
2470
|
-
}
|
|
2471
|
-
if (ee) {
|
|
2472
|
-
if (!Mt(c, function(me, Ne) {
|
|
2473
|
-
if (!ft(ee, Ne) && (oe === me || U(oe, me, d, v, B)))
|
|
2474
|
-
return ee.push(Ne);
|
|
2475
|
-
})) {
|
|
2476
|
-
fe = !1;
|
|
2477
|
-
break;
|
|
2478
|
-
}
|
|
2479
|
-
} else if (!(oe === se || U(oe, se, d, v, B))) {
|
|
2480
|
-
fe = !1;
|
|
2481
|
-
break;
|
|
2482
|
-
}
|
|
2483
|
-
}
|
|
2484
|
-
return B.delete(s), B.delete(c), fe;
|
|
2485
|
-
}
|
|
2486
|
-
function ki(s, c, d, v, U, B, k) {
|
|
2487
|
-
switch (d) {
|
|
2488
|
-
case ae:
|
|
2489
|
-
if (s.byteLength != c.byteLength || s.byteOffset != c.byteOffset)
|
|
2490
|
-
return !1;
|
|
2491
|
-
s = s.buffer, c = c.buffer;
|
|
2492
|
-
case de:
|
|
2493
|
-
return !(s.byteLength != c.byteLength || !B(new Br(s), new Br(c)));
|
|
2494
|
-
case f:
|
|
2495
|
-
case b:
|
|
2496
|
-
case R:
|
|
2497
|
-
return Pr(+s, +c);
|
|
2498
|
-
case y:
|
|
2499
|
-
return s.name == c.name && s.message == c.message;
|
|
2500
|
-
case j:
|
|
2501
|
-
case G:
|
|
2502
|
-
return s == c + "";
|
|
2503
|
-
case _:
|
|
2504
|
-
var J = lt;
|
|
2505
|
-
case $:
|
|
2506
|
-
var X = v & i;
|
|
2507
|
-
if (J || (J = dt), s.size != c.size && !X)
|
|
2508
|
-
return !1;
|
|
2509
|
-
var H = k.get(s);
|
|
2510
|
-
if (H)
|
|
2511
|
-
return H == c;
|
|
2512
|
-
v |= o, k.set(s, c);
|
|
2513
|
-
var ne = Rr(J(s), J(c), v, U, B, k);
|
|
2514
|
-
return k.delete(s), ne;
|
|
2515
|
-
case z:
|
|
2516
|
-
if (Wt)
|
|
2517
|
-
return Wt.call(s) == Wt.call(c);
|
|
2518
|
-
}
|
|
2519
|
-
return !1;
|
|
2520
|
-
}
|
|
2521
|
-
function Gi(s, c, d, v, U, B) {
|
|
2522
|
-
var k = d & i, J = Lr(s), X = J.length, H = Lr(c), ne = H.length;
|
|
2523
|
-
if (X != ne && !k)
|
|
2524
|
-
return !1;
|
|
2525
|
-
for (var fe = X; fe--; ) {
|
|
2526
|
-
var ee = J[fe];
|
|
2527
|
-
if (!(k ? ee in c : ie.call(c, ee)))
|
|
2528
|
-
return !1;
|
|
2529
|
-
}
|
|
2530
|
-
var oe = B.get(s);
|
|
2531
|
-
if (oe && B.get(c))
|
|
2532
|
-
return oe == c;
|
|
2533
|
-
var se = !0;
|
|
2534
|
-
B.set(s, c), B.set(c, s);
|
|
2535
|
-
for (var Se = k; ++fe < X; ) {
|
|
2536
|
-
ee = J[fe];
|
|
2537
|
-
var me = s[ee], Ne = c[ee];
|
|
2538
|
-
if (v)
|
|
2539
|
-
var Dr = k ? v(Ne, me, ee, c, s, B) : v(me, Ne, ee, s, c, B);
|
|
2540
|
-
if (!(Dr === void 0 ? me === Ne || U(me, Ne, d, v, B) : Dr)) {
|
|
2541
|
-
se = !1;
|
|
2542
|
-
break;
|
|
2543
|
-
}
|
|
2544
|
-
Se || (Se = ee == "constructor");
|
|
2545
|
-
}
|
|
2546
|
-
if (se && !Se) {
|
|
2547
|
-
var xt = s.constructor, Et = c.constructor;
|
|
2548
|
-
xt != Et && "constructor" in s && "constructor" in c && !(typeof xt == "function" && xt instanceof xt && typeof Et == "function" && Et instanceof Et) && (se = !1);
|
|
2549
|
-
}
|
|
2550
|
-
return B.delete(s), B.delete(c), se;
|
|
2551
|
-
}
|
|
2552
|
-
function Lr(s) {
|
|
2553
|
-
return zi(s, to, Wi);
|
|
2554
|
-
}
|
|
2555
|
-
function vt(s, c) {
|
|
2556
|
-
var d = s.__data__;
|
|
2557
|
-
return Ki(c) ? d[typeof c == "string" ? "string" : "hash"] : d.map;
|
|
2558
|
-
}
|
|
2559
|
-
function Me(s, c) {
|
|
2560
|
-
var d = Je(s, c);
|
|
2561
|
-
return Mi(d) ? d : void 0;
|
|
2562
|
-
}
|
|
2563
|
-
function Vi(s) {
|
|
2564
|
-
var c = ie.call(s, Ie), d = s[Ie];
|
|
2565
|
-
try {
|
|
2566
|
-
s[Ie] = void 0;
|
|
2567
|
-
var v = !0;
|
|
2568
|
-
} catch {
|
|
2569
|
-
}
|
|
2570
|
-
var U = Fr.call(s);
|
|
2571
|
-
return v && (c ? s[Ie] = d : delete s[Ie]), U;
|
|
2572
|
-
}
|
|
2573
|
-
var Wi = Or ? function(s) {
|
|
2574
|
-
return s == null ? [] : (s = Object(s), zt(Or(s), function(c) {
|
|
2575
|
-
return Sr.call(s, c);
|
|
2576
|
-
}));
|
|
2577
|
-
} : ro, Be = Qe;
|
|
2578
|
-
($t && Be(new $t(new ArrayBuffer(1))) != ae || Ye && Be(new Ye()) != _ || kt && Be(kt.resolve()) != m || Gt && Be(new Gt()) != $ || Vt && Be(new Vt()) != he) && (Be = function(s) {
|
|
2579
|
-
var c = Qe(s), d = c == I ? s.constructor : void 0, v = d ? Pe(d) : "";
|
|
2580
|
-
if (v)
|
|
2581
|
-
switch (v) {
|
|
2582
|
-
case fi:
|
|
2583
|
-
return ae;
|
|
2584
|
-
case li:
|
|
2585
|
-
return _;
|
|
2586
|
-
case hi:
|
|
2587
|
-
return m;
|
|
2588
|
-
case di:
|
|
2589
|
-
return $;
|
|
2590
|
-
case bi:
|
|
2591
|
-
return he;
|
|
2592
|
-
}
|
|
2593
|
-
return c;
|
|
2594
|
-
});
|
|
2595
|
-
function qi(s, c) {
|
|
2596
|
-
return c = c ?? a, !!c && (typeof s == "number" || M.test(s)) && s > -1 && s % 1 == 0 && s < c;
|
|
2597
|
-
}
|
|
2598
|
-
function Ki(s) {
|
|
2599
|
-
var c = typeof s;
|
|
2600
|
-
return c == "string" || c == "number" || c == "symbol" || c == "boolean" ? s !== "__proto__" : s === null;
|
|
2601
|
-
}
|
|
2602
|
-
function Ji(s) {
|
|
2603
|
-
return !!Er && Er in s;
|
|
2604
|
-
}
|
|
2605
|
-
function Zi(s) {
|
|
2606
|
-
var c = s && s.constructor, d = typeof c == "function" && c.prototype || De;
|
|
2607
|
-
return s === d;
|
|
2608
|
-
}
|
|
2609
|
-
function Yi(s) {
|
|
2610
|
-
return Fr.call(s);
|
|
2611
|
-
}
|
|
2612
|
-
function Pe(s) {
|
|
2613
|
-
if (s != null) {
|
|
2614
|
-
try {
|
|
2615
|
-
return gt.call(s);
|
|
2616
|
-
} catch {
|
|
2617
|
-
}
|
|
2618
|
-
try {
|
|
2619
|
-
return s + "";
|
|
2620
|
-
} catch {
|
|
2621
|
-
}
|
|
2622
|
-
}
|
|
2623
|
-
return "";
|
|
2624
|
-
}
|
|
2625
|
-
function Pr(s, c) {
|
|
2626
|
-
return s === c || s !== s && c !== c;
|
|
2627
|
-
}
|
|
2628
|
-
var Xi = Cr(/* @__PURE__ */ function() {
|
|
2629
|
-
return arguments;
|
|
2630
|
-
}()) ? Cr : function(s) {
|
|
2631
|
-
return et(s) && ie.call(s, "callee") && !Sr.call(s, "callee");
|
|
2632
|
-
}, _t = Array.isArray;
|
|
2633
|
-
function Qi(s) {
|
|
2634
|
-
return s != null && Ur(s.length) && !Nr(s);
|
|
2635
|
-
}
|
|
2636
|
-
var qt = ui || no;
|
|
2637
|
-
function eo(s, c) {
|
|
2638
|
-
return Ir(s, c);
|
|
2639
|
-
}
|
|
2640
|
-
function Nr(s) {
|
|
2641
|
-
if (!jr(s))
|
|
2642
|
-
return !1;
|
|
2643
|
-
var c = Qe(s);
|
|
2644
|
-
return c == g || c == p || c == h || c == O;
|
|
2645
|
-
}
|
|
2646
|
-
function Ur(s) {
|
|
2647
|
-
return typeof s == "number" && s > -1 && s % 1 == 0 && s <= a;
|
|
2648
|
-
}
|
|
2649
|
-
function jr(s) {
|
|
2650
|
-
var c = typeof s;
|
|
2651
|
-
return s != null && (c == "object" || c == "function");
|
|
2652
|
-
}
|
|
2653
|
-
function et(s) {
|
|
2654
|
-
return s != null && typeof s == "object";
|
|
2655
|
-
}
|
|
2656
|
-
var zr = Ke ? ct(Ke) : Hi;
|
|
2657
|
-
function to(s) {
|
|
2658
|
-
return Qi(s) ? ji(s) : $i(s);
|
|
2659
|
-
}
|
|
2660
|
-
function ro() {
|
|
2661
|
-
return [];
|
|
2662
|
-
}
|
|
2663
|
-
function no() {
|
|
2664
|
-
return !1;
|
|
2665
|
-
}
|
|
2666
|
-
e.exports = eo;
|
|
2667
|
-
})(Lt, Lt.exports);
|
|
2668
|
-
var Vc = Lt.exports;
|
|
2669
|
-
const Ff = /* @__PURE__ */ yn(Vc);
|
|
2670
|
-
export {
|
|
2671
|
-
kc as A,
|
|
2672
|
-
ni as B,
|
|
2673
|
-
Xc as C,
|
|
2674
|
-
mf as D,
|
|
2675
|
-
uf as E,
|
|
2676
|
-
ff as F,
|
|
2677
|
-
cf as G,
|
|
2678
|
-
sf as I,
|
|
2679
|
-
lf as P,
|
|
2680
|
-
tc as Q,
|
|
2681
|
-
Fn as T,
|
|
2682
|
-
Ff as _,
|
|
2683
|
-
nf as a,
|
|
2684
|
-
rf as b,
|
|
2685
|
-
No as c,
|
|
2686
|
-
Qc as d,
|
|
2687
|
-
Kc as e,
|
|
2688
|
-
Jc as f,
|
|
2689
|
-
ef as g,
|
|
2690
|
-
Yc as h,
|
|
2691
|
-
pf as i,
|
|
2692
|
-
bf as j,
|
|
2693
|
-
of as k,
|
|
2694
|
-
Gc as l,
|
|
2695
|
-
Ef as m,
|
|
2696
|
-
vf as n,
|
|
2697
|
-
dc as o,
|
|
2698
|
-
_f as p,
|
|
2699
|
-
wf as q,
|
|
2700
|
-
yf as r,
|
|
2701
|
-
tf as s,
|
|
2702
|
-
Zc as t,
|
|
2703
|
-
df as u,
|
|
2704
|
-
af as v,
|
|
2705
|
-
hf as w,
|
|
2706
|
-
xf as x,
|
|
2707
|
-
us as y,
|
|
2708
|
-
gf as z
|
|
2709
|
-
};
|