@intlayer/backend 7.0.9-canary.0 → 7.0.9-canary.3

package/dist/cjs/node_modules/node-forge/lib/jsbn.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"jsbn.cjs","names":[],"sources":["../../../../../../../node_modules/node-forge/lib/jsbn.js"],"sourcesContent":["// 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/*\nLicensing (LICENSE)\n-------------------\n\nThis software is covered under the following copyright:\n*/\n/*\n * Copyright (c) 2003-2005  Tom Wu\n * All Rights Reserved.\n *\n * Permission is hereby granted, free of charge, to any person obtaining\n * a copy of this software and associated documentation files (the\n * \"Software\"), to deal in the Software without restriction, including\n * without limitation the rights to use, copy, modify, merge, publish,\n * distribute, sublicense, and/or sell copies of the Software, and to\n * permit persons to whom the Software is furnished to do so, subject to\n * the following conditions:\n *\n * The above copyright notice and this permission notice shall be\n * included in all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS-IS\" AND WITHOUT WARRANTY OF ANY KIND,\n * EXPRESS, IMPLIED OR OTHERWISE, INCLUDING WITHOUT LIMITATION, ANY\n * WARRANTY OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE.\n *\n * IN NO EVENT SHALL TOM WU BE LIABLE FOR ANY SPECIAL, INCIDENTAL,\n * INDIRECT OR CONSEQUENTIAL DAMAGES OF ANY KIND, OR ANY DAMAGES WHATSOEVER\n * RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER OR NOT ADVISED OF\n * THE POSSIBILITY OF DAMAGE, AND ON ANY THEORY OF LIABILITY, ARISING OUT\n * OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n *\n * In addition, the following condition applies:\n *\n * All redistributions must retain an intact copy of this copyright notice\n * and disclaimer.\n */\n/*\nAddress all questions regarding this license to:\n\n  Tom Wu\n  tjw@cs.Stanford.EDU\n*/\nvar forge = require('./forge');\n\nmodule.exports = forge.jsbn = forge.jsbn || {};\n\n// Bits per digit\nvar dbits;\n\n// JavaScript engine analysis\nvar canary = 0xdeadbeefcafe;\nvar j_lm = ((canary&0xffffff)==0xefcafe);\n\n// (public) Constructor\nfunction BigInteger(a,b,c) {\n  this.data = [];\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}\nforge.jsbn.BigInteger = BigInteger;\n\n// return new, unset BigInteger\nfunction 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)\nfunction am1(i,x,w,j,c,n) {\n  while(--n >= 0) {\n    var v = x*this.data[i++]+w.data[j]+c;\n    c = Math.floor(v/0x4000000);\n    w.data[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)\nfunction am2(i,x,w,j,c,n) {\n  var xl = x&0x7fff, xh = x>>15;\n  while(--n >= 0) {\n    var l = this.data[i]&0x7fff;\n    var h = this.data[i++]>>15;\n    var m = xh*l+h*xl;\n    l = xl*l+((m&0x7fff)<<15)+w.data[j]+(c&0x3fffffff);\n    c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n    w.data[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.\nfunction am3(i,x,w,j,c,n) {\n  var xl = x&0x3fff, xh = x>>14;\n  while(--n >= 0) {\n    var l = this.data[i]&0x3fff;\n    var h = this.data[i++]>>14;\n    var m = xh*l+h*xl;\n    l = xl*l+((m&0x3fff)<<14)+w.data[j]+c;\n    c = (l>>28)+(m>>14)+xh*h;\n    w.data[j++] = l&0xfffffff;\n  }\n  return c;\n}\n\n// node.js (no browser)\nif(typeof(navigator) === 'undefined')\n{\n   BigInteger.prototype.am = am3;\n   dbits = 28;\n} else if(j_lm && (navigator.appName == \"Microsoft Internet Explorer\")) {\n  BigInteger.prototype.am = am2;\n  dbits = 30;\n} else if(j_lm && (navigator.appName != \"Netscape\")) {\n  BigInteger.prototype.am = am1;\n  dbits = 26;\n} else { // Mozilla/Netscape seems to prefer am3\n  BigInteger.prototype.am = am3;\n  dbits = 28;\n}\n\nBigInteger.prototype.DB = dbits;\nBigInteger.prototype.DM = ((1<<dbits)-1);\nBigInteger.prototype.DV = (1<<dbits);\n\nvar BI_FP = 52;\nBigInteger.prototype.FV = Math.pow(2,BI_FP);\nBigInteger.prototype.F1 = BI_FP-dbits;\nBigInteger.prototype.F2 = 2*dbits-BI_FP;\n\n// Digit conversions\nvar BI_RM = \"0123456789abcdefghijklmnopqrstuvwxyz\";\nvar BI_RC = new Array();\nvar rr,vv;\nrr = \"0\".charCodeAt(0);\nfor(vv = 0; vv <= 9; ++vv) BI_RC[rr++] = vv;\nrr = \"a\".charCodeAt(0);\nfor(vv = 10; vv < 36; ++vv) BI_RC[rr++] = vv;\nrr = \"A\".charCodeAt(0);\nfor(vv = 10; vv < 36; ++vv) BI_RC[rr++] = vv;\n\nfunction int2char(n) { return BI_RM.charAt(n); }\nfunction 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\nfunction bnpCopyTo(r) {\n  for(var i = this.t-1; i >= 0; --i) r.data[i] = this.data[i];\n  r.t = this.t;\n  r.s = this.s;\n}\n\n// (protected) set from integer value x, -DV <= x < DV\nfunction bnpFromInt(x) {\n  this.t = 1;\n  this.s = (x<0)?-1:0;\n  if(x > 0) this.data[0] = x;\n  else if(x < -1) this.data[0] = x+this.DV;\n  else this.t = 0;\n}\n\n// return bigint initialized to value\nfunction nbv(i) { var r = nbi(); r.fromInt(i); return r; }\n\n// (protected) set from string and radix\nfunction 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.data[this.t++] = x;\n    else if(sh+k > this.DB) {\n      this.data[this.t-1] |= (x&((1<<(this.DB-sh))-1))<<sh;\n      this.data[this.t++] = (x>>(this.DB-sh));\n    } else\n      this.data[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.data[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\nfunction bnpClamp() {\n  var c = this.s&this.DM;\n  while(this.t > 0 && this.data[this.t-1] == c) --this.t;\n}\n\n// (public) return string representation in given radix\nfunction 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.data[i]>>p) > 0) { m = true; r = int2char(d); }\n    while(i >= 0) {\n      if(p < k) {\n        d = (this.data[i]&((1<<p)-1))<<(k-p);\n        d |= this.data[--i]>>(p+=this.DB-k);\n      } else {\n        d = (this.data[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\nfunction bnNegate() { var r = nbi(); BigInteger.ZERO.subTo(this,r); return r; }\n\n// (public) |this|\nfunction bnAbs() { return (this.s<0)?this.negate():this; }\n\n// (public) return + if this > a, - if this < a, 0 if equal\nfunction 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.data[i]-a.data[i]) != 0) return r;\n  return 0;\n}\n\n// returns bit length of the integer x\nfunction 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\"\nfunction bnBitLength() {\n  if(this.t <= 0) return 0;\n  return this.DB*(this.t-1)+nbits(this.data[this.t-1]^(this.s&this.DM));\n}\n\n// (protected) r = this << n*DB\nfunction bnpDLShiftTo(n,r) {\n  var i;\n  for(i = this.t-1; i >= 0; --i) r.data[i+n] = this.data[i];\n  for(i = n-1; i >= 0; --i) r.data[i] = 0;\n  r.t = this.t+n;\n  r.s = this.s;\n}\n\n// (protected) r = this >> n*DB\nfunction bnpDRShiftTo(n,r) {\n  for(var i = n; i < this.t; ++i) r.data[i-n] = this.data[i];\n  r.t = Math.max(this.t-n,0);\n  r.s = this.s;\n}\n\n// (protected) r = this << n\nfunction 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.data[i+ds+1] = (this.data[i]>>cbs)|c;\n    c = (this.data[i]&bm)<<bs;\n  }\n  for(i = ds-1; i >= 0; --i) r.data[i] = 0;\n  r.data[ds] = c;\n  r.t = this.t+ds+1;\n  r.s = this.s;\n  r.clamp();\n}\n\n// (protected) r = this >> n\nfunction 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.data[0] = this.data[ds]>>bs;\n  for(var i = ds+1; i < this.t; ++i) {\n    r.data[i-ds-1] |= (this.data[i]&bm)<<cbs;\n    r.data[i-ds] = this.data[i]>>bs;\n  }\n  if(bs > 0) r.data[this.t-ds-1] |= (this.s&bm)<<cbs;\n  r.t = this.t-ds;\n  r.clamp();\n}\n\n// (protected) r = this - a\nfunction bnpSubTo(a,r) {\n  var i = 0, c = 0, m = Math.min(a.t,this.t);\n  while(i < m) {\n    c += this.data[i]-a.data[i];\n    r.data[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.data[i];\n      r.data[i++] = c&this.DM;\n      c >>= this.DB;\n    }\n    c += this.s;\n  } else {\n    c += this.s;\n    while(i < a.t) {\n      c -= a.data[i];\n      r.data[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.data[i++] = this.DV+c;\n  else if(c > 0) r.data[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.\nfunction 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.data[i] = 0;\n  for(i = 0; i < y.t; ++i) r.data[i+x.t] = x.am(0,y.data[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)\nfunction bnpSquareTo(r) {\n  var x = this.abs();\n  var i = r.t = 2*x.t;\n  while(--i >= 0) r.data[i] = 0;\n  for(i = 0; i < x.t-1; ++i) {\n    var c = x.am(i,x.data[i],r,2*i,0,1);\n    if((r.data[i+x.t]+=x.am(i+1,2*x.data[i],r,2*i+1,c,x.t-i-1)) >= x.DV) {\n      r.data[i+x.t] -= x.DV;\n      r.data[i+x.t+1] = 1;\n    }\n  }\n  if(r.t > 0) r.data[r.t-1] += x.am(i,x.data[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.\nfunction 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.data[pm.t-1]);\t// normalize modulus\n  if(nsh > 0) { pm.lShiftTo(nsh,y); pt.lShiftTo(nsh,r); } else { pm.copyTo(y); pt.copyTo(r); }\n  var ys = y.t;\n  var y0 = y.data[ys-1];\n  if(y0 == 0) return;\n  var yt = y0*(1<<this.F1)+((ys>1)?y.data[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.data[r.t++] = 1;\n    r.subTo(t,r);\n  }\n  BigInteger.ONE.dlShiftTo(ys,t);\n  t.subTo(y,y);\t// \"negative\" y so we can replace sub with am later\n  while(y.t < ys) y.data[y.t++] = 0;\n  while(--j >= 0) {\n    // Estimate quotient digit\n    var qd = (r.data[--i]==y0)?this.DM:Math.floor(r.data[i]*d1+(r.data[i-1]+e)*d2);\n    if((r.data[i]+=y.am(0,qd,r,j,0,ys)) < qd) {\t// Try it out\n      y.dlShiftTo(j,t);\n      r.subTo(t,r);\n      while(r.data[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);\t// Denormalize remainder\n  if(ts < 0) BigInteger.ZERO.subTo(r,r);\n}\n\n// (public) this mod a\nfunction 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\nfunction Classic(m) { this.m = m; }\nfunction cConvert(x) {\n  if(x.s < 0 || x.compareTo(this.m) >= 0) return x.mod(this.m);\n  else return x;\n}\nfunction cRevert(x) { return x; }\nfunction cReduce(x) { x.divRemTo(this.m,null,x); }\nfunction cMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); }\nfunction cSqrTo(x,r) { x.squareTo(r); this.reduce(r); }\n\nClassic.prototype.convert = cConvert;\nClassic.prototype.revert = cRevert;\nClassic.prototype.reduce = cReduce;\nClassic.prototype.mulTo = cMulTo;\nClassic.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.\nfunction bnpInvDigit() {\n  if(this.t < 1) return 0;\n  var x = this.data[0];\n  if((x&1) == 0) return 0;\n  var y = x&3;\t\t// y == 1/x mod 2^2\n  y = (y*(2-(x&0xf)*y))&0xf;\t// y == 1/x mod 2^4\n  y = (y*(2-(x&0xff)*y))&0xff;\t// y == 1/x mod 2^8\n  y = (y*(2-(((x&0xffff)*y)&0xffff)))&0xffff;\t// 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;\t\t// 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\nfunction 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\nfunction 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\nfunction 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)\nfunction montReduce(x) {\n  while(x.t <= this.mt2)\t// pad x so am has enough room later\n    x.data[x.t++] = 0;\n  for(var i = 0; i < this.m.t; ++i) {\n    // faster way of calculating u0 = x.data[i]*mp mod DV\n    var j = x.data[i]&0x7fff;\n    var u0 = (j*this.mpl+(((j*this.mph+(x.data[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.data[j] += this.m.am(0,u0,x,i,0,this.m.t);\n    // propagate carry\n    while(x.data[j] >= x.DV) { x.data[j] -= x.DV; x.data[++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\nfunction montSqrTo(x,r) { x.squareTo(r); this.reduce(r); }\n\n// r = \"xy/R mod m\"; x,y != r\nfunction montMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); }\n\nMontgomery.prototype.convert = montConvert;\nMontgomery.prototype.revert = montRevert;\nMontgomery.prototype.reduce = montReduce;\nMontgomery.prototype.mulTo = montMulTo;\nMontgomery.prototype.sqrTo = montSqrTo;\n\n// (protected) true iff this is even\nfunction bnpIsEven() { return ((this.t>0)?(this.data[0]&1):this.s) == 0; }\n\n// (protected) this^e, e < 2^32, doing sqr and mul with \"r\" (HAC 14.79)\nfunction 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\nfunction 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\nBigInteger.prototype.copyTo = bnpCopyTo;\nBigInteger.prototype.fromInt = bnpFromInt;\nBigInteger.prototype.fromString = bnpFromString;\nBigInteger.prototype.clamp = bnpClamp;\nBigInteger.prototype.dlShiftTo = bnpDLShiftTo;\nBigInteger.prototype.drShiftTo = bnpDRShiftTo;\nBigInteger.prototype.lShiftTo = bnpLShiftTo;\nBigInteger.prototype.rShiftTo = bnpRShiftTo;\nBigInteger.prototype.subTo = bnpSubTo;\nBigInteger.prototype.multiplyTo = bnpMultiplyTo;\nBigInteger.prototype.squareTo = bnpSquareTo;\nBigInteger.prototype.divRemTo = bnpDivRemTo;\nBigInteger.prototype.invDigit = bnpInvDigit;\nBigInteger.prototype.isEven = bnpIsEven;\nBigInteger.prototype.exp = bnpExp;\n\n// public\nBigInteger.prototype.toString = bnToString;\nBigInteger.prototype.negate = bnNegate;\nBigInteger.prototype.abs = bnAbs;\nBigInteger.prototype.compareTo = bnCompareTo;\nBigInteger.prototype.bitLength = bnBitLength;\nBigInteger.prototype.mod = bnMod;\nBigInteger.prototype.modPowInt = bnModPowInt;\n\n// \"constants\"\nBigInteger.ZERO = nbv(0);\nBigInteger.ONE = nbv(1);\n\n// jsbn2 lib\n\n//Copyright (c) 2005-2009  Tom Wu\n//All Rights Reserved.\n//See \"LICENSE\" for details (See jsbn.js for LICENSE).\n\n//Extended JavaScript BN functions, required for RSA private ops.\n\n//Version 1.1: new BigInteger(\"0\", 10) returns \"proper\" zero\n\n//(public)\nfunction bnClone() { var r = nbi(); this.copyTo(r); return r; }\n\n//(public) return value as integer\nfunction bnIntValue() {\nif(this.s < 0) {\n if(this.t == 1) return this.data[0]-this.DV;\n else if(this.t == 0) return -1;\n} else if(this.t == 1) return this.data[0];\nelse if(this.t == 0) return 0;\n// assumes 16 < DB < 32\nreturn ((this.data[1]&((1<<(32-this.DB))-1))<<this.DB)|this.data[0];\n}\n\n//(public) return value as byte\nfunction bnByteValue() { return (this.t==0)?this.s:(this.data[0]<<24)>>24; }\n\n//(public) return value as short (assumes DB>=16)\nfunction bnShortValue() { return (this.t==0)?this.s:(this.data[0]<<16)>>16; }\n\n//(protected) return x s.t. r^x < DV\nfunction bnpChunkSize(r) { return Math.floor(Math.LN2*this.DB/Math.log(r)); }\n\n//(public) 0 if this == 0, 1 if this > 0\nfunction bnSigNum() {\nif(this.s < 0) return -1;\nelse if(this.t <= 0 || (this.t == 1 && this.data[0] <= 0)) return 0;\nelse return 1;\n}\n\n//(protected) convert to radix string\nfunction bnpToRadix(b) {\nif(b == null) b = 10;\nif(this.signum() == 0 || b < 2 || b > 36) return \"0\";\nvar cs = this.chunkSize(b);\nvar a = Math.pow(b,cs);\nvar d = nbv(a), y = nbi(), z = nbi(), r = \"\";\nthis.divRemTo(d,y,z);\nwhile(y.signum() > 0) {\n r = (a+z.intValue()).toString(b).substr(1) + r;\n y.divRemTo(d,y,z);\n}\nreturn z.intValue().toString(b) + r;\n}\n\n//(protected) convert from radix string\nfunction bnpFromRadix(s,b) {\nthis.fromInt(0);\nif(b == null) b = 10;\nvar cs = this.chunkSize(b);\nvar d = Math.pow(b,cs), mi = false, j = 0, w = 0;\nfor(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}\nif(j > 0) {\n this.dMultiply(Math.pow(b,j));\n this.dAddOffset(w,0);\n}\nif(mi) BigInteger.ZERO.subTo(this,this);\n}\n\n//(protected) alternate constructor\nfunction bnpFromNumber(a,b,c) {\nif(\"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} 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\nfunction bnToByteArray() {\nvar i = this.t, r = new Array();\nr[0] = this.s;\nvar p = this.DB-(i*this.DB)%8, d, k = 0;\nif(i-- > 0) {\n if(p < this.DB && (d = this.data[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.data[i]&((1<<p)-1))<<(8-p);\n     d |= this.data[--i]>>(p+=this.DB-8);\n   } else {\n     d = (this.data[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}\nreturn r;\n}\n\nfunction bnEquals(a) { return(this.compareTo(a)==0); }\nfunction bnMin(a) { return(this.compareTo(a)<0)?this:a; }\nfunction bnMax(a) { return(this.compareTo(a)>0)?this:a; }\n\n//(protected) r = this op a (bitwise)\nfunction bnpBitwiseTo(a,op,r) {\nvar i, f, m = Math.min(a.t,this.t);\nfor(i = 0; i < m; ++i) r.data[i] = op(this.data[i],a.data[i]);\nif(a.t < this.t) {\n f = a.s&this.DM;\n for(i = m; i < this.t; ++i) r.data[i] = op(this.data[i],f);\n r.t = this.t;\n} else {\n f = this.s&this.DM;\n for(i = m; i < a.t; ++i) r.data[i] = op(f,a.data[i]);\n r.t = a.t;\n}\nr.s = op(this.s,a.s);\nr.clamp();\n}\n\n//(public) this & a\nfunction op_and(x,y) { return x&y; }\nfunction bnAnd(a) { var r = nbi(); this.bitwiseTo(a,op_and,r); return r; }\n\n//(public) this | a\nfunction op_or(x,y) { return x|y; }\nfunction bnOr(a) { var r = nbi(); this.bitwiseTo(a,op_or,r); return r; }\n\n//(public) this ^ a\nfunction op_xor(x,y) { return x^y; }\nfunction bnXor(a) { var r = nbi(); this.bitwiseTo(a,op_xor,r); return r; }\n\n//(public) this & ~a\nfunction op_andnot(x,y) { return x&~y; }\nfunction bnAndNot(a) { var r = nbi(); this.bitwiseTo(a,op_andnot,r); return r; }\n\n//(public) ~this\nfunction bnNot() {\nvar r = nbi();\nfor(var i = 0; i < this.t; ++i) r.data[i] = this.DM&~this.data[i];\nr.t = this.t;\nr.s = ~this.s;\nreturn r;\n}\n\n//(public) this << n\nfunction bnShiftLeft(n) {\nvar r = nbi();\nif(n < 0) this.rShiftTo(-n,r); else this.lShiftTo(n,r);\nreturn r;\n}\n\n//(public) this >> n\nfunction bnShiftRight(n) {\nvar r = nbi();\nif(n < 0) this.lShiftTo(-n,r); else this.rShiftTo(n,r);\nreturn r;\n}\n\n//return index of lowest 1-bit in x, x < 2^31\nfunction lbit(x) {\nif(x == 0) return -1;\nvar r = 0;\nif((x&0xffff) == 0) { x >>= 16; r += 16; }\nif((x&0xff) == 0) { x >>= 8; r += 8; }\nif((x&0xf) == 0) { x >>= 4; r += 4; }\nif((x&3) == 0) { x >>= 2; r += 2; }\nif((x&1) == 0) ++r;\nreturn r;\n}\n\n//(public) returns index of lowest 1-bit (or -1 if none)\nfunction bnGetLowestSetBit() {\nfor(var i = 0; i < this.t; ++i)\n if(this.data[i] != 0) return i*this.DB+lbit(this.data[i]);\nif(this.s < 0) return this.t*this.DB;\nreturn -1;\n}\n\n//return number of 1 bits in x\nfunction cbit(x) {\nvar r = 0;\nwhile(x != 0) { x &= x-1; ++r; }\nreturn r;\n}\n\n//(public) return number of set bits\nfunction bnBitCount() {\nvar r = 0, x = this.s&this.DM;\nfor(var i = 0; i < this.t; ++i) r += cbit(this.data[i]^x);\nreturn r;\n}\n\n//(public) true iff nth bit is set\nfunction bnTestBit(n) {\nvar j = Math.floor(n/this.DB);\nif(j >= this.t) return(this.s!=0);\nreturn((this.data[j]&(1<<(n%this.DB)))!=0);\n}\n\n//(protected) this op (1<<n)\nfunction bnpChangeBit(n,op) {\nvar r = BigInteger.ONE.shiftLeft(n);\nthis.bitwiseTo(r,op,r);\nreturn r;\n}\n\n//(public) this | (1<<n)\nfunction bnSetBit(n) { return this.changeBit(n,op_or); }\n\n//(public) this & ~(1<<n)\nfunction bnClearBit(n) { return this.changeBit(n,op_andnot); }\n\n//(public) this ^ (1<<n)\nfunction bnFlipBit(n) { return this.changeBit(n,op_xor); }\n\n//(protected) r = this + a\nfunction bnpAddTo(a,r) {\nvar i = 0, c = 0, m = Math.min(a.t,this.t);\nwhile(i < m) {\n c += this.data[i]+a.data[i];\n r.data[i++] = c&this.DM;\n c >>= this.DB;\n}\nif(a.t < this.t) {\n c += a.s;\n while(i < this.t) {\n   c += this.data[i];\n   r.data[i++] = c&this.DM;\n   c >>= this.DB;\n }\n c += this.s;\n} else {\n c += this.s;\n while(i < a.t) {\n   c += a.data[i];\n   r.data[i++] = c&this.DM;\n   c >>= this.DB;\n }\n c += a.s;\n}\nr.s = (c<0)?-1:0;\nif(c > 0) r.data[i++] = c;\nelse if(c < -1) r.data[i++] = this.DV+c;\nr.t = i;\nr.clamp();\n}\n\n//(public) this + a\nfunction bnAdd(a) { var r = nbi(); this.addTo(a,r); return r; }\n\n//(public) this - a\nfunction bnSubtract(a) { var r = nbi(); this.subTo(a,r); return r; }\n\n//(public) this * a\nfunction bnMultiply(a) { var r = nbi(); this.multiplyTo(a,r); return r; }\n\n//(public) this / a\nfunction bnDivide(a) { var r = nbi(); this.divRemTo(a,r,null); return r; }\n\n//(public) this % a\nfunction bnRemainder(a) { var r = nbi(); this.divRemTo(a,null,r); return r; }\n\n//(public) [this/a,this%a]\nfunction bnDivideAndRemainder(a) {\nvar q = nbi(), r = nbi();\nthis.divRemTo(a,q,r);\nreturn new Array(q,r);\n}\n\n//(protected) this *= n, this >= 0, 1 < n < DV\nfunction bnpDMultiply(n) {\nthis.data[this.t] = this.am(0,n-1,this,0,0,this.t);\n++this.t;\nthis.clamp();\n}\n\n//(protected) this += n << w words, this >= 0\nfunction bnpDAddOffset(n,w) {\nif(n == 0) return;\nwhile(this.t <= w) this.data[this.t++] = 0;\nthis.data[w] += n;\nwhile(this.data[w] >= this.DV) {\n this.data[w] -= this.DV;\n if(++w >= this.t) this.data[this.t++] = 0;\n ++this.data[w];\n}\n}\n\n//A \"null\" reducer\nfunction NullExp() {}\nfunction nNop(x) { return x; }\nfunction nMulTo(x,y,r) { x.multiplyTo(y,r); }\nfunction nSqrTo(x,r) { x.squareTo(r); }\n\nNullExp.prototype.convert = nNop;\nNullExp.prototype.revert = nNop;\nNullExp.prototype.mulTo = nMulTo;\nNullExp.prototype.sqrTo = nSqrTo;\n\n//(public) this^e\nfunction 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.\nfunction bnpMultiplyLowerTo(a,n,r) {\nvar i = Math.min(this.t+a.t,n);\nr.s = 0; // assumes a,this >= 0\nr.t = i;\nwhile(i > 0) r.data[--i] = 0;\nvar j;\nfor(j = r.t-this.t; i < j; ++i) r.data[i+this.t] = this.am(0,a.data[i],r,i,0,this.t);\nfor(j = Math.min(a.t,n); i < j; ++i) this.am(0,a.data[i],r,i,0,n-i);\nr.clamp();\n}\n\n//(protected) r = \"this * a\" without lower n words, n > 0\n//\"this\" should be the larger one if appropriate.\nfunction bnpMultiplyUpperTo(a,n,r) {\n--n;\nvar i = r.t = this.t+a.t-n;\nr.s = 0; // assumes a,this >= 0\nwhile(--i >= 0) r.data[i] = 0;\nfor(i = Math.max(n-this.t,0); i < a.t; ++i)\n r.data[this.t+i-n] = this.am(n-i,a.data[i],r,0,0,this.t+i-n);\nr.clamp();\nr.drShiftTo(1,r);\n}\n\n//Barrett modular reduction\nfunction Barrett(m) {\n// setup Barrett\nthis.r2 = nbi();\nthis.q3 = nbi();\nBigInteger.ONE.dlShiftTo(2*m.t,this.r2);\nthis.mu = this.r2.divide(m);\nthis.m = m;\n}\n\nfunction barrettConvert(x) {\nif(x.s < 0 || x.t > 2*this.m.t) return x.mod(this.m);\nelse if(x.compareTo(this.m) < 0) return x;\nelse { var r = nbi(); x.copyTo(r); this.reduce(r); return r; }\n}\n\nfunction barrettRevert(x) { return x; }\n\n//x = x mod m (HAC 14.42)\nfunction barrettReduce(x) {\nx.drShiftTo(this.m.t-1,this.r2);\nif(x.t > this.m.t+1) { x.t = this.m.t+1; x.clamp(); }\nthis.mu.multiplyUpperTo(this.r2,this.m.t+1,this.q3);\nthis.m.multiplyLowerTo(this.q3,this.m.t+1,this.r2);\nwhile(x.compareTo(this.r2) < 0) x.dAddOffset(1,this.m.t+1);\nx.subTo(this.r2,x);\nwhile(x.compareTo(this.m) >= 0) x.subTo(this.m,x);\n}\n\n//r = x^2 mod m; x != r\nfunction barrettSqrTo(x,r) { x.squareTo(r); this.reduce(r); }\n\n//r = x*y mod m; x,y != r\nfunction barrettMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); }\n\nBarrett.prototype.convert = barrettConvert;\nBarrett.prototype.revert = barrettRevert;\nBarrett.prototype.reduce = barrettReduce;\nBarrett.prototype.mulTo = barrettMulTo;\nBarrett.prototype.sqrTo = barrettSqrTo;\n\n//(public) this^e % m (HAC 14.85)\nfunction bnModPow(e,m) {\nvar i = e.bitLength(), k, r = nbv(1), z;\nif(i <= 0) return r;\nelse if(i < 18) k = 1;\nelse if(i < 48) k = 3;\nelse if(i < 144) k = 4;\nelse if(i < 768) k = 5;\nelse k = 6;\nif(i < 8)\n z = new Classic(m);\nelse if(m.isEven())\n z = new Barrett(m);\nelse\n z = new Montgomery(m);\n\n// precomputation\nvar g = new Array(), n = 3, k1 = k-1, km = (1<<k)-1;\ng[1] = z.convert(this);\nif(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\nvar j = e.t-1, w, is1 = true, r2 = nbi(), t;\ni = nbits(e.data[j])-1;\nwhile(j >= 0) {\n if(i >= k1) w = (e.data[j]>>(i-k1))&km;\n else {\n   w = (e.data[j]&((1<<(i+1))-1))<<(k1-i);\n   if(j > 0) w |= e.data[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 } 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.data[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}\nreturn z.revert(r);\n}\n\n//(public) gcd(this,a) (HAC 14.54)\nfunction bnGCD(a) {\nvar x = (this.s<0)?this.negate():this.clone();\nvar y = (a.s<0)?a.negate():a.clone();\nif(x.compareTo(y) < 0) { var t = x; x = y; y = t; }\nvar i = x.getLowestSetBit(), g = y.getLowestSetBit();\nif(g < 0) return x;\nif(i < g) g = i;\nif(g > 0) {\n x.rShiftTo(g,x);\n y.rShiftTo(g,y);\n}\nwhile(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 } else {\n   y.subTo(x,y);\n   y.rShiftTo(1,y);\n }\n}\nif(g > 0) y.lShiftTo(g,y);\nreturn y;\n}\n\n//(protected) this % n, n < 2^26\nfunction bnpModInt(n) {\nif(n <= 0) return 0;\nvar d = this.DV%n, r = (this.s<0)?n-1:0;\nif(this.t > 0)\n if(d == 0) r = this.data[0]%n;\n else for(var i = this.t-1; i >= 0; --i) r = (d*r+this.data[i])%n;\nreturn r;\n}\n\n//(public) 1/this % m (HAC 14.61)\nfunction bnModInverse(m) {\nvar ac = m.isEven();\nif((this.isEven() && ac) || m.signum() == 0) return BigInteger.ZERO;\nvar u = m.clone(), v = this.clone();\nvar a = nbv(1), b = nbv(0), c = nbv(0), d = nbv(1);\nwhile(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   } 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   } 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 } else {\n   v.subTo(u,v);\n   if(ac) c.subTo(a,c);\n   d.subTo(b,d);\n }\n}\nif(v.compareTo(BigInteger.ONE) != 0) return BigInteger.ZERO;\nif(d.compareTo(m) >= 0) return d.subtract(m);\nif(d.signum() < 0) d.addTo(m,d); else return d;\nif(d.signum() < 0) return d.add(m); else return d;\n}\n\nvar 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];\nvar lplim = (1<<26)/lowprimes[lowprimes.length-1];\n\n//(public) test primality with certainty >= 1-.5^t\nfunction bnIsProbablePrime(t) {\nvar i, x = this.abs();\nif(x.t == 1 && x.data[0] <= lowprimes[lowprimes.length-1]) {\n for(i = 0; i < lowprimes.length; ++i)\n   if(x.data[0] == lowprimes[i]) return true;\n return false;\n}\nif(x.isEven()) return false;\ni = 1;\nwhile(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}\nreturn x.millerRabin(t);\n}\n\n//(protected) true if probably prime (HAC 4.24, Miller-Rabin)\nfunction bnpMillerRabin(t) {\nvar n1 = this.subtract(BigInteger.ONE);\nvar k = n1.getLowestSetBit();\nif(k <= 0) return false;\nvar r = n1.shiftRight(k);\nvar prng = bnGetPrng();\nvar a;\nfor(var i = 0; i < t; ++i) {\n // select witness 'a' at random from between 1 and n1\n do {\n   a = new BigInteger(this.bitLength(), prng);\n }\n while(a.compareTo(BigInteger.ONE) <= 0 || a.compareTo(n1) >= 0);\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}\nreturn true;\n}\n\n// get pseudo random number generator\nfunction bnGetPrng() {\n  // create prng with api that matches BigInteger secure random\n  return {\n    // x is an array to fill with bytes\n    nextBytes: function(x) {\n      for(var i = 0; i < x.length; ++i) {\n        x[i] = Math.floor(Math.random() * 0x0100);\n      }\n    }\n  };\n}\n\n//protected\nBigInteger.prototype.chunkSize = bnpChunkSize;\nBigInteger.prototype.toRadix = bnpToRadix;\nBigInteger.prototype.fromRadix = bnpFromRadix;\nBigInteger.prototype.fromNumber = bnpFromNumber;\nBigInteger.prototype.bitwiseTo = bnpBitwiseTo;\nBigInteger.prototype.changeBit = bnpChangeBit;\nBigInteger.prototype.addTo = bnpAddTo;\nBigInteger.prototype.dMultiply = bnpDMultiply;\nBigInteger.prototype.dAddOffset = bnpDAddOffset;\nBigInteger.prototype.multiplyLowerTo = bnpMultiplyLowerTo;\nBigInteger.prototype.multiplyUpperTo = bnpMultiplyUpperTo;\nBigInteger.prototype.modInt = bnpModInt;\nBigInteger.prototype.millerRabin = bnpMillerRabin;\n\n//public\nBigInteger.prototype.clone = bnClone;\nBigInteger.prototype.intValue = bnIntValue;\nBigInteger.prototype.byteValue = bnByteValue;\nBigInteger.prototype.shortValue = bnShortValue;\nBigInteger.prototype.signum = bnSigNum;\nBigInteger.prototype.toByteArray = bnToByteArray;\nBigInteger.prototype.equals = bnEquals;\nBigInteger.prototype.min = bnMin;\nBigInteger.prototype.max = bnMax;\nBigInteger.prototype.and = bnAnd;\nBigInteger.prototype.or = bnOr;\nBigInteger.prototype.xor = bnXor;\nBigInteger.prototype.andNot = bnAndNot;\nBigInteger.prototype.not = bnNot;\nBigInteger.prototype.shiftLeft = bnShiftLeft;\nBigInteger.prototype.shiftRight = bnShiftRight;\nBigInteger.prototype.getLowestSetBit = bnGetLowestSetBit;\nBigInteger.prototype.bitCount = bnBitCount;\nBigInteger.prototype.testBit = bnTestBit;\nBigInteger.prototype.setBit = bnSetBit;\nBigInteger.prototype.clearBit = bnClearBit;\nBigInteger.prototype.flipBit = bnFlipBit;\nBigInteger.prototype.add = bnAdd;\nBigInteger.prototype.subtract = bnSubtract;\nBigInteger.prototype.multiply = bnMultiply;\nBigInteger.prototype.divide = bnDivide;\nBigInteger.prototype.remainder = bnRemainder;\nBigInteger.prototype.divideAndRemainder = bnDivideAndRemainder;\nBigInteger.prototype.modPow = bnModPow;\nBigInteger.prototype.modInverse = bnModInverse;\nBigInteger.prototype.pow = bnPow;\nBigInteger.prototype.gcd = bnGCD;\nBigInteger.prototype.isProbablePrime = bnIsProbablePrime;\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"],"x_google_ignoreList":[0],"mappings":";;;;;CAgDA,IAAI;AAEJ,QAAO,UAAU,MAAM,OAAO,MAAM,QAAQ,EAAE;CAG9C,IAAI;CAIJ,IAAI,OAAQ;CAGZ,SAAS,WAAW,GAAE,GAAE,GAAG;AACzB,OAAK,OAAO,EAAE;AACd,MAAG,KAAK,KACN,KAAG,YAAY,OAAO,EAAG,MAAK,WAAW,GAAE,GAAE,EAAE;WACvC,KAAK,QAAQ,YAAY,OAAO,EAAG,MAAK,WAAW,GAAE,IAAI;MAC5D,MAAK,WAAW,GAAE,EAAE;;AAE7B,OAAM,KAAK,aAAa;CAGxB,SAAS,MAAM;AAAE,SAAO,IAAI,WAAW,KAAK;;CAU5C,SAAS,IAAI,GAAE,GAAE,GAAE,GAAE,GAAE,GAAG;AACxB,SAAM,EAAE,KAAK,GAAG;GACd,IAAI,IAAI,IAAE,KAAK,KAAK,OAAK,EAAE,KAAK,KAAG;AACnC,OAAI,KAAK,MAAM,IAAE,SAAU;AAC3B,KAAE,KAAK,OAAO,IAAE;;AAElB,SAAO;;CAKT,SAAS,IAAI,GAAE,GAAE,GAAE,GAAE,GAAE,GAAG;EACxB,IAAI,KAAK,IAAE,OAAQ,KAAK,KAAG;AAC3B,SAAM,EAAE,KAAK,GAAG;GACd,IAAI,IAAI,KAAK,KAAK,KAAG;GACrB,IAAI,IAAI,KAAK,KAAK,QAAM;GACxB,IAAI,IAAI,KAAG,IAAE,IAAE;AACf,OAAI,KAAG,MAAI,IAAE,UAAS,MAAI,EAAE,KAAK,MAAI,IAAE;AACvC,QAAK,MAAI,OAAK,MAAI,MAAI,KAAG,KAAG,MAAI;AAChC,KAAE,KAAK,OAAO,IAAE;;AAElB,SAAO;;CAIT,SAAS,IAAI,GAAE,GAAE,GAAE,GAAE,GAAE,GAAG;EACxB,IAAI,KAAK,IAAE,OAAQ,KAAK,KAAG;AAC3B,SAAM,EAAE,KAAK,GAAG;GACd,IAAI,IAAI,KAAK,KAAK,KAAG;GACrB,IAAI,IAAI,KAAK,KAAK,QAAM;GACxB,IAAI,IAAI,KAAG,IAAE,IAAE;AACf,OAAI,KAAG,MAAI,IAAE,UAAS,MAAI,EAAE,KAAK,KAAG;AACpC,QAAK,KAAG,OAAK,KAAG,MAAI,KAAG;AACvB,KAAE,KAAK,OAAO,IAAE;;AAElB,SAAO;;AAIT,KAAG,OAAO,cAAe,aACzB;AACG,aAAW,UAAU,KAAK;AAC1B,UAAQ;YACD,QAAS,UAAU,WAAW,+BAAgC;AACtE,aAAW,UAAU,KAAK;AAC1B,UAAQ;YACA,QAAS,UAAU,WAAW,YAAa;AACnD,aAAW,UAAU,KAAK;AAC1B,UAAQ;QACH;AACL,aAAW,UAAU,KAAK;AAC1B,UAAQ;;AAGV,YAAW,UAAU,KAAK;AAC1B,YAAW,UAAU,MAAO,KAAG,SAAO;AACtC,YAAW,UAAU,KAAM,KAAG;CAE9B,IAAI,QAAQ;AACZ,YAAW,UAAU,KAAK,KAAK,IAAI,GAAE,MAAM;AAC3C,YAAW,UAAU,KAAK,QAAM;AAChC,YAAW,UAAU,KAAK,IAAE,QAAM;CAGlC,IAAI,QAAQ;CACZ,IAAI,QAAQ,IAAI,OAAO;CACvB,IAAI,KACC,IAAI,WAAW,EAAE,EADf;AAEP,MAAI,KAAK,GAAG,MAAM,GAAG,EAAE,GAAI,OAAM,QAAQ;AACzC,MAAK,IAAI,WAAW,EAAE;AACtB,MAAI,KAAK,IAAI,KAAK,IAAI,EAAE,GAAI,OAAM,QAAQ;AAC1C,MAAK,IAAI,WAAW,EAAE;AACtB,MAAI,KAAK,IAAI,KAAK,IAAI,EAAE,GAAI,OAAM,QAAQ;CAE1C,SAAS,SAAS,GAAG;AAAE,SAAO,MAAM,OAAO,EAAE;;CAC7C,SAAS,MAAM,GAAE,GAAG;EAClB,IAAI,IAAI,MAAM,EAAE,WAAW,EAAE;AAC7B,SAAQ,KAAG,OAAM,KAAG;;CAItB,SAAS,UAAU,GAAG;AACpB,OAAI,IAAI,IAAI,KAAK,IAAE,GAAG,KAAK,GAAG,EAAE,EAAG,GAAE,KAAK,KAAK,KAAK,KAAK;AACzD,IAAE,IAAI,KAAK;AACX,IAAE,IAAI,KAAK;;CAIb,SAAS,WAAW,GAAG;AACrB,OAAK,IAAI;AACT,OAAK,IAAK,IAAE,IAAG,KAAG;AAClB,MAAG,IAAI,EAAG,MAAK,KAAK,KAAK;WACjB,IAAI,GAAI,MAAK,KAAK,KAAK,IAAE,KAAK;MACjC,MAAK,IAAI;;CAIhB,SAAS,IAAI,GAAG;EAAE,IAAI,IAAI,KAAK;AAAE,IAAE,QAAQ,EAAE;AAAE,SAAO;;CAGtD,SAAS,cAAc,GAAE,GAAG;EAC1B,IAAI;AACJ,MAAG,KAAK,GAAI,KAAI;WACR,KAAK,EAAG,KAAI;WACZ,KAAK,IAAK,KAAI;WACd,KAAK,EAAG,KAAI;WACZ,KAAK,GAAI,KAAI;WACb,KAAK,EAAG,KAAI;OACf;AAAE,QAAK,UAAU,GAAE,EAAE;AAAE;;AAC5B,OAAK,IAAI;AACT,OAAK,IAAI;EACT,IAAI,IAAI,EAAE,QAAQ,KAAK,OAAO,KAAK;AACnC,SAAM,EAAE,KAAK,GAAG;GACd,IAAI,IAAK,KAAG,IAAG,EAAE,KAAG,MAAK,MAAM,GAAE,EAAE;AACnC,OAAG,IAAI,GAAG;AACR,QAAG,EAAE,OAAO,EAAE,IAAI,IAAK,MAAK;AAC5B;;AAEF,QAAK;AACL,OAAG,MAAM,EACP,MAAK,KAAK,KAAK,OAAO;YAChB,KAAG,IAAI,KAAK,IAAI;AACtB,SAAK,KAAK,KAAK,IAAE,OAAO,KAAI,KAAI,KAAK,KAAG,MAAK,MAAK;AAClD,SAAK,KAAK,KAAK,OAAQ,KAAI,KAAK,KAAG;SAEnC,MAAK,KAAK,KAAK,IAAE,MAAM,KAAG;AAC5B,SAAM;AACN,OAAG,MAAM,KAAK,GAAI,OAAM,KAAK;;AAE/B,MAAG,KAAK,MAAM,EAAE,KAAG,QAAS,GAAG;AAC7B,QAAK,IAAI;AACT,OAAG,KAAK,EAAG,MAAK,KAAK,KAAK,IAAE,OAAQ,KAAI,KAAK,KAAG,MAAK,KAAI;;AAE3D,OAAK,OAAO;AACZ,MAAG,GAAI,YAAW,KAAK,MAAM,MAAK,KAAK;;CAIzC,SAAS,WAAW;EAClB,IAAI,IAAI,KAAK,IAAE,KAAK;AACpB,SAAM,KAAK,IAAI,KAAK,KAAK,KAAK,KAAK,IAAE,MAAM,EAAG,GAAE,KAAK;;CAIvD,SAAS,WAAW,GAAG;AACrB,MAAG,KAAK,IAAI,EAAG,QAAO,MAAI,KAAK,QAAQ,CAAC,SAAS,EAAE;EACnD,IAAI;AACJ,MAAG,KAAK,GAAI,KAAI;WACR,KAAK,EAAG,KAAI;WACZ,KAAK,EAAG,KAAI;WACZ,KAAK,GAAI,KAAI;WACb,KAAK,EAAG,KAAI;MACf,QAAO,KAAK,QAAQ,EAAE;EAC3B,IAAI,MAAM,KAAG,KAAG,GAAG,GAAG,IAAI,OAAO,IAAI,IAAI,IAAI,KAAK;EAClD,IAAI,IAAI,KAAK,KAAI,IAAE,KAAK,KAAI;AAC5B,MAAG,MAAM,GAAG;AACV,OAAG,IAAI,KAAK,OAAO,IAAI,KAAK,KAAK,MAAI,KAAK,GAAG;AAAE,QAAI;AAAM,QAAI,SAAS,EAAE;;AACxE,UAAM,KAAK,GAAG;AACZ,QAAG,IAAI,GAAG;AACR,UAAK,KAAK,KAAK,MAAK,KAAG,KAAG,MAAM,IAAE;AAClC,UAAK,KAAK,KAAK,EAAE,OAAK,KAAG,KAAK,KAAG;WAC5B;AACL,SAAK,KAAK,KAAK,OAAK,KAAG,KAAI;AAC3B,SAAG,KAAK,GAAG;AAAE,WAAK,KAAK;AAAI,QAAE;;;AAE/B,QAAG,IAAI,EAAG,KAAI;AACd,QAAG,EAAG,MAAK,SAAS,EAAE;;;AAG1B,SAAO,IAAE,IAAE;;CAIb,SAAS,WAAW;EAAE,IAAI,IAAI,KAAK;AAAE,aAAW,KAAK,MAAM,MAAK,EAAE;AAAE,SAAO;;CAG3E,SAAS,QAAQ;AAAE,SAAQ,KAAK,IAAE,IAAG,KAAK,QAAQ,GAAC;;CAGnD,SAAS,YAAY,GAAG;EACtB,IAAI,IAAI,KAAK,IAAE,EAAE;AACjB,MAAG,KAAK,EAAG,QAAO;EAClB,IAAI,IAAI,KAAK;AACb,MAAI,IAAE,EAAE;AACR,MAAG,KAAK,EAAG,QAAQ,KAAK,IAAE,IAAG,CAAC,IAAE;AAChC,SAAM,EAAE,KAAK,EAAG,MAAI,IAAE,KAAK,KAAK,KAAG,EAAE,KAAK,OAAO,EAAG,QAAO;AAC3D,SAAO;;CAIT,SAAS,MAAM,GAAG;EAChB,IAAI,IAAI,GAAG;AACX,OAAI,IAAE,MAAI,OAAO,GAAG;AAAE,OAAI;AAAG,QAAK;;AAClC,OAAI,IAAE,KAAG,MAAM,GAAG;AAAE,OAAI;AAAG,QAAK;;AAChC,OAAI,IAAE,KAAG,MAAM,GAAG;AAAE,OAAI;AAAG,QAAK;;AAChC,OAAI,IAAE,KAAG,MAAM,GAAG;AAAE,OAAI;AAAG,QAAK;;AAChC,OAAI,IAAE,KAAG,MAAM,GAAG;AAAE,OAAI;AAAG,QAAK;;AAChC,SAAO;;CAIT,SAAS,cAAc;AACrB,MAAG,KAAK,KAAK,EAAG,QAAO;AACvB,SAAO,KAAK,MAAI,KAAK,IAAE,KAAG,MAAM,KAAK,KAAK,KAAK,IAAE,KAAI,KAAK,IAAE,KAAK,GAAI;;CAIvE,SAAS,aAAa,GAAE,GAAG;EACzB,IAAI;AACJ,OAAI,IAAI,KAAK,IAAE,GAAG,KAAK,GAAG,EAAE,EAAG,GAAE,KAAK,IAAE,KAAK,KAAK,KAAK;AACvD,OAAI,IAAI,IAAE,GAAG,KAAK,GAAG,EAAE,EAAG,GAAE,KAAK,KAAK;AACtC,IAAE,IAAI,KAAK,IAAE;AACb,IAAE,IAAI,KAAK;;CAIb,SAAS,aAAa,GAAE,GAAG;AACzB,OAAI,IAAI,IAAI,GAAG,IAAI,KAAK,GAAG,EAAE,EAAG,GAAE,KAAK,IAAE,KAAK,KAAK,KAAK;AACxD,IAAE,IAAI,KAAK,IAAI,KAAK,IAAE,GAAE,EAAE;AAC1B,IAAE,IAAI,KAAK;;CAIb,SAAS,YAAY,GAAE,GAAG;EACxB,IAAI,KAAK,IAAE,KAAK;EAChB,IAAI,MAAM,KAAK,KAAG;EAClB,IAAI,MAAM,KAAG,OAAK;EAClB,IAAI,KAAK,KAAK,MAAM,IAAE,KAAK,GAAG,EAAE,IAAK,KAAK,KAAG,KAAI,KAAK,IAAI;AAC1D,OAAI,IAAI,KAAK,IAAE,GAAG,KAAK,GAAG,EAAE,GAAG;AAC7B,KAAE,KAAK,IAAE,KAAG,KAAM,KAAK,KAAK,MAAI,MAAK;AACrC,QAAK,KAAK,KAAK,KAAG,OAAK;;AAEzB,OAAI,IAAI,KAAG,GAAG,KAAK,GAAG,EAAE,EAAG,GAAE,KAAK,KAAK;AACvC,IAAE,KAAK,MAAM;AACb,IAAE,IAAI,KAAK,IAAE,KAAG;AAChB,IAAE,IAAI,KAAK;AACX,IAAE,OAAO;;CAIX,SAAS,YAAY,GAAE,GAAG;AACxB,IAAE,IAAI,KAAK;EACX,IAAI,KAAK,KAAK,MAAM,IAAE,KAAK,GAAG;AAC9B,MAAG,MAAM,KAAK,GAAG;AAAE,KAAE,IAAI;AAAG;;EAC5B,IAAI,KAAK,IAAE,KAAK;EAChB,IAAI,MAAM,KAAK,KAAG;EAClB,IAAI,MAAM,KAAG,MAAI;AACjB,IAAE,KAAK,KAAK,KAAK,KAAK,OAAK;AAC3B,OAAI,IAAI,IAAI,KAAG,GAAG,IAAI,KAAK,GAAG,EAAE,GAAG;AACjC,KAAE,KAAK,IAAE,KAAG,OAAO,KAAK,KAAK,KAAG,OAAK;AACrC,KAAE,KAAK,IAAE,MAAM,KAAK,KAAK,MAAI;;AAE/B,MAAG,KAAK,EAAG,GAAE,KAAK,KAAK,IAAE,KAAG,OAAO,KAAK,IAAE,OAAK;AAC/C,IAAE,IAAI,KAAK,IAAE;AACb,IAAE,OAAO;;CAIX,SAAS,SAAS,GAAE,GAAG;EACrB,IAAI,IAAI,GAAG,IAAI,GAAG,IAAI,KAAK,IAAI,EAAE,GAAE,KAAK,EAAE;AAC1C,SAAM,IAAI,GAAG;AACX,QAAK,KAAK,KAAK,KAAG,EAAE,KAAK;AACzB,KAAE,KAAK,OAAO,IAAE,KAAK;AACrB,SAAM,KAAK;;AAEb,MAAG,EAAE,IAAI,KAAK,GAAG;AACf,QAAK,EAAE;AACP,UAAM,IAAI,KAAK,GAAG;AAChB,SAAK,KAAK,KAAK;AACf,MAAE,KAAK,OAAO,IAAE,KAAK;AACrB,UAAM,KAAK;;AAEb,QAAK,KAAK;SACL;AACL,QAAK,KAAK;AACV,UAAM,IAAI,EAAE,GAAG;AACb,SAAK,EAAE,KAAK;AACZ,MAAE,KAAK,OAAO,IAAE,KAAK;AACrB,UAAM,KAAK;;AAEb,QAAK,EAAE;;AAET,IAAE,IAAK,IAAE,IAAG,KAAG;AACf,MAAG,IAAI,GAAI,GAAE,KAAK,OAAO,KAAK,KAAG;WACzB,IAAI,EAAG,GAAE,KAAK,OAAO;AAC7B,IAAE,IAAI;AACN,IAAE,OAAO;;CAKX,SAAS,cAAc,GAAE,GAAG;EAC1B,IAAI,IAAI,KAAK,KAAK,EAAE,IAAI,EAAE,KAAK;EAC/B,IAAI,IAAI,EAAE;AACV,IAAE,IAAI,IAAE,EAAE;AACV,SAAM,EAAE,KAAK,EAAG,GAAE,KAAK,KAAK;AAC5B,OAAI,IAAI,GAAG,IAAI,EAAE,GAAG,EAAE,EAAG,GAAE,KAAK,IAAE,EAAE,KAAK,EAAE,GAAG,GAAE,EAAE,KAAK,IAAG,GAAE,GAAE,GAAE,EAAE,EAAE;AACpE,IAAE,IAAI;AACN,IAAE,OAAO;AACT,MAAG,KAAK,KAAK,EAAE,EAAG,YAAW,KAAK,MAAM,GAAE,EAAE;;CAI9C,SAAS,YAAY,GAAG;EACtB,IAAI,IAAI,KAAK,KAAK;EAClB,IAAI,IAAI,EAAE,IAAI,IAAE,EAAE;AAClB,SAAM,EAAE,KAAK,EAAG,GAAE,KAAK,KAAK;AAC5B,OAAI,IAAI,GAAG,IAAI,EAAE,IAAE,GAAG,EAAE,GAAG;GACzB,IAAI,IAAI,EAAE,GAAG,GAAE,EAAE,KAAK,IAAG,GAAE,IAAE,GAAE,GAAE,EAAE;AACnC,QAAI,EAAE,KAAK,IAAE,EAAE,MAAI,EAAE,GAAG,IAAE,GAAE,IAAE,EAAE,KAAK,IAAG,GAAE,IAAE,IAAE,GAAE,GAAE,EAAE,IAAE,IAAE,EAAE,KAAK,EAAE,IAAI;AACnE,MAAE,KAAK,IAAE,EAAE,MAAM,EAAE;AACnB,MAAE,KAAK,IAAE,EAAE,IAAE,KAAK;;;AAGtB,MAAG,EAAE,IAAI,EAAG,GAAE,KAAK,EAAE,IAAE,MAAM,EAAE,GAAG,GAAE,EAAE,KAAK,IAAG,GAAE,IAAE,GAAE,GAAE,EAAE;AACxD,IAAE,IAAI;AACN,IAAE,OAAO;;CAKX,SAAS,YAAY,GAAE,GAAE,GAAG;EAC1B,IAAI,KAAK,EAAE,KAAK;AAChB,MAAG,GAAG,KAAK,EAAG;EACd,IAAI,KAAK,KAAK,KAAK;AACnB,MAAG,GAAG,IAAI,GAAG,GAAG;AACd,OAAG,KAAK,KAAM,GAAE,QAAQ,EAAE;AAC1B,OAAG,KAAK,KAAM,MAAK,OAAO,EAAE;AAC5B;;AAEF,MAAG,KAAK,KAAM,KAAI,KAAK;EACvB,IAAI,IAAI,KAAK,EAAE,KAAK,KAAK,GAAG,KAAK,EAAE;EACnC,IAAI,MAAM,KAAK,KAAG,MAAM,GAAG,KAAK,GAAG,IAAE,GAAG;AACxC,MAAG,MAAM,GAAG;AAAE,MAAG,SAAS,KAAI,EAAE;AAAE,MAAG,SAAS,KAAI,EAAE;SAAS;AAAE,MAAG,OAAO,EAAE;AAAE,MAAG,OAAO,EAAE;;EACzF,IAAI,KAAK,EAAE;EACX,IAAI,KAAK,EAAE,KAAK,KAAG;AACnB,MAAG,MAAM,EAAG;EACZ,IAAI,KAAK,MAAI,KAAG,KAAK,OAAM,KAAG,IAAG,EAAE,KAAK,KAAG,MAAI,KAAK,KAAG;EACvD,IAAI,KAAK,KAAK,KAAG,IAAI,MAAM,KAAG,KAAK,MAAI,IAAI,IAAI,KAAG,KAAK;EACvD,IAAI,IAAI,EAAE,GAAG,IAAI,IAAE,IAAI,IAAK,KAAG,OAAM,KAAK,GAAC;AAC3C,IAAE,UAAU,GAAE,EAAE;AAChB,MAAG,EAAE,UAAU,EAAE,IAAI,GAAG;AACtB,KAAE,KAAK,EAAE,OAAO;AAChB,KAAE,MAAM,GAAE,EAAE;;AAEd,aAAW,IAAI,UAAU,IAAG,EAAE;AAC9B,IAAE,MAAM,GAAE,EAAE;AACZ,SAAM,EAAE,IAAI,GAAI,GAAE,KAAK,EAAE,OAAO;AAChC,SAAM,EAAE,KAAK,GAAG;GAEd,IAAI,KAAM,EAAE,KAAK,EAAE,MAAI,KAAI,KAAK,KAAG,KAAK,MAAM,EAAE,KAAK,KAAG,MAAI,EAAE,KAAK,IAAE,KAAG,KAAG,GAAG;AAC9E,QAAI,EAAE,KAAK,MAAI,EAAE,GAAG,GAAE,IAAG,GAAE,GAAE,GAAE,GAAG,IAAI,IAAI;AACxC,MAAE,UAAU,GAAE,EAAE;AAChB,MAAE,MAAM,GAAE,EAAE;AACZ,WAAM,EAAE,KAAK,KAAK,EAAE,GAAI,GAAE,MAAM,GAAE,EAAE;;;AAGxC,MAAG,KAAK,MAAM;AACZ,KAAE,UAAU,IAAG,EAAE;AACjB,OAAG,MAAM,GAAI,YAAW,KAAK,MAAM,GAAE,EAAE;;AAEzC,IAAE,IAAI;AACN,IAAE,OAAO;AACT,MAAG,MAAM,EAAG,GAAE,SAAS,KAAI,EAAE;AAC7B,MAAG,KAAK,EAAG,YAAW,KAAK,MAAM,GAAE,EAAE;;CAIvC,SAAS,MAAM,GAAG;EAChB,IAAI,IAAI,KAAK;AACb,OAAK,KAAK,CAAC,SAAS,GAAE,MAAK,EAAE;AAC7B,MAAG,KAAK,IAAI,KAAK,EAAE,UAAU,WAAW,KAAK,GAAG,EAAG,GAAE,MAAM,GAAE,EAAE;AAC/D,SAAO;;CAIT,SAAS,QAAQ,GAAG;AAAE,OAAK,IAAI;;CAC/B,SAAS,SAAS,GAAG;AACnB,MAAG,EAAE,IAAI,KAAK,EAAE,UAAU,KAAK,EAAE,IAAI,EAAG,QAAO,EAAE,IAAI,KAAK,EAAE;MACvD,QAAO;;CAEd,SAAS,QAAQ,GAAG;AAAE,SAAO;;CAC7B,SAAS,QAAQ,GAAG;AAAE,IAAE,SAAS,KAAK,GAAE,MAAK,EAAE;;CAC/C,SAAS,OAAO,GAAE,GAAE,GAAG;AAAE,IAAE,WAAW,GAAE,EAAE;AAAE,OAAK,OAAO,EAAE;;CAC1D,SAAS,OAAO,GAAE,GAAG;AAAE,IAAE,SAAS,EAAE;AAAE,OAAK,OAAO,EAAE;;AAEpD,SAAQ,UAAU,UAAU;AAC5B,SAAQ,UAAU,SAAS;AAC3B,SAAQ,UAAU,SAAS;AAC3B,SAAQ,UAAU,QAAQ;AAC1B,SAAQ,UAAU,QAAQ;CAY1B,SAAS,cAAc;AACrB,MAAG,KAAK,IAAI,EAAG,QAAO;EACtB,IAAI,IAAI,KAAK,KAAK;AAClB,OAAI,IAAE,MAAM,EAAG,QAAO;EACtB,IAAI,IAAI,IAAE;AACV,MAAK,KAAG,KAAG,IAAE,MAAK,KAAI;AACtB,MAAK,KAAG,KAAG,IAAE,OAAM,KAAI;AACvB,MAAK,KAAG,MAAK,IAAE,SAAQ,IAAG,UAAU;AAGpC,MAAK,KAAG,IAAE,IAAE,IAAE,KAAK,MAAK,KAAK;AAE7B,SAAQ,IAAE,IAAG,KAAK,KAAG,IAAE,CAAC;;CAI1B,SAAS,WAAW,GAAG;AACrB,OAAK,IAAI;AACT,OAAK,KAAK,EAAE,UAAU;AACtB,OAAK,MAAM,KAAK,KAAG;AACnB,OAAK,MAAM,KAAK,MAAI;AACpB,OAAK,MAAM,KAAI,EAAE,KAAG,MAAK;AACzB,OAAK,MAAM,IAAE,EAAE;;CAIjB,SAAS,YAAY,GAAG;EACtB,IAAI,IAAI,KAAK;AACb,IAAE,KAAK,CAAC,UAAU,KAAK,EAAE,GAAE,EAAE;AAC7B,IAAE,SAAS,KAAK,GAAE,MAAK,EAAE;AACzB,MAAG,EAAE,IAAI,KAAK,EAAE,UAAU,WAAW,KAAK,GAAG,EAAG,MAAK,EAAE,MAAM,GAAE,EAAE;AACjE,SAAO;;CAIT,SAAS,WAAW,GAAG;EACrB,IAAI,IAAI,KAAK;AACb,IAAE,OAAO,EAAE;AACX,OAAK,OAAO,EAAE;AACd,SAAO;;CAIT,SAAS,WAAW,GAAG;AACrB,SAAM,EAAE,KAAK,KAAK,IAChB,GAAE,KAAK,EAAE,OAAO;AAClB,OAAI,IAAI,IAAI,GAAG,IAAI,KAAK,EAAE,GAAG,EAAE,GAAG;GAEhC,IAAI,IAAI,EAAE,KAAK,KAAG;GAClB,IAAI,KAAM,IAAE,KAAK,QAAO,IAAE,KAAK,OAAK,EAAE,KAAK,MAAI,MAAI,KAAK,MAAK,KAAK,OAAK,MAAK,EAAE;AAE9E,OAAI,IAAE,KAAK,EAAE;AACb,KAAE,KAAK,MAAM,KAAK,EAAE,GAAG,GAAE,IAAG,GAAE,GAAE,GAAE,KAAK,EAAE,EAAE;AAE3C,UAAM,EAAE,KAAK,MAAM,EAAE,IAAI;AAAE,MAAE,KAAK,MAAM,EAAE;AAAI,MAAE,KAAK,EAAE;;;AAEzD,IAAE,OAAO;AACT,IAAE,UAAU,KAAK,EAAE,GAAE,EAAE;AACvB,MAAG,EAAE,UAAU,KAAK,EAAE,IAAI,EAAG,GAAE,MAAM,KAAK,GAAE,EAAE;;CAIhD,SAAS,UAAU,GAAE,GAAG;AAAE,IAAE,SAAS,EAAE;AAAE,OAAK,OAAO,EAAE;;CAGvD,SAAS,UAAU,GAAE,GAAE,GAAG;AAAE,IAAE,WAAW,GAAE,EAAE;AAAE,OAAK,OAAO,EAAE;;AAE7D,YAAW,UAAU,UAAU;AAC/B,YAAW,UAAU,SAAS;AAC9B,YAAW,UAAU,SAAS;AAC9B,YAAW,UAAU,QAAQ;AAC7B,YAAW,UAAU,QAAQ;CAG7B,SAAS,YAAY;AAAE,UAAS,KAAK,IAAE,IAAI,KAAK,KAAK,KAAG,IAAG,KAAK,MAAM;;CAGtE,SAAS,OAAO,GAAE,GAAG;AACnB,MAAG,IAAI,cAAc,IAAI,EAAG,QAAO,WAAW;EAC9C,IAAI,IAAI,KAAK,EAAE,KAAK,KAAK,EAAE,IAAI,EAAE,QAAQ,KAAK,EAAE,IAAI,MAAM,EAAE,GAAC;AAC7D,IAAE,OAAO,EAAE;AACX,SAAM,EAAE,KAAK,GAAG;AACd,KAAE,MAAM,GAAE,GAAG;AACb,QAAI,IAAG,KAAG,KAAM,EAAG,GAAE,MAAM,IAAG,GAAE,EAAE;QAC7B;IAAE,IAAI,IAAI;AAAG,QAAI;AAAI,SAAK;;;AAEjC,SAAO,EAAE,OAAO,EAAE;;CAIpB,SAAS,YAAY,GAAE,GAAG;EACxB,IAAI;AACJ,MAAG,IAAI,OAAO,EAAE,QAAQ,CAAE,KAAI,IAAI,QAAQ,EAAE;MAAO,KAAI,IAAI,WAAW,EAAE;AACxE,SAAO,KAAK,IAAI,GAAE,EAAE;;AAItB,YAAW,UAAU,SAAS;AAC9B,YAAW,UAAU,UAAU;AAC/B,YAAW,UAAU,aAAa;AAClC,YAAW,UAAU,QAAQ;AAC7B,YAAW,UAAU,YAAY;AACjC,YAAW,UAAU,YAAY;AACjC,YAAW,UAAU,WAAW;AAChC,YAAW,UAAU,WAAW;AAChC,YAAW,UAAU,QAAQ;AAC7B,YAAW,UAAU,aAAa;AAClC,YAAW,UAAU,WAAW;AAChC,YAAW,UAAU,WAAW;AAChC,YAAW,UAAU,WAAW;AAChC,YAAW,UAAU,SAAS;AAC9B,YAAW,UAAU,MAAM;AAG3B,YAAW,UAAU,WAAW;AAChC,YAAW,UAAU,SAAS;AAC9B,YAAW,UAAU,MAAM;AAC3B,YAAW,UAAU,YAAY;AACjC,YAAW,UAAU,YAAY;AACjC,YAAW,UAAU,MAAM;AAC3B,YAAW,UAAU,YAAY;AAGjC,YAAW,OAAO,IAAI,EAAE;AACxB,YAAW,MAAM,IAAI,EAAE;CAavB,SAAS,UAAU;EAAE,IAAI,IAAI,KAAK;AAAE,OAAK,OAAO,EAAE;AAAE,SAAO;;CAG3D,SAAS,aAAa;AACtB,MAAG,KAAK,IAAI,GACX;OAAG,KAAK,KAAK,EAAG,QAAO,KAAK,KAAK,KAAG,KAAK;YACjC,KAAK,KAAK,EAAG,QAAO;aACnB,KAAK,KAAK,EAAG,QAAO,KAAK,KAAK;WAChC,KAAK,KAAK,EAAG,QAAO;AAE5B,UAAS,KAAK,KAAK,MAAK,KAAI,KAAG,KAAK,MAAK,MAAK,KAAK,KAAI,KAAK,KAAK;;CAIjE,SAAS,cAAc;AAAE,SAAQ,KAAK,KAAG,IAAG,KAAK,IAAG,KAAK,KAAK,MAAI,MAAK;;CAGvE,SAAS,eAAe;AAAE,SAAQ,KAAK,KAAG,IAAG,KAAK,IAAG,KAAK,KAAK,MAAI,MAAK;;CAGxE,SAAS,aAAa,GAAG;AAAE,SAAO,KAAK,MAAM,KAAK,MAAI,KAAK,KAAG,KAAK,IAAI,EAAE,CAAC;;CAG1E,SAAS,WAAW;AACpB,MAAG,KAAK,IAAI,EAAG,QAAO;WACd,KAAK,KAAK,KAAM,KAAK,KAAK,KAAK,KAAK,KAAK,MAAM,EAAI,QAAO;MAC7D,QAAO;;CAIZ,SAAS,WAAW,GAAG;AACvB,MAAG,KAAK,KAAM,KAAI;AAClB,MAAG,KAAK,QAAQ,IAAI,KAAK,IAAI,KAAK,IAAI,GAAI,QAAO;EACjD,IAAI,KAAK,KAAK,UAAU,EAAE;EAC1B,IAAI,IAAI,KAAK,IAAI,GAAE,GAAG;EACtB,IAAI,IAAI,IAAI,EAAE,EAAE,IAAI,KAAK,EAAE,IAAI,KAAK,EAAE,IAAI;AAC1C,OAAK,SAAS,GAAE,GAAE,EAAE;AACpB,SAAM,EAAE,QAAQ,GAAG,GAAG;AACrB,QAAK,IAAE,EAAE,UAAU,EAAE,SAAS,EAAE,CAAC,OAAO,EAAE,GAAG;AAC7C,KAAE,SAAS,GAAE,GAAE,EAAE;;AAElB,SAAO,EAAE,UAAU,CAAC,SAAS,EAAE,GAAG;;CAIlC,SAAS,aAAa,GAAE,GAAG;AAC3B,OAAK,QAAQ,EAAE;AACf,MAAG,KAAK,KAAM,KAAI;EAClB,IAAI,KAAK,KAAK,UAAU,EAAE;EAC1B,IAAI,IAAI,KAAK,IAAI,GAAE,GAAG,EAAE,KAAK,OAAO,IAAI,GAAG,IAAI;AAC/C,OAAI,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,EAAE,GAAG;GACjC,IAAI,IAAI,MAAM,GAAE,EAAE;AAClB,OAAG,IAAI,GAAG;AACR,QAAG,EAAE,OAAO,EAAE,IAAI,OAAO,KAAK,QAAQ,IAAI,EAAG,MAAK;AAClD;;AAEF,OAAI,IAAE,IAAE;AACR,OAAG,EAAE,KAAK,IAAI;AACZ,SAAK,UAAU,EAAE;AACjB,SAAK,WAAW,GAAE,EAAE;AACpB,QAAI;AACJ,QAAI;;;AAGP,MAAG,IAAI,GAAG;AACT,QAAK,UAAU,KAAK,IAAI,GAAE,EAAE,CAAC;AAC7B,QAAK,WAAW,GAAE,EAAE;;AAErB,MAAG,GAAI,YAAW,KAAK,MAAM,MAAK,KAAK;;CAIvC,SAAS,cAAc,GAAE,GAAE,GAAG;AAC9B,MAAG,YAAY,OAAO,EAErB,KAAG,IAAI,EAAG,MAAK,QAAQ,EAAE;OACpB;AACH,QAAK,WAAW,GAAE,EAAE;AACpB,OAAG,CAAC,KAAK,QAAQ,IAAE,EAAE,CACnB,MAAK,UAAU,WAAW,IAAI,UAAU,IAAE,EAAE,EAAC,OAAM,KAAK;AAC1D,OAAG,KAAK,QAAQ,CAAE,MAAK,WAAW,GAAE,EAAE;AACtC,UAAM,CAAC,KAAK,gBAAgB,EAAE,EAAE;AAC9B,SAAK,WAAW,GAAE,EAAE;AACpB,QAAG,KAAK,WAAW,GAAG,EAAG,MAAK,MAAM,WAAW,IAAI,UAAU,IAAE,EAAE,EAAC,KAAK;;;OAGrE;GAEN,IAAI,IAAI,IAAI,OAAO,EAAE,IAAI,IAAE;AAC3B,KAAE,UAAU,KAAG,KAAG;AAClB,KAAE,UAAU,EAAE;AACd,OAAG,IAAI,EAAG,GAAE,OAAQ,KAAG,KAAG;OAAS,GAAE,KAAK;AAC1C,QAAK,WAAW,GAAE,IAAI;;;CAKvB,SAAS,gBAAgB;EACzB,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,OAAO;AAC/B,IAAE,KAAK,KAAK;EACZ,IAAI,IAAI,KAAK,KAAI,IAAE,KAAK,KAAI,GAAG,GAAG,IAAI;AACtC,MAAG,MAAM,GAAG;AACX,OAAG,IAAI,KAAK,OAAO,IAAI,KAAK,KAAK,MAAI,OAAO,KAAK,IAAE,KAAK,OAAK,EAC3D,GAAE,OAAO,IAAG,KAAK,KAAI,KAAK,KAAG;AAC/B,UAAM,KAAK,GAAG;AACZ,QAAG,IAAI,GAAG;AACR,UAAK,KAAK,KAAK,MAAK,KAAG,KAAG,MAAM,IAAE;AAClC,UAAK,KAAK,KAAK,EAAE,OAAK,KAAG,KAAK,KAAG;WAC5B;AACL,SAAK,KAAK,KAAK,OAAK,KAAG,KAAI;AAC3B,SAAG,KAAK,GAAG;AAAE,WAAK,KAAK;AAAI,QAAE;;;AAE/B,SAAI,IAAE,QAAS,EAAG,MAAK;AACvB,QAAG,KAAK,MAAM,KAAK,IAAE,SAAU,IAAE,KAAO,GAAE;AAC1C,QAAG,IAAI,KAAK,KAAK,KAAK,EAAG,GAAE,OAAO;;;AAGrC,SAAO;;CAGP,SAAS,SAAS,GAAG;AAAE,SAAO,KAAK,UAAU,EAAE,IAAE;;CACjD,SAAS,MAAM,GAAG;AAAE,SAAO,KAAK,UAAU,EAAE,GAAC,IAAG,OAAK;;CACrD,SAAS,MAAM,GAAG;AAAE,SAAO,KAAK,UAAU,EAAE,GAAC,IAAG,OAAK;;CAGrD,SAAS,aAAa,GAAE,IAAG,GAAG;EAC9B,IAAI,GAAG,GAAG,IAAI,KAAK,IAAI,EAAE,GAAE,KAAK,EAAE;AAClC,OAAI,IAAI,GAAG,IAAI,GAAG,EAAE,EAAG,GAAE,KAAK,KAAK,GAAG,KAAK,KAAK,IAAG,EAAE,KAAK,GAAG;AAC7D,MAAG,EAAE,IAAI,KAAK,GAAG;AAChB,OAAI,EAAE,IAAE,KAAK;AACb,QAAI,IAAI,GAAG,IAAI,KAAK,GAAG,EAAE,EAAG,GAAE,KAAK,KAAK,GAAG,KAAK,KAAK,IAAG,EAAE;AAC1D,KAAE,IAAI,KAAK;SACL;AACN,OAAI,KAAK,IAAE,KAAK;AAChB,QAAI,IAAI,GAAG,IAAI,EAAE,GAAG,EAAE,EAAG,GAAE,KAAK,KAAK,GAAG,GAAE,EAAE,KAAK,GAAG;AACpD,KAAE,IAAI,EAAE;;AAET,IAAE,IAAI,GAAG,KAAK,GAAE,EAAE,EAAE;AACpB,IAAE,OAAO;;CAIT,SAAS,OAAO,GAAE,GAAG;AAAE,SAAO,IAAE;;CAChC,SAAS,MAAM,GAAG;EAAE,IAAI,IAAI,KAAK;AAAE,OAAK,UAAU,GAAE,QAAO,EAAE;AAAE,SAAO;;CAGtE,SAAS,MAAM,GAAE,GAAG;AAAE,SAAO,IAAE;;CAC/B,SAAS,KAAK,GAAG;EAAE,IAAI,IAAI,KAAK;AAAE,OAAK,UAAU,GAAE,OAAM,EAAE;AAAE,SAAO;;CAGpE,SAAS,OAAO,GAAE,GAAG;AAAE,SAAO,IAAE;;CAChC,SAAS,MAAM,GAAG;EAAE,IAAI,IAAI,KAAK;AAAE,OAAK,UAAU,GAAE,QAAO,EAAE;AAAE,SAAO;;CAGtE,SAAS,UAAU,GAAE,GAAG;AAAE,SAAO,IAAE,CAAC;;CACpC,SAAS,SAAS,GAAG;EAAE,IAAI,IAAI,KAAK;AAAE,OAAK,UAAU,GAAE,WAAU,EAAE;AAAE,SAAO;;CAG5E,SAAS,QAAQ;EACjB,IAAI,IAAI,KAAK;AACb,OAAI,IAAI,IAAI,GAAG,IAAI,KAAK,GAAG,EAAE,EAAG,GAAE,KAAK,KAAK,KAAK,KAAG,CAAC,KAAK,KAAK;AAC/D,IAAE,IAAI,KAAK;AACX,IAAE,IAAI,CAAC,KAAK;AACZ,SAAO;;CAIP,SAAS,YAAY,GAAG;EACxB,IAAI,IAAI,KAAK;AACb,MAAG,IAAI,EAAG,MAAK,SAAS,CAAC,GAAE,EAAE;MAAO,MAAK,SAAS,GAAE,EAAE;AACtD,SAAO;;CAIP,SAAS,aAAa,GAAG;EACzB,IAAI,IAAI,KAAK;AACb,MAAG,IAAI,EAAG,MAAK,SAAS,CAAC,GAAE,EAAE;MAAO,MAAK,SAAS,GAAE,EAAE;AACtD,SAAO;;CAIP,SAAS,KAAK,GAAG;AACjB,MAAG,KAAK,EAAG,QAAO;EAClB,IAAI,IAAI;AACR,OAAI,IAAE,UAAW,GAAG;AAAE,SAAM;AAAI,QAAK;;AACrC,OAAI,IAAE,QAAS,GAAG;AAAE,SAAM;AAAG,QAAK;;AAClC,OAAI,IAAE,OAAQ,GAAG;AAAE,SAAM;AAAG,QAAK;;AACjC,OAAI,IAAE,MAAM,GAAG;AAAE,SAAM;AAAG,QAAK;;AAC/B,OAAI,IAAE,MAAM,EAAG,GAAE;AACjB,SAAO;;CAIP,SAAS,oBAAoB;AAC7B,OAAI,IAAI,IAAI,GAAG,IAAI,KAAK,GAAG,EAAE,EAC5B,KAAG,KAAK,KAAK,MAAM,EAAG,QAAO,IAAE,KAAK,KAAG,KAAK,KAAK,KAAK,GAAG;AAC1D,MAAG,KAAK,IAAI,EAAG,QAAO,KAAK,IAAE,KAAK;AAClC,SAAO;;CAIP,SAAS,KAAK,GAAG;EACjB,IAAI,IAAI;AACR,SAAM,KAAK,GAAG;AAAE,QAAK,IAAE;AAAG,KAAE;;AAC5B,SAAO;;CAIP,SAAS,aAAa;EACtB,IAAI,IAAI,GAAG,IAAI,KAAK,IAAE,KAAK;AAC3B,OAAI,IAAI,IAAI,GAAG,IAAI,KAAK,GAAG,EAAE,EAAG,MAAK,KAAK,KAAK,KAAK,KAAG,EAAE;AACzD,SAAO;;CAIP,SAAS,UAAU,GAAG;EACtB,IAAI,IAAI,KAAK,MAAM,IAAE,KAAK,GAAG;AAC7B,MAAG,KAAK,KAAK,EAAG,QAAO,KAAK,KAAG;AAC/B,UAAQ,KAAK,KAAK,KAAI,KAAI,IAAE,KAAK,OAAO;;CAIxC,SAAS,aAAa,GAAE,IAAI;EAC5B,IAAI,IAAI,WAAW,IAAI,UAAU,EAAE;AACnC,OAAK,UAAU,GAAE,IAAG,EAAE;AACtB,SAAO;;CAIP,SAAS,SAAS,GAAG;AAAE,SAAO,KAAK,UAAU,GAAE,MAAM;;CAGrD,SAAS,WAAW,GAAG;AAAE,SAAO,KAAK,UAAU,GAAE,UAAU;;CAG3D,SAAS,UAAU,GAAG;AAAE,SAAO,KAAK,UAAU,GAAE,OAAO;;CAGvD,SAAS,SAAS,GAAE,GAAG;EACvB,IAAI,IAAI,GAAG,IAAI,GAAG,IAAI,KAAK,IAAI,EAAE,GAAE,KAAK,EAAE;AAC1C,SAAM,IAAI,GAAG;AACZ,QAAK,KAAK,KAAK,KAAG,EAAE,KAAK;AACzB,KAAE,KAAK,OAAO,IAAE,KAAK;AACrB,SAAM,KAAK;;AAEZ,MAAG,EAAE,IAAI,KAAK,GAAG;AAChB,QAAK,EAAE;AACP,UAAM,IAAI,KAAK,GAAG;AAChB,SAAK,KAAK,KAAK;AACf,MAAE,KAAK,OAAO,IAAE,KAAK;AACrB,UAAM,KAAK;;AAEb,QAAK,KAAK;SACJ;AACN,QAAK,KAAK;AACV,UAAM,IAAI,EAAE,GAAG;AACb,SAAK,EAAE,KAAK;AACZ,MAAE,KAAK,OAAO,IAAE,KAAK;AACrB,UAAM,KAAK;;AAEb,QAAK,EAAE;;AAER,IAAE,IAAK,IAAE,IAAG,KAAG;AACf,MAAG,IAAI,EAAG,GAAE,KAAK,OAAO;WAChB,IAAI,GAAI,GAAE,KAAK,OAAO,KAAK,KAAG;AACtC,IAAE,IAAI;AACN,IAAE,OAAO;;CAIT,SAAS,MAAM,GAAG;EAAE,IAAI,IAAI,KAAK;AAAE,OAAK,MAAM,GAAE,EAAE;AAAE,SAAO;;CAG3D,SAAS,WAAW,GAAG;EAAE,IAAI,IAAI,KAAK;AAAE,OAAK,MAAM,GAAE,EAAE;AAAE,SAAO;;CAGhE,SAAS,WAAW,GAAG;EAAE,IAAI,IAAI,KAAK;AAAE,OAAK,WAAW,GAAE,EAAE;AAAE,SAAO;;CAGrE,SAAS,SAAS,GAAG;EAAE,IAAI,IAAI,KAAK;AAAE,OAAK,SAAS,GAAE,GAAE,KAAK;AAAE,SAAO;;CAGtE,SAAS,YAAY,GAAG;EAAE,IAAI,IAAI,KAAK;AAAE,OAAK,SAAS,GAAE,MAAK,EAAE;AAAE,SAAO;;CAGzE,SAAS,qBAAqB,GAAG;EACjC,IAAI,IAAI,KAAK,EAAE,IAAI,KAAK;AACxB,OAAK,SAAS,GAAE,GAAE,EAAE;AACpB,SAAO,IAAI,MAAM,GAAE,EAAE;;CAIrB,SAAS,aAAa,GAAG;AACzB,OAAK,KAAK,KAAK,KAAK,KAAK,GAAG,GAAE,IAAE,GAAE,MAAK,GAAE,GAAE,KAAK,EAAE;AAClD,IAAE,KAAK;AACP,OAAK,OAAO;;CAIZ,SAAS,cAAc,GAAE,GAAG;AAC5B,MAAG,KAAK,EAAG;AACX,SAAM,KAAK,KAAK,EAAG,MAAK,KAAK,KAAK,OAAO;AACzC,OAAK,KAAK,MAAM;AAChB,SAAM,KAAK,KAAK,MAAM,KAAK,IAAI;AAC9B,QAAK,KAAK,MAAM,KAAK;AACrB,OAAG,EAAE,KAAK,KAAK,EAAG,MAAK,KAAK,KAAK,OAAO;AACxC,KAAE,KAAK,KAAK;;;CAKb,SAAS,UAAU;CACnB,SAAS,KAAK,GAAG;AAAE,SAAO;;CAC1B,SAAS,OAAO,GAAE,GAAE,GAAG;AAAE,IAAE,WAAW,GAAE,EAAE;;CAC1C,SAAS,OAAO,GAAE,GAAG;AAAE,IAAE,SAAS,EAAE;;AAEpC,SAAQ,UAAU,UAAU;AAC5B,SAAQ,UAAU,SAAS;AAC3B,SAAQ,UAAU,QAAQ;AAC1B,SAAQ,UAAU,QAAQ;CAG1B,SAAS,MAAM,GAAG;AAAE,SAAO,KAAK,IAAI,GAAE,IAAI,SAAS,CAAC;;CAIpD,SAAS,mBAAmB,GAAE,GAAE,GAAG;EACnC,IAAI,IAAI,KAAK,IAAI,KAAK,IAAE,EAAE,GAAE,EAAE;AAC9B,IAAE,IAAI;AACN,IAAE,IAAI;AACN,SAAM,IAAI,EAAG,GAAE,KAAK,EAAE,KAAK;EAC3B,IAAI;AACJ,OAAI,IAAI,EAAE,IAAE,KAAK,GAAG,IAAI,GAAG,EAAE,EAAG,GAAE,KAAK,IAAE,KAAK,KAAK,KAAK,GAAG,GAAE,EAAE,KAAK,IAAG,GAAE,GAAE,GAAE,KAAK,EAAE;AACpF,OAAI,IAAI,KAAK,IAAI,EAAE,GAAE,EAAE,EAAE,IAAI,GAAG,EAAE,EAAG,MAAK,GAAG,GAAE,EAAE,KAAK,IAAG,GAAE,GAAE,GAAE,IAAE,EAAE;AACnE,IAAE,OAAO;;CAKT,SAAS,mBAAmB,GAAE,GAAE,GAAG;AACnC,IAAE;EACF,IAAI,IAAI,EAAE,IAAI,KAAK,IAAE,EAAE,IAAE;AACzB,IAAE,IAAI;AACN,SAAM,EAAE,KAAK,EAAG,GAAE,KAAK,KAAK;AAC5B,OAAI,IAAI,KAAK,IAAI,IAAE,KAAK,GAAE,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,EACxC,GAAE,KAAK,KAAK,IAAE,IAAE,KAAK,KAAK,GAAG,IAAE,GAAE,EAAE,KAAK,IAAG,GAAE,GAAE,GAAE,KAAK,IAAE,IAAE,EAAE;AAC7D,IAAE,OAAO;AACT,IAAE,UAAU,GAAE,EAAE;;CAIhB,SAAS,QAAQ,GAAG;AAEpB,OAAK,KAAK,KAAK;AACf,OAAK,KAAK,KAAK;AACf,aAAW,IAAI,UAAU,IAAE,EAAE,GAAE,KAAK,GAAG;AACvC,OAAK,KAAK,KAAK,GAAG,OAAO,EAAE;AAC3B,OAAK,IAAI;;CAGT,SAAS,eAAe,GAAG;AAC3B,MAAG,EAAE,IAAI,KAAK,EAAE,IAAI,IAAE,KAAK,EAAE,EAAG,QAAO,EAAE,IAAI,KAAK,EAAE;WAC5C,EAAE,UAAU,KAAK,EAAE,GAAG,EAAG,QAAO;OACnC;GAAE,IAAI,IAAI,KAAK;AAAE,KAAE,OAAO,EAAE;AAAE,QAAK,OAAO,EAAE;AAAE,UAAO;;;CAG1D,SAAS,cAAc,GAAG;AAAE,SAAO;;CAGnC,SAAS,cAAc,GAAG;AAC1B,IAAE,UAAU,KAAK,EAAE,IAAE,GAAE,KAAK,GAAG;AAC/B,MAAG,EAAE,IAAI,KAAK,EAAE,IAAE,GAAG;AAAE,KAAE,IAAI,KAAK,EAAE,IAAE;AAAG,KAAE,OAAO;;AAClD,OAAK,GAAG,gBAAgB,KAAK,IAAG,KAAK,EAAE,IAAE,GAAE,KAAK,GAAG;AACnD,OAAK,EAAE,gBAAgB,KAAK,IAAG,KAAK,EAAE,IAAE,GAAE,KAAK,GAAG;AAClD,SAAM,EAAE,UAAU,KAAK,GAAG,GAAG,EAAG,GAAE,WAAW,GAAE,KAAK,EAAE,IAAE,EAAE;AAC1D,IAAE,MAAM,KAAK,IAAG,EAAE;AAClB,SAAM,EAAE,UAAU,KAAK,EAAE,IAAI,EAAG,GAAE,MAAM,KAAK,GAAE,EAAE;;CAIjD,SAAS,aAAa,GAAE,GAAG;AAAE,IAAE,SAAS,EAAE;AAAE,OAAK,OAAO,EAAE;;CAG1D,SAAS,aAAa,GAAE,GAAE,GAAG;AAAE,IAAE,WAAW,GAAE,EAAE;AAAE,OAAK,OAAO,EAAE;;AAEhE,SAAQ,UAAU,UAAU;AAC5B,SAAQ,UAAU,SAAS;AAC3B,SAAQ,UAAU,SAAS;AAC3B,SAAQ,UAAU,QAAQ;AAC1B,SAAQ,UAAU,QAAQ;CAG1B,SAAS,SAAS,GAAE,GAAG;EACvB,IAAI,IAAI,EAAE,WAAW,EAAE,GAAG,IAAI,IAAI,EAAE,EAAE;AACtC,MAAG,KAAK,EAAG,QAAO;WACV,IAAI,GAAI,KAAI;WACZ,IAAI,GAAI,KAAI;WACZ,IAAI,IAAK,KAAI;WACb,IAAI,IAAK,KAAI;MAChB,KAAI;AACT,MAAG,IAAI,EACN,KAAI,IAAI,QAAQ,EAAE;WACX,EAAE,QAAQ,CACjB,KAAI,IAAI,QAAQ,EAAE;MAElB,KAAI,IAAI,WAAW,EAAE;EAGtB,IAAI,IAAI,IAAI,OAAO,EAAE,IAAI,GAAG,KAAK,IAAE,GAAG,MAAM,KAAG,KAAG;AAClD,IAAE,KAAK,EAAE,QAAQ,KAAK;AACtB,MAAG,IAAI,GAAG;GACT,IAAI,KAAK,KAAK;AACd,KAAE,MAAM,EAAE,IAAG,GAAG;AAChB,UAAM,KAAK,IAAI;AACb,MAAE,KAAK,KAAK;AACZ,MAAE,MAAM,IAAG,EAAE,IAAE,IAAG,EAAE,GAAG;AACvB,SAAK;;;EAIR,IAAI,IAAI,EAAE,IAAE,GAAG,GAAG,MAAM,MAAM,KAAK,KAAK,EAAE;AAC1C,MAAI,MAAM,EAAE,KAAK,GAAG,GAAC;AACrB,SAAM,KAAK,GAAG;AACb,OAAG,KAAK,GAAI,KAAK,EAAE,KAAK,MAAK,IAAE,KAAK;QAC/B;AACH,SAAK,EAAE,KAAK,MAAK,KAAI,IAAE,KAAI,MAAM,KAAG;AACpC,QAAG,IAAI,EAAG,MAAK,EAAE,KAAK,IAAE,MAAK,KAAK,KAAG,IAAE;;AAGzC,OAAI;AACJ,WAAO,IAAE,MAAM,GAAG;AAAE,UAAM;AAAG,MAAE;;AAC/B,QAAI,KAAK,KAAK,GAAG;AAAE,SAAK,KAAK;AAAI,MAAE;;AACnC,OAAG,KAAK;AACN,MAAE,GAAG,OAAO,EAAE;AACd,UAAM;UACD;AACL,WAAM,IAAI,GAAG;AAAE,OAAE,MAAM,GAAE,GAAG;AAAE,OAAE,MAAM,IAAG,EAAE;AAAE,UAAK;;AAClD,QAAG,IAAI,EAAG,GAAE,MAAM,GAAE,GAAG;SAAO;AAAE,SAAI;AAAG,SAAI;AAAI,UAAK;;AACpD,MAAE,MAAM,IAAG,EAAE,IAAG,EAAE;;AAGpB,UAAM,KAAK,MAAM,EAAE,KAAK,KAAI,KAAG,MAAO,GAAG;AACvC,MAAE,MAAM,GAAE,GAAG;AAAE,QAAI;AAAG,QAAI;AAAI,SAAK;AACnC,QAAG,EAAE,IAAI,GAAG;AAAE,SAAI,KAAK,KAAG;AAAG,OAAE;;;;AAGlC,SAAO,EAAE,OAAO,EAAE;;CAIlB,SAAS,MAAM,GAAG;EAClB,IAAI,IAAK,KAAK,IAAE,IAAG,KAAK,QAAQ,GAAC,KAAK,OAAO;EAC7C,IAAI,IAAK,EAAE,IAAE,IAAG,EAAE,QAAQ,GAAC,EAAE,OAAO;AACpC,MAAG,EAAE,UAAU,EAAE,GAAG,GAAG;GAAE,IAAI,IAAI;AAAG,OAAI;AAAG,OAAI;;EAC/C,IAAI,IAAI,EAAE,iBAAiB,EAAE,IAAI,EAAE,iBAAiB;AACpD,MAAG,IAAI,EAAG,QAAO;AACjB,MAAG,IAAI,EAAG,KAAI;AACd,MAAG,IAAI,GAAG;AACT,KAAE,SAAS,GAAE,EAAE;AACf,KAAE,SAAS,GAAE,EAAE;;AAEhB,SAAM,EAAE,QAAQ,GAAG,GAAG;AACrB,QAAI,IAAI,EAAE,iBAAiB,IAAI,EAAG,GAAE,SAAS,GAAE,EAAE;AACjD,QAAI,IAAI,EAAE,iBAAiB,IAAI,EAAG,GAAE,SAAS,GAAE,EAAE;AACjD,OAAG,EAAE,UAAU,EAAE,IAAI,GAAG;AACtB,MAAE,MAAM,GAAE,EAAE;AACZ,MAAE,SAAS,GAAE,EAAE;UACV;AACL,MAAE,MAAM,GAAE,EAAE;AACZ,MAAE,SAAS,GAAE,EAAE;;;AAGlB,MAAG,IAAI,EAAG,GAAE,SAAS,GAAE,EAAE;AACzB,SAAO;;CAIP,SAAS,UAAU,GAAG;AACtB,MAAG,KAAK,EAAG,QAAO;EAClB,IAAI,IAAI,KAAK,KAAG,GAAG,IAAK,KAAK,IAAE,IAAG,IAAE,IAAE;AACtC,MAAG,KAAK,IAAI,EACX,KAAG,KAAK,EAAG,KAAI,KAAK,KAAK,KAAG;MACvB,MAAI,IAAI,IAAI,KAAK,IAAE,GAAG,KAAK,GAAG,EAAE,EAAG,MAAK,IAAE,IAAE,KAAK,KAAK,MAAI;AAChE,SAAO;;CAIP,SAAS,aAAa,GAAG;EACzB,IAAI,KAAK,EAAE,QAAQ;AACnB,MAAI,KAAK,QAAQ,IAAI,MAAO,EAAE,QAAQ,IAAI,EAAG,QAAO,WAAW;EAC/D,IAAI,IAAI,EAAE,OAAO,EAAE,IAAI,KAAK,OAAO;EACnC,IAAI,IAAI,IAAI,EAAE,EAAE,IAAI,IAAI,EAAE,EAAE,IAAI,IAAI,EAAE,EAAE,IAAI,IAAI,EAAE;AAClD,SAAM,EAAE,QAAQ,IAAI,GAAG;AACtB,UAAM,EAAE,QAAQ,EAAE;AAChB,MAAE,SAAS,GAAE,EAAE;AACf,QAAG,IAAI;AACL,SAAG,CAAC,EAAE,QAAQ,IAAI,CAAC,EAAE,QAAQ,EAAE;AAAE,QAAE,MAAM,MAAK,EAAE;AAAE,QAAE,MAAM,GAAE,EAAE;;AAC9D,OAAE,SAAS,GAAE,EAAE;eACP,CAAC,EAAE,QAAQ,CAAE,GAAE,MAAM,GAAE,EAAE;AACnC,MAAE,SAAS,GAAE,EAAE;;AAEjB,UAAM,EAAE,QAAQ,EAAE;AAChB,MAAE,SAAS,GAAE,EAAE;AACf,QAAG,IAAI;AACL,SAAG,CAAC,EAAE,QAAQ,IAAI,CAAC,EAAE,QAAQ,EAAE;AAAE,QAAE,MAAM,MAAK,EAAE;AAAE,QAAE,MAAM,GAAE,EAAE;;AAC9D,OAAE,SAAS,GAAE,EAAE;eACP,CAAC,EAAE,QAAQ,CAAE,GAAE,MAAM,GAAE,EAAE;AACnC,MAAE,SAAS,GAAE,EAAE;;AAEjB,OAAG,EAAE,UAAU,EAAE,IAAI,GAAG;AACtB,MAAE,MAAM,GAAE,EAAE;AACZ,QAAG,GAAI,GAAE,MAAM,GAAE,EAAE;AACnB,MAAE,MAAM,GAAE,EAAE;UACP;AACL,MAAE,MAAM,GAAE,EAAE;AACZ,QAAG,GAAI,GAAE,MAAM,GAAE,EAAE;AACnB,MAAE,MAAM,GAAE,EAAE;;;AAGf,MAAG,EAAE,UAAU,WAAW,IAAI,IAAI,EAAG,QAAO,WAAW;AACvD,MAAG,EAAE,UAAU,EAAE,IAAI,EAAG,QAAO,EAAE,SAAS,EAAE;AAC5C,MAAG,EAAE,QAAQ,GAAG,EAAG,GAAE,MAAM,GAAE,EAAE;MAAO,QAAO;AAC7C,MAAG,EAAE,QAAQ,GAAG,EAAG,QAAO,EAAE,IAAI,EAAE;MAAO,QAAO;;CAGhD,IAAI,YAAY;EAAC;EAAE;EAAE;EAAE;EAAE;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;CACxX,IAAI,SAAS,KAAG,MAAI,UAAU,UAAU,SAAO;CAG/C,SAAS,kBAAkB,GAAG;EAC9B,IAAI,GAAG,IAAI,KAAK,KAAK;AACrB,MAAG,EAAE,KAAK,KAAK,EAAE,KAAK,MAAM,UAAU,UAAU,SAAO,IAAI;AAC1D,QAAI,IAAI,GAAG,IAAI,UAAU,QAAQ,EAAE,EACjC,KAAG,EAAE,KAAK,MAAM,UAAU,GAAI,QAAO;AACvC,UAAO;;AAER,MAAG,EAAE,QAAQ,CAAE,QAAO;AACtB,MAAI;AACJ,SAAM,IAAI,UAAU,QAAQ;GAC3B,IAAI,IAAI,UAAU,IAAI,IAAI,IAAE;AAC5B,UAAM,IAAI,UAAU,UAAU,IAAI,MAAO,MAAK,UAAU;AACxD,OAAI,EAAE,OAAO,EAAE;AACf,UAAM,IAAI,EAAG,KAAG,IAAE,UAAU,QAAQ,EAAG,QAAO;;AAE/C,SAAO,EAAE,YAAY,EAAE;;CAIvB,SAAS,eAAe,GAAG;EAC3B,IAAI,KAAK,KAAK,SAAS,WAAW,IAAI;EACtC,IAAI,IAAI,GAAG,iBAAiB;AAC5B,MAAG,KAAK,EAAG,QAAO;EAClB,IAAI,IAAI,GAAG,WAAW,EAAE;EACxB,IAAI,OAAO,WAAW;EACtB,IAAI;AACJ,OAAI,IAAI,IAAI,GAAG,IAAI,GAAG,EAAE,GAAG;AAE1B;AACE,QAAI,IAAI,WAAW,KAAK,WAAW,EAAE,KAAK;UAEtC,EAAE,UAAU,WAAW,IAAI,IAAI,KAAK,EAAE,UAAU,GAAG,IAAI;GAC7D,IAAI,IAAI,EAAE,OAAO,GAAE,KAAK;AACxB,OAAG,EAAE,UAAU,WAAW,IAAI,IAAI,KAAK,EAAE,UAAU,GAAG,IAAI,GAAG;IAC3D,IAAI,IAAI;AACR,WAAM,MAAM,KAAK,EAAE,UAAU,GAAG,IAAI,GAAG;AACrC,SAAI,EAAE,UAAU,GAAE,KAAK;AACvB,SAAG,EAAE,UAAU,WAAW,IAAI,IAAI,EAAG,QAAO;;AAE9C,QAAG,EAAE,UAAU,GAAG,IAAI,EAAG,QAAO;;;AAGnC,SAAO;;CAIP,SAAS,YAAY;AAEnB,SAAO,EAEL,WAAW,SAAS,GAAG;AACrB,QAAI,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,EAAE,EAC7B,GAAE,KAAK,KAAK,MAAM,KAAK,QAAQ,GAAG,IAAO;KAG9C;;AAIH,YAAW,UAAU,YAAY;AACjC,YAAW,UAAU,UAAU;AAC/B,YAAW,UAAU,YAAY;AACjC,YAAW,UAAU,aAAa;AAClC,YAAW,UAAU,YAAY;AACjC,YAAW,UAAU,YAAY;AACjC,YAAW,UAAU,QAAQ;AAC7B,YAAW,UAAU,YAAY;AACjC,YAAW,UAAU,aAAa;AAClC,YAAW,UAAU,kBAAkB;AACvC,YAAW,UAAU,kBAAkB;AACvC,YAAW,UAAU,SAAS;AAC9B,YAAW,UAAU,cAAc;AAGnC,YAAW,UAAU,QAAQ;AAC7B,YAAW,UAAU,WAAW;AAChC,YAAW,UAAU,YAAY;AACjC,YAAW,UAAU,aAAa;AAClC,YAAW,UAAU,SAAS;AAC9B,YAAW,UAAU,cAAc;AACnC,YAAW,UAAU,SAAS;AAC9B,YAAW,UAAU,MAAM;AAC3B,YAAW,UAAU,MAAM;AAC3B,YAAW,UAAU,MAAM;AAC3B,YAAW,UAAU,KAAK;AAC1B,YAAW,UAAU,MAAM;AAC3B,YAAW,UAAU,SAAS;AAC9B,YAAW,UAAU,MAAM;AAC3B,YAAW,UAAU,YAAY;AACjC,YAAW,UAAU,aAAa;AAClC,YAAW,UAAU,kBAAkB;AACvC,YAAW,UAAU,WAAW;AAChC,YAAW,UAAU,UAAU;AAC/B,YAAW,UAAU,SAAS;AAC9B,YAAW,UAAU,WAAW;AAChC,YAAW,UAAU,UAAU;AAC/B,YAAW,UAAU,MAAM;AAC3B,YAAW,UAAU,WAAW;AAChC,YAAW,UAAU,WAAW;AAChC,YAAW,UAAU,SAAS;AAC9B,YAAW,UAAU,YAAY;AACjC,YAAW,UAAU,qBAAqB;AAC1C,YAAW,UAAU,SAAS;AAC9B,YAAW,UAAU,aAAa;AAClC,YAAW,UAAU,MAAM;AAC3B,YAAW,UAAU,MAAM;AAC3B,YAAW,UAAU,kBAAkB"}

