orion-design 0.1.49 → 0.1.52

package/dist/index-BW3nOBfD.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index-BW3nOBfD.js","sources":["../node_modules/jsbn/index.js"],"sourcesContent":["(function(){\n\n    // Copyright (c) 2005  Tom Wu\n    // All Rights Reserved.\n    // See \"LICENSE\" for details.\n\n    // Basic JavaScript BN library - subset useful for RSA encryption.\n\n    // Bits per digit\n    var dbits;\n\n    // JavaScript engine analysis\n    var canary = 0xdeadbeefcafe;\n    var j_lm = ((canary&0xffffff)==0xefcafe);\n\n    // (public) Constructor\n    function BigInteger(a,b,c) {\n      if(a != null)\n        if(\"number\" == typeof a) this.fromNumber(a,b,c);\n        else if(b == null && \"string\" != typeof a) this.fromString(a,256);\n        else this.fromString(a,b);\n    }\n\n    // return new, unset BigInteger\n    function nbi() { return new BigInteger(null); }\n\n    // am: Compute w_j += (x*this_i), propagate carries,\n    // c is initial carry, returns final carry.\n    // c < 3*dvalue, x < 2*dvalue, this_i < dvalue\n    // We need to select the fastest one that works in this environment.\n\n    // am1: use a single mult and divide to get the high bits,\n    // max digit bits should be 26 because\n    // max internal value = 2*dvalue^2-2*dvalue (< 2^53)\n    function am1(i,x,w,j,c,n) {\n      while(--n >= 0) {\n        var v = x*this[i++]+w[j]+c;\n        c = Math.floor(v/0x4000000);\n        w[j++] = v&0x3ffffff;\n      }\n      return c;\n    }\n    // am2 avoids a big mult-and-extract completely.\n    // Max digit bits should be <= 30 because we do bitwise ops\n    // on values up to 2*hdvalue^2-hdvalue-1 (< 2^31)\n    function am2(i,x,w,j,c,n) {\n      var xl = x&0x7fff, xh = x>>15;\n      while(--n >= 0) {\n        var l = this[i]&0x7fff;\n        var h = this[i++]>>15;\n        var m = xh*l+h*xl;\n        l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\n        c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n        w[j++] = l&0x3fffffff;\n      }\n      return c;\n    }\n    // Alternately, set max digit bits to 28 since some\n    // browsers slow down when dealing with 32-bit numbers.\n    function am3(i,x,w,j,c,n) {\n      var xl = x&0x3fff, xh = x>>14;\n      while(--n >= 0) {\n        var l = this[i]&0x3fff;\n        var h = this[i++]>>14;\n        var m = xh*l+h*xl;\n        l = xl*l+((m&0x3fff)<<14)+w[j]+c;\n        c = (l>>28)+(m>>14)+xh*h;\n        w[j++] = l&0xfffffff;\n      }\n      return c;\n    }\n    var inBrowser = typeof navigator !== \"undefined\";\n    if(inBrowser && j_lm && (navigator.appName == \"Microsoft Internet Explorer\")) {\n      BigInteger.prototype.am = am2;\n      dbits = 30;\n    }\n    else if(inBrowser && j_lm && (navigator.appName != \"Netscape\")) {\n      BigInteger.prototype.am = am1;\n      dbits = 26;\n    }\n    else { // Mozilla/Netscape seems to prefer am3\n      BigInteger.prototype.am = am3;\n      dbits = 28;\n    }\n\n    BigInteger.prototype.DB = dbits;\n    BigInteger.prototype.DM = ((1<<dbits)-1);\n    BigInteger.prototype.DV = (1<<dbits);\n\n    var BI_FP = 52;\n    BigInteger.prototype.FV = Math.pow(2,BI_FP);\n    BigInteger.prototype.F1 = BI_FP-dbits;\n    BigInteger.prototype.F2 = 2*dbits-BI_FP;\n\n    // Digit conversions\n    var BI_RM = \"0123456789abcdefghijklmnopqrstuvwxyz\";\n    var BI_RC = new Array();\n    var rr,vv;\n    rr = \"0\".charCodeAt(0);\n    for(vv = 0; vv <= 9; ++vv) BI_RC[rr++] = vv;\n    rr = \"a\".charCodeAt(0);\n    for(vv = 10; vv < 36; ++vv) BI_RC[rr++] = vv;\n    rr = \"A\".charCodeAt(0);\n    for(vv = 10; vv < 36; ++vv) BI_RC[rr++] = vv;\n\n    function int2char(n) { return BI_RM.charAt(n); }\n    function intAt(s,i) {\n      var c = BI_RC[s.charCodeAt(i)];\n      return (c==null)?-1:c;\n    }\n\n    // (protected) copy this to r\n    function bnpCopyTo(r) {\n      for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\n      r.t = this.t;\n      r.s = this.s;\n    }\n\n    // (protected) set from integer value x, -DV <= x < DV\n    function bnpFromInt(x) {\n      this.t = 1;\n      this.s = (x<0)?-1:0;\n      if(x > 0) this[0] = x;\n      else if(x < -1) this[0] = x+this.DV;\n      else this.t = 0;\n    }\n\n    // return bigint initialized to value\n    function nbv(i) { var r = nbi(); r.fromInt(i); return r; }\n\n    // (protected) set from string and radix\n    function bnpFromString(s,b) {\n      var k;\n      if(b == 16) k = 4;\n      else if(b == 8) k = 3;\n      else if(b == 256) k = 8; // byte array\n      else if(b == 2) k = 1;\n      else if(b == 32) k = 5;\n      else if(b == 4) k = 2;\n      else { this.fromRadix(s,b); return; }\n      this.t = 0;\n      this.s = 0;\n      var i = s.length, mi = false, sh = 0;\n      while(--i >= 0) {\n        var x = (k==8)?s[i]&0xff:intAt(s,i);\n        if(x < 0) {\n          if(s.charAt(i) == \"-\") mi = true;\n          continue;\n        }\n        mi = false;\n        if(sh == 0)\n          this[this.t++] = x;\n        else if(sh+k > this.DB) {\n          this[this.t-1] |= (x&((1<<(this.DB-sh))-1))<<sh;\n          this[this.t++] = (x>>(this.DB-sh));\n        }\n        else\n          this[this.t-1] |= x<<sh;\n        sh += k;\n        if(sh >= this.DB) sh -= this.DB;\n      }\n      if(k == 8 && (s[0]&0x80) != 0) {\n        this.s = -1;\n        if(sh > 0) this[this.t-1] |= ((1<<(this.DB-sh))-1)<<sh;\n      }\n      this.clamp();\n      if(mi) BigInteger.ZERO.subTo(this,this);\n    }\n\n    // (protected) clamp off excess high words\n    function bnpClamp() {\n      var c = this.s&this.DM;\n      while(this.t > 0 && this[this.t-1] == c) --this.t;\n    }\n\n    // (public) return string representation in given radix\n    function bnToString(b) {\n      if(this.s < 0) return \"-\"+this.negate().toString(b);\n      var k;\n      if(b == 16) k = 4;\n      else if(b == 8) k = 3;\n      else if(b == 2) k = 1;\n      else if(b == 32) k = 5;\n      else if(b == 4) k = 2;\n      else return this.toRadix(b);\n      var km = (1<<k)-1, d, m = false, r = \"\", i = this.t;\n      var p = this.DB-(i*this.DB)%k;\n      if(i-- > 0) {\n        if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\n        while(i >= 0) {\n          if(p < k) {\n            d = (this[i]&((1<<p)-1))<<(k-p);\n            d |= this[--i]>>(p+=this.DB-k);\n          }\n          else {\n            d = (this[i]>>(p-=k))&km;\n            if(p <= 0) { p += this.DB; --i; }\n          }\n          if(d > 0) m = true;\n          if(m) r += int2char(d);\n        }\n      }\n      return m?r:\"0\";\n    }\n\n    // (public) -this\n    function bnNegate() { var r = nbi(); BigInteger.ZERO.subTo(this,r); return r; }\n\n    // (public) |this|\n    function bnAbs() { return (this.s<0)?this.negate():this; }\n\n    // (public) return + if this > a, - if this < a, 0 if equal\n    function bnCompareTo(a) {\n      var r = this.s-a.s;\n      if(r != 0) return r;\n      var i = this.t;\n      r = i-a.t;\n      if(r != 0) return (this.s<0)?-r:r;\n      while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\n      return 0;\n    }\n\n    // returns bit length of the integer x\n    function nbits(x) {\n      var r = 1, t;\n      if((t=x>>>16) != 0) { x = t; r += 16; }\n      if((t=x>>8) != 0) { x = t; r += 8; }\n      if((t=x>>4) != 0) { x = t; r += 4; }\n      if((t=x>>2) != 0) { x = t; r += 2; }\n      if((t=x>>1) != 0) { x = t; r += 1; }\n      return r;\n    }\n\n    // (public) return the number of bits in \"this\"\n    function bnBitLength() {\n      if(this.t <= 0) return 0;\n      return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));\n    }\n\n    // (protected) r = this << n*DB\n    function bnpDLShiftTo(n,r) {\n      var i;\n      for(i = this.t-1; i >= 0; --i) r[i+n] = this[i];\n      for(i = n-1; i >= 0; --i) r[i] = 0;\n      r.t = this.t+n;\n      r.s = this.s;\n    }\n\n    // (protected) r = this >> n*DB\n    function bnpDRShiftTo(n,r) {\n      for(var i = n; i < this.t; ++i) r[i-n] = this[i];\n      r.t = Math.max(this.t-n,0);\n      r.s = this.s;\n    }\n\n    // (protected) r = this << n\n    function bnpLShiftTo(n,r) {\n      var bs = n%this.DB;\n      var cbs = this.DB-bs;\n      var bm = (1<<cbs)-1;\n      var ds = Math.floor(n/this.DB), c = (this.s<<bs)&this.DM, i;\n      for(i = this.t-1; i >= 0; --i) {\n        r[i+ds+1] = (this[i]>>cbs)|c;\n        c = (this[i]&bm)<<bs;\n      }\n      for(i = ds-1; i >= 0; --i) r[i] = 0;\n      r[ds] = c;\n      r.t = this.t+ds+1;\n      r.s = this.s;\n      r.clamp();\n    }\n\n    // (protected) r = this >> n\n    function bnpRShiftTo(n,r) {\n      r.s = this.s;\n      var ds = Math.floor(n/this.DB);\n      if(ds >= this.t) { r.t = 0; return; }\n      var bs = n%this.DB;\n      var cbs = this.DB-bs;\n      var bm = (1<<bs)-1;\n      r[0] = this[ds]>>bs;\n      for(var i = ds+1; i < this.t; ++i) {\n        r[i-ds-1] |= (this[i]&bm)<<cbs;\n        r[i-ds] = this[i]>>bs;\n      }\n      if(bs > 0) r[this.t-ds-1] |= (this.s&bm)<<cbs;\n      r.t = this.t-ds;\n      r.clamp();\n    }\n\n    // (protected) r = this - a\n    function bnpSubTo(a,r) {\n      var i = 0, c = 0, m = Math.min(a.t,this.t);\n      while(i < m) {\n        c += this[i]-a[i];\n        r[i++] = c&this.DM;\n        c >>= this.DB;\n      }\n      if(a.t < this.t) {\n        c -= a.s;\n        while(i < this.t) {\n          c += this[i];\n          r[i++] = c&this.DM;\n          c >>= this.DB;\n        }\n        c += this.s;\n      }\n      else {\n        c += this.s;\n        while(i < a.t) {\n          c -= a[i];\n          r[i++] = c&this.DM;\n          c >>= this.DB;\n        }\n        c -= a.s;\n      }\n      r.s = (c<0)?-1:0;\n      if(c < -1) r[i++] = this.DV+c;\n      else if(c > 0) r[i++] = c;\n      r.t = i;\n      r.clamp();\n    }\n\n    // (protected) r = this * a, r != this,a (HAC 14.12)\n    // \"this\" should be the larger one if appropriate.\n    function bnpMultiplyTo(a,r) {\n      var x = this.abs(), y = a.abs();\n      var i = x.t;\n      r.t = i+y.t;\n      while(--i >= 0) r[i] = 0;\n      for(i = 0; i < y.t; ++i) r[i+x.t] = x.am(0,y[i],r,i,0,x.t);\n      r.s = 0;\n      r.clamp();\n      if(this.s != a.s) BigInteger.ZERO.subTo(r,r);\n    }\n\n    // (protected) r = this^2, r != this (HAC 14.16)\n    function bnpSquareTo(r) {\n      var x = this.abs();\n      var i = r.t = 2*x.t;\n      while(--i >= 0) r[i] = 0;\n      for(i = 0; i < x.t-1; ++i) {\n        var c = x.am(i,x[i],r,2*i,0,1);\n        if((r[i+x.t]+=x.am(i+1,2*x[i],r,2*i+1,c,x.t-i-1)) >= x.DV) {\n          r[i+x.t] -= x.DV;\n          r[i+x.t+1] = 1;\n        }\n      }\n      if(r.t > 0) r[r.t-1] += x.am(i,x[i],r,2*i,0,1);\n      r.s = 0;\n      r.clamp();\n    }\n\n    // (protected) divide this by m, quotient and remainder to q, r (HAC 14.20)\n    // r != q, this != m.  q or r may be null.\n    function bnpDivRemTo(m,q,r) {\n      var pm = m.abs();\n      if(pm.t <= 0) return;\n      var pt = this.abs();\n      if(pt.t < pm.t) {\n        if(q != null) q.fromInt(0);\n        if(r != null) this.copyTo(r);\n        return;\n      }\n      if(r == null) r = nbi();\n      var y = nbi(), ts = this.s, ms = m.s;\n      var nsh = this.DB-nbits(pm[pm.t-1]);   // normalize modulus\n      if(nsh > 0) { pm.lShiftTo(nsh,y); pt.lShiftTo(nsh,r); }\n      else { pm.copyTo(y); pt.copyTo(r); }\n      var ys = y.t;\n      var y0 = y[ys-1];\n      if(y0 == 0) return;\n      var yt = y0*(1<<this.F1)+((ys>1)?y[ys-2]>>this.F2:0);\n      var d1 = this.FV/yt, d2 = (1<<this.F1)/yt, e = 1<<this.F2;\n      var i = r.t, j = i-ys, t = (q==null)?nbi():q;\n      y.dlShiftTo(j,t);\n      if(r.compareTo(t) >= 0) {\n        r[r.t++] = 1;\n        r.subTo(t,r);\n      }\n      BigInteger.ONE.dlShiftTo(ys,t);\n      t.subTo(y,y);  // \"negative\" y so we can replace sub with am later\n      while(y.t < ys) y[y.t++] = 0;\n      while(--j >= 0) {\n        // Estimate quotient digit\n        var qd = (r[--i]==y0)?this.DM:Math.floor(r[i]*d1+(r[i-1]+e)*d2);\n        if((r[i]+=y.am(0,qd,r,j,0,ys)) < qd) {   // Try it out\n          y.dlShiftTo(j,t);\n          r.subTo(t,r);\n          while(r[i] < --qd) r.subTo(t,r);\n        }\n      }\n      if(q != null) {\n        r.drShiftTo(ys,q);\n        if(ts != ms) BigInteger.ZERO.subTo(q,q);\n      }\n      r.t = ys;\n      r.clamp();\n      if(nsh > 0) r.rShiftTo(nsh,r); // Denormalize remainder\n      if(ts < 0) BigInteger.ZERO.subTo(r,r);\n    }\n\n    // (public) this mod a\n    function bnMod(a) {\n      var r = nbi();\n      this.abs().divRemTo(a,null,r);\n      if(this.s < 0 && r.compareTo(BigInteger.ZERO) > 0) a.subTo(r,r);\n      return r;\n    }\n\n    // Modular reduction using \"classic\" algorithm\n    function Classic(m) { this.m = m; }\n    function cConvert(x) {\n      if(x.s < 0 || x.compareTo(this.m) >= 0) return x.mod(this.m);\n      else return x;\n    }\n    function cRevert(x) { return x; }\n    function cReduce(x) { x.divRemTo(this.m,null,x); }\n    function cMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); }\n    function cSqrTo(x,r) { x.squareTo(r); this.reduce(r); }\n\n    Classic.prototype.convert = cConvert;\n    Classic.prototype.revert = cRevert;\n    Classic.prototype.reduce = cReduce;\n    Classic.prototype.mulTo = cMulTo;\n    Classic.prototype.sqrTo = cSqrTo;\n\n    // (protected) return \"-1/this % 2^DB\"; useful for Mont. reduction\n    // justification:\n    //         xy == 1 (mod m)\n    //         xy =  1+km\n    //   xy(2-xy) = (1+km)(1-km)\n    // x[y(2-xy)] = 1-k^2m^2\n    // x[y(2-xy)] == 1 (mod m^2)\n    // if y is 1/x mod m, then y(2-xy) is 1/x mod m^2\n    // should reduce x and y(2-xy) by m^2 at each step to keep size bounded.\n    // JS multiply \"overflows\" differently from C/C++, so care is needed here.\n    function bnpInvDigit() {\n      if(this.t < 1) return 0;\n      var x = this[0];\n      if((x&1) == 0) return 0;\n      var y = x&3;       // y == 1/x mod 2^2\n      y = (y*(2-(x&0xf)*y))&0xf; // y == 1/x mod 2^4\n      y = (y*(2-(x&0xff)*y))&0xff;   // y == 1/x mod 2^8\n      y = (y*(2-(((x&0xffff)*y)&0xffff)))&0xffff;    // y == 1/x mod 2^16\n      // last step - calculate inverse mod DV directly;\n      // assumes 16 < DB <= 32 and assumes ability to handle 48-bit ints\n      y = (y*(2-x*y%this.DV))%this.DV;       // y == 1/x mod 2^dbits\n      // we really want the negative inverse, and -DV < y < DV\n      return (y>0)?this.DV-y:-y;\n    }\n\n    // Montgomery reduction\n    function Montgomery(m) {\n      this.m = m;\n      this.mp = m.invDigit();\n      this.mpl = this.mp&0x7fff;\n      this.mph = this.mp>>15;\n      this.um = (1<<(m.DB-15))-1;\n      this.mt2 = 2*m.t;\n    }\n\n    // xR mod m\n    function montConvert(x) {\n      var r = nbi();\n      x.abs().dlShiftTo(this.m.t,r);\n      r.divRemTo(this.m,null,r);\n      if(x.s < 0 && r.compareTo(BigInteger.ZERO) > 0) this.m.subTo(r,r);\n      return r;\n    }\n\n    // x/R mod m\n    function montRevert(x) {\n      var r = nbi();\n      x.copyTo(r);\n      this.reduce(r);\n      return r;\n    }\n\n    // x = x/R mod m (HAC 14.32)\n    function montReduce(x) {\n      while(x.t <= this.mt2) // pad x so am has enough room later\n        x[x.t++] = 0;\n      for(var i = 0; i < this.m.t; ++i) {\n        // faster way of calculating u0 = x[i]*mp mod DV\n        var j = x[i]&0x7fff;\n        var u0 = (j*this.mpl+(((j*this.mph+(x[i]>>15)*this.mpl)&this.um)<<15))&x.DM;\n        // use am to combine the multiply-shift-add into one call\n        j = i+this.m.t;\n        x[j] += this.m.am(0,u0,x,i,0,this.m.t);\n        // propagate carry\n        while(x[j] >= x.DV) { x[j] -= x.DV; x[++j]++; }\n      }\n      x.clamp();\n      x.drShiftTo(this.m.t,x);\n      if(x.compareTo(this.m) >= 0) x.subTo(this.m,x);\n    }\n\n    // r = \"x^2/R mod m\"; x != r\n    function montSqrTo(x,r) { x.squareTo(r); this.reduce(r); }\n\n    // r = \"xy/R mod m\"; x,y != r\n    function montMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); }\n\n    Montgomery.prototype.convert = montConvert;\n    Montgomery.prototype.revert = montRevert;\n    Montgomery.prototype.reduce = montReduce;\n    Montgomery.prototype.mulTo = montMulTo;\n    Montgomery.prototype.sqrTo = montSqrTo;\n\n    // (protected) true iff this is even\n    function bnpIsEven() { return ((this.t>0)?(this[0]&1):this.s) == 0; }\n\n    // (protected) this^e, e < 2^32, doing sqr and mul with \"r\" (HAC 14.79)\n    function bnpExp(e,z) {\n      if(e > 0xffffffff || e < 1) return BigInteger.ONE;\n      var r = nbi(), r2 = nbi(), g = z.convert(this), i = nbits(e)-1;\n      g.copyTo(r);\n      while(--i >= 0) {\n        z.sqrTo(r,r2);\n        if((e&(1<<i)) > 0) z.mulTo(r2,g,r);\n        else { var t = r; r = r2; r2 = t; }\n      }\n      return z.revert(r);\n    }\n\n    // (public) this^e % m, 0 <= e < 2^32\n    function bnModPowInt(e,m) {\n      var z;\n      if(e < 256 || m.isEven()) z = new Classic(m); else z = new Montgomery(m);\n      return this.exp(e,z);\n    }\n\n    // protected\n    BigInteger.prototype.copyTo = bnpCopyTo;\n    BigInteger.prototype.fromInt = bnpFromInt;\n    BigInteger.prototype.fromString = bnpFromString;\n    BigInteger.prototype.clamp = bnpClamp;\n    BigInteger.prototype.dlShiftTo = bnpDLShiftTo;\n    BigInteger.prototype.drShiftTo = bnpDRShiftTo;\n    BigInteger.prototype.lShiftTo = bnpLShiftTo;\n    BigInteger.prototype.rShiftTo = bnpRShiftTo;\n    BigInteger.prototype.subTo = bnpSubTo;\n    BigInteger.prototype.multiplyTo = bnpMultiplyTo;\n    BigInteger.prototype.squareTo = bnpSquareTo;\n    BigInteger.prototype.divRemTo = bnpDivRemTo;\n    BigInteger.prototype.invDigit = bnpInvDigit;\n    BigInteger.prototype.isEven = bnpIsEven;\n    BigInteger.prototype.exp = bnpExp;\n\n    // public\n    BigInteger.prototype.toString = bnToString;\n    BigInteger.prototype.negate = bnNegate;\n    BigInteger.prototype.abs = bnAbs;\n    BigInteger.prototype.compareTo = bnCompareTo;\n    BigInteger.prototype.bitLength = bnBitLength;\n    BigInteger.prototype.mod = bnMod;\n    BigInteger.prototype.modPowInt = bnModPowInt;\n\n    // \"constants\"\n    BigInteger.ZERO = nbv(0);\n    BigInteger.ONE = nbv(1);\n\n    // Copyright (c) 2005-2009  Tom Wu\n    // All Rights Reserved.\n    // See \"LICENSE\" for details.\n\n    // Extended JavaScript BN functions, required for RSA private ops.\n\n    // Version 1.1: new BigInteger(\"0\", 10) returns \"proper\" zero\n    // Version 1.2: square() API, isProbablePrime fix\n\n    // (public)\n    function bnClone() { var r = nbi(); this.copyTo(r); return r; }\n\n    // (public) return value as integer\n    function bnIntValue() {\n      if(this.s < 0) {\n        if(this.t == 1) return this[0]-this.DV;\n        else if(this.t == 0) return -1;\n      }\n      else if(this.t == 1) return this[0];\n      else if(this.t == 0) return 0;\n      // assumes 16 < DB < 32\n      return ((this[1]&((1<<(32-this.DB))-1))<<this.DB)|this[0];\n    }\n\n    // (public) return value as byte\n    function bnByteValue() { return (this.t==0)?this.s:(this[0]<<24)>>24; }\n\n    // (public) return value as short (assumes DB>=16)\n    function bnShortValue() { return (this.t==0)?this.s:(this[0]<<16)>>16; }\n\n    // (protected) return x s.t. r^x < DV\n    function bnpChunkSize(r) { return Math.floor(Math.LN2*this.DB/Math.log(r)); }\n\n    // (public) 0 if this == 0, 1 if this > 0\n    function bnSigNum() {\n      if(this.s < 0) return -1;\n      else if(this.t <= 0 || (this.t == 1 && this[0] <= 0)) return 0;\n      else return 1;\n    }\n\n    // (protected) convert to radix string\n    function bnpToRadix(b) {\n      if(b == null) b = 10;\n      if(this.signum() == 0 || b < 2 || b > 36) return \"0\";\n      var cs = this.chunkSize(b);\n      var a = Math.pow(b,cs);\n      var d = nbv(a), y = nbi(), z = nbi(), r = \"\";\n      this.divRemTo(d,y,z);\n      while(y.signum() > 0) {\n        r = (a+z.intValue()).toString(b).substr(1) + r;\n        y.divRemTo(d,y,z);\n      }\n      return z.intValue().toString(b) + r;\n    }\n\n    // (protected) convert from radix string\n    function bnpFromRadix(s,b) {\n      this.fromInt(0);\n      if(b == null) b = 10;\n      var cs = this.chunkSize(b);\n      var d = Math.pow(b,cs), mi = false, j = 0, w = 0;\n      for(var i = 0; i < s.length; ++i) {\n        var x = intAt(s,i);\n        if(x < 0) {\n          if(s.charAt(i) == \"-\" && this.signum() == 0) mi = true;\n          continue;\n        }\n        w = b*w+x;\n        if(++j >= cs) {\n          this.dMultiply(d);\n          this.dAddOffset(w,0);\n          j = 0;\n          w = 0;\n        }\n      }\n      if(j > 0) {\n        this.dMultiply(Math.pow(b,j));\n        this.dAddOffset(w,0);\n      }\n      if(mi) BigInteger.ZERO.subTo(this,this);\n    }\n\n    // (protected) alternate constructor\n    function bnpFromNumber(a,b,c) {\n      if(\"number\" == typeof b) {\n        // new BigInteger(int,int,RNG)\n        if(a < 2) this.fromInt(1);\n        else {\n          this.fromNumber(a,c);\n          if(!this.testBit(a-1))    // force MSB set\n            this.bitwiseTo(BigInteger.ONE.shiftLeft(a-1),op_or,this);\n          if(this.isEven()) this.dAddOffset(1,0); // force odd\n          while(!this.isProbablePrime(b)) {\n            this.dAddOffset(2,0);\n            if(this.bitLength() > a) this.subTo(BigInteger.ONE.shiftLeft(a-1),this);\n          }\n        }\n      }\n      else {\n        // new BigInteger(int,RNG)\n        var x = new Array(), t = a&7;\n        x.length = (a>>3)+1;\n        b.nextBytes(x);\n        if(t > 0) x[0] &= ((1<<t)-1); else x[0] = 0;\n        this.fromString(x,256);\n      }\n    }\n\n    // (public) convert to bigendian byte array\n    function bnToByteArray() {\n      var i = this.t, r = new Array();\n      r[0] = this.s;\n      var p = this.DB-(i*this.DB)%8, d, k = 0;\n      if(i-- > 0) {\n        if(p < this.DB && (d = this[i]>>p) != (this.s&this.DM)>>p)\n          r[k++] = d|(this.s<<(this.DB-p));\n        while(i >= 0) {\n          if(p < 8) {\n            d = (this[i]&((1<<p)-1))<<(8-p);\n            d |= this[--i]>>(p+=this.DB-8);\n          }\n          else {\n            d = (this[i]>>(p-=8))&0xff;\n            if(p <= 0) { p += this.DB; --i; }\n          }\n          if((d&0x80) != 0) d |= -256;\n          if(k == 0 && (this.s&0x80) != (d&0x80)) ++k;\n          if(k > 0 || d != this.s) r[k++] = d;\n        }\n      }\n      return r;\n    }\n\n    function bnEquals(a) { return(this.compareTo(a)==0); }\n    function bnMin(a) { return(this.compareTo(a)<0)?this:a; }\n    function bnMax(a) { return(this.compareTo(a)>0)?this:a; }\n\n    // (protected) r = this op a (bitwise)\n    function bnpBitwiseTo(a,op,r) {\n      var i, f, m = Math.min(a.t,this.t);\n      for(i = 0; i < m; ++i) r[i] = op(this[i],a[i]);\n      if(a.t < this.t) {\n        f = a.s&this.DM;\n        for(i = m; i < this.t; ++i) r[i] = op(this[i],f);\n        r.t = this.t;\n      }\n      else {\n        f = this.s&this.DM;\n        for(i = m; i < a.t; ++i) r[i] = op(f,a[i]);\n        r.t = a.t;\n      }\n      r.s = op(this.s,a.s);\n      r.clamp();\n    }\n\n    // (public) this & a\n    function op_and(x,y) { return x&y; }\n    function bnAnd(a) { var r = nbi(); this.bitwiseTo(a,op_and,r); return r; }\n\n    // (public) this | a\n    function op_or(x,y) { return x|y; }\n    function bnOr(a) { var r = nbi(); this.bitwiseTo(a,op_or,r); return r; }\n\n    // (public) this ^ a\n    function op_xor(x,y) { return x^y; }\n    function bnXor(a) { var r = nbi(); this.bitwiseTo(a,op_xor,r); return r; }\n\n    // (public) this & ~a\n    function op_andnot(x,y) { return x&~y; }\n    function bnAndNot(a) { var r = nbi(); this.bitwiseTo(a,op_andnot,r); return r; }\n\n    // (public) ~this\n    function bnNot() {\n      var r = nbi();\n      for(var i = 0; i < this.t; ++i) r[i] = this.DM&~this[i];\n      r.t = this.t;\n      r.s = ~this.s;\n      return r;\n    }\n\n    // (public) this << n\n    function bnShiftLeft(n) {\n      var r = nbi();\n      if(n < 0) this.rShiftTo(-n,r); else this.lShiftTo(n,r);\n      return r;\n    }\n\n    // (public) this >> n\n    function bnShiftRight(n) {\n      var r = nbi();\n      if(n < 0) this.lShiftTo(-n,r); else this.rShiftTo(n,r);\n      return r;\n    }\n\n    // return index of lowest 1-bit in x, x < 2^31\n    function lbit(x) {\n      if(x == 0) return -1;\n      var r = 0;\n      if((x&0xffff) == 0) { x >>= 16; r += 16; }\n      if((x&0xff) == 0) { x >>= 8; r += 8; }\n      if((x&0xf) == 0) { x >>= 4; r += 4; }\n      if((x&3) == 0) { x >>= 2; r += 2; }\n      if((x&1) == 0) ++r;\n      return r;\n    }\n\n    // (public) returns index of lowest 1-bit (or -1 if none)\n    function bnGetLowestSetBit() {\n      for(var i = 0; i < this.t; ++i)\n        if(this[i] != 0) return i*this.DB+lbit(this[i]);\n      if(this.s < 0) return this.t*this.DB;\n      return -1;\n    }\n\n    // return number of 1 bits in x\n    function cbit(x) {\n      var r = 0;\n      while(x != 0) { x &= x-1; ++r; }\n      return r;\n    }\n\n    // (public) return number of set bits\n    function bnBitCount() {\n      var r = 0, x = this.s&this.DM;\n      for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\n      return r;\n    }\n\n    // (public) true iff nth bit is set\n    function bnTestBit(n) {\n      var j = Math.floor(n/this.DB);\n      if(j >= this.t) return(this.s!=0);\n      return((this[j]&(1<<(n%this.DB)))!=0);\n    }\n\n    // (protected) this op (1<<n)\n    function bnpChangeBit(n,op) {\n      var r = BigInteger.ONE.shiftLeft(n);\n      this.bitwiseTo(r,op,r);\n      return r;\n    }\n\n    // (public) this | (1<<n)\n    function bnSetBit(n) { return this.changeBit(n,op_or); }\n\n    // (public) this & ~(1<<n)\n    function bnClearBit(n) { return this.changeBit(n,op_andnot); }\n\n    // (public) this ^ (1<<n)\n    function bnFlipBit(n) { return this.changeBit(n,op_xor); }\n\n    // (protected) r = this + a\n    function bnpAddTo(a,r) {\n      var i = 0, c = 0, m = Math.min(a.t,this.t);\n      while(i < m) {\n        c += this[i]+a[i];\n        r[i++] = c&this.DM;\n        c >>= this.DB;\n      }\n      if(a.t < this.t) {\n        c += a.s;\n        while(i < this.t) {\n          c += this[i];\n          r[i++] = c&this.DM;\n          c >>= this.DB;\n        }\n        c += this.s;\n      }\n      else {\n        c += this.s;\n        while(i < a.t) {\n          c += a[i];\n          r[i++] = c&this.DM;\n          c >>= this.DB;\n        }\n        c += a.s;\n      }\n      r.s = (c<0)?-1:0;\n      if(c > 0) r[i++] = c;\n      else if(c < -1) r[i++] = this.DV+c;\n      r.t = i;\n      r.clamp();\n    }\n\n    // (public) this + a\n    function bnAdd(a) { var r = nbi(); this.addTo(a,r); return r; }\n\n    // (public) this - a\n    function bnSubtract(a) { var r = nbi(); this.subTo(a,r); return r; }\n\n    // (public) this * a\n    function bnMultiply(a) { var r = nbi(); this.multiplyTo(a,r); return r; }\n\n    // (public) this^2\n    function bnSquare() { var r = nbi(); this.squareTo(r); return r; }\n\n    // (public) this / a\n    function bnDivide(a) { var r = nbi(); this.divRemTo(a,r,null); return r; }\n\n    // (public) this % a\n    function bnRemainder(a) { var r = nbi(); this.divRemTo(a,null,r); return r; }\n\n    // (public) [this/a,this%a]\n    function bnDivideAndRemainder(a) {\n      var q = nbi(), r = nbi();\n      this.divRemTo(a,q,r);\n      return new Array(q,r);\n    }\n\n    // (protected) this *= n, this >= 0, 1 < n < DV\n    function bnpDMultiply(n) {\n      this[this.t] = this.am(0,n-1,this,0,0,this.t);\n      ++this.t;\n      this.clamp();\n    }\n\n    // (protected) this += n << w words, this >= 0\n    function bnpDAddOffset(n,w) {\n      if(n == 0) return;\n      while(this.t <= w) this[this.t++] = 0;\n      this[w] += n;\n      while(this[w] >= this.DV) {\n        this[w] -= this.DV;\n        if(++w >= this.t) this[this.t++] = 0;\n        ++this[w];\n      }\n    }\n\n    // A \"null\" reducer\n    function NullExp() {}\n    function nNop(x) { return x; }\n    function nMulTo(x,y,r) { x.multiplyTo(y,r); }\n    function nSqrTo(x,r) { x.squareTo(r); }\n\n    NullExp.prototype.convert = nNop;\n    NullExp.prototype.revert = nNop;\n    NullExp.prototype.mulTo = nMulTo;\n    NullExp.prototype.sqrTo = nSqrTo;\n\n    // (public) this^e\n    function bnPow(e) { return this.exp(e,new NullExp()); }\n\n    // (protected) r = lower n words of \"this * a\", a.t <= n\n    // \"this\" should be the larger one if appropriate.\n    function bnpMultiplyLowerTo(a,n,r) {\n      var i = Math.min(this.t+a.t,n);\n      r.s = 0; // assumes a,this >= 0\n      r.t = i;\n      while(i > 0) r[--i] = 0;\n      var j;\n      for(j = r.t-this.t; i < j; ++i) r[i+this.t] = this.am(0,a[i],r,i,0,this.t);\n      for(j = Math.min(a.t,n); i < j; ++i) this.am(0,a[i],r,i,0,n-i);\n      r.clamp();\n    }\n\n    // (protected) r = \"this * a\" without lower n words, n > 0\n    // \"this\" should be the larger one if appropriate.\n    function bnpMultiplyUpperTo(a,n,r) {\n      --n;\n      var i = r.t = this.t+a.t-n;\n      r.s = 0; // assumes a,this >= 0\n      while(--i >= 0) r[i] = 0;\n      for(i = Math.max(n-this.t,0); i < a.t; ++i)\n        r[this.t+i-n] = this.am(n-i,a[i],r,0,0,this.t+i-n);\n      r.clamp();\n      r.drShiftTo(1,r);\n    }\n\n    // Barrett modular reduction\n    function Barrett(m) {\n      // setup Barrett\n      this.r2 = nbi();\n      this.q3 = nbi();\n      BigInteger.ONE.dlShiftTo(2*m.t,this.r2);\n      this.mu = this.r2.divide(m);\n      this.m = m;\n    }\n\n    function barrettConvert(x) {\n      if(x.s < 0 || x.t > 2*this.m.t) return x.mod(this.m);\n      else if(x.compareTo(this.m) < 0) return x;\n      else { var r = nbi(); x.copyTo(r); this.reduce(r); return r; }\n    }\n\n    function barrettRevert(x) { return x; }\n\n    // x = x mod m (HAC 14.42)\n    function barrettReduce(x) {\n      x.drShiftTo(this.m.t-1,this.r2);\n      if(x.t > this.m.t+1) { x.t = this.m.t+1; x.clamp(); }\n      this.mu.multiplyUpperTo(this.r2,this.m.t+1,this.q3);\n      this.m.multiplyLowerTo(this.q3,this.m.t+1,this.r2);\n      while(x.compareTo(this.r2) < 0) x.dAddOffset(1,this.m.t+1);\n      x.subTo(this.r2,x);\n      while(x.compareTo(this.m) >= 0) x.subTo(this.m,x);\n    }\n\n    // r = x^2 mod m; x != r\n    function barrettSqrTo(x,r) { x.squareTo(r); this.reduce(r); }\n\n    // r = x*y mod m; x,y != r\n    function barrettMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); }\n\n    Barrett.prototype.convert = barrettConvert;\n    Barrett.prototype.revert = barrettRevert;\n    Barrett.prototype.reduce = barrettReduce;\n    Barrett.prototype.mulTo = barrettMulTo;\n    Barrett.prototype.sqrTo = barrettSqrTo;\n\n    // (public) this^e % m (HAC 14.85)\n    function bnModPow(e,m) {\n      var i = e.bitLength(), k, r = nbv(1), z;\n      if(i <= 0) return r;\n      else if(i < 18) k = 1;\n      else if(i < 48) k = 3;\n      else if(i < 144) k = 4;\n      else if(i < 768) k = 5;\n      else k = 6;\n      if(i < 8)\n        z = new Classic(m);\n      else if(m.isEven())\n        z = new Barrett(m);\n      else\n        z = new Montgomery(m);\n\n      // precomputation\n      var g = new Array(), n = 3, k1 = k-1, km = (1<<k)-1;\n      g[1] = z.convert(this);\n      if(k > 1) {\n        var g2 = nbi();\n        z.sqrTo(g[1],g2);\n        while(n <= km) {\n          g[n] = nbi();\n          z.mulTo(g2,g[n-2],g[n]);\n          n += 2;\n        }\n      }\n\n      var j = e.t-1, w, is1 = true, r2 = nbi(), t;\n      i = nbits(e[j])-1;\n      while(j >= 0) {\n        if(i >= k1) w = (e[j]>>(i-k1))&km;\n        else {\n          w = (e[j]&((1<<(i+1))-1))<<(k1-i);\n          if(j > 0) w |= e[j-1]>>(this.DB+i-k1);\n        }\n\n        n = k;\n        while((w&1) == 0) { w >>= 1; --n; }\n        if((i -= n) < 0) { i += this.DB; --j; }\n        if(is1) {    // ret == 1, don't bother squaring or multiplying it\n          g[w].copyTo(r);\n          is1 = false;\n        }\n        else {\n          while(n > 1) { z.sqrTo(r,r2); z.sqrTo(r2,r); n -= 2; }\n          if(n > 0) z.sqrTo(r,r2); else { t = r; r = r2; r2 = t; }\n          z.mulTo(r2,g[w],r);\n        }\n\n        while(j >= 0 && (e[j]&(1<<i)) == 0) {\n          z.sqrTo(r,r2); t = r; r = r2; r2 = t;\n          if(--i < 0) { i = this.DB-1; --j; }\n        }\n      }\n      return z.revert(r);\n    }\n\n    // (public) gcd(this,a) (HAC 14.54)\n    function bnGCD(a) {\n      var x = (this.s<0)?this.negate():this.clone();\n      var y = (a.s<0)?a.negate():a.clone();\n      if(x.compareTo(y) < 0) { var t = x; x = y; y = t; }\n      var i = x.getLowestSetBit(), g = y.getLowestSetBit();\n      if(g < 0) return x;\n      if(i < g) g = i;\n      if(g > 0) {\n        x.rShiftTo(g,x);\n        y.rShiftTo(g,y);\n      }\n      while(x.signum() > 0) {\n        if((i = x.getLowestSetBit()) > 0) x.rShiftTo(i,x);\n        if((i = y.getLowestSetBit()) > 0) y.rShiftTo(i,y);\n        if(x.compareTo(y) >= 0) {\n          x.subTo(y,x);\n          x.rShiftTo(1,x);\n        }\n        else {\n          y.subTo(x,y);\n          y.rShiftTo(1,y);\n        }\n      }\n      if(g > 0) y.lShiftTo(g,y);\n      return y;\n    }\n\n    // (protected) this % n, n < 2^26\n    function bnpModInt(n) {\n      if(n <= 0) return 0;\n      var d = this.DV%n, r = (this.s<0)?n-1:0;\n      if(this.t > 0)\n        if(d == 0) r = this[0]%n;\n        else for(var i = this.t-1; i >= 0; --i) r = (d*r+this[i])%n;\n      return r;\n    }\n\n    // (public) 1/this % m (HAC 14.61)\n    function bnModInverse(m) {\n      var ac = m.isEven();\n      if((this.isEven() && ac) || m.signum() == 0) return BigInteger.ZERO;\n      var u = m.clone(), v = this.clone();\n      var a = nbv(1), b = nbv(0), c = nbv(0), d = nbv(1);\n      while(u.signum() != 0) {\n        while(u.isEven()) {\n          u.rShiftTo(1,u);\n          if(ac) {\n            if(!a.isEven() || !b.isEven()) { a.addTo(this,a); b.subTo(m,b); }\n            a.rShiftTo(1,a);\n          }\n          else if(!b.isEven()) b.subTo(m,b);\n          b.rShiftTo(1,b);\n        }\n        while(v.isEven()) {\n          v.rShiftTo(1,v);\n          if(ac) {\n            if(!c.isEven() || !d.isEven()) { c.addTo(this,c); d.subTo(m,d); }\n            c.rShiftTo(1,c);\n          }\n          else if(!d.isEven()) d.subTo(m,d);\n          d.rShiftTo(1,d);\n        }\n        if(u.compareTo(v) >= 0) {\n          u.subTo(v,u);\n          if(ac) a.subTo(c,a);\n          b.subTo(d,b);\n        }\n        else {\n          v.subTo(u,v);\n          if(ac) c.subTo(a,c);\n          d.subTo(b,d);\n        }\n      }\n      if(v.compareTo(BigInteger.ONE) != 0) return BigInteger.ZERO;\n      if(d.compareTo(m) >= 0) return d.subtract(m);\n      if(d.signum() < 0) d.addTo(m,d); else return d;\n      if(d.signum() < 0) return d.add(m); else return d;\n    }\n\n    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];\n    var lplim = (1<<26)/lowprimes[lowprimes.length-1];\n\n    // (public) test primality with certainty >= 1-.5^t\n    function bnIsProbablePrime(t) {\n      var i, x = this.abs();\n      if(x.t == 1 && x[0] <= lowprimes[lowprimes.length-1]) {\n        for(i = 0; i < lowprimes.length; ++i)\n          if(x[0] == lowprimes[i]) return true;\n        return false;\n      }\n      if(x.isEven()) return false;\n      i = 1;\n      while(i < lowprimes.length) {\n        var m = lowprimes[i], j = i+1;\n        while(j < lowprimes.length && m < lplim) m *= lowprimes[j++];\n        m = x.modInt(m);\n        while(i < j) if(m%lowprimes[i++] == 0) return false;\n      }\n      return x.millerRabin(t);\n    }\n\n    // (protected) true if probably prime (HAC 4.24, Miller-Rabin)\n    function bnpMillerRabin(t) {\n      var n1 = this.subtract(BigInteger.ONE);\n      var k = n1.getLowestSetBit();\n      if(k <= 0) return false;\n      var r = n1.shiftRight(k);\n      t = (t+1)>>1;\n      if(t > lowprimes.length) t = lowprimes.length;\n      var a = nbi();\n      for(var i = 0; i < t; ++i) {\n        //Pick bases at random, instead of starting at 2\n        a.fromInt(lowprimes[Math.floor(Math.random()*lowprimes.length)]);\n        var y = a.modPow(r,this);\n        if(y.compareTo(BigInteger.ONE) != 0 && y.compareTo(n1) != 0) {\n          var j = 1;\n          while(j++ < k && y.compareTo(n1) != 0) {\n            y = y.modPowInt(2,this);\n            if(y.compareTo(BigInteger.ONE) == 0) return false;\n          }\n          if(y.compareTo(n1) != 0) return false;\n        }\n      }\n      return true;\n    }\n\n    // protected\n    BigInteger.prototype.chunkSize = bnpChunkSize;\n    BigInteger.prototype.toRadix = bnpToRadix;\n    BigInteger.prototype.fromRadix = bnpFromRadix;\n    BigInteger.prototype.fromNumber = bnpFromNumber;\n    BigInteger.prototype.bitwiseTo = bnpBitwiseTo;\n    BigInteger.prototype.changeBit = bnpChangeBit;\n    BigInteger.prototype.addTo = bnpAddTo;\n    BigInteger.prototype.dMultiply = bnpDMultiply;\n    BigInteger.prototype.dAddOffset = bnpDAddOffset;\n    BigInteger.prototype.multiplyLowerTo = bnpMultiplyLowerTo;\n    BigInteger.prototype.multiplyUpperTo = bnpMultiplyUpperTo;\n    BigInteger.prototype.modInt = bnpModInt;\n    BigInteger.prototype.millerRabin = bnpMillerRabin;\n\n    // public\n    BigInteger.prototype.clone = bnClone;\n    BigInteger.prototype.intValue = bnIntValue;\n    BigInteger.prototype.byteValue = bnByteValue;\n    BigInteger.prototype.shortValue = bnShortValue;\n    BigInteger.prototype.signum = bnSigNum;\n    BigInteger.prototype.toByteArray = bnToByteArray;\n    BigInteger.prototype.equals = bnEquals;\n    BigInteger.prototype.min = bnMin;\n    BigInteger.prototype.max = bnMax;\n    BigInteger.prototype.and = bnAnd;\n    BigInteger.prototype.or = bnOr;\n    BigInteger.prototype.xor = bnXor;\n    BigInteger.prototype.andNot = bnAndNot;\n    BigInteger.prototype.not = bnNot;\n    BigInteger.prototype.shiftLeft = bnShiftLeft;\n    BigInteger.prototype.shiftRight = bnShiftRight;\n    BigInteger.prototype.getLowestSetBit = bnGetLowestSetBit;\n    BigInteger.prototype.bitCount = bnBitCount;\n    BigInteger.prototype.testBit = bnTestBit;\n    BigInteger.prototype.setBit = bnSetBit;\n    BigInteger.prototype.clearBit = bnClearBit;\n    BigInteger.prototype.flipBit = bnFlipBit;\n    BigInteger.prototype.add = bnAdd;\n    BigInteger.prototype.subtract = bnSubtract;\n    BigInteger.prototype.multiply = bnMultiply;\n    BigInteger.prototype.divide = bnDivide;\n    BigInteger.prototype.remainder = bnRemainder;\n    BigInteger.prototype.divideAndRemainder = bnDivideAndRemainder;\n    BigInteger.prototype.modPow = bnModPow;\n    BigInteger.prototype.modInverse = bnModInverse;\n    BigInteger.prototype.pow = bnPow;\n    BigInteger.prototype.gcd = bnGCD;\n    BigInteger.prototype.isProbablePrime = bnIsProbablePrime;\n\n    // JSBN-specific extension\n    BigInteger.prototype.square = bnSquare;\n\n    // Expose the Barrett function\n    BigInteger.prototype.Barrett = Barrett\n\n    // BigInteger interfaces not implemented in jsbn:\n\n    // BigInteger(int signum, byte[] magnitude)\n    // double doubleValue()\n    // float floatValue()\n    // int hashCode()\n    // long longValue()\n    // static BigInteger valueOf(long val)\n\n    // Random number generator - requires a PRNG backend, e.g. prng4.js\n\n    // For best results, put code like\n    // <body onClick='rng_seed_time();' onKeyPress='rng_seed_time();'>\n    // in your main HTML document.\n\n    var rng_state;\n    var rng_pool;\n    var rng_pptr;\n\n    // Mix in a 32-bit integer into the pool\n    function rng_seed_int(x) {\n      rng_pool[rng_pptr++] ^= x & 255;\n      rng_pool[rng_pptr++] ^= (x >> 8) & 255;\n      rng_pool[rng_pptr++] ^= (x >> 16) & 255;\n      rng_pool[rng_pptr++] ^= (x >> 24) & 255;\n      if(rng_pptr >= rng_psize) rng_pptr -= rng_psize;\n    }\n\n    // Mix in the current time (w/milliseconds) into the pool\n    function rng_seed_time() {\n      rng_seed_int(new Date().getTime());\n    }\n\n    // Initialize the pool with junk if needed.\n    if(rng_pool == null) {\n      rng_pool = new Array();\n      rng_pptr = 0;\n      var t;\n      if(typeof window !== \"undefined\" && window.crypto) {\n        if (window.crypto.getRandomValues) {\n          // Use webcrypto if available\n          var ua = new Uint8Array(32);\n          window.crypto.getRandomValues(ua);\n          for(t = 0; t < 32; ++t)\n            rng_pool[rng_pptr++] = ua[t];\n        }\n        else if(navigator.appName == \"Netscape\" && navigator.appVersion < \"5\") {\n          // Extract entropy (256 bits) from NS4 RNG if available\n          var z = window.crypto.random(32);\n          for(t = 0; t < z.length; ++t)\n            rng_pool[rng_pptr++] = z.charCodeAt(t) & 255;\n        }\n      }\n      while(rng_pptr < rng_psize) {  // extract some randomness from Math.random()\n        t = Math.floor(65536 * Math.random());\n        rng_pool[rng_pptr++] = t >>> 8;\n        rng_pool[rng_pptr++] = t & 255;\n      }\n      rng_pptr = 0;\n      rng_seed_time();\n      //rng_seed_int(window.screenX);\n      //rng_seed_int(window.screenY);\n    }\n\n    function rng_get_byte() {\n      if(rng_state == null) {\n        rng_seed_time();\n        rng_state = prng_newstate();\n        rng_state.init(rng_pool);\n        for(rng_pptr = 0; rng_pptr < rng_pool.length; ++rng_pptr)\n          rng_pool[rng_pptr] = 0;\n        rng_pptr = 0;\n        //rng_pool = null;\n      }\n      // TODO: allow reseeding after first request\n      return rng_state.next();\n    }\n\n    function rng_get_bytes(ba) {\n      var i;\n      for(i = 0; i < ba.length; ++i) ba[i] = rng_get_byte();\n    }\n\n    function SecureRandom() {}\n\n    SecureRandom.prototype.nextBytes = rng_get_bytes;\n\n    // prng4.js - uses Arcfour as a PRNG\n\n    function Arcfour() {\n      this.i = 0;\n      this.j = 0;\n      this.S = new Array();\n    }\n\n    // Initialize arcfour context from key, an array of ints, each from [0..255]\n    function ARC4init(key) {\n      var i, j, t;\n      for(i = 0; i < 256; ++i)\n        this.S[i] = i;\n      j = 0;\n      for(i = 0; i < 256; ++i) {\n        j = (j + this.S[i] + key[i % key.length]) & 255;\n        t = this.S[i];\n        this.S[i] = this.S[j];\n        this.S[j] = t;\n      }\n      this.i = 0;\n      this.j = 0;\n    }\n\n    function ARC4next() {\n      var t;\n      this.i = (this.i + 1) & 255;\n      this.j = (this.j + this.S[this.i]) & 255;\n      t = this.S[this.i];\n      this.S[this.i] = this.S[this.j];\n      this.S[this.j] = t;\n      return this.S[(t + this.S[this.i]) & 255];\n    }\n\n    Arcfour.prototype.init = ARC4init;\n    Arcfour.prototype.next = ARC4next;\n\n    // Plug in your RNG constructor here\n    function prng_newstate() {\n      return new Arcfour();\n    }\n\n    // Pool size must be a multiple of 4 and greater than 32.\n    // An array of bytes the size of the pool will be passed to init()\n    var rng_psize = 256;\n\n    if (typeof exports !== 'undefined') {\n        exports = module.exports = {\n            default: BigInteger,\n            BigInteger: BigInteger,\n            SecureRandom: SecureRandom,\n        };\n    } else {\n        this.jsbn = {\n          BigInteger: BigInteger,\n          SecureRandom: SecureRandom\n        };\n    }\n\n}).call(this);\n"],"names":["dbits","canary","j_lm","BigInteger","a","b","c","nbi","am1","i","x","w","j","v","am2","xl","xh","l","h","m","am3","inBrowser","BI_FP","BI_RM","BI_RC","rr","vv","int2char","n","intAt","s","bnpCopyTo","r","bnpFromInt","nbv","bnpFromString","k","mi","sh","bnpClamp","bnToString","km","d","p","bnNegate","bnAbs","bnCompareTo","nbits","t","bnBitLength","bnpDLShiftTo","bnpDRShiftTo","bnpLShiftTo","bs","cbs","bm","ds","bnpRShiftTo","bnpSubTo","bnpMultiplyTo","y","bnpSquareTo","bnpDivRemTo","q","pm","pt","ts","ms","nsh","ys","y0","yt","d1","d2","e","qd","bnMod","Classic","cConvert","cRevert","cReduce","cMulTo","cSqrTo","bnpInvDigit","Montgomery","montConvert","montRevert","montReduce","u0","montSqrTo","montMulTo","bnpIsEven","bnpExp","z","r2","g","bnModPowInt","bnClone","bnIntValue","bnByteValue","bnShortValue","bnpChunkSize","bnSigNum","bnpToRadix","cs","bnpFromRadix","bnpFromNumber","op_or","bnToByteArray","bnEquals","bnMin","bnMax","bnpBitwiseTo","op","f","op_and","bnAnd","bnOr","op_xor","bnXor","op_andnot","bnAndNot","bnNot","bnShiftLeft","bnShiftRight","lbit","bnGetLowestSetBit","cbit","bnBitCount","bnTestBit","bnpChangeBit","bnSetBit","bnClearBit","bnFlipBit","bnpAddTo","bnAdd","bnSubtract","bnMultiply","bnSquare","bnDivide","bnRemainder","bnDivideAndRemainder","bnpDMultiply","bnpDAddOffset","NullExp","nNop","nMulTo","nSqrTo","bnPow","bnpMultiplyLowerTo","bnpMultiplyUpperTo","Barrett","barrettConvert","barrettRevert","barrettReduce","barrettSqrTo","barrettMulTo","bnModPow","k1","g2","is1","bnGCD","bnpModInt","bnModInverse","ac","u","lowprimes","lplim","bnIsProbablePrime","bnpMillerRabin","n1","rng_state","rng_pool","rng_pptr","rng_seed_int","rng_psize","rng_seed_time","ua","rng_get_byte","prng_newstate","rng_get_bytes","ba","SecureRandom","Arcfour","ARC4init","key","ARC4next","module","this"],"mappings":";;;AAAA,GAAC,WAAU;AASP,QAAIA,GAGAC,IAAS,iBACTC,KAASD,IAAO,aAAW;AAG/B,aAASE,EAAWC,GAAEC,GAAEC,GAAG;AACzB,MAAGF,KAAK,SACS,OAAOA,KAAnB,WAAsB,KAAK,WAAWA,GAAEC,GAAEC,CAAC,IACtCD,KAAK,QAAoB,OAAOD,KAAnB,WAAsB,KAAK,WAAWA,GAAE,GAAG,IAC3D,KAAK,WAAWA,GAAEC,CAAC;AAAA,IAC3B;AAGD,aAASE,IAAM;AAAE,aAAO,IAAIJ,EAAW,IAAI;AAAA,IAAI;AAU/C,aAASK,GAAIC,GAAEC,GAAEC,GAAEC,GAAEN,GAAE,GAAG;AACxB,aAAM,EAAE,KAAK,KAAG;AACd,YAAIO,IAAIH,IAAE,KAAKD,GAAG,IAAEE,EAAEC,CAAC,IAAEN;AACzB,QAAAA,IAAI,KAAK,MAAMO,IAAE,QAAS,GAC1BF,EAAEC,GAAG,IAAIC,IAAE;AAAA,MACZ;AACD,aAAOP;AAAA,IACR;AAID,aAASQ,GAAIL,GAAEC,GAAEC,GAAEC,GAAEN,GAAE,GAAG;AAExB,eADIS,IAAKL,IAAE,OAAQM,IAAKN,KAAG,IACrB,EAAE,KAAK,KAAG;AACd,YAAIO,IAAI,KAAKR,CAAC,IAAE,OACZS,IAAI,KAAKT,GAAG,KAAG,IACfU,IAAIH,IAAGC,IAAEC,IAAEH;AACf,QAAAE,IAAIF,IAAGE,MAAIE,IAAE,UAAS,MAAIR,EAAEC,CAAC,KAAGN,IAAE,aAClCA,KAAKW,MAAI,OAAKE,MAAI,MAAIH,IAAGE,KAAGZ,MAAI,KAChCK,EAAEC,GAAG,IAAIK,IAAE;AAAA,MACZ;AACD,aAAOX;AAAA,IACR;AAGD,aAASc,GAAIX,GAAEC,GAAEC,GAAEC,GAAEN,GAAE,GAAG;AAExB,eADIS,IAAKL,IAAE,OAAQM,IAAKN,KAAG,IACrB,EAAE,KAAK,KAAG;AACd,YAAIO,IAAI,KAAKR,CAAC,IAAE,OACZS,IAAI,KAAKT,GAAG,KAAG,IACfU,IAAIH,IAAGC,IAAEC,IAAEH;AACf,QAAAE,IAAIF,IAAGE,MAAIE,IAAE,UAAS,MAAIR,EAAEC,CAAC,IAAEN,GAC/BA,KAAKW,KAAG,OAAKE,KAAG,MAAIH,IAAGE,GACvBP,EAAEC,GAAG,IAAIK,IAAE;AAAA,MACZ;AACD,aAAOX;AAAA,IACR;AACD,QAAIe,IAAY,OAAO,YAAc;AACrC,IAAGA,KAAanB,KAAS,UAAU,WAAW,iCAC5CC,EAAW,UAAU,KAAKW,IAC1Bd,IAAQ,MAEFqB,KAAanB,KAAS,UAAU,WAAW,cACjDC,EAAW,UAAU,KAAKK,IAC1BR,IAAQ,OAGRG,EAAW,UAAU,KAAKiB,IAC1BpB,IAAQ,KAGVG,EAAW,UAAU,KAAKH,GAC1BG,EAAW,UAAU,MAAO,KAAGH,KAAO,GACtCG,EAAW,UAAU,KAAM,KAAGH;AAE9B,QAAIsB,IAAQ;AACZ,IAAAnB,EAAW,UAAU,KAAK,KAAK,IAAI,GAAEmB,CAAK,GAC1CnB,EAAW,UAAU,KAAKmB,IAAMtB,GAChCG,EAAW,UAAU,KAAK,IAAEH,IAAMsB;AAGlC,QAAIC,KAAQ,wCACRC,IAAQ,IAAI,SACZC,GAAGC;AAEP,SADAD,IAAK,IACDC,IAAK,GAAGA,KAAM,GAAG,EAAEA,EAAI,CAAAF,EAAMC,GAAI,IAAIC;AAEzC,SADAD,IAAK,IACDC,IAAK,IAAIA,IAAK,IAAI,EAAEA,EAAI,CAAAF,EAAMC,GAAI,IAAIC;AAE1C,SADAD,IAAK,IACDC,IAAK,IAAIA,IAAK,IAAI,EAAEA,EAAI,CAAAF,EAAMC,GAAI,IAAIC;AAE1C,aAASC,EAASC,GAAG;AAAE,aAAOL,GAAM,OAAOK,CAAC;AAAA,IAAI;AAChD,aAASC,EAAMC,GAAE,GAAG;AAClB,UAAIxB,IAAIkB,EAAMM,EAAE,WAAW,CAAC,CAAC;AAC7B,aAAQxB,KAAS;AAAA,IAClB;AAGD,aAASyB,GAAUC,GAAG;AACpB,eAAQ,IAAI,KAAK,IAAE,GAAG,KAAK,GAAG,EAAE,EAAG,CAAAA,EAAE,CAAC,IAAI,KAAK,CAAC;AAChD,MAAAA,EAAE,IAAI,KAAK,GACXA,EAAE,IAAI,KAAK;AAAA,IACZ;AAGD,aAASC,GAAWvB,GAAG;AACrB,WAAK,IAAI,GACT,KAAK,IAAKA,IAAE,IAAG,KAAG,GACfA,IAAI,IAAG,KAAK,CAAC,IAAIA,IACZA,IAAI,KAAI,KAAK,CAAC,IAAIA,IAAE,KAAK,KAC5B,KAAK,IAAI;AAAA,IACf;AAGD,aAASwB,EAAIzB,GAAG;AAAE,UAAIuB,IAAIzB,EAAK;AAAE,aAAAyB,EAAE,QAAQvB,CAAC,GAAUuB;AAAA,IAAI;AAG1D,aAASG,GAAcL,GAAEzB,GAAG;AAC1B,UAAI+B;AACJ,UAAG/B,KAAK,GAAI,CAAA+B,IAAI;AAAA,eACR/B,KAAK,EAAG,CAAA+B,IAAI;AAAA,eACZ/B,KAAK,IAAK,CAAA+B,IAAI;AAAA,eACd/B,KAAK,EAAG,CAAA+B,IAAI;AAAA,eACZ/B,KAAK,GAAI,CAAA+B,IAAI;AAAA,eACb/B,KAAK,EAAG,CAAA+B,IAAI;AAAA,WACf;AAAE,aAAK,UAAUN,GAAEzB,CAAC;AAAG;AAAA,MAAS;AACrC,WAAK,IAAI,GACT,KAAK,IAAI;AAET,eADII,IAAIqB,EAAE,QAAQO,IAAK,IAAOC,IAAK,GAC7B,EAAE7B,KAAK,KAAG;AACd,YAAIC,IAAK0B,KAAG,IAAGN,EAAErB,CAAC,IAAE,MAAKoB,EAAMC,GAAErB,CAAC;AAClC,YAAGC,IAAI,GAAG;AACR,UAAGoB,EAAE,OAAOrB,CAAC,KAAK,QAAK4B,IAAK;AAC5B;AAAA,QACD;AACD,QAAAA,IAAK,IACFC,KAAM,IACP,KAAK,KAAK,GAAG,IAAI5B,IACX4B,IAAGF,IAAI,KAAK,MAClB,KAAK,KAAK,IAAE,CAAC,MAAM1B,KAAI,KAAI,KAAK,KAAG4B,KAAK,MAAKA,GAC7C,KAAK,KAAK,GAAG,IAAK5B,KAAI,KAAK,KAAG4B,KAG9B,KAAK,KAAK,IAAE,CAAC,KAAK5B,KAAG4B,GACvBA,KAAMF,GACHE,KAAM,KAAK,OAAIA,KAAM,KAAK;AAAA,MAC9B;AACD,MAAGF,KAAK,KAAMN,EAAE,CAAC,IAAE,QACjB,KAAK,IAAI,IACNQ,IAAK,MAAG,KAAK,KAAK,IAAE,CAAC,MAAO,KAAI,KAAK,KAAGA,KAAK,KAAIA,KAEtD,KAAK,MAAK,GACPD,KAAIlC,EAAW,KAAK,MAAM,MAAK,IAAI;AAAA,IACvC;AAGD,aAASoC,KAAW;AAElB,eADIjC,IAAI,KAAK,IAAE,KAAK,IACd,KAAK,IAAI,KAAK,KAAK,KAAK,IAAE,CAAC,KAAKA,IAAG,GAAE,KAAK;AAAA,IACjD;AAGD,aAASkC,GAAWnC,GAAG;AACrB,UAAG,KAAK,IAAI,EAAG,QAAO,MAAI,KAAK,OAAQ,EAAC,SAASA,CAAC;AAClD,UAAI+B;AACJ,UAAG/B,KAAK,GAAI,CAAA+B,IAAI;AAAA,eACR/B,KAAK,EAAG,CAAA+B,IAAI;AAAA,eACZ/B,KAAK,EAAG,CAAA+B,IAAI;AAAA,eACZ/B,KAAK,GAAI,CAAA+B,IAAI;AAAA,eACb/B,KAAK,EAAG,CAAA+B,IAAI;AAAA,UACf,QAAO,KAAK,QAAQ/B,CAAC;AAC1B,UAAIoC,KAAM,KAAGL,KAAG,GAAGM,GAAGvB,IAAI,IAAOa,IAAI,IAAIvB,IAAI,KAAK,GAC9CkC,IAAI,KAAK,KAAIlC,IAAE,KAAK,KAAI2B;AAC5B,UAAG3B,MAAM;AAEP,aADGkC,IAAI,KAAK,OAAOD,IAAI,KAAKjC,CAAC,KAAGkC,KAAK,MAAKxB,IAAI,IAAMa,IAAIL,EAASe,CAAC,IAC5DjC,KAAK;AACT,UAAGkC,IAAIP,KACLM,KAAK,KAAKjC,CAAC,KAAI,KAAGkC,KAAG,MAAMP,IAAEO,GAC7BD,KAAK,KAAK,EAAEjC,CAAC,MAAIkC,KAAG,KAAK,KAAGP,OAG5BM,IAAK,KAAKjC,CAAC,MAAIkC,KAAGP,KAAIK,GACnBE,KAAK,MAAKA,KAAK,KAAK,IAAI,EAAElC,KAE5BiC,IAAI,MAAGvB,IAAI,KACXA,MAAGa,KAAKL,EAASe,CAAC;AAGzB,aAAOvB,IAAEa,IAAE;AAAA,IACZ;AAGD,aAASY,KAAW;AAAE,UAAIZ,IAAIzB,EAAG;AAAI,aAAAJ,EAAW,KAAK,MAAM,MAAK6B,CAAC,GAAUA;AAAA,IAAI;AAG/E,aAASa,KAAQ;AAAE,aAAQ,KAAK,IAAE,IAAG,KAAK,WAAS;AAAA,IAAO;AAG1D,aAASC,GAAY1C,GAAG;AACtB,UAAI4B,IAAI,KAAK,IAAE5B,EAAE;AACjB,UAAG4B,KAAK,EAAG,QAAOA;AAClB,UAAIvB,IAAI,KAAK;AAEb,UADAuB,IAAIvB,IAAEL,EAAE,GACL4B,KAAK,EAAG,QAAQ,KAAK,IAAE,IAAG,CAACA,IAAEA;AAChC,aAAM,EAAEvB,KAAK,IAAG,MAAIuB,IAAE,KAAKvB,CAAC,IAAEL,EAAEK,CAAC,MAAM,EAAG,QAAOuB;AACjD,aAAO;AAAA,IACR;AAGD,aAASe,EAAMrC,GAAG;AAChB,UAAIsB,IAAI,GAAGgB;AACX,cAAIA,IAAEtC,MAAI,OAAO,MAAKA,IAAIsC,GAAGhB,KAAK,MAC9BgB,IAAEtC,KAAG,MAAM,MAAKA,IAAIsC,GAAGhB,KAAK,KAC5BgB,IAAEtC,KAAG,MAAM,MAAKA,IAAIsC,GAAGhB,KAAK,KAC5BgB,IAAEtC,KAAG,MAAM,MAAKA,IAAIsC,GAAGhB,KAAK,KAC5BgB,IAAEtC,KAAG,MAAM,MAAKA,IAAIsC,GAAGhB,KAAK,IACzBA;AAAA,IACR;AAGD,aAASiB,KAAc;AACrB,aAAG,KAAK,KAAK,IAAU,IAChB,KAAK,MAAI,KAAK,IAAE,KAAGF,EAAM,KAAK,KAAK,IAAE,CAAC,IAAG,KAAK,IAAE,KAAK,EAAG;AAAA,IAChE;AAGD,aAASG,GAAatB,GAAEI,GAAG;AACzB,UAAIvB;AACJ,WAAIA,IAAI,KAAK,IAAE,GAAGA,KAAK,GAAG,EAAEA,EAAG,CAAAuB,EAAEvB,IAAEmB,CAAC,IAAI,KAAKnB,CAAC;AAC9C,WAAIA,IAAImB,IAAE,GAAGnB,KAAK,GAAG,EAAEA,EAAG,CAAAuB,EAAEvB,CAAC,IAAI;AACjC,MAAAuB,EAAE,IAAI,KAAK,IAAEJ,GACbI,EAAE,IAAI,KAAK;AAAA,IACZ;AAGD,aAASmB,GAAavB,GAAEI,GAAG;AACzB,eAAQvB,IAAImB,GAAGnB,IAAI,KAAK,GAAG,EAAEA,EAAG,CAAAuB,EAAEvB,IAAEmB,CAAC,IAAI,KAAKnB,CAAC;AAC/C,MAAAuB,EAAE,IAAI,KAAK,IAAI,KAAK,IAAEJ,GAAE,CAAC,GACzBI,EAAE,IAAI,KAAK;AAAA,IACZ;AAGD,aAASoB,GAAYxB,GAAEI,GAAG;AACxB,UAAIqB,IAAKzB,IAAE,KAAK,IACZ0B,IAAM,KAAK,KAAGD,GACdE,KAAM,KAAGD,KAAK,GACdE,IAAK,KAAK,MAAM5B,IAAE,KAAK,EAAE,GAAGtB,IAAK,KAAK,KAAG+C,IAAI,KAAK,IAAI5C;AAC1D,WAAIA,IAAI,KAAK,IAAE,GAAGA,KAAK,GAAG,EAAEA;AAC1B,QAAAuB,EAAEvB,IAAE+C,IAAG,CAAC,IAAK,KAAK/C,CAAC,KAAG6C,IAAKhD,GAC3BA,KAAK,KAAKG,CAAC,IAAE8C,MAAKF;AAEpB,WAAI5C,IAAI+C,IAAG,GAAG/C,KAAK,GAAG,EAAEA,EAAG,CAAAuB,EAAEvB,CAAC,IAAI;AAClC,MAAAuB,EAAEwB,CAAE,IAAIlD,GACR0B,EAAE,IAAI,KAAK,IAAEwB,IAAG,GAChBxB,EAAE,IAAI,KAAK,GACXA,EAAE,MAAK;AAAA,IACR;AAGD,aAASyB,GAAY7B,GAAEI,GAAG;AACxB,MAAAA,EAAE,IAAI,KAAK;AACX,UAAIwB,IAAK,KAAK,MAAM5B,IAAE,KAAK,EAAE;AAC7B,UAAG4B,KAAM,KAAK,GAAG;AAAE,QAAAxB,EAAE,IAAI;AAAG;AAAA,MAAS;AACrC,UAAIqB,IAAKzB,IAAE,KAAK,IACZ0B,IAAM,KAAK,KAAGD,GACdE,KAAM,KAAGF,KAAI;AACjB,MAAArB,EAAE,CAAC,IAAI,KAAKwB,CAAE,KAAGH;AACjB,eAAQ5C,IAAI+C,IAAG,GAAG/C,IAAI,KAAK,GAAG,EAAEA;AAC9B,QAAAuB,EAAEvB,IAAE+C,IAAG,CAAC,MAAM,KAAK/C,CAAC,IAAE8C,MAAKD,GAC3BtB,EAAEvB,IAAE+C,CAAE,IAAI,KAAK/C,CAAC,KAAG4C;AAErB,MAAGA,IAAK,MAAGrB,EAAE,KAAK,IAAEwB,IAAG,CAAC,MAAM,KAAK,IAAED,MAAKD,IAC1CtB,EAAE,IAAI,KAAK,IAAEwB,GACbxB,EAAE,MAAK;AAAA,IACR;AAGD,aAAS0B,GAAStD,GAAE4B,GAAG;AAErB,eADIvB,IAAI,GAAGH,IAAI,GAAGa,IAAI,KAAK,IAAIf,EAAE,GAAE,KAAK,CAAC,GACnCK,IAAIU;AACR,QAAAb,KAAK,KAAKG,CAAC,IAAEL,EAAEK,CAAC,GAChBuB,EAAEvB,GAAG,IAAIH,IAAE,KAAK,IAChBA,MAAM,KAAK;AAEb,UAAGF,EAAE,IAAI,KAAK,GAAG;AAEf,aADAE,KAAKF,EAAE,GACDK,IAAI,KAAK;AACb,UAAAH,KAAK,KAAKG,CAAC,GACXuB,EAAEvB,GAAG,IAAIH,IAAE,KAAK,IAChBA,MAAM,KAAK;AAEb,QAAAA,KAAK,KAAK;AAAA,MACX,OACI;AAEH,aADAA,KAAK,KAAK,GACJG,IAAIL,EAAE;AACV,UAAAE,KAAKF,EAAEK,CAAC,GACRuB,EAAEvB,GAAG,IAAIH,IAAE,KAAK,IAChBA,MAAM,KAAK;AAEb,QAAAA,KAAKF,EAAE;AAAA,MACR;AACD,MAAA4B,EAAE,IAAK1B,IAAE,IAAG,KAAG,GACZA,IAAI,KAAI0B,EAAEvB,GAAG,IAAI,KAAK,KAAGH,IACpBA,IAAI,MAAG0B,EAAEvB,GAAG,IAAIH,IACxB0B,EAAE,IAAIvB,GACNuB,EAAE,MAAK;AAAA,IACR;AAID,aAAS2B,GAAcvD,GAAE4B,GAAG;AAC1B,UAAItB,IAAI,KAAK,IAAG,GAAIkD,IAAIxD,EAAE,OACtBK,IAAIC,EAAE;AAEV,WADAsB,EAAE,IAAIvB,IAAEmD,EAAE,GACJ,EAAEnD,KAAK,IAAG,CAAAuB,EAAEvB,CAAC,IAAI;AACvB,WAAIA,IAAI,GAAGA,IAAImD,EAAE,GAAG,EAAEnD,EAAG,CAAAuB,EAAEvB,IAAEC,EAAE,CAAC,IAAIA,EAAE,GAAG,GAAEkD,EAAEnD,CAAC,GAAEuB,GAAEvB,GAAE,GAAEC,EAAE,CAAC;AACzD,MAAAsB,EAAE,IAAI,GACNA,EAAE,MAAK,GACJ,KAAK,KAAK5B,EAAE,KAAGD,EAAW,KAAK,MAAM6B,GAAEA,CAAC;AAAA,IAC5C;AAGD,aAAS6B,GAAY7B,GAAG;AAGtB,eAFItB,IAAI,KAAK,OACTD,IAAIuB,EAAE,IAAI,IAAEtB,EAAE,GACZ,EAAED,KAAK,IAAG,CAAAuB,EAAEvB,CAAC,IAAI;AACvB,WAAIA,IAAI,GAAGA,IAAIC,EAAE,IAAE,GAAG,EAAED,GAAG;AACzB,YAAIH,IAAII,EAAE,GAAGD,GAAEC,EAAED,CAAC,GAAEuB,GAAE,IAAEvB,GAAE,GAAE,CAAC;AAC7B,SAAIuB,EAAEvB,IAAEC,EAAE,CAAC,KAAGA,EAAE,GAAGD,IAAE,GAAE,IAAEC,EAAED,CAAC,GAAEuB,GAAE,IAAEvB,IAAE,GAAEH,GAAEI,EAAE,IAAED,IAAE,CAAC,MAAMC,EAAE,OACrDsB,EAAEvB,IAAEC,EAAE,CAAC,KAAKA,EAAE,IACdsB,EAAEvB,IAAEC,EAAE,IAAE,CAAC,IAAI;AAAA,MAEhB;AACD,MAAGsB,EAAE,IAAI,MAAGA,EAAEA,EAAE,IAAE,CAAC,KAAKtB,EAAE,GAAGD,GAAEC,EAAED,CAAC,GAAEuB,GAAE,IAAEvB,GAAE,GAAE,CAAC,IAC7CuB,EAAE,IAAI,GACNA,EAAE,MAAK;AAAA,IACR;AAID,aAAS8B,GAAY3C,GAAE4C,GAAE/B,GAAG;AAC1B,UAAIgC,IAAK7C,EAAE;AACX,UAAG,EAAA6C,EAAG,KAAK,IACX;AAAA,YAAIC,IAAK,KAAK;AACd,YAAGA,EAAG,IAAID,EAAG,GAAG;AACd,UAAGD,KAAK,QAAMA,EAAE,QAAQ,CAAC,GACtB/B,KAAK,QAAM,KAAK,OAAOA,CAAC;AAC3B;AAAA,QACD;AACD,QAAGA,KAAK,SAAMA,IAAIzB,EAAG;AACrB,YAAIqD,IAAIrD,EAAG,GAAI2D,IAAK,KAAK,GAAGC,IAAKhD,EAAE,GAC/BiD,IAAM,KAAK,KAAGrB,EAAMiB,EAAGA,EAAG,IAAE,CAAC,CAAC;AAClC,QAAGI,IAAM,KAAKJ,EAAG,SAASI,GAAIR,CAAC,GAAGK,EAAG,SAASG,GAAIpC,CAAC,MAC5CgC,EAAG,OAAOJ,CAAC,GAAGK,EAAG,OAAOjC,CAAC;AAChC,YAAIqC,IAAKT,EAAE,GACPU,IAAKV,EAAES,IAAG,CAAC;AACf,YAAGC,KAAM,GACT;AAAA,cAAIC,IAAKD,KAAI,KAAG,KAAK,OAAMD,IAAG,IAAGT,EAAES,IAAG,CAAC,KAAG,KAAK,KAAG,IAC9CG,IAAK,KAAK,KAAGD,GAAIE,KAAM,KAAG,KAAK,MAAIF,GAAIG,IAAI,KAAG,KAAK,IACnDjE,IAAIuB,EAAE,GAAGpB,IAAIH,IAAE4D,GAAIrB,IAAKe,KAASxD,EAAG;AAQxC,eAPAqD,EAAE,UAAUhD,GAAEoC,CAAC,GACZhB,EAAE,UAAUgB,CAAC,KAAK,MACnBhB,EAAEA,EAAE,GAAG,IAAI,GACXA,EAAE,MAAMgB,GAAEhB,CAAC,IAEb7B,EAAW,IAAI,UAAUkE,GAAGrB,CAAC,GAC7BA,EAAE,MAAMY,GAAEA,CAAC,GACLA,EAAE,IAAIS,IAAI,CAAAT,EAAEA,EAAE,GAAG,IAAI;AAC3B,iBAAM,EAAEhD,KAAK,KAAG;AAEd,gBAAI+D,IAAM3C,EAAE,EAAEvB,CAAC,KAAG6D,IAAI,KAAK,KAAG,KAAK,MAAMtC,EAAEvB,CAAC,IAAE+D,KAAIxC,EAAEvB,IAAE,CAAC,IAAEiE,KAAGD,CAAE;AAC9D,iBAAIzC,EAAEvB,CAAC,KAAGmD,EAAE,GAAG,GAAEe,GAAG3C,GAAEpB,GAAE,GAAEyD,CAAE,KAAKM;AAG/B,mBAFAf,EAAE,UAAUhD,GAAEoC,CAAC,GACfhB,EAAE,MAAMgB,GAAEhB,CAAC,GACLA,EAAEvB,CAAC,IAAI,EAAEkE,IAAI,CAAA3C,EAAE,MAAMgB,GAAEhB,CAAC;AAAA,UAEjC;AACD,UAAG+B,KAAK,SACN/B,EAAE,UAAUqC,GAAGN,CAAC,GACbG,KAAMC,KAAIhE,EAAW,KAAK,MAAM4D,GAAEA,CAAC,IAExC/B,EAAE,IAAIqC,GACNrC,EAAE,MAAK,GACJoC,IAAM,KAAGpC,EAAE,SAASoC,GAAIpC,CAAC,GACzBkC,IAAK,KAAG/D,EAAW,KAAK,MAAM6B,GAAEA,CAAC;AAAA;AAAA;AAAA,IACrC;AAGD,aAAS4C,GAAMxE,GAAG;AAChB,UAAI4B,IAAIzB;AACR,kBAAK,IAAG,EAAG,SAASH,GAAE,MAAK4B,CAAC,GACzB,KAAK,IAAI,KAAKA,EAAE,UAAU7B,EAAW,IAAI,IAAI,KAAGC,EAAE,MAAM4B,GAAEA,CAAC,GACvDA;AAAA,IACR;AAGD,aAAS6C,EAAQ1D,GAAG;AAAE,WAAK,IAAIA;AAAA,IAAI;AACnC,aAAS2D,GAASpE,GAAG;AACnB,aAAGA,EAAE,IAAI,KAAKA,EAAE,UAAU,KAAK,CAAC,KAAK,IAAUA,EAAE,IAAI,KAAK,CAAC,IAC/CA;AAAA,IACb;AACD,aAASqE,GAAQrE,GAAG;AAAE,aAAOA;AAAA,IAAI;AACjC,aAASsE,GAAQtE,GAAG;AAAE,MAAAA,EAAE,SAAS,KAAK,GAAE,MAAKA,CAAC;AAAA,IAAI;AAClD,aAASuE,GAAOvE,GAAEkD,GAAE5B,GAAG;AAAE,MAAAtB,EAAE,WAAWkD,GAAE5B,CAAC,GAAG,KAAK,OAAOA,CAAC;AAAA,IAAI;AAC7D,aAASkD,GAAOxE,GAAEsB,GAAG;AAAE,MAAAtB,EAAE,SAASsB,CAAC,GAAG,KAAK,OAAOA,CAAC;AAAA,IAAI;AAEvD,IAAA6C,EAAQ,UAAU,UAAUC,IAC5BD,EAAQ,UAAU,SAASE,IAC3BF,EAAQ,UAAU,SAASG,IAC3BH,EAAQ,UAAU,QAAQI,IAC1BJ,EAAQ,UAAU,QAAQK;AAY1B,aAASC,KAAc;AACrB,UAAG,KAAK,IAAI,EAAG,QAAO;AACtB,UAAIzE,IAAI,KAAK,CAAC;AACd,UAAI,EAAAA,IAAE,GAAS,QAAO;AACtB,UAAIkD,IAAIlD,IAAE;AACV,aAAAkD,IAAKA,KAAG,KAAGlD,IAAE,MAAKkD,KAAI,IACtBA,IAAKA,KAAG,KAAGlD,IAAE,OAAMkD,KAAI,KACvBA,IAAKA,KAAG,MAAKlD,IAAE,SAAQkD,IAAG,UAAU,OAGpCA,IAAKA,KAAG,IAAElD,IAAEkD,IAAE,KAAK,MAAK,KAAK,IAErBA,IAAE,IAAG,KAAK,KAAGA,IAAE,CAACA;AAAA,IACzB;AAGD,aAASwB,EAAWjE,GAAG;AACrB,WAAK,IAAIA,GACT,KAAK,KAAKA,EAAE,YACZ,KAAK,MAAM,KAAK,KAAG,OACnB,KAAK,MAAM,KAAK,MAAI,IACpB,KAAK,MAAM,KAAIA,EAAE,KAAG,MAAK,GACzB,KAAK,MAAM,IAAEA,EAAE;AAAA,IAChB;AAGD,aAASkE,GAAY3E,GAAG;AACtB,UAAIsB,IAAIzB;AACR,aAAAG,EAAE,IAAG,EAAG,UAAU,KAAK,EAAE,GAAEsB,CAAC,GAC5BA,EAAE,SAAS,KAAK,GAAE,MAAKA,CAAC,GACrBtB,EAAE,IAAI,KAAKsB,EAAE,UAAU7B,EAAW,IAAI,IAAI,KAAG,KAAK,EAAE,MAAM6B,GAAEA,CAAC,GACzDA;AAAA,IACR;AAGD,aAASsD,GAAW5E,GAAG;AACrB,UAAIsB,IAAIzB;AACR,aAAAG,EAAE,OAAOsB,CAAC,GACV,KAAK,OAAOA,CAAC,GACNA;AAAA,IACR;AAGD,aAASuD,GAAW7E,GAAG;AACrB,aAAMA,EAAE,KAAK,KAAK;AAChB,QAAAA,EAAEA,EAAE,GAAG,IAAI;AACb,eAAQ,IAAI,GAAG,IAAI,KAAK,EAAE,GAAG,EAAE,GAAG;AAEhC,YAAIE,IAAIF,EAAE,CAAC,IAAE,OACT8E,IAAM5E,IAAE,KAAK,QAAOA,IAAE,KAAK,OAAKF,EAAE,CAAC,KAAG,MAAI,KAAK,MAAK,KAAK,OAAK,MAAKA,EAAE;AAKzE,aAHAE,IAAI,IAAE,KAAK,EAAE,GACbF,EAAEE,CAAC,KAAK,KAAK,EAAE,GAAG,GAAE4E,GAAG9E,GAAE,GAAE,GAAE,KAAK,EAAE,CAAC,GAE/BA,EAAEE,CAAC,KAAKF,EAAE;AAAM,UAAAA,EAAEE,CAAC,KAAKF,EAAE,IAAIA,EAAE,EAAEE,CAAC;AAAA,MAC1C;AACD,MAAAF,EAAE,MAAK,GACPA,EAAE,UAAU,KAAK,EAAE,GAAEA,CAAC,GACnBA,EAAE,UAAU,KAAK,CAAC,KAAK,KAAGA,EAAE,MAAM,KAAK,GAAEA,CAAC;AAAA,IAC9C;AAGD,aAAS+E,GAAU/E,GAAEsB,GAAG;AAAE,MAAAtB,EAAE,SAASsB,CAAC,GAAG,KAAK,OAAOA,CAAC;AAAA,IAAI;AAG1D,aAAS0D,GAAUhF,GAAEkD,GAAE5B,GAAG;AAAE,MAAAtB,EAAE,WAAWkD,GAAE5B,CAAC,GAAG,KAAK,OAAOA,CAAC;AAAA,IAAI;AAEhE,IAAAoD,EAAW,UAAU,UAAUC,IAC/BD,EAAW,UAAU,SAASE,IAC9BF,EAAW,UAAU,SAASG,IAC9BH,EAAW,UAAU,QAAQM,IAC7BN,EAAW,UAAU,QAAQK;AAG7B,aAASE,KAAY;AAAE,cAAS,KAAK,IAAE,IAAI,KAAK,CAAC,IAAE,IAAG,KAAK,MAAM;AAAA,IAAI;AAGrE,aAASC,GAAOlB,GAAEmB,GAAG;AACnB,UAAGnB,IAAI,cAAcA,IAAI,EAAG,QAAOvE,EAAW;AAC9C,UAAI6B,IAAIzB,EAAK,GAAEuF,IAAKvF,EAAG,GAAIwF,IAAIF,EAAE,QAAQ,IAAI,GAAGpF,IAAIsC,EAAM2B,CAAC,IAAE;AAE7D,WADAqB,EAAE,OAAO/D,CAAC,GACJ,EAAEvB,KAAK;AAEX,YADAoF,EAAE,MAAM7D,GAAE8D,CAAE,IACRpB,IAAG,KAAGjE,KAAM,EAAG,CAAAoF,EAAE,MAAMC,GAAGC,GAAE/D,CAAC;AAAA,aAC5B;AAAE,cAAIgB,IAAIhB;AAAG,UAAAA,IAAI8D,GAAIA,IAAK9C;AAAA,QAAI;AAErC,aAAO6C,EAAE,OAAO7D,CAAC;AAAA,IAClB;AAGD,aAASgE,GAAYtB,GAAEvD,GAAG;AACxB,UAAI0E;AACJ,aAAGnB,IAAI,OAAOvD,EAAE,OAAM,IAAI0E,IAAI,IAAIhB,EAAQ1D,CAAC,IAAQ0E,IAAI,IAAIT,EAAWjE,CAAC,GAChE,KAAK,IAAIuD,GAAEmB,CAAC;AAAA,IACpB;AAGD,IAAA1F,EAAW,UAAU,SAAS4B,IAC9B5B,EAAW,UAAU,UAAU8B,IAC/B9B,EAAW,UAAU,aAAagC,IAClChC,EAAW,UAAU,QAAQoC,IAC7BpC,EAAW,UAAU,YAAY+C,IACjC/C,EAAW,UAAU,YAAYgD,IACjChD,EAAW,UAAU,WAAWiD,IAChCjD,EAAW,UAAU,WAAWsD,IAChCtD,EAAW,UAAU,QAAQuD,IAC7BvD,EAAW,UAAU,aAAawD,IAClCxD,EAAW,UAAU,WAAW0D,IAChC1D,EAAW,UAAU,WAAW2D,IAChC3D,EAAW,UAAU,WAAWgF,IAChChF,EAAW,UAAU,SAASwF,IAC9BxF,EAAW,UAAU,MAAMyF,IAG3BzF,EAAW,UAAU,WAAWqC,IAChCrC,EAAW,UAAU,SAASyC,IAC9BzC,EAAW,UAAU,MAAM0C,IAC3B1C,EAAW,UAAU,YAAY2C,IACjC3C,EAAW,UAAU,YAAY8C,IACjC9C,EAAW,UAAU,MAAMyE,IAC3BzE,EAAW,UAAU,YAAY6F,IAGjC7F,EAAW,OAAO+B,EAAI,CAAC,GACvB/B,EAAW,MAAM+B,EAAI,CAAC;AAYtB,aAAS+D,KAAU;AAAE,UAAIjE,IAAIzB,EAAG;AAAI,kBAAK,OAAOyB,CAAC,GAAUA;AAAA,IAAI;AAG/D,aAASkE,KAAa;AACpB,UAAG,KAAK,IAAI,GAAG;AACb,YAAG,KAAK,KAAK,EAAG,QAAO,KAAK,CAAC,IAAE,KAAK;AAC/B,YAAG,KAAK,KAAK,EAAG,QAAO;AAAA,MAC7B,OACI;AAAA,YAAG,KAAK,KAAK,EAAG,QAAO,KAAK,CAAC;AAC7B,YAAG,KAAK,KAAK,EAAG,QAAO;AAAA;AAE5B,cAAS,KAAK,CAAC,KAAI,KAAI,KAAG,KAAK,MAAK,MAAK,KAAK,KAAI,KAAK,CAAC;AAAA,IACzD;AAGD,aAASC,KAAc;AAAE,aAAQ,KAAK,KAAG,IAAG,KAAK,IAAG,KAAK,CAAC,KAAG,MAAK;AAAA,IAAK;AAGvE,aAASC,KAAe;AAAE,aAAQ,KAAK,KAAG,IAAG,KAAK,IAAG,KAAK,CAAC,KAAG,MAAK;AAAA,IAAK;AAGxE,aAASC,GAAarE,GAAG;AAAE,aAAO,KAAK,MAAM,KAAK,MAAI,KAAK,KAAG,KAAK,IAAIA,CAAC,CAAC;AAAA,IAAI;AAG7E,aAASsE,KAAW;AAClB,aAAG,KAAK,IAAI,IAAU,KACd,KAAK,KAAK,KAAM,KAAK,KAAK,KAAK,KAAK,CAAC,KAAK,IAAW,IACjD;AAAA,IACb;AAGD,aAASC,GAAWlG,GAAG;AAErB,UADGA,KAAK,SAAMA,IAAI,KACf,KAAK,OAAQ,KAAI,KAAKA,IAAI,KAAKA,IAAI,GAAI,QAAO;AACjD,UAAImG,IAAK,KAAK,UAAUnG,CAAC,GACrBD,IAAI,KAAK,IAAIC,GAAEmG,CAAE,GACjB9D,IAAIR,EAAI9B,CAAC,GAAGwD,IAAIrD,EAAK,GAAEsF,IAAItF,KAAOyB,IAAI;AAE1C,WADA,KAAK,SAASU,GAAEkB,GAAEiC,CAAC,GACbjC,EAAE,OAAQ,IAAG;AACjB,QAAA5B,KAAK5B,IAAEyF,EAAE,SAAU,GAAE,SAASxF,CAAC,EAAE,OAAO,CAAC,IAAI2B,GAC7C4B,EAAE,SAASlB,GAAEkB,GAAEiC,CAAC;AAElB,aAAOA,EAAE,SAAU,EAAC,SAASxF,CAAC,IAAI2B;AAAA,IACnC;AAGD,aAASyE,GAAa3E,GAAEzB,GAAG;AACzB,WAAK,QAAQ,CAAC,GACXA,KAAK,SAAMA,IAAI;AAGlB,eAFImG,IAAK,KAAK,UAAUnG,CAAC,GACrBqC,IAAI,KAAK,IAAIrC,GAAEmG,CAAE,GAAGnE,IAAK,IAAOzB,IAAI,GAAGD,IAAI,GACvCF,IAAI,GAAGA,IAAIqB,EAAE,QAAQ,EAAErB,GAAG;AAChC,YAAIC,IAAImB,EAAMC,GAAErB,CAAC;AACjB,YAAGC,IAAI,GAAG;AACR,UAAGoB,EAAE,OAAOrB,CAAC,KAAK,OAAO,KAAK,YAAY,MAAG4B,IAAK;AAClD;AAAA,QACD;AACD,QAAA1B,IAAIN,IAAEM,IAAED,GACL,EAAEE,KAAK4F,MACR,KAAK,UAAU9D,CAAC,GAChB,KAAK,WAAW/B,GAAE,CAAC,GACnBC,IAAI,GACJD,IAAI;AAAA,MAEP;AACD,MAAGC,IAAI,MACL,KAAK,UAAU,KAAK,IAAIP,GAAEO,CAAC,CAAC,GAC5B,KAAK,WAAWD,GAAE,CAAC,IAElB0B,KAAIlC,EAAW,KAAK,MAAM,MAAK,IAAI;AAAA,IACvC;AAGD,aAASuG,GAActG,GAAEC,GAAEC,GAAG;AAC5B,UAAe,OAAOD,KAAnB;AAED,YAAGD,IAAI,EAAG,MAAK,QAAQ,CAAC;AAAA;AAMtB,eAJA,KAAK,WAAWA,GAAEE,CAAC,GACf,KAAK,QAAQF,IAAE,CAAC,KAClB,KAAK,UAAUD,EAAW,IAAI,UAAUC,IAAE,CAAC,GAAEuG,GAAM,IAAI,GACtD,KAAK,YAAU,KAAK,WAAW,GAAE,CAAC,GAC/B,CAAC,KAAK,gBAAgBtG,CAAC;AAC3B,iBAAK,WAAW,GAAE,CAAC,GAChB,KAAK,UAAS,IAAKD,KAAG,KAAK,MAAMD,EAAW,IAAI,UAAUC,IAAE,CAAC,GAAE,IAAI;AAAA,WAIvE;AAEH,YAAIM,IAAI,IAAI,MAAK,GAAIsC,IAAI5C,IAAE;AAC3B,QAAAM,EAAE,UAAUN,KAAG,KAAG,GAClBC,EAAE,UAAUK,CAAC,GACVsC,IAAI,IAAGtC,EAAE,CAAC,MAAO,KAAGsC,KAAG,IAAStC,EAAE,CAAC,IAAI,GAC1C,KAAK,WAAWA,GAAE,GAAG;AAAA,MACtB;AAAA,IACF;AAGD,aAASkG,KAAgB;AACvB,UAAInG,IAAI,KAAK,GAAGuB,IAAI,IAAI,MAAK;AAC7B,MAAAA,EAAE,CAAC,IAAI,KAAK;AACZ,UAAIW,IAAI,KAAK,KAAIlC,IAAE,KAAK,KAAI,GAAGiC,GAAGN,IAAI;AACtC,UAAG3B,MAAM;AAGP,aAFGkC,IAAI,KAAK,OAAOD,IAAI,KAAKjC,CAAC,KAAGkC,OAAO,KAAK,IAAE,KAAK,OAAKA,MACtDX,EAAEI,GAAG,IAAIM,IAAG,KAAK,KAAI,KAAK,KAAGC,IACzBlC,KAAK;AACT,UAAGkC,IAAI,KACLD,KAAK,KAAKjC,CAAC,KAAI,KAAGkC,KAAG,MAAM,IAAEA,GAC7BD,KAAK,KAAK,EAAEjC,CAAC,MAAIkC,KAAG,KAAK,KAAG,OAG5BD,IAAK,KAAKjC,CAAC,MAAIkC,KAAG,KAAI,KACnBA,KAAK,MAAKA,KAAK,KAAK,IAAI,EAAElC,KAE3BiC,IAAE,QAAYA,KAAK,OACpBN,KAAK,MAAM,KAAK,IAAE,SAAUM,IAAE,QAAO,EAAEN,IACvCA,IAAI,KAAKM,KAAK,KAAK,OAAGV,EAAEI,GAAG,IAAIM;AAGtC,aAAOV;AAAA,IACR;AAED,aAAS6E,GAASzG,GAAG;AAAE,aAAO,KAAK,UAAUA,CAAC,KAAG;AAAA,IAAK;AACtD,aAAS0G,GAAM1G,GAAG;AAAE,aAAO,KAAK,UAAUA,CAAC,IAAE,IAAG,OAAKA;AAAA,IAAI;AACzD,aAAS2G,GAAM3G,GAAG;AAAE,aAAO,KAAK,UAAUA,CAAC,IAAE,IAAG,OAAKA;AAAA,IAAI;AAGzD,aAAS4G,GAAa5G,GAAE6G,GAAGjF,GAAG;AAC5B,UAAIvB,GAAGyG,GAAG/F,IAAI,KAAK,IAAIf,EAAE,GAAE,KAAK,CAAC;AACjC,WAAIK,IAAI,GAAGA,IAAIU,GAAG,EAAEV,EAAG,CAAAuB,EAAEvB,CAAC,IAAIwG,EAAG,KAAKxG,CAAC,GAAEL,EAAEK,CAAC,CAAC;AAC7C,UAAGL,EAAE,IAAI,KAAK,GAAG;AAEf,aADA8G,IAAI9G,EAAE,IAAE,KAAK,IACTK,IAAIU,GAAGV,IAAI,KAAK,GAAG,EAAEA,EAAG,CAAAuB,EAAEvB,CAAC,IAAIwG,EAAG,KAAKxG,CAAC,GAAEyG,CAAC;AAC/C,QAAAlF,EAAE,IAAI,KAAK;AAAA,MACZ,OACI;AAEH,aADAkF,IAAI,KAAK,IAAE,KAAK,IACZzG,IAAIU,GAAGV,IAAIL,EAAE,GAAG,EAAEK,EAAG,CAAAuB,EAAEvB,CAAC,IAAIwG,EAAGC,GAAE9G,EAAEK,CAAC,CAAC;AACzC,QAAAuB,EAAE,IAAI5B,EAAE;AAAA,MACT;AACD,MAAA4B,EAAE,IAAIiF,EAAG,KAAK,GAAE7G,EAAE,CAAC,GACnB4B,EAAE,MAAK;AAAA,IACR;AAGD,aAASmF,GAAOzG,GAAEkD,GAAG;AAAE,aAAOlD,IAAEkD;AAAA,IAAI;AACpC,aAASwD,GAAMhH,GAAG;AAAE,UAAI4B,IAAIzB,EAAK;AAAE,kBAAK,UAAUH,GAAE+G,IAAOnF,CAAC,GAAUA;AAAA,IAAI;AAG1E,aAAS2E,EAAMjG,GAAEkD,GAAG;AAAE,aAAOlD,IAAEkD;AAAA,IAAI;AACnC,aAASyD,GAAKjH,GAAG;AAAE,UAAI4B,IAAIzB,EAAK;AAAE,kBAAK,UAAUH,GAAEuG,GAAM3E,CAAC,GAAUA;AAAA,IAAI;AAGxE,aAASsF,EAAO5G,GAAEkD,GAAG;AAAE,aAAOlD,IAAEkD;AAAA,IAAI;AACpC,aAAS2D,GAAMnH,GAAG;AAAE,UAAI4B,IAAIzB,EAAK;AAAE,kBAAK,UAAUH,GAAEkH,GAAOtF,CAAC,GAAUA;AAAA,IAAI;AAG1E,aAASwF,EAAU9G,GAAEkD,GAAG;AAAE,aAAOlD,IAAE,CAACkD;AAAA,IAAI;AACxC,aAAS6D,GAASrH,GAAG;AAAE,UAAI4B,IAAIzB,EAAK;AAAE,kBAAK,UAAUH,GAAEoH,GAAUxF,CAAC,GAAUA;AAAA,IAAI;AAGhF,aAAS0F,KAAQ;AAEf,eADI1F,IAAIzB,KACA,IAAI,GAAG,IAAI,KAAK,GAAG,EAAE,EAAG,CAAAyB,EAAE,CAAC,IAAI,KAAK,KAAG,CAAC,KAAK,CAAC;AACtD,aAAAA,EAAE,IAAI,KAAK,GACXA,EAAE,IAAI,CAAC,KAAK,GACLA;AAAA,IACR;AAGD,aAAS2F,GAAY/F,GAAG;AACtB,UAAII,IAAIzB;AACR,aAAGqB,IAAI,IAAG,KAAK,SAAS,CAACA,GAAEI,CAAC,IAAQ,KAAK,SAASJ,GAAEI,CAAC,GAC9CA;AAAA,IACR;AAGD,aAAS4F,GAAahG,GAAG;AACvB,UAAII,IAAIzB;AACR,aAAGqB,IAAI,IAAG,KAAK,SAAS,CAACA,GAAEI,CAAC,IAAQ,KAAK,SAASJ,GAAEI,CAAC,GAC9CA;AAAA,IACR;AAGD,aAAS6F,GAAKnH,GAAG;AACf,UAAGA,KAAK,EAAG,QAAO;AAClB,UAAIsB,IAAI;AACR,aAAItB,IAAE,UAAgBA,MAAM,IAAIsB,KAAK,KACjCtB,IAAE,QAAcA,MAAM,GAAGsB,KAAK,IAC9BtB,IAAE,OAAaA,MAAM,GAAGsB,KAAK,IAC7BtB,IAAE,MAAWA,MAAM,GAAGsB,KAAK,IAC3BtB,IAAE,KAAS,EAAEsB,GACVA;AAAA,IACR;AAGD,aAAS8F,KAAoB;AAC3B,eAAQrH,IAAI,GAAGA,IAAI,KAAK,GAAG,EAAEA;AAC3B,YAAG,KAAKA,CAAC,KAAK,EAAG,QAAOA,IAAE,KAAK,KAAGoH,GAAK,KAAKpH,CAAC,CAAC;AAChD,aAAG,KAAK,IAAI,IAAU,KAAK,IAAE,KAAK,KAC3B;AAAA,IACR;AAGD,aAASsH,GAAKrH,GAAG;AAEf,eADIsB,IAAI,GACFtB,KAAK;AAAK,QAAAA,KAAKA,IAAE,GAAG,EAAEsB;AAC5B,aAAOA;AAAA,IACR;AAGD,aAASgG,KAAa;AAEpB,eADIhG,IAAI,GAAGtB,IAAI,KAAK,IAAE,KAAK,IACnBD,IAAI,GAAGA,IAAI,KAAK,GAAG,EAAEA,EAAG,CAAAuB,KAAK+F,GAAK,KAAKtH,CAAC,IAAEC,CAAC;AACnD,aAAOsB;AAAA,IACR;AAGD,aAASiG,GAAUrG,GAAG;AACpB,UAAIhB,IAAI,KAAK,MAAMgB,IAAE,KAAK,EAAE;AAC5B,aAAGhB,KAAK,KAAK,IAAU,KAAK,KAAG,KACvB,KAAKA,CAAC,IAAG,KAAIgB,IAAE,KAAK,OAAO;AAAA,IACpC;AAGD,aAASsG,GAAatG,GAAEqF,GAAI;AAC1B,UAAIjF,IAAI7B,EAAW,IAAI,UAAUyB,CAAC;AAClC,kBAAK,UAAUI,GAAEiF,GAAGjF,CAAC,GACdA;AAAA,IACR;AAGD,aAASmG,GAASvG,GAAG;AAAE,aAAO,KAAK,UAAUA,GAAE+E,CAAK;AAAA,IAAI;AAGxD,aAASyB,GAAWxG,GAAG;AAAE,aAAO,KAAK,UAAUA,GAAE4F,CAAS;AAAA,IAAI;AAG9D,aAASa,GAAUzG,GAAG;AAAE,aAAO,KAAK,UAAUA,GAAE0F,CAAM;AAAA,IAAI;AAG1D,aAASgB,GAASlI,GAAE4B,GAAG;AAErB,eADIvB,IAAI,GAAGH,IAAI,GAAGa,IAAI,KAAK,IAAIf,EAAE,GAAE,KAAK,CAAC,GACnCK,IAAIU;AACR,QAAAb,KAAK,KAAKG,CAAC,IAAEL,EAAEK,CAAC,GAChBuB,EAAEvB,GAAG,IAAIH,IAAE,KAAK,IAChBA,MAAM,KAAK;AAEb,UAAGF,EAAE,IAAI,KAAK,GAAG;AAEf,aADAE,KAAKF,EAAE,GACDK,IAAI,KAAK;AACb,UAAAH,KAAK,KAAKG,CAAC,GACXuB,EAAEvB,GAAG,IAAIH,IAAE,KAAK,IAChBA,MAAM,KAAK;AAEb,QAAAA,KAAK,KAAK;AAAA,MACX,OACI;AAEH,aADAA,KAAK,KAAK,GACJG,IAAIL,EAAE;AACV,UAAAE,KAAKF,EAAEK,CAAC,GACRuB,EAAEvB,GAAG,IAAIH,IAAE,KAAK,IAChBA,MAAM,KAAK;AAEb,QAAAA,KAAKF,EAAE;AAAA,MACR;AACD,MAAA4B,EAAE,IAAK1B,IAAE,IAAG,KAAG,GACZA,IAAI,IAAG0B,EAAEvB,GAAG,IAAIH,IACXA,IAAI,OAAI0B,EAAEvB,GAAG,IAAI,KAAK,KAAGH,IACjC0B,EAAE,IAAIvB,GACNuB,EAAE,MAAK;AAAA,IACR;AAGD,aAASuG,GAAMnI,GAAG;AAAE,UAAI4B,IAAIzB,EAAG;AAAI,kBAAK,MAAMH,GAAE4B,CAAC,GAAUA;AAAA,IAAI;AAG/D,aAASwG,GAAWpI,GAAG;AAAE,UAAI4B,IAAIzB,EAAG;AAAI,kBAAK,MAAMH,GAAE4B,CAAC,GAAUA;AAAA,IAAI;AAGpE,aAASyG,GAAWrI,GAAG;AAAE,UAAI4B,IAAIzB,EAAG;AAAI,kBAAK,WAAWH,GAAE4B,CAAC,GAAUA;AAAA,IAAI;AAGzE,aAAS0G,KAAW;AAAE,UAAI1G,IAAIzB,EAAG;AAAI,kBAAK,SAASyB,CAAC,GAAUA;AAAA,IAAI;AAGlE,aAAS2G,GAASvI,GAAG;AAAE,UAAI4B,IAAIzB,EAAK;AAAE,kBAAK,SAASH,GAAE4B,GAAE,IAAI,GAAUA;AAAA,IAAI;AAG1E,aAAS4G,GAAYxI,GAAG;AAAE,UAAI4B,IAAIzB,EAAK;AAAE,kBAAK,SAASH,GAAE,MAAK4B,CAAC,GAAUA;AAAA,IAAI;AAG7E,aAAS6G,GAAqBzI,GAAG;AAC/B,UAAI2D,IAAIxD,EAAG,GAAIyB,IAAIzB,EAAG;AACtB,kBAAK,SAASH,GAAE2D,GAAE/B,CAAC,GACZ,IAAI,MAAM+B,GAAE/B,CAAC;AAAA,IACrB;AAGD,aAAS8G,GAAalH,GAAG;AACvB,WAAK,KAAK,CAAC,IAAI,KAAK,GAAG,GAAEA,IAAE,GAAE,MAAK,GAAE,GAAE,KAAK,CAAC,GAC5C,EAAE,KAAK,GACP,KAAK,MAAK;AAAA,IACX;AAGD,aAASmH,GAAcnH,GAAEjB,GAAG;AAC1B,UAAGiB,KAAK,GACR;AAAA,eAAM,KAAK,KAAKjB,IAAG,MAAK,KAAK,GAAG,IAAI;AAEpC,aADA,KAAKA,CAAC,KAAKiB,GACL,KAAKjB,CAAC,KAAK,KAAK;AACpB,eAAKA,CAAC,KAAK,KAAK,IACb,EAAEA,KAAK,KAAK,MAAG,KAAK,KAAK,GAAG,IAAI,IACnC,EAAE,KAAKA,CAAC;AAAA;AAAA,IAEX;AAGD,aAASqI,IAAU;AAAA,IAAE;AACrB,aAASC,EAAKvI,GAAG;AAAE,aAAOA;AAAA,IAAI;AAC9B,aAASwI,GAAOxI,GAAEkD,GAAE5B,GAAG;AAAE,MAAAtB,EAAE,WAAWkD,GAAE5B,CAAC;AAAA,IAAI;AAC7C,aAASmH,GAAOzI,GAAEsB,GAAG;AAAE,MAAAtB,EAAE,SAASsB,CAAC;AAAA,IAAI;AAEvC,IAAAgH,EAAQ,UAAU,UAAUC,GAC5BD,EAAQ,UAAU,SAASC,GAC3BD,EAAQ,UAAU,QAAQE,IAC1BF,EAAQ,UAAU,QAAQG;AAG1B,aAASC,GAAM1E,GAAG;AAAE,aAAO,KAAK,IAAIA,GAAE,IAAIsE,EAAS,CAAA;AAAA,IAAI;AAIvD,aAASK,GAAmBjJ,GAAEwB,GAAEI,GAAG;AACjC,UAAIvB,IAAI,KAAK,IAAI,KAAK,IAAEL,EAAE,GAAEwB,CAAC;AAG7B,WAFAI,EAAE,IAAI,GACNA,EAAE,IAAIvB,GACAA,IAAI,IAAG,CAAAuB,EAAE,EAAEvB,CAAC,IAAI;AACtB,UAAIG;AACJ,WAAIA,IAAIoB,EAAE,IAAE,KAAK,GAAGvB,IAAIG,GAAG,EAAEH,EAAG,CAAAuB,EAAEvB,IAAE,KAAK,CAAC,IAAI,KAAK,GAAG,GAAEL,EAAEK,CAAC,GAAEuB,GAAEvB,GAAE,GAAE,KAAK,CAAC;AACzE,WAAIG,IAAI,KAAK,IAAIR,EAAE,GAAEwB,CAAC,GAAGnB,IAAIG,GAAG,EAAEH,EAAG,MAAK,GAAG,GAAEL,EAAEK,CAAC,GAAEuB,GAAEvB,GAAE,GAAEmB,IAAEnB,CAAC;AAC7D,MAAAuB,EAAE,MAAK;AAAA,IACR;AAID,aAASsH,GAAmBlJ,GAAEwB,GAAEI,GAAG;AACjC,QAAEJ;AACF,UAAInB,IAAIuB,EAAE,IAAI,KAAK,IAAE5B,EAAE,IAAEwB;AAEzB,WADAI,EAAE,IAAI,GACA,EAAEvB,KAAK,IAAG,CAAAuB,EAAEvB,CAAC,IAAI;AACvB,WAAIA,IAAI,KAAK,IAAImB,IAAE,KAAK,GAAE,CAAC,GAAGnB,IAAIL,EAAE,GAAG,EAAEK;AACvC,QAAAuB,EAAE,KAAK,IAAEvB,IAAEmB,CAAC,IAAI,KAAK,GAAGA,IAAEnB,GAAEL,EAAEK,CAAC,GAAEuB,GAAE,GAAE,GAAE,KAAK,IAAEvB,IAAEmB,CAAC;AACnD,MAAAI,EAAE,MAAK,GACPA,EAAE,UAAU,GAAEA,CAAC;AAAA,IAChB;AAGD,aAASuH,EAAQpI,GAAG;AAElB,WAAK,KAAKZ,KACV,KAAK,KAAKA,KACVJ,EAAW,IAAI,UAAU,IAAEgB,EAAE,GAAE,KAAK,EAAE,GACtC,KAAK,KAAK,KAAK,GAAG,OAAOA,CAAC,GAC1B,KAAK,IAAIA;AAAA,IACV;AAED,aAASqI,GAAe9I,GAAG;AACzB,UAAGA,EAAE,IAAI,KAAKA,EAAE,IAAI,IAAE,KAAK,EAAE,EAAG,QAAOA,EAAE,IAAI,KAAK,CAAC;AAC9C,UAAGA,EAAE,UAAU,KAAK,CAAC,IAAI,EAAG,QAAOA;AACjC,UAAIsB,IAAIzB,EAAK;AAAE,aAAAG,EAAE,OAAOsB,CAAC,GAAG,KAAK,OAAOA,CAAC,GAAUA;AAAA,IAC3D;AAED,aAASyH,GAAc/I,GAAG;AAAE,aAAOA;AAAA,IAAI;AAGvC,aAASgJ,GAAchJ,GAAG;AAKxB,WAJAA,EAAE,UAAU,KAAK,EAAE,IAAE,GAAE,KAAK,EAAE,GAC3BA,EAAE,IAAI,KAAK,EAAE,IAAE,MAAKA,EAAE,IAAI,KAAK,EAAE,IAAE,GAAGA,EAAE,MAAK,IAChD,KAAK,GAAG,gBAAgB,KAAK,IAAG,KAAK,EAAE,IAAE,GAAE,KAAK,EAAE,GAClD,KAAK,EAAE,gBAAgB,KAAK,IAAG,KAAK,EAAE,IAAE,GAAE,KAAK,EAAE,GAC3CA,EAAE,UAAU,KAAK,EAAE,IAAI,IAAG,CAAAA,EAAE,WAAW,GAAE,KAAK,EAAE,IAAE,CAAC;AAEzD,WADAA,EAAE,MAAM,KAAK,IAAGA,CAAC,GACXA,EAAE,UAAU,KAAK,CAAC,KAAK,IAAG,CAAAA,EAAE,MAAM,KAAK,GAAEA,CAAC;AAAA,IACjD;AAGD,aAASiJ,GAAajJ,GAAEsB,GAAG;AAAE,MAAAtB,EAAE,SAASsB,CAAC,GAAG,KAAK,OAAOA,CAAC;AAAA,IAAI;AAG7D,aAAS4H,GAAalJ,GAAEkD,GAAE5B,GAAG;AAAE,MAAAtB,EAAE,WAAWkD,GAAE5B,CAAC,GAAG,KAAK,OAAOA,CAAC;AAAA,IAAI;AAEnE,IAAAuH,EAAQ,UAAU,UAAUC,IAC5BD,EAAQ,UAAU,SAASE,IAC3BF,EAAQ,UAAU,SAASG,IAC3BH,EAAQ,UAAU,QAAQK,IAC1BL,EAAQ,UAAU,QAAQI;AAG1B,aAASE,GAASnF,GAAEvD,GAAG;AACrB,UAAIV,IAAIiE,EAAE,aAAatC,GAAG,IAAIF,EAAI,CAAC,GAAG2D;AACtC,UAAGpF,KAAK,EAAG,QAAO;AACb,MAAGA,IAAI,KAAI2B,IAAI,IACZ3B,IAAI,KAAI2B,IAAI,IACZ3B,IAAI,MAAK2B,IAAI,IACb3B,IAAI,MAAK2B,IAAI,IAChBA,IAAI,GACN3B,IAAI,IACLoF,IAAI,IAAIhB,EAAQ1D,CAAC,IACXA,EAAE,OAAQ,IAChB0E,IAAI,IAAI0D,EAAQpI,CAAC,IAEjB0E,IAAI,IAAIT,EAAWjE,CAAC;AAGtB,UAAI4E,IAAI,IAAI,SAASnE,IAAI,GAAGkI,IAAK1H,IAAE,GAAGK,KAAM,KAAGL,KAAG;AAElD,UADA2D,EAAE,CAAC,IAAIF,EAAE,QAAQ,IAAI,GAClBzD,IAAI,GAAG;AACR,YAAI2H,IAAKxJ;AAET,aADAsF,EAAE,MAAME,EAAE,CAAC,GAAEgE,CAAE,GACTnI,KAAKa;AACT,UAAAsD,EAAEnE,CAAC,IAAIrB,KACPsF,EAAE,MAAMkE,GAAGhE,EAAEnE,IAAE,CAAC,GAAEmE,EAAEnE,CAAC,CAAC,GACtBA,KAAK;AAAA,MAER;AAED,UAAIhB,IAAI8D,EAAE,IAAE,GAAG/D,GAAGqJ,IAAM,IAAMlE,IAAKvF,EAAG,GAAIyC;AAE1C,WADAvC,IAAIsC,EAAM2B,EAAE9D,CAAC,CAAC,IAAE,GACVA,KAAK,KAAG;AAQZ,aAPGH,KAAKqJ,IAAInJ,IAAK+D,EAAE9D,CAAC,KAAIH,IAAEqJ,IAAKrH,KAE7B9B,KAAK+D,EAAE9D,CAAC,KAAI,KAAIH,IAAE,KAAI,MAAMqJ,IAAGrJ,GAC5BG,IAAI,MAAGD,KAAK+D,EAAE9D,IAAE,CAAC,KAAI,KAAK,KAAGH,IAAEqJ,KAGpClI,IAAIQ,GACG,EAAAzB,IAAE;AAAW,UAAAA,MAAM,GAAG,EAAEiB;AAE/B,aADInB,KAAKmB,KAAK,MAAKnB,KAAK,KAAK,IAAI,EAAEG,IAChCoJ;AACD,UAAAjE,EAAEpF,CAAC,EAAE,OAAO,CAAC,GACbqJ,IAAM;AAAA,aAEH;AACH,iBAAMpI,IAAI;AAAK,YAAAiE,EAAE,MAAM,GAAEC,CAAE,GAAGD,EAAE,MAAMC,GAAG,CAAC,GAAGlE,KAAK;AAClD,UAAGA,IAAI,IAAGiE,EAAE,MAAM,GAAEC,CAAE,KAAU9C,IAAI,GAAG,IAAI8C,GAAIA,IAAK9C,IACpD6C,EAAE,MAAMC,GAAGC,EAAEpF,CAAC,GAAE,CAAC;AAAA,QAClB;AAED,eAAMC,KAAK,KAAM,EAAA8D,EAAE9D,CAAC,IAAG,KAAGH;AACxB,UAAAoF,EAAE,MAAM,GAAEC,CAAE,GAAG9C,IAAI,GAAG,IAAI8C,GAAIA,IAAK9C,GAChC,EAAEvC,IAAI,MAAKA,IAAI,KAAK,KAAG,GAAG,EAAEG;AAAA,MAElC;AACD,aAAOiF,EAAE,OAAO,CAAC;AAAA,IAClB;AAGD,aAASoE,GAAM7J,GAAG;AAChB,UAAIM,IAAK,KAAK,IAAE,IAAG,KAAK,OAAQ,IAAC,KAAK,SAClCkD,IAAKxD,EAAE,IAAE,IAAGA,EAAE,OAAQ,IAACA,EAAE;AAC7B,UAAGM,EAAE,UAAUkD,CAAC,IAAI,GAAG;AAAE,YAAIZ,IAAItC;AAAG,QAAAA,IAAIkD,GAAGA,IAAIZ;AAAA,MAAI;AACnD,UAAIvC,IAAIC,EAAE,gBAAe,GAAIqF,IAAInC,EAAE;AACnC,UAAGmC,IAAI,EAAG,QAAOrF;AAMjB,WALGD,IAAIsF,MAAGA,IAAItF,IACXsF,IAAI,MACLrF,EAAE,SAASqF,GAAErF,CAAC,GACdkD,EAAE,SAASmC,GAAEnC,CAAC,IAEVlD,EAAE,OAAQ,IAAG;AACjB,SAAID,IAAIC,EAAE,gBAAiB,KAAI,KAAGA,EAAE,SAASD,GAAEC,CAAC,IAC5CD,IAAImD,EAAE,gBAAiB,KAAI,KAAGA,EAAE,SAASnD,GAAEmD,CAAC,GAC7ClD,EAAE,UAAUkD,CAAC,KAAK,KACnBlD,EAAE,MAAMkD,GAAElD,CAAC,GACXA,EAAE,SAAS,GAAEA,CAAC,MAGdkD,EAAE,MAAMlD,GAAEkD,CAAC,GACXA,EAAE,SAAS,GAAEA,CAAC;AAGlB,aAAGmC,IAAI,KAAGnC,EAAE,SAASmC,GAAEnC,CAAC,GACjBA;AAAA,IACR;AAGD,aAASsG,GAAUtI,GAAG;AACpB,UAAGA,KAAK,EAAG,QAAO;AAClB,UAAIc,IAAI,KAAK,KAAGd,GAAGI,IAAK,KAAK,IAAE,IAAGJ,IAAE,IAAE;AACtC,UAAG,KAAK,IAAI;AACV,YAAGc,KAAK,EAAG,CAAAV,IAAI,KAAK,CAAC,IAAEJ;AAAA,YAClB,UAAQnB,IAAI,KAAK,IAAE,GAAGA,KAAK,GAAG,EAAEA,EAAG,CAAAuB,KAAKU,IAAEV,IAAE,KAAKvB,CAAC,KAAGmB;AAC5D,aAAOI;AAAA,IACR;AAGD,aAASmI,GAAahJ,GAAG;AACvB,UAAIiJ,IAAKjJ,EAAE;AACX,UAAI,KAAK,OAAQ,KAAIiJ,KAAOjJ,EAAE,OAAM,KAAM,EAAG,QAAOhB,EAAW;AAG/D,eAFIkK,IAAIlJ,EAAE,MAAK,GAAIN,IAAI,KAAK,SACxBT,IAAI8B,EAAI,CAAC,GAAG7B,IAAI6B,EAAI,CAAC,GAAG5B,IAAI4B,EAAI,CAAC,GAAGQ,IAAIR,EAAI,CAAC,GAC3CmI,EAAE,OAAQ,KAAI,KAAG;AACrB,eAAMA,EAAE;AACN,UAAAA,EAAE,SAAS,GAAEA,CAAC,GACXD,MACE,CAAChK,EAAE,OAAQ,KAAI,CAACC,EAAE,OAAQ,OAAID,EAAE,MAAM,MAAKA,CAAC,GAAGC,EAAE,MAAMc,GAAEd,CAAC,IAC7DD,EAAE,SAAS,GAAEA,CAAC,KAEPC,EAAE,OAAQ,KAAEA,EAAE,MAAMc,GAAEd,CAAC,GAChCA,EAAE,SAAS,GAAEA,CAAC;AAEhB,eAAMQ,EAAE;AACN,UAAAA,EAAE,SAAS,GAAEA,CAAC,GACXuJ,MACE,CAAC9J,EAAE,OAAQ,KAAI,CAACoC,EAAE,OAAQ,OAAIpC,EAAE,MAAM,MAAKA,CAAC,GAAGoC,EAAE,MAAMvB,GAAEuB,CAAC,IAC7DpC,EAAE,SAAS,GAAEA,CAAC,KAEPoC,EAAE,OAAQ,KAAEA,EAAE,MAAMvB,GAAEuB,CAAC,GAChCA,EAAE,SAAS,GAAEA,CAAC;AAEhB,QAAG2H,EAAE,UAAUxJ,CAAC,KAAK,KACnBwJ,EAAE,MAAMxJ,GAAEwJ,CAAC,GACRD,KAAIhK,EAAE,MAAME,GAAEF,CAAC,GAClBC,EAAE,MAAMqC,GAAErC,CAAC,MAGXQ,EAAE,MAAMwJ,GAAExJ,CAAC,GACRuJ,KAAI9J,EAAE,MAAMF,GAAEE,CAAC,GAClBoC,EAAE,MAAMrC,GAAEqC,CAAC;AAAA,MAEd;AACD,UAAG7B,EAAE,UAAUV,EAAW,GAAG,KAAK,EAAG,QAAOA,EAAW;AACvD,UAAGuC,EAAE,UAAUvB,CAAC,KAAK,EAAG,QAAOuB,EAAE,SAASvB,CAAC;AAC3C,UAAGuB,EAAE,WAAW,EAAG,CAAAA,EAAE,MAAMvB,GAAEuB,CAAC;AAAA,UAAQ,QAAOA;AAC7C,aAAGA,EAAE,OAAQ,IAAG,IAAUA,EAAE,IAAIvB,CAAC,IAAeuB;AAAA,IACjD;AAED,QAAI4H,IAAY,CAAC,GAAE,GAAE,GAAE,GAAE,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,GAAG,GAC/oBC,MAAS,KAAG,MAAID,EAAUA,EAAU,SAAO,CAAC;AAGhD,aAASE,GAAkB,GAAG;AAC5B,UAAI,GAAG9J,IAAI,KAAK,IAAG;AACnB,UAAGA,EAAE,KAAK,KAAKA,EAAE,CAAC,KAAK4J,EAAUA,EAAU,SAAO,CAAC,GAAG;AACpD,aAAI,IAAI,GAAG,IAAIA,EAAU,QAAQ,EAAE;AACjC,cAAG5J,EAAE,CAAC,KAAK4J,EAAU,CAAC,EAAG,QAAO;AAClC,eAAO;AAAA,MACR;AACD,UAAG5J,EAAE,SAAU,QAAO;AAEtB,WADA,IAAI,GACE,IAAI4J,EAAU,UAAQ;AAE1B,iBADInJ,IAAImJ,EAAU,CAAC,GAAG1J,IAAI,IAAE,GACtBA,IAAI0J,EAAU,UAAUnJ,IAAIoJ,KAAO,CAAApJ,KAAKmJ,EAAU1J,GAAG;AAE3D,aADAO,IAAIT,EAAE,OAAOS,CAAC,GACR,IAAIP,IAAG,KAAGO,IAAEmJ,EAAU,GAAG,KAAK,EAAG,QAAO;AAAA,MAC/C;AACD,aAAO5J,EAAE,YAAY,CAAC;AAAA,IACvB;AAGD,aAAS+J,GAAe,GAAG;AACzB,UAAIC,IAAK,KAAK,SAASvK,EAAW,GAAG,GACjCiC,IAAIsI,EAAG;AACX,UAAGtI,KAAK,EAAG,QAAO;AAClB,UAAIJ,IAAI0I,EAAG,WAAWtI,CAAC;AACvB,UAAK,IAAE,KAAI,GACR,IAAIkI,EAAU,WAAQ,IAAIA,EAAU;AAEvC,eADIlK,IAAIG,KACAE,IAAI,GAAGA,IAAI,GAAG,EAAEA,GAAG;AAEzB,QAAAL,EAAE,QAAQkK,EAAU,KAAK,MAAM,KAAK,WAASA,EAAU,MAAM,CAAC,CAAC;AAC/D,YAAI1G,IAAIxD,EAAE,OAAO4B,GAAE,IAAI;AACvB,YAAG4B,EAAE,UAAUzD,EAAW,GAAG,KAAK,KAAKyD,EAAE,UAAU8G,CAAE,KAAK,GAAG;AAE3D,mBADI9J,IAAI,GACFA,MAAMwB,KAAKwB,EAAE,UAAU8G,CAAE,KAAK;AAElC,gBADA9G,IAAIA,EAAE,UAAU,GAAE,IAAI,GACnBA,EAAE,UAAUzD,EAAW,GAAG,KAAK,EAAG,QAAO;AAE9C,cAAGyD,EAAE,UAAU8G,CAAE,KAAK,EAAG,QAAO;AAAA,QACjC;AAAA,MACF;AACD,aAAO;AAAA,IACR;AAGD,IAAAvK,EAAW,UAAU,YAAYkG,IACjClG,EAAW,UAAU,UAAUoG,IAC/BpG,EAAW,UAAU,YAAYsG,IACjCtG,EAAW,UAAU,aAAauG,IAClCvG,EAAW,UAAU,YAAY6G,IACjC7G,EAAW,UAAU,YAAY+H,IACjC/H,EAAW,UAAU,QAAQmI,IAC7BnI,EAAW,UAAU,YAAY2I,IACjC3I,EAAW,UAAU,aAAa4I,IAClC5I,EAAW,UAAU,kBAAkBkJ,IACvClJ,EAAW,UAAU,kBAAkBmJ,IACvCnJ,EAAW,UAAU,SAAS+J,IAC9B/J,EAAW,UAAU,cAAcsK,IAGnCtK,EAAW,UAAU,QAAQ8F,IAC7B9F,EAAW,UAAU,WAAW+F,IAChC/F,EAAW,UAAU,YAAYgG,IACjChG,EAAW,UAAU,aAAaiG,IAClCjG,EAAW,UAAU,SAASmG,IAC9BnG,EAAW,UAAU,cAAcyG,IACnCzG,EAAW,UAAU,SAAS0G,IAC9B1G,EAAW,UAAU,MAAM2G,IAC3B3G,EAAW,UAAU,MAAM4G,IAC3B5G,EAAW,UAAU,MAAMiH,IAC3BjH,EAAW,UAAU,KAAKkH,IAC1BlH,EAAW,UAAU,MAAMoH,IAC3BpH,EAAW,UAAU,SAASsH,IAC9BtH,EAAW,UAAU,MAAMuH,IAC3BvH,EAAW,UAAU,YAAYwH,IACjCxH,EAAW,UAAU,aAAayH,IAClCzH,EAAW,UAAU,kBAAkB2H,IACvC3H,EAAW,UAAU,WAAW6H,IAChC7H,EAAW,UAAU,UAAU8H,IAC/B9H,EAAW,UAAU,SAASgI,IAC9BhI,EAAW,UAAU,WAAWiI,IAChCjI,EAAW,UAAU,UAAUkI,IAC/BlI,EAAW,UAAU,MAAMoI,IAC3BpI,EAAW,UAAU,WAAWqI,IAChCrI,EAAW,UAAU,WAAWsI,IAChCtI,EAAW,UAAU,SAASwI,IAC9BxI,EAAW,UAAU,YAAYyI,IACjCzI,EAAW,UAAU,qBAAqB0I,IAC1C1I,EAAW,UAAU,SAAS0J,IAC9B1J,EAAW,UAAU,aAAagK,IAClChK,EAAW,UAAU,MAAMiJ,IAC3BjJ,EAAW,UAAU,MAAM8J,IAC3B9J,EAAW,UAAU,kBAAkBqK,IAGvCrK,EAAW,UAAU,SAASuI,IAG9BvI,EAAW,UAAU,UAAUoJ;AAiB/B,QAAIoB,GACAC,GACAC;AAGJ,aAASC,GAAapK,GAAG;AACvB,MAAAkK,EAASC,GAAU,KAAKnK,IAAI,KAC5BkK,EAASC,GAAU,KAAMnK,KAAK,IAAK,KACnCkK,EAASC,GAAU,KAAMnK,KAAK,KAAM,KACpCkK,EAASC,GAAU,KAAMnK,KAAK,KAAM,KACjCmK,KAAYE,MAAWF,KAAYE;AAAA,IACvC;AAGD,aAASC,IAAgB;AACvB,MAAAF,IAAa,oBAAI,QAAO,QAAS,CAAA;AAAA,IAClC;AAGD,QAAGF,KAAY,MAAM;AACnB,MAAAA,IAAW,IAAI,SACfC,IAAW;AACX,UAAI7H;AACJ,UAAG,OAAO,SAAW,OAAe,OAAO;AACzC,YAAI,OAAO,OAAO,iBAAiB;AAEjC,cAAIiI,IAAK,IAAI,WAAW,EAAE;AAE1B,eADA,OAAO,OAAO,gBAAgBA,CAAE,GAC5BjI,IAAI,GAAGA,IAAI,IAAI,EAAEA;AACnB,YAAA4H,EAASC,GAAU,IAAII,EAAGjI,CAAC;AAAA,QAC9B,WACO,UAAU,WAAW,cAAc,UAAU,aAAa,KAAK;AAErE,cAAI6C,IAAI,OAAO,OAAO,OAAO,EAAE;AAC/B,eAAI7C,IAAI,GAAGA,IAAI6C,EAAE,QAAQ,EAAE7C;AACzB,YAAA4H,EAASC,GAAU,IAAIhF,EAAE,WAAW7C,CAAC,IAAI;AAAA,QAC5C;AAAA;AAEH,aAAM6H,IAAWE;AACf,QAAA/H,IAAI,KAAK,MAAM,QAAQ,KAAK,OAAM,CAAE,GACpC4H,EAASC,GAAU,IAAI7H,MAAM,GAC7B4H,EAASC,GAAU,IAAI7H,IAAI;AAE7B,MAAA6H,IAAW,GACXG;IAGD;AAED,aAASE,KAAe;AACtB,UAAGP,KAAa,MAAM;AAIpB,aAHAK,KACAL,IAAYQ,GAAa,GACzBR,EAAU,KAAKC,CAAQ,GACnBC,IAAW,GAAGA,IAAWD,EAAS,QAAQ,EAAEC;AAC9C,UAAAD,EAASC,CAAQ,IAAI;AACvB,QAAAA,IAAW;AAAA,MAEZ;AAED,aAAOF,EAAU;IAClB;AAED,aAASS,GAAcC,GAAI;AACzB,UAAI;AACJ,WAAI,IAAI,GAAG,IAAIA,EAAG,QAAQ,EAAE,EAAG,CAAAA,EAAG,CAAC,IAAIH,GAAY;AAAA,IACpD;AAED,aAASI,IAAe;AAAA,IAAE;AAE1B,IAAAA,EAAa,UAAU,YAAYF;AAInC,aAASG,IAAU;AACjB,WAAK,IAAI,GACT,KAAK,IAAI,GACT,KAAK,IAAI,IAAI;IACd;AAGD,aAASC,GAASC,GAAK;AACrB,UAAI,GAAG7K,GAAGoC;AACV,WAAI,IAAI,GAAG,IAAI,KAAK,EAAE;AACpB,aAAK,EAAE,CAAC,IAAI;AAEd,WADApC,IAAI,GACA,IAAI,GAAG,IAAI,KAAK,EAAE;AACpB,QAAAA,IAAKA,IAAI,KAAK,EAAE,CAAC,IAAI6K,EAAI,IAAIA,EAAI,MAAM,IAAK,KAC5CzI,IAAI,KAAK,EAAE,CAAC,GACZ,KAAK,EAAE,CAAC,IAAI,KAAK,EAAEpC,CAAC,GACpB,KAAK,EAAEA,CAAC,IAAIoC;AAEd,WAAK,IAAI,GACT,KAAK,IAAI;AAAA,IACV;AAED,aAAS0I,KAAW;AAClB,UAAI;AACJ,kBAAK,IAAK,KAAK,IAAI,IAAK,KACxB,KAAK,IAAK,KAAK,IAAI,KAAK,EAAE,KAAK,CAAC,IAAK,KACrC,IAAI,KAAK,EAAE,KAAK,CAAC,GACjB,KAAK,EAAE,KAAK,CAAC,IAAI,KAAK,EAAE,KAAK,CAAC,GAC9B,KAAK,EAAE,KAAK,CAAC,IAAI,GACV,KAAK,EAAG,IAAI,KAAK,EAAE,KAAK,CAAC,IAAK,GAAG;AAAA,IACzC;AAED,IAAAH,EAAQ,UAAU,OAAOC,IACzBD,EAAQ,UAAU,OAAOG;AAGzB,aAASP,KAAgB;AACvB,aAAO,IAAII,EAAO;AAAA,IACnB;AAID,QAAIR,IAAY;AAGF,IAAAY,EAAiB,UAAA;AAAA,MACvB,SAASxL;AAAA,MACT,YAAYA;AAAA,MACZ,cAAcmL;AAAA,IAC1B;AAAA,EAQA,GAAG,KAAKM,EAAI;;;","x_google_ignoreList":[0]}

package/dist/index.js

@@ -1,60 +1,64 @@
 import { default as r } from "./error/OrionError.js";
 import { default as a } from "./Throne/index.js";
-import { useThroneContext as x } from "./Throne/hooks/use-throne-context.js";
+import { useThroneContext as l } from "./Throne/hooks/use-throne-context.js";
 import { install as s } from "./components/index.js";
 import { default as p } from "./version/version.js";
 import { OTree as d, OTree as n } from "./components/Tree/index.js";
-import { default as b } from "./components/Modal/useModal.js";
-import { default as O } from "./components/Form/LovInput/hooks/useLov.js";
-import { default as i } from "./components/Form/TableSelect/hooks/useTableSelect.js";
-import { default as g } from "./components/Button/index.js";
-import { T as S } from "./components-G3_R2B-U.js";
-import { S as y } from "./index-BbsXWo7C.js";
-import { Colflex as B, Flexitem as F, Rowflex as K } from "./components/Flex/index.js";
-import { default as w } from "./components/Card/index.js";
-import { default as I } from "./components/Tabs/index.js";
-import { default as R } from "./components/Pagetable/index.js";
-import { default as k } from "./components/Querytable/index.js";
-import { default as z } from "./components/Modal/index.js";
-import { default as D } from "./components/Form/index.js";
-import { default as H } from "./components/LovTable/index.js";
-import { default as N } from "./components/TableSelectPagetable/index.js";
-import { default as V } from "./components/Icon/index.js";
-import { formContextKey as X } from "./components/Form/Form.js";
-import { lovContextKey as Z } from "./components/Form/LovInput/LovInput.js";
-import { tableSelectContext as $ } from "./components/Form/TableSelect/TableSelect.js";
-import { OMessage as oe } from "./components/Message/index.js";
-import { OMessageBox as te } from "./components/MessageBox/index.js";
+import { default as T } from "./components/Modal/useModal.js";
+import { default as C } from "./components/Form/LovInput/hooks/useLov.js";
+import { default as O } from "./components/Form/TableSelect/hooks/useTableSelect.js";
+import { default as c } from "./components/Pagetable/hooks/usePagetable.js";
+import { default as y } from "./components/Button/index.js";
+import { T as S } from "./components-BvgQJQRM.js";
+import { S as L } from "./index-BbsXWo7C.js";
+import { Colflex as F, Flexitem as K, Rowflex as Q } from "./components/Flex/index.js";
+import { default as E } from "./components/Card/index.js";
+import { default as R } from "./components/Tabs/index.js";
+import { default as k, pagetableProps as q } from "./components/Pagetable/index.js";
+import { default as A } from "./components/Querytable/index.js";
+import { default as G } from "./components/Modal/index.js";
+import { default as J } from "./components/Form/index.js";
+import { LovPagetable as U, LovQuerytable as V } from "./components/LovTable/index.js";
+import { default as X } from "./components/TableSelectPagetable/index.js";
+import { default as Z } from "./components/Icon/index.js";
+import { formContextKey as $ } from "./components/Form/Form.js";
+import { lovContextKey as oe } from "./components/Form/LovInput/LovInput.js";
+import { tableSelectContext as te } from "./components/Form/TableSelect/TableSelect.js";
+import { OMessage as fe } from "./components/Message/index.js";
+import { OMessageBox as xe } from "./components/MessageBox/index.js";
 export {
-  g as Button,
-  w as Card,
-  B as Colflex,
-  F as Flexitem,
-  D as Form,
-  V as Icon,
-  H as LovTable,
-  z as Modal,
-  oe as OMessage,
-  te as OMessageBox,
+  y as Button,
+  E as Card,
+  F as Colflex,
+  K as Flexitem,
+  J as Form,
+  Z as Icon,
+  U as LovPagetable,
+  V as LovQuerytable,
+  G as Modal,
+  fe as OMessage,
+  xe as OMessageBox,
   d as OTree,
   r as OrionError,
-  R as Pagetable,
-  k as Querytable,
-  K as Rowflex,
-  y as Space,
-  N as TableSelectPagetable,
-  I as Tabs,
+  k as Pagetable,
+  A as Querytable,
+  Q as Rowflex,
+  L as Space,
+  X as TableSelectPagetable,
+  R as Tabs,
   a as Throne,
   S as ThroneContextProvider,
   n as Tree,
-  X as formContextKey,
+  $ as formContextKey,
   s as install,
-  Z as lovContextKey,
-  $ as tableSelectContext,
-  O as useLov,
-  b as useOModal,
-  i as useTableselect,
-  x as useThroneContext,
+  oe as lovContextKey,
+  q as pagetableProps,
+  te as tableSelectContext,
+  C as useLov,
+  T as useOModal,
+  c as usePagetable,
+  O as useTableselect,
+  l as useThroneContext,
   p as version
 };
 //# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;"}
+{"version":3,"file":"index.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;"}

package/dist/request/disivion/DivisionErrorHandler.d.ts

@@ -1,6 +1,4 @@
 import { default as ErrorHandlerChain } from '../ErrorHandlerChain';
-export declare function readBlob(blob: Blob): Promise<string>;
 export default class DivisionErrorHandler {
-    constructor();
     handle(error: Error, chain: ErrorHandlerChain): Promise<void>;
 }

package/dist/request/disivion/DivisionErrorHandler.js

@@ -1,37 +1,27 @@
-import l from "../error/ResponseError.js";
-import i from "../error/ExceptionResponseError.js";
-import p from "../error/BizExceptionResponseError.js";
-import f from "../error/SessionExceptionResponseError.js";
-function w(c) {
-  return new Promise((s) => {
-    const n = new FileReader();
-    n.addEventListener("loadend", () => {
-      s(n.result);
-    }), n.readAsText(c);
-  });
-}
-class R {
-  constructor() {
-  }
-  async handle(s, n) {
-    if (s instanceof l) {
-      const t = s.response;
-      if (t.status == 200) {
-        const o = t.data;
+import i from "../error/ResponseError.js";
+import a from "../error/ResponseErrorException.js";
+import p from "../error/ResponseErrorBizException.js";
+import l from "../error/ResponseErrorSessionException.js";
+import c from "../utils/readBlob.js";
+class B {
+  async handle(o, w) {
+    if (o instanceof i) {
+      const s = o.response;
+      if (s.status == 200) {
+        const t = s.data;
         let e;
-        o instanceof Blob ? (e = await w(o), e = JSON.parse(e), e = JSON.parse(e)) : e = o;
-        const { success: d, errorcode: a, data: u, errortext: r } = e;
-        throw a === "-1" ? new i(r, s, t, e) : a === "-2" ? new p(r, s, t, e) : a === "-3" ? new f(r, s, t, e) : new i(r, s, t, e);
+        t instanceof Blob ? (e = await c(t), e = JSON.parse(e), e = JSON.parse(e)) : e = t;
+        const { success: m, errorcode: r, data: h, errortext: n } = e;
+        throw r === "-1" ? new a(n, o, s, e) : r === "-2" ? new p(n, o, s, e) : r === "-3" ? new l(n, o, s, e) : new a(n, o, s, e);
       } else {
-        let o = "'" + t.config.url + "' " + t.status + " " + t.statusText;
-        throw new i(o, s, t, null);
+        let t = "'" + s.config.url + "' " + s.status + " " + s.statusText;
+        throw new a(t, o, s, null);
       }
     }
-    throw s;
+    throw o;
   }
 }
 export {
-  R as default,
-  w as readBlob
+  B as default
 };
 //# sourceMappingURL=DivisionErrorHandler.js.map

package/dist/request/disivion/DivisionErrorHandler.js.map

@@ -1 +1 @@
-{"version":3,"file":"DivisionErrorHandler.js","sources":["../../../src/request/disivion/DivisionErrorHandler.ts"],"sourcesContent":["// import { Modal } from 'dw-neit-antd'\r\n// import SobekThrone from '../../throne/SobekThrone'\r\n// import SobekMsgBox from '../../msgbox/SobekMsgBox'\r\n\r\nimport type ErrorHandlerChain from '../ErrorHandlerChain'\r\n\r\nimport ResponseError from '../error/ResponseError'\r\nimport ExceptionResponseError from '../error/ExceptionResponseError'\r\nimport BizExceptionResponseError from '../error/BizExceptionResponseError'\r\nimport SessionExceptionResponseError from '../error/SessionExceptionResponseError'\r\n\r\nexport function readBlob(blob: Blob): Promise<string> {\r\n  return new Promise((resolve) => {\r\n    const reader = new FileReader()\r\n    reader.addEventListener('loadend', () => {\r\n      resolve(reader.result as string)\r\n    })\r\n    reader.readAsText(blob)\r\n  })\r\n}\r\n\r\nexport default class DivisionErrorHandler {\r\n  constructor() {}\r\n\r\n  async handle(error: Error, chain: ErrorHandlerChain) {\r\n    if (error instanceof ResponseError) {\r\n      const response = error.response\r\n      if (response.status == 200) {\r\n        const rawData = response.data\r\n        let jsonData\r\n\r\n        if (rawData instanceof Blob) {\r\n          // 文件下载抛异常JSON，在Blob里面\r\n          jsonData = await readBlob(rawData)\r\n          jsonData = JSON.parse(jsonData)\r\n          jsonData = JSON.parse(jsonData)\r\n        } else {\r\n          // 普通请求的异常JSON\r\n          jsonData = rawData\r\n        }\r\n\r\n        const { success, errorcode, data, errortext } = jsonData\r\n        if (errorcode === '-1') {\r\n          throw new ExceptionResponseError(errortext, error, response, jsonData)\r\n        } else if (errorcode === '-2') {\r\n          throw new BizExceptionResponseError(errortext, error, response, jsonData)\r\n        } else if (errorcode === '-3') {\r\n          throw new SessionExceptionResponseError(errortext, error, response, jsonData)\r\n        } else {\r\n          throw new ExceptionResponseError(errortext, error, response, jsonData)\r\n        }\r\n      } else {\r\n        let errortext = \"'\" + response.config.url + \"' \" + response.status + ' ' + response.statusText\r\n        throw new ExceptionResponseError(errortext, error, response, null)\r\n      }\r\n    }\r\n\r\n    throw error\r\n  }\r\n}\r\n"],"names":["readBlob","blob","resolve","reader","DivisionErrorHandler","error","chain","ResponseError","response","rawData","jsonData","success","errorcode","data","errortext","ExceptionResponseError","BizExceptionResponseError","SessionExceptionResponseError"],"mappings":";;;;AAWO,SAASA,EAASC,GAA6B;AAC7C,SAAA,IAAI,QAAQ,CAACC,MAAY;AACxB,UAAAC,IAAS,IAAI;AACZ,IAAAA,EAAA,iBAAiB,WAAW,MAAM;AACvC,MAAAD,EAAQC,EAAO,MAAgB;AAAA,IAAA,CAChC,GACDA,EAAO,WAAWF,CAAI;AAAA,EAAA,CACvB;AACH;AAEA,MAAqBG,EAAqB;AAAA,EACxC,cAAc;AAAA,EAAC;AAAA,EAEf,MAAM,OAAOC,GAAcC,GAA0B;AACnD,QAAID,aAAiBE,GAAe;AAClC,YAAMC,IAAWH,EAAM;AACnB,UAAAG,EAAS,UAAU,KAAK;AAC1B,cAAMC,IAAUD,EAAS;AACrB,YAAAE;AAEJ,QAAID,aAAmB,QAEVC,IAAA,MAAMV,EAASS,CAAO,GACtBC,IAAA,KAAK,MAAMA,CAAQ,GACnBA,IAAA,KAAK,MAAMA,CAAQ,KAGnBA,IAAAD;AAGb,cAAM,EAAE,SAAAE,GAAS,WAAAC,GAAW,MAAAC,GAAM,WAAAC,MAAcJ;AAChD,cAAIE,MAAc,OACV,IAAIG,EAAuBD,GAAWT,GAAOG,GAAUE,CAAQ,IAC5DE,MAAc,OACjB,IAAII,EAA0BF,GAAWT,GAAOG,GAAUE,CAAQ,IAC/DE,MAAc,OACjB,IAAIK,EAA8BH,GAAWT,GAAOG,GAAUE,CAAQ,IAEtE,IAAIK,EAAuBD,GAAWT,GAAOG,GAAUE,CAAQ;AAAA,MACvE,OACK;AACD,YAAAI,IAAY,MAAMN,EAAS,OAAO,MAAM,OAAOA,EAAS,SAAS,MAAMA,EAAS;AACpF,cAAM,IAAIO,EAAuBD,GAAWT,GAAOG,GAAU,IAAI;AAAA,MACnE;AAAA,IACF;AAEM,UAAAH;AAAA,EACR;AACF;"}
+{"version":3,"file":"DivisionErrorHandler.js","sources":["../../../src/request/disivion/DivisionErrorHandler.ts"],"sourcesContent":["import type ErrorHandlerChain from '../ErrorHandlerChain'\r\n\r\nimport ResponseError from '../error/ResponseError'\r\nimport ResponseErrorException from '../error/ResponseErrorException'\r\nimport ResponseErrorBizException from '../error/ResponseErrorBizException'\r\nimport ResponseErrorSessionException from '../error/ResponseErrorSessionException'\r\n\r\nimport readBlob from '../utils/readBlob'\r\n\r\nexport default class DivisionErrorHandler {\r\n  async handle(error: Error, chain: ErrorHandlerChain) {\r\n    if (error instanceof ResponseError) {\r\n      const response = error.response\r\n      if (response.status == 200) {\r\n        const rawData = response.data\r\n        let jsonData\r\n\r\n        if (rawData instanceof Blob) {\r\n          // 文件下载抛异常JSON，在Blob里面\r\n          jsonData = await readBlob(rawData)\r\n          jsonData = JSON.parse(jsonData)\r\n          jsonData = JSON.parse(jsonData)\r\n        } else {\r\n          // 普通请求的异常JSON\r\n          jsonData = rawData\r\n        }\r\n\r\n        const { success, errorcode, data, errortext } = jsonData\r\n        if (errorcode === '-1') {\r\n          throw new ResponseErrorException(errortext, error, response, jsonData)\r\n        } else if (errorcode === '-2') {\r\n          throw new ResponseErrorBizException(errortext, error, response, jsonData)\r\n        } else if (errorcode === '-3') {\r\n          throw new ResponseErrorSessionException(errortext, error, response, jsonData)\r\n        } else {\r\n          throw new ResponseErrorException(errortext, error, response, jsonData)\r\n        }\r\n      } else {\r\n        let errortext = \"'\" + response.config.url + \"' \" + response.status + ' ' + response.statusText\r\n        throw new ResponseErrorException(errortext, error, response, null)\r\n      }\r\n    }\r\n\r\n    throw error\r\n  }\r\n}\r\n"],"names":["DivisionErrorHandler","error","chain","ResponseError","response","rawData","jsonData","readBlob","success","errorcode","data","errortext","ResponseErrorException","ResponseErrorBizException","ResponseErrorSessionException"],"mappings":";;;;;AASA,MAAqBA,EAAqB;AAAA,EACxC,MAAM,OAAOC,GAAcC,GAA0B;AACnD,QAAID,aAAiBE,GAAe;AAClC,YAAMC,IAAWH,EAAM;AACnB,UAAAG,EAAS,UAAU,KAAK;AAC1B,cAAMC,IAAUD,EAAS;AACrB,YAAAE;AAEJ,QAAID,aAAmB,QAEVC,IAAA,MAAMC,EAASF,CAAO,GACtBC,IAAA,KAAK,MAAMA,CAAQ,GACnBA,IAAA,KAAK,MAAMA,CAAQ,KAGnBA,IAAAD;AAGb,cAAM,EAAE,SAAAG,GAAS,WAAAC,GAAW,MAAAC,GAAM,WAAAC,MAAcL;AAChD,cAAIG,MAAc,OACV,IAAIG,EAAuBD,GAAWV,GAAOG,GAAUE,CAAQ,IAC5DG,MAAc,OACjB,IAAII,EAA0BF,GAAWV,GAAOG,GAAUE,CAAQ,IAC/DG,MAAc,OACjB,IAAIK,EAA8BH,GAAWV,GAAOG,GAAUE,CAAQ,IAEtE,IAAIM,EAAuBD,GAAWV,GAAOG,GAAUE,CAAQ;AAAA,MACvE,OACK;AACD,YAAAK,IAAY,MAAMP,EAAS,OAAO,MAAM,OAAOA,EAAS,SAAS,MAAMA,EAAS;AACpF,cAAM,IAAIQ,EAAuBD,GAAWV,GAAOG,GAAU,IAAI;AAAA,MACnE;AAAA,IACF;AAEM,UAAAH;AAAA,EACR;AACF;"}

package/dist/request/disivion/index.d.ts

@@ -13,6 +13,7 @@ export declare function upload(url: string, params: RequestParams, options: Requ
 export declare const config: {
     setBaseUrl: (pBaseUrl: string) => void;
     setRequestTimeout: (pTimeout: number) => void;
+    setResponseType: (pType: "json" | "text") => void;
     setRequestHeaders: (pRequestHeaders: () => Record<string, string | null>) => void;
     setRequestFilters: (...filters: RequestFilter[]) => void;
     setResponseParsers: (...parsers: ResponseParser[]) => void;