@ecency/wallets 1.4.0 → 1.4.1
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/ecency-sdk.es.js +791 -781
- package/package.json +1 -1
package/dist/ecency-sdk.es.js
CHANGED
|
@@ -1,4 +1,4 @@
|
|
|
1
|
-
import { CONFIG as Ie, getAccountFullQueryOptions as yt, getQueryClient as
|
|
1
|
+
import { CONFIG as Ie, getAccountFullQueryOptions as yt, getQueryClient as Ne, getDynamicPropsQueryOptions as hr, Keychain as kt, useBroadcastMutation as x0, EcencyAnalytics as xc, getAccessToken as E0, useAccountUpdate as A0 } from "@ecency/sdk";
|
|
2
2
|
import { useQuery as br, queryOptions as Ke, infiniteQueryOptions as Ur, useQueryClient as yn, useMutation as Jt } from "@tanstack/react-query";
|
|
3
3
|
import S0, { mnemonicToSeedSync as Ec } from "bip39";
|
|
4
4
|
import { LRUCache as I0 } from "lru-cache";
|
|
@@ -8,13 +8,13 @@ import { TrxWallet as M0 } from "@okxweb3/coin-tron";
|
|
|
8
8
|
import { TonWallet as P0 } from "@okxweb3/coin-ton";
|
|
9
9
|
import { SolWallet as F0 } from "@okxweb3/coin-solana";
|
|
10
10
|
import { AptosWallet as O0 } from "@okxweb3/coin-aptos";
|
|
11
|
-
import { bip32 as
|
|
11
|
+
import { bip32 as q0 } from "@okxweb3/crypto-lib";
|
|
12
12
|
import { PrivateKey as Vt, utils as Gt } from "@hiveio/dhive";
|
|
13
13
|
import Ac from "crypto";
|
|
14
|
-
import
|
|
14
|
+
import Dr from "dayjs";
|
|
15
15
|
import pt from "hivesigner";
|
|
16
16
|
import * as Wt from "remeda";
|
|
17
|
-
import { useCallback as
|
|
17
|
+
import { useCallback as D0 } from "react";
|
|
18
18
|
const Ct = globalThis;
|
|
19
19
|
if (typeof Ct._scrypt_bsv < "u") {
|
|
20
20
|
typeof Ct._scrypt_bsv == "string" && (Ct.__scryptBsvPreviousVersion = Ct._scrypt_bsv);
|
|
@@ -27,15 +27,15 @@ if (typeof Ct._scrypt_bsv < "u") {
|
|
|
27
27
|
function N0() {
|
|
28
28
|
typeof Ct._scrypt_bsv == "string" && (Ct.__scryptBsvPreviousVersion = Ct._scrypt_bsv);
|
|
29
29
|
}
|
|
30
|
-
var
|
|
30
|
+
var qe = /* @__PURE__ */ ((n) => (n.BTC = "BTC", n.ETH = "ETH", n.BNB = "BNB", n.APT = "APT", n.TON = "TON", n.TRON = "TRX", n.SOL = "SOL", n))(qe || {}), ut = /* @__PURE__ */ ((n) => (n.Points = "POINTS", n.HivePower = "HP", n.Hive = "HIVE", n.HiveDollar = "HBD", n.Spk = "SPK", n))(ut || {});
|
|
31
31
|
const C0 = {
|
|
32
|
-
[
|
|
33
|
-
[
|
|
34
|
-
[
|
|
35
|
-
[
|
|
36
|
-
[
|
|
37
|
-
[
|
|
38
|
-
[
|
|
32
|
+
[qe.BTC]: "btc",
|
|
33
|
+
[qe.ETH]: "eth",
|
|
34
|
+
[qe.BNB]: "bnb",
|
|
35
|
+
[qe.SOL]: "sol",
|
|
36
|
+
[qe.TRON]: "tron",
|
|
37
|
+
[qe.TON]: "ton",
|
|
38
|
+
[qe.APT]: "apt"
|
|
39
39
|
};
|
|
40
40
|
function L0(n) {
|
|
41
41
|
if (typeof n == "number") {
|
|
@@ -153,28 +153,28 @@ function gt(n) {
|
|
|
153
153
|
queryFn: async () => {
|
|
154
154
|
let u = n;
|
|
155
155
|
switch (n) {
|
|
156
|
-
case
|
|
156
|
+
case qe.BTC:
|
|
157
157
|
u = "binance-wrapped-btc";
|
|
158
158
|
break;
|
|
159
|
-
case
|
|
159
|
+
case qe.ETH:
|
|
160
160
|
u = "ethereum";
|
|
161
161
|
break;
|
|
162
|
-
case
|
|
162
|
+
case qe.SOL:
|
|
163
163
|
u = "solana";
|
|
164
164
|
break;
|
|
165
|
-
case
|
|
165
|
+
case qe.TON:
|
|
166
166
|
u = "ton";
|
|
167
167
|
break;
|
|
168
|
-
case
|
|
168
|
+
case qe.TRON:
|
|
169
169
|
u = "tron";
|
|
170
170
|
break;
|
|
171
|
-
case
|
|
171
|
+
case qe.APT:
|
|
172
172
|
u = "aptos";
|
|
173
173
|
break;
|
|
174
|
-
case
|
|
174
|
+
case qe.BNB:
|
|
175
175
|
u = "binancecoin";
|
|
176
176
|
break;
|
|
177
|
-
case
|
|
177
|
+
case qe.TON:
|
|
178
178
|
u = "the-open-network";
|
|
179
179
|
break;
|
|
180
180
|
default:
|
|
@@ -202,18 +202,18 @@ function Bc(n) {
|
|
|
202
202
|
}
|
|
203
203
|
function xo(n) {
|
|
204
204
|
switch (n) {
|
|
205
|
-
case
|
|
205
|
+
case qe.BTC:
|
|
206
206
|
return new B0();
|
|
207
|
-
case
|
|
208
|
-
case
|
|
207
|
+
case qe.ETH:
|
|
208
|
+
case qe.BNB:
|
|
209
209
|
return new R0();
|
|
210
|
-
case
|
|
210
|
+
case qe.TRON:
|
|
211
211
|
return new M0();
|
|
212
|
-
case
|
|
212
|
+
case qe.TON:
|
|
213
213
|
return new P0();
|
|
214
|
-
case
|
|
214
|
+
case qe.SOL:
|
|
215
215
|
return new F0();
|
|
216
|
-
case
|
|
216
|
+
case qe.APT:
|
|
217
217
|
return new O0();
|
|
218
218
|
default:
|
|
219
219
|
return;
|
|
@@ -229,7 +229,7 @@ const H0 = {
|
|
|
229
229
|
memo: 3
|
|
230
230
|
};
|
|
231
231
|
function Gr(n, u, p = 0) {
|
|
232
|
-
const y = Ec(n), s =
|
|
232
|
+
const y = Ec(n), s = q0.fromSeed(y), a = `m/44'/3054'/${p}'/0'/${H0[u]}'`, b = s.derivePath(a);
|
|
233
233
|
if (!b.privateKey)
|
|
234
234
|
throw new Error("[Ecency][Wallets] - hive key derivation failed");
|
|
235
235
|
const f = Vt.from(b.privateKey);
|
|
@@ -472,7 +472,7 @@ Eo.write = function(n, u, p, y, s, a) {
|
|
|
472
472
|
function d(C, A) {
|
|
473
473
|
if ((typeof A != "string" || A === "") && (A = "utf8"), !r.isEncoding(A))
|
|
474
474
|
throw new TypeError("Unknown encoding: " + A);
|
|
475
|
-
const T =
|
|
475
|
+
const T = q(C, A) | 0;
|
|
476
476
|
let Z = i(T);
|
|
477
477
|
const ie = Z.write(C, A);
|
|
478
478
|
return ie !== T && (Z = Z.slice(0, ie)), Z;
|
|
@@ -575,7 +575,7 @@ Eo.write = function(n, u, p, y, s, a) {
|
|
|
575
575
|
}
|
|
576
576
|
return ie;
|
|
577
577
|
};
|
|
578
|
-
function
|
|
578
|
+
function q(C, A) {
|
|
579
579
|
if (r.isBuffer(C))
|
|
580
580
|
return C.length;
|
|
581
581
|
if (b.isView(C) || se(C, b))
|
|
@@ -611,7 +611,7 @@ Eo.write = function(n, u, p, y, s, a) {
|
|
|
611
611
|
A = ("" + A).toLowerCase(), ie = !0;
|
|
612
612
|
}
|
|
613
613
|
}
|
|
614
|
-
r.byteLength =
|
|
614
|
+
r.byteLength = q;
|
|
615
615
|
function L(C, A, T) {
|
|
616
616
|
let Z = !1;
|
|
617
617
|
if ((A === void 0 || A < 0) && (A = 0), A > this.length || ((T === void 0 || T > this.length) && (T = this.length), T <= 0) || (T >>>= 0, A >>>= 0, T <= A))
|
|
@@ -622,7 +622,7 @@ Eo.write = function(n, u, p, y, s, a) {
|
|
|
622
622
|
return G(this, A, T);
|
|
623
623
|
case "utf8":
|
|
624
624
|
case "utf-8":
|
|
625
|
-
return
|
|
625
|
+
return D(this, A, T);
|
|
626
626
|
case "ascii":
|
|
627
627
|
return v(this, A, T);
|
|
628
628
|
case "latin1":
|
|
@@ -668,7 +668,7 @@ Eo.write = function(n, u, p, y, s, a) {
|
|
|
668
668
|
return this;
|
|
669
669
|
}, r.prototype.toString = function() {
|
|
670
670
|
const A = this.length;
|
|
671
|
-
return A === 0 ? "" : arguments.length === 0 ?
|
|
671
|
+
return A === 0 ? "" : arguments.length === 0 ? D(this, 0, A) : L.apply(this, arguments);
|
|
672
672
|
}, r.prototype.toLocaleString = r.prototype.toString, r.prototype.equals = function(A) {
|
|
673
673
|
if (!r.isBuffer(A)) throw new TypeError("Argument must be a Buffer");
|
|
674
674
|
return this === A ? !0 : r.compare(this, A) === 0;
|
|
@@ -823,7 +823,7 @@ Eo.write = function(n, u, p, y, s, a) {
|
|
|
823
823
|
function M(C, A, T) {
|
|
824
824
|
return A === 0 && T === C.length ? u.fromByteArray(C) : u.fromByteArray(C.slice(A, T));
|
|
825
825
|
}
|
|
826
|
-
function
|
|
826
|
+
function D(C, A, T) {
|
|
827
827
|
T = Math.min(C.length, T);
|
|
828
828
|
const Z = [];
|
|
829
829
|
let ie = A;
|
|
@@ -1390,12 +1390,12 @@ st.nextTick = function(n) {
|
|
|
1390
1390
|
if (arguments.length > 1)
|
|
1391
1391
|
for (var p = 1; p < arguments.length; p++)
|
|
1392
1392
|
u[p - 1] = arguments[p];
|
|
1393
|
-
Lt.push(new
|
|
1393
|
+
Lt.push(new qc(n, u)), Lt.length === 1 && !lr && Fc(Oc);
|
|
1394
1394
|
};
|
|
1395
|
-
function
|
|
1395
|
+
function qc(n, u) {
|
|
1396
1396
|
this.fun = n, this.array = u;
|
|
1397
1397
|
}
|
|
1398
|
-
|
|
1398
|
+
qc.prototype.run = function() {
|
|
1399
1399
|
this.fun.apply(null, this.array);
|
|
1400
1400
|
};
|
|
1401
1401
|
st.title = "browser";
|
|
@@ -1462,18 +1462,18 @@ function Ao() {
|
|
|
1462
1462
|
return !0;
|
|
1463
1463
|
}), On;
|
|
1464
1464
|
}
|
|
1465
|
-
var
|
|
1465
|
+
var qn, Vo;
|
|
1466
1466
|
function vn() {
|
|
1467
|
-
if (Vo) return
|
|
1467
|
+
if (Vo) return qn;
|
|
1468
1468
|
Vo = 1;
|
|
1469
1469
|
var n = Ao();
|
|
1470
|
-
return
|
|
1470
|
+
return qn = function() {
|
|
1471
1471
|
return n() && !!Symbol.toStringTag;
|
|
1472
|
-
},
|
|
1472
|
+
}, qn;
|
|
1473
1473
|
}
|
|
1474
|
-
var
|
|
1474
|
+
var Dn, $o;
|
|
1475
1475
|
function So() {
|
|
1476
|
-
return $o || ($o = 1,
|
|
1476
|
+
return $o || ($o = 1, Dn = Object), Dn;
|
|
1477
1477
|
}
|
|
1478
1478
|
var Nn, Ko;
|
|
1479
1479
|
function il() {
|
|
@@ -1492,7 +1492,7 @@ function fl() {
|
|
|
1492
1492
|
return Yo || (Yo = 1, kn = ReferenceError), kn;
|
|
1493
1493
|
}
|
|
1494
1494
|
var Un, Qo;
|
|
1495
|
-
function
|
|
1495
|
+
function Dc() {
|
|
1496
1496
|
return Qo || (Qo = 1, Un = SyntaxError), Un;
|
|
1497
1497
|
}
|
|
1498
1498
|
var jn, Jo;
|
|
@@ -1724,7 +1724,7 @@ var di, Af;
|
|
|
1724
1724
|
function Mo() {
|
|
1725
1725
|
if (Af) return di;
|
|
1726
1726
|
Af = 1;
|
|
1727
|
-
var n, u = /* @__PURE__ */ So(), p = /* @__PURE__ */ il(), y = /* @__PURE__ */ al(), s = /* @__PURE__ */ ol(), a = /* @__PURE__ */ fl(), b = /* @__PURE__ */
|
|
1727
|
+
var n, u = /* @__PURE__ */ So(), p = /* @__PURE__ */ il(), y = /* @__PURE__ */ al(), s = /* @__PURE__ */ ol(), a = /* @__PURE__ */ fl(), b = /* @__PURE__ */ Dc(), f = /* @__PURE__ */ jr(), h = /* @__PURE__ */ sl(), i = /* @__PURE__ */ ul(), r = /* @__PURE__ */ cl(), e = /* @__PURE__ */ ll(), t = /* @__PURE__ */ hl(), o = /* @__PURE__ */ dl(), c = /* @__PURE__ */ pl(), d = /* @__PURE__ */ yl(), m = Function, g = function(oe) {
|
|
1728
1728
|
try {
|
|
1729
1729
|
return m('"use strict"; return (' + oe + ").constructor;")();
|
|
1730
1730
|
} catch {
|
|
@@ -1741,12 +1741,12 @@ function Mo() {
|
|
|
1741
1741
|
return I;
|
|
1742
1742
|
}
|
|
1743
1743
|
}
|
|
1744
|
-
}() : I,
|
|
1744
|
+
}() : I, q = vl()(), L = Ro(), $ = Cc(), U = Nc(), J = Bo(), R = Io(), l = {}, x = typeof Uint8Array > "u" || !L ? n : L(Uint8Array), S = {
|
|
1745
1745
|
__proto__: null,
|
|
1746
1746
|
"%AggregateError%": typeof AggregateError > "u" ? n : AggregateError,
|
|
1747
1747
|
"%Array%": Array,
|
|
1748
1748
|
"%ArrayBuffer%": typeof ArrayBuffer > "u" ? n : ArrayBuffer,
|
|
1749
|
-
"%ArrayIteratorPrototype%":
|
|
1749
|
+
"%ArrayIteratorPrototype%": q && L ? L([][Symbol.iterator]()) : n,
|
|
1750
1750
|
"%AsyncFromSyncIteratorPrototype%": n,
|
|
1751
1751
|
"%AsyncFunction%": l,
|
|
1752
1752
|
"%AsyncGenerator%": l,
|
|
@@ -1778,10 +1778,10 @@ function Mo() {
|
|
|
1778
1778
|
"%Int32Array%": typeof Int32Array > "u" ? n : Int32Array,
|
|
1779
1779
|
"%isFinite%": isFinite,
|
|
1780
1780
|
"%isNaN%": isNaN,
|
|
1781
|
-
"%IteratorPrototype%":
|
|
1781
|
+
"%IteratorPrototype%": q && L ? L(L([][Symbol.iterator]())) : n,
|
|
1782
1782
|
"%JSON%": typeof JSON == "object" ? JSON : n,
|
|
1783
1783
|
"%Map%": typeof Map > "u" ? n : Map,
|
|
1784
|
-
"%MapIteratorPrototype%": typeof Map > "u" || !
|
|
1784
|
+
"%MapIteratorPrototype%": typeof Map > "u" || !q || !L ? n : L((/* @__PURE__ */ new Map())[Symbol.iterator]()),
|
|
1785
1785
|
"%Math%": Math,
|
|
1786
1786
|
"%Number%": Number,
|
|
1787
1787
|
"%Object%": u,
|
|
@@ -1795,11 +1795,11 @@ function Mo() {
|
|
|
1795
1795
|
"%Reflect%": typeof Reflect > "u" ? n : Reflect,
|
|
1796
1796
|
"%RegExp%": RegExp,
|
|
1797
1797
|
"%Set%": typeof Set > "u" ? n : Set,
|
|
1798
|
-
"%SetIteratorPrototype%": typeof Set > "u" || !
|
|
1798
|
+
"%SetIteratorPrototype%": typeof Set > "u" || !q || !L ? n : L((/* @__PURE__ */ new Set())[Symbol.iterator]()),
|
|
1799
1799
|
"%SharedArrayBuffer%": typeof SharedArrayBuffer > "u" ? n : SharedArrayBuffer,
|
|
1800
1800
|
"%String%": String,
|
|
1801
|
-
"%StringIteratorPrototype%":
|
|
1802
|
-
"%Symbol%":
|
|
1801
|
+
"%StringIteratorPrototype%": q && L ? L(""[Symbol.iterator]()) : n,
|
|
1802
|
+
"%Symbol%": q ? Symbol : n,
|
|
1803
1803
|
"%SyntaxError%": b,
|
|
1804
1804
|
"%ThrowTypeError%": P,
|
|
1805
1805
|
"%TypedArray%": x,
|
|
@@ -1848,7 +1848,7 @@ function Mo() {
|
|
|
1848
1848
|
le && L && (Y = L(le.prototype));
|
|
1849
1849
|
}
|
|
1850
1850
|
return S[ue] = Y, Y;
|
|
1851
|
-
},
|
|
1851
|
+
}, D = {
|
|
1852
1852
|
__proto__: null,
|
|
1853
1853
|
"%ArrayBufferPrototype%": ["ArrayBuffer", "prototype"],
|
|
1854
1854
|
"%ArrayPrototype%": ["Array", "prototype"],
|
|
@@ -1913,7 +1913,7 @@ function Mo() {
|
|
|
1913
1913
|
}), le;
|
|
1914
1914
|
}, ne = function(ue, Y) {
|
|
1915
1915
|
var W = ue, le;
|
|
1916
|
-
if (O(
|
|
1916
|
+
if (O(D, W) && (le = D[W], W = "%" + le[0] + "%"), O(S, W)) {
|
|
1917
1917
|
var ve = S[W];
|
|
1918
1918
|
if (ve === l && (ve = M(W)), typeof ve > "u" && !Y)
|
|
1919
1919
|
throw new f("intrinsic " + ue + " exists, but is not available. Please file an issue!");
|
|
@@ -2200,11 +2200,11 @@ function Rl() {
|
|
|
2200
2200
|
return y;
|
|
2201
2201
|
}, xi;
|
|
2202
2202
|
}
|
|
2203
|
-
var Ei = { exports: {} }, Ai,
|
|
2203
|
+
var Ei = { exports: {} }, Ai, qf;
|
|
2204
2204
|
function Uc() {
|
|
2205
|
-
if (
|
|
2206
|
-
|
|
2207
|
-
var n = /* @__PURE__ */ mn(), u = /* @__PURE__ */
|
|
2205
|
+
if (qf) return Ai;
|
|
2206
|
+
qf = 1;
|
|
2207
|
+
var n = /* @__PURE__ */ mn(), u = /* @__PURE__ */ Dc(), p = /* @__PURE__ */ jr(), y = /* @__PURE__ */ yr();
|
|
2208
2208
|
return Ai = function(a, b, f) {
|
|
2209
2209
|
if (!a || typeof a != "object" && typeof a != "function")
|
|
2210
2210
|
throw new p("`obj` must be an object or a function`");
|
|
@@ -2232,10 +2232,10 @@ function Uc() {
|
|
|
2232
2232
|
throw new u("This environment does not support defining a property as non-configurable, non-writable, or non-enumerable.");
|
|
2233
2233
|
}, Ai;
|
|
2234
2234
|
}
|
|
2235
|
-
var Si,
|
|
2235
|
+
var Si, Df;
|
|
2236
2236
|
function jc() {
|
|
2237
|
-
if (
|
|
2238
|
-
|
|
2237
|
+
if (Df) return Si;
|
|
2238
|
+
Df = 1;
|
|
2239
2239
|
var n = /* @__PURE__ */ mn(), u = function() {
|
|
2240
2240
|
return !!n;
|
|
2241
2241
|
};
|
|
@@ -2431,10 +2431,10 @@ function Ol() {
|
|
|
2431
2431
|
return y(pe) === "Int8Array";
|
|
2432
2432
|
}
|
|
2433
2433
|
n.isInt8Array = P;
|
|
2434
|
-
function
|
|
2434
|
+
function q(pe) {
|
|
2435
2435
|
return y(pe) === "Int16Array";
|
|
2436
2436
|
}
|
|
2437
|
-
n.isInt16Array =
|
|
2437
|
+
n.isInt16Array = q;
|
|
2438
2438
|
function L(pe) {
|
|
2439
2439
|
return y(pe) === "Int32Array";
|
|
2440
2440
|
}
|
|
@@ -2475,10 +2475,10 @@ function Ol() {
|
|
|
2475
2475
|
return h(pe) === "[object WeakMap]";
|
|
2476
2476
|
}
|
|
2477
2477
|
M.working = typeof WeakMap < "u" && M(/* @__PURE__ */ new WeakMap());
|
|
2478
|
-
function
|
|
2478
|
+
function D(pe) {
|
|
2479
2479
|
return typeof WeakMap > "u" ? !1 : M.working ? M(pe) : pe instanceof WeakMap;
|
|
2480
2480
|
}
|
|
2481
|
-
n.isWeakMap =
|
|
2481
|
+
n.isWeakMap = D;
|
|
2482
2482
|
function K(pe) {
|
|
2483
2483
|
return h(pe) === "[object WeakSet]";
|
|
2484
2484
|
}
|
|
@@ -2569,7 +2569,7 @@ function Ol() {
|
|
|
2569
2569
|
}(Fn)), Fn;
|
|
2570
2570
|
}
|
|
2571
2571
|
var Mi, zf;
|
|
2572
|
-
function
|
|
2572
|
+
function ql() {
|
|
2573
2573
|
return zf || (zf = 1, Mi = function(u) {
|
|
2574
2574
|
return u && typeof u == "object" && typeof u.copy == "function" && typeof u.fill == "function" && typeof u.readUInt8 == "function";
|
|
2575
2575
|
}), Mi;
|
|
@@ -2595,7 +2595,7 @@ function at() {
|
|
|
2595
2595
|
}), Yr.exports;
|
|
2596
2596
|
}
|
|
2597
2597
|
var Vf;
|
|
2598
|
-
function
|
|
2598
|
+
function qt() {
|
|
2599
2599
|
return Vf || (Vf = 1, function(n) {
|
|
2600
2600
|
var u = Object.getOwnPropertyDescriptors || function(te) {
|
|
2601
2601
|
for (var V = Object.keys(te), re = {}, H = 0; H < V.length; H++)
|
|
@@ -2840,10 +2840,10 @@ function Dt() {
|
|
|
2840
2840
|
return typeof G == "string";
|
|
2841
2841
|
}
|
|
2842
2842
|
n.isString = P;
|
|
2843
|
-
function
|
|
2843
|
+
function q(G) {
|
|
2844
2844
|
return typeof G == "symbol";
|
|
2845
2845
|
}
|
|
2846
|
-
n.isSymbol =
|
|
2846
|
+
n.isSymbol = q;
|
|
2847
2847
|
function L(G) {
|
|
2848
2848
|
return G === void 0;
|
|
2849
2849
|
}
|
|
@@ -2872,7 +2872,7 @@ function Dt() {
|
|
|
2872
2872
|
return G === null || typeof G == "boolean" || typeof G == "number" || typeof G == "string" || typeof G == "symbol" || // ES6 symbol
|
|
2873
2873
|
typeof G > "u";
|
|
2874
2874
|
}
|
|
2875
|
-
n.isPrimitive = x, n.isBuffer =
|
|
2875
|
+
n.isPrimitive = x, n.isBuffer = ql();
|
|
2876
2876
|
function S(G) {
|
|
2877
2877
|
return Object.prototype.toString.call(G);
|
|
2878
2878
|
}
|
|
@@ -2893,7 +2893,7 @@ function Dt() {
|
|
|
2893
2893
|
"Nov",
|
|
2894
2894
|
"Dec"
|
|
2895
2895
|
];
|
|
2896
|
-
function
|
|
2896
|
+
function D() {
|
|
2897
2897
|
var G = /* @__PURE__ */ new Date(), te = [
|
|
2898
2898
|
w(G.getHours()),
|
|
2899
2899
|
w(G.getMinutes()),
|
|
@@ -2902,7 +2902,7 @@ function Dt() {
|
|
|
2902
2902
|
return [G.getDate(), M[G.getMonth()], te].join(" ");
|
|
2903
2903
|
}
|
|
2904
2904
|
n.log = function() {
|
|
2905
|
-
console.log("%s - %s",
|
|
2905
|
+
console.log("%s - %s", D(), n.format.apply(n, arguments));
|
|
2906
2906
|
}, n.inherits = at(), n._extend = function(G, te) {
|
|
2907
2907
|
if (!te || !U(te)) return G;
|
|
2908
2908
|
for (var V = Object.keys(te), re = V.length; re--; )
|
|
@@ -3013,20 +3013,20 @@ function Hc() {
|
|
|
3013
3013
|
_.prototype = Object.create(E && E.prototype, { constructor: { value: _, writable: !0, configurable: !0 } }), Object.defineProperty(_, "prototype", { writable: !1 }), E && s(_, E);
|
|
3014
3014
|
}
|
|
3015
3015
|
function s(_, E) {
|
|
3016
|
-
return s = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function(P,
|
|
3017
|
-
return P.__proto__ =
|
|
3016
|
+
return s = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function(P, q) {
|
|
3017
|
+
return P.__proto__ = q, P;
|
|
3018
3018
|
}, s(_, E);
|
|
3019
3019
|
}
|
|
3020
3020
|
function a(_) {
|
|
3021
3021
|
var E = h();
|
|
3022
3022
|
return function() {
|
|
3023
|
-
var P = i(_),
|
|
3023
|
+
var P = i(_), q;
|
|
3024
3024
|
if (E) {
|
|
3025
3025
|
var L = i(this).constructor;
|
|
3026
|
-
|
|
3026
|
+
q = Reflect.construct(P, arguments, L);
|
|
3027
3027
|
} else
|
|
3028
|
-
|
|
3029
|
-
return b(this,
|
|
3028
|
+
q = P.apply(this, arguments);
|
|
3029
|
+
return b(this, q);
|
|
3030
3030
|
};
|
|
3031
3031
|
}
|
|
3032
3032
|
function b(_, E) {
|
|
@@ -3062,7 +3062,7 @@ function Hc() {
|
|
|
3062
3062
|
function P(L, $, U) {
|
|
3063
3063
|
return typeof E == "string" ? E : E(L, $, U);
|
|
3064
3064
|
}
|
|
3065
|
-
var
|
|
3065
|
+
var q = /* @__PURE__ */ function(L) {
|
|
3066
3066
|
y(U, L);
|
|
3067
3067
|
var $ = a(U);
|
|
3068
3068
|
function U(J, R, l) {
|
|
@@ -3071,7 +3071,7 @@ function Hc() {
|
|
|
3071
3071
|
}
|
|
3072
3072
|
return u(U);
|
|
3073
3073
|
}(I);
|
|
3074
|
-
r[_] =
|
|
3074
|
+
r[_] = q;
|
|
3075
3075
|
}
|
|
3076
3076
|
function c(_, E) {
|
|
3077
3077
|
if (Array.isArray(_)) {
|
|
@@ -3095,17 +3095,17 @@ function Hc() {
|
|
|
3095
3095
|
e === void 0 && (e = Et()), e(typeof _ == "string", "'name' must be a string");
|
|
3096
3096
|
var P;
|
|
3097
3097
|
typeof E == "string" && d(E, "not ") ? (P = "must not be", E = E.replace(/^not /, "")) : P = "must be";
|
|
3098
|
-
var
|
|
3098
|
+
var q;
|
|
3099
3099
|
if (m(_, " argument"))
|
|
3100
|
-
|
|
3100
|
+
q = "The ".concat(_, " ").concat(P, " ").concat(c(E, "type"));
|
|
3101
3101
|
else {
|
|
3102
3102
|
var L = g(_, ".") ? "property" : "argument";
|
|
3103
|
-
|
|
3103
|
+
q = 'The "'.concat(_, '" ').concat(L, " ").concat(P, " ").concat(c(E, "type"));
|
|
3104
3104
|
}
|
|
3105
|
-
return
|
|
3105
|
+
return q += ". Received type ".concat(n(I)), q;
|
|
3106
3106
|
}, TypeError), o("ERR_INVALID_ARG_VALUE", function(_, E) {
|
|
3107
3107
|
var I = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : "is invalid";
|
|
3108
|
-
t === void 0 && (t =
|
|
3108
|
+
t === void 0 && (t = qt());
|
|
3109
3109
|
var P = t.inspect(E);
|
|
3110
3110
|
return P.length > 128 && (P = "".concat(P.slice(0, 128), "...")), "The argument '".concat(_, "' ").concat(I, ". Received ").concat(P);
|
|
3111
3111
|
}, TypeError), o("ERR_INVALID_RETURN_VALUE", function(_, E, I) {
|
|
@@ -3115,10 +3115,10 @@ function Hc() {
|
|
|
3115
3115
|
for (var _ = arguments.length, E = new Array(_), I = 0; I < _; I++)
|
|
3116
3116
|
E[I] = arguments[I];
|
|
3117
3117
|
e === void 0 && (e = Et()), e(E.length > 0, "At least one arg needs to be specified");
|
|
3118
|
-
var P = "The ",
|
|
3118
|
+
var P = "The ", q = E.length;
|
|
3119
3119
|
switch (E = E.map(function(L) {
|
|
3120
3120
|
return '"'.concat(L, '"');
|
|
3121
|
-
}),
|
|
3121
|
+
}), q) {
|
|
3122
3122
|
case 1:
|
|
3123
3123
|
P += "".concat(E[0], " argument");
|
|
3124
3124
|
break;
|
|
@@ -3126,14 +3126,14 @@ function Hc() {
|
|
|
3126
3126
|
P += "".concat(E[0], " and ").concat(E[1], " arguments");
|
|
3127
3127
|
break;
|
|
3128
3128
|
default:
|
|
3129
|
-
P += E.slice(0,
|
|
3129
|
+
P += E.slice(0, q - 1).join(", "), P += ", and ".concat(E[q - 1], " arguments");
|
|
3130
3130
|
break;
|
|
3131
3131
|
}
|
|
3132
3132
|
return "".concat(P, " must be specified");
|
|
3133
3133
|
}, TypeError), Mn.codes = r, Mn;
|
|
3134
3134
|
}
|
|
3135
3135
|
var Pi, Kf;
|
|
3136
|
-
function
|
|
3136
|
+
function Dl() {
|
|
3137
3137
|
if (Kf) return Pi;
|
|
3138
3138
|
Kf = 1;
|
|
3139
3139
|
function n(O, v) {
|
|
@@ -3271,7 +3271,7 @@ function ql() {
|
|
|
3271
3271
|
return v && typeof Symbol == "function" && v.constructor === Symbol && v !== Symbol.prototype ? "symbol" : typeof v;
|
|
3272
3272
|
}, _(O);
|
|
3273
3273
|
}
|
|
3274
|
-
var E =
|
|
3274
|
+
var E = qt(), I = E.inspect, P = Hc(), q = P.codes.ERR_INVALID_ARG_TYPE;
|
|
3275
3275
|
function L(O, v, k) {
|
|
3276
3276
|
return (k === void 0 || k > O.length) && (k = O.length), O.substring(k - v.length, k) === v;
|
|
3277
3277
|
}
|
|
@@ -3324,7 +3324,7 @@ function ql() {
|
|
|
3324
3324
|
getters: !0
|
|
3325
3325
|
});
|
|
3326
3326
|
}
|
|
3327
|
-
function
|
|
3327
|
+
function D(O, v, k) {
|
|
3328
3328
|
var G = "", te = "", V = 0, re = "", H = !1, X = M(O), ne = X.split(`
|
|
3329
3329
|
`), oe = M(v).split(`
|
|
3330
3330
|
`), ue = 0, Y = "";
|
|
@@ -3406,12 +3406,12 @@ function ql() {
|
|
|
3406
3406
|
function G(te) {
|
|
3407
3407
|
var V;
|
|
3408
3408
|
if (y(this, G), _(te) !== "object" || te === null)
|
|
3409
|
-
throw new
|
|
3409
|
+
throw new q("options", "Object", te);
|
|
3410
3410
|
var re = te.message, H = te.operator, X = te.stackStartFn, ne = te.actual, oe = te.expected, ue = Error.stackTraceLimit;
|
|
3411
3411
|
if (Error.stackTraceLimit = 0, re != null)
|
|
3412
3412
|
V = k.call(this, String(re));
|
|
3413
3413
|
else if (ke.stderr && ke.stderr.isTTY && (ke.stderr && ke.stderr.getColorDepth && ke.stderr.getColorDepth() !== 1 ? (U = "\x1B[34m", J = "\x1B[32m", l = "\x1B[39m", R = "\x1B[31m") : (U = "", J = "", l = "", R = "")), _(ne) === "object" && ne !== null && _(oe) === "object" && oe !== null && "stack" in ne && ne instanceof Error && "stack" in oe && oe instanceof Error && (ne = w(ne), oe = w(oe)), H === "deepStrictEqual" || H === "strictEqual")
|
|
3414
|
-
V = k.call(this,
|
|
3414
|
+
V = k.call(this, D(ne, oe, H));
|
|
3415
3415
|
else if (H === "notDeepStrictEqual" || H === "notStrictEqual") {
|
|
3416
3416
|
var Y = x[H], W = M(ne).split(`
|
|
3417
3417
|
`);
|
|
@@ -3547,8 +3547,8 @@ function Nl() {
|
|
|
3547
3547
|
for (var P = 0; P < o.length; ++P)
|
|
3548
3548
|
_.push(String(P));
|
|
3549
3549
|
else
|
|
3550
|
-
for (var
|
|
3551
|
-
!(E &&
|
|
3550
|
+
for (var q in o)
|
|
3551
|
+
!(E && q === "prototype") && u.call(o, q) && _.push(String(q));
|
|
3552
3552
|
if (a)
|
|
3553
3553
|
for (var L = e(o), $ = 0; $ < f.length; ++$)
|
|
3554
3554
|
!(L && f[$] === "constructor") && u.call(o, f[$]) && _.push(f[$]);
|
|
@@ -3557,9 +3557,9 @@ function Nl() {
|
|
|
3557
3557
|
}
|
|
3558
3558
|
return Oi = n, Oi;
|
|
3559
3559
|
}
|
|
3560
|
-
var
|
|
3560
|
+
var qi, Yf;
|
|
3561
3561
|
function $c() {
|
|
3562
|
-
if (Yf) return
|
|
3562
|
+
if (Yf) return qi;
|
|
3563
3563
|
Yf = 1;
|
|
3564
3564
|
var n = Array.prototype.slice, u = Vc(), p = Object.keys, y = p ? function(b) {
|
|
3565
3565
|
return p(b);
|
|
@@ -3576,14 +3576,14 @@ function $c() {
|
|
|
3576
3576
|
} else
|
|
3577
3577
|
Object.keys = y;
|
|
3578
3578
|
return Object.keys || y;
|
|
3579
|
-
},
|
|
3579
|
+
}, qi = y, qi;
|
|
3580
3580
|
}
|
|
3581
|
-
var
|
|
3581
|
+
var Di, Qf;
|
|
3582
3582
|
function Cl() {
|
|
3583
|
-
if (Qf) return
|
|
3583
|
+
if (Qf) return Di;
|
|
3584
3584
|
Qf = 1;
|
|
3585
3585
|
var n = $c(), u = Ao()(), p = /* @__PURE__ */ gr(), y = /* @__PURE__ */ So(), s = p("Array.prototype.push"), a = p("Object.prototype.propertyIsEnumerable"), b = u ? y.getOwnPropertySymbols : null;
|
|
3586
|
-
return
|
|
3586
|
+
return Di = function(h, i) {
|
|
3587
3587
|
if (h == null)
|
|
3588
3588
|
throw new TypeError("target must be an object");
|
|
3589
3589
|
var r = y(h);
|
|
@@ -3605,7 +3605,7 @@ function Cl() {
|
|
|
3605
3605
|
}
|
|
3606
3606
|
}
|
|
3607
3607
|
return r;
|
|
3608
|
-
},
|
|
3608
|
+
}, Di;
|
|
3609
3609
|
}
|
|
3610
3610
|
var Ni, Jf;
|
|
3611
3611
|
function Ll() {
|
|
@@ -3822,8 +3822,8 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
|
|
|
3822
3822
|
function o(ae) {
|
|
3823
3823
|
return ae.call.bind(ae);
|
|
3824
3824
|
}
|
|
3825
|
-
var c = o(Object.prototype.hasOwnProperty), d = o(Object.prototype.propertyIsEnumerable), m = o(Object.prototype.toString), g =
|
|
3826
|
-
function
|
|
3825
|
+
var c = o(Object.prototype.hasOwnProperty), d = o(Object.prototype.propertyIsEnumerable), m = o(Object.prototype.toString), g = qt().types, _ = g.isAnyArrayBuffer, E = g.isArrayBufferView, I = g.isDate, P = g.isMap, q = g.isRegExp, L = g.isSet, $ = g.isNativeError, U = g.isBoxedPrimitive, J = g.isNumberObject, R = g.isStringObject, l = g.isBooleanObject, x = g.isBigIntObject, S = g.isSymbolObject, w = g.isFloat32Array, M = g.isFloat64Array;
|
|
3826
|
+
function D(ae) {
|
|
3827
3827
|
if (ae.length === 0 || ae.length > 10) return !0;
|
|
3828
3828
|
for (var se = 0; se < ae.length; se++) {
|
|
3829
3829
|
var _e = ae.charCodeAt(se);
|
|
@@ -3832,7 +3832,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
|
|
|
3832
3832
|
return ae.length === 10 && ae >= Math.pow(2, 32);
|
|
3833
3833
|
}
|
|
3834
3834
|
function K(ae) {
|
|
3835
|
-
return Object.keys(ae).filter(
|
|
3835
|
+
return Object.keys(ae).filter(D).concat(e(ae).filter(Object.prototype.propertyIsEnumerable.bind(ae)));
|
|
3836
3836
|
}
|
|
3837
3837
|
/*!
|
|
3838
3838
|
* The buffer module from node.js, for the browser.
|
|
@@ -3899,8 +3899,8 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
|
|
|
3899
3899
|
if (I(ae)) {
|
|
3900
3900
|
if (!I(se) || Date.prototype.getTime.call(ae) !== Date.prototype.getTime.call(se))
|
|
3901
3901
|
return !1;
|
|
3902
|
-
} else if (
|
|
3903
|
-
if (!
|
|
3902
|
+
} else if (q(ae)) {
|
|
3903
|
+
if (!q(se) || !H(ae, se))
|
|
3904
3904
|
return !1;
|
|
3905
3905
|
} else if ($(ae) || ae instanceof Error) {
|
|
3906
3906
|
if (ae.message !== se.message || ae.name !== se.name)
|
|
@@ -4138,12 +4138,12 @@ function Et() {
|
|
|
4138
4138
|
if (!(V instanceof re))
|
|
4139
4139
|
throw new TypeError("Cannot call a class as a function");
|
|
4140
4140
|
}
|
|
4141
|
-
var y = Hc(), s = y.codes, a = s.ERR_AMBIGUOUS_ARGUMENT, b = s.ERR_INVALID_ARG_TYPE, f = s.ERR_INVALID_ARG_VALUE, h = s.ERR_INVALID_RETURN_VALUE, i = s.ERR_MISSING_ARGS, r =
|
|
4141
|
+
var y = Hc(), s = y.codes, a = s.ERR_AMBIGUOUS_ARGUMENT, b = s.ERR_INVALID_ARG_TYPE, f = s.ERR_INVALID_ARG_VALUE, h = s.ERR_INVALID_RETURN_VALUE, i = s.ERR_MISSING_ARGS, r = Dl(), e = qt(), t = e.inspect, o = qt().types, c = o.isPromise, d = o.isRegExp, m = Ll()(), g = Po()(), _ = kl()("RegExp.prototype.test"), E, I;
|
|
4142
4142
|
function P() {
|
|
4143
4143
|
var V = Vl();
|
|
4144
4144
|
E = V.isDeepEqual, I = V.isDeepStrictEqual;
|
|
4145
4145
|
}
|
|
4146
|
-
var
|
|
4146
|
+
var q = !1, L = Rn.exports = l, $ = {};
|
|
4147
4147
|
function U(V) {
|
|
4148
4148
|
throw V.message instanceof Error ? V.message : new r(V);
|
|
4149
4149
|
}
|
|
@@ -4154,8 +4154,8 @@ function Et() {
|
|
|
4154
4154
|
else if (oe === 1)
|
|
4155
4155
|
H = V, V = void 0;
|
|
4156
4156
|
else {
|
|
4157
|
-
if (
|
|
4158
|
-
|
|
4157
|
+
if (q === !1) {
|
|
4158
|
+
q = !0;
|
|
4159
4159
|
var Y = ke.emitWarning ? ke.emitWarning : console.warn.bind(console);
|
|
4160
4160
|
Y("assert.fail() with more than one argument is deprecated. Please use assert.strictEqual() instead or only pass a message.", "DeprecationWarning", "DEP0094");
|
|
4161
4161
|
}
|
|
@@ -4330,7 +4330,7 @@ function Et() {
|
|
|
4330
4330
|
}
|
|
4331
4331
|
return re.prototype !== void 0 && V instanceof re ? !0 : Error.isPrototypeOf(re) ? !1 : re.call({}, V) === !0;
|
|
4332
4332
|
}
|
|
4333
|
-
function
|
|
4333
|
+
function D(V) {
|
|
4334
4334
|
if (typeof V != "function")
|
|
4335
4335
|
throw new b("fn", "Function", V);
|
|
4336
4336
|
try {
|
|
@@ -4408,7 +4408,7 @@ function Et() {
|
|
|
4408
4408
|
L.throws = function V(re) {
|
|
4409
4409
|
for (var H = arguments.length, X = new Array(H > 1 ? H - 1 : 0), ne = 1; ne < H; ne++)
|
|
4410
4410
|
X[ne - 1] = arguments[ne];
|
|
4411
|
-
v.apply(void 0, [V,
|
|
4411
|
+
v.apply(void 0, [V, D(re)].concat(X));
|
|
4412
4412
|
}, L.rejects = function V(re) {
|
|
4413
4413
|
for (var H = arguments.length, X = new Array(H > 1 ? H - 1 : 0), ne = 1; ne < H; ne++)
|
|
4414
4414
|
X[ne - 1] = arguments[ne];
|
|
@@ -4418,7 +4418,7 @@ function Et() {
|
|
|
4418
4418
|
}, L.doesNotThrow = function V(re) {
|
|
4419
4419
|
for (var H = arguments.length, X = new Array(H > 1 ? H - 1 : 0), ne = 1; ne < H; ne++)
|
|
4420
4420
|
X[ne - 1] = arguments[ne];
|
|
4421
|
-
k.apply(void 0, [V,
|
|
4421
|
+
k.apply(void 0, [V, D(re)].concat(X));
|
|
4422
4422
|
}, L.doesNotReject = function V(re) {
|
|
4423
4423
|
for (var H = arguments.length, X = new Array(H > 1 ? H - 1 : 0), ne = 1; ne < H; ne++)
|
|
4424
4424
|
X[ne - 1] = arguments[ne];
|
|
@@ -4606,7 +4606,7 @@ function Yc() {
|
|
|
4606
4606
|
var j = 1, Q;
|
|
4607
4607
|
return (Q = N >>> 16) != 0 && (N = Q, j += 16), (Q = N >> 8) != 0 && (N = Q, j += 8), (Q = N >> 4) != 0 && (N = Q, j += 4), (Q = N >> 2) != 0 && (N = Q, j += 2), (Q = N >> 1) != 0 && (N = Q, j += 1), j;
|
|
4608
4608
|
}
|
|
4609
|
-
function
|
|
4609
|
+
function q() {
|
|
4610
4610
|
return this.t <= 0 ? 0 : this.DB * (this.t - 1) + P(this[this.t - 1] ^ this.s & this.DM);
|
|
4611
4611
|
}
|
|
4612
4612
|
function L() {
|
|
@@ -4699,7 +4699,7 @@ function Yc() {
|
|
|
4699
4699
|
var j = new n();
|
|
4700
4700
|
return this.abs().divRemTo(N, null, j), this.s < 0 && j.compareTo(n.ZERO) > 0 && N.subTo(j, j), j;
|
|
4701
4701
|
}
|
|
4702
|
-
function
|
|
4702
|
+
function D(N) {
|
|
4703
4703
|
this.m = N;
|
|
4704
4704
|
}
|
|
4705
4705
|
function K(N) {
|
|
@@ -4717,7 +4717,7 @@ function Yc() {
|
|
|
4717
4717
|
function G(N, j) {
|
|
4718
4718
|
N.squareTo(j), this.reduce(j);
|
|
4719
4719
|
}
|
|
4720
|
-
|
|
4720
|
+
D.prototype.convert = K, D.prototype.revert = O, D.prototype.reduce = v, D.prototype.mulTo = k, D.prototype.sqrTo = G;
|
|
4721
4721
|
function te() {
|
|
4722
4722
|
if (this.t < 1) return 0;
|
|
4723
4723
|
var N = this[0];
|
|
@@ -4769,9 +4769,9 @@ function Yc() {
|
|
|
4769
4769
|
}
|
|
4770
4770
|
function W(N, j) {
|
|
4771
4771
|
var Q;
|
|
4772
|
-
return N < 256 || j.isEven() ? Q = new
|
|
4772
|
+
return N < 256 || j.isEven() ? Q = new D(j) : Q = new V(j), this.exp(N, Q);
|
|
4773
4773
|
}
|
|
4774
|
-
u.copyTo = t, u.fromInt = o, u.fromString = d, u.clamp = m, u.dlShiftTo = $, u.drShiftTo = U, u.lShiftTo = J, u.rShiftTo = R, u.subTo = l, u.multiplyTo = x, u.squareTo = S, u.divRemTo = w, u.invDigit = te, u.isEven = ue, u.exp = Y, u.toString = g, u.negate = _, u.abs = E, u.compareTo = I, u.bitLength =
|
|
4774
|
+
u.copyTo = t, u.fromInt = o, u.fromString = d, u.clamp = m, u.dlShiftTo = $, u.drShiftTo = U, u.lShiftTo = J, u.rShiftTo = R, u.subTo = l, u.multiplyTo = x, u.squareTo = S, u.divRemTo = w, u.invDigit = te, u.isEven = ue, u.exp = Y, u.toString = g, u.negate = _, u.abs = E, u.compareTo = I, u.bitLength = q, u.byteLength = L, u.mod = M, u.modPowInt = W;
|
|
4775
4775
|
function le() {
|
|
4776
4776
|
var N = new n();
|
|
4777
4777
|
return this.copyTo(N), N;
|
|
@@ -5046,7 +5046,7 @@ function Yc() {
|
|
|
5046
5046
|
function Tr(N, j) {
|
|
5047
5047
|
var Q = N.bitLength(), ce, he = c(1), Ee;
|
|
5048
5048
|
if (Q <= 0) return he;
|
|
5049
|
-
Q < 18 ? ce = 1 : Q < 48 ? ce = 3 : Q < 144 ? ce = 4 : Q < 768 ? ce = 5 : ce = 6, Q < 8 ? Ee = new
|
|
5049
|
+
Q < 18 ? ce = 1 : Q < 48 ? ce = 3 : Q < 144 ? ce = 4 : Q < 768 ? ce = 5 : ce = 6, Q < 8 ? Ee = new D(j) : j.isEven() ? Ee = new Tt(j) : Ee = new V(j);
|
|
5050
5050
|
var Se = new Array(), Me = 3, $e = ce - 1, St = (1 << ce) - 1;
|
|
5051
5051
|
if (Se[1] = Ee.convert(this), ce > 1) {
|
|
5052
5052
|
var wt = new n();
|
|
@@ -5290,7 +5290,7 @@ function Yc() {
|
|
|
5290
5290
|
}
|
|
5291
5291
|
return Q.millerRabin(N);
|
|
5292
5292
|
}
|
|
5293
|
-
function
|
|
5293
|
+
function qr(N) {
|
|
5294
5294
|
var j = this.subtract(n.ONE), Q = j.getLowestSetBit();
|
|
5295
5295
|
if (Q <= 0) return !1;
|
|
5296
5296
|
var ce = j.shiftRight(Q);
|
|
@@ -5308,7 +5308,7 @@ function Yc() {
|
|
|
5308
5308
|
}
|
|
5309
5309
|
return !0;
|
|
5310
5310
|
}
|
|
5311
|
-
return u.chunkSize = Pe, u.toRadix = pe, u.fromRadix = Qe, u.fromNumber = Te, u.bitwiseTo = _e, u.changeBit = Ye, u.addTo = tr, u.dMultiply = Fe, u.dAddOffset = nt, u.multiplyLowerTo = _r, u.multiplyUpperTo = xr, u.modInt = Mr, u.millerRabin =
|
|
5311
|
+
return u.chunkSize = Pe, u.toRadix = pe, u.fromRadix = Qe, u.fromNumber = Te, u.bitwiseTo = _e, u.changeBit = Ye, u.addTo = tr, u.dMultiply = Fe, u.dAddOffset = nt, u.multiplyLowerTo = _r, u.multiplyUpperTo = xr, u.modInt = Mr, u.millerRabin = qr, u.clone = le, u.intValue = ve, u.byteValue = Ae, u.shortValue = me, u.signum = Oe, u.toByteArray = Be, u.equals = Ue, u.min = ae, u.max = se, u.and = we, u.or = C, u.xor = T, u.andNot = ie, u.not = de, u.shiftLeft = ye, u.shiftRight = Re, u.getLowestSetBit = De, u.bitCount = We, u.testBit = rt, u.setBit = jt, u.clearBit = it, u.flipBit = Ze, u.add = z, u.subtract = B, u.multiply = F, u.divide = fe, u.remainder = be, u.divideAndRemainder = ge, u.modPow = Tr, u.modInverse = Pr, u.pow = ft, u.gcd = Rr, u.isProbablePrime = Or, u.square = ee, n.ZERO = c(0), n.ONE = c(1), n.valueOf = c, Wi = n, Wi;
|
|
5312
5312
|
}
|
|
5313
5313
|
var ls = {}, hs;
|
|
5314
5314
|
function Gl() {
|
|
@@ -5370,32 +5370,32 @@ function Zt() {
|
|
|
5370
5370
|
return (E + I) * 3 / 4 - I;
|
|
5371
5371
|
}
|
|
5372
5372
|
function t(_) {
|
|
5373
|
-
var E, I = i(_), P = I[0],
|
|
5373
|
+
var E, I = i(_), P = I[0], q = I[1], L = new a(e(_, P, q)), $ = 0, U = q > 0 ? P - 4 : P, J;
|
|
5374
5374
|
for (J = 0; J < U; J += 4)
|
|
5375
5375
|
E = s[_.charCodeAt(J)] << 18 | s[_.charCodeAt(J + 1)] << 12 | s[_.charCodeAt(J + 2)] << 6 | s[_.charCodeAt(J + 3)], L[$++] = E >> 16 & 255, L[$++] = E >> 8 & 255, L[$++] = E & 255;
|
|
5376
|
-
return
|
|
5376
|
+
return q === 2 && (E = s[_.charCodeAt(J)] << 2 | s[_.charCodeAt(J + 1)] >> 4, L[$++] = E & 255), q === 1 && (E = s[_.charCodeAt(J)] << 10 | s[_.charCodeAt(J + 1)] << 4 | s[_.charCodeAt(J + 2)] >> 2, L[$++] = E >> 8 & 255, L[$++] = E & 255), L;
|
|
5377
5377
|
}
|
|
5378
5378
|
function o(_) {
|
|
5379
5379
|
return y[_ >> 18 & 63] + y[_ >> 12 & 63] + y[_ >> 6 & 63] + y[_ & 63];
|
|
5380
5380
|
}
|
|
5381
5381
|
function c(_, E, I) {
|
|
5382
|
-
for (var P,
|
|
5383
|
-
P = (_[L] << 16 & 16711680) + (_[L + 1] << 8 & 65280) + (_[L + 2] & 255),
|
|
5384
|
-
return
|
|
5382
|
+
for (var P, q = [], L = E; L < I; L += 3)
|
|
5383
|
+
P = (_[L] << 16 & 16711680) + (_[L + 1] << 8 & 65280) + (_[L + 2] & 255), q.push(o(P));
|
|
5384
|
+
return q.join("");
|
|
5385
5385
|
}
|
|
5386
5386
|
function d(_) {
|
|
5387
|
-
for (var E, I = _.length, P = I % 3,
|
|
5388
|
-
|
|
5389
|
-
return P === 1 ? (E = _[I - 1],
|
|
5387
|
+
for (var E, I = _.length, P = I % 3, q = [], L = 16383, $ = 0, U = I - P; $ < U; $ += L)
|
|
5388
|
+
q.push(c(_, $, $ + L > U ? U : $ + L));
|
|
5389
|
+
return P === 1 ? (E = _[I - 1], q.push(
|
|
5390
5390
|
y[E >> 2] + y[E << 4 & 63] + "=="
|
|
5391
|
-
)) : P === 2 && (E = (_[I - 2] << 8) + _[I - 1],
|
|
5391
|
+
)) : P === 2 && (E = (_[I - 2] << 8) + _[I - 1], q.push(
|
|
5392
5392
|
y[E >> 10] + y[E >> 4 & 63] + y[E << 2 & 63] + "="
|
|
5393
|
-
)),
|
|
5393
|
+
)), q.join("");
|
|
5394
5394
|
}
|
|
5395
5395
|
var m = {};
|
|
5396
5396
|
/*! ieee754. BSD-3-Clause License. Feross Aboukhadijeh <https://feross.org/opensource> */
|
|
5397
|
-
m.read = function(_, E, I, P,
|
|
5398
|
-
var L, $, U =
|
|
5397
|
+
m.read = function(_, E, I, P, q) {
|
|
5398
|
+
var L, $, U = q * 8 - P - 1, J = (1 << U) - 1, R = J >> 1, l = -7, x = I ? q - 1 : 0, S = I ? -1 : 1, w = _[E + x];
|
|
5399
5399
|
for (x += S, L = w & (1 << -l) - 1, w >>= -l, l += U; l > 0; L = L * 256 + _[E + x], x += S, l -= 8)
|
|
5400
5400
|
;
|
|
5401
5401
|
for ($ = L & (1 << -l) - 1, L >>= -l, l += P; l > 0; $ = $ * 256 + _[E + x], x += S, l -= 8)
|
|
@@ -5408,13 +5408,13 @@ function Zt() {
|
|
|
5408
5408
|
$ = $ + Math.pow(2, P), L = L - R;
|
|
5409
5409
|
}
|
|
5410
5410
|
return (w ? -1 : 1) * $ * Math.pow(2, L - P);
|
|
5411
|
-
}, m.write = function(_, E, I, P,
|
|
5412
|
-
var $, U, J, R = L * 8 -
|
|
5413
|
-
for (E = Math.abs(E), isNaN(E) || E === 1 / 0 ? (U = isNaN(E) ? 1 : 0, $ = l) : ($ = Math.floor(Math.log(E) / Math.LN2), E * (J = Math.pow(2, -$)) < 1 && ($--, J *= 2), $ + x >= 1 ? E += S / J : E += S * Math.pow(2, 1 - x), E * J >= 2 && ($++, J /= 2), $ + x >= l ? (U = 0, $ = l) : $ + x >= 1 ? (U = (E * J - 1) * Math.pow(2,
|
|
5411
|
+
}, m.write = function(_, E, I, P, q, L) {
|
|
5412
|
+
var $, U, J, R = L * 8 - q - 1, l = (1 << R) - 1, x = l >> 1, S = q === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0, w = P ? 0 : L - 1, M = P ? 1 : -1, D = E < 0 || E === 0 && 1 / E < 0 ? 1 : 0;
|
|
5413
|
+
for (E = Math.abs(E), isNaN(E) || E === 1 / 0 ? (U = isNaN(E) ? 1 : 0, $ = l) : ($ = Math.floor(Math.log(E) / Math.LN2), E * (J = Math.pow(2, -$)) < 1 && ($--, J *= 2), $ + x >= 1 ? E += S / J : E += S * Math.pow(2, 1 - x), E * J >= 2 && ($++, J /= 2), $ + x >= l ? (U = 0, $ = l) : $ + x >= 1 ? (U = (E * J - 1) * Math.pow(2, q), $ = $ + x) : (U = E * Math.pow(2, x - 1) * Math.pow(2, q), $ = 0)); q >= 8; _[I + w] = U & 255, w += M, U /= 256, q -= 8)
|
|
5414
5414
|
;
|
|
5415
|
-
for ($ = $ <<
|
|
5415
|
+
for ($ = $ << q | U, R += q; R > 0; _[I + w] = $ & 255, w += M, $ /= 256, R -= 8)
|
|
5416
5416
|
;
|
|
5417
|
-
_[I + w - M] |=
|
|
5417
|
+
_[I + w - M] |= D * 128;
|
|
5418
5418
|
};
|
|
5419
5419
|
/*!
|
|
5420
5420
|
* The buffer module from node.js, for the browser.
|
|
@@ -5425,8 +5425,8 @@ function Zt() {
|
|
|
5425
5425
|
(function(_) {
|
|
5426
5426
|
const E = p, I = m, P = typeof Symbol == "function" && typeof Symbol.for == "function" ? Symbol.for("nodejs.util.inspect.custom") : null;
|
|
5427
5427
|
_.Buffer = l, _.SlowBuffer = te, _.INSPECT_MAX_BYTES = 50;
|
|
5428
|
-
const
|
|
5429
|
-
_.kMaxLength =
|
|
5428
|
+
const q = 2147483647;
|
|
5429
|
+
_.kMaxLength = q;
|
|
5430
5430
|
const { Uint8Array: L, ArrayBuffer: $, SharedArrayBuffer: U } = globalThis;
|
|
5431
5431
|
l.TYPED_ARRAY_SUPPORT = J(), !l.TYPED_ARRAY_SUPPORT && typeof console < "u" && typeof console.error == "function" && console.error(
|
|
5432
5432
|
"This browser lacks typed array (Uint8Array) support which is required by `buffer` v5.x. Use `buffer` v4.x if you require old browser support."
|
|
@@ -5455,7 +5455,7 @@ function Zt() {
|
|
|
5455
5455
|
}
|
|
5456
5456
|
});
|
|
5457
5457
|
function R(z) {
|
|
5458
|
-
if (z >
|
|
5458
|
+
if (z > q)
|
|
5459
5459
|
throw new RangeError('The value "' + z + '" is invalid for option "size"');
|
|
5460
5460
|
const B = new L(z);
|
|
5461
5461
|
return Object.setPrototypeOf(B, l.prototype), B;
|
|
@@ -5473,7 +5473,7 @@ function Zt() {
|
|
|
5473
5473
|
l.poolSize = 8192;
|
|
5474
5474
|
function x(z, B, F) {
|
|
5475
5475
|
if (typeof z == "string")
|
|
5476
|
-
return
|
|
5476
|
+
return D(z, B);
|
|
5477
5477
|
if ($.isView(z))
|
|
5478
5478
|
return O(z);
|
|
5479
5479
|
if (z == null)
|
|
@@ -5520,7 +5520,7 @@ function Zt() {
|
|
|
5520
5520
|
}, l.allocUnsafeSlow = function(z) {
|
|
5521
5521
|
return M(z);
|
|
5522
5522
|
};
|
|
5523
|
-
function
|
|
5523
|
+
function D(z, B) {
|
|
5524
5524
|
if ((typeof B != "string" || B === "") && (B = "utf8"), !l.isEncoding(B))
|
|
5525
5525
|
throw new TypeError("Unknown encoding: " + B);
|
|
5526
5526
|
const F = V(z, B) | 0;
|
|
@@ -5560,8 +5560,8 @@ function Zt() {
|
|
|
5560
5560
|
return K(z.data);
|
|
5561
5561
|
}
|
|
5562
5562
|
function G(z) {
|
|
5563
|
-
if (z >=
|
|
5564
|
-
throw new RangeError("Attempt to allocate Buffer larger than maximum size: 0x" +
|
|
5563
|
+
if (z >= q)
|
|
5564
|
+
throw new RangeError("Attempt to allocate Buffer larger than maximum size: 0x" + q.toString(16) + " bytes");
|
|
5565
5565
|
return z | 0;
|
|
5566
5566
|
}
|
|
5567
5567
|
function te(z) {
|
|
@@ -6424,9 +6424,9 @@ function Wl() {
|
|
|
6424
6424
|
for (var m = 0, g = 0, _ = 0, E = d.length; _ !== E && d[_] === 0; )
|
|
6425
6425
|
_++, m++;
|
|
6426
6426
|
for (var I = (E - _) * e + 1 >>> 0, P = new Uint8Array(I); _ !== E; ) {
|
|
6427
|
-
for (var
|
|
6428
|
-
|
|
6429
|
-
if (
|
|
6427
|
+
for (var q = d[_], L = 0, $ = I - 1; (q !== 0 || L < g) && $ !== -1; $--, L++)
|
|
6428
|
+
q += 256 * P[$] >>> 0, P[$] = q % h >>> 0, q = q / h >>> 0;
|
|
6429
|
+
if (q !== 0)
|
|
6430
6430
|
throw new Error("Non-zero carry");
|
|
6431
6431
|
g = L, _++;
|
|
6432
6432
|
}
|
|
@@ -6447,12 +6447,12 @@ function Wl() {
|
|
|
6447
6447
|
var P = d.charCodeAt(m);
|
|
6448
6448
|
if (P > 255)
|
|
6449
6449
|
return;
|
|
6450
|
-
var
|
|
6451
|
-
if (
|
|
6450
|
+
var q = y[P];
|
|
6451
|
+
if (q === 255)
|
|
6452
6452
|
return;
|
|
6453
|
-
for (var L = 0, $ = E - 1; (
|
|
6454
|
-
|
|
6455
|
-
if (
|
|
6453
|
+
for (var L = 0, $ = E - 1; (q !== 0 || L < _) && $ !== -1; $--, L++)
|
|
6454
|
+
q += h * I[$] >>> 0, I[$] = q % 256 >>> 0, q = q / 256 >>> 0;
|
|
6455
|
+
if (q !== 0)
|
|
6456
6456
|
throw new Error("Non-zero carry");
|
|
6457
6457
|
_ = L, m++;
|
|
6458
6458
|
}
|
|
@@ -6529,7 +6529,7 @@ function Jl() {
|
|
|
6529
6529
|
if (J <= -9223372036854776e3)
|
|
6530
6530
|
return $;
|
|
6531
6531
|
if (J + 1 >= d)
|
|
6532
|
-
return
|
|
6532
|
+
return q;
|
|
6533
6533
|
}
|
|
6534
6534
|
return J < 0 ? b(-J, R).neg() : f(J % o | 0, J / o | 0, R);
|
|
6535
6535
|
}
|
|
@@ -6552,9 +6552,9 @@ function Jl() {
|
|
|
6552
6552
|
if (x === 0)
|
|
6553
6553
|
return i(J.substring(1), R, l).neg();
|
|
6554
6554
|
for (var S = b(h(l, 8)), w = g, M = 0; M < J.length; M += 8) {
|
|
6555
|
-
var
|
|
6556
|
-
if (
|
|
6557
|
-
var O = b(h(l,
|
|
6555
|
+
var D = Math.min(8, J.length - M), K = parseInt(J.substring(M, M + D), l);
|
|
6556
|
+
if (D < 8) {
|
|
6557
|
+
var O = b(h(l, D));
|
|
6558
6558
|
w = w.mul(O).add(b(K));
|
|
6559
6559
|
} else
|
|
6560
6560
|
w = w.mul(S), w = w.add(b(K));
|
|
@@ -6576,8 +6576,8 @@ function Jl() {
|
|
|
6576
6576
|
u.UONE = I;
|
|
6577
6577
|
var P = a(-1);
|
|
6578
6578
|
u.NEG_ONE = P;
|
|
6579
|
-
var
|
|
6580
|
-
u.MAX_VALUE =
|
|
6579
|
+
var q = f(-1, 2147483647, !1);
|
|
6580
|
+
u.MAX_VALUE = q;
|
|
6581
6581
|
var L = f(-1, -1, !0);
|
|
6582
6582
|
u.MAX_UNSIGNED_VALUE = L;
|
|
6583
6583
|
var $ = f(0, -2147483648, !1);
|
|
@@ -6598,13 +6598,13 @@ function Jl() {
|
|
|
6598
6598
|
return x.toString(R) + S.toInt().toString(R);
|
|
6599
6599
|
} else
|
|
6600
6600
|
return "-" + this.neg().toString(R);
|
|
6601
|
-
for (var w = b(h(R, 6), this.unsigned), M = this,
|
|
6601
|
+
for (var w = b(h(R, 6), this.unsigned), M = this, D = ""; ; ) {
|
|
6602
6602
|
var K = M.div(w), O = M.sub(K.mul(w)).toInt() >>> 0, v = O.toString(R);
|
|
6603
6603
|
if (M = K, M.isZero())
|
|
6604
|
-
return v +
|
|
6604
|
+
return v + D;
|
|
6605
6605
|
for (; v.length < 6; )
|
|
6606
6606
|
v = "0" + v;
|
|
6607
|
-
|
|
6607
|
+
D = "" + v + D;
|
|
6608
6608
|
}
|
|
6609
6609
|
}, U.getHighBits = function() {
|
|
6610
6610
|
return this.high;
|
|
@@ -6666,8 +6666,8 @@ function Jl() {
|
|
|
6666
6666
|
return !this.unsigned && this.eq($) ? $ : this.not().add(E);
|
|
6667
6667
|
}, U.neg = U.negate, U.add = function(R) {
|
|
6668
6668
|
p(R) || (R = r(R));
|
|
6669
|
-
var l = this.high >>> 16, x = this.high & 65535, S = this.low >>> 16, w = this.low & 65535, M = R.high >>> 16,
|
|
6670
|
-
return te += w + O, G += te >>> 16, te &= 65535, G += S + K, k += G >>> 16, G &= 65535, k += x +
|
|
6669
|
+
var l = this.high >>> 16, x = this.high & 65535, S = this.low >>> 16, w = this.low & 65535, M = R.high >>> 16, D = R.high & 65535, K = R.low >>> 16, O = R.low & 65535, v = 0, k = 0, G = 0, te = 0;
|
|
6670
|
+
return te += w + O, G += te >>> 16, te &= 65535, G += S + K, k += G >>> 16, G &= 65535, k += x + D, v += k >>> 16, k &= 65535, v += l + M, v &= 65535, f(G << 16 | te, v << 16 | k, this.unsigned);
|
|
6671
6671
|
}, U.subtract = function(R) {
|
|
6672
6672
|
return p(R) || (R = r(R)), this.add(R.neg());
|
|
6673
6673
|
}, U.sub = U.subtract, U.multiply = function(R) {
|
|
@@ -6683,8 +6683,8 @@ function Jl() {
|
|
|
6683
6683
|
return this.mul(R.neg()).neg();
|
|
6684
6684
|
if (this.lt(m) && R.lt(m))
|
|
6685
6685
|
return b(this.toNumber() * R.toNumber(), this.unsigned);
|
|
6686
|
-
var l = this.high >>> 16, x = this.high & 65535, S = this.low >>> 16, w = this.low & 65535, M = R.high >>> 16,
|
|
6687
|
-
return te += w * O, G += te >>> 16, te &= 65535, G += S * O, k += G >>> 16, G &= 65535, G += w * K, k += G >>> 16, G &= 65535, k += x * O, v += k >>> 16, k &= 65535, k += S * K, v += k >>> 16, k &= 65535, k += w *
|
|
6686
|
+
var l = this.high >>> 16, x = this.high & 65535, S = this.low >>> 16, w = this.low & 65535, M = R.high >>> 16, D = R.high & 65535, K = R.low >>> 16, O = R.low & 65535, v = 0, k = 0, G = 0, te = 0;
|
|
6687
|
+
return te += w * O, G += te >>> 16, te &= 65535, G += S * O, k += G >>> 16, G &= 65535, G += w * K, k += G >>> 16, G &= 65535, k += x * O, v += k >>> 16, k &= 65535, k += S * K, v += k >>> 16, k &= 65535, k += w * D, v += k >>> 16, k &= 65535, v += l * O + x * K + S * D + w * M, v &= 65535, f(G << 16 | te, v << 16 | k, this.unsigned);
|
|
6688
6688
|
}, U.mul = U.multiply, U.divide = function(R) {
|
|
6689
6689
|
if (p(R) || (R = r(R)), R.isZero())
|
|
6690
6690
|
throw Error("division by zero");
|
|
@@ -6715,8 +6715,8 @@ function Jl() {
|
|
|
6715
6715
|
}
|
|
6716
6716
|
for (x = this; x.gte(R); ) {
|
|
6717
6717
|
l = Math.max(1, Math.floor(x.toNumber() / R.toNumber()));
|
|
6718
|
-
for (var M = Math.ceil(Math.log(l) / Math.LN2),
|
|
6719
|
-
l -=
|
|
6718
|
+
for (var M = Math.ceil(Math.log(l) / Math.LN2), D = M <= 48 ? 1 : h(2, M - 48), K = b(l), O = K.mul(R); O.isNegative() || O.gt(x); )
|
|
6719
|
+
l -= D, K = b(l, this.unsigned), O = K.mul(R);
|
|
6720
6720
|
K.isZero() && (K = E), S = S.add(K), x = x.sub(O);
|
|
6721
6721
|
}
|
|
6722
6722
|
return S;
|
|
@@ -7679,15 +7679,15 @@ function Hr() {
|
|
|
7679
7679
|
}
|
|
7680
7680
|
return e ? g : d;
|
|
7681
7681
|
}, s.fromDebug = function(e, t, o) {
|
|
7682
|
-
for (var c = e.length, d = new s((c + 1) / 3 | 0, t, o), m = 0, g = 0, _, E, I = !1, P = !1,
|
|
7682
|
+
for (var c = e.length, d = new s((c + 1) / 3 | 0, t, o), m = 0, g = 0, _, E, I = !1, P = !1, q = !1, L = !1, $ = !1; m < c; ) {
|
|
7683
7683
|
switch (_ = e.charAt(m++)) {
|
|
7684
7684
|
case "!":
|
|
7685
7685
|
if (!o) {
|
|
7686
|
-
if (P ||
|
|
7686
|
+
if (P || q || L) {
|
|
7687
7687
|
$ = !0;
|
|
7688
7688
|
break;
|
|
7689
7689
|
}
|
|
7690
|
-
P =
|
|
7690
|
+
P = q = L = !0;
|
|
7691
7691
|
}
|
|
7692
7692
|
d.offset = d.markedOffset = d.limit = g, I = !1;
|
|
7693
7693
|
break;
|
|
@@ -7703,11 +7703,11 @@ function Hr() {
|
|
|
7703
7703
|
break;
|
|
7704
7704
|
case "[":
|
|
7705
7705
|
if (!o) {
|
|
7706
|
-
if (P ||
|
|
7706
|
+
if (P || q) {
|
|
7707
7707
|
$ = !0;
|
|
7708
7708
|
break;
|
|
7709
7709
|
}
|
|
7710
|
-
P =
|
|
7710
|
+
P = q = !0;
|
|
7711
7711
|
}
|
|
7712
7712
|
d.offset = d.markedOffset = g, I = !1;
|
|
7713
7713
|
break;
|
|
@@ -7723,11 +7723,11 @@ function Hr() {
|
|
|
7723
7723
|
break;
|
|
7724
7724
|
case "]":
|
|
7725
7725
|
if (!o) {
|
|
7726
|
-
if (L ||
|
|
7726
|
+
if (L || q) {
|
|
7727
7727
|
$ = !0;
|
|
7728
7728
|
break;
|
|
7729
7729
|
}
|
|
7730
|
-
L =
|
|
7730
|
+
L = q = !0;
|
|
7731
7731
|
}
|
|
7732
7732
|
d.limit = d.markedOffset = g, I = !1;
|
|
7733
7733
|
break;
|
|
@@ -7743,11 +7743,11 @@ function Hr() {
|
|
|
7743
7743
|
break;
|
|
7744
7744
|
case "'":
|
|
7745
7745
|
if (!o) {
|
|
7746
|
-
if (
|
|
7746
|
+
if (q) {
|
|
7747
7747
|
$ = !0;
|
|
7748
7748
|
break;
|
|
7749
7749
|
}
|
|
7750
|
-
|
|
7750
|
+
q = !0;
|
|
7751
7751
|
}
|
|
7752
7752
|
d.markedOffset = g, I = !1;
|
|
7753
7753
|
break;
|
|
@@ -8014,8 +8014,8 @@ var Jr = { exports: {} }, Zr = { exports: {} }, As;
|
|
|
8014
8014
|
function Fo() {
|
|
8015
8015
|
if (As) return Zr.exports;
|
|
8016
8016
|
As = 1;
|
|
8017
|
-
var n = typeof Reflect == "object" ? Reflect : null, u = n && typeof n.apply == "function" ? n.apply : function(P,
|
|
8018
|
-
return Function.prototype.apply.call(P,
|
|
8017
|
+
var n = typeof Reflect == "object" ? Reflect : null, u = n && typeof n.apply == "function" ? n.apply : function(P, q, L) {
|
|
8018
|
+
return Function.prototype.apply.call(P, q, L);
|
|
8019
8019
|
}, p;
|
|
8020
8020
|
n && typeof n.ownKeys == "function" ? p = n.ownKeys : Object.getOwnPropertySymbols ? p = function(P) {
|
|
8021
8021
|
return Object.getOwnPropertyNames(P).concat(Object.getOwnPropertySymbols(P));
|
|
@@ -8060,7 +8060,7 @@ function Fo() {
|
|
|
8060
8060
|
a.prototype.getMaxListeners = function() {
|
|
8061
8061
|
return h(this);
|
|
8062
8062
|
}, a.prototype.emit = function(P) {
|
|
8063
|
-
for (var
|
|
8063
|
+
for (var q = [], L = 1; L < arguments.length; L++) q.push(arguments[L]);
|
|
8064
8064
|
var $ = P === "error", U = this._events;
|
|
8065
8065
|
if (U !== void 0)
|
|
8066
8066
|
$ = $ && U.error === void 0;
|
|
@@ -8068,7 +8068,7 @@ function Fo() {
|
|
|
8068
8068
|
return !1;
|
|
8069
8069
|
if ($) {
|
|
8070
8070
|
var J;
|
|
8071
|
-
if (
|
|
8071
|
+
if (q.length > 0 && (J = q[0]), J instanceof Error)
|
|
8072
8072
|
throw J;
|
|
8073
8073
|
var R = new Error("Unhandled error." + (J ? " (" + J.message + ")" : ""));
|
|
8074
8074
|
throw R.context = J, R;
|
|
@@ -8077,65 +8077,65 @@ function Fo() {
|
|
|
8077
8077
|
if (l === void 0)
|
|
8078
8078
|
return !1;
|
|
8079
8079
|
if (typeof l == "function")
|
|
8080
|
-
u(l, this,
|
|
8080
|
+
u(l, this, q);
|
|
8081
8081
|
else
|
|
8082
8082
|
for (var x = l.length, S = c(l, x), L = 0; L < x; ++L)
|
|
8083
|
-
u(S[L], this,
|
|
8083
|
+
u(S[L], this, q);
|
|
8084
8084
|
return !0;
|
|
8085
8085
|
};
|
|
8086
|
-
function i(I, P,
|
|
8086
|
+
function i(I, P, q, L) {
|
|
8087
8087
|
var $, U, J;
|
|
8088
|
-
if (f(
|
|
8088
|
+
if (f(q), U = I._events, U === void 0 ? (U = I._events = /* @__PURE__ */ Object.create(null), I._eventsCount = 0) : (U.newListener !== void 0 && (I.emit(
|
|
8089
8089
|
"newListener",
|
|
8090
8090
|
P,
|
|
8091
|
-
|
|
8091
|
+
q.listener ? q.listener : q
|
|
8092
8092
|
), U = I._events), J = U[P]), J === void 0)
|
|
8093
|
-
J = U[P] =
|
|
8094
|
-
else if (typeof J == "function" ? J = U[P] = L ? [
|
|
8093
|
+
J = U[P] = q, ++I._eventsCount;
|
|
8094
|
+
else if (typeof J == "function" ? J = U[P] = L ? [q, J] : [J, q] : L ? J.unshift(q) : J.push(q), $ = h(I), $ > 0 && J.length > $ && !J.warned) {
|
|
8095
8095
|
J.warned = !0;
|
|
8096
8096
|
var R = new Error("Possible EventEmitter memory leak detected. " + J.length + " " + String(P) + " listeners added. Use emitter.setMaxListeners() to increase limit");
|
|
8097
8097
|
R.name = "MaxListenersExceededWarning", R.emitter = I, R.type = P, R.count = J.length, y(R);
|
|
8098
8098
|
}
|
|
8099
8099
|
return I;
|
|
8100
8100
|
}
|
|
8101
|
-
a.prototype.addListener = function(P,
|
|
8102
|
-
return i(this, P,
|
|
8103
|
-
}, a.prototype.on = a.prototype.addListener, a.prototype.prependListener = function(P,
|
|
8104
|
-
return i(this, P,
|
|
8101
|
+
a.prototype.addListener = function(P, q) {
|
|
8102
|
+
return i(this, P, q, !1);
|
|
8103
|
+
}, a.prototype.on = a.prototype.addListener, a.prototype.prependListener = function(P, q) {
|
|
8104
|
+
return i(this, P, q, !0);
|
|
8105
8105
|
};
|
|
8106
8106
|
function r() {
|
|
8107
8107
|
if (!this.fired)
|
|
8108
8108
|
return this.target.removeListener(this.type, this.wrapFn), this.fired = !0, arguments.length === 0 ? this.listener.call(this.target) : this.listener.apply(this.target, arguments);
|
|
8109
8109
|
}
|
|
8110
|
-
function e(I, P,
|
|
8111
|
-
var L = { fired: !1, wrapFn: void 0, target: I, type: P, listener:
|
|
8112
|
-
return $.listener =
|
|
8110
|
+
function e(I, P, q) {
|
|
8111
|
+
var L = { fired: !1, wrapFn: void 0, target: I, type: P, listener: q }, $ = r.bind(L);
|
|
8112
|
+
return $.listener = q, L.wrapFn = $, $;
|
|
8113
8113
|
}
|
|
8114
|
-
a.prototype.once = function(P,
|
|
8115
|
-
return f(
|
|
8116
|
-
}, a.prototype.prependOnceListener = function(P,
|
|
8117
|
-
return f(
|
|
8118
|
-
}, a.prototype.removeListener = function(P,
|
|
8114
|
+
a.prototype.once = function(P, q) {
|
|
8115
|
+
return f(q), this.on(P, e(this, P, q)), this;
|
|
8116
|
+
}, a.prototype.prependOnceListener = function(P, q) {
|
|
8117
|
+
return f(q), this.prependListener(P, e(this, P, q)), this;
|
|
8118
|
+
}, a.prototype.removeListener = function(P, q) {
|
|
8119
8119
|
var L, $, U, J, R;
|
|
8120
|
-
if (f(
|
|
8120
|
+
if (f(q), $ = this._events, $ === void 0)
|
|
8121
8121
|
return this;
|
|
8122
8122
|
if (L = $[P], L === void 0)
|
|
8123
8123
|
return this;
|
|
8124
|
-
if (L ===
|
|
8125
|
-
--this._eventsCount === 0 ? this._events = /* @__PURE__ */ Object.create(null) : (delete $[P], $.removeListener && this.emit("removeListener", P, L.listener ||
|
|
8124
|
+
if (L === q || L.listener === q)
|
|
8125
|
+
--this._eventsCount === 0 ? this._events = /* @__PURE__ */ Object.create(null) : (delete $[P], $.removeListener && this.emit("removeListener", P, L.listener || q));
|
|
8126
8126
|
else if (typeof L != "function") {
|
|
8127
8127
|
for (U = -1, J = L.length - 1; J >= 0; J--)
|
|
8128
|
-
if (L[J] ===
|
|
8128
|
+
if (L[J] === q || L[J].listener === q) {
|
|
8129
8129
|
R = L[J].listener, U = J;
|
|
8130
8130
|
break;
|
|
8131
8131
|
}
|
|
8132
8132
|
if (U < 0)
|
|
8133
8133
|
return this;
|
|
8134
|
-
U === 0 ? L.shift() : d(L, U), L.length === 1 && ($[P] = L[0]), $.removeListener !== void 0 && this.emit("removeListener", P, R ||
|
|
8134
|
+
U === 0 ? L.shift() : d(L, U), L.length === 1 && ($[P] = L[0]), $.removeListener !== void 0 && this.emit("removeListener", P, R || q);
|
|
8135
8135
|
}
|
|
8136
8136
|
return this;
|
|
8137
8137
|
}, a.prototype.off = a.prototype.removeListener, a.prototype.removeAllListeners = function(P) {
|
|
8138
|
-
var
|
|
8138
|
+
var q, L, $;
|
|
8139
8139
|
if (L = this._events, L === void 0)
|
|
8140
8140
|
return this;
|
|
8141
8141
|
if (L.removeListener === void 0)
|
|
@@ -8146,19 +8146,19 @@ function Fo() {
|
|
|
8146
8146
|
J = U[$], J !== "removeListener" && this.removeAllListeners(J);
|
|
8147
8147
|
return this.removeAllListeners("removeListener"), this._events = /* @__PURE__ */ Object.create(null), this._eventsCount = 0, this;
|
|
8148
8148
|
}
|
|
8149
|
-
if (
|
|
8150
|
-
this.removeListener(P,
|
|
8151
|
-
else if (
|
|
8152
|
-
for ($ =
|
|
8153
|
-
this.removeListener(P,
|
|
8149
|
+
if (q = L[P], typeof q == "function")
|
|
8150
|
+
this.removeListener(P, q);
|
|
8151
|
+
else if (q !== void 0)
|
|
8152
|
+
for ($ = q.length - 1; $ >= 0; $--)
|
|
8153
|
+
this.removeListener(P, q[$]);
|
|
8154
8154
|
return this;
|
|
8155
8155
|
};
|
|
8156
|
-
function t(I, P,
|
|
8156
|
+
function t(I, P, q) {
|
|
8157
8157
|
var L = I._events;
|
|
8158
8158
|
if (L === void 0)
|
|
8159
8159
|
return [];
|
|
8160
8160
|
var $ = L[P];
|
|
8161
|
-
return $ === void 0 ? [] : typeof $ == "function" ?
|
|
8161
|
+
return $ === void 0 ? [] : typeof $ == "function" ? q ? [$.listener || $] : [$] : q ? m($) : c($, $.length);
|
|
8162
8162
|
}
|
|
8163
8163
|
a.prototype.listeners = function(P) {
|
|
8164
8164
|
return t(this, P, !0);
|
|
@@ -8170,11 +8170,11 @@ function Fo() {
|
|
|
8170
8170
|
function o(I) {
|
|
8171
8171
|
var P = this._events;
|
|
8172
8172
|
if (P !== void 0) {
|
|
8173
|
-
var
|
|
8174
|
-
if (typeof
|
|
8173
|
+
var q = P[I];
|
|
8174
|
+
if (typeof q == "function")
|
|
8175
8175
|
return 1;
|
|
8176
|
-
if (
|
|
8177
|
-
return
|
|
8176
|
+
if (q !== void 0)
|
|
8177
|
+
return q.length;
|
|
8178
8178
|
}
|
|
8179
8179
|
return 0;
|
|
8180
8180
|
}
|
|
@@ -8182,9 +8182,9 @@ function Fo() {
|
|
|
8182
8182
|
return this._eventsCount > 0 ? p(this._events) : [];
|
|
8183
8183
|
};
|
|
8184
8184
|
function c(I, P) {
|
|
8185
|
-
for (var
|
|
8186
|
-
|
|
8187
|
-
return
|
|
8185
|
+
for (var q = new Array(P), L = 0; L < P; ++L)
|
|
8186
|
+
q[L] = I[L];
|
|
8187
|
+
return q;
|
|
8188
8188
|
}
|
|
8189
8189
|
function d(I, P) {
|
|
8190
8190
|
for (; P + 1 < I.length; P++)
|
|
@@ -8192,30 +8192,30 @@ function Fo() {
|
|
|
8192
8192
|
I.pop();
|
|
8193
8193
|
}
|
|
8194
8194
|
function m(I) {
|
|
8195
|
-
for (var P = new Array(I.length),
|
|
8196
|
-
P[
|
|
8195
|
+
for (var P = new Array(I.length), q = 0; q < P.length; ++q)
|
|
8196
|
+
P[q] = I[q].listener || I[q];
|
|
8197
8197
|
return P;
|
|
8198
8198
|
}
|
|
8199
8199
|
function g(I, P) {
|
|
8200
|
-
return new Promise(function(
|
|
8200
|
+
return new Promise(function(q, L) {
|
|
8201
8201
|
function $(J) {
|
|
8202
8202
|
I.removeListener(P, U), L(J);
|
|
8203
8203
|
}
|
|
8204
8204
|
function U() {
|
|
8205
|
-
typeof I.removeListener == "function" && I.removeListener("error", $),
|
|
8205
|
+
typeof I.removeListener == "function" && I.removeListener("error", $), q([].slice.call(arguments));
|
|
8206
8206
|
}
|
|
8207
8207
|
E(I, P, U, { once: !0 }), P !== "error" && _(I, $, { once: !0 });
|
|
8208
8208
|
});
|
|
8209
8209
|
}
|
|
8210
|
-
function _(I, P,
|
|
8211
|
-
typeof I.on == "function" && E(I, "error", P,
|
|
8210
|
+
function _(I, P, q) {
|
|
8211
|
+
typeof I.on == "function" && E(I, "error", P, q);
|
|
8212
8212
|
}
|
|
8213
|
-
function E(I, P,
|
|
8213
|
+
function E(I, P, q, L) {
|
|
8214
8214
|
if (typeof I.on == "function")
|
|
8215
|
-
L.once ? I.once(P,
|
|
8215
|
+
L.once ? I.once(P, q) : I.on(P, q);
|
|
8216
8216
|
else if (typeof I.addEventListener == "function")
|
|
8217
8217
|
I.addEventListener(P, function $(U) {
|
|
8218
|
-
L.once && I.removeEventListener(P, $),
|
|
8218
|
+
L.once && I.removeEventListener(P, $), q(U);
|
|
8219
8219
|
});
|
|
8220
8220
|
else
|
|
8221
8221
|
throw new TypeError('The "emitter" argument must be of type EventEmitter. Received type ' + typeof I);
|
|
@@ -8281,7 +8281,7 @@ function sh() {
|
|
|
8281
8281
|
}
|
|
8282
8282
|
return String(c);
|
|
8283
8283
|
}
|
|
8284
|
-
var h = Zt(), i = h.Buffer, r =
|
|
8284
|
+
var h = Zt(), i = h.Buffer, r = qt(), e = r.inspect, t = e && e.custom || "inspect";
|
|
8285
8285
|
function o(c, d, m) {
|
|
8286
8286
|
i.prototype.copy.call(c, d, m);
|
|
8287
8287
|
}
|
|
@@ -8547,7 +8547,7 @@ function Oo() {
|
|
|
8547
8547
|
};
|
|
8548
8548
|
}
|
|
8549
8549
|
var u;
|
|
8550
|
-
$.WritableState =
|
|
8550
|
+
$.WritableState = q;
|
|
8551
8551
|
var p = {
|
|
8552
8552
|
deprecate: uh()
|
|
8553
8553
|
}, y = Xc(), s = Zt().Buffer, a = (typeof mt < "u" ? mt : typeof window < "u" ? window : typeof self < "u" ? self : {}).Uint8Array || function() {
|
|
@@ -8562,20 +8562,20 @@ function Oo() {
|
|
|
8562
8562
|
at()($, y);
|
|
8563
8563
|
function P() {
|
|
8564
8564
|
}
|
|
8565
|
-
function
|
|
8565
|
+
function q(H, X, ne) {
|
|
8566
8566
|
u = u || Qt(), H = H || {}, typeof ne != "boolean" && (ne = X instanceof u), this.objectMode = !!H.objectMode, ne && (this.objectMode = this.objectMode || !!H.writableObjectMode), this.highWaterMark = r(this, H, "writableHighWaterMark", ne), this.finalCalled = !1, this.needDrain = !1, this.ending = !1, this.ended = !1, this.finished = !1, this.destroyed = !1;
|
|
8567
8567
|
var oe = H.decodeStrings === !1;
|
|
8568
8568
|
this.decodeStrings = !oe, this.defaultEncoding = H.defaultEncoding || "utf8", this.length = 0, this.writing = !1, this.corked = 0, this.sync = !0, this.bufferProcessing = !1, this.onwrite = function(ue) {
|
|
8569
8569
|
M(X, ue);
|
|
8570
8570
|
}, this.writecb = null, this.writelen = 0, this.bufferedRequest = null, this.lastBufferedRequest = null, this.pendingcb = 0, this.prefinished = !1, this.errorEmitted = !1, this.emitClose = H.emitClose !== !1, this.autoDestroy = !!H.autoDestroy, this.bufferedRequestCount = 0, this.corkedRequestsFree = new n(this);
|
|
8571
8571
|
}
|
|
8572
|
-
|
|
8572
|
+
q.prototype.getBuffer = function() {
|
|
8573
8573
|
for (var X = this.bufferedRequest, ne = []; X; )
|
|
8574
8574
|
ne.push(X), X = X.next;
|
|
8575
8575
|
return ne;
|
|
8576
8576
|
}, function() {
|
|
8577
8577
|
try {
|
|
8578
|
-
Object.defineProperty(
|
|
8578
|
+
Object.defineProperty(q.prototype, "buffer", {
|
|
8579
8579
|
get: p.deprecate(function() {
|
|
8580
8580
|
return this.getBuffer();
|
|
8581
8581
|
}, "_writableState.buffer is deprecated. Use _writableState.getBuffer instead.", "DEP0003")
|
|
@@ -8586,7 +8586,7 @@ function Oo() {
|
|
|
8586
8586
|
var L;
|
|
8587
8587
|
typeof Symbol == "function" && Symbol.hasInstance && typeof Function.prototype[Symbol.hasInstance] == "function" ? (L = Function.prototype[Symbol.hasInstance], Object.defineProperty($, Symbol.hasInstance, {
|
|
8588
8588
|
value: function(X) {
|
|
8589
|
-
return L.call(this, X) ? !0 : this !== $ ? !1 : X && X._writableState instanceof
|
|
8589
|
+
return L.call(this, X) ? !0 : this !== $ ? !1 : X && X._writableState instanceof q;
|
|
8590
8590
|
}
|
|
8591
8591
|
})) : L = function(X) {
|
|
8592
8592
|
return X instanceof this;
|
|
@@ -8595,7 +8595,7 @@ function Oo() {
|
|
|
8595
8595
|
u = u || Qt();
|
|
8596
8596
|
var X = this instanceof u;
|
|
8597
8597
|
if (!X && !L.call($, this)) return new $(H);
|
|
8598
|
-
this._writableState = new
|
|
8598
|
+
this._writableState = new q(H, this, X), this.writable = !0, H && (typeof H.write == "function" && (this._write = H.write), typeof H.writev == "function" && (this._writev = H.writev), typeof H.destroy == "function" && (this._destroy = H.destroy), typeof H.final == "function" && (this._final = H.final)), y.call(this);
|
|
8599
8599
|
}
|
|
8600
8600
|
$.prototype.pipe = function() {
|
|
8601
8601
|
I(this, new d());
|
|
@@ -8676,10 +8676,10 @@ function Oo() {
|
|
|
8676
8676
|
if (w(ne), X) S(H, ne, oe, X, ue);
|
|
8677
8677
|
else {
|
|
8678
8678
|
var Y = v(ne) || H.destroyed;
|
|
8679
|
-
!Y && !ne.corked && !ne.bufferProcessing && ne.bufferedRequest && O(H, ne), oe ? ke.nextTick(
|
|
8679
|
+
!Y && !ne.corked && !ne.bufferProcessing && ne.bufferedRequest && O(H, ne), oe ? ke.nextTick(D, H, ne, Y, ue) : D(H, ne, Y, ue);
|
|
8680
8680
|
}
|
|
8681
8681
|
}
|
|
8682
|
-
function
|
|
8682
|
+
function D(H, X, ne, oe) {
|
|
8683
8683
|
ne || K(H, X), X.pendingcb--, oe(), te(H, X);
|
|
8684
8684
|
}
|
|
8685
8685
|
function K(H, X) {
|
|
@@ -8773,7 +8773,7 @@ function Qt() {
|
|
|
8773
8773
|
return r;
|
|
8774
8774
|
};
|
|
8775
8775
|
la = b;
|
|
8776
|
-
var u =
|
|
8776
|
+
var u = qo(), p = Oo();
|
|
8777
8777
|
at()(b, u);
|
|
8778
8778
|
for (var y = n(p.prototype), s = 0; s < y.length; s++) {
|
|
8779
8779
|
var a = y[s];
|
|
@@ -8985,10 +8985,10 @@ function mo() {
|
|
|
8985
8985
|
}
|
|
8986
8986
|
return ha;
|
|
8987
8987
|
}
|
|
8988
|
-
var da,
|
|
8988
|
+
var da, qs;
|
|
8989
8989
|
function En() {
|
|
8990
|
-
if (
|
|
8991
|
-
|
|
8990
|
+
if (qs) return da;
|
|
8991
|
+
qs = 1;
|
|
8992
8992
|
var n = vr().codes.ERR_STREAM_PREMATURE_CLOSE;
|
|
8993
8993
|
function u(a) {
|
|
8994
8994
|
var b = !1;
|
|
@@ -9032,10 +9032,10 @@ function En() {
|
|
|
9032
9032
|
}
|
|
9033
9033
|
return da = s, da;
|
|
9034
9034
|
}
|
|
9035
|
-
var pa,
|
|
9035
|
+
var pa, Ds;
|
|
9036
9036
|
function ch() {
|
|
9037
|
-
if (
|
|
9038
|
-
|
|
9037
|
+
if (Ds) return pa;
|
|
9038
|
+
Ds = 1;
|
|
9039
9039
|
var n;
|
|
9040
9040
|
function u(E, I, P) {
|
|
9041
9041
|
return I = p(I), I in E ? Object.defineProperty(E, I, { value: P, enumerable: !0, configurable: !0, writable: !0 }) : E[I] = P, E;
|
|
@@ -9048,8 +9048,8 @@ function ch() {
|
|
|
9048
9048
|
if (typeof E != "object" || E === null) return E;
|
|
9049
9049
|
var P = E[Symbol.toPrimitive];
|
|
9050
9050
|
if (P !== void 0) {
|
|
9051
|
-
var
|
|
9052
|
-
if (typeof
|
|
9051
|
+
var q = P.call(E, I);
|
|
9052
|
+
if (typeof q != "object") return q;
|
|
9053
9053
|
throw new TypeError("@@toPrimitive must return a primitive value.");
|
|
9054
9054
|
}
|
|
9055
9055
|
return (I === "string" ? String : Number)(E);
|
|
@@ -9072,14 +9072,14 @@ function ch() {
|
|
|
9072
9072
|
ke.nextTick(o, E);
|
|
9073
9073
|
}
|
|
9074
9074
|
function d(E, I) {
|
|
9075
|
-
return function(P,
|
|
9075
|
+
return function(P, q) {
|
|
9076
9076
|
E.then(function() {
|
|
9077
9077
|
if (I[h]) {
|
|
9078
9078
|
P(t(void 0, !0));
|
|
9079
9079
|
return;
|
|
9080
9080
|
}
|
|
9081
|
-
I[r](P,
|
|
9082
|
-
},
|
|
9081
|
+
I[r](P, q);
|
|
9082
|
+
}, q);
|
|
9083
9083
|
};
|
|
9084
9084
|
}
|
|
9085
9085
|
var m = Object.getPrototypeOf(function() {
|
|
@@ -9099,9 +9099,9 @@ function ch() {
|
|
|
9099
9099
|
I[f] ? J(I[f]) : U(t(void 0, !0));
|
|
9100
9100
|
});
|
|
9101
9101
|
});
|
|
9102
|
-
var
|
|
9103
|
-
if (
|
|
9104
|
-
L = new Promise(d(
|
|
9102
|
+
var q = this[i], L;
|
|
9103
|
+
if (q)
|
|
9104
|
+
L = new Promise(d(q, this));
|
|
9105
9105
|
else {
|
|
9106
9106
|
var $ = this[e].read();
|
|
9107
9107
|
if ($ !== null)
|
|
@@ -9114,17 +9114,17 @@ function ch() {
|
|
|
9114
9114
|
return this;
|
|
9115
9115
|
}), u(n, "return", function() {
|
|
9116
9116
|
var I = this;
|
|
9117
|
-
return new Promise(function(P,
|
|
9117
|
+
return new Promise(function(P, q) {
|
|
9118
9118
|
I[e].destroy(null, function(L) {
|
|
9119
9119
|
if (L) {
|
|
9120
|
-
|
|
9120
|
+
q(L);
|
|
9121
9121
|
return;
|
|
9122
9122
|
}
|
|
9123
9123
|
P(t(void 0, !0));
|
|
9124
9124
|
});
|
|
9125
9125
|
});
|
|
9126
9126
|
}), n), m), _ = function(I) {
|
|
9127
|
-
var P,
|
|
9127
|
+
var P, q = Object.create(g, (P = {}, u(P, e, {
|
|
9128
9128
|
value: I,
|
|
9129
9129
|
writable: !0
|
|
9130
9130
|
}), u(P, a, {
|
|
@@ -9141,20 +9141,20 @@ function ch() {
|
|
|
9141
9141
|
writable: !0
|
|
9142
9142
|
}), u(P, r, {
|
|
9143
9143
|
value: function($, U) {
|
|
9144
|
-
var J =
|
|
9145
|
-
J ? (
|
|
9144
|
+
var J = q[e].read();
|
|
9145
|
+
J ? (q[i] = null, q[a] = null, q[b] = null, $(t(J, !1))) : (q[a] = $, q[b] = U);
|
|
9146
9146
|
},
|
|
9147
9147
|
writable: !0
|
|
9148
9148
|
}), P));
|
|
9149
|
-
return
|
|
9149
|
+
return q[i] = null, s(I, function(L) {
|
|
9150
9150
|
if (L && L.code !== "ERR_STREAM_PREMATURE_CLOSE") {
|
|
9151
|
-
var $ =
|
|
9152
|
-
$ !== null && (
|
|
9151
|
+
var $ = q[b];
|
|
9152
|
+
$ !== null && (q[i] = null, q[a] = null, q[b] = null, $(L)), q[f] = L;
|
|
9153
9153
|
return;
|
|
9154
9154
|
}
|
|
9155
|
-
var U =
|
|
9156
|
-
U !== null && (
|
|
9157
|
-
}), I.on("readable", c.bind(null,
|
|
9155
|
+
var U = q[a];
|
|
9156
|
+
U !== null && (q[i] = null, q[a] = null, q[b] = null, U(t(void 0, !0))), q[h] = !0;
|
|
9157
|
+
}), I.on("readable", c.bind(null, q)), q;
|
|
9158
9158
|
};
|
|
9159
9159
|
return pa = _, pa;
|
|
9160
9160
|
}
|
|
@@ -9165,7 +9165,7 @@ function lh() {
|
|
|
9165
9165
|
}), ba;
|
|
9166
9166
|
}
|
|
9167
9167
|
var ya, Cs;
|
|
9168
|
-
function
|
|
9168
|
+
function qo() {
|
|
9169
9169
|
if (Cs) return ya;
|
|
9170
9170
|
Cs = 1, ya = U;
|
|
9171
9171
|
var n;
|
|
@@ -9180,12 +9180,12 @@ function Do() {
|
|
|
9180
9180
|
function b(Y) {
|
|
9181
9181
|
return y.isBuffer(Y) || Y instanceof s;
|
|
9182
9182
|
}
|
|
9183
|
-
var f =
|
|
9183
|
+
var f = qt(), h;
|
|
9184
9184
|
f && f.debuglog ? h = f.debuglog("stream") : h = function() {
|
|
9185
9185
|
};
|
|
9186
9186
|
var i = sh(), r = e0(), e = t0(), t = e.getHighWaterMark, o = vr().codes, c = o.ERR_INVALID_ARG_TYPE, d = o.ERR_STREAM_PUSH_AFTER_EOF, m = o.ERR_METHOD_NOT_IMPLEMENTED, g = o.ERR_STREAM_UNSHIFT_AFTER_END_EVENT, _, E, I;
|
|
9187
9187
|
at()(U, p);
|
|
9188
|
-
var P = r.errorOrDestroy,
|
|
9188
|
+
var P = r.errorOrDestroy, q = ["error", "close", "destroy", "pause", "resume"];
|
|
9189
9189
|
function L(Y, W, le) {
|
|
9190
9190
|
if (typeof Y.prependListener == "function") return Y.prependListener(W, le);
|
|
9191
9191
|
!Y._events || !Y._events[W] ? Y.on(W, le) : Array.isArray(Y._events[W]) ? Y._events[W].unshift(le) : Y._events[W] = [le, Y._events[W]];
|
|
@@ -9241,7 +9241,7 @@ function Do() {
|
|
|
9241
9241
|
return !me.ended && (me.length < me.highWaterMark || me.length === 0);
|
|
9242
9242
|
}
|
|
9243
9243
|
function R(Y, W, le, ve) {
|
|
9244
|
-
W.flowing && W.length === 0 && !W.sync ? (W.awaitDrain = 0, Y.emit("data", le)) : (W.length += W.objectMode ? 1 : le.length, ve ? W.buffer.unshift(le) : W.buffer.push(le), W.needReadable &&
|
|
9244
|
+
W.flowing && W.length === 0 && !W.sync ? (W.awaitDrain = 0, Y.emit("data", le)) : (W.length += W.objectMode ? 1 : le.length, ve ? W.buffer.unshift(le) : W.buffer.push(le), W.needReadable && D(Y)), O(Y, W);
|
|
9245
9245
|
}
|
|
9246
9246
|
function l(Y, W) {
|
|
9247
9247
|
var le;
|
|
@@ -9268,7 +9268,7 @@ function Do() {
|
|
|
9268
9268
|
h("read", Y), Y = parseInt(Y, 10);
|
|
9269
9269
|
var W = this._readableState, le = Y;
|
|
9270
9270
|
if (Y !== 0 && (W.emittedReadable = !1), Y === 0 && W.needReadable && ((W.highWaterMark !== 0 ? W.length >= W.highWaterMark : W.length > 0) || W.ended))
|
|
9271
|
-
return h("read: emitReadable", W.length, W.ended), W.length === 0 && W.ended ? ne(this) :
|
|
9271
|
+
return h("read: emitReadable", W.length, W.ended), W.length === 0 && W.ended ? ne(this) : D(this), null;
|
|
9272
9272
|
if (Y = w(Y, W), Y === 0 && W.ended)
|
|
9273
9273
|
return W.length === 0 && ne(this), null;
|
|
9274
9274
|
var ve = W.needReadable;
|
|
@@ -9282,10 +9282,10 @@ function Do() {
|
|
|
9282
9282
|
var le = W.decoder.end();
|
|
9283
9283
|
le && le.length && (W.buffer.push(le), W.length += W.objectMode ? 1 : le.length);
|
|
9284
9284
|
}
|
|
9285
|
-
W.ended = !0, W.sync ?
|
|
9285
|
+
W.ended = !0, W.sync ? D(Y) : (W.needReadable = !1, W.emittedReadable || (W.emittedReadable = !0, K(Y)));
|
|
9286
9286
|
}
|
|
9287
9287
|
}
|
|
9288
|
-
function
|
|
9288
|
+
function D(Y) {
|
|
9289
9289
|
var W = Y._readableState;
|
|
9290
9290
|
h("emitReadable", W.needReadable, W.emittedReadable), W.needReadable = !1, W.emittedReadable || (h("emitReadable", W.flowing), W.emittedReadable = !0, ke.nextTick(K, Y));
|
|
9291
9291
|
}
|
|
@@ -9382,7 +9382,7 @@ function Do() {
|
|
|
9382
9382
|
return Pe === -1 ? this : (W.pipes.splice(Pe, 1), W.pipesCount -= 1, W.pipesCount === 1 && (W.pipes = W.pipes[0]), Y.emit("unpipe", this, le), this);
|
|
9383
9383
|
}, U.prototype.on = function(Y, W) {
|
|
9384
9384
|
var le = p.prototype.on.call(this, Y, W), ve = this._readableState;
|
|
9385
|
-
return Y === "data" ? (ve.readableListening = this.listenerCount("readable") > 0, ve.flowing !== !1 && this.resume()) : Y === "readable" && !ve.endEmitted && !ve.readableListening && (ve.readableListening = ve.needReadable = !0, ve.flowing = !1, ve.emittedReadable = !1, h("on readable", ve.length, ve.reading), ve.length ?
|
|
9385
|
+
return Y === "data" ? (ve.readableListening = this.listenerCount("readable") > 0, ve.flowing !== !1 && this.resume()) : Y === "readable" && !ve.endEmitted && !ve.readableListening && (ve.readableListening = ve.needReadable = !0, ve.flowing = !1, ve.emittedReadable = !1, h("on readable", ve.length, ve.reading), ve.length ? D(this) : ve.reading || ke.nextTick(te, this)), le;
|
|
9386
9386
|
}, U.prototype.addListener = U.prototype.on, U.prototype.removeListener = function(Y, W) {
|
|
9387
9387
|
var le = p.prototype.removeListener.call(this, Y, W);
|
|
9388
9388
|
return Y === "readable" && ke.nextTick(G, this), le;
|
|
@@ -9434,8 +9434,8 @@ function Do() {
|
|
|
9434
9434
|
return Y[Oe].apply(Y, arguments);
|
|
9435
9435
|
};
|
|
9436
9436
|
}(Ae));
|
|
9437
|
-
for (var me = 0; me <
|
|
9438
|
-
Y.on(
|
|
9437
|
+
for (var me = 0; me < q.length; me++)
|
|
9438
|
+
Y.on(q[me], this.emit.bind(this, q[me]));
|
|
9439
9439
|
return this._read = function(Pe) {
|
|
9440
9440
|
h("wrapped _read", Pe), ve && (ve = !1, Y.resume());
|
|
9441
9441
|
}, this;
|
|
@@ -9503,7 +9503,7 @@ function Do() {
|
|
|
9503
9503
|
return ya;
|
|
9504
9504
|
}
|
|
9505
9505
|
var ga, Ls;
|
|
9506
|
-
function
|
|
9506
|
+
function Do() {
|
|
9507
9507
|
if (Ls) return ga;
|
|
9508
9508
|
Ls = 1, ga = f;
|
|
9509
9509
|
var n = vr().codes, u = n.ERR_METHOD_NOT_IMPLEMENTED, p = n.ERR_MULTIPLE_CALLBACK, y = n.ERR_TRANSFORM_ALREADY_TRANSFORMING, s = n.ERR_TRANSFORM_WITH_LENGTH_0, a = Qt();
|
|
@@ -9565,7 +9565,7 @@ var va, ks;
|
|
|
9565
9565
|
function r0() {
|
|
9566
9566
|
if (ks) return va;
|
|
9567
9567
|
ks = 1, va = u;
|
|
9568
|
-
var n =
|
|
9568
|
+
var n = Do();
|
|
9569
9569
|
at()(u, n);
|
|
9570
9570
|
function u(p) {
|
|
9571
9571
|
if (!(this instanceof u)) return new u(p);
|
|
@@ -9631,8 +9631,8 @@ function n0() {
|
|
|
9631
9631
|
throw new y("streams");
|
|
9632
9632
|
var m, g = o.map(function(_, E) {
|
|
9633
9633
|
var I = E < o.length - 1, P = E > 0;
|
|
9634
|
-
return f(_, I, P, function(
|
|
9635
|
-
m || (m =
|
|
9634
|
+
return f(_, I, P, function(q) {
|
|
9635
|
+
m || (m = q), q && g.forEach(h), !I && (g.forEach(h), d(m));
|
|
9636
9636
|
});
|
|
9637
9637
|
});
|
|
9638
9638
|
return o.reduce(i);
|
|
@@ -9642,7 +9642,7 @@ function n0() {
|
|
|
9642
9642
|
var js;
|
|
9643
9643
|
function i0() {
|
|
9644
9644
|
return js || (js = 1, function(n, u) {
|
|
9645
|
-
u = n.exports =
|
|
9645
|
+
u = n.exports = qo(), u.Stream = u, u.Readable = u, u.Writable = Oo(), u.Duplex = Qt(), u.Transform = Do(), u.PassThrough = r0(), u.finished = En(), u.pipeline = n0();
|
|
9646
9646
|
}(Jr, Jr.exports)), Jr.exports;
|
|
9647
9647
|
}
|
|
9648
9648
|
var wa, zs;
|
|
@@ -10031,12 +10031,12 @@ function a0() {
|
|
|
10031
10031
|
}
|
|
10032
10032
|
u(r, p), r.prototype._update = function() {
|
|
10033
10033
|
for (var g = y, _ = 0; _ < 16; ++_) g[_] = this._block.readInt32LE(_ * 4);
|
|
10034
|
-
for (var E = this._a | 0, I = this._b | 0, P = this._c | 0,
|
|
10034
|
+
for (var E = this._a | 0, I = this._b | 0, P = this._c | 0, q = this._d | 0, L = this._e | 0, $ = this._a | 0, U = this._b | 0, J = this._c | 0, R = this._d | 0, l = this._e | 0, x = 0; x < 80; x += 1) {
|
|
10035
10035
|
var S, w;
|
|
10036
|
-
x < 16 ? (S = t(E, I, P,
|
|
10036
|
+
x < 16 ? (S = t(E, I, P, q, L, g[s[x]], h[0], b[x]), w = m($, U, J, R, l, g[a[x]], i[0], f[x])) : x < 32 ? (S = o(E, I, P, q, L, g[s[x]], h[1], b[x]), w = d($, U, J, R, l, g[a[x]], i[1], f[x])) : x < 48 ? (S = c(E, I, P, q, L, g[s[x]], h[2], b[x]), w = c($, U, J, R, l, g[a[x]], i[2], f[x])) : x < 64 ? (S = d(E, I, P, q, L, g[s[x]], h[3], b[x]), w = o($, U, J, R, l, g[a[x]], i[3], f[x])) : (S = m(E, I, P, q, L, g[s[x]], h[4], b[x]), w = t($, U, J, R, l, g[a[x]], i[4], f[x])), E = L, L = q, q = e(P, 10), P = I, I = S, $ = l, l = R, R = e(J, 10), J = U, U = w;
|
|
10037
10037
|
}
|
|
10038
10038
|
var M = this._b + P + R | 0;
|
|
10039
|
-
this._b = this._c +
|
|
10039
|
+
this._b = this._c + q + l | 0, this._c = this._d + L + $ | 0, this._d = this._e + E + U | 0, this._e = this._a + I + J | 0, this._a = M;
|
|
10040
10040
|
}, r.prototype._digest = function() {
|
|
10041
10041
|
this._block[this._blockOffset++] = 128, this._blockOffset > 56 && (this._block.fill(0, this._blockOffset, 64), this._update(), this._blockOffset = 0), this._block.fill(0, this._blockOffset, 56), this._block.writeUInt32LE(this._length[0], 56), this._block.writeUInt32LE(this._length[1], 60), this._update();
|
|
10042
10042
|
var g = n.alloc ? n.alloc(20) : new n(20);
|
|
@@ -10045,20 +10045,20 @@ function a0() {
|
|
|
10045
10045
|
function e(g, _) {
|
|
10046
10046
|
return g << _ | g >>> 32 - _;
|
|
10047
10047
|
}
|
|
10048
|
-
function t(g, _, E, I, P,
|
|
10049
|
-
return e(g + (_ ^ E ^ I) +
|
|
10048
|
+
function t(g, _, E, I, P, q, L, $) {
|
|
10049
|
+
return e(g + (_ ^ E ^ I) + q + L | 0, $) + P | 0;
|
|
10050
10050
|
}
|
|
10051
|
-
function o(g, _, E, I, P,
|
|
10052
|
-
return e(g + (_ & E | ~_ & I) +
|
|
10051
|
+
function o(g, _, E, I, P, q, L, $) {
|
|
10052
|
+
return e(g + (_ & E | ~_ & I) + q + L | 0, $) + P | 0;
|
|
10053
10053
|
}
|
|
10054
|
-
function c(g, _, E, I, P,
|
|
10055
|
-
return e(g + ((_ | ~E) ^ I) +
|
|
10054
|
+
function c(g, _, E, I, P, q, L, $) {
|
|
10055
|
+
return e(g + ((_ | ~E) ^ I) + q + L | 0, $) + P | 0;
|
|
10056
10056
|
}
|
|
10057
|
-
function d(g, _, E, I, P,
|
|
10058
|
-
return e(g + (_ & I | E & ~I) +
|
|
10057
|
+
function d(g, _, E, I, P, q, L, $) {
|
|
10058
|
+
return e(g + (_ & I | E & ~I) + q + L | 0, $) + P | 0;
|
|
10059
10059
|
}
|
|
10060
|
-
function m(g, _, E, I, P,
|
|
10061
|
-
return e(g + (_ ^ (E | ~I)) +
|
|
10060
|
+
function m(g, _, E, I, P, q, L, $) {
|
|
10061
|
+
return e(g + (_ ^ (E | ~I)) + q + L | 0, $) + P | 0;
|
|
10062
10062
|
}
|
|
10063
10063
|
return _a = r, _a;
|
|
10064
10064
|
}
|
|
@@ -10715,7 +10715,7 @@ function bh() {
|
|
|
10715
10715
|
}
|
|
10716
10716
|
}, $t;
|
|
10717
10717
|
}
|
|
10718
|
-
const yh = "compressed should be a boolean", gh = "private key should be a Buffer", vh = "private key length is invalid", mh = "private key range is invalid", wh = "tweak out of range or resulting private key is invalid", _h = "tweak out of range", xh = "couldn't export to DER format", Eh = "couldn't import from DER format", Ah = "public keys should be an Array", Sh = "public keys Array should have at least 1 element", Ih = "public key should be a Buffer", Bh = "public key length is invalid", Th = "the public key could not be parsed or is invalid", Rh = "private was invalid, try again", Mh = "tweak out of range or resulting public key is invalid", Ph = "tweak out of range", Fh = "the sum of the public keys is not valid", Oh = "scalar was invalid (zero or overflow)",
|
|
10718
|
+
const yh = "compressed should be a boolean", gh = "private key should be a Buffer", vh = "private key length is invalid", mh = "private key range is invalid", wh = "tweak out of range or resulting private key is invalid", _h = "tweak out of range", xh = "couldn't export to DER format", Eh = "couldn't import from DER format", Ah = "public keys should be an Array", Sh = "public keys Array should have at least 1 element", Ih = "public key should be a Buffer", Bh = "public key length is invalid", Th = "the public key could not be parsed or is invalid", Rh = "private was invalid, try again", Mh = "tweak out of range or resulting public key is invalid", Ph = "tweak out of range", Fh = "the sum of the public keys is not valid", Oh = "scalar was invalid (zero or overflow)", qh = "signature should be a Buffer", Dh = "signature length is invalid", Nh = "couldn't parse signature", Ch = "couldn't parse DER signature", Lh = "nonce generation function failed or private key is invalid", kh = "couldn't recover public key from signature", Uh = "message should be a Buffer", jh = "message length is invalid", zh = "options should be an Object", Hh = "options.data should be a Buffer", Vh = "options.data length is invalid", $h = "options.noncefn should be a Function", Kh = "recovery should be a Number", Gh = "recovery should have value between -1 and 4", Wh = "tweak should be a Buffer", Yh = "tweak length is invalid", o0 = {
|
|
10719
10719
|
COMPRESSED_TYPE_INVALID: yh,
|
|
10720
10720
|
EC_PRIVATE_KEY_TYPE_INVALID: gh,
|
|
10721
10721
|
EC_PRIVATE_KEY_LENGTH_INVALID: vh,
|
|
@@ -10734,8 +10734,8 @@ const yh = "compressed should be a boolean", gh = "private key should be a Buffe
|
|
|
10734
10734
|
EC_PUBLIC_KEY_TWEAK_MUL_FAIL: Ph,
|
|
10735
10735
|
EC_PUBLIC_KEY_COMBINE_FAIL: Fh,
|
|
10736
10736
|
ECDH_FAIL: Oh,
|
|
10737
|
-
ECDSA_SIGNATURE_TYPE_INVALID:
|
|
10738
|
-
ECDSA_SIGNATURE_LENGTH_INVALID:
|
|
10737
|
+
ECDSA_SIGNATURE_TYPE_INVALID: qh,
|
|
10738
|
+
ECDSA_SIGNATURE_LENGTH_INVALID: Dh,
|
|
10739
10739
|
ECDSA_SIGNATURE_PARSE_FAIL: Nh,
|
|
10740
10740
|
ECDSA_SIGNATURE_PARSE_DER_FAIL: Ch,
|
|
10741
10741
|
ECDSA_SIGN_FAIL: Lh,
|
|
@@ -11139,8 +11139,8 @@ function f0() {
|
|
|
11139
11139
|
return (t >>> 17 | t << 15) ^ (t >>> 19 | t << 13) ^ t >>> 10;
|
|
11140
11140
|
}
|
|
11141
11141
|
return a.prototype._update = function(t) {
|
|
11142
|
-
for (var o = this._w, c = this._a | 0, d = this._b | 0, m = this._c | 0, g = this._d | 0, _ = this._e | 0, E = this._f | 0, I = this._g | 0, P = this._h | 0,
|
|
11143
|
-
for (;
|
|
11142
|
+
for (var o = this._w, c = this._a | 0, d = this._b | 0, m = this._c | 0, g = this._d | 0, _ = this._e | 0, E = this._f | 0, I = this._g | 0, P = this._h | 0, q = 0; q < 16; ++q) o[q] = t.readInt32BE(q * 4);
|
|
11143
|
+
for (; q < 64; ++q) o[q] = e(o[q - 2]) + o[q - 7] + r(o[q - 15]) + o[q - 16] | 0;
|
|
11144
11144
|
for (var L = 0; L < 64; ++L) {
|
|
11145
11145
|
var $ = P + i(_) + b(_, E, I) + y[L] + o[L] | 0, U = h(c) + f(c, d, m) | 0;
|
|
11146
11146
|
P = I, I = E, E = _, _ = g + $ | 0, g = m, m = d, d = c, c = $ + U | 0;
|
|
@@ -11366,22 +11366,22 @@ function s0() {
|
|
|
11366
11366
|
return d >>> 0 < m >>> 0 ? 1 : 0;
|
|
11367
11367
|
}
|
|
11368
11368
|
return a.prototype._update = function(d) {
|
|
11369
|
-
for (var m = this._w, g = this._ah | 0, _ = this._bh | 0, E = this._ch | 0, I = this._dh | 0, P = this._eh | 0,
|
|
11370
|
-
m[
|
|
11371
|
-
for (;
|
|
11372
|
-
var K = m[
|
|
11373
|
-
K = m[
|
|
11374
|
-
var G = t(K, O), te = o(O, K), V = m[
|
|
11375
|
-
ne = ne + te | 0, oe = oe + G + c(ne, te) | 0, ne = ne + X | 0, oe = oe + H + c(ne, X) | 0, m[
|
|
11369
|
+
for (var m = this._w, g = this._ah | 0, _ = this._bh | 0, E = this._ch | 0, I = this._dh | 0, P = this._eh | 0, q = this._fh | 0, L = this._gh | 0, $ = this._hh | 0, U = this._al | 0, J = this._bl | 0, R = this._cl | 0, l = this._dl | 0, x = this._el | 0, S = this._fl | 0, w = this._gl | 0, M = this._hl | 0, D = 0; D < 32; D += 2)
|
|
11370
|
+
m[D] = d.readInt32BE(D * 4), m[D + 1] = d.readInt32BE(D * 4 + 4);
|
|
11371
|
+
for (; D < 160; D += 2) {
|
|
11372
|
+
var K = m[D - 30], O = m[D - 15 * 2 + 1], v = r(K, O), k = e(O, K);
|
|
11373
|
+
K = m[D - 2 * 2], O = m[D - 2 * 2 + 1];
|
|
11374
|
+
var G = t(K, O), te = o(O, K), V = m[D - 7 * 2], re = m[D - 7 * 2 + 1], H = m[D - 16 * 2], X = m[D - 16 * 2 + 1], ne = k + re | 0, oe = v + V + c(ne, k) | 0;
|
|
11375
|
+
ne = ne + te | 0, oe = oe + G + c(ne, te) | 0, ne = ne + X | 0, oe = oe + H + c(ne, X) | 0, m[D] = oe, m[D + 1] = ne;
|
|
11376
11376
|
}
|
|
11377
11377
|
for (var ue = 0; ue < 160; ue += 2) {
|
|
11378
11378
|
oe = m[ue], ne = m[ue + 1];
|
|
11379
|
-
var Y = f(g, _, E), W = f(U, J, R), le = h(g, U), ve = h(U, g), Ae = i(P, x), me = i(x, P), Pe = y[ue], Oe = y[ue + 1], pe = b(P,
|
|
11379
|
+
var Y = f(g, _, E), W = f(U, J, R), le = h(g, U), ve = h(U, g), Ae = i(P, x), me = i(x, P), Pe = y[ue], Oe = y[ue + 1], pe = b(P, q, L), Qe = b(x, S, w), Te = M + me | 0, Be = $ + Ae + c(Te, M) | 0;
|
|
11380
11380
|
Te = Te + Qe | 0, Be = Be + pe + c(Te, Qe) | 0, Te = Te + Oe | 0, Be = Be + Pe + c(Te, Oe) | 0, Te = Te + ne | 0, Be = Be + oe + c(Te, ne) | 0;
|
|
11381
11381
|
var Ue = ve + W | 0, ae = le + Y + c(Ue, ve) | 0;
|
|
11382
|
-
$ = L, M = w, L =
|
|
11382
|
+
$ = L, M = w, L = q, w = S, q = P, S = x, x = l + Te | 0, P = I + Be + c(x, l) | 0, I = E, l = R, E = _, R = J, _ = g, J = U, U = Te + Ue | 0, g = Be + ae + c(U, Te) | 0;
|
|
11383
11383
|
}
|
|
11384
|
-
this._al = this._al + U | 0, this._bl = this._bl + J | 0, this._cl = this._cl + R | 0, this._dl = this._dl + l | 0, this._el = this._el + x | 0, this._fl = this._fl + S | 0, this._gl = this._gl + w | 0, this._hl = this._hl + M | 0, this._ah = this._ah + g + c(this._al, U) | 0, this._bh = this._bh + _ + c(this._bl, J) | 0, this._ch = this._ch + E + c(this._cl, R) | 0, this._dh = this._dh + I + c(this._dl, l) | 0, this._eh = this._eh + P + c(this._el, x) | 0, this._fh = this._fh +
|
|
11384
|
+
this._al = this._al + U | 0, this._bl = this._bl + J | 0, this._cl = this._cl + R | 0, this._dl = this._dl + l | 0, this._el = this._el + x | 0, this._fl = this._fl + S | 0, this._gl = this._gl + w | 0, this._hl = this._hl + M | 0, this._ah = this._ah + g + c(this._al, U) | 0, this._bh = this._bh + _ + c(this._bl, J) | 0, this._ch = this._ch + E + c(this._cl, R) | 0, this._dh = this._dh + I + c(this._dl, l) | 0, this._eh = this._eh + P + c(this._el, x) | 0, this._fh = this._fh + q + c(this._fl, S) | 0, this._gh = this._gh + L + c(this._gl, w) | 0, this._hh = this._hh + $ + c(this._hl, M) | 0;
|
|
11385
11385
|
}, a.prototype._hash = function() {
|
|
11386
11386
|
var d = p.allocUnsafe(64);
|
|
11387
11387
|
function m(g, _, E) {
|
|
@@ -11390,9 +11390,9 @@ function s0() {
|
|
|
11390
11390
|
return m(this._ah, this._al, 0), m(this._bh, this._bl, 8), m(this._ch, this._cl, 16), m(this._dh, this._dl, 24), m(this._eh, this._el, 32), m(this._fh, this._fl, 40), m(this._gh, this._gl, 48), m(this._hh, this._hl, 56), d;
|
|
11391
11391
|
}, Oa = a, Oa;
|
|
11392
11392
|
}
|
|
11393
|
-
var
|
|
11393
|
+
var qa, ru;
|
|
11394
11394
|
function rd() {
|
|
11395
|
-
if (ru) return
|
|
11395
|
+
if (ru) return qa;
|
|
11396
11396
|
ru = 1;
|
|
11397
11397
|
var n = at(), u = s0(), p = mr(), y = ht().Buffer, s = new Array(160);
|
|
11398
11398
|
function a() {
|
|
@@ -11406,7 +11406,7 @@ function rd() {
|
|
|
11406
11406
|
b.writeInt32BE(h, r), b.writeInt32BE(i, r + 4);
|
|
11407
11407
|
}
|
|
11408
11408
|
return f(this._ah, this._al, 0), f(this._bh, this._bl, 8), f(this._ch, this._cl, 16), f(this._dh, this._dl, 24), f(this._eh, this._el, 32), f(this._fh, this._fl, 40), b;
|
|
11409
|
-
},
|
|
11409
|
+
}, qa = a, qa;
|
|
11410
11410
|
}
|
|
11411
11411
|
var nu;
|
|
11412
11412
|
function nd() {
|
|
@@ -11420,12 +11420,12 @@ function nd() {
|
|
|
11420
11420
|
};
|
|
11421
11421
|
return n.sha = Xh(), n.sha1 = ed(), n.sha224 = td(), n.sha256 = f0(), n.sha384 = rd(), n.sha512 = s0(), Ba.exports;
|
|
11422
11422
|
}
|
|
11423
|
-
var
|
|
11423
|
+
var Da, iu;
|
|
11424
11424
|
function No() {
|
|
11425
|
-
if (iu) return
|
|
11426
|
-
iu = 1,
|
|
11425
|
+
if (iu) return Da;
|
|
11426
|
+
iu = 1, Da = p;
|
|
11427
11427
|
var n = Fo().EventEmitter, u = at();
|
|
11428
|
-
u(p, n), p.Readable =
|
|
11428
|
+
u(p, n), p.Readable = qo(), p.Writable = Oo(), p.Duplex = Qt(), p.Transform = Do(), p.PassThrough = r0(), p.finished = En(), p.pipeline = n0(), p.Stream = p;
|
|
11429
11429
|
function p() {
|
|
11430
11430
|
n.call(this);
|
|
11431
11431
|
}
|
|
@@ -11455,7 +11455,7 @@ function No() {
|
|
|
11455
11455
|
a.removeListener("data", b), y.removeListener("drain", f), a.removeListener("end", i), a.removeListener("close", r), a.removeListener("error", e), y.removeListener("error", e), a.removeListener("end", t), a.removeListener("close", t), y.removeListener("close", t);
|
|
11456
11456
|
}
|
|
11457
11457
|
return a.on("end", t), a.on("close", t), y.on("close", t), y.emit("pipe", a), y;
|
|
11458
|
-
},
|
|
11458
|
+
}, Da;
|
|
11459
11459
|
}
|
|
11460
11460
|
var Na, au;
|
|
11461
11461
|
function id() {
|
|
@@ -11537,7 +11537,7 @@ function ad() {
|
|
|
11537
11537
|
}, Ca;
|
|
11538
11538
|
}
|
|
11539
11539
|
var hn = { exports: {} }, od = hn.exports, fu;
|
|
11540
|
-
function
|
|
11540
|
+
function Dt() {
|
|
11541
11541
|
return fu || (fu = 1, function(n) {
|
|
11542
11542
|
(function(u, p) {
|
|
11543
11543
|
function y(R, l) {
|
|
@@ -11589,13 +11589,13 @@ function qt() {
|
|
|
11589
11589
|
this.length = Math.ceil(l.length / 3), this.words = new Array(this.length);
|
|
11590
11590
|
for (var w = 0; w < this.length; w++)
|
|
11591
11591
|
this.words[w] = 0;
|
|
11592
|
-
var M,
|
|
11592
|
+
var M, D, K = 0;
|
|
11593
11593
|
if (S === "be")
|
|
11594
11594
|
for (w = l.length - 1, M = 0; w >= 0; w -= 3)
|
|
11595
|
-
|
|
11595
|
+
D = l[w] | l[w - 1] << 8 | l[w - 2] << 16, this.words[M] |= D << K & 67108863, this.words[M + 1] = D >>> 26 - K & 67108863, K += 24, K >= 26 && (K -= 26, M++);
|
|
11596
11596
|
else if (S === "le")
|
|
11597
11597
|
for (w = 0, M = 0; w < l.length; w += 3)
|
|
11598
|
-
|
|
11598
|
+
D = l[w] | l[w + 1] << 8 | l[w + 2] << 16, this.words[M] |= D << K & 67108863, this.words[M + 1] = D >>> 26 - K & 67108863, K += 24, K >= 26 && (K -= 26, M++);
|
|
11599
11599
|
return this.strip();
|
|
11600
11600
|
};
|
|
11601
11601
|
function f(R, l) {
|
|
@@ -11610,20 +11610,20 @@ function qt() {
|
|
|
11610
11610
|
this.length = Math.ceil((l.length - x) / 6), this.words = new Array(this.length);
|
|
11611
11611
|
for (var w = 0; w < this.length; w++)
|
|
11612
11612
|
this.words[w] = 0;
|
|
11613
|
-
var M = 0,
|
|
11613
|
+
var M = 0, D = 0, K;
|
|
11614
11614
|
if (S === "be")
|
|
11615
11615
|
for (w = l.length - 1; w >= x; w -= 2)
|
|
11616
|
-
K = h(l, x, w) << M, this.words[
|
|
11616
|
+
K = h(l, x, w) << M, this.words[D] |= K & 67108863, M >= 18 ? (M -= 18, D += 1, this.words[D] |= K >>> 26) : M += 8;
|
|
11617
11617
|
else {
|
|
11618
11618
|
var O = l.length - x;
|
|
11619
11619
|
for (w = O % 2 === 0 ? x + 1 : x; w < l.length; w += 2)
|
|
11620
|
-
K = h(l, x, w) << M, this.words[
|
|
11620
|
+
K = h(l, x, w) << M, this.words[D] |= K & 67108863, M >= 18 ? (M -= 18, D += 1, this.words[D] |= K >>> 26) : M += 8;
|
|
11621
11621
|
}
|
|
11622
11622
|
this.strip();
|
|
11623
11623
|
};
|
|
11624
11624
|
function i(R, l, x, S) {
|
|
11625
|
-
for (var w = 0, M = Math.min(R.length, x),
|
|
11626
|
-
var K = R.charCodeAt(
|
|
11625
|
+
for (var w = 0, M = Math.min(R.length, x), D = l; D < M; D++) {
|
|
11626
|
+
var K = R.charCodeAt(D) - 48;
|
|
11627
11627
|
w *= S, K >= 49 ? w += K - 49 + 10 : K >= 17 ? w += K - 17 + 10 : w += K;
|
|
11628
11628
|
}
|
|
11629
11629
|
return w;
|
|
@@ -11633,7 +11633,7 @@ function qt() {
|
|
|
11633
11633
|
for (var w = 0, M = 1; M <= 67108863; M *= x)
|
|
11634
11634
|
w++;
|
|
11635
11635
|
w--, M = M / x | 0;
|
|
11636
|
-
for (var
|
|
11636
|
+
for (var D = l.length - S, K = D % w, O = Math.min(D, D - K) + S, v = 0, k = S; k < O; k += w)
|
|
11637
11637
|
v = i(l, k, k + w, x), this.imuln(M), this.words[0] + v < 67108864 ? this.words[0] += v : this._iaddn(v);
|
|
11638
11638
|
if (K !== 0) {
|
|
11639
11639
|
var G = 1;
|
|
@@ -11772,9 +11772,9 @@ function qt() {
|
|
|
11772
11772
|
var S;
|
|
11773
11773
|
if (l === 16 || l === "hex") {
|
|
11774
11774
|
S = "";
|
|
11775
|
-
for (var w = 0, M = 0,
|
|
11776
|
-
var K = this.words[
|
|
11777
|
-
M = K >>> 24 - w & 16777215, w += 2, w >= 26 && (w -= 26,
|
|
11775
|
+
for (var w = 0, M = 0, D = 0; D < this.length; D++) {
|
|
11776
|
+
var K = this.words[D], O = ((K << w | M) & 16777215).toString(16);
|
|
11777
|
+
M = K >>> 24 - w & 16777215, w += 2, w >= 26 && (w -= 26, D--), M !== 0 || D !== this.length - 1 ? S = r[6 - O.length] + O + S : S = O + S;
|
|
11778
11778
|
}
|
|
11779
11779
|
for (M !== 0 && (S = M.toString(16) + S); S.length % x !== 0; )
|
|
11780
11780
|
S = "0" + S;
|
|
@@ -11805,8 +11805,8 @@ function qt() {
|
|
|
11805
11805
|
}, a.prototype.toArrayLike = function(l, x, S) {
|
|
11806
11806
|
var w = this.byteLength(), M = S || Math.max(1, w);
|
|
11807
11807
|
y(w <= M, "byte array longer than desired length"), y(M > 0, "Requested array length <= 0"), this.strip();
|
|
11808
|
-
var
|
|
11809
|
-
if (
|
|
11808
|
+
var D = x === "le", K = new l(M), O, v, k = this.clone();
|
|
11809
|
+
if (D) {
|
|
11810
11810
|
for (v = 0; !k.isZero(); v++)
|
|
11811
11811
|
O = k.andln(255), k.iushrn(8), K[v] = O;
|
|
11812
11812
|
for (; v < M; v++)
|
|
@@ -11917,15 +11917,15 @@ function qt() {
|
|
|
11917
11917
|
return l.negative = 0, x = this.isub(l), l.negative = 1, x._normSign();
|
|
11918
11918
|
var S, w;
|
|
11919
11919
|
this.length > l.length ? (S = this, w = l) : (S = l, w = this);
|
|
11920
|
-
for (var M = 0,
|
|
11921
|
-
x = (S.words[
|
|
11922
|
-
for (; M !== 0 &&
|
|
11923
|
-
x = (S.words[
|
|
11920
|
+
for (var M = 0, D = 0; D < w.length; D++)
|
|
11921
|
+
x = (S.words[D] | 0) + (w.words[D] | 0) + M, this.words[D] = x & 67108863, M = x >>> 26;
|
|
11922
|
+
for (; M !== 0 && D < S.length; D++)
|
|
11923
|
+
x = (S.words[D] | 0) + M, this.words[D] = x & 67108863, M = x >>> 26;
|
|
11924
11924
|
if (this.length = S.length, M !== 0)
|
|
11925
11925
|
this.words[this.length] = M, this.length++;
|
|
11926
11926
|
else if (S !== this)
|
|
11927
|
-
for (;
|
|
11928
|
-
this.words[
|
|
11927
|
+
for (; D < S.length; D++)
|
|
11928
|
+
this.words[D] = S.words[D];
|
|
11929
11929
|
return this;
|
|
11930
11930
|
}, a.prototype.add = function(l) {
|
|
11931
11931
|
var x;
|
|
@@ -11942,11 +11942,11 @@ function qt() {
|
|
|
11942
11942
|
return this.negative = 0, this.length = 1, this.words[0] = 0, this;
|
|
11943
11943
|
var w, M;
|
|
11944
11944
|
S > 0 ? (w = this, M = l) : (w = l, M = this);
|
|
11945
|
-
for (var
|
|
11946
|
-
x = (w.words[K] | 0) - (M.words[K] | 0) +
|
|
11947
|
-
for (;
|
|
11948
|
-
x = (w.words[K] | 0) +
|
|
11949
|
-
if (
|
|
11945
|
+
for (var D = 0, K = 0; K < M.length; K++)
|
|
11946
|
+
x = (w.words[K] | 0) - (M.words[K] | 0) + D, D = x >> 26, this.words[K] = x & 67108863;
|
|
11947
|
+
for (; D !== 0 && K < w.length; K++)
|
|
11948
|
+
x = (w.words[K] | 0) + D, D = x >> 26, this.words[K] = x & 67108863;
|
|
11949
|
+
if (D === 0 && K < w.length && w !== this)
|
|
11950
11950
|
for (; K < w.length; K++)
|
|
11951
11951
|
this.words[K] = w.words[K];
|
|
11952
11952
|
return this.length = Math.max(this.length, K), w !== this && (this.negative = 1), this.strip();
|
|
@@ -11957,19 +11957,19 @@ function qt() {
|
|
|
11957
11957
|
x.negative = l.negative ^ R.negative;
|
|
11958
11958
|
var S = R.length + l.length | 0;
|
|
11959
11959
|
x.length = S, S = S - 1 | 0;
|
|
11960
|
-
var w = R.words[0] | 0, M = l.words[0] | 0,
|
|
11960
|
+
var w = R.words[0] | 0, M = l.words[0] | 0, D = w * M, K = D & 67108863, O = D / 67108864 | 0;
|
|
11961
11961
|
x.words[0] = K;
|
|
11962
11962
|
for (var v = 1; v < S; v++) {
|
|
11963
11963
|
for (var k = O >>> 26, G = O & 67108863, te = Math.min(v, l.length - 1), V = Math.max(0, v - R.length + 1); V <= te; V++) {
|
|
11964
11964
|
var re = v - V | 0;
|
|
11965
|
-
w = R.words[re] | 0, M = l.words[V] | 0,
|
|
11965
|
+
w = R.words[re] | 0, M = l.words[V] | 0, D = w * M + G, k += D / 67108864 | 0, G = D & 67108863;
|
|
11966
11966
|
}
|
|
11967
11967
|
x.words[v] = G | 0, O = k | 0;
|
|
11968
11968
|
}
|
|
11969
11969
|
return O !== 0 ? x.words[v] = O | 0 : x.length--, x.strip();
|
|
11970
11970
|
}
|
|
11971
11971
|
var d = function(l, x, S) {
|
|
11972
|
-
var w = l.words, M = x.words,
|
|
11972
|
+
var w = l.words, M = x.words, D = S.words, K = 0, O, v, k, G = w[0] | 0, te = G & 8191, V = G >>> 13, re = w[1] | 0, H = re & 8191, X = re >>> 13, ne = w[2] | 0, oe = ne & 8191, ue = ne >>> 13, Y = w[3] | 0, W = Y & 8191, le = Y >>> 13, ve = w[4] | 0, Ae = ve & 8191, me = ve >>> 13, Pe = w[5] | 0, Oe = Pe & 8191, pe = Pe >>> 13, Qe = w[6] | 0, Te = Qe & 8191, Be = Qe >>> 13, Ue = w[7] | 0, ae = Ue & 8191, se = Ue >>> 13, _e = w[8] | 0, xe = _e & 8191, we = _e >>> 13, Ce = w[9] | 0, C = Ce & 8191, A = Ce >>> 13, T = M[0] | 0, Z = T & 8191, ie = T >>> 13, de = M[1] | 0, ye = de & 8191, Re = de >>> 13, Ve = M[2] | 0, De = Ve & 8191, je = Ve >>> 13, We = M[3] | 0, rt = We & 8191, Ye = We >>> 13, jt = M[4] | 0, it = jt & 8191, Ze = jt >>> 13, tr = M[5] | 0, z = tr & 8191, B = tr >>> 13, F = M[6] | 0, ee = F & 8191, fe = F >>> 13, be = M[7] | 0, ge = be & 8191, Fe = be >>> 13, nt = M[8] | 0, Le = nt & 8191, ze = nt >>> 13, Je = M[9] | 0, ot = Je & 8191, ft = Je >>> 13;
|
|
11973
11973
|
S.negative = l.negative ^ x.negative, S.length = 19, O = Math.imul(te, Z), v = Math.imul(te, ie), v = v + Math.imul(V, Z) | 0, k = Math.imul(V, ie);
|
|
11974
11974
|
var _r = (K + O | 0) + ((v & 8191) << 13) | 0;
|
|
11975
11975
|
K = (k + (v >>> 13) | 0) + (_r >>> 26) | 0, _r &= 67108863, O = Math.imul(H, Z), v = Math.imul(H, ie), v = v + Math.imul(X, Z) | 0, k = Math.imul(X, ie), O = O + Math.imul(te, ye) | 0, v = v + Math.imul(te, Re) | 0, v = v + Math.imul(V, ye) | 0, k = k + Math.imul(V, Re) | 0;
|
|
@@ -12001,26 +12001,26 @@ function qt() {
|
|
|
12001
12001
|
K = (k + (v >>> 13) | 0) + (Fr >>> 26) | 0, Fr &= 67108863, O = Math.imul(C, z), v = Math.imul(C, B), v = v + Math.imul(A, z) | 0, k = Math.imul(A, B), O = O + Math.imul(xe, ee) | 0, v = v + Math.imul(xe, fe) | 0, v = v + Math.imul(we, ee) | 0, k = k + Math.imul(we, fe) | 0, O = O + Math.imul(ae, ge) | 0, v = v + Math.imul(ae, Fe) | 0, v = v + Math.imul(se, ge) | 0, k = k + Math.imul(se, Fe) | 0, O = O + Math.imul(Te, Le) | 0, v = v + Math.imul(Te, ze) | 0, v = v + Math.imul(Be, Le) | 0, k = k + Math.imul(Be, ze) | 0, O = O + Math.imul(Oe, ot) | 0, v = v + Math.imul(Oe, ft) | 0, v = v + Math.imul(pe, ot) | 0, k = k + Math.imul(pe, ft) | 0;
|
|
12002
12002
|
var Or = (K + O | 0) + ((v & 8191) << 13) | 0;
|
|
12003
12003
|
K = (k + (v >>> 13) | 0) + (Or >>> 26) | 0, Or &= 67108863, O = Math.imul(C, ee), v = Math.imul(C, fe), v = v + Math.imul(A, ee) | 0, k = Math.imul(A, fe), O = O + Math.imul(xe, ge) | 0, v = v + Math.imul(xe, Fe) | 0, v = v + Math.imul(we, ge) | 0, k = k + Math.imul(we, Fe) | 0, O = O + Math.imul(ae, Le) | 0, v = v + Math.imul(ae, ze) | 0, v = v + Math.imul(se, Le) | 0, k = k + Math.imul(se, ze) | 0, O = O + Math.imul(Te, ot) | 0, v = v + Math.imul(Te, ft) | 0, v = v + Math.imul(Be, ot) | 0, k = k + Math.imul(Be, ft) | 0;
|
|
12004
|
-
var
|
|
12005
|
-
K = (k + (v >>> 13) | 0) + (
|
|
12004
|
+
var qr = (K + O | 0) + ((v & 8191) << 13) | 0;
|
|
12005
|
+
K = (k + (v >>> 13) | 0) + (qr >>> 26) | 0, qr &= 67108863, O = Math.imul(C, ge), v = Math.imul(C, Fe), v = v + Math.imul(A, ge) | 0, k = Math.imul(A, Fe), O = O + Math.imul(xe, Le) | 0, v = v + Math.imul(xe, ze) | 0, v = v + Math.imul(we, Le) | 0, k = k + Math.imul(we, ze) | 0, O = O + Math.imul(ae, ot) | 0, v = v + Math.imul(ae, ft) | 0, v = v + Math.imul(se, ot) | 0, k = k + Math.imul(se, ft) | 0;
|
|
12006
12006
|
var N = (K + O | 0) + ((v & 8191) << 13) | 0;
|
|
12007
12007
|
K = (k + (v >>> 13) | 0) + (N >>> 26) | 0, N &= 67108863, O = Math.imul(C, Le), v = Math.imul(C, ze), v = v + Math.imul(A, Le) | 0, k = Math.imul(A, ze), O = O + Math.imul(xe, ot) | 0, v = v + Math.imul(xe, ft) | 0, v = v + Math.imul(we, ot) | 0, k = k + Math.imul(we, ft) | 0;
|
|
12008
12008
|
var j = (K + O | 0) + ((v & 8191) << 13) | 0;
|
|
12009
12009
|
K = (k + (v >>> 13) | 0) + (j >>> 26) | 0, j &= 67108863, O = Math.imul(C, ot), v = Math.imul(C, ft), v = v + Math.imul(A, ot) | 0, k = Math.imul(A, ft);
|
|
12010
12010
|
var Q = (K + O | 0) + ((v & 8191) << 13) | 0;
|
|
12011
|
-
return K = (k + (v >>> 13) | 0) + (Q >>> 26) | 0, Q &= 67108863,
|
|
12011
|
+
return K = (k + (v >>> 13) | 0) + (Q >>> 26) | 0, Q &= 67108863, D[0] = _r, D[1] = xr, D[2] = Tt, D[3] = Er, D[4] = Ar, D[5] = Sr, D[6] = Ir, D[7] = Br, D[8] = Tr, D[9] = Rr, D[10] = Mr, D[11] = Pr, D[12] = ct, D[13] = Fr, D[14] = Or, D[15] = qr, D[16] = N, D[17] = j, D[18] = Q, K !== 0 && (D[19] = K, S.length++), S;
|
|
12012
12012
|
};
|
|
12013
12013
|
Math.imul || (d = c);
|
|
12014
12014
|
function m(R, l, x) {
|
|
12015
12015
|
x.negative = l.negative ^ R.negative, x.length = R.length + l.length;
|
|
12016
12016
|
for (var S = 0, w = 0, M = 0; M < x.length - 1; M++) {
|
|
12017
|
-
var
|
|
12017
|
+
var D = w;
|
|
12018
12018
|
w = 0;
|
|
12019
12019
|
for (var K = S & 67108863, O = Math.min(M, l.length - 1), v = Math.max(0, M - R.length + 1); v <= O; v++) {
|
|
12020
12020
|
var k = M - v, G = R.words[k] | 0, te = l.words[v] | 0, V = G * te, re = V & 67108863;
|
|
12021
|
-
|
|
12021
|
+
D = D + (V / 67108864 | 0) | 0, re = re + K | 0, K = re & 67108863, D = D + (re >>> 26) | 0, w += D >>> 26, D &= 67108863;
|
|
12022
12022
|
}
|
|
12023
|
-
x.words[M] = K, S =
|
|
12023
|
+
x.words[M] = K, S = D, D = w;
|
|
12024
12024
|
}
|
|
12025
12025
|
return S !== 0 ? x.words[M] = S : x.length--, x.strip();
|
|
12026
12026
|
}
|
|
@@ -12044,11 +12044,11 @@ function qt() {
|
|
|
12044
12044
|
for (var w = 0, M = 0; M < x; M++)
|
|
12045
12045
|
w |= (l & 1) << x - M - 1, l >>= 1;
|
|
12046
12046
|
return w;
|
|
12047
|
-
}, _.prototype.permute = function(l, x, S, w, M,
|
|
12048
|
-
for (var K = 0; K <
|
|
12047
|
+
}, _.prototype.permute = function(l, x, S, w, M, D) {
|
|
12048
|
+
for (var K = 0; K < D; K++)
|
|
12049
12049
|
w[K] = x[l[K]], M[K] = S[l[K]];
|
|
12050
|
-
}, _.prototype.transform = function(l, x, S, w, M,
|
|
12051
|
-
this.permute(
|
|
12050
|
+
}, _.prototype.transform = function(l, x, S, w, M, D) {
|
|
12051
|
+
this.permute(D, l, x, S, w, M);
|
|
12052
12052
|
for (var K = 1; K < M; K <<= 1)
|
|
12053
12053
|
for (var O = K << 1, v = Math.cos(2 * Math.PI / O), k = Math.sin(2 * Math.PI / O), G = 0; G < M; G += O)
|
|
12054
12054
|
for (var te = v, V = k, re = 0; re < K; re++) {
|
|
@@ -12073,23 +12073,23 @@ function qt() {
|
|
|
12073
12073
|
}
|
|
12074
12074
|
return l;
|
|
12075
12075
|
}, _.prototype.convert13b = function(l, x, S, w) {
|
|
12076
|
-
for (var M = 0,
|
|
12077
|
-
M = M + (l[
|
|
12078
|
-
for (
|
|
12079
|
-
S[
|
|
12076
|
+
for (var M = 0, D = 0; D < x; D++)
|
|
12077
|
+
M = M + (l[D] | 0), S[2 * D] = M & 8191, M = M >>> 13, S[2 * D + 1] = M & 8191, M = M >>> 13;
|
|
12078
|
+
for (D = 2 * x; D < w; ++D)
|
|
12079
|
+
S[D] = 0;
|
|
12080
12080
|
y(M === 0), y((M & -8192) === 0);
|
|
12081
12081
|
}, _.prototype.stub = function(l) {
|
|
12082
12082
|
for (var x = new Array(l), S = 0; S < l; S++)
|
|
12083
12083
|
x[S] = 0;
|
|
12084
12084
|
return x;
|
|
12085
12085
|
}, _.prototype.mulp = function(l, x, S) {
|
|
12086
|
-
var w = 2 * this.guessLen13b(l.length, x.length), M = this.makeRBT(w),
|
|
12087
|
-
V.length = w, this.convert13b(l.words, l.length, K, w), this.convert13b(x.words, x.length, k, w), this.transform(K,
|
|
12086
|
+
var w = 2 * this.guessLen13b(l.length, x.length), M = this.makeRBT(w), D = this.stub(w), K = new Array(w), O = new Array(w), v = new Array(w), k = new Array(w), G = new Array(w), te = new Array(w), V = S.words;
|
|
12087
|
+
V.length = w, this.convert13b(l.words, l.length, K, w), this.convert13b(x.words, x.length, k, w), this.transform(K, D, O, v, w, M), this.transform(k, D, G, te, w, M);
|
|
12088
12088
|
for (var re = 0; re < w; re++) {
|
|
12089
12089
|
var H = O[re] * G[re] - v[re] * te[re];
|
|
12090
12090
|
v[re] = O[re] * te[re] + v[re] * G[re], O[re] = H;
|
|
12091
12091
|
}
|
|
12092
|
-
return this.conjugate(O, v, w), this.transform(O, v, V,
|
|
12092
|
+
return this.conjugate(O, v, w), this.transform(O, v, V, D, w, M), this.conjugate(V, D, w), this.normalize13b(V, w), S.negative = l.negative ^ x.negative, S.length = l.length + x.length, S.strip();
|
|
12093
12093
|
}, a.prototype.mul = function(l) {
|
|
12094
12094
|
var x = new a(null);
|
|
12095
12095
|
return x.words = new Array(this.length + l.length), this.mulTo(l, x);
|
|
@@ -12124,12 +12124,12 @@ function qt() {
|
|
|
12124
12124
|
y(typeof l == "number" && l >= 0);
|
|
12125
12125
|
var x = l % 26, S = (l - x) / 26, w = 67108863 >>> 26 - x << 26 - x, M;
|
|
12126
12126
|
if (x !== 0) {
|
|
12127
|
-
var
|
|
12127
|
+
var D = 0;
|
|
12128
12128
|
for (M = 0; M < this.length; M++) {
|
|
12129
12129
|
var K = this.words[M] & w, O = (this.words[M] | 0) - K << x;
|
|
12130
|
-
this.words[M] = O |
|
|
12130
|
+
this.words[M] = O | D, D = K >>> 26 - x;
|
|
12131
12131
|
}
|
|
12132
|
-
|
|
12132
|
+
D && (this.words[M] = D, this.length++);
|
|
12133
12133
|
}
|
|
12134
12134
|
if (S !== 0) {
|
|
12135
12135
|
for (M = this.length - 1; M >= 0; M--)
|
|
@@ -12145,15 +12145,15 @@ function qt() {
|
|
|
12145
12145
|
y(typeof l == "number" && l >= 0);
|
|
12146
12146
|
var w;
|
|
12147
12147
|
x ? w = (x - x % 26) / 26 : w = 0;
|
|
12148
|
-
var M = l % 26,
|
|
12149
|
-
if (w -=
|
|
12150
|
-
for (var v = 0; v <
|
|
12148
|
+
var M = l % 26, D = Math.min((l - M) / 26, this.length), K = 67108863 ^ 67108863 >>> M << M, O = S;
|
|
12149
|
+
if (w -= D, w = Math.max(0, w), O) {
|
|
12150
|
+
for (var v = 0; v < D; v++)
|
|
12151
12151
|
O.words[v] = this.words[v];
|
|
12152
|
-
O.length =
|
|
12152
|
+
O.length = D;
|
|
12153
12153
|
}
|
|
12154
|
-
if (
|
|
12155
|
-
for (this.length -=
|
|
12156
|
-
this.words[v] = this.words[v +
|
|
12154
|
+
if (D !== 0) if (this.length > D)
|
|
12155
|
+
for (this.length -= D, v = 0; v < this.length; v++)
|
|
12156
|
+
this.words[v] = this.words[v + D];
|
|
12157
12157
|
else
|
|
12158
12158
|
this.words[0] = 0, this.length = 1;
|
|
12159
12159
|
var k = 0;
|
|
@@ -12218,21 +12218,21 @@ function qt() {
|
|
|
12218
12218
|
}, a.prototype._ishlnsubmul = function(l, x, S) {
|
|
12219
12219
|
var w = l.length + S, M;
|
|
12220
12220
|
this._expand(w);
|
|
12221
|
-
var
|
|
12221
|
+
var D, K = 0;
|
|
12222
12222
|
for (M = 0; M < l.length; M++) {
|
|
12223
|
-
|
|
12223
|
+
D = (this.words[M + S] | 0) + K;
|
|
12224
12224
|
var O = (l.words[M] | 0) * x;
|
|
12225
|
-
|
|
12225
|
+
D -= O & 67108863, K = (D >> 26) - (O / 67108864 | 0), this.words[M + S] = D & 67108863;
|
|
12226
12226
|
}
|
|
12227
12227
|
for (; M < this.length - S; M++)
|
|
12228
|
-
|
|
12228
|
+
D = (this.words[M + S] | 0) + K, K = D >> 26, this.words[M + S] = D & 67108863;
|
|
12229
12229
|
if (K === 0) return this.strip();
|
|
12230
12230
|
for (y(K === -1), K = 0, M = 0; M < this.length; M++)
|
|
12231
|
-
|
|
12231
|
+
D = -(this.words[M] | 0) + K, K = D >> 26, this.words[M] = D & 67108863;
|
|
12232
12232
|
return this.negative = 1, this.strip();
|
|
12233
12233
|
}, a.prototype._wordDiv = function(l, x) {
|
|
12234
|
-
var S = this.length - l.length, w = this.clone(), M = l,
|
|
12235
|
-
S = 26 - K, S !== 0 && (M = M.ushln(S), w.iushln(S),
|
|
12234
|
+
var S = this.length - l.length, w = this.clone(), M = l, D = M.words[M.length - 1] | 0, K = this._countBits(D);
|
|
12235
|
+
S = 26 - K, S !== 0 && (M = M.ushln(S), w.iushln(S), D = M.words[M.length - 1] | 0);
|
|
12236
12236
|
var O = w.length - M.length, v;
|
|
12237
12237
|
if (x !== "mod") {
|
|
12238
12238
|
v = new a(null), v.length = O + 1, v.words = new Array(v.length);
|
|
@@ -12243,7 +12243,7 @@ function qt() {
|
|
|
12243
12243
|
G.negative === 0 && (w = G, v && (v.words[O] = 1));
|
|
12244
12244
|
for (var te = O - 1; te >= 0; te--) {
|
|
12245
12245
|
var V = (w.words[M.length + te] | 0) * 67108864 + (w.words[M.length + te - 1] | 0);
|
|
12246
|
-
for (V = Math.min(V /
|
|
12246
|
+
for (V = Math.min(V / D | 0, 67108863), w._ishlnsubmul(M, V, te); w.negative !== 0; )
|
|
12247
12247
|
V--, w.negative = 0, w._ishlnsubmul(M, 1, te), w.isZero() || (w.negative ^= 1);
|
|
12248
12248
|
v && (v.words[te] = V);
|
|
12249
12249
|
}
|
|
@@ -12257,15 +12257,15 @@ function qt() {
|
|
|
12257
12257
|
div: new a(0),
|
|
12258
12258
|
mod: new a(0)
|
|
12259
12259
|
};
|
|
12260
|
-
var w, M,
|
|
12261
|
-
return this.negative !== 0 && l.negative === 0 ? (
|
|
12260
|
+
var w, M, D;
|
|
12261
|
+
return this.negative !== 0 && l.negative === 0 ? (D = this.neg().divmod(l, x), x !== "mod" && (w = D.div.neg()), x !== "div" && (M = D.mod.neg(), S && M.negative !== 0 && M.iadd(l)), {
|
|
12262
12262
|
div: w,
|
|
12263
12263
|
mod: M
|
|
12264
|
-
}) : this.negative === 0 && l.negative !== 0 ? (
|
|
12264
|
+
}) : this.negative === 0 && l.negative !== 0 ? (D = this.divmod(l.neg(), x), x !== "mod" && (w = D.div.neg()), {
|
|
12265
12265
|
div: w,
|
|
12266
|
-
mod:
|
|
12267
|
-
}) : (this.negative & l.negative) !== 0 ? (
|
|
12268
|
-
div:
|
|
12266
|
+
mod: D.mod
|
|
12267
|
+
}) : (this.negative & l.negative) !== 0 ? (D = this.neg().divmod(l.neg(), x), x !== "div" && (M = D.mod.neg(), S && M.negative !== 0 && M.isub(l)), {
|
|
12268
|
+
div: D.div,
|
|
12269
12269
|
mod: M
|
|
12270
12270
|
}) : l.length > this.length || this.cmp(l) < 0 ? {
|
|
12271
12271
|
div: new a(0),
|
|
@@ -12289,8 +12289,8 @@ function qt() {
|
|
|
12289
12289
|
}, a.prototype.divRound = function(l) {
|
|
12290
12290
|
var x = this.divmod(l);
|
|
12291
12291
|
if (x.mod.isZero()) return x.div;
|
|
12292
|
-
var S = x.div.negative !== 0 ? x.mod.isub(l) : x.mod, w = l.ushrn(1), M = l.andln(1),
|
|
12293
|
-
return
|
|
12292
|
+
var S = x.div.negative !== 0 ? x.mod.isub(l) : x.mod, w = l.ushrn(1), M = l.andln(1), D = S.cmp(w);
|
|
12293
|
+
return D < 0 || M === 1 && D === 0 ? x.div : x.div.negative !== 0 ? x.div.isubn(1) : x.div.iaddn(1);
|
|
12294
12294
|
}, a.prototype.modn = function(l) {
|
|
12295
12295
|
y(l <= 67108863);
|
|
12296
12296
|
for (var x = (1 << 26) % l, S = 0, w = this.length - 1; w >= 0; w--)
|
|
@@ -12309,7 +12309,7 @@ function qt() {
|
|
|
12309
12309
|
y(l.negative === 0), y(!l.isZero());
|
|
12310
12310
|
var x = this, S = l.clone();
|
|
12311
12311
|
x.negative !== 0 ? x = x.umod(l) : x = x.clone();
|
|
12312
|
-
for (var w = new a(1), M = new a(0),
|
|
12312
|
+
for (var w = new a(1), M = new a(0), D = new a(0), K = new a(1), O = 0; x.isEven() && S.isEven(); )
|
|
12313
12313
|
x.iushrn(1), S.iushrn(1), ++O;
|
|
12314
12314
|
for (var v = S.clone(), k = x.clone(); !x.isZero(); ) {
|
|
12315
12315
|
for (var G = 0, te = 1; (x.words[0] & te) === 0 && G < 26; ++G, te <<= 1) ;
|
|
@@ -12319,11 +12319,11 @@ function qt() {
|
|
|
12319
12319
|
for (var V = 0, re = 1; (S.words[0] & re) === 0 && V < 26; ++V, re <<= 1) ;
|
|
12320
12320
|
if (V > 0)
|
|
12321
12321
|
for (S.iushrn(V); V-- > 0; )
|
|
12322
|
-
(
|
|
12323
|
-
x.cmp(S) >= 0 ? (x.isub(S), w.isub(
|
|
12322
|
+
(D.isOdd() || K.isOdd()) && (D.iadd(v), K.isub(k)), D.iushrn(1), K.iushrn(1);
|
|
12323
|
+
x.cmp(S) >= 0 ? (x.isub(S), w.isub(D), M.isub(K)) : (S.isub(x), D.isub(w), K.isub(M));
|
|
12324
12324
|
}
|
|
12325
12325
|
return {
|
|
12326
|
-
a:
|
|
12326
|
+
a: D,
|
|
12327
12327
|
b: K,
|
|
12328
12328
|
gcd: S.iushln(O)
|
|
12329
12329
|
};
|
|
@@ -12331,15 +12331,15 @@ function qt() {
|
|
|
12331
12331
|
y(l.negative === 0), y(!l.isZero());
|
|
12332
12332
|
var x = this, S = l.clone();
|
|
12333
12333
|
x.negative !== 0 ? x = x.umod(l) : x = x.clone();
|
|
12334
|
-
for (var w = new a(1), M = new a(0),
|
|
12334
|
+
for (var w = new a(1), M = new a(0), D = S.clone(); x.cmpn(1) > 0 && S.cmpn(1) > 0; ) {
|
|
12335
12335
|
for (var K = 0, O = 1; (x.words[0] & O) === 0 && K < 26; ++K, O <<= 1) ;
|
|
12336
12336
|
if (K > 0)
|
|
12337
12337
|
for (x.iushrn(K); K-- > 0; )
|
|
12338
|
-
w.isOdd() && w.iadd(
|
|
12338
|
+
w.isOdd() && w.iadd(D), w.iushrn(1);
|
|
12339
12339
|
for (var v = 0, k = 1; (S.words[0] & k) === 0 && v < 26; ++v, k <<= 1) ;
|
|
12340
12340
|
if (v > 0)
|
|
12341
12341
|
for (S.iushrn(v); v-- > 0; )
|
|
12342
|
-
M.isOdd() && M.iadd(
|
|
12342
|
+
M.isOdd() && M.iadd(D), M.iushrn(1);
|
|
12343
12343
|
x.cmp(S) >= 0 ? (x.isub(S), w.isub(M)) : (S.isub(x), M.isub(w));
|
|
12344
12344
|
}
|
|
12345
12345
|
var G;
|
|
@@ -12358,8 +12358,8 @@ function qt() {
|
|
|
12358
12358
|
S.iushrn(1);
|
|
12359
12359
|
var M = x.cmp(S);
|
|
12360
12360
|
if (M < 0) {
|
|
12361
|
-
var
|
|
12362
|
-
x = S, S =
|
|
12361
|
+
var D = x;
|
|
12362
|
+
x = S, S = D;
|
|
12363
12363
|
} else if (M === 0 || S.cmpn(1) === 0)
|
|
12364
12364
|
break;
|
|
12365
12365
|
x.isub(S);
|
|
@@ -12378,11 +12378,11 @@ function qt() {
|
|
|
12378
12378
|
var x = l % 26, S = (l - x) / 26, w = 1 << x;
|
|
12379
12379
|
if (this.length <= S)
|
|
12380
12380
|
return this._expand(S + 1), this.words[S] |= w, this;
|
|
12381
|
-
for (var M = w,
|
|
12382
|
-
var K = this.words[
|
|
12383
|
-
K += M, M = K >>> 26, K &= 67108863, this.words[
|
|
12381
|
+
for (var M = w, D = S; M !== 0 && D < this.length; D++) {
|
|
12382
|
+
var K = this.words[D] | 0;
|
|
12383
|
+
K += M, M = K >>> 26, K &= 67108863, this.words[D] = K;
|
|
12384
12384
|
}
|
|
12385
|
-
return M !== 0 && (this.words[
|
|
12385
|
+
return M !== 0 && (this.words[D] = M, this.length++), this;
|
|
12386
12386
|
}, a.prototype.isZero = function() {
|
|
12387
12387
|
return this.length === 1 && this.words[0] === 0;
|
|
12388
12388
|
}, a.prototype.cmpn = function(l) {
|
|
@@ -12510,12 +12510,12 @@ function qt() {
|
|
|
12510
12510
|
l.words[0] = 0, l.length = 1;
|
|
12511
12511
|
return;
|
|
12512
12512
|
}
|
|
12513
|
-
var
|
|
12514
|
-
for (x.words[x.length++] =
|
|
12513
|
+
var D = l.words[9];
|
|
12514
|
+
for (x.words[x.length++] = D & S, M = 10; M < l.length; M++) {
|
|
12515
12515
|
var K = l.words[M] | 0;
|
|
12516
|
-
l.words[M - 10] = (K & S) << 4 |
|
|
12516
|
+
l.words[M - 10] = (K & S) << 4 | D >>> 22, D = K;
|
|
12517
12517
|
}
|
|
12518
|
-
|
|
12518
|
+
D >>>= 22, l.words[M - 10] = D, D === 0 && l.length > 10 ? l.length -= 10 : l.length -= 9;
|
|
12519
12519
|
}, P.prototype.imulK = function(l) {
|
|
12520
12520
|
l.words[l.length] = 0, l.words[l.length + 1] = 0, l.length += 2;
|
|
12521
12521
|
for (var x = 0, S = 0; S < l.length; S++) {
|
|
@@ -12524,14 +12524,14 @@ function qt() {
|
|
|
12524
12524
|
}
|
|
12525
12525
|
return l.words[l.length - 1] === 0 && (l.length--, l.words[l.length - 1] === 0 && l.length--), l;
|
|
12526
12526
|
};
|
|
12527
|
-
function
|
|
12527
|
+
function q() {
|
|
12528
12528
|
I.call(
|
|
12529
12529
|
this,
|
|
12530
12530
|
"p224",
|
|
12531
12531
|
"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001"
|
|
12532
12532
|
);
|
|
12533
12533
|
}
|
|
12534
|
-
s(
|
|
12534
|
+
s(q, I);
|
|
12535
12535
|
function L() {
|
|
12536
12536
|
I.call(
|
|
12537
12537
|
this,
|
|
@@ -12559,7 +12559,7 @@ function qt() {
|
|
|
12559
12559
|
if (l === "k256")
|
|
12560
12560
|
x = new P();
|
|
12561
12561
|
else if (l === "p224")
|
|
12562
|
-
x = new
|
|
12562
|
+
x = new q();
|
|
12563
12563
|
else if (l === "p192")
|
|
12564
12564
|
x = new L();
|
|
12565
12565
|
else if (l === "p25519")
|
|
@@ -12622,11 +12622,11 @@ function qt() {
|
|
|
12622
12622
|
for (var w = this.m.subn(1), M = 0; !w.isZero() && w.andln(1) === 0; )
|
|
12623
12623
|
M++, w.iushrn(1);
|
|
12624
12624
|
y(!w.isZero());
|
|
12625
|
-
var
|
|
12625
|
+
var D = new a(1).toRed(this), K = D.redNeg(), O = this.m.subn(1).iushrn(1), v = this.m.bitLength();
|
|
12626
12626
|
for (v = new a(2 * v * v).toRed(this); this.pow(v, O).cmp(K) !== 0; )
|
|
12627
12627
|
v.redIAdd(K);
|
|
12628
|
-
for (var k = this.pow(v, w), G = this.pow(l, w.addn(1).iushrn(1)), te = this.pow(l, w), V = M; te.cmp(
|
|
12629
|
-
for (var re = te, H = 0; re.cmp(
|
|
12628
|
+
for (var k = this.pow(v, w), G = this.pow(l, w.addn(1).iushrn(1)), te = this.pow(l, w), V = M; te.cmp(D) !== 0; ) {
|
|
12629
|
+
for (var re = te, H = 0; re.cmp(D) !== 0; H++)
|
|
12630
12630
|
re = re.redSqr();
|
|
12631
12631
|
y(H < V);
|
|
12632
12632
|
var X = this.pow(k, new a(1).iushln(V - H - 1));
|
|
@@ -12643,19 +12643,19 @@ function qt() {
|
|
|
12643
12643
|
w[0] = new a(1).toRed(this), w[1] = l;
|
|
12644
12644
|
for (var M = 2; M < w.length; M++)
|
|
12645
12645
|
w[M] = this.mul(w[M - 1], l);
|
|
12646
|
-
var
|
|
12646
|
+
var D = w[0], K = 0, O = 0, v = x.bitLength() % 26;
|
|
12647
12647
|
for (v === 0 && (v = 26), M = x.length - 1; M >= 0; M--) {
|
|
12648
12648
|
for (var k = x.words[M], G = v - 1; G >= 0; G--) {
|
|
12649
12649
|
var te = k >> G & 1;
|
|
12650
|
-
if (
|
|
12650
|
+
if (D !== w[0] && (D = this.sqr(D)), te === 0 && K === 0) {
|
|
12651
12651
|
O = 0;
|
|
12652
12652
|
continue;
|
|
12653
12653
|
}
|
|
12654
|
-
K <<= 1, K |= te, O++, !(O !== S && (M !== 0 || G !== 0)) && (
|
|
12654
|
+
K <<= 1, K |= te, O++, !(O !== S && (M !== 0 || G !== 0)) && (D = this.mul(D, w[K]), O = 0, K = 0);
|
|
12655
12655
|
}
|
|
12656
12656
|
v = 26;
|
|
12657
12657
|
}
|
|
12658
|
-
return
|
|
12658
|
+
return D;
|
|
12659
12659
|
}, U.prototype.convertTo = function(l) {
|
|
12660
12660
|
var x = l.umod(this.m);
|
|
12661
12661
|
return x === l ? x.clone() : x;
|
|
@@ -12676,12 +12676,12 @@ function qt() {
|
|
|
12676
12676
|
}, J.prototype.imul = function(l, x) {
|
|
12677
12677
|
if (l.isZero() || x.isZero())
|
|
12678
12678
|
return l.words[0] = 0, l.length = 1, l;
|
|
12679
|
-
var S = l.imul(x), w = S.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m), M = S.isub(w).iushrn(this.shift),
|
|
12680
|
-
return M.cmp(this.m) >= 0 ?
|
|
12679
|
+
var S = l.imul(x), w = S.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m), M = S.isub(w).iushrn(this.shift), D = M;
|
|
12680
|
+
return M.cmp(this.m) >= 0 ? D = M.isub(this.m) : M.cmpn(0) < 0 && (D = M.iadd(this.m)), D._forceRed(this);
|
|
12681
12681
|
}, J.prototype.mul = function(l, x) {
|
|
12682
12682
|
if (l.isZero() || x.isZero()) return new a(0)._forceRed(this);
|
|
12683
|
-
var S = l.mul(x), w = S.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m), M = S.isub(w).iushrn(this.shift),
|
|
12684
|
-
return M.cmp(this.m) >= 0 ?
|
|
12683
|
+
var S = l.mul(x), w = S.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m), M = S.isub(w).iushrn(this.shift), D = M;
|
|
12684
|
+
return M.cmp(this.m) >= 0 ? D = M.isub(this.m) : M.cmpn(0) < 0 && (D = M.iadd(this.m)), D._forceRed(this);
|
|
12685
12685
|
}, J.prototype.invm = function(l) {
|
|
12686
12686
|
var x = this.imod(l._invmp(this.m).mul(this.r2));
|
|
12687
12687
|
return x._forceRed(this);
|
|
@@ -12750,7 +12750,7 @@ function u0() {
|
|
|
12750
12750
|
var cu;
|
|
12751
12751
|
function At() {
|
|
12752
12752
|
return cu || (cu = 1, function(n) {
|
|
12753
|
-
var u = n, p =
|
|
12753
|
+
var u = n, p = Dt(), y = Xt(), s = u0();
|
|
12754
12754
|
u.assert = y, u.toArray = s.toArray, u.zero2 = s.zero2, u.toHex = s.toHex, u.encode = s.encode;
|
|
12755
12755
|
function a(r, e, t) {
|
|
12756
12756
|
var o = new Array(Math.max(r.bitLength(), t) + 1), c;
|
|
@@ -12843,7 +12843,7 @@ var za = {}, Ha, hu;
|
|
|
12843
12843
|
function An() {
|
|
12844
12844
|
if (hu) return Ha;
|
|
12845
12845
|
hu = 1;
|
|
12846
|
-
var n =
|
|
12846
|
+
var n = Dt(), u = At(), p = u.getNAF, y = u.getJSF, s = u.assert;
|
|
12847
12847
|
function a(f, h) {
|
|
12848
12848
|
this.type = f, this.p = new n(h.p, 16), this.red = h.prime ? n.red(h.prime) : n.mont(this.p), this.zero = new n(0).toRed(this.red), this.one = new n(1).toRed(this.red), this.two = new n(2).toRed(this.red), this.n = h.n && new n(h.n, 16), this.g = h.g && this.pointFromJSON(h.g, h.gRed), this._wnafT1 = new Array(4), this._wnafT2 = new Array(4), this._wnafT3 = new Array(4), this._wnafT4 = new Array(4), this._bitLength = this.n ? this.n.bitLength() : 0;
|
|
12849
12849
|
var i = this.n && this.p.div(this.n);
|
|
@@ -12890,9 +12890,9 @@ function An() {
|
|
|
12890
12890
|
o[g] = I.wnd, c[g] = I.points;
|
|
12891
12891
|
}
|
|
12892
12892
|
for (g = e - 1; g >= 1; g -= 2) {
|
|
12893
|
-
var P = g - 1,
|
|
12894
|
-
if (o[P] !== 1 || o[
|
|
12895
|
-
d[P] = p(r[P], o[P], this._bitLength), d[
|
|
12893
|
+
var P = g - 1, q = g;
|
|
12894
|
+
if (o[P] !== 1 || o[q] !== 1) {
|
|
12895
|
+
d[P] = p(r[P], o[P], this._bitLength), d[q] = p(r[q], o[q], this._bitLength), m = Math.max(d[P].length, m), m = Math.max(d[q].length, m);
|
|
12896
12896
|
continue;
|
|
12897
12897
|
}
|
|
12898
12898
|
var L = [
|
|
@@ -12902,10 +12902,10 @@ function An() {
|
|
|
12902
12902
|
/* 3 */
|
|
12903
12903
|
null,
|
|
12904
12904
|
/* 5 */
|
|
12905
|
-
i[
|
|
12905
|
+
i[q]
|
|
12906
12906
|
/* 7 */
|
|
12907
12907
|
];
|
|
12908
|
-
i[P].y.cmp(i[
|
|
12908
|
+
i[P].y.cmp(i[q].y) === 0 ? (L[1] = i[P].add(i[q]), L[2] = i[P].toJ().mixedAdd(i[q].neg())) : i[P].y.cmp(i[q].y.redNeg()) === 0 ? (L[1] = i[P].toJ().mixedAdd(i[q]), L[2] = i[P].add(i[q].neg())) : (L[1] = i[P].toJ().mixedAdd(i[q]), L[2] = i[P].toJ().mixedAdd(i[q].neg()));
|
|
12909
12909
|
var $ = [
|
|
12910
12910
|
-3,
|
|
12911
12911
|
/* -1 -1 */
|
|
@@ -12925,10 +12925,10 @@ function An() {
|
|
|
12925
12925
|
/* 1 0 */
|
|
12926
12926
|
3
|
|
12927
12927
|
/* 1 1 */
|
|
12928
|
-
], U = y(r[P], r[
|
|
12929
|
-
for (m = Math.max(U[0].length, m), d[P] = new Array(m), d[
|
|
12928
|
+
], U = y(r[P], r[q]);
|
|
12929
|
+
for (m = Math.max(U[0].length, m), d[P] = new Array(m), d[q] = new Array(m), _ = 0; _ < m; _++) {
|
|
12930
12930
|
var J = U[0][_] | 0, R = U[1][_] | 0;
|
|
12931
|
-
d[P][_] = $[(J + 1) * 3 + (R + 1)], d[
|
|
12931
|
+
d[P][_] = $[(J + 1) * 3 + (R + 1)], d[q][_] = 0, c[P] = L;
|
|
12932
12932
|
}
|
|
12933
12933
|
}
|
|
12934
12934
|
var l = this.jpoint(null, null, null), x = this._wnafT4;
|
|
@@ -13026,7 +13026,7 @@ var Va, du;
|
|
|
13026
13026
|
function ud() {
|
|
13027
13027
|
if (du) return Va;
|
|
13028
13028
|
du = 1;
|
|
13029
|
-
var n = At(), u =
|
|
13029
|
+
var n = At(), u = Dt(), p = at(), y = An(), s = n.assert;
|
|
13030
13030
|
function a(h) {
|
|
13031
13031
|
y.call(this, "short", h), this.a = new u(h.a, 16).toRed(this.red), this.b = new u(h.b, 16).toRed(this.red), this.tinv = this.two.redInvm(), this.zeroA = this.a.fromRed().cmpn(0) === 0, this.threeA = this.a.fromRed().sub(this.p).cmpn(-3) === 0, this.endo = this._getEndomorphism(h), this._endoWnafT1 = new Array(4), this._endoWnafT2 = new Array(4);
|
|
13032
13032
|
}
|
|
@@ -13061,7 +13061,7 @@ function ud() {
|
|
|
13061
13061
|
var r = i === this.p ? this.red : u.mont(i), e = new u(2).toRed(r).redInvm(), t = e.redNeg(), o = new u(3).toRed(r).redNeg().redSqrt().redMul(e), c = t.redAdd(o).fromRed(), d = t.redSub(o).fromRed();
|
|
13062
13062
|
return [c, d];
|
|
13063
13063
|
}, a.prototype._getEndoBasis = function(i) {
|
|
13064
|
-
for (var r = this.n.ushrn(Math.floor(this.n.bitLength() / 2)), e = i, t = this.n.clone(), o = new u(1), c = new u(0), d = new u(0), m = new u(1), g, _, E, I, P,
|
|
13064
|
+
for (var r = this.n.ushrn(Math.floor(this.n.bitLength() / 2)), e = i, t = this.n.clone(), o = new u(1), c = new u(0), d = new u(0), m = new u(1), g, _, E, I, P, q, L, $ = 0, U, J; e.cmpn(0) !== 0; ) {
|
|
13065
13065
|
var R = t.div(e);
|
|
13066
13066
|
U = t.sub(R.mul(e)), J = d.sub(R.mul(o));
|
|
13067
13067
|
var l = m.sub(R.mul(c));
|
|
@@ -13071,11 +13071,11 @@ function ud() {
|
|
|
13071
13071
|
break;
|
|
13072
13072
|
L = U, t = e, e = U, d = o, o = J, m = c, c = l;
|
|
13073
13073
|
}
|
|
13074
|
-
P = U.neg(),
|
|
13075
|
-
var x = E.sqr().add(I.sqr()), S = P.sqr().add(
|
|
13076
|
-
return S.cmp(x) >= 0 && (P = g,
|
|
13074
|
+
P = U.neg(), q = J;
|
|
13075
|
+
var x = E.sqr().add(I.sqr()), S = P.sqr().add(q.sqr());
|
|
13076
|
+
return S.cmp(x) >= 0 && (P = g, q = _), E.negative && (E = E.neg(), I = I.neg()), P.negative && (P = P.neg(), q = q.neg()), [
|
|
13077
13077
|
{ a: E, b: I },
|
|
13078
|
-
{ a: P, b:
|
|
13078
|
+
{ a: P, b: q }
|
|
13079
13079
|
];
|
|
13080
13080
|
}, a.prototype._endoSplit = function(i) {
|
|
13081
13081
|
var r = this.endo.basis, e = r[0], t = r[1], o = t.b.mul(i).divRound(this.n), c = e.b.neg().mul(i).divRound(this.n), d = o.mul(e.a), m = c.mul(t.a), g = o.mul(e.b), _ = c.mul(t.b), E = i.sub(d).sub(m), I = g.add(_).neg();
|
|
@@ -13250,8 +13250,8 @@ function ud() {
|
|
|
13250
13250
|
var r = i.z.redSqr(), e = this.z.redSqr(), t = this.x.redMul(r), o = i.x.redMul(e), c = this.y.redMul(r.redMul(i.z)), d = i.y.redMul(e.redMul(this.z)), m = t.redSub(o), g = c.redSub(d);
|
|
13251
13251
|
if (m.cmpn(0) === 0)
|
|
13252
13252
|
return g.cmpn(0) !== 0 ? this.curve.jpoint(null, null, null) : this.dbl();
|
|
13253
|
-
var _ = m.redSqr(), E = _.redMul(m), I = t.redMul(_), P = g.redSqr().redIAdd(E).redISub(I).redISub(I),
|
|
13254
|
-
return this.curve.jpoint(P,
|
|
13253
|
+
var _ = m.redSqr(), E = _.redMul(m), I = t.redMul(_), P = g.redSqr().redIAdd(E).redISub(I).redISub(I), q = g.redMul(I.redISub(P)).redISub(c.redMul(E)), L = this.z.redMul(i.z).redMul(m);
|
|
13254
|
+
return this.curve.jpoint(P, q, L);
|
|
13255
13255
|
}, f.prototype.mixedAdd = function(i) {
|
|
13256
13256
|
if (this.isInfinity())
|
|
13257
13257
|
return i.toJ();
|
|
@@ -13260,8 +13260,8 @@ function ud() {
|
|
|
13260
13260
|
var r = this.z.redSqr(), e = this.x, t = i.x.redMul(r), o = this.y, c = i.y.redMul(r).redMul(this.z), d = e.redSub(t), m = o.redSub(c);
|
|
13261
13261
|
if (d.cmpn(0) === 0)
|
|
13262
13262
|
return m.cmpn(0) !== 0 ? this.curve.jpoint(null, null, null) : this.dbl();
|
|
13263
|
-
var g = d.redSqr(), _ = g.redMul(d), E = e.redMul(g), I = m.redSqr().redIAdd(_).redISub(E).redISub(E), P = m.redMul(E.redISub(I)).redISub(o.redMul(_)),
|
|
13264
|
-
return this.curve.jpoint(I, P,
|
|
13263
|
+
var g = d.redSqr(), _ = g.redMul(d), E = e.redMul(g), I = m.redSqr().redIAdd(_).redISub(E).redISub(E), P = m.redMul(E.redISub(I)).redISub(o.redMul(_)), q = this.z.redMul(d);
|
|
13264
|
+
return this.curve.jpoint(I, P, q);
|
|
13265
13265
|
}, f.prototype.dblp = function(i) {
|
|
13266
13266
|
if (i === 0)
|
|
13267
13267
|
return this;
|
|
@@ -13278,7 +13278,7 @@ function ud() {
|
|
|
13278
13278
|
}
|
|
13279
13279
|
var t = this.curve.a, o = this.curve.tinv, c = this.x, d = this.y, m = this.z, g = m.redSqr().redSqr(), _ = d.redAdd(d);
|
|
13280
13280
|
for (r = 0; r < i; r++) {
|
|
13281
|
-
var E = c.redSqr(), I = _.redSqr(), P = I.redSqr(),
|
|
13281
|
+
var E = c.redSqr(), I = _.redSqr(), P = I.redSqr(), q = E.redAdd(E).redIAdd(E).redIAdd(t.redMul(g)), L = c.redMul(I), $ = q.redSqr().redISub(L.redAdd(L)), U = L.redISub($), J = q.redMul(U);
|
|
13282
13282
|
J = J.redIAdd(J).redISub(P);
|
|
13283
13283
|
var R = _.redMul(m);
|
|
13284
13284
|
r + 1 < i && (g = g.redMul(P)), c = $, m = R, _ = J;
|
|
@@ -13294,10 +13294,10 @@ function ud() {
|
|
|
13294
13294
|
var m = t.redAdd(t).redIAdd(t), g = m.redSqr().redISub(d).redISub(d), _ = c.redIAdd(c);
|
|
13295
13295
|
_ = _.redIAdd(_), _ = _.redIAdd(_), i = g, r = m.redMul(d.redISub(g)).redISub(_), e = this.y.redAdd(this.y);
|
|
13296
13296
|
} else {
|
|
13297
|
-
var E = this.x.redSqr(), I = this.y.redSqr(), P = I.redSqr(),
|
|
13298
|
-
|
|
13297
|
+
var E = this.x.redSqr(), I = this.y.redSqr(), P = I.redSqr(), q = this.x.redAdd(I).redSqr().redISub(E).redISub(P);
|
|
13298
|
+
q = q.redIAdd(q);
|
|
13299
13299
|
var L = E.redAdd(E).redIAdd(E), $ = L.redSqr(), U = P.redIAdd(P);
|
|
13300
|
-
U = U.redIAdd(U), U = U.redIAdd(U), i = $.redISub(
|
|
13300
|
+
U = U.redIAdd(U), U = U.redIAdd(U), i = $.redISub(q).redISub(q), r = L.redMul(q.redISub(i)).redISub(U), e = this.y.redMul(this.z), e = e.redIAdd(e);
|
|
13301
13301
|
}
|
|
13302
13302
|
return this.curve.jpoint(i, r, e);
|
|
13303
13303
|
}, f.prototype._threeDbl = function() {
|
|
@@ -13310,14 +13310,14 @@ function ud() {
|
|
|
13310
13310
|
var _ = c.redIAdd(c);
|
|
13311
13311
|
_ = _.redIAdd(_), _ = _.redIAdd(_), r = m.redMul(d.redISub(g)).redISub(_), e = this.y.redAdd(this.y);
|
|
13312
13312
|
} else {
|
|
13313
|
-
var E = this.z.redSqr(), I = this.y.redSqr(), P = this.x.redMul(I),
|
|
13314
|
-
|
|
13313
|
+
var E = this.z.redSqr(), I = this.y.redSqr(), P = this.x.redMul(I), q = this.x.redSub(E).redMul(this.x.redAdd(E));
|
|
13314
|
+
q = q.redAdd(q).redIAdd(q);
|
|
13315
13315
|
var L = P.redIAdd(P);
|
|
13316
13316
|
L = L.redIAdd(L);
|
|
13317
13317
|
var $ = L.redAdd(L);
|
|
13318
|
-
i =
|
|
13318
|
+
i = q.redSqr().redISub($), e = this.y.redAdd(this.z).redSqr().redISub(I).redISub(E);
|
|
13319
13319
|
var U = I.redSqr();
|
|
13320
|
-
U = U.redIAdd(U), U = U.redIAdd(U), U = U.redIAdd(U), r =
|
|
13320
|
+
U = U.redIAdd(U), U = U.redIAdd(U), U = U.redIAdd(U), r = q.redMul(L.redISub(i)).redISub(U);
|
|
13321
13321
|
}
|
|
13322
13322
|
return this.curve.jpoint(i, r, e);
|
|
13323
13323
|
}, f.prototype._dbl = function() {
|
|
@@ -13325,8 +13325,8 @@ function ud() {
|
|
|
13325
13325
|
g = g.redIAdd(g);
|
|
13326
13326
|
var _ = g.redMul(d), E = m.redSqr().redISub(_.redAdd(_)), I = _.redISub(E), P = d.redSqr();
|
|
13327
13327
|
P = P.redIAdd(P), P = P.redIAdd(P), P = P.redIAdd(P);
|
|
13328
|
-
var
|
|
13329
|
-
return this.curve.jpoint(E,
|
|
13328
|
+
var q = m.redMul(I).redISub(P), L = e.redAdd(e).redMul(t);
|
|
13329
|
+
return this.curve.jpoint(E, q, L);
|
|
13330
13330
|
}, f.prototype.trpl = function() {
|
|
13331
13331
|
if (!this.curve.zeroA)
|
|
13332
13332
|
return this.dbl().add(this);
|
|
@@ -13340,8 +13340,8 @@ function ud() {
|
|
|
13340
13340
|
I = I.redIAdd(I), I = I.redIAdd(I);
|
|
13341
13341
|
var P = this.y.redMul(_.redMul(g.redISub(_)).redISub(d.redMul(m)));
|
|
13342
13342
|
P = P.redIAdd(P), P = P.redIAdd(P), P = P.redIAdd(P);
|
|
13343
|
-
var
|
|
13344
|
-
return this.curve.jpoint(I, P,
|
|
13343
|
+
var q = this.z.redAdd(d).redSqr().redISub(e).redISub(m);
|
|
13344
|
+
return this.curve.jpoint(I, P, q);
|
|
13345
13345
|
}, f.prototype.mul = function(i, r) {
|
|
13346
13346
|
return i = new u(i, r), this.curve._wnafMul(this, i);
|
|
13347
13347
|
}, f.prototype.eq = function(i) {
|
|
@@ -13374,7 +13374,7 @@ var $a, pu;
|
|
|
13374
13374
|
function cd() {
|
|
13375
13375
|
if (pu) return $a;
|
|
13376
13376
|
pu = 1;
|
|
13377
|
-
var n =
|
|
13377
|
+
var n = Dt(), u = at(), p = An(), y = At();
|
|
13378
13378
|
function s(b) {
|
|
13379
13379
|
p.call(this, "mont", b), this.a = new n(b.a, 16).toRed(this.red), this.b = new n(b.b, 16).toRed(this.red), this.i4 = new n(4).toRed(this.red).redInvm(), this.two = new n(2).toRed(this.red), this.a24 = this.i4.redMul(this.a.redAdd(this.two));
|
|
13380
13380
|
}
|
|
@@ -13430,7 +13430,7 @@ var Ka, bu;
|
|
|
13430
13430
|
function ld() {
|
|
13431
13431
|
if (bu) return Ka;
|
|
13432
13432
|
bu = 1;
|
|
13433
|
-
var n = At(), u =
|
|
13433
|
+
var n = At(), u = Dt(), p = at(), y = An(), s = n.assert;
|
|
13434
13434
|
function a(f) {
|
|
13435
13435
|
this.twisted = (f.a | 0) !== 1, this.mOneA = this.twisted && (f.a | 0) === -1, this.extended = this.mOneA, y.call(this, "edwards", f), this.a = new u(f.a, 16).umod(this.red.m), this.a = this.a.toRed(this.red), this.c = new u(f.c, 16).toRed(this.red), this.c2 = this.c.redSqr(), this.d = new u(f.d, 16).toRed(this.red), this.dd = this.d.redAdd(this.d), s(!this.twisted || this.c.fromRed().cmpn(1) === 0), this.oneC = (f.c | 0) === 1;
|
|
13436
13436
|
}
|
|
@@ -13567,8 +13567,8 @@ function Nt() {
|
|
|
13567
13567
|
for (l = l.replace(/[^a-z0-9]+/ig, ""), l.length % 2 !== 0 && (l = "0" + l), M = 0; M < l.length; M += 2)
|
|
13568
13568
|
S.push(parseInt(l[M] + l[M + 1], 16));
|
|
13569
13569
|
} else for (var w = 0, M = 0; M < l.length; M++) {
|
|
13570
|
-
var
|
|
13571
|
-
|
|
13570
|
+
var D = l.charCodeAt(M);
|
|
13571
|
+
D < 128 ? S[w++] = D : D < 2048 ? (S[w++] = D >> 6 | 192, S[w++] = D & 63 | 128) : p(l, M) ? (D = 65536 + ((D & 1023) << 10) + (l.charCodeAt(++M) & 1023), S[w++] = D >> 18 | 240, S[w++] = D >> 12 & 63 | 128, S[w++] = D >> 6 & 63 | 128, S[w++] = D & 63 | 128) : (S[w++] = D >> 12 | 224, S[w++] = D >> 6 & 63 | 128, S[w++] = D & 63 | 128);
|
|
13572
13572
|
}
|
|
13573
13573
|
else
|
|
13574
13574
|
for (M = 0; M < l.length; M++)
|
|
@@ -13606,17 +13606,17 @@ function Nt() {
|
|
|
13606
13606
|
function i(l, x, S, w) {
|
|
13607
13607
|
var M = S - x;
|
|
13608
13608
|
n(M % 4 === 0);
|
|
13609
|
-
for (var
|
|
13609
|
+
for (var D = new Array(M / 4), K = 0, O = x; K < D.length; K++, O += 4) {
|
|
13610
13610
|
var v;
|
|
13611
|
-
w === "big" ? v = l[O] << 24 | l[O + 1] << 16 | l[O + 2] << 8 | l[O + 3] : v = l[O + 3] << 24 | l[O + 2] << 16 | l[O + 1] << 8 | l[O],
|
|
13611
|
+
w === "big" ? v = l[O] << 24 | l[O + 1] << 16 | l[O + 2] << 8 | l[O + 3] : v = l[O + 3] << 24 | l[O + 2] << 16 | l[O + 1] << 8 | l[O], D[K] = v >>> 0;
|
|
13612
13612
|
}
|
|
13613
|
-
return
|
|
13613
|
+
return D;
|
|
13614
13614
|
}
|
|
13615
13615
|
et.join32 = i;
|
|
13616
13616
|
function r(l, x) {
|
|
13617
13617
|
for (var S = new Array(l.length * 4), w = 0, M = 0; w < l.length; w++, M += 4) {
|
|
13618
|
-
var
|
|
13619
|
-
x === "big" ? (S[M] =
|
|
13618
|
+
var D = l[w];
|
|
13619
|
+
x === "big" ? (S[M] = D >>> 24, S[M + 1] = D >>> 16 & 255, S[M + 2] = D >>> 8 & 255, S[M + 3] = D & 255) : (S[M + 3] = D >>> 24, S[M + 2] = D >>> 16 & 255, S[M + 1] = D >>> 8 & 255, S[M] = D & 255);
|
|
13620
13620
|
}
|
|
13621
13621
|
return S;
|
|
13622
13622
|
}
|
|
@@ -13646,13 +13646,13 @@ function Nt() {
|
|
|
13646
13646
|
}
|
|
13647
13647
|
et.sum32_5 = m;
|
|
13648
13648
|
function g(l, x, S, w) {
|
|
13649
|
-
var M = l[x],
|
|
13649
|
+
var M = l[x], D = l[x + 1], K = w + D >>> 0, O = (K < w ? 1 : 0) + S + M;
|
|
13650
13650
|
l[x] = O >>> 0, l[x + 1] = K;
|
|
13651
13651
|
}
|
|
13652
13652
|
et.sum64 = g;
|
|
13653
13653
|
function _(l, x, S, w) {
|
|
13654
|
-
var M = x + w >>> 0,
|
|
13655
|
-
return
|
|
13654
|
+
var M = x + w >>> 0, D = (M < x ? 1 : 0) + l + S;
|
|
13655
|
+
return D >>> 0;
|
|
13656
13656
|
}
|
|
13657
13657
|
et.sum64_hi = _;
|
|
13658
13658
|
function E(l, x, S, w) {
|
|
@@ -13660,27 +13660,27 @@ function Nt() {
|
|
|
13660
13660
|
return M >>> 0;
|
|
13661
13661
|
}
|
|
13662
13662
|
et.sum64_lo = E;
|
|
13663
|
-
function I(l, x, S, w, M,
|
|
13663
|
+
function I(l, x, S, w, M, D, K, O) {
|
|
13664
13664
|
var v = 0, k = x;
|
|
13665
|
-
k = k + w >>> 0, v += k < x ? 1 : 0, k = k +
|
|
13665
|
+
k = k + w >>> 0, v += k < x ? 1 : 0, k = k + D >>> 0, v += k < D ? 1 : 0, k = k + O >>> 0, v += k < O ? 1 : 0;
|
|
13666
13666
|
var G = l + S + M + K + v;
|
|
13667
13667
|
return G >>> 0;
|
|
13668
13668
|
}
|
|
13669
13669
|
et.sum64_4_hi = I;
|
|
13670
|
-
function P(l, x, S, w, M,
|
|
13671
|
-
var v = x + w +
|
|
13670
|
+
function P(l, x, S, w, M, D, K, O) {
|
|
13671
|
+
var v = x + w + D + O;
|
|
13672
13672
|
return v >>> 0;
|
|
13673
13673
|
}
|
|
13674
13674
|
et.sum64_4_lo = P;
|
|
13675
|
-
function
|
|
13675
|
+
function q(l, x, S, w, M, D, K, O, v, k) {
|
|
13676
13676
|
var G = 0, te = x;
|
|
13677
|
-
te = te + w >>> 0, G += te < x ? 1 : 0, te = te +
|
|
13677
|
+
te = te + w >>> 0, G += te < x ? 1 : 0, te = te + D >>> 0, G += te < D ? 1 : 0, te = te + O >>> 0, G += te < O ? 1 : 0, te = te + k >>> 0, G += te < k ? 1 : 0;
|
|
13678
13678
|
var V = l + S + M + K + v + G;
|
|
13679
13679
|
return V >>> 0;
|
|
13680
13680
|
}
|
|
13681
|
-
et.sum64_5_hi =
|
|
13682
|
-
function L(l, x, S, w, M,
|
|
13683
|
-
var G = x + w +
|
|
13681
|
+
et.sum64_5_hi = q;
|
|
13682
|
+
function L(l, x, S, w, M, D, K, O, v, k) {
|
|
13683
|
+
var G = x + w + D + O + k;
|
|
13684
13684
|
return G >>> 0;
|
|
13685
13685
|
}
|
|
13686
13686
|
et.sum64_5_lo = L;
|
|
@@ -13906,12 +13906,12 @@ function d0() {
|
|
|
13906
13906
|
E[I] = g[_ + I];
|
|
13907
13907
|
for (; I < E.length; I++)
|
|
13908
13908
|
E[I] = a(t(E[I - 2]), E[I - 7], e(E[I - 15]), E[I - 16]);
|
|
13909
|
-
var P = this.h[0],
|
|
13909
|
+
var P = this.h[0], q = this.h[1], L = this.h[2], $ = this.h[3], U = this.h[4], J = this.h[5], R = this.h[6], l = this.h[7];
|
|
13910
13910
|
for (y(this.k.length === E.length), I = 0; I < E.length; I++) {
|
|
13911
|
-
var x = b(l, r(U), f(U, J, R), this.k[I], E[I]), S = s(i(P), h(P,
|
|
13912
|
-
l = R, R = J, J = U, U = s($, x), $ = L, L =
|
|
13911
|
+
var x = b(l, r(U), f(U, J, R), this.k[I], E[I]), S = s(i(P), h(P, q, L));
|
|
13912
|
+
l = R, R = J, J = U, U = s($, x), $ = L, L = q, q = P, P = s(x, S);
|
|
13913
13913
|
}
|
|
13914
|
-
this.h[0] = s(this.h[0], P), this.h[1] = s(this.h[1],
|
|
13914
|
+
this.h[0] = s(this.h[0], P), this.h[1] = s(this.h[1], q), this.h[2] = s(this.h[2], L), this.h[3] = s(this.h[3], $), this.h[4] = s(this.h[4], U), this.h[5] = s(this.h[5], J), this.h[6] = s(this.h[6], R), this.h[7] = s(this.h[7], l);
|
|
13915
13915
|
}, d.prototype._digest = function(g) {
|
|
13916
13916
|
return g === "hex" ? n.toHex32(this.h, "big") : n.split32(this.h, "big");
|
|
13917
13917
|
}, Ja;
|
|
@@ -14128,11 +14128,11 @@ function p0() {
|
|
|
14128
14128
|
], this.k = d, this.W = new Array(160);
|
|
14129
14129
|
}
|
|
14130
14130
|
n.inherits(m, c), Xa = m, m.blockSize = 1024, m.outSize = 512, m.hmacStrength = 192, m.padLength = 128, m.prototype._prepareBlock = function(S, w) {
|
|
14131
|
-
for (var M = this.W,
|
|
14132
|
-
M[
|
|
14133
|
-
for (;
|
|
14134
|
-
var K = R(M[
|
|
14135
|
-
M[
|
|
14131
|
+
for (var M = this.W, D = 0; D < 32; D++)
|
|
14132
|
+
M[D] = S[w + D];
|
|
14133
|
+
for (; D < M.length; D += 2) {
|
|
14134
|
+
var K = R(M[D - 4], M[D - 3]), O = l(M[D - 4], M[D - 3]), v = M[D - 14], k = M[D - 13], G = U(M[D - 30], M[D - 29]), te = J(M[D - 30], M[D - 29]), V = M[D - 32], re = M[D - 31];
|
|
14135
|
+
M[D] = r(
|
|
14136
14136
|
K,
|
|
14137
14137
|
O,
|
|
14138
14138
|
v,
|
|
@@ -14141,7 +14141,7 @@ function p0() {
|
|
|
14141
14141
|
te,
|
|
14142
14142
|
V,
|
|
14143
14143
|
re
|
|
14144
|
-
), M[
|
|
14144
|
+
), M[D + 1] = e(
|
|
14145
14145
|
K,
|
|
14146
14146
|
O,
|
|
14147
14147
|
v,
|
|
@@ -14154,7 +14154,7 @@ function p0() {
|
|
|
14154
14154
|
}
|
|
14155
14155
|
}, m.prototype._update = function(S, w) {
|
|
14156
14156
|
this._prepareBlock(S, w);
|
|
14157
|
-
var M = this.W,
|
|
14157
|
+
var M = this.W, D = this.h[0], K = this.h[1], O = this.h[2], v = this.h[3], k = this.h[4], G = this.h[5], te = this.h[6], V = this.h[7], re = this.h[8], H = this.h[9], X = this.h[10], ne = this.h[11], oe = this.h[12], ue = this.h[13], Y = this.h[14], W = this.h[15];
|
|
14158
14158
|
p(this.k.length === M.length);
|
|
14159
14159
|
for (var le = 0; le < M.length; le += 2) {
|
|
14160
14160
|
var ve = Y, Ae = W, me = L(re, H), Pe = $(re, H), Oe = g(re, H, X, ne, oe), pe = _(re, H, X, ne, oe, ue), Qe = this.k[le], Te = this.k[le + 1], Be = M[le], Ue = M[le + 1], ae = t(
|
|
@@ -14180,60 +14180,60 @@ function p0() {
|
|
|
14180
14180
|
Be,
|
|
14181
14181
|
Ue
|
|
14182
14182
|
);
|
|
14183
|
-
ve = P(
|
|
14183
|
+
ve = P(D, K), Ae = q(D, K), me = E(D, K, O, v, k), Pe = I(D, K, O, v, k, G);
|
|
14184
14184
|
var _e = h(ve, Ae, me, Pe), xe = i(ve, Ae, me, Pe);
|
|
14185
|
-
Y = oe, W = ue, oe = X, ue = ne, X = re, ne = H, re = h(te, V, ae, se), H = i(V, V, ae, se), te = k, V = G, k = O, G = v, O =
|
|
14185
|
+
Y = oe, W = ue, oe = X, ue = ne, X = re, ne = H, re = h(te, V, ae, se), H = i(V, V, ae, se), te = k, V = G, k = O, G = v, O = D, v = K, D = h(ae, se, _e, xe), K = i(ae, se, _e, xe);
|
|
14186
14186
|
}
|
|
14187
|
-
f(this.h, 0,
|
|
14187
|
+
f(this.h, 0, D, K), f(this.h, 2, O, v), f(this.h, 4, k, G), f(this.h, 6, te, V), f(this.h, 8, re, H), f(this.h, 10, X, ne), f(this.h, 12, oe, ue), f(this.h, 14, Y, W);
|
|
14188
14188
|
}, m.prototype._digest = function(S) {
|
|
14189
14189
|
return S === "hex" ? n.toHex32(this.h, "big") : n.split32(this.h, "big");
|
|
14190
14190
|
};
|
|
14191
|
-
function g(x, S, w, M,
|
|
14192
|
-
var K = x & w ^ ~x &
|
|
14191
|
+
function g(x, S, w, M, D) {
|
|
14192
|
+
var K = x & w ^ ~x & D;
|
|
14193
14193
|
return K < 0 && (K += 4294967296), K;
|
|
14194
14194
|
}
|
|
14195
|
-
function _(x, S, w, M,
|
|
14195
|
+
function _(x, S, w, M, D, K) {
|
|
14196
14196
|
var O = S & M ^ ~S & K;
|
|
14197
14197
|
return O < 0 && (O += 4294967296), O;
|
|
14198
14198
|
}
|
|
14199
|
-
function E(x, S, w, M,
|
|
14200
|
-
var K = x & w ^ x &
|
|
14199
|
+
function E(x, S, w, M, D) {
|
|
14200
|
+
var K = x & w ^ x & D ^ w & D;
|
|
14201
14201
|
return K < 0 && (K += 4294967296), K;
|
|
14202
14202
|
}
|
|
14203
|
-
function I(x, S, w, M,
|
|
14203
|
+
function I(x, S, w, M, D, K) {
|
|
14204
14204
|
var O = S & M ^ S & K ^ M & K;
|
|
14205
14205
|
return O < 0 && (O += 4294967296), O;
|
|
14206
14206
|
}
|
|
14207
14207
|
function P(x, S) {
|
|
14208
|
-
var w = y(x, S, 28), M = y(S, x, 2),
|
|
14208
|
+
var w = y(x, S, 28), M = y(S, x, 2), D = y(S, x, 7), K = w ^ M ^ D;
|
|
14209
14209
|
return K < 0 && (K += 4294967296), K;
|
|
14210
14210
|
}
|
|
14211
|
-
function
|
|
14212
|
-
var w = s(x, S, 28), M = s(S, x, 2),
|
|
14211
|
+
function q(x, S) {
|
|
14212
|
+
var w = s(x, S, 28), M = s(S, x, 2), D = s(S, x, 7), K = w ^ M ^ D;
|
|
14213
14213
|
return K < 0 && (K += 4294967296), K;
|
|
14214
14214
|
}
|
|
14215
14215
|
function L(x, S) {
|
|
14216
|
-
var w = y(x, S, 14), M = y(x, S, 18),
|
|
14216
|
+
var w = y(x, S, 14), M = y(x, S, 18), D = y(S, x, 9), K = w ^ M ^ D;
|
|
14217
14217
|
return K < 0 && (K += 4294967296), K;
|
|
14218
14218
|
}
|
|
14219
14219
|
function $(x, S) {
|
|
14220
|
-
var w = s(x, S, 14), M = s(x, S, 18),
|
|
14220
|
+
var w = s(x, S, 14), M = s(x, S, 18), D = s(S, x, 9), K = w ^ M ^ D;
|
|
14221
14221
|
return K < 0 && (K += 4294967296), K;
|
|
14222
14222
|
}
|
|
14223
14223
|
function U(x, S) {
|
|
14224
|
-
var w = y(x, S, 1), M = y(x, S, 8),
|
|
14224
|
+
var w = y(x, S, 1), M = y(x, S, 8), D = a(x, S, 7), K = w ^ M ^ D;
|
|
14225
14225
|
return K < 0 && (K += 4294967296), K;
|
|
14226
14226
|
}
|
|
14227
14227
|
function J(x, S) {
|
|
14228
|
-
var w = s(x, S, 1), M = s(x, S, 8),
|
|
14228
|
+
var w = s(x, S, 1), M = s(x, S, 8), D = b(x, S, 7), K = w ^ M ^ D;
|
|
14229
14229
|
return K < 0 && (K += 4294967296), K;
|
|
14230
14230
|
}
|
|
14231
14231
|
function R(x, S) {
|
|
14232
|
-
var w = y(x, S, 19), M = y(S, x, 29),
|
|
14232
|
+
var w = y(x, S, 19), M = y(S, x, 29), D = a(x, S, 6), K = w ^ M ^ D;
|
|
14233
14233
|
return K < 0 && (K += 4294967296), K;
|
|
14234
14234
|
}
|
|
14235
14235
|
function l(x, S) {
|
|
14236
|
-
var w = s(x, S, 19), M = s(S, x, 29),
|
|
14236
|
+
var w = s(x, S, 19), M = s(S, x, 29), D = b(x, S, 6), K = w ^ M ^ D;
|
|
14237
14237
|
return K < 0 && (K += 4294967296), K;
|
|
14238
14238
|
}
|
|
14239
14239
|
return Xa;
|
|
@@ -14284,15 +14284,15 @@ function yd() {
|
|
|
14284
14284
|
b.call(this), this.h = [1732584193, 4023233417, 2562383102, 271733878, 3285377520], this.endian = "little";
|
|
14285
14285
|
}
|
|
14286
14286
|
n.inherits(f, b), to.ripemd160 = f, f.blockSize = 512, f.outSize = 160, f.hmacStrength = 192, f.padLength = 64, f.prototype._update = function(m, g) {
|
|
14287
|
-
for (var _ = this.h[0], E = this.h[1], I = this.h[2], P = this.h[3],
|
|
14287
|
+
for (var _ = this.h[0], E = this.h[1], I = this.h[2], P = this.h[3], q = this.h[4], L = _, $ = E, U = I, J = P, R = q, l = 0; l < 80; l++) {
|
|
14288
14288
|
var x = y(
|
|
14289
14289
|
p(
|
|
14290
14290
|
a(_, h(l, E, I, P), m[e[l] + g], i(l)),
|
|
14291
14291
|
o[l]
|
|
14292
14292
|
),
|
|
14293
|
-
|
|
14293
|
+
q
|
|
14294
14294
|
);
|
|
14295
|
-
_ =
|
|
14295
|
+
_ = q, q = P, P = p(I, 10), I = E, E = x, x = y(
|
|
14296
14296
|
p(
|
|
14297
14297
|
a(L, h(79 - l, $, U, J), m[t[l] + g], r(l)),
|
|
14298
14298
|
c[l]
|
|
@@ -14300,7 +14300,7 @@ function yd() {
|
|
|
14300
14300
|
R
|
|
14301
14301
|
), L = R, R = J, J = p(U, 10), U = $, $ = x;
|
|
14302
14302
|
}
|
|
14303
|
-
x = s(this.h[1], I, J), this.h[1] = s(this.h[2], P, R), this.h[2] = s(this.h[3],
|
|
14303
|
+
x = s(this.h[1], I, J), this.h[1] = s(this.h[2], P, R), this.h[2] = s(this.h[3], q, L), this.h[3] = s(this.h[4], _, $), this.h[4] = s(this.h[0], E, U), this.h[0] = x;
|
|
14304
14304
|
}, f.prototype._digest = function(m) {
|
|
14305
14305
|
return m === "hex" ? n.toHex32(this.h, "little") : n.split32(this.h, "little");
|
|
14306
14306
|
};
|
|
@@ -15653,7 +15653,7 @@ var ao, Fu;
|
|
|
15653
15653
|
function wd() {
|
|
15654
15654
|
if (Fu) return ao;
|
|
15655
15655
|
Fu = 1;
|
|
15656
|
-
var n =
|
|
15656
|
+
var n = Dt(), u = At(), p = u.assert;
|
|
15657
15657
|
function y(s, a) {
|
|
15658
15658
|
this.ec = s, this.priv = null, this.pub = null, a.priv && this._importPrivate(a.priv, a.privEnc), a.pub && this._importPublic(a.pub, a.pubEnc);
|
|
15659
15659
|
}
|
|
@@ -15696,7 +15696,7 @@ var oo, Ou;
|
|
|
15696
15696
|
function _d() {
|
|
15697
15697
|
if (Ou) return oo;
|
|
15698
15698
|
Ou = 1;
|
|
15699
|
-
var n =
|
|
15699
|
+
var n = Dt(), u = At(), p = u.assert;
|
|
15700
15700
|
function y(h, i) {
|
|
15701
15701
|
if (h instanceof y)
|
|
15702
15702
|
return h;
|
|
@@ -15772,11 +15772,11 @@ function _d() {
|
|
|
15772
15772
|
return f(c, o.length), c = c.concat(o), u.encode(c, i);
|
|
15773
15773
|
}, oo;
|
|
15774
15774
|
}
|
|
15775
|
-
var fo,
|
|
15775
|
+
var fo, qu;
|
|
15776
15776
|
function xd() {
|
|
15777
|
-
if (
|
|
15778
|
-
|
|
15779
|
-
var n =
|
|
15777
|
+
if (qu) return fo;
|
|
15778
|
+
qu = 1;
|
|
15779
|
+
var n = Dt(), u = md(), p = At(), y = Lo(), s = c0(), a = p.assert, b = wd(), f = _d();
|
|
15780
15780
|
function h(i) {
|
|
15781
15781
|
if (!(this instanceof h))
|
|
15782
15782
|
return new h(i);
|
|
@@ -15838,13 +15838,13 @@ function xd() {
|
|
|
15838
15838
|
}), E = this.n.sub(new n(1)), I = 0; ; I++) {
|
|
15839
15839
|
var P = o.k ? o.k(I) : new n(_.generate(this.n.byteLength()));
|
|
15840
15840
|
if (P = this._truncateToN(P, !0), !(P.cmpn(1) <= 0 || P.cmp(E) >= 0)) {
|
|
15841
|
-
var
|
|
15842
|
-
if (!
|
|
15843
|
-
var L =
|
|
15841
|
+
var q = this.g.mul(P);
|
|
15842
|
+
if (!q.isInfinity()) {
|
|
15843
|
+
var L = q.getX(), $ = L.umod(this.n);
|
|
15844
15844
|
if ($.cmpn(0) !== 0) {
|
|
15845
15845
|
var U = P.invm(this.n).mul($.mul(e.getPrivate()).iadd(r));
|
|
15846
15846
|
if (U = U.umod(this.n), U.cmpn(0) !== 0) {
|
|
15847
|
-
var J = (
|
|
15847
|
+
var J = (q.getY().isOdd() ? 1 : 0) | (L.cmp($) !== 0 ? 2 : 0);
|
|
15848
15848
|
return o.canonical && U.cmp(this.nh) > 0 && (U = this.n.sub(U), J ^= 1), new f({ r: $, s: U, recoveryParam: J });
|
|
15849
15849
|
}
|
|
15850
15850
|
}
|
|
@@ -15882,10 +15882,10 @@ function xd() {
|
|
|
15882
15882
|
throw new Error("Unable to find valid recovery factor");
|
|
15883
15883
|
}, fo;
|
|
15884
15884
|
}
|
|
15885
|
-
var so,
|
|
15885
|
+
var so, Du;
|
|
15886
15886
|
function Ed() {
|
|
15887
|
-
if (
|
|
15888
|
-
|
|
15887
|
+
if (Du) return so;
|
|
15888
|
+
Du = 1;
|
|
15889
15889
|
var n = At(), u = n.assert, p = n.parseBytes, y = n.cachedProperty;
|
|
15890
15890
|
function s(a, b) {
|
|
15891
15891
|
this.eddsa = a, this._secret = p(b.secret), a.isPoint(b.pub) ? this._pub = b.pub : this._pubBytes = p(b.pub);
|
|
@@ -15923,7 +15923,7 @@ var uo, Nu;
|
|
|
15923
15923
|
function Ad() {
|
|
15924
15924
|
if (Nu) return uo;
|
|
15925
15925
|
Nu = 1;
|
|
15926
|
-
var n =
|
|
15926
|
+
var n = Dt(), u = At(), p = u.assert, y = u.cachedProperty, s = u.parseBytes;
|
|
15927
15927
|
function a(b, f) {
|
|
15928
15928
|
this.eddsa = b, typeof f != "object" && (f = s(f)), Array.isArray(f) && (p(f.length === b.encodingLength * 2, "Signature has invalid size"), f = {
|
|
15929
15929
|
R: f.slice(0, b.encodingLength),
|
|
@@ -15998,7 +15998,7 @@ function Id() {
|
|
|
15998
15998
|
var ku;
|
|
15999
15999
|
function Bd() {
|
|
16000
16000
|
return ku || (ku = 1, function(n) {
|
|
16001
|
-
var u = ht().Buffer, p = ad(), y =
|
|
16001
|
+
var u = ht().Buffer, p = ad(), y = Dt(), s = Id().ec, a = o0, b = new s("secp256k1"), f = b.curve;
|
|
16002
16002
|
function h(e, t) {
|
|
16003
16003
|
var o = new y(t);
|
|
16004
16004
|
if (o.cmp(f.p) >= 0) return null;
|
|
@@ -16152,7 +16152,7 @@ var ho, ju;
|
|
|
16152
16152
|
function Rd() {
|
|
16153
16153
|
if (ju) return ho;
|
|
16154
16154
|
ju = 1;
|
|
16155
|
-
var n = Et(), u = No().Stream, p =
|
|
16155
|
+
var n = Et(), u = No().Stream, p = qt(), y = /^[a-fA-F0-9]{8}-[a-fA-F0-9]{4}-[a-fA-F0-9]{4}-[a-fA-F0-9]{4}-[a-fA-F0-9]{12}$/;
|
|
16156
16156
|
function s(r) {
|
|
16157
16157
|
return r.charAt(0).toUpperCase() + r.slice(1);
|
|
16158
16158
|
}
|
|
@@ -16310,7 +16310,7 @@ var Nr = {}, zu;
|
|
|
16310
16310
|
function Md() {
|
|
16311
16311
|
if (zu) return Nr;
|
|
16312
16312
|
zu = 1;
|
|
16313
|
-
var n = Et(), u =
|
|
16313
|
+
var n = Et(), u = qt();
|
|
16314
16314
|
Nr.sprintf = p, Nr.printf = s, Nr.fprintf = a;
|
|
16315
16315
|
function p(h) {
|
|
16316
16316
|
var i = [
|
|
@@ -16328,14 +16328,14 @@ function Md() {
|
|
|
16328
16328
|
/* length mods (ignored) */
|
|
16329
16329
|
"([diouxXfFeEgGaAcCsSp%jr])"
|
|
16330
16330
|
/* conversion */
|
|
16331
|
-
].join(""), r = new RegExp(i), e = Array.prototype.slice.call(arguments, 1), t = h, o, c, d, m, g, _, E, I, P,
|
|
16331
|
+
].join(""), r = new RegExp(i), e = Array.prototype.slice.call(arguments, 1), t = h, o, c, d, m, g, _, E, I, P, q = "", L = 1, $ = 0, U, J;
|
|
16332
16332
|
for (n.equal(
|
|
16333
16333
|
"string",
|
|
16334
16334
|
typeof t,
|
|
16335
16335
|
"first argument must be a format string"
|
|
16336
16336
|
); (P = r.exec(t)) !== null; ) {
|
|
16337
|
-
if (
|
|
16338
|
-
|
|
16337
|
+
if (q += P[1], t = t.substring(P[0].length), J = P[0].substring(P[1].length), U = $ + P[1].length + 1, $ += P[0].length, o = P[2] || "", c = P[3] || 0, d = P[4] || "", m = P[6], g = !1, E = !1, _ = " ", m == "%") {
|
|
16338
|
+
q += "%";
|
|
16339
16339
|
continue;
|
|
16340
16340
|
}
|
|
16341
16341
|
if (e.length === 0)
|
|
@@ -16368,13 +16368,13 @@ function Md() {
|
|
|
16368
16368
|
J,
|
|
16369
16369
|
"attempted to print undefined or null as a string (argument " + L + " to sprintf)"
|
|
16370
16370
|
);
|
|
16371
|
-
|
|
16371
|
+
q += b(_, c, g, I.toString());
|
|
16372
16372
|
break;
|
|
16373
16373
|
case "d":
|
|
16374
16374
|
I = Math.floor(I);
|
|
16375
16375
|
/*jsl:fallthru*/
|
|
16376
16376
|
case "f":
|
|
16377
|
-
E = E && I > 0 ? "+" : "",
|
|
16377
|
+
E = E && I > 0 ? "+" : "", q += E + b(
|
|
16378
16378
|
_,
|
|
16379
16379
|
c,
|
|
16380
16380
|
g,
|
|
@@ -16382,13 +16382,13 @@ function Md() {
|
|
|
16382
16382
|
);
|
|
16383
16383
|
break;
|
|
16384
16384
|
case "x":
|
|
16385
|
-
|
|
16385
|
+
q += b(_, c, g, I.toString(16));
|
|
16386
16386
|
break;
|
|
16387
16387
|
case "j":
|
|
16388
|
-
c === 0 && (c = 10),
|
|
16388
|
+
c === 0 && (c = 10), q += u.inspect(I, !1, c);
|
|
16389
16389
|
break;
|
|
16390
16390
|
case "r":
|
|
16391
|
-
|
|
16391
|
+
q += f(I);
|
|
16392
16392
|
break;
|
|
16393
16393
|
default:
|
|
16394
16394
|
throw y(
|
|
@@ -16399,7 +16399,7 @@ function Md() {
|
|
|
16399
16399
|
);
|
|
16400
16400
|
}
|
|
16401
16401
|
}
|
|
16402
|
-
return
|
|
16402
|
+
return q += t, q;
|
|
16403
16403
|
}
|
|
16404
16404
|
function y(h, i, r, e) {
|
|
16405
16405
|
return n.equal(typeof h, "string"), n.equal(typeof r, "string"), n.equal(typeof i, "number"), n.equal(typeof e, "string"), new Error('format string "' + h + '": conversion specifier "' + r + '" at character ' + i + " " + e);
|
|
@@ -16500,7 +16500,7 @@ var po, Vu;
|
|
|
16500
16500
|
function b0() {
|
|
16501
16501
|
if (Vu) return po;
|
|
16502
16502
|
Vu = 1;
|
|
16503
|
-
var n = Rd(), u =
|
|
16503
|
+
var n = Rd(), u = qt(), p = Md(), y = Pd().isError, s = p.sprintf;
|
|
16504
16504
|
po = b, b.VError = b, b.SError = f, b.WError = i, b.MultiError = h;
|
|
16505
16505
|
function a(r) {
|
|
16506
16506
|
var e, t, o, c, d;
|
|
@@ -16929,7 +16929,7 @@ function ko() {
|
|
|
16929
16929
|
v.writeVarint32(k.length);
|
|
16930
16930
|
for (const G of k)
|
|
16931
16931
|
O(v, G);
|
|
16932
|
-
},
|
|
16932
|
+
}, q = (O) => (v, k) => {
|
|
16933
16933
|
for (const [G, te] of O)
|
|
16934
16934
|
try {
|
|
16935
16935
|
te(v, k[G]);
|
|
@@ -16938,31 +16938,31 @@ function ko() {
|
|
|
16938
16938
|
}
|
|
16939
16939
|
}, L = (O) => (v, k) => {
|
|
16940
16940
|
k ? (v.writeByte(1), O(v, k)) : v.writeByte(0);
|
|
16941
|
-
}, $ =
|
|
16941
|
+
}, $ = q([
|
|
16942
16942
|
["weight_threshold", e],
|
|
16943
16943
|
["account_auths", I(s, r)],
|
|
16944
16944
|
["key_auths", I(g, r)]
|
|
16945
|
-
]), U =
|
|
16945
|
+
]), U = q([
|
|
16946
16946
|
["account", s],
|
|
16947
16947
|
["weight", r]
|
|
16948
|
-
]), J =
|
|
16948
|
+
]), J = q([
|
|
16949
16949
|
["base", d],
|
|
16950
16950
|
["quote", d]
|
|
16951
|
-
]), R =
|
|
16951
|
+
]), R = q([
|
|
16952
16952
|
["end_date", m]
|
|
16953
|
-
]), l =
|
|
16953
|
+
]), l = q([
|
|
16954
16954
|
["previous", _(20)],
|
|
16955
16955
|
["timestamp", m],
|
|
16956
16956
|
["witness", s],
|
|
16957
16957
|
["transaction_merkle_root", _(20)],
|
|
16958
16958
|
["extensions", P(y)],
|
|
16959
16959
|
["witness_signature", _(65)]
|
|
16960
|
-
]), x =
|
|
16960
|
+
]), x = q([
|
|
16961
16961
|
["account_creation_fee", d],
|
|
16962
16962
|
["maximum_block_size", e],
|
|
16963
16963
|
["hbd_interest_rate", r]
|
|
16964
16964
|
]), S = (O, v) => {
|
|
16965
|
-
const k =
|
|
16965
|
+
const k = q(v);
|
|
16966
16966
|
return (G, te) => {
|
|
16967
16967
|
G.writeVarint32(O), k(G, te);
|
|
16968
16968
|
};
|
|
@@ -17035,7 +17035,7 @@ function ko() {
|
|
|
17035
17035
|
[
|
|
17036
17036
|
"extensions",
|
|
17037
17037
|
P(c([
|
|
17038
|
-
|
|
17038
|
+
q([
|
|
17039
17039
|
["beneficiaries", P(U)]
|
|
17040
17040
|
])
|
|
17041
17041
|
]))
|
|
@@ -17253,13 +17253,13 @@ function ko() {
|
|
|
17253
17253
|
} catch (G) {
|
|
17254
17254
|
throw G.message = `${v[0]}: ${G.message}`, G;
|
|
17255
17255
|
}
|
|
17256
|
-
},
|
|
17256
|
+
}, D = q([
|
|
17257
17257
|
["ref_block_num", r],
|
|
17258
17258
|
["ref_block_prefix", e],
|
|
17259
17259
|
["expiration", m],
|
|
17260
17260
|
["operations", P(M)],
|
|
17261
17261
|
["extensions", P(s)]
|
|
17262
|
-
]), K =
|
|
17262
|
+
]), K = q([
|
|
17263
17263
|
["from", g],
|
|
17264
17264
|
["to", g],
|
|
17265
17265
|
["nonce", t],
|
|
@@ -17279,14 +17279,14 @@ function ko() {
|
|
|
17279
17279
|
Int32: f,
|
|
17280
17280
|
Int64: h,
|
|
17281
17281
|
Int8: a,
|
|
17282
|
-
Object:
|
|
17282
|
+
Object: q,
|
|
17283
17283
|
Operation: M,
|
|
17284
17284
|
Optional: L,
|
|
17285
17285
|
Price: J,
|
|
17286
17286
|
PublicKey: g,
|
|
17287
17287
|
StaticVariant: c,
|
|
17288
17288
|
String: s,
|
|
17289
|
-
Transaction:
|
|
17289
|
+
Transaction: D,
|
|
17290
17290
|
UInt16: r,
|
|
17291
17291
|
UInt32: e,
|
|
17292
17292
|
UInt64: t,
|
|
@@ -17351,8 +17351,8 @@ function Od() {
|
|
|
17351
17351
|
function c(w) {
|
|
17352
17352
|
var M = {
|
|
17353
17353
|
next: function() {
|
|
17354
|
-
var
|
|
17355
|
-
return { done:
|
|
17354
|
+
var D = w.shift();
|
|
17355
|
+
return { done: D === void 0, value: D };
|
|
17356
17356
|
}
|
|
17357
17357
|
};
|
|
17358
17358
|
return h.iterable && (M[Symbol.iterator] = function() {
|
|
@@ -17360,8 +17360,8 @@ function Od() {
|
|
|
17360
17360
|
}), M;
|
|
17361
17361
|
}
|
|
17362
17362
|
function d(w) {
|
|
17363
|
-
this.map = {}, w instanceof d ? w.forEach(function(M,
|
|
17364
|
-
this.append(
|
|
17363
|
+
this.map = {}, w instanceof d ? w.forEach(function(M, D) {
|
|
17364
|
+
this.append(D, M);
|
|
17365
17365
|
}, this) : Array.isArray(w) ? w.forEach(function(M) {
|
|
17366
17366
|
if (M.length != 2)
|
|
17367
17367
|
throw new TypeError("Headers constructor: expected name/value pair to be length 2, found" + M.length);
|
|
@@ -17372,8 +17372,8 @@ function Od() {
|
|
|
17372
17372
|
}
|
|
17373
17373
|
d.prototype.append = function(w, M) {
|
|
17374
17374
|
w = t(w), M = o(M);
|
|
17375
|
-
var
|
|
17376
|
-
this.map[w] =
|
|
17375
|
+
var D = this.map[w];
|
|
17376
|
+
this.map[w] = D ? D + ", " + M : M;
|
|
17377
17377
|
}, d.prototype.delete = function(w) {
|
|
17378
17378
|
delete this.map[t(w)];
|
|
17379
17379
|
}, d.prototype.get = function(w) {
|
|
@@ -17383,12 +17383,12 @@ function Od() {
|
|
|
17383
17383
|
}, d.prototype.set = function(w, M) {
|
|
17384
17384
|
this.map[t(w)] = o(M);
|
|
17385
17385
|
}, d.prototype.forEach = function(w, M) {
|
|
17386
|
-
for (var
|
|
17387
|
-
this.map.hasOwnProperty(
|
|
17386
|
+
for (var D in this.map)
|
|
17387
|
+
this.map.hasOwnProperty(D) && w.call(M, this.map[D], D, this);
|
|
17388
17388
|
}, d.prototype.keys = function() {
|
|
17389
17389
|
var w = [];
|
|
17390
|
-
return this.forEach(function(M,
|
|
17391
|
-
w.push(
|
|
17390
|
+
return this.forEach(function(M, D) {
|
|
17391
|
+
w.push(D);
|
|
17392
17392
|
}), c(w);
|
|
17393
17393
|
}, d.prototype.values = function() {
|
|
17394
17394
|
var w = [];
|
|
@@ -17397,8 +17397,8 @@ function Od() {
|
|
|
17397
17397
|
}), c(w);
|
|
17398
17398
|
}, d.prototype.entries = function() {
|
|
17399
17399
|
var w = [];
|
|
17400
|
-
return this.forEach(function(M,
|
|
17401
|
-
w.push([
|
|
17400
|
+
return this.forEach(function(M, D) {
|
|
17401
|
+
w.push([D, M]);
|
|
17402
17402
|
}), c(w);
|
|
17403
17403
|
}, h.iterable && (d.prototype[Symbol.iterator] = d.prototype.entries);
|
|
17404
17404
|
function m(w) {
|
|
@@ -17409,26 +17409,26 @@ function Od() {
|
|
|
17409
17409
|
}
|
|
17410
17410
|
}
|
|
17411
17411
|
function g(w) {
|
|
17412
|
-
return new Promise(function(M,
|
|
17412
|
+
return new Promise(function(M, D) {
|
|
17413
17413
|
w.onload = function() {
|
|
17414
17414
|
M(w.result);
|
|
17415
17415
|
}, w.onerror = function() {
|
|
17416
|
-
|
|
17416
|
+
D(w.error);
|
|
17417
17417
|
};
|
|
17418
17418
|
});
|
|
17419
17419
|
}
|
|
17420
17420
|
function _(w) {
|
|
17421
|
-
var M = new FileReader(),
|
|
17422
|
-
return M.readAsArrayBuffer(w),
|
|
17421
|
+
var M = new FileReader(), D = g(M);
|
|
17422
|
+
return M.readAsArrayBuffer(w), D;
|
|
17423
17423
|
}
|
|
17424
17424
|
function E(w) {
|
|
17425
|
-
var M = new FileReader(),
|
|
17426
|
-
return M.readAsText(w, O),
|
|
17425
|
+
var M = new FileReader(), D = g(M), K = /charset=([A-Za-z0-9_-]+)/.exec(w.type), O = K ? K[1] : "utf-8";
|
|
17426
|
+
return M.readAsText(w, O), D;
|
|
17427
17427
|
}
|
|
17428
17428
|
function I(w) {
|
|
17429
|
-
for (var M = new Uint8Array(w),
|
|
17430
|
-
|
|
17431
|
-
return
|
|
17429
|
+
for (var M = new Uint8Array(w), D = new Array(M.length), K = 0; K < M.length; K++)
|
|
17430
|
+
D[K] = String.fromCharCode(M[K]);
|
|
17431
|
+
return D.join("");
|
|
17432
17432
|
}
|
|
17433
17433
|
function P(w) {
|
|
17434
17434
|
if (w.slice)
|
|
@@ -17436,7 +17436,7 @@ function Od() {
|
|
|
17436
17436
|
var M = new Uint8Array(w.byteLength);
|
|
17437
17437
|
return M.set(new Uint8Array(w)), M.buffer;
|
|
17438
17438
|
}
|
|
17439
|
-
function
|
|
17439
|
+
function q() {
|
|
17440
17440
|
return this.bodyUsed = !1, this._initBody = function(w) {
|
|
17441
17441
|
this.bodyUsed = this.bodyUsed, this._bodyInit = w, w ? typeof w == "string" ? this._bodyText = w : h.blob && Blob.prototype.isPrototypeOf(w) ? this._bodyBlob = w : h.formData && FormData.prototype.isPrototypeOf(w) ? this._bodyFormData = w : h.searchParams && URLSearchParams.prototype.isPrototypeOf(w) ? this._bodyText = w.toString() : h.arrayBuffer && h.blob && i(w) ? (this._bodyArrayBuffer = P(w.buffer), this._bodyInit = new Blob([this._bodyArrayBuffer])) : h.arrayBuffer && (ArrayBuffer.prototype.isPrototypeOf(w) || e(w)) ? this._bodyArrayBuffer = P(w) : this._bodyText = w = Object.prototype.toString.call(w) : (this._noBody = !0, this._bodyText = ""), this.headers.get("content-type") || (typeof w == "string" ? this.headers.set("content-type", "text/plain;charset=UTF-8") : this._bodyBlob && this._bodyBlob.type ? this.headers.set("content-type", this._bodyBlob.type) : h.searchParams && URLSearchParams.prototype.isPrototypeOf(w) && this.headers.set("content-type", "application/x-www-form-urlencoded;charset=UTF-8"));
|
|
17442
17442
|
}, h.blob && (this.blob = function() {
|
|
@@ -17490,11 +17490,11 @@ function Od() {
|
|
|
17490
17490
|
if (!(this instanceof U))
|
|
17491
17491
|
throw new TypeError('Please use the "new" operator, this DOM object constructor cannot be called as a function.');
|
|
17492
17492
|
M = M || {};
|
|
17493
|
-
var
|
|
17493
|
+
var D = M.body;
|
|
17494
17494
|
if (w instanceof U) {
|
|
17495
17495
|
if (w.bodyUsed)
|
|
17496
17496
|
throw new TypeError("Already read");
|
|
17497
|
-
this.url = w.url, this.credentials = w.credentials, M.headers || (this.headers = new d(w.headers)), this.method = w.method, this.mode = w.mode, this.signal = w.signal, !
|
|
17497
|
+
this.url = w.url, this.credentials = w.credentials, M.headers || (this.headers = new d(w.headers)), this.method = w.method, this.mode = w.mode, this.signal = w.signal, !D && w._bodyInit != null && (D = w._bodyInit, w.bodyUsed = !0);
|
|
17498
17498
|
} else
|
|
17499
17499
|
this.url = String(w);
|
|
17500
17500
|
if (this.credentials = M.credentials || this.credentials || "same-origin", (M.headers || !this.headers) && (this.headers = new d(M.headers)), this.method = $(M.method || this.method || "GET"), this.mode = M.mode || this.mode || null, this.signal = M.signal || this.signal || function() {
|
|
@@ -17502,9 +17502,9 @@ function Od() {
|
|
|
17502
17502
|
var v = new AbortController();
|
|
17503
17503
|
return v.signal;
|
|
17504
17504
|
}
|
|
17505
|
-
}(), this.referrer = null, (this.method === "GET" || this.method === "HEAD") &&
|
|
17505
|
+
}(), this.referrer = null, (this.method === "GET" || this.method === "HEAD") && D)
|
|
17506
17506
|
throw new TypeError("Body not allowed for GET or HEAD requests");
|
|
17507
|
-
if (this._initBody(
|
|
17507
|
+
if (this._initBody(D), (this.method === "GET" || this.method === "HEAD") && (M.cache === "no-store" || M.cache === "no-cache")) {
|
|
17508
17508
|
var K = /([?&])_=[^&]*/;
|
|
17509
17509
|
if (K.test(this.url))
|
|
17510
17510
|
this.url = this.url.replace(K, "$1_=" + (/* @__PURE__ */ new Date()).getTime());
|
|
@@ -17519,16 +17519,16 @@ function Od() {
|
|
|
17519
17519
|
};
|
|
17520
17520
|
function J(w) {
|
|
17521
17521
|
var M = new FormData();
|
|
17522
|
-
return w.trim().split("&").forEach(function(
|
|
17523
|
-
if (
|
|
17524
|
-
var K =
|
|
17522
|
+
return w.trim().split("&").forEach(function(D) {
|
|
17523
|
+
if (D) {
|
|
17524
|
+
var K = D.split("="), O = K.shift().replace(/\+/g, " "), v = K.join("=").replace(/\+/g, " ");
|
|
17525
17525
|
M.append(decodeURIComponent(O), decodeURIComponent(v));
|
|
17526
17526
|
}
|
|
17527
17527
|
}), M;
|
|
17528
17528
|
}
|
|
17529
17529
|
function R(w) {
|
|
17530
|
-
var M = new d(),
|
|
17531
|
-
return
|
|
17530
|
+
var M = new d(), D = w.replace(/\r?\n[\t ]+/g, " ");
|
|
17531
|
+
return D.split("\r").map(function(K) {
|
|
17532
17532
|
return K.indexOf(`
|
|
17533
17533
|
`) === 0 ? K.substr(1, K.length) : K;
|
|
17534
17534
|
}).forEach(function(K) {
|
|
@@ -17543,7 +17543,7 @@ function Od() {
|
|
|
17543
17543
|
}
|
|
17544
17544
|
}), M;
|
|
17545
17545
|
}
|
|
17546
|
-
|
|
17546
|
+
q.call(U.prototype);
|
|
17547
17547
|
function l(w, M) {
|
|
17548
17548
|
if (!(this instanceof l))
|
|
17549
17549
|
throw new TypeError('Please use the "new" operator, this DOM object constructor cannot be called as a function.');
|
|
@@ -17551,7 +17551,7 @@ function Od() {
|
|
|
17551
17551
|
throw new RangeError("Failed to construct 'Response': The status provided (0) is outside the range [200, 599].");
|
|
17552
17552
|
this.ok = this.status >= 200 && this.status < 300, this.statusText = M.statusText === void 0 ? "" : "" + M.statusText, this.headers = new d(M.headers), this.url = M.url || "", this._initBody(w);
|
|
17553
17553
|
}
|
|
17554
|
-
|
|
17554
|
+
q.call(l.prototype), l.prototype.clone = function() {
|
|
17555
17555
|
return new l(this._bodyInit, {
|
|
17556
17556
|
status: this.status,
|
|
17557
17557
|
statusText: this.statusText,
|
|
@@ -17571,14 +17571,14 @@ function Od() {
|
|
|
17571
17571
|
try {
|
|
17572
17572
|
new b.DOMException();
|
|
17573
17573
|
} catch {
|
|
17574
|
-
b.DOMException = function(M,
|
|
17575
|
-
this.message = M, this.name =
|
|
17574
|
+
b.DOMException = function(M, D) {
|
|
17575
|
+
this.message = M, this.name = D;
|
|
17576
17576
|
var K = Error(M);
|
|
17577
17577
|
this.stack = K.stack;
|
|
17578
17578
|
}, b.DOMException.prototype = Object.create(Error.prototype), b.DOMException.prototype.constructor = b.DOMException;
|
|
17579
17579
|
}
|
|
17580
17580
|
function S(w, M) {
|
|
17581
|
-
return new Promise(function(
|
|
17581
|
+
return new Promise(function(D, K) {
|
|
17582
17582
|
var O = new U(w, M);
|
|
17583
17583
|
if (O.signal && O.signal.aborted)
|
|
17584
17584
|
return K(new b.DOMException("Aborted", "AbortError"));
|
|
@@ -17594,7 +17594,7 @@ function Od() {
|
|
|
17594
17594
|
O.url.indexOf("file://") === 0 && (v.status < 200 || v.status > 599) ? V.status = 200 : V.status = v.status, V.url = "responseURL" in v ? v.responseURL : V.headers.get("X-Request-URL");
|
|
17595
17595
|
var re = "response" in v ? v.response : v.responseText;
|
|
17596
17596
|
setTimeout(function() {
|
|
17597
|
-
|
|
17597
|
+
D(new l(re, V));
|
|
17598
17598
|
}, 0);
|
|
17599
17599
|
}, v.onerror = function() {
|
|
17600
17600
|
setTimeout(function() {
|
|
@@ -17639,12 +17639,12 @@ function Od() {
|
|
|
17639
17639
|
u = s.fetch, u.default = s.fetch, u.fetch = s.fetch, u.Headers = s.Headers, u.Request = s.Request, u.Response = s.Response, n.exports = u;
|
|
17640
17640
|
}(rn, rn.exports)), rn.exports;
|
|
17641
17641
|
}
|
|
17642
|
-
var dn = { exports: {} },
|
|
17643
|
-
function
|
|
17642
|
+
var dn = { exports: {} }, qd = dn.exports, Qu;
|
|
17643
|
+
function Dd() {
|
|
17644
17644
|
return Qu || (Qu = 1, function(n, u) {
|
|
17645
17645
|
(function(p, y) {
|
|
17646
17646
|
n.exports = y();
|
|
17647
|
-
})(
|
|
17647
|
+
})(qd, function() {
|
|
17648
17648
|
var p = Math.imul, y = Math.clz32, s = Math.abs, a = Math.max, b = Math.floor;
|
|
17649
17649
|
class f extends Array {
|
|
17650
17650
|
constructor(i, r) {
|
|
@@ -17696,8 +17696,8 @@ function qd() {
|
|
|
17696
17696
|
const E = g - 12;
|
|
17697
17697
|
let I = 12 <= g ? 0 : d << 20 + g, P = 20 + g;
|
|
17698
17698
|
for (0 < E && 0 < m && (m--, d = i.__digit(m), _ |= d >>> 30 - E, I = d << E + 2, P = E + 2); 0 < P && 0 < m; ) m--, d = i.__digit(m), I |= 30 <= P ? d << P - 30 : d >>> 30 - P, P -= 30;
|
|
17699
|
-
const
|
|
17700
|
-
if ((
|
|
17699
|
+
const q = f.__decideRounding(i, P, m, d);
|
|
17700
|
+
if ((q === 1 || q === 0 && (1 & I) == 1) && (I = I + 1 >>> 0, I === 0 && (_++, _ >>> 20 != 0 && (_ = 0, c++, 1023 < c)))) return i.sign ? -1 / 0 : 1 / 0;
|
|
17701
17701
|
const L = i.sign ? -2147483648 : 0;
|
|
17702
17702
|
return c = c + 1023 << 20, f.__kBitConversionInts[1] = L | c | _, f.__kBitConversionInts[0] = I, f.__kBitConversionDouble[0];
|
|
17703
17703
|
}
|
|
@@ -18013,7 +18013,7 @@ function qd() {
|
|
|
18013
18013
|
const _ = m * d + g >>> f.__kBitsPerCharTableShift, E = new f(0 | (_ + 29) / 30, !1), I = 10 > r ? r : 10, P = 10 < r ? r - 10 : 0;
|
|
18014
18014
|
if ((r & r - 1) == 0) {
|
|
18015
18015
|
m >>= f.__kBitsPerCharTableShift;
|
|
18016
|
-
const
|
|
18016
|
+
const q = [], L = [];
|
|
18017
18017
|
let $ = !1;
|
|
18018
18018
|
do {
|
|
18019
18019
|
let U = 0, J = 0;
|
|
@@ -18031,12 +18031,12 @@ function qd() {
|
|
|
18031
18031
|
}
|
|
18032
18032
|
if (c = i.charCodeAt(o), 30 < J + m) break;
|
|
18033
18033
|
}
|
|
18034
|
-
|
|
18034
|
+
q.push(U), L.push(J);
|
|
18035
18035
|
} while (!$);
|
|
18036
|
-
f.__fillFromParts(E,
|
|
18036
|
+
f.__fillFromParts(E, q, L);
|
|
18037
18037
|
} else {
|
|
18038
18038
|
E.__initializeDigits();
|
|
18039
|
-
let
|
|
18039
|
+
let q = !1, L = 0;
|
|
18040
18040
|
do {
|
|
18041
18041
|
let $ = 0, U = 1;
|
|
18042
18042
|
for (; ; ) {
|
|
@@ -18044,13 +18044,13 @@ function qd() {
|
|
|
18044
18044
|
if (c - 48 >>> 0 < I) R = c - 48;
|
|
18045
18045
|
else if ((32 | c) - 97 >>> 0 < P) R = (32 | c) - 87;
|
|
18046
18046
|
else {
|
|
18047
|
-
|
|
18047
|
+
q = !0;
|
|
18048
18048
|
break;
|
|
18049
18049
|
}
|
|
18050
18050
|
const l = U * r;
|
|
18051
18051
|
if (1073741823 < l) break;
|
|
18052
18052
|
if (U = l, $ = $ * r + R, L++, ++o === t) {
|
|
18053
|
-
|
|
18053
|
+
q = !0;
|
|
18054
18054
|
break;
|
|
18055
18055
|
}
|
|
18056
18056
|
c = i.charCodeAt(o);
|
|
@@ -18058,7 +18058,7 @@ function qd() {
|
|
|
18058
18058
|
g = 30 * f.__kBitsPerCharTableMultiplier - 1;
|
|
18059
18059
|
const J = 0 | (m * L + g >>> f.__kBitsPerCharTableShift) / 30;
|
|
18060
18060
|
E.__inplaceMultiplyAdd(U, $, J);
|
|
18061
|
-
} while (!
|
|
18061
|
+
} while (!q);
|
|
18062
18062
|
}
|
|
18063
18063
|
if (o !== t) {
|
|
18064
18064
|
if (!f.__isWhitespace(c)) return null;
|
|
@@ -18093,8 +18093,8 @@ function qd() {
|
|
|
18093
18093
|
const J = o - P;
|
|
18094
18094
|
for (I = $ >>> J, P = 30 - J; P >= o; ) _[E--] = f.__kConversionChars[I & c], I >>>= o, P -= o;
|
|
18095
18095
|
}
|
|
18096
|
-
const
|
|
18097
|
-
for (_[E--] = f.__kConversionChars[
|
|
18096
|
+
const q = (I | d << P) & c;
|
|
18097
|
+
for (_[E--] = f.__kConversionChars[q], I = d >>> o - P; I !== 0; ) _[E--] = f.__kConversionChars[I & c], I >>>= o;
|
|
18098
18098
|
if (i.sign && (_[E--] = "-"), E != -1) throw new Error("implementation bug");
|
|
18099
18099
|
return _.join("");
|
|
18100
18100
|
}
|
|
@@ -18126,9 +18126,9 @@ function qd() {
|
|
|
18126
18126
|
I = f.__toStringGeneric($, r, !0);
|
|
18127
18127
|
}
|
|
18128
18128
|
E.__trim();
|
|
18129
|
-
let
|
|
18129
|
+
let q = f.__toStringGeneric(E, r, !0);
|
|
18130
18130
|
for (; I.length < g; ) I = "0" + I;
|
|
18131
|
-
return e === !1 && i.sign && (
|
|
18131
|
+
return e === !1 && i.sign && (q = "-" + q), q + I;
|
|
18132
18132
|
}
|
|
18133
18133
|
static __unequalSign(i) {
|
|
18134
18134
|
return i ? -1 : 1;
|
|
@@ -18178,15 +18178,15 @@ function qd() {
|
|
|
18178
18178
|
if (g < _) return f.__absoluteLess(e);
|
|
18179
18179
|
if (g > _) return f.__absoluteGreater(e);
|
|
18180
18180
|
let E = 1048576 | 1048575 & f.__kBitConversionInts[1], I = f.__kBitConversionInts[0];
|
|
18181
|
-
const P = 20,
|
|
18182
|
-
if (
|
|
18181
|
+
const P = 20, q = 29 - m;
|
|
18182
|
+
if (q !== (0 | (g - 1) % 30)) throw new Error("implementation bug");
|
|
18183
18183
|
let L, $ = 0;
|
|
18184
|
-
if (20 >
|
|
18185
|
-
const U = P -
|
|
18184
|
+
if (20 > q) {
|
|
18185
|
+
const U = P - q;
|
|
18186
18186
|
$ = U + 32, L = E >>> U, E = E << 32 - U | I >>> U, I <<= 32 - U;
|
|
18187
|
-
} else if (
|
|
18187
|
+
} else if (q === 20) $ = 32, L = E, E = I, I = 0;
|
|
18188
18188
|
else {
|
|
18189
|
-
const U =
|
|
18189
|
+
const U = q - P;
|
|
18190
18190
|
$ = 32 - U, L = E << U | I >>> 32 - U, E = I << U, I = 0;
|
|
18191
18191
|
}
|
|
18192
18192
|
if (d >>>= 0, L >>>= 0, d > L) return f.__absoluteGreater(e);
|
|
@@ -18360,8 +18360,8 @@ function qd() {
|
|
|
18360
18360
|
let d = 0, m = 0;
|
|
18361
18361
|
for (let g, _ = 0; _ < i.length; _++, t++) {
|
|
18362
18362
|
g = e.__digit(t);
|
|
18363
|
-
const E = i.__digit(_), I = 32767 & E, P = E >>> 15,
|
|
18364
|
-
g += m +
|
|
18363
|
+
const E = i.__digit(_), I = 32767 & E, P = E >>> 15, q = f.__imul(I, o), L = f.__imul(I, c), $ = f.__imul(P, o), U = f.__imul(P, c);
|
|
18364
|
+
g += m + q + d, d = g >>> 30, g &= 1073741823, g += ((32767 & L) << 15) + ((32767 & $) << 15), d += g >>> 30, m = U + (L >>> 15) + ($ >>> 15), e.__setDigit(t, 1073741823 & g);
|
|
18365
18365
|
}
|
|
18366
18366
|
for (; d != 0 || m !== 0; t++) {
|
|
18367
18367
|
let g = e.__digit(t);
|
|
@@ -18382,9 +18382,9 @@ function qd() {
|
|
|
18382
18382
|
const t = 32767 & i, o = i >>> 15;
|
|
18383
18383
|
let c = 0, d = r;
|
|
18384
18384
|
for (let m = 0; m < e; m++) {
|
|
18385
|
-
const g = this.__digit(m), _ = 32767 & g, E = g >>> 15, I = f.__imul(_, t), P = f.__imul(_, o),
|
|
18385
|
+
const g = this.__digit(m), _ = 32767 & g, E = g >>> 15, I = f.__imul(_, t), P = f.__imul(_, o), q = f.__imul(E, t), L = f.__imul(E, o);
|
|
18386
18386
|
let $ = d + I + c;
|
|
18387
|
-
c = $ >>> 30, $ &= 1073741823, $ += ((32767 & P) << 15) + ((32767 &
|
|
18387
|
+
c = $ >>> 30, $ &= 1073741823, $ += ((32767 & P) << 15) + ((32767 & q) << 15), c += $ >>> 30, d = L + (P >>> 15) + (q >>> 15), this.__setDigit(m, 1073741823 & $);
|
|
18388
18388
|
}
|
|
18389
18389
|
if (c != 0 || d !== 0) throw new Error("implementation bug");
|
|
18390
18390
|
}
|
|
@@ -18416,19 +18416,19 @@ function qd() {
|
|
|
18416
18416
|
0 < _ && (r = f.__specialLeftShift(r, _, 0));
|
|
18417
18417
|
const E = f.__specialLeftShift(i, _, 1), I = r.__halfDigit(o - 1);
|
|
18418
18418
|
let P = 0;
|
|
18419
|
-
for (let
|
|
18420
|
-
|
|
18419
|
+
for (let q, L = d; 0 <= L; L--) {
|
|
18420
|
+
q = 32767;
|
|
18421
18421
|
const $ = E.__halfDigit(L + o);
|
|
18422
18422
|
if ($ !== I) {
|
|
18423
18423
|
const J = ($ << 15 | E.__halfDigit(L + o - 1)) >>> 0;
|
|
18424
|
-
|
|
18424
|
+
q = 0 | J / I;
|
|
18425
18425
|
let R = 0 | J % I;
|
|
18426
18426
|
const l = r.__halfDigit(o - 2), x = E.__halfDigit(L + o - 2);
|
|
18427
|
-
for (; f.__imul(
|
|
18427
|
+
for (; f.__imul(q, l) >>> 0 > (R << 16 | x) >>> 0 && (q--, R += I, !(32767 < R)); ) ;
|
|
18428
18428
|
}
|
|
18429
|
-
f.__internalMultiplyAdd(r,
|
|
18429
|
+
f.__internalMultiplyAdd(r, q, 0, c, g);
|
|
18430
18430
|
let U = E.__inplaceSub(g, L, o + 1);
|
|
18431
|
-
U !== 0 && (U = E.__inplaceAdd(r, L, o), E.__setHalfDigit(L + o, 32767 & E.__halfDigit(L + o) + U),
|
|
18431
|
+
U !== 0 && (U = E.__inplaceAdd(r, L, o), E.__setHalfDigit(L + o, 32767 & E.__halfDigit(L + o) + U), q--), e && (1 & L ? P = q << 15 : m.__setDigit(L >>> 1, P | q));
|
|
18432
18432
|
}
|
|
18433
18433
|
if (t) return E.__inplaceRightShift(_), e ? { quotient: m, remainder: E } : E;
|
|
18434
18434
|
if (e) return m;
|
|
@@ -18539,8 +18539,8 @@ function qd() {
|
|
|
18539
18539
|
let E = i.__digit(c) >>> d;
|
|
18540
18540
|
const I = e - c - 1;
|
|
18541
18541
|
for (let P = 0; P < I; P++) {
|
|
18542
|
-
const
|
|
18543
|
-
_.__setDigit(P, 1073741823 &
|
|
18542
|
+
const q = i.__digit(P + c + 1);
|
|
18543
|
+
_.__setDigit(P, 1073741823 & q << 30 - d | E), E = q >>> d;
|
|
18544
18544
|
}
|
|
18545
18545
|
_.__setDigit(I, E);
|
|
18546
18546
|
}
|
|
@@ -18599,8 +18599,8 @@ function qd() {
|
|
|
18599
18599
|
const m = o - 1;
|
|
18600
18600
|
let g = 0;
|
|
18601
18601
|
for (const P = t(m, r.length); d < P; d++) {
|
|
18602
|
-
const
|
|
18603
|
-
g = 1 &
|
|
18602
|
+
const q = 0 - r.__digit(d) - g;
|
|
18603
|
+
g = 1 & q >>> 30, c.__setDigit(d, 1073741823 & q);
|
|
18604
18604
|
}
|
|
18605
18605
|
for (; d < m; d++) c.__setDigit(d, 0 | 1073741823 & -g);
|
|
18606
18606
|
let _ = m < r.length ? r.__digit(m) : 0;
|
|
@@ -18610,8 +18610,8 @@ function qd() {
|
|
|
18610
18610
|
else {
|
|
18611
18611
|
const P = 32 - E;
|
|
18612
18612
|
_ = _ << P >>> P;
|
|
18613
|
-
const
|
|
18614
|
-
I =
|
|
18613
|
+
const q = 1 << 32 - P;
|
|
18614
|
+
I = q - _ - g, I &= q - 1;
|
|
18615
18615
|
}
|
|
18616
18616
|
return c.__setDigit(m, I), c.__trim();
|
|
18617
18617
|
}
|
|
@@ -18697,12 +18697,12 @@ function Uo() {
|
|
|
18697
18697
|
* in the design, construction, operation or maintenance of any military facility.
|
|
18698
18698
|
*/
|
|
18699
18699
|
var n = dt && dt.__awaiter || function(g, _, E, I) {
|
|
18700
|
-
function P(
|
|
18701
|
-
return
|
|
18702
|
-
L(
|
|
18700
|
+
function P(q) {
|
|
18701
|
+
return q instanceof E ? q : new E(function(L) {
|
|
18702
|
+
L(q);
|
|
18703
18703
|
});
|
|
18704
18704
|
}
|
|
18705
|
-
return new (E || (E = Promise))(function(
|
|
18705
|
+
return new (E || (E = Promise))(function(q, L) {
|
|
18706
18706
|
function $(R) {
|
|
18707
18707
|
try {
|
|
18708
18708
|
J(I.next(R));
|
|
@@ -18718,7 +18718,7 @@ function Uo() {
|
|
|
18718
18718
|
}
|
|
18719
18719
|
}
|
|
18720
18720
|
function J(R) {
|
|
18721
|
-
R.done ?
|
|
18721
|
+
R.done ? q(R.value) : P(R.value).then($, U);
|
|
18722
18722
|
}
|
|
18723
18723
|
J((I = I.apply(g, _ || [])).next());
|
|
18724
18724
|
});
|
|
@@ -18728,16 +18728,16 @@ function Uo() {
|
|
|
18728
18728
|
return _ ? _.call(g) : (g = typeof __values == "function" ? __values(g) : g[Symbol.iterator](), E = {}, I("next"), I("throw"), I("return"), E[Symbol.asyncIterator] = function() {
|
|
18729
18729
|
return this;
|
|
18730
18730
|
}, E);
|
|
18731
|
-
function I(
|
|
18732
|
-
E[
|
|
18731
|
+
function I(q) {
|
|
18732
|
+
E[q] = g[q] && function(L) {
|
|
18733
18733
|
return new Promise(function($, U) {
|
|
18734
|
-
L = g[
|
|
18734
|
+
L = g[q](L), P($, U, L.done, L.value);
|
|
18735
18735
|
});
|
|
18736
18736
|
};
|
|
18737
18737
|
}
|
|
18738
|
-
function P(
|
|
18738
|
+
function P(q, L, $, U) {
|
|
18739
18739
|
Promise.resolve(U).then(function(J) {
|
|
18740
|
-
|
|
18740
|
+
q({ value: J, done: $ });
|
|
18741
18741
|
}, L);
|
|
18742
18742
|
}
|
|
18743
18743
|
};
|
|
@@ -18760,7 +18760,7 @@ function Uo() {
|
|
|
18760
18760
|
return n(this, void 0, void 0, function* () {
|
|
18761
18761
|
var I, P;
|
|
18762
18762
|
try {
|
|
18763
|
-
for (var
|
|
18763
|
+
for (var q = u(g), L; L = yield q.next(), !L.done; ) {
|
|
18764
18764
|
const $ = L.value;
|
|
18765
18765
|
_.write($) || (yield a(_, "drain"));
|
|
18766
18766
|
}
|
|
@@ -18768,7 +18768,7 @@ function Uo() {
|
|
|
18768
18768
|
I = { error: $ };
|
|
18769
18769
|
} finally {
|
|
18770
18770
|
try {
|
|
18771
|
-
L && !L.done && (P =
|
|
18771
|
+
L && !L.done && (P = q.return) && (yield P.call(q));
|
|
18772
18772
|
} finally {
|
|
18773
18773
|
if (I) throw I.error;
|
|
18774
18774
|
}
|
|
@@ -18784,7 +18784,7 @@ function Uo() {
|
|
|
18784
18784
|
return JSON.parse(JSON.stringify(g));
|
|
18785
18785
|
}
|
|
18786
18786
|
dt.copy = h;
|
|
18787
|
-
function i(g, _, E, I, P,
|
|
18787
|
+
function i(g, _, E, I, P, q, L, $) {
|
|
18788
18788
|
return n(this, void 0, void 0, function* () {
|
|
18789
18789
|
let U = Date.now(), J = 0, R = 0;
|
|
18790
18790
|
do
|
|
@@ -18797,10 +18797,10 @@ function Uo() {
|
|
|
18797
18797
|
} catch (l) {
|
|
18798
18798
|
if (I !== 0 && Date.now() - U > I)
|
|
18799
18799
|
if ((!l || !l.code) && Array.isArray(_))
|
|
18800
|
-
g = r(g, _, g,
|
|
18800
|
+
g = r(g, _, g, q);
|
|
18801
18801
|
else if (s.filter((S) => l && l.code && l.code.includes(S)).length > 0 && Array.isArray(_) && _.length > 1)
|
|
18802
18802
|
if (R < P)
|
|
18803
|
-
U = Date.now(), J = -1, P > 0 && R++, g = r(g, _, g,
|
|
18803
|
+
U = Date.now(), J = -1, P > 0 && R++, g = r(g, _, g, q);
|
|
18804
18804
|
else
|
|
18805
18805
|
throw l.message = `[${l.code}] tried ${P} times with ${_.join(",")}`, l;
|
|
18806
18806
|
else
|
|
@@ -18812,8 +18812,8 @@ function Uo() {
|
|
|
18812
18812
|
}
|
|
18813
18813
|
dt.retryingFetch = i;
|
|
18814
18814
|
const r = (g, _, E, I) => {
|
|
18815
|
-
const P = _.indexOf(g),
|
|
18816
|
-
return I && console.log(`Switched Hive RPC: ${
|
|
18815
|
+
const P = _.indexOf(g), q = _.length === P + 1 ? _[0] : _[P + 1];
|
|
18816
|
+
return I && console.log(`Switched Hive RPC: ${q} (previous: ${E})`), q;
|
|
18817
18817
|
}, e = Hr(), t = ko(), o = (g, _) => {
|
|
18818
18818
|
const E = new e(e.DEFAULT_CAPACITY, e.LITTLE_ENDIAN);
|
|
18819
18819
|
return g(E, _), E.flip(), E.toString("hex");
|
|
@@ -18855,7 +18855,7 @@ function Uo() {
|
|
|
18855
18855
|
}
|
|
18856
18856
|
return E.props.sort((I, P) => I[0].localeCompare(P[0])), ["witness_set_properties", E];
|
|
18857
18857
|
};
|
|
18858
|
-
const c =
|
|
18858
|
+
const c = Dd();
|
|
18859
18859
|
dt.operationOrders = {
|
|
18860
18860
|
vote: 0,
|
|
18861
18861
|
// tslint:disable-next-line: object-literal-sort-keys
|
|
@@ -19031,16 +19031,16 @@ function Nd() {
|
|
|
19031
19031
|
}, t;
|
|
19032
19032
|
function c(I) {
|
|
19033
19033
|
e[I] && (t[I] = function(P) {
|
|
19034
|
-
return new Promise(function(
|
|
19035
|
-
o.push([I, P,
|
|
19034
|
+
return new Promise(function(q, L) {
|
|
19035
|
+
o.push([I, P, q, L]) > 1 || d(I, P);
|
|
19036
19036
|
});
|
|
19037
19037
|
});
|
|
19038
19038
|
}
|
|
19039
19039
|
function d(I, P) {
|
|
19040
19040
|
try {
|
|
19041
19041
|
m(e[I](P));
|
|
19042
|
-
} catch (
|
|
19043
|
-
E(o[0][3],
|
|
19042
|
+
} catch (q) {
|
|
19043
|
+
E(o[0][3], q);
|
|
19044
19044
|
}
|
|
19045
19045
|
}
|
|
19046
19046
|
function m(I) {
|
|
@@ -19398,8 +19398,8 @@ function Ld() {
|
|
|
19398
19398
|
const { username: i, metadata: r, creator: e } = f, t = this.client.addressPrefix;
|
|
19399
19399
|
let o, c, d, m;
|
|
19400
19400
|
if (f.password) {
|
|
19401
|
-
const
|
|
19402
|
-
o = p.Authority.from(
|
|
19401
|
+
const q = s.PrivateKey.fromLogin(i, f.password, "owner").createPublic(t);
|
|
19402
|
+
o = p.Authority.from(q);
|
|
19403
19403
|
const L = s.PrivateKey.fromLogin(i, f.password, "active").createPublic(t);
|
|
19404
19404
|
c = p.Authority.from(L);
|
|
19405
19405
|
const $ = s.PrivateKey.fromLogin(i, f.password, "posting").createPublic(t);
|
|
@@ -19410,7 +19410,7 @@ function Ld() {
|
|
|
19410
19410
|
throw new Error("Must specify either password or auths");
|
|
19411
19411
|
let { fee: g, delegation: _ } = f;
|
|
19412
19412
|
if (_ = y.Asset.from(_ || 0, "VESTS"), g = y.Asset.from(g || 0, "TESTS"), g.amount > 0) {
|
|
19413
|
-
const
|
|
19413
|
+
const q = yield this.client.database.getChainProperties(), L = y.Asset.from(q.account_creation_fee);
|
|
19414
19414
|
if (g.amount !== L.amount)
|
|
19415
19415
|
throw new Error("Fee must be exactly " + L.toString());
|
|
19416
19416
|
}
|
|
@@ -19435,7 +19435,7 @@ function Ld() {
|
|
|
19435
19435
|
}
|
|
19436
19436
|
], P = [E, I];
|
|
19437
19437
|
if (_.amount > 0) {
|
|
19438
|
-
const
|
|
19438
|
+
const q = [
|
|
19439
19439
|
"delegate_vesting_shares",
|
|
19440
19440
|
{
|
|
19441
19441
|
delegatee: i,
|
|
@@ -19443,7 +19443,7 @@ function Ld() {
|
|
|
19443
19443
|
vesting_shares: _
|
|
19444
19444
|
}
|
|
19445
19445
|
];
|
|
19446
|
-
P.push(
|
|
19446
|
+
P.push(q);
|
|
19447
19447
|
}
|
|
19448
19448
|
return this.sendOperations(P, h);
|
|
19449
19449
|
});
|
|
@@ -20068,7 +20068,7 @@ function Vd() {
|
|
|
20068
20068
|
});
|
|
20069
20069
|
}
|
|
20070
20070
|
return new (g || (g = Promise))(function(I, P) {
|
|
20071
|
-
function
|
|
20071
|
+
function q(U) {
|
|
20072
20072
|
try {
|
|
20073
20073
|
$(_.next(U));
|
|
20074
20074
|
} catch (J) {
|
|
@@ -20083,7 +20083,7 @@ function Vd() {
|
|
|
20083
20083
|
}
|
|
20084
20084
|
}
|
|
20085
20085
|
function $(U) {
|
|
20086
|
-
U.done ? I(U.value) : E(U.value).then(
|
|
20086
|
+
U.done ? I(U.value) : E(U.value).then(q, L);
|
|
20087
20087
|
}
|
|
20088
20088
|
$((_ = _.apply(d, m || [])).next());
|
|
20089
20089
|
});
|
|
@@ -20135,9 +20135,9 @@ function Vd() {
|
|
|
20135
20135
|
typeof self === void 0 && (P.headers = {
|
|
20136
20136
|
"User-Agent": `dhive/${s.default}`
|
|
20137
20137
|
}), this.options.agent && (P.agent = this.options.agent);
|
|
20138
|
-
let
|
|
20139
|
-
m !== "network_broadcast_api" && !g.startsWith("broadcast_transaction") && (
|
|
20140
|
-
const { response: L, currentAddress: $ } = yield t.retryingFetch(this.currentAddress, this.address, P, this.timeout, this.failoverThreshold, this.consoleOnFailover, this.backoff,
|
|
20138
|
+
let q;
|
|
20139
|
+
m !== "network_broadcast_api" && !g.startsWith("broadcast_transaction") && (q = (U) => (U + 1) * 500);
|
|
20140
|
+
const { response: L, currentAddress: $ } = yield t.retryingFetch(this.currentAddress, this.address, P, this.timeout, this.failoverThreshold, this.consoleOnFailover, this.backoff, q);
|
|
20141
20141
|
if ($ !== this.currentAddress && (this.currentAddress = $), L.error) {
|
|
20142
20142
|
const U = (l) => {
|
|
20143
20143
|
switch (typeof l) {
|
|
@@ -20151,8 +20151,8 @@ function Vd() {
|
|
|
20151
20151
|
if (J && J.stack && J.stack.length > 0) {
|
|
20152
20152
|
const l = J.stack[0], x = t.copy(l.data);
|
|
20153
20153
|
R = l.format.replace(/\$\{([a-z_]+)\}/gi, (w, M) => {
|
|
20154
|
-
let
|
|
20155
|
-
return x[M] && (
|
|
20154
|
+
let D = w;
|
|
20155
|
+
return x[M] && (D = U(x[M]), delete x[M]), D;
|
|
20156
20156
|
});
|
|
20157
20157
|
const S = Object.keys(x).map((w) => ({ key: w, value: U(x[w]) })).map((w) => `${w.key}=${w.value}`);
|
|
20158
20158
|
S.length > 0 && (R += " " + S.join(" "));
|
|
@@ -20229,8 +20229,8 @@ function wr() {
|
|
|
20229
20229
|
function E(S) {
|
|
20230
20230
|
const w = S.slice(0, 3);
|
|
20231
20231
|
u.equal(w.length, 3, "public key invalid prefix"), S = S.slice(3);
|
|
20232
|
-
const M = s.decode(S),
|
|
20233
|
-
return u.deepEqual(O,
|
|
20232
|
+
const M = s.decode(S), D = M.slice(-4), K = M.slice(0, -4), O = c(K).slice(0, 4);
|
|
20233
|
+
return u.deepEqual(O, D, "public key checksum mismatch"), { key: K, prefix: w };
|
|
20234
20234
|
}
|
|
20235
20235
|
function I(S) {
|
|
20236
20236
|
u.equal(S.readUInt8(0), 128, "private key network id mismatch");
|
|
@@ -20240,17 +20240,17 @@ function wr() {
|
|
|
20240
20240
|
function P(S) {
|
|
20241
20241
|
const w = s.decode(S);
|
|
20242
20242
|
u.deepEqual(w.slice(0, 1), n.NETWORK_ID, "private key network id mismatch");
|
|
20243
|
-
const M = w.slice(-4),
|
|
20244
|
-
return u.deepEqual(K, M, "private key checksum mismatch"),
|
|
20243
|
+
const M = w.slice(-4), D = w.slice(0, -4), K = g(D).slice(0, 4);
|
|
20244
|
+
return u.deepEqual(K, M, "private key checksum mismatch"), D;
|
|
20245
20245
|
}
|
|
20246
|
-
function
|
|
20246
|
+
function q(S) {
|
|
20247
20247
|
return !(S[0] & 128) && !(S[0] === 0 && !(S[1] & 128)) && !(S[32] & 128) && !(S[32] === 0 && !(S[33] & 128));
|
|
20248
20248
|
}
|
|
20249
20249
|
function L(S) {
|
|
20250
20250
|
try {
|
|
20251
|
-
const w = new Ge(s.decode(S)), M = w.slice(0, -4),
|
|
20251
|
+
const w = new Ge(s.decode(S)), M = w.slice(0, -4), D = w.slice(-4);
|
|
20252
20252
|
let K = d(M);
|
|
20253
|
-
return K = d(K), K = K.slice(0, 4),
|
|
20253
|
+
return K = d(K), K = K.slice(0, 4), D.toString() === K.toString();
|
|
20254
20254
|
} catch {
|
|
20255
20255
|
return !1;
|
|
20256
20256
|
}
|
|
@@ -20266,8 +20266,8 @@ function wr() {
|
|
|
20266
20266
|
* Create a new instance from a WIF-encoded key.
|
|
20267
20267
|
*/
|
|
20268
20268
|
static fromString(w) {
|
|
20269
|
-
const { key: M, prefix:
|
|
20270
|
-
return new $(M,
|
|
20269
|
+
const { key: M, prefix: D } = E(w);
|
|
20270
|
+
return new $(M, D);
|
|
20271
20271
|
}
|
|
20272
20272
|
/**
|
|
20273
20273
|
* Create a new instance.
|
|
@@ -20328,8 +20328,8 @@ function wr() {
|
|
|
20328
20328
|
/**
|
|
20329
20329
|
* Create key from username and password.
|
|
20330
20330
|
*/
|
|
20331
|
-
static fromLogin(w, M,
|
|
20332
|
-
const K = w +
|
|
20331
|
+
static fromLogin(w, M, D = "active") {
|
|
20332
|
+
const K = w + D + M;
|
|
20333
20333
|
return U.fromSeed(K);
|
|
20334
20334
|
}
|
|
20335
20335
|
multiply(w) {
|
|
@@ -20340,13 +20340,13 @@ function wr() {
|
|
|
20340
20340
|
* @param message 32-byte message.
|
|
20341
20341
|
*/
|
|
20342
20342
|
sign(w) {
|
|
20343
|
-
let M,
|
|
20343
|
+
let M, D = 0;
|
|
20344
20344
|
do {
|
|
20345
20345
|
const K = {
|
|
20346
|
-
data: d(Ge.concat([w, Ge.alloc(1, ++
|
|
20346
|
+
data: d(Ge.concat([w, Ge.alloc(1, ++D)]))
|
|
20347
20347
|
};
|
|
20348
20348
|
M = h.sign(w, this.key, K);
|
|
20349
|
-
} while (!
|
|
20349
|
+
} while (!q(M.signature));
|
|
20350
20350
|
return new J(M.signature, M.recovery);
|
|
20351
20351
|
}
|
|
20352
20352
|
/**
|
|
@@ -20384,8 +20384,8 @@ function wr() {
|
|
|
20384
20384
|
}
|
|
20385
20385
|
static fromBuffer(w) {
|
|
20386
20386
|
u.equal(w.length, 65, "invalid signature");
|
|
20387
|
-
const M = w.readUInt8(0) - 31,
|
|
20388
|
-
return new J(
|
|
20387
|
+
const M = w.readUInt8(0) - 31, D = w.slice(1);
|
|
20388
|
+
return new J(D, M);
|
|
20389
20389
|
}
|
|
20390
20390
|
static fromString(w) {
|
|
20391
20391
|
return J.fromBuffer(Ge.from(w, "hex"));
|
|
@@ -20414,14 +20414,14 @@ function wr() {
|
|
|
20414
20414
|
throw new i.VError({ cause: O, name: "SerializationError" }, "Unable to serialize transaction");
|
|
20415
20415
|
}
|
|
20416
20416
|
M.flip();
|
|
20417
|
-
const
|
|
20418
|
-
return d(Ge.concat([w,
|
|
20417
|
+
const D = Ge.from(M.toBuffer());
|
|
20418
|
+
return d(Ge.concat([w, D]));
|
|
20419
20419
|
}
|
|
20420
20420
|
function l(S, w, M = e.DEFAULT_CHAIN_ID) {
|
|
20421
|
-
const
|
|
20421
|
+
const D = R(S, M), K = t.copy(S);
|
|
20422
20422
|
K.signatures || (K.signatures = []), Array.isArray(w) || (w = [w]);
|
|
20423
20423
|
for (const O of w) {
|
|
20424
|
-
const v = O.sign(
|
|
20424
|
+
const v = O.sign(D);
|
|
20425
20425
|
K.signatures.push(v.toString());
|
|
20426
20426
|
}
|
|
20427
20427
|
return K;
|
|
@@ -20430,8 +20430,8 @@ function wr() {
|
|
|
20430
20430
|
const w = new a(a.DEFAULT_CAPACITY, a.LITTLE_ENDIAN);
|
|
20431
20431
|
try {
|
|
20432
20432
|
r.Types.Transaction(w, S);
|
|
20433
|
-
} catch (
|
|
20434
|
-
throw new i.VError({ cause:
|
|
20433
|
+
} catch (D) {
|
|
20434
|
+
throw new i.VError({ cause: D, name: "SerializationError" }, "Unable to serialize transaction");
|
|
20435
20435
|
}
|
|
20436
20436
|
w.flip();
|
|
20437
20437
|
const M = Ge.from(w.toBuffer());
|
|
@@ -20443,7 +20443,7 @@ function wr() {
|
|
|
20443
20443
|
encodePrivate: I,
|
|
20444
20444
|
encodePublic: _,
|
|
20445
20445
|
generateTrxId: x,
|
|
20446
|
-
isCanonicalSignature:
|
|
20446
|
+
isCanonicalSignature: q,
|
|
20447
20447
|
isWif: L,
|
|
20448
20448
|
ripemd160: c,
|
|
20449
20449
|
sha256: d,
|
|
@@ -20511,14 +20511,14 @@ function Wd() {
|
|
|
20511
20511
|
m.writeUint64(c), m.append(d.toString("binary"), "binary"), m = Ge.from(m.copy(0, m.offset).toBinary(), "binary");
|
|
20512
20512
|
const g = p.createHash("sha512").update(m).digest(), _ = g.slice(32, 48), E = g.slice(0, 32), I = p.createHash("sha256").update(g).digest().slice(0, 4), P = y.fromBinary(I.toString("binary"), y.DEFAULT_CAPACITY, y.LITTLE_ENDIAN);
|
|
20513
20513
|
y.fromBinary(I.toString("binary"), y.DEFAULT_CAPACITY, y.LITTLE_ENDIAN);
|
|
20514
|
-
const
|
|
20514
|
+
const q = P.readUint32();
|
|
20515
20515
|
if (o) {
|
|
20516
|
-
if (
|
|
20516
|
+
if (q !== o)
|
|
20517
20517
|
throw new Error("Invalid key");
|
|
20518
20518
|
t = n.cryptoJsDecrypt(t, E, _);
|
|
20519
20519
|
} else
|
|
20520
20520
|
t = n.cryptoJsEncrypt(t, E, _);
|
|
20521
|
-
return { nonce: c, message: t, checksum:
|
|
20521
|
+
return { nonce: c, message: t, checksum: q };
|
|
20522
20522
|
};
|
|
20523
20523
|
n.cryptoJsDecrypt = (i, r, e) => {
|
|
20524
20524
|
u(i, "Missing cipher text");
|
|
@@ -20563,8 +20563,8 @@ function Yd() {
|
|
|
20563
20563
|
nonce: _,
|
|
20564
20564
|
to: o
|
|
20565
20565
|
}), P.flip();
|
|
20566
|
-
const
|
|
20567
|
-
return "#" + n.encode(
|
|
20566
|
+
const q = Ge.from(P.toBuffer());
|
|
20567
|
+
return "#" + n.encode(q);
|
|
20568
20568
|
}, f = (t, o) => {
|
|
20569
20569
|
if (!o.startsWith("#"))
|
|
20570
20570
|
return o;
|
|
@@ -20572,11 +20572,11 @@ function Yd() {
|
|
|
20572
20572
|
let c = p.types.EncryptedMemoD(Ge.from(o, "binary"));
|
|
20573
20573
|
const { from: d, to: m, nonce: g, check: _, encrypted: E } = c, P = t.createPublic().toString() === new s.PublicKey(d.key).toString() ? new s.PublicKey(m.key) : new s.PublicKey(d.key);
|
|
20574
20574
|
c = a.decrypt(t, P, g, E, _);
|
|
20575
|
-
const
|
|
20575
|
+
const q = u.fromBinary(c.toString("binary"), u.LITTLE_ENDIAN);
|
|
20576
20576
|
try {
|
|
20577
|
-
return
|
|
20577
|
+
return q.mark(), "#" + q.readVString();
|
|
20578
20578
|
} catch {
|
|
20579
|
-
return
|
|
20579
|
+
return q.reset(), o = Ge.from(q.toString("binary"), "binary").toString("utf-8"), "#" + o;
|
|
20580
20580
|
}
|
|
20581
20581
|
};
|
|
20582
20582
|
let h;
|
|
@@ -20623,7 +20623,7 @@ async function Jd(n, u) {
|
|
|
20623
20623
|
async function c1(n, u) {
|
|
20624
20624
|
const p = await Jd(n, u);
|
|
20625
20625
|
switch (n) {
|
|
20626
|
-
case
|
|
20626
|
+
case qe.BTC: {
|
|
20627
20627
|
const y = await fetch("https://mempool.space/api/tx", {
|
|
20628
20628
|
method: "POST",
|
|
20629
20629
|
body: p
|
|
@@ -20631,9 +20631,9 @@ async function c1(n, u) {
|
|
|
20631
20631
|
if (!y.ok) throw new Error("Broadcast failed");
|
|
20632
20632
|
return y.text();
|
|
20633
20633
|
}
|
|
20634
|
-
case
|
|
20635
|
-
case
|
|
20636
|
-
const y = n ===
|
|
20634
|
+
case qe.ETH:
|
|
20635
|
+
case qe.BNB: {
|
|
20636
|
+
const y = n === qe.ETH ? "https://rpc.ankr.com/eth" : "https://bsc-dataseed.binance.org", a = await (await fetch(y, {
|
|
20637
20637
|
method: "POST",
|
|
20638
20638
|
headers: { "Content-Type": "application/json" },
|
|
20639
20639
|
body: JSON.stringify({
|
|
@@ -20646,7 +20646,7 @@ async function c1(n, u) {
|
|
|
20646
20646
|
if (a.error) throw new Error(a.error.message);
|
|
20647
20647
|
return a.result;
|
|
20648
20648
|
}
|
|
20649
|
-
case
|
|
20649
|
+
case qe.SOL: {
|
|
20650
20650
|
const s = await (await fetch(
|
|
20651
20651
|
`https://rpc.helius.xyz/?api-key=${Ie.heliusApiKey}`,
|
|
20652
20652
|
{
|
|
@@ -20663,7 +20663,7 @@ async function c1(n, u) {
|
|
|
20663
20663
|
if (s.error) throw new Error(s.error.message);
|
|
20664
20664
|
return s.result;
|
|
20665
20665
|
}
|
|
20666
|
-
case
|
|
20666
|
+
case qe.TRON: {
|
|
20667
20667
|
const s = await (await fetch(
|
|
20668
20668
|
"https://api.trongrid.io/wallet/broadcasttransaction",
|
|
20669
20669
|
{
|
|
@@ -20675,7 +20675,7 @@ async function c1(n, u) {
|
|
|
20675
20675
|
if (s.result === !1) throw new Error(s.message);
|
|
20676
20676
|
return s.txid || s.result;
|
|
20677
20677
|
}
|
|
20678
|
-
case
|
|
20678
|
+
case qe.TON: {
|
|
20679
20679
|
const s = await (await fetch("https://toncenter.com/api/v2/sendTransaction", {
|
|
20680
20680
|
method: "POST",
|
|
20681
20681
|
headers: { "Content-Type": "application/json" },
|
|
@@ -20684,7 +20684,7 @@ async function c1(n, u) {
|
|
|
20684
20684
|
if (s.error) throw new Error(s.error.message || s.result);
|
|
20685
20685
|
return s.result;
|
|
20686
20686
|
}
|
|
20687
|
-
case
|
|
20687
|
+
case qe.APT: {
|
|
20688
20688
|
const y = await fetch(
|
|
20689
20689
|
"https://fullnode.mainnet.aptoslabs.com/v1/transactions",
|
|
20690
20690
|
{
|
|
@@ -20720,18 +20720,18 @@ function b1(n) {
|
|
|
20720
20720
|
}
|
|
20721
20721
|
function y1(n, u) {
|
|
20722
20722
|
switch (n) {
|
|
20723
|
-
case
|
|
20723
|
+
case qe.BTC:
|
|
20724
20724
|
return Zd(u);
|
|
20725
|
-
case
|
|
20726
|
-
case
|
|
20725
|
+
case qe.ETH:
|
|
20726
|
+
case qe.BNB:
|
|
20727
20727
|
return u;
|
|
20728
|
-
case
|
|
20728
|
+
case qe.SOL:
|
|
20729
20729
|
return u;
|
|
20730
|
-
case
|
|
20730
|
+
case qe.TRON:
|
|
20731
20731
|
return u;
|
|
20732
|
-
case
|
|
20732
|
+
case qe.TON:
|
|
20733
20733
|
return u;
|
|
20734
|
-
case
|
|
20734
|
+
case qe.APT:
|
|
20735
20735
|
return u;
|
|
20736
20736
|
default:
|
|
20737
20737
|
throw new Error("Unsupported currency");
|
|
@@ -20802,12 +20802,12 @@ function Ht(n) {
|
|
|
20802
20802
|
staleTime: 6e4,
|
|
20803
20803
|
refetchInterval: 9e4,
|
|
20804
20804
|
queryFn: async () => {
|
|
20805
|
-
await
|
|
20805
|
+
await Ne().prefetchQuery(hr()), await Ne().prefetchQuery(
|
|
20806
20806
|
yt(n)
|
|
20807
20807
|
);
|
|
20808
|
-
const u =
|
|
20808
|
+
const u = Ne().getQueryData(
|
|
20809
20809
|
hr().queryKey
|
|
20810
|
-
), p =
|
|
20810
|
+
), p = Ne().getQueryData(
|
|
20811
20811
|
yt(n).queryKey
|
|
20812
20812
|
);
|
|
20813
20813
|
return {
|
|
@@ -20831,12 +20831,12 @@ function m0(n) {
|
|
|
20831
20831
|
staleTime: 6e4,
|
|
20832
20832
|
refetchInterval: 9e4,
|
|
20833
20833
|
queryFn: async () => {
|
|
20834
|
-
await
|
|
20834
|
+
await Ne().prefetchQuery(hr()), await Ne().prefetchQuery(
|
|
20835
20835
|
yt(n)
|
|
20836
20836
|
);
|
|
20837
|
-
const u =
|
|
20837
|
+
const u = Ne().getQueryData(
|
|
20838
20838
|
hr().queryKey
|
|
20839
|
-
), p =
|
|
20839
|
+
), p = Ne().getQueryData(
|
|
20840
20840
|
yt(n).queryKey
|
|
20841
20841
|
);
|
|
20842
20842
|
return !u || !p ? {
|
|
@@ -20882,12 +20882,12 @@ function rp(n) {
|
|
|
20882
20882
|
staleTime: 6e4,
|
|
20883
20883
|
refetchInterval: 9e4,
|
|
20884
20884
|
queryFn: async () => {
|
|
20885
|
-
await
|
|
20885
|
+
await Ne().prefetchQuery(hr()), await Ne().prefetchQuery(
|
|
20886
20886
|
yt(n)
|
|
20887
20887
|
);
|
|
20888
|
-
const u =
|
|
20888
|
+
const u = Ne().getQueryData(
|
|
20889
20889
|
yt(n).queryKey
|
|
20890
|
-
), p =
|
|
20890
|
+
), p = Ne().getQueryData(
|
|
20891
20891
|
hr().queryKey
|
|
20892
20892
|
);
|
|
20893
20893
|
return u ? {
|
|
@@ -21135,8 +21135,8 @@ function w1(n = 86400) {
|
|
|
21135
21135
|
"get_market_history",
|
|
21136
21136
|
[
|
|
21137
21137
|
n,
|
|
21138
|
-
|
|
21139
|
-
|
|
21138
|
+
Dr(u).format("YYYY-MM-DDTHH:mm:ss"),
|
|
21139
|
+
Dr(p).format("YYYY-MM-DDTHH:mm:ss")
|
|
21140
21140
|
]
|
|
21141
21141
|
)).map(({ hive: s, non_hive: a, open: b }) => ({
|
|
21142
21142
|
close: a.close / s.close,
|
|
@@ -21148,12 +21148,12 @@ function w1(n = 86400) {
|
|
|
21148
21148
|
})),
|
|
21149
21149
|
initialPageParam: [
|
|
21150
21150
|
// Fetch at least 8 hours or given interval
|
|
21151
|
-
|
|
21151
|
+
Dr().subtract(Math.max(100 * n, 28800), "second").toDate(),
|
|
21152
21152
|
/* @__PURE__ */ new Date()
|
|
21153
21153
|
],
|
|
21154
21154
|
getNextPageParam: (u, p, [y]) => [
|
|
21155
|
-
|
|
21156
|
-
|
|
21155
|
+
Dr(y.getTime()).subtract(Math.max(100 * n, 28800), "second").toDate(),
|
|
21156
|
+
Dr(y.getTime()).subtract(n, "second").toDate()
|
|
21157
21157
|
]
|
|
21158
21158
|
});
|
|
21159
21159
|
}
|
|
@@ -21516,14 +21516,14 @@ function cp(n) {
|
|
|
21516
21516
|
staleTime: 6e4,
|
|
21517
21517
|
refetchInterval: 9e4,
|
|
21518
21518
|
queryFn: async () => {
|
|
21519
|
-
await
|
|
21519
|
+
await Ne().prefetchQuery(pr(n)), await Ne().prefetchQuery(dr()), await Ne().prefetchQuery(
|
|
21520
21520
|
Ht(n)
|
|
21521
21521
|
);
|
|
21522
|
-
const u =
|
|
21522
|
+
const u = Ne().getQueryData(
|
|
21523
21523
|
pr(n).queryKey
|
|
21524
|
-
), p =
|
|
21524
|
+
), p = Ne().getQueryData(
|
|
21525
21525
|
dr().queryKey
|
|
21526
|
-
), y =
|
|
21526
|
+
), y = Ne().getQueryData(
|
|
21527
21527
|
Ht(n).queryKey
|
|
21528
21528
|
);
|
|
21529
21529
|
if (!u || !p)
|
|
@@ -21555,14 +21555,14 @@ function lp(n) {
|
|
|
21555
21555
|
staleTime: 6e4,
|
|
21556
21556
|
refetchInterval: 9e4,
|
|
21557
21557
|
queryFn: async () => {
|
|
21558
|
-
await
|
|
21558
|
+
await Ne().prefetchQuery(pr(n)), await Ne().prefetchQuery(dr()), await Ne().prefetchQuery(
|
|
21559
21559
|
Ht(n)
|
|
21560
21560
|
);
|
|
21561
|
-
const u =
|
|
21561
|
+
const u = Ne().getQueryData(
|
|
21562
21562
|
pr(n).queryKey
|
|
21563
|
-
), p =
|
|
21563
|
+
), p = Ne().getQueryData(
|
|
21564
21564
|
dr().queryKey
|
|
21565
|
-
), y =
|
|
21565
|
+
), y = Ne().getQueryData(
|
|
21566
21566
|
Ht(n).queryKey
|
|
21567
21567
|
);
|
|
21568
21568
|
if (!u || !p)
|
|
@@ -21607,14 +21607,14 @@ function hp(n) {
|
|
|
21607
21607
|
refetchInterval: 9e4,
|
|
21608
21608
|
queryFn: async () => {
|
|
21609
21609
|
var b, f;
|
|
21610
|
-
await
|
|
21610
|
+
await Ne().prefetchQuery(pr(n)), await Ne().prefetchQuery(dr()), await Ne().prefetchQuery(
|
|
21611
21611
|
Ht(n)
|
|
21612
21612
|
);
|
|
21613
|
-
const u =
|
|
21613
|
+
const u = Ne().getQueryData(
|
|
21614
21614
|
pr(n).queryKey
|
|
21615
|
-
), p =
|
|
21615
|
+
), p = Ne().getQueryData(
|
|
21616
21616
|
dr().queryKey
|
|
21617
|
-
), y =
|
|
21617
|
+
), y = Ne().getQueryData(
|
|
21618
21618
|
Ht(n).queryKey
|
|
21619
21619
|
);
|
|
21620
21620
|
if (!u || !p)
|
|
@@ -21761,16 +21761,16 @@ function pp(n, u) {
|
|
|
21761
21761
|
"[SDK][Wallets] – hive engine token or username missed"
|
|
21762
21762
|
);
|
|
21763
21763
|
const p = Ht(n);
|
|
21764
|
-
await
|
|
21765
|
-
const y =
|
|
21764
|
+
await Ne().prefetchQuery(p);
|
|
21765
|
+
const y = Ne().getQueryData(
|
|
21766
21766
|
p.queryKey
|
|
21767
21767
|
), s = pn(bn);
|
|
21768
|
-
await
|
|
21769
|
-
const a =
|
|
21770
|
-
await
|
|
21771
|
-
const f =
|
|
21772
|
-
await
|
|
21773
|
-
const i =
|
|
21768
|
+
await Ne().prefetchQuery(s);
|
|
21769
|
+
const a = Ne().getQueryData(s.queryKey), b = zo(n);
|
|
21770
|
+
await Ne().prefetchQuery(b);
|
|
21771
|
+
const f = Ne().getQueryData(b.queryKey), h = dp();
|
|
21772
|
+
await Ne().prefetchQuery(h);
|
|
21773
|
+
const i = Ne().getQueryData(h.queryKey), r = a == null ? void 0 : a.find((c) => c.symbol === u), e = f == null ? void 0 : f.find((c) => c.symbol === u), t = i == null ? void 0 : i.find((c) => c.symbol === u), o = +((t == null ? void 0 : t.lastPrice) ?? "0");
|
|
21774
21774
|
return {
|
|
21775
21775
|
name: u,
|
|
21776
21776
|
title: (r == null ? void 0 : r.name) ?? "",
|
|
@@ -22170,8 +22170,8 @@ function wp(n) {
|
|
|
22170
22170
|
staleTime: 6e4,
|
|
22171
22171
|
refetchInterval: 9e4,
|
|
22172
22172
|
queryFn: async () => {
|
|
22173
|
-
await
|
|
22174
|
-
const u =
|
|
22173
|
+
await Ne().prefetchQuery(wo(n));
|
|
22174
|
+
const u = Ne().getQueryData(
|
|
22175
22175
|
wo(n).queryKey
|
|
22176
22176
|
);
|
|
22177
22177
|
return {
|
|
@@ -22277,10 +22277,10 @@ function R1(n) {
|
|
|
22277
22277
|
return Ke({
|
|
22278
22278
|
queryKey: ["ecency-wallets", "all-tokens-list", n],
|
|
22279
22279
|
queryFn: async () => {
|
|
22280
|
-
await
|
|
22280
|
+
await Ne().prefetchQuery(
|
|
22281
22281
|
pn(bn)
|
|
22282
22282
|
);
|
|
22283
|
-
const u =
|
|
22283
|
+
const u = Ne().getQueryData(pn(bn).queryKey);
|
|
22284
22284
|
return {
|
|
22285
22285
|
basic: [
|
|
22286
22286
|
ut.Points,
|
|
@@ -22288,7 +22288,7 @@ function R1(n) {
|
|
|
22288
22288
|
ut.HivePower,
|
|
22289
22289
|
ut.HiveDollar
|
|
22290
22290
|
].filter((p) => p.toLowerCase().includes(n.toLowerCase())),
|
|
22291
|
-
external: Object.values(
|
|
22291
|
+
external: Object.values(qe).filter(
|
|
22292
22292
|
(p) => p.toLowerCase().includes(n.toLowerCase())
|
|
22293
22293
|
),
|
|
22294
22294
|
spk: [ut.Spk, "LARYNX", "LP"],
|
|
@@ -22304,10 +22304,10 @@ function Ep(n) {
|
|
|
22304
22304
|
queryFn: async () => {
|
|
22305
22305
|
var y;
|
|
22306
22306
|
const u = yt(n);
|
|
22307
|
-
await
|
|
22307
|
+
await Ne().fetchQuery({
|
|
22308
22308
|
queryKey: u.queryKey
|
|
22309
22309
|
});
|
|
22310
|
-
const p =
|
|
22310
|
+
const p = Ne().getQueryData(
|
|
22311
22311
|
u.queryKey
|
|
22312
22312
|
);
|
|
22313
22313
|
if (((y = p == null ? void 0 : p.profile) == null ? void 0 : y.tokens) instanceof Array) {
|
|
@@ -22316,7 +22316,7 @@ function Ep(n) {
|
|
|
22316
22316
|
ut.Hive,
|
|
22317
22317
|
ut.HivePower,
|
|
22318
22318
|
ut.HiveDollar,
|
|
22319
|
-
...p.profile.tokens.map((a) => a.symbol)
|
|
22319
|
+
...p.profile.tokens.filter(({ meta: a }) => !!(a != null && a.show)).map((a) => a.symbol)
|
|
22320
22320
|
];
|
|
22321
22321
|
return Array.from(new Set(s).values());
|
|
22322
22322
|
}
|
|
@@ -22705,7 +22705,7 @@ function Pp(n) {
|
|
|
22705
22705
|
});
|
|
22706
22706
|
}
|
|
22707
22707
|
function Fp(n, u, p = { refetch: !1 }) {
|
|
22708
|
-
const y = async (s) => (p.refetch ? await
|
|
22708
|
+
const y = async (s) => (p.refetch ? await Ne().fetchQuery(s) : await Ne().prefetchQuery(s), Ne().getQueryData(
|
|
22709
22709
|
s.queryKey
|
|
22710
22710
|
));
|
|
22711
22711
|
return Ke({
|
|
@@ -22804,14 +22804,14 @@ function M1(n, u, p = !1) {
|
|
|
22804
22804
|
return [];
|
|
22805
22805
|
}
|
|
22806
22806
|
const y = zo(u);
|
|
22807
|
-
await
|
|
22808
|
-
const s =
|
|
22807
|
+
await Ne().prefetchQuery(y);
|
|
22808
|
+
const s = Ne().getQueryData(
|
|
22809
22809
|
y.queryKey
|
|
22810
22810
|
), a = pn(
|
|
22811
22811
|
(s == null ? void 0 : s.map((o) => o.symbol)) ?? []
|
|
22812
22812
|
);
|
|
22813
|
-
await
|
|
22814
|
-
const b =
|
|
22813
|
+
await Ne().prefetchQuery(a);
|
|
22814
|
+
const b = Ne().getQueryData(a.queryKey), f = s == null ? void 0 : s.find((o) => o.symbol === n), h = b == null ? void 0 : b.find((o) => o.symbol === n), i = p && (h == null ? void 0 : h.delegationEnabled) && f && parseFloat(f.delegationsOut) !== parseFloat(f.balance), r = p && parseFloat((f == null ? void 0 : f.delegationsOut) ?? "0") > 0, e = p && (h == null ? void 0 : h.stakingEnabled), t = p && parseFloat((f == null ? void 0 : f.stake) ?? "0") > 0;
|
|
22815
22815
|
return [
|
|
22816
22816
|
He.Transfer,
|
|
22817
22817
|
...i ? [He.Delegate] : [],
|
|
@@ -22823,19 +22823,19 @@ function M1(n, u, p = !1) {
|
|
|
22823
22823
|
});
|
|
22824
22824
|
}
|
|
22825
22825
|
const Op = {
|
|
22826
|
-
[
|
|
22826
|
+
[qe.BTC]: "m/44'/0'/0'/0/0",
|
|
22827
22827
|
// Bitcoin (BIP44)
|
|
22828
|
-
[
|
|
22828
|
+
[qe.ETH]: "m/44'/60'/0'/0/0",
|
|
22829
22829
|
// Ethereum (BIP44)
|
|
22830
|
-
[
|
|
22830
|
+
[qe.BNB]: "m/44'/60'/0'/0/0",
|
|
22831
22831
|
// BNB Smart Chain (BIP44)
|
|
22832
|
-
[
|
|
22832
|
+
[qe.SOL]: "m/44'/501'/0'/0'",
|
|
22833
22833
|
// Solana (BIP44)
|
|
22834
|
-
[
|
|
22834
|
+
[qe.TON]: "m/44'/607'/0'",
|
|
22835
22835
|
// TON (BIP44)
|
|
22836
|
-
[
|
|
22836
|
+
[qe.TRON]: "m/44'/195'/0'/0/0",
|
|
22837
22837
|
// Tron (BIP44)
|
|
22838
|
-
[
|
|
22838
|
+
[qe.APT]: "m/44'/637'/0'/0'/0'"
|
|
22839
22839
|
// Aptos (BIP44)
|
|
22840
22840
|
};
|
|
22841
22841
|
function P1(n, u) {
|
|
@@ -22869,14 +22869,14 @@ function P1(n, u) {
|
|
|
22869
22869
|
)
|
|
22870
22870
|
);
|
|
22871
22871
|
}
|
|
22872
|
-
}), a =
|
|
22872
|
+
}), a = D0(() => {
|
|
22873
22873
|
}, []);
|
|
22874
22874
|
return {
|
|
22875
22875
|
createWallet: s,
|
|
22876
22876
|
importWallet: a
|
|
22877
22877
|
};
|
|
22878
22878
|
}
|
|
22879
|
-
function
|
|
22879
|
+
function qp(n) {
|
|
22880
22880
|
const { data: u } = br({
|
|
22881
22881
|
queryKey: ["ecency-wallets", "wallets", n]
|
|
22882
22882
|
}), { data: p } = Xd(n);
|
|
@@ -22929,26 +22929,26 @@ function _0() {
|
|
|
22929
22929
|
const F1 = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
|
|
22930
22930
|
__proto__: null,
|
|
22931
22931
|
useCheckWalletExistence: _0,
|
|
22932
|
-
useCreateAccountWithWallets:
|
|
22933
|
-
}, Symbol.toStringTag, { value: "Module" })),
|
|
22934
|
-
[
|
|
22935
|
-
[
|
|
22932
|
+
useCreateAccountWithWallets: qp
|
|
22933
|
+
}, Symbol.toStringTag, { value: "Module" })), Dp = {
|
|
22934
|
+
[qe.BTC]: ["m/84'/0'/0'/0/0"],
|
|
22935
|
+
[qe.ETH]: ["m/84'/60'/0'/0/0"],
|
|
22936
22936
|
// its not working for Trust, Exodus, todo: check others below
|
|
22937
|
-
[
|
|
22938
|
-
[
|
|
22939
|
-
[
|
|
22940
|
-
[
|
|
22941
|
-
[
|
|
22937
|
+
[qe.BNB]: ["m/84'/60'/0'/0/0"],
|
|
22938
|
+
[qe.SOL]: ["m/84'/501'/0'/0/0"],
|
|
22939
|
+
[qe.TRON]: ["m/44'/195'/0'/0'/0'"],
|
|
22940
|
+
[qe.APT]: ["m/84'/637'/0'/0/0"],
|
|
22941
|
+
[qe.TON]: ["m/44'/607'/0'"]
|
|
22942
22942
|
};
|
|
22943
22943
|
async function Np(n, u, p) {
|
|
22944
|
-
for (const y of
|
|
22944
|
+
for (const y of Dp[p] || [])
|
|
22945
22945
|
try {
|
|
22946
22946
|
const s = await u.getDerivedPrivateKey({
|
|
22947
22947
|
mnemonic: n,
|
|
22948
22948
|
hdPath: y
|
|
22949
22949
|
}), a = await u.getNewAddress({
|
|
22950
22950
|
privateKey: s,
|
|
22951
|
-
addressType: p ===
|
|
22951
|
+
addressType: p === qe.BTC ? "segwit_native" : void 0
|
|
22952
22952
|
});
|
|
22953
22953
|
return [s.toString(), a.address];
|
|
22954
22954
|
} catch {
|
|
@@ -23008,7 +23008,9 @@ function O1(n, u) {
|
|
|
23008
23008
|
function _c(n, u = !1) {
|
|
23009
23009
|
return n ? Wt.pipe(
|
|
23010
23010
|
n,
|
|
23011
|
-
Wt.filter(
|
|
23011
|
+
Wt.filter(
|
|
23012
|
+
({ type: p, symbol: y }) => p === "CHAIN" || Object.values(qe).includes(y)
|
|
23013
|
+
),
|
|
23012
23014
|
Wt.map((p) => (p.meta.show = u, p)),
|
|
23013
23015
|
// Chain tokens are unique by symbol, so indexing by symbol
|
|
23014
23016
|
// gives a direct lookup map instead of an array-based grouping.
|
|
@@ -23017,23 +23019,31 @@ function _c(n, u = !1) {
|
|
|
23017
23019
|
)
|
|
23018
23020
|
) : {};
|
|
23019
23021
|
}
|
|
23020
|
-
function
|
|
23022
|
+
function q1(n, u) {
|
|
23021
23023
|
const p = yn(), { data: y } = br(yt(n)), { mutateAsync: s } = A0(n);
|
|
23022
23024
|
return Jt({
|
|
23023
|
-
mutationKey: [
|
|
23025
|
+
mutationKey: [
|
|
23026
|
+
"ecency-wallets",
|
|
23027
|
+
"save-wallet-to-metadata",
|
|
23028
|
+
y == null ? void 0 : y.name
|
|
23029
|
+
],
|
|
23024
23030
|
mutationFn: async (a) => {
|
|
23025
23031
|
var e;
|
|
23026
23032
|
if (!y)
|
|
23027
23033
|
throw new Error("[SDK][Wallets] – no account data to save wallets");
|
|
23028
23034
|
const b = _c(
|
|
23029
23035
|
(e = y.profile) == null ? void 0 : e.tokens
|
|
23030
|
-
)
|
|
23036
|
+
);
|
|
23037
|
+
console.log("profile tokens are ", b);
|
|
23038
|
+
const f = a.map(({ currency: t, type: o, privateKey: c, username: d, ...m }) => ({
|
|
23031
23039
|
symbol: t,
|
|
23032
|
-
type: o,
|
|
23040
|
+
type: o ?? Object.values(qe).includes(t) ? "CHAIN" : void 0,
|
|
23033
23041
|
meta: m
|
|
23034
23042
|
})) ?? [], h = _c(f, !0), i = f.filter(
|
|
23035
|
-
({ type: t }) => t !== "CHAIN"
|
|
23036
|
-
)
|
|
23043
|
+
({ type: t, symbol: o }) => t !== "CHAIN" && !Object.values(qe).includes(o)
|
|
23044
|
+
);
|
|
23045
|
+
console.log("payload tokens are ", h), console.log("payload non-chain tokens are ", i);
|
|
23046
|
+
const r = Wt.pipe(
|
|
23037
23047
|
b,
|
|
23038
23048
|
Wt.mergeDeep(h),
|
|
23039
23049
|
Wt.values()
|
|
@@ -23086,7 +23096,7 @@ const Cp = {
|
|
|
23086
23096
|
[He.Delegate]: bp,
|
|
23087
23097
|
[He.Undelegate]: yp
|
|
23088
23098
|
};
|
|
23089
|
-
function
|
|
23099
|
+
function D1(n, u, p) {
|
|
23090
23100
|
const { mutateAsync: y } = xc.useRecordActivity(
|
|
23091
23101
|
n,
|
|
23092
23102
|
p
|
|
@@ -23098,8 +23108,8 @@ function q1(n, u, p) {
|
|
|
23098
23108
|
if (a)
|
|
23099
23109
|
return a(s);
|
|
23100
23110
|
const b = zo(n);
|
|
23101
|
-
await
|
|
23102
|
-
const f =
|
|
23111
|
+
await Ne().prefetchQuery(b);
|
|
23112
|
+
const f = Ne().getQueryData(
|
|
23103
23113
|
b.queryKey
|
|
23104
23114
|
);
|
|
23105
23115
|
if (f != null && f.some((h) => h.symbol === u)) {
|
|
@@ -23115,7 +23125,7 @@ function q1(n, u, p) {
|
|
|
23115
23125
|
refetch: !0
|
|
23116
23126
|
});
|
|
23117
23127
|
setTimeout(
|
|
23118
|
-
() =>
|
|
23128
|
+
() => Ne().invalidateQueries({
|
|
23119
23129
|
queryKey: s.queryKey
|
|
23120
23130
|
}),
|
|
23121
23131
|
5e3
|
|
@@ -23127,7 +23137,7 @@ N0();
|
|
|
23127
23137
|
export {
|
|
23128
23138
|
He as AssetOperation,
|
|
23129
23139
|
ut as EcencyWalletBasicTokens,
|
|
23130
|
-
|
|
23140
|
+
qe as EcencyWalletCurrency,
|
|
23131
23141
|
F1 as EcencyWalletsPrivateApi,
|
|
23132
23142
|
v0 as NaiMap,
|
|
23133
23143
|
xp as PointTransactionType,
|
|
@@ -23206,10 +23216,10 @@ export {
|
|
|
23206
23216
|
t1 as useGetExternalWalletBalanceQuery,
|
|
23207
23217
|
Xd as useHiveKeysQuery,
|
|
23208
23218
|
O1 as useImportWallet,
|
|
23209
|
-
|
|
23219
|
+
q1 as useSaveWalletInformationToMetadata,
|
|
23210
23220
|
Sc as useSeedPhrase,
|
|
23211
23221
|
P1 as useWalletCreate,
|
|
23212
|
-
|
|
23222
|
+
D1 as useWalletOperation,
|
|
23213
23223
|
yo as vestsToHp,
|
|
23214
23224
|
op as withdrawVestingRouteHive
|
|
23215
23225
|
};
|