pixel-react 1.15.21 → 1.15.23

package/lib/node_modules/node-forge/lib/prng.js

@@ -0,0 +1,433 @@
+import { __module as prng } from '../../../_virtual/prng.js';
+import { __require as requireForge } from './forge.js';
+import { __require as requireUtil } from './util.js';
+import require$$4 from 'crypto';
+
+/**
+ * A javascript implementation of a cryptographically-secure
+ * Pseudo Random Number Generator (PRNG). The Fortuna algorithm is followed
+ * here though the use of SHA-256 is not enforced; when generating an
+ * a PRNG context, the hashing algorithm and block cipher used for
+ * the generator are specified via a plugin.
+ *
+ * @author Dave Longley
+ *
+ * Copyright (c) 2010-2014 Digital Bazaar, Inc.
+ */
+var hasRequiredPrng;
+function requirePrng() {
+  if (hasRequiredPrng) return prng.exports;
+  hasRequiredPrng = 1;
+  var forge = requireForge();
+  requireUtil();
+  var _crypto = null;
+  if (forge.util.isNodejs && !forge.options.usePureJavaScript && !process.versions['node-webkit']) {
+    _crypto = require$$4;
+  }
+
+  /* PRNG API */
+  var prng$1 = prng.exports = forge.prng = forge.prng || {};
+
+  /**
+   * Creates a new PRNG context.
+   *
+   * A PRNG plugin must be passed in that will provide:
+   *
+   * 1. A function that initializes the key and seed of a PRNG context. It
+   *   will be given a 16 byte key and a 16 byte seed. Any key expansion
+   *   or transformation of the seed from a byte string into an array of
+   *   integers (or similar) should be performed.
+   * 2. The cryptographic function used by the generator. It takes a key and
+   *   a seed.
+   * 3. A seed increment function. It takes the seed and returns seed + 1.
+   * 4. An api to create a message digest.
+   *
+   * For an example, see random.js.
+   *
+   * @param plugin the PRNG plugin to use.
+   */
+  prng$1.create = function (plugin) {
+    var ctx = {
+      plugin: plugin,
+      key: null,
+      seed: null,
+      time: null,
+      // number of reseeds so far
+      reseeds: 0,
+      // amount of data generated so far
+      generated: 0,
+      // no initial key bytes
+      keyBytes: ''
+    };
+
+    // create 32 entropy pools (each is a message digest)
+    var md = plugin.md;
+    var pools = new Array(32);
+    for (var i = 0; i < 32; ++i) {
+      pools[i] = md.create();
+    }
+    ctx.pools = pools;
+
+    // entropy pools are written to cyclically, starting at index 0
+    ctx.pool = 0;
+
+    /**
+     * Generates random bytes. The bytes may be generated synchronously or
+     * asynchronously. Web workers must use the asynchronous interface or
+     * else the behavior is undefined.
+     *
+     * @param count the number of random bytes to generate.
+     * @param [callback(err, bytes)] called once the operation completes.
+     *
+     * @return count random bytes as a string.
+     */
+    ctx.generate = function (count, callback) {
+      // do synchronously
+      if (!callback) {
+        return ctx.generateSync(count);
+      }
+
+      // simple generator using counter-based CBC
+      var cipher = ctx.plugin.cipher;
+      var increment = ctx.plugin.increment;
+      var formatKey = ctx.plugin.formatKey;
+      var formatSeed = ctx.plugin.formatSeed;
+      var b = forge.util.createBuffer();
+
+      // paranoid deviation from Fortuna:
+      // reset key for every request to protect previously
+      // generated random bytes should the key be discovered;
+      // there is no 100ms based reseeding because of this
+      // forced reseed for every `generate` call
+      ctx.key = null;
+      generate();
+      function generate(err) {
+        if (err) {
+          return callback(err);
+        }
+
+        // sufficient bytes generated
+        if (b.length() >= count) {
+          return callback(null, b.getBytes(count));
+        }
+
+        // if amount of data generated is greater than 1 MiB, trigger reseed
+        if (ctx.generated > 0xfffff) {
+          ctx.key = null;
+        }
+        if (ctx.key === null) {
+          // prevent stack overflow
+          return forge.util.nextTick(function () {
+            _reseed(generate);
+          });
+        }
+
+        // generate the random bytes
+        var bytes = cipher(ctx.key, ctx.seed);
+        ctx.generated += bytes.length;
+        b.putBytes(bytes);
+
+        // generate bytes for a new key and seed
+        ctx.key = formatKey(cipher(ctx.key, increment(ctx.seed)));
+        ctx.seed = formatSeed(cipher(ctx.key, ctx.seed));
+        forge.util.setImmediate(generate);
+      }
+    };
+
+    /**
+     * Generates random bytes synchronously.
+     *
+     * @param count the number of random bytes to generate.
+     *
+     * @return count random bytes as a string.
+     */
+    ctx.generateSync = function (count) {
+      // simple generator using counter-based CBC
+      var cipher = ctx.plugin.cipher;
+      var increment = ctx.plugin.increment;
+      var formatKey = ctx.plugin.formatKey;
+      var formatSeed = ctx.plugin.formatSeed;
+
+      // paranoid deviation from Fortuna:
+      // reset key for every request to protect previously
+      // generated random bytes should the key be discovered;
+      // there is no 100ms based reseeding because of this
+      // forced reseed for every `generateSync` call
+      ctx.key = null;
+      var b = forge.util.createBuffer();
+      while (b.length() < count) {
+        // if amount of data generated is greater than 1 MiB, trigger reseed
+        if (ctx.generated > 0xfffff) {
+          ctx.key = null;
+        }
+        if (ctx.key === null) {
+          _reseedSync();
+        }
+
+        // generate the random bytes
+        var bytes = cipher(ctx.key, ctx.seed);
+        ctx.generated += bytes.length;
+        b.putBytes(bytes);
+
+        // generate bytes for a new key and seed
+        ctx.key = formatKey(cipher(ctx.key, increment(ctx.seed)));
+        ctx.seed = formatSeed(cipher(ctx.key, ctx.seed));
+      }
+      return b.getBytes(count);
+    };
+
+    /**
+     * Private function that asynchronously reseeds a generator.
+     *
+     * @param callback(err) called once the operation completes.
+     */
+    function _reseed(callback) {
+      if (ctx.pools[0].messageLength >= 32) {
+        _seed();
+        return callback();
+      }
+      // not enough seed data...
+      var needed = 32 - ctx.pools[0].messageLength << 5;
+      ctx.seedFile(needed, function (err, bytes) {
+        if (err) {
+          return callback(err);
+        }
+        ctx.collect(bytes);
+        _seed();
+        callback();
+      });
+    }
+
+    /**
+     * Private function that synchronously reseeds a generator.
+     */
+    function _reseedSync() {
+      if (ctx.pools[0].messageLength >= 32) {
+        return _seed();
+      }
+      // not enough seed data...
+      var needed = 32 - ctx.pools[0].messageLength << 5;
+      ctx.collect(ctx.seedFileSync(needed));
+      _seed();
+    }
+
+    /**
+     * Private function that seeds a generator once enough bytes are available.
+     */
+    function _seed() {
+      // update reseed count
+      ctx.reseeds = ctx.reseeds === 0xffffffff ? 0 : ctx.reseeds + 1;
+
+      // goal is to update `key` via:
+      // key = hash(key + s)
+      //   where 's' is all collected entropy from selected pools, then...
+
+      // create a plugin-based message digest
+      var md = ctx.plugin.md.create();
+
+      // consume current key bytes
+      md.update(ctx.keyBytes);
+
+      // digest the entropy of pools whose index k meet the
+      // condition 'n mod 2^k == 0' where n is the number of reseeds
+      var _2powK = 1;
+      for (var k = 0; k < 32; ++k) {
+        if (ctx.reseeds % _2powK === 0) {
+          md.update(ctx.pools[k].digest().getBytes());
+          ctx.pools[k].start();
+        }
+        _2powK = _2powK << 1;
+      }
+
+      // get digest for key bytes
+      ctx.keyBytes = md.digest().getBytes();
+
+      // paranoid deviation from Fortuna:
+      // update `seed` via `seed = hash(key)`
+      // instead of initializing to zero once and only
+      // ever incrementing it
+      md.start();
+      md.update(ctx.keyBytes);
+      var seedBytes = md.digest().getBytes();
+
+      // update state
+      ctx.key = ctx.plugin.formatKey(ctx.keyBytes);
+      ctx.seed = ctx.plugin.formatSeed(seedBytes);
+      ctx.generated = 0;
+    }
+
+    /**
+     * The built-in default seedFile. This seedFile is used when entropy
+     * is needed immediately.
+     *
+     * @param needed the number of bytes that are needed.
+     *
+     * @return the random bytes.
+     */
+    function defaultSeedFile(needed) {
+      // use window.crypto.getRandomValues strong source of entropy if available
+      var getRandomValues = null;
+      var globalScope = forge.util.globalScope;
+      var _crypto = globalScope.crypto || globalScope.msCrypto;
+      if (_crypto && _crypto.getRandomValues) {
+        getRandomValues = function (arr) {
+          return _crypto.getRandomValues(arr);
+        };
+      }
+      var b = forge.util.createBuffer();
+      if (getRandomValues) {
+        while (b.length() < needed) {
+          // max byte length is 65536 before QuotaExceededError is thrown
+          // http://www.w3.org/TR/WebCryptoAPI/#RandomSource-method-getRandomValues
+          var count = Math.max(1, Math.min(needed - b.length(), 65536) / 4);
+          var entropy = new Uint32Array(Math.floor(count));
+          try {
+            getRandomValues(entropy);
+            for (var i = 0; i < entropy.length; ++i) {
+              b.putInt32(entropy[i]);
+            }
+          } catch (e) {
+            /* only ignore QuotaExceededError */
+            if (!(typeof QuotaExceededError !== 'undefined' && e instanceof QuotaExceededError)) {
+              throw e;
+            }
+          }
+        }
+      }
+
+      // be sad and add some weak random data
+      if (b.length() < needed) {
+        /* Draws from Park-Miller "minimal standard" 31 bit PRNG,
+        implemented with David G. Carta's optimization: with 32 bit math
+        and without division (Public Domain). */
+        var hi, lo, next;
+        var seed = Math.floor(Math.random() * 0x010000);
+        while (b.length() < needed) {
+          lo = 16807 * (seed & 0xFFFF);
+          hi = 16807 * (seed >> 16);
+          lo += (hi & 0x7FFF) << 16;
+          lo += hi >> 15;
+          lo = (lo & 0x7FFFFFFF) + (lo >> 31);
+          seed = lo & 0xFFFFFFFF;
+
+          // consume lower 3 bytes of seed
+          for (var i = 0; i < 3; ++i) {
+            // throw in more pseudo random
+            next = seed >>> (i << 3);
+            next ^= Math.floor(Math.random() * 0x0100);
+            b.putByte(next & 0xFF);
+          }
+        }
+      }
+      return b.getBytes(needed);
+    }
+    // initialize seed file APIs
+    if (_crypto) {
+      // use nodejs async API
+      ctx.seedFile = function (needed, callback) {
+        _crypto.randomBytes(needed, function (err, bytes) {
+          if (err) {
+            return callback(err);
+          }
+          callback(null, bytes.toString());
+        });
+      };
+      // use nodejs sync API
+      ctx.seedFileSync = function (needed) {
+        return _crypto.randomBytes(needed).toString();
+      };
+    } else {
+      ctx.seedFile = function (needed, callback) {
+        try {
+          callback(null, defaultSeedFile(needed));
+        } catch (e) {
+          callback(e);
+        }
+      };
+      ctx.seedFileSync = defaultSeedFile;
+    }
+
+    /**
+     * Adds entropy to a prng ctx's accumulator.
+     *
+     * @param bytes the bytes of entropy as a string.
+     */
+    ctx.collect = function (bytes) {
+      // iterate over pools distributing entropy cyclically
+      var count = bytes.length;
+      for (var i = 0; i < count; ++i) {
+        ctx.pools[ctx.pool].update(bytes.substr(i, 1));
+        ctx.pool = ctx.pool === 31 ? 0 : ctx.pool + 1;
+      }
+    };
+
+    /**
+     * Collects an integer of n bits.
+     *
+     * @param i the integer entropy.
+     * @param n the number of bits in the integer.
+     */
+    ctx.collectInt = function (i, n) {
+      var bytes = '';
+      for (var x = 0; x < n; x += 8) {
+        bytes += String.fromCharCode(i >> x & 0xFF);
+      }
+      ctx.collect(bytes);
+    };
+
+    /**
+     * Registers a Web Worker to receive immediate entropy from the main thread.
+     * This method is required until Web Workers can access the native crypto
+     * API. This method should be called twice for each created worker, once in
+     * the main thread, and once in the worker itself.
+     *
+     * @param worker the worker to register.
+     */
+    ctx.registerWorker = function (worker) {
+      // worker receives random bytes
+      if (worker === self) {
+        ctx.seedFile = function (needed, callback) {
+          function listener(e) {
+            var data = e.data;
+            if (data.forge && data.forge.prng) {
+              self.removeEventListener('message', listener);
+              callback(data.forge.prng.err, data.forge.prng.bytes);
+            }
+          }
+          self.addEventListener('message', listener);
+          self.postMessage({
+            forge: {
+              prng: {
+                needed: needed
+              }
+            }
+          });
+        };
+      } else {
+        // main thread sends random bytes upon request
+        var listener = function (e) {
+          var data = e.data;
+          if (data.forge && data.forge.prng) {
+            ctx.seedFile(data.forge.prng.needed, function (err, bytes) {
+              worker.postMessage({
+                forge: {
+                  prng: {
+                    err: err,
+                    bytes: bytes
+                  }
+                }
+              });
+            });
+          }
+        };
+        // TODO: do we need to remove the event listener when the worker dies?
+        worker.addEventListener('message', listener);
+      }
+    };
+    return ctx;
+  };
+  return prng.exports;
+}
+
+export { requirePrng as __require };
+//# sourceMappingURL=prng.js.map

