text: ["^ ","~:resource-id",["~:shadow.build.npm/resource","node_modules/seedrandom/seedrandom.js"],"~:js","shadow$provide[551]=function(c,b,y,a){(function(q,f,u){function k(z,w,B){var x=[];w=1==w?{entropy:!0}:w||{};z=d(g(w.entropy?[z,h(f)]:null==z?l():z,3),x);var D=new t(x);x=function(){for(var F=D.g(6),E=n,G=0;F<r;)F=256*(F+G),E*=256,G=D.g(1);for(;F>=v;)F/=2,E/=2,G>>>=1;return(F+G)/E};x.int32=function(){return D.g(4)|0};x.quick=function(){return D.g(4)/4294967296};x.double=x;d(h(D.S),f);return(w.pass||B||function(F,E,G,I){I&&(I.S&&p(I,D),F.state=function(){return p(D,{})});return G?(u.random=F,E):F})(x,\nz,\"global\"in w?w.global:this==u,w.state)}function t(z){var w,B=z.length,x=this,D=0,F=x.i=x.j=0,E=x.S=[];for(B||(z=[B++]);256>D;)E[D]=D++;for(D=0;256>D;D++)E[D]=E[F=255&F+z[D%B]+(w=E[D])],E[F]=w;(x.g=function(G){for(var I,L=0,M=x.i,S=x.j,P=x.S;G--;)I=P[M=255&M+1],L=256*L+P[255&(P[M]=P[S=255&S+I])+(P[S]=I)];x.i=M;x.j=S;return L})(256)}function p(z,w){w.i=z.i;w.j=z.j;w.S=z.S.slice();return w}function g(z,w){var B=[],x=typeof z,D;if(w&&\"object\"==x)for(D in z)try{B.push(g(z[D],w-1))}catch(F){}return B.length?\nB:\"string\"==x?z:z+\"\\x00\"}function d(z,w){z+=\"\";for(var B,x=0;x<z.length;)w[255&x]=255&(B^=19*w[255&x])+z.charCodeAt(x++);return h(w)}function l(){try{var z;C&&(z=C.randomBytes)?z=z(256):(z=new Uint8Array(256),(q.crypto||q.msCrypto).getRandomValues(z));return h(z)}catch(w){return z=q.navigator,[+new Date,q,z&&z.plugins,q.screen,h(f)]}}function h(z){return String.fromCharCode.apply(0,z)}var n=u.pow(256,6),r=u.pow(2,52),v=2*r;d(u.random(),f);if(\"object\"==typeof y&&y.exports){y.exports=k;try{var C=b(550)}catch(z){}}else\"function\"==\ntypeof define&&define.amd?define(function(){return k}):u.seedrandom=k})(\"undefined\"!==typeof self?self:this,[],Math)}","~:source","shadow$provide[551] = function(global,require,module,exports) {\n/*\nCopyright 2019 David Bau.\n\nPermission is hereby granted, free of charge, to any person obtaining\na copy of this software and associated documentation files (the\n\"Software\"), to deal in the Software without restriction, including\nwithout limitation the rights to use, copy, modify, merge, publish,\ndistribute, sublicense, and/or sell copies of the Software, and to\npermit persons to whom the Software is furnished to do so, subject to\nthe following conditions:\n\nThe above copyright notice and this permission notice shall be\nincluded in all copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\nIN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\nCLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\nTORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\nSOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n*/\n\n(function (global, pool, math) {\n//\n// The following constants are related to IEEE 754 limits.\n//\n\nvar width = 256,        // each RC4 output is 0 <= x < 256\n    chunks = 6,         // at least six RC4 outputs for each double\n    digits = 52,        // there are 52 significant digits in a double\n    rngname = 'random', // rngname: name for Math.random and Math.seedrandom\n    startdenom = math.pow(width, chunks),\n    significance = math.pow(2, digits),\n    overflow = significance * 2,\n    mask = width - 1,\n    nodecrypto;         // node.js crypto module, initialized at the bottom.\n\n//\n// seedrandom()\n// This is the seedrandom function described above.\n//\nfunction seedrandom(seed, options, callback) {\n  var key = [];\n  options = (options == true) ? { entropy: true } : (options || {});\n\n  // Flatten the seed string or build one from local entropy if needed.\n  var shortseed = mixkey(flatten(\n    options.entropy ? [seed, tostring(pool)] :\n    (seed == null) ? autoseed() : seed, 3), key);\n\n  // Use the seed to initialize an ARC4 generator.\n  var arc4 = new ARC4(key);\n\n  // This function returns a random double in [0, 1) that contains\n  // randomness in every bit of the mantissa of the IEEE 754 value.\n  var prng = function() {\n    var n = arc4.g(chunks),             // Start with a numerator n < 2 ^ 48\n        d = startdenom,                 //   and denominator d = 2 ^ 48.\n        x = 0;                          //   and no 'extra last byte'.\n    while (n < significance) {          // Fill up all significant digits by\n      n = (n + x) * width;              //   shifting numerator and\n      d *= width;                       //   denominator and generating a\n      x = arc4.g(1);                    //   new least-significant-byte.\n    }\n    while (n >= overflow) {             // To avoid rounding up, before adding\n      n /= 2;                           //   last byte, shift everything\n      d /= 2;                           //   right using integer math until\n      x >>>= 1;                         //   we have exactly the desired bits.\n    }\n    return (n + x) / d;                 // Form the number within [0, 1).\n  };\n\n  prng.int32 = function() { return arc4.g(4) | 0; }\n  prng.quick = function() { return arc4.g(4) / 0x100000000; }\n  prng.double = prng;\n\n  // Mix the randomness into accumulated entropy.\n  mixkey(tostring(arc4.S), pool);\n\n  // Calling convention: what to return as a function of prng, seed, is_math.\n  return (options.pass || callback ||\n      function(prng, seed, is_math_call, state) {\n        if (state) {\n          // Load the arc4 state from the given state if it has an S array.\n          if (state.S) { copy(state, arc4); }\n          // Only provide the .state method if requested via options.state.\n          prng.state = function() { return copy(arc4, {}); }\n        }\n\n        // If called as a method of Math (Math.seedrandom()), mutate\n        // Math.random because that is how seedrandom.js has worked since v1.0.\n        if (is_math_call) { math[rngname] = prng; return seed; }\n\n        // Otherwise, it is a newer calling convention, so return the\n        // prng directly.\n        else return prng;\n      })(\n  prng,\n  shortseed,\n  'global' in options ? options.global : (this == math),\n  options.state);\n}\n\n//\n// ARC4\n//\n// An ARC4 implementation.  The constructor takes a key in the form of\n// an array of at most (width) integers that should be 0 <= x < (width).\n//\n// The g(count) method returns a pseudorandom integer that concatenates\n// the next (count) outputs from ARC4.  Its return value is a number x\n// that is in the range 0 <= x < (width ^ count).\n//\nfunction ARC4(key) {\n  var t, keylen = key.length,\n      me = this, i = 0, j = me.i = me.j = 0, s = me.S = [];\n\n  // The empty key [] is treated as [0].\n  if (!keylen) { key = [keylen++]; }\n\n  // Set up S using the standard key scheduling algorithm.\n  while (i < width) {\n    s[i] = i++;\n  }\n  for (i = 0; i < width; i++) {\n    s[i] = s[j = mask & (j + key[i % keylen] + (t = s[i]))];\n    s[j] = t;\n  }\n\n  // The \"g\" method returns the next (count) outputs as one number.\n  (me.g = function(count) {\n    // Using instance members instead of closure state nearly doubles speed.\n    var t, r = 0,\n        i = me.i, j = me.j, s = me.S;\n    while (count--) {\n      t = s[i = mask & (i + 1)];\n      r = r * width + s[mask & ((s[i] = s[j = mask & (j + t)]) + (s[j] = t))];\n    }\n    me.i = i; me.j = j;\n    return r;\n    // For robust unpredictability, the function call below automatically\n    // discards an initial batch of values.  This is called RC4-drop[256].\n    // See http://google.com/search?q=rsa+fluhrer+response&btnI\n  })(width);\n}\n\n//\n// copy()\n// Copies internal state of ARC4 to or from a plain object.\n//\nfunction copy(f, t) {\n  t.i = f.i;\n  t.j = f.j;\n  t.S = f.S.slice();\n  return t;\n};\n\n//\n// flatten()\n// Converts an object tree to nested arrays of strings.\n//\nfunction flatten(obj, depth) {\n  var result = [], typ = (typeof obj), prop;\n  if (depth && typ == 'object') {\n    for (prop in obj) {\n      try { result.push(flatten(obj[prop], depth - 1)); } catch (e) {}\n    }\n  }\n  return (result.length ? result : typ == 'string' ? obj : obj + '\\0');\n}\n\n//\n// mixkey()\n// Mixes a string seed into a key that is an array of integers, and\n// returns a shortened string seed that is equivalent to the result key.\n//\nfunction mixkey(seed, key) {\n  var stringseed = seed + '', smear, j = 0;\n  while (j < stringseed.length) {\n    key[mask & j] =\n      mask & ((smear ^= key[mask & j] * 19) + stringseed.charCodeAt(j++));\n  }\n  return tostring(key);\n}\n\n//\n// autoseed()\n// Returns an object for autoseeding, using window.crypto and Node crypto\n// module if available.\n//\nfunction autoseed() {\n  try {\n    var out;\n    if (nodecrypto && (out = nodecrypto.randomBytes)) {\n      // The use of 'out' to remember randomBytes makes tight minified code.\n      out = out(width);\n    } else {\n      out = new Uint8Array(width);\n      (global.crypto || global.msCrypto).getRandomValues(out);\n    }\n    return tostring(out);\n  } catch (e) {\n    var browser = global.navigator,\n        plugins = browser && browser.plugins;\n    return [+new Date, global, plugins, global.screen, tostring(pool)];\n  }\n}\n\n//\n// tostring()\n// Converts an array of charcodes to a string\n//\nfunction tostring(a) {\n  return String.fromCharCode.apply(0, a);\n}\n\n//\n// When seedrandom.js is loaded, we immediately mix a few bits\n// from the built-in RNG into the entropy pool.  Because we do\n// not want to interfere with deterministic PRNG state later,\n// seedrandom will not call math.random on its own again after\n// initialization.\n//\nmixkey(math.random(), pool);\n\n//\n// Nodejs and AMD support: export the implementation as a module using\n// either convention.\n//\nif ((typeof module) == 'object' && module.exports) {\n  module.exports = seedrandom;\n  // When in node.js, try using crypto package for autoseeding.\n  try {\n    nodecrypto = require('crypto');\n  } catch (ex) {}\n} else if ((typeof define) == 'function' && define.amd) {\n  define(function() { return seedrandom; });\n} else {\n  // When included as a plain script, set up Math.seedrandom global.\n  math['seed' + rngname] = seedrandom;\n}\n\n\n// End anonymous scope, and pass initial values.\n})(\n  // global: `self` in browsers (including strict mode and web workers),\n  // otherwise `this` in Node and other environments\n  (typeof self !== 'undefined') ? self : this,\n  [],     // pool: entropy pool starts empty\n  Math    // math: package containing random, pow, and seedrandom\n);\n\n};","~:removed-requires",["~#set",[]],"~:actual-requires",["^5",["~$shadow$empty","~$shadow.js"]],"~:properties",["^5",["int32","j","S","entropy","quick","i","state","double","g"]],"~:compiled-at",1619135724030,"~:source-map-json","{\n\"version\":3,\n\"file\":\"module$node_modules$seedrandom$seedrandom.js\",\n\"lineCount\":4,\n\"mappings\":\"AAAAA,cAAA,CAAe,GAAf,CAAA,CAAsB,QAAQ,CAACC,CAAD,CAAQC,CAAR,CAAgBC,CAAhB,CAAuBC,CAAvB,CAAgC,CAyB7D,SAAS,CAACH,CAAD,CAASI,CAAT,CAAeC,CAAf,CAAqB,CAmB/BC,QAASA,EAAU,CAACC,CAAD,CAAOC,CAAP,CAAgBC,CAAhB,CAA0B,CAC3C,IAAIC,EAAM,EACVF,EAAA,CAAsB,CAAZ,EAACA,CAAD,CAAoB,CAAEG,QAAS,CAAA,CAAX,CAApB,CAAyCH,CAAzC,EAAoD,EAG1DI,EAAAA,CAAYC,CAAA,CAAOC,CAAA,CACrBN,CAAQG,CAAAA,OAAR,CAAkB,CAACJ,CAAD,CAAOQ,CAAA,CAASX,CAAT,CAAP,CAAlB,CACS,IAAT,EAACG,CAAD,CAAiBS,CAAA,EAAjB,CAA8BT,CAFT,CAEe,CAFf,CAAP,CAE0BG,CAF1B,CAKhB,KAAIO,EAAO,IAAIC,CAAJ,CAASR,CAAT,CAIPS,EAAAA,CAAOA,QAAQ,EAAG,CAIpB,IAJoB,IAChBC,EAAIH,CAAKI,CAAAA,CAAL,CA5BCC,CA4BD,CADY,CAEhBC,EAAIC,CAFY,CAGhBC,EAAI,CACR,CAAOL,CAAP,CAAWM,CAAX,CAAA,CACEN,CAEA,CAnCMO,GAmCN,EAFKP,CAEL,CAFSK,CAET,EADAF,CACA,EAnCMI,GAmCN,CAAAF,CAAA,CAAIR,CAAKI,CAAAA,CAAL,CAAO,CAAP,CAEN,KAAA,CAAOD,CAAP,EAAYQ,CAAZ,CAAA,CACER,CAEA,EAFK,CAEL,CADAG,CACA,EADK,CACL,CAAAE,CAAA,IAAO,CAET,QAAQL,CAAR,CAAYK,CAAZ,EAAiBF,CAdG,CAiBtBJ,EAAKU,CAAAA,KAAL,CAAaC,QAAQ,EAAG,CAAE,MAAOb,EAAKI,CAAAA,CAAL,CAAO,CAAP,CAAP,CAAmB,CAArB,CACxBF,EAAKY,CAAAA,KAAL,CAAaC,QAAQ,EAAG,CAAE,MAAOf,EAAKI,CAAAA,CAAL,CAAO,CAAP,CAAP,CAAmB,UAArB,CACxBF,EAAKc,CAAAA,MAAL,CAAcd,CAGdN,EAAA,CAAOE,CAAA,CAASE,CAAKiB,CAAAA,CAAd,CAAP,CAAyB9B,CAAzB,CAGA,OAAO,CAACI,CAAQ2B,CAAAA,IAAT,EAAiB1B,CAAjB,EACH,QAAQ,CAACU,CAAD,CAAOZ,CAAP,CAAa6B,CAAb,CAA2BC,CAA3B,CAAkC,CACpCA,CAAJ,GAEMA,CAAMH,CAAAA,CAEV,EAFeI,CAAA,CAAKD,CAAL,CAAYpB,CAAZ,CAEf,CAAAE,CAAKkB,CAAAA,KAAL,CAAaE,QAAQ,EAAG,CAAE,MAAOD,EAAA,CAAKrB,CAAL,CAAW,EAAX,CAAT,CAJ1B,CASA,OAAImB,EAAJ,EAAoB/B,CAAA,CAAA,MAA6BE,CAAbY,CAAaZ,CAAAA,CAAjD,EAIYY,CAd4B,CADvC,EAiBPA,CAjBO;AAkBPP,CAlBO,CAmBP,QAAA,EAAYJ,EAAZ,CAAsBA,CAAQR,CAAAA,MAA9B,CAAwC,IAAxC,EAAgDK,CAnBzC,CAoBPG,CAAQ6B,CAAAA,KApBD,CAvCoC,CAwE7CnB,QAASA,EAAI,CAACR,CAAD,CAAM,CAAA,IACb8B,CADa,CACVC,EAAS/B,CAAIgC,CAAAA,MADH,CAEbC,EAAK,IAFQ,CAEFC,EAAI,CAFF,CAEKC,EAAIF,CAAGC,CAAAA,CAAPC,CAAWF,CAAGE,CAAAA,CAAdA,CAAkB,CAFvB,CAE0BC,EAAIH,CAAGT,CAAAA,CAAPY,CAAW,EAMtD,KAHKL,CAGL,GAHe/B,CAGf,CAHqB,CAAC+B,CAAA,EAAD,CAGrB,EA9FUd,GA8FV,CAAOiB,CAAP,CAAA,CACEE,CAAA,CAAEF,CAAF,CAAA,CAAOA,CAAA,EAET,KAAKA,CAAL,CAAS,CAAT,CAjGUjB,GAiGV,CAAYiB,CAAZ,CAAuBA,CAAA,EAAvB,CACEE,CAAA,CAAEF,CAAF,CACA,CADOE,CAAA,CAAED,CAAF,CA3FAE,GA2FA,CAAcF,CAAd,CAAkBnC,CAAA,CAAIkC,CAAJ,CAAQH,CAAR,CAAlB,EAAqCD,CAArC,CAAyCM,CAAA,CAAEF,CAAF,CAAzC,EACP,CAAAE,CAAA,CAAED,CAAF,CAAA,CAAOL,CAIT,EAACG,CAAGtB,CAAAA,CAAJ,CAAQ2B,QAAQ,CAACC,CAAD,CAAQ,CAItB,IAJsB,IAElBT,CAFkB,CAEfU,EAAI,CAFW,CAGlBN,EAAID,CAAGC,CAAAA,CAHW,CAGRC,EAAIF,CAAGE,CAAAA,CAHC,CAGEC,EAAIH,CAAGT,CAAAA,CAC/B,CAAOe,CAAA,EAAP,CAAA,CACET,CACA,CADIM,CAAA,CAAEF,CAAF,CArGCG,GAqGD,CAAcH,CAAd,CAAkB,CAAlB,CACJ,CAAAM,CAAA,CA7GMvB,GA6GN,CAAIuB,CAAJ,CAAgBJ,CAAA,CAtGXC,GAsGW,EAAWD,CAAA,CAAEF,CAAF,CAAX,CAAkBE,CAAA,CAAED,CAAF,CAtG7BE,GAsG6B,CAAcF,CAAd,CAAkBL,CAAlB,CAAlB,GAA4CM,CAAA,CAAED,CAAF,CAA5C,CAAmDL,CAAnD,EAElBG,EAAGC,CAAAA,CAAH,CAAOA,CAAGD,EAAGE,CAAAA,CAAH,CAAOA,CACjB,OAAOK,EATe,CAAxB,EAvGUvB,GAuGV,CAjBiB,CAqCnBW,QAASA,EAAI,CAACa,CAAD,CAAIX,CAAJ,CAAO,CAClBA,CAAEI,CAAAA,CAAF,CAAMO,CAAEP,CAAAA,CACRJ,EAAEK,CAAAA,CAAF,CAAMM,CAAEN,CAAAA,CACRL,EAAEN,CAAAA,CAAF,CAAMiB,CAAEjB,CAAAA,CAAEkB,CAAAA,KAAJ,EACN,OAAOZ,EAJW,CAWpB1B,QAASA,EAAO,CAACuC,CAAD,CAAMC,CAAN,CAAa,CAAA,IACvBC,EAAS,EADc,CACVC,EAAO,MAAOH,EADJ,CACUI,CACrC,IAAIH,CAAJ,EAAoB,QAApB,EAAaE,CAAb,CACE,IAAKC,CAAL,GAAaJ,EAAb,CACE,GAAI,CAAEE,CAAOG,CAAAA,IAAP,CAAY5C,CAAA,CAAQuC,CAAA,CAAII,CAAJ,CAAR,CAAmBH,CAAnB,CAA2B,CAA3B,CAAZ,CAAF,CAAgD,MAAOK,CAAP,CAAU,EAGlE,MAAQJ,EAAOb,CAAAA,MAAP;AAAgBa,CAAhB,CAAgC,QAAP,EAAAC,CAAA,CAAkBH,CAAlB,CAAwBA,CAAxB,CAA8B,MAPpC,CAe7BxC,QAASA,EAAM,CAACN,CAAD,CAAOG,CAAP,CAAY,CACRH,CAAbqD,EAAoB,EACxB,KAFyB,IACGC,CADH,CACUhB,EAAI,CACvC,CAAOA,CAAP,CAAWe,CAAWlB,CAAAA,MAAtB,CAAA,CACEhC,CAAA,CAjJOqC,GAiJP,CAAWF,CAAX,CAAA,CAjJOE,GAiJP,EACWc,CADX,EACoC,EADpC,CACoBnD,CAAA,CAlJbqC,GAkJa,CAAWF,CAAX,CADpB,EAC0Ce,CAAWE,CAAAA,UAAX,CAAsBjB,CAAA,EAAtB,CAE5C,OAAO9B,EAAA,CAASL,CAAT,CANkB,CAc3BM,QAASA,EAAQ,EAAG,CAClB,GAAI,CACF,IAAI+C,CACAC,EAAJ,GAAmBD,CAAnB,CAAyBC,CAAWC,CAAAA,WAApC,EAEEF,CAFF,CAEQA,CAAA,CAxKApC,GAwKA,CAFR,EAIEoC,CACA,CADM,IAAIG,UAAJ,CA1KAvC,GA0KA,CACN,CAAmCwC,CAAlCnE,CAAOoE,CAAAA,MAA2BD,EAAjBnE,CAAOqE,CAAAA,QAAUF,EAAAA,eAAnC,CAAmDJ,CAAnD,CALF,CAOA,OAAOhD,EAAA,CAASgD,CAAT,CATL,CAUF,MAAOJ,CAAP,CAAU,CAGV,MAFIW,EAEG,CAFOtE,CAAOuE,CAAAA,SAEd,CAAA,CAAC,CAAC,IAAIC,IAAN,CAAYxE,CAAZ,CADOsE,CACP,EADkBA,CAAQG,CAAAA,OAC1B,CAA6BzE,CAAO0E,CAAAA,MAApC,CAA4C3D,CAAA,CAASX,CAAT,CAA5C,CAHG,CAXM,CAsBpBW,QAASA,EAAQ,CAAC4D,CAAD,CAAI,CACnB,MAAOC,OAAOC,CAAAA,YAAaC,CAAAA,KAApB,CAA0B,CAA1B,CAA6BH,CAA7B,CADY,CA9LU,IAS3BnD,EAAanB,CAAK0E,CAAAA,GAAL,CAJLpD,GAIK,CAHJL,CAGI,CATc,CAU3BI,EAAerB,CAAK0E,CAAAA,GAAL,CAAS,CAAT,CAHNC,EAGM,CAVY,CAW3BpD,EAA0B,CAA1BA,CAAWF,CA8Lfb,EAAA,CAAOR,CAAK4E,CAAAA,MAAL,EAAP,CAAsB7E,CAAtB,CAMA,IAAuB,QAAvB,EAAK,MAAOF,EAAZ,EAAmCA,CAAOC,CAAAA,OAA1C,CAAmD,CACjDD,CAAOC,CAAAA,OAAP,CAAiBG,CAEjB,IAAI,CACF,IAAA0D,EAAa/D,CAAA,CAAQ,GAAR,CADX,CAEF,MAAOiF,CAAP,CAAW,EALoC,CAAnD,IAM8B,UAAvB;AAAK,MAAOC,OAAZ,EAAqCA,MAAOC,CAAAA,GAA5C,CACLD,MAAA,CAAO,QAAQ,EAAG,CAAE,MAAO7E,EAAT,CAAlB,CADK,CAILD,CAAA,CAAA,UAJK,CAIoBC,CAzNI,CAA9B,CAAD,CAiOmB,WAAjB,GAAC,MAAO+E,KAAR,CAAgCA,IAAhC,CAAuC,IAjOzC,CAkOE,EAlOF,CAmOEC,IAnOF,CAzB8D;\",\n\"sources\":[\"node_modules/seedrandom/seedrandom.js\"],\n\"sourcesContent\":[\"shadow$provide[551] = function(global,require,module,exports) {\\n/*\\nCopyright 2019 David Bau.\\n\\nPermission is hereby granted, free of charge, to any person obtaining\\na copy of this software and associated documentation files (the\\n\\\"Software\\\"), to deal in the Software without restriction, including\\nwithout limitation the rights to use, copy, modify, merge, publish,\\ndistribute, sublicense, and/or sell copies of the Software, and to\\npermit persons to whom the Software is furnished to do so, subject to\\nthe following conditions:\\n\\nThe above copyright notice and this permission notice shall be\\nincluded in all copies or substantial portions of the Software.\\n\\nTHE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND,\\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\\nIN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\\nCLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\\nTORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\\nSOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\\n\\n*/\\n\\n(function (global, pool, math) {\\n//\\n// The following constants are related to IEEE 754 limits.\\n//\\n\\nvar width = 256,        // each RC4 output is 0 <= x < 256\\n    chunks = 6,         // at least six RC4 outputs for each double\\n    digits = 52,        // there are 52 significant digits in a double\\n    rngname = 'random', // rngname: name for Math.random and Math.seedrandom\\n    startdenom = math.pow(width, chunks),\\n    significance = math.pow(2, digits),\\n    overflow = significance * 2,\\n    mask = width - 1,\\n    nodecrypto;         // node.js crypto module, initialized at the bottom.\\n\\n//\\n// seedrandom()\\n// This is the seedrandom function described above.\\n//\\nfunction seedrandom(seed, options, callback) {\\n  var key = [];\\n  options = (options == true) ? { entropy: true } : (options || {});\\n\\n  // Flatten the seed string or build one from local entropy if needed.\\n  var shortseed = mixkey(flatten(\\n    options.entropy ? [seed, tostring(pool)] :\\n    (seed == null) ? autoseed() : seed, 3), key);\\n\\n  // Use the seed to initialize an ARC4 generator.\\n  var arc4 = new ARC4(key);\\n\\n  // This function returns a random double in [0, 1) that contains\\n  // randomness in every bit of the mantissa of the IEEE 754 value.\\n  var prng = function() {\\n    var n = arc4.g(chunks),             // Start with a numerator n < 2 ^ 48\\n        d = startdenom,                 //   and denominator d = 2 ^ 48.\\n        x = 0;                          //   and no 'extra last byte'.\\n    while (n < significance) {          // Fill up all significant digits by\\n      n = (n + x) * width;              //   shifting numerator and\\n      d *= width;                       //   denominator and generating a\\n      x = arc4.g(1);                    //   new least-significant-byte.\\n    }\\n    while (n >= overflow) {             // To avoid rounding up, before adding\\n      n /= 2;                           //   last byte, shift everything\\n      d /= 2;                           //   right using integer math until\\n      x >>>= 1;                         //   we have exactly the desired bits.\\n    }\\n    return (n + x) / d;                 // Form the number within [0, 1).\\n  };\\n\\n  prng.int32 = function() { return arc4.g(4) | 0; }\\n  prng.quick = function() { return arc4.g(4) / 0x100000000; }\\n  prng.double = prng;\\n\\n  // Mix the randomness into accumulated entropy.\\n  mixkey(tostring(arc4.S), pool);\\n\\n  // Calling convention: what to return as a function of prng, seed, is_math.\\n  return (options.pass || callback ||\\n      function(prng, seed, is_math_call, state) {\\n        if (state) {\\n          // Load the arc4 state from the given state if it has an S array.\\n          if (state.S) { copy(state, arc4); }\\n          // Only provide the .state method if requested via options.state.\\n          prng.state = function() { return copy(arc4, {}); }\\n        }\\n\\n        // If called as a method of Math (Math.seedrandom()), mutate\\n        // Math.random because that is how seedrandom.js has worked since v1.0.\\n        if (is_math_call) { math[rngname] = prng; return seed; }\\n\\n        // Otherwise, it is a newer calling convention, so return the\\n        // prng directly.\\n        else return prng;\\n      })(\\n  prng,\\n  shortseed,\\n  'global' in options ? options.global : (this == math),\\n  options.state);\\n}\\n\\n//\\n// ARC4\\n//\\n// An ARC4 implementation.  The constructor takes a key in the form of\\n// an array of at most (width) integers that should be 0 <= x < (width).\\n//\\n// The g(count) method returns a pseudorandom integer that concatenates\\n// the next (count) outputs from ARC4.  Its return value is a number x\\n// that is in the range 0 <= x < (width ^ count).\\n//\\nfunction ARC4(key) {\\n  var t, keylen = key.length,\\n      me = this, i = 0, j = me.i = me.j = 0, s = me.S = [];\\n\\n  // The empty key [] is treated as [0].\\n  if (!keylen) { key = [keylen++]; }\\n\\n  // Set up S using the standard key scheduling algorithm.\\n  while (i < width) {\\n    s[i] = i++;\\n  }\\n  for (i = 0; i < width; i++) {\\n    s[i] = s[j = mask & (j + key[i % keylen] + (t = s[i]))];\\n    s[j] = t;\\n  }\\n\\n  // The \\\"g\\\" method returns the next (count) outputs as one number.\\n  (me.g = function(count) {\\n    // Using instance members instead of closure state nearly doubles speed.\\n    var t, r = 0,\\n        i = me.i, j = me.j, s = me.S;\\n    while (count--) {\\n      t = s[i = mask & (i + 1)];\\n      r = r * width + s[mask & ((s[i] = s[j = mask & (j + t)]) + (s[j] = t))];\\n    }\\n    me.i = i; me.j = j;\\n    return r;\\n    // For robust unpredictability, the function call below automatically\\n    // discards an initial batch of values.  This is called RC4-drop[256].\\n    // See http://google.com/search?q=rsa+fluhrer+response&btnI\\n  })(width);\\n}\\n\\n//\\n// copy()\\n// Copies internal state of ARC4 to or from a plain object.\\n//\\nfunction copy(f, t) {\\n  t.i = f.i;\\n  t.j = f.j;\\n  t.S = f.S.slice();\\n  return t;\\n};\\n\\n//\\n// flatten()\\n// Converts an object tree to nested arrays of strings.\\n//\\nfunction flatten(obj, depth) {\\n  var result = [], typ = (typeof obj), prop;\\n  if (depth && typ == 'object') {\\n    for (prop in obj) {\\n      try { result.push(flatten(obj[prop], depth - 1)); } catch (e) {}\\n    }\\n  }\\n  return (result.length ? result : typ == 'string' ? obj : obj + '\\\\0');\\n}\\n\\n//\\n// mixkey()\\n// Mixes a string seed into a key that is an array of integers, and\\n// returns a shortened string seed that is equivalent to the result key.\\n//\\nfunction mixkey(seed, key) {\\n  var stringseed = seed + '', smear, j = 0;\\n  while (j < stringseed.length) {\\n    key[mask & j] =\\n      mask & ((smear ^= key[mask & j] * 19) + stringseed.charCodeAt(j++));\\n  }\\n  return tostring(key);\\n}\\n\\n//\\n// autoseed()\\n// Returns an object for autoseeding, using window.crypto and Node crypto\\n// module if available.\\n//\\nfunction autoseed() {\\n  try {\\n    var out;\\n    if (nodecrypto && (out = nodecrypto.randomBytes)) {\\n      // The use of 'out' to remember randomBytes makes tight minified code.\\n      out = out(width);\\n    } else {\\n      out = new Uint8Array(width);\\n      (global.crypto || global.msCrypto).getRandomValues(out);\\n    }\\n    return tostring(out);\\n  } catch (e) {\\n    var browser = global.navigator,\\n        plugins = browser && browser.plugins;\\n    return [+new Date, global, plugins, global.screen, tostring(pool)];\\n  }\\n}\\n\\n//\\n// tostring()\\n// Converts an array of charcodes to a string\\n//\\nfunction tostring(a) {\\n  return String.fromCharCode.apply(0, a);\\n}\\n\\n//\\n// When seedrandom.js is loaded, we immediately mix a few bits\\n// from the built-in RNG into the entropy pool.  Because we do\\n// not want to interfere with deterministic PRNG state later,\\n// seedrandom will not call math.random on its own again after\\n// initialization.\\n//\\nmixkey(math.random(), pool);\\n\\n//\\n// Nodejs and AMD support: export the implementation as a module using\\n// either convention.\\n//\\nif ((typeof module) == 'object' && module.exports) {\\n  module.exports = seedrandom;\\n  // When in node.js, try using crypto package for autoseeding.\\n  try {\\n    nodecrypto = require('crypto');\\n  } catch (ex) {}\\n} else if ((typeof define) == 'function' && define.amd) {\\n  define(function() { return seedrandom; });\\n} else {\\n  // When included as a plain script, set up Math.seedrandom global.\\n  math['seed' + rngname] = seedrandom;\\n}\\n\\n\\n// End anonymous scope, and pass initial values.\\n})(\\n  // global: `self` in browsers (including strict mode and web workers),\\n  // otherwise `this` in Node and other environments\\n  (typeof self !== 'undefined') ? self : this,\\n  [],     // pool: entropy pool starts empty\\n  Math    // math: package containing random, pow, and seedrandom\\n);\\n\\n};\"],\n\"names\":[\"shadow$provide\",\"global\",\"require\",\"module\",\"exports\",\"pool\",\"math\",\"seedrandom\",\"seed\",\"options\",\"callback\",\"key\",\"entropy\",\"shortseed\",\"mixkey\",\"flatten\",\"tostring\",\"autoseed\",\"arc4\",\"ARC4\",\"prng\",\"n\",\"g\",\"chunks\",\"d\",\"startdenom\",\"x\",\"significance\",\"width\",\"overflow\",\"int32\",\"prng.int32\",\"quick\",\"prng.quick\",\"double\",\"S\",\"pass\",\"is_math_call\",\"state\",\"copy\",\"prng.state\",\"t\",\"keylen\",\"length\",\"me\",\"i\",\"j\",\"s\",\"mask\",\"me.g\",\"count\",\"r\",\"f\",\"slice\",\"obj\",\"depth\",\"result\",\"typ\",\"prop\",\"push\",\"e\",\"stringseed\",\"smear\",\"charCodeAt\",\"out\",\"nodecrypto\",\"randomBytes\",\"Uint8Array\",\"getRandomValues\",\"crypto\",\"msCrypto\",\"browser\",\"navigator\",\"Date\",\"plugins\",\"screen\",\"a\",\"String\",\"fromCharCode\",\"apply\",\"pow\",\"digits\",\"random\",\"ex\",\"define\",\"amd\",\"self\",\"Math\"]\n}\n"]