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