package/lib/node_modules/node-forge/lib/prng.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"prng.js","sources":["../../../../node_modules/node-forge/lib/prng.js"],"sourcesContent":["/**\n * A javascript implementation of a cryptographically-secure\n * Pseudo Random Number Generator (PRNG). The Fortuna algorithm is followed\n * here though the use of SHA-256 is not enforced; when generating an\n * a PRNG context, the hashing algorithm and block cipher used for\n * the generator are specified via a plugin.\n *\n * @author Dave Longley\n *\n * Copyright (c) 2010-2014 Digital Bazaar, Inc.\n */\nvar forge = require('./forge');\nrequire('./util');\n\nvar _crypto = null;\nif(forge.util.isNodejs && !forge.options.usePureJavaScript &&\n  !process.versions['node-webkit']) {\n  _crypto = require('crypto');\n}\n\n/* PRNG API */\nvar prng = module.exports = forge.prng = forge.prng || {};\n\n/**\n * Creates a new PRNG context.\n *\n * A PRNG plugin must be passed in that will provide:\n *\n * 1. A function that initializes the key and seed of a PRNG context. It\n *   will be given a 16 byte key and a 16 byte seed. Any key expansion\n *   or transformation of the seed from a byte string into an array of\n *   integers (or similar) should be performed.\n * 2. The cryptographic function used by the generator. It takes a key and\n *   a seed.\n * 3. A seed increment function. It takes the seed and returns seed + 1.\n * 4. An api to create a message digest.\n *\n * For an example, see random.js.\n *\n * @param plugin the PRNG plugin to use.\n */\nprng.create = function(plugin) {\n  var ctx = {\n    plugin: plugin,\n    key: null,\n    seed: null,\n    time: null,\n    // number of reseeds so far\n    reseeds: 0,\n    // amount of data generated so far\n    generated: 0,\n    // no initial key bytes\n    keyBytes: ''\n  };\n\n  // create 32 entropy pools (each is a message digest)\n  var md = plugin.md;\n  var pools = new Array(32);\n  for(var i = 0; i < 32; ++i) {\n    pools[i] = md.create();\n  }\n  ctx.pools = pools;\n\n  // entropy pools are written to cyclically, starting at index 0\n  ctx.pool = 0;\n\n  /**\n   * Generates random bytes. The bytes may be generated synchronously or\n   * asynchronously. Web workers must use the asynchronous interface or\n   * else the behavior is undefined.\n   *\n   * @param count the number of random bytes to generate.\n   * @param [callback(err, bytes)] called once the operation completes.\n   *\n   * @return count random bytes as a string.\n   */\n  ctx.generate = function(count, callback) {\n    // do synchronously\n    if(!callback) {\n      return ctx.generateSync(count);\n    }\n\n    // simple generator using counter-based CBC\n    var cipher = ctx.plugin.cipher;\n    var increment = ctx.plugin.increment;\n    var formatKey = ctx.plugin.formatKey;\n    var formatSeed = ctx.plugin.formatSeed;\n    var b = forge.util.createBuffer();\n\n    // paranoid deviation from Fortuna:\n    // reset key for every request to protect previously\n    // generated random bytes should the key be discovered;\n    // there is no 100ms based reseeding because of this\n    // forced reseed for every `generate` call\n    ctx.key = null;\n\n    generate();\n\n    function generate(err) {\n      if(err) {\n        return callback(err);\n      }\n\n      // sufficient bytes generated\n      if(b.length() >= count) {\n        return callback(null, b.getBytes(count));\n      }\n\n      // if amount of data generated is greater than 1 MiB, trigger reseed\n      if(ctx.generated > 0xfffff) {\n        ctx.key = null;\n      }\n\n      if(ctx.key === null) {\n        // prevent stack overflow\n        return forge.util.nextTick(function() {\n          _reseed(generate);\n        });\n      }\n\n      // generate the random bytes\n      var bytes = cipher(ctx.key, ctx.seed);\n      ctx.generated += bytes.length;\n      b.putBytes(bytes);\n\n      // generate bytes for a new key and seed\n      ctx.key = formatKey(cipher(ctx.key, increment(ctx.seed)));\n      ctx.seed = formatSeed(cipher(ctx.key, ctx.seed));\n\n      forge.util.setImmediate(generate);\n    }\n  };\n\n  /**\n   * Generates random bytes synchronously.\n   *\n   * @param count the number of random bytes to generate.\n   *\n   * @return count random bytes as a string.\n   */\n  ctx.generateSync = function(count) {\n    // simple generator using counter-based CBC\n    var cipher = ctx.plugin.cipher;\n    var increment = ctx.plugin.increment;\n    var formatKey = ctx.plugin.formatKey;\n    var formatSeed = ctx.plugin.formatSeed;\n\n    // paranoid deviation from Fortuna:\n    // reset key for every request to protect previously\n    // generated random bytes should the key be discovered;\n    // there is no 100ms based reseeding because of this\n    // forced reseed for every `generateSync` call\n    ctx.key = null;\n\n    var b = forge.util.createBuffer();\n    while(b.length() < count) {\n      // if amount of data generated is greater than 1 MiB, trigger reseed\n      if(ctx.generated > 0xfffff) {\n        ctx.key = null;\n      }\n\n      if(ctx.key === null) {\n        _reseedSync();\n      }\n\n      // generate the random bytes\n      var bytes = cipher(ctx.key, ctx.seed);\n      ctx.generated += bytes.length;\n      b.putBytes(bytes);\n\n      // generate bytes for a new key and seed\n      ctx.key = formatKey(cipher(ctx.key, increment(ctx.seed)));\n      ctx.seed = formatSeed(cipher(ctx.key, ctx.seed));\n    }\n\n    return b.getBytes(count);\n  };\n\n  /**\n   * Private function that asynchronously reseeds a generator.\n   *\n   * @param callback(err) called once the operation completes.\n   */\n  function _reseed(callback) {\n    if(ctx.pools[0].messageLength >= 32) {\n      _seed();\n      return callback();\n    }\n    // not enough seed data...\n    var needed = (32 - ctx.pools[0].messageLength) << 5;\n    ctx.seedFile(needed, function(err, bytes) {\n      if(err) {\n        return callback(err);\n      }\n      ctx.collect(bytes);\n      _seed();\n      callback();\n    });\n  }\n\n  /**\n   * Private function that synchronously reseeds a generator.\n   */\n  function _reseedSync() {\n    if(ctx.pools[0].messageLength >= 32) {\n      return _seed();\n    }\n    // not enough seed data...\n    var needed = (32 - ctx.pools[0].messageLength) << 5;\n    ctx.collect(ctx.seedFileSync(needed));\n    _seed();\n  }\n\n  /**\n   * Private function that seeds a generator once enough bytes are available.\n   */\n  function _seed() {\n    // update reseed count\n    ctx.reseeds = (ctx.reseeds === 0xffffffff) ? 0 : ctx.reseeds + 1;\n\n    // goal is to update `key` via:\n    // key = hash(key + s)\n    //   where 's' is all collected entropy from selected pools, then...\n\n    // create a plugin-based message digest\n    var md = ctx.plugin.md.create();\n\n    // consume current key bytes\n    md.update(ctx.keyBytes);\n\n    // digest the entropy of pools whose index k meet the\n    // condition 'n mod 2^k == 0' where n is the number of reseeds\n    var _2powK = 1;\n    for(var k = 0; k < 32; ++k) {\n      if(ctx.reseeds % _2powK === 0) {\n        md.update(ctx.pools[k].digest().getBytes());\n        ctx.pools[k].start();\n      }\n      _2powK = _2powK << 1;\n    }\n\n    // get digest for key bytes\n    ctx.keyBytes = md.digest().getBytes();\n\n    // paranoid deviation from Fortuna:\n    // update `seed` via `seed = hash(key)`\n    // instead of initializing to zero once and only\n    // ever incrementing it\n    md.start();\n    md.update(ctx.keyBytes);\n    var seedBytes = md.digest().getBytes();\n\n    // update state\n    ctx.key = ctx.plugin.formatKey(ctx.keyBytes);\n    ctx.seed = ctx.plugin.formatSeed(seedBytes);\n    ctx.generated = 0;\n  }\n\n  /**\n   * The built-in default seedFile. This seedFile is used when entropy\n   * is needed immediately.\n   *\n   * @param needed the number of bytes that are needed.\n   *\n   * @return the random bytes.\n   */\n  function defaultSeedFile(needed) {\n    // use window.crypto.getRandomValues strong source of entropy if available\n    var getRandomValues = null;\n    var globalScope = forge.util.globalScope;\n    var _crypto = globalScope.crypto || globalScope.msCrypto;\n    if(_crypto && _crypto.getRandomValues) {\n      getRandomValues = function(arr) {\n        return _crypto.getRandomValues(arr);\n      };\n    }\n\n    var b = forge.util.createBuffer();\n    if(getRandomValues) {\n      while(b.length() < needed) {\n        // max byte length is 65536 before QuotaExceededError is thrown\n        // http://www.w3.org/TR/WebCryptoAPI/#RandomSource-method-getRandomValues\n        var count = Math.max(1, Math.min(needed - b.length(), 65536) / 4);\n        var entropy = new Uint32Array(Math.floor(count));\n        try {\n          getRandomValues(entropy);\n          for(var i = 0; i < entropy.length; ++i) {\n            b.putInt32(entropy[i]);\n          }\n        } catch(e) {\n          /* only ignore QuotaExceededError */\n          if(!(typeof QuotaExceededError !== 'undefined' &&\n            e instanceof QuotaExceededError)) {\n            throw e;\n          }\n        }\n      }\n    }\n\n    // be sad and add some weak random data\n    if(b.length() < needed) {\n      /* Draws from Park-Miller \"minimal standard\" 31 bit PRNG,\n      implemented with David G. Carta's optimization: with 32 bit math\n      and without division (Public Domain). */\n      var hi, lo, next;\n      var seed = Math.floor(Math.random() * 0x010000);\n      while(b.length() < needed) {\n        lo = 16807 * (seed & 0xFFFF);\n        hi = 16807 * (seed >> 16);\n        lo += (hi & 0x7FFF) << 16;\n        lo += hi >> 15;\n        lo = (lo & 0x7FFFFFFF) + (lo >> 31);\n        seed = lo & 0xFFFFFFFF;\n\n        // consume lower 3 bytes of seed\n        for(var i = 0; i < 3; ++i) {\n          // throw in more pseudo random\n          next = seed >>> (i << 3);\n          next ^= Math.floor(Math.random() * 0x0100);\n          b.putByte(next & 0xFF);\n        }\n      }\n    }\n\n    return b.getBytes(needed);\n  }\n  // initialize seed file APIs\n  if(_crypto) {\n    // use nodejs async API\n    ctx.seedFile = function(needed, callback) {\n      _crypto.randomBytes(needed, function(err, bytes) {\n        if(err) {\n          return callback(err);\n        }\n        callback(null, bytes.toString());\n      });\n    };\n    // use nodejs sync API\n    ctx.seedFileSync = function(needed) {\n      return _crypto.randomBytes(needed).toString();\n    };\n  } else {\n    ctx.seedFile = function(needed, callback) {\n      try {\n        callback(null, defaultSeedFile(needed));\n      } catch(e) {\n        callback(e);\n      }\n    };\n    ctx.seedFileSync = defaultSeedFile;\n  }\n\n  /**\n   * Adds entropy to a prng ctx's accumulator.\n   *\n   * @param bytes the bytes of entropy as a string.\n   */\n  ctx.collect = function(bytes) {\n    // iterate over pools distributing entropy cyclically\n    var count = bytes.length;\n    for(var i = 0; i < count; ++i) {\n      ctx.pools[ctx.pool].update(bytes.substr(i, 1));\n      ctx.pool = (ctx.pool === 31) ? 0 : ctx.pool + 1;\n    }\n  };\n\n  /**\n   * Collects an integer of n bits.\n   *\n   * @param i the integer entropy.\n   * @param n the number of bits in the integer.\n   */\n  ctx.collectInt = function(i, n) {\n    var bytes = '';\n    for(var x = 0; x < n; x += 8) {\n      bytes += String.fromCharCode((i >> x) & 0xFF);\n    }\n    ctx.collect(bytes);\n  };\n\n  /**\n   * Registers a Web Worker to receive immediate entropy from the main thread.\n   * This method is required until Web Workers can access the native crypto\n   * API. This method should be called twice for each created worker, once in\n   * the main thread, and once in the worker itself.\n   *\n   * @param worker the worker to register.\n   */\n  ctx.registerWorker = function(worker) {\n    // worker receives random bytes\n    if(worker === self) {\n      ctx.seedFile = function(needed, callback) {\n        function listener(e) {\n          var data = e.data;\n          if(data.forge && data.forge.prng) {\n            self.removeEventListener('message', listener);\n            callback(data.forge.prng.err, data.forge.prng.bytes);\n          }\n        }\n        self.addEventListener('message', listener);\n        self.postMessage({forge: {prng: {needed: needed}}});\n      };\n    } else {\n      // main thread sends random bytes upon request\n      var listener = function(e) {\n        var data = e.data;\n        if(data.forge && data.forge.prng) {\n          ctx.seedFile(data.forge.prng.needed, function(err, bytes) {\n            worker.postMessage({forge: {prng: {err: err, bytes: bytes}}});\n          });\n        }\n      };\n      // TODO: do we need to remove the event listener when the worker dies?\n      worker.addEventListener('message', listener);\n    }\n  };\n\n  return ctx;\n};\n"],"names":["forge","require$$0","require$$1","_crypto","util","isNodejs","options","usePureJavaScript","process","versions","require$$2","prng","prngModule","exports","create","plugin","ctx","key","seed","time","reseeds","generated","keyBytes","md","pools","Array","i","pool","generate","count","callback","generateSync","cipher","increment","formatKey","formatSeed","b","createBuffer","err","length","getBytes","nextTick","_reseed","bytes","putBytes","setImmediate","_reseedSync","messageLength","_seed","needed","seedFile","collect","seedFileSync","update","_2powK","k","digest","start","seedBytes","defaultSeedFile","getRandomValues","globalScope","crypto","msCrypto","arr","Math","max","min","entropy","Uint32Array","floor","putInt32","e","QuotaExceededError","hi","lo","next","random","putByte","randomBytes","toString","substr","collectInt","n","x","String","fromCharCode","registerWorker","worker","self","listener","data","removeEventListener","addEventListener","postMessage"],"mappings":";;;;;;;;;;;;;;;;;;;;AAWA,EAAA,IAAIA,KAAK,GAAGC,YAAA,EAAkB;AAC9BC,EAAAA,WAAA,EAAiB;EAEjB,IAAIC,OAAO,GAAG,IAAI;EAClB,IAAGH,KAAK,CAACI,IAAI,CAACC,QAAQ,IAAI,CAACL,KAAK,CAACM,OAAO,CAACC,iBAAiB,IACxD,CAACC,OAAO,CAACC,QAAQ,CAAC,aAAa,CAAC,EAAE;AAClCN,IAAAA,OAAO,GAAGO,UAAiB;AAC7B,EAAA;;AAEA;AACA,EAAA,IAAIC,MAAI,GAAGC,IAAA,CAAAC,OAAc,GAAGb,KAAK,CAACW,IAAI,GAAGX,KAAK,CAACW,IAAI,IAAI,EAAE;;AAEzD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACAA,EAAAA,MAAI,CAACG,MAAM,GAAG,UAASC,MAAM,EAAE;AAC7B,IAAA,IAAIC,GAAG,GAAG;AACRD,MAAAA,MAAM,EAAEA,MAAM;AACdE,MAAAA,GAAG,EAAE,IAAI;AACTC,MAAAA,IAAI,EAAE,IAAI;AACVC,MAAAA,IAAI,EAAE,IAAI;AACd;AACIC,MAAAA,OAAO,EAAE,CAAC;AACd;AACIC,MAAAA,SAAS,EAAE,CAAC;AAChB;AACIC,MAAAA,QAAQ,EAAE;KACX;;AAEH;AACE,IAAA,IAAIC,EAAE,GAAGR,MAAM,CAACQ,EAAE;AAClB,IAAA,IAAIC,KAAK,GAAG,IAAIC,KAAK,CAAC,EAAE,CAAC;IACzB,KAAI,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG,EAAE,EAAE,EAAEA,CAAC,EAAE;MAC1BF,KAAK,CAACE,CAAC,CAAC,GAAGH,EAAE,CAACT,MAAM,EAAE;AAC1B,IAAA;IACEE,GAAG,CAACQ,KAAK,GAAGA,KAAK;;AAEnB;IACER,GAAG,CAACW,IAAI,GAAG,CAAC;;AAEd;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACEX,IAAAA,GAAG,CAACY,QAAQ,GAAG,UAASC,KAAK,EAAEC,QAAQ,EAAE;AAC3C;MACI,IAAG,CAACA,QAAQ,EAAE;AACZ,QAAA,OAAOd,GAAG,CAACe,YAAY,CAACF,KAAK,CAAC;AACpC,MAAA;;AAEA;AACI,MAAA,IAAIG,MAAM,GAAGhB,GAAG,CAACD,MAAM,CAACiB,MAAM;AAC9B,MAAA,IAAIC,SAAS,GAAGjB,GAAG,CAACD,MAAM,CAACkB,SAAS;AACpC,MAAA,IAAIC,SAAS,GAAGlB,GAAG,CAACD,MAAM,CAACmB,SAAS;AACpC,MAAA,IAAIC,UAAU,GAAGnB,GAAG,CAACD,MAAM,CAACoB,UAAU;MACtC,IAAIC,CAAC,GAAGpC,KAAK,CAACI,IAAI,CAACiC,YAAY,EAAE;;AAErC;AACA;AACA;AACA;AACA;MACIrB,GAAG,CAACC,GAAG,GAAG,IAAI;AAEdW,MAAAA,QAAQ,EAAE;MAEV,SAASA,QAAQA,CAACU,GAAG,EAAE;AACrB,QAAA,IAAGA,GAAG,EAAE;UACN,OAAOR,QAAQ,CAACQ,GAAG,CAAC;AAC5B,QAAA;;AAEA;AACM,QAAA,IAAGF,CAAC,CAACG,MAAM,EAAE,IAAIV,KAAK,EAAE;UACtB,OAAOC,QAAQ,CAAC,IAAI,EAAEM,CAAC,CAACI,QAAQ,CAACX,KAAK,CAAC,CAAC;AAChD,QAAA;;AAEA;AACM,QAAA,IAAGb,GAAG,CAACK,SAAS,GAAG,OAAO,EAAE;UAC1BL,GAAG,CAACC,GAAG,GAAG,IAAI;AACtB,QAAA;AAEM,QAAA,IAAGD,GAAG,CAACC,GAAG,KAAK,IAAI,EAAE;AAC3B;AACQ,UAAA,OAAOjB,KAAK,CAACI,IAAI,CAACqC,QAAQ,CAAC,YAAW;YACpCC,OAAO,CAACd,QAAQ,CAAC;AAC3B,UAAA,CAAS,CAAC;AACV,QAAA;;AAEA;QACM,IAAIe,KAAK,GAAGX,MAAM,CAAChB,GAAG,CAACC,GAAG,EAAED,GAAG,CAACE,IAAI,CAAC;AACrCF,QAAAA,GAAG,CAACK,SAAS,IAAIsB,KAAK,CAACJ,MAAM;AAC7BH,QAAAA,CAAC,CAACQ,QAAQ,CAACD,KAAK,CAAC;;AAEvB;AACM3B,QAAAA,GAAG,CAACC,GAAG,GAAGiB,SAAS,CAACF,MAAM,CAAChB,GAAG,CAACC,GAAG,EAAEgB,SAAS,CAACjB,GAAG,CAACE,IAAI,CAAC,CAAC,CAAC;AACzDF,QAAAA,GAAG,CAACE,IAAI,GAAGiB,UAAU,CAACH,MAAM,CAAChB,GAAG,CAACC,GAAG,EAAED,GAAG,CAACE,IAAI,CAAC,CAAC;AAEhDlB,QAAAA,KAAK,CAACI,IAAI,CAACyC,YAAY,CAACjB,QAAQ,CAAC;AACvC,MAAA;IACA,CAAG;;AAEH;AACA;AACA;AACA;AACA;AACA;AACA;AACEZ,IAAAA,GAAG,CAACe,YAAY,GAAG,UAASF,KAAK,EAAE;AACrC;AACI,MAAA,IAAIG,MAAM,GAAGhB,GAAG,CAACD,MAAM,CAACiB,MAAM;AAC9B,MAAA,IAAIC,SAAS,GAAGjB,GAAG,CAACD,MAAM,CAACkB,SAAS;AACpC,MAAA,IAAIC,SAAS,GAAGlB,GAAG,CAACD,MAAM,CAACmB,SAAS;AACpC,MAAA,IAAIC,UAAU,GAAGnB,GAAG,CAACD,MAAM,CAACoB,UAAU;;AAE1C;AACA;AACA;AACA;AACA;MACInB,GAAG,CAACC,GAAG,GAAG,IAAI;MAEd,IAAImB,CAAC,GAAGpC,KAAK,CAACI,IAAI,CAACiC,YAAY,EAAE;AACjC,MAAA,OAAMD,CAAC,CAACG,MAAM,EAAE,GAAGV,KAAK,EAAE;AAC9B;AACM,QAAA,IAAGb,GAAG,CAACK,SAAS,GAAG,OAAO,EAAE;UAC1BL,GAAG,CAACC,GAAG,GAAG,IAAI;AACtB,QAAA;AAEM,QAAA,IAAGD,GAAG,CAACC,GAAG,KAAK,IAAI,EAAE;AACnB6B,UAAAA,WAAW,EAAE;AACrB,QAAA;;AAEA;QACM,IAAIH,KAAK,GAAGX,MAAM,CAAChB,GAAG,CAACC,GAAG,EAAED,GAAG,CAACE,IAAI,CAAC;AACrCF,QAAAA,GAAG,CAACK,SAAS,IAAIsB,KAAK,CAACJ,MAAM;AAC7BH,QAAAA,CAAC,CAACQ,QAAQ,CAACD,KAAK,CAAC;;AAEvB;AACM3B,QAAAA,GAAG,CAACC,GAAG,GAAGiB,SAAS,CAACF,MAAM,CAAChB,GAAG,CAACC,GAAG,EAAEgB,SAAS,CAACjB,GAAG,CAACE,IAAI,CAAC,CAAC,CAAC;AACzDF,QAAAA,GAAG,CAACE,IAAI,GAAGiB,UAAU,CAACH,MAAM,CAAChB,GAAG,CAACC,GAAG,EAAED,GAAG,CAACE,IAAI,CAAC,CAAC;AACtD,MAAA;AAEI,MAAA,OAAOkB,CAAC,CAACI,QAAQ,CAACX,KAAK,CAAC;IAC5B,CAAG;;AAEH;AACA;AACA;AACA;AACA;IACE,SAASa,OAAOA,CAACZ,QAAQ,EAAE;MACzB,IAAGd,GAAG,CAACQ,KAAK,CAAC,CAAC,CAAC,CAACuB,aAAa,IAAI,EAAE,EAAE;AACnCC,QAAAA,KAAK,EAAE;QACP,OAAOlB,QAAQ,EAAE;AACvB,MAAA;AACA;AACI,MAAA,IAAImB,MAAM,GAAI,EAAE,GAAGjC,GAAG,CAACQ,KAAK,CAAC,CAAC,CAAC,CAACuB,aAAa,IAAK,CAAC;MACnD/B,GAAG,CAACkC,QAAQ,CAACD,MAAM,EAAE,UAASX,GAAG,EAAEK,KAAK,EAAE;AACxC,QAAA,IAAGL,GAAG,EAAE;UACN,OAAOR,QAAQ,CAACQ,GAAG,CAAC;AAC5B,QAAA;AACMtB,QAAAA,GAAG,CAACmC,OAAO,CAACR,KAAK,CAAC;AAClBK,QAAAA,KAAK,EAAE;AACPlB,QAAAA,QAAQ,EAAE;AAChB,MAAA,CAAK,CAAC;AACN,IAAA;;AAEA;AACA;AACA;IACE,SAASgB,WAAWA,GAAG;MACrB,IAAG9B,GAAG,CAACQ,KAAK,CAAC,CAAC,CAAC,CAACuB,aAAa,IAAI,EAAE,EAAE;QACnC,OAAOC,KAAK,EAAE;AACpB,MAAA;AACA;AACI,MAAA,IAAIC,MAAM,GAAI,EAAE,GAAGjC,GAAG,CAACQ,KAAK,CAAC,CAAC,CAAC,CAACuB,aAAa,IAAK,CAAC;MACnD/B,GAAG,CAACmC,OAAO,CAACnC,GAAG,CAACoC,YAAY,CAACH,MAAM,CAAC,CAAC;AACrCD,MAAAA,KAAK,EAAE;AACX,IAAA;;AAEA;AACA;AACA;IACE,SAASA,KAAKA,GAAG;AACnB;AACIhC,MAAAA,GAAG,CAACI,OAAO,GAAIJ,GAAG,CAACI,OAAO,KAAK,UAAU,GAAI,CAAC,GAAGJ,GAAG,CAACI,OAAO,GAAG,CAAC;;AAEpE;AACA;AACA;;AAEA;MACI,IAAIG,EAAE,GAAGP,GAAG,CAACD,MAAM,CAACQ,EAAE,CAACT,MAAM,EAAE;;AAEnC;AACIS,MAAAA,EAAE,CAAC8B,MAAM,CAACrC,GAAG,CAACM,QAAQ,CAAC;;AAE3B;AACA;MACI,IAAIgC,MAAM,GAAG,CAAC;MACd,KAAI,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG,EAAE,EAAE,EAAEA,CAAC,EAAE;AAC1B,QAAA,IAAGvC,GAAG,CAACI,OAAO,GAAGkC,MAAM,KAAK,CAAC,EAAE;AAC7B/B,UAAAA,EAAE,CAAC8B,MAAM,CAACrC,GAAG,CAACQ,KAAK,CAAC+B,CAAC,CAAC,CAACC,MAAM,EAAE,CAAChB,QAAQ,EAAE,CAAC;UAC3CxB,GAAG,CAACQ,KAAK,CAAC+B,CAAC,CAAC,CAACE,KAAK,EAAE;AAC5B,QAAA;QACMH,MAAM,GAAGA,MAAM,IAAI,CAAC;AAC1B,MAAA;;AAEA;MACItC,GAAG,CAACM,QAAQ,GAAGC,EAAE,CAACiC,MAAM,EAAE,CAAChB,QAAQ,EAAE;;AAEzC;AACA;AACA;AACA;MACIjB,EAAE,CAACkC,KAAK,EAAE;AACVlC,MAAAA,EAAE,CAAC8B,MAAM,CAACrC,GAAG,CAACM,QAAQ,CAAC;MACvB,IAAIoC,SAAS,GAAGnC,EAAE,CAACiC,MAAM,EAAE,CAAChB,QAAQ,EAAE;;AAE1C;AACIxB,MAAAA,GAAG,CAACC,GAAG,GAAGD,GAAG,CAACD,MAAM,CAACmB,SAAS,CAAClB,GAAG,CAACM,QAAQ,CAAC;MAC5CN,GAAG,CAACE,IAAI,GAAGF,GAAG,CAACD,MAAM,CAACoB,UAAU,CAACuB,SAAS,CAAC;MAC3C1C,GAAG,CAACK,SAAS,GAAG,CAAC;AACrB,IAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;IACE,SAASsC,eAAeA,CAACV,MAAM,EAAE;AACnC;MACI,IAAIW,eAAe,GAAG,IAAI;AAC1B,MAAA,IAAIC,WAAW,GAAG7D,KAAK,CAACI,IAAI,CAACyD,WAAW;MACxC,IAAI1D,OAAO,GAAG0D,WAAW,CAACC,MAAM,IAAID,WAAW,CAACE,QAAQ;AACxD,MAAA,IAAG5D,OAAO,IAAIA,OAAO,CAACyD,eAAe,EAAE;AACrCA,QAAAA,eAAe,GAAG,UAASI,GAAG,EAAE;AAC9B,UAAA,OAAO7D,OAAO,CAACyD,eAAe,CAACI,GAAG,CAAC;QAC3C,CAAO;AACP,MAAA;MAEI,IAAI5B,CAAC,GAAGpC,KAAK,CAACI,IAAI,CAACiC,YAAY,EAAE;AACjC,MAAA,IAAGuB,eAAe,EAAE;AAClB,QAAA,OAAMxB,CAAC,CAACG,MAAM,EAAE,GAAGU,MAAM,EAAE;AACjC;AACA;UACQ,IAAIpB,KAAK,GAAGoC,IAAI,CAACC,GAAG,CAAC,CAAC,EAAED,IAAI,CAACE,GAAG,CAAClB,MAAM,GAAGb,CAAC,CAACG,MAAM,EAAE,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;UACjE,IAAI6B,OAAO,GAAG,IAAIC,WAAW,CAACJ,IAAI,CAACK,KAAK,CAACzC,KAAK,CAAC,CAAC;UAChD,IAAI;YACF+B,eAAe,CAACQ,OAAO,CAAC;AACxB,YAAA,KAAI,IAAI1C,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG0C,OAAO,CAAC7B,MAAM,EAAE,EAAEb,CAAC,EAAE;AACtCU,cAAAA,CAAC,CAACmC,QAAQ,CAACH,OAAO,CAAC1C,CAAC,CAAC,CAAC;AAClC,YAAA;UACA,CAAS,CAAC,OAAM8C,CAAC,EAAE;AACnB;YACU,IAAG,EAAE,OAAOC,kBAAkB,KAAK,WAAW,IAC5CD,CAAC,YAAYC,kBAAkB,CAAC,EAAE;AAClC,cAAA,MAAMD,CAAC;AACnB,YAAA;AACA,UAAA;AACA,QAAA;AACA,MAAA;;AAEA;AACI,MAAA,IAAGpC,CAAC,CAACG,MAAM,EAAE,GAAGU,MAAM,EAAE;AAC5B;AACA;AACA;AACM,QAAA,IAAIyB,EAAE,EAAEC,EAAE,EAAEC,IAAI;AAChB,QAAA,IAAI1D,IAAI,GAAG+C,IAAI,CAACK,KAAK,CAACL,IAAI,CAACY,MAAM,EAAE,GAAG,QAAQ,CAAC;AAC/C,QAAA,OAAMzC,CAAC,CAACG,MAAM,EAAE,GAAGU,MAAM,EAAE;AACzB0B,UAAAA,EAAE,GAAG,KAAK,IAAIzD,IAAI,GAAG,MAAM,CAAC;AAC5BwD,UAAAA,EAAE,GAAG,KAAK,IAAIxD,IAAI,IAAI,EAAE,CAAC;AACzByD,UAAAA,EAAE,IAAI,CAACD,EAAE,GAAG,MAAM,KAAK,EAAE;UACzBC,EAAE,IAAID,EAAE,IAAI,EAAE;UACdC,EAAE,GAAG,CAACA,EAAE,GAAG,UAAU,KAAKA,EAAE,IAAI,EAAE,CAAC;UACnCzD,IAAI,GAAGyD,EAAE,GAAG,UAAU;;AAE9B;UACQ,KAAI,IAAIjD,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG,CAAC,EAAE,EAAEA,CAAC,EAAE;AACnC;AACUkD,YAAAA,IAAI,GAAG1D,IAAI,MAAMQ,CAAC,IAAI,CAAC,CAAC;AACxBkD,YAAAA,IAAI,IAAIX,IAAI,CAACK,KAAK,CAACL,IAAI,CAACY,MAAM,EAAE,GAAG,MAAM,CAAC;AAC1CzC,YAAAA,CAAC,CAAC0C,OAAO,CAACF,IAAI,GAAG,IAAI,CAAC;AAChC,UAAA;AACA,QAAA;AACA,MAAA;AAEI,MAAA,OAAOxC,CAAC,CAACI,QAAQ,CAACS,MAAM,CAAC;AAC7B,IAAA;AACA;AACE,IAAA,IAAG9C,OAAO,EAAE;AACd;AACIa,MAAAA,GAAG,CAACkC,QAAQ,GAAG,UAASD,MAAM,EAAEnB,QAAQ,EAAE;QACxC3B,OAAO,CAAC4E,WAAW,CAAC9B,MAAM,EAAE,UAASX,GAAG,EAAEK,KAAK,EAAE;AAC/C,UAAA,IAAGL,GAAG,EAAE;YACN,OAAOR,QAAQ,CAACQ,GAAG,CAAC;AAC9B,UAAA;UACQR,QAAQ,CAAC,IAAI,EAAEa,KAAK,CAACqC,QAAQ,EAAE,CAAC;AACxC,QAAA,CAAO,CAAC;MACR,CAAK;AACL;AACIhE,MAAAA,GAAG,CAACoC,YAAY,GAAG,UAASH,MAAM,EAAE;QAClC,OAAO9C,OAAO,CAAC4E,WAAW,CAAC9B,MAAM,CAAC,CAAC+B,QAAQ,EAAE;MACnD,CAAK;AACL,IAAA,CAAG,MAAM;AACLhE,MAAAA,GAAG,CAACkC,QAAQ,GAAG,UAASD,MAAM,EAAEnB,QAAQ,EAAE;QACxC,IAAI;AACFA,UAAAA,QAAQ,CAAC,IAAI,EAAE6B,eAAe,CAACV,MAAM,CAAC,CAAC;QAC/C,CAAO,CAAC,OAAMuB,CAAC,EAAE;UACT1C,QAAQ,CAAC0C,CAAC,CAAC;AACnB,QAAA;MACA,CAAK;MACDxD,GAAG,CAACoC,YAAY,GAAGO,eAAe;AACtC,IAAA;;AAEA;AACA;AACA;AACA;AACA;AACE3C,IAAAA,GAAG,CAACmC,OAAO,GAAG,UAASR,KAAK,EAAE;AAChC;AACI,MAAA,IAAId,KAAK,GAAGc,KAAK,CAACJ,MAAM;MACxB,KAAI,IAAIb,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGG,KAAK,EAAE,EAAEH,CAAC,EAAE;AAC7BV,QAAAA,GAAG,CAACQ,KAAK,CAACR,GAAG,CAACW,IAAI,CAAC,CAAC0B,MAAM,CAACV,KAAK,CAACsC,MAAM,CAACvD,CAAC,EAAE,CAAC,CAAC,CAAC;AAC9CV,QAAAA,GAAG,CAACW,IAAI,GAAIX,GAAG,CAACW,IAAI,KAAK,EAAE,GAAI,CAAC,GAAGX,GAAG,CAACW,IAAI,GAAG,CAAC;AACrD,MAAA;IACA,CAAG;;AAEH;AACA;AACA;AACA;AACA;AACA;AACEX,IAAAA,GAAG,CAACkE,UAAU,GAAG,UAASxD,CAAC,EAAEyD,CAAC,EAAE;MAC9B,IAAIxC,KAAK,GAAG,EAAE;AACd,MAAA,KAAI,IAAIyC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGD,CAAC,EAAEC,CAAC,IAAI,CAAC,EAAE;QAC5BzC,KAAK,IAAI0C,MAAM,CAACC,YAAY,CAAE5D,CAAC,IAAI0D,CAAC,GAAI,IAAI,CAAC;AACnD,MAAA;AACIpE,MAAAA,GAAG,CAACmC,OAAO,CAACR,KAAK,CAAC;IACtB,CAAG;;AAEH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACE3B,IAAAA,GAAG,CAACuE,cAAc,GAAG,UAASC,MAAM,EAAE;AACxC;MACI,IAAGA,MAAM,KAAKC,IAAI,EAAE;AAClBzE,QAAAA,GAAG,CAACkC,QAAQ,GAAG,UAASD,MAAM,EAAEnB,QAAQ,EAAE;UACxC,SAAS4D,QAAQA,CAAClB,CAAC,EAAE;AACnB,YAAA,IAAImB,IAAI,GAAGnB,CAAC,CAACmB,IAAI;YACjB,IAAGA,IAAI,CAAC3F,KAAK,IAAI2F,IAAI,CAAC3F,KAAK,CAACW,IAAI,EAAE;AAChC8E,cAAAA,IAAI,CAACG,mBAAmB,CAAC,SAAS,EAAEF,QAAQ,CAAC;AAC7C5D,cAAAA,QAAQ,CAAC6D,IAAI,CAAC3F,KAAK,CAACW,IAAI,CAAC2B,GAAG,EAAEqD,IAAI,CAAC3F,KAAK,CAACW,IAAI,CAACgC,KAAK,CAAC;AAChE,YAAA;AACA,UAAA;AACQ8C,UAAAA,IAAI,CAACI,gBAAgB,CAAC,SAAS,EAAEH,QAAQ,CAAC;UAC1CD,IAAI,CAACK,WAAW,CAAC;AAAC9F,YAAAA,KAAK,EAAE;AAACW,cAAAA,IAAI,EAAE;AAACsC,gBAAAA,MAAM,EAAEA;AAAM;AAAC;AAAC,WAAC,CAAC;QAC3D,CAAO;AACP,MAAA,CAAK,MAAM;AACX;AACM,QAAA,IAAIyC,QAAQ,GAAG,UAASlB,CAAC,EAAE;AACzB,UAAA,IAAImB,IAAI,GAAGnB,CAAC,CAACmB,IAAI;UACjB,IAAGA,IAAI,CAAC3F,KAAK,IAAI2F,IAAI,CAAC3F,KAAK,CAACW,IAAI,EAAE;AAChCK,YAAAA,GAAG,CAACkC,QAAQ,CAACyC,IAAI,CAAC3F,KAAK,CAACW,IAAI,CAACsC,MAAM,EAAE,UAASX,GAAG,EAAEK,KAAK,EAAE;cACxD6C,MAAM,CAACM,WAAW,CAAC;AAAC9F,gBAAAA,KAAK,EAAE;AAACW,kBAAAA,IAAI,EAAE;AAAC2B,oBAAAA,GAAG,EAAEA,GAAG;AAAEK,oBAAAA,KAAK,EAAEA;AAAK;AAAC;AAAC,eAAC,CAAC;AACzE,YAAA,CAAW,CAAC;AACZ,UAAA;QACA,CAAO;AACP;AACM6C,QAAAA,MAAM,CAACK,gBAAgB,CAAC,SAAS,EAAEH,QAAQ,CAAC;AAClD,MAAA;IACA,CAAG;AAED,IAAA,OAAO1E,GAAG;EACZ,CAAC;;;;;;","x_google_ignoreList":[0]}