package/dist/cjs/node_modules/node-forge/lib/kem.cjs

@@ -0,0 +1,153 @@
+const require_rolldown_runtime = require('../../../_virtual/rolldown_runtime.cjs');
+const require_forge$1 = require('./forge.cjs');
+const require_util$1 = require('./util.cjs');
+const require_random$1 = require('./random.cjs');
+const require_jsbn$1 = require('./jsbn.cjs');
+
+//#region ../../node_modules/node-forge/lib/kem.js
+var require_kem = /* @__PURE__ */ require_rolldown_runtime.__commonJS({ "../../node_modules/node-forge/lib/kem.js": ((exports, module) => {
+	/**
+	* Javascript implementation of RSA-KEM.
+	*
+	* @author Lautaro Cozzani Rodriguez
+	* @author Dave Longley
+	*
+	* Copyright (c) 2014 Lautaro Cozzani <lautaro.cozzani@scytl.com>
+	* Copyright (c) 2014 Digital Bazaar, Inc.
+	*/
+	var forge = require_forge$1.default;
+	require_util$1.default;
+	require_random$1.default;
+	require_jsbn$1.default;
+	module.exports = forge.kem = forge.kem || {};
+	var BigInteger = forge.jsbn.BigInteger;
+	/**
+	* The API for the RSA Key Encapsulation Mechanism (RSA-KEM) from ISO 18033-2.
+	*/
+	forge.kem.rsa = {};
+	/**
+	* Creates an RSA KEM API object for generating a secret asymmetric key.
+	*
+	* The symmetric key may be generated via a call to 'encrypt', which will
+	* produce a ciphertext to be transmitted to the recipient and a key to be
+	* kept secret. The ciphertext is a parameter to be passed to 'decrypt' which
+	* will produce the same secret key for the recipient to use to decrypt a
+	* message that was encrypted with the secret key.
+	*
+	* @param kdf the KDF API to use (eg: new forge.kem.kdf1()).
+	* @param options the options to use.
+	*          [prng] a custom crypto-secure pseudo-random number generator to use,
+	*            that must define "getBytesSync".
+	*/
+	forge.kem.rsa.create = function(kdf, options) {
+		options = options || {};
+		var prng = options.prng || forge.random;
+		var kem = {};
+		/**
+		* Generates a secret key and its encapsulation.
+		*
+		* @param publicKey the RSA public key to encrypt with.
+		* @param keyLength the length, in bytes, of the secret key to generate.
+		*
+		* @return an object with:
+		*   encapsulation: the ciphertext for generating the secret key, as a
+		*     binary-encoded string of bytes.
+		*   key: the secret key to use for encrypting a message.
+		*/
+		kem.encrypt = function(publicKey, keyLength) {
+			var byteLength = Math.ceil(publicKey.n.bitLength() / 8);
+			var r;
+			do
+				r = new BigInteger(forge.util.bytesToHex(prng.getBytesSync(byteLength)), 16).mod(publicKey.n);
+			while (r.compareTo(BigInteger.ONE) <= 0);
+			r = forge.util.hexToBytes(r.toString(16));
+			var zeros = byteLength - r.length;
+			if (zeros > 0) r = forge.util.fillString(String.fromCharCode(0), zeros) + r;
+			return {
+				encapsulation: publicKey.encrypt(r, "NONE"),
+				key: kdf.generate(r, keyLength)
+			};
+		};
+		/**
+		* Decrypts an encapsulated secret key.
+		*
+		* @param privateKey the RSA private key to decrypt with.
+		* @param encapsulation the ciphertext for generating the secret key, as
+		*          a binary-encoded string of bytes.
+		* @param keyLength the length, in bytes, of the secret key to generate.
+		*
+		* @return the secret key as a binary-encoded string of bytes.
+		*/
+		kem.decrypt = function(privateKey, encapsulation, keyLength) {
+			var r = privateKey.decrypt(encapsulation, "NONE");
+			return kdf.generate(r, keyLength);
+		};
+		return kem;
+	};
+	/**
+	* Creates a key derivation API object that implements KDF1 per ISO 18033-2.
+	*
+	* @param md the hash API to use.
+	* @param [digestLength] an optional digest length that must be positive and
+	*          less than or equal to md.digestLength.
+	*
+	* @return a KDF1 API object.
+	*/
+	forge.kem.kdf1 = function(md, digestLength) {
+		_createKDF(this, md, 0, digestLength || md.digestLength);
+	};
+	/**
+	* Creates a key derivation API object that implements KDF2 per ISO 18033-2.
+	*
+	* @param md the hash API to use.
+	* @param [digestLength] an optional digest length that must be positive and
+	*          less than or equal to md.digestLength.
+	*
+	* @return a KDF2 API object.
+	*/
+	forge.kem.kdf2 = function(md, digestLength) {
+		_createKDF(this, md, 1, digestLength || md.digestLength);
+	};
+	/**
+	* Creates a KDF1 or KDF2 API object.
+	*
+	* @param md the hash API to use.
+	* @param counterStart the starting index for the counter.
+	* @param digestLength the digest length to use.
+	*
+	* @return the KDF API object.
+	*/
+	function _createKDF(kdf, md, counterStart, digestLength) {
+		/**
+		* Generate a key of the specified length.
+		*
+		* @param x the binary-encoded byte string to generate a key from.
+		* @param length the number of bytes to generate (the size of the key).
+		*
+		* @return the key as a binary-encoded string.
+		*/
+		kdf.generate = function(x, length) {
+			var key = new forge.util.ByteBuffer();
+			var k = Math.ceil(length / digestLength) + counterStart;
+			var c = new forge.util.ByteBuffer();
+			for (var i = counterStart; i < k; ++i) {
+				c.putInt32(i);
+				md.start();
+				md.update(x + c.getBytes());
+				var hash = md.digest();
+				key.putBytes(hash.getBytes(digestLength));
+			}
+			key.truncate(key.length() - length);
+			return key.getBytes();
+		};
+	}
+}) });
+
+//#endregion
+Object.defineProperty(exports, 'default', {
+  enumerable: true,
+  get: function () {
+    return require_kem();
+  }
+});
+//# sourceMappingURL=kem.cjs.map

