@prosopo/procaptcha-bundle 2.5.3 → 2.6.1

package/dist/bundle/toU8a-BWKf-2UU.js

@@ -1,133 +0,0 @@
-function f(t) {
-  if (!Number.isSafeInteger(t) || t < 0)
-    throw new Error(`positive integer expected, not ${t}`);
-}
-function d(t) {
-  return t instanceof Uint8Array || t != null && typeof t == "object" && t.constructor.name === "Uint8Array";
-}
-function s(t, ...e) {
-  if (!d(t))
-    throw new Error("Uint8Array expected");
-  if (e.length > 0 && !e.includes(t.length))
-    throw new Error(`Uint8Array expected of length ${e}, not of length=${t.length}`);
-}
-function E(t) {
-  if (typeof t != "function" || typeof t.create != "function")
-    throw new Error("Hash should be wrapped by utils.wrapConstructor");
-  f(t.outputLen), f(t.blockLen);
-}
-function L(t, e = !0) {
-  if (t.destroyed)
-    throw new Error("Hash instance has been destroyed");
-  if (e && t.finished)
-    throw new Error("Hash#digest() has already been called");
-}
-function A(t, e) {
-  s(t);
-  const o = e.outputLen;
-  if (t.length < o)
-    throw new Error(`digestInto() expects output buffer of length at least ${o}`);
-}
-const c = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
-const T = (t) => new Uint32Array(t.buffer, t.byteOffset, Math.floor(t.byteLength / 4)), U = (t) => new DataView(t.buffer, t.byteOffset, t.byteLength), k = (t, e) => t << 32 - e | t >>> e, B = (t, e) => t << e | t >>> 32 - e >>> 0, p = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68, l = (t) => t << 24 & 4278190080 | t << 8 & 16711680 | t >>> 8 & 65280 | t >>> 24 & 255, O = p ? (t) => t : (t) => l(t);
-function S(t) {
-  for (let e = 0; e < t.length; e++)
-    t[e] = l(t[e]);
-}
-function y(t) {
-  if (typeof t != "string")
-    throw new Error(`utf8ToBytes expected string, got ${typeof t}`);
-  return new Uint8Array(new TextEncoder().encode(t));
-}
-function i(t) {
-  return typeof t == "string" && (t = y(t)), s(t), t;
-}
-function j(...t) {
-  let e = 0;
-  for (let n = 0; n < t.length; n++) {
-    const r = t[n];
-    s(r), e += r.length;
-  }
-  const o = new Uint8Array(e);
-  for (let n = 0, r = 0; n < t.length; n++) {
-    const u = t[n];
-    o.set(u, r), r += u.length;
-  }
-  return o;
-}
-class $ {
-  // Safe version that clones internal state
-  clone() {
-    return this._cloneInto();
-  }
-}
-const g = {}.toString;
-function H(t, e) {
-  if (e !== void 0 && g.call(e) !== "[object Object]")
-    throw new Error("Options should be object or undefined");
-  return Object.assign(t, e);
-}
-function V(t) {
-  const e = (n) => t().update(i(n)).digest(), o = t();
-  return e.outputLen = o.outputLen, e.blockLen = o.blockLen, e.create = () => t(), e;
-}
-function I(t) {
-  const e = (n, r) => t(r).update(i(n)).digest(), o = t({});
-  return e.outputLen = o.outputLen, e.blockLen = o.blockLen, e.create = (n) => t(n), e;
-}
-function R(t) {
-  const e = (n, r) => t(r).update(i(n)).digest(), o = t({});
-  return e.outputLen = o.outputLen, e.blockLen = o.blockLen, e.create = (n) => t(n), e;
-}
-function C(t = 32) {
-  if (c && typeof c.getRandomValues == "function")
-    return c.getRandomValues(new Uint8Array(t));
-  if (c && typeof c.randomBytes == "function")
-    return c.randomBytes(t);
-  throw new Error("crypto.getRandomValues must be defined");
-}
-function w(t) {
-  return t("return this");
-}
-const a = typeof globalThis < "u" ? globalThis : typeof global < "u" ? global : typeof self < "u" ? self : typeof window < "u" ? window : w(Function);
-function b(t, e) {
-  return typeof a[t] > "u" ? e : a[t];
-}
-let h = class {
-  encode(e) {
-    const o = e.length, n = new Uint8Array(o);
-    for (let r = 0; r < o; r++)
-      n[r] = e.charCodeAt(r);
-    return n;
-  }
-};
-const x = /* @__PURE__ */ b("TextEncoder", h), m = new x();
-function W(t) {
-  return t ? m.encode(t.toString()) : new Uint8Array();
-}
-export {
-  $ as H,
-  O as a,
-  S as b,
-  b as c,
-  j as d,
-  L as e,
-  y as f,
-  V as g,
-  R as h,
-  p as i,
-  s as j,
-  H as k,
-  B as l,
-  E as m,
-  f as n,
-  A as o,
-  U as p,
-  k as q,
-  C as r,
-  W as s,
-  i as t,
-  T as u,
-  I as w,
-  a as x
-};