UNPKG

taxonium-component

Version:

React component for exploring large phylogenetic trees in the browser

101 lines (100 loc) 3.26 kB
import { r as C } from "./core-DaJmTGYs.js"; function A(p, g) { for (var f = 0; f < g.length; f++) { const a = g[f]; if (typeof a != "string" && !Array.isArray(a)) { for (const c in a) if (c !== "default" && !(c in p)) { const i = Object.getOwnPropertyDescriptor(a, c); i && Object.defineProperty(p, c, i.get ? i : { enumerable: !0, get: () => a[c] }); } } } return Object.freeze(Object.defineProperty(p, Symbol.toStringTag, { value: "Module" })); } var h = { exports: {} }, b = h.exports, m; function O() { return m || (m = 1, (function(p, g) { (function(f, a) { p.exports = a(C()); })(b, function(f) { return (function() { var a = f, c = a.lib, i = c.WordArray, B = a.enc; B.Base64 = { /** * Converts a word array to a Base64 string. * * @param {WordArray} wordArray The word array. * * @return {string} The Base64 string. * * @static * * @example * * var base64String = CryptoJS.enc.Base64.stringify(wordArray); */ stringify: function(t) { var s = t.words, o = t.sigBytes, n = this._map; t.clamp(); for (var e = [], r = 0; r < o; r += 3) for (var v = s[r >>> 2] >>> 24 - r % 4 * 8 & 255, l = s[r + 1 >>> 2] >>> 24 - (r + 1) % 4 * 8 & 255, d = s[r + 2 >>> 2] >>> 24 - (r + 2) % 4 * 8 & 255, y = v << 16 | l << 8 | d, u = 0; u < 4 && r + u * 0.75 < o; u++) e.push(n.charAt(y >>> 6 * (3 - u) & 63)); var x = n.charAt(64); if (x) for (; e.length % 4; ) e.push(x); return e.join(""); }, /** * Converts a Base64 string to a word array. * * @param {string} base64Str The Base64 string. * * @return {WordArray} The word array. * * @static * * @example * * var wordArray = CryptoJS.enc.Base64.parse(base64String); */ parse: function(t) { var s = t.length, o = this._map, n = this._reverseMap; if (!n) { n = this._reverseMap = []; for (var e = 0; e < o.length; e++) n[o.charCodeAt(e)] = e; } var r = o.charAt(64); if (r) { var v = t.indexOf(r); v !== -1 && (s = v); } return _(t, s, n); }, _map: "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=" }; function _(t, s, o) { for (var n = [], e = 0, r = 0; r < s; r++) if (r % 4) { var v = o[t.charCodeAt(r - 1)] << r % 4 * 2, l = o[t.charCodeAt(r)] >>> 6 - r % 4 * 2, d = v | l; n[e >>> 2] |= d << 24 - e % 4 * 8, e++; } return i.create(n, e); } })(), f.enc.Base64; }); })(h)), h.exports; } var q = O(); const E = /* @__PURE__ */ A({ __proto__: null }, [q]); export { E as e }; //# sourceMappingURL=enc-base64-CYHElPpt.js.map