package/dist/cjs/node_modules/node-forge/lib/kem.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"kem.cjs","names":[],"sources":["../../../../../../../node_modules/node-forge/lib/kem.js"],"sourcesContent":["/**\n * Javascript implementation of RSA-KEM.\n *\n * @author Lautaro Cozzani Rodriguez\n * @author Dave Longley\n *\n * Copyright (c) 2014 Lautaro Cozzani <lautaro.cozzani@scytl.com>\n * Copyright (c) 2014 Digital Bazaar, Inc.\n */\nvar forge = require('./forge');\nrequire('./util');\nrequire('./random');\nrequire('./jsbn');\n\nmodule.exports = forge.kem = forge.kem || {};\n\nvar BigInteger = forge.jsbn.BigInteger;\n\n/**\n * The API for the RSA Key Encapsulation Mechanism (RSA-KEM) from ISO 18033-2.\n */\nforge.kem.rsa = {};\n\n/**\n * Creates an RSA KEM API object for generating a secret asymmetric key.\n *\n * The symmetric key may be generated via a call to 'encrypt', which will\n * produce a ciphertext to be transmitted to the recipient and a key to be\n * kept secret. The ciphertext is a parameter to be passed to 'decrypt' which\n * will produce the same secret key for the recipient to use to decrypt a\n * message that was encrypted with the secret key.\n *\n * @param kdf the KDF API to use (eg: new forge.kem.kdf1()).\n * @param options the options to use.\n *          [prng] a custom crypto-secure pseudo-random number generator to use,\n *            that must define \"getBytesSync\".\n */\nforge.kem.rsa.create = function(kdf, options) {\n  options = options || {};\n  var prng = options.prng || forge.random;\n\n  var kem = {};\n\n  /**\n   * Generates a secret key and its encapsulation.\n   *\n   * @param publicKey the RSA public key to encrypt with.\n   * @param keyLength the length, in bytes, of the secret key to generate.\n   *\n   * @return an object with:\n   *   encapsulation: the ciphertext for generating the secret key, as a\n   *     binary-encoded string of bytes.\n   *   key: the secret key to use for encrypting a message.\n   */\n  kem.encrypt = function(publicKey, keyLength) {\n    // generate a random r where 1 < r < n\n    var byteLength = Math.ceil(publicKey.n.bitLength() / 8);\n    var r;\n    do {\n      r = new BigInteger(\n        forge.util.bytesToHex(prng.getBytesSync(byteLength)),\n        16).mod(publicKey.n);\n    } while(r.compareTo(BigInteger.ONE) <= 0);\n\n    // prepend r with zeros\n    r = forge.util.hexToBytes(r.toString(16));\n    var zeros = byteLength - r.length;\n    if(zeros > 0) {\n      r = forge.util.fillString(String.fromCharCode(0), zeros) + r;\n    }\n\n    // encrypt the random\n    var encapsulation = publicKey.encrypt(r, 'NONE');\n\n    // generate the secret key\n    var key = kdf.generate(r, keyLength);\n\n    return {encapsulation: encapsulation, key: key};\n  };\n\n  /**\n   * Decrypts an encapsulated secret key.\n   *\n   * @param privateKey the RSA private key to decrypt with.\n   * @param encapsulation the ciphertext for generating the secret key, as\n   *          a binary-encoded string of bytes.\n   * @param keyLength the length, in bytes, of the secret key to generate.\n   *\n   * @return the secret key as a binary-encoded string of bytes.\n   */\n  kem.decrypt = function(privateKey, encapsulation, keyLength) {\n    // decrypt the encapsulation and generate the secret key\n    var r = privateKey.decrypt(encapsulation, 'NONE');\n    return kdf.generate(r, keyLength);\n  };\n\n  return kem;\n};\n\n// TODO: add forge.kem.kdf.create('KDF1', {md: ..., ...}) API?\n\n/**\n * Creates a key derivation API object that implements KDF1 per ISO 18033-2.\n *\n * @param md the hash API to use.\n * @param [digestLength] an optional digest length that must be positive and\n *          less than or equal to md.digestLength.\n *\n * @return a KDF1 API object.\n */\nforge.kem.kdf1 = function(md, digestLength) {\n  _createKDF(this, md, 0, digestLength || md.digestLength);\n};\n\n/**\n * Creates a key derivation API object that implements KDF2 per ISO 18033-2.\n *\n * @param md the hash API to use.\n * @param [digestLength] an optional digest length that must be positive and\n *          less than or equal to md.digestLength.\n *\n * @return a KDF2 API object.\n */\nforge.kem.kdf2 = function(md, digestLength) {\n  _createKDF(this, md, 1, digestLength || md.digestLength);\n};\n\n/**\n * Creates a KDF1 or KDF2 API object.\n *\n * @param md the hash API to use.\n * @param counterStart the starting index for the counter.\n * @param digestLength the digest length to use.\n *\n * @return the KDF API object.\n */\nfunction _createKDF(kdf, md, counterStart, digestLength) {\n  /**\n   * Generate a key of the specified length.\n   *\n   * @param x the binary-encoded byte string to generate a key from.\n   * @param length the number of bytes to generate (the size of the key).\n   *\n   * @return the key as a binary-encoded string.\n   */\n  kdf.generate = function(x, length) {\n    var key = new forge.util.ByteBuffer();\n\n    // run counter from counterStart to ceil(length / Hash.len)\n    var k = Math.ceil(length / digestLength) + counterStart;\n\n    var c = new forge.util.ByteBuffer();\n    for(var i = counterStart; i < k; ++i) {\n      // I2OSP(i, 4): convert counter to an octet string of 4 octets\n      c.putInt32(i);\n\n      // digest 'x' and the counter and add the result to the key\n      md.start();\n      md.update(x + c.getBytes());\n      var hash = md.digest();\n      key.putBytes(hash.getBytes(digestLength));\n    }\n\n    // truncate to the correct key length\n    key.truncate(key.length() - length);\n    return key.getBytes();\n  };\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;;;;;;;;;;;;;;CASA,IAAI;AACJ;AACA;AACA;AAEA,QAAO,UAAU,MAAM,MAAM,MAAM,OAAO,EAAE;CAE5C,IAAI,aAAa,MAAM,KAAK;;;;AAK5B,OAAM,IAAI,MAAM,EAAE;;;;;;;;;;;;;;;AAgBlB,OAAM,IAAI,IAAI,SAAS,SAAS,KAAK,SAAS;AAC5C,YAAU,WAAW,EAAE;EACvB,IAAI,OAAO,QAAQ,QAAQ,MAAM;EAEjC,IAAI,MAAM,EAAE;;;;;;;;;;;;AAaZ,MAAI,UAAU,SAAS,WAAW,WAAW;GAE3C,IAAI,aAAa,KAAK,KAAK,UAAU,EAAE,WAAW,GAAG,EAAE;GACvD,IAAI;AACJ;AACE,QAAI,IAAI,WACN,MAAM,KAAK,WAAW,KAAK,aAAa,WAAW,CAAC,EACpD,GAAG,CAAC,IAAI,UAAU,EAAE;UAChB,EAAE,UAAU,WAAW,IAAI,IAAI;AAGvC,OAAI,MAAM,KAAK,WAAW,EAAE,SAAS,GAAG,CAAC;GACzC,IAAI,QAAQ,aAAa,EAAE;AAC3B,OAAG,QAAQ,EACT,KAAI,MAAM,KAAK,WAAW,OAAO,aAAa,EAAE,EAAE,MAAM,GAAG;AAS7D,UAAO;IAAC,eALY,UAAU,QAAQ,GAAG,OAAO;IAKV,KAF5B,IAAI,SAAS,GAAG,UAAU;IAEW;;;;;;;;;;;;AAajD,MAAI,UAAU,SAAS,YAAY,eAAe,WAAW;GAE3D,IAAI,IAAI,WAAW,QAAQ,eAAe,OAAO;AACjD,UAAO,IAAI,SAAS,GAAG,UAAU;;AAGnC,SAAO;;;;;;;;;;;AAcT,OAAM,IAAI,OAAO,SAAS,IAAI,cAAc;AAC1C,aAAW,MAAM,IAAI,GAAG,gBAAgB,GAAG,aAAa;;;;;;;;;;;AAY1D,OAAM,IAAI,OAAO,SAAS,IAAI,cAAc;AAC1C,aAAW,MAAM,IAAI,GAAG,gBAAgB,GAAG,aAAa;;;;;;;;;;;CAY1D,SAAS,WAAW,KAAK,IAAI,cAAc,cAAc;;;;;;;;;AASvD,MAAI,WAAW,SAAS,GAAG,QAAQ;GACjC,IAAI,MAAM,IAAI,MAAM,KAAK,YAAY;GAGrC,IAAI,IAAI,KAAK,KAAK,SAAS,aAAa,GAAG;GAE3C,IAAI,IAAI,IAAI,MAAM,KAAK,YAAY;AACnC,QAAI,IAAI,IAAI,cAAc,IAAI,GAAG,EAAE,GAAG;AAEpC,MAAE,SAAS,EAAE;AAGb,OAAG,OAAO;AACV,OAAG,OAAO,IAAI,EAAE,UAAU,CAAC;IAC3B,IAAI,OAAO,GAAG,QAAQ;AACtB,QAAI,SAAS,KAAK,SAAS,aAAa,CAAC;;AAI3C,OAAI,SAAS,IAAI,QAAQ,GAAG,OAAO;AACnC,UAAO,IAAI,UAAU"}

