qsh-webview-sdk 2.0.2 → 2.0.4

package/dist/uni-webview.es.js

@@ -1,339 +1,1729 @@
-function w() {
-  return window.wx && window.wx.miniProgram && /micromessenger/i.test(navigator.userAgent) && /miniProgram/i.test(navigator.userAgent);
+function qt() {
+  return !!(typeof window != "undefined" && window.__wxjs_environment === "miniprogram" || typeof window != "undefined" && window.wx && window.wx.miniProgram || /micromessenger/i.test(navigator.userAgent) && /miniProgram/i.test(navigator.userAgent));
 }
-function d() {
+function At() {
   return typeof window.plus != "undefined";
 }
-function c() {
+function _t() {
   return window.__dcloud_weex_postMessage || window.__dcloud_weex_;
 }
-function p() {
+function Ot() {
   return window.__uniapp_x_postMessage || window.__uniapp_x_;
 }
-function l() {
+function te() {
   return /uni-app/i.test(navigator.userAgent);
 }
-function m() {
+function ee() {
   return /Html5Plus/i.test(navigator.userAgent);
 }
-function U() {
-  return p() ? "uvue" : c() ? "nvue" : w() ? "weixin" : d() ? "plus" : "h5";
-}
-const v = {
-  isWeixinMiniProgram: w(),
-  isAppPlus: d(),
-  isNvue: c(),
-  isUvue: p(),
-  isUniApp: l(),
-  isHtml5Plus: m(),
-  type: U()
-}, x = /complete|loaded|interactive/;
-function W() {
+function Tr() {
+  return Ot() ? "uvue" : _t() ? "nvue" : qt() ? "weixin" : At() ? "plus" : "h5";
+}
+const re = {
+  isWeixinMiniProgram: qt(),
+  isAppPlus: At(),
+  isNvue: _t(),
+  isUvue: Ot(),
+  isUniApp: te(),
+  isHtml5Plus: ee(),
+  type: Tr()
+}, ie = /complete|loaded|interactive/;
+function Fr() {
   window.UniAppJSBridge = !0, document.dispatchEvent(new CustomEvent("UniAppJSBridgeReady", {
     bubbles: !0,
     cancelable: !0
   }));
 }
-function L(e) {
-  return l() || m() ? (window.__uniapp_x_postMessage || window.__uniapp_x_ || window.__dcloud_weex_postMessage || window.__dcloud_weex_ ? document.addEventListener("DOMContentLoaded", e) : window.plus && x.test(document.readyState) ? setTimeout(e, 0) : document.addEventListener("plusready", e), !0) : !1;
+function Br(u) {
+  return te() || ee() ? (window.__uniapp_x_postMessage || window.__uniapp_x_ || window.__dcloud_weex_postMessage || window.__dcloud_weex_ ? document.addEventListener("DOMContentLoaded", u) : window.plus && ie.test(document.readyState) ? setTimeout(u, 0) : document.addEventListener("plusready", u), !0) : !1;
 }
-function R(e) {
-  return window.wx && window.wx.miniProgram ? (window.WeixinJSBridge && window.WeixinJSBridge.invoke ? setTimeout(e, 0) : document.addEventListener("WeixinJSBridgeReady", e), !0) : !1;
+function Er(u) {
+  return window.wx && window.wx.miniProgram ? (window.WeixinJSBridge && window.WeixinJSBridge.invoke ? setTimeout(u, 0) : document.addEventListener("WeixinJSBridgeReady", u), !0) : !1;
 }
-function O(e) {
-  return L(e) || R(e) || (x.test(document.readyState) ? setTimeout(e, 0) : document.addEventListener("DOMContentLoaded", e)), !0;
+function Pr(u) {
+  return Br(u) || Er(u) || (ie.test(document.readyState) ? setTimeout(u, 0) : document.addEventListener("DOMContentLoaded", u)), !0;
 }
-function N() {
-  return new Promise((e) => {
-    window.UniAppJSBridge ? e() : document.addEventListener("UniAppJSBridgeReady", e, { once: !0 });
+function Sr() {
+  return new Promise((u) => {
+    window.UniAppJSBridge ? u() : document.addEventListener("UniAppJSBridgeReady", u, { once: !0 });
   });
 }
-let f = !1;
-function g() {
-  f || (f = !0, O(W));
+let Xt = !1;
+function zt() {
+  Xt || (Xt = !0, Pr(Fr));
 }
-let s = [];
-function $() {
-  if (s.length === 0 && window.plus) {
-    const e = plus.webview.currentWebview();
-    if (!e)
+let yt = [];
+function Ir() {
+  if (yt.length === 0 && window.plus) {
+    const u = plus.webview.currentWebview();
+    if (!u)
       throw new Error("plus.webview.currentWebview() is undefined");
-    const n = e.parent(), i = n ? n.id : e.id;
-    s.push(i);
+    const h = u.parent(), A = h ? h.id : u.id;
+    yt.push(A);
   }
-  return s;
+  return yt;
 }
-function J(e, n) {
-  const i = {
+function Dr(u, h) {
+  const A = {
     options: {
       timestamp: +/* @__PURE__ */ new Date()
     },
-    name: e,
-    arg: n
+    name: u,
+    arg: h
   };
-  if (e === "postMessage") {
-    const r = { data: n };
-    return window.__uniapp_x_postMessage ? window.__uniapp_x_postMessage(r) : window.__uniapp_x_.postMessage(JSON.stringify(r));
+  if (u === "postMessage") {
+    const y = { data: h };
+    return window.__uniapp_x_postMessage ? window.__uniapp_x_postMessage(y) : window.__uniapp_x_.postMessage(JSON.stringify(y));
   }
-  const o = {
+  const q = {
     type: "WEB_INVOKE_APPSERVICE",
     args: {
-      data: i,
-      webviewIds: s
+      data: A,
+      webviewIds: yt
     }
   };
-  window.__uniapp_x_postMessage ? window.__uniapp_x_postMessageToService(o) : window.__uniapp_x_.postMessageToService(JSON.stringify(o));
+  window.__uniapp_x_postMessage ? window.__uniapp_x_postMessageToService(q) : window.__uniapp_x_.postMessageToService(JSON.stringify(q));
 }
-function V(e, n) {
-  const i = {
+function Mr(u, h) {
+  const A = {
     options: {
       timestamp: +/* @__PURE__ */ new Date()
     },
-    name: e,
-    arg: n
+    name: u,
+    arg: h
   };
-  if (e === "postMessage") {
-    const r = { data: [n] };
-    return window.__dcloud_weex_postMessage ? window.__dcloud_weex_postMessage(r) : window.__dcloud_weex_.postMessage(JSON.stringify(r));
+  if (u === "postMessage") {
+    const y = { data: [h] };
+    return window.__dcloud_weex_postMessage ? window.__dcloud_weex_postMessage(y) : window.__dcloud_weex_.postMessage(JSON.stringify(y));
   }
-  const o = {
+  const q = {
     type: "WEB_INVOKE_APPSERVICE",
     args: {
-      data: i,
-      webviewIds: s
+      data: A,
+      webviewIds: yt
     }
   };
-  window.__dcloud_weex_postMessage ? window.__dcloud_weex_postMessageToService(o) : window.__dcloud_weex_.postMessageToService(JSON.stringify(o));
+  window.__dcloud_weex_postMessage ? window.__dcloud_weex_postMessageToService(q) : window.__dcloud_weex_.postMessageToService(JSON.stringify(q));
 }
-function C(e, n) {
-  const i = {
+function Rr(u, h) {
+  const A = {
     options: {
       timestamp: +/* @__PURE__ */ new Date()
     },
-    name: e,
-    arg: n
-  }, o = $();
+    name: u,
+    arg: h
+  }, q = Ir();
   if (plus.webview.getWebviewById("__uniapp__service"))
     plus.webview.postMessageToUniNView({
       type: "WEB_INVOKE_APPSERVICE",
       args: {
-        data: i,
-        webviewIds: o
+        data: A,
+        webviewIds: q
       }
     }, "__uniapp__service");
   else {
-    const r = JSON.stringify(i), A = JSON.stringify(o);
+    const y = JSON.stringify(A), n = JSON.stringify(q);
     plus.webview.getLaunchWebview().evalJS(
-      `UniPlusBridge.subscribeHandler("WEB_INVOKE_APPSERVICE",${r},${A});`
+      `UniPlusBridge.subscribeHandler("WEB_INVOKE_APPSERVICE",${y},${n});`
     );
   }
 }
-function D(e, n) {
-  const i = {
+function qr(u, h) {
+  const A = {
     options: {
       timestamp: +/* @__PURE__ */ new Date()
     },
-    name: e,
-    arg: n
+    name: u,
+    arg: h
   };
   window.parent.postMessage({
     type: "WEB_INVOKE_APPSERVICE",
-    data: i,
+    data: A,
     pageId: ""
   }, "*");
 }
-function t(e, n) {
-  p() ? J(e, n) : c() ? V(e, n) : d() ? C(e, n) : D(e, n);
+function ft(u, h) {
+  Ot() ? Dr(u, h) : _t() ? Mr(u, h) : At() ? Rr(u, h) : qr(u, h);
 }
-function z(e = {}) {
-  const { url: n } = e;
+function Ar(u = {}) {
+  const { url: h } = u;
   if (window.wx && window.wx.miniProgram)
     return window.wx.miniProgram.navigateTo({
-      url: n
+      url: h
     });
-  t("navigateTo", {
-    url: encodeURI(n)
+  ft("navigateTo", {
+    url: encodeURI(h)
   });
 }
-function j(e = {}) {
-  const { delta: n = 1 } = e;
+function _r(u = {}) {
+  const { delta: h = 1 } = u;
   if (window.wx && window.wx.miniProgram)
     return window.wx.miniProgram.navigateBack({
-      delta: parseInt(n)
+      delta: parseInt(h)
     });
-  t("navigateBack", {
-    delta: parseInt(n)
+  ft("navigateBack", {
+    delta: parseInt(h)
   });
 }
-function K(e = {}) {
-  const { url: n } = e;
+function Or(u = {}) {
+  const { url: h } = u;
   if (window.wx && window.wx.miniProgram)
     return window.wx.miniProgram.switchTab({
-      url: n
+      url: h
     });
-  t("switchTab", {
-    url: encodeURI(n)
+  ft("switchTab", {
+    url: encodeURI(h)
   });
 }
-function H(e = {}) {
-  const { url: n } = e;
+function Cr(u = {}) {
+  const { url: h } = u;
   if (window.wx && window.wx.miniProgram)
     return window.wx.miniProgram.reLaunch({
-      url: n
+      url: h
     });
-  t("reLaunch", {
-    url: encodeURI(n)
+  ft("reLaunch", {
+    url: encodeURI(h)
   });
 }
-function k(e = {}) {
-  const { url: n } = e;
+function Vr(u = {}) {
+  const { url: h } = u;
   if (window.wx && window.wx.miniProgram)
     return window.wx.miniProgram.redirectTo({
-      url: n
+      url: h
     });
-  t("redirectTo", {
-    url: encodeURI(n)
+  ft("redirectTo", {
+    url: encodeURI(h)
   });
 }
-function X(e = {}) {
-  const { data: n = {} } = e;
+function Lr(u = {}) {
+  const { data: h = {} } = u;
   if (window.wx && window.wx.miniProgram)
     return window.wx.miniProgram.postMessage({
-      data: n
+      data: h
     });
-  t("postMessage", n);
+  ft("postMessage", h);
 }
-function q(e) {
+function Hr(u) {
   if (window.wx && window.wx.miniProgram && window.wx.miniProgram.getEnv)
-    return window.wx.miniProgram.getEnv(e);
-  e({
+    return window.wx.miniProgram.getEnv(u);
+  u({
     miniprogram: !0,
     weixin: !0
   });
 }
-var P = /* @__PURE__ */ Object.freeze({
+var ne = /* @__PURE__ */ Object.freeze({
   __proto__: null,
-  getEnv: q,
-  navigateBack: j,
-  navigateTo: z,
-  postMessage: X,
-  reLaunch: H,
-  redirectTo: k,
-  switchTab: K
+  getEnv: Hr,
+  navigateBack: _r,
+  navigateTo: Ar,
+  postMessage: Lr,
+  reLaunch: Cr,
+  redirectTo: Vr,
+  switchTab: Or
 });
-function F(e = {}) {
-  const { url: n } = e;
-  t("navigateTo", {
-    url: encodeURI(n)
+function Nr(u = {}) {
+  const { url: h } = u;
+  ft("navigateTo", {
+    url: encodeURI(h)
   });
 }
-function G(e = {}) {
-  const { delta: n = 1 } = e;
-  t("navigateBack", {
-    delta: parseInt(n)
+function Ur(u = {}) {
+  const { delta: h = 1 } = u;
+  ft("navigateBack", {
+    delta: parseInt(h)
   });
 }
-function Y(e = {}) {
-  const { url: n } = e;
-  t("switchTab", {
-    url: encodeURI(n)
+function zr(u = {}) {
+  const { url: h } = u;
+  ft("switchTab", {
+    url: encodeURI(h)
   });
 }
-function Q(e = {}) {
-  const { url: n } = e;
-  t("reLaunch", {
-    url: encodeURI(n)
+function Kr(u = {}) {
+  const { url: h } = u;
+  ft("reLaunch", {
+    url: encodeURI(h)
   });
 }
-function Z(e = {}) {
-  const { url: n } = e;
-  t("redirectTo", {
-    url: encodeURI(n)
+function Wr(u = {}) {
+  const { url: h } = u;
+  ft("redirectTo", {
+    url: encodeURI(h)
   });
 }
-function ee(e = {}) {
-  const { data: n = {} } = e;
-  t("postMessage", n);
+function $r(u = {}) {
+  const { data: h = {} } = u;
+  ft("postMessage", h);
 }
-function ne(e) {
-  const n = {};
-  let i = !1;
-  p() ? (n.uvue = !0, i = !0) : c() ? (n.nvue = !0, i = !0) : d() && (n.plus = !0, i = !0), i ? n.app = !0 : n.h5 = !0, e(n);
+function Zr(u) {
+  const h = {};
+  let A = !1;
+  Ot() ? (h.uvue = !0, A = !0) : _t() ? (h.nvue = !0, A = !0) : At() && (h.plus = !0, A = !0), A ? h.app = !0 : h.h5 = !0, u(h);
 }
-var E = /* @__PURE__ */ Object.freeze({
+var oe = /* @__PURE__ */ Object.freeze({
   __proto__: null,
-  getEnv: ne,
-  navigateBack: G,
-  navigateTo: F,
-  postMessage: ee,
-  reLaunch: Q,
-  redirectTo: Z,
-  switchTab: Y
+  getEnv: Zr,
+  navigateBack: Ur,
+  navigateTo: Nr,
+  postMessage: $r,
+  reLaunch: Kr,
+  redirectTo: Wr,
+  switchTab: zr
 });
-function u() {
-  return w() ? P : E;
+function Tt() {
+  return qt() ? ne : oe;
+}
+function se(u) {
+  return Tt().navigateTo(u);
 }
-function T(e) {
-  return u().navigateTo(e);
+function ae(u) {
+  return Tt().navigateBack(u);
 }
-function M(e) {
-  return u().navigateBack(e);
+function fe(u) {
+  return Tt().switchTab(u);
 }
-function I(e) {
-  return u().switchTab(e);
+function ue(u) {
+  return Tt().reLaunch(u);
 }
-function b(e) {
-  return u().reLaunch(e);
+function he(u) {
+  return Tt().redirectTo(u);
 }
-function S(e) {
-  return u().redirectTo(e);
+function ce() {
+  return qt() ? ne : oe;
 }
-function h() {
-  return w() ? P : E;
+function le(u = {}) {
+  return ce().postMessage(u);
 }
-function B(e = {}) {
-  return h().postMessage(e);
+function pe(u) {
+  return ce().getEnv(u);
+}
+var Ut = { exports: {} }, Rt = { exports: {} }, Jr = Rt.exports, kt;
+function Gr() {
+  return kt || (kt = 1, function(u, h) {
+    (function() {
+      var A, q = 244837814094590, y = (q & 16777215) == 15715070;
+      function n(t, e, r) {
+        t != null && (typeof t == "number" ? this.fromNumber(t, e, r) : e == null && typeof t != "string" ? this.fromString(t, 256) : this.fromString(t, e));
+      }
+      function p() {
+        return new n(null);
+      }
+      function $(t, e, r, i, a, l) {
+        for (; --l >= 0; ) {
+          var b = e * this[t++] + r[i] + a;
+          a = Math.floor(b / 67108864), r[i++] = b & 67108863;
+        }
+        return a;
+      }
+      function K(t, e, r, i, a, l) {
+        for (var b = e & 32767, E = e >> 15; --l >= 0; ) {
+          var W = this[t] & 32767, X = this[t++] >> 15, at = E * W + X * b;
+          W = b * W + ((at & 32767) << 15) + r[i] + (a & 1073741823), a = (W >>> 30) + (at >>> 15) + E * X + (a >>> 30), r[i++] = W & 1073741823;
+        }
+        return a;
+      }
+      function D(t, e, r, i, a, l) {
+        for (var b = e & 16383, E = e >> 14; --l >= 0; ) {
+          var W = this[t] & 16383, X = this[t++] >> 14, at = E * W + X * b;
+          W = b * W + ((at & 16383) << 14) + r[i] + a, a = (W >> 28) + (at >> 14) + E * X, r[i++] = W & 268435455;
+        }
+        return a;
+      }
+      var N = typeof navigator != "undefined";
+      N && y && navigator.appName == "Microsoft Internet Explorer" ? (n.prototype.am = K, A = 30) : N && y && navigator.appName != "Netscape" ? (n.prototype.am = $, A = 26) : (n.prototype.am = D, A = 28), n.prototype.DB = A, n.prototype.DM = (1 << A) - 1, n.prototype.DV = 1 << A;
+      var _ = 52;
+      n.prototype.FV = Math.pow(2, _), n.prototype.F1 = _ - A, n.prototype.F2 = 2 * A - _;
+      var d = "0123456789abcdefghijklmnopqrstuvwxyz", I = new Array(), c, P;
+      for (c = 48, P = 0; P <= 9; ++P) I[c++] = P;
+      for (c = 97, P = 10; P < 36; ++P) I[c++] = P;
+      for (c = 65, P = 10; P < 36; ++P) I[c++] = P;
+      function g(t) {
+        return d.charAt(t);
+      }
+      function o(t, e) {
+        var r = I[t.charCodeAt(e)];
+        return r == null ? -1 : r;
+      }
+      function M(t) {
+        for (var e = this.t - 1; e >= 0; --e) t[e] = this[e];
+        t.t = this.t, t.s = this.s;
+      }
+      function S(t) {
+        this.t = 1, this.s = t < 0 ? -1 : 0, t > 0 ? this[0] = t : t < -1 ? this[0] = t + this.DV : this.t = 0;
+      }
+      function s(t) {
+        var e = p();
+        return e.fromInt(t), e;
+      }
+      function x(t, e) {
+        var r;
+        if (e == 16) r = 4;
+        else if (e == 8) r = 3;
+        else if (e == 256) r = 8;
+        else if (e == 2) r = 1;
+        else if (e == 32) r = 5;
+        else if (e == 4) r = 2;
+        else {
+          this.fromRadix(t, e);
+          return;
+        }
+        this.t = 0, this.s = 0;
+        for (var i = t.length, a = !1, l = 0; --i >= 0; ) {
+          var b = r == 8 ? t[i] & 255 : o(t, i);
+          if (b < 0) {
+            t.charAt(i) == "-" && (a = !0);
+            continue;
+          }
+          a = !1, l == 0 ? this[this.t++] = b : l + r > this.DB ? (this[this.t - 1] |= (b & (1 << this.DB - l) - 1) << l, this[this.t++] = b >> this.DB - l) : this[this.t - 1] |= b << l, l += r, l >= this.DB && (l -= this.DB);
+        }
+        r == 8 && (t[0] & 128) != 0 && (this.s = -1, l > 0 && (this[this.t - 1] |= (1 << this.DB - l) - 1 << l)), this.clamp(), a && n.ZERO.subTo(this, this);
+      }
+      function T() {
+        for (var t = this.s & this.DM; this.t > 0 && this[this.t - 1] == t; ) --this.t;
+      }
+      function f(t) {
+        if (this.s < 0) return "-" + this.negate().toString(t);
+        var e;
+        if (t == 16) e = 4;
+        else if (t == 8) e = 3;
+        else if (t == 2) e = 1;
+        else if (t == 32) e = 5;
+        else if (t == 4) e = 2;
+        else return this.toRadix(t);
+        var r = (1 << e) - 1, i, a = !1, l = "", b = this.t, E = this.DB - b * this.DB % e;
+        if (b-- > 0)
+          for (E < this.DB && (i = this[b] >> E) > 0 && (a = !0, l = g(i)); b >= 0; )
+            E < e ? (i = (this[b] & (1 << E) - 1) << e - E, i |= this[--b] >> (E += this.DB - e)) : (i = this[b] >> (E -= e) & r, E <= 0 && (E += this.DB, --b)), i > 0 && (a = !0), a && (l += g(i));
+        return a ? l : "0";
+      }
+      function w() {
+        var t = p();
+        return n.ZERO.subTo(this, t), t;
+      }
+      function v() {
+        return this.s < 0 ? this.negate() : this;
+      }
+      function m(t) {
+        var e = this.s - t.s;
+        if (e != 0) return e;
+        var r = this.t;
+        if (e = r - t.t, e != 0) return this.s < 0 ? -e : e;
+        for (; --r >= 0; ) if ((e = this[r] - t[r]) != 0) return e;
+        return 0;
+      }
+      function B(t) {
+        var e = 1, r;
+        return (r = t >>> 16) != 0 && (t = r, e += 16), (r = t >> 8) != 0 && (t = r, e += 8), (r = t >> 4) != 0 && (t = r, e += 4), (r = t >> 2) != 0 && (t = r, e += 2), (r = t >> 1) != 0 && (t = r, e += 1), e;
+      }
+      function F() {
+        return this.t <= 0 ? 0 : this.DB * (this.t - 1) + B(this[this.t - 1] ^ this.s & this.DM);
+      }
+      function C(t, e) {
+        var r;
+        for (r = this.t - 1; r >= 0; --r) e[r + t] = this[r];
+        for (r = t - 1; r >= 0; --r) e[r] = 0;
+        e.t = this.t + t, e.s = this.s;
+      }
+      function R(t, e) {
+        for (var r = t; r < this.t; ++r) e[r - t] = this[r];
+        e.t = Math.max(this.t - t, 0), e.s = this.s;
+      }
+      function O(t, e) {
+        var r = t % this.DB, i = this.DB - r, a = (1 << i) - 1, l = Math.floor(t / this.DB), b = this.s << r & this.DM, E;
+        for (E = this.t - 1; E >= 0; --E)
+          e[E + l + 1] = this[E] >> i | b, b = (this[E] & a) << r;
+        for (E = l - 1; E >= 0; --E) e[E] = 0;
+        e[l] = b, e.t = this.t + l + 1, e.s = this.s, e.clamp();
+      }
+      function U(t, e) {
+        e.s = this.s;
+        var r = Math.floor(t / this.DB);
+        if (r >= this.t) {
+          e.t = 0;
+          return;
+        }
+        var i = t % this.DB, a = this.DB - i, l = (1 << i) - 1;
+        e[0] = this[r] >> i;
+        for (var b = r + 1; b < this.t; ++b)
+          e[b - r - 1] |= (this[b] & l) << a, e[b - r] = this[b] >> i;
+        i > 0 && (e[this.t - r - 1] |= (this.s & l) << a), e.t = this.t - r, e.clamp();
+      }
+      function H(t, e) {
+        for (var r = 0, i = 0, a = Math.min(t.t, this.t); r < a; )
+          i += this[r] - t[r], e[r++] = i & this.DM, i >>= this.DB;
+        if (t.t < this.t) {
+          for (i -= t.s; r < this.t; )
+            i += this[r], e[r++] = i & this.DM, i >>= this.DB;
+          i += this.s;
+        } else {
+          for (i += this.s; r < t.t; )
+            i -= t[r], e[r++] = i & this.DM, i >>= this.DB;
+          i -= t.s;
+        }
+        e.s = i < 0 ? -1 : 0, i < -1 ? e[r++] = this.DV + i : i > 0 && (e[r++] = i), e.t = r, e.clamp();
+      }
+      function V(t, e) {
+        var r = this.abs(), i = t.abs(), a = r.t;
+        for (e.t = a + i.t; --a >= 0; ) e[a] = 0;
+        for (a = 0; a < i.t; ++a) e[a + r.t] = r.am(0, i[a], e, a, 0, r.t);
+        e.s = 0, e.clamp(), this.s != t.s && n.ZERO.subTo(e, e);
+      }
+      function L(t) {
+        for (var e = this.abs(), r = t.t = 2 * e.t; --r >= 0; ) t[r] = 0;
+        for (r = 0; r < e.t - 1; ++r) {
+          var i = e.am(r, e[r], t, 2 * r, 0, 1);
+          (t[r + e.t] += e.am(r + 1, 2 * e[r], t, 2 * r + 1, i, e.t - r - 1)) >= e.DV && (t[r + e.t] -= e.DV, t[r + e.t + 1] = 1);
+        }
+        t.t > 0 && (t[t.t - 1] += e.am(r, e[r], t, 2 * r, 0, 1)), t.s = 0, t.clamp();
+      }
+      function Z(t, e, r) {
+        var i = t.abs();
+        if (!(i.t <= 0)) {
+          var a = this.abs();
+          if (a.t < i.t) {
+            e != null && e.fromInt(0), r != null && this.copyTo(r);
+            return;
+          }
+          r == null && (r = p());
+          var l = p(), b = this.s, E = t.s, W = this.DB - B(i[i.t - 1]);
+          W > 0 ? (i.lShiftTo(W, l), a.lShiftTo(W, r)) : (i.copyTo(l), a.copyTo(r));
+          var X = l.t, at = l[X - 1];
+          if (at != 0) {
+            var ot = at * (1 << this.F1) + (X > 1 ? l[X - 2] >> this.F2 : 0), pt = this.FV / ot, Dt = (1 << this.F1) / ot, ct = 1 << this.F2, lt = r.t, Mt = lt - X, vt = e == null ? p() : e;
+            for (l.dlShiftTo(Mt, vt), r.compareTo(vt) >= 0 && (r[r.t++] = 1, r.subTo(vt, r)), n.ONE.dlShiftTo(X, vt), vt.subTo(l, l); l.t < X; ) l[l.t++] = 0;
+            for (; --Mt >= 0; ) {
+              var Nt = r[--lt] == at ? this.DM : Math.floor(r[lt] * pt + (r[lt - 1] + ct) * Dt);
+              if ((r[lt] += l.am(0, Nt, r, Mt, 0, X)) < Nt)
+                for (l.dlShiftTo(Mt, vt), r.subTo(vt, r); r[lt] < --Nt; ) r.subTo(vt, r);
+            }
+            e != null && (r.drShiftTo(X, e), b != E && n.ZERO.subTo(e, e)), r.t = X, r.clamp(), W > 0 && r.rShiftTo(W, r), b < 0 && n.ZERO.subTo(r, r);
+          }
+        }
+      }
+      function J(t) {
+        var e = p();
+        return this.abs().divRemTo(t, null, e), this.s < 0 && e.compareTo(n.ZERO) > 0 && t.subTo(e, e), e;
+      }
+      function z(t) {
+        this.m = t;
+      }
+      function k(t) {
+        return t.s < 0 || t.compareTo(this.m) >= 0 ? t.mod(this.m) : t;
+      }
+      function G(t) {
+        return t;
+      }
+      function Q(t) {
+        t.divRemTo(this.m, null, t);
+      }
+      function tt(t, e, r) {
+        t.multiplyTo(e, r), this.reduce(r);
+      }
+      function rt(t, e) {
+        t.squareTo(e), this.reduce(e);
+      }
+      z.prototype.convert = k, z.prototype.revert = G, z.prototype.reduce = Q, z.prototype.mulTo = tt, z.prototype.sqrTo = rt;
+      function st() {
+        if (this.t < 1) return 0;
+        var t = this[0];
+        if ((t & 1) == 0) return 0;
+        var e = t & 3;
+        return e = e * (2 - (t & 15) * e) & 15, e = e * (2 - (t & 255) * e) & 255, e = e * (2 - ((t & 65535) * e & 65535)) & 65535, e = e * (2 - t * e % this.DV) % this.DV, e > 0 ? this.DV - e : -e;
+      }
+      function ut(t) {
+        this.m = t, this.mp = t.invDigit(), this.mpl = this.mp & 32767, this.mph = this.mp >> 15, this.um = (1 << t.DB - 15) - 1, this.mt2 = 2 * t.t;
+      }
+      function gt(t) {
+        var e = p();
+        return t.abs().dlShiftTo(this.m.t, e), e.divRemTo(this.m, null, e), t.s < 0 && e.compareTo(n.ZERO) > 0 && this.m.subTo(e, e), e;
+      }
+      function Ft(t) {
+        var e = p();
+        return t.copyTo(e), this.reduce(e), e;
+      }
+      function Bt(t) {
+        for (; t.t <= this.mt2; )
+          t[t.t++] = 0;
+        for (var e = 0; e < this.m.t; ++e) {
+          var r = t[e] & 32767, i = r * this.mpl + ((r * this.mph + (t[e] >> 15) * this.mpl & this.um) << 15) & t.DM;
+          for (r = e + this.m.t, t[r] += this.m.am(0, i, t, e, 0, this.m.t); t[r] >= t.DV; )
+            t[r] -= t.DV, t[++r]++;
+        }
+        t.clamp(), t.drShiftTo(this.m.t, t), t.compareTo(this.m) >= 0 && t.subTo(this.m, t);
+      }
+      function Et(t, e) {
+        t.squareTo(e), this.reduce(e);
+      }
+      function Pt(t, e, r) {
+        t.multiplyTo(e, r), this.reduce(r);
+      }
+      ut.prototype.convert = gt, ut.prototype.revert = Ft, ut.prototype.reduce = Bt, ut.prototype.mulTo = Pt, ut.prototype.sqrTo = Et;
+      function it() {
+        return (this.t > 0 ? this[0] & 1 : this.s) == 0;
+      }
+      function St(t, e) {
+        if (t > 4294967295 || t < 1) return n.ONE;
+        var r = p(), i = p(), a = e.convert(this), l = B(t) - 1;
+        for (a.copyTo(r); --l >= 0; )
+          if (e.sqrTo(r, i), (t & 1 << l) > 0) e.mulTo(i, a, r);
+          else {
+            var b = r;
+            r = i, i = b;
+          }
+        return e.revert(r);
+      }
+      function mt(t, e) {
+        var r;
+        return t < 256 || e.isEven() ? r = new z(e) : r = new ut(e), this.exp(t, r);
+      }
+      n.prototype.copyTo = M, n.prototype.fromInt = S, n.prototype.fromString = x, n.prototype.clamp = T, n.prototype.dlShiftTo = C, n.prototype.drShiftTo = R, n.prototype.lShiftTo = O, n.prototype.rShiftTo = U, n.prototype.subTo = H, n.prototype.multiplyTo = V, n.prototype.squareTo = L, n.prototype.divRemTo = Z, n.prototype.invDigit = st, n.prototype.isEven = it, n.prototype.exp = St, n.prototype.toString = f, n.prototype.negate = w, n.prototype.abs = v, n.prototype.compareTo = m, n.prototype.bitLength = F, n.prototype.mod = J, n.prototype.modPowInt = mt, n.ZERO = s(0), n.ONE = s(1);
+      function Ct() {
+        var t = p();
+        return this.copyTo(t), t;
+      }
+      function xt() {
+        if (this.s < 0) {
+          if (this.t == 1) return this[0] - this.DV;
+          if (this.t == 0) return -1;
+        } else {
+          if (this.t == 1) return this[0];
+          if (this.t == 0) return 0;
+        }
+        return (this[1] & (1 << 32 - this.DB) - 1) << this.DB | this[0];
+      }
+      function ve() {
+        return this.t == 0 ? this.s : this[0] << 24 >> 24;
+      }
+      function de() {
+        return this.t == 0 ? this.s : this[0] << 16 >> 16;
+      }
+      function xe(t) {
+        return Math.floor(Math.LN2 * this.DB / Math.log(t));
+      }
+      function ge() {
+        return this.s < 0 ? -1 : this.t <= 0 || this.t == 1 && this[0] <= 0 ? 0 : 1;
+      }
+      function me(t) {
+        if (t == null && (t = 10), this.signum() == 0 || t < 2 || t > 36) return "0";
+        var e = this.chunkSize(t), r = Math.pow(t, e), i = s(r), a = p(), l = p(), b = "";
+        for (this.divRemTo(i, a, l); a.signum() > 0; )
+          b = (r + l.intValue()).toString(t).substr(1) + b, a.divRemTo(i, a, l);
+        return l.intValue().toString(t) + b;
+      }
+      function we(t, e) {
+        this.fromInt(0), e == null && (e = 10);
+        for (var r = this.chunkSize(e), i = Math.pow(e, r), a = !1, l = 0, b = 0, E = 0; E < t.length; ++E) {
+          var W = o(t, E);
+          if (W < 0) {
+            t.charAt(E) == "-" && this.signum() == 0 && (a = !0);
+            continue;
+          }
+          b = e * b + W, ++l >= r && (this.dMultiply(i), this.dAddOffset(b, 0), l = 0, b = 0);
+        }
+        l > 0 && (this.dMultiply(Math.pow(e, l)), this.dAddOffset(b, 0)), a && n.ZERO.subTo(this, this);
+      }
+      function ye(t, e, r) {
+        if (typeof e == "number")
+          if (t < 2) this.fromInt(1);
+          else
+            for (this.fromNumber(t, r), this.testBit(t - 1) || this.bitwiseTo(n.ONE.shiftLeft(t - 1), Vt, this), this.isEven() && this.dAddOffset(1, 0); !this.isProbablePrime(e); )
+              this.dAddOffset(2, 0), this.bitLength() > t && this.subTo(n.ONE.shiftLeft(t - 1), this);
+        else {
+          var i = new Array(), a = t & 7;
+          i.length = (t >> 3) + 1, e.nextBytes(i), a > 0 ? i[0] &= (1 << a) - 1 : i[0] = 0, this.fromString(i, 256);
+        }
+      }
+      function be() {
+        var t = this.t, e = new Array();
+        e[0] = this.s;
+        var r = this.DB - t * this.DB % 8, i, a = 0;
+        if (t-- > 0)
+          for (r < this.DB && (i = this[t] >> r) != (this.s & this.DM) >> r && (e[a++] = i | this.s << this.DB - r); t >= 0; )
+            r < 8 ? (i = (this[t] & (1 << r) - 1) << 8 - r, i |= this[--t] >> (r += this.DB - 8)) : (i = this[t] >> (r -= 8) & 255, r <= 0 && (r += this.DB, --t)), (i & 128) != 0 && (i |= -256), a == 0 && (this.s & 128) != (i & 128) && ++a, (a > 0 || i != this.s) && (e[a++] = i);
+        return e;
+      }
+      function Te(t) {
+        return this.compareTo(t) == 0;
+      }
+      function Fe(t) {
+        return this.compareTo(t) < 0 ? this : t;
+      }
+      function Be(t) {
+        return this.compareTo(t) > 0 ? this : t;
+      }
+      function Ee(t, e, r) {
+        var i, a, l = Math.min(t.t, this.t);
+        for (i = 0; i < l; ++i) r[i] = e(this[i], t[i]);
+        if (t.t < this.t) {
+          for (a = t.s & this.DM, i = l; i < this.t; ++i) r[i] = e(this[i], a);
+          r.t = this.t;
+        } else {
+          for (a = this.s & this.DM, i = l; i < t.t; ++i) r[i] = e(a, t[i]);
+          r.t = t.t;
+        }
+        r.s = e(this.s, t.s), r.clamp();
+      }
+      function Pe(t, e) {
+        return t & e;
+      }
+      function Se(t) {
+        var e = p();
+        return this.bitwiseTo(t, Pe, e), e;
+      }
+      function Vt(t, e) {
+        return t | e;
+      }
+      function Ie(t) {
+        var e = p();
+        return this.bitwiseTo(t, Vt, e), e;
+      }
+      function Kt(t, e) {
+        return t ^ e;
+      }
+      function De(t) {
+        var e = p();
+        return this.bitwiseTo(t, Kt, e), e;
+      }
+      function Wt(t, e) {
+        return t & ~e;
+      }
+      function Me(t) {
+        var e = p();
+        return this.bitwiseTo(t, Wt, e), e;
+      }
+      function Re() {
+        for (var t = p(), e = 0; e < this.t; ++e) t[e] = this.DM & ~this[e];
+        return t.t = this.t, t.s = ~this.s, t;
+      }
+      function qe(t) {
+        var e = p();
+        return t < 0 ? this.rShiftTo(-t, e) : this.lShiftTo(t, e), e;
+      }
+      function Ae(t) {
+        var e = p();
+        return t < 0 ? this.lShiftTo(-t, e) : this.rShiftTo(t, e), e;
+      }
+      function _e(t) {
+        if (t == 0) return -1;
+        var e = 0;
+        return (t & 65535) == 0 && (t >>= 16, e += 16), (t & 255) == 0 && (t >>= 8, e += 8), (t & 15) == 0 && (t >>= 4, e += 4), (t & 3) == 0 && (t >>= 2, e += 2), (t & 1) == 0 && ++e, e;
+      }
+      function Oe() {
+        for (var t = 0; t < this.t; ++t)
+          if (this[t] != 0) return t * this.DB + _e(this[t]);
+        return this.s < 0 ? this.t * this.DB : -1;
+      }
+      function Ce(t) {
+        for (var e = 0; t != 0; )
+          t &= t - 1, ++e;
+        return e;
+      }
+      function Ve() {
+        for (var t = 0, e = this.s & this.DM, r = 0; r < this.t; ++r) t += Ce(this[r] ^ e);
+        return t;
+      }
+      function Le(t) {
+        var e = Math.floor(t / this.DB);
+        return e >= this.t ? this.s != 0 : (this[e] & 1 << t % this.DB) != 0;
+      }
+      function He(t, e) {
+        var r = n.ONE.shiftLeft(t);
+        return this.bitwiseTo(r, e, r), r;
+      }
+      function Ne(t) {
+        return this.changeBit(t, Vt);
+      }
+      function Ue(t) {
+        return this.changeBit(t, Wt);
+      }
+      function ze(t) {
+        return this.changeBit(t, Kt);
+      }
+      function Ke(t, e) {
+        for (var r = 0, i = 0, a = Math.min(t.t, this.t); r < a; )
+          i += this[r] + t[r], e[r++] = i & this.DM, i >>= this.DB;
+        if (t.t < this.t) {
+          for (i += t.s; r < this.t; )
+            i += this[r], e[r++] = i & this.DM, i >>= this.DB;
+          i += this.s;
+        } else {
+          for (i += this.s; r < t.t; )
+            i += t[r], e[r++] = i & this.DM, i >>= this.DB;
+          i += t.s;
+        }
+        e.s = i < 0 ? -1 : 0, i > 0 ? e[r++] = i : i < -1 && (e[r++] = this.DV + i), e.t = r, e.clamp();
+      }
+      function We(t) {
+        var e = p();
+        return this.addTo(t, e), e;
+      }
+      function $e(t) {
+        var e = p();
+        return this.subTo(t, e), e;
+      }
+      function Ze(t) {
+        var e = p();
+        return this.multiplyTo(t, e), e;
+      }
+      function Je() {
+        var t = p();
+        return this.squareTo(t), t;
+      }
+      function Ge(t) {
+        var e = p();
+        return this.divRemTo(t, e, null), e;
+      }
+      function Ye(t) {
+        var e = p();
+        return this.divRemTo(t, null, e), e;
+      }
+      function Xe(t) {
+        var e = p(), r = p();
+        return this.divRemTo(t, e, r), new Array(e, r);
+      }
+      function ke(t) {
+        this[this.t] = this.am(0, t - 1, this, 0, 0, this.t), ++this.t, this.clamp();
+      }
+      function Qe(t, e) {
+        if (t != 0) {
+          for (; this.t <= e; ) this[this.t++] = 0;
+          for (this[e] += t; this[e] >= this.DV; )
+            this[e] -= this.DV, ++e >= this.t && (this[this.t++] = 0), ++this[e];
+        }
+      }
+      function wt() {
+      }
+      function $t(t) {
+        return t;
+      }
+      function je(t, e, r) {
+        t.multiplyTo(e, r);
+      }
+      function tr(t, e) {
+        t.squareTo(e);
+      }
+      wt.prototype.convert = $t, wt.prototype.revert = $t, wt.prototype.mulTo = je, wt.prototype.sqrTo = tr;
+      function er(t) {
+        return this.exp(t, new wt());
+      }
+      function rr(t, e, r) {
+        var i = Math.min(this.t + t.t, e);
+        for (r.s = 0, r.t = i; i > 0; ) r[--i] = 0;
+        var a;
+        for (a = r.t - this.t; i < a; ++i) r[i + this.t] = this.am(0, t[i], r, i, 0, this.t);
+        for (a = Math.min(t.t, e); i < a; ++i) this.am(0, t[i], r, i, 0, e - i);
+        r.clamp();
+      }
+      function ir(t, e, r) {
+        --e;
+        var i = r.t = this.t + t.t - e;
+        for (r.s = 0; --i >= 0; ) r[i] = 0;
+        for (i = Math.max(e - this.t, 0); i < t.t; ++i)
+          r[this.t + i - e] = this.am(e - i, t[i], r, 0, 0, this.t + i - e);
+        r.clamp(), r.drShiftTo(1, r);
+      }
+      function dt(t) {
+        this.r2 = p(), this.q3 = p(), n.ONE.dlShiftTo(2 * t.t, this.r2), this.mu = this.r2.divide(t), this.m = t;
+      }
+      function nr(t) {
+        if (t.s < 0 || t.t > 2 * this.m.t) return t.mod(this.m);
+        if (t.compareTo(this.m) < 0) return t;
+        var e = p();
+        return t.copyTo(e), this.reduce(e), e;
+      }
+      function or(t) {
+        return t;
+      }
+      function sr(t) {
+        for (t.drShiftTo(this.m.t - 1, this.r2), t.t > this.m.t + 1 && (t.t = this.m.t + 1, t.clamp()), this.mu.multiplyUpperTo(this.r2, this.m.t + 1, this.q3), this.m.multiplyLowerTo(this.q3, this.m.t + 1, this.r2); t.compareTo(this.r2) < 0; ) t.dAddOffset(1, this.m.t + 1);
+        for (t.subTo(this.r2, t); t.compareTo(this.m) >= 0; ) t.subTo(this.m, t);
+      }
+      function ar(t, e) {
+        t.squareTo(e), this.reduce(e);
+      }
+      function fr(t, e, r) {
+        t.multiplyTo(e, r), this.reduce(r);
+      }
+      dt.prototype.convert = nr, dt.prototype.revert = or, dt.prototype.reduce = sr, dt.prototype.mulTo = fr, dt.prototype.sqrTo = ar;
+      function ur(t, e) {
+        var r = t.bitLength(), i, a = s(1), l;
+        if (r <= 0) return a;
+        r < 18 ? i = 1 : r < 48 ? i = 3 : r < 144 ? i = 4 : r < 768 ? i = 5 : i = 6, r < 8 ? l = new z(e) : e.isEven() ? l = new dt(e) : l = new ut(e);
+        var b = new Array(), E = 3, W = i - 1, X = (1 << i) - 1;
+        if (b[1] = l.convert(this), i > 1) {
+          var at = p();
+          for (l.sqrTo(b[1], at); E <= X; )
+            b[E] = p(), l.mulTo(at, b[E - 2], b[E]), E += 2;
+        }
+        var ot = t.t - 1, pt, Dt = !0, ct = p(), lt;
+        for (r = B(t[ot]) - 1; ot >= 0; ) {
+          for (r >= W ? pt = t[ot] >> r - W & X : (pt = (t[ot] & (1 << r + 1) - 1) << W - r, ot > 0 && (pt |= t[ot - 1] >> this.DB + r - W)), E = i; (pt & 1) == 0; )
+            pt >>= 1, --E;
+          if ((r -= E) < 0 && (r += this.DB, --ot), Dt)
+            b[pt].copyTo(a), Dt = !1;
+          else {
+            for (; E > 1; )
+              l.sqrTo(a, ct), l.sqrTo(ct, a), E -= 2;
+            E > 0 ? l.sqrTo(a, ct) : (lt = a, a = ct, ct = lt), l.mulTo(ct, b[pt], a);
+          }
+          for (; ot >= 0 && (t[ot] & 1 << r) == 0; )
+            l.sqrTo(a, ct), lt = a, a = ct, ct = lt, --r < 0 && (r = this.DB - 1, --ot);
+        }
+        return l.revert(a);
+      }
+      function hr(t) {
+        var e = this.s < 0 ? this.negate() : this.clone(), r = t.s < 0 ? t.negate() : t.clone();
+        if (e.compareTo(r) < 0) {
+          var i = e;
+          e = r, r = i;
+        }
+        var a = e.getLowestSetBit(), l = r.getLowestSetBit();
+        if (l < 0) return e;
+        for (a < l && (l = a), l > 0 && (e.rShiftTo(l, e), r.rShiftTo(l, r)); e.signum() > 0; )
+          (a = e.getLowestSetBit()) > 0 && e.rShiftTo(a, e), (a = r.getLowestSetBit()) > 0 && r.rShiftTo(a, r), e.compareTo(r) >= 0 ? (e.subTo(r, e), e.rShiftTo(1, e)) : (r.subTo(e, r), r.rShiftTo(1, r));
+        return l > 0 && r.lShiftTo(l, r), r;
+      }
+      function cr(t) {
+        if (t <= 0) return 0;
+        var e = this.DV % t, r = this.s < 0 ? t - 1 : 0;
+        if (this.t > 0)
+          if (e == 0) r = this[0] % t;
+          else for (var i = this.t - 1; i >= 0; --i) r = (e * r + this[i]) % t;
+        return r;
+      }
+      function lr(t) {
+        var e = t.isEven();
+        if (this.isEven() && e || t.signum() == 0) return n.ZERO;
+        for (var r = t.clone(), i = this.clone(), a = s(1), l = s(0), b = s(0), E = s(1); r.signum() != 0; ) {
+          for (; r.isEven(); )
+            r.rShiftTo(1, r), e ? ((!a.isEven() || !l.isEven()) && (a.addTo(this, a), l.subTo(t, l)), a.rShiftTo(1, a)) : l.isEven() || l.subTo(t, l), l.rShiftTo(1, l);
+          for (; i.isEven(); )
+            i.rShiftTo(1, i), e ? ((!b.isEven() || !E.isEven()) && (b.addTo(this, b), E.subTo(t, E)), b.rShiftTo(1, b)) : E.isEven() || E.subTo(t, E), E.rShiftTo(1, E);
+          r.compareTo(i) >= 0 ? (r.subTo(i, r), e && a.subTo(b, a), l.subTo(E, l)) : (i.subTo(r, i), e && b.subTo(a, b), E.subTo(l, E));
+        }
+        if (i.compareTo(n.ONE) != 0) return n.ZERO;
+        if (E.compareTo(t) >= 0) return E.subtract(t);
+        if (E.signum() < 0) E.addTo(t, E);
+        else return E;
+        return E.signum() < 0 ? E.add(t) : E;
+      }
+      var et = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997], pr = (1 << 26) / et[et.length - 1];
+      function vr(t) {
+        var e, r = this.abs();
+        if (r.t == 1 && r[0] <= et[et.length - 1]) {
+          for (e = 0; e < et.length; ++e)
+            if (r[0] == et[e]) return !0;
+          return !1;
+        }
+        if (r.isEven()) return !1;
+        for (e = 1; e < et.length; ) {
+          for (var i = et[e], a = e + 1; a < et.length && i < pr; ) i *= et[a++];
+          for (i = r.modInt(i); e < a; ) if (i % et[e++] == 0) return !1;
+        }
+        return r.millerRabin(t);
+      }
+      function dr(t) {
+        var e = this.subtract(n.ONE), r = e.getLowestSetBit();
+        if (r <= 0) return !1;
+        var i = e.shiftRight(r);
+        t = t + 1 >> 1, t > et.length && (t = et.length);
+        for (var a = p(), l = 0; l < t; ++l) {
+          a.fromInt(et[Math.floor(Math.random() * et.length)]);
+          var b = a.modPow(i, this);
+          if (b.compareTo(n.ONE) != 0 && b.compareTo(e) != 0) {
+            for (var E = 1; E++ < r && b.compareTo(e) != 0; )
+              if (b = b.modPowInt(2, this), b.compareTo(n.ONE) == 0) return !1;
+            if (b.compareTo(e) != 0) return !1;
+          }
+        }
+        return !0;
+      }
+      n.prototype.chunkSize = xe, n.prototype.toRadix = me, n.prototype.fromRadix = we, n.prototype.fromNumber = ye, n.prototype.bitwiseTo = Ee, n.prototype.changeBit = He, n.prototype.addTo = Ke, n.prototype.dMultiply = ke, n.prototype.dAddOffset = Qe, n.prototype.multiplyLowerTo = rr, n.prototype.multiplyUpperTo = ir, n.prototype.modInt = cr, n.prototype.millerRabin = dr, n.prototype.clone = Ct, n.prototype.intValue = xt, n.prototype.byteValue = ve, n.prototype.shortValue = de, n.prototype.signum = ge, n.prototype.toByteArray = be, n.prototype.equals = Te, n.prototype.min = Fe, n.prototype.max = Be, n.prototype.and = Se, n.prototype.or = Ie, n.prototype.xor = De, n.prototype.andNot = Me, n.prototype.not = Re, n.prototype.shiftLeft = qe, n.prototype.shiftRight = Ae, n.prototype.getLowestSetBit = Oe, n.prototype.bitCount = Ve, n.prototype.testBit = Le, n.prototype.setBit = Ne, n.prototype.clearBit = Ue, n.prototype.flipBit = ze, n.prototype.add = We, n.prototype.subtract = $e, n.prototype.multiply = Ze, n.prototype.divide = Ge, n.prototype.remainder = Ye, n.prototype.divideAndRemainder = Xe, n.prototype.modPow = ur, n.prototype.modInverse = lr, n.prototype.pow = er, n.prototype.gcd = hr, n.prototype.isProbablePrime = vr, n.prototype.square = Je, n.prototype.Barrett = dt;
+      var It, nt, Y;
+      function xr(t) {
+        nt[Y++] ^= t & 255, nt[Y++] ^= t >> 8 & 255, nt[Y++] ^= t >> 16 & 255, nt[Y++] ^= t >> 24 & 255, Y >= Ht && (Y -= Ht);
+      }
+      function Zt() {
+        xr((/* @__PURE__ */ new Date()).getTime());
+      }
+      if (nt == null) {
+        nt = new Array(), Y = 0;
+        var ht;
+        if (typeof window != "undefined" && window.crypto) {
+          if (window.crypto.getRandomValues) {
+            var Jt = new Uint8Array(32);
+            for (window.crypto.getRandomValues(Jt), ht = 0; ht < 32; ++ht)
+              nt[Y++] = Jt[ht];
+          } else if (navigator.appName == "Netscape" && navigator.appVersion < "5") {
+            var Gt = window.crypto.random(32);
+            for (ht = 0; ht < Gt.length; ++ht)
+              nt[Y++] = Gt.charCodeAt(ht) & 255;
+          }
+        }
+        for (; Y < Ht; )
+          ht = Math.floor(65536 * Math.random()), nt[Y++] = ht >>> 8, nt[Y++] = ht & 255;
+        Y = 0, Zt();
+      }
+      function gr() {
+        if (It == null) {
+          for (Zt(), It = br(), It.init(nt), Y = 0; Y < nt.length; ++Y)
+            nt[Y] = 0;
+          Y = 0;
+        }
+        return It.next();
+      }
+      function mr(t) {
+        var e;
+        for (e = 0; e < t.length; ++e) t[e] = gr();
+      }
+      function Yt() {
+      }
+      Yt.prototype.nextBytes = mr;
+      function Lt() {
+        this.i = 0, this.j = 0, this.S = new Array();
+      }
+      function wr(t) {
+        var e, r, i;
+        for (e = 0; e < 256; ++e)
+          this.S[e] = e;
+        for (r = 0, e = 0; e < 256; ++e)
+          r = r + this.S[e] + t[e % t.length] & 255, i = this.S[e], this.S[e] = this.S[r], this.S[r] = i;
+        this.i = 0, this.j = 0;
+      }
+      function yr() {
+        var t;
+        return this.i = this.i + 1 & 255, this.j = this.j + this.S[this.i] & 255, t = this.S[this.i], this.S[this.i] = this.S[this.j], this.S[this.j] = t, this.S[t + this.S[this.i] & 255];
+      }
+      Lt.prototype.init = wr, Lt.prototype.next = yr;
+      function br() {
+        return new Lt();
+      }
+      var Ht = 256;
+      u.exports = {
+        default: n,
+        BigInteger: n,
+        SecureRandom: Yt
+      };
+    }).call(Jr);
+  }(Rt)), Rt.exports;
 }
-function y(e) {
-  return h().getEnv(e);
+var Qt;
+function Yr() {
+  return Qt || (Qt = 1, function(u) {
+    u.exports = /******/
+    function(h) {
+      var A = {};
+      function q(y) {
+        if (A[y])
+          return A[y].exports;
+        var n = A[y] = {
+          /******/
+          i: y,
+          /******/
+          l: !1,
+          /******/
+          exports: {}
+          /******/
+        };
+        return h[y].call(n.exports, n, n.exports, q), n.l = !0, n.exports;
+      }
+      return q.m = h, q.c = A, q.d = function(y, n, p) {
+        q.o(y, n) || Object.defineProperty(y, n, { enumerable: !0, get: p });
+      }, q.r = function(y) {
+        typeof Symbol != "undefined" && Symbol.toStringTag && Object.defineProperty(y, Symbol.toStringTag, { value: "Module" }), Object.defineProperty(y, "__esModule", { value: !0 });
+      }, q.t = function(y, n) {
+        if (n & 1 && (y = q(y)), n & 8 || n & 4 && typeof y == "object" && y && y.__esModule) return y;
+        var p = /* @__PURE__ */ Object.create(null);
+        if (q.r(p), Object.defineProperty(p, "default", { enumerable: !0, value: y }), n & 2 && typeof y != "string") for (var $ in y) q.d(p, $, function(K) {
+          return y[K];
+        }.bind(null, $));
+        return p;
+      }, q.n = function(y) {
+        var n = y && y.__esModule ? (
+          /******/
+          function() {
+            return y.default;
+          }
+        ) : (
+          /******/
+          function() {
+            return y;
+          }
+        );
+        return q.d(n, "a", n), n;
+      }, q.o = function(y, n) {
+        return Object.prototype.hasOwnProperty.call(y, n);
+      }, q.p = "", q(q.s = 2);
+    }([
+      /* 0 */
+      /***/
+      function(h, A) {
+        h.exports = Gr();
+      },
+      /* 1 */
+      /***/
+      function(h, A, q) {
+        var y = new Uint32Array(68), n = new Uint32Array(64);
+        function p(g, o) {
+          var M = o & 31;
+          return g << M | g >>> 32 - M;
+        }
+        function $(g, o) {
+          for (var M = [], S = g.length - 1; S >= 0; S--)
+            M[S] = (g[S] ^ o[S]) & 255;
+          return M;
+        }
+        function K(g) {
+          return g ^ p(g, 9) ^ p(g, 17);
+        }
+        function D(g) {
+          return g ^ p(g, 15) ^ p(g, 23);
+        }
+        function N(g) {
+          var o = g.length * 8, M = o % 512;
+          M = M >= 448 ? 512 - M % 448 - 1 : 448 - M - 1;
+          for (var S = new Array((M - 7) / 8), s = new Array(8), x = 0, T = S.length; x < T; x++)
+            S[x] = 0;
+          for (var f = 0, w = s.length; f < w; f++)
+            s[f] = 0;
+          o = o.toString(2);
+          for (var v = 7; v >= 0; v--)
+            if (o.length > 8) {
+              var m = o.length - 8;
+              s[v] = parseInt(o.substr(m), 2), o = o.substr(0, m);
+            } else o.length > 0 && (s[v] = parseInt(o, 2), o = "");
+          for (var B = new Uint8Array([].concat(g, [128], S, s)), F = new DataView(B.buffer, 0), C = B.length / 64, R = new Uint32Array([1937774191, 1226093241, 388252375, 3666478592, 2842636476, 372324522, 3817729613, 2969243214]), O = 0; O < C; O++) {
+            y.fill(0), n.fill(0);
+            for (var U = 16 * O, H = 0; H < 16; H++)
+              y[H] = F.getUint32((U + H) * 4, !1);
+            for (var V = 16; V < 68; V++)
+              y[V] = D(y[V - 16] ^ y[V - 9] ^ p(y[V - 3], 15)) ^ p(y[V - 13], 7) ^ y[V - 6];
+            for (var L = 0; L < 64; L++)
+              n[L] = y[L] ^ y[L + 4];
+            for (var Z = 2043430169, J = 2055708042, z = R[0], k = R[1], G = R[2], Q = R[3], tt = R[4], rt = R[5], st = R[6], ut = R[7], gt = void 0, Ft = void 0, Bt = void 0, Et = void 0, Pt = void 0, it = 0; it < 64; it++)
+              Pt = it >= 0 && it <= 15 ? Z : J, gt = p(p(z, 12) + tt + p(Pt, it), 7), Ft = gt ^ p(z, 12), Bt = (it >= 0 && it <= 15 ? z ^ k ^ G : z & k | z & G | k & G) + Q + Ft + n[it], Et = (it >= 0 && it <= 15 ? tt ^ rt ^ st : tt & rt | ~tt & st) + ut + gt + y[it], Q = G, G = p(k, 9), k = z, z = Bt, ut = st, st = p(rt, 19), rt = tt, tt = K(Et);
+            R[0] ^= z, R[1] ^= k, R[2] ^= G, R[3] ^= Q, R[4] ^= tt, R[5] ^= rt, R[6] ^= st, R[7] ^= ut;
+          }
+          for (var St = [], mt = 0, Ct = R.length; mt < Ct; mt++) {
+            var xt = R[mt];
+            St.push((xt & 4278190080) >>> 24, (xt & 16711680) >>> 16, (xt & 65280) >>> 8, xt & 255);
+          }
+          return St;
+        }
+        for (var _ = 64, d = new Uint8Array(_), I = new Uint8Array(_), c = 0; c < _; c++)
+          d[c] = 54, I[c] = 92;
+        function P(g, o) {
+          for (o.length > _ && (o = N(o)); o.length < _; )
+            o.push(0);
+          var M = $(o, d), S = $(o, I), s = N([].concat(M, g));
+          return N([].concat(S, s));
+        }
+        h.exports = {
+          sm3: N,
+          hmac: P
+        };
+      },
+      /* 2 */
+      /***/
+      function(h, A, q) {
+        h.exports = {
+          sm2: q(3),
+          sm3: q(7),
+          sm4: q(8)
+        };
+      },
+      /* 3 */
+      /***/
+      function(h, A, q) {
+        var y = q(0), n = y.BigInteger, p = q(4), $ = p.encodeDer, K = p.decodeDer, D = q(5), N = q(1).sm3, _ = D.generateEcparam(), d = _.G, I = _.curve, c = _.n, P = 0;
+        function g(f, w) {
+          var v = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : 1;
+          f = typeof f == "string" ? D.hexToArray(D.utf8ToHex(f)) : Array.prototype.slice.call(f), w = D.getGlobalCurve().decodePointHex(w);
+          var m = D.generateKeyPairHex(), B = new n(m.privateKey, 16), F = m.publicKey;
+          F.length > 128 && (F = F.substr(F.length - 128));
+          var C = w.multiply(B), R = D.hexToArray(D.leftPad(C.getX().toBigInteger().toRadix(16), 64)), O = D.hexToArray(D.leftPad(C.getY().toBigInteger().toRadix(16), 64)), U = D.arrayToHex(N([].concat(R, f, O))), H = 1, V = 0, L = [], Z = [].concat(R, O), J = function() {
+            L = N([].concat(Z, [H >> 24 & 255, H >> 16 & 255, H >> 8 & 255, H & 255])), H++, V = 0;
+          };
+          J();
+          for (var z = 0, k = f.length; z < k; z++)
+            V === L.length && J(), f[z] ^= L[V++] & 255;
+          var G = D.arrayToHex(f);
+          return v === P ? F + G + U : F + U + G;
+        }
+        function o(f, w) {
+          var v = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : 1, m = arguments.length > 3 && arguments[3] !== void 0 ? arguments[3] : {}, B = m.output, F = B === void 0 ? "string" : B;
+          w = new n(w, 16);
+          var C = f.substr(128, 64), R = f.substr(192);
+          v === P && (C = f.substr(f.length - 64), R = f.substr(128, f.length - 128 - 64));
+          var O = D.hexToArray(R), U = D.getGlobalCurve().decodePointHex("04" + f.substr(0, 128)), H = U.multiply(w), V = D.hexToArray(D.leftPad(H.getX().toBigInteger().toRadix(16), 64)), L = D.hexToArray(D.leftPad(H.getY().toBigInteger().toRadix(16), 64)), Z = 1, J = 0, z = [], k = [].concat(V, L), G = function() {
+            z = N([].concat(k, [Z >> 24 & 255, Z >> 16 & 255, Z >> 8 & 255, Z & 255])), Z++, J = 0;
+          };
+          G();
+          for (var Q = 0, tt = O.length; Q < tt; Q++)
+            J === z.length && G(), O[Q] ^= z[J++] & 255;
+          var rt = D.arrayToHex(N([].concat(V, O, L)));
+          return rt === C.toLowerCase() ? F === "array" ? O : D.arrayToUtf8(O) : F === "array" ? [] : "";
+        }
+        function M(f, w) {
+          var v = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : {}, m = v.pointPool, B = v.der, F = v.hash, C = v.publicKey, R = v.userId, O = typeof f == "string" ? D.utf8ToHex(f) : D.arrayToHex(f);
+          F && (C = C || x(w), O = s(O, C, R));
+          var U = new n(w, 16), H = new n(O, 16), V = null, L = null, Z = null;
+          do {
+            do {
+              var J = void 0;
+              m && m.length ? J = m.pop() : J = T(), V = J.k, L = H.add(J.x1).mod(c);
+            } while (L.equals(n.ZERO) || L.add(V).equals(c));
+            Z = U.add(n.ONE).modInverse(c).multiply(V.subtract(L.multiply(U))).mod(c);
+          } while (Z.equals(n.ZERO));
+          return B ? $(L, Z) : D.leftPad(L.toString(16), 64) + D.leftPad(Z.toString(16), 64);
+        }
+        function S(f, w, v) {
+          var m = arguments.length > 3 && arguments[3] !== void 0 ? arguments[3] : {}, B = m.der, F = m.hash, C = m.userId, R = typeof f == "string" ? D.utf8ToHex(f) : D.arrayToHex(f);
+          F && (R = s(R, v, C));
+          var O = void 0, U = void 0;
+          if (B) {
+            var H = K(w);
+            O = H.r, U = H.s;
+          } else
+            O = new n(w.substring(0, 64), 16), U = new n(w.substring(64), 16);
+          var V = I.decodePointHex(v), L = new n(R, 16), Z = O.add(U).mod(c);
+          if (Z.equals(n.ZERO)) return !1;
+          var J = d.multiply(U).add(V.multiply(Z)), z = L.add(J.getX().toBigInteger()).mod(c);
+          return O.equals(z);
+        }
+        function s(f, w) {
+          var v = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : "1234567812345678";
+          v = D.utf8ToHex(v);
+          var m = D.leftPad(d.curve.a.toBigInteger().toRadix(16), 64), B = D.leftPad(d.curve.b.toBigInteger().toRadix(16), 64), F = D.leftPad(d.getX().toBigInteger().toRadix(16), 64), C = D.leftPad(d.getY().toBigInteger().toRadix(16), 64), R = void 0, O = void 0;
+          if (w.length === 128)
+            R = w.substr(0, 64), O = w.substr(64, 64);
+          else {
+            var U = d.curve.decodePointHex(w);
+            R = D.leftPad(U.getX().toBigInteger().toRadix(16), 64), O = D.leftPad(U.getY().toBigInteger().toRadix(16), 64);
+          }
+          var H = D.hexToArray(v + m + B + F + C + R + O), V = v.length * 4;
+          H.unshift(V & 255), H.unshift(V >> 8 & 255);
+          var L = N(H);
+          return D.arrayToHex(N(L.concat(D.hexToArray(f))));
+        }
+        function x(f) {
+          var w = d.multiply(new n(f, 16)), v = D.leftPad(w.getX().toBigInteger().toString(16), 64), m = D.leftPad(w.getY().toBigInteger().toString(16), 64);
+          return "04" + v + m;
+        }
+        function T() {
+          var f = D.generateKeyPairHex(), w = I.decodePointHex(f.publicKey);
+          return f.k = new n(f.privateKey, 16), f.x1 = w.getX().toBigInteger(), f;
+        }
+        h.exports = {
+          generateKeyPairHex: D.generateKeyPairHex,
+          compressPublicKeyHex: D.compressPublicKeyHex,
+          comparePublicKeyHex: D.comparePublicKeyHex,
+          doEncrypt: g,
+          doDecrypt: o,
+          doSignature: M,
+          doVerifySignature: S,
+          getPublicKeyFromPrivateKey: x,
+          getPoint: T,
+          verifyPublicKey: D.verifyPublicKey
+        };
+      },
+      /* 4 */
+      /***/
+      function(h, A, q) {
+        function y(g, o) {
+          if (!g)
+            throw new ReferenceError("this hasn't been initialised - super() hasn't been called");
+          return o && (typeof o == "object" || typeof o == "function") ? o : g;
+        }
+        function n(g, o) {
+          if (typeof o != "function" && o !== null)
+            throw new TypeError("Super expression must either be null or a function, not " + typeof o);
+          g.prototype = Object.create(o && o.prototype, { constructor: { value: g, enumerable: !1, writable: !0, configurable: !0 } }), o && (Object.setPrototypeOf ? Object.setPrototypeOf(g, o) : g.__proto__ = o);
+        }
+        function p(g, o) {
+          if (!(g instanceof o))
+            throw new TypeError("Cannot call a class as a function");
+        }
+        var $ = q(0), K = $.BigInteger;
+        function D(g) {
+          var o = g.toString(16);
+          if (o[0] !== "-")
+            o.length % 2 === 1 ? o = "0" + o : o.match(/^[0-7]/) || (o = "00" + o);
+          else {
+            o = o.substr(1);
+            var M = o.length;
+            M % 2 === 1 ? M += 1 : o.match(/^[0-7]/) || (M += 2);
+            for (var S = "", s = 0; s < M; s++)
+              S += "f";
+            S = new K(S, 16), o = S.xor(g).add(K.ONE), o = o.toString(16).replace(/^-/, "");
+          }
+          return o;
+        }
+        var N = function() {
+          function g() {
+            p(this, g), this.tlv = null, this.t = "00", this.l = "00", this.v = "";
+          }
+          return g.prototype.getEncodedHex = function() {
+            return this.tlv || (this.v = this.getValue(), this.l = this.getLength(), this.tlv = this.t + this.l + this.v), this.tlv;
+          }, g.prototype.getLength = function() {
+            var M = this.v.length / 2, S = M.toString(16);
+            if (S.length % 2 === 1 && (S = "0" + S), M < 128)
+              return S;
+            var s = 128 + S.length / 2;
+            return s.toString(16) + S;
+          }, g.prototype.getValue = function() {
+            return "";
+          }, g;
+        }(), _ = function(g) {
+          n(o, g);
+          function o(M) {
+            p(this, o);
+            var S = y(this, g.call(this));
+            return S.t = "02", M && (S.v = D(M)), S;
+          }
+          return o.prototype.getValue = function() {
+            return this.v;
+          }, o;
+        }(N), d = function(g) {
+          n(o, g);
+          function o(M) {
+            p(this, o);
+            var S = y(this, g.call(this));
+            return S.t = "30", S.asn1Array = M, S;
+          }
+          return o.prototype.getValue = function() {
+            return this.v = this.asn1Array.map(function(S) {
+              return S.getEncodedHex();
+            }).join(""), this.v;
+          }, o;
+        }(N);
+        function I(g, o) {
+          return +g[o + 2] < 8 ? 1 : +g.substr(o + 2, 2) & 128;
+        }
+        function c(g, o) {
+          var M = I(g, o), S = g.substr(o + 2, M * 2);
+          if (!S) return -1;
+          var s = +S[0] < 8 ? new K(S, 16) : new K(S.substr(2), 16);
+          return s.intValue();
+        }
+        function P(g, o) {
+          var M = I(g, o);
+          return o + (M + 1) * 2;
+        }
+        h.exports = {
+          /**
+           * ASN.1 der 编码，针对 sm2 签名
+           */
+          encodeDer: function(o, M) {
+            var S = new _(o), s = new _(M), x = new d([S, s]);
+            return x.getEncodedHex();
+          },
+          /**
+           * 解析 ASN.1 der，针对 sm2 验签
+           */
+          decodeDer: function(o) {
+            var M = P(o, 0), S = P(o, M), s = c(o, M), x = o.substr(S, s * 2), T = S + x.length, f = P(o, T), w = c(o, T), v = o.substr(f, w * 2), m = new K(x, 16), B = new K(v, 16);
+            return { r: m, s: B };
+          }
+        };
+      },
+      /* 5 */
+      /***/
+      function(h, A, q) {
+        var y = q(0), n = y.BigInteger, p = y.SecureRandom, $ = q(6), K = $.ECCurveFp, D = new p(), N = P(), _ = N.curve, d = N.G, I = N.n;
+        function c() {
+          return _;
+        }
+        function P() {
+          var v = new n("FFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF00000000FFFFFFFFFFFFFFFF", 16), m = new n("FFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF00000000FFFFFFFFFFFFFFFC", 16), B = new n("28E9FA9E9D9F5E344D5A9E4BCF6509A7F39789F515AB8F92DDBCBD414D940E93", 16), F = new K(v, m, B), C = "32C4AE2C1F1981195F9904466A39C9948FE30BBFF2660BE1715A4589334C74C7", R = "BC3736A2F4F6779C59BDCEE36B692153D0A9877CC62A474002DF32E52139F0A0", O = F.decodePointHex("04" + C + R), U = new n("FFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFF7203DF6B21C6052B53BBF40939D54123", 16);
+          return { curve: F, G: O, n: U };
+        }
+        function g(v, m, B) {
+          var F = v ? new n(v, m, B) : new n(I.bitLength(), D), C = F.mod(I.subtract(n.ONE)).add(n.ONE), R = S(C.toString(16), 64), O = d.multiply(C), U = S(O.getX().toBigInteger().toString(16), 64), H = S(O.getY().toBigInteger().toString(16), 64), V = "04" + U + H;
+          return { privateKey: R, publicKey: V };
+        }
+        function o(v) {
+          if (v.length !== 130) throw new Error("Invalid public key to compress");
+          var m = (v.length - 2) / 2, B = v.substr(2, m), F = new n(v.substr(m + 2, m), 16), C = "03";
+          return F.mod(new n("2")).equals(n.ZERO) && (C = "02"), C + B;
+        }
+        function M(v) {
+          v = unescape(encodeURIComponent(v));
+          for (var m = v.length, B = [], F = 0; F < m; F++)
+            B[F >>> 2] |= (v.charCodeAt(F) & 255) << 24 - F % 4 * 8;
+          for (var C = [], R = 0; R < m; R++) {
+            var O = B[R >>> 2] >>> 24 - R % 4 * 8 & 255;
+            C.push((O >>> 4).toString(16)), C.push((O & 15).toString(16));
+          }
+          return C.join("");
+        }
+        function S(v, m) {
+          return v.length >= m ? v : new Array(m - v.length + 1).join("0") + v;
+        }
+        function s(v) {
+          return v.map(function(m) {
+            return m = m.toString(16), m.length === 1 ? "0" + m : m;
+          }).join("");
+        }
+        function x(v) {
+          for (var m = [], B = 0, F = 0; F < v.length * 2; F += 2)
+            m[F >>> 3] |= parseInt(v[B], 10) << 24 - F % 8 * 4, B++;
+          try {
+            for (var C = [], R = 0; R < v.length; R++) {
+              var O = m[R >>> 2] >>> 24 - R % 4 * 8 & 255;
+              C.push(String.fromCharCode(O));
+            }
+            return decodeURIComponent(escape(C.join("")));
+          } catch (U) {
+            throw new Error("Malformed UTF-8 data");
+          }
+        }
+        function T(v) {
+          var m = [], B = v.length;
+          B % 2 !== 0 && (v = S(v, B + 1)), B = v.length;
+          for (var F = 0; F < B; F += 2)
+            m.push(parseInt(v.substr(F, 2), 16));
+          return m;
+        }
+        function f(v) {
+          var m = _.decodePointHex(v);
+          if (!m) return !1;
+          var B = m.getX(), F = m.getY();
+          return F.square().equals(B.multiply(B.square()).add(B.multiply(_.a)).add(_.b));
+        }
+        function w(v, m) {
+          var B = _.decodePointHex(v);
+          if (!B) return !1;
+          var F = _.decodePointHex(m);
+          return F ? B.equals(F) : !1;
+        }
+        h.exports = {
+          getGlobalCurve: c,
+          generateEcparam: P,
+          generateKeyPairHex: g,
+          compressPublicKeyHex: o,
+          utf8ToHex: M,
+          leftPad: S,
+          arrayToHex: s,
+          arrayToUtf8: x,
+          hexToArray: T,
+          verifyPublicKey: f,
+          comparePublicKeyHex: w
+        };
+      },
+      /* 6 */
+      /***/
+      function(h, A, q) {
+        function y(d, I) {
+          if (!(d instanceof I))
+            throw new TypeError("Cannot call a class as a function");
+        }
+        var n = q(0), p = n.BigInteger, $ = new p("2"), K = new p("3"), D = function() {
+          function d(I, c) {
+            y(this, d), this.x = c, this.q = I;
+          }
+          return d.prototype.equals = function(c) {
+            return c === this ? !0 : this.q.equals(c.q) && this.x.equals(c.x);
+          }, d.prototype.toBigInteger = function() {
+            return this.x;
+          }, d.prototype.negate = function() {
+            return new d(this.q, this.x.negate().mod(this.q));
+          }, d.prototype.add = function(c) {
+            return new d(this.q, this.x.add(c.toBigInteger()).mod(this.q));
+          }, d.prototype.subtract = function(c) {
+            return new d(this.q, this.x.subtract(c.toBigInteger()).mod(this.q));
+          }, d.prototype.multiply = function(c) {
+            return new d(this.q, this.x.multiply(c.toBigInteger()).mod(this.q));
+          }, d.prototype.divide = function(c) {
+            return new d(this.q, this.x.multiply(c.toBigInteger().modInverse(this.q)).mod(this.q));
+          }, d.prototype.square = function() {
+            return new d(this.q, this.x.square().mod(this.q));
+          }, d;
+        }(), N = function() {
+          function d(I, c, P, g) {
+            y(this, d), this.curve = I, this.x = c, this.y = P, this.z = g == null ? p.ONE : g, this.zinv = null;
+          }
+          return d.prototype.getX = function() {
+            return this.zinv === null && (this.zinv = this.z.modInverse(this.curve.q)), this.curve.fromBigInteger(this.x.toBigInteger().multiply(this.zinv).mod(this.curve.q));
+          }, d.prototype.getY = function() {
+            return this.zinv === null && (this.zinv = this.z.modInverse(this.curve.q)), this.curve.fromBigInteger(this.y.toBigInteger().multiply(this.zinv).mod(this.curve.q));
+          }, d.prototype.equals = function(c) {
+            if (c === this) return !0;
+            if (this.isInfinity()) return c.isInfinity();
+            if (c.isInfinity()) return this.isInfinity();
+            var P = c.y.toBigInteger().multiply(this.z).subtract(this.y.toBigInteger().multiply(c.z)).mod(this.curve.q);
+            if (!P.equals(p.ZERO)) return !1;
+            var g = c.x.toBigInteger().multiply(this.z).subtract(this.x.toBigInteger().multiply(c.z)).mod(this.curve.q);
+            return g.equals(p.ZERO);
+          }, d.prototype.isInfinity = function() {
+            return this.x === null && this.y === null ? !0 : this.z.equals(p.ZERO) && !this.y.toBigInteger().equals(p.ZERO);
+          }, d.prototype.negate = function() {
+            return new d(this.curve, this.x, this.y.negate(), this.z);
+          }, d.prototype.add = function(c) {
+            if (this.isInfinity()) return c;
+            if (c.isInfinity()) return this;
+            var P = this.x.toBigInteger(), g = this.y.toBigInteger(), o = this.z, M = c.x.toBigInteger(), S = c.y.toBigInteger(), s = c.z, x = this.curve.q, T = P.multiply(s).mod(x), f = M.multiply(o).mod(x), w = T.subtract(f), v = g.multiply(s).mod(x), m = S.multiply(o).mod(x), B = v.subtract(m);
+            if (p.ZERO.equals(w))
+              return p.ZERO.equals(B) ? this.twice() : this.curve.infinity;
+            var F = T.add(f), C = o.multiply(s).mod(x), R = w.square().mod(x), O = w.multiply(R).mod(x), U = C.multiply(B.square()).subtract(F.multiply(R)).mod(x), H = w.multiply(U).mod(x), V = B.multiply(R.multiply(T).subtract(U)).subtract(v.multiply(O)).mod(x), L = O.multiply(C).mod(x);
+            return new d(this.curve, this.curve.fromBigInteger(H), this.curve.fromBigInteger(V), L);
+          }, d.prototype.twice = function() {
+            if (this.isInfinity()) return this;
+            if (!this.y.toBigInteger().signum()) return this.curve.infinity;
+            var c = this.x.toBigInteger(), P = this.y.toBigInteger(), g = this.z, o = this.curve.q, M = this.curve.a.toBigInteger(), S = c.square().multiply(K).add(M.multiply(g.square())).mod(o), s = P.shiftLeft(1).multiply(g).mod(o), x = P.square().mod(o), T = x.multiply(c).multiply(g).mod(o), f = s.square().mod(o), w = S.square().subtract(T.shiftLeft(3)).mod(o), v = s.multiply(w).mod(o), m = S.multiply(T.shiftLeft(2).subtract(w)).subtract(f.shiftLeft(1).multiply(x)).mod(o), B = s.multiply(f).mod(o);
+            return new d(this.curve, this.curve.fromBigInteger(v), this.curve.fromBigInteger(m), B);
+          }, d.prototype.multiply = function(c) {
+            if (this.isInfinity()) return this;
+            if (!c.signum()) return this.curve.infinity;
+            for (var P = c.multiply(K), g = this.negate(), o = this, M = P.bitLength() - 2; M > 0; M--) {
+              o = o.twice();
+              var S = P.testBit(M), s = c.testBit(M);
+              S !== s && (o = o.add(S ? this : g));
+            }
+            return o;
+          }, d;
+        }(), _ = function() {
+          function d(I, c, P) {
+            y(this, d), this.q = I, this.a = this.fromBigInteger(c), this.b = this.fromBigInteger(P), this.infinity = new N(this, null, null);
+          }
+          return d.prototype.equals = function(c) {
+            return c === this ? !0 : this.q.equals(c.q) && this.a.equals(c.a) && this.b.equals(c.b);
+          }, d.prototype.fromBigInteger = function(c) {
+            return new D(this.q, c);
+          }, d.prototype.decodePointHex = function(c) {
+            switch (parseInt(c.substr(0, 2), 16)) {
+              // 第一个字节
+              case 0:
+                return this.infinity;
+              case 2:
+              case 3:
+                var P = this.fromBigInteger(new p(c.substr(2), 16)), g = this.fromBigInteger(P.multiply(P.square()).add(P.multiply(this.a)).add(this.b).toBigInteger().modPow(this.q.divide(new p("4")).add(p.ONE), this.q));
+                return g.toBigInteger().mod($).equals(new p(c.substr(0, 2), 16).subtract($)) || (g = g.negate()), new N(this, P, g);
+              case 4:
+              case 6:
+              case 7:
+                var o = (c.length - 2) / 2, M = c.substr(2, o), S = c.substr(o + 2, o);
+                return new N(this, this.fromBigInteger(new p(M, 16)), this.fromBigInteger(new p(S, 16)));
+              default:
+                return null;
+            }
+          }, d;
+        }();
+        h.exports = {
+          ECPointFp: N,
+          ECCurveFp: _
+        };
+      },
+      /* 7 */
+      /***/
+      function(h, A, q) {
+        var y = q(1), n = y.sm3, p = y.hmac;
+        function $(_, d) {
+          return _.length >= d ? _ : new Array(d - _.length + 1).join("0") + _;
+        }
+        function K(_) {
+          return _.map(function(d) {
+            return d = d.toString(16), d.length === 1 ? "0" + d : d;
+          }).join("");
+        }
+        function D(_) {
+          var d = [], I = _.length;
+          I % 2 !== 0 && (_ = $(_, I + 1)), I = _.length;
+          for (var c = 0; c < I; c += 2)
+            d.push(parseInt(_.substr(c, 2), 16));
+          return d;
+        }
+        function N(_) {
+          for (var d = [], I = 0, c = _.length; I < c; I++) {
+            var P = _.codePointAt(I);
+            if (P <= 127)
+              d.push(P);
+            else if (P <= 2047)
+              d.push(192 | P >>> 6), d.push(128 | P & 63);
+            else if (P <= 55295 || P >= 57344 && P <= 65535)
+              d.push(224 | P >>> 12), d.push(128 | P >>> 6 & 63), d.push(128 | P & 63);
+            else if (P >= 65536 && P <= 1114111)
+              I++, d.push(240 | P >>> 18 & 28), d.push(128 | P >>> 12 & 63), d.push(128 | P >>> 6 & 63), d.push(128 | P & 63);
+            else
+              throw d.push(P), new Error("input is not supported");
+          }
+          return d;
+        }
+        h.exports = function(_, d) {
+          if (_ = typeof _ == "string" ? N(_) : Array.prototype.slice.call(_), d) {
+            var I = d.mode || "hmac";
+            if (I !== "hmac") throw new Error("invalid mode");
+            var c = d.key;
+            if (!c) throw new Error("invalid key");
+            return c = typeof c == "string" ? D(c) : Array.prototype.slice.call(c), K(p(_, c));
+          }
+          return K(n(_));
+        };
+      },
+      /* 8 */
+      /***/
+      function(h, A, q) {
+        var y = 0, n = 32, p = 16, $ = [214, 144, 233, 254, 204, 225, 61, 183, 22, 182, 20, 194, 40, 251, 44, 5, 43, 103, 154, 118, 42, 190, 4, 195, 170, 68, 19, 38, 73, 134, 6, 153, 156, 66, 80, 244, 145, 239, 152, 122, 51, 84, 11, 67, 237, 207, 172, 98, 228, 179, 28, 169, 201, 8, 232, 149, 128, 223, 148, 250, 117, 143, 63, 166, 71, 7, 167, 252, 243, 115, 23, 186, 131, 89, 60, 25, 230, 133, 79, 168, 104, 107, 129, 178, 113, 100, 218, 139, 248, 235, 15, 75, 112, 86, 157, 53, 30, 36, 14, 94, 99, 88, 209, 162, 37, 34, 124, 59, 1, 33, 120, 135, 212, 0, 70, 87, 159, 211, 39, 82, 76, 54, 2, 231, 160, 196, 200, 158, 234, 191, 138, 210, 64, 199, 56, 181, 163, 247, 242, 206, 249, 97, 21, 161, 224, 174, 93, 164, 155, 52, 26, 85, 173, 147, 50, 48, 245, 140, 177, 227, 29, 246, 226, 46, 130, 102, 202, 96, 192, 41, 35, 171, 13, 83, 78, 111, 213, 219, 55, 69, 222, 253, 142, 47, 3, 255, 106, 114, 109, 108, 91, 81, 141, 27, 175, 146, 187, 221, 188, 127, 17, 217, 92, 65, 31, 16, 90, 216, 10, 193, 49, 136, 165, 205, 123, 189, 45, 116, 208, 18, 184, 229, 180, 176, 137, 105, 151, 74, 12, 150, 119, 126, 101, 185, 241, 9, 197, 110, 198, 132, 24, 240, 125, 236, 58, 220, 77, 32, 121, 238, 95, 62, 215, 203, 57, 72], K = [462357, 472066609, 943670861, 1415275113, 1886879365, 2358483617, 2830087869, 3301692121, 3773296373, 4228057617, 404694573, 876298825, 1347903077, 1819507329, 2291111581, 2762715833, 3234320085, 3705924337, 4177462797, 337322537, 808926789, 1280531041, 1752135293, 2223739545, 2695343797, 3166948049, 3638552301, 4110090761, 269950501, 741554753, 1213159005, 1684763257];
+        function D(s) {
+          for (var x = [], T = 0, f = s.length; T < f; T += 2)
+            x.push(parseInt(s.substr(T, 2), 16));
+          return x;
+        }
+        function N(s) {
+          return s.map(function(x) {
+            return x = x.toString(16), x.length === 1 ? "0" + x : x;
+          }).join("");
+        }
+        function _(s) {
+          for (var x = [], T = 0, f = s.length; T < f; T++) {
+            var w = s.codePointAt(T);
+            if (w <= 127)
+              x.push(w);
+            else if (w <= 2047)
+              x.push(192 | w >>> 6), x.push(128 | w & 63);
+            else if (w <= 55295 || w >= 57344 && w <= 65535)
+              x.push(224 | w >>> 12), x.push(128 | w >>> 6 & 63), x.push(128 | w & 63);
+            else if (w >= 65536 && w <= 1114111)
+              T++, x.push(240 | w >>> 18 & 28), x.push(128 | w >>> 12 & 63), x.push(128 | w >>> 6 & 63), x.push(128 | w & 63);
+            else
+              throw x.push(w), new Error("input is not supported");
+          }
+          return x;
+        }
+        function d(s) {
+          for (var x = [], T = 0, f = s.length; T < f; T++)
+            s[T] >= 240 && s[T] <= 247 ? (x.push(String.fromCodePoint(((s[T] & 7) << 18) + ((s[T + 1] & 63) << 12) + ((s[T + 2] & 63) << 6) + (s[T + 3] & 63))), T += 3) : s[T] >= 224 && s[T] <= 239 ? (x.push(String.fromCodePoint(((s[T] & 15) << 12) + ((s[T + 1] & 63) << 6) + (s[T + 2] & 63))), T += 2) : s[T] >= 192 && s[T] <= 223 ? (x.push(String.fromCodePoint(((s[T] & 31) << 6) + (s[T + 1] & 63))), T++) : x.push(String.fromCodePoint(s[T]));
+          return x.join("");
+        }
+        function I(s, x) {
+          var T = x & 31;
+          return s << T | s >>> 32 - T;
+        }
+        function c(s) {
+          return ($[s >>> 24 & 255] & 255) << 24 | ($[s >>> 16 & 255] & 255) << 16 | ($[s >>> 8 & 255] & 255) << 8 | $[s & 255] & 255;
+        }
+        function P(s) {
+          return s ^ I(s, 2) ^ I(s, 10) ^ I(s, 18) ^ I(s, 24);
+        }
+        function g(s) {
+          return s ^ I(s, 13) ^ I(s, 23);
+        }
+        function o(s, x, T) {
+          for (var f = new Array(4), w = new Array(4), v = 0; v < 4; v++)
+            w[0] = s[4 * v] & 255, w[1] = s[4 * v + 1] & 255, w[2] = s[4 * v + 2] & 255, w[3] = s[4 * v + 3] & 255, f[v] = w[0] << 24 | w[1] << 16 | w[2] << 8 | w[3];
+          for (var m = 0, B; m < 32; m += 4)
+            B = f[1] ^ f[2] ^ f[3] ^ T[m + 0], f[0] ^= P(c(B)), B = f[2] ^ f[3] ^ f[0] ^ T[m + 1], f[1] ^= P(c(B)), B = f[3] ^ f[0] ^ f[1] ^ T[m + 2], f[2] ^= P(c(B)), B = f[0] ^ f[1] ^ f[2] ^ T[m + 3], f[3] ^= P(c(B));
+          for (var F = 0; F < 16; F += 4)
+            x[F] = f[3 - F / 4] >>> 24 & 255, x[F + 1] = f[3 - F / 4] >>> 16 & 255, x[F + 2] = f[3 - F / 4] >>> 8 & 255, x[F + 3] = f[3 - F / 4] & 255;
+        }
+        function M(s, x, T) {
+          for (var f = new Array(4), w = new Array(4), v = 0; v < 4; v++)
+            w[0] = s[0 + 4 * v] & 255, w[1] = s[1 + 4 * v] & 255, w[2] = s[2 + 4 * v] & 255, w[3] = s[3 + 4 * v] & 255, f[v] = w[0] << 24 | w[1] << 16 | w[2] << 8 | w[3];
+          f[0] ^= 2746333894, f[1] ^= 1453994832, f[2] ^= 1736282519, f[3] ^= 2993693404;
+          for (var m = 0, B; m < 32; m += 4)
+            B = f[1] ^ f[2] ^ f[3] ^ K[m + 0], x[m + 0] = f[0] ^= g(c(B)), B = f[2] ^ f[3] ^ f[0] ^ K[m + 1], x[m + 1] = f[1] ^= g(c(B)), B = f[3] ^ f[0] ^ f[1] ^ K[m + 2], x[m + 2] = f[2] ^= g(c(B)), B = f[0] ^ f[1] ^ f[2] ^ K[m + 3], x[m + 3] = f[3] ^= g(c(B));
+          if (T === y)
+            for (var F = 0, C; F < 16; F++)
+              C = x[F], x[F] = x[31 - F], x[31 - F] = C;
+        }
+        function S(s, x, T) {
+          var f = arguments.length > 3 && arguments[3] !== void 0 ? arguments[3] : {}, w = f.padding, v = w === void 0 ? "pkcs#7" : w, m = f.mode, B = f.iv, F = B === void 0 ? [] : B, C = f.output, R = C === void 0 ? "string" : C;
+          if (m === "cbc" && (typeof F == "string" && (F = D(F)), F.length !== 128 / 8))
+            throw new Error("iv is invalid");
+          if (typeof x == "string" && (x = D(x)), x.length !== 128 / 8)
+            throw new Error("key is invalid");
+          if (typeof s == "string" ? T !== y ? s = _(s) : s = D(s) : s = [].concat(s), (v === "pkcs#5" || v === "pkcs#7") && T !== y)
+            for (var O = p - s.length % p, U = 0; U < O; U++)
+              s.push(O);
+          var H = new Array(n);
+          M(x, H, T);
+          for (var V = [], L = F, Z = s.length, J = 0; Z >= p; ) {
+            var z = s.slice(J, J + 16), k = new Array(16);
+            if (m === "cbc")
+              for (var G = 0; G < p; G++)
+                T !== y && (z[G] ^= L[G]);
+            o(z, k, H);
+            for (var Q = 0; Q < p; Q++)
+              m === "cbc" && T === y && (k[Q] ^= L[Q]), V[J + Q] = k[Q];
+            m === "cbc" && (T !== y ? L = k : L = z), Z -= p, J += p;
+          }
+          if ((v === "pkcs#5" || v === "pkcs#7") && T === y) {
+            for (var tt = V.length, rt = V[tt - 1], st = 1; st <= rt; st++)
+              if (V[tt - st] !== rt) throw new Error("padding is invalid");
+            V.splice(tt - rt, rt);
+          }
+          return R !== "array" ? T !== y ? N(V) : d(V) : V;
+        }
+        h.exports = {
+          encrypt: function(x, T, f) {
+            return S(x, T, 1, f);
+          },
+          decrypt: function(x, T, f) {
+            return S(x, T, 0, f);
+          }
+        };
+      }
+      /******/
+    ]);
+  }(Ut)), Ut.exports;
 }
-typeof window != "undefined" && (document.readyState === "complete" || document.readyState === "interactive" ? setTimeout(() => g(), 0) : document.addEventListener("DOMContentLoaded", () => {
-  g();
+var j = Yr();
+const Xr = (u) => j.sm2.generateKeyPairHex(u), kr = (u, h, A = 1, q) => j.sm2.doEncrypt(u, h, A, q), Qr = (u, h, A = 1, q) => j.sm2.doDecrypt(u, h, A, q), jr = (u, h, A) => j.sm2.doSignature(u, h, A), ti = (u, h, A, q) => j.sm2.doVerifySignature(u, h, A, q), ei = (u) => j.sm2.getPublicKeyFromPrivateKey(u), ri = () => j.sm2.getPoint(), ii = (u) => j.sm2.compressPublicKeyHex(u), ni = (u, h) => j.sm2.comparePublicKeyHex(u, h), oi = (u) => j.sm2.verifyPublicKey(u), si = (u, h) => j.sm3(u, h), ai = (u, h, A) => j.sm4.encrypt(u, h, A), fi = (u, h, A) => j.sm4.decrypt(u, h, A), ui = { sm2: j.sm2, sm3: j.sm3, sm4: j.sm4 };
+var hi = {
+  sm2GenerateKeyPair: Xr,
+  sm2Encrypt: kr,
+  sm2Decrypt: Qr,
+  sm2Sign: jr,
+  sm2Verify: ti,
+  sm2GetPublicKey: ei,
+  sm2GetPoint: ri,
+  sm2CompressPublicKey: ii,
+  sm2ComparePublicKey: ni,
+  sm2VerifyPublicKey: oi,
+  sm3Hash: si,
+  sm4Encrypt: ai,
+  sm4Decrypt: fi,
+  __raw__: ui
+};
+typeof window != "undefined" && (document.readyState === "complete" || document.readyState === "interactive" ? setTimeout(() => zt(), 0) : document.addEventListener("DOMContentLoaded", () => {
+  zt();
 }));
-const a = {
+const bt = {
   // 导航 API
-  navigateTo: T,
-  navigateBack: M,
-  switchTab: I,
-  reLaunch: b,
-  redirectTo: S,
+  navigateTo: se,
+  navigateBack: ae,
+  switchTab: fe,
+  reLaunch: ue,
+  redirectTo: he,
   // 消息 API
-  postMessage: B,
-  getEnv: y,
+  postMessage: le,
+  getEnv: pe,
+  // 加密 API
+  crypto: hi,
   // 环境信息
-  environment: v,
+  environment: re,
   // 等待桥接准备就绪
-  ready: N,
+  ready: Sr,
   // 添加手动初始化方法（供需要手动控制的场景使用）
-  init: g,
+  init: zt,
   // WebView 对象（兼容旧版本）
   webView: null
 };
-v.isWeixinMiniProgram ? a.webView = window.wx && window.wx.miniProgram : a.webView = {
-  navigateTo: T,
-  navigateBack: M,
-  switchTab: I,
-  reLaunch: b,
-  redirectTo: S,
-  postMessage: B,
-  getEnv: y
+re.isWeixinMiniProgram ? bt.webView = window.wx && window.wx.miniProgram : bt.webView = {
+  navigateTo: se,
+  navigateBack: ae,
+  switchTab: fe,
+  reLaunch: ue,
+  redirectTo: he,
+  postMessage: le,
+  getEnv: pe
 };
-const _ = typeof window.uni != "undefined" ? window.uni : {};
-Object.keys(_).forEach((e) => {
-  a.hasOwnProperty(e) || (a[e] = _[e]);
+const jt = typeof window.uni != "undefined" ? window.uni : {};
+Object.keys(jt).forEach((u) => {
+  bt.hasOwnProperty(u) || (bt[u] = jt[u]);
 });
-typeof window != "undefined" && (window.qsh = a);
+typeof window != "undefined" && (window.qsh = bt);
 export {
-  a as default
+  bt as default
 };
 //# sourceMappingURL=uni-webview.es.js.map