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