package/dist/cjs/node_modules/node-forge/lib/log.cjs

@@ -0,0 +1,248 @@
+const require_rolldown_runtime = require('../../../_virtual/rolldown_runtime.cjs');
+const require_forge$1 = require('./forge.cjs');
+const require_util$1 = require('./util.cjs');
+
+//#region ../../node_modules/node-forge/lib/log.js
+var require_log = /* @__PURE__ */ require_rolldown_runtime.__commonJS({ "../../node_modules/node-forge/lib/log.js": ((exports, module) => {
+	/**
+	* Cross-browser support for logging in a web application.
+	*
+	* @author David I. Lehn <dlehn@digitalbazaar.com>
+	*
+	* Copyright (c) 2008-2013 Digital Bazaar, Inc.
+	*/
+	var forge = require_forge$1.default;
+	require_util$1.default;
+	module.exports = forge.log = forge.log || {};
+	/**
+	* Application logging system.
+	*
+	* Each logger level available as it's own function of the form:
+	*   forge.log.level(category, args...)
+	* The category is an arbitrary string, and the args are the same as
+	* Firebug's console.log API. By default the call will be output as:
+	*   'LEVEL [category] <args[0]>, args[1], ...'
+	* This enables proper % formatting via the first argument.
+	* Each category is enabled by default but can be enabled or disabled with
+	* the setCategoryEnabled() function.
+	*/
+	forge.log.levels = [
+		"none",
+		"error",
+		"warning",
+		"info",
+		"debug",
+		"verbose",
+		"max"
+	];
+	var sLevelInfo = {};
+	var sLoggers = [];
+	/**
+	* Standard console logger. If no console support is enabled this will
+	* remain null. Check before using.
+	*/
+	var sConsoleLogger = null;
+	/**
+	* Lock the level at the current value. Used in cases where user config may
+	* set the level such that only critical messages are seen but more verbose
+	* messages are needed for debugging or other purposes.
+	*/
+	forge.log.LEVEL_LOCKED = 2;
+	/**
+	* Always call log function. By default, the logging system will check the
+	* message level against logger.level before calling the log function. This
+	* flag allows the function to do its own check.
+	*/
+	forge.log.NO_LEVEL_CHECK = 4;
+	/**
+	* Perform message interpolation with the passed arguments. "%" style
+	* fields in log messages will be replaced by arguments as needed. Some
+	* loggers, such as Firebug, may do this automatically. The original log
+	* message will be available as 'message' and the interpolated version will
+	* be available as 'fullMessage'.
+	*/
+	forge.log.INTERPOLATE = 8;
+	for (var i = 0; i < forge.log.levels.length; ++i) {
+		var level = forge.log.levels[i];
+		sLevelInfo[level] = {
+			index: i,
+			name: level.toUpperCase()
+		};
+	}
+	/**
+	* Message logger. Will dispatch a message to registered loggers as needed.
+	*
+	* @param message message object
+	*/
+	forge.log.logMessage = function(message) {
+		var messageLevelIndex = sLevelInfo[message.level].index;
+		for (var i$1 = 0; i$1 < sLoggers.length; ++i$1) {
+			var logger$1 = sLoggers[i$1];
+			if (logger$1.flags & forge.log.NO_LEVEL_CHECK) logger$1.f(message);
+			else if (messageLevelIndex <= sLevelInfo[logger$1.level].index) logger$1.f(logger$1, message);
+		}
+	};
+	/**
+	* Sets the 'standard' key on a message object to:
+	* "LEVEL [category] " + message
+	*
+	* @param message a message log object
+	*/
+	forge.log.prepareStandard = function(message) {
+		if (!("standard" in message)) message.standard = sLevelInfo[message.level].name + " [" + message.category + "] " + message.message;
+	};
+	/**
+	* Sets the 'full' key on a message object to the original message
+	* interpolated via % formatting with the message arguments.
+	*
+	* @param message a message log object.
+	*/
+	forge.log.prepareFull = function(message) {
+		if (!("full" in message)) {
+			var args = [message.message];
+			args = args.concat([]);
+			message.full = forge.util.format.apply(this, args);
+		}
+	};
+	/**
+	* Applies both preparseStandard() and prepareFull() to a message object and
+	* store result in 'standardFull'.
+	*
+	* @param message a message log object.
+	*/
+	forge.log.prepareStandardFull = function(message) {
+		if (!("standardFull" in message)) {
+			forge.log.prepareStandard(message);
+			message.standardFull = message.standard;
+		}
+	};
+	var levels = [
+		"error",
+		"warning",
+		"info",
+		"debug",
+		"verbose"
+	];
+	for (var i = 0; i < levels.length; ++i) (function(level$1) {
+		forge.log[level$1] = function(category, message) {
+			var args = Array.prototype.slice.call(arguments).slice(2);
+			var msg = {
+				timestamp: /* @__PURE__ */ new Date(),
+				level: level$1,
+				category,
+				message,
+				"arguments": args
+			};
+			forge.log.logMessage(msg);
+		};
+	})(levels[i]);
+	/**
+	* Creates a new logger with specified custom logging function.
+	*
+	* The logging function has a signature of:
+	*   function(logger, message)
+	* logger: current logger
+	* message: object:
+	*   level: level id
+	*   category: category
+	*   message: string message
+	*   arguments: Array of extra arguments
+	*   fullMessage: interpolated message and arguments if INTERPOLATE flag set
+	*
+	* @param logFunction a logging function which takes a log message object
+	*          as a parameter.
+	*
+	* @return a logger object.
+	*/
+	forge.log.makeLogger = function(logFunction) {
+		var logger$1 = {
+			flags: 0,
+			f: logFunction
+		};
+		forge.log.setLevel(logger$1, "none");
+		return logger$1;
+	};
+	/**
+	* Sets the current log level on a logger.
+	*
+	* @param logger the target logger.
+	* @param level the new maximum log level as a string.
+	*
+	* @return true if set, false if not.
+	*/
+	forge.log.setLevel = function(logger$1, level$1) {
+		var rval = false;
+		if (logger$1 && !(logger$1.flags & forge.log.LEVEL_LOCKED)) {
+			for (var i$1 = 0; i$1 < forge.log.levels.length; ++i$1) if (level$1 == forge.log.levels[i$1]) {
+				logger$1.level = level$1;
+				rval = true;
+				break;
+			}
+		}
+		return rval;
+	};
+	/**
+	* Locks the log level at its current value.
+	*
+	* @param logger the target logger.
+	* @param lock boolean lock value, default to true.
+	*/
+	forge.log.lock = function(logger$1, lock) {
+		if (typeof lock === "undefined" || lock) logger$1.flags |= forge.log.LEVEL_LOCKED;
+		else logger$1.flags &= ~forge.log.LEVEL_LOCKED;
+	};
+	/**
+	* Adds a logger.
+	*
+	* @param logger the logger object.
+	*/
+	forge.log.addLogger = function(logger$1) {
+		sLoggers.push(logger$1);
+	};
+	if (typeof console !== "undefined" && "log" in console) {
+		var logger;
+		if (console.error && console.warn && console.info && console.debug) {
+			var levelHandlers = {
+				error: console.error,
+				warning: console.warn,
+				info: console.info,
+				debug: console.debug,
+				verbose: console.debug
+			};
+			var f = function(logger$1, message) {
+				forge.log.prepareStandard(message);
+				var handler = levelHandlers[message.level];
+				var args = [message.standard];
+				args = args.concat(message["arguments"].slice());
+				handler.apply(console, args);
+			};
+			logger = forge.log.makeLogger(f);
+		} else {
+			var f = function(logger$1, message) {
+				forge.log.prepareStandardFull(message);
+				console.log(message.standardFull);
+			};
+			logger = forge.log.makeLogger(f);
+		}
+		forge.log.setLevel(logger, "debug");
+		forge.log.addLogger(logger);
+		sConsoleLogger = logger;
+	} else console = { log: function() {} };
+	if (sConsoleLogger !== null && typeof window !== "undefined" && window.location) {
+		var query = new URL(window.location.href).searchParams;
+		if (query.has("console.level")) forge.log.setLevel(sConsoleLogger, query.get("console.level").slice(-1)[0]);
+		if (query.has("console.lock")) {
+			if (query.get("console.lock").slice(-1)[0] == "true") forge.log.lock(sConsoleLogger);
+		}
+	}
+	forge.log.consoleLogger = sConsoleLogger;
+}) });
+
+//#endregion
+Object.defineProperty(exports, 'default', {
+  enumerable: true,
+  get: function () {
+    return require_log();
+  }
+});
+//# sourceMappingURL=log.cjs.map

