npm - qidian-shared - Versions diffs - 1.0.72 → 1.0.74 - Mend

qidian-shared 1.0.72 → 1.0.74

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (252) hide show

package/dist/node_modules/.pnpm/crypto-js@4.2.0/node_modules/crypto-js/x64-core.mjs.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"x64-core.mjs","sources":["../../../../../../../../node_modules/.pnpm/crypto-js@4.2.0/node_modules/crypto-js/x64-core.js"],"sourcesContent":[";(function (root, factory) {\n\tif (typeof exports === \"object\") {\n\t\t// CommonJS\n\t\tmodule.exports = exports = factory(require(\"./core\"));\n\t}\n\telse if (typeof define === \"function\" && define.amd) {\n\t\t// AMD\n\t\tdefine([\"./core\"], factory);\n\t}\n\telse {\n\t\t// Global (browser)\n\t\tfactory(root.CryptoJS);\n\t}\n}(this, function (CryptoJS) {\n\n\t(function (undefined) {\n\t // Shortcuts\n\t var C = CryptoJS;\n\t var C_lib = C.lib;\n\t var Base = C_lib.Base;\n\t var X32WordArray = C_lib.WordArray;\n\n\t /**\n\t * x64 namespace.\n\t */\n\t var C_x64 = C.x64 = {};\n\n\t /**\n\t * A 64-bit word.\n\t */\n\t var X64Word = C_x64.Word = Base.extend({\n\t /**\n\t * Initializes a newly created 64-bit word.\n\t *\n\t * @param {number} high The high 32 bits.\n\t * @param {number} low The low 32 bits.\n\t *\n\t * @example\n\t *\n\t * var x64Word = CryptoJS.x64.Word.create(0x00010203, 0x04050607);\n\t */\n\t init: function (high, low) {\n\t this.high = high;\n\t this.low = low;\n\t }\n\n\t /**\n\t * Bitwise NOTs this word.\n\t *\n\t * @return {X64Word} A new x64-Word object after negating.\n\t *\n\t * @example\n\t *\n\t * var negated = x64Word.not();\n\t */\n\t // not: function () {\n\t // var high = ~this.high;\n\t // var low = ~this.low;\n\n\t // return X64Word.create(high, low);\n\t // },\n\n\t /**\n\t * Bitwise ANDs this word with the passed word.\n\t *\n\t * @param {X64Word} word The x64-Word to AND with this word.\n\t *\n\t * @return {X64Word} A new x64-Word object after ANDing.\n\t *\n\t * @example\n\t *\n\t * var anded = x64Word.and(anotherX64Word);\n\t */\n\t // and: function (word) {\n\t // var high = this.high & word.high;\n\t // var low = this.low & word.low;\n\n\t // return X64Word.create(high, low);\n\t // },\n\n\t /**\n\t * Bitwise ORs this word with the passed word.\n\t *\n\t * @param {X64Word} word The x64-Word to OR with this word.\n\t *\n\t * @return {X64Word} A new x64-Word object after ORing.\n\t *\n\t * @example\n\t *\n\t * var ored = x64Word.or(anotherX64Word);\n\t */\n\t // or: function (word) {\n\t // var high = this.high | word.high;\n\t // var low = this.low | word.low;\n\n\t // return X64Word.create(high, low);\n\t // },\n\n\t /**\n\t * Bitwise XORs this word with the passed word.\n\t *\n\t * @param {X64Word} word The x64-Word to XOR with this word.\n\t *\n\t * @return {X64Word} A new x64-Word object after XORing.\n\t *\n\t * @example\n\t *\n\t * var xored = x64Word.xor(anotherX64Word);\n\t */\n\t // xor: function (word) {\n\t // var high = this.high ^ word.high;\n\t // var low = this.low ^ word.low;\n\n\t // return X64Word.create(high, low);\n\t // },\n\n\t /**\n\t * Shifts this word n bits to the left.\n\t *\n\t * @param {number} n The number of bits to shift.\n\t *\n\t * @return {X64Word} A new x64-Word object after shifting.\n\t *\n\t * @example\n\t *\n\t * var shifted = x64Word.shiftL(25);\n\t */\n\t // shiftL: function (n) {\n\t // if (n < 32) {\n\t // var high = (this.high << n) | (this.low >>> (32 - n));\n\t // var low = this.low << n;\n\t // } else {\n\t // var high = this.low << (n - 32);\n\t // var low = 0;\n\t // }\n\n\t // return X64Word.create(high, low);\n\t // },\n\n\t /**\n\t * Shifts this word n bits to the right.\n\t *\n\t * @param {number} n The number of bits to shift.\n\t *\n\t * @return {X64Word} A new x64-Word object after shifting.\n\t *\n\t * @example\n\t *\n\t * var shifted = x64Word.shiftR(7);\n\t */\n\t // shiftR: function (n) {\n\t // if (n < 32) {\n\t // var low = (this.low >>> n) | (this.high << (32 - n));\n\t // var high = this.high >>> n;\n\t // } else {\n\t // var low = this.high >>> (n - 32);\n\t // var high = 0;\n\t // }\n\n\t // return X64Word.create(high, low);\n\t // },\n\n\t /**\n\t * Rotates this word n bits to the left.\n\t *\n\t * @param {number} n The number of bits to rotate.\n\t *\n\t * @return {X64Word} A new x64-Word object after rotating.\n\t *\n\t * @example\n\t *\n\t * var rotated = x64Word.rotL(25);\n\t */\n\t // rotL: function (n) {\n\t // return this.shiftL(n).or(this.shiftR(64 - n));\n\t // },\n\n\t /**\n\t * Rotates this word n bits to the right.\n\t *\n\t * @param {number} n The number of bits to rotate.\n\t *\n\t * @return {X64Word} A new x64-Word object after rotating.\n\t *\n\t * @example\n\t *\n\t * var rotated = x64Word.rotR(7);\n\t */\n\t // rotR: function (n) {\n\t // return this.shiftR(n).or(this.shiftL(64 - n));\n\t // },\n\n\t /**\n\t * Adds this word with the passed word.\n\t *\n\t * @param {X64Word} word The x64-Word to add with this word.\n\t *\n\t * @return {X64Word} A new x64-Word object after adding.\n\t *\n\t * @example\n\t *\n\t * var added = x64Word.add(anotherX64Word);\n\t */\n\t // add: function (word) {\n\t // var low = (this.low + word.low) | 0;\n\t // var carry = (low >>> 0) < (this.low >>> 0) ? 1 : 0;\n\t // var high = (this.high + word.high + carry) | 0;\n\n\t // return X64Word.create(high, low);\n\t // }\n\t });\n\n\t /**\n\t * An array of 64-bit words.\n\t *\n\t * @property {Array} words The array of CryptoJS.x64.Word objects.\n\t * @property {number} sigBytes The number of significant bytes in this word array.\n\t */\n\t var X64WordArray = C_x64.WordArray = Base.extend({\n\t /**\n\t * Initializes a newly created word array.\n\t *\n\t * @param {Array} words (Optional) An array of CryptoJS.x64.Word objects.\n\t * @param {number} sigBytes (Optional) The number of significant bytes in the words.\n\t *\n\t * @example\n\t *\n\t * var wordArray = CryptoJS.x64.WordArray.create();\n\t *\n\t * var wordArray = CryptoJS.x64.WordArray.create([\n\t * CryptoJS.x64.Word.create(0x00010203, 0x04050607),\n\t * CryptoJS.x64.Word.create(0x18191a1b, 0x1c1d1e1f)\n\t * ]);\n\t *\n\t * var wordArray = CryptoJS.x64.WordArray.create([\n\t * CryptoJS.x64.Word.create(0x00010203, 0x04050607),\n\t * CryptoJS.x64.Word.create(0x18191a1b, 0x1c1d1e1f)\n\t * ], 10);\n\t */\n\t init: function (words, sigBytes) {\n\t words = this.words = words || [];\n\n\t if (sigBytes != undefined) {\n\t this.sigBytes = sigBytes;\n\t } else {\n\t this.sigBytes = words.length * 8;\n\t }\n\t },\n\n\t /**\n\t * Converts this 64-bit word array to a 32-bit word array.\n\t *\n\t * @return {CryptoJS.lib.WordArray} This word array's data as a 32-bit word array.\n\t *\n\t * @example\n\t *\n\t * var x32WordArray = x64WordArray.toX32();\n\t */\n\t toX32: function () {\n\t // Shortcuts\n\t var x64Words = this.words;\n\t var x64WordsLength = x64Words.length;\n\n\t // Convert\n\t var x32Words = [];\n\t for (var i = 0; i < x64WordsLength; i++) {\n\t var x64Word = x64Words[i];\n\t x32Words.push(x64Word.high);\n\t x32Words.push(x64Word.low);\n\t }\n\n\t return X32WordArray.create(x32Words, this.sigBytes);\n\t },\n\n\t /**\n\t * Creates a copy of this word array.\n\t *\n\t * @return {X64WordArray} The clone.\n\t *\n\t * @example\n\t *\n\t * var clone = x64WordArray.clone();\n\t */\n\t clone: function () {\n\t var clone = Base.clone.call(this);\n\n\t // Clone \"words\" array\n\t var words = clone.words = this.words.slice(0);\n\n\t // Clone each X64Word object\n\t var wordsLength = words.length;\n\t for (var i = 0; i < wordsLength; i++) {\n\t words[i] = words[i].clone();\n\t }\n\n\t return clone;\n\t }\n\t });\n\t}());\n\n\n\treturn CryptoJS;\n\n}));"],"names":["require$$0","this","undefined"],"mappings":";;;;;;;;AAAC,KAAC,SAAU,MAAM,SAAS;AACO;AAEhC,yBAA2B,QAAQA,aAAiB;AAAA,MACtD;AAAA,IASA,GAAEC,SAAM,SAAU,UAAU;AAE3B,OAAC,SAAUC,aAAW;AAElB,YAAI,IAAI;AACR,YAAI,QAAQ,EAAE;AACd,YAAI,OAAO,MAAM;AACjB,YAAI,eAAe,MAAM;AAKzB,YAAI,QAAQ,EAAE,MAAM,CAAA;AAKN,cAAM,OAAO,KAAK,OAAO;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,UAWnC,MAAM,SAAU,MAAM,KAAK;AACvB,iBAAK,OAAO;AACZ,iBAAK,MAAM;AAAA,UACxB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,QAsKA,CAAM;AAQkB,cAAM,YAAY,KAAK,OAAO;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,UAqB7C,MAAM,SAAU,OAAO,UAAU;AAC7B,oBAAQ,KAAK,QAAQ,SAAS,CAAA;AAE9B,gBAAI,YAAYA,aAAW;AACvB,mBAAK,WAAW;AAAA,YACjC,OAAoB;AACH,mBAAK,WAAW,MAAM,SAAS;AAAA,YAChD;AAAA,UACA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,UAWS,OAAO,WAAY;AAEf,gBAAI,WAAW,KAAK;AACpB,gBAAI,iBAAiB,SAAS;AAG9B,gBAAI,WAAW,CAAA;AACf,qBAAS,IAAI,GAAG,IAAI,gBAAgB,KAAK;AACrC,kBAAI,UAAU,SAAS,CAAC;AACxB,uBAAS,KAAK,QAAQ,IAAI;AAC1B,uBAAS,KAAK,QAAQ,GAAG;AAAA,YAC1C;AAEa,mBAAO,aAAa,OAAO,UAAU,KAAK,QAAQ;AAAA,UAC/D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,UAWS,OAAO,WAAY;AACf,gBAAI,QAAQ,KAAK,MAAM,KAAK,IAAI;AAGhC,gBAAI,QAAQ,MAAM,QAAQ,KAAK,MAAM,MAAM,CAAC;AAG5C,gBAAI,cAAc,MAAM;AACxB,qBAAS,IAAI,GAAG,IAAI,aAAa,KAAK;AAClC,oBAAM,CAAC,IAAI,MAAM,CAAC,EAAE,MAAK;AAAA,YAC1C;AAEa,mBAAO;AAAA,UACpB;AAAA,QACA,CAAM;AAAA,MACN,GAAE;AAGD,aAAO;AAAA,IAER,CAAC;AAAA;;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/jsencrypt@3.5.4/node_modules/jsencrypt/lib/JSEncrypt.mjs.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"JSEncrypt.mjs","sources":["../../../../../../../../../node_modules/.pnpm/jsencrypt@3.5.4/node_modules/jsencrypt/lib/JSEncrypt.js"],"sourcesContent":["var _a;\nimport { b64tohex, hex2b64 } from \"./lib/jsbn/base64\";\nimport { JSEncryptRSAKey } from \"./JSEncryptRSAKey\";\nimport { oaep_pad } from './lib/jsbn/rsa';\nimport { rstr_sha256, rstr2hex } from './lib/jsbn/sha256';\nvar version = typeof process !== \"undefined\" ? (_a = process.env) === null || _a === void 0 ? void 0 : _a.npm_package_version : undefined;\n/**\n *\n * @param {Object} [options = {}] - An object to customize JSEncrypt behaviour\n * possible parameters are:\n * - key {JSEncryptRSAKey} default: null\n * - default_key_size {number} default: 1024 the key size in bit\n * - default_public_exponent {string} default: '010001' the hexadecimal representation of the public exponent\n * - log {boolean} default: false whether log warn/error or not\n * @constructor\n */\nvar JSEncrypt = /** @class */ (function () {\n function JSEncrypt(options) {\n if (options === void 0) { options = {}; }\n this.default_key_size = options.default_key_size\n ? parseInt(options.default_key_size, 10)\n : 1024;\n this.default_public_exponent = options.default_public_exponent || \"010001\"; // 65537 default openssl public exponent for rsa key type\n this.log = options.log || false;\n // The private and public key.\n this.key = options.key || null;\n }\n /**\n * Method to set the rsa key parameter (one method is enough to set both the public\n * and the private key, since the private key contains the public key paramenters)\n * Log a warning if logs are enabled\n * @param {Object|string} key the pem encoded string or an object (with or without header/footer)\n * @public\n */\n JSEncrypt.prototype.setKey = function (key) {\n if (key) {\n if (this.log && this.key) {\n console.warn(\"A key was already set, overriding existing.\");\n }\n this.key = new JSEncryptRSAKey(key);\n }\n else if (!this.key && this.log) {\n console.error(\"A key was not set.\");\n }\n };\n /**\n * Proxy method for setKey, for api compatibility\n * @see setKey\n * @public\n */\n JSEncrypt.prototype.setPrivateKey = function (privkey) {\n // Create the key.\n this.setKey(privkey);\n };\n /**\n * Proxy method for setKey, for api compatibility\n * @see setKey\n * @public\n */\n JSEncrypt.prototype.setPublicKey = function (pubkey) {\n // Sets the public key.\n this.setKey(pubkey);\n };\n /**\n * Proxy method for RSAKey object's decrypt, decrypt the string using the private\n * components of the rsa key object. Note that if the object was not set will be created\n * on the fly (by the getKey method) using the parameters passed in the JSEncrypt constructor\n * @param {string} str base64 encoded crypted string to decrypt\n * @return {string} the decrypted string\n * @public\n */\n JSEncrypt.prototype.decrypt = function (str) {\n // Return the decrypted string.\n try {\n return this.getKey().decrypt(b64tohex(str));\n }\n catch (ex) {\n return false;\n }\n };\n /**\n * Proxy method for RSAKey object's encrypt, encrypt the string using the public\n * components of the rsa key object. Note that if the object was not set will be created\n * on the fly (by the getKey method) using the parameters passed in the JSEncrypt constructor\n * @param {string} str the string to encrypt\n * @return {string} the encrypted string encoded in base64\n * @public\n */\n JSEncrypt.prototype.encrypt = function (str) {\n // Return the encrypted string.\n try {\n return hex2b64(this.getKey().encrypt(str));\n }\n catch (ex) {\n return false;\n }\n };\n /**\n * Proxy method for RSAKey object's encrypt with padding: RSA_PKCS1_OAEP_PADDING and oaepHash: sha256,\n * encrypt the string using the public\n * components of the rsa key object. Note that if the object was not set will be created\n * on the fly (by the getKey method) using the parameters passed in the JSEncrypt constructor\n * @param {string} str the string to encrypt\n * @return {string} the encrypted string encoded in base64\n * @public\n */\n JSEncrypt.prototype.encryptOAEP = function (str) {\n // Return the encrypted string.\n try {\n return hex2b64(this.getKey().encrypt(str, oaep_pad));\n }\n catch (ex) {\n return false;\n }\n };\n /**\n * Proxy method for RSAKey object's sign.\n * @param {string} str the string to sign\n * @param {function} digestMethod hash method\n * @param {string} digestName the name of the hash algorithm\n * @return {string} the signature encoded in base64\n * @public\n */\n JSEncrypt.prototype.sign = function (str, digestMethod, digestName) {\n if (digestMethod === void 0) { digestMethod = function (raw) { return raw; }; }\n if (digestName === void 0) { digestName = \"\"; }\n // return the RSA signature of 'str' in 'hex' format.\n try {\n return hex2b64(this.getKey().sign(str, digestMethod, digestName));\n }\n catch (ex) {\n return false;\n }\n };\n /**\n * Signs a string using the SHA-256 hash algorithm.\n * @param str the string to sign\n * @returns the base64 encoded signature or false on failure\n */\n JSEncrypt.prototype.signSha256 = function (str) {\n return this.sign(str, function (text) {\n return rstr2hex(rstr_sha256(text));\n }, \"sha256\");\n };\n /**\n * Proxy method for RSAKey object's verify.\n * @param {string} str the string to verify\n * @param {string} signature the signature encoded in base64 to compare the string to\n * @param {function} digestMethod hash method\n * @return {boolean} whether the data and signature match\n * @public\n */\n JSEncrypt.prototype.verify = function (str, signature, digestMethod) {\n if (digestMethod === void 0) { digestMethod = function (raw) { return raw; }; }\n // Return the decrypted 'digest' of the signature.\n try {\n return this.getKey().verify(str, b64tohex(signature), digestMethod);\n }\n catch (ex) {\n return false;\n }\n };\n /**\n * Verifies a string using the SHA-256 hash algorithm.\n * @param str the string to verify\n * @param signature the base64 encoded signature to compare against\n * @returns whether the signature is valid\n */\n JSEncrypt.prototype.verifySha256 = function (str, signature) {\n return this.verify(str, signature, function (text) {\n return rstr2hex(rstr_sha256(text));\n });\n };\n /**\n * Getter for the current JSEncryptRSAKey object. If it doesn't exists a new object\n * will be created and returned\n * @param {callback} [cb] the callback to be called if we want the key to be generated\n * in an async fashion\n * @returns {JSEncryptRSAKey} the JSEncryptRSAKey object\n * @public\n */\n JSEncrypt.prototype.getKey = function (cb) {\n // Only create new if it does not exist.\n if (!this.key) {\n // Get a new private key.\n this.key = new JSEncryptRSAKey();\n if (cb && {}.toString.call(cb) === \"[object Function]\") {\n this.key.generateAsync(this.default_key_size, this.default_public_exponent, cb);\n return;\n }\n // Generate the key.\n this.key.generate(this.default_key_size, this.default_public_exponent);\n }\n return this.key;\n };\n /**\n * Returns the pem encoded representation of the private key\n * If the key doesn't exists a new key will be created\n * @returns {string} pem encoded representation of the private key WITH header and footer\n * @public\n */\n JSEncrypt.prototype.getPrivateKey = function () {\n // Return the private representation of this key.\n return this.getKey().getPrivateKey();\n };\n /**\n * Returns the pem encoded representation of the private key\n * If the key doesn't exists a new key will be created\n * @returns {string} pem encoded representation of the private key WITHOUT header and footer\n * @public\n */\n JSEncrypt.prototype.getPrivateKeyB64 = function () {\n // Return the private representation of this key.\n return this.getKey().getPrivateBaseKeyB64();\n };\n /**\n * Returns the pem encoded representation of the public key\n * If the key doesn't exists a new key will be created\n * @returns {string} pem encoded representation of the public key WITH header and footer\n * @public\n */\n JSEncrypt.prototype.getPublicKey = function () {\n // Return the private representation of this key.\n return this.getKey().getPublicKey();\n };\n /**\n * Returns the pem encoded representation of the public key\n * If the key doesn't exists a new key will be created\n * @returns {string} pem encoded representation of the public key WITHOUT header and footer\n * @public\n */\n JSEncrypt.prototype.getPublicKeyB64 = function () {\n // Return the private representation of this key.\n return this.getKey().getPublicBaseKeyB64();\n };\n JSEncrypt.version = version;\n return JSEncrypt;\n}());\nexport { JSEncrypt };\n"],"names":["JSEncrypt"],"mappings":";;;;AAAA,IAAI;AAKJ,IAAI,UAAU,OAAO,YAAY,eAAe,KAAK,YAAA,SAAiB,QAAQ,OAAO,SAAS,SAAS,GAAG,sBAAsB;AAWhI,IAAI;AAAA;AAAA,GAA2B,WAAY;AACvC,aAASA,WAAU,SAAS;AACxB,UAAI,YAAY,QAAQ;AAAE,kBAAU,CAAA;AAAA,MAAI;AACxC,WAAK,mBAAmB,QAAQ,mBAC1B,SAAS,QAAQ,kBAAkB,EAAE,IACrC;AACN,WAAK,0BAA0B,QAAQ,2BAA2B;AAClE,WAAK,MAAM,QAAQ,OAAO;AAE1B,WAAK,MAAM,QAAQ,OAAO;AAAA,IAC9B;AAQAA,eAAU,UAAU,SAAS,SAAU,KAAK;AACxC,UAAI,KAAK;AACL,YAAI,KAAK,OAAO,KAAK,KAAK;AACtB,kBAAQ,KAAK,6CAA6C;AAAA,QAC9D;AACA,aAAK,MAAM,IAAI,gBAAgB,GAAG;AAAA,MACtC,WACS,CAAC,KAAK,OAAO,KAAK,KAAK;AAC5B,gBAAQ,MAAM,oBAAoB;AAAA,MACtC;AAAA,IACJ;AAMAA,eAAU,UAAU,gBAAgB,SAAU,SAAS;AAEnD,WAAK,OAAO,OAAO;AAAA,IACvB;AAMAA,eAAU,UAAU,eAAe,SAAU,QAAQ;AAEjD,WAAK,OAAO,MAAM;AAAA,IACtB;AASAA,eAAU,UAAU,UAAU,SAAU,KAAK;AAEzC,UAAI;AACA,eAAO,KAAK,OAAA,EAAS,QAAQ,SAAS,GAAG,CAAC;AAAA,MAC9C,SACO,IAAI;AACP,eAAO;AAAA,MACX;AAAA,IACJ;AASAA,eAAU,UAAU,UAAU,SAAU,KAAK;AAEzC,UAAI;AACA,eAAO,QAAQ,KAAK,OAAA,EAAS,QAAQ,GAAG,CAAC;AAAA,MAC7C,SACO,IAAI;AACP,eAAO;AAAA,MACX;AAAA,IACJ;AAUAA,eAAU,UAAU,cAAc,SAAU,KAAK;AAE7C,UAAI;AACA,eAAO,QAAQ,KAAK,OAAA,EAAS,QAAQ,KAAK,QAAQ,CAAC;AAAA,MACvD,SACO,IAAI;AACP,eAAO;AAAA,MACX;AAAA,IACJ;AASAA,eAAU,UAAU,OAAO,SAAU,KAAK,cAAc,YAAY;AAChE,UAAI,iBAAiB,QAAQ;AAAE,uBAAe,SAAU,KAAK;AAAE,iBAAO;AAAA,QAAK;AAAA,MAAG;AAC9E,UAAI,eAAe,QAAQ;AAAE,qBAAa;AAAA,MAAI;AAE9C,UAAI;AACA,eAAO,QAAQ,KAAK,OAAA,EAAS,KAAK,KAAK,cAAc,UAAU,CAAC;AAAA,MACpE,SACO,IAAI;AACP,eAAO;AAAA,MACX;AAAA,IACJ;AAMAA,eAAU,UAAU,aAAa,SAAU,KAAK;AAC5C,aAAO,KAAK,KAAK,KAAK,SAAU,MAAM;AAClC,eAAO,SAAS,YAAY,IAAI,CAAC;AAAA,MACrC,GAAG,QAAQ;AAAA,IACf;AASAA,eAAU,UAAU,SAAS,SAAU,KAAK,WAAW,cAAc;AACjE,UAAI,iBAAiB,QAAQ;AAAE,uBAAe,SAAU,KAAK;AAAE,iBAAO;AAAA,QAAK;AAAA,MAAG;AAE9E,UAAI;AACA,eAAO,KAAK,SAAS,OAAO,KAAK,SAAS,SAAS,GAAG,YAAY;AAAA,MACtE,SACO,IAAI;AACP,eAAO;AAAA,MACX;AAAA,IACJ;AAOAA,eAAU,UAAU,eAAe,SAAU,KAAK,WAAW;AACzD,aAAO,KAAK,OAAO,KAAK,WAAW,SAAU,MAAM;AAC/C,eAAO,SAAS,YAAY,IAAI,CAAC;AAAA,MACrC,CAAC;AAAA,IACL;AASAA,eAAU,UAAU,SAAS,SAAU,IAAI;AAEvC,UAAI,CAAC,KAAK,KAAK;AAEX,aAAK,MAAM,IAAI,gBAAA;AACf,YAAI,MAAM,CAAA,EAAG,SAAS,KAAK,EAAE,MAAM,qBAAqB;AACpD,eAAK,IAAI,cAAc,KAAK,kBAAkB,KAAK,yBAAyB,EAAE;AAC9E;AAAA,QACJ;AAEA,aAAK,IAAI,SAAS,KAAK,kBAAkB,KAAK,uBAAuB;AAAA,MACzE;AACA,aAAO,KAAK;AAAA,IAChB;AAOAA,eAAU,UAAU,gBAAgB,WAAY;AAE5C,aAAO,KAAK,OAAA,EAAS,cAAA;AAAA,IACzB;AAOAA,eAAU,UAAU,mBAAmB,WAAY;AAE/C,aAAO,KAAK,OAAA,EAAS,qBAAA;AAAA,IACzB;AAOAA,eAAU,UAAU,eAAe,WAAY;AAE3C,aAAO,KAAK,OAAA,EAAS,aAAA;AAAA,IACzB;AAOAA,eAAU,UAAU,kBAAkB,WAAY;AAE9C,aAAO,KAAK,OAAA,EAAS,oBAAA;AAAA,IACzB;AACAA,eAAU,UAAU;AACpB,WAAOA;AAAAA,EACX,GAAA;AAAA;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/jsencrypt@3.5.4/node_modules/jsencrypt/lib/JSEncryptRSAKey.mjs.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"JSEncryptRSAKey.mjs","sources":["../../../../../../../../../node_modules/.pnpm/jsencrypt@3.5.4/node_modules/jsencrypt/lib/JSEncryptRSAKey.js"],"sourcesContent":["var __extends = (this && this.__extends) || (function () {\n var extendStatics = function (d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n return extendStatics(d, b);\n };\n return function (d, b) {\n if (typeof b !== \"function\" && b !== null)\n throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n };\n})();\nimport { hex2b64 } from \"./lib/jsbn/base64\";\nimport { Hex } from \"./lib/asn1js/hex\";\nimport { Base64 } from \"./lib/asn1js/base64\";\nimport { ASN1 } from \"./lib/asn1js/asn1\";\nimport { RSAKey } from \"./lib/jsbn/rsa\";\nimport { parseBigInt } from \"./lib/jsbn/jsbn\";\nimport { KJUR } from \"./lib/jsrsasign/asn1-1.0\";\n/**\n * Create a new JSEncryptRSAKey that extends Tom Wu's RSA key object.\n * This object is just a decorator for parsing the key parameter\n * @param {string|Object} key - The key in string format, or an object containing\n * the parameters needed to build a RSAKey object.\n * @constructor\n */\nvar JSEncryptRSAKey = /** @class */ (function (_super) {\n __extends(JSEncryptRSAKey, _super);\n function JSEncryptRSAKey(key) {\n var _this = _super.call(this) || this;\n // Call the super constructor.\n // RSAKey.call(this);\n // If a key key was provided.\n if (key) {\n // If this is a string...\n if (typeof key === \"string\") {\n _this.parseKey(key);\n }\n else if (JSEncryptRSAKey.hasPrivateKeyProperty(key) ||\n JSEncryptRSAKey.hasPublicKeyProperty(key)) {\n // Set the values for the key.\n _this.parsePropertiesFrom(key);\n }\n }\n return _this;\n }\n /**\n * Method to parse a pem encoded string containing both a public or private key.\n * The method will translate the pem encoded string in a der encoded string and\n * will parse private key and public key parameters. This method accepts public key\n * in the rsaencryption pkcs #1 format (oid: 1.2.840.113549.1.1.1).\n *\n * @todo Check how many rsa formats use the same format of pkcs #1.\n *\n * The format is defined as:\n * PublicKeyInfo ::= SEQUENCE {\n * algorithm AlgorithmIdentifier,\n * PublicKey BIT STRING\n * }\n * Where AlgorithmIdentifier is:\n * AlgorithmIdentifier ::= SEQUENCE {\n * algorithm OBJECT IDENTIFIER, the OID of the enc algorithm\n * parameters ANY DEFINED BY algorithm OPTIONAL (NULL for PKCS #1)\n * }\n * and PublicKey is a SEQUENCE encapsulated in a BIT STRING\n * RSAPublicKey ::= SEQUENCE {\n * modulus INTEGER, -- n\n * publicExponent INTEGER -- e\n * }\n * it's possible to examine the structure of the keys obtained from openssl using\n * an asn.1 dumper as the one used here to parse the components: http://lapo.it/asn1js/\n * @argument {string} pem the pem encoded string, can include the BEGIN/END header/footer\n * @private\n */\n JSEncryptRSAKey.prototype.parseKey = function (pem) {\n try {\n var modulus = 0;\n var public_exponent = 0;\n var reHex = /^\\s*(?:[0-9A-Fa-f][0-9A-Fa-f]\\s*)+$/;\n var der = reHex.test(pem) ? Hex.decode(pem) : Base64.unarmor(pem);\n var asn1 = ASN1.decode(der);\n // Fixes a bug with OpenSSL 1.0+ private keys\n if (asn1.sub.length === 3) {\n asn1 = asn1.sub[2].sub[0];\n }\n if (asn1.sub.length === 9) {\n // Parse the private key.\n modulus = asn1.sub[1].getHexStringValue(); // bigint\n this.n = parseBigInt(modulus, 16);\n public_exponent = asn1.sub[2].getHexStringValue(); // int\n this.e = parseInt(public_exponent, 16);\n var private_exponent = asn1.sub[3].getHexStringValue(); // bigint\n this.d = parseBigInt(private_exponent, 16);\n var prime1 = asn1.sub[4].getHexStringValue(); // bigint\n this.p = parseBigInt(prime1, 16);\n var prime2 = asn1.sub[5].getHexStringValue(); // bigint\n this.q = parseBigInt(prime2, 16);\n var exponent1 = asn1.sub[6].getHexStringValue(); // bigint\n this.dmp1 = parseBigInt(exponent1, 16);\n var exponent2 = asn1.sub[7].getHexStringValue(); // bigint\n this.dmq1 = parseBigInt(exponent2, 16);\n var coefficient = asn1.sub[8].getHexStringValue(); // bigint\n this.coeff = parseBigInt(coefficient, 16);\n }\n else if (asn1.sub.length === 2) {\n if (asn1.sub[0].sub) {\n // Parse ASN.1 SubjectPublicKeyInfo type as defined by X.509\n var bit_string = asn1.sub[1];\n var sequence = bit_string.sub[0];\n modulus = sequence.sub[0].getHexStringValue();\n this.n = parseBigInt(modulus, 16);\n public_exponent = sequence.sub[1].getHexStringValue();\n this.e = parseInt(public_exponent, 16);\n }\n else {\n // Parse ASN.1 RSAPublicKey type as defined by PKCS #1\n modulus = asn1.sub[0].getHexStringValue();\n this.n = parseBigInt(modulus, 16);\n public_exponent = asn1.sub[1].getHexStringValue();\n this.e = parseInt(public_exponent, 16);\n }\n }\n else {\n return false;\n }\n return true;\n }\n catch (ex) {\n return false;\n }\n };\n /**\n * Translate rsa parameters in a hex encoded string representing the rsa key.\n *\n * The translation follow the ASN.1 notation :\n * RSAPrivateKey ::= SEQUENCE {\n * version Version,\n * modulus INTEGER, -- n\n * publicExponent INTEGER, -- e\n * privateExponent INTEGER, -- d\n * prime1 INTEGER, -- p\n * prime2 INTEGER, -- q\n * exponent1 INTEGER, -- d mod (p1)\n * exponent2 INTEGER, -- d mod (q-1)\n * coefficient INTEGER, -- (inverse of q) mod p\n * }\n * @returns {string} DER Encoded String representing the rsa private key\n * @private\n */\n JSEncryptRSAKey.prototype.getPrivateBaseKey = function () {\n var options = {\n array: [\n new KJUR.asn1.DERInteger({ int: 0 }),\n new KJUR.asn1.DERInteger({ bigint: this.n }),\n new KJUR.asn1.DERInteger({ int: this.e }),\n new KJUR.asn1.DERInteger({ bigint: this.d }),\n new KJUR.asn1.DERInteger({ bigint: this.p }),\n new KJUR.asn1.DERInteger({ bigint: this.q }),\n new KJUR.asn1.DERInteger({ bigint: this.dmp1 }),\n new KJUR.asn1.DERInteger({ bigint: this.dmq1 }),\n new KJUR.asn1.DERInteger({ bigint: this.coeff }),\n ],\n };\n var seq = new KJUR.asn1.DERSequence(options);\n return seq.getEncodedHex();\n };\n /**\n * base64 (pem) encoded version of the DER encoded representation\n * @returns {string} pem encoded representation without header and footer\n * @public\n */\n JSEncryptRSAKey.prototype.getPrivateBaseKeyB64 = function () {\n return hex2b64(this.getPrivateBaseKey());\n };\n /**\n * Translate rsa parameters in a hex encoded string representing the rsa public key.\n * The representation follow the ASN.1 notation :\n * PublicKeyInfo ::= SEQUENCE {\n * algorithm AlgorithmIdentifier,\n * PublicKey BIT STRING\n * }\n * Where AlgorithmIdentifier is:\n * AlgorithmIdentifier ::= SEQUENCE {\n * algorithm OBJECT IDENTIFIER, the OID of the enc algorithm\n * parameters ANY DEFINED BY algorithm OPTIONAL (NULL for PKCS #1)\n * }\n * and PublicKey is a SEQUENCE encapsulated in a BIT STRING\n * RSAPublicKey ::= SEQUENCE {\n * modulus INTEGER, -- n\n * publicExponent INTEGER -- e\n * }\n * @returns {string} DER Encoded String representing the rsa public key\n * @private\n */\n JSEncryptRSAKey.prototype.getPublicBaseKey = function () {\n var first_sequence = new KJUR.asn1.DERSequence({\n array: [\n new KJUR.asn1.DERObjectIdentifier({ oid: \"1.2.840.113549.1.1.1\" }), // RSA Encryption pkcs #1 oid\n new KJUR.asn1.DERNull(),\n ],\n });\n var second_sequence = new KJUR.asn1.DERSequence({\n array: [\n new KJUR.asn1.DERInteger({ bigint: this.n }),\n new KJUR.asn1.DERInteger({ int: this.e }),\n ],\n });\n var bit_string = new KJUR.asn1.DERBitString({\n hex: \"00\" + second_sequence.getEncodedHex(),\n });\n var seq = new KJUR.asn1.DERSequence({\n array: [first_sequence, bit_string],\n });\n return seq.getEncodedHex();\n };\n /**\n * base64 (pem) encoded version of the DER encoded representation\n * @returns {string} pem encoded representation without header and footer\n * @public\n */\n JSEncryptRSAKey.prototype.getPublicBaseKeyB64 = function () {\n return hex2b64(this.getPublicBaseKey());\n };\n /**\n * wrap the string in block of width chars. The default value for rsa keys is 64\n * characters.\n * @param {string} str the pem encoded string without header and footer\n * @param {Number} [width=64] - the length the string has to be wrapped at\n * @returns {string}\n * @private\n */\n JSEncryptRSAKey.wordwrap = function (str, width) {\n width = width || 64;\n if (!str) {\n return str;\n }\n var regex = \"(.{1,\" + width + \"})( +|$\\n?)|(.{1,\" + width + \"})\";\n return str.match(RegExp(regex, \"g\")).join(\"\\n\");\n };\n /**\n * Retrieve the pem encoded private key\n * @returns {string} the pem encoded private key with header/footer\n * @public\n */\n JSEncryptRSAKey.prototype.getPrivateKey = function () {\n var key = \"-----BEGIN RSA PRIVATE KEY-----\\n\";\n key += JSEncryptRSAKey.wordwrap(this.getPrivateBaseKeyB64()) + \"\\n\";\n key += \"-----END RSA PRIVATE KEY-----\";\n return key;\n };\n /**\n * Retrieve the pem encoded public key\n * @returns {string} the pem encoded public key with header/footer\n * @public\n */\n JSEncryptRSAKey.prototype.getPublicKey = function () {\n var key = \"-----BEGIN PUBLIC KEY-----\\n\";\n key += JSEncryptRSAKey.wordwrap(this.getPublicBaseKeyB64()) + \"\\n\";\n key += \"-----END PUBLIC KEY-----\";\n return key;\n };\n /**\n * Check if the object contains the necessary parameters to populate the rsa modulus\n * and public exponent parameters.\n * @param {Object} [obj={}] - An object that may contain the two public key\n * parameters\n * @returns {boolean} true if the object contains both the modulus and the public exponent\n * properties (n and e)\n * @todo check for types of n and e. N should be a parseable bigInt object, E should\n * be a parseable integer number\n * @private\n */\n JSEncryptRSAKey.hasPublicKeyProperty = function (obj) {\n obj = obj || {};\n return obj.hasOwnProperty(\"n\") && obj.hasOwnProperty(\"e\");\n };\n /**\n * Check if the object contains ALL the parameters of an RSA key.\n * @param {Object} [obj={}] - An object that may contain nine rsa key\n * parameters\n * @returns {boolean} true if the object contains all the parameters needed\n * @todo check for types of the parameters all the parameters but the public exponent\n * should be parseable bigint objects, the public exponent should be a parseable integer number\n * @private\n */\n JSEncryptRSAKey.hasPrivateKeyProperty = function (obj) {\n obj = obj || {};\n return (obj.hasOwnProperty(\"n\") &&\n obj.hasOwnProperty(\"e\") &&\n obj.hasOwnProperty(\"d\") &&\n obj.hasOwnProperty(\"p\") &&\n obj.hasOwnProperty(\"q\") &&\n obj.hasOwnProperty(\"dmp1\") &&\n obj.hasOwnProperty(\"dmq1\") &&\n obj.hasOwnProperty(\"coeff\"));\n };\n /**\n * Parse the properties of obj in the current rsa object. Obj should AT LEAST\n * include the modulus and public exponent (n, e) parameters.\n * @param {Object} obj - the object containing rsa parameters\n * @private\n */\n JSEncryptRSAKey.prototype.parsePropertiesFrom = function (obj) {\n this.n = obj.n;\n this.e = obj.e;\n if (obj.hasOwnProperty(\"d\")) {\n this.d = obj.d;\n this.p = obj.p;\n this.q = obj.q;\n this.dmp1 = obj.dmp1;\n this.dmq1 = obj.dmq1;\n this.coeff = obj.coeff;\n }\n };\n return JSEncryptRSAKey;\n}(RSAKey));\nexport { JSEncryptRSAKey };\n"],"names":["d","b","JSEncryptRSAKey"],"mappings":";;;;;;;AAAA,IAAI,YAAyC,4BAAY;AACrD,MAAI,gBAAgB,SAAU,GAAG,GAAG;AAChC,oBAAgB,OAAO,kBAClB,EAAE,WAAW,CAAA,eAAgB,SAAS,SAAUA,IAAGC,IAAG;AAAE,MAAAD,GAAE,YAAYC;AAAA,IAAG,KAC1E,SAAUD,IAAGC,IAAG;AAAE,eAAS,KAAKA,GAAG,KAAI,OAAO,UAAU,eAAe,KAAKA,IAAG,CAAC,EAAG,CAAAD,GAAE,CAAC,IAAIC,GAAE,CAAC;AAAA,IAAG;AACpG,WAAO,cAAc,GAAG,CAAC;AAAA,EAC7B;AACA,SAAO,SAAU,GAAG,GAAG;AACnB,QAAI,OAAO,MAAM,cAAc,MAAM;AACjC,YAAM,IAAI,UAAU,yBAAyB,OAAO,CAAC,IAAI,+BAA+B;AAC5F,kBAAc,GAAG,CAAC;AAClB,aAAS,KAAK;AAAE,WAAK,cAAc;AAAA,IAAG;AACtC,MAAE,YAAY,MAAM,OAAO,OAAO,OAAO,CAAC,KAAK,GAAG,YAAY,EAAE,WAAW,IAAI,GAAE;AAAA,EACrF;AACJ,GAAC;AAeE,IAAC;AAAA;AAAA,GAAiC,SAAU,QAAQ;AACnD,cAAUC,kBAAiB,MAAM;AACjC,aAASA,iBAAgB,KAAK;AAC1B,UAAI,QAAQ,OAAO,KAAK,IAAI,KAAK;AAIjC,UAAI,KAAK;AAEL,YAAI,OAAO,QAAQ,UAAU;AACzB,gBAAM,SAAS,GAAG;AAAA,QACtB,WACSA,iBAAgB,sBAAsB,GAAG,KAC9CA,iBAAgB,qBAAqB,GAAG,GAAG;AAE3C,gBAAM,oBAAoB,GAAG;AAAA,QACjC;AAAA,MACJ;AACA,aAAO;AAAA,IACX;AA6BA,IAAAA,iBAAgB,UAAU,WAAW,SAAU,KAAK;AAChD,UAAI;AACA,YAAI,UAAU;AACd,YAAI,kBAAkB;AACtB,YAAI,QAAQ;AACZ,YAAI,MAAM,MAAM,KAAK,GAAG,IAAI,IAAI,OAAO,GAAG,IAAI,OAAO,QAAQ,GAAG;AAChE,YAAI,OAAO,KAAK,OAAO,GAAG;AAE1B,YAAI,KAAK,IAAI,WAAW,GAAG;AACvB,iBAAO,KAAK,IAAI,CAAC,EAAE,IAAI,CAAC;AAAA,QAC5B;AACA,YAAI,KAAK,IAAI,WAAW,GAAG;AAEvB,oBAAU,KAAK,IAAI,CAAC,EAAE,kBAAiB;AACvC,eAAK,IAAI,YAAY,SAAS,EAAE;AAChC,4BAAkB,KAAK,IAAI,CAAC,EAAE,kBAAiB;AAC/C,eAAK,IAAI,SAAS,iBAAiB,EAAE;AACrC,cAAI,mBAAmB,KAAK,IAAI,CAAC,EAAE,kBAAiB;AACpD,eAAK,IAAI,YAAY,kBAAkB,EAAE;AACzC,cAAI,SAAS,KAAK,IAAI,CAAC,EAAE,kBAAiB;AAC1C,eAAK,IAAI,YAAY,QAAQ,EAAE;AAC/B,cAAI,SAAS,KAAK,IAAI,CAAC,EAAE,kBAAiB;AAC1C,eAAK,IAAI,YAAY,QAAQ,EAAE;AAC/B,cAAI,YAAY,KAAK,IAAI,CAAC,EAAE,kBAAiB;AAC7C,eAAK,OAAO,YAAY,WAAW,EAAE;AACrC,cAAI,YAAY,KAAK,IAAI,CAAC,EAAE,kBAAiB;AAC7C,eAAK,OAAO,YAAY,WAAW,EAAE;AACrC,cAAI,cAAc,KAAK,IAAI,CAAC,EAAE,kBAAiB;AAC/C,eAAK,QAAQ,YAAY,aAAa,EAAE;AAAA,QAC5C,WACS,KAAK,IAAI,WAAW,GAAG;AAC5B,cAAI,KAAK,IAAI,CAAC,EAAE,KAAK;AAEjB,gBAAI,aAAa,KAAK,IAAI,CAAC;AAC3B,gBAAI,WAAW,WAAW,IAAI,CAAC;AAC/B,sBAAU,SAAS,IAAI,CAAC,EAAE,kBAAiB;AAC3C,iBAAK,IAAI,YAAY,SAAS,EAAE;AAChC,8BAAkB,SAAS,IAAI,CAAC,EAAE,kBAAiB;AACnD,iBAAK,IAAI,SAAS,iBAAiB,EAAE;AAAA,UACzC,OACK;AAED,sBAAU,KAAK,IAAI,CAAC,EAAE,kBAAiB;AACvC,iBAAK,IAAI,YAAY,SAAS,EAAE;AAChC,8BAAkB,KAAK,IAAI,CAAC,EAAE,kBAAiB;AAC/C,iBAAK,IAAI,SAAS,iBAAiB,EAAE;AAAA,UACzC;AAAA,QACJ,OACK;AACD,iBAAO;AAAA,QACX;AACA,eAAO;AAAA,MACX,SACO,IAAI;AACP,eAAO;AAAA,MACX;AAAA,IACJ;AAmBA,IAAAA,iBAAgB,UAAU,oBAAoB,WAAY;AACtD,UAAI,UAAU;AAAA,QACV,OAAO;AAAA,UACH,IAAI,KAAK,KAAK,WAAW,EAAE,KAAK,EAAC,CAAE;AAAA,UACnC,IAAI,KAAK,KAAK,WAAW,EAAE,QAAQ,KAAK,GAAG;AAAA,UAC3C,IAAI,KAAK,KAAK,WAAW,EAAE,KAAK,KAAK,GAAG;AAAA,UACxC,IAAI,KAAK,KAAK,WAAW,EAAE,QAAQ,KAAK,GAAG;AAAA,UAC3C,IAAI,KAAK,KAAK,WAAW,EAAE,QAAQ,KAAK,GAAG;AAAA,UAC3C,IAAI,KAAK,KAAK,WAAW,EAAE,QAAQ,KAAK,GAAG;AAAA,UAC3C,IAAI,KAAK,KAAK,WAAW,EAAE,QAAQ,KAAK,MAAM;AAAA,UAC9C,IAAI,KAAK,KAAK,WAAW,EAAE,QAAQ,KAAK,MAAM;AAAA,UAC9C,IAAI,KAAK,KAAK,WAAW,EAAE,QAAQ,KAAK,OAAO;AAAA,QAC/D;AAAA,MACA;AACQ,UAAI,MAAM,IAAI,KAAK,KAAK,YAAY,OAAO;AAC3C,aAAO,IAAI,cAAa;AAAA,IAC5B;AAMA,IAAAA,iBAAgB,UAAU,uBAAuB,WAAY;AACzD,aAAO,QAAQ,KAAK,mBAAmB;AAAA,IAC3C;AAqBA,IAAAA,iBAAgB,UAAU,mBAAmB,WAAY;AACrD,UAAI,iBAAiB,IAAI,KAAK,KAAK,YAAY;AAAA,QAC3C,OAAO;AAAA,UACH,IAAI,KAAK,KAAK,oBAAoB,EAAE,KAAK,uBAAsB,CAAE;AAAA;AAAA,UACjE,IAAI,KAAK,KAAK,QAAO;AAAA,QACrC;AAAA,MACA,CAAS;AACD,UAAI,kBAAkB,IAAI,KAAK,KAAK,YAAY;AAAA,QAC5C,OAAO;AAAA,UACH,IAAI,KAAK,KAAK,WAAW,EAAE,QAAQ,KAAK,GAAG;AAAA,UAC3C,IAAI,KAAK,KAAK,WAAW,EAAE,KAAK,KAAK,GAAG;AAAA,QACxD;AAAA,MACA,CAAS;AACD,UAAI,aAAa,IAAI,KAAK,KAAK,aAAa;AAAA,QACxC,KAAK,OAAO,gBAAgB,cAAa;AAAA,MACrD,CAAS;AACD,UAAI,MAAM,IAAI,KAAK,KAAK,YAAY;AAAA,QAChC,OAAO,CAAC,gBAAgB,UAAU;AAAA,MAC9C,CAAS;AACD,aAAO,IAAI,cAAa;AAAA,IAC5B;AAMA,IAAAA,iBAAgB,UAAU,sBAAsB,WAAY;AACxD,aAAO,QAAQ,KAAK,kBAAkB;AAAA,IAC1C;AASA,IAAAA,iBAAgB,WAAW,SAAU,KAAK,OAAO;AAC7C,cAAQ,SAAS;AACjB,UAAI,CAAC,KAAK;AACN,eAAO;AAAA,MACX;AACA,UAAI,QAAQ,UAAU,QAAQ,sBAAsB,QAAQ;AAC5D,aAAO,IAAI,MAAM,OAAO,OAAO,GAAG,CAAC,EAAE,KAAK,IAAI;AAAA,IAClD;AAMA,IAAAA,iBAAgB,UAAU,gBAAgB,WAAY;AAClD,UAAI,MAAM;AACV,aAAOA,iBAAgB,SAAS,KAAK,qBAAoB,CAAE,IAAI;AAC/D,aAAO;AACP,aAAO;AAAA,IACX;AAMA,IAAAA,iBAAgB,UAAU,eAAe,WAAY;AACjD,UAAI,MAAM;AACV,aAAOA,iBAAgB,SAAS,KAAK,oBAAmB,CAAE,IAAI;AAC9D,aAAO;AACP,aAAO;AAAA,IACX;AAYA,IAAAA,iBAAgB,uBAAuB,SAAU,KAAK;AAClD,YAAM,OAAO,CAAA;AACb,aAAO,IAAI,eAAe,GAAG,KAAK,IAAI,eAAe,GAAG;AAAA,IAC5D;AAUA,IAAAA,iBAAgB,wBAAwB,SAAU,KAAK;AACnD,YAAM,OAAO,CAAA;AACb,aAAQ,IAAI,eAAe,GAAG,KAC1B,IAAI,eAAe,GAAG,KACtB,IAAI,eAAe,GAAG,KACtB,IAAI,eAAe,GAAG,KACtB,IAAI,eAAe,GAAG,KACtB,IAAI,eAAe,MAAM,KACzB,IAAI,eAAe,MAAM,KACzB,IAAI,eAAe,OAAO;AAAA,IAClC;AAOA,IAAAA,iBAAgB,UAAU,sBAAsB,SAAU,KAAK;AAC3D,WAAK,IAAI,IAAI;AACb,WAAK,IAAI,IAAI;AACb,UAAI,IAAI,eAAe,GAAG,GAAG;AACzB,aAAK,IAAI,IAAI;AACb,aAAK,IAAI,IAAI;AACb,aAAK,IAAI,IAAI;AACb,aAAK,OAAO,IAAI;AAChB,aAAK,OAAO,IAAI;AAChB,aAAK,QAAQ,IAAI;AAAA,MACrB;AAAA,IACJ;AACA,WAAOA;AAAA,EACX,GAAE,MAAM;AAAA;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/jsencrypt@3.5.4/node_modules/jsencrypt/lib/index.mjs.map DELETED Viewed

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

package/dist/node_modules/.pnpm/jsencrypt@3.5.4/node_modules/jsencrypt/lib/lib/asn1js/asn1.mjs.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"asn1.mjs","sources":["../../../../../../../../../../../node_modules/.pnpm/jsencrypt@3.5.4/node_modules/jsencrypt/lib/lib/asn1js/asn1.js"],"sourcesContent":["// ASN.1 JavaScript decoder\n// Copyright (c) 2008-2014 Lapo Luchini <lapo@lapo.it>\n// Permission to use, copy, modify, and/or distribute this software for any\n// purpose with or without fee is hereby granted, provided that the above\n// copyright notice and this permission notice appear in all copies.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\n// WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\n// MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\n// ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\n// WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\n// ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\n// OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n/*jshint browser: true, strict: true, immed: true, latedef: true, undef: true, regexdash: false */\n/*global oids */\nimport { Int10 } from \"./int10\";\nvar ellipsis = \"\\u2026\";\nvar reTimeS = /^(\\d\\d)(0[1-9]|1[0-2])(0[1-9]|[12]\\d|3[01])([01]\\d|2[0-3])(?:([0-5]\\d)(?:([0-5]\\d)(?:[.,](\\d{1,3}))?)?)?(Z|[-+](?:[0]\\d|1[0-2])([0-5]\\d)?)?$/;\nvar reTimeL = /^(\\d\\d\\d\\d)(0[1-9]|1[0-2])(0[1-9]|[12]\\d|3[01])([01]\\d|2[0-3])(?:([0-5]\\d)(?:([0-5]\\d)(?:[.,](\\d{1,3}))?)?)?(Z|[-+](?:[0]\\d|1[0-2])([0-5]\\d)?)?$/;\nfunction stringCut(str, len) {\n if (str.length > len) {\n str = str.substring(0, len) + ellipsis;\n }\n return str;\n}\nvar Stream = /** @class */ (function () {\n function Stream(enc, pos) {\n this.hexDigits = \"0123456789ABCDEF\";\n if (enc instanceof Stream) {\n this.enc = enc.enc;\n this.pos = enc.pos;\n }\n else {\n // enc should be an array or a binary string\n this.enc = enc;\n this.pos = pos;\n }\n }\n Stream.prototype.get = function (pos) {\n if (pos === undefined) {\n pos = this.pos++;\n }\n if (pos >= this.enc.length) {\n throw new Error(\"Requesting byte offset \".concat(pos, \" on a stream of length \").concat(this.enc.length));\n }\n return (\"string\" === typeof this.enc) ? this.enc.charCodeAt(pos) : this.enc[pos];\n };\n Stream.prototype.hexByte = function (b) {\n return this.hexDigits.charAt((b >> 4) & 0xF) + this.hexDigits.charAt(b & 0xF);\n };\n Stream.prototype.hexDump = function (start, end, raw) {\n var s = \"\";\n for (var i = start; i < end; ++i) {\n s += this.hexByte(this.get(i));\n if (raw !== true) {\n switch (i & 0xF) {\n case 0x7:\n s += \" \";\n break;\n case 0xF:\n s += \"\\n\";\n break;\n default:\n s += \" \";\n }\n }\n }\n return s;\n };\n Stream.prototype.isASCII = function (start, end) {\n for (var i = start; i < end; ++i) {\n var c = this.get(i);\n if (c < 32 || c > 176) {\n return false;\n }\n }\n return true;\n };\n Stream.prototype.parseStringISO = function (start, end) {\n var s = \"\";\n for (var i = start; i < end; ++i) {\n s += String.fromCharCode(this.get(i));\n }\n return s;\n };\n Stream.prototype.parseStringUTF = function (start, end) {\n var s = \"\";\n for (var i = start; i < end;) {\n var c = this.get(i++);\n if (c < 128) {\n s += String.fromCharCode(c);\n }\n else if ((c > 191) && (c < 224)) {\n s += String.fromCharCode(((c & 0x1F) << 6) | (this.get(i++) & 0x3F));\n }\n else {\n s += String.fromCharCode(((c & 0x0F) << 12) | ((this.get(i++) & 0x3F) << 6) | (this.get(i++) & 0x3F));\n }\n }\n return s;\n };\n Stream.prototype.parseStringBMP = function (start, end) {\n var str = \"\";\n var hi;\n var lo;\n for (var i = start; i < end;) {\n hi = this.get(i++);\n lo = this.get(i++);\n str += String.fromCharCode((hi << 8) | lo);\n }\n return str;\n };\n Stream.prototype.parseTime = function (start, end, shortYear) {\n var s = this.parseStringISO(start, end);\n var m = (shortYear ? reTimeS : reTimeL).exec(s);\n if (!m) {\n return \"Unrecognized time: \" + s;\n }\n if (shortYear) {\n // to avoid querying the timer, use the fixed range [1970, 2069]\n // it will conform with ITU X.400 [-10, +40] sliding window until 2030\n m[1] = +m[1];\n m[1] += (+m[1] < 70) ? 2000 : 1900;\n }\n s = m[1] + \"-\" + m[2] + \"-\" + m[3] + \" \" + m[4];\n if (m[5]) {\n s += \":\" + m[5];\n if (m[6]) {\n s += \":\" + m[6];\n if (m[7]) {\n s += \".\" + m[7];\n }\n }\n }\n if (m[8]) {\n s += \" UTC\";\n if (m[8] != \"Z\") {\n s += m[8];\n if (m[9]) {\n s += \":\" + m[9];\n }\n }\n }\n return s;\n };\n Stream.prototype.parseInteger = function (start, end) {\n var v = this.get(start);\n var neg = (v > 127);\n var pad = neg ? 255 : 0;\n var len;\n var s = \"\";\n // skip unuseful bits (not allowed in DER)\n while (v == pad && ++start < end) {\n v = this.get(start);\n }\n len = end - start;\n if (len === 0) {\n return neg ? -1 : 0;\n }\n // show bit length of huge integers\n if (len > 4) {\n s = v;\n len <<= 3;\n while (((+s ^ pad) & 0x80) == 0) {\n s = +s << 1;\n --len;\n }\n s = \"(\" + len + \" bit)\\n\";\n }\n // decode the integer\n if (neg) {\n v = v - 256;\n }\n var n = new Int10(v);\n for (var i = start + 1; i < end; ++i) {\n n.mulAdd(256, this.get(i));\n }\n return s + n.toString();\n };\n Stream.prototype.parseBitString = function (start, end, maxLength) {\n var unusedBit = this.get(start);\n var lenBit = ((end - start - 1) << 3) - unusedBit;\n var intro = \"(\" + lenBit + \" bit)\\n\";\n var s = \"\";\n for (var i = start + 1; i < end; ++i) {\n var b = this.get(i);\n var skip = (i == end - 1) ? unusedBit : 0;\n for (var j = 7; j >= skip; --j) {\n s += (b >> j) & 1 ? \"1\" : \"0\";\n }\n if (s.length > maxLength) {\n return intro + stringCut(s, maxLength);\n }\n }\n return intro + s;\n };\n Stream.prototype.parseOctetString = function (start, end, maxLength) {\n if (this.isASCII(start, end)) {\n return stringCut(this.parseStringISO(start, end), maxLength);\n }\n var len = end - start;\n var s = \"(\" + len + \" byte)\\n\";\n maxLength /= 2; // we work in bytes\n if (len > maxLength) {\n end = start + maxLength;\n }\n for (var i = start; i < end; ++i) {\n s += this.hexByte(this.get(i));\n }\n if (len > maxLength) {\n s += ellipsis;\n }\n return s;\n };\n Stream.prototype.parseOID = function (start, end, maxLength) {\n var s = \"\";\n var n = new Int10();\n var bits = 0;\n for (var i = start; i < end; ++i) {\n var v = this.get(i);\n n.mulAdd(128, v & 0x7F);\n bits += 7;\n if (!(v & 0x80)) { // finished\n if (s === \"\") {\n n = n.simplify();\n if (n instanceof Int10) {\n n.sub(80);\n s = \"2.\" + n.toString();\n }\n else {\n var m = n < 80 ? n < 40 ? 0 : 1 : 2;\n s = m + \".\" + (n - m * 40);\n }\n }\n else {\n s += \".\" + n.toString();\n }\n if (s.length > maxLength) {\n return stringCut(s, maxLength);\n }\n n = new Int10();\n bits = 0;\n }\n }\n if (bits > 0) {\n s += \".incomplete\";\n }\n return s;\n };\n return Stream;\n}());\nexport { Stream };\nvar ASN1 = /** @class */ (function () {\n function ASN1(stream, header, length, tag, sub) {\n if (!(tag instanceof ASN1Tag)) {\n throw new Error(\"Invalid tag value.\");\n }\n this.stream = stream;\n this.header = header;\n this.length = length;\n this.tag = tag;\n this.sub = sub;\n }\n ASN1.prototype.typeName = function () {\n switch (this.tag.tagClass) {\n case 0: // universal\n switch (this.tag.tagNumber) {\n case 0x00:\n return \"EOC\";\n case 0x01:\n return \"BOOLEAN\";\n case 0x02:\n return \"INTEGER\";\n case 0x03:\n return \"BIT_STRING\";\n case 0x04:\n return \"OCTET_STRING\";\n case 0x05:\n return \"NULL\";\n case 0x06:\n return \"OBJECT_IDENTIFIER\";\n case 0x07:\n return \"ObjectDescriptor\";\n case 0x08:\n return \"EXTERNAL\";\n case 0x09:\n return \"REAL\";\n case 0x0A:\n return \"ENUMERATED\";\n case 0x0B:\n return \"EMBEDDED_PDV\";\n case 0x0C:\n return \"UTF8String\";\n case 0x10:\n return \"SEQUENCE\";\n case 0x11:\n return \"SET\";\n case 0x12:\n return \"NumericString\";\n case 0x13:\n return \"PrintableString\"; // ASCII subset\n case 0x14:\n return \"TeletexString\"; // aka T61String\n case 0x15:\n return \"VideotexString\";\n case 0x16:\n return \"IA5String\"; // ASCII\n case 0x17:\n return \"UTCTime\";\n case 0x18:\n return \"GeneralizedTime\";\n case 0x19:\n return \"GraphicString\";\n case 0x1A:\n return \"VisibleString\"; // ASCII subset\n case 0x1B:\n return \"GeneralString\";\n case 0x1C:\n return \"UniversalString\";\n case 0x1E:\n return \"BMPString\";\n }\n return \"Universal_\" + this.tag.tagNumber.toString();\n case 1:\n return \"Application_\" + this.tag.tagNumber.toString();\n case 2:\n return \"[\" + this.tag.tagNumber.toString() + \"]\"; // Context\n case 3:\n return \"Private_\" + this.tag.tagNumber.toString();\n }\n };\n ASN1.prototype.content = function (maxLength) {\n if (this.tag === undefined) {\n return null;\n }\n if (maxLength === undefined) {\n maxLength = Infinity;\n }\n var content = this.posContent();\n var len = Math.abs(this.length);\n if (!this.tag.isUniversal()) {\n if (this.sub !== null) {\n return \"(\" + this.sub.length + \" elem)\";\n }\n return this.stream.parseOctetString(content, content + len, maxLength);\n }\n switch (this.tag.tagNumber) {\n case 0x01: // BOOLEAN\n return (this.stream.get(content) === 0) ? \"false\" : \"true\";\n case 0x02: // INTEGER\n return this.stream.parseInteger(content, content + len);\n case 0x03: // BIT_STRING\n return this.sub ? \"(\" + this.sub.length + \" elem)\" :\n this.stream.parseBitString(content, content + len, maxLength);\n case 0x04: // OCTET_STRING\n return this.sub ? \"(\" + this.sub.length + \" elem)\" :\n this.stream.parseOctetString(content, content + len, maxLength);\n // case 0x05: // NULL\n case 0x06: // OBJECT_IDENTIFIER\n return this.stream.parseOID(content, content + len, maxLength);\n // case 0x07: // ObjectDescriptor\n // case 0x08: // EXTERNAL\n // case 0x09: // REAL\n // case 0x0A: // ENUMERATED\n // case 0x0B: // EMBEDDED_PDV\n case 0x10: // SEQUENCE\n case 0x11: // SET\n if (this.sub !== null) {\n return \"(\" + this.sub.length + \" elem)\";\n }\n else {\n return \"(no elem)\";\n }\n case 0x0C: // UTF8String\n return stringCut(this.stream.parseStringUTF(content, content + len), maxLength);\n case 0x12: // NumericString\n case 0x13: // PrintableString\n case 0x14: // TeletexString\n case 0x15: // VideotexString\n case 0x16: // IA5String\n // case 0x19: // GraphicString\n case 0x1A: // VisibleString\n // case 0x1B: // GeneralString\n // case 0x1C: // UniversalString\n return stringCut(this.stream.parseStringISO(content, content + len), maxLength);\n case 0x1E: // BMPString\n return stringCut(this.stream.parseStringBMP(content, content + len), maxLength);\n case 0x17: // UTCTime\n case 0x18: // GeneralizedTime\n return this.stream.parseTime(content, content + len, (this.tag.tagNumber == 0x17));\n }\n return null;\n };\n ASN1.prototype.toString = function () {\n return this.typeName() + \"@\" + this.stream.pos + \"[header:\" + this.header + \",length:\" + this.length + \",sub:\" + ((this.sub === null) ? \"null\" : this.sub.length) + \"]\";\n };\n ASN1.prototype.toPrettyString = function (indent) {\n if (indent === undefined) {\n indent = \"\";\n }\n var s = indent + this.typeName() + \" @\" + this.stream.pos;\n if (this.length >= 0) {\n s += \"+\";\n }\n s += this.length;\n if (this.tag.tagConstructed) {\n s += \" (constructed)\";\n }\n else if ((this.tag.isUniversal() && ((this.tag.tagNumber == 0x03) || (this.tag.tagNumber == 0x04))) && (this.sub !== null)) {\n s += \" (encapsulates)\";\n }\n s += \"\\n\";\n if (this.sub !== null) {\n indent += \" \";\n for (var i = 0, max = this.sub.length; i < max; ++i) {\n s += this.sub[i].toPrettyString(indent);\n }\n }\n return s;\n };\n ASN1.prototype.posStart = function () {\n return this.stream.pos;\n };\n ASN1.prototype.posContent = function () {\n return this.stream.pos + this.header;\n };\n ASN1.prototype.posEnd = function () {\n return this.stream.pos + this.header + Math.abs(this.length);\n };\n ASN1.prototype.toHexString = function () {\n return this.stream.hexDump(this.posStart(), this.posEnd(), true);\n };\n ASN1.decodeLength = function (stream) {\n var buf = stream.get();\n var len = buf & 0x7F;\n if (len == buf) {\n return len;\n }\n // no reason to use Int10, as it would be a huge buffer anyways\n if (len > 6) {\n throw new Error(\"Length over 48 bits not supported at position \" + (stream.pos - 1));\n }\n if (len === 0) {\n return null;\n } // undefined\n buf = 0;\n for (var i = 0; i < len; ++i) {\n buf = (buf * 256) + stream.get();\n }\n return buf;\n };\n /**\n * Retrieve the hexadecimal value (as a string) of the current ASN.1 element\n * @returns {string}\n * @public\n */\n ASN1.prototype.getHexStringValue = function () {\n var hexString = this.toHexString();\n var offset = this.header * 2;\n var length = this.length * 2;\n return hexString.substring(offset, offset + length);\n };\n ASN1.decode = function (str) {\n var stream;\n if (!(str instanceof Stream)) {\n stream = new Stream(str, 0);\n }\n else {\n stream = str;\n }\n var streamStart = new Stream(stream);\n var tag = new ASN1Tag(stream);\n var len = ASN1.decodeLength(stream);\n var start = stream.pos;\n var header = start - streamStart.pos;\n var sub = null;\n var getSub = function () {\n var ret = [];\n if (len !== null) {\n // definite length\n var end = start + len;\n while (stream.pos < end) {\n ret[ret.length] = ASN1.decode(stream);\n }\n if (stream.pos != end) {\n throw new Error(\"Content size is not correct for container starting at offset \" + start);\n }\n }\n else {\n // undefined length\n try {\n for (;;) {\n var s = ASN1.decode(stream);\n if (s.tag.isEOC()) {\n break;\n }\n ret[ret.length] = s;\n }\n len = start - stream.pos; // undefined lengths are represented as negative values\n }\n catch (e) {\n throw new Error(\"Exception while decoding undefined length content: \" + e);\n }\n }\n return ret;\n };\n if (tag.tagConstructed) {\n // must have valid content\n sub = getSub();\n }\n else if (tag.isUniversal() && ((tag.tagNumber == 0x03) || (tag.tagNumber == 0x04))) {\n // sometimes BitString and OctetString are used to encapsulate ASN.1\n try {\n if (tag.tagNumber == 0x03) {\n if (stream.get() != 0) {\n throw new Error(\"BIT STRINGs with unused bits cannot encapsulate.\");\n }\n }\n sub = getSub();\n for (var i = 0; i < sub.length; ++i) {\n if (sub[i].tag.isEOC()) {\n throw new Error(\"EOC is not supposed to be actual content.\");\n }\n }\n }\n catch (e) {\n // but silently ignore when they don't\n sub = null;\n }\n }\n if (sub === null) {\n if (len === null) {\n throw new Error(\"We can't skip over an invalid tag with undefined length at offset \" + start);\n }\n stream.pos = start + Math.abs(len);\n }\n return new ASN1(streamStart, header, len, tag, sub);\n };\n return ASN1;\n}());\nexport { ASN1 };\nvar ASN1Tag = /** @class */ (function () {\n function ASN1Tag(stream) {\n var buf = stream.get();\n this.tagClass = buf >> 6;\n this.tagConstructed = ((buf & 0x20) !== 0);\n this.tagNumber = buf & 0x1F;\n if (this.tagNumber == 0x1F) { // long tag\n var n = new Int10();\n do {\n buf = stream.get();\n n.mulAdd(128, buf & 0x7F);\n } while (buf & 0x80);\n this.tagNumber = n.simplify();\n }\n }\n ASN1Tag.prototype.isUniversal = function () {\n return this.tagClass === 0x00;\n };\n ASN1Tag.prototype.isEOC = function () {\n return this.tagClass === 0x00 && this.tagNumber === 0x00;\n };\n return ASN1Tag;\n}());\nexport { ASN1Tag };\n"],"names":["Stream","ASN1","ASN1Tag"],"mappings":";AAgBA,IAAI,WAAW;AACf,IAAI,UAAU;AACd,IAAI,UAAU;AACd,SAAS,UAAU,KAAK,KAAK;AACzB,MAAI,IAAI,SAAS,KAAK;AAClB,UAAM,IAAI,UAAU,GAAG,GAAG,IAAI;AAAA,EAClC;AACA,SAAO;AACX;AACG,IAAC;AAAA;AAAA,GAAwB,WAAY;AACpC,aAASA,QAAO,KAAK,KAAK;AACtB,WAAK,YAAY;AACjB,UAAI,eAAeA,SAAQ;AACvB,aAAK,MAAM,IAAI;AACf,aAAK,MAAM,IAAI;AAAA,MACnB,OACK;AAED,aAAK,MAAM;AACX,aAAK,MAAM;AAAA,MACf;AAAA,IACJ;AACA,IAAAA,QAAO,UAAU,MAAM,SAAU,KAAK;AAClC,UAAI,QAAQ,QAAW;AACnB,cAAM,KAAK;AAAA,MACf;AACA,UAAI,OAAO,KAAK,IAAI,QAAQ;AACxB,cAAM,IAAI,MAAM,0BAA0B,OAAO,KAAK,yBAAyB,EAAE,OAAO,KAAK,IAAI,MAAM,CAAC;AAAA,MAC5G;AACA,aAAQ,aAAa,OAAO,KAAK,MAAO,KAAK,IAAI,WAAW,GAAG,IAAI,KAAK,IAAI,GAAG;AAAA,IACnF;AACA,IAAAA,QAAO,UAAU,UAAU,SAAU,GAAG;AACpC,aAAO,KAAK,UAAU,OAAQ,KAAK,IAAK,EAAG,IAAI,KAAK,UAAU,OAAO,IAAI,EAAG;AAAA,IAChF;AACA,IAAAA,QAAO,UAAU,UAAU,SAAU,OAAO,KAAK,KAAK;AAClD,UAAI,IAAI;AACR,eAAS,IAAI,OAAO,IAAI,KAAK,EAAE,GAAG;AAC9B,aAAK,KAAK,QAAQ,KAAK,IAAI,CAAC,CAAC;AAC7B,YAAI,QAAQ,MAAM;AACd,kBAAQ,IAAI,IAAG;AAAA,YACX,KAAK;AACD,mBAAK;AACL;AAAA,YACJ,KAAK;AACD,mBAAK;AACL;AAAA,YACJ;AACI,mBAAK;AAAA,UAC7B;AAAA,QACY;AAAA,MACJ;AACA,aAAO;AAAA,IACX;AACA,IAAAA,QAAO,UAAU,UAAU,SAAU,OAAO,KAAK;AAC7C,eAAS,IAAI,OAAO,IAAI,KAAK,EAAE,GAAG;AAC9B,YAAI,IAAI,KAAK,IAAI,CAAC;AAClB,YAAI,IAAI,MAAM,IAAI,KAAK;AACnB,iBAAO;AAAA,QACX;AAAA,MACJ;AACA,aAAO;AAAA,IACX;AACA,IAAAA,QAAO,UAAU,iBAAiB,SAAU,OAAO,KAAK;AACpD,UAAI,IAAI;AACR,eAAS,IAAI,OAAO,IAAI,KAAK,EAAE,GAAG;AAC9B,aAAK,OAAO,aAAa,KAAK,IAAI,CAAC,CAAC;AAAA,MACxC;AACA,aAAO;AAAA,IACX;AACA,IAAAA,QAAO,UAAU,iBAAiB,SAAU,OAAO,KAAK;AACpD,UAAI,IAAI;AACR,eAAS,IAAI,OAAO,IAAI,OAAM;AAC1B,YAAI,IAAI,KAAK,IAAI,GAAG;AACpB,YAAI,IAAI,KAAK;AACT,eAAK,OAAO,aAAa,CAAC;AAAA,QAC9B,WACU,IAAI,OAAS,IAAI,KAAM;AAC7B,eAAK,OAAO,cAAe,IAAI,OAAS,IAAM,KAAK,IAAI,GAAG,IAAI,EAAK;AAAA,QACvE,OACK;AACD,eAAK,OAAO,cAAe,IAAI,OAAS,MAAQ,KAAK,IAAI,GAAG,IAAI,OAAS,IAAM,KAAK,IAAI,GAAG,IAAI,EAAK;AAAA,QACxG;AAAA,MACJ;AACA,aAAO;AAAA,IACX;AACA,IAAAA,QAAO,UAAU,iBAAiB,SAAU,OAAO,KAAK;AACpD,UAAI,MAAM;AACV,UAAI;AACJ,UAAI;AACJ,eAAS,IAAI,OAAO,IAAI,OAAM;AAC1B,aAAK,KAAK,IAAI,GAAG;AACjB,aAAK,KAAK,IAAI,GAAG;AACjB,eAAO,OAAO,aAAc,MAAM,IAAK,EAAE;AAAA,MAC7C;AACA,aAAO;AAAA,IACX;AACA,IAAAA,QAAO,UAAU,YAAY,SAAU,OAAO,KAAK,WAAW;AAC1D,UAAI,IAAI,KAAK,eAAe,OAAO,GAAG;AACtC,UAAI,KAAK,YAAY,UAAU,SAAS,KAAK,CAAC;AAC9C,UAAI,CAAC,GAAG;AACJ,eAAO,wBAAwB;AAAA,MACnC;AACA,UAAI,WAAW;AAGX,UAAE,CAAC,IAAI,CAAC,EAAE,CAAC;AACX,UAAE,CAAC,KAAM,CAAC,EAAE,CAAC,IAAI,KAAM,MAAO;AAAA,MAClC;AACA,UAAI,EAAE,CAAC,IAAI,MAAM,EAAE,CAAC,IAAI,MAAM,EAAE,CAAC,IAAI,MAAM,EAAE,CAAC;AAC9C,UAAI,EAAE,CAAC,GAAG;AACN,aAAK,MAAM,EAAE,CAAC;AACd,YAAI,EAAE,CAAC,GAAG;AACN,eAAK,MAAM,EAAE,CAAC;AACd,cAAI,EAAE,CAAC,GAAG;AACN,iBAAK,MAAM,EAAE,CAAC;AAAA,UAClB;AAAA,QACJ;AAAA,MACJ;AACA,UAAI,EAAE,CAAC,GAAG;AACN,aAAK;AACL,YAAI,EAAE,CAAC,KAAK,KAAK;AACb,eAAK,EAAE,CAAC;AACR,cAAI,EAAE,CAAC,GAAG;AACN,iBAAK,MAAM,EAAE,CAAC;AAAA,UAClB;AAAA,QACJ;AAAA,MACJ;AACA,aAAO;AAAA,IACX;AACA,IAAAA,QAAO,UAAU,eAAe,SAAU,OAAO,KAAK;AAClD,UAAI,IAAI,KAAK,IAAI,KAAK;AACtB,UAAI,MAAO,IAAI;AACf,UAAI,MAAM,MAAM,MAAM;AACtB,UAAI;AACJ,UAAI,IAAI;AAER,aAAO,KAAK,OAAO,EAAE,QAAQ,KAAK;AAC9B,YAAI,KAAK,IAAI,KAAK;AAAA,MACtB;AACA,YAAM,MAAM;AACZ,UAAI,QAAQ,GAAG;AACX,eAAO,MAAM,KAAK;AAAA,MACtB;AAEA,UAAI,MAAM,GAAG;AACT,YAAI;AACJ,gBAAQ;AACR,iBAAS,CAAC,IAAI,OAAO,QAAS,GAAG;AAC7B,cAAI,CAAC,KAAK;AACV,YAAE;AAAA,QACN;AACA,YAAI,MAAM,MAAM;AAAA,MACpB;AAEA,UAAI,KAAK;AACL,YAAI,IAAI;AAAA,MACZ;AACA,UAAI,IAAI,IAAI,MAAM,CAAC;AACnB,eAAS,IAAI,QAAQ,GAAG,IAAI,KAAK,EAAE,GAAG;AAClC,UAAE,OAAO,KAAK,KAAK,IAAI,CAAC,CAAC;AAAA,MAC7B;AACA,aAAO,IAAI,EAAE,SAAQ;AAAA,IACzB;AACA,IAAAA,QAAO,UAAU,iBAAiB,SAAU,OAAO,KAAK,WAAW;AAC/D,UAAI,YAAY,KAAK,IAAI,KAAK;AAC9B,UAAI,UAAW,MAAM,QAAQ,KAAM,KAAK;AACxC,UAAI,QAAQ,MAAM,SAAS;AAC3B,UAAI,IAAI;AACR,eAAS,IAAI,QAAQ,GAAG,IAAI,KAAK,EAAE,GAAG;AAClC,YAAI,IAAI,KAAK,IAAI,CAAC;AAClB,YAAI,OAAQ,KAAK,MAAM,IAAK,YAAY;AACxC,iBAAS,IAAI,GAAG,KAAK,MAAM,EAAE,GAAG;AAC5B,eAAM,KAAK,IAAK,IAAI,MAAM;AAAA,QAC9B;AACA,YAAI,EAAE,SAAS,WAAW;AACtB,iBAAO,QAAQ,UAAU,GAAG,SAAS;AAAA,QACzC;AAAA,MACJ;AACA,aAAO,QAAQ;AAAA,IACnB;AACA,IAAAA,QAAO,UAAU,mBAAmB,SAAU,OAAO,KAAK,WAAW;AACjE,UAAI,KAAK,QAAQ,OAAO,GAAG,GAAG;AAC1B,eAAO,UAAU,KAAK,eAAe,OAAO,GAAG,GAAG,SAAS;AAAA,MAC/D;AACA,UAAI,MAAM,MAAM;AAChB,UAAI,IAAI,MAAM,MAAM;AACpB,mBAAa;AACb,UAAI,MAAM,WAAW;AACjB,cAAM,QAAQ;AAAA,MAClB;AACA,eAAS,IAAI,OAAO,IAAI,KAAK,EAAE,GAAG;AAC9B,aAAK,KAAK,QAAQ,KAAK,IAAI,CAAC,CAAC;AAAA,MACjC;AACA,UAAI,MAAM,WAAW;AACjB,aAAK;AAAA,MACT;AACA,aAAO;AAAA,IACX;AACA,IAAAA,QAAO,UAAU,WAAW,SAAU,OAAO,KAAK,WAAW;AACzD,UAAI,IAAI;AACR,UAAI,IAAI,IAAI,MAAK;AACjB,UAAI,OAAO;AACX,eAAS,IAAI,OAAO,IAAI,KAAK,EAAE,GAAG;AAC9B,YAAI,IAAI,KAAK,IAAI,CAAC;AAClB,UAAE,OAAO,KAAK,IAAI,GAAI;AACtB,gBAAQ;AACR,YAAI,EAAE,IAAI,MAAO;AACb,cAAI,MAAM,IAAI;AACV,gBAAI,EAAE,SAAQ;AACd,gBAAI,aAAa,OAAO;AACpB,gBAAE,IAAI,EAAE;AACR,kBAAI,OAAO,EAAE,SAAQ;AAAA,YACzB,OACK;AACD,kBAAI,IAAI,IAAI,KAAK,IAAI,KAAK,IAAI,IAAI;AAClC,kBAAI,IAAI,OAAO,IAAI,IAAI;AAAA,YAC3B;AAAA,UACJ,OACK;AACD,iBAAK,MAAM,EAAE,SAAQ;AAAA,UACzB;AACA,cAAI,EAAE,SAAS,WAAW;AACtB,mBAAO,UAAU,GAAG,SAAS;AAAA,UACjC;AACA,cAAI,IAAI,MAAK;AACb,iBAAO;AAAA,QACX;AAAA,MACJ;AACA,UAAI,OAAO,GAAG;AACV,aAAK;AAAA,MACT;AACA,aAAO;AAAA,IACX;AACA,WAAOA;AAAA,EACX,GAAC;AAAA;AAEE,IAAC;AAAA;AAAA,GAAsB,WAAY;AAClC,aAASC,MAAK,QAAQ,QAAQ,QAAQ,KAAK,KAAK;AAC5C,UAAI,EAAE,eAAe,UAAU;AAC3B,cAAM,IAAI,MAAM,oBAAoB;AAAA,MACxC;AACA,WAAK,SAAS;AACd,WAAK,SAAS;AACd,WAAK,SAAS;AACd,WAAK,MAAM;AACX,WAAK,MAAM;AAAA,IACf;AACA,IAAAA,MAAK,UAAU,WAAW,WAAY;AAClC,cAAQ,KAAK,IAAI,UAAQ;AAAA,QACrB,KAAK;AACD,kBAAQ,KAAK,IAAI,WAAS;AAAA,YACtB,KAAK;AACD,qBAAO;AAAA,YACX,KAAK;AACD,qBAAO;AAAA,YACX,KAAK;AACD,qBAAO;AAAA,YACX,KAAK;AACD,qBAAO;AAAA,YACX,KAAK;AACD,qBAAO;AAAA,YACX,KAAK;AACD,qBAAO;AAAA,YACX,KAAK;AACD,qBAAO;AAAA,YACX,KAAK;AACD,qBAAO;AAAA,YACX,KAAK;AACD,qBAAO;AAAA,YACX,KAAK;AACD,qBAAO;AAAA,YACX,KAAK;AACD,qBAAO;AAAA,YACX,KAAK;AACD,qBAAO;AAAA,YACX,KAAK;AACD,qBAAO;AAAA,YACX,KAAK;AACD,qBAAO;AAAA,YACX,KAAK;AACD,qBAAO;AAAA,YACX,KAAK;AACD,qBAAO;AAAA,YACX,KAAK;AACD,qBAAO;AAAA;AAAA,YACX,KAAK;AACD,qBAAO;AAAA;AAAA,YACX,KAAK;AACD,qBAAO;AAAA,YACX,KAAK;AACD,qBAAO;AAAA;AAAA,YACX,KAAK;AACD,qBAAO;AAAA,YACX,KAAK;AACD,qBAAO;AAAA,YACX,KAAK;AACD,qBAAO;AAAA,YACX,KAAK;AACD,qBAAO;AAAA;AAAA,YACX,KAAK;AACD,qBAAO;AAAA,YACX,KAAK;AACD,qBAAO;AAAA,YACX,KAAK;AACD,qBAAO;AAAA,UAC/B;AACgB,iBAAO,eAAe,KAAK,IAAI,UAAU,SAAQ;AAAA,QACrD,KAAK;AACD,iBAAO,iBAAiB,KAAK,IAAI,UAAU,SAAQ;AAAA,QACvD,KAAK;AACD,iBAAO,MAAM,KAAK,IAAI,UAAU,SAAQ,IAAK;AAAA;AAAA,QACjD,KAAK;AACD,iBAAO,aAAa,KAAK,IAAI,UAAU,SAAQ;AAAA,MAC/D;AAAA,IACI;AACA,IAAAA,MAAK,UAAU,UAAU,SAAU,WAAW;AAC1C,UAAI,KAAK,QAAQ,QAAW;AACxB,eAAO;AAAA,MACX;AACA,UAAI,cAAc,QAAW;AACzB,oBAAY;AAAA,MAChB;AACA,UAAI,UAAU,KAAK,WAAU;AAC7B,UAAI,MAAM,KAAK,IAAI,KAAK,MAAM;AAC9B,UAAI,CAAC,KAAK,IAAI,eAAe;AACzB,YAAI,KAAK,QAAQ,MAAM;AACnB,iBAAO,MAAM,KAAK,IAAI,SAAS;AAAA,QACnC;AACA,eAAO,KAAK,OAAO,iBAAiB,SAAS,UAAU,KAAK,SAAS;AAAA,MACzE;AACA,cAAQ,KAAK,IAAI,WAAS;AAAA,QACtB,KAAK;AACD,iBAAQ,KAAK,OAAO,IAAI,OAAO,MAAM,IAAK,UAAU;AAAA,QACxD,KAAK;AACD,iBAAO,KAAK,OAAO,aAAa,SAAS,UAAU,GAAG;AAAA,QAC1D,KAAK;AACD,iBAAO,KAAK,MAAM,MAAM,KAAK,IAAI,SAAS,WACtC,KAAK,OAAO,eAAe,SAAS,UAAU,KAAK,SAAS;AAAA,QACpE,KAAK;AACD,iBAAO,KAAK,MAAM,MAAM,KAAK,IAAI,SAAS,WACtC,KAAK,OAAO,iBAAiB,SAAS,UAAU,KAAK,SAAS;AAAA;AAAA,QAEtE,KAAK;AACD,iBAAO,KAAK,OAAO,SAAS,SAAS,UAAU,KAAK,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,QAMjE,KAAK;AAAA;AAAA,QACL,KAAK;AACD,cAAI,KAAK,QAAQ,MAAM;AACnB,mBAAO,MAAM,KAAK,IAAI,SAAS;AAAA,UACnC,OACK;AACD,mBAAO;AAAA,UACX;AAAA,QACJ,KAAK;AACD,iBAAO,UAAU,KAAK,OAAO,eAAe,SAAS,UAAU,GAAG,GAAG,SAAS;AAAA,QAClF,KAAK;AAAA;AAAA,QACL,KAAK;AAAA;AAAA,QACL,KAAK;AAAA;AAAA,QACL,KAAK;AAAA;AAAA,QACL,KAAK;AAAA;AAAA;AAAA,QAEL,KAAK;AAGD,iBAAO,UAAU,KAAK,OAAO,eAAe,SAAS,UAAU,GAAG,GAAG,SAAS;AAAA,QAClF,KAAK;AACD,iBAAO,UAAU,KAAK,OAAO,eAAe,SAAS,UAAU,GAAG,GAAG,SAAS;AAAA,QAClF,KAAK;AAAA;AAAA,QACL,KAAK;AACD,iBAAO,KAAK,OAAO,UAAU,SAAS,UAAU,KAAM,KAAK,IAAI,aAAa,EAAI;AAAA,MAChG;AACQ,aAAO;AAAA,IACX;AACA,IAAAA,MAAK,UAAU,WAAW,WAAY;AAClC,aAAO,KAAK,aAAa,MAAM,KAAK,OAAO,MAAM,aAAa,KAAK,SAAS,aAAa,KAAK,SAAS,WAAY,KAAK,QAAQ,OAAQ,SAAS,KAAK,IAAI,UAAU;AAAA,IACxK;AACA,IAAAA,MAAK,UAAU,iBAAiB,SAAU,QAAQ;AAC9C,UAAI,WAAW,QAAW;AACtB,iBAAS;AAAA,MACb;AACA,UAAI,IAAI,SAAS,KAAK,SAAQ,IAAK,OAAO,KAAK,OAAO;AACtD,UAAI,KAAK,UAAU,GAAG;AAClB,aAAK;AAAA,MACT;AACA,WAAK,KAAK;AACV,UAAI,KAAK,IAAI,gBAAgB;AACzB,aAAK;AAAA,MACT,WACU,KAAK,IAAI,YAAW,MAAQ,KAAK,IAAI,aAAa,KAAU,KAAK,IAAI,aAAa,MAAY,KAAK,QAAQ,MAAO;AACxH,aAAK;AAAA,MACT;AACA,WAAK;AACL,UAAI,KAAK,QAAQ,MAAM;AACnB,kBAAU;AACV,iBAAS,IAAI,GAAG,MAAM,KAAK,IAAI,QAAQ,IAAI,KAAK,EAAE,GAAG;AACjD,eAAK,KAAK,IAAI,CAAC,EAAE,eAAe,MAAM;AAAA,QAC1C;AAAA,MACJ;AACA,aAAO;AAAA,IACX;AACA,IAAAA,MAAK,UAAU,WAAW,WAAY;AAClC,aAAO,KAAK,OAAO;AAAA,IACvB;AACA,IAAAA,MAAK,UAAU,aAAa,WAAY;AACpC,aAAO,KAAK,OAAO,MAAM,KAAK;AAAA,IAClC;AACA,IAAAA,MAAK,UAAU,SAAS,WAAY;AAChC,aAAO,KAAK,OAAO,MAAM,KAAK,SAAS,KAAK,IAAI,KAAK,MAAM;AAAA,IAC/D;AACA,IAAAA,MAAK,UAAU,cAAc,WAAY;AACrC,aAAO,KAAK,OAAO,QAAQ,KAAK,SAAQ,GAAI,KAAK,OAAM,GAAI,IAAI;AAAA,IACnE;AACA,IAAAA,MAAK,eAAe,SAAU,QAAQ;AAClC,UAAI,MAAM,OAAO,IAAG;AACpB,UAAI,MAAM,MAAM;AAChB,UAAI,OAAO,KAAK;AACZ,eAAO;AAAA,MACX;AAEA,UAAI,MAAM,GAAG;AACT,cAAM,IAAI,MAAM,oDAAoD,OAAO,MAAM,EAAE;AAAA,MACvF;AACA,UAAI,QAAQ,GAAG;AACX,eAAO;AAAA,MACX;AACA,YAAM;AACN,eAAS,IAAI,GAAG,IAAI,KAAK,EAAE,GAAG;AAC1B,cAAO,MAAM,MAAO,OAAO,IAAG;AAAA,MAClC;AACA,aAAO;AAAA,IACX;AAMA,IAAAA,MAAK,UAAU,oBAAoB,WAAY;AAC3C,UAAI,YAAY,KAAK,YAAW;AAChC,UAAI,SAAS,KAAK,SAAS;AAC3B,UAAI,SAAS,KAAK,SAAS;AAC3B,aAAO,UAAU,UAAU,QAAQ,SAAS,MAAM;AAAA,IACtD;AACA,IAAAA,MAAK,SAAS,SAAU,KAAK;AACzB,UAAI;AACJ,UAAI,EAAE,eAAe,SAAS;AAC1B,iBAAS,IAAI,OAAO,KAAK,CAAC;AAAA,MAC9B,OACK;AACD,iBAAS;AAAA,MACb;AACA,UAAI,cAAc,IAAI,OAAO,MAAM;AACnC,UAAI,MAAM,IAAI,QAAQ,MAAM;AAC5B,UAAI,MAAMA,MAAK,aAAa,MAAM;AAClC,UAAI,QAAQ,OAAO;AACnB,UAAI,SAAS,QAAQ,YAAY;AACjC,UAAI,MAAM;AACV,UAAI,SAAS,WAAY;AACrB,YAAI,MAAM,CAAA;AACV,YAAI,QAAQ,MAAM;AAEd,cAAI,MAAM,QAAQ;AAClB,iBAAO,OAAO,MAAM,KAAK;AACrB,gBAAI,IAAI,MAAM,IAAIA,MAAK,OAAO,MAAM;AAAA,UACxC;AACA,cAAI,OAAO,OAAO,KAAK;AACnB,kBAAM,IAAI,MAAM,kEAAkE,KAAK;AAAA,UAC3F;AAAA,QACJ,OACK;AAED,cAAI;AACA,uBAAS;AACL,kBAAI,IAAIA,MAAK,OAAO,MAAM;AAC1B,kBAAI,EAAE,IAAI,SAAS;AACf;AAAA,cACJ;AACA,kBAAI,IAAI,MAAM,IAAI;AAAA,YACtB;AACA,kBAAM,QAAQ,OAAO;AAAA,UACzB,SACO,GAAG;AACN,kBAAM,IAAI,MAAM,wDAAwD,CAAC;AAAA,UAC7E;AAAA,QACJ;AACA,eAAO;AAAA,MACX;AACA,UAAI,IAAI,gBAAgB;AAEpB,cAAM,OAAM;AAAA,MAChB,WACS,IAAI,kBAAmB,IAAI,aAAa,KAAU,IAAI,aAAa,IAAQ;AAEhF,YAAI;AACA,cAAI,IAAI,aAAa,GAAM;AACvB,gBAAI,OAAO,IAAG,KAAM,GAAG;AACnB,oBAAM,IAAI,MAAM,kDAAkD;AAAA,YACtE;AAAA,UACJ;AACA,gBAAM,OAAM;AACZ,mBAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,EAAE,GAAG;AACjC,gBAAI,IAAI,CAAC,EAAE,IAAI,MAAK,GAAI;AACpB,oBAAM,IAAI,MAAM,2CAA2C;AAAA,YAC/D;AAAA,UACJ;AAAA,QACJ,SACO,GAAG;AAEN,gBAAM;AAAA,QACV;AAAA,MACJ;AACA,UAAI,QAAQ,MAAM;AACd,YAAI,QAAQ,MAAM;AACd,gBAAM,IAAI,MAAM,uEAAuE,KAAK;AAAA,QAChG;AACA,eAAO,MAAM,QAAQ,KAAK,IAAI,GAAG;AAAA,MACrC;AACA,aAAO,IAAIA,MAAK,aAAa,QAAQ,KAAK,KAAK,GAAG;AAAA,IACtD;AACA,WAAOA;AAAA,EACX,GAAC;AAAA;AAEE,IAAC;AAAA;AAAA,GAAyB,WAAY;AACrC,aAASC,SAAQ,QAAQ;AACrB,UAAI,MAAM,OAAO,IAAG;AACpB,WAAK,WAAW,OAAO;AACvB,WAAK,kBAAmB,MAAM,QAAU;AACxC,WAAK,YAAY,MAAM;AACvB,UAAI,KAAK,aAAa,IAAM;AACxB,YAAI,IAAI,IAAI,MAAK;AACjB,WAAG;AACC,gBAAM,OAAO,IAAG;AAChB,YAAE,OAAO,KAAK,MAAM,GAAI;AAAA,QAC5B,SAAS,MAAM;AACf,aAAK,YAAY,EAAE,SAAQ;AAAA,MAC/B;AAAA,IACJ;AACA,IAAAA,SAAQ,UAAU,cAAc,WAAY;AACxC,aAAO,KAAK,aAAa;AAAA,IAC7B;AACA,IAAAA,SAAQ,UAAU,QAAQ,WAAY;AAClC,aAAO,KAAK,aAAa,KAAQ,KAAK,cAAc;AAAA,IACxD;AACA,WAAOA;AAAA,EACX,GAAC;AAAA;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/jsencrypt@3.5.4/node_modules/jsencrypt/lib/lib/asn1js/base64.mjs.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"base64.mjs","sources":["../../../../../../../../../../../node_modules/.pnpm/jsencrypt@3.5.4/node_modules/jsencrypt/lib/lib/asn1js/base64.js"],"sourcesContent":["// Base64 JavaScript decoder\n// Copyright (c) 2008-2013 Lapo Luchini <lapo@lapo.it>\n// Permission to use, copy, modify, and/or distribute this software for any\n// purpose with or without fee is hereby granted, provided that the above\n// copyright notice and this permission notice appear in all copies.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\n// WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\n// MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\n// ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\n// WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\n// ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\n// OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n/*jshint browser: true, strict: true, immed: true, latedef: true, undef: true, regexdash: false */\nvar decoder;\nexport var Base64 = {\n decode: function (a) {\n var i;\n if (decoder === undefined) {\n var b64 = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\";\n var ignore = \"= \\f\\n\\r\\t\\u00A0\\u2028\\u2029\";\n decoder = Object.create(null);\n for (i = 0; i < 64; ++i) {\n decoder[b64.charAt(i)] = i;\n }\n decoder['-'] = 62; //+\n decoder['_'] = 63; //-\n for (i = 0; i < ignore.length; ++i) {\n decoder[ignore.charAt(i)] = -1;\n }\n }\n var out = [];\n var bits = 0;\n var char_count = 0;\n for (i = 0; i < a.length; ++i) {\n var c = a.charAt(i);\n if (c == \"=\") {\n break;\n }\n c = decoder[c];\n if (c == -1) {\n continue;\n }\n if (c === undefined) {\n throw new Error(\"Illegal character at offset \" + i);\n }\n bits |= c;\n if (++char_count >= 4) {\n out[out.length] = (bits >> 16);\n out[out.length] = (bits >> 8) & 0xFF;\n out[out.length] = bits & 0xFF;\n bits = 0;\n char_count = 0;\n }\n else {\n bits <<= 6;\n }\n }\n switch (char_count) {\n case 1:\n throw new Error(\"Base64 encoding incomplete: at least 2 bits missing\");\n case 2:\n out[out.length] = (bits >> 10);\n break;\n case 3:\n out[out.length] = (bits >> 16);\n out[out.length] = (bits >> 8) & 0xFF;\n break;\n }\n return out;\n },\n re: /-----BEGIN [^-]+-----([A-Za-z0-9+\\/=\\s]+)-----END [^-]+-----|begin-base64[^\\n]+\\n([A-Za-z0-9+\\/=\\s]+)====/,\n unarmor: function (a) {\n var m = Base64.re.exec(a);\n if (m) {\n if (m[1]) {\n a = m[1];\n }\n else if (m[2]) {\n a = m[2];\n }\n else {\n throw new Error(\"RegExp out of sync\");\n }\n }\n return Base64.decode(a);\n }\n};\n"],"names":[],"mappings":"AAcA,IAAI;AACM,IAAC,SAAS;AAAA,EAChB,QAAQ,SAAU,GAAG;AACjB,QAAI;AACJ,QAAI,YAAY,QAAW;AACvB,UAAI,MAAM;AACV,UAAI,SAAS;AACb,gBAAU,uBAAO,OAAO,IAAI;AAC5B,WAAK,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG;AACrB,gBAAQ,IAAI,OAAO,CAAC,CAAC,IAAI;AAAA,MAC7B;AACA,cAAQ,GAAG,IAAI;AACf,cAAQ,GAAG,IAAI;AACf,WAAK,IAAI,GAAG,IAAI,OAAO,QAAQ,EAAE,GAAG;AAChC,gBAAQ,OAAO,OAAO,CAAC,CAAC,IAAI;AAAA,MAChC;AAAA,IACJ;AACA,QAAI,MAAM,CAAA;AACV,QAAI,OAAO;AACX,QAAI,aAAa;AACjB,SAAK,IAAI,GAAG,IAAI,EAAE,QAAQ,EAAE,GAAG;AAC3B,UAAI,IAAI,EAAE,OAAO,CAAC;AAClB,UAAI,KAAK,KAAK;AACV;AAAA,MACJ;AACA,UAAI,QAAQ,CAAC;AACb,UAAI,KAAK,IAAI;AACT;AAAA,MACJ;AACA,UAAI,MAAM,QAAW;AACjB,cAAM,IAAI,MAAM,iCAAiC,CAAC;AAAA,MACtD;AACA,cAAQ;AACR,UAAI,EAAE,cAAc,GAAG;AACnB,YAAI,IAAI,MAAM,IAAK,QAAQ;AAC3B,YAAI,IAAI,MAAM,IAAK,QAAQ,IAAK;AAChC,YAAI,IAAI,MAAM,IAAI,OAAO;AACzB,eAAO;AACP,qBAAa;AAAA,MACjB,OACK;AACD,iBAAS;AAAA,MACb;AAAA,IACJ;AACA,YAAQ,YAAU;AAAA,MACd,KAAK;AACD,cAAM,IAAI,MAAM,qDAAqD;AAAA,MACzE,KAAK;AACD,YAAI,IAAI,MAAM,IAAK,QAAQ;AAC3B;AAAA,MACJ,KAAK;AACD,YAAI,IAAI,MAAM,IAAK,QAAQ;AAC3B,YAAI,IAAI,MAAM,IAAK,QAAQ,IAAK;AAChC;AAAA,IAChB;AACQ,WAAO;AAAA,EACX;AAAA,EACA,IAAI;AAAA,EACJ,SAAS,SAAU,GAAG;AAClB,QAAI,IAAI,OAAO,GAAG,KAAK,CAAC;AACxB,QAAI,GAAG;AACH,UAAI,EAAE,CAAC,GAAG;AACN,YAAI,EAAE,CAAC;AAAA,MACX,WACS,EAAE,CAAC,GAAG;AACX,YAAI,EAAE,CAAC;AAAA,MACX,OACK;AACD,cAAM,IAAI,MAAM,oBAAoB;AAAA,MACxC;AAAA,IACJ;AACA,WAAO,OAAO,OAAO,CAAC;AAAA,EAC1B;AACJ;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/jsencrypt@3.5.4/node_modules/jsencrypt/lib/lib/asn1js/hex.mjs.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"hex.mjs","sources":["../../../../../../../../../../../node_modules/.pnpm/jsencrypt@3.5.4/node_modules/jsencrypt/lib/lib/asn1js/hex.js"],"sourcesContent":["// Hex JavaScript decoder\n// Copyright (c) 2008-2013 Lapo Luchini <lapo@lapo.it>\n// Permission to use, copy, modify, and/or distribute this software for any\n// purpose with or without fee is hereby granted, provided that the above\n// copyright notice and this permission notice appear in all copies.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\n// WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\n// MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\n// ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\n// WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\n// ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\n// OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n/*jshint browser: true, strict: true, immed: true, latedef: true, undef: true, regexdash: false */\nvar decoder;\nexport var Hex = {\n decode: function (a) {\n var i;\n if (decoder === undefined) {\n var hex = \"0123456789ABCDEF\";\n var ignore = \" \\f\\n\\r\\t\\u00A0\\u2028\\u2029\";\n decoder = {};\n for (i = 0; i < 16; ++i) {\n decoder[hex.charAt(i)] = i;\n }\n hex = hex.toLowerCase();\n for (i = 10; i < 16; ++i) {\n decoder[hex.charAt(i)] = i;\n }\n for (i = 0; i < ignore.length; ++i) {\n decoder[ignore.charAt(i)] = -1;\n }\n }\n var out = [];\n var bits = 0;\n var char_count = 0;\n for (i = 0; i < a.length; ++i) {\n var c = a.charAt(i);\n if (c == \"=\") {\n break;\n }\n c = decoder[c];\n if (c == -1) {\n continue;\n }\n if (c === undefined) {\n throw new Error(\"Illegal character at offset \" + i);\n }\n bits |= c;\n if (++char_count >= 2) {\n out[out.length] = bits;\n bits = 0;\n char_count = 0;\n }\n else {\n bits <<= 4;\n }\n }\n if (char_count) {\n throw new Error(\"Hex encoding incomplete: 4 bits missing\");\n }\n return out;\n }\n};\n"],"names":[],"mappings":"AAcA,IAAI;AACM,IAAC,MAAM;AAAA,EACb,QAAQ,SAAU,GAAG;AACjB,QAAI;AACJ,QAAI,YAAY,QAAW;AACvB,UAAI,MAAM;AACV,UAAI,SAAS;AACb,gBAAU,CAAA;AACV,WAAK,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG;AACrB,gBAAQ,IAAI,OAAO,CAAC,CAAC,IAAI;AAAA,MAC7B;AACA,YAAM,IAAI,YAAW;AACrB,WAAK,IAAI,IAAI,IAAI,IAAI,EAAE,GAAG;AACtB,gBAAQ,IAAI,OAAO,CAAC,CAAC,IAAI;AAAA,MAC7B;AACA,WAAK,IAAI,GAAG,IAAI,OAAO,QAAQ,EAAE,GAAG;AAChC,gBAAQ,OAAO,OAAO,CAAC,CAAC,IAAI;AAAA,MAChC;AAAA,IACJ;AACA,QAAI,MAAM,CAAA;AACV,QAAI,OAAO;AACX,QAAI,aAAa;AACjB,SAAK,IAAI,GAAG,IAAI,EAAE,QAAQ,EAAE,GAAG;AAC3B,UAAI,IAAI,EAAE,OAAO,CAAC;AAClB,UAAI,KAAK,KAAK;AACV;AAAA,MACJ;AACA,UAAI,QAAQ,CAAC;AACb,UAAI,KAAK,IAAI;AACT;AAAA,MACJ;AACA,UAAI,MAAM,QAAW;AACjB,cAAM,IAAI,MAAM,iCAAiC,CAAC;AAAA,MACtD;AACA,cAAQ;AACR,UAAI,EAAE,cAAc,GAAG;AACnB,YAAI,IAAI,MAAM,IAAI;AAClB,eAAO;AACP,qBAAa;AAAA,MACjB,OACK;AACD,iBAAS;AAAA,MACb;AAAA,IACJ;AACA,QAAI,YAAY;AACZ,YAAM,IAAI,MAAM,yCAAyC;AAAA,IAC7D;AACA,WAAO;AAAA,EACX;AACJ;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/jsencrypt@3.5.4/node_modules/jsencrypt/lib/lib/asn1js/int10.mjs.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"int10.mjs","sources":["../../../../../../../../../../../node_modules/.pnpm/jsencrypt@3.5.4/node_modules/jsencrypt/lib/lib/asn1js/int10.js"],"sourcesContent":["// Big integer base-10 printing library\n// Copyright (c) 2014 Lapo Luchini <lapo@lapo.it>\n// Permission to use, copy, modify, and/or distribute this software for any\n// purpose with or without fee is hereby granted, provided that the above\n// copyright notice and this permission notice appear in all copies.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\n// WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\n// MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\n// ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\n// WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\n// ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\n// OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n/*jshint browser: true, strict: true, immed: true, latedef: true, undef: true, regexdash: false */\nvar max = 10000000000000; // biggest integer that can still fit 2^53 when multiplied by 256\nvar Int10 = /** @class */ (function () {\n function Int10(value) {\n this.buf = [+value || 0];\n }\n Int10.prototype.mulAdd = function (m, c) {\n // assert(m <= 256)\n var b = this.buf;\n var l = b.length;\n var i;\n var t;\n for (i = 0; i < l; ++i) {\n t = b[i] * m + c;\n if (t < max) {\n c = 0;\n }\n else {\n c = 0 | (t / max);\n t -= c * max;\n }\n b[i] = t;\n }\n if (c > 0) {\n b[i] = c;\n }\n };\n Int10.prototype.sub = function (c) {\n // assert(m <= 256)\n var b = this.buf;\n var l = b.length;\n var i;\n var t;\n for (i = 0; i < l; ++i) {\n t = b[i] - c;\n if (t < 0) {\n t += max;\n c = 1;\n }\n else {\n c = 0;\n }\n b[i] = t;\n }\n while (b[b.length - 1] === 0) {\n b.pop();\n }\n };\n Int10.prototype.toString = function (base) {\n if ((base || 10) != 10) {\n throw new Error(\"only base 10 is supported\");\n }\n var b = this.buf;\n var s = b[b.length - 1].toString();\n for (var i = b.length - 2; i >= 0; --i) {\n s += (max + b[i]).toString().substring(1);\n }\n return s;\n };\n Int10.prototype.valueOf = function () {\n var b = this.buf;\n var v = 0;\n for (var i = b.length - 1; i >= 0; --i) {\n v = v * max + b[i];\n }\n return v;\n };\n Int10.prototype.simplify = function () {\n var b = this.buf;\n return (b.length == 1) ? b[0] : this;\n };\n return Int10;\n}());\nexport { Int10 };\n"],"names":["Int10"],"mappings":"AAcA,IAAI,MAAM;AACP,IAAC;AAAA;AAAA,GAAuB,WAAY;AACnC,aAASA,OAAM,OAAO;AAClB,WAAK,MAAM,CAAC,CAAC,SAAS,CAAC;AAAA,IAC3B;AACA,IAAAA,OAAM,UAAU,SAAS,SAAU,GAAG,GAAG;AAErC,UAAI,IAAI,KAAK;AACb,UAAI,IAAI,EAAE;AACV,UAAI;AACJ,UAAI;AACJ,WAAK,IAAI,GAAG,IAAI,GAAG,EAAE,GAAG;AACpB,YAAI,EAAE,CAAC,IAAI,IAAI;AACf,YAAI,IAAI,KAAK;AACT,cAAI;AAAA,QACR,OACK;AACD,cAAI,IAAK,IAAI;AACb,eAAK,IAAI;AAAA,QACb;AACA,UAAE,CAAC,IAAI;AAAA,MACX;AACA,UAAI,IAAI,GAAG;AACP,UAAE,CAAC,IAAI;AAAA,MACX;AAAA,IACJ;AACA,IAAAA,OAAM,UAAU,MAAM,SAAU,GAAG;AAE/B,UAAI,IAAI,KAAK;AACb,UAAI,IAAI,EAAE;AACV,UAAI;AACJ,UAAI;AACJ,WAAK,IAAI,GAAG,IAAI,GAAG,EAAE,GAAG;AACpB,YAAI,EAAE,CAAC,IAAI;AACX,YAAI,IAAI,GAAG;AACP,eAAK;AACL,cAAI;AAAA,QACR,OACK;AACD,cAAI;AAAA,QACR;AACA,UAAE,CAAC,IAAI;AAAA,MACX;AACA,aAAO,EAAE,EAAE,SAAS,CAAC,MAAM,GAAG;AAC1B,UAAE,IAAG;AAAA,MACT;AAAA,IACJ;AACA,IAAAA,OAAM,UAAU,WAAW,SAAU,MAAM;AACvC,WAAK,QAAQ,OAAO,IAAI;AACpB,cAAM,IAAI,MAAM,2BAA2B;AAAA,MAC/C;AACA,UAAI,IAAI,KAAK;AACb,UAAI,IAAI,EAAE,EAAE,SAAS,CAAC,EAAE,SAAQ;AAChC,eAAS,IAAI,EAAE,SAAS,GAAG,KAAK,GAAG,EAAE,GAAG;AACpC,cAAM,MAAM,EAAE,CAAC,GAAG,SAAQ,EAAG,UAAU,CAAC;AAAA,MAC5C;AACA,aAAO;AAAA,IACX;AACA,IAAAA,OAAM,UAAU,UAAU,WAAY;AAClC,UAAI,IAAI,KAAK;AACb,UAAI,IAAI;AACR,eAAS,IAAI,EAAE,SAAS,GAAG,KAAK,GAAG,EAAE,GAAG;AACpC,YAAI,IAAI,MAAM,EAAE,CAAC;AAAA,MACrB;AACA,aAAO;AAAA,IACX;AACA,IAAAA,OAAM,UAAU,WAAW,WAAY;AACnC,UAAI,IAAI,KAAK;AACb,aAAQ,EAAE,UAAU,IAAK,EAAE,CAAC,IAAI;AAAA,IACpC;AACA,WAAOA;AAAA,EACX,GAAC;AAAA;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/jsencrypt@3.5.4/node_modules/jsencrypt/lib/lib/jsbn/base64.mjs.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"base64.mjs","sources":["../../../../../../../../../../../node_modules/.pnpm/jsencrypt@3.5.4/node_modules/jsencrypt/lib/lib/jsbn/base64.js"],"sourcesContent":["import { int2char } from \"./util\";\nvar b64map = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\";\nvar b64pad = \"=\";\nexport function hex2b64(h) {\n var i;\n var c;\n var ret = \"\";\n for (i = 0; i + 3 <= h.length; i += 3) {\n c = parseInt(h.substring(i, i + 3), 16);\n ret += b64map.charAt(c >> 6) + b64map.charAt(c & 63);\n }\n if (i + 1 == h.length) {\n c = parseInt(h.substring(i, i + 1), 16);\n ret += b64map.charAt(c << 2);\n }\n else if (i + 2 == h.length) {\n c = parseInt(h.substring(i, i + 2), 16);\n ret += b64map.charAt(c >> 2) + b64map.charAt((c & 3) << 4);\n }\n while ((ret.length & 3) > 0) {\n ret += b64pad;\n }\n return ret;\n}\n// convert a base64 string to hex\nexport function b64tohex(s) {\n var ret = \"\";\n var i;\n var k = 0; // b64 state, 0-3\n var slop = 0;\n for (i = 0; i < s.length; ++i) {\n if (s.charAt(i) == b64pad) {\n break;\n }\n var v = b64map.indexOf(s.charAt(i));\n if (v < 0) {\n continue;\n }\n if (k == 0) {\n ret += int2char(v >> 2);\n slop = v & 3;\n k = 1;\n }\n else if (k == 1) {\n ret += int2char((slop << 2) | (v >> 4));\n slop = v & 0xf;\n k = 2;\n }\n else if (k == 2) {\n ret += int2char(slop);\n ret += int2char(v >> 2);\n slop = v & 3;\n k = 3;\n }\n else {\n ret += int2char((slop << 2) | (v >> 4));\n ret += int2char(v & 0xf);\n k = 0;\n }\n }\n if (k == 1) {\n ret += int2char(slop << 2);\n }\n return ret;\n}\n// convert a base64 string to a byte/number array\nexport function b64toBA(s) {\n // piggyback on b64tohex for now, optimize later\n var h = b64tohex(s);\n var i;\n var a = [];\n for (i = 0; 2 * i < h.length; ++i) {\n a[i] = parseInt(h.substring(2 * i, 2 * i + 2), 16);\n }\n return a;\n}\n"],"names":[],"mappings":";AACA,IAAI,SAAS;AACb,IAAI,SAAS;AACN,SAAS,QAAQ,GAAG;AACvB,MAAI;AACJ,MAAI;AACJ,MAAI,MAAM;AACV,OAAK,IAAI,GAAG,IAAI,KAAK,EAAE,QAAQ,KAAK,GAAG;AACnC,QAAI,SAAS,EAAE,UAAU,GAAG,IAAI,CAAC,GAAG,EAAE;AACtC,WAAO,OAAO,OAAO,KAAK,CAAC,IAAI,OAAO,OAAO,IAAI,EAAE;AAAA,EACvD;AACA,MAAI,IAAI,KAAK,EAAE,QAAQ;AACnB,QAAI,SAAS,EAAE,UAAU,GAAG,IAAI,CAAC,GAAG,EAAE;AACtC,WAAO,OAAO,OAAO,KAAK,CAAC;AAAA,EAC/B,WACS,IAAI,KAAK,EAAE,QAAQ;AACxB,QAAI,SAAS,EAAE,UAAU,GAAG,IAAI,CAAC,GAAG,EAAE;AACtC,WAAO,OAAO,OAAO,KAAK,CAAC,IAAI,OAAO,QAAQ,IAAI,MAAM,CAAC;AAAA,EAC7D;AACA,UAAQ,IAAI,SAAS,KAAK,GAAG;AACzB,WAAO;AAAA,EACX;AACA,SAAO;AACX;AAEO,SAAS,SAAS,GAAG;AACxB,MAAI,MAAM;AACV,MAAI;AACJ,MAAI,IAAI;AACR,MAAI,OAAO;AACX,OAAK,IAAI,GAAG,IAAI,EAAE,QAAQ,EAAE,GAAG;AAC3B,QAAI,EAAE,OAAO,CAAC,KAAK,QAAQ;AACvB;AAAA,IACJ;AACA,QAAI,IAAI,OAAO,QAAQ,EAAE,OAAO,CAAC,CAAC;AAClC,QAAI,IAAI,GAAG;AACP;AAAA,IACJ;AACA,QAAI,KAAK,GAAG;AACR,aAAO,SAAS,KAAK,CAAC;AACtB,aAAO,IAAI;AACX,UAAI;AAAA,IACR,WACS,KAAK,GAAG;AACb,aAAO,SAAU,QAAQ,IAAM,KAAK,CAAE;AACtC,aAAO,IAAI;AACX,UAAI;AAAA,IACR,WACS,KAAK,GAAG;AACb,aAAO,SAAS,IAAI;AACpB,aAAO,SAAS,KAAK,CAAC;AACtB,aAAO,IAAI;AACX,UAAI;AAAA,IACR,OACK;AACD,aAAO,SAAU,QAAQ,IAAM,KAAK,CAAE;AACtC,aAAO,SAAS,IAAI,EAAG;AACvB,UAAI;AAAA,IACR;AAAA,EACJ;AACA,MAAI,KAAK,GAAG;AACR,WAAO,SAAS,QAAQ,CAAC;AAAA,EAC7B;AACA,SAAO;AACX;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/jsencrypt@3.5.4/node_modules/jsencrypt/lib/lib/jsbn/jsbn.mjs.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"jsbn.mjs","sources":["../../../../../../../../../../../node_modules/.pnpm/jsencrypt@3.5.4/node_modules/jsencrypt/lib/lib/jsbn/jsbn.js"],"sourcesContent":["// Copyright (c) 2005 Tom Wu\n// All Rights Reserved.\n// See \"LICENSE\" for details.\n// Basic JavaScript BN library - subset useful for RSA encryption.\nimport { cbit, int2char, lbit, op_and, op_andnot, op_or, op_xor } from \"./util\";\n// Bits per digit\nvar dbits;\n// JavaScript engine analysis\nvar canary = 0xdeadbeefcafe;\nvar j_lm = ((canary & 0xffffff) == 0xefcafe);\n//#region\nvar lowprimes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997];\nvar lplim = (1 << 26) / lowprimes[lowprimes.length - 1];\n//#endregion\n// (public) Constructor\nvar BigInteger = /** @class */ (function () {\n function BigInteger(a, b, c) {\n if (a != null) {\n if (\"number\" == typeof a) {\n this.fromNumber(a, b, c);\n }\n else if (b == null && \"string\" != typeof a) {\n this.fromString(a, 256);\n }\n else {\n this.fromString(a, b);\n }\n }\n }\n //#region PUBLIC\n // BigInteger.prototype.toString = bnToString;\n // (public) return string representation in given radix\n BigInteger.prototype.toString = function (b) {\n if (this.s < 0) {\n return \"-\" + this.negate().toString(b);\n }\n var k;\n if (b == 16) {\n k = 4;\n }\n else if (b == 8) {\n k = 3;\n }\n else if (b == 2) {\n k = 1;\n }\n else if (b == 32) {\n k = 5;\n }\n else if (b == 4) {\n k = 2;\n }\n else {\n return this.toRadix(b);\n }\n var km = (1 << k) - 1;\n var d;\n var m = false;\n var r = \"\";\n var i = this.t;\n var p = this.DB - (i * this.DB) % k;\n if (i-- > 0) {\n if (p < this.DB && (d = this[i] >> p) > 0) {\n m = true;\n r = int2char(d);\n }\n while (i >= 0) {\n if (p < k) {\n d = (this[i] & ((1 << p) - 1)) << (k - p);\n d |= this[--i] >> (p += this.DB - k);\n }\n else {\n d = (this[i] >> (p -= k)) & km;\n if (p <= 0) {\n p += this.DB;\n --i;\n }\n }\n if (d > 0) {\n m = true;\n }\n if (m) {\n r += int2char(d);\n }\n }\n }\n return m ? r : \"0\";\n };\n // BigInteger.prototype.negate = bnNegate;\n // (public) -this\n BigInteger.prototype.negate = function () {\n var r = nbi();\n BigInteger.ZERO.subTo(this, r);\n return r;\n };\n // BigInteger.prototype.abs = bnAbs;\n // (public) |this|\n BigInteger.prototype.abs = function () {\n return (this.s < 0) ? this.negate() : this;\n };\n // BigInteger.prototype.compareTo = bnCompareTo;\n // (public) return + if this > a, - if this < a, 0 if equal\n BigInteger.prototype.compareTo = function (a) {\n var r = this.s - a.s;\n if (r != 0) {\n return r;\n }\n var i = this.t;\n r = i - a.t;\n if (r != 0) {\n return (this.s < 0) ? -r : r;\n }\n while (--i >= 0) {\n if ((r = this[i] - a[i]) != 0) {\n return r;\n }\n }\n return 0;\n };\n // BigInteger.prototype.bitLength = bnBitLength;\n // (public) return the number of bits in \"this\"\n BigInteger.prototype.bitLength = function () {\n if (this.t <= 0) {\n return 0;\n }\n return this.DB * (this.t - 1) + nbits(this[this.t - 1] ^ (this.s & this.DM));\n };\n // BigInteger.prototype.mod = bnMod;\n // (public) this mod a\n BigInteger.prototype.mod = function (a) {\n var r = nbi();\n this.abs().divRemTo(a, null, r);\n if (this.s < 0 && r.compareTo(BigInteger.ZERO) > 0) {\n a.subTo(r, r);\n }\n return r;\n };\n // BigInteger.prototype.modPowInt = bnModPowInt;\n // (public) this^e % m, 0 <= e < 2^32\n BigInteger.prototype.modPowInt = function (e, m) {\n var z;\n if (e < 256 || m.isEven()) {\n z = new Classic(m);\n }\n else {\n z = new Montgomery(m);\n }\n return this.exp(e, z);\n };\n // BigInteger.prototype.clone = bnClone;\n // (public)\n BigInteger.prototype.clone = function () {\n var r = nbi();\n this.copyTo(r);\n return r;\n };\n // BigInteger.prototype.intValue = bnIntValue;\n // (public) return value as integer\n BigInteger.prototype.intValue = function () {\n if (this.s < 0) {\n if (this.t == 1) {\n return this[0] - this.DV;\n }\n else if (this.t == 0) {\n return -1;\n }\n }\n else if (this.t == 1) {\n return this[0];\n }\n else if (this.t == 0) {\n return 0;\n }\n // assumes 16 < DB < 32\n return ((this[1] & ((1 << (32 - this.DB)) - 1)) << this.DB) | this[0];\n };\n // BigInteger.prototype.byteValue = bnByteValue;\n // (public) return value as byte\n BigInteger.prototype.byteValue = function () {\n return (this.t == 0) ? this.s : (this[0] << 24) >> 24;\n };\n // BigInteger.prototype.shortValue = bnShortValue;\n // (public) return value as short (assumes DB>=16)\n BigInteger.prototype.shortValue = function () {\n return (this.t == 0) ? this.s : (this[0] << 16) >> 16;\n };\n // BigInteger.prototype.signum = bnSigNum;\n // (public) 0 if this == 0, 1 if this > 0\n BigInteger.prototype.signum = function () {\n if (this.s < 0) {\n return -1;\n }\n else if (this.t <= 0 || (this.t == 1 && this[0] <= 0)) {\n return 0;\n }\n else {\n return 1;\n }\n };\n // BigInteger.prototype.toByteArray = bnToByteArray;\n // (public) convert to bigendian byte array\n BigInteger.prototype.toByteArray = function () {\n var i = this.t;\n var r = [];\n r[0] = this.s;\n var p = this.DB - (i * this.DB) % 8;\n var d;\n var k = 0;\n if (i-- > 0) {\n if (p < this.DB && (d = this[i] >> p) != (this.s & this.DM) >> p) {\n r[k++] = d | (this.s << (this.DB - p));\n }\n while (i >= 0) {\n if (p < 8) {\n d = (this[i] & ((1 << p) - 1)) << (8 - p);\n d |= this[--i] >> (p += this.DB - 8);\n }\n else {\n d = (this[i] >> (p -= 8)) & 0xff;\n if (p <= 0) {\n p += this.DB;\n --i;\n }\n }\n if ((d & 0x80) != 0) {\n d |= -256;\n }\n if (k == 0 && (this.s & 0x80) != (d & 0x80)) {\n ++k;\n }\n if (k > 0 || d != this.s) {\n r[k++] = d;\n }\n }\n }\n return r;\n };\n // BigInteger.prototype.equals = bnEquals;\n BigInteger.prototype.equals = function (a) {\n return (this.compareTo(a) == 0);\n };\n // BigInteger.prototype.min = bnMin;\n BigInteger.prototype.min = function (a) {\n return (this.compareTo(a) < 0) ? this : a;\n };\n // BigInteger.prototype.max = bnMax;\n BigInteger.prototype.max = function (a) {\n return (this.compareTo(a) > 0) ? this : a;\n };\n // BigInteger.prototype.and = bnAnd;\n BigInteger.prototype.and = function (a) {\n var r = nbi();\n this.bitwiseTo(a, op_and, r);\n return r;\n };\n // BigInteger.prototype.or = bnOr;\n BigInteger.prototype.or = function (a) {\n var r = nbi();\n this.bitwiseTo(a, op_or, r);\n return r;\n };\n // BigInteger.prototype.xor = bnXor;\n BigInteger.prototype.xor = function (a) {\n var r = nbi();\n this.bitwiseTo(a, op_xor, r);\n return r;\n };\n // BigInteger.prototype.andNot = bnAndNot;\n BigInteger.prototype.andNot = function (a) {\n var r = nbi();\n this.bitwiseTo(a, op_andnot, r);\n return r;\n };\n // BigInteger.prototype.not = bnNot;\n // (public) ~this\n BigInteger.prototype.not = function () {\n var r = nbi();\n for (var i = 0; i < this.t; ++i) {\n r[i] = this.DM & ~this[i];\n }\n r.t = this.t;\n r.s = ~this.s;\n return r;\n };\n // BigInteger.prototype.shiftLeft = bnShiftLeft;\n // (public) this << n\n BigInteger.prototype.shiftLeft = function (n) {\n var r = nbi();\n if (n < 0) {\n this.rShiftTo(-n, r);\n }\n else {\n this.lShiftTo(n, r);\n }\n return r;\n };\n // BigInteger.prototype.shiftRight = bnShiftRight;\n // (public) this >> n\n BigInteger.prototype.shiftRight = function (n) {\n var r = nbi();\n if (n < 0) {\n this.lShiftTo(-n, r);\n }\n else {\n this.rShiftTo(n, r);\n }\n return r;\n };\n // BigInteger.prototype.getLowestSetBit = bnGetLowestSetBit;\n // (public) returns index of lowest 1-bit (or -1 if none)\n BigInteger.prototype.getLowestSetBit = function () {\n for (var i = 0; i < this.t; ++i) {\n if (this[i] != 0) {\n return i * this.DB + lbit(this[i]);\n }\n }\n if (this.s < 0) {\n return this.t * this.DB;\n }\n return -1;\n };\n // BigInteger.prototype.bitCount = bnBitCount;\n // (public) return number of set bits\n BigInteger.prototype.bitCount = function () {\n var r = 0;\n var x = this.s & this.DM;\n for (var i = 0; i < this.t; ++i) {\n r += cbit(this[i] ^ x);\n }\n return r;\n };\n // BigInteger.prototype.testBit = bnTestBit;\n // (public) true iff nth bit is set\n BigInteger.prototype.testBit = function (n) {\n var j = Math.floor(n / this.DB);\n if (j >= this.t) {\n return (this.s != 0);\n }\n return ((this[j] & (1 << (n % this.DB))) != 0);\n };\n // BigInteger.prototype.setBit = bnSetBit;\n // (public) this | (1<<n)\n BigInteger.prototype.setBit = function (n) {\n return this.changeBit(n, op_or);\n };\n // BigInteger.prototype.clearBit = bnClearBit;\n // (public) this & ~(1<<n)\n BigInteger.prototype.clearBit = function (n) {\n return this.changeBit(n, op_andnot);\n };\n // BigInteger.prototype.flipBit = bnFlipBit;\n // (public) this ^ (1<<n)\n BigInteger.prototype.flipBit = function (n) {\n return this.changeBit(n, op_xor);\n };\n // BigInteger.prototype.add = bnAdd;\n // (public) this + a\n BigInteger.prototype.add = function (a) {\n var r = nbi();\n this.addTo(a, r);\n return r;\n };\n // BigInteger.prototype.subtract = bnSubtract;\n // (public) this - a\n BigInteger.prototype.subtract = function (a) {\n var r = nbi();\n this.subTo(a, r);\n return r;\n };\n // BigInteger.prototype.multiply = bnMultiply;\n // (public) this * a\n BigInteger.prototype.multiply = function (a) {\n var r = nbi();\n this.multiplyTo(a, r);\n return r;\n };\n // BigInteger.prototype.divide = bnDivide;\n // (public) this / a\n BigInteger.prototype.divide = function (a) {\n var r = nbi();\n this.divRemTo(a, r, null);\n return r;\n };\n // BigInteger.prototype.remainder = bnRemainder;\n // (public) this % a\n BigInteger.prototype.remainder = function (a) {\n var r = nbi();\n this.divRemTo(a, null, r);\n return r;\n };\n // BigInteger.prototype.divideAndRemainder = bnDivideAndRemainder;\n // (public) [this/a,this%a]\n BigInteger.prototype.divideAndRemainder = function (a) {\n var q = nbi();\n var r = nbi();\n this.divRemTo(a, q, r);\n return [q, r];\n };\n // BigInteger.prototype.modPow = bnModPow;\n // (public) this^e % m (HAC 14.85)\n BigInteger.prototype.modPow = function (e, m) {\n var i = e.bitLength();\n var k;\n var r = nbv(1);\n var z;\n if (i <= 0) {\n return r;\n }\n else if (i < 18) {\n k = 1;\n }\n else if (i < 48) {\n k = 3;\n }\n else if (i < 144) {\n k = 4;\n }\n else if (i < 768) {\n k = 5;\n }\n else {\n k = 6;\n }\n if (i < 8) {\n z = new Classic(m);\n }\n else if (m.isEven()) {\n z = new Barrett(m);\n }\n else {\n z = new Montgomery(m);\n }\n // precomputation\n var g = [];\n var n = 3;\n var k1 = k - 1;\n var km = (1 << k) - 1;\n g[1] = z.convert(this);\n if (k > 1) {\n var g2 = nbi();\n z.sqrTo(g[1], g2);\n while (n <= km) {\n g[n] = nbi();\n z.mulTo(g2, g[n - 2], g[n]);\n n += 2;\n }\n }\n var j = e.t - 1;\n var w;\n var is1 = true;\n var r2 = nbi();\n var t;\n i = nbits(e[j]) - 1;\n while (j >= 0) {\n if (i >= k1) {\n w = (e[j] >> (i - k1)) & km;\n }\n else {\n w = (e[j] & ((1 << (i + 1)) - 1)) << (k1 - i);\n if (j > 0) {\n w |= e[j - 1] >> (this.DB + i - k1);\n }\n }\n n = k;\n while ((w & 1) == 0) {\n w >>= 1;\n --n;\n }\n if ((i -= n) < 0) {\n i += this.DB;\n --j;\n }\n if (is1) { // ret == 1, don't bother squaring or multiplying it\n g[w].copyTo(r);\n is1 = false;\n }\n else {\n while (n > 1) {\n z.sqrTo(r, r2);\n z.sqrTo(r2, r);\n n -= 2;\n }\n if (n > 0) {\n z.sqrTo(r, r2);\n }\n else {\n t = r;\n r = r2;\n r2 = t;\n }\n z.mulTo(r2, g[w], r);\n }\n while (j >= 0 && (e[j] & (1 << i)) == 0) {\n z.sqrTo(r, r2);\n t = r;\n r = r2;\n r2 = t;\n if (--i < 0) {\n i = this.DB - 1;\n --j;\n }\n }\n }\n return z.revert(r);\n };\n // BigInteger.prototype.modInverse = bnModInverse;\n // (public) 1/this % m (HAC 14.61)\n BigInteger.prototype.modInverse = function (m) {\n var ac = m.isEven();\n if ((this.isEven() && ac) || m.signum() == 0) {\n return BigInteger.ZERO;\n }\n var u = m.clone();\n var v = this.clone();\n var a = nbv(1);\n var b = nbv(0);\n var c = nbv(0);\n var d = nbv(1);\n while (u.signum() != 0) {\n while (u.isEven()) {\n u.rShiftTo(1, u);\n if (ac) {\n if (!a.isEven() || !b.isEven()) {\n a.addTo(this, a);\n b.subTo(m, b);\n }\n a.rShiftTo(1, a);\n }\n else if (!b.isEven()) {\n b.subTo(m, b);\n }\n b.rShiftTo(1, b);\n }\n while (v.isEven()) {\n v.rShiftTo(1, v);\n if (ac) {\n if (!c.isEven() || !d.isEven()) {\n c.addTo(this, c);\n d.subTo(m, d);\n }\n c.rShiftTo(1, c);\n }\n else if (!d.isEven()) {\n d.subTo(m, d);\n }\n d.rShiftTo(1, d);\n }\n if (u.compareTo(v) >= 0) {\n u.subTo(v, u);\n if (ac) {\n a.subTo(c, a);\n }\n b.subTo(d, b);\n }\n else {\n v.subTo(u, v);\n if (ac) {\n c.subTo(a, c);\n }\n d.subTo(b, d);\n }\n }\n if (v.compareTo(BigInteger.ONE) != 0) {\n return BigInteger.ZERO;\n }\n if (d.compareTo(m) >= 0) {\n return d.subtract(m);\n }\n if (d.signum() < 0) {\n d.addTo(m, d);\n }\n else {\n return d;\n }\n if (d.signum() < 0) {\n return d.add(m);\n }\n else {\n return d;\n }\n };\n // BigInteger.prototype.pow = bnPow;\n // (public) this^e\n BigInteger.prototype.pow = function (e) {\n return this.exp(e, new NullExp());\n };\n // BigInteger.prototype.gcd = bnGCD;\n // (public) gcd(this,a) (HAC 14.54)\n BigInteger.prototype.gcd = function (a) {\n var x = (this.s < 0) ? this.negate() : this.clone();\n var y = (a.s < 0) ? a.negate() : a.clone();\n if (x.compareTo(y) < 0) {\n var t = x;\n x = y;\n y = t;\n }\n var i = x.getLowestSetBit();\n var g = y.getLowestSetBit();\n if (g < 0) {\n return x;\n }\n if (i < g) {\n g = i;\n }\n if (g > 0) {\n x.rShiftTo(g, x);\n y.rShiftTo(g, y);\n }\n while (x.signum() > 0) {\n if ((i = x.getLowestSetBit()) > 0) {\n x.rShiftTo(i, x);\n }\n if ((i = y.getLowestSetBit()) > 0) {\n y.rShiftTo(i, y);\n }\n if (x.compareTo(y) >= 0) {\n x.subTo(y, x);\n x.rShiftTo(1, x);\n }\n else {\n y.subTo(x, y);\n y.rShiftTo(1, y);\n }\n }\n if (g > 0) {\n y.lShiftTo(g, y);\n }\n return y;\n };\n // BigInteger.prototype.isProbablePrime = bnIsProbablePrime;\n // (public) test primality with certainty >= 1-.5^t\n BigInteger.prototype.isProbablePrime = function (t) {\n var i;\n var x = this.abs();\n if (x.t == 1 && x[0] <= lowprimes[lowprimes.length - 1]) {\n for (i = 0; i < lowprimes.length; ++i) {\n if (x[0] == lowprimes[i]) {\n return true;\n }\n }\n return false;\n }\n if (x.isEven()) {\n return false;\n }\n i = 1;\n while (i < lowprimes.length) {\n var m = lowprimes[i];\n var j = i + 1;\n while (j < lowprimes.length && m < lplim) {\n m *= lowprimes[j++];\n }\n m = x.modInt(m);\n while (i < j) {\n if (m % lowprimes[i++] == 0) {\n return false;\n }\n }\n }\n return x.millerRabin(t);\n };\n //#endregion PUBLIC\n //#region PROTECTED\n // BigInteger.prototype.copyTo = bnpCopyTo;\n // (protected) copy this to r\n BigInteger.prototype.copyTo = function (r) {\n for (var i = this.t - 1; i >= 0; --i) {\n r[i] = this[i];\n }\n r.t = this.t;\n r.s = this.s;\n };\n // BigInteger.prototype.fromInt = bnpFromInt;\n // (protected) set from integer value x, -DV <= x < DV\n BigInteger.prototype.fromInt = function (x) {\n this.t = 1;\n this.s = (x < 0) ? -1 : 0;\n if (x > 0) {\n this[0] = x;\n }\n else if (x < -1) {\n this[0] = x + this.DV;\n }\n else {\n this.t = 0;\n }\n };\n // BigInteger.prototype.fromString = bnpFromString;\n // (protected) set from string and radix\n BigInteger.prototype.fromString = function (s, b) {\n var k;\n if (b == 16) {\n k = 4;\n }\n else if (b == 8) {\n k = 3;\n }\n else if (b == 256) {\n k = 8;\n /* byte array */\n }\n else if (b == 2) {\n k = 1;\n }\n else if (b == 32) {\n k = 5;\n }\n else if (b == 4) {\n k = 2;\n }\n else {\n this.fromRadix(s, b);\n return;\n }\n this.t = 0;\n this.s = 0;\n var i = s.length;\n var mi = false;\n var sh = 0;\n while (--i >= 0) {\n var x = (k == 8) ? (+s[i]) & 0xff : intAt(s, i);\n if (x < 0) {\n if (s.charAt(i) == \"-\") {\n mi = true;\n }\n continue;\n }\n mi = false;\n if (sh == 0) {\n this[this.t++] = x;\n }\n else if (sh + k > this.DB) {\n this[this.t - 1] |= (x & ((1 << (this.DB - sh)) - 1)) << sh;\n this[this.t++] = (x >> (this.DB - sh));\n }\n else {\n this[this.t - 1] |= x << sh;\n }\n sh += k;\n if (sh >= this.DB) {\n sh -= this.DB;\n }\n }\n if (k == 8 && ((+s[0]) & 0x80) != 0) {\n this.s = -1;\n if (sh > 0) {\n this[this.t - 1] |= ((1 << (this.DB - sh)) - 1) << sh;\n }\n }\n this.clamp();\n if (mi) {\n BigInteger.ZERO.subTo(this, this);\n }\n };\n // BigInteger.prototype.clamp = bnpClamp;\n // (protected) clamp off excess high words\n BigInteger.prototype.clamp = function () {\n var c = this.s & this.DM;\n while (this.t > 0 && this[this.t - 1] == c) {\n --this.t;\n }\n };\n // BigInteger.prototype.dlShiftTo = bnpDLShiftTo;\n // (protected) r = this << n*DB\n BigInteger.prototype.dlShiftTo = function (n, r) {\n var i;\n for (i = this.t - 1; i >= 0; --i) {\n r[i + n] = this[i];\n }\n for (i = n - 1; i >= 0; --i) {\n r[i] = 0;\n }\n r.t = this.t + n;\n r.s = this.s;\n };\n // BigInteger.prototype.drShiftTo = bnpDRShiftTo;\n // (protected) r = this >> n*DB\n BigInteger.prototype.drShiftTo = function (n, r) {\n for (var i = n; i < this.t; ++i) {\n r[i - n] = this[i];\n }\n r.t = Math.max(this.t - n, 0);\n r.s = this.s;\n };\n // BigInteger.prototype.lShiftTo = bnpLShiftTo;\n // (protected) r = this << n\n BigInteger.prototype.lShiftTo = function (n, r) {\n var bs = n % this.DB;\n var cbs = this.DB - bs;\n var bm = (1 << cbs) - 1;\n var ds = Math.floor(n / this.DB);\n var c = (this.s << bs) & this.DM;\n for (var i = this.t - 1; i >= 0; --i) {\n r[i + ds + 1] = (this[i] >> cbs) | c;\n c = (this[i] & bm) << bs;\n }\n for (var i = ds - 1; i >= 0; --i) {\n r[i] = 0;\n }\n r[ds] = c;\n r.t = this.t + ds + 1;\n r.s = this.s;\n r.clamp();\n };\n // BigInteger.prototype.rShiftTo = bnpRShiftTo;\n // (protected) r = this >> n\n BigInteger.prototype.rShiftTo = function (n, r) {\n r.s = this.s;\n var ds = Math.floor(n / this.DB);\n if (ds >= this.t) {\n r.t = 0;\n return;\n }\n var bs = n % this.DB;\n var cbs = this.DB - bs;\n var bm = (1 << bs) - 1;\n r[0] = this[ds] >> bs;\n for (var i = ds + 1; i < this.t; ++i) {\n r[i - ds - 1] |= (this[i] & bm) << cbs;\n r[i - ds] = this[i] >> bs;\n }\n if (bs > 0) {\n r[this.t - ds - 1] |= (this.s & bm) << cbs;\n }\n r.t = this.t - ds;\n r.clamp();\n };\n // BigInteger.prototype.subTo = bnpSubTo;\n // (protected) r = this - a\n BigInteger.prototype.subTo = function (a, r) {\n var i = 0;\n var c = 0;\n var m = Math.min(a.t, this.t);\n while (i < m) {\n c += this[i] - a[i];\n r[i++] = c & this.DM;\n c >>= this.DB;\n }\n if (a.t < this.t) {\n c -= a.s;\n while (i < this.t) {\n c += this[i];\n r[i++] = c & this.DM;\n c >>= this.DB;\n }\n c += this.s;\n }\n else {\n c += this.s;\n while (i < a.t) {\n c -= a[i];\n r[i++] = c & this.DM;\n c >>= this.DB;\n }\n c -= a.s;\n }\n r.s = (c < 0) ? -1 : 0;\n if (c < -1) {\n r[i++] = this.DV + c;\n }\n else if (c > 0) {\n r[i++] = c;\n }\n r.t = i;\n r.clamp();\n };\n // BigInteger.prototype.multiplyTo = bnpMultiplyTo;\n // (protected) r = this * a, r != this,a (HAC 14.12)\n // \"this\" should be the larger one if appropriate.\n BigInteger.prototype.multiplyTo = function (a, r) {\n var x = this.abs();\n var y = a.abs();\n var i = x.t;\n r.t = i + y.t;\n while (--i >= 0) {\n r[i] = 0;\n }\n for (i = 0; i < y.t; ++i) {\n r[i + x.t] = x.am(0, y[i], r, i, 0, x.t);\n }\n r.s = 0;\n r.clamp();\n if (this.s != a.s) {\n BigInteger.ZERO.subTo(r, r);\n }\n };\n // BigInteger.prototype.squareTo = bnpSquareTo;\n // (protected) r = this^2, r != this (HAC 14.16)\n BigInteger.prototype.squareTo = function (r) {\n var x = this.abs();\n var i = r.t = 2 * x.t;\n while (--i >= 0) {\n r[i] = 0;\n }\n for (i = 0; i < x.t - 1; ++i) {\n var c = x.am(i, x[i], r, 2 * i, 0, 1);\n if ((r[i + x.t] += x.am(i + 1, 2 * x[i], r, 2 * i + 1, c, x.t - i - 1)) >= x.DV) {\n r[i + x.t] -= x.DV;\n r[i + x.t + 1] = 1;\n }\n }\n if (r.t > 0) {\n r[r.t - 1] += x.am(i, x[i], r, 2 * i, 0, 1);\n }\n r.s = 0;\n r.clamp();\n };\n // BigInteger.prototype.divRemTo = bnpDivRemTo;\n // (protected) divide this by m, quotient and remainder to q, r (HAC 14.20)\n // r != q, this != m. q or r may be null.\n BigInteger.prototype.divRemTo = function (m, q, r) {\n var pm = m.abs();\n if (pm.t <= 0) {\n return;\n }\n var pt = this.abs();\n if (pt.t < pm.t) {\n if (q != null) {\n q.fromInt(0);\n }\n if (r != null) {\n this.copyTo(r);\n }\n return;\n }\n if (r == null) {\n r = nbi();\n }\n var y = nbi();\n var ts = this.s;\n var ms = m.s;\n var nsh = this.DB - nbits(pm[pm.t - 1]); // normalize modulus\n if (nsh > 0) {\n pm.lShiftTo(nsh, y);\n pt.lShiftTo(nsh, r);\n }\n else {\n pm.copyTo(y);\n pt.copyTo(r);\n }\n var ys = y.t;\n var y0 = y[ys - 1];\n if (y0 == 0) {\n return;\n }\n var yt = y0 * (1 << this.F1) + ((ys > 1) ? y[ys - 2] >> this.F2 : 0);\n var d1 = this.FV / yt;\n var d2 = (1 << this.F1) / yt;\n var e = 1 << this.F2;\n var i = r.t;\n var j = i - ys;\n var t = (q == null) ? nbi() : q;\n y.dlShiftTo(j, t);\n if (r.compareTo(t) >= 0) {\n r[r.t++] = 1;\n r.subTo(t, r);\n }\n BigInteger.ONE.dlShiftTo(ys, t);\n t.subTo(y, y); // \"negative\" y so we can replace sub with am later\n while (y.t < ys) {\n y[y.t++] = 0;\n }\n while (--j >= 0) {\n // Estimate quotient digit\n var qd = (r[--i] == y0) ? this.DM : Math.floor(r[i] * d1 + (r[i - 1] + e) * d2);\n if ((r[i] += y.am(0, qd, r, j, 0, ys)) < qd) { // Try it out\n y.dlShiftTo(j, t);\n r.subTo(t, r);\n while (r[i] < --qd) {\n r.subTo(t, r);\n }\n }\n }\n if (q != null) {\n r.drShiftTo(ys, q);\n if (ts != ms) {\n BigInteger.ZERO.subTo(q, q);\n }\n }\n r.t = ys;\n r.clamp();\n if (nsh > 0) {\n r.rShiftTo(nsh, r);\n } // Denormalize remainder\n if (ts < 0) {\n BigInteger.ZERO.subTo(r, r);\n }\n };\n // BigInteger.prototype.invDigit = bnpInvDigit;\n // (protected) return \"-1/this % 2^DB\"; useful for Mont. reduction\n // justification:\n // xy == 1 (mod m)\n // xy = 1+km\n // xy(2-xy) = (1+km)(1-km)\n // x[y(2-xy)] = 1-k^2m^2\n // x[y(2-xy)] == 1 (mod m^2)\n // if y is 1/x mod m, then y(2-xy) is 1/x mod m^2\n // should reduce x and y(2-xy) by m^2 at each step to keep size bounded.\n // JS multiply \"overflows\" differently from C/C++, so care is needed here.\n BigInteger.prototype.invDigit = function () {\n if (this.t < 1) {\n return 0;\n }\n var x = this[0];\n if ((x & 1) == 0) {\n return 0;\n }\n var y = x & 3; // y == 1/x mod 2^2\n y = (y * (2 - (x & 0xf) * y)) & 0xf; // y == 1/x mod 2^4\n y = (y * (2 - (x & 0xff) * y)) & 0xff; // y == 1/x mod 2^8\n y = (y * (2 - (((x & 0xffff) * y) & 0xffff))) & 0xffff; // y == 1/x mod 2^16\n // last step - calculate inverse mod DV directly;\n // assumes 16 < DB <= 32 and assumes ability to handle 48-bit ints\n y = (y * (2 - x * y % this.DV)) % this.DV; // y == 1/x mod 2^dbits\n // we really want the negative inverse, and -DV < y < DV\n return (y > 0) ? this.DV - y : -y;\n };\n // BigInteger.prototype.isEven = bnpIsEven;\n // (protected) true iff this is even\n BigInteger.prototype.isEven = function () {\n return ((this.t > 0) ? (this[0] & 1) : this.s) == 0;\n };\n // BigInteger.prototype.exp = bnpExp;\n // (protected) this^e, e < 2^32, doing sqr and mul with \"r\" (HAC 14.79)\n BigInteger.prototype.exp = function (e, z) {\n if (e > 0xffffffff || e < 1) {\n return BigInteger.ONE;\n }\n var r = nbi();\n var r2 = nbi();\n var g = z.convert(this);\n var i = nbits(e) - 1;\n g.copyTo(r);\n while (--i >= 0) {\n z.sqrTo(r, r2);\n if ((e & (1 << i)) > 0) {\n z.mulTo(r2, g, r);\n }\n else {\n var t = r;\n r = r2;\n r2 = t;\n }\n }\n return z.revert(r);\n };\n // BigInteger.prototype.chunkSize = bnpChunkSize;\n // (protected) return x s.t. r^x < DV\n BigInteger.prototype.chunkSize = function (r) {\n return Math.floor(Math.LN2 * this.DB / Math.log(r));\n };\n // BigInteger.prototype.toRadix = bnpToRadix;\n // (protected) convert to radix string\n BigInteger.prototype.toRadix = function (b) {\n if (b == null) {\n b = 10;\n }\n if (this.signum() == 0 || b < 2 || b > 36) {\n return \"0\";\n }\n var cs = this.chunkSize(b);\n var a = Math.pow(b, cs);\n var d = nbv(a);\n var y = nbi();\n var z = nbi();\n var r = \"\";\n this.divRemTo(d, y, z);\n while (y.signum() > 0) {\n r = (a + z.intValue()).toString(b).substring(1) + r;\n y.divRemTo(d, y, z);\n }\n return z.intValue().toString(b) + r;\n };\n // BigInteger.prototype.fromRadix = bnpFromRadix;\n // (protected) convert from radix string\n BigInteger.prototype.fromRadix = function (s, b) {\n this.fromInt(0);\n if (b == null) {\n b = 10;\n }\n var cs = this.chunkSize(b);\n var d = Math.pow(b, cs);\n var mi = false;\n var j = 0;\n var w = 0;\n for (var i = 0; i < s.length; ++i) {\n var x = intAt(s, i);\n if (x < 0) {\n if (s.charAt(i) == \"-\" && this.signum() == 0) {\n mi = true;\n }\n continue;\n }\n w = b * w + x;\n if (++j >= cs) {\n this.dMultiply(d);\n this.dAddOffset(w, 0);\n j = 0;\n w = 0;\n }\n }\n if (j > 0) {\n this.dMultiply(Math.pow(b, j));\n this.dAddOffset(w, 0);\n }\n if (mi) {\n BigInteger.ZERO.subTo(this, this);\n }\n };\n // BigInteger.prototype.fromNumber = bnpFromNumber;\n // (protected) alternate constructor\n BigInteger.prototype.fromNumber = function (a, b, c) {\n if (\"number\" == typeof b) {\n // new BigInteger(int,int,RNG)\n if (a < 2) {\n this.fromInt(1);\n }\n else {\n this.fromNumber(a, c);\n if (!this.testBit(a - 1)) {\n // force MSB set\n this.bitwiseTo(BigInteger.ONE.shiftLeft(a - 1), op_or, this);\n }\n if (this.isEven()) {\n this.dAddOffset(1, 0);\n } // force odd\n while (!this.isProbablePrime(b)) {\n this.dAddOffset(2, 0);\n if (this.bitLength() > a) {\n this.subTo(BigInteger.ONE.shiftLeft(a - 1), this);\n }\n }\n }\n }\n else {\n // new BigInteger(int,RNG)\n var x = [];\n var t = a & 7;\n x.length = (a >> 3) + 1;\n b.nextBytes(x);\n if (t > 0) {\n x[0] &= ((1 << t) - 1);\n }\n else {\n x[0] = 0;\n }\n this.fromString(x, 256);\n }\n };\n // BigInteger.prototype.bitwiseTo = bnpBitwiseTo;\n // (protected) r = this op a (bitwise)\n BigInteger.prototype.bitwiseTo = function (a, op, r) {\n var i;\n var f;\n var m = Math.min(a.t, this.t);\n for (i = 0; i < m; ++i) {\n r[i] = op(this[i], a[i]);\n }\n if (a.t < this.t) {\n f = a.s & this.DM;\n for (i = m; i < this.t; ++i) {\n r[i] = op(this[i], f);\n }\n r.t = this.t;\n }\n else {\n f = this.s & this.DM;\n for (i = m; i < a.t; ++i) {\n r[i] = op(f, a[i]);\n }\n r.t = a.t;\n }\n r.s = op(this.s, a.s);\n r.clamp();\n };\n // BigInteger.prototype.changeBit = bnpChangeBit;\n // (protected) this op (1<<n)\n BigInteger.prototype.changeBit = function (n, op) {\n var r = BigInteger.ONE.shiftLeft(n);\n this.bitwiseTo(r, op, r);\n return r;\n };\n // BigInteger.prototype.addTo = bnpAddTo;\n // (protected) r = this + a\n BigInteger.prototype.addTo = function (a, r) {\n var i = 0;\n var c = 0;\n var m = Math.min(a.t, this.t);\n while (i < m) {\n c += this[i] + a[i];\n r[i++] = c & this.DM;\n c >>= this.DB;\n }\n if (a.t < this.t) {\n c += a.s;\n while (i < this.t) {\n c += this[i];\n r[i++] = c & this.DM;\n c >>= this.DB;\n }\n c += this.s;\n }\n else {\n c += this.s;\n while (i < a.t) {\n c += a[i];\n r[i++] = c & this.DM;\n c >>= this.DB;\n }\n c += a.s;\n }\n r.s = (c < 0) ? -1 : 0;\n if (c > 0) {\n r[i++] = c;\n }\n else if (c < -1) {\n r[i++] = this.DV + c;\n }\n r.t = i;\n r.clamp();\n };\n // BigInteger.prototype.dMultiply = bnpDMultiply;\n // (protected) this *= n, this >= 0, 1 < n < DV\n BigInteger.prototype.dMultiply = function (n) {\n this[this.t] = this.am(0, n - 1, this, 0, 0, this.t);\n ++this.t;\n this.clamp();\n };\n // BigInteger.prototype.dAddOffset = bnpDAddOffset;\n // (protected) this += n << w words, this >= 0\n BigInteger.prototype.dAddOffset = function (n, w) {\n if (n == 0) {\n return;\n }\n while (this.t <= w) {\n this[this.t++] = 0;\n }\n this[w] += n;\n while (this[w] >= this.DV) {\n this[w] -= this.DV;\n if (++w >= this.t) {\n this[this.t++] = 0;\n }\n ++this[w];\n }\n };\n // BigInteger.prototype.multiplyLowerTo = bnpMultiplyLowerTo;\n // (protected) r = lower n words of \"this * a\", a.t <= n\n // \"this\" should be the larger one if appropriate.\n BigInteger.prototype.multiplyLowerTo = function (a, n, r) {\n var i = Math.min(this.t + a.t, n);\n r.s = 0; // assumes a,this >= 0\n r.t = i;\n while (i > 0) {\n r[--i] = 0;\n }\n for (var j = r.t - this.t; i < j; ++i) {\n r[i + this.t] = this.am(0, a[i], r, i, 0, this.t);\n }\n for (var j = Math.min(a.t, n); i < j; ++i) {\n this.am(0, a[i], r, i, 0, n - i);\n }\n r.clamp();\n };\n // BigInteger.prototype.multiplyUpperTo = bnpMultiplyUpperTo;\n // (protected) r = \"this * a\" without lower n words, n > 0\n // \"this\" should be the larger one if appropriate.\n BigInteger.prototype.multiplyUpperTo = function (a, n, r) {\n --n;\n var i = r.t = this.t + a.t - n;\n r.s = 0; // assumes a,this >= 0\n while (--i >= 0) {\n r[i] = 0;\n }\n for (i = Math.max(n - this.t, 0); i < a.t; ++i) {\n r[this.t + i - n] = this.am(n - i, a[i], r, 0, 0, this.t + i - n);\n }\n r.clamp();\n r.drShiftTo(1, r);\n };\n // BigInteger.prototype.modInt = bnpModInt;\n // (protected) this % n, n < 2^26\n BigInteger.prototype.modInt = function (n) {\n if (n <= 0) {\n return 0;\n }\n var d = this.DV % n;\n var r = (this.s < 0) ? n - 1 : 0;\n if (this.t > 0) {\n if (d == 0) {\n r = this[0] % n;\n }\n else {\n for (var i = this.t - 1; i >= 0; --i) {\n r = (d * r + this[i]) % n;\n }\n }\n }\n return r;\n };\n // BigInteger.prototype.millerRabin = bnpMillerRabin;\n // (protected) true if probably prime (HAC 4.24, Miller-Rabin)\n BigInteger.prototype.millerRabin = function (t) {\n var n1 = this.subtract(BigInteger.ONE);\n var k = n1.getLowestSetBit();\n if (k <= 0) {\n return false;\n }\n var r = n1.shiftRight(k);\n t = (t + 1) >> 1;\n if (t > lowprimes.length) {\n t = lowprimes.length;\n }\n var a = nbi();\n for (var i = 0; i < t; ++i) {\n // Pick bases at random, instead of starting at 2\n a.fromInt(lowprimes[Math.floor(Math.random() * lowprimes.length)]);\n var y = a.modPow(r, this);\n if (y.compareTo(BigInteger.ONE) != 0 && y.compareTo(n1) != 0) {\n var j = 1;\n while (j++ < k && y.compareTo(n1) != 0) {\n y = y.modPowInt(2, this);\n if (y.compareTo(BigInteger.ONE) == 0) {\n return false;\n }\n }\n if (y.compareTo(n1) != 0) {\n return false;\n }\n }\n }\n return true;\n };\n // BigInteger.prototype.square = bnSquare;\n // (public) this^2\n BigInteger.prototype.square = function () {\n var r = nbi();\n this.squareTo(r);\n return r;\n };\n //#region ASYNC\n // Public API method\n BigInteger.prototype.gcda = function (a, callback) {\n var x = (this.s < 0) ? this.negate() : this.clone();\n var y = (a.s < 0) ? a.negate() : a.clone();\n if (x.compareTo(y) < 0) {\n var t = x;\n x = y;\n y = t;\n }\n var i = x.getLowestSetBit();\n var g = y.getLowestSetBit();\n if (g < 0) {\n callback(x);\n return;\n }\n if (i < g) {\n g = i;\n }\n if (g > 0) {\n x.rShiftTo(g, x);\n y.rShiftTo(g, y);\n }\n // Workhorse of the algorithm, gets called 200 - 800 times per 512 bit keygen.\n var gcda1 = function () {\n if ((i = x.getLowestSetBit()) > 0) {\n x.rShiftTo(i, x);\n }\n if ((i = y.getLowestSetBit()) > 0) {\n y.rShiftTo(i, y);\n }\n if (x.compareTo(y) >= 0) {\n x.subTo(y, x);\n x.rShiftTo(1, x);\n }\n else {\n y.subTo(x, y);\n y.rShiftTo(1, y);\n }\n if (!(x.signum() > 0)) {\n if (g > 0) {\n y.lShiftTo(g, y);\n }\n setTimeout(function () { callback(y); }, 0); // escape\n }\n else {\n setTimeout(gcda1, 0);\n }\n };\n setTimeout(gcda1, 10);\n };\n // (protected) alternate constructor\n BigInteger.prototype.fromNumberAsync = function (a, b, c, callback) {\n if (\"number\" == typeof b) {\n if (a < 2) {\n this.fromInt(1);\n }\n else {\n this.fromNumber(a, c);\n if (!this.testBit(a - 1)) {\n this.bitwiseTo(BigInteger.ONE.shiftLeft(a - 1), op_or, this);\n }\n if (this.isEven()) {\n this.dAddOffset(1, 0);\n }\n var bnp_1 = this;\n var bnpfn1_1 = function () {\n bnp_1.dAddOffset(2, 0);\n if (bnp_1.bitLength() > a) {\n bnp_1.subTo(BigInteger.ONE.shiftLeft(a - 1), bnp_1);\n }\n if (bnp_1.isProbablePrime(b)) {\n setTimeout(function () { callback(); }, 0); // escape\n }\n else {\n setTimeout(bnpfn1_1, 0);\n }\n };\n setTimeout(bnpfn1_1, 0);\n }\n }\n else {\n var x = [];\n var t = a & 7;\n x.length = (a >> 3) + 1;\n b.nextBytes(x);\n if (t > 0) {\n x[0] &= ((1 << t) - 1);\n }\n else {\n x[0] = 0;\n }\n this.fromString(x, 256);\n }\n };\n return BigInteger;\n}());\nexport { BigInteger };\n//#region REDUCERS\n//#region NullExp\nvar NullExp = /** @class */ (function () {\n function NullExp() {\n }\n // NullExp.prototype.convert = nNop;\n NullExp.prototype.convert = function (x) {\n return x;\n };\n // NullExp.prototype.revert = nNop;\n NullExp.prototype.revert = function (x) {\n return x;\n };\n // NullExp.prototype.mulTo = nMulTo;\n NullExp.prototype.mulTo = function (x, y, r) {\n x.multiplyTo(y, r);\n };\n // NullExp.prototype.sqrTo = nSqrTo;\n NullExp.prototype.sqrTo = function (x, r) {\n x.squareTo(r);\n };\n return NullExp;\n}());\n// Modular reduction using \"classic\" algorithm\nvar Classic = /** @class */ (function () {\n function Classic(m) {\n this.m = m;\n }\n // Classic.prototype.convert = cConvert;\n Classic.prototype.convert = function (x) {\n if (x.s < 0 || x.compareTo(this.m) >= 0) {\n return x.mod(this.m);\n }\n else {\n return x;\n }\n };\n // Classic.prototype.revert = cRevert;\n Classic.prototype.revert = function (x) {\n return x;\n };\n // Classic.prototype.reduce = cReduce;\n Classic.prototype.reduce = function (x) {\n x.divRemTo(this.m, null, x);\n };\n // Classic.prototype.mulTo = cMulTo;\n Classic.prototype.mulTo = function (x, y, r) {\n x.multiplyTo(y, r);\n this.reduce(r);\n };\n // Classic.prototype.sqrTo = cSqrTo;\n Classic.prototype.sqrTo = function (x, r) {\n x.squareTo(r);\n this.reduce(r);\n };\n return Classic;\n}());\n//#endregion\n//#region Montgomery\n// Montgomery reduction\nvar Montgomery = /** @class */ (function () {\n function Montgomery(m) {\n this.m = m;\n this.mp = m.invDigit();\n this.mpl = this.mp & 0x7fff;\n this.mph = this.mp >> 15;\n this.um = (1 << (m.DB - 15)) - 1;\n this.mt2 = 2 * m.t;\n }\n // Montgomery.prototype.convert = montConvert;\n // xR mod m\n Montgomery.prototype.convert = function (x) {\n var r = nbi();\n x.abs().dlShiftTo(this.m.t, r);\n r.divRemTo(this.m, null, r);\n if (x.s < 0 && r.compareTo(BigInteger.ZERO) > 0) {\n this.m.subTo(r, r);\n }\n return r;\n };\n // Montgomery.prototype.revert = montRevert;\n // x/R mod m\n Montgomery.prototype.revert = function (x) {\n var r = nbi();\n x.copyTo(r);\n this.reduce(r);\n return r;\n };\n // Montgomery.prototype.reduce = montReduce;\n // x = x/R mod m (HAC 14.32)\n Montgomery.prototype.reduce = function (x) {\n while (x.t <= this.mt2) {\n // pad x so am has enough room later\n x[x.t++] = 0;\n }\n for (var i = 0; i < this.m.t; ++i) {\n // faster way of calculating u0 = x[i]*mp mod DV\n var j = x[i] & 0x7fff;\n var u0 = (j * this.mpl + (((j * this.mph + (x[i] >> 15) * this.mpl) & this.um) << 15)) & x.DM;\n // use am to combine the multiply-shift-add into one call\n j = i + this.m.t;\n x[j] += this.m.am(0, u0, x, i, 0, this.m.t);\n // propagate carry\n while (x[j] >= x.DV) {\n x[j] -= x.DV;\n x[++j]++;\n }\n }\n x.clamp();\n x.drShiftTo(this.m.t, x);\n if (x.compareTo(this.m) >= 0) {\n x.subTo(this.m, x);\n }\n };\n // Montgomery.prototype.mulTo = montMulTo;\n // r = \"xy/R mod m\"; x,y != r\n Montgomery.prototype.mulTo = function (x, y, r) {\n x.multiplyTo(y, r);\n this.reduce(r);\n };\n // Montgomery.prototype.sqrTo = montSqrTo;\n // r = \"x^2/R mod m\"; x != r\n Montgomery.prototype.sqrTo = function (x, r) {\n x.squareTo(r);\n this.reduce(r);\n };\n return Montgomery;\n}());\n//#endregion Montgomery\n//#region Barrett\n// Barrett modular reduction\nvar Barrett = /** @class */ (function () {\n function Barrett(m) {\n this.m = m;\n // setup Barrett\n this.r2 = nbi();\n this.q3 = nbi();\n BigInteger.ONE.dlShiftTo(2 * m.t, this.r2);\n this.mu = this.r2.divide(m);\n }\n // Barrett.prototype.convert = barrettConvert;\n Barrett.prototype.convert = function (x) {\n if (x.s < 0 || x.t > 2 * this.m.t) {\n return x.mod(this.m);\n }\n else if (x.compareTo(this.m) < 0) {\n return x;\n }\n else {\n var r = nbi();\n x.copyTo(r);\n this.reduce(r);\n return r;\n }\n };\n // Barrett.prototype.revert = barrettRevert;\n Barrett.prototype.revert = function (x) {\n return x;\n };\n // Barrett.prototype.reduce = barrettReduce;\n // x = x mod m (HAC 14.42)\n Barrett.prototype.reduce = function (x) {\n x.drShiftTo(this.m.t - 1, this.r2);\n if (x.t > this.m.t + 1) {\n x.t = this.m.t + 1;\n x.clamp();\n }\n this.mu.multiplyUpperTo(this.r2, this.m.t + 1, this.q3);\n this.m.multiplyLowerTo(this.q3, this.m.t + 1, this.r2);\n while (x.compareTo(this.r2) < 0) {\n x.dAddOffset(1, this.m.t + 1);\n }\n x.subTo(this.r2, x);\n while (x.compareTo(this.m) >= 0) {\n x.subTo(this.m, x);\n }\n };\n // Barrett.prototype.mulTo = barrettMulTo;\n // r = x*y mod m; x,y != r\n Barrett.prototype.mulTo = function (x, y, r) {\n x.multiplyTo(y, r);\n this.reduce(r);\n };\n // Barrett.prototype.sqrTo = barrettSqrTo;\n // r = x^2 mod m; x != r\n Barrett.prototype.sqrTo = function (x, r) {\n x.squareTo(r);\n this.reduce(r);\n };\n return Barrett;\n}());\n//#endregion\n//#endregion REDUCERS\n// return new, unset BigInteger\nexport function nbi() { return new BigInteger(null); }\nexport function parseBigInt(str, r) {\n return new BigInteger(str, r);\n}\n// am: Compute w_j += (x*this_i), propagate carries,\n// c is initial carry, returns final carry.\n// c < 3*dvalue, x < 2*dvalue, this_i < dvalue\n// We need to select the fastest one that works in this environment.\nvar inBrowser = typeof navigator !== \"undefined\";\nif (inBrowser && j_lm && (navigator.appName == \"Microsoft Internet Explorer\")) {\n // am2 avoids a big mult-and-extract completely.\n // Max digit bits should be <= 30 because we do bitwise ops\n // on values up to 2*hdvalue^2-hdvalue-1 (< 2^31)\n BigInteger.prototype.am = function am2(i, x, w, j, c, n) {\n var xl = x & 0x7fff;\n var xh = x >> 15;\n while (--n >= 0) {\n var l = this[i] & 0x7fff;\n var h = this[i++] >> 15;\n var m = xh * l + h * xl;\n l = xl * l + ((m & 0x7fff) << 15) + w[j] + (c & 0x3fffffff);\n c = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30);\n w[j++] = l & 0x3fffffff;\n }\n return c;\n };\n dbits = 30;\n}\nelse if (inBrowser && j_lm && (navigator.appName != \"Netscape\")) {\n // am1: use a single mult and divide to get the high bits,\n // max digit bits should be 26 because\n // max internal value = 2*dvalue^2-2*dvalue (< 2^53)\n BigInteger.prototype.am = function am1(i, x, w, j, c, n) {\n while (--n >= 0) {\n var v = x * this[i++] + w[j] + c;\n c = Math.floor(v / 0x4000000);\n w[j++] = v & 0x3ffffff;\n }\n return c;\n };\n dbits = 26;\n}\nelse { // Mozilla/Netscape seems to prefer am3\n // Alternately, set max digit bits to 28 since some\n // browsers slow down when dealing with 32-bit numbers.\n BigInteger.prototype.am = function am3(i, x, w, j, c, n) {\n var xl = x & 0x3fff;\n var xh = x >> 14;\n while (--n >= 0) {\n var l = this[i] & 0x3fff;\n var h = this[i++] >> 14;\n var m = xh * l + h * xl;\n l = xl * l + ((m & 0x3fff) << 14) + w[j] + c;\n c = (l >> 28) + (m >> 14) + xh * h;\n w[j++] = l & 0xfffffff;\n }\n return c;\n };\n dbits = 28;\n}\nBigInteger.prototype.DB = dbits;\nBigInteger.prototype.DM = ((1 << dbits) - 1);\nBigInteger.prototype.DV = (1 << dbits);\nvar BI_FP = 52;\nBigInteger.prototype.FV = Math.pow(2, BI_FP);\nBigInteger.prototype.F1 = BI_FP - dbits;\nBigInteger.prototype.F2 = 2 * dbits - BI_FP;\n// Digit conversions\nvar BI_RC = [];\nvar rr;\nvar vv;\nrr = \"0\".charCodeAt(0);\nfor (vv = 0; vv <= 9; ++vv) {\n BI_RC[rr++] = vv;\n}\nrr = \"a\".charCodeAt(0);\nfor (vv = 10; vv < 36; ++vv) {\n BI_RC[rr++] = vv;\n}\nrr = \"A\".charCodeAt(0);\nfor (vv = 10; vv < 36; ++vv) {\n BI_RC[rr++] = vv;\n}\nexport function intAt(s, i) {\n var c = BI_RC[s.charCodeAt(i)];\n return (c == null) ? -1 : c;\n}\n// return bigint initialized to value\nexport function nbv(i) {\n var r = nbi();\n r.fromInt(i);\n return r;\n}\n// returns bit length of the integer x\nexport function nbits(x) {\n var r = 1;\n var t;\n if ((t = x >>> 16) != 0) {\n x = t;\n r += 16;\n }\n if ((t = x >> 8) != 0) {\n x = t;\n r += 8;\n }\n if ((t = x >> 4) != 0) {\n x = t;\n r += 4;\n }\n if ((t = x >> 2) != 0) {\n x = t;\n r += 2;\n }\n if ((t = x >> 1) != 0) {\n x = t;\n r += 1;\n }\n return r;\n}\n// \"constants\"\nBigInteger.ZERO = nbv(0);\nBigInteger.ONE = nbv(1);\n"],"names":["BigInteger","NullExp","Classic","Montgomery","Barrett"],"mappings":";AAMA,IAAI;AAEJ,IAAI,SAAS;AACb,IAAI,QAAS,SAAS,aAAa;AAEnC,IAAI,YAAY,CAAC,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG;AAC1zB,IAAI,SAAS,KAAK,MAAM,UAAU,UAAU,SAAS,CAAC;AAGnD,IAAC;AAAA;AAAA,GAA4B,WAAY;AACxC,aAASA,YAAW,GAAG,GAAG,GAAG;AACzB,UAAI,KAAK,MAAM;AACX,YAAI,YAAY,OAAO,GAAG;AACtB,eAAK,WAAW,GAAG,GAAG,CAAC;AAAA,QAC3B,WACS,KAAK,QAAQ,YAAY,OAAO,GAAG;AACxC,eAAK,WAAW,GAAG,GAAG;AAAA,QAC1B,OACK;AACD,eAAK,WAAW,GAAG,CAAC;AAAA,QACxB;AAAA,MACJ;AAAA,IACJ;AAIA,IAAAA,YAAW,UAAU,WAAW,SAAU,GAAG;AACzC,UAAI,KAAK,IAAI,GAAG;AACZ,eAAO,MAAM,KAAK,OAAM,EAAG,SAAS,CAAC;AAAA,MACzC;AACA,UAAI;AACJ,UAAI,KAAK,IAAI;AACT,YAAI;AAAA,MACR,WACS,KAAK,GAAG;AACb,YAAI;AAAA,MACR,WACS,KAAK,GAAG;AACb,YAAI;AAAA,MACR,WACS,KAAK,IAAI;AACd,YAAI;AAAA,MACR,WACS,KAAK,GAAG;AACb,YAAI;AAAA,MACR,OACK;AACD,eAAO,KAAK,QAAQ,CAAC;AAAA,MACzB;AACA,UAAI,MAAM,KAAK,KAAK;AACpB,UAAI;AACJ,UAAI,IAAI;AACR,UAAI,IAAI;AACR,UAAI,IAAI,KAAK;AACb,UAAI,IAAI,KAAK,KAAM,IAAI,KAAK,KAAM;AAClC,UAAI,MAAM,GAAG;AACT,YAAI,IAAI,KAAK,OAAO,IAAI,KAAK,CAAC,KAAK,KAAK,GAAG;AACvC,cAAI;AACJ,cAAI,SAAS,CAAC;AAAA,QAClB;AACA,eAAO,KAAK,GAAG;AACX,cAAI,IAAI,GAAG;AACP,iBAAK,KAAK,CAAC,KAAM,KAAK,KAAK,MAAQ,IAAI;AACvC,iBAAK,KAAK,EAAE,CAAC,MAAM,KAAK,KAAK,KAAK;AAAA,UACtC,OACK;AACD,gBAAK,KAAK,CAAC,MAAM,KAAK,KAAM;AAC5B,gBAAI,KAAK,GAAG;AACR,mBAAK,KAAK;AACV,gBAAE;AAAA,YACN;AAAA,UACJ;AACA,cAAI,IAAI,GAAG;AACP,gBAAI;AAAA,UACR;AACA,cAAI,GAAG;AACH,iBAAK,SAAS,CAAC;AAAA,UACnB;AAAA,QACJ;AAAA,MACJ;AACA,aAAO,IAAI,IAAI;AAAA,IACnB;AAGA,IAAAA,YAAW,UAAU,SAAS,WAAY;AACtC,UAAI,IAAI,IAAG;AACX,MAAAA,YAAW,KAAK,MAAM,MAAM,CAAC;AAC7B,aAAO;AAAA,IACX;AAGA,IAAAA,YAAW,UAAU,MAAM,WAAY;AACnC,aAAQ,KAAK,IAAI,IAAK,KAAK,OAAM,IAAK;AAAA,IAC1C;AAGA,IAAAA,YAAW,UAAU,YAAY,SAAU,GAAG;AAC1C,UAAI,IAAI,KAAK,IAAI,EAAE;AACnB,UAAI,KAAK,GAAG;AACR,eAAO;AAAA,MACX;AACA,UAAI,IAAI,KAAK;AACb,UAAI,IAAI,EAAE;AACV,UAAI,KAAK,GAAG;AACR,eAAQ,KAAK,IAAI,IAAK,CAAC,IAAI;AAAA,MAC/B;AACA,aAAO,EAAE,KAAK,GAAG;AACb,aAAK,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG;AAC3B,iBAAO;AAAA,QACX;AAAA,MACJ;AACA,aAAO;AAAA,IACX;AAGA,IAAAA,YAAW,UAAU,YAAY,WAAY;AACzC,UAAI,KAAK,KAAK,GAAG;AACb,eAAO;AAAA,MACX;AACA,aAAO,KAAK,MAAM,KAAK,IAAI,KAAK,MAAM,KAAK,KAAK,IAAI,CAAC,IAAK,KAAK,IAAI,KAAK,EAAG;AAAA,IAC/E;AAGA,IAAAA,YAAW,UAAU,MAAM,SAAU,GAAG;AACpC,UAAI,IAAI,IAAG;AACX,WAAK,IAAG,EAAG,SAAS,GAAG,MAAM,CAAC;AAC9B,UAAI,KAAK,IAAI,KAAK,EAAE,UAAUA,YAAW,IAAI,IAAI,GAAG;AAChD,UAAE,MAAM,GAAG,CAAC;AAAA,MAChB;AACA,aAAO;AAAA,IACX;AAGA,IAAAA,YAAW,UAAU,YAAY,SAAU,GAAG,GAAG;AAC7C,UAAI;AACJ,UAAI,IAAI,OAAO,EAAE,OAAM,GAAI;AACvB,YAAI,IAAI,QAAQ,CAAC;AAAA,MACrB,OACK;AACD,YAAI,IAAI,WAAW,CAAC;AAAA,MACxB;AACA,aAAO,KAAK,IAAI,GAAG,CAAC;AAAA,IACxB;AAGA,IAAAA,YAAW,UAAU,QAAQ,WAAY;AACrC,UAAI,IAAI,IAAG;AACX,WAAK,OAAO,CAAC;AACb,aAAO;AAAA,IACX;AAGA,IAAAA,YAAW,UAAU,WAAW,WAAY;AACxC,UAAI,KAAK,IAAI,GAAG;AACZ,YAAI,KAAK,KAAK,GAAG;AACb,iBAAO,KAAK,CAAC,IAAI,KAAK;AAAA,QAC1B,WACS,KAAK,KAAK,GAAG;AAClB,iBAAO;AAAA,QACX;AAAA,MACJ,WACS,KAAK,KAAK,GAAG;AAClB,eAAO,KAAK,CAAC;AAAA,MACjB,WACS,KAAK,KAAK,GAAG;AAClB,eAAO;AAAA,MACX;AAEA,cAAS,KAAK,CAAC,KAAM,KAAM,KAAK,KAAK,MAAO,MAAO,KAAK,KAAM,KAAK,CAAC;AAAA,IACxE;AAGA,IAAAA,YAAW,UAAU,YAAY,WAAY;AACzC,aAAQ,KAAK,KAAK,IAAK,KAAK,IAAK,KAAK,CAAC,KAAK,MAAO;AAAA,IACvD;AAGA,IAAAA,YAAW,UAAU,aAAa,WAAY;AAC1C,aAAQ,KAAK,KAAK,IAAK,KAAK,IAAK,KAAK,CAAC,KAAK,MAAO;AAAA,IACvD;AAGA,IAAAA,YAAW,UAAU,SAAS,WAAY;AACtC,UAAI,KAAK,IAAI,GAAG;AACZ,eAAO;AAAA,MACX,WACS,KAAK,KAAK,KAAM,KAAK,KAAK,KAAK,KAAK,CAAC,KAAK,GAAI;AACnD,eAAO;AAAA,MACX,OACK;AACD,eAAO;AAAA,MACX;AAAA,IACJ;AAGA,IAAAA,YAAW,UAAU,cAAc,WAAY;AAC3C,UAAI,IAAI,KAAK;AACb,UAAI,IAAI,CAAA;AACR,QAAE,CAAC,IAAI,KAAK;AACZ,UAAI,IAAI,KAAK,KAAM,IAAI,KAAK,KAAM;AAClC,UAAI;AACJ,UAAI,IAAI;AACR,UAAI,MAAM,GAAG;AACT,YAAI,IAAI,KAAK,OAAO,IAAI,KAAK,CAAC,KAAK,OAAO,KAAK,IAAI,KAAK,OAAO,GAAG;AAC9D,YAAE,GAAG,IAAI,IAAK,KAAK,KAAM,KAAK,KAAK;AAAA,QACvC;AACA,eAAO,KAAK,GAAG;AACX,cAAI,IAAI,GAAG;AACP,iBAAK,KAAK,CAAC,KAAM,KAAK,KAAK,MAAQ,IAAI;AACvC,iBAAK,KAAK,EAAE,CAAC,MAAM,KAAK,KAAK,KAAK;AAAA,UACtC,OACK;AACD,gBAAK,KAAK,CAAC,MAAM,KAAK,KAAM;AAC5B,gBAAI,KAAK,GAAG;AACR,mBAAK,KAAK;AACV,gBAAE;AAAA,YACN;AAAA,UACJ;AACA,eAAK,IAAI,QAAS,GAAG;AACjB,iBAAK;AAAA,UACT;AACA,cAAI,KAAK,MAAM,KAAK,IAAI,SAAU,IAAI,MAAO;AACzC,cAAE;AAAA,UACN;AACA,cAAI,IAAI,KAAK,KAAK,KAAK,GAAG;AACtB,cAAE,GAAG,IAAI;AAAA,UACb;AAAA,QACJ;AAAA,MACJ;AACA,aAAO;AAAA,IACX;AAEA,IAAAA,YAAW,UAAU,SAAS,SAAU,GAAG;AACvC,aAAQ,KAAK,UAAU,CAAC,KAAK;AAAA,IACjC;AAEA,IAAAA,YAAW,UAAU,MAAM,SAAU,GAAG;AACpC,aAAQ,KAAK,UAAU,CAAC,IAAI,IAAK,OAAO;AAAA,IAC5C;AAEA,IAAAA,YAAW,UAAU,MAAM,SAAU,GAAG;AACpC,aAAQ,KAAK,UAAU,CAAC,IAAI,IAAK,OAAO;AAAA,IAC5C;AAEA,IAAAA,YAAW,UAAU,MAAM,SAAU,GAAG;AACpC,UAAI,IAAI,IAAG;AACX,WAAK,UAAU,GAAG,QAAQ,CAAC;AAC3B,aAAO;AAAA,IACX;AAEA,IAAAA,YAAW,UAAU,KAAK,SAAU,GAAG;AACnC,UAAI,IAAI,IAAG;AACX,WAAK,UAAU,GAAG,OAAO,CAAC;AAC1B,aAAO;AAAA,IACX;AAEA,IAAAA,YAAW,UAAU,MAAM,SAAU,GAAG;AACpC,UAAI,IAAI,IAAG;AACX,WAAK,UAAU,GAAG,QAAQ,CAAC;AAC3B,aAAO;AAAA,IACX;AAEA,IAAAA,YAAW,UAAU,SAAS,SAAU,GAAG;AACvC,UAAI,IAAI,IAAG;AACX,WAAK,UAAU,GAAG,WAAW,CAAC;AAC9B,aAAO;AAAA,IACX;AAGA,IAAAA,YAAW,UAAU,MAAM,WAAY;AACnC,UAAI,IAAI,IAAG;AACX,eAAS,IAAI,GAAG,IAAI,KAAK,GAAG,EAAE,GAAG;AAC7B,UAAE,CAAC,IAAI,KAAK,KAAK,CAAC,KAAK,CAAC;AAAA,MAC5B;AACA,QAAE,IAAI,KAAK;AACX,QAAE,IAAI,CAAC,KAAK;AACZ,aAAO;AAAA,IACX;AAGA,IAAAA,YAAW,UAAU,YAAY,SAAU,GAAG;AAC1C,UAAI,IAAI,IAAG;AACX,UAAI,IAAI,GAAG;AACP,aAAK,SAAS,CAAC,GAAG,CAAC;AAAA,MACvB,OACK;AACD,aAAK,SAAS,GAAG,CAAC;AAAA,MACtB;AACA,aAAO;AAAA,IACX;AAGA,IAAAA,YAAW,UAAU,aAAa,SAAU,GAAG;AAC3C,UAAI,IAAI,IAAG;AACX,UAAI,IAAI,GAAG;AACP,aAAK,SAAS,CAAC,GAAG,CAAC;AAAA,MACvB,OACK;AACD,aAAK,SAAS,GAAG,CAAC;AAAA,MACtB;AACA,aAAO;AAAA,IACX;AAGA,IAAAA,YAAW,UAAU,kBAAkB,WAAY;AAC/C,eAAS,IAAI,GAAG,IAAI,KAAK,GAAG,EAAE,GAAG;AAC7B,YAAI,KAAK,CAAC,KAAK,GAAG;AACd,iBAAO,IAAI,KAAK,KAAK,KAAK,KAAK,CAAC,CAAC;AAAA,QACrC;AAAA,MACJ;AACA,UAAI,KAAK,IAAI,GAAG;AACZ,eAAO,KAAK,IAAI,KAAK;AAAA,MACzB;AACA,aAAO;AAAA,IACX;AAGA,IAAAA,YAAW,UAAU,WAAW,WAAY;AACxC,UAAI,IAAI;AACR,UAAI,IAAI,KAAK,IAAI,KAAK;AACtB,eAAS,IAAI,GAAG,IAAI,KAAK,GAAG,EAAE,GAAG;AAC7B,aAAK,KAAK,KAAK,CAAC,IAAI,CAAC;AAAA,MACzB;AACA,aAAO;AAAA,IACX;AAGA,IAAAA,YAAW,UAAU,UAAU,SAAU,GAAG;AACxC,UAAI,IAAI,KAAK,MAAM,IAAI,KAAK,EAAE;AAC9B,UAAI,KAAK,KAAK,GAAG;AACb,eAAQ,KAAK,KAAK;AAAA,MACtB;AACA,cAAS,KAAK,CAAC,IAAK,KAAM,IAAI,KAAK,OAAS;AAAA,IAChD;AAGA,IAAAA,YAAW,UAAU,SAAS,SAAU,GAAG;AACvC,aAAO,KAAK,UAAU,GAAG,KAAK;AAAA,IAClC;AAGA,IAAAA,YAAW,UAAU,WAAW,SAAU,GAAG;AACzC,aAAO,KAAK,UAAU,GAAG,SAAS;AAAA,IACtC;AAGA,IAAAA,YAAW,UAAU,UAAU,SAAU,GAAG;AACxC,aAAO,KAAK,UAAU,GAAG,MAAM;AAAA,IACnC;AAGA,IAAAA,YAAW,UAAU,MAAM,SAAU,GAAG;AACpC,UAAI,IAAI,IAAG;AACX,WAAK,MAAM,GAAG,CAAC;AACf,aAAO;AAAA,IACX;AAGA,IAAAA,YAAW,UAAU,WAAW,SAAU,GAAG;AACzC,UAAI,IAAI,IAAG;AACX,WAAK,MAAM,GAAG,CAAC;AACf,aAAO;AAAA,IACX;AAGA,IAAAA,YAAW,UAAU,WAAW,SAAU,GAAG;AACzC,UAAI,IAAI,IAAG;AACX,WAAK,WAAW,GAAG,CAAC;AACpB,aAAO;AAAA,IACX;AAGA,IAAAA,YAAW,UAAU,SAAS,SAAU,GAAG;AACvC,UAAI,IAAI,IAAG;AACX,WAAK,SAAS,GAAG,GAAG,IAAI;AACxB,aAAO;AAAA,IACX;AAGA,IAAAA,YAAW,UAAU,YAAY,SAAU,GAAG;AAC1C,UAAI,IAAI,IAAG;AACX,WAAK,SAAS,GAAG,MAAM,CAAC;AACxB,aAAO;AAAA,IACX;AAGA,IAAAA,YAAW,UAAU,qBAAqB,SAAU,GAAG;AACnD,UAAI,IAAI,IAAG;AACX,UAAI,IAAI,IAAG;AACX,WAAK,SAAS,GAAG,GAAG,CAAC;AACrB,aAAO,CAAC,GAAG,CAAC;AAAA,IAChB;AAGA,IAAAA,YAAW,UAAU,SAAS,SAAU,GAAG,GAAG;AAC1C,UAAI,IAAI,EAAE,UAAS;AACnB,UAAI;AACJ,UAAI,IAAI,IAAI,CAAC;AACb,UAAI;AACJ,UAAI,KAAK,GAAG;AACR,eAAO;AAAA,MACX,WACS,IAAI,IAAI;AACb,YAAI;AAAA,MACR,WACS,IAAI,IAAI;AACb,YAAI;AAAA,MACR,WACS,IAAI,KAAK;AACd,YAAI;AAAA,MACR,WACS,IAAI,KAAK;AACd,YAAI;AAAA,MACR,OACK;AACD,YAAI;AAAA,MACR;AACA,UAAI,IAAI,GAAG;AACP,YAAI,IAAI,QAAQ,CAAC;AAAA,MACrB,WACS,EAAE,UAAU;AACjB,YAAI,IAAI,QAAQ,CAAC;AAAA,MACrB,OACK;AACD,YAAI,IAAI,WAAW,CAAC;AAAA,MACxB;AAEA,UAAI,IAAI,CAAA;AACR,UAAI,IAAI;AACR,UAAI,KAAK,IAAI;AACb,UAAI,MAAM,KAAK,KAAK;AACpB,QAAE,CAAC,IAAI,EAAE,QAAQ,IAAI;AACrB,UAAI,IAAI,GAAG;AACP,YAAI,KAAK,IAAG;AACZ,UAAE,MAAM,EAAE,CAAC,GAAG,EAAE;AAChB,eAAO,KAAK,IAAI;AACZ,YAAE,CAAC,IAAI,IAAG;AACV,YAAE,MAAM,IAAI,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;AAC1B,eAAK;AAAA,QACT;AAAA,MACJ;AACA,UAAI,IAAI,EAAE,IAAI;AACd,UAAI;AACJ,UAAI,MAAM;AACV,UAAI,KAAK,IAAG;AACZ,UAAI;AACJ,UAAI,MAAM,EAAE,CAAC,CAAC,IAAI;AAClB,aAAO,KAAK,GAAG;AACX,YAAI,KAAK,IAAI;AACT,cAAK,EAAE,CAAC,KAAM,IAAI,KAAO;AAAA,QAC7B,OACK;AACD,eAAK,EAAE,CAAC,KAAM,KAAM,IAAI,KAAM,MAAQ,KAAK;AAC3C,cAAI,IAAI,GAAG;AACP,iBAAK,EAAE,IAAI,CAAC,KAAM,KAAK,KAAK,IAAI;AAAA,UACpC;AAAA,QACJ;AACA,YAAI;AACJ,gBAAQ,IAAI,MAAM,GAAG;AACjB,gBAAM;AACN,YAAE;AAAA,QACN;AACA,aAAK,KAAK,KAAK,GAAG;AACd,eAAK,KAAK;AACV,YAAE;AAAA,QACN;AACA,YAAI,KAAK;AACL,YAAE,CAAC,EAAE,OAAO,CAAC;AACb,gBAAM;AAAA,QACV,OACK;AACD,iBAAO,IAAI,GAAG;AACV,cAAE,MAAM,GAAG,EAAE;AACb,cAAE,MAAM,IAAI,CAAC;AACb,iBAAK;AAAA,UACT;AACA,cAAI,IAAI,GAAG;AACP,cAAE,MAAM,GAAG,EAAE;AAAA,UACjB,OACK;AACD,gBAAI;AACJ,gBAAI;AACJ,iBAAK;AAAA,UACT;AACA,YAAE,MAAM,IAAI,EAAE,CAAC,GAAG,CAAC;AAAA,QACvB;AACA,eAAO,KAAK,MAAM,EAAE,CAAC,IAAK,KAAK,MAAO,GAAG;AACrC,YAAE,MAAM,GAAG,EAAE;AACb,cAAI;AACJ,cAAI;AACJ,eAAK;AACL,cAAI,EAAE,IAAI,GAAG;AACT,gBAAI,KAAK,KAAK;AACd,cAAE;AAAA,UACN;AAAA,QACJ;AAAA,MACJ;AACA,aAAO,EAAE,OAAO,CAAC;AAAA,IACrB;AAGA,IAAAA,YAAW,UAAU,aAAa,SAAU,GAAG;AAC3C,UAAI,KAAK,EAAE,OAAM;AACjB,UAAK,KAAK,OAAM,KAAM,MAAO,EAAE,OAAM,KAAM,GAAG;AAC1C,eAAOA,YAAW;AAAA,MACtB;AACA,UAAI,IAAI,EAAE,MAAK;AACf,UAAI,IAAI,KAAK,MAAK;AAClB,UAAI,IAAI,IAAI,CAAC;AACb,UAAI,IAAI,IAAI,CAAC;AACb,UAAI,IAAI,IAAI,CAAC;AACb,UAAI,IAAI,IAAI,CAAC;AACb,aAAO,EAAE,OAAM,KAAM,GAAG;AACpB,eAAO,EAAE,UAAU;AACf,YAAE,SAAS,GAAG,CAAC;AACf,cAAI,IAAI;AACJ,gBAAI,CAAC,EAAE,OAAM,KAAM,CAAC,EAAE,OAAM,GAAI;AAC5B,gBAAE,MAAM,MAAM,CAAC;AACf,gBAAE,MAAM,GAAG,CAAC;AAAA,YAChB;AACA,cAAE,SAAS,GAAG,CAAC;AAAA,UACnB,WACS,CAAC,EAAE,UAAU;AAClB,cAAE,MAAM,GAAG,CAAC;AAAA,UAChB;AACA,YAAE,SAAS,GAAG,CAAC;AAAA,QACnB;AACA,eAAO,EAAE,UAAU;AACf,YAAE,SAAS,GAAG,CAAC;AACf,cAAI,IAAI;AACJ,gBAAI,CAAC,EAAE,OAAM,KAAM,CAAC,EAAE,OAAM,GAAI;AAC5B,gBAAE,MAAM,MAAM,CAAC;AACf,gBAAE,MAAM,GAAG,CAAC;AAAA,YAChB;AACA,cAAE,SAAS,GAAG,CAAC;AAAA,UACnB,WACS,CAAC,EAAE,UAAU;AAClB,cAAE,MAAM,GAAG,CAAC;AAAA,UAChB;AACA,YAAE,SAAS,GAAG,CAAC;AAAA,QACnB;AACA,YAAI,EAAE,UAAU,CAAC,KAAK,GAAG;AACrB,YAAE,MAAM,GAAG,CAAC;AACZ,cAAI,IAAI;AACJ,cAAE,MAAM,GAAG,CAAC;AAAA,UAChB;AACA,YAAE,MAAM,GAAG,CAAC;AAAA,QAChB,OACK;AACD,YAAE,MAAM,GAAG,CAAC;AACZ,cAAI,IAAI;AACJ,cAAE,MAAM,GAAG,CAAC;AAAA,UAChB;AACA,YAAE,MAAM,GAAG,CAAC;AAAA,QAChB;AAAA,MACJ;AACA,UAAI,EAAE,UAAUA,YAAW,GAAG,KAAK,GAAG;AAClC,eAAOA,YAAW;AAAA,MACtB;AACA,UAAI,EAAE,UAAU,CAAC,KAAK,GAAG;AACrB,eAAO,EAAE,SAAS,CAAC;AAAA,MACvB;AACA,UAAI,EAAE,OAAM,IAAK,GAAG;AAChB,UAAE,MAAM,GAAG,CAAC;AAAA,MAChB,OACK;AACD,eAAO;AAAA,MACX;AACA,UAAI,EAAE,OAAM,IAAK,GAAG;AAChB,eAAO,EAAE,IAAI,CAAC;AAAA,MAClB,OACK;AACD,eAAO;AAAA,MACX;AAAA,IACJ;AAGA,IAAAA,YAAW,UAAU,MAAM,SAAU,GAAG;AACpC,aAAO,KAAK,IAAI,GAAG,IAAI,QAAO,CAAE;AAAA,IACpC;AAGA,IAAAA,YAAW,UAAU,MAAM,SAAU,GAAG;AACpC,UAAI,IAAK,KAAK,IAAI,IAAK,KAAK,OAAM,IAAK,KAAK,MAAK;AACjD,UAAI,IAAK,EAAE,IAAI,IAAK,EAAE,OAAM,IAAK,EAAE,MAAK;AACxC,UAAI,EAAE,UAAU,CAAC,IAAI,GAAG;AACpB,YAAI,IAAI;AACR,YAAI;AACJ,YAAI;AAAA,MACR;AACA,UAAI,IAAI,EAAE,gBAAe;AACzB,UAAI,IAAI,EAAE,gBAAe;AACzB,UAAI,IAAI,GAAG;AACP,eAAO;AAAA,MACX;AACA,UAAI,IAAI,GAAG;AACP,YAAI;AAAA,MACR;AACA,UAAI,IAAI,GAAG;AACP,UAAE,SAAS,GAAG,CAAC;AACf,UAAE,SAAS,GAAG,CAAC;AAAA,MACnB;AACA,aAAO,EAAE,OAAM,IAAK,GAAG;AACnB,aAAK,IAAI,EAAE,gBAAe,KAAM,GAAG;AAC/B,YAAE,SAAS,GAAG,CAAC;AAAA,QACnB;AACA,aAAK,IAAI,EAAE,gBAAe,KAAM,GAAG;AAC/B,YAAE,SAAS,GAAG,CAAC;AAAA,QACnB;AACA,YAAI,EAAE,UAAU,CAAC,KAAK,GAAG;AACrB,YAAE,MAAM,GAAG,CAAC;AACZ,YAAE,SAAS,GAAG,CAAC;AAAA,QACnB,OACK;AACD,YAAE,MAAM,GAAG,CAAC;AACZ,YAAE,SAAS,GAAG,CAAC;AAAA,QACnB;AAAA,MACJ;AACA,UAAI,IAAI,GAAG;AACP,UAAE,SAAS,GAAG,CAAC;AAAA,MACnB;AACA,aAAO;AAAA,IACX;AAGA,IAAAA,YAAW,UAAU,kBAAkB,SAAU,GAAG;AAChD,UAAI;AACJ,UAAI,IAAI,KAAK,IAAG;AAChB,UAAI,EAAE,KAAK,KAAK,EAAE,CAAC,KAAK,UAAU,UAAU,SAAS,CAAC,GAAG;AACrD,aAAK,IAAI,GAAG,IAAI,UAAU,QAAQ,EAAE,GAAG;AACnC,cAAI,EAAE,CAAC,KAAK,UAAU,CAAC,GAAG;AACtB,mBAAO;AAAA,UACX;AAAA,QACJ;AACA,eAAO;AAAA,MACX;AACA,UAAI,EAAE,UAAU;AACZ,eAAO;AAAA,MACX;AACA,UAAI;AACJ,aAAO,IAAI,UAAU,QAAQ;AACzB,YAAI,IAAI,UAAU,CAAC;AACnB,YAAI,IAAI,IAAI;AACZ,eAAO,IAAI,UAAU,UAAU,IAAI,OAAO;AACtC,eAAK,UAAU,GAAG;AAAA,QACtB;AACA,YAAI,EAAE,OAAO,CAAC;AACd,eAAO,IAAI,GAAG;AACV,cAAI,IAAI,UAAU,GAAG,KAAK,GAAG;AACzB,mBAAO;AAAA,UACX;AAAA,QACJ;AAAA,MACJ;AACA,aAAO,EAAE,YAAY,CAAC;AAAA,IAC1B;AAKA,IAAAA,YAAW,UAAU,SAAS,SAAU,GAAG;AACvC,eAAS,IAAI,KAAK,IAAI,GAAG,KAAK,GAAG,EAAE,GAAG;AAClC,UAAE,CAAC,IAAI,KAAK,CAAC;AAAA,MACjB;AACA,QAAE,IAAI,KAAK;AACX,QAAE,IAAI,KAAK;AAAA,IACf;AAGA,IAAAA,YAAW,UAAU,UAAU,SAAU,GAAG;AACxC,WAAK,IAAI;AACT,WAAK,IAAK,IAAI,IAAK,KAAK;AACxB,UAAI,IAAI,GAAG;AACP,aAAK,CAAC,IAAI;AAAA,MACd,WACS,IAAI,IAAI;AACb,aAAK,CAAC,IAAI,IAAI,KAAK;AAAA,MACvB,OACK;AACD,aAAK,IAAI;AAAA,MACb;AAAA,IACJ;AAGA,IAAAA,YAAW,UAAU,aAAa,SAAU,GAAG,GAAG;AAC9C,UAAI;AACJ,UAAI,KAAK,IAAI;AACT,YAAI;AAAA,MACR,WACS,KAAK,GAAG;AACb,YAAI;AAAA,MACR,WACS,KAAK,KAAK;AACf,YAAI;AAAA,MAER,WACS,KAAK,GAAG;AACb,YAAI;AAAA,MACR,WACS,KAAK,IAAI;AACd,YAAI;AAAA,MACR,WACS,KAAK,GAAG;AACb,YAAI;AAAA,MACR,OACK;AACD,aAAK,UAAU,GAAG,CAAC;AACnB;AAAA,MACJ;AACA,WAAK,IAAI;AACT,WAAK,IAAI;AACT,UAAI,IAAI,EAAE;AACV,UAAI,KAAK;AACT,UAAI,KAAK;AACT,aAAO,EAAE,KAAK,GAAG;AACb,YAAI,IAAK,KAAK,IAAM,CAAC,EAAE,CAAC,IAAK,MAAO,MAAM,GAAG,CAAC;AAC9C,YAAI,IAAI,GAAG;AACP,cAAI,EAAE,OAAO,CAAC,KAAK,KAAK;AACpB,iBAAK;AAAA,UACT;AACA;AAAA,QACJ;AACA,aAAK;AACL,YAAI,MAAM,GAAG;AACT,eAAK,KAAK,GAAG,IAAI;AAAA,QACrB,WACS,KAAK,IAAI,KAAK,IAAI;AACvB,eAAK,KAAK,IAAI,CAAC,MAAM,KAAM,KAAM,KAAK,KAAK,MAAO,MAAO;AACzD,eAAK,KAAK,GAAG,IAAK,KAAM,KAAK,KAAK;AAAA,QACtC,OACK;AACD,eAAK,KAAK,IAAI,CAAC,KAAK,KAAK;AAAA,QAC7B;AACA,cAAM;AACN,YAAI,MAAM,KAAK,IAAI;AACf,gBAAM,KAAK;AAAA,QACf;AAAA,MACJ;AACA,UAAI,KAAK,MAAO,CAAC,EAAE,CAAC,IAAK,QAAS,GAAG;AACjC,aAAK,IAAI;AACT,YAAI,KAAK,GAAG;AACR,eAAK,KAAK,IAAI,CAAC,MAAO,KAAM,KAAK,KAAK,MAAO,KAAM;AAAA,QACvD;AAAA,MACJ;AACA,WAAK,MAAK;AACV,UAAI,IAAI;AACJ,QAAAA,YAAW,KAAK,MAAM,MAAM,IAAI;AAAA,MACpC;AAAA,IACJ;AAGA,IAAAA,YAAW,UAAU,QAAQ,WAAY;AACrC,UAAI,IAAI,KAAK,IAAI,KAAK;AACtB,aAAO,KAAK,IAAI,KAAK,KAAK,KAAK,IAAI,CAAC,KAAK,GAAG;AACxC,UAAE,KAAK;AAAA,MACX;AAAA,IACJ;AAGA,IAAAA,YAAW,UAAU,YAAY,SAAU,GAAG,GAAG;AAC7C,UAAI;AACJ,WAAK,IAAI,KAAK,IAAI,GAAG,KAAK,GAAG,EAAE,GAAG;AAC9B,UAAE,IAAI,CAAC,IAAI,KAAK,CAAC;AAAA,MACrB;AACA,WAAK,IAAI,IAAI,GAAG,KAAK,GAAG,EAAE,GAAG;AACzB,UAAE,CAAC,IAAI;AAAA,MACX;AACA,QAAE,IAAI,KAAK,IAAI;AACf,QAAE,IAAI,KAAK;AAAA,IACf;AAGA,IAAAA,YAAW,UAAU,YAAY,SAAU,GAAG,GAAG;AAC7C,eAAS,IAAI,GAAG,IAAI,KAAK,GAAG,EAAE,GAAG;AAC7B,UAAE,IAAI,CAAC,IAAI,KAAK,CAAC;AAAA,MACrB;AACA,QAAE,IAAI,KAAK,IAAI,KAAK,IAAI,GAAG,CAAC;AAC5B,QAAE,IAAI,KAAK;AAAA,IACf;AAGA,IAAAA,YAAW,UAAU,WAAW,SAAU,GAAG,GAAG;AAC5C,UAAI,KAAK,IAAI,KAAK;AAClB,UAAI,MAAM,KAAK,KAAK;AACpB,UAAI,MAAM,KAAK,OAAO;AACtB,UAAI,KAAK,KAAK,MAAM,IAAI,KAAK,EAAE;AAC/B,UAAI,IAAK,KAAK,KAAK,KAAM,KAAK;AAC9B,eAAS,IAAI,KAAK,IAAI,GAAG,KAAK,GAAG,EAAE,GAAG;AAClC,UAAE,IAAI,KAAK,CAAC,IAAK,KAAK,CAAC,KAAK,MAAO;AACnC,aAAK,KAAK,CAAC,IAAI,OAAO;AAAA,MAC1B;AACA,eAAS,IAAI,KAAK,GAAG,KAAK,GAAG,EAAE,GAAG;AAC9B,UAAE,CAAC,IAAI;AAAA,MACX;AACA,QAAE,EAAE,IAAI;AACR,QAAE,IAAI,KAAK,IAAI,KAAK;AACpB,QAAE,IAAI,KAAK;AACX,QAAE,MAAK;AAAA,IACX;AAGA,IAAAA,YAAW,UAAU,WAAW,SAAU,GAAG,GAAG;AAC5C,QAAE,IAAI,KAAK;AACX,UAAI,KAAK,KAAK,MAAM,IAAI,KAAK,EAAE;AAC/B,UAAI,MAAM,KAAK,GAAG;AACd,UAAE,IAAI;AACN;AAAA,MACJ;AACA,UAAI,KAAK,IAAI,KAAK;AAClB,UAAI,MAAM,KAAK,KAAK;AACpB,UAAI,MAAM,KAAK,MAAM;AACrB,QAAE,CAAC,IAAI,KAAK,EAAE,KAAK;AACnB,eAAS,IAAI,KAAK,GAAG,IAAI,KAAK,GAAG,EAAE,GAAG;AAClC,UAAE,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,OAAO;AACnC,UAAE,IAAI,EAAE,IAAI,KAAK,CAAC,KAAK;AAAA,MAC3B;AACA,UAAI,KAAK,GAAG;AACR,UAAE,KAAK,IAAI,KAAK,CAAC,MAAM,KAAK,IAAI,OAAO;AAAA,MAC3C;AACA,QAAE,IAAI,KAAK,IAAI;AACf,QAAE,MAAK;AAAA,IACX;AAGA,IAAAA,YAAW,UAAU,QAAQ,SAAU,GAAG,GAAG;AACzC,UAAI,IAAI;AACR,UAAI,IAAI;AACR,UAAI,IAAI,KAAK,IAAI,EAAE,GAAG,KAAK,CAAC;AAC5B,aAAO,IAAI,GAAG;AACV,aAAK,KAAK,CAAC,IAAI,EAAE,CAAC;AAClB,UAAE,GAAG,IAAI,IAAI,KAAK;AAClB,cAAM,KAAK;AAAA,MACf;AACA,UAAI,EAAE,IAAI,KAAK,GAAG;AACd,aAAK,EAAE;AACP,eAAO,IAAI,KAAK,GAAG;AACf,eAAK,KAAK,CAAC;AACX,YAAE,GAAG,IAAI,IAAI,KAAK;AAClB,gBAAM,KAAK;AAAA,QACf;AACA,aAAK,KAAK;AAAA,MACd,OACK;AACD,aAAK,KAAK;AACV,eAAO,IAAI,EAAE,GAAG;AACZ,eAAK,EAAE,CAAC;AACR,YAAE,GAAG,IAAI,IAAI,KAAK;AAClB,gBAAM,KAAK;AAAA,QACf;AACA,aAAK,EAAE;AAAA,MACX;AACA,QAAE,IAAK,IAAI,IAAK,KAAK;AACrB,UAAI,IAAI,IAAI;AACR,UAAE,GAAG,IAAI,KAAK,KAAK;AAAA,MACvB,WACS,IAAI,GAAG;AACZ,UAAE,GAAG,IAAI;AAAA,MACb;AACA,QAAE,IAAI;AACN,QAAE,MAAK;AAAA,IACX;AAIA,IAAAA,YAAW,UAAU,aAAa,SAAU,GAAG,GAAG;AAC9C,UAAI,IAAI,KAAK,IAAG;AAChB,UAAI,IAAI,EAAE,IAAG;AACb,UAAI,IAAI,EAAE;AACV,QAAE,IAAI,IAAI,EAAE;AACZ,aAAO,EAAE,KAAK,GAAG;AACb,UAAE,CAAC,IAAI;AAAA,MACX;AACA,WAAK,IAAI,GAAG,IAAI,EAAE,GAAG,EAAE,GAAG;AACtB,UAAE,IAAI,EAAE,CAAC,IAAI,EAAE,GAAG,GAAG,EAAE,CAAC,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC;AAAA,MAC3C;AACA,QAAE,IAAI;AACN,QAAE,MAAK;AACP,UAAI,KAAK,KAAK,EAAE,GAAG;AACf,QAAAA,YAAW,KAAK,MAAM,GAAG,CAAC;AAAA,MAC9B;AAAA,IACJ;AAGA,IAAAA,YAAW,UAAU,WAAW,SAAU,GAAG;AACzC,UAAI,IAAI,KAAK,IAAG;AAChB,UAAI,IAAI,EAAE,IAAI,IAAI,EAAE;AACpB,aAAO,EAAE,KAAK,GAAG;AACb,UAAE,CAAC,IAAI;AAAA,MACX;AACA,WAAK,IAAI,GAAG,IAAI,EAAE,IAAI,GAAG,EAAE,GAAG;AAC1B,YAAI,IAAI,EAAE,GAAG,GAAG,EAAE,CAAC,GAAG,GAAG,IAAI,GAAG,GAAG,CAAC;AACpC,aAAK,EAAE,IAAI,EAAE,CAAC,KAAK,EAAE,GAAG,IAAI,GAAG,IAAI,EAAE,CAAC,GAAG,GAAG,IAAI,IAAI,GAAG,GAAG,EAAE,IAAI,IAAI,CAAC,MAAM,EAAE,IAAI;AAC7E,YAAE,IAAI,EAAE,CAAC,KAAK,EAAE;AAChB,YAAE,IAAI,EAAE,IAAI,CAAC,IAAI;AAAA,QACrB;AAAA,MACJ;AACA,UAAI,EAAE,IAAI,GAAG;AACT,UAAE,EAAE,IAAI,CAAC,KAAK,EAAE,GAAG,GAAG,EAAE,CAAC,GAAG,GAAG,IAAI,GAAG,GAAG,CAAC;AAAA,MAC9C;AACA,QAAE,IAAI;AACN,QAAE,MAAK;AAAA,IACX;AAIA,IAAAA,YAAW,UAAU,WAAW,SAAU,GAAG,GAAG,GAAG;AAC/C,UAAI,KAAK,EAAE,IAAG;AACd,UAAI,GAAG,KAAK,GAAG;AACX;AAAA,MACJ;AACA,UAAI,KAAK,KAAK,IAAG;AACjB,UAAI,GAAG,IAAI,GAAG,GAAG;AACb,YAAI,KAAK,MAAM;AACX,YAAE,QAAQ,CAAC;AAAA,QACf;AACA,YAAI,KAAK,MAAM;AACX,eAAK,OAAO,CAAC;AAAA,QACjB;AACA;AAAA,MACJ;AACA,UAAI,KAAK,MAAM;AACX,YAAI,IAAG;AAAA,MACX;AACA,UAAI,IAAI,IAAG;AACX,UAAI,KAAK,KAAK;AACd,UAAI,KAAK,EAAE;AACX,UAAI,MAAM,KAAK,KAAK,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC;AACtC,UAAI,MAAM,GAAG;AACT,WAAG,SAAS,KAAK,CAAC;AAClB,WAAG,SAAS,KAAK,CAAC;AAAA,MACtB,OACK;AACD,WAAG,OAAO,CAAC;AACX,WAAG,OAAO,CAAC;AAAA,MACf;AACA,UAAI,KAAK,EAAE;AACX,UAAI,KAAK,EAAE,KAAK,CAAC;AACjB,UAAI,MAAM,GAAG;AACT;AAAA,MACJ;AACA,UAAI,KAAK,MAAM,KAAK,KAAK,OAAQ,KAAK,IAAK,EAAE,KAAK,CAAC,KAAK,KAAK,KAAK;AAClE,UAAI,KAAK,KAAK,KAAK;AACnB,UAAI,MAAM,KAAK,KAAK,MAAM;AAC1B,UAAI,IAAI,KAAK,KAAK;AAClB,UAAI,IAAI,EAAE;AACV,UAAI,IAAI,IAAI;AACZ,UAAI,IAAK,KAAK,OAAQ,IAAG,IAAK;AAC9B,QAAE,UAAU,GAAG,CAAC;AAChB,UAAI,EAAE,UAAU,CAAC,KAAK,GAAG;AACrB,UAAE,EAAE,GAAG,IAAI;AACX,UAAE,MAAM,GAAG,CAAC;AAAA,MAChB;AACA,MAAAA,YAAW,IAAI,UAAU,IAAI,CAAC;AAC9B,QAAE,MAAM,GAAG,CAAC;AACZ,aAAO,EAAE,IAAI,IAAI;AACb,UAAE,EAAE,GAAG,IAAI;AAAA,MACf;AACA,aAAO,EAAE,KAAK,GAAG;AAEb,YAAI,KAAM,EAAE,EAAE,CAAC,KAAK,KAAM,KAAK,KAAK,KAAK,MAAM,EAAE,CAAC,IAAI,MAAM,EAAE,IAAI,CAAC,IAAI,KAAK,EAAE;AAC9E,aAAK,EAAE,CAAC,KAAK,EAAE,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,EAAE,KAAK,IAAI;AACzC,YAAE,UAAU,GAAG,CAAC;AAChB,YAAE,MAAM,GAAG,CAAC;AACZ,iBAAO,EAAE,CAAC,IAAI,EAAE,IAAI;AAChB,cAAE,MAAM,GAAG,CAAC;AAAA,UAChB;AAAA,QACJ;AAAA,MACJ;AACA,UAAI,KAAK,MAAM;AACX,UAAE,UAAU,IAAI,CAAC;AACjB,YAAI,MAAM,IAAI;AACV,UAAAA,YAAW,KAAK,MAAM,GAAG,CAAC;AAAA,QAC9B;AAAA,MACJ;AACA,QAAE,IAAI;AACN,QAAE,MAAK;AACP,UAAI,MAAM,GAAG;AACT,UAAE,SAAS,KAAK,CAAC;AAAA,MACrB;AACA,UAAI,KAAK,GAAG;AACR,QAAAA,YAAW,KAAK,MAAM,GAAG,CAAC;AAAA,MAC9B;AAAA,IACJ;AAYA,IAAAA,YAAW,UAAU,WAAW,WAAY;AACxC,UAAI,KAAK,IAAI,GAAG;AACZ,eAAO;AAAA,MACX;AACA,UAAI,IAAI,KAAK,CAAC;AACd,WAAK,IAAI,MAAM,GAAG;AACd,eAAO;AAAA,MACX;AACA,UAAI,IAAI,IAAI;AACZ,UAAK,KAAK,KAAK,IAAI,MAAO,KAAM;AAChC,UAAK,KAAK,KAAK,IAAI,OAAQ,KAAM;AACjC,UAAK,KAAK,MAAO,IAAI,SAAU,IAAK,UAAY;AAGhD,UAAK,KAAK,IAAI,IAAI,IAAI,KAAK,MAAO,KAAK;AAEvC,aAAQ,IAAI,IAAK,KAAK,KAAK,IAAI,CAAC;AAAA,IACpC;AAGA,IAAAA,YAAW,UAAU,SAAS,WAAY;AACtC,cAAS,KAAK,IAAI,IAAM,KAAK,CAAC,IAAI,IAAK,KAAK,MAAM;AAAA,IACtD;AAGA,IAAAA,YAAW,UAAU,MAAM,SAAU,GAAG,GAAG;AACvC,UAAI,IAAI,cAAc,IAAI,GAAG;AACzB,eAAOA,YAAW;AAAA,MACtB;AACA,UAAI,IAAI,IAAG;AACX,UAAI,KAAK,IAAG;AACZ,UAAI,IAAI,EAAE,QAAQ,IAAI;AACtB,UAAI,IAAI,MAAM,CAAC,IAAI;AACnB,QAAE,OAAO,CAAC;AACV,aAAO,EAAE,KAAK,GAAG;AACb,UAAE,MAAM,GAAG,EAAE;AACb,aAAK,IAAK,KAAK,KAAM,GAAG;AACpB,YAAE,MAAM,IAAI,GAAG,CAAC;AAAA,QACpB,OACK;AACD,cAAI,IAAI;AACR,cAAI;AACJ,eAAK;AAAA,QACT;AAAA,MACJ;AACA,aAAO,EAAE,OAAO,CAAC;AAAA,IACrB;AAGA,IAAAA,YAAW,UAAU,YAAY,SAAU,GAAG;AAC1C,aAAO,KAAK,MAAM,KAAK,MAAM,KAAK,KAAK,KAAK,IAAI,CAAC,CAAC;AAAA,IACtD;AAGA,IAAAA,YAAW,UAAU,UAAU,SAAU,GAAG;AACxC,UAAI,KAAK,MAAM;AACX,YAAI;AAAA,MACR;AACA,UAAI,KAAK,YAAY,KAAK,IAAI,KAAK,IAAI,IAAI;AACvC,eAAO;AAAA,MACX;AACA,UAAI,KAAK,KAAK,UAAU,CAAC;AACzB,UAAI,IAAI,KAAK,IAAI,GAAG,EAAE;AACtB,UAAI,IAAI,IAAI,CAAC;AACb,UAAI,IAAI,IAAG;AACX,UAAI,IAAI,IAAG;AACX,UAAI,IAAI;AACR,WAAK,SAAS,GAAG,GAAG,CAAC;AACrB,aAAO,EAAE,OAAM,IAAK,GAAG;AACnB,aAAK,IAAI,EAAE,SAAQ,GAAI,SAAS,CAAC,EAAE,UAAU,CAAC,IAAI;AAClD,UAAE,SAAS,GAAG,GAAG,CAAC;AAAA,MACtB;AACA,aAAO,EAAE,SAAQ,EAAG,SAAS,CAAC,IAAI;AAAA,IACtC;AAGA,IAAAA,YAAW,UAAU,YAAY,SAAU,GAAG,GAAG;AAC7C,WAAK,QAAQ,CAAC;AACd,UAAI,KAAK,MAAM;AACX,YAAI;AAAA,MACR;AACA,UAAI,KAAK,KAAK,UAAU,CAAC;AACzB,UAAI,IAAI,KAAK,IAAI,GAAG,EAAE;AACtB,UAAI,KAAK;AACT,UAAI,IAAI;AACR,UAAI,IAAI;AACR,eAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,EAAE,GAAG;AAC/B,YAAI,IAAI,MAAM,GAAG,CAAC;AAClB,YAAI,IAAI,GAAG;AACP,cAAI,EAAE,OAAO,CAAC,KAAK,OAAO,KAAK,OAAM,KAAM,GAAG;AAC1C,iBAAK;AAAA,UACT;AACA;AAAA,QACJ;AACA,YAAI,IAAI,IAAI;AACZ,YAAI,EAAE,KAAK,IAAI;AACX,eAAK,UAAU,CAAC;AAChB,eAAK,WAAW,GAAG,CAAC;AACpB,cAAI;AACJ,cAAI;AAAA,QACR;AAAA,MACJ;AACA,UAAI,IAAI,GAAG;AACP,aAAK,UAAU,KAAK,IAAI,GAAG,CAAC,CAAC;AAC7B,aAAK,WAAW,GAAG,CAAC;AAAA,MACxB;AACA,UAAI,IAAI;AACJ,QAAAA,YAAW,KAAK,MAAM,MAAM,IAAI;AAAA,MACpC;AAAA,IACJ;AAGA,IAAAA,YAAW,UAAU,aAAa,SAAU,GAAG,GAAG,GAAG;AACjD,UAAI,YAAY,OAAO,GAAG;AAEtB,YAAI,IAAI,GAAG;AACP,eAAK,QAAQ,CAAC;AAAA,QAClB,OACK;AACD,eAAK,WAAW,GAAG,CAAC;AACpB,cAAI,CAAC,KAAK,QAAQ,IAAI,CAAC,GAAG;AAEtB,iBAAK,UAAUA,YAAW,IAAI,UAAU,IAAI,CAAC,GAAG,OAAO,IAAI;AAAA,UAC/D;AACA,cAAI,KAAK,UAAU;AACf,iBAAK,WAAW,GAAG,CAAC;AAAA,UACxB;AACA,iBAAO,CAAC,KAAK,gBAAgB,CAAC,GAAG;AAC7B,iBAAK,WAAW,GAAG,CAAC;AACpB,gBAAI,KAAK,UAAS,IAAK,GAAG;AACtB,mBAAK,MAAMA,YAAW,IAAI,UAAU,IAAI,CAAC,GAAG,IAAI;AAAA,YACpD;AAAA,UACJ;AAAA,QACJ;AAAA,MACJ,OACK;AAED,YAAI,IAAI,CAAA;AACR,YAAI,IAAI,IAAI;AACZ,UAAE,UAAU,KAAK,KAAK;AACtB,UAAE,UAAU,CAAC;AACb,YAAI,IAAI,GAAG;AACP,YAAE,CAAC,MAAO,KAAK,KAAK;AAAA,QACxB,OACK;AACD,YAAE,CAAC,IAAI;AAAA,QACX;AACA,aAAK,WAAW,GAAG,GAAG;AAAA,MAC1B;AAAA,IACJ;AAGA,IAAAA,YAAW,UAAU,YAAY,SAAU,GAAG,IAAI,GAAG;AACjD,UAAI;AACJ,UAAI;AACJ,UAAI,IAAI,KAAK,IAAI,EAAE,GAAG,KAAK,CAAC;AAC5B,WAAK,IAAI,GAAG,IAAI,GAAG,EAAE,GAAG;AACpB,UAAE,CAAC,IAAI,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC;AAAA,MAC3B;AACA,UAAI,EAAE,IAAI,KAAK,GAAG;AACd,YAAI,EAAE,IAAI,KAAK;AACf,aAAK,IAAI,GAAG,IAAI,KAAK,GAAG,EAAE,GAAG;AACzB,YAAE,CAAC,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC;AAAA,QACxB;AACA,UAAE,IAAI,KAAK;AAAA,MACf,OACK;AACD,YAAI,KAAK,IAAI,KAAK;AAClB,aAAK,IAAI,GAAG,IAAI,EAAE,GAAG,EAAE,GAAG;AACtB,YAAE,CAAC,IAAI,GAAG,GAAG,EAAE,CAAC,CAAC;AAAA,QACrB;AACA,UAAE,IAAI,EAAE;AAAA,MACZ;AACA,QAAE,IAAI,GAAG,KAAK,GAAG,EAAE,CAAC;AACpB,QAAE,MAAK;AAAA,IACX;AAGA,IAAAA,YAAW,UAAU,YAAY,SAAU,GAAG,IAAI;AAC9C,UAAI,IAAIA,YAAW,IAAI,UAAU,CAAC;AAClC,WAAK,UAAU,GAAG,IAAI,CAAC;AACvB,aAAO;AAAA,IACX;AAGA,IAAAA,YAAW,UAAU,QAAQ,SAAU,GAAG,GAAG;AACzC,UAAI,IAAI;AACR,UAAI,IAAI;AACR,UAAI,IAAI,KAAK,IAAI,EAAE,GAAG,KAAK,CAAC;AAC5B,aAAO,IAAI,GAAG;AACV,aAAK,KAAK,CAAC,IAAI,EAAE,CAAC;AAClB,UAAE,GAAG,IAAI,IAAI,KAAK;AAClB,cAAM,KAAK;AAAA,MACf;AACA,UAAI,EAAE,IAAI,KAAK,GAAG;AACd,aAAK,EAAE;AACP,eAAO,IAAI,KAAK,GAAG;AACf,eAAK,KAAK,CAAC;AACX,YAAE,GAAG,IAAI,IAAI,KAAK;AAClB,gBAAM,KAAK;AAAA,QACf;AACA,aAAK,KAAK;AAAA,MACd,OACK;AACD,aAAK,KAAK;AACV,eAAO,IAAI,EAAE,GAAG;AACZ,eAAK,EAAE,CAAC;AACR,YAAE,GAAG,IAAI,IAAI,KAAK;AAClB,gBAAM,KAAK;AAAA,QACf;AACA,aAAK,EAAE;AAAA,MACX;AACA,QAAE,IAAK,IAAI,IAAK,KAAK;AACrB,UAAI,IAAI,GAAG;AACP,UAAE,GAAG,IAAI;AAAA,MACb,WACS,IAAI,IAAI;AACb,UAAE,GAAG,IAAI,KAAK,KAAK;AAAA,MACvB;AACA,QAAE,IAAI;AACN,QAAE,MAAK;AAAA,IACX;AAGA,IAAAA,YAAW,UAAU,YAAY,SAAU,GAAG;AAC1C,WAAK,KAAK,CAAC,IAAI,KAAK,GAAG,GAAG,IAAI,GAAG,MAAM,GAAG,GAAG,KAAK,CAAC;AACnD,QAAE,KAAK;AACP,WAAK,MAAK;AAAA,IACd;AAGA,IAAAA,YAAW,UAAU,aAAa,SAAU,GAAG,GAAG;AAC9C,UAAI,KAAK,GAAG;AACR;AAAA,MACJ;AACA,aAAO,KAAK,KAAK,GAAG;AAChB,aAAK,KAAK,GAAG,IAAI;AAAA,MACrB;AACA,WAAK,CAAC,KAAK;AACX,aAAO,KAAK,CAAC,KAAK,KAAK,IAAI;AACvB,aAAK,CAAC,KAAK,KAAK;AAChB,YAAI,EAAE,KAAK,KAAK,GAAG;AACf,eAAK,KAAK,GAAG,IAAI;AAAA,QACrB;AACA,UAAE,KAAK,CAAC;AAAA,MACZ;AAAA,IACJ;AAIA,IAAAA,YAAW,UAAU,kBAAkB,SAAU,GAAG,GAAG,GAAG;AACtD,UAAI,IAAI,KAAK,IAAI,KAAK,IAAI,EAAE,GAAG,CAAC;AAChC,QAAE,IAAI;AACN,QAAE,IAAI;AACN,aAAO,IAAI,GAAG;AACV,UAAE,EAAE,CAAC,IAAI;AAAA,MACb;AACA,eAAS,IAAI,EAAE,IAAI,KAAK,GAAG,IAAI,GAAG,EAAE,GAAG;AACnC,UAAE,IAAI,KAAK,CAAC,IAAI,KAAK,GAAG,GAAG,EAAE,CAAC,GAAG,GAAG,GAAG,GAAG,KAAK,CAAC;AAAA,MACpD;AACA,eAAS,IAAI,KAAK,IAAI,EAAE,GAAG,CAAC,GAAG,IAAI,GAAG,EAAE,GAAG;AACvC,aAAK,GAAG,GAAG,EAAE,CAAC,GAAG,GAAG,GAAG,GAAG,IAAI,CAAC;AAAA,MACnC;AACA,QAAE,MAAK;AAAA,IACX;AAIA,IAAAA,YAAW,UAAU,kBAAkB,SAAU,GAAG,GAAG,GAAG;AACtD,QAAE;AACF,UAAI,IAAI,EAAE,IAAI,KAAK,IAAI,EAAE,IAAI;AAC7B,QAAE,IAAI;AACN,aAAO,EAAE,KAAK,GAAG;AACb,UAAE,CAAC,IAAI;AAAA,MACX;AACA,WAAK,IAAI,KAAK,IAAI,IAAI,KAAK,GAAG,CAAC,GAAG,IAAI,EAAE,GAAG,EAAE,GAAG;AAC5C,UAAE,KAAK,IAAI,IAAI,CAAC,IAAI,KAAK,GAAG,IAAI,GAAG,EAAE,CAAC,GAAG,GAAG,GAAG,GAAG,KAAK,IAAI,IAAI,CAAC;AAAA,MACpE;AACA,QAAE,MAAK;AACP,QAAE,UAAU,GAAG,CAAC;AAAA,IACpB;AAGA,IAAAA,YAAW,UAAU,SAAS,SAAU,GAAG;AACvC,UAAI,KAAK,GAAG;AACR,eAAO;AAAA,MACX;AACA,UAAI,IAAI,KAAK,KAAK;AAClB,UAAI,IAAK,KAAK,IAAI,IAAK,IAAI,IAAI;AAC/B,UAAI,KAAK,IAAI,GAAG;AACZ,YAAI,KAAK,GAAG;AACR,cAAI,KAAK,CAAC,IAAI;AAAA,QAClB,OACK;AACD,mBAAS,IAAI,KAAK,IAAI,GAAG,KAAK,GAAG,EAAE,GAAG;AAClC,iBAAK,IAAI,IAAI,KAAK,CAAC,KAAK;AAAA,UAC5B;AAAA,QACJ;AAAA,MACJ;AACA,aAAO;AAAA,IACX;AAGA,IAAAA,YAAW,UAAU,cAAc,SAAU,GAAG;AAC5C,UAAI,KAAK,KAAK,SAASA,YAAW,GAAG;AACrC,UAAI,IAAI,GAAG,gBAAe;AAC1B,UAAI,KAAK,GAAG;AACR,eAAO;AAAA,MACX;AACA,UAAI,IAAI,GAAG,WAAW,CAAC;AACvB,UAAK,IAAI,KAAM;AACf,UAAI,IAAI,UAAU,QAAQ;AACtB,YAAI,UAAU;AAAA,MAClB;AACA,UAAI,IAAI,IAAG;AACX,eAAS,IAAI,GAAG,IAAI,GAAG,EAAE,GAAG;AAExB,UAAE,QAAQ,UAAU,KAAK,MAAM,KAAK,WAAW,UAAU,MAAM,CAAC,CAAC;AACjE,YAAI,IAAI,EAAE,OAAO,GAAG,IAAI;AACxB,YAAI,EAAE,UAAUA,YAAW,GAAG,KAAK,KAAK,EAAE,UAAU,EAAE,KAAK,GAAG;AAC1D,cAAI,IAAI;AACR,iBAAO,MAAM,KAAK,EAAE,UAAU,EAAE,KAAK,GAAG;AACpC,gBAAI,EAAE,UAAU,GAAG,IAAI;AACvB,gBAAI,EAAE,UAAUA,YAAW,GAAG,KAAK,GAAG;AAClC,qBAAO;AAAA,YACX;AAAA,UACJ;AACA,cAAI,EAAE,UAAU,EAAE,KAAK,GAAG;AACtB,mBAAO;AAAA,UACX;AAAA,QACJ;AAAA,MACJ;AACA,aAAO;AAAA,IACX;AAGA,IAAAA,YAAW,UAAU,SAAS,WAAY;AACtC,UAAI,IAAI,IAAG;AACX,WAAK,SAAS,CAAC;AACf,aAAO;AAAA,IACX;AAGA,IAAAA,YAAW,UAAU,OAAO,SAAU,GAAG,UAAU;AAC/C,UAAI,IAAK,KAAK,IAAI,IAAK,KAAK,OAAM,IAAK,KAAK,MAAK;AACjD,UAAI,IAAK,EAAE,IAAI,IAAK,EAAE,OAAM,IAAK,EAAE,MAAK;AACxC,UAAI,EAAE,UAAU,CAAC,IAAI,GAAG;AACpB,YAAI,IAAI;AACR,YAAI;AACJ,YAAI;AAAA,MACR;AACA,UAAI,IAAI,EAAE,gBAAe;AACzB,UAAI,IAAI,EAAE,gBAAe;AACzB,UAAI,IAAI,GAAG;AACP,iBAAS,CAAC;AACV;AAAA,MACJ;AACA,UAAI,IAAI,GAAG;AACP,YAAI;AAAA,MACR;AACA,UAAI,IAAI,GAAG;AACP,UAAE,SAAS,GAAG,CAAC;AACf,UAAE,SAAS,GAAG,CAAC;AAAA,MACnB;AAEA,UAAI,QAAQ,WAAY;AACpB,aAAK,IAAI,EAAE,gBAAe,KAAM,GAAG;AAC/B,YAAE,SAAS,GAAG,CAAC;AAAA,QACnB;AACA,aAAK,IAAI,EAAE,gBAAe,KAAM,GAAG;AAC/B,YAAE,SAAS,GAAG,CAAC;AAAA,QACnB;AACA,YAAI,EAAE,UAAU,CAAC,KAAK,GAAG;AACrB,YAAE,MAAM,GAAG,CAAC;AACZ,YAAE,SAAS,GAAG,CAAC;AAAA,QACnB,OACK;AACD,YAAE,MAAM,GAAG,CAAC;AACZ,YAAE,SAAS,GAAG,CAAC;AAAA,QACnB;AACA,YAAI,EAAE,EAAE,OAAM,IAAK,IAAI;AACnB,cAAI,IAAI,GAAG;AACP,cAAE,SAAS,GAAG,CAAC;AAAA,UACnB;AACA,qBAAW,WAAY;AAAE,qBAAS,CAAC;AAAA,UAAG,GAAG,CAAC;AAAA,QAC9C,OACK;AACD,qBAAW,OAAO,CAAC;AAAA,QACvB;AAAA,MACJ;AACA,iBAAW,OAAO,EAAE;AAAA,IACxB;AAEA,IAAAA,YAAW,UAAU,kBAAkB,SAAU,GAAG,GAAG,GAAG,UAAU;AAChE,UAAI,YAAY,OAAO,GAAG;AACtB,YAAI,IAAI,GAAG;AACP,eAAK,QAAQ,CAAC;AAAA,QAClB,OACK;AACD,eAAK,WAAW,GAAG,CAAC;AACpB,cAAI,CAAC,KAAK,QAAQ,IAAI,CAAC,GAAG;AACtB,iBAAK,UAAUA,YAAW,IAAI,UAAU,IAAI,CAAC,GAAG,OAAO,IAAI;AAAA,UAC/D;AACA,cAAI,KAAK,UAAU;AACf,iBAAK,WAAW,GAAG,CAAC;AAAA,UACxB;AACA,cAAI,QAAQ;AACZ,cAAI,WAAW,WAAY;AACvB,kBAAM,WAAW,GAAG,CAAC;AACrB,gBAAI,MAAM,UAAS,IAAK,GAAG;AACvB,oBAAM,MAAMA,YAAW,IAAI,UAAU,IAAI,CAAC,GAAG,KAAK;AAAA,YACtD;AACA,gBAAI,MAAM,gBAAgB,CAAC,GAAG;AAC1B,yBAAW,WAAY;AAAE,yBAAQ;AAAA,cAAI,GAAG,CAAC;AAAA,YAC7C,OACK;AACD,yBAAW,UAAU,CAAC;AAAA,YAC1B;AAAA,UACJ;AACA,qBAAW,UAAU,CAAC;AAAA,QAC1B;AAAA,MACJ,OACK;AACD,YAAI,IAAI,CAAA;AACR,YAAI,IAAI,IAAI;AACZ,UAAE,UAAU,KAAK,KAAK;AACtB,UAAE,UAAU,CAAC;AACb,YAAI,IAAI,GAAG;AACP,YAAE,CAAC,MAAO,KAAK,KAAK;AAAA,QACxB,OACK;AACD,YAAE,CAAC,IAAI;AAAA,QACX;AACA,aAAK,WAAW,GAAG,GAAG;AAAA,MAC1B;AAAA,IACJ;AACA,WAAOA;AAAA,EACX,GAAC;AAAA;AAID,IAAI;AAAA;AAAA,GAAyB,WAAY;AACrC,aAASC,WAAU;AAAA,IACnB;AAEA,IAAAA,SAAQ,UAAU,UAAU,SAAU,GAAG;AACrC,aAAO;AAAA,IACX;AAEA,IAAAA,SAAQ,UAAU,SAAS,SAAU,GAAG;AACpC,aAAO;AAAA,IACX;AAEA,IAAAA,SAAQ,UAAU,QAAQ,SAAU,GAAG,GAAG,GAAG;AACzC,QAAE,WAAW,GAAG,CAAC;AAAA,IACrB;AAEA,IAAAA,SAAQ,UAAU,QAAQ,SAAU,GAAG,GAAG;AACtC,QAAE,SAAS,CAAC;AAAA,IAChB;AACA,WAAOA;AAAA,EACX;;AAEA,IAAI;AAAA;AAAA,GAAyB,WAAY;AACrC,aAASC,SAAQ,GAAG;AAChB,WAAK,IAAI;AAAA,IACb;AAEA,IAAAA,SAAQ,UAAU,UAAU,SAAU,GAAG;AACrC,UAAI,EAAE,IAAI,KAAK,EAAE,UAAU,KAAK,CAAC,KAAK,GAAG;AACrC,eAAO,EAAE,IAAI,KAAK,CAAC;AAAA,MACvB,OACK;AACD,eAAO;AAAA,MACX;AAAA,IACJ;AAEA,IAAAA,SAAQ,UAAU,SAAS,SAAU,GAAG;AACpC,aAAO;AAAA,IACX;AAEA,IAAAA,SAAQ,UAAU,SAAS,SAAU,GAAG;AACpC,QAAE,SAAS,KAAK,GAAG,MAAM,CAAC;AAAA,IAC9B;AAEA,IAAAA,SAAQ,UAAU,QAAQ,SAAU,GAAG,GAAG,GAAG;AACzC,QAAE,WAAW,GAAG,CAAC;AACjB,WAAK,OAAO,CAAC;AAAA,IACjB;AAEA,IAAAA,SAAQ,UAAU,QAAQ,SAAU,GAAG,GAAG;AACtC,QAAE,SAAS,CAAC;AACZ,WAAK,OAAO,CAAC;AAAA,IACjB;AACA,WAAOA;AAAA,EACX;;AAIA,IAAI;AAAA;AAAA,GAA4B,WAAY;AACxC,aAASC,YAAW,GAAG;AACnB,WAAK,IAAI;AACT,WAAK,KAAK,EAAE,SAAQ;AACpB,WAAK,MAAM,KAAK,KAAK;AACrB,WAAK,MAAM,KAAK,MAAM;AACtB,WAAK,MAAM,KAAM,EAAE,KAAK,MAAO;AAC/B,WAAK,MAAM,IAAI,EAAE;AAAA,IACrB;AAGA,IAAAA,YAAW,UAAU,UAAU,SAAU,GAAG;AACxC,UAAI,IAAI,IAAG;AACX,QAAE,IAAG,EAAG,UAAU,KAAK,EAAE,GAAG,CAAC;AAC7B,QAAE,SAAS,KAAK,GAAG,MAAM,CAAC;AAC1B,UAAI,EAAE,IAAI,KAAK,EAAE,UAAU,WAAW,IAAI,IAAI,GAAG;AAC7C,aAAK,EAAE,MAAM,GAAG,CAAC;AAAA,MACrB;AACA,aAAO;AAAA,IACX;AAGA,IAAAA,YAAW,UAAU,SAAS,SAAU,GAAG;AACvC,UAAI,IAAI,IAAG;AACX,QAAE,OAAO,CAAC;AACV,WAAK,OAAO,CAAC;AACb,aAAO;AAAA,IACX;AAGA,IAAAA,YAAW,UAAU,SAAS,SAAU,GAAG;AACvC,aAAO,EAAE,KAAK,KAAK,KAAK;AAEpB,UAAE,EAAE,GAAG,IAAI;AAAA,MACf;AACA,eAAS,IAAI,GAAG,IAAI,KAAK,EAAE,GAAG,EAAE,GAAG;AAE/B,YAAI,IAAI,EAAE,CAAC,IAAI;AACf,YAAI,KAAM,IAAI,KAAK,QAAS,IAAI,KAAK,OAAO,EAAE,CAAC,KAAK,MAAM,KAAK,MAAO,KAAK,OAAO,MAAO,EAAE;AAE3F,YAAI,IAAI,KAAK,EAAE;AACf,UAAE,CAAC,KAAK,KAAK,EAAE,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,KAAK,EAAE,CAAC;AAE1C,eAAO,EAAE,CAAC,KAAK,EAAE,IAAI;AACjB,YAAE,CAAC,KAAK,EAAE;AACV,YAAE,EAAE,CAAC;AAAA,QACT;AAAA,MACJ;AACA,QAAE,MAAK;AACP,QAAE,UAAU,KAAK,EAAE,GAAG,CAAC;AACvB,UAAI,EAAE,UAAU,KAAK,CAAC,KAAK,GAAG;AAC1B,UAAE,MAAM,KAAK,GAAG,CAAC;AAAA,MACrB;AAAA,IACJ;AAGA,IAAAA,YAAW,UAAU,QAAQ,SAAU,GAAG,GAAG,GAAG;AAC5C,QAAE,WAAW,GAAG,CAAC;AACjB,WAAK,OAAO,CAAC;AAAA,IACjB;AAGA,IAAAA,YAAW,UAAU,QAAQ,SAAU,GAAG,GAAG;AACzC,QAAE,SAAS,CAAC;AACZ,WAAK,OAAO,CAAC;AAAA,IACjB;AACA,WAAOA;AAAA,EACX;;AAIA,IAAI;AAAA;AAAA,GAAyB,WAAY;AACrC,aAASC,SAAQ,GAAG;AAChB,WAAK,IAAI;AAET,WAAK,KAAK,IAAG;AACb,WAAK,KAAK,IAAG;AACb,iBAAW,IAAI,UAAU,IAAI,EAAE,GAAG,KAAK,EAAE;AACzC,WAAK,KAAK,KAAK,GAAG,OAAO,CAAC;AAAA,IAC9B;AAEA,IAAAA,SAAQ,UAAU,UAAU,SAAU,GAAG;AACrC,UAAI,EAAE,IAAI,KAAK,EAAE,IAAI,IAAI,KAAK,EAAE,GAAG;AAC/B,eAAO,EAAE,IAAI,KAAK,CAAC;AAAA,MACvB,WACS,EAAE,UAAU,KAAK,CAAC,IAAI,GAAG;AAC9B,eAAO;AAAA,MACX,OACK;AACD,YAAI,IAAI,IAAG;AACX,UAAE,OAAO,CAAC;AACV,aAAK,OAAO,CAAC;AACb,eAAO;AAAA,MACX;AAAA,IACJ;AAEA,IAAAA,SAAQ,UAAU,SAAS,SAAU,GAAG;AACpC,aAAO;AAAA,IACX;AAGA,IAAAA,SAAQ,UAAU,SAAS,SAAU,GAAG;AACpC,QAAE,UAAU,KAAK,EAAE,IAAI,GAAG,KAAK,EAAE;AACjC,UAAI,EAAE,IAAI,KAAK,EAAE,IAAI,GAAG;AACpB,UAAE,IAAI,KAAK,EAAE,IAAI;AACjB,UAAE,MAAK;AAAA,MACX;AACA,WAAK,GAAG,gBAAgB,KAAK,IAAI,KAAK,EAAE,IAAI,GAAG,KAAK,EAAE;AACtD,WAAK,EAAE,gBAAgB,KAAK,IAAI,KAAK,EAAE,IAAI,GAAG,KAAK,EAAE;AACrD,aAAO,EAAE,UAAU,KAAK,EAAE,IAAI,GAAG;AAC7B,UAAE,WAAW,GAAG,KAAK,EAAE,IAAI,CAAC;AAAA,MAChC;AACA,QAAE,MAAM,KAAK,IAAI,CAAC;AAClB,aAAO,EAAE,UAAU,KAAK,CAAC,KAAK,GAAG;AAC7B,UAAE,MAAM,KAAK,GAAG,CAAC;AAAA,MACrB;AAAA,IACJ;AAGA,IAAAA,SAAQ,UAAU,QAAQ,SAAU,GAAG,GAAG,GAAG;AACzC,QAAE,WAAW,GAAG,CAAC;AACjB,WAAK,OAAO,CAAC;AAAA,IACjB;AAGA,IAAAA,SAAQ,UAAU,QAAQ,SAAU,GAAG,GAAG;AACtC,QAAE,SAAS,CAAC;AACZ,WAAK,OAAO,CAAC;AAAA,IACjB;AACA,WAAOA;AAAA,EACX;;AAIO,SAAS,MAAM;AAAE,SAAO,IAAI,WAAW,IAAI;AAAG;AAC9C,SAAS,YAAY,KAAK,GAAG;AAChC,SAAO,IAAI,WAAW,KAAK,CAAC;AAChC;AAKA,IAAI,YAAY,OAAO,cAAc;AACrC,IAAI,aAAa,QAAS,UAAU,WAAW,+BAAgC;AAI3E,aAAW,UAAU,KAAK,SAAS,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AACrD,QAAI,KAAK,IAAI;AACb,QAAI,KAAK,KAAK;AACd,WAAO,EAAE,KAAK,GAAG;AACb,UAAI,IAAI,KAAK,CAAC,IAAI;AAClB,UAAI,IAAI,KAAK,GAAG,KAAK;AACrB,UAAI,IAAI,KAAK,IAAI,IAAI;AACrB,UAAI,KAAK,MAAM,IAAI,UAAW,MAAM,EAAE,CAAC,KAAK,IAAI;AAChD,WAAK,MAAM,OAAO,MAAM,MAAM,KAAK,KAAK,MAAM;AAC9C,QAAE,GAAG,IAAI,IAAI;AAAA,IACjB;AACA,WAAO;AAAA,EACX;AACA,UAAQ;AACZ,WACS,aAAa,QAAS,UAAU,WAAW,YAAa;AAI7D,aAAW,UAAU,KAAK,SAAS,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AACrD,WAAO,EAAE,KAAK,GAAG;AACb,UAAI,IAAI,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,IAAI;AAC/B,UAAI,KAAK,MAAM,IAAI,QAAS;AAC5B,QAAE,GAAG,IAAI,IAAI;AAAA,IACjB;AACA,WAAO;AAAA,EACX;AACA,UAAQ;AACZ,OACK;AAGD,aAAW,UAAU,KAAK,SAAS,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AACrD,QAAI,KAAK,IAAI;AACb,QAAI,KAAK,KAAK;AACd,WAAO,EAAE,KAAK,GAAG;AACb,UAAI,IAAI,KAAK,CAAC,IAAI;AAClB,UAAI,IAAI,KAAK,GAAG,KAAK;AACrB,UAAI,IAAI,KAAK,IAAI,IAAI;AACrB,UAAI,KAAK,MAAM,IAAI,UAAW,MAAM,EAAE,CAAC,IAAI;AAC3C,WAAK,KAAK,OAAO,KAAK,MAAM,KAAK;AACjC,QAAE,GAAG,IAAI,IAAI;AAAA,IACjB;AACA,WAAO;AAAA,EACX;AACA,UAAQ;AACZ;AACA,WAAW,UAAU,KAAK;AAC1B,WAAW,UAAU,MAAO,KAAK,SAAS;AAC1C,WAAW,UAAU,KAAM,KAAK;AAChC,IAAI,QAAQ;AACZ,WAAW,UAAU,KAAK,KAAK,IAAI,GAAG,KAAK;AAC3C,WAAW,UAAU,KAAK,QAAQ;AAClC,WAAW,UAAU,KAAK,IAAI,QAAQ;AAEtC,IAAI,QAAQ,CAAA;AACZ,IAAI;AACJ,IAAI;AACJ,KAAK,IAAI,WAAW,CAAC;AACrB,KAAK,KAAK,GAAG,MAAM,GAAG,EAAE,IAAI;AACxB,QAAM,IAAI,IAAI;AAClB;AACA,KAAK,IAAI,WAAW,CAAC;AACrB,KAAK,KAAK,IAAI,KAAK,IAAI,EAAE,IAAI;AACzB,QAAM,IAAI,IAAI;AAClB;AACA,KAAK,IAAI,WAAW,CAAC;AACrB,KAAK,KAAK,IAAI,KAAK,IAAI,EAAE,IAAI;AACzB,QAAM,IAAI,IAAI;AAClB;AACO,SAAS,MAAM,GAAG,GAAG;AACxB,MAAI,IAAI,MAAM,EAAE,WAAW,CAAC,CAAC;AAC7B,SAAQ,KAAK,OAAQ,KAAK;AAC9B;AAEO,SAAS,IAAI,GAAG;AACnB,MAAI,IAAI,IAAG;AACX,IAAE,QAAQ,CAAC;AACX,SAAO;AACX;AAEO,SAAS,MAAM,GAAG;AACrB,MAAI,IAAI;AACR,MAAI;AACJ,OAAK,IAAI,MAAM,OAAO,GAAG;AACrB,QAAI;AACJ,SAAK;AAAA,EACT;AACA,OAAK,IAAI,KAAK,MAAM,GAAG;AACnB,QAAI;AACJ,SAAK;AAAA,EACT;AACA,OAAK,IAAI,KAAK,MAAM,GAAG;AACnB,QAAI;AACJ,SAAK;AAAA,EACT;AACA,OAAK,IAAI,KAAK,MAAM,GAAG;AACnB,QAAI;AACJ,SAAK;AAAA,EACT;AACA,OAAK,IAAI,KAAK,MAAM,GAAG;AACnB,QAAI;AACJ,SAAK;AAAA,EACT;AACA,SAAO;AACX;AAEA,WAAW,OAAO,IAAI,CAAC;AACvB,WAAW,MAAM,IAAI,CAAC;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/jsencrypt@3.5.4/node_modules/jsencrypt/lib/lib/jsbn/prng4.mjs.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"prng4.mjs","sources":["../../../../../../../../../../../node_modules/.pnpm/jsencrypt@3.5.4/node_modules/jsencrypt/lib/lib/jsbn/prng4.js"],"sourcesContent":["// prng4.js - uses Arcfour as a PRNG\nvar Arcfour = /** @class */ (function () {\n function Arcfour() {\n this.i = 0;\n this.j = 0;\n this.S = [];\n }\n // Arcfour.prototype.init = ARC4init;\n // Initialize arcfour context from key, an array of ints, each from [0..255]\n Arcfour.prototype.init = function (key) {\n var i;\n var j;\n var t;\n for (i = 0; i < 256; ++i) {\n this.S[i] = i;\n }\n j = 0;\n for (i = 0; i < 256; ++i) {\n j = (j + this.S[i] + key[i % key.length]) & 255;\n t = this.S[i];\n this.S[i] = this.S[j];\n this.S[j] = t;\n }\n this.i = 0;\n this.j = 0;\n };\n // Arcfour.prototype.next = ARC4next;\n Arcfour.prototype.next = function () {\n var t;\n this.i = (this.i + 1) & 255;\n this.j = (this.j + this.S[this.i]) & 255;\n t = this.S[this.i];\n this.S[this.i] = this.S[this.j];\n this.S[this.j] = t;\n return this.S[(t + this.S[this.i]) & 255];\n };\n return Arcfour;\n}());\nexport { Arcfour };\n// Plug in your RNG constructor here\nexport function prng_newstate() {\n return new Arcfour();\n}\n// Pool size must be a multiple of 4 and greater than 32.\n// An array of bytes the size of the pool will be passed to init()\nexport var rng_psize = 256;\n"],"names":["Arcfour"],"mappings":"AACG,IAAC;AAAA;AAAA,GAAyB,WAAY;AACrC,aAASA,WAAU;AACf,WAAK,IAAI;AACT,WAAK,IAAI;AACT,WAAK,IAAI,CAAA;AAAA,IACb;AAGA,IAAAA,SAAQ,UAAU,OAAO,SAAU,KAAK;AACpC,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,WAAK,IAAI,GAAG,IAAI,KAAK,EAAE,GAAG;AACtB,aAAK,EAAE,CAAC,IAAI;AAAA,MAChB;AACA,UAAI;AACJ,WAAK,IAAI,GAAG,IAAI,KAAK,EAAE,GAAG;AACtB,YAAK,IAAI,KAAK,EAAE,CAAC,IAAI,IAAI,IAAI,IAAI,MAAM,IAAK;AAC5C,YAAI,KAAK,EAAE,CAAC;AACZ,aAAK,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC;AACpB,aAAK,EAAE,CAAC,IAAI;AAAA,MAChB;AACA,WAAK,IAAI;AACT,WAAK,IAAI;AAAA,IACb;AAEA,IAAAA,SAAQ,UAAU,OAAO,WAAY;AACjC,UAAI;AACJ,WAAK,IAAK,KAAK,IAAI,IAAK;AACxB,WAAK,IAAK,KAAK,IAAI,KAAK,EAAE,KAAK,CAAC,IAAK;AACrC,UAAI,KAAK,EAAE,KAAK,CAAC;AACjB,WAAK,EAAE,KAAK,CAAC,IAAI,KAAK,EAAE,KAAK,CAAC;AAC9B,WAAK,EAAE,KAAK,CAAC,IAAI;AACjB,aAAO,KAAK,EAAG,IAAI,KAAK,EAAE,KAAK,CAAC,IAAK,GAAG;AAAA,IAC5C;AACA,WAAOA;AAAA,EACX,GAAC;AAAA;AAGM,SAAS,gBAAgB;AAC5B,SAAO,IAAI,QAAO;AACtB;AAGU,IAAC,YAAY;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/jsencrypt@3.5.4/node_modules/jsencrypt/lib/lib/jsbn/rng.mjs.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"rng.mjs","sources":["../../../../../../../../../../../node_modules/.pnpm/jsencrypt@3.5.4/node_modules/jsencrypt/lib/lib/jsbn/rng.js"],"sourcesContent":["// Random number generator - requires a PRNG backend, e.g. prng4.js\nimport { prng_newstate, rng_psize } from \"./prng4\";\nvar rng_state;\nvar rng_pool = null;\nvar rng_pptr;\n// Initialize the pool with junk if needed.\nif (rng_pool == null) {\n rng_pool = [];\n rng_pptr = 0;\n var t = void 0;\n if (typeof window !== 'undefined' && self.crypto && self.crypto.getRandomValues) {\n // Extract entropy (2048 bits) from RNG if available\n var z = new Uint32Array(256);\n self.crypto.getRandomValues(z);\n for (t = 0; t < z.length; ++t) {\n rng_pool[rng_pptr++] = z[t] & 255;\n }\n }\n // Use mouse events for entropy, if we do not have enough entropy by the time\n // we need it, entropy will be generated by Math.random.\n var count = 0;\n var onMouseMoveListener_1 = function (ev) {\n count = count || 0;\n if (count >= 256 || rng_pptr >= rng_psize) {\n if (self.removeEventListener) {\n self.removeEventListener(\"mousemove\", onMouseMoveListener_1, false);\n }\n else if (self.detachEvent) {\n self.detachEvent(\"onmousemove\", onMouseMoveListener_1);\n }\n return;\n }\n try {\n var mouseCoordinates = ev.x + ev.y;\n rng_pool[rng_pptr++] = mouseCoordinates & 255;\n count += 1;\n }\n catch (e) {\n // Sometimes Firefox will deny permission to access event properties for some reason. Ignore.\n }\n };\n if (typeof window !== 'undefined') {\n if (self.addEventListener) {\n self.addEventListener(\"mousemove\", onMouseMoveListener_1, false);\n }\n else if (self.attachEvent) {\n self.attachEvent(\"onmousemove\", onMouseMoveListener_1);\n }\n }\n}\nfunction rng_get_byte() {\n if (rng_state == null) {\n rng_state = prng_newstate();\n // At this point, we may not have collected enough entropy. If not, fall back to Math.random\n while (rng_pptr < rng_psize) {\n var random = Math.floor(65536 * Math.random());\n rng_pool[rng_pptr++] = random & 255;\n }\n rng_state.init(rng_pool);\n for (rng_pptr = 0; rng_pptr < rng_pool.length; ++rng_pptr) {\n rng_pool[rng_pptr] = 0;\n }\n rng_pptr = 0;\n }\n // TODO: allow reseeding after first request\n return rng_state.next();\n}\nvar SecureRandom = /** @class */ (function () {\n function SecureRandom() {\n }\n SecureRandom.prototype.nextBytes = function (ba) {\n for (var i = 0; i < ba.length; ++i) {\n ba[i] = rng_get_byte();\n }\n };\n return SecureRandom;\n}());\nexport { SecureRandom };\n"],"names":["SecureRandom"],"mappings":";AAEA,IAAI;AACJ,IAAI,WAAW;AACf,IAAI;AAEJ,IAAI,YAAY,MAAM;AAClB,aAAW,CAAA;AACX,aAAW;AACX,MAAI,IAAI;AACR,MAAI,OAAO,WAAW,eAAe,KAAK,UAAU,KAAK,OAAO,iBAAiB;AAE7E,QAAI,IAAI,IAAI,YAAY,GAAG;AAC3B,SAAK,OAAO,gBAAgB,CAAC;AAC7B,SAAK,IAAI,GAAG,IAAI,EAAE,QAAQ,EAAE,GAAG;AAC3B,eAAS,UAAU,IAAI,EAAE,CAAC,IAAI;AAAA,IAClC;AAAA,EACJ;AAGA,MAAI,QAAQ;AACZ,MAAI,wBAAwB,SAAU,IAAI;AACtC,YAAQ,SAAS;AACjB,QAAI,SAAS,OAAO,YAAY,WAAW;AACvC,UAAI,KAAK,qBAAqB;AAC1B,aAAK,oBAAoB,aAAa,uBAAuB,KAAK;AAAA,MACtE,WACS,KAAK,aAAa;AACvB,aAAK,YAAY,eAAe,qBAAqB;AAAA,MACzD;AACA;AAAA,IACJ;AACA,QAAI;AACA,UAAI,mBAAmB,GAAG,IAAI,GAAG;AACjC,eAAS,UAAU,IAAI,mBAAmB;AAC1C,eAAS;AAAA,IACb,SACO,GAAG;AAAA,IAEV;AAAA,EACJ;AACA,MAAI,OAAO,WAAW,aAAa;AAC/B,QAAI,KAAK,kBAAkB;AACvB,WAAK,iBAAiB,aAAa,uBAAuB,KAAK;AAAA,IACnE,WACS,KAAK,aAAa;AACvB,WAAK,YAAY,eAAe,qBAAqB;AAAA,IACzD;AAAA,EACJ;AACJ;AACA,SAAS,eAAe;AACpB,MAAI,aAAa,MAAM;AACnB,gBAAY,cAAa;AAEzB,WAAO,WAAW,WAAW;AACzB,UAAI,SAAS,KAAK,MAAM,QAAQ,KAAK,QAAQ;AAC7C,eAAS,UAAU,IAAI,SAAS;AAAA,IACpC;AACA,cAAU,KAAK,QAAQ;AACvB,SAAK,WAAW,GAAG,WAAW,SAAS,QAAQ,EAAE,UAAU;AACvD,eAAS,QAAQ,IAAI;AAAA,IACzB;AACA,eAAW;AAAA,EACf;AAEA,SAAO,UAAU,KAAI;AACzB;AACG,IAAC;AAAA;AAAA,GAA8B,WAAY;AAC1C,aAASA,gBAAe;AAAA,IACxB;AACA,IAAAA,cAAa,UAAU,YAAY,SAAU,IAAI;AAC7C,eAAS,IAAI,GAAG,IAAI,GAAG,QAAQ,EAAE,GAAG;AAChC,WAAG,CAAC,IAAI,aAAY;AAAA,MACxB;AAAA,IACJ;AACA,WAAOA;AAAA,EACX,GAAC;AAAA;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/jsencrypt@3.5.4/node_modules/jsencrypt/lib/lib/jsbn/rsa.mjs.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"rsa.mjs","sources":["../../../../../../../../../../../node_modules/.pnpm/jsencrypt@3.5.4/node_modules/jsencrypt/lib/lib/jsbn/rsa.js"],"sourcesContent":["// Depends on jsbn.js and rng.js\n// Version 1.1: support utf-8 encoding in pkcs1pad2\n// convert a (hex) string to a bignum object\nimport { BigInteger, nbi, parseBigInt } from \"./jsbn\";\nimport { SecureRandom } from \"./rng\";\nimport { rstr_sha256 } from './sha256';\n// function linebrk(s,n) {\n// var ret = \"\";\n// var i = 0;\n// while(i + n < s.length) {\n// ret += s.substring(i,i+n) + \"\\n\";\n// i += n;\n// }\n// return ret + s.substring(i,s.length);\n// }\n// function byte2Hex(b) {\n// if(b < 0x10)\n// return \"0\" + b.toString(16);\n// else\n// return b.toString(16);\n// }\nfunction pkcs1pad1(s, n) {\n if (n < s.length + 22) {\n console.error(\"Message too long for RSA\");\n return null;\n }\n var len = n - s.length - 6;\n var filler = \"\";\n for (var f = 0; f < len; f += 2) {\n filler += \"ff\";\n }\n var m = \"0001\" + filler + \"00\" + s;\n return parseBigInt(m, 16);\n}\n// PKCS#1 (type 2, random) pad input string s to n bytes, and return a bigint\nfunction pkcs1pad2(s, n) {\n if (n < s.length + 11) { // TODO: fix for utf-8\n console.error(\"Message too long for RSA\");\n return null;\n }\n var ba = [];\n var i = s.length - 1;\n while (i >= 0 && n > 0) {\n var c = s.charCodeAt(i--);\n if (c < 128) { // encode using utf-8\n ba[--n] = c;\n }\n else if ((c > 127) && (c < 2048)) {\n ba[--n] = (c & 63) | 128;\n ba[--n] = (c >> 6) | 192;\n }\n else {\n ba[--n] = (c & 63) | 128;\n ba[--n] = ((c >> 6) & 63) | 128;\n ba[--n] = (c >> 12) | 224;\n }\n }\n ba[--n] = 0;\n var rng = new SecureRandom();\n var x = [];\n while (n > 2) { // random non-zero pad\n x[0] = 0;\n while (x[0] == 0) {\n rng.nextBytes(x);\n }\n ba[--n] = x[0];\n }\n ba[--n] = 2;\n ba[--n] = 0;\n return new BigInteger(ba);\n}\n// PKCS#1 (OAEP) mask generation function, using SHA-256\nfunction oaep_mgf1_arr(seed, len, hashFunc) {\n var mask = \"\", i = 0;\n while (mask.length < len) {\n mask += hashFunc(String.fromCharCode.apply(String, seed.concat([\n (i & 0xff000000) >> 24,\n (i & 0x00ff0000) >> 16,\n (i & 0x0000ff00) >> 8,\n i & 0x000000ff,\n ])));\n i += 1;\n }\n return mask;\n}\nvar SHA256_SIZE = 32;\n// PKCS#1 (OAEP) pad input string s to n bytes, and return a BigInteger\nexport function oaep_pad(s, n) {\n var hashLen = SHA256_SIZE;\n var hashFunc = rstr_sha256;\n if (s.length + 2 * hashLen + 2 > n) {\n throw \"Message too long for RSA\";\n }\n var PS = \"\", i;\n for (i = 0; i < n - s.length - 2 * hashLen - 2; i += 1) {\n PS += \"\\x00\";\n }\n var DB = hashFunc(\"\") + PS + \"\\x01\" + s, seed = new Array(hashLen);\n new SecureRandom().nextBytes(seed);\n var dbMask = oaep_mgf1_arr(seed, DB.length, hashFunc), maskedDB = [];\n for (i = 0; i < DB.length; i += 1) {\n maskedDB[i] = DB.charCodeAt(i) ^ dbMask.charCodeAt(i);\n }\n var seedMask = oaep_mgf1_arr(maskedDB, seed.length, hashFunc), maskedSeed = [0];\n for (i = 0; i < seed.length; i += 1) {\n maskedSeed[i + 1] = seed[i] ^ seedMask.charCodeAt(i);\n }\n return new BigInteger(maskedSeed.concat(maskedDB));\n}\n// \"empty\" RSA key constructor\nvar RSAKey = /** @class */ (function () {\n function RSAKey() {\n this.n = null;\n this.e = 0;\n this.d = null;\n this.p = null;\n this.q = null;\n this.dmp1 = null;\n this.dmq1 = null;\n this.coeff = null;\n }\n //#region PROTECTED\n // protected\n // RSAKey.prototype.doPublic = RSADoPublic;\n // Perform raw public operation on \"x\": return x^e (mod n)\n RSAKey.prototype.doPublic = function (x) {\n return x.modPowInt(this.e, this.n);\n };\n // RSAKey.prototype.doPrivate = RSADoPrivate;\n // Perform raw private operation on \"x\": return x^d (mod n)\n RSAKey.prototype.doPrivate = function (x) {\n if (this.p == null || this.q == null) {\n return x.modPow(this.d, this.n);\n }\n // TODO: re-calculate any missing CRT params\n var xp = x.mod(this.p).modPow(this.dmp1, this.p);\n var xq = x.mod(this.q).modPow(this.dmq1, this.q);\n while (xp.compareTo(xq) < 0) {\n xp = xp.add(this.p);\n }\n return xp.subtract(xq).multiply(this.coeff).mod(this.p).multiply(this.q).add(xq);\n };\n //#endregion PROTECTED\n //#region PUBLIC\n // RSAKey.prototype.setPublic = RSASetPublic;\n // Set the public key fields N and e from hex strings\n RSAKey.prototype.setPublic = function (N, E) {\n if (N != null && E != null && N.length > 0 && E.length > 0) {\n this.n = parseBigInt(N, 16);\n this.e = parseInt(E, 16);\n }\n else {\n console.error(\"Invalid RSA public key\");\n }\n };\n // RSAKey.prototype.encrypt = RSAEncrypt;\n // Return the PKCS#1 RSA encryption of \"text\" as an even-length hex string\n RSAKey.prototype.encrypt = function (text, paddingFunction) {\n if (typeof paddingFunction === 'undefined') {\n paddingFunction = pkcs1pad2;\n }\n var maxLength = (this.n.bitLength() + 7) >> 3;\n var m = paddingFunction(text, maxLength);\n if (m == null) {\n return null;\n }\n var c = this.doPublic(m);\n if (c == null) {\n return null;\n }\n var h = c.toString(16);\n var length = h.length;\n // fix zero before result\n for (var i = 0; i < maxLength * 2 - length; i++) {\n h = \"0\" + h;\n }\n return h;\n };\n // RSAKey.prototype.setPrivate = RSASetPrivate;\n // Set the private key fields N, e, and d from hex strings\n RSAKey.prototype.setPrivate = function (N, E, D) {\n if (N != null && E != null && N.length > 0 && E.length > 0) {\n this.n = parseBigInt(N, 16);\n this.e = parseInt(E, 16);\n this.d = parseBigInt(D, 16);\n }\n else {\n console.error(\"Invalid RSA private key\");\n }\n };\n // RSAKey.prototype.setPrivateEx = RSASetPrivateEx;\n // Set the private key fields N, e, d and CRT params from hex strings\n RSAKey.prototype.setPrivateEx = function (N, E, D, P, Q, DP, DQ, C) {\n if (N != null && E != null && N.length > 0 && E.length > 0) {\n this.n = parseBigInt(N, 16);\n this.e = parseInt(E, 16);\n this.d = parseBigInt(D, 16);\n this.p = parseBigInt(P, 16);\n this.q = parseBigInt(Q, 16);\n this.dmp1 = parseBigInt(DP, 16);\n this.dmq1 = parseBigInt(DQ, 16);\n this.coeff = parseBigInt(C, 16);\n }\n else {\n console.error(\"Invalid RSA private key\");\n }\n };\n // RSAKey.prototype.generate = RSAGenerate;\n // Generate a new random private key B bits long, using public expt E\n RSAKey.prototype.generate = function (B, E) {\n var rng = new SecureRandom();\n var qs = B >> 1;\n this.e = parseInt(E, 16);\n var ee = new BigInteger(E, 16);\n for (;;) {\n for (;;) {\n this.p = new BigInteger(B - qs, 1, rng);\n if (this.p.subtract(BigInteger.ONE).gcd(ee).compareTo(BigInteger.ONE) == 0 && this.p.isProbablePrime(10)) {\n break;\n }\n }\n for (;;) {\n this.q = new BigInteger(qs, 1, rng);\n if (this.q.subtract(BigInteger.ONE).gcd(ee).compareTo(BigInteger.ONE) == 0 && this.q.isProbablePrime(10)) {\n break;\n }\n }\n if (this.p.compareTo(this.q) <= 0) {\n var t = this.p;\n this.p = this.q;\n this.q = t;\n }\n var p1 = this.p.subtract(BigInteger.ONE);\n var q1 = this.q.subtract(BigInteger.ONE);\n var phi = p1.multiply(q1);\n if (phi.gcd(ee).compareTo(BigInteger.ONE) == 0) {\n this.n = this.p.multiply(this.q);\n this.d = ee.modInverse(phi);\n this.dmp1 = this.d.mod(p1);\n this.dmq1 = this.d.mod(q1);\n this.coeff = this.q.modInverse(this.p);\n break;\n }\n }\n };\n // RSAKey.prototype.decrypt = RSADecrypt;\n // Return the PKCS#1 RSA decryption of \"ctext\".\n // \"ctext\" is an even-length hex string and the output is a plain string.\n RSAKey.prototype.decrypt = function (ctext) {\n var c = parseBigInt(ctext, 16);\n var m = this.doPrivate(c);\n if (m == null) {\n return null;\n }\n return pkcs1unpad2(m, (this.n.bitLength() + 7) >> 3);\n };\n // Generate a new random private key B bits long, using public expt E\n RSAKey.prototype.generateAsync = function (B, E, callback) {\n var rng = new SecureRandom();\n var qs = B >> 1;\n this.e = parseInt(E, 16);\n var ee = new BigInteger(E, 16);\n var rsa = this;\n // These functions have non-descript names because they were originally for(;;) loops.\n // I don't know about cryptography to give them better names than loop1-4.\n var loop1 = function () {\n var loop4 = function () {\n if (rsa.p.compareTo(rsa.q) <= 0) {\n var t = rsa.p;\n rsa.p = rsa.q;\n rsa.q = t;\n }\n var p1 = rsa.p.subtract(BigInteger.ONE);\n var q1 = rsa.q.subtract(BigInteger.ONE);\n var phi = p1.multiply(q1);\n if (phi.gcd(ee).compareTo(BigInteger.ONE) == 0) {\n rsa.n = rsa.p.multiply(rsa.q);\n rsa.d = ee.modInverse(phi);\n rsa.dmp1 = rsa.d.mod(p1);\n rsa.dmq1 = rsa.d.mod(q1);\n rsa.coeff = rsa.q.modInverse(rsa.p);\n setTimeout(function () { callback(); }, 0); // escape\n }\n else {\n setTimeout(loop1, 0);\n }\n };\n var loop3 = function () {\n rsa.q = nbi();\n rsa.q.fromNumberAsync(qs, 1, rng, function () {\n rsa.q.subtract(BigInteger.ONE).gcda(ee, function (r) {\n if (r.compareTo(BigInteger.ONE) == 0 && rsa.q.isProbablePrime(10)) {\n setTimeout(loop4, 0);\n }\n else {\n setTimeout(loop3, 0);\n }\n });\n });\n };\n var loop2 = function () {\n rsa.p = nbi();\n rsa.p.fromNumberAsync(B - qs, 1, rng, function () {\n rsa.p.subtract(BigInteger.ONE).gcda(ee, function (r) {\n if (r.compareTo(BigInteger.ONE) == 0 && rsa.p.isProbablePrime(10)) {\n setTimeout(loop3, 0);\n }\n else {\n setTimeout(loop2, 0);\n }\n });\n });\n };\n setTimeout(loop2, 0);\n };\n setTimeout(loop1, 0);\n };\n RSAKey.prototype.sign = function (text, digestMethod, digestName) {\n var header = getDigestHeader(digestName);\n var digest = header + digestMethod(text).toString();\n var maxLength = this.n.bitLength() / 4;\n var m = pkcs1pad1(digest, maxLength);\n if (m == null) {\n return null;\n }\n var c = this.doPrivate(m);\n if (c == null) {\n return null;\n }\n var h = c.toString(16);\n var length = h.length;\n // fix zero before result\n for (var i = 0; i < maxLength - length; i++) {\n h = \"0\" + h;\n }\n return h;\n };\n RSAKey.prototype.verify = function (text, signature, digestMethod) {\n var c = parseBigInt(signature, 16);\n var m = this.doPublic(c);\n if (m == null) {\n return null;\n }\n var unpadded = m.toString(16).replace(/^1f+00/, \"\");\n var digest = removeDigestHeader(unpadded);\n return digest == digestMethod(text).toString();\n };\n return RSAKey;\n}());\nexport { RSAKey };\n// Undo PKCS#1 (type 2, random) padding and, if valid, return the plaintext\nfunction pkcs1unpad2(d, n) {\n var b = d.toByteArray();\n var i = 0;\n while (i < b.length && b[i] == 0) {\n ++i;\n }\n if (b.length - i != n - 1 || b[i] != 2) {\n return null;\n }\n ++i;\n while (b[i] != 0) {\n if (++i >= b.length) {\n return null;\n }\n }\n var ret = \"\";\n while (++i < b.length) {\n var c = b[i] & 255;\n if (c < 128) { // utf-8 decode\n ret += String.fromCharCode(c);\n }\n else if ((c > 191) && (c < 224)) {\n ret += String.fromCharCode(((c & 31) << 6) | (b[i + 1] & 63));\n ++i;\n }\n else {\n ret += String.fromCharCode(((c & 15) << 12) | ((b[i + 1] & 63) << 6) | (b[i + 2] & 63));\n i += 2;\n }\n }\n return ret;\n}\n// https://tools.ietf.org/html/rfc3447#page-43\nvar DIGEST_HEADERS = {\n md2: \"3020300c06082a864886f70d020205000410\",\n md5: \"3020300c06082a864886f70d020505000410\",\n sha1: \"3021300906052b0e03021a05000414\",\n sha224: \"302d300d06096086480165030402040500041c\",\n sha256: \"3031300d060960864801650304020105000420\",\n sha384: \"3041300d060960864801650304020205000430\",\n sha512: \"3051300d060960864801650304020305000440\",\n ripemd160: \"3021300906052b2403020105000414\"\n};\nfunction getDigestHeader(name) {\n return DIGEST_HEADERS[name] || \"\";\n}\nfunction removeDigestHeader(str) {\n for (var name_1 in DIGEST_HEADERS) {\n if (DIGEST_HEADERS.hasOwnProperty(name_1)) {\n var header = DIGEST_HEADERS[name_1];\n var len = header.length;\n if (str.substring(0, len) == header) {\n return str.substring(len);\n }\n }\n }\n return str;\n}\n// Return the PKCS#1 RSA encryption of \"text\" as a Base64-encoded string\n// function RSAEncryptB64(text) {\n// var h = this.encrypt(text);\n// if(h) return hex2b64(h); else return null;\n// }\n// public\n// RSAKey.prototype.encrypt_b64 = RSAEncryptB64;\n"],"names":["RSAKey"],"mappings":";;;AAqBA,SAAS,UAAU,GAAG,GAAG;AACrB,MAAI,IAAI,EAAE,SAAS,IAAI;AACnB,YAAQ,MAAM,0BAA0B;AACxC,WAAO;AAAA,EACX;AACA,MAAI,MAAM,IAAI,EAAE,SAAS;AACzB,MAAI,SAAS;AACb,WAAS,IAAI,GAAG,IAAI,KAAK,KAAK,GAAG;AAC7B,cAAU;AAAA,EACd;AACA,MAAI,IAAI,SAAS,SAAS,OAAO;AACjC,SAAO,YAAY,GAAG,EAAE;AAC5B;AAEA,SAAS,UAAU,GAAG,GAAG;AACrB,MAAI,IAAI,EAAE,SAAS,IAAI;AACnB,YAAQ,MAAM,0BAA0B;AACxC,WAAO;AAAA,EACX;AACA,MAAI,KAAK,CAAA;AACT,MAAI,IAAI,EAAE,SAAS;AACnB,SAAO,KAAK,KAAK,IAAI,GAAG;AACpB,QAAI,IAAI,EAAE,WAAW,GAAG;AACxB,QAAI,IAAI,KAAK;AACT,SAAG,EAAE,CAAC,IAAI;AAAA,IACd,WACU,IAAI,OAAS,IAAI,MAAO;AAC9B,SAAG,EAAE,CAAC,IAAK,IAAI,KAAM;AACrB,SAAG,EAAE,CAAC,IAAK,KAAK,IAAK;AAAA,IACzB,OACK;AACD,SAAG,EAAE,CAAC,IAAK,IAAI,KAAM;AACrB,SAAG,EAAE,CAAC,IAAM,KAAK,IAAK,KAAM;AAC5B,SAAG,EAAE,CAAC,IAAK,KAAK,KAAM;AAAA,IAC1B;AAAA,EACJ;AACA,KAAG,EAAE,CAAC,IAAI;AACV,MAAI,MAAM,IAAI,aAAY;AAC1B,MAAI,IAAI,CAAA;AACR,SAAO,IAAI,GAAG;AACV,MAAE,CAAC,IAAI;AACP,WAAO,EAAE,CAAC,KAAK,GAAG;AACd,UAAI,UAAU,CAAC;AAAA,IACnB;AACA,OAAG,EAAE,CAAC,IAAI,EAAE,CAAC;AAAA,EACjB;AACA,KAAG,EAAE,CAAC,IAAI;AACV,KAAG,EAAE,CAAC,IAAI;AACV,SAAO,IAAI,WAAW,EAAE;AAC5B;AAEA,SAAS,cAAc,MAAM,KAAK,UAAU;AACxC,MAAI,OAAO,IAAI,IAAI;AACnB,SAAO,KAAK,SAAS,KAAK;AACtB,YAAQ,SAAS,OAAO,aAAa,MAAM,QAAQ,KAAK,OAAO;AAAA,OAC1D,IAAI,eAAe;AAAA,OACnB,IAAI,aAAe;AAAA,OACnB,IAAI,UAAe;AAAA,MACpB,IAAI;AAAA,IAChB,CAAS,CAAC,CAAC;AACH,SAAK;AAAA,EACT;AACA,SAAO;AACX;AACA,IAAI,cAAc;AAEX,SAAS,SAAS,GAAG,GAAG;AAC3B,MAAI,UAAU;AACd,MAAI,WAAW;AACf,MAAI,EAAE,SAAS,IAAI,UAAU,IAAI,GAAG;AAChC,UAAM;AAAA,EACV;AACA,MAAI,KAAK,IAAI;AACb,OAAK,IAAI,GAAG,IAAI,IAAI,EAAE,SAAS,IAAI,UAAU,GAAG,KAAK,GAAG;AACpD,UAAM;AAAA,EACV;AACA,MAAI,KAAK,SAAS,EAAE,IAAI,KAAK,MAAS,GAAG,OAAO,IAAI,MAAM,OAAO;AACjE,MAAI,aAAY,EAAG,UAAU,IAAI;AACjC,MAAI,SAAS,cAAc,MAAM,GAAG,QAAQ,QAAQ,GAAG,WAAW,CAAA;AAClE,OAAK,IAAI,GAAG,IAAI,GAAG,QAAQ,KAAK,GAAG;AAC/B,aAAS,CAAC,IAAI,GAAG,WAAW,CAAC,IAAI,OAAO,WAAW,CAAC;AAAA,EACxD;AACA,MAAI,WAAW,cAAc,UAAU,KAAK,QAAQ,QAAQ,GAAG,aAAa,CAAC,CAAC;AAC9E,OAAK,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK,GAAG;AACjC,eAAW,IAAI,CAAC,IAAI,KAAK,CAAC,IAAI,SAAS,WAAW,CAAC;AAAA,EACvD;AACA,SAAO,IAAI,WAAW,WAAW,OAAO,QAAQ,CAAC;AACrD;AAEG,IAAC;AAAA;AAAA,GAAwB,WAAY;AACpC,aAASA,UAAS;AACd,WAAK,IAAI;AACT,WAAK,IAAI;AACT,WAAK,IAAI;AACT,WAAK,IAAI;AACT,WAAK,IAAI;AACT,WAAK,OAAO;AACZ,WAAK,OAAO;AACZ,WAAK,QAAQ;AAAA,IACjB;AAKA,IAAAA,QAAO,UAAU,WAAW,SAAU,GAAG;AACrC,aAAO,EAAE,UAAU,KAAK,GAAG,KAAK,CAAC;AAAA,IACrC;AAGA,IAAAA,QAAO,UAAU,YAAY,SAAU,GAAG;AACtC,UAAI,KAAK,KAAK,QAAQ,KAAK,KAAK,MAAM;AAClC,eAAO,EAAE,OAAO,KAAK,GAAG,KAAK,CAAC;AAAA,MAClC;AAEA,UAAI,KAAK,EAAE,IAAI,KAAK,CAAC,EAAE,OAAO,KAAK,MAAM,KAAK,CAAC;AAC/C,UAAI,KAAK,EAAE,IAAI,KAAK,CAAC,EAAE,OAAO,KAAK,MAAM,KAAK,CAAC;AAC/C,aAAO,GAAG,UAAU,EAAE,IAAI,GAAG;AACzB,aAAK,GAAG,IAAI,KAAK,CAAC;AAAA,MACtB;AACA,aAAO,GAAG,SAAS,EAAE,EAAE,SAAS,KAAK,KAAK,EAAE,IAAI,KAAK,CAAC,EAAE,SAAS,KAAK,CAAC,EAAE,IAAI,EAAE;AAAA,IACnF;AAKA,IAAAA,QAAO,UAAU,YAAY,SAAU,GAAG,GAAG;AACzC,UAAI,KAAK,QAAQ,KAAK,QAAQ,EAAE,SAAS,KAAK,EAAE,SAAS,GAAG;AACxD,aAAK,IAAI,YAAY,GAAG,EAAE;AAC1B,aAAK,IAAI,SAAS,GAAG,EAAE;AAAA,MAC3B,OACK;AACD,gBAAQ,MAAM,wBAAwB;AAAA,MAC1C;AAAA,IACJ;AAGA,IAAAA,QAAO,UAAU,UAAU,SAAU,MAAM,iBAAiB;AACxD,UAAI,OAAO,oBAAoB,aAAa;AACxC,0BAAkB;AAAA,MACtB;AACA,UAAI,YAAa,KAAK,EAAE,UAAS,IAAK,KAAM;AAC5C,UAAI,IAAI,gBAAgB,MAAM,SAAS;AACvC,UAAI,KAAK,MAAM;AACX,eAAO;AAAA,MACX;AACA,UAAI,IAAI,KAAK,SAAS,CAAC;AACvB,UAAI,KAAK,MAAM;AACX,eAAO;AAAA,MACX;AACA,UAAI,IAAI,EAAE,SAAS,EAAE;AACrB,UAAI,SAAS,EAAE;AAEf,eAAS,IAAI,GAAG,IAAI,YAAY,IAAI,QAAQ,KAAK;AAC7C,YAAI,MAAM;AAAA,MACd;AACA,aAAO;AAAA,IACX;AAGA,IAAAA,QAAO,UAAU,aAAa,SAAU,GAAG,GAAG,GAAG;AAC7C,UAAI,KAAK,QAAQ,KAAK,QAAQ,EAAE,SAAS,KAAK,EAAE,SAAS,GAAG;AACxD,aAAK,IAAI,YAAY,GAAG,EAAE;AAC1B,aAAK,IAAI,SAAS,GAAG,EAAE;AACvB,aAAK,IAAI,YAAY,GAAG,EAAE;AAAA,MAC9B,OACK;AACD,gBAAQ,MAAM,yBAAyB;AAAA,MAC3C;AAAA,IACJ;AAGA,IAAAA,QAAO,UAAU,eAAe,SAAU,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,GAAG;AAChE,UAAI,KAAK,QAAQ,KAAK,QAAQ,EAAE,SAAS,KAAK,EAAE,SAAS,GAAG;AACxD,aAAK,IAAI,YAAY,GAAG,EAAE;AAC1B,aAAK,IAAI,SAAS,GAAG,EAAE;AACvB,aAAK,IAAI,YAAY,GAAG,EAAE;AAC1B,aAAK,IAAI,YAAY,GAAG,EAAE;AAC1B,aAAK,IAAI,YAAY,GAAG,EAAE;AAC1B,aAAK,OAAO,YAAY,IAAI,EAAE;AAC9B,aAAK,OAAO,YAAY,IAAI,EAAE;AAC9B,aAAK,QAAQ,YAAY,GAAG,EAAE;AAAA,MAClC,OACK;AACD,gBAAQ,MAAM,yBAAyB;AAAA,MAC3C;AAAA,IACJ;AAGA,IAAAA,QAAO,UAAU,WAAW,SAAU,GAAG,GAAG;AACxC,UAAI,MAAM,IAAI,aAAY;AAC1B,UAAI,KAAK,KAAK;AACd,WAAK,IAAI,SAAS,GAAG,EAAE;AACvB,UAAI,KAAK,IAAI,WAAW,GAAG,EAAE;AAC7B,iBAAS;AACL,mBAAS;AACL,eAAK,IAAI,IAAI,WAAW,IAAI,IAAI,GAAG,GAAG;AACtC,cAAI,KAAK,EAAE,SAAS,WAAW,GAAG,EAAE,IAAI,EAAE,EAAE,UAAU,WAAW,GAAG,KAAK,KAAK,KAAK,EAAE,gBAAgB,EAAE,GAAG;AACtG;AAAA,UACJ;AAAA,QACJ;AACA,mBAAS;AACL,eAAK,IAAI,IAAI,WAAW,IAAI,GAAG,GAAG;AAClC,cAAI,KAAK,EAAE,SAAS,WAAW,GAAG,EAAE,IAAI,EAAE,EAAE,UAAU,WAAW,GAAG,KAAK,KAAK,KAAK,EAAE,gBAAgB,EAAE,GAAG;AACtG;AAAA,UACJ;AAAA,QACJ;AACA,YAAI,KAAK,EAAE,UAAU,KAAK,CAAC,KAAK,GAAG;AAC/B,cAAI,IAAI,KAAK;AACb,eAAK,IAAI,KAAK;AACd,eAAK,IAAI;AAAA,QACb;AACA,YAAI,KAAK,KAAK,EAAE,SAAS,WAAW,GAAG;AACvC,YAAI,KAAK,KAAK,EAAE,SAAS,WAAW,GAAG;AACvC,YAAI,MAAM,GAAG,SAAS,EAAE;AACxB,YAAI,IAAI,IAAI,EAAE,EAAE,UAAU,WAAW,GAAG,KAAK,GAAG;AAC5C,eAAK,IAAI,KAAK,EAAE,SAAS,KAAK,CAAC;AAC/B,eAAK,IAAI,GAAG,WAAW,GAAG;AAC1B,eAAK,OAAO,KAAK,EAAE,IAAI,EAAE;AACzB,eAAK,OAAO,KAAK,EAAE,IAAI,EAAE;AACzB,eAAK,QAAQ,KAAK,EAAE,WAAW,KAAK,CAAC;AACrC;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AAIA,IAAAA,QAAO,UAAU,UAAU,SAAU,OAAO;AACxC,UAAI,IAAI,YAAY,OAAO,EAAE;AAC7B,UAAI,IAAI,KAAK,UAAU,CAAC;AACxB,UAAI,KAAK,MAAM;AACX,eAAO;AAAA,MACX;AACA,aAAO,YAAY,GAAI,KAAK,EAAE,UAAS,IAAK,KAAM,CAAC;AAAA,IACvD;AAEA,IAAAA,QAAO,UAAU,gBAAgB,SAAU,GAAG,GAAG,UAAU;AACvD,UAAI,MAAM,IAAI,aAAY;AAC1B,UAAI,KAAK,KAAK;AACd,WAAK,IAAI,SAAS,GAAG,EAAE;AACvB,UAAI,KAAK,IAAI,WAAW,GAAG,EAAE;AAC7B,UAAI,MAAM;AAGV,UAAI,QAAQ,WAAY;AACpB,YAAI,QAAQ,WAAY;AACpB,cAAI,IAAI,EAAE,UAAU,IAAI,CAAC,KAAK,GAAG;AAC7B,gBAAI,IAAI,IAAI;AACZ,gBAAI,IAAI,IAAI;AACZ,gBAAI,IAAI;AAAA,UACZ;AACA,cAAI,KAAK,IAAI,EAAE,SAAS,WAAW,GAAG;AACtC,cAAI,KAAK,IAAI,EAAE,SAAS,WAAW,GAAG;AACtC,cAAI,MAAM,GAAG,SAAS,EAAE;AACxB,cAAI,IAAI,IAAI,EAAE,EAAE,UAAU,WAAW,GAAG,KAAK,GAAG;AAC5C,gBAAI,IAAI,IAAI,EAAE,SAAS,IAAI,CAAC;AAC5B,gBAAI,IAAI,GAAG,WAAW,GAAG;AACzB,gBAAI,OAAO,IAAI,EAAE,IAAI,EAAE;AACvB,gBAAI,OAAO,IAAI,EAAE,IAAI,EAAE;AACvB,gBAAI,QAAQ,IAAI,EAAE,WAAW,IAAI,CAAC;AAClC,uBAAW,WAAY;AAAE,uBAAQ;AAAA,YAAI,GAAG,CAAC;AAAA,UAC7C,OACK;AACD,uBAAW,OAAO,CAAC;AAAA,UACvB;AAAA,QACJ;AACA,YAAI,QAAQ,WAAY;AACpB,cAAI,IAAI,IAAG;AACX,cAAI,EAAE,gBAAgB,IAAI,GAAG,KAAK,WAAY;AAC1C,gBAAI,EAAE,SAAS,WAAW,GAAG,EAAE,KAAK,IAAI,SAAU,GAAG;AACjD,kBAAI,EAAE,UAAU,WAAW,GAAG,KAAK,KAAK,IAAI,EAAE,gBAAgB,EAAE,GAAG;AAC/D,2BAAW,OAAO,CAAC;AAAA,cACvB,OACK;AACD,2BAAW,OAAO,CAAC;AAAA,cACvB;AAAA,YACJ,CAAC;AAAA,UACL,CAAC;AAAA,QACL;AACA,YAAI,QAAQ,WAAY;AACpB,cAAI,IAAI,IAAG;AACX,cAAI,EAAE,gBAAgB,IAAI,IAAI,GAAG,KAAK,WAAY;AAC9C,gBAAI,EAAE,SAAS,WAAW,GAAG,EAAE,KAAK,IAAI,SAAU,GAAG;AACjD,kBAAI,EAAE,UAAU,WAAW,GAAG,KAAK,KAAK,IAAI,EAAE,gBAAgB,EAAE,GAAG;AAC/D,2BAAW,OAAO,CAAC;AAAA,cACvB,OACK;AACD,2BAAW,OAAO,CAAC;AAAA,cACvB;AAAA,YACJ,CAAC;AAAA,UACL,CAAC;AAAA,QACL;AACA,mBAAW,OAAO,CAAC;AAAA,MACvB;AACA,iBAAW,OAAO,CAAC;AAAA,IACvB;AACA,IAAAA,QAAO,UAAU,OAAO,SAAU,MAAM,cAAc,YAAY;AAC9D,UAAI,SAAS,gBAAgB,UAAU;AACvC,UAAI,SAAS,SAAS,aAAa,IAAI,EAAE,SAAQ;AACjD,UAAI,YAAY,KAAK,EAAE,UAAS,IAAK;AACrC,UAAI,IAAI,UAAU,QAAQ,SAAS;AACnC,UAAI,KAAK,MAAM;AACX,eAAO;AAAA,MACX;AACA,UAAI,IAAI,KAAK,UAAU,CAAC;AACxB,UAAI,KAAK,MAAM;AACX,eAAO;AAAA,MACX;AACA,UAAI,IAAI,EAAE,SAAS,EAAE;AACrB,UAAI,SAAS,EAAE;AAEf,eAAS,IAAI,GAAG,IAAI,YAAY,QAAQ,KAAK;AACzC,YAAI,MAAM;AAAA,MACd;AACA,aAAO;AAAA,IACX;AACA,IAAAA,QAAO,UAAU,SAAS,SAAU,MAAM,WAAW,cAAc;AAC/D,UAAI,IAAI,YAAY,WAAW,EAAE;AACjC,UAAI,IAAI,KAAK,SAAS,CAAC;AACvB,UAAI,KAAK,MAAM;AACX,eAAO;AAAA,MACX;AACA,UAAI,WAAW,EAAE,SAAS,EAAE,EAAE,QAAQ,UAAU,EAAE;AAClD,UAAI,SAAS,mBAAmB,QAAQ;AACxC,aAAO,UAAU,aAAa,IAAI,EAAE,SAAQ;AAAA,IAChD;AACA,WAAOA;AAAA,EACX,GAAC;AAAA;AAGD,SAAS,YAAY,GAAG,GAAG;AACvB,MAAI,IAAI,EAAE,YAAW;AACrB,MAAI,IAAI;AACR,SAAO,IAAI,EAAE,UAAU,EAAE,CAAC,KAAK,GAAG;AAC9B,MAAE;AAAA,EACN;AACA,MAAI,EAAE,SAAS,KAAK,IAAI,KAAK,EAAE,CAAC,KAAK,GAAG;AACpC,WAAO;AAAA,EACX;AACA,IAAE;AACF,SAAO,EAAE,CAAC,KAAK,GAAG;AACd,QAAI,EAAE,KAAK,EAAE,QAAQ;AACjB,aAAO;AAAA,IACX;AAAA,EACJ;AACA,MAAI,MAAM;AACV,SAAO,EAAE,IAAI,EAAE,QAAQ;AACnB,QAAI,IAAI,EAAE,CAAC,IAAI;AACf,QAAI,IAAI,KAAK;AACT,aAAO,OAAO,aAAa,CAAC;AAAA,IAChC,WACU,IAAI,OAAS,IAAI,KAAM;AAC7B,aAAO,OAAO,cAAe,IAAI,OAAO,IAAM,EAAE,IAAI,CAAC,IAAI,EAAG;AAC5D,QAAE;AAAA,IACN,OACK;AACD,aAAO,OAAO,cAAe,IAAI,OAAO,MAAQ,EAAE,IAAI,CAAC,IAAI,OAAO,IAAM,EAAE,IAAI,CAAC,IAAI,EAAG;AACtF,WAAK;AAAA,IACT;AAAA,EACJ;AACA,SAAO;AACX;AAEA,IAAI,iBAAiB;AAAA,EACjB,KAAK;AAAA,EACL,KAAK;AAAA,EACL,MAAM;AAAA,EACN,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,WAAW;AACf;AACA,SAAS,gBAAgB,MAAM;AAC3B,SAAO,eAAe,IAAI,KAAK;AACnC;AACA,SAAS,mBAAmB,KAAK;AAC7B,WAAS,UAAU,gBAAgB;AAC/B,QAAI,eAAe,eAAe,MAAM,GAAG;AACvC,UAAI,SAAS,eAAe,MAAM;AAClC,UAAI,MAAM,OAAO;AACjB,UAAI,IAAI,UAAU,GAAG,GAAG,KAAK,QAAQ;AACjC,eAAO,IAAI,UAAU,GAAG;AAAA,MAC5B;AAAA,IACJ;AAAA,EACJ;AACA,SAAO;AACX;","x_google_ignoreList":[0]}