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