package/dist/cjs/node_modules/node-forge/lib/log.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"log.cjs","names":["i","logger","level"],"sources":["../../../../../../../node_modules/node-forge/lib/log.js"],"sourcesContent":["/**\n * Cross-browser support for logging in a web application.\n *\n * @author David I. Lehn <dlehn@digitalbazaar.com>\n *\n * Copyright (c) 2008-2013 Digital Bazaar, Inc.\n */\nvar forge = require('./forge');\nrequire('./util');\n\n/* LOG API */\nmodule.exports = forge.log = forge.log || {};\n\n/**\n * Application logging system.\n *\n * Each logger level available as it's own function of the form:\n *   forge.log.level(category, args...)\n * The category is an arbitrary string, and the args are the same as\n * Firebug's console.log API. By default the call will be output as:\n *   'LEVEL [category] <args[0]>, args[1], ...'\n * This enables proper % formatting via the first argument.\n * Each category is enabled by default but can be enabled or disabled with\n * the setCategoryEnabled() function.\n */\n// list of known levels\nforge.log.levels = [\n  'none', 'error', 'warning', 'info', 'debug', 'verbose', 'max'];\n// info on the levels indexed by name:\n//   index: level index\n//   name: uppercased display name\nvar sLevelInfo = {};\n// list of loggers\nvar sLoggers = [];\n/**\n * Standard console logger. If no console support is enabled this will\n * remain null. Check before using.\n */\nvar sConsoleLogger = null;\n\n// logger flags\n/**\n * Lock the level at the current value. Used in cases where user config may\n * set the level such that only critical messages are seen but more verbose\n * messages are needed for debugging or other purposes.\n */\nforge.log.LEVEL_LOCKED = (1 << 1);\n/**\n * Always call log function. By default, the logging system will check the\n * message level against logger.level before calling the log function. This\n * flag allows the function to do its own check.\n */\nforge.log.NO_LEVEL_CHECK = (1 << 2);\n/**\n * Perform message interpolation with the passed arguments. \"%\" style\n * fields in log messages will be replaced by arguments as needed. Some\n * loggers, such as Firebug, may do this automatically. The original log\n * message will be available as 'message' and the interpolated version will\n * be available as 'fullMessage'.\n */\nforge.log.INTERPOLATE = (1 << 3);\n\n// setup each log level\nfor(var i = 0; i < forge.log.levels.length; ++i) {\n  var level = forge.log.levels[i];\n  sLevelInfo[level] = {\n    index: i,\n    name: level.toUpperCase()\n  };\n}\n\n/**\n * Message logger. Will dispatch a message to registered loggers as needed.\n *\n * @param message message object\n */\nforge.log.logMessage = function(message) {\n  var messageLevelIndex = sLevelInfo[message.level].index;\n  for(var i = 0; i < sLoggers.length; ++i) {\n    var logger = sLoggers[i];\n    if(logger.flags & forge.log.NO_LEVEL_CHECK) {\n      logger.f(message);\n    } else {\n      // get logger level\n      var loggerLevelIndex = sLevelInfo[logger.level].index;\n      // check level\n      if(messageLevelIndex <= loggerLevelIndex) {\n        // message critical enough, call logger\n        logger.f(logger, message);\n      }\n    }\n  }\n};\n\n/**\n * Sets the 'standard' key on a message object to:\n * \"LEVEL [category] \" + message\n *\n * @param message a message log object\n */\nforge.log.prepareStandard = function(message) {\n  if(!('standard' in message)) {\n    message.standard =\n      sLevelInfo[message.level].name +\n      //' ' + +message.timestamp +\n      ' [' + message.category + '] ' +\n      message.message;\n  }\n};\n\n/**\n * Sets the 'full' key on a message object to the original message\n * interpolated via % formatting with the message arguments.\n *\n * @param message a message log object.\n */\nforge.log.prepareFull = function(message) {\n  if(!('full' in message)) {\n    // copy args and insert message at the front\n    var args = [message.message];\n    args = args.concat([] || message['arguments']);\n    // format the message\n    message.full = forge.util.format.apply(this, args);\n  }\n};\n\n/**\n * Applies both preparseStandard() and prepareFull() to a message object and\n * store result in 'standardFull'.\n *\n * @param message a message log object.\n */\nforge.log.prepareStandardFull = function(message) {\n  if(!('standardFull' in message)) {\n    // FIXME implement 'standardFull' logging\n    forge.log.prepareStandard(message);\n    message.standardFull = message.standard;\n  }\n};\n\n// create log level functions\nif(true) {\n  // levels for which we want functions\n  var levels = ['error', 'warning', 'info', 'debug', 'verbose'];\n  for(var i = 0; i < levels.length; ++i) {\n    // wrap in a function to ensure proper level var is passed\n    (function(level) {\n      // create function for this level\n      forge.log[level] = function(category, message/*, args...*/) {\n        // convert arguments to real array, remove category and message\n        var args = Array.prototype.slice.call(arguments).slice(2);\n        // create message object\n        // Note: interpolation and standard formatting is done lazily\n        var msg = {\n          timestamp: new Date(),\n          level: level,\n          category: category,\n          message: message,\n          'arguments': args\n          /*standard*/\n          /*full*/\n          /*fullMessage*/\n        };\n        // process this message\n        forge.log.logMessage(msg);\n      };\n    })(levels[i]);\n  }\n}\n\n/**\n * Creates a new logger with specified custom logging function.\n *\n * The logging function has a signature of:\n *   function(logger, message)\n * logger: current logger\n * message: object:\n *   level: level id\n *   category: category\n *   message: string message\n *   arguments: Array of extra arguments\n *   fullMessage: interpolated message and arguments if INTERPOLATE flag set\n *\n * @param logFunction a logging function which takes a log message object\n *          as a parameter.\n *\n * @return a logger object.\n */\nforge.log.makeLogger = function(logFunction) {\n  var logger = {\n    flags: 0,\n    f: logFunction\n  };\n  forge.log.setLevel(logger, 'none');\n  return logger;\n};\n\n/**\n * Sets the current log level on a logger.\n *\n * @param logger the target logger.\n * @param level the new maximum log level as a string.\n *\n * @return true if set, false if not.\n */\nforge.log.setLevel = function(logger, level) {\n  var rval = false;\n  if(logger && !(logger.flags & forge.log.LEVEL_LOCKED)) {\n    for(var i = 0; i < forge.log.levels.length; ++i) {\n      var aValidLevel = forge.log.levels[i];\n      if(level == aValidLevel) {\n        // set level\n        logger.level = level;\n        rval = true;\n        break;\n      }\n    }\n  }\n\n  return rval;\n};\n\n/**\n * Locks the log level at its current value.\n *\n * @param logger the target logger.\n * @param lock boolean lock value, default to true.\n */\nforge.log.lock = function(logger, lock) {\n  if(typeof lock === 'undefined' || lock) {\n    logger.flags |= forge.log.LEVEL_LOCKED;\n  } else {\n    logger.flags &= ~forge.log.LEVEL_LOCKED;\n  }\n};\n\n/**\n * Adds a logger.\n *\n * @param logger the logger object.\n */\nforge.log.addLogger = function(logger) {\n  sLoggers.push(logger);\n};\n\n// setup the console logger if possible, else create fake console.log\nif(typeof(console) !== 'undefined' && 'log' in console) {\n  var logger;\n  if(console.error && console.warn && console.info && console.debug) {\n    // looks like Firebug-style logging is available\n    // level handlers map\n    var levelHandlers = {\n      error: console.error,\n      warning: console.warn,\n      info: console.info,\n      debug: console.debug,\n      verbose: console.debug\n    };\n    var f = function(logger, message) {\n      forge.log.prepareStandard(message);\n      var handler = levelHandlers[message.level];\n      // prepend standard message and concat args\n      var args = [message.standard];\n      args = args.concat(message['arguments'].slice());\n      // apply to low-level console function\n      handler.apply(console, args);\n    };\n    logger = forge.log.makeLogger(f);\n  } else {\n    // only appear to have basic console.log\n    var f = function(logger, message) {\n      forge.log.prepareStandardFull(message);\n      console.log(message.standardFull);\n    };\n    logger = forge.log.makeLogger(f);\n  }\n  forge.log.setLevel(logger, 'debug');\n  forge.log.addLogger(logger);\n  sConsoleLogger = logger;\n} else {\n  // define fake console.log to avoid potential script errors on\n  // browsers that do not have console logging\n  console = {\n    log: function() {}\n  };\n}\n\n/*\n * Check for logging control query vars in current URL.\n *\n * console.level=<level-name>\n * Set's the console log level by name.  Useful to override defaults and\n * allow more verbose logging before a user config is loaded.\n *\n * console.lock=<true|false>\n * Lock the console log level at whatever level it is set at.  This is run\n * after console.level is processed.  Useful to force a level of verbosity\n * that could otherwise be limited by a user config.\n */\nif(sConsoleLogger !== null &&\n  typeof window !== 'undefined' && window.location\n) {\n  var query = new URL(window.location.href).searchParams;\n  if(query.has('console.level')) {\n    // set with last value\n    forge.log.setLevel(\n      sConsoleLogger, query.get('console.level').slice(-1)[0]);\n  }\n  if(query.has('console.lock')) {\n    // set with last value\n    var lock = query.get('console.lock').slice(-1)[0];\n    if(lock == 'true') {\n      forge.log.lock(sConsoleLogger);\n    }\n  }\n}\n\n// provide public access to console logger\nforge.log.consoleLogger = sConsoleLogger;\n"],"x_google_ignoreList":[0],"mappings":";;;;;;;;;;;;;CAOA,IAAI;AACJ;AAGA,QAAO,UAAU,MAAM,MAAM,MAAM,OAAO,EAAE;;;;;;;;;;;;;AAe5C,OAAM,IAAI,SAAS;EACjB;EAAQ;EAAS;EAAW;EAAQ;EAAS;EAAW;EAAM;CAIhE,IAAI,aAAa,EAAE;CAEnB,IAAI,WAAW,EAAE;;;;;CAKjB,IAAI,iBAAiB;;;;;;AAQrB,OAAM,IAAI,eAAgB;;;;;;AAM1B,OAAM,IAAI,iBAAkB;;;;;;;;AAQ5B,OAAM,IAAI,cAAe;AAGzB,MAAI,IAAI,IAAI,GAAG,IAAI,MAAM,IAAI,OAAO,QAAQ,EAAE,GAAG;EAC/C,IAAI,QAAQ,MAAM,IAAI,OAAO;AAC7B,aAAW,SAAS;GAClB,OAAO;GACP,MAAM,MAAM,aAAa;GAC1B;;;;;;;AAQH,OAAM,IAAI,aAAa,SAAS,SAAS;EACvC,IAAI,oBAAoB,WAAW,QAAQ,OAAO;AAClD,OAAI,IAAIA,MAAI,GAAGA,MAAI,SAAS,QAAQ,EAAEA,KAAG;GACvC,IAAIC,WAAS,SAASD;AACtB,OAAGC,SAAO,QAAQ,MAAM,IAAI,eAC1B,UAAO,EAAE,QAAQ;YAKd,qBAFoB,WAAWA,SAAO,OAAO,MAI9C,UAAO,EAAEA,UAAQ,QAAQ;;;;;;;;;AAYjC,OAAM,IAAI,kBAAkB,SAAS,SAAS;AAC5C,MAAG,EAAE,cAAc,SACjB,SAAQ,WACN,WAAW,QAAQ,OAAO,OAE1B,OAAO,QAAQ,WAAW,OAC1B,QAAQ;;;;;;;;AAUd,OAAM,IAAI,cAAc,SAAS,SAAS;AACxC,MAAG,EAAE,UAAU,UAAU;GAEvB,IAAI,OAAO,CAAC,QAAQ,QAAQ;AAC5B,UAAO,KAAK,OAAO,EAAE,CAAyB;AAE9C,WAAQ,OAAO,MAAM,KAAK,OAAO,MAAM,MAAM,KAAK;;;;;;;;;AAUtD,OAAM,IAAI,sBAAsB,SAAS,SAAS;AAChD,MAAG,EAAE,kBAAkB,UAAU;AAE/B,SAAM,IAAI,gBAAgB,QAAQ;AAClC,WAAQ,eAAe,QAAQ;;;CAOjC,IAAI,SAAS;EAAC;EAAS;EAAW;EAAQ;EAAS;EAAU;AAC7D,MAAI,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,EAAE,EAElC,EAAC,SAAS,SAAO;AAEf,QAAM,IAAIC,WAAS,SAAS,UAAU,SAAsB;GAE1D,IAAI,OAAO,MAAM,UAAU,MAAM,KAAK,UAAU,CAAC,MAAM,EAAE;GAGzD,IAAI,MAAM;IACR,2BAAW,IAAI,MAAM;IACrB,OAAOA;IACG;IACD;IACT,aAAa;IAId;AAED,SAAM,IAAI,WAAW,IAAI;;IAE1B,OAAO,GAAG;;;;;;;;;;;;;;;;;;;AAsBjB,OAAM,IAAI,aAAa,SAAS,aAAa;EAC3C,IAAID,WAAS;GACX,OAAO;GACP,GAAG;GACJ;AACD,QAAM,IAAI,SAASA,UAAQ,OAAO;AAClC,SAAOA;;;;;;;;;;AAWT,OAAM,IAAI,WAAW,SAAS,UAAQ,SAAO;EAC3C,IAAI,OAAO;AACX,MAAGA,YAAU,EAAEA,SAAO,QAAQ,MAAM,IAAI,eACtC;QAAI,IAAID,MAAI,GAAGA,MAAI,MAAM,IAAI,OAAO,QAAQ,EAAEA,IAE5C,KAAGE,WADe,MAAM,IAAI,OAAOF,MACV;AAEvB,aAAO,QAAQE;AACf,WAAO;AACP;;;AAKN,SAAO;;;;;;;;AAST,OAAM,IAAI,OAAO,SAAS,UAAQ,MAAM;AACtC,MAAG,OAAO,SAAS,eAAe,KAChC,UAAO,SAAS,MAAM,IAAI;MAE1B,UAAO,SAAS,CAAC,MAAM,IAAI;;;;;;;AAS/B,OAAM,IAAI,YAAY,SAAS,UAAQ;AACrC,WAAS,KAAKD,SAAO;;AAIvB,KAAG,OAAO,YAAa,eAAe,SAAS,SAAS;EACtD,IAAI;AACJ,MAAG,QAAQ,SAAS,QAAQ,QAAQ,QAAQ,QAAQ,QAAQ,OAAO;GAGjE,IAAI,gBAAgB;IAClB,OAAO,QAAQ;IACf,SAAS,QAAQ;IACjB,MAAM,QAAQ;IACd,OAAO,QAAQ;IACf,SAAS,QAAQ;IAClB;GACD,IAAI,IAAI,SAAS,UAAQ,SAAS;AAChC,UAAM,IAAI,gBAAgB,QAAQ;IAClC,IAAI,UAAU,cAAc,QAAQ;IAEpC,IAAI,OAAO,CAAC,QAAQ,SAAS;AAC7B,WAAO,KAAK,OAAO,QAAQ,aAAa,OAAO,CAAC;AAEhD,YAAQ,MAAM,SAAS,KAAK;;AAE9B,YAAS,MAAM,IAAI,WAAW,EAAE;SAC3B;GAEL,IAAI,IAAI,SAAS,UAAQ,SAAS;AAChC,UAAM,IAAI,oBAAoB,QAAQ;AACtC,YAAQ,IAAI,QAAQ,aAAa;;AAEnC,YAAS,MAAM,IAAI,WAAW,EAAE;;AAElC,QAAM,IAAI,SAAS,QAAQ,QAAQ;AACnC,QAAM,IAAI,UAAU,OAAO;AAC3B,mBAAiB;OAIjB,WAAU,EACR,KAAK,WAAW,IACjB;AAeH,KAAG,mBAAmB,QACpB,OAAO,WAAW,eAAe,OAAO,UACxC;EACA,IAAI,QAAQ,IAAI,IAAI,OAAO,SAAS,KAAK,CAAC;AAC1C,MAAG,MAAM,IAAI,gBAAgB,CAE3B,OAAM,IAAI,SACR,gBAAgB,MAAM,IAAI,gBAAgB,CAAC,MAAM,GAAG,CAAC,GAAG;AAE5D,MAAG,MAAM,IAAI,eAAe,EAG1B;OADW,MAAM,IAAI,eAAe,CAAC,MAAM,GAAG,CAAC,MACpC,OACT,OAAM,IAAI,KAAK,eAAe;;;AAMpC,OAAM,IAAI,gBAAgB"}

