taxonium-component/dist/sha256-BLiXqgIB.js

React component for exploring large phylogenetic trees in the browser

import { g as O } from "./index-dFotuATn.js";
import { r as R } from "./core-BQq6Dq4g.js";
var H = { exports: {} }, T = H.exports, x;
function k() {
  return x || (x = 1, function(C, N) {
    (function(S, h) {
      C.exports = h(R());
    })(T, function(S) {
      return function(h) {
        var f = S, B = f.lib, P = B.WordArray, _ = B.Hasher, W = f.algo, b = [], w = [];
        (function() {
          function s(a) {
            for (var i = h.sqrt(a), c = 2; c <= i; c++)
              if (!(a % c))
                return !1;
            return !0;
          }
          function n(a) {
            return (a - (a | 0)) * 4294967296 | 0;
          }
          for (var r = 2, e = 0; e < 64; )
            s(r) && (e < 8 && (b[e] = n(h.pow(r, 1 / 2))), w[e] = n(h.pow(r, 1 / 3)), e++), r++;
        })();
        var v = [], y = W.SHA256 = _.extend({
          _doReset: function() {
            this._hash = new P.init(b.slice(0));
          },
          _doProcessBlock: function(s, n) {
            for (var r = this._hash.words, e = r[0], a = r[1], i = r[2], c = r[3], o = r[4], d = r[5], p = r[6], A = r[7], t = 0; t < 64; t++) {
              if (t < 16)
                v[t] = s[n + t] | 0;
              else {
                var l = v[t - 15], g = (l << 25 | l >>> 7) ^ (l << 14 | l >>> 18) ^ l >>> 3, u = v[t - 2], j = (u << 15 | u >>> 17) ^ (u << 13 | u >>> 19) ^ u >>> 10;
                v[t] = g + v[t - 7] + j + v[t - 16];
              }
              var F = o & d ^ ~o & p, $ = e & a ^ e & i ^ a & i, z = (e << 30 | e >>> 2) ^ (e << 19 | e >>> 13) ^ (e << 10 | e >>> 22), D = (o << 26 | o >>> 6) ^ (o << 21 | o >>> 11) ^ (o << 7 | o >>> 25), q = A + D + F + w[t] + v[t], E = z + $;
              A = p, p = d, d = o, o = c + q | 0, c = i, i = a, a = e, e = q + E | 0;
            }
            r[0] = r[0] + e | 0, r[1] = r[1] + a | 0, r[2] = r[2] + i | 0, r[3] = r[3] + c | 0, r[4] = r[4] + o | 0, r[5] = r[5] + d | 0, r[6] = r[6] + p | 0, r[7] = r[7] + A | 0;
          },
          _doFinalize: function() {
            var s = this._data, n = s.words, r = this._nDataBytes * 8, e = s.sigBytes * 8;
            return n[e >>> 5] |= 128 << 24 - e % 32, n[(e + 64 >>> 9 << 4) + 14] = h.floor(r / 4294967296), n[(e + 64 >>> 9 << 4) + 15] = r, s.sigBytes = n.length * 4, this._process(), this._hash;
          },
          clone: function() {
            var s = _.clone.call(this);
            return s._hash = this._hash.clone(), s;
          }
        });
        f.SHA256 = _._createHelper(y), f.HmacSHA256 = _._createHmacHelper(y);
      }(Math), S.SHA256;
    });
  }(H)), H.exports;
}
var K = k();
const L = /* @__PURE__ */ O(K), Q = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
  __proto__: null,
  default: L
}, Symbol.toStringTag, { value: "Module" }));
export {
  Q as s
};
//# sourceMappingURL=sha256-BLiXqgIB.js.map