taxonium-component
Version:
React component for exploring large phylogenetic trees in the browser
1,171 lines • 998 kB
JavaScript
import { d as commonjsGlobal, p as process$1, e as Buffer } from "./index-CoM8QAjP.js";
import { c as commonjsRequire } from "./_commonjs-dynamic-modules-BpilXLfW.js";
var core$1 = { exports: {} }, cryptoBrowserify = {}, browser$b = { exports: {} }, safeBuffer$8 = { exports: {} }, dist = {}, hasRequiredDist;
function requireDist() {
return hasRequiredDist || (hasRequiredDist = 1, (function(q) {
Object.defineProperties(q, { __esModule: { value: !0 }, [Symbol.toStringTag]: { value: "Module" } });
var A = {}, k = {};
k.byteLength = p, k.toByteArray = m, k.fromByteArray = x;
for (var d = [], S = [], a = typeof Uint8Array < "u" ? Uint8Array : Array, w = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/", b = 0, y = w.length; b < y; ++b)
d[b] = w[b], S[w.charCodeAt(b)] = b;
S[45] = 62, S[95] = 63;
function c(B) {
var P = B.length;
if (P % 4 > 0)
throw new Error("Invalid string. Length must be a multiple of 4");
var T = B.indexOf("=");
T === -1 && (T = P);
var U = T === P ? 0 : 4 - T % 4;
return [T, U];
}
function p(B) {
var P = c(B), T = P[0], U = P[1];
return (T + U) * 3 / 4 - U;
}
function v(B, P, T) {
return (P + T) * 3 / 4 - T;
}
function m(B) {
var P, T = c(B), U = T[0], G = T[1], J = new a(v(B, U, G)), ee = 0, Z = G > 0 ? U - 4 : U, ne;
for (ne = 0; ne < Z; ne += 4)
P = S[B.charCodeAt(ne)] << 18 | S[B.charCodeAt(ne + 1)] << 12 | S[B.charCodeAt(ne + 2)] << 6 | S[B.charCodeAt(ne + 3)], J[ee++] = P >> 16 & 255, J[ee++] = P >> 8 & 255, J[ee++] = P & 255;
return G === 2 && (P = S[B.charCodeAt(ne)] << 2 | S[B.charCodeAt(ne + 1)] >> 4, J[ee++] = P & 255), G === 1 && (P = S[B.charCodeAt(ne)] << 10 | S[B.charCodeAt(ne + 1)] << 4 | S[B.charCodeAt(ne + 2)] >> 2, J[ee++] = P >> 8 & 255, J[ee++] = P & 255), J;
}
function g(B) {
return d[B >> 18 & 63] + d[B >> 12 & 63] + d[B >> 6 & 63] + d[B & 63];
}
function M(B, P, T) {
for (var U, G = [], J = P; J < T; J += 3)
U = (B[J] << 16 & 16711680) + (B[J + 1] << 8 & 65280) + (B[J + 2] & 255), G.push(g(U));
return G.join("");
}
function x(B) {
for (var P, T = B.length, U = T % 3, G = [], J = 16383, ee = 0, Z = T - U; ee < Z; ee += J)
G.push(M(B, ee, ee + J > Z ? Z : ee + J));
return U === 1 ? (P = B[T - 1], G.push(
d[P >> 2] + d[P << 4 & 63] + "=="
)) : U === 2 && (P = (B[T - 2] << 8) + B[T - 1], G.push(
d[P >> 10] + d[P >> 4 & 63] + d[P << 2 & 63] + "="
)), G.join("");
}
var I = {};
/*! ieee754. BSD-3-Clause License. Feross Aboukhadijeh <https://feross.org/opensource> */
I.read = function(B, P, T, U, G) {
var J, ee, Z = G * 8 - U - 1, ne = (1 << Z) - 1, l = ne >> 1, e = -7, t = T ? G - 1 : 0, i = T ? -1 : 1, n = B[P + t];
for (t += i, J = n & (1 << -e) - 1, n >>= -e, e += Z; e > 0; J = J * 256 + B[P + t], t += i, e -= 8)
;
for (ee = J & (1 << -e) - 1, J >>= -e, e += U; e > 0; ee = ee * 256 + B[P + t], t += i, e -= 8)
;
if (J === 0)
J = 1 - l;
else {
if (J === ne)
return ee ? NaN : (n ? -1 : 1) * (1 / 0);
ee = ee + Math.pow(2, U), J = J - l;
}
return (n ? -1 : 1) * ee * Math.pow(2, J - U);
}, I.write = function(B, P, T, U, G, J) {
var ee, Z, ne, l = J * 8 - G - 1, e = (1 << l) - 1, t = e >> 1, i = G === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0, n = U ? 0 : J - 1, o = U ? 1 : -1, h = P < 0 || P === 0 && 1 / P < 0 ? 1 : 0;
for (P = Math.abs(P), isNaN(P) || P === 1 / 0 ? (Z = isNaN(P) ? 1 : 0, ee = e) : (ee = Math.floor(Math.log(P) / Math.LN2), P * (ne = Math.pow(2, -ee)) < 1 && (ee--, ne *= 2), ee + t >= 1 ? P += i / ne : P += i * Math.pow(2, 1 - t), P * ne >= 2 && (ee++, ne /= 2), ee + t >= e ? (Z = 0, ee = e) : ee + t >= 1 ? (Z = (P * ne - 1) * Math.pow(2, G), ee = ee + t) : (Z = P * Math.pow(2, t - 1) * Math.pow(2, G), ee = 0)); G >= 8; B[T + n] = Z & 255, n += o, Z /= 256, G -= 8)
;
for (ee = ee << G | Z, l += G; l > 0; B[T + n] = ee & 255, n += o, ee /= 256, l -= 8)
;
B[T + n - o] |= h * 128;
};
/*!
* The buffer module from node.js, for the browser.
*
* @author Feross Aboukhadijeh <https://feross.org>
* @license MIT
*/
(function(B) {
const P = k, T = I, U = typeof Symbol == "function" && typeof Symbol.for == "function" ? Symbol.for("nodejs.util.inspect.custom") : null;
B.Buffer = e, B.SlowBuffer = E, B.INSPECT_MAX_BYTES = 50;
const G = 2147483647;
B.kMaxLength = G;
const { Uint8Array: J, ArrayBuffer: ee, SharedArrayBuffer: Z } = globalThis;
e.TYPED_ARRAY_SUPPORT = ne(), !e.TYPED_ARRAY_SUPPORT && typeof console < "u" && typeof console.error == "function" && console.error(
"This browser lacks typed array (Uint8Array) support which is required by `buffer` v5.x. Use `buffer` v4.x if you require old browser support."
);
function ne() {
try {
const L = new J(1), $ = { foo: function() {
return 42;
} };
return Object.setPrototypeOf($, J.prototype), Object.setPrototypeOf(L, $), L.foo() === 42;
} catch {
return !1;
}
}
Object.defineProperty(e.prototype, "parent", {
enumerable: !0,
get: function() {
if (e.isBuffer(this))
return this.buffer;
}
}), Object.defineProperty(e.prototype, "offset", {
enumerable: !0,
get: function() {
if (e.isBuffer(this))
return this.byteOffset;
}
});
function l(L) {
if (L > G)
throw new RangeError('The value "' + L + '" is invalid for option "size"');
const $ = new J(L);
return Object.setPrototypeOf($, e.prototype), $;
}
function e(L, $, D) {
if (typeof L == "number") {
if (typeof $ == "string")
throw new TypeError(
'The "string" argument must be of type string. Received type number'
);
return o(L);
}
return t(L, $, D);
}
e.poolSize = 8192;
function t(L, $, D) {
if (typeof L == "string")
return h(L, $);
if (ee.isView(L))
return f(L);
if (L == null)
throw new TypeError(
"The first argument must be one of type string, Buffer, ArrayBuffer, Array, or Array-like Object. Received type " + typeof L
);
if (_e(L, ee) || L && _e(L.buffer, ee) || typeof Z < "u" && (_e(L, Z) || L && _e(L.buffer, Z)))
return r(L, $, D);
if (typeof L == "number")
throw new TypeError(
'The "value" argument must not be of type number. Received type number'
);
const H = L.valueOf && L.valueOf();
if (H != null && H !== L)
return e.from(H, $, D);
const X = s(L);
if (X) return X;
if (typeof Symbol < "u" && Symbol.toPrimitive != null && typeof L[Symbol.toPrimitive] == "function")
return e.from(L[Symbol.toPrimitive]("string"), $, D);
throw new TypeError(
"The first argument must be one of type string, Buffer, ArrayBuffer, Array, or Array-like Object. Received type " + typeof L
);
}
e.from = function(L, $, D) {
return t(L, $, D);
}, Object.setPrototypeOf(e.prototype, J.prototype), Object.setPrototypeOf(e, J);
function i(L) {
if (typeof L != "number")
throw new TypeError('"size" argument must be of type number');
if (L < 0)
throw new RangeError('The value "' + L + '" is invalid for option "size"');
}
function n(L, $, D) {
return i(L), L <= 0 ? l(L) : $ !== void 0 ? typeof D == "string" ? l(L).fill($, D) : l(L).fill($) : l(L);
}
e.alloc = function(L, $, D) {
return n(L, $, D);
};
function o(L) {
return i(L), l(L < 0 ? 0 : _(L) | 0);
}
e.allocUnsafe = function(L) {
return o(L);
}, e.allocUnsafeSlow = function(L) {
return o(L);
};
function h(L, $) {
if ((typeof $ != "string" || $ === "") && ($ = "utf8"), !e.isEncoding($))
throw new TypeError("Unknown encoding: " + $);
const D = O(L, $) | 0;
let H = l(D);
const X = H.write(L, $);
return X !== D && (H = H.slice(0, X)), H;
}
function u(L) {
const $ = L.length < 0 ? 0 : _(L.length) | 0, D = l($);
for (let H = 0; H < $; H += 1)
D[H] = L[H] & 255;
return D;
}
function f(L) {
if (_e(L, J)) {
const $ = new J(L);
return r($.buffer, $.byteOffset, $.byteLength);
}
return u(L);
}
function r(L, $, D) {
if ($ < 0 || L.byteLength < $)
throw new RangeError('"offset" is outside of buffer bounds');
if (L.byteLength < $ + (D || 0))
throw new RangeError('"length" is outside of buffer bounds');
let H;
return $ === void 0 && D === void 0 ? H = new J(L) : D === void 0 ? H = new J(L, $) : H = new J(L, $, D), Object.setPrototypeOf(H, e.prototype), H;
}
function s(L) {
if (e.isBuffer(L)) {
const $ = _(L.length) | 0, D = l($);
return D.length === 0 || L.copy(D, 0, 0, $), D;
}
if (L.length !== void 0)
return typeof L.length != "number" || je(L.length) ? l(0) : u(L);
if (L.type === "Buffer" && Array.isArray(L.data))
return u(L.data);
}
function _(L) {
if (L >= G)
throw new RangeError("Attempt to allocate Buffer larger than maximum size: 0x" + G.toString(16) + " bytes");
return L | 0;
}
function E(L) {
return +L != L && (L = 0), e.alloc(+L);
}
e.isBuffer = function($) {
return $ != null && $._isBuffer === !0 && $ !== e.prototype;
}, e.compare = function($, D) {
if (_e($, J) && ($ = e.from($, $.offset, $.byteLength)), _e(D, J) && (D = e.from(D, D.offset, D.byteLength)), !e.isBuffer($) || !e.isBuffer(D))
throw new TypeError(
'The "buf1", "buf2" arguments must be one of type Buffer or Uint8Array'
);
if ($ === D) return 0;
let H = $.length, X = D.length;
for (let fe = 0, Q = Math.min(H, X); fe < Q; ++fe)
if ($[fe] !== D[fe]) {
H = $[fe], X = D[fe];
break;
}
return H < X ? -1 : X < H ? 1 : 0;
}, e.isEncoding = function($) {
switch (String($).toLowerCase()) {
case "hex":
case "utf8":
case "utf-8":
case "ascii":
case "latin1":
case "binary":
case "base64":
case "ucs2":
case "ucs-2":
case "utf16le":
case "utf-16le":
return !0;
default:
return !1;
}
}, e.concat = function($, D) {
if (!Array.isArray($))
throw new TypeError('"list" argument must be an Array of Buffers');
if ($.length === 0)
return e.alloc(0);
let H;
if (D === void 0)
for (D = 0, H = 0; H < $.length; ++H)
D += $[H].length;
const X = e.allocUnsafe(D);
let fe = 0;
for (H = 0; H < $.length; ++H) {
let Q = $[H];
if (_e(Q, J))
fe + Q.length > X.length ? (e.isBuffer(Q) || (Q = e.from(Q)), Q.copy(X, fe)) : J.prototype.set.call(
X,
Q,
fe
);
else if (e.isBuffer(Q))
Q.copy(X, fe);
else
throw new TypeError('"list" argument must be an Array of Buffers');
fe += Q.length;
}
return X;
};
function O(L, $) {
if (e.isBuffer(L))
return L.length;
if (ee.isView(L) || _e(L, ee))
return L.byteLength;
if (typeof L != "string")
throw new TypeError(
'The "string" argument must be one of type string, Buffer, or ArrayBuffer. Received type ' + typeof L
);
const D = L.length, H = arguments.length > 2 && arguments[2] === !0;
if (!H && D === 0) return 0;
let X = !1;
for (; ; )
switch ($) {
case "ascii":
case "latin1":
case "binary":
return D;
case "utf8":
case "utf-8":
return Ue(L).length;
case "ucs2":
case "ucs-2":
case "utf16le":
case "utf-16le":
return D * 2;
case "hex":
return D >>> 1;
case "base64":
return He(L).length;
default:
if (X)
return H ? -1 : Ue(L).length;
$ = ("" + $).toLowerCase(), X = !0;
}
}
e.byteLength = O;
function K(L, $, D) {
let H = !1;
if (($ === void 0 || $ < 0) && ($ = 0), $ > this.length || ((D === void 0 || D > this.length) && (D = this.length), D <= 0) || (D >>>= 0, $ >>>= 0, D <= $))
return "";
for (L || (L = "utf8"); ; )
switch (L) {
case "hex":
return Pe(this, $, D);
case "utf8":
case "utf-8":
return ie(this, $, D);
case "ascii":
return se(this, $, D);
case "latin1":
case "binary":
return re(this, $, D);
case "base64":
return qe(this, $, D);
case "ucs2":
case "ucs-2":
case "utf16le":
case "utf-16le":
return ae(this, $, D);
default:
if (H) throw new TypeError("Unknown encoding: " + L);
L = (L + "").toLowerCase(), H = !0;
}
}
e.prototype._isBuffer = !0;
function j(L, $, D) {
const H = L[$];
L[$] = L[D], L[D] = H;
}
e.prototype.swap16 = function() {
const $ = this.length;
if ($ % 2 !== 0)
throw new RangeError("Buffer size must be a multiple of 16-bits");
for (let D = 0; D < $; D += 2)
j(this, D, D + 1);
return this;
}, e.prototype.swap32 = function() {
const $ = this.length;
if ($ % 4 !== 0)
throw new RangeError("Buffer size must be a multiple of 32-bits");
for (let D = 0; D < $; D += 4)
j(this, D, D + 3), j(this, D + 1, D + 2);
return this;
}, e.prototype.swap64 = function() {
const $ = this.length;
if ($ % 8 !== 0)
throw new RangeError("Buffer size must be a multiple of 64-bits");
for (let D = 0; D < $; D += 8)
j(this, D, D + 7), j(this, D + 1, D + 6), j(this, D + 2, D + 5), j(this, D + 3, D + 4);
return this;
}, e.prototype.toString = function() {
const $ = this.length;
return $ === 0 ? "" : arguments.length === 0 ? ie(this, 0, $) : K.apply(this, arguments);
}, e.prototype.toLocaleString = e.prototype.toString, e.prototype.equals = function($) {
if (!e.isBuffer($)) throw new TypeError("Argument must be a Buffer");
return this === $ ? !0 : e.compare(this, $) === 0;
}, e.prototype.inspect = function() {
let $ = "";
const D = B.INSPECT_MAX_BYTES;
return $ = this.toString("hex", 0, D).replace(/(.{2})/g, "$1 ").trim(), this.length > D && ($ += " ... "), "<Buffer " + $ + ">";
}, U && (e.prototype[U] = e.prototype.inspect), e.prototype.compare = function($, D, H, X, fe) {
if (_e($, J) && ($ = e.from($, $.offset, $.byteLength)), !e.isBuffer($))
throw new TypeError(
'The "target" argument must be one of type Buffer or Uint8Array. Received type ' + typeof $
);
if (D === void 0 && (D = 0), H === void 0 && (H = $ ? $.length : 0), X === void 0 && (X = 0), fe === void 0 && (fe = this.length), D < 0 || H > $.length || X < 0 || fe > this.length)
throw new RangeError("out of range index");
if (X >= fe && D >= H)
return 0;
if (X >= fe)
return -1;
if (D >= H)
return 1;
if (D >>>= 0, H >>>= 0, X >>>= 0, fe >>>= 0, this === $) return 0;
let Q = fe - X, le = H - D;
const Ce = Math.min(Q, le), ue = this.slice(X, fe), pe = $.slice(D, H);
for (let Te = 0; Te < Ce; ++Te)
if (ue[Te] !== pe[Te]) {
Q = ue[Te], le = pe[Te];
break;
}
return Q < le ? -1 : le < Q ? 1 : 0;
};
function C(L, $, D, H, X) {
if (L.length === 0) return -1;
if (typeof D == "string" ? (H = D, D = 0) : D > 2147483647 ? D = 2147483647 : D < -2147483648 && (D = -2147483648), D = +D, je(D) && (D = X ? 0 : L.length - 1), D < 0 && (D = L.length + D), D >= L.length) {
if (X) return -1;
D = L.length - 1;
} else if (D < 0)
if (X) D = 0;
else return -1;
if (typeof $ == "string" && ($ = e.from($, H)), e.isBuffer($))
return $.length === 0 ? -1 : F(L, $, D, H, X);
if (typeof $ == "number")
return $ = $ & 255, typeof J.prototype.indexOf == "function" ? X ? J.prototype.indexOf.call(L, $, D) : J.prototype.lastIndexOf.call(L, $, D) : F(L, [$], D, H, X);
throw new TypeError("val must be string, number or Buffer");
}
function F(L, $, D, H, X) {
let fe = 1, Q = L.length, le = $.length;
if (H !== void 0 && (H = String(H).toLowerCase(), H === "ucs2" || H === "ucs-2" || H === "utf16le" || H === "utf-16le")) {
if (L.length < 2 || $.length < 2)
return -1;
fe = 2, Q /= 2, le /= 2, D /= 2;
}
function Ce(pe, Te) {
return fe === 1 ? pe[Te] : pe.readUInt16BE(Te * fe);
}
let ue;
if (X) {
let pe = -1;
for (ue = D; ue < Q; ue++)
if (Ce(L, ue) === Ce($, pe === -1 ? 0 : ue - pe)) {
if (pe === -1 && (pe = ue), ue - pe + 1 === le) return pe * fe;
} else
pe !== -1 && (ue -= ue - pe), pe = -1;
} else
for (D + le > Q && (D = Q - le), ue = D; ue >= 0; ue--) {
let pe = !0;
for (let Te = 0; Te < le; Te++)
if (Ce(L, ue + Te) !== Ce($, Te)) {
pe = !1;
break;
}
if (pe) return ue;
}
return -1;
}
e.prototype.includes = function($, D, H) {
return this.indexOf($, D, H) !== -1;
}, e.prototype.indexOf = function($, D, H) {
return C(this, $, D, H, !0);
}, e.prototype.lastIndexOf = function($, D, H) {
return C(this, $, D, H, !1);
};
function z(L, $, D, H) {
D = Number(D) || 0;
const X = L.length - D;
H ? (H = Number(H), H > X && (H = X)) : H = X;
const fe = $.length;
H > fe / 2 && (H = fe / 2);
let Q;
for (Q = 0; Q < H; ++Q) {
const le = parseInt($.substr(Q * 2, 2), 16);
if (je(le)) return Q;
L[D + Q] = le;
}
return Q;
}
function V(L, $, D, H) {
return ce(Ue($, L.length - D), L, D, H);
}
function W(L, $, D, H) {
return ce(be($), L, D, H);
}
function N(L, $, D, H) {
return ce(He($), L, D, H);
}
function Y(L, $, D, H) {
return ce(Ee($, L.length - D), L, D, H);
}
e.prototype.write = function($, D, H, X) {
if (D === void 0)
X = "utf8", H = this.length, D = 0;
else if (H === void 0 && typeof D == "string")
X = D, H = this.length, D = 0;
else if (isFinite(D))
D = D >>> 0, isFinite(H) ? (H = H >>> 0, X === void 0 && (X = "utf8")) : (X = H, H = void 0);
else
throw new Error(
"Buffer.write(string, encoding, offset[, length]) is no longer supported"
);
const fe = this.length - D;
if ((H === void 0 || H > fe) && (H = fe), $.length > 0 && (H < 0 || D < 0) || D > this.length)
throw new RangeError("Attempt to write outside buffer bounds");
X || (X = "utf8");
let Q = !1;
for (; ; )
switch (X) {
case "hex":
return z(this, $, D, H);
case "utf8":
case "utf-8":
return V(this, $, D, H);
case "ascii":
case "latin1":
case "binary":
return W(this, $, D, H);
case "base64":
return N(this, $, D, H);
case "ucs2":
case "ucs-2":
case "utf16le":
case "utf-16le":
return Y(this, $, D, H);
default:
if (Q) throw new TypeError("Unknown encoding: " + X);
X = ("" + X).toLowerCase(), Q = !0;
}
}, e.prototype.toJSON = function() {
return {
type: "Buffer",
data: Array.prototype.slice.call(this._arr || this, 0)
};
};
function qe(L, $, D) {
return $ === 0 && D === L.length ? P.fromByteArray(L) : P.fromByteArray(L.slice($, D));
}
function ie(L, $, D) {
D = Math.min(L.length, D);
const H = [];
let X = $;
for (; X < D; ) {
const fe = L[X];
let Q = null, le = fe > 239 ? 4 : fe > 223 ? 3 : fe > 191 ? 2 : 1;
if (X + le <= D) {
let Ce, ue, pe, Te;
switch (le) {
case 1:
fe < 128 && (Q = fe);
break;
case 2:
Ce = L[X + 1], (Ce & 192) === 128 && (Te = (fe & 31) << 6 | Ce & 63, Te > 127 && (Q = Te));
break;
case 3:
Ce = L[X + 1], ue = L[X + 2], (Ce & 192) === 128 && (ue & 192) === 128 && (Te = (fe & 15) << 12 | (Ce & 63) << 6 | ue & 63, Te > 2047 && (Te < 55296 || Te > 57343) && (Q = Te));
break;
case 4:
Ce = L[X + 1], ue = L[X + 2], pe = L[X + 3], (Ce & 192) === 128 && (ue & 192) === 128 && (pe & 192) === 128 && (Te = (fe & 15) << 18 | (Ce & 63) << 12 | (ue & 63) << 6 | pe & 63, Te > 65535 && Te < 1114112 && (Q = Te));
}
}
Q === null ? (Q = 65533, le = 1) : Q > 65535 && (Q -= 65536, H.push(Q >>> 10 & 1023 | 55296), Q = 56320 | Q & 1023), H.push(Q), X += le;
}
return ke(H);
}
const te = 4096;
function ke(L) {
const $ = L.length;
if ($ <= te)
return String.fromCharCode.apply(String, L);
let D = "", H = 0;
for (; H < $; )
D += String.fromCharCode.apply(
String,
L.slice(H, H += te)
);
return D;
}
function se(L, $, D) {
let H = "";
D = Math.min(L.length, D);
for (let X = $; X < D; ++X)
H += String.fromCharCode(L[X] & 127);
return H;
}
function re(L, $, D) {
let H = "";
D = Math.min(L.length, D);
for (let X = $; X < D; ++X)
H += String.fromCharCode(L[X]);
return H;
}
function Pe(L, $, D) {
const H = L.length;
(!$ || $ < 0) && ($ = 0), (!D || D < 0 || D > H) && (D = H);
let X = "";
for (let fe = $; fe < D; ++fe)
X += ge[L[fe]];
return X;
}
function ae(L, $, D) {
const H = L.slice($, D);
let X = "";
for (let fe = 0; fe < H.length - 1; fe += 2)
X += String.fromCharCode(H[fe] + H[fe + 1] * 256);
return X;
}
e.prototype.slice = function($, D) {
const H = this.length;
$ = ~~$, D = D === void 0 ? H : ~~D, $ < 0 ? ($ += H, $ < 0 && ($ = 0)) : $ > H && ($ = H), D < 0 ? (D += H, D < 0 && (D = 0)) : D > H && (D = H), D < $ && (D = $);
const X = this.subarray($, D);
return Object.setPrototypeOf(X, e.prototype), X;
};
function he(L, $, D) {
if (L % 1 !== 0 || L < 0) throw new RangeError("offset is not uint");
if (L + $ > D) throw new RangeError("Trying to access beyond buffer length");
}
e.prototype.readUintLE = e.prototype.readUIntLE = function($, D, H) {
$ = $ >>> 0, D = D >>> 0, H || he($, D, this.length);
let X = this[$], fe = 1, Q = 0;
for (; ++Q < D && (fe *= 256); )
X += this[$ + Q] * fe;
return X;
}, e.prototype.readUintBE = e.prototype.readUIntBE = function($, D, H) {
$ = $ >>> 0, D = D >>> 0, H || he($, D, this.length);
let X = this[$ + --D], fe = 1;
for (; D > 0 && (fe *= 256); )
X += this[$ + --D] * fe;
return X;
}, e.prototype.readUint8 = e.prototype.readUInt8 = function($, D) {
return $ = $ >>> 0, D || he($, 1, this.length), this[$];
}, e.prototype.readUint16LE = e.prototype.readUInt16LE = function($, D) {
return $ = $ >>> 0, D || he($, 2, this.length), this[$] | this[$ + 1] << 8;
}, e.prototype.readUint16BE = e.prototype.readUInt16BE = function($, D) {
return $ = $ >>> 0, D || he($, 2, this.length), this[$] << 8 | this[$ + 1];
}, e.prototype.readUint32LE = e.prototype.readUInt32LE = function($, D) {
return $ = $ >>> 0, D || he($, 4, this.length), (this[$] | this[$ + 1] << 8 | this[$ + 2] << 16) + this[$ + 3] * 16777216;
}, e.prototype.readUint32BE = e.prototype.readUInt32BE = function($, D) {
return $ = $ >>> 0, D || he($, 4, this.length), this[$] * 16777216 + (this[$ + 1] << 16 | this[$ + 2] << 8 | this[$ + 3]);
}, e.prototype.readBigUInt64LE = Se(function($) {
$ = $ >>> 0, Be($, "offset");
const D = this[$], H = this[$ + 7];
(D === void 0 || H === void 0) && Le($, this.length - 8);
const X = D + this[++$] * 2 ** 8 + this[++$] * 2 ** 16 + this[++$] * 2 ** 24, fe = this[++$] + this[++$] * 2 ** 8 + this[++$] * 2 ** 16 + H * 2 ** 24;
return BigInt(X) + (BigInt(fe) << BigInt(32));
}), e.prototype.readBigUInt64BE = Se(function($) {
$ = $ >>> 0, Be($, "offset");
const D = this[$], H = this[$ + 7];
(D === void 0 || H === void 0) && Le($, this.length - 8);
const X = D * 2 ** 24 + this[++$] * 2 ** 16 + this[++$] * 2 ** 8 + this[++$], fe = this[++$] * 2 ** 24 + this[++$] * 2 ** 16 + this[++$] * 2 ** 8 + H;
return (BigInt(X) << BigInt(32)) + BigInt(fe);
}), e.prototype.readIntLE = function($, D, H) {
$ = $ >>> 0, D = D >>> 0, H || he($, D, this.length);
let X = this[$], fe = 1, Q = 0;
for (; ++Q < D && (fe *= 256); )
X += this[$ + Q] * fe;
return fe *= 128, X >= fe && (X -= Math.pow(2, 8 * D)), X;
}, e.prototype.readIntBE = function($, D, H) {
$ = $ >>> 0, D = D >>> 0, H || he($, D, this.length);
let X = D, fe = 1, Q = this[$ + --X];
for (; X > 0 && (fe *= 256); )
Q += this[$ + --X] * fe;
return fe *= 128, Q >= fe && (Q -= Math.pow(2, 8 * D)), Q;
}, e.prototype.readInt8 = function($, D) {
return $ = $ >>> 0, D || he($, 1, this.length), this[$] & 128 ? (255 - this[$] + 1) * -1 : this[$];
}, e.prototype.readInt16LE = function($, D) {
$ = $ >>> 0, D || he($, 2, this.length);
const H = this[$] | this[$ + 1] << 8;
return H & 32768 ? H | 4294901760 : H;
}, e.prototype.readInt16BE = function($, D) {
$ = $ >>> 0, D || he($, 2, this.length);
const H = this[$ + 1] | this[$] << 8;
return H & 32768 ? H | 4294901760 : H;
}, e.prototype.readInt32LE = function($, D) {
return $ = $ >>> 0, D || he($, 4, this.length), this[$] | this[$ + 1] << 8 | this[$ + 2] << 16 | this[$ + 3] << 24;
}, e.prototype.readInt32BE = function($, D) {
return $ = $ >>> 0, D || he($, 4, this.length), this[$] << 24 | this[$ + 1] << 16 | this[$ + 2] << 8 | this[$ + 3];
}, e.prototype.readBigInt64LE = Se(function($) {
$ = $ >>> 0, Be($, "offset");
const D = this[$], H = this[$ + 7];
(D === void 0 || H === void 0) && Le($, this.length - 8);
const X = this[$ + 4] + this[$ + 5] * 2 ** 8 + this[$ + 6] * 2 ** 16 + (H << 24);
return (BigInt(X) << BigInt(32)) + BigInt(D + this[++$] * 2 ** 8 + this[++$] * 2 ** 16 + this[++$] * 2 ** 24);
}), e.prototype.readBigInt64BE = Se(function($) {
$ = $ >>> 0, Be($, "offset");
const D = this[$], H = this[$ + 7];
(D === void 0 || H === void 0) && Le($, this.length - 8);
const X = (D << 24) + // Overflow
this[++$] * 2 ** 16 + this[++$] * 2 ** 8 + this[++$];
return (BigInt(X) << BigInt(32)) + BigInt(this[++$] * 2 ** 24 + this[++$] * 2 ** 16 + this[++$] * 2 ** 8 + H);
}), e.prototype.readFloatLE = function($, D) {
return $ = $ >>> 0, D || he($, 4, this.length), T.read(this, $, !0, 23, 4);
}, e.prototype.readFloatBE = function($, D) {
return $ = $ >>> 0, D || he($, 4, this.length), T.read(this, $, !1, 23, 4);
}, e.prototype.readDoubleLE = function($, D) {
return $ = $ >>> 0, D || he($, 8, this.length), T.read(this, $, !0, 52, 8);
}, e.prototype.readDoubleBE = function($, D) {
return $ = $ >>> 0, D || he($, 8, this.length), T.read(this, $, !1, 52, 8);
};
function $e(L, $, D, H, X, fe) {
if (!e.isBuffer(L)) throw new TypeError('"buffer" argument must be a Buffer instance');
if ($ > X || $ < fe) throw new RangeError('"value" argument is out of bounds');
if (D + H > L.length) throw new RangeError("Index out of range");
}
e.prototype.writeUintLE = e.prototype.writeUIntLE = function($, D, H, X) {
if ($ = +$, D = D >>> 0, H = H >>> 0, !X) {
const le = Math.pow(2, 8 * H) - 1;
$e(this, $, D, H, le, 0);
}
let fe = 1, Q = 0;
for (this[D] = $ & 255; ++Q < H && (fe *= 256); )
this[D + Q] = $ / fe & 255;
return D + H;
}, e.prototype.writeUintBE = e.prototype.writeUIntBE = function($, D, H, X) {
if ($ = +$, D = D >>> 0, H = H >>> 0, !X) {
const le = Math.pow(2, 8 * H) - 1;
$e(this, $, D, H, le, 0);
}
let fe = H - 1, Q = 1;
for (this[D + fe] = $ & 255; --fe >= 0 && (Q *= 256); )
this[D + fe] = $ / Q & 255;
return D + H;
}, e.prototype.writeUint8 = e.prototype.writeUInt8 = function($, D, H) {
return $ = +$, D = D >>> 0, H || $e(this, $, D, 1, 255, 0), this[D] = $ & 255, D + 1;
}, e.prototype.writeUint16LE = e.prototype.writeUInt16LE = function($, D, H) {
return $ = +$, D = D >>> 0, H || $e(this, $, D, 2, 65535, 0), this[D] = $ & 255, this[D + 1] = $ >>> 8, D + 2;
}, e.prototype.writeUint16BE = e.prototype.writeUInt16BE = function($, D, H) {
return $ = +$, D = D >>> 0, H || $e(this, $, D, 2, 65535, 0), this[D] = $ >>> 8, this[D + 1] = $ & 255, D + 2;
}, e.prototype.writeUint32LE = e.prototype.writeUInt32LE = function($, D, H) {
return $ = +$, D = D >>> 0, H || $e(this, $, D, 4, 4294967295, 0), this[D + 3] = $ >>> 24, this[D + 2] = $ >>> 16, this[D + 1] = $ >>> 8, this[D] = $ & 255, D + 4;
}, e.prototype.writeUint32BE = e.prototype.writeUInt32BE = function($, D, H) {
return $ = +$, D = D >>> 0, H || $e(this, $, D, 4, 4294967295, 0), this[D] = $ >>> 24, this[D + 1] = $ >>> 16, this[D + 2] = $ >>> 8, this[D + 3] = $ & 255, D + 4;
};
function oe(L, $, D, H, X) {
me($, H, X, L, D, 7);
let fe = Number($ & BigInt(4294967295));
L[D++] = fe, fe = fe >> 8, L[D++] = fe, fe = fe >> 8, L[D++] = fe, fe = fe >> 8, L[D++] = fe;
let Q = Number($ >> BigInt(32) & BigInt(4294967295));
return L[D++] = Q, Q = Q >> 8, L[D++] = Q, Q = Q >> 8, L[D++] = Q, Q = Q >> 8, L[D++] = Q, D;
}
function we(L, $, D, H, X) {
me($, H, X, L, D, 7);
let fe = Number($ & BigInt(4294967295));
L[D + 7] = fe, fe = fe >> 8, L[D + 6] = fe, fe = fe >> 8, L[D + 5] = fe, fe = fe >> 8, L[D + 4] = fe;
let Q = Number($ >> BigInt(32) & BigInt(4294967295));
return L[D + 3] = Q, Q = Q >> 8, L[D + 2] = Q, Q = Q >> 8, L[D + 1] = Q, Q = Q >> 8, L[D] = Q, D + 8;
}
e.prototype.writeBigUInt64LE = Se(function($, D = 0) {
return oe(this, $, D, BigInt(0), BigInt("0xffffffffffffffff"));
}), e.prototype.writeBigUInt64BE = Se(function($, D = 0) {
return we(this, $, D, BigInt(0), BigInt("0xffffffffffffffff"));
}), e.prototype.writeIntLE = function($, D, H, X) {
if ($ = +$, D = D >>> 0, !X) {
const Ce = Math.pow(2, 8 * H - 1);
$e(this, $, D, H, Ce - 1, -Ce);
}
let fe = 0, Q = 1, le = 0;
for (this[D] = $ & 255; ++fe < H && (Q *= 256); )
$ < 0 && le === 0 && this[D + fe - 1] !== 0 && (le = 1), this[D + fe] = ($ / Q >> 0) - le & 255;
return D + H;
}, e.prototype.writeIntBE = function($, D, H, X) {
if ($ = +$, D = D >>> 0, !X) {
const Ce = Math.pow(2, 8 * H - 1);
$e(this, $, D, H, Ce - 1, -Ce);
}
let fe = H - 1, Q = 1, le = 0;
for (this[D + fe] = $ & 255; --fe >= 0 && (Q *= 256); )
$ < 0 && le === 0 && this[D + fe + 1] !== 0 && (le = 1), this[D + fe] = ($ / Q >> 0) - le & 255;
return D + H;
}, e.prototype.writeInt8 = function($, D, H) {
return $ = +$, D = D >>> 0, H || $e(this, $, D, 1, 127, -128), $ < 0 && ($ = 255 + $ + 1), this[D] = $ & 255, D + 1;
}, e.prototype.writeInt16LE = function($, D, H) {
return $ = +$, D = D >>> 0, H || $e(this, $, D, 2, 32767, -32768), this[D] = $ & 255, this[D + 1] = $ >>> 8, D + 2;
}, e.prototype.writeInt16BE = function($, D, H) {
return $ = +$, D = D >>> 0, H || $e(this, $, D, 2, 32767, -32768), this[D] = $ >>> 8, this[D + 1] = $ & 255, D + 2;
}, e.prototype.writeInt32LE = function($, D, H) {
return $ = +$, D = D >>> 0, H || $e(this, $, D, 4, 2147483647, -2147483648), this[D] = $ & 255, this[D + 1] = $ >>> 8, this[D + 2] = $ >>> 16, this[D + 3] = $ >>> 24, D + 4;
}, e.prototype.writeInt32BE = function($, D, H) {
return $ = +$, D = D >>> 0, H || $e(this, $, D, 4, 2147483647, -2147483648), $ < 0 && ($ = 4294967295 + $ + 1), this[D] = $ >>> 24, this[D + 1] = $ >>> 16, this[D + 2] = $ >>> 8, this[D + 3] = $ & 255, D + 4;
}, e.prototype.writeBigInt64LE = Se(function($, D = 0) {
return oe(this, $, D, -BigInt("0x8000000000000000"), BigInt("0x7fffffffffffffff"));
}), e.prototype.writeBigInt64BE = Se(function($, D = 0) {
return we(this, $, D, -BigInt("0x8000000000000000"), BigInt("0x7fffffffffffffff"));
});
function De(L, $, D, H, X, fe) {
if (D + H > L.length) throw new RangeError("Index out of range");
if (D < 0) throw new RangeError("Index out of range");
}
function de(L, $, D, H, X) {
return $ = +$, D = D >>> 0, X || De(L, $, D, 4), T.write(L, $, D, H, 23, 4), D + 4;
}
e.prototype.writeFloatLE = function($, D, H) {
return de(this, $, D, !0, H);
}, e.prototype.writeFloatBE = function($, D, H) {
return de(this, $, D, !1, H);
};
function xe(L, $, D, H, X) {
return $ = +$, D = D >>> 0, X || De(L, $, D, 8), T.write(L, $, D, H, 52, 8), D + 8;
}
e.prototype.writeDoubleLE = function($, D, H) {
return xe(this, $, D, !0, H);
}, e.prototype.writeDoubleBE = function($, D, H) {
return xe(this, $, D, !1, H);
}, e.prototype.copy = function($, D, H, X) {
if (!e.isBuffer($)) throw new TypeError("argument should be a Buffer");
if (H || (H = 0), !X && X !== 0 && (X = this.length), D >= $.length && (D = $.length), D || (D = 0), X > 0 && X < H && (X = H), X === H || $.length === 0 || this.length === 0) return 0;
if (D < 0)
throw new RangeError("targetStart out of bounds");
if (H < 0 || H >= this.length) throw new RangeError("Index out of range");
if (X < 0) throw new RangeError("sourceEnd out of bounds");
X > this.length && (X = this.length), $.length - D < X - H && (X = $.length - D + H);
const fe = X - H;
return this === $ && typeof J.prototype.copyWithin == "function" ? this.copyWithin(D, H, X) : J.prototype.set.call(
$,
this.subarray(H, X),
D
), fe;
}, e.prototype.fill = function($, D, H, X) {
if (typeof $ == "string") {
if (typeof D == "string" ? (X = D, D = 0, H = this.length) : typeof H == "string" && (X = H, H = this.length), X !== void 0 && typeof X != "string")
throw new TypeError("encoding must be a string");
if (typeof X == "string" && !e.isEncoding(X))
throw new TypeError("Unknown encoding: " + X);
if ($.length === 1) {
const Q = $.charCodeAt(0);
(X === "utf8" && Q < 128 || X === "latin1") && ($ = Q);
}
} else typeof $ == "number" ? $ = $ & 255 : typeof $ == "boolean" && ($ = Number($));
if (D < 0 || this.length < D || this.length < H)
throw new RangeError("Out of range index");
if (H <= D)
return this;
D = D >>> 0, H = H === void 0 ? this.length : H >>> 0, $ || ($ = 0);
let fe;
if (typeof $ == "number")
for (fe = D; fe < H; ++fe)
this[fe] = $;
else {
const Q = e.isBuffer($) ? $ : e.from($, X), le = Q.length;
if (le === 0)
throw new TypeError('The value "' + $ + '" is invalid for argument "value"');
for (fe = 0; fe < H - D; ++fe)
this[fe + D] = Q[fe % le];
}
return this;
};
const Oe = {};
function ve(L, $, D) {
Oe[L] = class extends D {
constructor() {
super(), Object.defineProperty(this, "message", {
value: $.apply(this, arguments),
writable: !0,
configurable: !0
}), this.name = `${this.name} [${L}]`, this.stack, delete this.name;
}
get code() {
return L;
}
set code(X) {
Object.defineProperty(this, "code", {
configurable: !0,
enumerable: !0,
value: X,
writable: !0
});
}
toString() {
return `${this.name} [${L}]: ${this.message}`;
}
};
}
ve(
"ERR_BUFFER_OUT_OF_BOUNDS",
function(L) {
return L ? `${L} is outside of buffer bounds` : "Attempt to access memory outside buffer bounds";
},
RangeError
), ve(
"ERR_INVALID_ARG_TYPE",
function(L, $) {
return `The "${L}" argument must be of type number. Received type ${typeof $}`;
},
TypeError
), ve(
"ERR_OUT_OF_RANGE",
function(L, $, D) {
let H = `The value of "${L}" is out of range.`, X = D;
return Number.isInteger(D) && Math.abs(D) > 2 ** 32 ? X = Re(String(D)) : typeof D == "bigint" && (X = String(D), (D > BigInt(2) ** BigInt(32) || D < -(BigInt(2) ** BigInt(32))) && (X = Re(X)), X += "n"), H += ` It must be ${$}. Received ${X}`, H;
},
RangeError
);
function Re(L) {
let $ = "", D = L.length;
const H = L[0] === "-" ? 1 : 0;
for (; D >= H + 4; D -= 3)
$ = `_${L.slice(D - 3, D)}${$}`;
return `${L.slice(0, D)}${$}`;
}
function ze(L, $, D) {
Be($, "offset"), (L[$] === void 0 || L[$ + D] === void 0) && Le($, L.length - (D + 1));
}
function me(L, $, D, H, X, fe) {
if (L > D || L < $) {
const Q = typeof $ == "bigint" ? "n" : "";
let le;
throw $ === 0 || $ === BigInt(0) ? le = `>= 0${Q} and < 2${Q} ** ${(fe + 1) * 8}${Q}` : le = `>= -(2${Q} ** ${(fe + 1) * 8 - 1}${Q}) and < 2 ** ${(fe + 1) * 8 - 1}${Q}`, new Oe.ERR_OUT_OF_RANGE("value", le, L);
}
ze(H, X, fe);
}
function Be(L, $) {
if (typeof L != "number")
throw new Oe.ERR_INVALID_ARG_TYPE($, "number", L);
}
function Le(L, $, D) {
throw Math.floor(L) !== L ? (Be(L, D), new Oe.ERR_OUT_OF_RANGE("offset", "an integer", L)) : $ < 0 ? new Oe.ERR_BUFFER_OUT_OF_BOUNDS() : new Oe.ERR_OUT_OF_RANGE(
"offset",
`>= 0 and <= ${$}`,
L
);
}
const ye = /[^+/0-9A-Za-z-_]/g;
function Ae(L) {
if (L = L.split("=")[0], L = L.trim().replace(ye, ""), L.length < 2) return "";
for (; L.length % 4 !== 0; )
L = L + "=";
return L;
}
function Ue(L, $) {
$ = $ || 1 / 0;
let D;
const H = L.length;
let X = null;
const fe = [];
for (let Q = 0; Q < H; ++Q) {
if (D = L.charCodeAt(Q), D > 55295 && D < 57344) {
if (!X) {
if (D > 56319) {
($ -= 3) > -1 && fe.push(239, 191, 189);
continue;
} else if (Q + 1 === H) {
($ -= 3) > -1 && fe.push(239, 191, 189);
continue;
}
X = D;
continue;
}
if (D < 56320) {
($ -= 3) > -1 && fe.push(239, 191, 189), X = D;
continue;
}
D = (X - 55296 << 10 | D - 56320) + 65536;
} else X && ($ -= 3) > -1 && fe.push(239, 191, 189);
if (X = null, D < 128) {
if (($ -= 1) < 0) break;
fe.push(D);
} else if (D < 2048) {
if (($ -= 2) < 0) break;
fe.push(
D >> 6 | 192,
D & 63 | 128
);
} else if (D < 65536) {
if (($ -= 3) < 0) break;
fe.push(
D >> 12 | 224,
D >> 6 & 63 | 128,
D & 63 | 128
);
} else if (D < 1114112) {
if (($ -= 4) < 0) break;
fe.push(
D >> 18 | 240,
D >> 12 & 63 | 128,
D >> 6 & 63 | 128,
D & 63 | 128
);
} else
throw new Error("Invalid code point");
}
return fe;
}
function be(L) {
const $ = [];
for (let D = 0; D < L.length; ++D)
$.push(L.charCodeAt(D) & 255);
return $;
}
function Ee(L, $) {
let D, H, X;
const fe = [];
for (let Q = 0; Q < L.length && !(($ -= 2) < 0); ++Q)
D = L.charCodeAt(Q), H = D >> 8, X = D % 256, fe.push(X), fe.push(H);
return fe;
}
function He(L) {
return P.toByteArray(Ae(L));
}
function ce(L, $, D, H) {
let X;
for (X = 0; X < H && !(X + D >= $.length || X >= L.length); ++X)
$[X + D] = L[X];
return X;
}
function _e(L, $) {
return L instanceof $ || L != null && L.constructor != null && L.constructor.name != null && L.constructor.name === $.name;
}
function je(L) {
return L !== L;
}
const ge = (function() {
const L = "0123456789abcdef", $ = new Array(256);
for (let D = 0; D < 16; ++D) {
const H = D * 16;
for (let X = 0; X < 16; ++X)
$[H + X] = L[D] + L[X];
}
return $;
})();
function Se(L) {
return typeof BigInt > "u" ? Ke : L;
}
function Ke() {
throw new Error("BigInt not supported");
}
})(A);
const R = A.Buffer;
q.Blob = A.Blob, q.BlobOptions = A.BlobOptions, q.Buffer = A.Buffer, q.File = A.File, q.FileOptions = A.FileOptions, q.INSPECT_MAX_BYTES = A.INSPECT_MAX_BYTES, q.SlowBuffer = A.SlowBuffer, q.TranscodeEncoding = A.TranscodeEncoding, q.atob = A.atob, q.btoa = A.btoa, q.constants = A.constants, q.default = R, q.isAscii = A.isAscii, q.isUtf8 = A.isUtf8, q.kMaxLength = A.kMaxLength, q.kStringMaxLength = A.kStringMaxLength, q.resolveObjectURL = A.resolveObjectURL, q.transcode = A.transcode;
})(dist)), dist;
}
var hasRequiredSafeBuffer$8;
function requireSafeBuffer$8() {
return hasRequiredSafeBuffer$8 || (hasRequiredSafeBuffer$8 = 1, (function(q, A) {
var k = requireDist(), d = k.Buffer;
function S(w, b) {
for (var y in w)
b[y] = w[y];
}
d.from && d.alloc && d.allocUnsafe && d.allocUnsafeSlow ? q.exports = k : (S(k, A), A.Buffer = a);
function a(w, b, y) {
return d(w, b, y);
}
S(d, a), a.from = function(w, b, y) {
if (typeof w == "number")
throw new TypeError("Argument must not be a number");
return d(w, b, y);
}, a.alloc = function(w, b, y) {
if (typeof w != "number")
throw new TypeError("Argument must be a number");
var c = d(w);
return b !== void 0 ? typeof y == "string" ? c.fill(b, y) : c.fill(b) : c.fill(0), c;
}, a.allocUnsafe = function(w) {
if (typeof w != "number")
throw new TypeError("Argument must be a number");
return d(w);
}, a.allocUnsafeSlow = function(w) {
if (typeof w != "number")
throw new TypeError("Argument must be a number");
return k.SlowBuffer(w);
};
})(safeBuffer$8, safeBuffer$8.exports)), safeBuffer$8.exports;
}
var hasRequiredBrowser$b;
function requireBrowser$b() {
if (hasRequiredBrowser$b) return browser$b.exports;
hasRequiredBrowser$b = 1;
var q = 65536, A = 4294967295;
function k() {
throw new Error(`Secure random number generation is not supported by this browser.
Use Chrome, Firefox or Internet Explorer 11`);
}
var d = requireSafeBuffer$8().Buffer, S = commonjsGlobal.crypto || commonjsGlobal.msCrypto;
S && S.getRandomValues ? browser$b.exports = a : browser$b.exports = k;
function a(w, b) {
if (w > A) throw new RangeError("requested too many random bytes");
var y = d.allocUnsafe(w);
if (w > 0)
if (w > q)
for (var c = 0; c < w; c += q)
S.getRandomValues(y.slice(c, c + q));
else
S.getRandomValues(y);
return typeof b == "function" ? process$1.nextTick(function() {
b(null, y);
}) : y;
}
return browser$b.exports;
}
var inherits_browser = { exports: {} }, hasRequiredInherits_browser;
function requireInherits_browser() {
return hasRequiredInherits_browser || (hasRequiredInherits_browser = 1, typeof Object.create == "function" ? inherits_browser.exports = function(A, k) {
k && (A.super_ = k, A.prototype = Object.create(k.prototype, {
constructor: {
value: A,
enumerable: !1,
writable: !0,
configurable: !0
}
}));
} : inherits_browser.exports = function(A, k) {
if (k) {
A.super_ = k;
var d = function() {
};
d.prototype = k.prototype, A.prototype = new d(), A.prototype.constructor = A;
}
}), inherits_browser.exports;
}
var safeBuffer$7 = { exports: {} };
/*! safe-buffer. MIT License. Feross Aboukhadijeh <https://feross.org/opensource> */
var hasRequiredSafeBuffer$7;
function requireSafeBuffer$7() {
return hasRequiredSafeBuffer$7 || (hasRequiredSafeBuffer$7 = 1, (function(q, A) {
var k = requireDist(), d = k.Buffer;
function S(w, b) {
for (var y in w)
b[y] = w[y];
}
d.from && d.alloc && d.allocUnsafe && d.allocUnsafeSlow ? q.exports = k : (S(k, A), A.Buffer = a);
function a(w, b, y) {
return d(w, b, y);
}
a.prototype = Object.create(d.prototype), S(d, a), a.from = function(w, b, y) {
if (typeof w == "number")
throw new TypeError("Argument must not be a number");
return d(w, b, y);
}, a.alloc = function(w, b, y) {
if (typeof w != "number")
throw new TypeError("Argument must be a number");
var c = d(w);
return b !== void 0 ? typeof y == "string" ? c.fill(b, y) : c.fill(b) : c.fill(0), c;
}, a.allocUnsafe = function(w) {
if (typeof w != "number")
throw new TypeError("Argument must be a number");
return d(w);
}, a.allocUnsafeSlow = function(w) {
if (typeof w != "number")
throw new TypeError("Argument must be a number");
return k.SlowBuffer(w);
};
})(safeBuffer$7, safeBuffer$7.exports)), safeBuffer$7.exports;
}
var events = { exports: {} }, hasRequiredEvents;
function requireEvents() {
if (hasRequiredEvents) return events.exports;
hasRequiredEvents = 1;
var q = typeof Reflect == "object" ? Reflect : null, A = q && typeof q.apply == "function" ? q.apply : function(U, G, J) {
return Function.prototype.apply.call(U, G, J);
}, k;
q && typeof q.ownKeys == "function" ? k = q.ownKeys : Object.getOwnPropertySymbols ? k = function(U) {
return Object.getOwnPropertyNames(U).concat(Object.getOwnPropertySymbols(U));
} : k = function(U) {
return Object.getOwnPropertyNames(U);
};
function d(T) {
console && console.warn && console.warn(T);
}
var S = Number.isNaN || function(U) {
return U !== U;
};
function a() {
a.init.call(this);
}
events.exports = a, events.exports.once = R, a.EventEmitter = a, a.prototype._events = void 0, a.prototype._eventsCount = 0, a.prototype._maxListeners = void 0;
var w = 10;
function b(T) {
if (typeof T != "function")
throw new TypeError('The "listener" argument must be of type Function. Received type ' + typeof T);
}
Object.defineProperty(a, "defaultMaxListeners", {
enumerable: !0,
get: function() {
return w;
},
set: function(T) {
if (typeof T != "number" || T < 0 || S(T))
throw new RangeError('The value of "defau