package/dist/cjs/node_modules/node-forge/lib/md.all.cjs

@@ -0,0 +1,31 @@
+const require_rolldown_runtime = require('../../../_virtual/rolldown_runtime.cjs');
+const require_md$1 = require('./md.cjs');
+const require_md5$1 = require('./md5.cjs');
+const require_sha256$1 = require('./sha256.cjs');
+const require_sha1$1 = require('./sha1.cjs');
+const require_sha512$1 = require('./sha512.cjs');
+
+//#region ../../node_modules/node-forge/lib/md.all.js
+var require_md_all = /* @__PURE__ */ require_rolldown_runtime.__commonJS({ "../../node_modules/node-forge/lib/md.all.js": ((exports, module) => {
+	/**
+	* Node.js module for all known Forge message digests.
+	*
+	* @author Dave Longley
+	*
+	* Copyright 2011-2017 Digital Bazaar, Inc.
+	*/
+	module.exports = require_md$1.default;
+	require_md5$1.default;
+	require_sha1$1.default;
+	require_sha256$1.default;
+	require_sha512$1.default;
+}) });
+
+//#endregion
+Object.defineProperty(exports, 'default', {
+  enumerable: true,
+  get: function () {
+    return require_md_all();
+  }
+});
+//# sourceMappingURL=md.all.cjs.map

package/dist/cjs/node_modules/node-forge/lib/md.all.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"md.all.cjs","names":[],"sources":["../../../../../../../node_modules/node-forge/lib/md.all.js"],"sourcesContent":["/**\n * Node.js module for all known Forge message digests.\n *\n * @author Dave Longley\n *\n * Copyright 2011-2017 Digital Bazaar, Inc.\n */\nmodule.exports = require('./md');\n\nrequire('./md5');\nrequire('./sha1');\nrequire('./sha256');\nrequire('./sha512');\n"],"x_google_ignoreList":[0],"mappings":";;;;;;;;;;;;;;;;AAOA,QAAO;AAEP;AACA;AACA;AACA"}