pixel-react 1.15.21 → 1.15.23

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

@@ -0,0 +1,125 @@
+import { __module as pki } from '../../../_virtual/pki.js';
+import { __require as requireForge } from './forge.js';
+import { __require as requireAsn1 } from './asn1.js';
+import { __require as requireOids } from './oids.js';
+import { __require as requirePbe } from './pbe.js';
+import { __require as requirePem } from './pem.js';
+import { __require as requirePbkdf2 } from './pbkdf2.js';
+import { __require as requirePkcs12 } from './pkcs12.js';
+import { __require as requirePss } from './pss.js';
+import { __require as requireRsa } from './rsa.js';
+import { __require as requireUtil } from './util.js';
+import { __require as requireX509 } from './x509.js';
+
+/**
+ * Javascript implementation of a basic Public Key Infrastructure, including
+ * support for RSA public and private keys.
+ *
+ * @author Dave Longley
+ *
+ * Copyright (c) 2010-2013 Digital Bazaar, Inc.
+ */
+var hasRequiredPki;
+function requirePki() {
+  if (hasRequiredPki) return pki.exports;
+  hasRequiredPki = 1;
+  var forge = requireForge();
+  requireAsn1();
+  requireOids();
+  requirePbe();
+  requirePem();
+  requirePbkdf2();
+  requirePkcs12();
+  requirePss();
+  requireRsa();
+  requireUtil();
+  requireX509();
+
+  // shortcut for asn.1 API
+  var asn1 = forge.asn1;
+
+  /* Public Key Infrastructure (PKI) implementation. */
+  var pki$1 = pki.exports = forge.pki = forge.pki || {};
+
+  /**
+   * NOTE: THIS METHOD IS DEPRECATED. Use pem.decode() instead.
+   *
+   * Converts PEM-formatted data to DER.
+   *
+   * @param pem the PEM-formatted data.
+   *
+   * @return the DER-formatted data.
+   */
+  pki$1.pemToDer = function (pem) {
+    var msg = forge.pem.decode(pem)[0];
+    if (msg.procType && msg.procType.type === 'ENCRYPTED') {
+      throw new Error('Could not convert PEM to DER; PEM is encrypted.');
+    }
+    return forge.util.createBuffer(msg.body);
+  };
+
+  /**
+   * Converts an RSA private key from PEM format.
+   *
+   * @param pem the PEM-formatted private key.
+   *
+   * @return the private key.
+   */
+  pki$1.privateKeyFromPem = function (pem) {
+    var msg = forge.pem.decode(pem)[0];
+    if (msg.type !== 'PRIVATE KEY' && msg.type !== 'RSA PRIVATE KEY') {
+      var error = new Error('Could not convert private key from PEM; PEM ' + 'header type is not "PRIVATE KEY" or "RSA PRIVATE KEY".');
+      error.headerType = msg.type;
+      throw error;
+    }
+    if (msg.procType && msg.procType.type === 'ENCRYPTED') {
+      throw new Error('Could not convert private key from PEM; PEM is encrypted.');
+    }
+
+    // convert DER to ASN.1 object
+    var obj = asn1.fromDer(msg.body);
+    return pki$1.privateKeyFromAsn1(obj);
+  };
+
+  /**
+   * Converts an RSA private key to PEM format.
+   *
+   * @param key the private key.
+   * @param maxline the maximum characters per line, defaults to 64.
+   *
+   * @return the PEM-formatted private key.
+   */
+  pki$1.privateKeyToPem = function (key, maxline) {
+    // convert to ASN.1, then DER, then PEM-encode
+    var msg = {
+      type: 'RSA PRIVATE KEY',
+      body: asn1.toDer(pki$1.privateKeyToAsn1(key)).getBytes()
+    };
+    return forge.pem.encode(msg, {
+      maxline: maxline
+    });
+  };
+
+  /**
+   * Converts a PrivateKeyInfo to PEM format.
+   *
+   * @param pki the PrivateKeyInfo.
+   * @param maxline the maximum characters per line, defaults to 64.
+   *
+   * @return the PEM-formatted private key.
+   */
+  pki$1.privateKeyInfoToPem = function (pki, maxline) {
+    // convert to DER, then PEM-encode
+    var msg = {
+      type: 'PRIVATE KEY',
+      body: asn1.toDer(pki).getBytes()
+    };
+    return forge.pem.encode(msg, {
+      maxline: maxline
+    });
+  };
+  return pki.exports;
+}
+
+export { requirePki as __require };
+//# sourceMappingURL=pki.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"pki.js","sources":["../../../../node_modules/node-forge/lib/pki.js"],"sourcesContent":["/**\n * Javascript implementation of a basic Public Key Infrastructure, including\n * support for RSA public and private keys.\n *\n * @author Dave Longley\n *\n * Copyright (c) 2010-2013 Digital Bazaar, Inc.\n */\nvar forge = require('./forge');\nrequire('./asn1');\nrequire('./oids');\nrequire('./pbe');\nrequire('./pem');\nrequire('./pbkdf2');\nrequire('./pkcs12');\nrequire('./pss');\nrequire('./rsa');\nrequire('./util');\nrequire('./x509');\n\n// shortcut for asn.1 API\nvar asn1 = forge.asn1;\n\n/* Public Key Infrastructure (PKI) implementation. */\nvar pki = module.exports = forge.pki = forge.pki || {};\n\n/**\n * NOTE: THIS METHOD IS DEPRECATED. Use pem.decode() instead.\n *\n * Converts PEM-formatted data to DER.\n *\n * @param pem the PEM-formatted data.\n *\n * @return the DER-formatted data.\n */\npki.pemToDer = function(pem) {\n  var msg = forge.pem.decode(pem)[0];\n  if(msg.procType && msg.procType.type === 'ENCRYPTED') {\n    throw new Error('Could not convert PEM to DER; PEM is encrypted.');\n  }\n  return forge.util.createBuffer(msg.body);\n};\n\n/**\n * Converts an RSA private key from PEM format.\n *\n * @param pem the PEM-formatted private key.\n *\n * @return the private key.\n */\npki.privateKeyFromPem = function(pem) {\n  var msg = forge.pem.decode(pem)[0];\n\n  if(msg.type !== 'PRIVATE KEY' && msg.type !== 'RSA PRIVATE KEY') {\n    var error = new Error('Could not convert private key from PEM; PEM ' +\n      'header type is not \"PRIVATE KEY\" or \"RSA PRIVATE KEY\".');\n    error.headerType = msg.type;\n    throw error;\n  }\n  if(msg.procType && msg.procType.type === 'ENCRYPTED') {\n    throw new Error('Could not convert private key from PEM; PEM is encrypted.');\n  }\n\n  // convert DER to ASN.1 object\n  var obj = asn1.fromDer(msg.body);\n\n  return pki.privateKeyFromAsn1(obj);\n};\n\n/**\n * Converts an RSA private key to PEM format.\n *\n * @param key the private key.\n * @param maxline the maximum characters per line, defaults to 64.\n *\n * @return the PEM-formatted private key.\n */\npki.privateKeyToPem = function(key, maxline) {\n  // convert to ASN.1, then DER, then PEM-encode\n  var msg = {\n    type: 'RSA PRIVATE KEY',\n    body: asn1.toDer(pki.privateKeyToAsn1(key)).getBytes()\n  };\n  return forge.pem.encode(msg, {maxline: maxline});\n};\n\n/**\n * Converts a PrivateKeyInfo to PEM format.\n *\n * @param pki the PrivateKeyInfo.\n * @param maxline the maximum characters per line, defaults to 64.\n *\n * @return the PEM-formatted private key.\n */\npki.privateKeyInfoToPem = function(pki, maxline) {\n  // convert to DER, then PEM-encode\n  var msg = {\n    type: 'PRIVATE KEY',\n    body: asn1.toDer(pki).getBytes()\n  };\n  return forge.pem.encode(msg, {maxline: maxline});\n};\n"],"names":["forge","require$$0","require$$1","require$$2","require$$3","require$$4","require$$5","require$$6","require$$7","require$$8","require$$9","require$$10","asn1","pki","pkiModule","exports","pemToDer","pem","msg","decode","procType","type","Error","util","createBuffer","body","privateKeyFromPem","error","headerType","obj","fromDer","privateKeyFromAsn1","privateKeyToPem","key","maxline","toDer","privateKeyToAsn1","getBytes","encode","privateKeyInfoToPem"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;AAQA,EAAA,IAAIA,KAAK,GAAGC,YAAA,EAAkB;AAC9BC,EAAAA,WAAA,EAAiB;AACjBC,EAAAA,WAAA,EAAiB;AACjBC,EAAAA,UAAA,EAAgB;AAChBC,EAAAA,UAAA,EAAgB;AAChBC,EAAAA,aAAA,EAAmB;AACnBC,EAAAA,aAAA,EAAmB;AACnBC,EAAAA,UAAA,EAAgB;AAChBC,EAAAA,UAAA,EAAgB;AAChBC,EAAAA,WAAA,EAAiB;AACjBC,EAAAA,WAAA,EAAiB;;AAEjB;AACA,EAAA,IAAIC,IAAI,GAAGZ,KAAK,CAACY,IAAI;;AAErB;AACA,EAAA,IAAIC,KAAG,GAAGC,GAAA,CAAAC,OAAc,GAAGf,KAAK,CAACa,GAAG,GAAGb,KAAK,CAACa,GAAG,IAAI,EAAE;;AAEtD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACAA,EAAAA,KAAG,CAACG,QAAQ,GAAG,UAASC,GAAG,EAAE;AAC3B,IAAA,IAAIC,GAAG,GAAGlB,KAAK,CAACiB,GAAG,CAACE,MAAM,CAACF,GAAG,CAAC,CAAC,CAAC,CAAC;IAClC,IAAGC,GAAG,CAACE,QAAQ,IAAIF,GAAG,CAACE,QAAQ,CAACC,IAAI,KAAK,WAAW,EAAE;AACpD,MAAA,MAAM,IAAIC,KAAK,CAAC,iDAAiD,CAAC;AACtE,IAAA;IACE,OAAOtB,KAAK,CAACuB,IAAI,CAACC,YAAY,CAACN,GAAG,CAACO,IAAI,CAAC;EAC1C,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACAZ,EAAAA,KAAG,CAACa,iBAAiB,GAAG,UAAST,GAAG,EAAE;AACpC,IAAA,IAAIC,GAAG,GAAGlB,KAAK,CAACiB,GAAG,CAACE,MAAM,CAACF,GAAG,CAAC,CAAC,CAAC,CAAC;IAElC,IAAGC,GAAG,CAACG,IAAI,KAAK,aAAa,IAAIH,GAAG,CAACG,IAAI,KAAK,iBAAiB,EAAE;MAC/D,IAAIM,KAAK,GAAG,IAAIL,KAAK,CAAC,8CAA8C,GAClE,wDAAwD,CAAC;AAC3DK,MAAAA,KAAK,CAACC,UAAU,GAAGV,GAAG,CAACG,IAAI;AAC3B,MAAA,MAAMM,KAAK;AACf,IAAA;IACE,IAAGT,GAAG,CAACE,QAAQ,IAAIF,GAAG,CAACE,QAAQ,CAACC,IAAI,KAAK,WAAW,EAAE;AACpD,MAAA,MAAM,IAAIC,KAAK,CAAC,2DAA2D,CAAC;AAChF,IAAA;;AAEA;IACE,IAAIO,GAAG,GAAGjB,IAAI,CAACkB,OAAO,CAACZ,GAAG,CAACO,IAAI,CAAC;AAEhC,IAAA,OAAOZ,KAAG,CAACkB,kBAAkB,CAACF,GAAG,CAAC;EACpC,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACAhB,EAAAA,KAAG,CAACmB,eAAe,GAAG,UAASC,GAAG,EAAEC,OAAO,EAAE;AAC7C;AACE,IAAA,IAAIhB,GAAG,GAAG;AACRG,MAAAA,IAAI,EAAE,iBAAiB;AACvBI,MAAAA,IAAI,EAAEb,IAAI,CAACuB,KAAK,CAACtB,KAAG,CAACuB,gBAAgB,CAACH,GAAG,CAAC,CAAC,CAACI,QAAQ;KACrD;AACD,IAAA,OAAOrC,KAAK,CAACiB,GAAG,CAACqB,MAAM,CAACpB,GAAG,EAAE;AAACgB,MAAAA,OAAO,EAAEA;AAAO,KAAC,CAAC;EAClD,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACArB,EAAAA,KAAG,CAAC0B,mBAAmB,GAAG,UAAS1B,GAAG,EAAEqB,OAAO,EAAE;AACjD;AACE,IAAA,IAAIhB,GAAG,GAAG;AACRG,MAAAA,IAAI,EAAE,aAAa;MACnBI,IAAI,EAAEb,IAAI,CAACuB,KAAK,CAACtB,GAAG,CAAC,CAACwB,QAAQ;KAC/B;AACD,IAAA,OAAOrC,KAAK,CAACiB,GAAG,CAACqB,MAAM,CAACpB,GAAG,EAAE;AAACgB,MAAAA,OAAO,EAAEA;AAAO,KAAC,CAAC;EAClD,CAAC;;;;;;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,297 @@
+import { __module as prime } from '../../../_virtual/prime.js';
+import { __require as requireForge } from './forge.js';
+import { __require as requireUtil } from './util.js';
+import { __require as requireJsbn } from './jsbn.js';
+import { __require as requireRandom } from './random.js';
+
+/**
+ * Prime number generation API.
+ *
+ * @author Dave Longley
+ *
+ * Copyright (c) 2014 Digital Bazaar, Inc.
+ */
+var hasRequiredPrime;
+function requirePrime() {
+  if (hasRequiredPrime) return prime.exports;
+  hasRequiredPrime = 1;
+  var forge = requireForge();
+  requireUtil();
+  requireJsbn();
+  requireRandom();
+  (function () {
+    // forge.prime already defined
+    if (forge.prime) {
+      prime.exports = forge.prime;
+      return;
+    }
+
+    /* PRIME API */
+    var prime$1 = prime.exports = forge.prime = forge.prime || {};
+    var BigInteger = forge.jsbn.BigInteger;
+
+    // primes are 30k+i for i = 1, 7, 11, 13, 17, 19, 23, 29
+    var GCD_30_DELTA = [6, 4, 2, 4, 2, 4, 6, 2];
+    var THIRTY = new BigInteger(null);
+    THIRTY.fromInt(30);
+    var op_or = function (x, y) {
+      return x | y;
+    };
+
+    /**
+     * Generates a random probable prime with the given number of bits.
+     *
+     * Alternative algorithms can be specified by name as a string or as an
+     * object with custom options like so:
+     *
+     * {
+     *   name: 'PRIMEINC',
+     *   options: {
+     *     maxBlockTime: <the maximum amount of time to block the main
+     *       thread before allowing I/O other JS to run>,
+     *     millerRabinTests: <the number of miller-rabin tests to run>,
+     *     workerScript: <the worker script URL>,
+     *     workers: <the number of web workers (if supported) to use,
+     *       -1 to use estimated cores minus one>.
+     *     workLoad: the size of the work load, ie: number of possible prime
+     *       numbers for each web worker to check per work assignment,
+     *       (default: 100).
+     *   }
+     * }
+     *
+     * @param bits the number of bits for the prime number.
+     * @param options the options to use.
+     *          [algorithm] the algorithm to use (default: 'PRIMEINC').
+     *          [prng] a custom crypto-secure pseudo-random number generator to use,
+     *            that must define "getBytesSync".
+     *
+     * @return callback(err, num) called once the operation completes.
+     */
+    prime$1.generateProbablePrime = function (bits, options, callback) {
+      if (typeof options === 'function') {
+        callback = options;
+        options = {};
+      }
+      options = options || {};
+
+      // default to PRIMEINC algorithm
+      var algorithm = options.algorithm || 'PRIMEINC';
+      if (typeof algorithm === 'string') {
+        algorithm = {
+          name: algorithm
+        };
+      }
+      algorithm.options = algorithm.options || {};
+
+      // create prng with api that matches BigInteger secure random
+      var prng = options.prng || forge.random;
+      var rng = {
+        // x is an array to fill with bytes
+        nextBytes: function (x) {
+          var b = prng.getBytesSync(x.length);
+          for (var i = 0; i < x.length; ++i) {
+            x[i] = b.charCodeAt(i);
+          }
+        }
+      };
+      if (algorithm.name === 'PRIMEINC') {
+        return primeincFindPrime(bits, rng, algorithm.options, callback);
+      }
+      throw new Error('Invalid prime generation algorithm: ' + algorithm.name);
+    };
+    function primeincFindPrime(bits, rng, options, callback) {
+      if ('workers' in options) {
+        return primeincFindPrimeWithWorkers(bits, rng, options, callback);
+      }
+      return primeincFindPrimeWithoutWorkers(bits, rng, options, callback);
+    }
+    function primeincFindPrimeWithoutWorkers(bits, rng, options, callback) {
+      // initialize random number
+      var num = generateRandom(bits, rng);
+
+      /* Note: All primes are of the form 30k+i for i < 30 and gcd(30, i)=1. The
+      number we are given is always aligned at 30k + 1. Each time the number is
+      determined not to be prime we add to get to the next 'i', eg: if the number
+      was at 30k + 1 we add 6. */
+      var deltaIdx = 0;
+
+      // get required number of MR tests
+      var mrTests = getMillerRabinTests(num.bitLength());
+      if ('millerRabinTests' in options) {
+        mrTests = options.millerRabinTests;
+      }
+
+      // find prime nearest to 'num' for maxBlockTime ms
+      // 10 ms gives 5ms of leeway for other calculations before dropping
+      // below 60fps (1000/60 == 16.67), but in reality, the number will
+      // likely be higher due to an 'atomic' big int modPow
+      var maxBlockTime = 10;
+      if ('maxBlockTime' in options) {
+        maxBlockTime = options.maxBlockTime;
+      }
+      _primeinc(num, bits, rng, deltaIdx, mrTests, maxBlockTime, callback);
+    }
+    function _primeinc(num, bits, rng, deltaIdx, mrTests, maxBlockTime, callback) {
+      var start = +new Date();
+      do {
+        // overflow, regenerate random number
+        if (num.bitLength() > bits) {
+          num = generateRandom(bits, rng);
+        }
+        // do primality test
+        if (num.isProbablePrime(mrTests)) {
+          return callback(null, num);
+        }
+        // get next potential prime
+        num.dAddOffset(GCD_30_DELTA[deltaIdx++ % 8], 0);
+      } while (maxBlockTime < 0 || +new Date() - start < maxBlockTime);
+
+      // keep trying later
+      forge.util.setImmediate(function () {
+        _primeinc(num, bits, rng, deltaIdx, mrTests, maxBlockTime, callback);
+      });
+    }
+
+    // NOTE: This algorithm is indeterminate in nature because workers
+    // run in parallel looking at different segments of numbers. Even if this
+    // algorithm is run twice with the same input from a predictable RNG, it
+    // may produce different outputs.
+    function primeincFindPrimeWithWorkers(bits, rng, options, callback) {
+      // web workers unavailable
+      if (typeof Worker === 'undefined') {
+        return primeincFindPrimeWithoutWorkers(bits, rng, options, callback);
+      }
+
+      // initialize random number
+      var num = generateRandom(bits, rng);
+
+      // use web workers to generate keys
+      var numWorkers = options.workers;
+      var workLoad = options.workLoad || 100;
+      var range = workLoad * 30 / 8;
+      var workerScript = options.workerScript || 'forge/prime.worker.js';
+      if (numWorkers === -1) {
+        return forge.util.estimateCores(function (err, cores) {
+          if (err) {
+            // default to 2
+            cores = 2;
+          }
+          numWorkers = cores - 1;
+          generate();
+        });
+      }
+      generate();
+      function generate() {
+        // require at least 1 worker
+        numWorkers = Math.max(1, numWorkers);
+
+        // TODO: consider optimizing by starting workers outside getPrime() ...
+        // note that in order to clean up they will have to be made internally
+        // asynchronous which may actually be slower
+
+        // start workers immediately
+        var workers = [];
+        for (var i = 0; i < numWorkers; ++i) {
+          // FIXME: fix path or use blob URLs
+          workers[i] = new Worker(workerScript);
+        }
+
+        // listen for requests from workers and assign ranges to find prime
+        for (var i = 0; i < numWorkers; ++i) {
+          workers[i].addEventListener('message', workerMessage);
+        }
+
+        /* Note: The distribution of random numbers is unknown. Therefore, each
+        web worker is continuously allocated a range of numbers to check for a
+        random number until one is found.
+         Every 30 numbers will be checked just 8 times, because prime numbers
+        have the form:
+         30k+i, for i < 30 and gcd(30, i)=1 (there are 8 values of i for this)
+         Therefore, if we want a web worker to run N checks before asking for
+        a new range of numbers, each range must contain N*30/8 numbers.
+         For 100 checks (workLoad), this is a range of 375. */
+
+        var found = false;
+        function workerMessage(e) {
+          // ignore message, prime already found
+          if (found) {
+            return;
+          }
+          var data = e.data;
+          if (data.found) {
+            // terminate all workers
+            for (var i = 0; i < workers.length; ++i) {
+              workers[i].terminate();
+            }
+            found = true;
+            return callback(null, new BigInteger(data.prime, 16));
+          }
+
+          // overflow, regenerate random number
+          if (num.bitLength() > bits) {
+            num = generateRandom(bits, rng);
+          }
+
+          // assign new range to check
+          var hex = num.toString(16);
+
+          // start prime search
+          e.target.postMessage({
+            hex: hex,
+            workLoad: workLoad
+          });
+          num.dAddOffset(range, 0);
+        }
+      }
+    }
+
+    /**
+     * Generates a random number using the given number of bits and RNG.
+     *
+     * @param bits the number of bits for the number.
+     * @param rng the random number generator to use.
+     *
+     * @return the random number.
+     */
+    function generateRandom(bits, rng) {
+      var num = new BigInteger(bits, rng);
+      // force MSB set
+      var bits1 = bits - 1;
+      if (!num.testBit(bits1)) {
+        num.bitwiseTo(BigInteger.ONE.shiftLeft(bits1), op_or, num);
+      }
+      // align number on 30k+1 boundary
+      num.dAddOffset(31 - num.mod(THIRTY).byteValue(), 0);
+      return num;
+    }
+
+    /**
+     * Returns the required number of Miller-Rabin tests to generate a
+     * prime with an error probability of (1/2)^80.
+     *
+     * See Handbook of Applied Cryptography Chapter 4, Table 4.4.
+     *
+     * @param bits the bit size.
+     *
+     * @return the required number of iterations.
+     */
+    function getMillerRabinTests(bits) {
+      if (bits <= 100) return 27;
+      if (bits <= 150) return 18;
+      if (bits <= 200) return 15;
+      if (bits <= 250) return 12;
+      if (bits <= 300) return 9;
+      if (bits <= 350) return 8;
+      if (bits <= 400) return 7;
+      if (bits <= 500) return 6;
+      if (bits <= 600) return 5;
+      if (bits <= 800) return 4;
+      if (bits <= 1250) return 3;
+      return 2;
+    }
+  })();
+  return prime.exports;
+}
+
+export { requirePrime as __require };
+//# sourceMappingURL=prime.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"prime.js","sources":["../../../../node_modules/node-forge/lib/prime.js"],"sourcesContent":["/**\n * Prime number generation API.\n *\n * @author Dave Longley\n *\n * Copyright (c) 2014 Digital Bazaar, Inc.\n */\nvar forge = require('./forge');\nrequire('./util');\nrequire('./jsbn');\nrequire('./random');\n\n(function() {\n\n// forge.prime already defined\nif(forge.prime) {\n  module.exports = forge.prime;\n  return;\n}\n\n/* PRIME API */\nvar prime = module.exports = forge.prime = forge.prime || {};\n\nvar BigInteger = forge.jsbn.BigInteger;\n\n// primes are 30k+i for i = 1, 7, 11, 13, 17, 19, 23, 29\nvar GCD_30_DELTA = [6, 4, 2, 4, 2, 4, 6, 2];\nvar THIRTY = new BigInteger(null);\nTHIRTY.fromInt(30);\nvar op_or = function(x, y) {return x|y;};\n\n/**\n * Generates a random probable prime with the given number of bits.\n *\n * Alternative algorithms can be specified by name as a string or as an\n * object with custom options like so:\n *\n * {\n *   name: 'PRIMEINC',\n *   options: {\n *     maxBlockTime: <the maximum amount of time to block the main\n *       thread before allowing I/O other JS to run>,\n *     millerRabinTests: <the number of miller-rabin tests to run>,\n *     workerScript: <the worker script URL>,\n *     workers: <the number of web workers (if supported) to use,\n *       -1 to use estimated cores minus one>.\n *     workLoad: the size of the work load, ie: number of possible prime\n *       numbers for each web worker to check per work assignment,\n *       (default: 100).\n *   }\n * }\n *\n * @param bits the number of bits for the prime number.\n * @param options the options to use.\n *          [algorithm] the algorithm to use (default: 'PRIMEINC').\n *          [prng] a custom crypto-secure pseudo-random number generator to use,\n *            that must define \"getBytesSync\".\n *\n * @return callback(err, num) called once the operation completes.\n */\nprime.generateProbablePrime = function(bits, options, callback) {\n  if(typeof options === 'function') {\n    callback = options;\n    options = {};\n  }\n  options = options || {};\n\n  // default to PRIMEINC algorithm\n  var algorithm = options.algorithm || 'PRIMEINC';\n  if(typeof algorithm === 'string') {\n    algorithm = {name: algorithm};\n  }\n  algorithm.options = algorithm.options || {};\n\n  // create prng with api that matches BigInteger secure random\n  var prng = options.prng || forge.random;\n  var rng = {\n    // x is an array to fill with bytes\n    nextBytes: function(x) {\n      var b = prng.getBytesSync(x.length);\n      for(var i = 0; i < x.length; ++i) {\n        x[i] = b.charCodeAt(i);\n      }\n    }\n  };\n\n  if(algorithm.name === 'PRIMEINC') {\n    return primeincFindPrime(bits, rng, algorithm.options, callback);\n  }\n\n  throw new Error('Invalid prime generation algorithm: ' + algorithm.name);\n};\n\nfunction primeincFindPrime(bits, rng, options, callback) {\n  if('workers' in options) {\n    return primeincFindPrimeWithWorkers(bits, rng, options, callback);\n  }\n  return primeincFindPrimeWithoutWorkers(bits, rng, options, callback);\n}\n\nfunction primeincFindPrimeWithoutWorkers(bits, rng, options, callback) {\n  // initialize random number\n  var num = generateRandom(bits, rng);\n\n  /* Note: All primes are of the form 30k+i for i < 30 and gcd(30, i)=1. The\n  number we are given is always aligned at 30k + 1. Each time the number is\n  determined not to be prime we add to get to the next 'i', eg: if the number\n  was at 30k + 1 we add 6. */\n  var deltaIdx = 0;\n\n  // get required number of MR tests\n  var mrTests = getMillerRabinTests(num.bitLength());\n  if('millerRabinTests' in options) {\n    mrTests = options.millerRabinTests;\n  }\n\n  // find prime nearest to 'num' for maxBlockTime ms\n  // 10 ms gives 5ms of leeway for other calculations before dropping\n  // below 60fps (1000/60 == 16.67), but in reality, the number will\n  // likely be higher due to an 'atomic' big int modPow\n  var maxBlockTime = 10;\n  if('maxBlockTime' in options) {\n    maxBlockTime = options.maxBlockTime;\n  }\n\n  _primeinc(num, bits, rng, deltaIdx, mrTests, maxBlockTime, callback);\n}\n\nfunction _primeinc(num, bits, rng, deltaIdx, mrTests, maxBlockTime, callback) {\n  var start = +new Date();\n  do {\n    // overflow, regenerate random number\n    if(num.bitLength() > bits) {\n      num = generateRandom(bits, rng);\n    }\n    // do primality test\n    if(num.isProbablePrime(mrTests)) {\n      return callback(null, num);\n    }\n    // get next potential prime\n    num.dAddOffset(GCD_30_DELTA[deltaIdx++ % 8], 0);\n  } while(maxBlockTime < 0 || (+new Date() - start < maxBlockTime));\n\n  // keep trying later\n  forge.util.setImmediate(function() {\n    _primeinc(num, bits, rng, deltaIdx, mrTests, maxBlockTime, callback);\n  });\n}\n\n// NOTE: This algorithm is indeterminate in nature because workers\n// run in parallel looking at different segments of numbers. Even if this\n// algorithm is run twice with the same input from a predictable RNG, it\n// may produce different outputs.\nfunction primeincFindPrimeWithWorkers(bits, rng, options, callback) {\n  // web workers unavailable\n  if(typeof Worker === 'undefined') {\n    return primeincFindPrimeWithoutWorkers(bits, rng, options, callback);\n  }\n\n  // initialize random number\n  var num = generateRandom(bits, rng);\n\n  // use web workers to generate keys\n  var numWorkers = options.workers;\n  var workLoad = options.workLoad || 100;\n  var range = workLoad * 30 / 8;\n  var workerScript = options.workerScript || 'forge/prime.worker.js';\n  if(numWorkers === -1) {\n    return forge.util.estimateCores(function(err, cores) {\n      if(err) {\n        // default to 2\n        cores = 2;\n      }\n      numWorkers = cores - 1;\n      generate();\n    });\n  }\n  generate();\n\n  function generate() {\n    // require at least 1 worker\n    numWorkers = Math.max(1, numWorkers);\n\n    // TODO: consider optimizing by starting workers outside getPrime() ...\n    // note that in order to clean up they will have to be made internally\n    // asynchronous which may actually be slower\n\n    // start workers immediately\n    var workers = [];\n    for(var i = 0; i < numWorkers; ++i) {\n      // FIXME: fix path or use blob URLs\n      workers[i] = new Worker(workerScript);\n    }\n    var running = numWorkers;\n\n    // listen for requests from workers and assign ranges to find prime\n    for(var i = 0; i < numWorkers; ++i) {\n      workers[i].addEventListener('message', workerMessage);\n    }\n\n    /* Note: The distribution of random numbers is unknown. Therefore, each\n    web worker is continuously allocated a range of numbers to check for a\n    random number until one is found.\n\n    Every 30 numbers will be checked just 8 times, because prime numbers\n    have the form:\n\n    30k+i, for i < 30 and gcd(30, i)=1 (there are 8 values of i for this)\n\n    Therefore, if we want a web worker to run N checks before asking for\n    a new range of numbers, each range must contain N*30/8 numbers.\n\n    For 100 checks (workLoad), this is a range of 375. */\n\n    var found = false;\n    function workerMessage(e) {\n      // ignore message, prime already found\n      if(found) {\n        return;\n      }\n\n      --running;\n      var data = e.data;\n      if(data.found) {\n        // terminate all workers\n        for(var i = 0; i < workers.length; ++i) {\n          workers[i].terminate();\n        }\n        found = true;\n        return callback(null, new BigInteger(data.prime, 16));\n      }\n\n      // overflow, regenerate random number\n      if(num.bitLength() > bits) {\n        num = generateRandom(bits, rng);\n      }\n\n      // assign new range to check\n      var hex = num.toString(16);\n\n      // start prime search\n      e.target.postMessage({\n        hex: hex,\n        workLoad: workLoad\n      });\n\n      num.dAddOffset(range, 0);\n    }\n  }\n}\n\n/**\n * Generates a random number using the given number of bits and RNG.\n *\n * @param bits the number of bits for the number.\n * @param rng the random number generator to use.\n *\n * @return the random number.\n */\nfunction generateRandom(bits, rng) {\n  var num = new BigInteger(bits, rng);\n  // force MSB set\n  var bits1 = bits - 1;\n  if(!num.testBit(bits1)) {\n    num.bitwiseTo(BigInteger.ONE.shiftLeft(bits1), op_or, num);\n  }\n  // align number on 30k+1 boundary\n  num.dAddOffset(31 - num.mod(THIRTY).byteValue(), 0);\n  return num;\n}\n\n/**\n * Returns the required number of Miller-Rabin tests to generate a\n * prime with an error probability of (1/2)^80.\n *\n * See Handbook of Applied Cryptography Chapter 4, Table 4.4.\n *\n * @param bits the bit size.\n *\n * @return the required number of iterations.\n */\nfunction getMillerRabinTests(bits) {\n  if(bits <= 100) return 27;\n  if(bits <= 150) return 18;\n  if(bits <= 200) return 15;\n  if(bits <= 250) return 12;\n  if(bits <= 300) return 9;\n  if(bits <= 350) return 8;\n  if(bits <= 400) return 7;\n  if(bits <= 500) return 6;\n  if(bits <= 600) return 5;\n  if(bits <= 800) return 4;\n  if(bits <= 1250) return 3;\n  return 2;\n}\n\n})();\n"],"names":["forge","require$$0","require$$1","require$$2","require$$3","prime","primeModule","exports","BigInteger","jsbn","GCD_30_DELTA","THIRTY","fromInt","op_or","x","y","generateProbablePrime","bits","options","callback","algorithm","name","prng","random","rng","nextBytes","b","getBytesSync","length","i","charCodeAt","primeincFindPrime","Error","primeincFindPrimeWithWorkers","primeincFindPrimeWithoutWorkers","num","generateRandom","deltaIdx","mrTests","getMillerRabinTests","bitLength","millerRabinTests","maxBlockTime","_primeinc","start","Date","isProbablePrime","dAddOffset","util","setImmediate","Worker","numWorkers","workers","workLoad","range","workerScript","estimateCores","err","cores","generate","Math","max","addEventListener","workerMessage","found","e","data","terminate","hex","toString","target","postMessage","bits1","testBit","bitwiseTo","ONE","shiftLeft","mod","byteValue"],"mappings":";;;;;;;;;;;;;;;;;AAOA,EAAA,IAAIA,KAAK,GAAGC,YAAA,EAAkB;AAC9BC,EAAAA,WAAA,EAAiB;AACjBC,EAAAA,WAAA,EAAiB;AACjBC,EAAAA,aAAA,EAAmB;AAEnB,EAAA,CAAC,YAAW;AAEZ;IACA,IAAGJ,KAAK,CAACK,KAAK,EAAE;AACdC,MAAAA,KAAA,CAAAC,OAAc,GAAGP,KAAK,CAACK,KAAK;AAC5B,MAAA;AACF,IAAA;;AAEA;AACA,IAAA,IAAIA,OAAK,GAAGC,KAAA,CAAAC,OAAc,GAAGP,KAAK,CAACK,KAAK,GAAGL,KAAK,CAACK,KAAK,IAAI,EAAE;AAE5D,IAAA,IAAIG,UAAU,GAAGR,KAAK,CAACS,IAAI,CAACD,UAAU;;AAEtC;AACA,IAAA,IAAIE,YAAY,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;AAC3C,IAAA,IAAIC,MAAM,GAAG,IAAIH,UAAU,CAAC,IAAI,CAAC;AACjCG,IAAAA,MAAM,CAACC,OAAO,CAAC,EAAE,CAAC;AAClB,IAAA,IAAIC,KAAK,GAAG,UAASC,CAAC,EAAEC,CAAC,EAAE;MAAC,OAAOD,CAAC,GAACC,CAAC;IAAC,CAAC;;AAExC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;IACAV,OAAK,CAACW,qBAAqB,GAAG,UAASC,IAAI,EAAEC,OAAO,EAAEC,QAAQ,EAAE;AAC9D,MAAA,IAAG,OAAOD,OAAO,KAAK,UAAU,EAAE;AAChCC,QAAAA,QAAQ,GAAGD,OAAO;QAClBA,OAAO,GAAG,EAAE;AAChB,MAAA;AACEA,MAAAA,OAAO,GAAGA,OAAO,IAAI,EAAE;;AAEzB;AACE,MAAA,IAAIE,SAAS,GAAGF,OAAO,CAACE,SAAS,IAAI,UAAU;AAC/C,MAAA,IAAG,OAAOA,SAAS,KAAK,QAAQ,EAAE;AAChCA,QAAAA,SAAS,GAAG;AAACC,UAAAA,IAAI,EAAED;SAAU;AACjC,MAAA;MACEA,SAAS,CAACF,OAAO,GAAGE,SAAS,CAACF,OAAO,IAAI,EAAE;;AAE7C;MACE,IAAII,IAAI,GAAGJ,OAAO,CAACI,IAAI,IAAItB,KAAK,CAACuB,MAAM;AACvC,MAAA,IAAIC,GAAG,GAAG;AACZ;AACIC,QAAAA,SAAS,EAAE,UAASX,CAAC,EAAE;UACrB,IAAIY,CAAC,GAAGJ,IAAI,CAACK,YAAY,CAACb,CAAC,CAACc,MAAM,CAAC;AACnC,UAAA,KAAI,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGf,CAAC,CAACc,MAAM,EAAE,EAAEC,CAAC,EAAE;YAChCf,CAAC,CAACe,CAAC,CAAC,GAAGH,CAAC,CAACI,UAAU,CAACD,CAAC,CAAC;AAC9B,UAAA;AACA,QAAA;OACG;AAED,MAAA,IAAGT,SAAS,CAACC,IAAI,KAAK,UAAU,EAAE;QAChC,OAAOU,iBAAiB,CAACd,IAAI,EAAEO,GAAG,EAAEJ,SAAS,CAACF,OAAO,EAAEC,QAAQ,CAAC;AACpE,MAAA;MAEE,MAAM,IAAIa,KAAK,CAAC,sCAAsC,GAAGZ,SAAS,CAACC,IAAI,CAAC;IAC1E,CAAC;IAED,SAASU,iBAAiBA,CAACd,IAAI,EAAEO,GAAG,EAAEN,OAAO,EAAEC,QAAQ,EAAE;MACvD,IAAG,SAAS,IAAID,OAAO,EAAE;QACvB,OAAOe,4BAA4B,CAAChB,IAAI,EAAEO,GAAG,EAAEN,OAAO,EAAEC,QAAQ,CAAC;AACrE,MAAA;MACE,OAAOe,+BAA+B,CAACjB,IAAI,EAAEO,GAAG,EAAEN,OAAO,EAAEC,QAAQ,CAAC;AACtE,IAAA;IAEA,SAASe,+BAA+BA,CAACjB,IAAI,EAAEO,GAAG,EAAEN,OAAO,EAAEC,QAAQ,EAAE;AACvE;AACE,MAAA,IAAIgB,GAAG,GAAGC,cAAc,CAACnB,IAAI,EAAEO,GAAG,CAAC;;AAErC;AACA;AACA;AACA;MACE,IAAIa,QAAQ,GAAG,CAAC;;AAElB;MACE,IAAIC,OAAO,GAAGC,mBAAmB,CAACJ,GAAG,CAACK,SAAS,EAAE,CAAC;MAClD,IAAG,kBAAkB,IAAItB,OAAO,EAAE;QAChCoB,OAAO,GAAGpB,OAAO,CAACuB,gBAAgB;AACtC,MAAA;;AAEA;AACA;AACA;AACA;MACE,IAAIC,YAAY,GAAG,EAAE;MACrB,IAAG,cAAc,IAAIxB,OAAO,EAAE;QAC5BwB,YAAY,GAAGxB,OAAO,CAACwB,YAAY;AACvC,MAAA;AAEEC,MAAAA,SAAS,CAACR,GAAG,EAAElB,IAAI,EAAEO,GAAG,EAAEa,QAAQ,EAAEC,OAAO,EAAEI,YAAY,EAAEvB,QAAQ,CAAC;AACtE,IAAA;AAEA,IAAA,SAASwB,SAASA,CAACR,GAAG,EAAElB,IAAI,EAAEO,GAAG,EAAEa,QAAQ,EAAEC,OAAO,EAAEI,YAAY,EAAEvB,QAAQ,EAAE;AAC5E,MAAA,IAAIyB,KAAK,GAAG,CAAC,IAAIC,IAAI,EAAE;MACvB,GAAG;AACL;AACI,QAAA,IAAGV,GAAG,CAACK,SAAS,EAAE,GAAGvB,IAAI,EAAE;AACzBkB,UAAAA,GAAG,GAAGC,cAAc,CAACnB,IAAI,EAAEO,GAAG,CAAC;AACrC,QAAA;AACA;AACI,QAAA,IAAGW,GAAG,CAACW,eAAe,CAACR,OAAO,CAAC,EAAE;AAC/B,UAAA,OAAOnB,QAAQ,CAAC,IAAI,EAAEgB,GAAG,CAAC;AAChC,QAAA;AACA;AACIA,QAAAA,GAAG,CAACY,UAAU,CAACrC,YAAY,CAAC2B,QAAQ,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;AACnD,MAAA,CAAG,QAAOK,YAAY,GAAG,CAAC,IAAK,CAAC,IAAIG,IAAI,EAAE,GAAGD,KAAK,GAAGF,YAAa;;AAElE;AACE1C,MAAAA,KAAK,CAACgD,IAAI,CAACC,YAAY,CAAC,YAAW;AACjCN,QAAAA,SAAS,CAACR,GAAG,EAAElB,IAAI,EAAEO,GAAG,EAAEa,QAAQ,EAAEC,OAAO,EAAEI,YAAY,EAAEvB,QAAQ,CAAC;AACxE,MAAA,CAAG,CAAC;AACJ,IAAA;;AAEA;AACA;AACA;AACA;IACA,SAASc,4BAA4BA,CAAChB,IAAI,EAAEO,GAAG,EAAEN,OAAO,EAAEC,QAAQ,EAAE;AACpE;AACE,MAAA,IAAG,OAAO+B,MAAM,KAAK,WAAW,EAAE;QAChC,OAAOhB,+BAA+B,CAACjB,IAAI,EAAEO,GAAG,EAAEN,OAAO,EAAEC,QAAQ,CAAC;AACxE,MAAA;;AAEA;AACE,MAAA,IAAIgB,GAAG,GAAGC,cAAc,CAACnB,IAAI,EAAEO,GAAG,CAAC;;AAErC;AACE,MAAA,IAAI2B,UAAU,GAAGjC,OAAO,CAACkC,OAAO;AAChC,MAAA,IAAIC,QAAQ,GAAGnC,OAAO,CAACmC,QAAQ,IAAI,GAAG;AACtC,MAAA,IAAIC,KAAK,GAAGD,QAAQ,GAAG,EAAE,GAAG,CAAC;AAC7B,MAAA,IAAIE,YAAY,GAAGrC,OAAO,CAACqC,YAAY,IAAI,uBAAuB;AAClE,MAAA,IAAGJ,UAAU,KAAK,EAAE,EAAE;QACpB,OAAOnD,KAAK,CAACgD,IAAI,CAACQ,aAAa,CAAC,UAASC,GAAG,EAAEC,KAAK,EAAE;AACnD,UAAA,IAAGD,GAAG,EAAE;AACd;AACQC,YAAAA,KAAK,GAAG,CAAC;AACjB,UAAA;UACMP,UAAU,GAAGO,KAAK,GAAG,CAAC;AACtBC,UAAAA,QAAQ,EAAE;AAChB,QAAA,CAAK,CAAC;AACN,MAAA;AACEA,MAAAA,QAAQ,EAAE;MAEV,SAASA,QAAQA,GAAG;AACtB;QACIR,UAAU,GAAGS,IAAI,CAACC,GAAG,CAAC,CAAC,EAAEV,UAAU,CAAC;;AAExC;AACA;AACA;;AAEA;QACI,IAAIC,OAAO,GAAG,EAAE;QAChB,KAAI,IAAIvB,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGsB,UAAU,EAAE,EAAEtB,CAAC,EAAE;AACxC;UACMuB,OAAO,CAACvB,CAAC,CAAC,GAAG,IAAIqB,MAAM,CAACK,YAAY,CAAC;AAC3C,QAAA;;AAGA;QACI,KAAI,IAAI1B,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGsB,UAAU,EAAE,EAAEtB,CAAC,EAAE;UAClCuB,OAAO,CAACvB,CAAC,CAAC,CAACiC,gBAAgB,CAAC,SAAS,EAAEC,aAAa,CAAC;AAC3D,QAAA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;;;QAOI,IAAIC,KAAK,GAAG,KAAK;QACjB,SAASD,aAAaA,CAACE,CAAC,EAAE;AAC9B;AACM,UAAA,IAAGD,KAAK,EAAE;AACR,YAAA;AACR,UAAA;AAGM,UAAA,IAAIE,IAAI,GAAGD,CAAC,CAACC,IAAI;UACjB,IAAGA,IAAI,CAACF,KAAK,EAAE;AACrB;AACQ,YAAA,KAAI,IAAInC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGuB,OAAO,CAACxB,MAAM,EAAE,EAAEC,CAAC,EAAE;AACtCuB,cAAAA,OAAO,CAACvB,CAAC,CAAC,CAACsC,SAAS,EAAE;AAChC,YAAA;AACQH,YAAAA,KAAK,GAAG,IAAI;AACZ,YAAA,OAAO7C,QAAQ,CAAC,IAAI,EAAE,IAAIX,UAAU,CAAC0D,IAAI,CAAC7D,KAAK,EAAE,EAAE,CAAC,CAAC;AAC7D,UAAA;;AAEA;AACM,UAAA,IAAG8B,GAAG,CAACK,SAAS,EAAE,GAAGvB,IAAI,EAAE;AACzBkB,YAAAA,GAAG,GAAGC,cAAc,CAACnB,IAAI,EAAEO,GAAG,CAAC;AACvC,UAAA;;AAEA;AACM,UAAA,IAAI4C,GAAG,GAAGjC,GAAG,CAACkC,QAAQ,CAAC,EAAE,CAAC;;AAEhC;AACMJ,UAAAA,CAAC,CAACK,MAAM,CAACC,WAAW,CAAC;AACnBH,YAAAA,GAAG,EAAEA,GAAG;AACRf,YAAAA,QAAQ,EAAEA;AAClB,WAAO,CAAC;AAEFlB,UAAAA,GAAG,CAACY,UAAU,CAACO,KAAK,EAAE,CAAC,CAAC;AAC9B,QAAA;AACA,MAAA;AACA,IAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAA,SAASlB,cAAcA,CAACnB,IAAI,EAAEO,GAAG,EAAE;MACjC,IAAIW,GAAG,GAAG,IAAI3B,UAAU,CAACS,IAAI,EAAEO,GAAG,CAAC;AACrC;AACE,MAAA,IAAIgD,KAAK,GAAGvD,IAAI,GAAG,CAAC;AACpB,MAAA,IAAG,CAACkB,GAAG,CAACsC,OAAO,CAACD,KAAK,CAAC,EAAE;AACtBrC,QAAAA,GAAG,CAACuC,SAAS,CAAClE,UAAU,CAACmE,GAAG,CAACC,SAAS,CAACJ,KAAK,CAAC,EAAE3D,KAAK,EAAEsB,GAAG,CAAC;AAC9D,MAAA;AACA;AACEA,MAAAA,GAAG,CAACY,UAAU,CAAC,EAAE,GAAGZ,GAAG,CAAC0C,GAAG,CAAClE,MAAM,CAAC,CAACmE,SAAS,EAAE,EAAE,CAAC,CAAC;AACnD,MAAA,OAAO3C,GAAG;AACZ,IAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;IACA,SAASI,mBAAmBA,CAACtB,IAAI,EAAE;AACjC,MAAA,IAAGA,IAAI,IAAI,GAAG,EAAE,OAAO,EAAE;AACzB,MAAA,IAAGA,IAAI,IAAI,GAAG,EAAE,OAAO,EAAE;AACzB,MAAA,IAAGA,IAAI,IAAI,GAAG,EAAE,OAAO,EAAE;AACzB,MAAA,IAAGA,IAAI,IAAI,GAAG,EAAE,OAAO,EAAE;AACzB,MAAA,IAAGA,IAAI,IAAI,GAAG,EAAE,OAAO,CAAC;AACxB,MAAA,IAAGA,IAAI,IAAI,GAAG,EAAE,OAAO,CAAC;AACxB,MAAA,IAAGA,IAAI,IAAI,GAAG,EAAE,OAAO,CAAC;AACxB,MAAA,IAAGA,IAAI,IAAI,GAAG,EAAE,OAAO,CAAC;AACxB,MAAA,IAAGA,IAAI,IAAI,GAAG,EAAE,OAAO,CAAC;AACxB,MAAA,IAAGA,IAAI,IAAI,GAAG,EAAE,OAAO,CAAC;AACxB,MAAA,IAAGA,IAAI,IAAI,IAAI,EAAE,OAAO,CAAC;AACzB,MAAA,OAAO,CAAC;AACV,IAAA;AAEA,EAAA,CAAC,GAAG;;;;;;","x_google_ignoreList":[0]}