@sabaaa1/common 0.0.44 → 0.0.45
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/assets/{snarkjsWorkerLogic-B9NbAQYW.js → snarkjsWorkerLauncher-Cw1M6jKV.js} +535 -536
- package/assets/{utxoWorkerLogic-DEqWaadT.js → utxoWorkerLauncher-DU_Rrw_I.js} +16801 -15613
- package/assets/{zkProofWorkerLogic-DB9cbXu-.js → zkProofWorkerLauncher-BEDgIMB_.js} +16094 -14906
- package/data-structures/Hinkal/Hinkal.cjs +1 -1
- package/data-structures/Hinkal/Hinkal.mjs +5 -2
- package/data-structures/IndexedDB/activity-db.cjs +1 -1
- package/data-structures/IndexedDB/activity-db.mjs +25 -22
- package/data-structures/IndexedDB/contact-db.cjs +1 -1
- package/data-structures/IndexedDB/contact-db.mjs +24 -21
- package/data-structures/TokenDBs/EventsPublicTokensDB.cjs +1 -1
- package/data-structures/TokenDBs/EventsPublicTokensDB.mjs +16 -13
- package/functions/web3/functionCalls/transactCallRelayer.cjs +1 -1
- package/functions/web3/functionCalls/transactCallRelayer.mjs +5 -2
- package/package.json +1 -1
- package/providers/EthersProviderAdapter.cjs +1 -1
- package/providers/EthersProviderAdapter.mjs +19 -16
- package/providers/prepareEthersHinkal.cjs +1 -1
- package/providers/prepareEthersHinkal.mjs +5 -2
- package/providers/prepareWagmiHinkal.cjs +1 -1
- package/providers/prepareWagmiHinkal.mjs +5 -2
- package/webworker/snarkjsWorker/snarkjsWorkerLauncher.cjs +1 -1
- package/webworker/snarkjsWorker/snarkjsWorkerLauncher.mjs +1 -1
- package/webworker/utxoWorker/utxoWorkerLauncher.cjs +1 -1
- package/webworker/utxoWorker/utxoWorkerLauncher.mjs +2 -2
- package/webworker/workerFactory.cjs +1 -1
- package/webworker/workerFactory.mjs +26 -27
- package/webworker/zkProofWorker/zkProofWorkerLauncher.cjs +1 -1
- package/webworker/zkProofWorker/zkProofWorkerLauncher.mjs +1 -1
- package/assets/snarkjsWorkerLauncher-Dsmwcy9L.js +0 -1176
- package/assets/utxoWorkerLauncher-BUSzpnDL.js +0 -1205
- package/assets/zkProofWorkerLauncher-CoKmCKjC.js +0 -1205
|
@@ -1,1176 +0,0 @@
|
|
|
1
|
-
function Yr(c) {
|
|
2
|
-
return c && c.__esModule && Object.prototype.hasOwnProperty.call(c, "default") ? c.default : c;
|
|
3
|
-
}
|
|
4
|
-
var xr = {}, J = {};
|
|
5
|
-
J.byteLength = Vr;
|
|
6
|
-
J.toByteArray = Jr;
|
|
7
|
-
J.fromByteArray = Kr;
|
|
8
|
-
var b = [], R = [], qr = typeof Uint8Array < "u" ? Uint8Array : Array, v = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
|
|
9
|
-
for (var j = 0, Hr = v.length; j < Hr; ++j)
|
|
10
|
-
b[j] = v[j], R[v.charCodeAt(j)] = j;
|
|
11
|
-
R[45] = 62;
|
|
12
|
-
R[95] = 63;
|
|
13
|
-
function Br(c) {
|
|
14
|
-
var f = c.length;
|
|
15
|
-
if (f % 4 > 0)
|
|
16
|
-
throw new Error("Invalid string. Length must be a multiple of 4");
|
|
17
|
-
var p = c.indexOf("=");
|
|
18
|
-
p === -1 && (p = f);
|
|
19
|
-
var x = p === f ? 0 : 4 - p % 4;
|
|
20
|
-
return [p, x];
|
|
21
|
-
}
|
|
22
|
-
function Vr(c) {
|
|
23
|
-
var f = Br(c), p = f[0], x = f[1];
|
|
24
|
-
return (p + x) * 3 / 4 - x;
|
|
25
|
-
}
|
|
26
|
-
function Xr(c, f, p) {
|
|
27
|
-
return (f + p) * 3 / 4 - p;
|
|
28
|
-
}
|
|
29
|
-
function Jr(c) {
|
|
30
|
-
var f, p = Br(c), x = p[0], y = p[1], a = new qr(Xr(c, x, y)), s = 0, o = y > 0 ? x - 4 : x, B;
|
|
31
|
-
for (B = 0; B < o; B += 4)
|
|
32
|
-
f = R[c.charCodeAt(B)] << 18 | R[c.charCodeAt(B + 1)] << 12 | R[c.charCodeAt(B + 2)] << 6 | R[c.charCodeAt(B + 3)], a[s++] = f >> 16 & 255, a[s++] = f >> 8 & 255, a[s++] = f & 255;
|
|
33
|
-
return y === 2 && (f = R[c.charCodeAt(B)] << 2 | R[c.charCodeAt(B + 1)] >> 4, a[s++] = f & 255), y === 1 && (f = R[c.charCodeAt(B)] << 10 | R[c.charCodeAt(B + 1)] << 4 | R[c.charCodeAt(B + 2)] >> 2, a[s++] = f >> 8 & 255, a[s++] = f & 255), a;
|
|
34
|
-
}
|
|
35
|
-
function zr(c) {
|
|
36
|
-
return b[c >> 18 & 63] + b[c >> 12 & 63] + b[c >> 6 & 63] + b[c & 63];
|
|
37
|
-
}
|
|
38
|
-
function Qr(c, f, p) {
|
|
39
|
-
for (var x, y = [], a = f; a < p; a += 3)
|
|
40
|
-
x = (c[a] << 16 & 16711680) + (c[a + 1] << 8 & 65280) + (c[a + 2] & 255), y.push(zr(x));
|
|
41
|
-
return y.join("");
|
|
42
|
-
}
|
|
43
|
-
function Kr(c) {
|
|
44
|
-
for (var f, p = c.length, x = p % 3, y = [], a = 16383, s = 0, o = p - x; s < o; s += a)
|
|
45
|
-
y.push(Qr(c, s, s + a > o ? o : s + a));
|
|
46
|
-
return x === 1 ? (f = c[p - 1], y.push(
|
|
47
|
-
b[f >> 2] + b[f << 4 & 63] + "=="
|
|
48
|
-
)) : x === 2 && (f = (c[p - 2] << 8) + c[p - 1], y.push(
|
|
49
|
-
b[f >> 10] + b[f >> 4 & 63] + b[f << 2 & 63] + "="
|
|
50
|
-
)), y.join("");
|
|
51
|
-
}
|
|
52
|
-
var er = {};
|
|
53
|
-
/*! ieee754. BSD-3-Clause License. Feross Aboukhadijeh <https://feross.org/opensource> */
|
|
54
|
-
er.read = function(c, f, p, x, y) {
|
|
55
|
-
var a, s, o = y * 8 - x - 1, B = (1 << o) - 1, C = B >> 1, F = -7, A = p ? y - 1 : 0, k = p ? -1 : 1, U = c[f + A];
|
|
56
|
-
for (A += k, a = U & (1 << -F) - 1, U >>= -F, F += o; F > 0; a = a * 256 + c[f + A], A += k, F -= 8)
|
|
57
|
-
;
|
|
58
|
-
for (s = a & (1 << -F) - 1, a >>= -F, F += x; F > 0; s = s * 256 + c[f + A], A += k, F -= 8)
|
|
59
|
-
;
|
|
60
|
-
if (a === 0)
|
|
61
|
-
a = 1 - C;
|
|
62
|
-
else {
|
|
63
|
-
if (a === B)
|
|
64
|
-
return s ? NaN : (U ? -1 : 1) * (1 / 0);
|
|
65
|
-
s = s + Math.pow(2, x), a = a - C;
|
|
66
|
-
}
|
|
67
|
-
return (U ? -1 : 1) * s * Math.pow(2, a - x);
|
|
68
|
-
};
|
|
69
|
-
er.write = function(c, f, p, x, y, a) {
|
|
70
|
-
var s, o, B, C = a * 8 - y - 1, F = (1 << C) - 1, A = F >> 1, k = y === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0, U = x ? 0 : a - 1, Y = x ? 1 : -1, q = f < 0 || f === 0 && 1 / f < 0 ? 1 : 0;
|
|
71
|
-
for (f = Math.abs(f), isNaN(f) || f === 1 / 0 ? (o = isNaN(f) ? 1 : 0, s = F) : (s = Math.floor(Math.log(f) / Math.LN2), f * (B = Math.pow(2, -s)) < 1 && (s--, B *= 2), s + A >= 1 ? f += k / B : f += k * Math.pow(2, 1 - A), f * B >= 2 && (s++, B /= 2), s + A >= F ? (o = 0, s = F) : s + A >= 1 ? (o = (f * B - 1) * Math.pow(2, y), s = s + A) : (o = f * Math.pow(2, A - 1) * Math.pow(2, y), s = 0)); y >= 8; c[p + U] = o & 255, U += Y, o /= 256, y -= 8)
|
|
72
|
-
;
|
|
73
|
-
for (s = s << y | o, C += y; C > 0; c[p + U] = s & 255, U += Y, s /= 256, C -= 8)
|
|
74
|
-
;
|
|
75
|
-
c[p + U - Y] |= q * 128;
|
|
76
|
-
};
|
|
77
|
-
/*!
|
|
78
|
-
* The buffer module from node.js, for the browser.
|
|
79
|
-
*
|
|
80
|
-
* @author Feross Aboukhadijeh <https://feross.org>
|
|
81
|
-
* @license MIT
|
|
82
|
-
*/
|
|
83
|
-
(function(c) {
|
|
84
|
-
const f = J, p = er, x = typeof Symbol == "function" && typeof Symbol.for == "function" ? Symbol.for("nodejs.util.inspect.custom") : null;
|
|
85
|
-
c.Buffer = o, c.SlowBuffer = Fr, c.INSPECT_MAX_BYTES = 50;
|
|
86
|
-
const y = 2147483647;
|
|
87
|
-
c.kMaxLength = y, o.TYPED_ARRAY_SUPPORT = a(), !o.TYPED_ARRAY_SUPPORT && typeof console < "u" && typeof console.error == "function" && console.error(
|
|
88
|
-
"This browser lacks typed array (Uint8Array) support which is required by `buffer` v5.x. Use `buffer` v4.x if you require old browser support."
|
|
89
|
-
);
|
|
90
|
-
function a() {
|
|
91
|
-
try {
|
|
92
|
-
const e = new Uint8Array(1), r = { foo: function() {
|
|
93
|
-
return 42;
|
|
94
|
-
} };
|
|
95
|
-
return Object.setPrototypeOf(r, Uint8Array.prototype), Object.setPrototypeOf(e, r), e.foo() === 42;
|
|
96
|
-
} catch {
|
|
97
|
-
return !1;
|
|
98
|
-
}
|
|
99
|
-
}
|
|
100
|
-
Object.defineProperty(o.prototype, "parent", {
|
|
101
|
-
enumerable: !0,
|
|
102
|
-
get: function() {
|
|
103
|
-
if (o.isBuffer(this))
|
|
104
|
-
return this.buffer;
|
|
105
|
-
}
|
|
106
|
-
}), Object.defineProperty(o.prototype, "offset", {
|
|
107
|
-
enumerable: !0,
|
|
108
|
-
get: function() {
|
|
109
|
-
if (o.isBuffer(this))
|
|
110
|
-
return this.byteOffset;
|
|
111
|
-
}
|
|
112
|
-
});
|
|
113
|
-
function s(e) {
|
|
114
|
-
if (e > y)
|
|
115
|
-
throw new RangeError('The value "' + e + '" is invalid for option "size"');
|
|
116
|
-
const r = new Uint8Array(e);
|
|
117
|
-
return Object.setPrototypeOf(r, o.prototype), r;
|
|
118
|
-
}
|
|
119
|
-
function o(e, r, t) {
|
|
120
|
-
if (typeof e == "number") {
|
|
121
|
-
if (typeof r == "string")
|
|
122
|
-
throw new TypeError(
|
|
123
|
-
'The "string" argument must be of type string. Received type number'
|
|
124
|
-
);
|
|
125
|
-
return A(e);
|
|
126
|
-
}
|
|
127
|
-
return B(e, r, t);
|
|
128
|
-
}
|
|
129
|
-
o.poolSize = 8192;
|
|
130
|
-
function B(e, r, t) {
|
|
131
|
-
if (typeof e == "string")
|
|
132
|
-
return k(e, r);
|
|
133
|
-
if (ArrayBuffer.isView(e))
|
|
134
|
-
return Y(e);
|
|
135
|
-
if (e == null)
|
|
136
|
-
throw new TypeError(
|
|
137
|
-
"The first argument must be one of type string, Buffer, ArrayBuffer, Array, or Array-like Object. Received type " + typeof e
|
|
138
|
-
);
|
|
139
|
-
if (S(e, ArrayBuffer) || e && S(e.buffer, ArrayBuffer) || typeof SharedArrayBuffer < "u" && (S(e, SharedArrayBuffer) || e && S(e.buffer, SharedArrayBuffer)))
|
|
140
|
-
return q(e, r, t);
|
|
141
|
-
if (typeof e == "number")
|
|
142
|
-
throw new TypeError(
|
|
143
|
-
'The "value" argument must not be of type number. Received type number'
|
|
144
|
-
);
|
|
145
|
-
const n = e.valueOf && e.valueOf();
|
|
146
|
-
if (n != null && n !== e)
|
|
147
|
-
return o.from(n, r, t);
|
|
148
|
-
const i = Ir(e);
|
|
149
|
-
if (i)
|
|
150
|
-
return i;
|
|
151
|
-
if (typeof Symbol < "u" && Symbol.toPrimitive != null && typeof e[Symbol.toPrimitive] == "function")
|
|
152
|
-
return o.from(e[Symbol.toPrimitive]("string"), r, t);
|
|
153
|
-
throw new TypeError(
|
|
154
|
-
"The first argument must be one of type string, Buffer, ArrayBuffer, Array, or Array-like Object. Received type " + typeof e
|
|
155
|
-
);
|
|
156
|
-
}
|
|
157
|
-
o.from = function(e, r, t) {
|
|
158
|
-
return B(e, r, t);
|
|
159
|
-
}, Object.setPrototypeOf(o.prototype, Uint8Array.prototype), Object.setPrototypeOf(o, Uint8Array);
|
|
160
|
-
function C(e) {
|
|
161
|
-
if (typeof e != "number")
|
|
162
|
-
throw new TypeError('"size" argument must be of type number');
|
|
163
|
-
if (e < 0)
|
|
164
|
-
throw new RangeError('The value "' + e + '" is invalid for option "size"');
|
|
165
|
-
}
|
|
166
|
-
function F(e, r, t) {
|
|
167
|
-
return C(e), e <= 0 ? s(e) : r !== void 0 ? typeof t == "string" ? s(e).fill(r, t) : s(e).fill(r) : s(e);
|
|
168
|
-
}
|
|
169
|
-
o.alloc = function(e, r, t) {
|
|
170
|
-
return F(e, r, t);
|
|
171
|
-
};
|
|
172
|
-
function A(e) {
|
|
173
|
-
return C(e), s(e < 0 ? 0 : z(e) | 0);
|
|
174
|
-
}
|
|
175
|
-
o.allocUnsafe = function(e) {
|
|
176
|
-
return A(e);
|
|
177
|
-
}, o.allocUnsafeSlow = function(e) {
|
|
178
|
-
return A(e);
|
|
179
|
-
};
|
|
180
|
-
function k(e, r) {
|
|
181
|
-
if ((typeof r != "string" || r === "") && (r = "utf8"), !o.isEncoding(r))
|
|
182
|
-
throw new TypeError("Unknown encoding: " + r);
|
|
183
|
-
const t = nr(e, r) | 0;
|
|
184
|
-
let n = s(t);
|
|
185
|
-
const i = n.write(e, r);
|
|
186
|
-
return i !== t && (n = n.slice(0, i)), n;
|
|
187
|
-
}
|
|
188
|
-
function U(e) {
|
|
189
|
-
const r = e.length < 0 ? 0 : z(e.length) | 0, t = s(r);
|
|
190
|
-
for (let n = 0; n < r; n += 1)
|
|
191
|
-
t[n] = e[n] & 255;
|
|
192
|
-
return t;
|
|
193
|
-
}
|
|
194
|
-
function Y(e) {
|
|
195
|
-
if (S(e, Uint8Array)) {
|
|
196
|
-
const r = new Uint8Array(e);
|
|
197
|
-
return q(r.buffer, r.byteOffset, r.byteLength);
|
|
198
|
-
}
|
|
199
|
-
return U(e);
|
|
200
|
-
}
|
|
201
|
-
function q(e, r, t) {
|
|
202
|
-
if (r < 0 || e.byteLength < r)
|
|
203
|
-
throw new RangeError('"offset" is outside of buffer bounds');
|
|
204
|
-
if (e.byteLength < r + (t || 0))
|
|
205
|
-
throw new RangeError('"length" is outside of buffer bounds');
|
|
206
|
-
let n;
|
|
207
|
-
return r === void 0 && t === void 0 ? n = new Uint8Array(e) : t === void 0 ? n = new Uint8Array(e, r) : n = new Uint8Array(e, r, t), Object.setPrototypeOf(n, o.prototype), n;
|
|
208
|
-
}
|
|
209
|
-
function Ir(e) {
|
|
210
|
-
if (o.isBuffer(e)) {
|
|
211
|
-
const r = z(e.length) | 0, t = s(r);
|
|
212
|
-
return t.length === 0 || e.copy(t, 0, 0, r), t;
|
|
213
|
-
}
|
|
214
|
-
if (e.length !== void 0)
|
|
215
|
-
return typeof e.length != "number" || Z(e.length) ? s(0) : U(e);
|
|
216
|
-
if (e.type === "Buffer" && Array.isArray(e.data))
|
|
217
|
-
return U(e.data);
|
|
218
|
-
}
|
|
219
|
-
function z(e) {
|
|
220
|
-
if (e >= y)
|
|
221
|
-
throw new RangeError("Attempt to allocate Buffer larger than maximum size: 0x" + y.toString(16) + " bytes");
|
|
222
|
-
return e | 0;
|
|
223
|
-
}
|
|
224
|
-
function Fr(e) {
|
|
225
|
-
return +e != e && (e = 0), o.alloc(+e);
|
|
226
|
-
}
|
|
227
|
-
o.isBuffer = function(r) {
|
|
228
|
-
return r != null && r._isBuffer === !0 && r !== o.prototype;
|
|
229
|
-
}, o.compare = function(r, t) {
|
|
230
|
-
if (S(r, Uint8Array) && (r = o.from(r, r.offset, r.byteLength)), S(t, Uint8Array) && (t = o.from(t, t.offset, t.byteLength)), !o.isBuffer(r) || !o.isBuffer(t))
|
|
231
|
-
throw new TypeError(
|
|
232
|
-
'The "buf1", "buf2" arguments must be one of type Buffer or Uint8Array'
|
|
233
|
-
);
|
|
234
|
-
if (r === t)
|
|
235
|
-
return 0;
|
|
236
|
-
let n = r.length, i = t.length;
|
|
237
|
-
for (let u = 0, h = Math.min(n, i); u < h; ++u)
|
|
238
|
-
if (r[u] !== t[u]) {
|
|
239
|
-
n = r[u], i = t[u];
|
|
240
|
-
break;
|
|
241
|
-
}
|
|
242
|
-
return n < i ? -1 : i < n ? 1 : 0;
|
|
243
|
-
}, o.isEncoding = function(r) {
|
|
244
|
-
switch (String(r).toLowerCase()) {
|
|
245
|
-
case "hex":
|
|
246
|
-
case "utf8":
|
|
247
|
-
case "utf-8":
|
|
248
|
-
case "ascii":
|
|
249
|
-
case "latin1":
|
|
250
|
-
case "binary":
|
|
251
|
-
case "base64":
|
|
252
|
-
case "ucs2":
|
|
253
|
-
case "ucs-2":
|
|
254
|
-
case "utf16le":
|
|
255
|
-
case "utf-16le":
|
|
256
|
-
return !0;
|
|
257
|
-
default:
|
|
258
|
-
return !1;
|
|
259
|
-
}
|
|
260
|
-
}, o.concat = function(r, t) {
|
|
261
|
-
if (!Array.isArray(r))
|
|
262
|
-
throw new TypeError('"list" argument must be an Array of Buffers');
|
|
263
|
-
if (r.length === 0)
|
|
264
|
-
return o.alloc(0);
|
|
265
|
-
let n;
|
|
266
|
-
if (t === void 0)
|
|
267
|
-
for (t = 0, n = 0; n < r.length; ++n)
|
|
268
|
-
t += r[n].length;
|
|
269
|
-
const i = o.allocUnsafe(t);
|
|
270
|
-
let u = 0;
|
|
271
|
-
for (n = 0; n < r.length; ++n) {
|
|
272
|
-
let h = r[n];
|
|
273
|
-
if (S(h, Uint8Array))
|
|
274
|
-
u + h.length > i.length ? (o.isBuffer(h) || (h = o.from(h)), h.copy(i, u)) : Uint8Array.prototype.set.call(
|
|
275
|
-
i,
|
|
276
|
-
h,
|
|
277
|
-
u
|
|
278
|
-
);
|
|
279
|
-
else if (o.isBuffer(h))
|
|
280
|
-
h.copy(i, u);
|
|
281
|
-
else
|
|
282
|
-
throw new TypeError('"list" argument must be an Array of Buffers');
|
|
283
|
-
u += h.length;
|
|
284
|
-
}
|
|
285
|
-
return i;
|
|
286
|
-
};
|
|
287
|
-
function nr(e, r) {
|
|
288
|
-
if (o.isBuffer(e))
|
|
289
|
-
return e.length;
|
|
290
|
-
if (ArrayBuffer.isView(e) || S(e, ArrayBuffer))
|
|
291
|
-
return e.byteLength;
|
|
292
|
-
if (typeof e != "string")
|
|
293
|
-
throw new TypeError(
|
|
294
|
-
'The "string" argument must be one of type string, Buffer, or ArrayBuffer. Received type ' + typeof e
|
|
295
|
-
);
|
|
296
|
-
const t = e.length, n = arguments.length > 2 && arguments[2] === !0;
|
|
297
|
-
if (!n && t === 0)
|
|
298
|
-
return 0;
|
|
299
|
-
let i = !1;
|
|
300
|
-
for (; ; )
|
|
301
|
-
switch (r) {
|
|
302
|
-
case "ascii":
|
|
303
|
-
case "latin1":
|
|
304
|
-
case "binary":
|
|
305
|
-
return t;
|
|
306
|
-
case "utf8":
|
|
307
|
-
case "utf-8":
|
|
308
|
-
return K(e).length;
|
|
309
|
-
case "ucs2":
|
|
310
|
-
case "ucs-2":
|
|
311
|
-
case "utf16le":
|
|
312
|
-
case "utf-16le":
|
|
313
|
-
return t * 2;
|
|
314
|
-
case "hex":
|
|
315
|
-
return t >>> 1;
|
|
316
|
-
case "base64":
|
|
317
|
-
return wr(e).length;
|
|
318
|
-
default:
|
|
319
|
-
if (i)
|
|
320
|
-
return n ? -1 : K(e).length;
|
|
321
|
-
r = ("" + r).toLowerCase(), i = !0;
|
|
322
|
-
}
|
|
323
|
-
}
|
|
324
|
-
o.byteLength = nr;
|
|
325
|
-
function Ar(e, r, t) {
|
|
326
|
-
let n = !1;
|
|
327
|
-
if ((r === void 0 || r < 0) && (r = 0), r > this.length || ((t === void 0 || t > this.length) && (t = this.length), t <= 0) || (t >>>= 0, r >>>= 0, t <= r))
|
|
328
|
-
return "";
|
|
329
|
-
for (e || (e = "utf8"); ; )
|
|
330
|
-
switch (e) {
|
|
331
|
-
case "hex":
|
|
332
|
-
return Nr(this, r, t);
|
|
333
|
-
case "utf8":
|
|
334
|
-
case "utf-8":
|
|
335
|
-
return ur(this, r, t);
|
|
336
|
-
case "ascii":
|
|
337
|
-
return br(this, r, t);
|
|
338
|
-
case "latin1":
|
|
339
|
-
case "binary":
|
|
340
|
-
return Mr(this, r, t);
|
|
341
|
-
case "base64":
|
|
342
|
-
return _r(this, r, t);
|
|
343
|
-
case "ucs2":
|
|
344
|
-
case "ucs-2":
|
|
345
|
-
case "utf16le":
|
|
346
|
-
case "utf-16le":
|
|
347
|
-
return kr(this, r, t);
|
|
348
|
-
default:
|
|
349
|
-
if (n)
|
|
350
|
-
throw new TypeError("Unknown encoding: " + e);
|
|
351
|
-
e = (e + "").toLowerCase(), n = !0;
|
|
352
|
-
}
|
|
353
|
-
}
|
|
354
|
-
o.prototype._isBuffer = !0;
|
|
355
|
-
function $(e, r, t) {
|
|
356
|
-
const n = e[r];
|
|
357
|
-
e[r] = e[t], e[t] = n;
|
|
358
|
-
}
|
|
359
|
-
o.prototype.swap16 = function() {
|
|
360
|
-
const r = this.length;
|
|
361
|
-
if (r % 2 !== 0)
|
|
362
|
-
throw new RangeError("Buffer size must be a multiple of 16-bits");
|
|
363
|
-
for (let t = 0; t < r; t += 2)
|
|
364
|
-
$(this, t, t + 1);
|
|
365
|
-
return this;
|
|
366
|
-
}, o.prototype.swap32 = function() {
|
|
367
|
-
const r = this.length;
|
|
368
|
-
if (r % 4 !== 0)
|
|
369
|
-
throw new RangeError("Buffer size must be a multiple of 32-bits");
|
|
370
|
-
for (let t = 0; t < r; t += 4)
|
|
371
|
-
$(this, t, t + 3), $(this, t + 1, t + 2);
|
|
372
|
-
return this;
|
|
373
|
-
}, o.prototype.swap64 = function() {
|
|
374
|
-
const r = this.length;
|
|
375
|
-
if (r % 8 !== 0)
|
|
376
|
-
throw new RangeError("Buffer size must be a multiple of 64-bits");
|
|
377
|
-
for (let t = 0; t < r; t += 8)
|
|
378
|
-
$(this, t, t + 7), $(this, t + 1, t + 6), $(this, t + 2, t + 5), $(this, t + 3, t + 4);
|
|
379
|
-
return this;
|
|
380
|
-
}, o.prototype.toString = function() {
|
|
381
|
-
const r = this.length;
|
|
382
|
-
return r === 0 ? "" : arguments.length === 0 ? ur(this, 0, r) : Ar.apply(this, arguments);
|
|
383
|
-
}, o.prototype.toLocaleString = o.prototype.toString, o.prototype.equals = function(r) {
|
|
384
|
-
if (!o.isBuffer(r))
|
|
385
|
-
throw new TypeError("Argument must be a Buffer");
|
|
386
|
-
return this === r ? !0 : o.compare(this, r) === 0;
|
|
387
|
-
}, o.prototype.inspect = function() {
|
|
388
|
-
let r = "";
|
|
389
|
-
const t = c.INSPECT_MAX_BYTES;
|
|
390
|
-
return r = this.toString("hex", 0, t).replace(/(.{2})/g, "$1 ").trim(), this.length > t && (r += " ... "), "<Buffer " + r + ">";
|
|
391
|
-
}, x && (o.prototype[x] = o.prototype.inspect), o.prototype.compare = function(r, t, n, i, u) {
|
|
392
|
-
if (S(r, Uint8Array) && (r = o.from(r, r.offset, r.byteLength)), !o.isBuffer(r))
|
|
393
|
-
throw new TypeError(
|
|
394
|
-
'The "target" argument must be one of type Buffer or Uint8Array. Received type ' + typeof r
|
|
395
|
-
);
|
|
396
|
-
if (t === void 0 && (t = 0), n === void 0 && (n = r ? r.length : 0), i === void 0 && (i = 0), u === void 0 && (u = this.length), t < 0 || n > r.length || i < 0 || u > this.length)
|
|
397
|
-
throw new RangeError("out of range index");
|
|
398
|
-
if (i >= u && t >= n)
|
|
399
|
-
return 0;
|
|
400
|
-
if (i >= u)
|
|
401
|
-
return -1;
|
|
402
|
-
if (t >= n)
|
|
403
|
-
return 1;
|
|
404
|
-
if (t >>>= 0, n >>>= 0, i >>>= 0, u >>>= 0, this === r)
|
|
405
|
-
return 0;
|
|
406
|
-
let h = u - i, l = n - t;
|
|
407
|
-
const E = Math.min(h, l), d = this.slice(i, u), m = r.slice(t, n);
|
|
408
|
-
for (let w = 0; w < E; ++w)
|
|
409
|
-
if (d[w] !== m[w]) {
|
|
410
|
-
h = d[w], l = m[w];
|
|
411
|
-
break;
|
|
412
|
-
}
|
|
413
|
-
return h < l ? -1 : l < h ? 1 : 0;
|
|
414
|
-
};
|
|
415
|
-
function ir(e, r, t, n, i) {
|
|
416
|
-
if (e.length === 0)
|
|
417
|
-
return -1;
|
|
418
|
-
if (typeof t == "string" ? (n = t, t = 0) : t > 2147483647 ? t = 2147483647 : t < -2147483648 && (t = -2147483648), t = +t, Z(t) && (t = i ? 0 : e.length - 1), t < 0 && (t = e.length + t), t >= e.length) {
|
|
419
|
-
if (i)
|
|
420
|
-
return -1;
|
|
421
|
-
t = e.length - 1;
|
|
422
|
-
} else if (t < 0)
|
|
423
|
-
if (i)
|
|
424
|
-
t = 0;
|
|
425
|
-
else
|
|
426
|
-
return -1;
|
|
427
|
-
if (typeof r == "string" && (r = o.from(r, n)), o.isBuffer(r))
|
|
428
|
-
return r.length === 0 ? -1 : or(e, r, t, n, i);
|
|
429
|
-
if (typeof r == "number")
|
|
430
|
-
return r = r & 255, typeof Uint8Array.prototype.indexOf == "function" ? i ? Uint8Array.prototype.indexOf.call(e, r, t) : Uint8Array.prototype.lastIndexOf.call(e, r, t) : or(e, [r], t, n, i);
|
|
431
|
-
throw new TypeError("val must be string, number or Buffer");
|
|
432
|
-
}
|
|
433
|
-
function or(e, r, t, n, i) {
|
|
434
|
-
let u = 1, h = e.length, l = r.length;
|
|
435
|
-
if (n !== void 0 && (n = String(n).toLowerCase(), n === "ucs2" || n === "ucs-2" || n === "utf16le" || n === "utf-16le")) {
|
|
436
|
-
if (e.length < 2 || r.length < 2)
|
|
437
|
-
return -1;
|
|
438
|
-
u = 2, h /= 2, l /= 2, t /= 2;
|
|
439
|
-
}
|
|
440
|
-
function E(m, w) {
|
|
441
|
-
return u === 1 ? m[w] : m.readUInt16BE(w * u);
|
|
442
|
-
}
|
|
443
|
-
let d;
|
|
444
|
-
if (i) {
|
|
445
|
-
let m = -1;
|
|
446
|
-
for (d = t; d < h; d++)
|
|
447
|
-
if (E(e, d) === E(r, m === -1 ? 0 : d - m)) {
|
|
448
|
-
if (m === -1 && (m = d), d - m + 1 === l)
|
|
449
|
-
return m * u;
|
|
450
|
-
} else
|
|
451
|
-
m !== -1 && (d -= d - m), m = -1;
|
|
452
|
-
} else
|
|
453
|
-
for (t + l > h && (t = h - l), d = t; d >= 0; d--) {
|
|
454
|
-
let m = !0;
|
|
455
|
-
for (let w = 0; w < l; w++)
|
|
456
|
-
if (E(e, d + w) !== E(r, w)) {
|
|
457
|
-
m = !1;
|
|
458
|
-
break;
|
|
459
|
-
}
|
|
460
|
-
if (m)
|
|
461
|
-
return d;
|
|
462
|
-
}
|
|
463
|
-
return -1;
|
|
464
|
-
}
|
|
465
|
-
o.prototype.includes = function(r, t, n) {
|
|
466
|
-
return this.indexOf(r, t, n) !== -1;
|
|
467
|
-
}, o.prototype.indexOf = function(r, t, n) {
|
|
468
|
-
return ir(this, r, t, n, !0);
|
|
469
|
-
}, o.prototype.lastIndexOf = function(r, t, n) {
|
|
470
|
-
return ir(this, r, t, n, !1);
|
|
471
|
-
};
|
|
472
|
-
function Ur(e, r, t, n) {
|
|
473
|
-
t = Number(t) || 0;
|
|
474
|
-
const i = e.length - t;
|
|
475
|
-
n ? (n = Number(n), n > i && (n = i)) : n = i;
|
|
476
|
-
const u = r.length;
|
|
477
|
-
n > u / 2 && (n = u / 2);
|
|
478
|
-
let h;
|
|
479
|
-
for (h = 0; h < n; ++h) {
|
|
480
|
-
const l = parseInt(r.substr(h * 2, 2), 16);
|
|
481
|
-
if (Z(l))
|
|
482
|
-
return h;
|
|
483
|
-
e[t + h] = l;
|
|
484
|
-
}
|
|
485
|
-
return h;
|
|
486
|
-
}
|
|
487
|
-
function Tr(e, r, t, n) {
|
|
488
|
-
return V(K(r, e.length - t), e, t, n);
|
|
489
|
-
}
|
|
490
|
-
function Rr(e, r, t, n) {
|
|
491
|
-
return V(Or(r), e, t, n);
|
|
492
|
-
}
|
|
493
|
-
function Cr(e, r, t, n) {
|
|
494
|
-
return V(wr(r), e, t, n);
|
|
495
|
-
}
|
|
496
|
-
function Sr(e, r, t, n) {
|
|
497
|
-
return V(Wr(r, e.length - t), e, t, n);
|
|
498
|
-
}
|
|
499
|
-
o.prototype.write = function(r, t, n, i) {
|
|
500
|
-
if (t === void 0)
|
|
501
|
-
i = "utf8", n = this.length, t = 0;
|
|
502
|
-
else if (n === void 0 && typeof t == "string")
|
|
503
|
-
i = t, n = this.length, t = 0;
|
|
504
|
-
else if (isFinite(t))
|
|
505
|
-
t = t >>> 0, isFinite(n) ? (n = n >>> 0, i === void 0 && (i = "utf8")) : (i = n, n = void 0);
|
|
506
|
-
else
|
|
507
|
-
throw new Error(
|
|
508
|
-
"Buffer.write(string, encoding, offset[, length]) is no longer supported"
|
|
509
|
-
);
|
|
510
|
-
const u = this.length - t;
|
|
511
|
-
if ((n === void 0 || n > u) && (n = u), r.length > 0 && (n < 0 || t < 0) || t > this.length)
|
|
512
|
-
throw new RangeError("Attempt to write outside buffer bounds");
|
|
513
|
-
i || (i = "utf8");
|
|
514
|
-
let h = !1;
|
|
515
|
-
for (; ; )
|
|
516
|
-
switch (i) {
|
|
517
|
-
case "hex":
|
|
518
|
-
return Ur(this, r, t, n);
|
|
519
|
-
case "utf8":
|
|
520
|
-
case "utf-8":
|
|
521
|
-
return Tr(this, r, t, n);
|
|
522
|
-
case "ascii":
|
|
523
|
-
case "latin1":
|
|
524
|
-
case "binary":
|
|
525
|
-
return Rr(this, r, t, n);
|
|
526
|
-
case "base64":
|
|
527
|
-
return Cr(this, r, t, n);
|
|
528
|
-
case "ucs2":
|
|
529
|
-
case "ucs-2":
|
|
530
|
-
case "utf16le":
|
|
531
|
-
case "utf-16le":
|
|
532
|
-
return Sr(this, r, t, n);
|
|
533
|
-
default:
|
|
534
|
-
if (h)
|
|
535
|
-
throw new TypeError("Unknown encoding: " + i);
|
|
536
|
-
i = ("" + i).toLowerCase(), h = !0;
|
|
537
|
-
}
|
|
538
|
-
}, o.prototype.toJSON = function() {
|
|
539
|
-
return {
|
|
540
|
-
type: "Buffer",
|
|
541
|
-
data: Array.prototype.slice.call(this._arr || this, 0)
|
|
542
|
-
};
|
|
543
|
-
};
|
|
544
|
-
function _r(e, r, t) {
|
|
545
|
-
return r === 0 && t === e.length ? f.fromByteArray(e) : f.fromByteArray(e.slice(r, t));
|
|
546
|
-
}
|
|
547
|
-
function ur(e, r, t) {
|
|
548
|
-
t = Math.min(e.length, t);
|
|
549
|
-
const n = [];
|
|
550
|
-
let i = r;
|
|
551
|
-
for (; i < t; ) {
|
|
552
|
-
const u = e[i];
|
|
553
|
-
let h = null, l = u > 239 ? 4 : u > 223 ? 3 : u > 191 ? 2 : 1;
|
|
554
|
-
if (i + l <= t) {
|
|
555
|
-
let E, d, m, w;
|
|
556
|
-
switch (l) {
|
|
557
|
-
case 1:
|
|
558
|
-
u < 128 && (h = u);
|
|
559
|
-
break;
|
|
560
|
-
case 2:
|
|
561
|
-
E = e[i + 1], (E & 192) === 128 && (w = (u & 31) << 6 | E & 63, w > 127 && (h = w));
|
|
562
|
-
break;
|
|
563
|
-
case 3:
|
|
564
|
-
E = e[i + 1], d = e[i + 2], (E & 192) === 128 && (d & 192) === 128 && (w = (u & 15) << 12 | (E & 63) << 6 | d & 63, w > 2047 && (w < 55296 || w > 57343) && (h = w));
|
|
565
|
-
break;
|
|
566
|
-
case 4:
|
|
567
|
-
E = e[i + 1], d = e[i + 2], m = e[i + 3], (E & 192) === 128 && (d & 192) === 128 && (m & 192) === 128 && (w = (u & 15) << 18 | (E & 63) << 12 | (d & 63) << 6 | m & 63, w > 65535 && w < 1114112 && (h = w));
|
|
568
|
-
}
|
|
569
|
-
}
|
|
570
|
-
h === null ? (h = 65533, l = 1) : h > 65535 && (h -= 65536, n.push(h >>> 10 & 1023 | 55296), h = 56320 | h & 1023), n.push(h), i += l;
|
|
571
|
-
}
|
|
572
|
-
return Lr(n);
|
|
573
|
-
}
|
|
574
|
-
const hr = 4096;
|
|
575
|
-
function Lr(e) {
|
|
576
|
-
const r = e.length;
|
|
577
|
-
if (r <= hr)
|
|
578
|
-
return String.fromCharCode.apply(String, e);
|
|
579
|
-
let t = "", n = 0;
|
|
580
|
-
for (; n < r; )
|
|
581
|
-
t += String.fromCharCode.apply(
|
|
582
|
-
String,
|
|
583
|
-
e.slice(n, n += hr)
|
|
584
|
-
);
|
|
585
|
-
return t;
|
|
586
|
-
}
|
|
587
|
-
function br(e, r, t) {
|
|
588
|
-
let n = "";
|
|
589
|
-
t = Math.min(e.length, t);
|
|
590
|
-
for (let i = r; i < t; ++i)
|
|
591
|
-
n += String.fromCharCode(e[i] & 127);
|
|
592
|
-
return n;
|
|
593
|
-
}
|
|
594
|
-
function Mr(e, r, t) {
|
|
595
|
-
let n = "";
|
|
596
|
-
t = Math.min(e.length, t);
|
|
597
|
-
for (let i = r; i < t; ++i)
|
|
598
|
-
n += String.fromCharCode(e[i]);
|
|
599
|
-
return n;
|
|
600
|
-
}
|
|
601
|
-
function Nr(e, r, t) {
|
|
602
|
-
const n = e.length;
|
|
603
|
-
(!r || r < 0) && (r = 0), (!t || t < 0 || t > n) && (t = n);
|
|
604
|
-
let i = "";
|
|
605
|
-
for (let u = r; u < t; ++u)
|
|
606
|
-
i += jr[e[u]];
|
|
607
|
-
return i;
|
|
608
|
-
}
|
|
609
|
-
function kr(e, r, t) {
|
|
610
|
-
const n = e.slice(r, t);
|
|
611
|
-
let i = "";
|
|
612
|
-
for (let u = 0; u < n.length - 1; u += 2)
|
|
613
|
-
i += String.fromCharCode(n[u] + n[u + 1] * 256);
|
|
614
|
-
return i;
|
|
615
|
-
}
|
|
616
|
-
o.prototype.slice = function(r, t) {
|
|
617
|
-
const n = this.length;
|
|
618
|
-
r = ~~r, t = t === void 0 ? n : ~~t, r < 0 ? (r += n, r < 0 && (r = 0)) : r > n && (r = n), t < 0 ? (t += n, t < 0 && (t = 0)) : t > n && (t = n), t < r && (t = r);
|
|
619
|
-
const i = this.subarray(r, t);
|
|
620
|
-
return Object.setPrototypeOf(i, o.prototype), i;
|
|
621
|
-
};
|
|
622
|
-
function I(e, r, t) {
|
|
623
|
-
if (e % 1 !== 0 || e < 0)
|
|
624
|
-
throw new RangeError("offset is not uint");
|
|
625
|
-
if (e + r > t)
|
|
626
|
-
throw new RangeError("Trying to access beyond buffer length");
|
|
627
|
-
}
|
|
628
|
-
o.prototype.readUintLE = o.prototype.readUIntLE = function(r, t, n) {
|
|
629
|
-
r = r >>> 0, t = t >>> 0, n || I(r, t, this.length);
|
|
630
|
-
let i = this[r], u = 1, h = 0;
|
|
631
|
-
for (; ++h < t && (u *= 256); )
|
|
632
|
-
i += this[r + h] * u;
|
|
633
|
-
return i;
|
|
634
|
-
}, o.prototype.readUintBE = o.prototype.readUIntBE = function(r, t, n) {
|
|
635
|
-
r = r >>> 0, t = t >>> 0, n || I(r, t, this.length);
|
|
636
|
-
let i = this[r + --t], u = 1;
|
|
637
|
-
for (; t > 0 && (u *= 256); )
|
|
638
|
-
i += this[r + --t] * u;
|
|
639
|
-
return i;
|
|
640
|
-
}, o.prototype.readUint8 = o.prototype.readUInt8 = function(r, t) {
|
|
641
|
-
return r = r >>> 0, t || I(r, 1, this.length), this[r];
|
|
642
|
-
}, o.prototype.readUint16LE = o.prototype.readUInt16LE = function(r, t) {
|
|
643
|
-
return r = r >>> 0, t || I(r, 2, this.length), this[r] | this[r + 1] << 8;
|
|
644
|
-
}, o.prototype.readUint16BE = o.prototype.readUInt16BE = function(r, t) {
|
|
645
|
-
return r = r >>> 0, t || I(r, 2, this.length), this[r] << 8 | this[r + 1];
|
|
646
|
-
}, o.prototype.readUint32LE = o.prototype.readUInt32LE = function(r, t) {
|
|
647
|
-
return r = r >>> 0, t || I(r, 4, this.length), (this[r] | this[r + 1] << 8 | this[r + 2] << 16) + this[r + 3] * 16777216;
|
|
648
|
-
}, o.prototype.readUint32BE = o.prototype.readUInt32BE = function(r, t) {
|
|
649
|
-
return r = r >>> 0, t || I(r, 4, this.length), this[r] * 16777216 + (this[r + 1] << 16 | this[r + 2] << 8 | this[r + 3]);
|
|
650
|
-
}, o.prototype.readBigUInt64LE = D(function(r) {
|
|
651
|
-
r = r >>> 0, W(r, "offset");
|
|
652
|
-
const t = this[r], n = this[r + 7];
|
|
653
|
-
(t === void 0 || n === void 0) && H(r, this.length - 8);
|
|
654
|
-
const i = t + this[++r] * 2 ** 8 + this[++r] * 2 ** 16 + this[++r] * 2 ** 24, u = this[++r] + this[++r] * 2 ** 8 + this[++r] * 2 ** 16 + n * 2 ** 24;
|
|
655
|
-
return BigInt(i) + (BigInt(u) << BigInt(32));
|
|
656
|
-
}), o.prototype.readBigUInt64BE = D(function(r) {
|
|
657
|
-
r = r >>> 0, W(r, "offset");
|
|
658
|
-
const t = this[r], n = this[r + 7];
|
|
659
|
-
(t === void 0 || n === void 0) && H(r, this.length - 8);
|
|
660
|
-
const i = t * 2 ** 24 + this[++r] * 2 ** 16 + this[++r] * 2 ** 8 + this[++r], u = this[++r] * 2 ** 24 + this[++r] * 2 ** 16 + this[++r] * 2 ** 8 + n;
|
|
661
|
-
return (BigInt(i) << BigInt(32)) + BigInt(u);
|
|
662
|
-
}), o.prototype.readIntLE = function(r, t, n) {
|
|
663
|
-
r = r >>> 0, t = t >>> 0, n || I(r, t, this.length);
|
|
664
|
-
let i = this[r], u = 1, h = 0;
|
|
665
|
-
for (; ++h < t && (u *= 256); )
|
|
666
|
-
i += this[r + h] * u;
|
|
667
|
-
return u *= 128, i >= u && (i -= Math.pow(2, 8 * t)), i;
|
|
668
|
-
}, o.prototype.readIntBE = function(r, t, n) {
|
|
669
|
-
r = r >>> 0, t = t >>> 0, n || I(r, t, this.length);
|
|
670
|
-
let i = t, u = 1, h = this[r + --i];
|
|
671
|
-
for (; i > 0 && (u *= 256); )
|
|
672
|
-
h += this[r + --i] * u;
|
|
673
|
-
return u *= 128, h >= u && (h -= Math.pow(2, 8 * t)), h;
|
|
674
|
-
}, o.prototype.readInt8 = function(r, t) {
|
|
675
|
-
return r = r >>> 0, t || I(r, 1, this.length), this[r] & 128 ? (255 - this[r] + 1) * -1 : this[r];
|
|
676
|
-
}, o.prototype.readInt16LE = function(r, t) {
|
|
677
|
-
r = r >>> 0, t || I(r, 2, this.length);
|
|
678
|
-
const n = this[r] | this[r + 1] << 8;
|
|
679
|
-
return n & 32768 ? n | 4294901760 : n;
|
|
680
|
-
}, o.prototype.readInt16BE = function(r, t) {
|
|
681
|
-
r = r >>> 0, t || I(r, 2, this.length);
|
|
682
|
-
const n = this[r + 1] | this[r] << 8;
|
|
683
|
-
return n & 32768 ? n | 4294901760 : n;
|
|
684
|
-
}, o.prototype.readInt32LE = function(r, t) {
|
|
685
|
-
return r = r >>> 0, t || I(r, 4, this.length), this[r] | this[r + 1] << 8 | this[r + 2] << 16 | this[r + 3] << 24;
|
|
686
|
-
}, o.prototype.readInt32BE = function(r, t) {
|
|
687
|
-
return r = r >>> 0, t || I(r, 4, this.length), this[r] << 24 | this[r + 1] << 16 | this[r + 2] << 8 | this[r + 3];
|
|
688
|
-
}, o.prototype.readBigInt64LE = D(function(r) {
|
|
689
|
-
r = r >>> 0, W(r, "offset");
|
|
690
|
-
const t = this[r], n = this[r + 7];
|
|
691
|
-
(t === void 0 || n === void 0) && H(r, this.length - 8);
|
|
692
|
-
const i = this[r + 4] + this[r + 5] * 2 ** 8 + this[r + 6] * 2 ** 16 + (n << 24);
|
|
693
|
-
return (BigInt(i) << BigInt(32)) + BigInt(t + this[++r] * 2 ** 8 + this[++r] * 2 ** 16 + this[++r] * 2 ** 24);
|
|
694
|
-
}), o.prototype.readBigInt64BE = D(function(r) {
|
|
695
|
-
r = r >>> 0, W(r, "offset");
|
|
696
|
-
const t = this[r], n = this[r + 7];
|
|
697
|
-
(t === void 0 || n === void 0) && H(r, this.length - 8);
|
|
698
|
-
const i = (t << 24) + // Overflow
|
|
699
|
-
this[++r] * 2 ** 16 + this[++r] * 2 ** 8 + this[++r];
|
|
700
|
-
return (BigInt(i) << BigInt(32)) + BigInt(this[++r] * 2 ** 24 + this[++r] * 2 ** 16 + this[++r] * 2 ** 8 + n);
|
|
701
|
-
}), o.prototype.readFloatLE = function(r, t) {
|
|
702
|
-
return r = r >>> 0, t || I(r, 4, this.length), p.read(this, r, !0, 23, 4);
|
|
703
|
-
}, o.prototype.readFloatBE = function(r, t) {
|
|
704
|
-
return r = r >>> 0, t || I(r, 4, this.length), p.read(this, r, !1, 23, 4);
|
|
705
|
-
}, o.prototype.readDoubleLE = function(r, t) {
|
|
706
|
-
return r = r >>> 0, t || I(r, 8, this.length), p.read(this, r, !0, 52, 8);
|
|
707
|
-
}, o.prototype.readDoubleBE = function(r, t) {
|
|
708
|
-
return r = r >>> 0, t || I(r, 8, this.length), p.read(this, r, !1, 52, 8);
|
|
709
|
-
};
|
|
710
|
-
function T(e, r, t, n, i, u) {
|
|
711
|
-
if (!o.isBuffer(e))
|
|
712
|
-
throw new TypeError('"buffer" argument must be a Buffer instance');
|
|
713
|
-
if (r > i || r < u)
|
|
714
|
-
throw new RangeError('"value" argument is out of bounds');
|
|
715
|
-
if (t + n > e.length)
|
|
716
|
-
throw new RangeError("Index out of range");
|
|
717
|
-
}
|
|
718
|
-
o.prototype.writeUintLE = o.prototype.writeUIntLE = function(r, t, n, i) {
|
|
719
|
-
if (r = +r, t = t >>> 0, n = n >>> 0, !i) {
|
|
720
|
-
const l = Math.pow(2, 8 * n) - 1;
|
|
721
|
-
T(this, r, t, n, l, 0);
|
|
722
|
-
}
|
|
723
|
-
let u = 1, h = 0;
|
|
724
|
-
for (this[t] = r & 255; ++h < n && (u *= 256); )
|
|
725
|
-
this[t + h] = r / u & 255;
|
|
726
|
-
return t + n;
|
|
727
|
-
}, o.prototype.writeUintBE = o.prototype.writeUIntBE = function(r, t, n, i) {
|
|
728
|
-
if (r = +r, t = t >>> 0, n = n >>> 0, !i) {
|
|
729
|
-
const l = Math.pow(2, 8 * n) - 1;
|
|
730
|
-
T(this, r, t, n, l, 0);
|
|
731
|
-
}
|
|
732
|
-
let u = n - 1, h = 1;
|
|
733
|
-
for (this[t + u] = r & 255; --u >= 0 && (h *= 256); )
|
|
734
|
-
this[t + u] = r / h & 255;
|
|
735
|
-
return t + n;
|
|
736
|
-
}, o.prototype.writeUint8 = o.prototype.writeUInt8 = function(r, t, n) {
|
|
737
|
-
return r = +r, t = t >>> 0, n || T(this, r, t, 1, 255, 0), this[t] = r & 255, t + 1;
|
|
738
|
-
}, o.prototype.writeUint16LE = o.prototype.writeUInt16LE = function(r, t, n) {
|
|
739
|
-
return r = +r, t = t >>> 0, n || T(this, r, t, 2, 65535, 0), this[t] = r & 255, this[t + 1] = r >>> 8, t + 2;
|
|
740
|
-
}, o.prototype.writeUint16BE = o.prototype.writeUInt16BE = function(r, t, n) {
|
|
741
|
-
return r = +r, t = t >>> 0, n || T(this, r, t, 2, 65535, 0), this[t] = r >>> 8, this[t + 1] = r & 255, t + 2;
|
|
742
|
-
}, o.prototype.writeUint32LE = o.prototype.writeUInt32LE = function(r, t, n) {
|
|
743
|
-
return r = +r, t = t >>> 0, n || T(this, r, t, 4, 4294967295, 0), this[t + 3] = r >>> 24, this[t + 2] = r >>> 16, this[t + 1] = r >>> 8, this[t] = r & 255, t + 4;
|
|
744
|
-
}, o.prototype.writeUint32BE = o.prototype.writeUInt32BE = function(r, t, n) {
|
|
745
|
-
return r = +r, t = t >>> 0, n || T(this, r, t, 4, 4294967295, 0), this[t] = r >>> 24, this[t + 1] = r >>> 16, this[t + 2] = r >>> 8, this[t + 3] = r & 255, t + 4;
|
|
746
|
-
};
|
|
747
|
-
function cr(e, r, t, n, i) {
|
|
748
|
-
yr(r, n, i, e, t, 7);
|
|
749
|
-
let u = Number(r & BigInt(4294967295));
|
|
750
|
-
e[t++] = u, u = u >> 8, e[t++] = u, u = u >> 8, e[t++] = u, u = u >> 8, e[t++] = u;
|
|
751
|
-
let h = Number(r >> BigInt(32) & BigInt(4294967295));
|
|
752
|
-
return e[t++] = h, h = h >> 8, e[t++] = h, h = h >> 8, e[t++] = h, h = h >> 8, e[t++] = h, t;
|
|
753
|
-
}
|
|
754
|
-
function fr(e, r, t, n, i) {
|
|
755
|
-
yr(r, n, i, e, t, 7);
|
|
756
|
-
let u = Number(r & BigInt(4294967295));
|
|
757
|
-
e[t + 7] = u, u = u >> 8, e[t + 6] = u, u = u >> 8, e[t + 5] = u, u = u >> 8, e[t + 4] = u;
|
|
758
|
-
let h = Number(r >> BigInt(32) & BigInt(4294967295));
|
|
759
|
-
return e[t + 3] = h, h = h >> 8, e[t + 2] = h, h = h >> 8, e[t + 1] = h, h = h >> 8, e[t] = h, t + 8;
|
|
760
|
-
}
|
|
761
|
-
o.prototype.writeBigUInt64LE = D(function(r, t = 0) {
|
|
762
|
-
return cr(this, r, t, BigInt(0), BigInt("0xffffffffffffffff"));
|
|
763
|
-
}), o.prototype.writeBigUInt64BE = D(function(r, t = 0) {
|
|
764
|
-
return fr(this, r, t, BigInt(0), BigInt("0xffffffffffffffff"));
|
|
765
|
-
}), o.prototype.writeIntLE = function(r, t, n, i) {
|
|
766
|
-
if (r = +r, t = t >>> 0, !i) {
|
|
767
|
-
const E = Math.pow(2, 8 * n - 1);
|
|
768
|
-
T(this, r, t, n, E - 1, -E);
|
|
769
|
-
}
|
|
770
|
-
let u = 0, h = 1, l = 0;
|
|
771
|
-
for (this[t] = r & 255; ++u < n && (h *= 256); )
|
|
772
|
-
r < 0 && l === 0 && this[t + u - 1] !== 0 && (l = 1), this[t + u] = (r / h >> 0) - l & 255;
|
|
773
|
-
return t + n;
|
|
774
|
-
}, o.prototype.writeIntBE = function(r, t, n, i) {
|
|
775
|
-
if (r = +r, t = t >>> 0, !i) {
|
|
776
|
-
const E = Math.pow(2, 8 * n - 1);
|
|
777
|
-
T(this, r, t, n, E - 1, -E);
|
|
778
|
-
}
|
|
779
|
-
let u = n - 1, h = 1, l = 0;
|
|
780
|
-
for (this[t + u] = r & 255; --u >= 0 && (h *= 256); )
|
|
781
|
-
r < 0 && l === 0 && this[t + u + 1] !== 0 && (l = 1), this[t + u] = (r / h >> 0) - l & 255;
|
|
782
|
-
return t + n;
|
|
783
|
-
}, o.prototype.writeInt8 = function(r, t, n) {
|
|
784
|
-
return r = +r, t = t >>> 0, n || T(this, r, t, 1, 127, -128), r < 0 && (r = 255 + r + 1), this[t] = r & 255, t + 1;
|
|
785
|
-
}, o.prototype.writeInt16LE = function(r, t, n) {
|
|
786
|
-
return r = +r, t = t >>> 0, n || T(this, r, t, 2, 32767, -32768), this[t] = r & 255, this[t + 1] = r >>> 8, t + 2;
|
|
787
|
-
}, o.prototype.writeInt16BE = function(r, t, n) {
|
|
788
|
-
return r = +r, t = t >>> 0, n || T(this, r, t, 2, 32767, -32768), this[t] = r >>> 8, this[t + 1] = r & 255, t + 2;
|
|
789
|
-
}, o.prototype.writeInt32LE = function(r, t, n) {
|
|
790
|
-
return r = +r, t = t >>> 0, n || T(this, r, t, 4, 2147483647, -2147483648), this[t] = r & 255, this[t + 1] = r >>> 8, this[t + 2] = r >>> 16, this[t + 3] = r >>> 24, t + 4;
|
|
791
|
-
}, o.prototype.writeInt32BE = function(r, t, n) {
|
|
792
|
-
return r = +r, t = t >>> 0, n || T(this, r, t, 4, 2147483647, -2147483648), r < 0 && (r = 4294967295 + r + 1), this[t] = r >>> 24, this[t + 1] = r >>> 16, this[t + 2] = r >>> 8, this[t + 3] = r & 255, t + 4;
|
|
793
|
-
}, o.prototype.writeBigInt64LE = D(function(r, t = 0) {
|
|
794
|
-
return cr(this, r, t, -BigInt("0x8000000000000000"), BigInt("0x7fffffffffffffff"));
|
|
795
|
-
}), o.prototype.writeBigInt64BE = D(function(r, t = 0) {
|
|
796
|
-
return fr(this, r, t, -BigInt("0x8000000000000000"), BigInt("0x7fffffffffffffff"));
|
|
797
|
-
});
|
|
798
|
-
function sr(e, r, t, n, i, u) {
|
|
799
|
-
if (t + n > e.length)
|
|
800
|
-
throw new RangeError("Index out of range");
|
|
801
|
-
if (t < 0)
|
|
802
|
-
throw new RangeError("Index out of range");
|
|
803
|
-
}
|
|
804
|
-
function pr(e, r, t, n, i) {
|
|
805
|
-
return r = +r, t = t >>> 0, i || sr(e, r, t, 4), p.write(e, r, t, n, 23, 4), t + 4;
|
|
806
|
-
}
|
|
807
|
-
o.prototype.writeFloatLE = function(r, t, n) {
|
|
808
|
-
return pr(this, r, t, !0, n);
|
|
809
|
-
}, o.prototype.writeFloatBE = function(r, t, n) {
|
|
810
|
-
return pr(this, r, t, !1, n);
|
|
811
|
-
};
|
|
812
|
-
function lr(e, r, t, n, i) {
|
|
813
|
-
return r = +r, t = t >>> 0, i || sr(e, r, t, 8), p.write(e, r, t, n, 52, 8), t + 8;
|
|
814
|
-
}
|
|
815
|
-
o.prototype.writeDoubleLE = function(r, t, n) {
|
|
816
|
-
return lr(this, r, t, !0, n);
|
|
817
|
-
}, o.prototype.writeDoubleBE = function(r, t, n) {
|
|
818
|
-
return lr(this, r, t, !1, n);
|
|
819
|
-
}, o.prototype.copy = function(r, t, n, i) {
|
|
820
|
-
if (!o.isBuffer(r))
|
|
821
|
-
throw new TypeError("argument should be a Buffer");
|
|
822
|
-
if (n || (n = 0), !i && i !== 0 && (i = this.length), t >= r.length && (t = r.length), t || (t = 0), i > 0 && i < n && (i = n), i === n || r.length === 0 || this.length === 0)
|
|
823
|
-
return 0;
|
|
824
|
-
if (t < 0)
|
|
825
|
-
throw new RangeError("targetStart out of bounds");
|
|
826
|
-
if (n < 0 || n >= this.length)
|
|
827
|
-
throw new RangeError("Index out of range");
|
|
828
|
-
if (i < 0)
|
|
829
|
-
throw new RangeError("sourceEnd out of bounds");
|
|
830
|
-
i > this.length && (i = this.length), r.length - t < i - n && (i = r.length - t + n);
|
|
831
|
-
const u = i - n;
|
|
832
|
-
return this === r && typeof Uint8Array.prototype.copyWithin == "function" ? this.copyWithin(t, n, i) : Uint8Array.prototype.set.call(
|
|
833
|
-
r,
|
|
834
|
-
this.subarray(n, i),
|
|
835
|
-
t
|
|
836
|
-
), u;
|
|
837
|
-
}, o.prototype.fill = function(r, t, n, i) {
|
|
838
|
-
if (typeof r == "string") {
|
|
839
|
-
if (typeof t == "string" ? (i = t, t = 0, n = this.length) : typeof n == "string" && (i = n, n = this.length), i !== void 0 && typeof i != "string")
|
|
840
|
-
throw new TypeError("encoding must be a string");
|
|
841
|
-
if (typeof i == "string" && !o.isEncoding(i))
|
|
842
|
-
throw new TypeError("Unknown encoding: " + i);
|
|
843
|
-
if (r.length === 1) {
|
|
844
|
-
const h = r.charCodeAt(0);
|
|
845
|
-
(i === "utf8" && h < 128 || i === "latin1") && (r = h);
|
|
846
|
-
}
|
|
847
|
-
} else
|
|
848
|
-
typeof r == "number" ? r = r & 255 : typeof r == "boolean" && (r = Number(r));
|
|
849
|
-
if (t < 0 || this.length < t || this.length < n)
|
|
850
|
-
throw new RangeError("Out of range index");
|
|
851
|
-
if (n <= t)
|
|
852
|
-
return this;
|
|
853
|
-
t = t >>> 0, n = n === void 0 ? this.length : n >>> 0, r || (r = 0);
|
|
854
|
-
let u;
|
|
855
|
-
if (typeof r == "number")
|
|
856
|
-
for (u = t; u < n; ++u)
|
|
857
|
-
this[u] = r;
|
|
858
|
-
else {
|
|
859
|
-
const h = o.isBuffer(r) ? r : o.from(r, i), l = h.length;
|
|
860
|
-
if (l === 0)
|
|
861
|
-
throw new TypeError('The value "' + r + '" is invalid for argument "value"');
|
|
862
|
-
for (u = 0; u < n - t; ++u)
|
|
863
|
-
this[u + t] = h[u % l];
|
|
864
|
-
}
|
|
865
|
-
return this;
|
|
866
|
-
};
|
|
867
|
-
const O = {};
|
|
868
|
-
function Q(e, r, t) {
|
|
869
|
-
O[e] = class extends t {
|
|
870
|
-
constructor() {
|
|
871
|
-
super(), Object.defineProperty(this, "message", {
|
|
872
|
-
value: r.apply(this, arguments),
|
|
873
|
-
writable: !0,
|
|
874
|
-
configurable: !0
|
|
875
|
-
}), this.name = `${this.name} [${e}]`, this.stack, delete this.name;
|
|
876
|
-
}
|
|
877
|
-
get code() {
|
|
878
|
-
return e;
|
|
879
|
-
}
|
|
880
|
-
set code(i) {
|
|
881
|
-
Object.defineProperty(this, "code", {
|
|
882
|
-
configurable: !0,
|
|
883
|
-
enumerable: !0,
|
|
884
|
-
value: i,
|
|
885
|
-
writable: !0
|
|
886
|
-
});
|
|
887
|
-
}
|
|
888
|
-
toString() {
|
|
889
|
-
return `${this.name} [${e}]: ${this.message}`;
|
|
890
|
-
}
|
|
891
|
-
};
|
|
892
|
-
}
|
|
893
|
-
Q(
|
|
894
|
-
"ERR_BUFFER_OUT_OF_BOUNDS",
|
|
895
|
-
function(e) {
|
|
896
|
-
return e ? `${e} is outside of buffer bounds` : "Attempt to access memory outside buffer bounds";
|
|
897
|
-
},
|
|
898
|
-
RangeError
|
|
899
|
-
), Q(
|
|
900
|
-
"ERR_INVALID_ARG_TYPE",
|
|
901
|
-
function(e, r) {
|
|
902
|
-
return `The "${e}" argument must be of type number. Received type ${typeof r}`;
|
|
903
|
-
},
|
|
904
|
-
TypeError
|
|
905
|
-
), Q(
|
|
906
|
-
"ERR_OUT_OF_RANGE",
|
|
907
|
-
function(e, r, t) {
|
|
908
|
-
let n = `The value of "${e}" is out of range.`, i = t;
|
|
909
|
-
return Number.isInteger(t) && Math.abs(t) > 2 ** 32 ? i = ar(String(t)) : typeof t == "bigint" && (i = String(t), (t > BigInt(2) ** BigInt(32) || t < -(BigInt(2) ** BigInt(32))) && (i = ar(i)), i += "n"), n += ` It must be ${r}. Received ${i}`, n;
|
|
910
|
-
},
|
|
911
|
-
RangeError
|
|
912
|
-
);
|
|
913
|
-
function ar(e) {
|
|
914
|
-
let r = "", t = e.length;
|
|
915
|
-
const n = e[0] === "-" ? 1 : 0;
|
|
916
|
-
for (; t >= n + 4; t -= 3)
|
|
917
|
-
r = `_${e.slice(t - 3, t)}${r}`;
|
|
918
|
-
return `${e.slice(0, t)}${r}`;
|
|
919
|
-
}
|
|
920
|
-
function Dr(e, r, t) {
|
|
921
|
-
W(r, "offset"), (e[r] === void 0 || e[r + t] === void 0) && H(r, e.length - (t + 1));
|
|
922
|
-
}
|
|
923
|
-
function yr(e, r, t, n, i, u) {
|
|
924
|
-
if (e > t || e < r) {
|
|
925
|
-
const h = typeof r == "bigint" ? "n" : "";
|
|
926
|
-
let l;
|
|
927
|
-
throw u > 3 ? r === 0 || r === BigInt(0) ? l = `>= 0${h} and < 2${h} ** ${(u + 1) * 8}${h}` : l = `>= -(2${h} ** ${(u + 1) * 8 - 1}${h}) and < 2 ** ${(u + 1) * 8 - 1}${h}` : l = `>= ${r}${h} and <= ${t}${h}`, new O.ERR_OUT_OF_RANGE("value", l, e);
|
|
928
|
-
}
|
|
929
|
-
Dr(n, i, u);
|
|
930
|
-
}
|
|
931
|
-
function W(e, r) {
|
|
932
|
-
if (typeof e != "number")
|
|
933
|
-
throw new O.ERR_INVALID_ARG_TYPE(r, "number", e);
|
|
934
|
-
}
|
|
935
|
-
function H(e, r, t) {
|
|
936
|
-
throw Math.floor(e) !== e ? (W(e, t), new O.ERR_OUT_OF_RANGE(t || "offset", "an integer", e)) : r < 0 ? new O.ERR_BUFFER_OUT_OF_BOUNDS() : new O.ERR_OUT_OF_RANGE(
|
|
937
|
-
t || "offset",
|
|
938
|
-
`>= ${t ? 1 : 0} and <= ${r}`,
|
|
939
|
-
e
|
|
940
|
-
);
|
|
941
|
-
}
|
|
942
|
-
const $r = /[^+/0-9A-Za-z-_]/g;
|
|
943
|
-
function Pr(e) {
|
|
944
|
-
if (e = e.split("=")[0], e = e.trim().replace($r, ""), e.length < 2)
|
|
945
|
-
return "";
|
|
946
|
-
for (; e.length % 4 !== 0; )
|
|
947
|
-
e = e + "=";
|
|
948
|
-
return e;
|
|
949
|
-
}
|
|
950
|
-
function K(e, r) {
|
|
951
|
-
r = r || 1 / 0;
|
|
952
|
-
let t;
|
|
953
|
-
const n = e.length;
|
|
954
|
-
let i = null;
|
|
955
|
-
const u = [];
|
|
956
|
-
for (let h = 0; h < n; ++h) {
|
|
957
|
-
if (t = e.charCodeAt(h), t > 55295 && t < 57344) {
|
|
958
|
-
if (!i) {
|
|
959
|
-
if (t > 56319) {
|
|
960
|
-
(r -= 3) > -1 && u.push(239, 191, 189);
|
|
961
|
-
continue;
|
|
962
|
-
} else if (h + 1 === n) {
|
|
963
|
-
(r -= 3) > -1 && u.push(239, 191, 189);
|
|
964
|
-
continue;
|
|
965
|
-
}
|
|
966
|
-
i = t;
|
|
967
|
-
continue;
|
|
968
|
-
}
|
|
969
|
-
if (t < 56320) {
|
|
970
|
-
(r -= 3) > -1 && u.push(239, 191, 189), i = t;
|
|
971
|
-
continue;
|
|
972
|
-
}
|
|
973
|
-
t = (i - 55296 << 10 | t - 56320) + 65536;
|
|
974
|
-
} else
|
|
975
|
-
i && (r -= 3) > -1 && u.push(239, 191, 189);
|
|
976
|
-
if (i = null, t < 128) {
|
|
977
|
-
if ((r -= 1) < 0)
|
|
978
|
-
break;
|
|
979
|
-
u.push(t);
|
|
980
|
-
} else if (t < 2048) {
|
|
981
|
-
if ((r -= 2) < 0)
|
|
982
|
-
break;
|
|
983
|
-
u.push(
|
|
984
|
-
t >> 6 | 192,
|
|
985
|
-
t & 63 | 128
|
|
986
|
-
);
|
|
987
|
-
} else if (t < 65536) {
|
|
988
|
-
if ((r -= 3) < 0)
|
|
989
|
-
break;
|
|
990
|
-
u.push(
|
|
991
|
-
t >> 12 | 224,
|
|
992
|
-
t >> 6 & 63 | 128,
|
|
993
|
-
t & 63 | 128
|
|
994
|
-
);
|
|
995
|
-
} else if (t < 1114112) {
|
|
996
|
-
if ((r -= 4) < 0)
|
|
997
|
-
break;
|
|
998
|
-
u.push(
|
|
999
|
-
t >> 18 | 240,
|
|
1000
|
-
t >> 12 & 63 | 128,
|
|
1001
|
-
t >> 6 & 63 | 128,
|
|
1002
|
-
t & 63 | 128
|
|
1003
|
-
);
|
|
1004
|
-
} else
|
|
1005
|
-
throw new Error("Invalid code point");
|
|
1006
|
-
}
|
|
1007
|
-
return u;
|
|
1008
|
-
}
|
|
1009
|
-
function Or(e) {
|
|
1010
|
-
const r = [];
|
|
1011
|
-
for (let t = 0; t < e.length; ++t)
|
|
1012
|
-
r.push(e.charCodeAt(t) & 255);
|
|
1013
|
-
return r;
|
|
1014
|
-
}
|
|
1015
|
-
function Wr(e, r) {
|
|
1016
|
-
let t, n, i;
|
|
1017
|
-
const u = [];
|
|
1018
|
-
for (let h = 0; h < e.length && !((r -= 2) < 0); ++h)
|
|
1019
|
-
t = e.charCodeAt(h), n = t >> 8, i = t % 256, u.push(i), u.push(n);
|
|
1020
|
-
return u;
|
|
1021
|
-
}
|
|
1022
|
-
function wr(e) {
|
|
1023
|
-
return f.toByteArray(Pr(e));
|
|
1024
|
-
}
|
|
1025
|
-
function V(e, r, t, n) {
|
|
1026
|
-
let i;
|
|
1027
|
-
for (i = 0; i < n && !(i + t >= r.length || i >= e.length); ++i)
|
|
1028
|
-
r[i + t] = e[i];
|
|
1029
|
-
return i;
|
|
1030
|
-
}
|
|
1031
|
-
function S(e, r) {
|
|
1032
|
-
return e instanceof r || e != null && e.constructor != null && e.constructor.name != null && e.constructor.name === r.name;
|
|
1033
|
-
}
|
|
1034
|
-
function Z(e) {
|
|
1035
|
-
return e !== e;
|
|
1036
|
-
}
|
|
1037
|
-
const jr = function() {
|
|
1038
|
-
const e = "0123456789abcdef", r = new Array(256);
|
|
1039
|
-
for (let t = 0; t < 16; ++t) {
|
|
1040
|
-
const n = t * 16;
|
|
1041
|
-
for (let i = 0; i < 16; ++i)
|
|
1042
|
-
r[n + i] = e[t] + e[i];
|
|
1043
|
-
}
|
|
1044
|
-
return r;
|
|
1045
|
-
}();
|
|
1046
|
-
function D(e) {
|
|
1047
|
-
return typeof BigInt > "u" ? Gr : e;
|
|
1048
|
-
}
|
|
1049
|
-
function Gr() {
|
|
1050
|
-
throw new Error("BigInt not supported");
|
|
1051
|
-
}
|
|
1052
|
-
})(xr);
|
|
1053
|
-
var dr = { exports: {} }, g = dr.exports = {}, _, L;
|
|
1054
|
-
function rr() {
|
|
1055
|
-
throw new Error("setTimeout has not been defined");
|
|
1056
|
-
}
|
|
1057
|
-
function tr() {
|
|
1058
|
-
throw new Error("clearTimeout has not been defined");
|
|
1059
|
-
}
|
|
1060
|
-
(function() {
|
|
1061
|
-
try {
|
|
1062
|
-
typeof setTimeout == "function" ? _ = setTimeout : _ = rr;
|
|
1063
|
-
} catch {
|
|
1064
|
-
_ = rr;
|
|
1065
|
-
}
|
|
1066
|
-
try {
|
|
1067
|
-
typeof clearTimeout == "function" ? L = clearTimeout : L = tr;
|
|
1068
|
-
} catch {
|
|
1069
|
-
L = tr;
|
|
1070
|
-
}
|
|
1071
|
-
})();
|
|
1072
|
-
function Er(c) {
|
|
1073
|
-
if (_ === setTimeout)
|
|
1074
|
-
return setTimeout(c, 0);
|
|
1075
|
-
if ((_ === rr || !_) && setTimeout)
|
|
1076
|
-
return _ = setTimeout, setTimeout(c, 0);
|
|
1077
|
-
try {
|
|
1078
|
-
return _(c, 0);
|
|
1079
|
-
} catch {
|
|
1080
|
-
try {
|
|
1081
|
-
return _.call(null, c, 0);
|
|
1082
|
-
} catch {
|
|
1083
|
-
return _.call(this, c, 0);
|
|
1084
|
-
}
|
|
1085
|
-
}
|
|
1086
|
-
}
|
|
1087
|
-
function Zr(c) {
|
|
1088
|
-
if (L === clearTimeout)
|
|
1089
|
-
return clearTimeout(c);
|
|
1090
|
-
if ((L === tr || !L) && clearTimeout)
|
|
1091
|
-
return L = clearTimeout, clearTimeout(c);
|
|
1092
|
-
try {
|
|
1093
|
-
return L(c);
|
|
1094
|
-
} catch {
|
|
1095
|
-
try {
|
|
1096
|
-
return L.call(null, c);
|
|
1097
|
-
} catch {
|
|
1098
|
-
return L.call(this, c);
|
|
1099
|
-
}
|
|
1100
|
-
}
|
|
1101
|
-
}
|
|
1102
|
-
var M = [], G = !1, P, X = -1;
|
|
1103
|
-
function vr() {
|
|
1104
|
-
!G || !P || (G = !1, P.length ? M = P.concat(M) : X = -1, M.length && mr());
|
|
1105
|
-
}
|
|
1106
|
-
function mr() {
|
|
1107
|
-
if (!G) {
|
|
1108
|
-
var c = Er(vr);
|
|
1109
|
-
G = !0;
|
|
1110
|
-
for (var f = M.length; f; ) {
|
|
1111
|
-
for (P = M, M = []; ++X < f; )
|
|
1112
|
-
P && P[X].run();
|
|
1113
|
-
X = -1, f = M.length;
|
|
1114
|
-
}
|
|
1115
|
-
P = null, G = !1, Zr(c);
|
|
1116
|
-
}
|
|
1117
|
-
}
|
|
1118
|
-
g.nextTick = function(c) {
|
|
1119
|
-
var f = new Array(arguments.length - 1);
|
|
1120
|
-
if (arguments.length > 1)
|
|
1121
|
-
for (var p = 1; p < arguments.length; p++)
|
|
1122
|
-
f[p - 1] = arguments[p];
|
|
1123
|
-
M.push(new gr(c, f)), M.length === 1 && !G && Er(mr);
|
|
1124
|
-
};
|
|
1125
|
-
function gr(c, f) {
|
|
1126
|
-
this.fun = c, this.array = f;
|
|
1127
|
-
}
|
|
1128
|
-
gr.prototype.run = function() {
|
|
1129
|
-
this.fun.apply(null, this.array);
|
|
1130
|
-
};
|
|
1131
|
-
g.title = "browser";
|
|
1132
|
-
g.browser = !0;
|
|
1133
|
-
g.env = {};
|
|
1134
|
-
g.argv = [];
|
|
1135
|
-
g.version = "";
|
|
1136
|
-
g.versions = {};
|
|
1137
|
-
function N() {
|
|
1138
|
-
}
|
|
1139
|
-
g.on = N;
|
|
1140
|
-
g.addListener = N;
|
|
1141
|
-
g.once = N;
|
|
1142
|
-
g.off = N;
|
|
1143
|
-
g.removeListener = N;
|
|
1144
|
-
g.removeAllListeners = N;
|
|
1145
|
-
g.emit = N;
|
|
1146
|
-
g.prependListener = N;
|
|
1147
|
-
g.prependOnceListener = N;
|
|
1148
|
-
g.listeners = function(c) {
|
|
1149
|
-
return [];
|
|
1150
|
-
};
|
|
1151
|
-
g.binding = function(c) {
|
|
1152
|
-
throw new Error("process.binding is not supported");
|
|
1153
|
-
};
|
|
1154
|
-
g.cwd = function() {
|
|
1155
|
-
return "/";
|
|
1156
|
-
};
|
|
1157
|
-
g.chdir = function(c) {
|
|
1158
|
-
throw new Error("process.chdir is not supported");
|
|
1159
|
-
};
|
|
1160
|
-
g.umask = function() {
|
|
1161
|
-
return 0;
|
|
1162
|
-
};
|
|
1163
|
-
var rt = dr.exports, tt = /* @__PURE__ */ Yr(rt);
|
|
1164
|
-
const et = () => {
|
|
1165
|
-
self.addEventListener("unhandledrejection", (c) => {
|
|
1166
|
-
throw new Error(c.reason);
|
|
1167
|
-
});
|
|
1168
|
-
};
|
|
1169
|
-
globalThis.process = tt;
|
|
1170
|
-
globalThis.Buffer = xr.Buffer;
|
|
1171
|
-
const nt = import("./snarkjsWorkerLogic-B9NbAQYW.js");
|
|
1172
|
-
addEventListener("message", async (c) => {
|
|
1173
|
-
const { onWorkerMessage: f } = await nt;
|
|
1174
|
-
f(c.data);
|
|
1175
|
-
});
|
|
1176
|
-
et();
|