@vope/utils 1.4.32 → 1.5.0

package/cjs/index.js

@@ -58,10 +58,8 @@ var require_localforage = __commonJS({
           if (!n[o2]) {
             if (!t[o2]) {
               var a = typeof require == "function" && require;
-              if (!u && a)
-                return a(o2, true);
-              if (i)
-                return i(o2, true);
+              if (!u && a) return a(o2, true);
+              if (i) return i(o2, true);
               var f = new Error("Cannot find module '" + o2 + "'");
               throw f.code = "MODULE_NOT_FOUND", f;
             }
@@ -74,8 +72,7 @@ var require_localforage = __commonJS({
           return n[o2].exports;
         }
         var i = typeof require == "function" && require;
-        for (var o = 0; o < r.length; o++)
-          s(r[o]);
+        for (var o = 0; o < r.length; o++) s(r[o]);
         return s;
       }({ 1: [function(_dereq_, module4, exports3) {
         (function(global2) {
@@ -2187,12 +2184,9 @@ var require_jsbn = __commonJS({
       var j_lm = (canary & 16777215) == 15715070;
       function BigInteger(a, b, c) {
         if (a != null)
-          if ("number" == typeof a)
-            this.fromNumber(a, b, c);
-          else if (b == null && "string" != typeof a)
-            this.fromString(a, 256);
-          else
-            this.fromString(a, b);
+          if ("number" == typeof a) this.fromNumber(a, b, c);
+          else if (b == null && "string" != typeof a) this.fromString(a, 256);
+          else this.fromString(a, b);
       }
       function nbi() {
         return new BigInteger(null);
@@ -2251,14 +2245,11 @@ var require_jsbn = __commonJS({
       var BI_RC = new Array();
       var rr, vv;
       rr = "0".charCodeAt(0);
-      for (vv = 0; vv <= 9; ++vv)
-        BI_RC[rr++] = vv;
+      for (vv = 0; vv <= 9; ++vv) BI_RC[rr++] = vv;
       rr = "a".charCodeAt(0);
-      for (vv = 10; vv < 36; ++vv)
-        BI_RC[rr++] = vv;
+      for (vv = 10; vv < 36; ++vv) BI_RC[rr++] = vv;
       rr = "A".charCodeAt(0);
-      for (vv = 10; vv < 36; ++vv)
-        BI_RC[rr++] = vv;
+      for (vv = 10; vv < 36; ++vv) BI_RC[rr++] = vv;
       function int2char(n) {
         return BI_RM.charAt(n);
       }
@@ -2267,20 +2258,16 @@ var require_jsbn = __commonJS({
         return c == null ? -1 : c;
       }
       function bnpCopyTo(r) {
-        for (var i = this.t - 1; i >= 0; --i)
-          r[i] = this[i];
+        for (var i = this.t - 1; i >= 0; --i) r[i] = this[i];
         r.t = this.t;
         r.s = this.s;
       }
       function bnpFromInt(x) {
         this.t = 1;
         this.s = x < 0 ? -1 : 0;
-        if (x > 0)
-          this[0] = x;
-        else if (x < -1)
-          this[0] = x + this.DV;
-        else
-          this.t = 0;
+        if (x > 0) this[0] = x;
+        else if (x < -1) this[0] = x + this.DV;
+        else this.t = 0;
       }
       function nbv(i) {
         var r = nbi();
@@ -2289,18 +2276,12 @@ var require_jsbn = __commonJS({
       }
       function bnpFromString(s, b) {
         var k;
-        if (b == 16)
-          k = 4;
-        else if (b == 8)
-          k = 3;
-        else if (b == 256)
-          k = 8;
-        else if (b == 2)
-          k = 1;
-        else if (b == 32)
-          k = 5;
-        else if (b == 4)
-          k = 2;
+        if (b == 16) k = 4;
+        else if (b == 8) k = 3;
+        else if (b == 256) k = 8;
+        else if (b == 2) k = 1;
+        else if (b == 32) k = 5;
+        else if (b == 4) k = 2;
         else {
           this.fromRadix(s, b);
           return;
@@ -2311,8 +2292,7 @@ var require_jsbn = __commonJS({
         while (--i >= 0) {
           var x = k == 8 ? s[i] & 255 : intAt(s, i);
           if (x < 0) {
-            if (s.charAt(i) == "-")
-              mi = true;
+            if (s.charAt(i) == "-") mi = true;
             continue;
           }
           mi = false;
@@ -2324,39 +2304,28 @@ var require_jsbn = __commonJS({
           } else
             this[this.t - 1] |= x << sh;
           sh += k;
-          if (sh >= this.DB)
-            sh -= this.DB;
+          if (sh >= this.DB) sh -= this.DB;
         }
         if (k == 8 && (s[0] & 128) != 0) {
           this.s = -1;
-          if (sh > 0)
-            this[this.t - 1] |= (1 << this.DB - sh) - 1 << sh;
+          if (sh > 0) this[this.t - 1] |= (1 << this.DB - sh) - 1 << sh;
         }
         this.clamp();
-        if (mi)
-          BigInteger.ZERO.subTo(this, this);
+        if (mi) BigInteger.ZERO.subTo(this, this);
       }
       function bnpClamp() {
         var c = this.s & this.DM;
-        while (this.t > 0 && this[this.t - 1] == c)
-          --this.t;
+        while (this.t > 0 && this[this.t - 1] == c) --this.t;
       }
       function bnToString(b) {
-        if (this.s < 0)
-          return "-" + this.negate().toString(b);
+        if (this.s < 0) return "-" + this.negate().toString(b);
         var k;
-        if (b == 16)
-          k = 4;
-        else if (b == 8)
-          k = 3;
-        else if (b == 2)
-          k = 1;
-        else if (b == 32)
-          k = 5;
-        else if (b == 4)
-          k = 2;
-        else
-          return this.toRadix(b);
+        if (b == 16) k = 4;
+        else if (b == 8) k = 3;
+        else if (b == 2) k = 1;
+        else if (b == 32) k = 5;
+        else if (b == 4) k = 2;
+        else return this.toRadix(b);
         var km = (1 << k) - 1, d, m = false, r = "", i = this.t;
         var p = this.DB - i * this.DB % k;
         if (i-- > 0) {
@@ -2375,10 +2344,8 @@ var require_jsbn = __commonJS({
                 --i;
               }
             }
-            if (d > 0)
-              m = true;
-            if (m)
-              r += int2char(d);
+            if (d > 0) m = true;
+            if (m) r += int2char(d);
           }
         }
         return m ? r : "0";
@@ -2393,15 +2360,11 @@ var require_jsbn = __commonJS({
       }
       function bnCompareTo(a) {
         var r = this.s - a.s;
-        if (r != 0)
-          return r;
+        if (r != 0) return r;
         var i = this.t;
         r = i - a.t;
-        if (r != 0)
-          return this.s < 0 ? -r : r;
-        while (--i >= 0)
-          if ((r = this[i] - a[i]) != 0)
-            return r;
+        if (r != 0) return this.s < 0 ? -r : r;
+        while (--i >= 0) if ((r = this[i] - a[i]) != 0) return r;
         return 0;
       }
       function nbits(x) {
@@ -2429,22 +2392,18 @@ var require_jsbn = __commonJS({
         return r;
       }
       function bnBitLength() {
-        if (this.t <= 0)
-          return 0;
+        if (this.t <= 0) return 0;
         return this.DB * (this.t - 1) + nbits(this[this.t - 1] ^ this.s & this.DM);
       }
       function bnpDLShiftTo(n, r) {
         var i;
-        for (i = this.t - 1; i >= 0; --i)
-          r[i + n] = this[i];
-        for (i = n - 1; i >= 0; --i)
-          r[i] = 0;
+        for (i = this.t - 1; i >= 0; --i) r[i + n] = this[i];
+        for (i = n - 1; i >= 0; --i) r[i] = 0;
         r.t = this.t + n;
         r.s = this.s;
       }
       function bnpDRShiftTo(n, r) {
-        for (var i = n; i < this.t; ++i)
-          r[i - n] = this[i];
+        for (var i = n; i < this.t; ++i) r[i - n] = this[i];
         r.t = Math.max(this.t - n, 0);
         r.s = this.s;
       }
@@ -2457,8 +2416,7 @@ var require_jsbn = __commonJS({
           r[i + ds + 1] = this[i] >> cbs | c;
           c = (this[i] & bm) << bs;
         }
-        for (i = ds - 1; i >= 0; --i)
-          r[i] = 0;
+        for (i = ds - 1; i >= 0; --i) r[i] = 0;
         r[ds] = c;
         r.t = this.t + ds + 1;
         r.s = this.s;
@@ -2479,8 +2437,7 @@ var require_jsbn = __commonJS({
           r[i - ds - 1] |= (this[i] & bm) << cbs;
           r[i - ds] = this[i] >> bs;
         }
-        if (bs > 0)
-          r[this.t - ds - 1] |= (this.s & bm) << cbs;
+        if (bs > 0) r[this.t - ds - 1] |= (this.s & bm) << cbs;
         r.t = this.t - ds;
         r.clamp();
       }
@@ -2509,10 +2466,8 @@ var require_jsbn = __commonJS({
           c -= a.s;
         }
         r.s = c < 0 ? -1 : 0;
-        if (c < -1)
-          r[i++] = this.DV + c;
-        else if (c > 0)
-          r[i++] = c;
+        if (c < -1) r[i++] = this.DV + c;
+        else if (c > 0) r[i++] = c;
         r.t = i;
         r.clamp();
       }
@@ -2520,20 +2475,16 @@ var require_jsbn = __commonJS({
         var x = this.abs(), y = a.abs();
         var i = x.t;
         r.t = i + y.t;
-        while (--i >= 0)
-          r[i] = 0;
-        for (i = 0; i < y.t; ++i)
-          r[i + x.t] = x.am(0, y[i], r, i, 0, x.t);
+        while (--i >= 0) r[i] = 0;
+        for (i = 0; i < y.t; ++i) r[i + x.t] = x.am(0, y[i], r, i, 0, x.t);
         r.s = 0;
         r.clamp();
-        if (this.s != a.s)
-          BigInteger.ZERO.subTo(r, r);
+        if (this.s != a.s) BigInteger.ZERO.subTo(r, r);
       }
       function bnpSquareTo(r) {
         var x = this.abs();
         var i = r.t = 2 * x.t;
-        while (--i >= 0)
-          r[i] = 0;
+        while (--i >= 0) r[i] = 0;
         for (i = 0; i < x.t - 1; ++i) {
           var c = x.am(i, x[i], r, 2 * i, 0, 1);
           if ((r[i + x.t] += x.am(i + 1, 2 * x[i], r, 2 * i + 1, c, x.t - i - 1)) >= x.DV) {
@@ -2541,25 +2492,20 @@ var require_jsbn = __commonJS({
             r[i + x.t + 1] = 1;
           }
         }
-        if (r.t > 0)
-          r[r.t - 1] += x.am(i, x[i], r, 2 * i, 0, 1);
+        if (r.t > 0) r[r.t - 1] += x.am(i, x[i], r, 2 * i, 0, 1);
         r.s = 0;
         r.clamp();
       }
       function bnpDivRemTo(m, q, r) {
         var pm = m.abs();
-        if (pm.t <= 0)
-          return;
+        if (pm.t <= 0) return;
         var pt = this.abs();
         if (pt.t < pm.t) {
-          if (q != null)
-            q.fromInt(0);
-          if (r != null)
-            this.copyTo(r);
+          if (q != null) q.fromInt(0);
+          if (r != null) this.copyTo(r);
           return;
         }
-        if (r == null)
-          r = nbi();
+        if (r == null) r = nbi();
         var y = nbi(), ts = this.s, ms = m.s;
         var nsh = this.DB - nbits(pm[pm.t - 1]);
         if (nsh > 0) {
@@ -2571,8 +2517,7 @@ var require_jsbn = __commonJS({
         }
         var ys = y.t;
         var y0 = y[ys - 1];
-        if (y0 == 0)
-          return;
+        if (y0 == 0) return;
         var yt = y0 * (1 << this.F1) + (ys > 1 ? y[ys - 2] >> this.F2 : 0);
         var d1 = this.FV / yt, d2 = (1 << this.F1) / yt, e = 1 << this.F2;
         var i = r.t, j = i - ys, t2 = q == null ? nbi() : q;
@@ -2583,44 +2528,36 @@ var require_jsbn = __commonJS({
         }
         BigInteger.ONE.dlShiftTo(ys, t2);
         t2.subTo(y, y);
-        while (y.t < ys)
-          y[y.t++] = 0;
+        while (y.t < ys) y[y.t++] = 0;
         while (--j >= 0) {
           var qd = r[--i] == y0 ? this.DM : Math.floor(r[i] * d1 + (r[i - 1] + e) * d2);
           if ((r[i] += y.am(0, qd, r, j, 0, ys)) < qd) {
             y.dlShiftTo(j, t2);
             r.subTo(t2, r);
-            while (r[i] < --qd)
-              r.subTo(t2, r);
+            while (r[i] < --qd) r.subTo(t2, r);
           }
         }
         if (q != null) {
           r.drShiftTo(ys, q);
-          if (ts != ms)
-            BigInteger.ZERO.subTo(q, q);
+          if (ts != ms) BigInteger.ZERO.subTo(q, q);
         }
         r.t = ys;
         r.clamp();
-        if (nsh > 0)
-          r.rShiftTo(nsh, r);
-        if (ts < 0)
-          BigInteger.ZERO.subTo(r, r);
+        if (nsh > 0) r.rShiftTo(nsh, r);
+        if (ts < 0) BigInteger.ZERO.subTo(r, r);
       }
       function bnMod(a) {
         var r = nbi();
         this.abs().divRemTo(a, null, r);
-        if (this.s < 0 && r.compareTo(BigInteger.ZERO) > 0)
-          a.subTo(r, r);
+        if (this.s < 0 && r.compareTo(BigInteger.ZERO) > 0) a.subTo(r, r);
         return r;
       }
       function Classic(m) {
         this.m = m;
       }
       function cConvert(x) {
-        if (x.s < 0 || x.compareTo(this.m) >= 0)
-          return x.mod(this.m);
-        else
-          return x;
+        if (x.s < 0 || x.compareTo(this.m) >= 0) return x.mod(this.m);
+        else return x;
       }
       function cRevert(x) {
         return x;
@@ -2642,11 +2579,9 @@ var require_jsbn = __commonJS({
       Classic.prototype.mulTo = cMulTo;
       Classic.prototype.sqrTo = cSqrTo;
       function bnpInvDigit() {
-        if (this.t < 1)
-          return 0;
+        if (this.t < 1) return 0;
         var x = this[0];
-        if ((x & 1) == 0)
-          return 0;
+        if ((x & 1) == 0) return 0;
         var y = x & 3;
         y = y * (2 - (x & 15) * y) & 15;
         y = y * (2 - (x & 255) * y) & 255;
@@ -2666,8 +2601,7 @@ var require_jsbn = __commonJS({
         var r = nbi();
         x.abs().dlShiftTo(this.m.t, r);
         r.divRemTo(this.m, null, r);
-        if (x.s < 0 && r.compareTo(BigInteger.ZERO) > 0)
-          this.m.subTo(r, r);
+        if (x.s < 0 && r.compareTo(BigInteger.ZERO) > 0) this.m.subTo(r, r);
         return r;
       }
       function montRevert(x) {
@@ -2691,8 +2625,7 @@ var require_jsbn = __commonJS({
         }
         x.clamp();
         x.drShiftTo(this.m.t, x);
-        if (x.compareTo(this.m) >= 0)
-          x.subTo(this.m, x);
+        if (x.compareTo(this.m) >= 0) x.subTo(this.m, x);
       }
       function montSqrTo(x, r) {
         x.squareTo(r);
@@ -2711,14 +2644,12 @@ var require_jsbn = __commonJS({
         return (this.t > 0 ? this[0] & 1 : this.s) == 0;
       }
       function bnpExp(e, z2) {
-        if (e > 4294967295 || e < 1)
-          return BigInteger.ONE;
+        if (e > 4294967295 || e < 1) return BigInteger.ONE;
         var r = nbi(), r2 = nbi(), g = z2.convert(this), i = nbits(e) - 1;
         g.copyTo(r);
         while (--i >= 0) {
           z2.sqrTo(r, r2);
-          if ((e & 1 << i) > 0)
-            z2.mulTo(r2, g, r);
+          if ((e & 1 << i) > 0) z2.mulTo(r2, g, r);
           else {
             var t2 = r;
             r = r2;
@@ -2729,10 +2660,8 @@ var require_jsbn = __commonJS({
       }
       function bnModPowInt(e, m) {
         var z2;
-        if (e < 256 || m.isEven())
-          z2 = new Classic(m);
-        else
-          z2 = new Montgomery(m);
+        if (e < 256 || m.isEven()) z2 = new Classic(m);
+        else z2 = new Montgomery(m);
         return this.exp(e, z2);
       }
       BigInteger.prototype.copyTo = bnpCopyTo;
@@ -2766,14 +2695,10 @@ var require_jsbn = __commonJS({
       }
       function bnIntValue() {
         if (this.s < 0) {
-          if (this.t == 1)
-            return this[0] - this.DV;
-          else if (this.t == 0)
-            return -1;
-        } else if (this.t == 1)
-          return this[0];
-        else if (this.t == 0)
-          return 0;
+          if (this.t == 1) return this[0] - this.DV;
+          else if (this.t == 0) return -1;
+        } else if (this.t == 1) return this[0];
+        else if (this.t == 0) return 0;
         return (this[1] & (1 << 32 - this.DB) - 1) << this.DB | this[0];
       }
       function bnByteValue() {
@@ -2786,18 +2711,13 @@ var require_jsbn = __commonJS({
         return Math.floor(Math.LN2 * this.DB / Math.log(r));
       }
       function bnSigNum() {
-        if (this.s < 0)
-          return -1;
-        else if (this.t <= 0 || this.t == 1 && this[0] <= 0)
-          return 0;
-        else
-          return 1;
+        if (this.s < 0) return -1;
+        else if (this.t <= 0 || this.t == 1 && this[0] <= 0) return 0;
+        else return 1;
       }
       function bnpToRadix(b) {
-        if (b == null)
-          b = 10;
-        if (this.signum() == 0 || b < 2 || b > 36)
-          return "0";
+        if (b == null) b = 10;
+        if (this.signum() == 0 || b < 2 || b > 36) return "0";
         var cs = this.chunkSize(b);
         var a = Math.pow(b, cs);
         var d = nbv(a), y = nbi(), z2 = nbi(), r = "";
@@ -2810,15 +2730,13 @@ var require_jsbn = __commonJS({
       }
       function bnpFromRadix(s, b) {
         this.fromInt(0);
-        if (b == null)
-          b = 10;
+        if (b == null) b = 10;
         var cs = this.chunkSize(b);
         var d = Math.pow(b, cs), mi = false, j = 0, w = 0;
         for (var i = 0; i < s.length; ++i) {
           var x = intAt(s, i);
           if (x < 0) {
-            if (s.charAt(i) == "-" && this.signum() == 0)
-              mi = true;
+            if (s.charAt(i) == "-" && this.signum() == 0) mi = true;
             continue;
           }
           w = b * w + x;
@@ -2833,33 +2751,27 @@ var require_jsbn = __commonJS({
           this.dMultiply(Math.pow(b, j));
           this.dAddOffset(w, 0);
         }
-        if (mi)
-          BigInteger.ZERO.subTo(this, this);
+        if (mi) BigInteger.ZERO.subTo(this, this);
       }
       function bnpFromNumber(a, b, c) {
         if ("number" == typeof b) {
-          if (a < 2)
-            this.fromInt(1);
+          if (a < 2) this.fromInt(1);
           else {
             this.fromNumber(a, c);
             if (!this.testBit(a - 1))
               this.bitwiseTo(BigInteger.ONE.shiftLeft(a - 1), op_or, this);
-            if (this.isEven())
-              this.dAddOffset(1, 0);
+            if (this.isEven()) this.dAddOffset(1, 0);
             while (!this.isProbablePrime(b)) {
               this.dAddOffset(2, 0);
-              if (this.bitLength() > a)
-                this.subTo(BigInteger.ONE.shiftLeft(a - 1), this);
+              if (this.bitLength() > a) this.subTo(BigInteger.ONE.shiftLeft(a - 1), this);
             }
           }
         } else {
           var x = new Array(), t2 = a & 7;
           x.length = (a >> 3) + 1;
           b.nextBytes(x);
-          if (t2 > 0)
-            x[0] &= (1 << t2) - 1;
-          else
-            x[0] = 0;
+          if (t2 > 0) x[0] &= (1 << t2) - 1;
+          else x[0] = 0;
           this.fromString(x, 256);
         }
       }
@@ -2881,12 +2793,9 @@ var require_jsbn = __commonJS({
                 --i;
               }
             }
-            if ((d & 128) != 0)
-              d |= -256;
-            if (k == 0 && (this.s & 128) != (d & 128))
-              ++k;
-            if (k > 0 || d != this.s)
-              r[k++] = d;
+            if ((d & 128) != 0) d |= -256;
+            if (k == 0 && (this.s & 128) != (d & 128)) ++k;
+            if (k > 0 || d != this.s) r[k++] = d;
           }
         }
         return r;
@@ -2902,17 +2811,14 @@ var require_jsbn = __commonJS({
       }
       function bnpBitwiseTo(a, op, r) {
         var i, f, m = Math.min(a.t, this.t);
-        for (i = 0; i < m; ++i)
-          r[i] = op(this[i], a[i]);
+        for (i = 0; i < m; ++i) r[i] = op(this[i], a[i]);
         if (a.t < this.t) {
           f = a.s & this.DM;
-          for (i = m; i < this.t; ++i)
-            r[i] = op(this[i], f);
+          for (i = m; i < this.t; ++i) r[i] = op(this[i], f);
           r.t = this.t;
         } else {
           f = this.s & this.DM;
-          for (i = m; i < a.t; ++i)
-            r[i] = op(f, a[i]);
+          for (i = m; i < a.t; ++i) r[i] = op(f, a[i]);
           r.t = a.t;
         }
         r.s = op(this.s, a.s);
@@ -2952,31 +2858,25 @@ var require_jsbn = __commonJS({
       }
       function bnNot() {
         var r = nbi();
-        for (var i = 0; i < this.t; ++i)
-          r[i] = this.DM & ~this[i];
+        for (var i = 0; i < this.t; ++i) r[i] = this.DM & ~this[i];
         r.t = this.t;
         r.s = ~this.s;
         return r;
       }
       function bnShiftLeft(n) {
         var r = nbi();
-        if (n < 0)
-          this.rShiftTo(-n, r);
-        else
-          this.lShiftTo(n, r);
+        if (n < 0) this.rShiftTo(-n, r);
+        else this.lShiftTo(n, r);
         return r;
       }
       function bnShiftRight(n) {
         var r = nbi();
-        if (n < 0)
-          this.lShiftTo(-n, r);
-        else
-          this.rShiftTo(n, r);
+        if (n < 0) this.lShiftTo(-n, r);
+        else this.rShiftTo(n, r);
         return r;
       }
       function lbit(x) {
-        if (x == 0)
-          return -1;
+        if (x == 0) return -1;
         var r = 0;
         if ((x & 65535) == 0) {
           x >>= 16;
@@ -2994,16 +2894,13 @@ var require_jsbn = __commonJS({
           x >>= 2;
           r += 2;
         }
-        if ((x & 1) == 0)
-          ++r;
+        if ((x & 1) == 0) ++r;
         return r;
       }
       function bnGetLowestSetBit() {
         for (var i = 0; i < this.t; ++i)
-          if (this[i] != 0)
-            return i * this.DB + lbit(this[i]);
-        if (this.s < 0)
-          return this.t * this.DB;
+          if (this[i] != 0) return i * this.DB + lbit(this[i]);
+        if (this.s < 0) return this.t * this.DB;
         return -1;
       }
       function cbit(x) {
@@ -3016,14 +2913,12 @@ var require_jsbn = __commonJS({
       }
       function bnBitCount() {
         var r = 0, x = this.s & this.DM;
-        for (var i = 0; i < this.t; ++i)
-          r += cbit(this[i] ^ x);
+        for (var i = 0; i < this.t; ++i) r += cbit(this[i] ^ x);
         return r;
       }
       function bnTestBit(n) {
         var j = Math.floor(n / this.DB);
-        if (j >= this.t)
-          return this.s != 0;
+        if (j >= this.t) return this.s != 0;
         return (this[j] & 1 << n % this.DB) != 0;
       }
       function bnpChangeBit(n, op) {
@@ -3065,10 +2960,8 @@ var require_jsbn = __commonJS({
           c += a.s;
         }
         r.s = c < 0 ? -1 : 0;
-        if (c > 0)
-          r[i++] = c;
-        else if (c < -1)
-          r[i++] = this.DV + c;
+        if (c > 0) r[i++] = c;
+        else if (c < -1) r[i++] = this.DV + c;
         r.t = i;
         r.clamp();
       }
@@ -3113,15 +3006,12 @@ var require_jsbn = __commonJS({
         this.clamp();
       }
       function bnpDAddOffset(n, w) {
-        if (n == 0)
-          return;
-        while (this.t <= w)
-          this[this.t++] = 0;
+        if (n == 0) return;
+        while (this.t <= w) this[this.t++] = 0;
         this[w] += n;
         while (this[w] >= this.DV) {
           this[w] -= this.DV;
-          if (++w >= this.t)
-            this[this.t++] = 0;
+          if (++w >= this.t) this[this.t++] = 0;
           ++this[w];
         }
       }
@@ -3147,21 +3037,17 @@ var require_jsbn = __commonJS({
         var i = Math.min(this.t + a.t, n);
         r.s = 0;
         r.t = i;
-        while (i > 0)
-          r[--i] = 0;
+        while (i > 0) r[--i] = 0;
         var j;
-        for (j = r.t - this.t; i < j; ++i)
-          r[i + this.t] = this.am(0, a[i], r, i, 0, this.t);
-        for (j = Math.min(a.t, n); i < j; ++i)
-          this.am(0, a[i], r, i, 0, n - i);
+        for (j = r.t - this.t; i < j; ++i) r[i + this.t] = this.am(0, a[i], r, i, 0, this.t);
+        for (j = Math.min(a.t, n); i < j; ++i) this.am(0, a[i], r, i, 0, n - i);
         r.clamp();
       }
       function bnpMultiplyUpperTo(a, n, r) {
         --n;
         var i = r.t = this.t + a.t - n;
         r.s = 0;
-        while (--i >= 0)
-          r[i] = 0;
+        while (--i >= 0) r[i] = 0;
         for (i = Math.max(n - this.t, 0); i < a.t; ++i)
           r[this.t + i - n] = this.am(n - i, a[i], r, 0, 0, this.t + i - n);
         r.clamp();
@@ -3175,10 +3061,8 @@ var require_jsbn = __commonJS({
         this.m = m;
       }
       function barrettConvert(x) {
-        if (x.s < 0 || x.t > 2 * this.m.t)
-          return x.mod(this.m);
-        else if (x.compareTo(this.m) < 0)
-          return x;
+        if (x.s < 0 || x.t > 2 * this.m.t) return x.mod(this.m);
+        else if (x.compareTo(this.m) < 0) return x;
         else {
           var r = nbi();
           x.copyTo(r);
@@ -3197,11 +3081,9 @@ var require_jsbn = __commonJS({
         }
         this.mu.multiplyUpperTo(this.r2, this.m.t + 1, this.q3);
         this.m.multiplyLowerTo(this.q3, this.m.t + 1, this.r2);
-        while (x.compareTo(this.r2) < 0)
-          x.dAddOffset(1, this.m.t + 1);
+        while (x.compareTo(this.r2) < 0) x.dAddOffset(1, this.m.t + 1);
         x.subTo(this.r2, x);
-        while (x.compareTo(this.m) >= 0)
-          x.subTo(this.m, x);
+        while (x.compareTo(this.m) >= 0) x.subTo(this.m, x);
       }
       function barrettSqrTo(x, r) {
         x.squareTo(r);
@@ -3218,18 +3100,12 @@ var require_jsbn = __commonJS({
       Barrett.prototype.sqrTo = barrettSqrTo;
       function bnModPow(e, m) {
         var i = e.bitLength(), k, r = nbv(1), z2;
-        if (i <= 0)
-          return r;
-        else if (i < 18)
-          k = 1;
-        else if (i < 48)
-          k = 3;
-        else if (i < 144)
-          k = 4;
-        else if (i < 768)
-          k = 5;
-        else
-          k = 6;
+        if (i <= 0) return r;
+        else if (i < 18) k = 1;
+        else if (i < 48) k = 3;
+        else if (i < 144) k = 4;
+        else if (i < 768) k = 5;
+        else k = 6;
         if (i < 8)
           z2 = new Classic(m);
         else if (m.isEven())
@@ -3250,12 +3126,10 @@ var require_jsbn = __commonJS({
         var j = e.t - 1, w, is1 = true, r2 = nbi(), t2;
         i = nbits(e[j]) - 1;
         while (j >= 0) {
-          if (i >= k1)
-            w = e[j] >> i - k1 & km;
+          if (i >= k1) w = e[j] >> i - k1 & km;
           else {
             w = (e[j] & (1 << i + 1) - 1) << k1 - i;
-            if (j > 0)
-              w |= e[j - 1] >> this.DB + i - k1;
+            if (j > 0) w |= e[j - 1] >> this.DB + i - k1;
           }
           n = k;
           while ((w & 1) == 0) {
@@ -3275,8 +3149,7 @@ var require_jsbn = __commonJS({
               z2.sqrTo(r2, r);
               n -= 2;
             }
-            if (n > 0)
-              z2.sqrTo(r, r2);
+            if (n > 0) z2.sqrTo(r, r2);
             else {
               t2 = r;
               r = r2;
@@ -3306,19 +3179,15 @@ var require_jsbn = __commonJS({
           y = t2;
         }
         var i = x.getLowestSetBit(), g = y.getLowestSetBit();
-        if (g < 0)
-          return x;
-        if (i < g)
-          g = i;
+        if (g < 0) return x;
+        if (i < g) g = i;
         if (g > 0) {
           x.rShiftTo(g, x);
           y.rShiftTo(g, y);
         }
         while (x.signum() > 0) {
-          if ((i = x.getLowestSetBit()) > 0)
-            x.rShiftTo(i, x);
-          if ((i = y.getLowestSetBit()) > 0)
-            y.rShiftTo(i, y);
+          if ((i = x.getLowestSetBit()) > 0) x.rShiftTo(i, x);
+          if ((i = y.getLowestSetBit()) > 0) y.rShiftTo(i, y);
           if (x.compareTo(y) >= 0) {
             x.subTo(y, x);
             x.rShiftTo(1, x);
@@ -3327,26 +3196,20 @@ var require_jsbn = __commonJS({
             y.rShiftTo(1, y);
           }
         }
-        if (g > 0)
-          y.lShiftTo(g, y);
+        if (g > 0) y.lShiftTo(g, y);
         return y;
       }
       function bnpModInt(n) {
-        if (n <= 0)
-          return 0;
+        if (n <= 0) return 0;
         var d = this.DV % n, r = this.s < 0 ? n - 1 : 0;
         if (this.t > 0)
-          if (d == 0)
-            r = this[0] % n;
-          else
-            for (var i = this.t - 1; i >= 0; --i)
-              r = (d * r + this[i]) % n;
+          if (d == 0) r = this[0] % n;
+          else for (var i = this.t - 1; i >= 0; --i) r = (d * r + this[i]) % n;
         return r;
       }
       function bnModInverse(m) {
         var ac = m.isEven();
-        if (this.isEven() && ac || m.signum() == 0)
-          return BigInteger.ZERO;
+        if (this.isEven() && ac || m.signum() == 0) return BigInteger.ZERO;
         var u = m.clone(), v = this.clone();
         var a = nbv(1), b = nbv(0), c = nbv(0), d = nbv(1);
         while (u.signum() != 0) {
@@ -3358,8 +3221,7 @@ var require_jsbn = __commonJS({
                 b.subTo(m, b);
               }
               a.rShiftTo(1, a);
-            } else if (!b.isEven())
-              b.subTo(m, b);
+            } else if (!b.isEven()) b.subTo(m, b);
             b.rShiftTo(1, b);
           }
           while (v.isEven()) {
@@ -3370,34 +3232,25 @@ var require_jsbn = __commonJS({
                 d.subTo(m, d);
               }
               c.rShiftTo(1, c);
-            } else if (!d.isEven())
-              d.subTo(m, d);
+            } else if (!d.isEven()) d.subTo(m, d);
             d.rShiftTo(1, d);
           }
           if (u.compareTo(v) >= 0) {
             u.subTo(v, u);
-            if (ac)
-              a.subTo(c, a);
+            if (ac) a.subTo(c, a);
             b.subTo(d, b);
           } else {
             v.subTo(u, v);
-            if (ac)
-              c.subTo(a, c);
+            if (ac) c.subTo(a, c);
             d.subTo(b, d);
           }
         }
-        if (v.compareTo(BigInteger.ONE) != 0)
-          return BigInteger.ZERO;
-        if (d.compareTo(m) >= 0)
-          return d.subtract(m);
-        if (d.signum() < 0)
-          d.addTo(m, d);
-        else
-          return d;
-        if (d.signum() < 0)
-          return d.add(m);
-        else
-          return d;
+        if (v.compareTo(BigInteger.ONE) != 0) return BigInteger.ZERO;
+        if (d.compareTo(m) >= 0) return d.subtract(m);
+        if (d.signum() < 0) d.addTo(m, d);
+        else return d;
+        if (d.signum() < 0) return d.add(m);
+        else return d;
       }
       var lowprimes = [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];
       var lplim = (1 << 26) / lowprimes[lowprimes.length - 1];
@@ -3405,33 +3258,26 @@ var require_jsbn = __commonJS({
         var i, x = this.abs();
         if (x.t == 1 && x[0] <= lowprimes[lowprimes.length - 1]) {
           for (i = 0; i < lowprimes.length; ++i)
-            if (x[0] == lowprimes[i])
-              return true;
+            if (x[0] == lowprimes[i]) return true;
           return false;
         }
-        if (x.isEven())
-          return false;
+        if (x.isEven()) return false;
         i = 1;
         while (i < lowprimes.length) {
           var m = lowprimes[i], j = i + 1;
-          while (j < lowprimes.length && m < lplim)
-            m *= lowprimes[j++];
+          while (j < lowprimes.length && m < lplim) m *= lowprimes[j++];
           m = x.modInt(m);
-          while (i < j)
-            if (m % lowprimes[i++] == 0)
-              return false;
+          while (i < j) if (m % lowprimes[i++] == 0) return false;
         }
         return x.millerRabin(t2);
       }
       function bnpMillerRabin(t2) {
         var n1 = this.subtract(BigInteger.ONE);
         var k = n1.getLowestSetBit();
-        if (k <= 0)
-          return false;
+        if (k <= 0) return false;
         var r = n1.shiftRight(k);
         t2 = t2 + 1 >> 1;
-        if (t2 > lowprimes.length)
-          t2 = lowprimes.length;
+        if (t2 > lowprimes.length) t2 = lowprimes.length;
         var a = nbi();
         for (var i = 0; i < t2; ++i) {
           a.fromInt(lowprimes[Math.floor(Math.random() * lowprimes.length)]);
@@ -3440,11 +3286,9 @@ var require_jsbn = __commonJS({
             var j = 1;
             while (j++ < k && y.compareTo(n1) != 0) {
               y = y.modPowInt(2, this);
-              if (y.compareTo(BigInteger.ONE) == 0)
-                return false;
+              if (y.compareTo(BigInteger.ONE) == 0) return false;
             }
-            if (y.compareTo(n1) != 0)
-              return false;
+            if (y.compareTo(n1) != 0) return false;
           }
         }
         return true;
@@ -3505,8 +3349,7 @@ var require_jsbn = __commonJS({
         rng_pool[rng_pptr++] ^= x >> 8 & 255;
         rng_pool[rng_pptr++] ^= x >> 16 & 255;
         rng_pool[rng_pptr++] ^= x >> 24 & 255;
-        if (rng_pptr >= rng_psize)
-          rng_pptr -= rng_psize;
+        if (rng_pptr >= rng_psize) rng_pptr -= rng_psize;
       }
       function rng_seed_time() {
         rng_seed_int((/* @__PURE__ */ new Date()).getTime());
@@ -3548,8 +3391,7 @@ var require_jsbn = __commonJS({
       }
       function rng_get_bytes(ba) {
         var i;
-        for (i = 0; i < ba.length; ++i)
-          ba[i] = rng_get_byte();
+        for (i = 0; i < ba.length; ++i) ba[i] = rng_get_byte();
       }
       function SecureRandom() {
       }
@@ -3611,20 +3453,15 @@ var require_asn1 = __commonJS({
     function bigintToValue(bigint) {
       let h = bigint.toString(16);
       if (h[0] !== "-") {
-        if (h.length % 2 === 1)
-          h = "0" + h;
-        else if (!h.match(/^[0-7]/))
-          h = "00" + h;
+        if (h.length % 2 === 1) h = "0" + h;
+        else if (!h.match(/^[0-7]/)) h = "00" + h;
       } else {
         h = h.substr(1);
         let len = h.length;
-        if (len % 2 === 1)
-          len += 1;
-        else if (!h.match(/^[0-7]/))
-          len += 2;
+        if (len % 2 === 1) len += 1;
+        else if (!h.match(/^[0-7]/)) len += 2;
         let mask = "";
-        for (let i = 0; i < len; i++)
-          mask += "f";
+        for (let i = 0; i < len; i++) mask += "f";
         mask = new BigInteger(mask, 16);
         h = mask.xor(bigint).add(BigInteger.ONE);
         h = h.toString(16).replace(/^-/, "");
@@ -3652,8 +3489,7 @@ var require_asn1 = __commonJS({
       getLength() {
         const n = this.v.length / 2;
         let nHex = n.toString(16);
-        if (nHex.length % 2 === 1)
-          nHex = "0" + nHex;
+        if (nHex.length % 2 === 1) nHex = "0" + nHex;
         if (n < 128) {
           return nHex;
         } else {
@@ -3669,8 +3505,7 @@ var require_asn1 = __commonJS({
       constructor(bigint) {
         super();
         this.t = "02";
-        if (bigint)
-          this.v = bigintToValue(bigint);
+        if (bigint) this.v = bigintToValue(bigint);
       }
       getValue() {
         return this.v;
@@ -3688,15 +3523,13 @@ var require_asn1 = __commonJS({
       }
     };
     function getLenOfL(str, start) {
-      if (+str[start + 2] < 8)
-        return 1;
+      if (+str[start + 2] < 8) return 1;
       return +str.substr(start + 2, 2) & 127 + 1;
     }
     function getL(str, start) {
       const len = getLenOfL(str, start);
       const l = str.substr(start + 2, len * 2);
-      if (!l)
-        return -1;
+      if (!l) return -1;
       const bigint = +l[0] < 8 ? new BigInteger(l, 16) : new BigInteger(l.substr(2), 16);
       return bigint.intValue();
     }
@@ -3749,8 +3582,7 @@ var require_ec = __commonJS({
        * 判断相等
        */
       equals(other) {
-        if (other === this)
-          return true;
+        if (other === this) return true;
         return this.q.equals(other.q) && this.x.equals(other.x);
       }
       /**
@@ -3805,28 +3637,22 @@ var require_ec = __commonJS({
         this.zinv = null;
       }
       getX() {
-        if (this.zinv === null)
-          this.zinv = this.z.modInverse(this.curve.q);
+        if (this.zinv === null) this.zinv = this.z.modInverse(this.curve.q);
         return this.curve.fromBigInteger(this.x.toBigInteger().multiply(this.zinv).mod(this.curve.q));
       }
       getY() {
-        if (this.zinv === null)
-          this.zinv = this.z.modInverse(this.curve.q);
+        if (this.zinv === null) this.zinv = this.z.modInverse(this.curve.q);
         return this.curve.fromBigInteger(this.y.toBigInteger().multiply(this.zinv).mod(this.curve.q));
       }
       /**
        * 判断相等
        */
       equals(other) {
-        if (other === this)
-          return true;
-        if (this.isInfinity())
-          return other.isInfinity();
-        if (other.isInfinity())
-          return this.isInfinity();
+        if (other === this) return true;
+        if (this.isInfinity()) return other.isInfinity();
+        if (other.isInfinity()) return this.isInfinity();
         const u = other.y.toBigInteger().multiply(this.z).subtract(this.y.toBigInteger().multiply(other.z)).mod(this.curve.q);
-        if (!u.equals(BigInteger.ZERO))
-          return false;
+        if (!u.equals(BigInteger.ZERO)) return false;
         const v = other.x.toBigInteger().multiply(this.z).subtract(this.x.toBigInteger().multiply(other.z)).mod(this.curve.q);
         return v.equals(BigInteger.ZERO);
       }
@@ -3834,8 +3660,7 @@ var require_ec = __commonJS({
        * 是否是无穷远点
        */
       isInfinity() {
-        if (this.x === null && this.y === null)
-          return true;
+        if (this.x === null && this.y === null) return true;
         return this.z.equals(BigInteger.ZERO) && !this.y.toBigInteger().equals(BigInteger.ZERO);
       }
       /**
@@ -3865,10 +3690,8 @@ var require_ec = __commonJS({
        * z3 = λ10 * λ8
        */
       add(b) {
-        if (this.isInfinity())
-          return b;
-        if (b.isInfinity())
-          return this;
+        if (this.isInfinity()) return b;
+        if (b.isInfinity()) return this;
         const x1 = this.x.toBigInteger();
         const y1 = this.y.toBigInteger();
         const z1 = this.z;
@@ -3914,10 +3737,8 @@ var require_ec = __commonJS({
        * z3 = λ2 * λ5
        */
       twice() {
-        if (this.isInfinity())
-          return this;
-        if (!this.y.toBigInteger().signum())
-          return this.curve.infinity;
+        if (this.isInfinity()) return this;
+        if (!this.y.toBigInteger().signum()) return this.curve.infinity;
         const x1 = this.x.toBigInteger();
         const y1 = this.y.toBigInteger();
         const z1 = this.z;
@@ -3938,10 +3759,8 @@ var require_ec = __commonJS({
        * 倍点计算
        */
       multiply(k) {
-        if (this.isInfinity())
-          return this;
-        if (!k.signum())
-          return this.curve.infinity;
+        if (this.isInfinity()) return this;
+        if (!k.signum()) return this.curve.infinity;
         const k3 = k.multiply(THREE);
         const neg = this.negate();
         let Q = this;
@@ -3967,8 +3786,7 @@ var require_ec = __commonJS({
        * 判断两个椭圆曲线是否相等
        */
       equals(other) {
-        if (other === this)
-          return true;
+        if (other === this) return true;
         return this.q.equals(other.q) && this.a.equals(other.a) && this.b.equals(other.b);
       }
       /**
@@ -3982,6 +3800,7 @@ var require_ec = __commonJS({
        */
       decodePointHex(s) {
         switch (parseInt(s.substr(0, 2), 16)) {
+          // 第一个字节
           case 0:
             return this.infinity;
           case 2:
@@ -4048,14 +3867,12 @@ var require_utils = __commonJS({
       return { privateKey, publicKey };
     }
     function compressPublicKeyHex(s) {
-      if (s.length !== 130)
-        throw new Error("Invalid public key to compress");
+      if (s.length !== 130) throw new Error("Invalid public key to compress");
       const len = (s.length - 2) / 2;
       const xHex = s.substr(2, len);
       const y = new BigInteger(s.substr(len + 2, len), 16);
       let prefix = "03";
-      if (y.mod(new BigInteger("2")).equals(BigInteger.ZERO))
-        prefix = "02";
+      if (y.mod(new BigInteger("2")).equals(BigInteger.ZERO)) prefix = "02";
       return prefix + xHex;
     }
     function utf8ToHex(input) {
@@ -4074,8 +3891,7 @@ var require_utils = __commonJS({
       return hexChars.join("");
     }
     function leftPad(input, num) {
-      if (input.length >= num)
-        return input;
+      if (input.length >= num) return input;
       return new Array(num - input.length + 1).join("0") + input;
     }
     function arrayToHex(arr) {
@@ -4116,19 +3932,16 @@ var require_utils = __commonJS({
     }
     function verifyPublicKey(publicKey) {
       const point = curve.decodePointHex(publicKey);
-      if (!point)
-        return false;
+      if (!point) return false;
       const x = point.getX();
       const y = point.getY();
       return y.square().equals(x.multiply(x.square()).add(x.multiply(curve.a)).add(curve.b));
     }
     function comparePublicKeyHex(publicKey1, publicKey2) {
       const point1 = curve.decodePointHex(publicKey1);
-      if (!point1)
-        return false;
+      if (!point1) return false;
       const point2 = curve.decodePointHex(publicKey2);
-      if (!point2)
-        return false;
+      if (!point2) return false;
       return point1.equals(point2);
     }
     module2.exports = {
@@ -4158,8 +3971,7 @@ var require_sm3 = __commonJS({
     }
     function xor(x, y) {
       const result = [];
-      for (let i = x.length - 1; i >= 0; i--)
-        result[i] = (x[i] ^ y[i]) & 255;
+      for (let i = x.length - 1; i >= 0; i--) result[i] = (x[i] ^ y[i]) & 255;
       return result;
     }
     function P0(X) {
@@ -4174,10 +3986,8 @@ var require_sm3 = __commonJS({
       k = k >= 448 ? 512 - k % 448 - 1 : 448 - k - 1;
       const kArr = new Array((k - 7) / 8);
       const lenArr = new Array(8);
-      for (let i = 0, len2 = kArr.length; i < len2; i++)
-        kArr[i] = 0;
-      for (let i = 0, len2 = lenArr.length; i < len2; i++)
-        lenArr[i] = 0;
+      for (let i = 0, len2 = kArr.length; i < len2; i++) kArr[i] = 0;
+      for (let i = 0, len2 = lenArr.length; i < len2; i++) lenArr[i] = 0;
       len = len.toString(2);
       for (let i = 7; i >= 0; i--) {
         if (len.length > 8) {
@@ -4260,10 +4070,8 @@ var require_sm3 = __commonJS({
       oPad[i] = 92;
     }
     function hmac(input, key2) {
-      if (key2.length > blockLen)
-        key2 = sm3(key2);
-      while (key2.length < blockLen)
-        key2.push(0);
+      if (key2.length > blockLen) key2 = sm3(key2);
+      while (key2.length < blockLen) key2.push(0);
       const iPadKey = xor(key2, iPad);
       const oPadKey = xor(key2, oPad);
       const hash = sm3([...iPadKey, ...input]);
@@ -4291,8 +4099,7 @@ var require_sm2 = __commonJS({
       const keypair = _.generateKeyPairHex();
       const k = new BigInteger(keypair.privateKey, 16);
       let c1 = keypair.publicKey;
-      if (c1.length > 128)
-        c1 = c1.substr(c1.length - 128);
+      if (c1.length > 128) c1 = c1.substr(c1.length - 128);
       const p = publicKey.multiply(k);
       const x2 = _.hexToArray(_.leftPad(p.getX().toBigInteger().toRadix(16), 64));
       const y2 = _.hexToArray(_.leftPad(p.getY().toBigInteger().toRadix(16), 64));
@@ -4308,8 +4115,7 @@ var require_sm2 = __commonJS({
       };
       nextT();
       for (let i = 0, len = msg.length; i < len; i++) {
-        if (offset === t.length)
-          nextT();
+        if (offset === t.length) nextT();
         msg[i] ^= t[offset++] & 255;
       }
       const c2 = _.arrayToHex(msg);
@@ -4341,8 +4147,7 @@ var require_sm2 = __commonJS({
       };
       nextT();
       for (let i = 0, len = msg.length; i < len; i++) {
-        if (offset === t.length)
-          nextT();
+        if (offset === t.length) nextT();
         msg[i] ^= t[offset++] & 255;
       }
       const checkC3 = _.arrayToHex(sm3([].concat(x2, msg, y2)));
@@ -4382,8 +4187,7 @@ var require_sm2 = __commonJS({
         } while (r.equals(BigInteger.ZERO) || r.add(k).equals(n));
         s = dA.add(BigInteger.ONE).modInverse(n).multiply(k.subtract(r.multiply(dA))).mod(n);
       } while (s.equals(BigInteger.ZERO));
-      if (der)
-        return encodeDer(r, s);
+      if (der) return encodeDer(r, s);
       return _.leftPad(r.toString(16), 64) + _.leftPad(s.toString(16), 64);
     }
     function doVerifySignature(msg, signHex, publicKey, { der, hash, userId } = {}) {
@@ -4404,8 +4208,7 @@ var require_sm2 = __commonJS({
       const PA = curve.decodePointHex(publicKey);
       const e = new BigInteger(hashHex, 16);
       const t = r.add(s).mod(n);
-      if (t.equals(BigInteger.ZERO))
-        return false;
+      if (t.equals(BigInteger.ZERO)) return false;
       const x1y1 = G.multiply(s).add(PA.multiply(t));
       const R = e.add(x1y1.getX().toBigInteger()).mod(n);
       return r.equals(R);
@@ -4466,8 +4269,7 @@ var require_sm32 = __commonJS({
   "node_modules/.pnpm/sm-crypto@0.3.13/node_modules/sm-crypto/src/sm3/index.js"(exports, module2) {
     var { sm3, hmac } = require_sm3();
     function leftPad(input, num) {
-      if (input.length >= num)
-        return input;
+      if (input.length >= num) return input;
       return new Array(num - input.length + 1).join("0") + input;
     }
     function ArrayToHex(arr) {
@@ -4518,11 +4320,9 @@ var require_sm32 = __commonJS({
       input = typeof input === "string" ? utf8ToArray(input) : Array.prototype.slice.call(input);
       if (options) {
         const mode = options.mode || "hmac";
-        if (mode !== "hmac")
-          throw new Error("invalid mode");
+        if (mode !== "hmac") throw new Error("invalid mode");
         let key2 = options.key;
-        if (!key2)
-          throw new Error("invalid key");
+        if (!key2) throw new Error("invalid key");
         key2 = typeof key2 === "string" ? hexToArray(key2) : Array.prototype.slice.call(key2);
         return ArrayToHex(hmac(input, key2));
       }
@@ -4965,14 +4765,12 @@ var require_sm4 = __commonJS({
       output = "string"
     } = {}) {
       if (mode === "cbc") {
-        if (typeof iv2 === "string")
-          iv2 = hexToArray(iv2);
+        if (typeof iv2 === "string") iv2 = hexToArray(iv2);
         if (iv2.length !== 128 / 8) {
           throw new Error("iv is invalid");
         }
       }
-      if (typeof key2 === "string")
-        key2 = hexToArray(key2);
+      if (typeof key2 === "string") key2 = hexToArray(key2);
       if (key2.length !== 128 / 8) {
         throw new Error("key is invalid");
       }
@@ -4987,8 +4785,7 @@ var require_sm4 = __commonJS({
       }
       if ((padding === "pkcs#5" || padding === "pkcs#7") && cryptFlag !== DECRYPT) {
         const paddingCount = BLOCK - inArray.length % BLOCK;
-        for (let i = 0; i < paddingCount; i++)
-          inArray.push(paddingCount);
+        for (let i = 0; i < paddingCount; i++) inArray.push(paddingCount);
       }
       const roundKey = new Array(ROUND);
       sms4KeyExt(key2, roundKey, cryptFlag);
@@ -5029,8 +4826,7 @@ var require_sm4 = __commonJS({
         const len = outArray.length;
         const paddingCount = outArray[len - 1];
         for (let i = 1; i <= paddingCount; i++) {
-          if (outArray[len - i] !== paddingCount)
-            throw new Error("padding is invalid");
+          if (outArray[len - i] !== paddingCount) throw new Error("padding is invalid");
         }
         outArray.splice(len - paddingCount, paddingCount);
       }
@@ -5067,8 +4863,8 @@ var require_src = __commonJS({
 });
 
 // src/index.ts
-var src_exports = {};
-__export(src_exports, {
+var index_exports = {};
+__export(index_exports, {
   FlexTable: () => FlexTable,
   MemoryBasic: () => MemoryBasic,
   MemoryList: () => MemoryList,
@@ -5108,7 +4904,7 @@ __export(src_exports, {
   rotateRad: () => rotateRad,
   wait: () => wait
 });
-module.exports = __toCommonJS(src_exports);
+module.exports = __toCommonJS(index_exports);
 
 // src/clamp.ts
 var clamp = (value, min, max) => {
@@ -5231,10 +5027,8 @@ var compareVersion = (from, to) => {
   for (let i = 0, max = Math.max(froms.length, tos.length); i < max; i++) {
     const fromV = +froms[i] || 0;
     const toV = +tos[i] || 0;
-    if (fromV > toV)
-      return -1;
-    if (fromV < toV)
-      return 1;
+    if (fromV > toV) return -1;
+    if (fromV < toV) return 1;
   }
   return 0;
 };
@@ -5247,11 +5041,9 @@ var hash8strings = (list) => list.reduce((caches, data, index) => {
 
 // src/compare/weak-equal.ts
 var deepWeakEqual = (from, to, exclude) => {
-  if (typeof from !== "object" || from === null || typeof to !== "object" || to === null)
-    return from === to;
+  if (typeof from !== "object" || from === null || typeof to !== "object" || to === null) return from === to;
   if (Array.isArray(from) && Array.isArray(to)) {
-    if (from.length !== to.length)
-      return false;
+    if (from.length !== to.length) return false;
     return !from.some((t1, index) => {
       if (!deepWeakEqual(t1, to[index])) {
         return true;
@@ -5261,8 +5053,7 @@ var deepWeakEqual = (from, to, exclude) => {
     const caches = {};
     const excludeCaches = exclude && hash8strings(exclude);
     for (const key2 in from) {
-      if (excludeCaches && key2 in excludeCaches)
-        continue;
+      if (excludeCaches && key2 in excludeCaches) continue;
       if (!deepWeakEqual(from[key2], to[key2])) {
         return false;
       } else {
@@ -5270,8 +5061,7 @@ var deepWeakEqual = (from, to, exclude) => {
       }
     }
     for (const key2 in to) {
-      if (excludeCaches && key2 in excludeCaches || key2 in caches)
-        continue;
+      if (excludeCaches && key2 in excludeCaches || key2 in caches) continue;
       if (!deepWeakEqual(from[key2], to[key2])) {
         return false;
       }
@@ -5372,8 +5162,7 @@ var getEncoding = (uint, limit = 1024) => {
     top:
       for (let i = 0, max = Math.min(uint.length, limit); i < max; i++) {
         const data = uint[i];
-        if (data < 128)
-          continue;
+        if (data < 128) continue;
         const match = data.toString(2).match(utf8_first_prefix);
         if (match) {
           for (let m = 0; m < match[0].length - 1; m++) {
@@ -5409,21 +5198,15 @@ var re_this = /\b\(this\b|\bthis[\.\[]\b/;
 var re_check = /classCallCheck\(this/;
 var re_default = /^function\sdefault_\d+\s*\(/;
 var isClass = (value, strict = true) => {
-  if (typeof value !== "function")
-    return false;
+  if (typeof value !== "function") return false;
   const proto = value.prototype;
-  if (!proto || proto.constructor !== value)
-    return false;
+  if (!proto || proto.constructor !== value) return false;
   const str = value.toString();
-  if (str.slice(0, 5) === "class" || Object.getOwnPropertyNames(proto).length >= 2)
-    return true;
-  if (re_anonymous.test(str))
-    return false;
-  if (strict && re_function.test(str))
-    return true;
+  if (str.slice(0, 5) === "class" || Object.getOwnPropertyNames(proto).length >= 2) return true;
+  if (re_anonymous.test(str)) return false;
+  if (strict && re_function.test(str)) return true;
   if (re_this.test(str)) {
-    if (!strict || re_check.test(str))
-      return true;
+    if (!strict || re_check.test(str)) return true;
     return re_default.test(str);
   }
   return false;
@@ -5567,8 +5350,7 @@ var MemoryBasic = class {
         }
         return true;
       }
-    }))
-      return this;
+    })) return this;
     for (const [type, target] of memorys) {
       const memory = this.#reflex(target);
       memory.forEach((value, i) => {
@@ -5591,8 +5373,7 @@ var MemoryBasic = class {
    */
   deleteType(type) {
     const { memorys, list } = this;
-    if (!memorys.has(type))
-      return this;
+    if (!memorys.has(type)) return this;
     const local = hash8strings(this.#reflex(memorys.get(type)));
     const Memory = this.constructor;
     const imitator = new Memory(this.key, {
@@ -5692,8 +5473,7 @@ var MemorySimple = class {
    */
   get(type) {
     const value = this.#memory.get(type);
-    if (value === null)
-      return value;
+    if (value === null) return value;
     return value.length ? value[0] : null;
   }
   /**
@@ -5794,8 +5574,7 @@ var Neo4jAhchors = class {
         neo4j.sources.get(nodeId),
         neo4j.targets.get(nodeId)
       ].forEach((list, i) => {
-        if (!list)
-          return;
+        if (!list) return;
         let diffCount = 0;
         let sameCount = 0;
         list.forEach((edge) => {
@@ -5844,8 +5623,7 @@ var Neo4jAhchors = class {
       const target = edge[targetField];
       const direct = this.getDir(source, target);
       const invert = this.getDir(target, source);
-      if (direct in caches)
-        return;
+      if (direct in caches) return;
       const directs = dirs.get(direct) || [];
       const inverts = dirs.get(invert) || [];
       const directsLength = directs.length;
@@ -5861,8 +5639,7 @@ var Neo4jAhchors = class {
       const target = edge[targetField];
       const direct = this.getDir(source, target);
       const invert = this.getDir(target, source);
-      if (direct in caches)
-        return;
+      if (direct in caches) return;
       const directs = neo4j.dirs.get(direct) || [];
       const inverts = neo4j.dirs.get(invert) || [];
       const directsLength = directs.length;
@@ -5880,8 +5657,7 @@ var Neo4jAhchors = class {
    */
   findAnchor(id) {
     const anchor = this.#anchors[id];
-    if (!anchor)
-      return null;
+    if (!anchor) return null;
     return {
       source: anchor.source || 0,
       target: anchor.target || 0
@@ -5894,8 +5670,7 @@ var Neo4jAhchors = class {
   getOffset(id) {
     const { neo4j } = this;
     const edge = neo4j.edges.get(id);
-    if (!edge)
-      return -1;
+    if (!edge) return -1;
     const { dirs, edgeField, sourceField, targetField } = neo4j;
     const source = edge[sourceField];
     const target = edge[targetField];
@@ -5916,8 +5691,7 @@ var Neo4jAhchors = class {
     const directsSize = directs.length;
     const invertsSize = inverts.length;
     const total = directsSize + invertsSize;
-    if (total === 1)
-      return -1;
+    if (total === 1) return -1;
     if (directsSize === 0 || invertsSize === 0) {
       return total / 2 - index - 0.5;
     } else {
@@ -6000,8 +5774,7 @@ var Neo4j = class {
       nodes.push(value);
     } else if (type === "delete") {
       const node = nodes.get(value);
-      if (!node)
-        return [];
+      if (!node) return [];
       nodes.delete(node);
       const id = node[this.#nPrimaryKey];
       const sourceKey = this.#sourceKey;
@@ -6043,8 +5816,7 @@ var Neo4j = class {
       edge[sourceKey] === edge[targetKey] || dirs.push(edge);
     } else if (type === "delete") {
       const edge = edges.get(value);
-      if (!edge)
-        return false;
+      if (!edge) return false;
       edges.delete(edge);
       sources.delete(edge);
       targets.delete(edge);
@@ -6072,8 +5844,7 @@ var shield_keys = hash8strings([
 var shield = (obj, key2, origin) => {
   const proxy = new Proxy({}, {
     get(target, p) {
-      if (p in shield_keys)
-        return;
+      if (p in shield_keys) return;
       const value = origin[p];
       if (typeof value === "function") {
         return function(...args) {
@@ -6103,17 +5874,13 @@ var once = (func, thisArg) => {
 var pow = Math.floor(Math.log10(Number.MAX_SAFE_INTEGER));
 var re_num = /^([-+]?)0*(\d+)(?:(n)|(?:\.(\d+))?(?:[Ee]([-+]?)(\d+))?)$/;
 var parseNum = (num) => {
-  if (isNumber_default(num) || typeof num === "bigint")
-    return num;
+  if (isNumber_default(num) || typeof num === "bigint") return num;
   const match = num.match(re_num);
-  if (!match)
-    return Number.NaN;
+  if (!match) return Number.NaN;
   const [, valueSymbol, integer, bigint, decimal, powSymbol, powValue] = match;
-  if (bigint === "n")
-    return BigInt(valueSymbol + integer);
+  if (bigint === "n") return BigInt(valueSymbol + integer);
   const powSize = integer.length - 1 + (powValue ? powSymbol === "-" ? -powValue : +powValue : 0);
-  if (powSize < pow || powSize === pow && +integer.slice(0, -1) < Number.MAX_SAFE_INTEGER / 10)
-    return +num;
+  if (powSize < pow || powSize === pow && +integer.slice(0, -1) < Number.MAX_SAFE_INTEGER / 10) return +num;
   try {
     const bigValue = BigInt(integer.slice(0, powSize + 1).padEnd(powSize + 1, "0"));
     let smallValue;
@@ -6159,8 +5926,7 @@ var cubeURLParams = (text, serializes) => {
   const result = {};
   for (const [key2, value] of params) {
     const serialize = serializes[key2];
-    if (!serialize)
-      continue;
+    if (!serialize) continue;
     if (isString_default(serialize) && isKey(serialize, cubes)) {
       result[key2] = cubes[serialize](value);
     } else {
@@ -6176,8 +5942,7 @@ var flatURLParams = (data, serializes) => {
   for (const key2 in data) {
     const value = data[key2];
     const serialize = serializes[key2];
-    if (!serialize)
-      continue;
+    if (!serialize) continue;
     params.append(
       key2,
       isString_default(serialize) && isKey(serialize, flats) ? flats[serialize](value) : serialize.flat(value)
@@ -6203,8 +5968,7 @@ var encrypt = (data) => {
   let text = "";
   for (const key2 in data) {
     const value = data[key2];
-    if (value === void 0)
-      continue;
+    if (value === void 0) continue;
     text && (text += "&");
     text += key2 + ":" + value;
   }
@@ -6324,8 +6088,7 @@ var OfflineStorage = class _OfflineStorage {
    */
   async push(data) {
     this.validate((e) => {
-      if (e)
-        throw e;
+      if (e) throw e;
     }, MESSAGES.push);
     const size = this.#size;
     const key2 = structKey(size);
@@ -6337,14 +6100,12 @@ var OfflineStorage = class _OfflineStorage {
    */
   async update(index, data) {
     this.validate((e) => {
-      if (e)
-        throw e;
+      if (e) throw e;
     }, MESSAGES.update);
     const forage = this.#forage;
     const key2 = structKey(index);
     const value = await forage.getItem(key2);
-    if (value === null)
-      return false;
+    if (value === null) return false;
     await forage.setItem(key2, await this.#crypto.encrypt(data));
     return true;
   }
@@ -6353,8 +6114,7 @@ var OfflineStorage = class _OfflineStorage {
    */
   async get(index) {
     this.validate((e) => {
-      if (e)
-        throw e;
+      if (e) throw e;
     }, MESSAGES.get);
     const key2 = structKey(index);
     const value = await this.#forage.getItem(key2);
@@ -6365,8 +6125,7 @@ var OfflineStorage = class _OfflineStorage {
    */
   async clear() {
     this.validate((e) => {
-      if (e)
-        throw e;
+      if (e) throw e;
     });
     this.#size = 0;
     await import_localforage.default.dropInstance({
@@ -6392,20 +6151,17 @@ var OfflineStorage = class _OfflineStorage {
     const databases = await indexedDB.databases();
     const tasks = [];
     for (const { name, version } of databases) {
-      if (name === void 0)
-        continue;
+      if (name === void 0) continue;
       let text;
       try {
         text = import_sm_crypto.sm4.decrypt(name, key, config);
       } catch {
         continue;
       }
-      if (text.slice(0, size) !== PREFIX)
-        continue;
+      if (text.slice(0, size) !== PREFIX) continue;
       const forage = createInstance(name, version);
       const value = await forage.getItem(HEADER);
-      if (value === null || decrypt(value).token !== token || callback && callback(text.slice(size)))
-        continue;
+      if (value === null || decrypt(value).token !== token || callback && callback(text.slice(size))) continue;
       const idb = indexedDB.deleteDatabase(text);
       tasks.push(new Promise((resolve) => {
         idb.onerror = () => resolve();
@@ -6422,8 +6178,7 @@ var css = (...args) => {
   const list = [];
   for (let i = 0; i < args.length; i++) {
     const data = args[i];
-    if (!data)
-      continue;
+    if (!data) continue;
     if (isString_default(data)) {
       list.push(data);
     } else if (Array.isArray(data)) {
@@ -6465,8 +6220,7 @@ var Subscriber = class {
   }
   $emit(name, ...args) {
     const listeners = this.#listeners[name];
-    if (!listeners)
-      return this;
+    if (!listeners) return this;
     const once2 = hash8strings(this.#once[name] || []);
     this.#listeners[name] = listeners.reduce((list, listener, index) => {
       listener(...args);
@@ -6479,8 +6233,7 @@ var Subscriber = class {
   $off(name, listener) {
     const listeners = this.#listeners;
     const once2 = this.#once;
-    if (name in listeners === false)
-      return this;
+    if (name in listeners === false) return this;
     if (listener) {
       let count;
       listeners[name].some((value, index) => {
@@ -6555,8 +6308,7 @@ var FlexTable = class {
   pop() {
     const data = this.#data;
     const rowspan = data.length;
-    if (!rowspan)
-      return null;
+    if (!rowspan) return null;
     const list = data[rowspan - 1];
     if (list.length) {
       return list.pop();
@@ -6570,28 +6322,24 @@ var FlexTable = class {
    */
   each(callback) {
     const data = this.#data;
-    outloop:
-      for (let i = 0; i < data.length; i++) {
-        const list = data[i];
-        for (let j = 0; j < list.length; j++) {
-          if (callback(list[j], i, j) === false)
-            break outloop;
-        }
+    outloop: for (let i = 0; i < data.length; i++) {
+      const list = data[i];
+      for (let j = 0; j < list.length; j++) {
+        if (callback(list[j], i, j) === false) break outloop;
       }
+    }
   }
   /**
    * 反序遍历数据
    */
   reverseEach(callback) {
     const data = this.#data;
-    outloop:
-      for (let i = data.length; i; ) {
-        const list = data[--i];
-        for (let j = list.length; j; ) {
-          if (callback(list[--j], i, j) === false)
-            break outloop;
-        }
+    outloop: for (let i = data.length; i; ) {
+      const list = data[--i];
+      for (let j = list.length; j; ) {
+        if (callback(list[--j], i, j) === false) break outloop;
       }
+    }
   }
   /**
    * 清空数据
@@ -6653,8 +6401,7 @@ var Union = class {
 var re = /([^:])\/{2,}/g;
 var joinPaths = (...list) => {
   const { length } = list;
-  if (length === 0)
-    return "";
+  if (length === 0) return "";
   return length === 1 ? list[0] : list.join("/").replace(re, ($0, $1) => `${$1}/`);
 };