pixel-react 1.14.87 → 1.14.89

package/lib/node_modules/jsencrypt/lib/lib/jsbn/sha256.js

@@ -1,307 +0,0 @@
-/*
- * A JavaScript implementation of the Secure Hash Algorithm, SHA-256, as defined
- * in FIPS 180-2
- * Version 2.2 Copyright Angel Marin, Paul Johnston 2000 - 2009.
- * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
- * Distributed under the BSD License
- * See http://pajhome.org.uk/crypt/md5 for details.
- * Also http://anmar.eu.org/projects/jssha2/
- */
-// /*
-//  * Configurable variables. You may need to tweak these to be compatible with
-//  * the server-side, but the defaults work in most cases.
-//  */
-// var hexcase = 0; /* hex output format. 0 - lowercase; 1 - uppercase        */
-// var b64pad = ""; /* base-64 pad character. "=" for strict RFC compliance   */
-// /*
-//  * These are the functions you'll usually want to call
-//  * They take string arguments and return either hex or base-64 encoded strings
-//  */
-// function hex_sha256(s: string) {
-//     return rstr2hex(rstr_sha256(str2rstr_utf8(s)));
-// }
-// function b64_sha256(s: string) {
-//     return rstr2b64(rstr_sha256(str2rstr_utf8(s)));
-// }
-// function any_sha256(s: string, e: any) {
-//     return rstr2any(rstr_sha256(str2rstr_utf8(s)), e);
-// }
-// function hex_hmac_sha256(k: string, d: any) {
-//     return rstr2hex(rstr_hmac_sha256(str2rstr_utf8(k), str2rstr_utf8(d)));
-// }
-// function b64_hmac_sha256(k: string, d: any) {
-//     return rstr2b64(rstr_hmac_sha256(str2rstr_utf8(k), str2rstr_utf8(d)));
-// }
-// function any_hmac_sha256(k: string, d: string, e: any) {
-//     return rstr2any(rstr_hmac_sha256(str2rstr_utf8(k), str2rstr_utf8(d)), e);
-// }
-// /*
-//  * Perform a simple self-test to see if the VM is working
-//  */
-// function sha256_vm_test() {
-//     return (
-//         hex_sha256("abc").toLowerCase() ==
-//         "ba7816bf8f01cfea414140de5dae2223b00361a396177a9cb410ff61f20015ad"
-//     );
-// }
-/*
- * Calculate the sha256 of a raw string
- */
-function rstr_sha256(s) {
-  return binb2rstr(binb_sha256(rstr2binb(s), s.length * 8));
-}
-// /*
-//  * Calculate the HMAC-sha256 of a key and some data (raw strings)
-//  */
-// function rstr_hmac_sha256(key: string, data: any) {
-//     var bkey = rstr2binb(key);
-//     if (bkey.length > 16) bkey = binb_sha256(bkey, key.length * 8);
-//     var ipad = Array(16),
-//         opad = Array(16);
-//     for (var i = 0; i < 16; i++) {
-//         ipad[i] = bkey[i] ^ 0x36363636;
-//         opad[i] = bkey[i] ^ 0x5c5c5c5c;
-//     }
-//     var hash = binb_sha256(ipad.concat(rstr2binb(data)), 512 + data.length * 8);
-//     return binb2rstr(binb_sha256(opad.concat(hash), 512 + 256));
-// }
-// /*
-//  * Convert a raw string to a hex string
-//  */
-function rstr2hex(input) {
-  var hex_tab = "0123456789abcdef";
-  var output = "";
-  for (var i = 0; i < input.length; i++) {
-    var x = input.charCodeAt(i);
-    output += hex_tab.charAt(x >>> 4 & 0x0f) + hex_tab.charAt(x & 0x0f);
-  }
-  return output;
-}
-// /*
-//  * Convert a raw string to a base-64 string
-//  */
-// function rstr2b64(input: string) {
-//     try {
-//         b64pad;
-//     } catch (e) {
-//         b64pad = "";
-//     }
-//     var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
-//     var output = "";
-//     var len = input.length;
-//     for (var i = 0; i < len; i += 3) {
-//         var triplet =
-//             (input.charCodeAt(i) << 16) |
-//             (i + 1 < len ? input.charCodeAt(i + 1) << 8 : 0) |
-//             (i + 2 < len ? input.charCodeAt(i + 2) : 0);
-//         for (var j = 0; j < 4; j++) {
-//             if (i * 8 + j * 6 > input.length * 8) output += b64pad;
-//             else output += tab.charAt((triplet >>> (6 * (3 - j))) & 0x3f);
-//         }
-//     }
-//     return output;
-// }
-// /*
-//  * Convert a raw string to an arbitrary string encoding
-//  */
-// function rstr2any(input: string, encoding: string) {
-//     var divisor = encoding.length;
-//     var remainders = Array();
-//     var i, q, x, quotient;
-//     /* Convert to an array of 16-bit big-endian values, forming the dividend */
-//     var dividend = Array(Math.ceil(input.length / 2));
-//     for (i = 0; i < dividend.length; i++) {
-//         dividend[i] = (input.charCodeAt(i * 2) << 8) | input.charCodeAt(i * 2 + 1);
-//     }
-//     /*
-//      * Repeatedly perform a long division. The binary array forms the dividend,
-//      * the length of the encoding is the divisor. Once computed, the quotient
-//      * forms the dividend for the next step. We stop when the dividend is zero.
-//      * All remainders are stored for later use.
-//      */
-//     while (dividend.length > 0) {
-//         quotient = Array();
-//         x = 0;
-//         for (i = 0; i < dividend.length; i++) {
-//             x = (x << 16) + dividend[i];
-//             q = Math.floor(x / divisor);
-//             x -= q * divisor;
-//             if (quotient.length > 0 || q > 0) quotient[quotient.length] = q;
-//         }
-//         remainders[remainders.length] = x;
-//         dividend = quotient;
-//     }
-//     /* Convert the remainders to the output string */
-//     var output = "";
-//     for (i = remainders.length - 1; i >= 0; i--) output += encoding.charAt(remainders[i]);
-//     /* Append leading zero equivalents */
-//     var full_length = Math.ceil(
-//         (input.length * 8) / (Math.log(encoding.length) / Math.log(2)),
-//     );
-//     for (i = output.length; i < full_length; i++) output = encoding[0] + output;
-//     return output;
-// }
-// /*
-//  * Encode a string as utf-8.
-//  * For efficiency, this assumes the input is valid utf-16.
-//  */
-// function str2rstr_utf8(input: string) {
-//     var output = "";
-//     var i = -1;
-//     var x, y;
-//     while (++i < input.length) {
-//         /* Decode utf-16 surrogate pairs */
-//         x = input.charCodeAt(i);
-//         y = i + 1 < input.length ? input.charCodeAt(i + 1) : 0;
-//         if (0xd800 <= x && x <= 0xdbff && 0xdc00 <= y && y <= 0xdfff) {
-//             x = 0x10000 + ((x & 0x03ff) << 10) + (y & 0x03ff);
-//             i++;
-//         }
-//         /* Encode output as utf-8 */
-//         if (x <= 0x7f) output += String.fromCharCode(x);
-//         else if (x <= 0x7ff)
-//             output += String.fromCharCode(0xc0 | ((x >>> 6) & 0x1f), 0x80 | (x & 0x3f));
-//         else if (x <= 0xffff)
-//             output += String.fromCharCode(
-//                 0xe0 | ((x >>> 12) & 0x0f),
-//                 0x80 | ((x >>> 6) & 0x3f),
-//                 0x80 | (x & 0x3f),
-//             );
-//         else if (x <= 0x1fffff)
-//             output += String.fromCharCode(
-//                 0xf0 | ((x >>> 18) & 0x07),
-//                 0x80 | ((x >>> 12) & 0x3f),
-//                 0x80 | ((x >>> 6) & 0x3f),
-//                 0x80 | (x & 0x3f),
-//             );
-//     }
-//     return output;
-// }
-// /*
-//  * Encode a string as utf-16
-//  */
-// function str2rstr_utf16le(input: string) {
-//     var output = "";
-//     for (var i = 0; i < input.length; i++)
-//         output += String.fromCharCode(
-//             input.charCodeAt(i) & 0xff,
-//             (input.charCodeAt(i) >>> 8) & 0xff,
-//         );
-//     return output;
-// }
-// function str2rstr_utf16be(input: string) {
-//     var output = "";
-//     for (var i = 0; i < input.length; i++)
-//         output += String.fromCharCode(
-//             (input.charCodeAt(i) >>> 8) & 0xff,
-//             input.charCodeAt(i) & 0xff,
-//         );
-//     return output;
-// }
-/*
- * Convert a raw string to an array of big-endian words
- * Characters >255 have their high-byte silently ignored.
- */
-function rstr2binb(input) {
-  var output = Array(input.length >> 2);
-  for (var i = 0; i < output.length; i++) output[i] = 0;
-  for (var i = 0; i < input.length * 8; i += 8) output[i >> 5] |= (input.charCodeAt(i / 8) & 0xff) << 24 - i % 32;
-  return output;
-}
-/*
- * Convert an array of big-endian words to a string
- */
-function binb2rstr(input) {
-  var output = "";
-  for (var i = 0; i < input.length * 32; i += 8) output += String.fromCharCode(input[i >> 5] >>> 24 - i % 32 & 0xff);
-  return output;
-}
-/*
- * Main sha256 function, with its support functions
- */
-function sha256_S(X, n) {
-  return X >>> n | X << 32 - n;
-}
-function sha256_R(X, n) {
-  return X >>> n;
-}
-function sha256_Ch(x, y, z) {
-  return x & y ^ ~x & z;
-}
-function sha256_Maj(x, y, z) {
-  return x & y ^ x & z ^ y & z;
-}
-function sha256_Sigma0256(x) {
-  return sha256_S(x, 2) ^ sha256_S(x, 13) ^ sha256_S(x, 22);
-}
-function sha256_Sigma1256(x) {
-  return sha256_S(x, 6) ^ sha256_S(x, 11) ^ sha256_S(x, 25);
-}
-function sha256_Gamma0256(x) {
-  return sha256_S(x, 7) ^ sha256_S(x, 18) ^ sha256_R(x, 3);
-}
-function sha256_Gamma1256(x) {
-  return sha256_S(x, 17) ^ sha256_S(x, 19) ^ sha256_R(x, 10);
-}
-// function sha256_Sigma0512(x: number) {
-//     return sha256_S(x, 28) ^ sha256_S(x, 34) ^ sha256_S(x, 39);
-// }
-// function sha256_Sigma1512(x: number) {
-//     return sha256_S(x, 14) ^ sha256_S(x, 18) ^ sha256_S(x, 41);
-// }
-// function sha256_Gamma0512(x: number) {
-//     return sha256_S(x, 1) ^ sha256_S(x, 8) ^ sha256_R(x, 7);
-// }
-// function sha256_Gamma1512(x: number) {
-//     return sha256_S(x, 19) ^ sha256_S(x, 61) ^ sha256_R(x, 6);
-// }
-var sha256_K = new Array(1116352408, 1899447441, -1245643825, -373957723, 961987163, 1508970993, -1841331548, -1424204075, -670586216, 310598401, 607225278, 1426881987, 1925078388, -2132889090, -1680079193, -1046744716, -459576895, -272742522, 264347078, 604807628, 770255983, 1249150122, 1555081692, 1996064986, -1740746414, -1473132947, -1341970488, -1084653625, -958395405, -710438585, 113926993, 338241895, 666307205, 773529912, 1294757372, 1396182291, 1695183700, 1986661051, -2117940946, -1838011259, -1564481375, -1474664885, -1035236496, -949202525, -778901479, -694614492, -200395387, 275423344, 430227734, 506948616, 659060556, 883997877, 958139571, 1322822218, 1537002063, 1747873779, 1955562222, 2024104815, -2067236844, -1933114872, -1866530822, -1538233109, -1090935817, -965641998);
-function binb_sha256(m, l) {
-  var HASH = new Array(1779033703, -1150833019, 1013904242, -1521486534, 1359893119, -1694144372, 528734635, 1541459225);
-  var W = new Array(64);
-  var a, b, c, d, e, f, g, h;
-  var i, j, T1, T2;
-  /* append padding */
-  m[l >> 5] |= 0x80 << 24 - l % 32;
-  m[(l + 64 >> 9 << 4) + 15] = l;
-  for (i = 0; i < m.length; i += 16) {
-    a = HASH[0];
-    b = HASH[1];
-    c = HASH[2];
-    d = HASH[3];
-    e = HASH[4];
-    f = HASH[5];
-    g = HASH[6];
-    h = HASH[7];
-    for (j = 0; j < 64; j++) {
-      if (j < 16) W[j] = m[j + i];else W[j] = safe_add(safe_add(safe_add(sha256_Gamma1256(W[j - 2]), W[j - 7]), sha256_Gamma0256(W[j - 15])), W[j - 16]);
-      T1 = safe_add(safe_add(safe_add(safe_add(h, sha256_Sigma1256(e)), sha256_Ch(e, f, g)), sha256_K[j]), W[j]);
-      T2 = safe_add(sha256_Sigma0256(a), sha256_Maj(a, b, c));
-      h = g;
-      g = f;
-      f = e;
-      e = safe_add(d, T1);
-      d = c;
-      c = b;
-      b = a;
-      a = safe_add(T1, T2);
-    }
-    HASH[0] = safe_add(a, HASH[0]);
-    HASH[1] = safe_add(b, HASH[1]);
-    HASH[2] = safe_add(c, HASH[2]);
-    HASH[3] = safe_add(d, HASH[3]);
-    HASH[4] = safe_add(e, HASH[4]);
-    HASH[5] = safe_add(f, HASH[5]);
-    HASH[6] = safe_add(g, HASH[6]);
-    HASH[7] = safe_add(h, HASH[7]);
-  }
-  return HASH;
-}
-function safe_add(x, y) {
-  var lsw = (x & 0xffff) + (y & 0xffff);
-  var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
-  return msw << 16 | lsw & 0xffff;
-}
-
-export { rstr2hex, rstr_sha256 };
-//# sourceMappingURL=sha256.js.map

package/lib/node_modules/jsencrypt/lib/lib/jsbn/sha256.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"sha256.js","sources":["../../../../../../node_modules/jsencrypt/lib/lib/jsbn/sha256.js"],"sourcesContent":["/*\n * A JavaScript implementation of the Secure Hash Algorithm, SHA-256, as defined\n * in FIPS 180-2\n * Version 2.2 Copyright Angel Marin, Paul Johnston 2000 - 2009.\n * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet\n * Distributed under the BSD License\n * See http://pajhome.org.uk/crypt/md5 for details.\n * Also http://anmar.eu.org/projects/jssha2/\n */\n// /*\n//  * Configurable variables. You may need to tweak these to be compatible with\n//  * the server-side, but the defaults work in most cases.\n//  */\n// var hexcase = 0; /* hex output format. 0 - lowercase; 1 - uppercase        */\n// var b64pad = \"\"; /* base-64 pad character. \"=\" for strict RFC compliance   */\n// /*\n//  * These are the functions you'll usually want to call\n//  * They take string arguments and return either hex or base-64 encoded strings\n//  */\n// function hex_sha256(s: string) {\n//     return rstr2hex(rstr_sha256(str2rstr_utf8(s)));\n// }\n// function b64_sha256(s: string) {\n//     return rstr2b64(rstr_sha256(str2rstr_utf8(s)));\n// }\n// function any_sha256(s: string, e: any) {\n//     return rstr2any(rstr_sha256(str2rstr_utf8(s)), e);\n// }\n// function hex_hmac_sha256(k: string, d: any) {\n//     return rstr2hex(rstr_hmac_sha256(str2rstr_utf8(k), str2rstr_utf8(d)));\n// }\n// function b64_hmac_sha256(k: string, d: any) {\n//     return rstr2b64(rstr_hmac_sha256(str2rstr_utf8(k), str2rstr_utf8(d)));\n// }\n// function any_hmac_sha256(k: string, d: string, e: any) {\n//     return rstr2any(rstr_hmac_sha256(str2rstr_utf8(k), str2rstr_utf8(d)), e);\n// }\n// /*\n//  * Perform a simple self-test to see if the VM is working\n//  */\n// function sha256_vm_test() {\n//     return (\n//         hex_sha256(\"abc\").toLowerCase() ==\n//         \"ba7816bf8f01cfea414140de5dae2223b00361a396177a9cb410ff61f20015ad\"\n//     );\n// }\n/*\n * Calculate the sha256 of a raw string\n */\nexport function rstr_sha256(s) {\n    return binb2rstr(binb_sha256(rstr2binb(s), s.length * 8));\n}\n// /*\n//  * Calculate the HMAC-sha256 of a key and some data (raw strings)\n//  */\n// function rstr_hmac_sha256(key: string, data: any) {\n//     var bkey = rstr2binb(key);\n//     if (bkey.length > 16) bkey = binb_sha256(bkey, key.length * 8);\n//     var ipad = Array(16),\n//         opad = Array(16);\n//     for (var i = 0; i < 16; i++) {\n//         ipad[i] = bkey[i] ^ 0x36363636;\n//         opad[i] = bkey[i] ^ 0x5c5c5c5c;\n//     }\n//     var hash = binb_sha256(ipad.concat(rstr2binb(data)), 512 + data.length * 8);\n//     return binb2rstr(binb_sha256(opad.concat(hash), 512 + 256));\n// }\n// /*\n//  * Convert a raw string to a hex string\n//  */\nexport function rstr2hex(input) {\n    var hex_tab = \"0123456789abcdef\";\n    var output = \"\";\n    for (var i = 0; i < input.length; i++) {\n        var x = input.charCodeAt(i);\n        output += hex_tab.charAt((x >>> 4) & 0x0f) + hex_tab.charAt(x & 0x0f);\n    }\n    return output;\n}\n// /*\n//  * Convert a raw string to a base-64 string\n//  */\n// function rstr2b64(input: string) {\n//     try {\n//         b64pad;\n//     } catch (e) {\n//         b64pad = \"\";\n//     }\n//     var tab = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\";\n//     var output = \"\";\n//     var len = input.length;\n//     for (var i = 0; i < len; i += 3) {\n//         var triplet =\n//             (input.charCodeAt(i) << 16) |\n//             (i + 1 < len ? input.charCodeAt(i + 1) << 8 : 0) |\n//             (i + 2 < len ? input.charCodeAt(i + 2) : 0);\n//         for (var j = 0; j < 4; j++) {\n//             if (i * 8 + j * 6 > input.length * 8) output += b64pad;\n//             else output += tab.charAt((triplet >>> (6 * (3 - j))) & 0x3f);\n//         }\n//     }\n//     return output;\n// }\n// /*\n//  * Convert a raw string to an arbitrary string encoding\n//  */\n// function rstr2any(input: string, encoding: string) {\n//     var divisor = encoding.length;\n//     var remainders = Array();\n//     var i, q, x, quotient;\n//     /* Convert to an array of 16-bit big-endian values, forming the dividend */\n//     var dividend = Array(Math.ceil(input.length / 2));\n//     for (i = 0; i < dividend.length; i++) {\n//         dividend[i] = (input.charCodeAt(i * 2) << 8) | input.charCodeAt(i * 2 + 1);\n//     }\n//     /*\n//      * Repeatedly perform a long division. The binary array forms the dividend,\n//      * the length of the encoding is the divisor. Once computed, the quotient\n//      * forms the dividend for the next step. We stop when the dividend is zero.\n//      * All remainders are stored for later use.\n//      */\n//     while (dividend.length > 0) {\n//         quotient = Array();\n//         x = 0;\n//         for (i = 0; i < dividend.length; i++) {\n//             x = (x << 16) + dividend[i];\n//             q = Math.floor(x / divisor);\n//             x -= q * divisor;\n//             if (quotient.length > 0 || q > 0) quotient[quotient.length] = q;\n//         }\n//         remainders[remainders.length] = x;\n//         dividend = quotient;\n//     }\n//     /* Convert the remainders to the output string */\n//     var output = \"\";\n//     for (i = remainders.length - 1; i >= 0; i--) output += encoding.charAt(remainders[i]);\n//     /* Append leading zero equivalents */\n//     var full_length = Math.ceil(\n//         (input.length * 8) / (Math.log(encoding.length) / Math.log(2)),\n//     );\n//     for (i = output.length; i < full_length; i++) output = encoding[0] + output;\n//     return output;\n// }\n// /*\n//  * Encode a string as utf-8.\n//  * For efficiency, this assumes the input is valid utf-16.\n//  */\n// function str2rstr_utf8(input: string) {\n//     var output = \"\";\n//     var i = -1;\n//     var x, y;\n//     while (++i < input.length) {\n//         /* Decode utf-16 surrogate pairs */\n//         x = input.charCodeAt(i);\n//         y = i + 1 < input.length ? input.charCodeAt(i + 1) : 0;\n//         if (0xd800 <= x && x <= 0xdbff && 0xdc00 <= y && y <= 0xdfff) {\n//             x = 0x10000 + ((x & 0x03ff) << 10) + (y & 0x03ff);\n//             i++;\n//         }\n//         /* Encode output as utf-8 */\n//         if (x <= 0x7f) output += String.fromCharCode(x);\n//         else if (x <= 0x7ff)\n//             output += String.fromCharCode(0xc0 | ((x >>> 6) & 0x1f), 0x80 | (x & 0x3f));\n//         else if (x <= 0xffff)\n//             output += String.fromCharCode(\n//                 0xe0 | ((x >>> 12) & 0x0f),\n//                 0x80 | ((x >>> 6) & 0x3f),\n//                 0x80 | (x & 0x3f),\n//             );\n//         else if (x <= 0x1fffff)\n//             output += String.fromCharCode(\n//                 0xf0 | ((x >>> 18) & 0x07),\n//                 0x80 | ((x >>> 12) & 0x3f),\n//                 0x80 | ((x >>> 6) & 0x3f),\n//                 0x80 | (x & 0x3f),\n//             );\n//     }\n//     return output;\n// }\n// /*\n//  * Encode a string as utf-16\n//  */\n// function str2rstr_utf16le(input: string) {\n//     var output = \"\";\n//     for (var i = 0; i < input.length; i++)\n//         output += String.fromCharCode(\n//             input.charCodeAt(i) & 0xff,\n//             (input.charCodeAt(i) >>> 8) & 0xff,\n//         );\n//     return output;\n// }\n// function str2rstr_utf16be(input: string) {\n//     var output = \"\";\n//     for (var i = 0; i < input.length; i++)\n//         output += String.fromCharCode(\n//             (input.charCodeAt(i) >>> 8) & 0xff,\n//             input.charCodeAt(i) & 0xff,\n//         );\n//     return output;\n// }\n/*\n * Convert a raw string to an array of big-endian words\n * Characters >255 have their high-byte silently ignored.\n */\nfunction rstr2binb(input) {\n    var output = Array(input.length >> 2);\n    for (var i = 0; i < output.length; i++)\n        output[i] = 0;\n    for (var i = 0; i < input.length * 8; i += 8)\n        output[i >> 5] |= (input.charCodeAt(i / 8) & 0xff) << (24 - (i % 32));\n    return output;\n}\n/*\n * Convert an array of big-endian words to a string\n */\nfunction binb2rstr(input) {\n    var output = \"\";\n    for (var i = 0; i < input.length * 32; i += 8)\n        output += String.fromCharCode((input[i >> 5] >>> (24 - (i % 32))) & 0xff);\n    return output;\n}\n/*\n * Main sha256 function, with its support functions\n */\nfunction sha256_S(X, n) {\n    return (X >>> n) | (X << (32 - n));\n}\nfunction sha256_R(X, n) {\n    return X >>> n;\n}\nfunction sha256_Ch(x, y, z) {\n    return (x & y) ^ (~x & z);\n}\nfunction sha256_Maj(x, y, z) {\n    return (x & y) ^ (x & z) ^ (y & z);\n}\nfunction sha256_Sigma0256(x) {\n    return sha256_S(x, 2) ^ sha256_S(x, 13) ^ sha256_S(x, 22);\n}\nfunction sha256_Sigma1256(x) {\n    return sha256_S(x, 6) ^ sha256_S(x, 11) ^ sha256_S(x, 25);\n}\nfunction sha256_Gamma0256(x) {\n    return sha256_S(x, 7) ^ sha256_S(x, 18) ^ sha256_R(x, 3);\n}\nfunction sha256_Gamma1256(x) {\n    return sha256_S(x, 17) ^ sha256_S(x, 19) ^ sha256_R(x, 10);\n}\n// function sha256_Sigma0512(x: number) {\n//     return sha256_S(x, 28) ^ sha256_S(x, 34) ^ sha256_S(x, 39);\n// }\n// function sha256_Sigma1512(x: number) {\n//     return sha256_S(x, 14) ^ sha256_S(x, 18) ^ sha256_S(x, 41);\n// }\n// function sha256_Gamma0512(x: number) {\n//     return sha256_S(x, 1) ^ sha256_S(x, 8) ^ sha256_R(x, 7);\n// }\n// function sha256_Gamma1512(x: number) {\n//     return sha256_S(x, 19) ^ sha256_S(x, 61) ^ sha256_R(x, 6);\n// }\nvar sha256_K = new Array(1116352408, 1899447441, -1245643825, -373957723, 961987163, 1508970993, -1841331548, -1424204075, -670586216, 310598401, 607225278, 1426881987, 1925078388, -2132889090, -1680079193, -1046744716, -459576895, -272742522, 264347078, 604807628, 770255983, 1249150122, 1555081692, 1996064986, -1740746414, -1473132947, -1341970488, -1084653625, -958395405, -710438585, 113926993, 338241895, 666307205, 773529912, 1294757372, 1396182291, 1695183700, 1986661051, -2117940946, -1838011259, -1564481375, -1474664885, -1035236496, -949202525, -778901479, -694614492, -200395387, 275423344, 430227734, 506948616, 659060556, 883997877, 958139571, 1322822218, 1537002063, 1747873779, 1955562222, 2024104815, -2067236844, -1933114872, -1866530822, -1538233109, -1090935817, -965641998);\nfunction binb_sha256(m, l) {\n    var HASH = new Array(1779033703, -1150833019, 1013904242, -1521486534, 1359893119, -1694144372, 528734635, 1541459225);\n    var W = new Array(64);\n    var a, b, c, d, e, f, g, h;\n    var i, j, T1, T2;\n    /* append padding */\n    m[l >> 5] |= 0x80 << (24 - (l % 32));\n    m[(((l + 64) >> 9) << 4) + 15] = l;\n    for (i = 0; i < m.length; i += 16) {\n        a = HASH[0];\n        b = HASH[1];\n        c = HASH[2];\n        d = HASH[3];\n        e = HASH[4];\n        f = HASH[5];\n        g = HASH[6];\n        h = HASH[7];\n        for (j = 0; j < 64; j++) {\n            if (j < 16)\n                W[j] = m[j + i];\n            else\n                W[j] = safe_add(safe_add(safe_add(sha256_Gamma1256(W[j - 2]), W[j - 7]), sha256_Gamma0256(W[j - 15])), W[j - 16]);\n            T1 = safe_add(safe_add(safe_add(safe_add(h, sha256_Sigma1256(e)), sha256_Ch(e, f, g)), sha256_K[j]), W[j]);\n            T2 = safe_add(sha256_Sigma0256(a), sha256_Maj(a, b, c));\n            h = g;\n            g = f;\n            f = e;\n            e = safe_add(d, T1);\n            d = c;\n            c = b;\n            b = a;\n            a = safe_add(T1, T2);\n        }\n        HASH[0] = safe_add(a, HASH[0]);\n        HASH[1] = safe_add(b, HASH[1]);\n        HASH[2] = safe_add(c, HASH[2]);\n        HASH[3] = safe_add(d, HASH[3]);\n        HASH[4] = safe_add(e, HASH[4]);\n        HASH[5] = safe_add(f, HASH[5]);\n        HASH[6] = safe_add(g, HASH[6]);\n        HASH[7] = safe_add(h, HASH[7]);\n    }\n    return HASH;\n}\nfunction safe_add(x, y) {\n    var lsw = (x & 0xffff) + (y & 0xffff);\n    var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n    return (msw << 16) | (lsw & 0xffff);\n}\n"],"names":["rstr_sha256","s","binb2rstr","binb_sha256","rstr2binb","length","rstr2hex","input","hex_tab","output","i","x","charCodeAt","charAt","Array","String","fromCharCode","sha256_S","X","n","sha256_R","sha256_Ch","y","z","sha256_Maj","sha256_Sigma0256","sha256_Sigma1256","sha256_Gamma0256","sha256_Gamma1256","sha256_K","m","l","HASH","W","a","b","c","d","e","f","g","h","j","T1","T2","safe_add","lsw","msw"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASA,WAAWA,CAACC,CAAC,EAAE;AAC3B,EAAA,OAAOC,SAAS,CAACC,WAAW,CAACC,SAAS,CAACH,CAAC,CAAC,EAAEA,CAAC,CAACI,MAAM,GAAG,CAAC,CAAC,CAAC;AAC7D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASC,QAAQA,CAACC,KAAK,EAAE;EAC5B,IAAIC,OAAO,GAAG,kBAAkB;EAChC,IAAIC,MAAM,GAAG,EAAE;AACf,EAAA,KAAK,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGH,KAAK,CAACF,MAAM,EAAEK,CAAC,EAAE,EAAE;AACnC,IAAA,IAAIC,CAAC,GAAGJ,KAAK,CAACK,UAAU,CAACF,CAAC,CAAC;AAC3BD,IAAAA,MAAM,IAAID,OAAO,CAACK,MAAM,CAAEF,CAAC,KAAK,CAAC,GAAI,IAAI,CAAC,GAAGH,OAAO,CAACK,MAAM,CAACF,CAAC,GAAG,IAAI,CAAC;AACzE,EAAA;AACA,EAAA,OAAOF,MAAM;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASL,SAASA,CAACG,KAAK,EAAE;EACtB,IAAIE,MAAM,GAAGK,KAAK,CAACP,KAAK,CAACF,MAAM,IAAI,CAAC,CAAC;AACrC,EAAA,KAAK,IAAIK,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGD,MAAM,CAACJ,MAAM,EAAEK,CAAC,EAAE,EAClCD,MAAM,CAACC,CAAC,CAAC,GAAG,CAAC;AACjB,EAAA,KAAK,IAAIA,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGH,KAAK,CAACF,MAAM,GAAG,CAAC,EAAEK,CAAC,IAAI,CAAC,EACxCD,MAAM,CAACC,CAAC,IAAI,CAAC,CAAC,IAAI,CAACH,KAAK,CAACK,UAAU,CAACF,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,KAAM,EAAE,GAAIA,CAAC,GAAG,EAAI;AACzE,EAAA,OAAOD,MAAM;AACjB;AACA;AACA;AACA;AACA,SAASP,SAASA,CAACK,KAAK,EAAE;EACtB,IAAIE,MAAM,GAAG,EAAE;AACf,EAAA,KAAK,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGH,KAAK,CAACF,MAAM,GAAG,EAAE,EAAEK,CAAC,IAAI,CAAC,EACzCD,MAAM,IAAIM,MAAM,CAACC,YAAY,CAAET,KAAK,CAACG,CAAC,IAAI,CAAC,CAAC,KAAM,EAAE,GAAIA,CAAC,GAAG,EAAI,GAAI,IAAI,CAAC;AAC7E,EAAA,OAAOD,MAAM;AACjB;AACA;AACA;AACA;AACA,SAASQ,QAAQA,CAACC,CAAC,EAAEC,CAAC,EAAE;EACpB,OAAQD,CAAC,KAAKC,CAAC,GAAKD,CAAC,IAAK,EAAE,GAAGC,CAAG;AACtC;AACA,SAASC,QAAQA,CAACF,CAAC,EAAEC,CAAC,EAAE;EACpB,OAAOD,CAAC,KAAKC,CAAC;AAClB;AACA,SAASE,SAASA,CAACV,CAAC,EAAEW,CAAC,EAAEC,CAAC,EAAE;AACxB,EAAA,OAAQZ,CAAC,GAAGW,CAAC,GAAK,CAACX,CAAC,GAAGY,CAAE;AAC7B;AACA,SAASC,UAAUA,CAACb,CAAC,EAAEW,CAAC,EAAEC,CAAC,EAAE;EACzB,OAAQZ,CAAC,GAAGW,CAAC,GAAKX,CAAC,GAAGY,CAAE,GAAID,CAAC,GAAGC,CAAE;AACtC;AACA,SAASE,gBAAgBA,CAACd,CAAC,EAAE;AACzB,EAAA,OAAOM,QAAQ,CAACN,CAAC,EAAE,CAAC,CAAC,GAAGM,QAAQ,CAACN,CAAC,EAAE,EAAE,CAAC,GAAGM,QAAQ,CAACN,CAAC,EAAE,EAAE,CAAC;AAC7D;AACA,SAASe,gBAAgBA,CAACf,CAAC,EAAE;AACzB,EAAA,OAAOM,QAAQ,CAACN,CAAC,EAAE,CAAC,CAAC,GAAGM,QAAQ,CAACN,CAAC,EAAE,EAAE,CAAC,GAAGM,QAAQ,CAACN,CAAC,EAAE,EAAE,CAAC;AAC7D;AACA,SAASgB,gBAAgBA,CAAChB,CAAC,EAAE;AACzB,EAAA,OAAOM,QAAQ,CAACN,CAAC,EAAE,CAAC,CAAC,GAAGM,QAAQ,CAACN,CAAC,EAAE,EAAE,CAAC,GAAGS,QAAQ,CAACT,CAAC,EAAE,CAAC,CAAC;AAC5D;AACA,SAASiB,gBAAgBA,CAACjB,CAAC,EAAE;AACzB,EAAA,OAAOM,QAAQ,CAACN,CAAC,EAAE,EAAE,CAAC,GAAGM,QAAQ,CAACN,CAAC,EAAE,EAAE,CAAC,GAAGS,QAAQ,CAACT,CAAC,EAAE,EAAE,CAAC;AAC9D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAIkB,QAAQ,GAAG,IAAIf,KAAK,CAAC,UAAU,EAAE,UAAU,EAAE,WAAW,EAAE,UAAU,EAAE,SAAS,EAAE,UAAU,EAAE,WAAW,EAAE,WAAW,EAAE,UAAU,EAAE,SAAS,EAAE,SAAS,EAAE,UAAU,EAAE,UAAU,EAAE,WAAW,EAAE,WAAW,EAAE,WAAW,EAAE,UAAU,EAAE,UAAU,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,WAAW,EAAE,WAAW,EAAE,WAAW,EAAE,WAAW,EAAE,UAAU,EAAE,UAAU,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,WAAW,EAAE,WAAW,EAAE,WAAW,EAAE,WAAW,EAAE,WAAW,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,WAAW,EAAE,WAAW,EAAE,WAAW,EAAE,WAAW,EAAE,WAAW,EAAE,UAAU,CAAC;AAC5xB,SAASX,WAAWA,CAAC2B,CAAC,EAAEC,CAAC,EAAE;EACvB,IAAIC,IAAI,GAAG,IAAIlB,KAAK,CAAC,UAAU,EAAE,WAAW,EAAE,UAAU,EAAE,WAAW,EAAE,UAAU,EAAE,WAAW,EAAE,SAAS,EAAE,UAAU,CAAC;AACtH,EAAA,IAAImB,CAAC,GAAG,IAAInB,KAAK,CAAC,EAAE,CAAC;AACrB,EAAA,IAAIoB,CAAC,EAAEC,CAAC,EAAEC,CAAC,EAAEC,CAAC,EAAEC,CAAC,EAAEC,CAAC,EAAEC,CAAC,EAAEC,CAAC;AAC1B,EAAA,IAAI/B,CAAC,EAAEgC,CAAC,EAAEC,EAAE,EAAEC,EAAE;AAChB;AACAd,EAAAA,CAAC,CAACC,CAAC,IAAI,CAAC,CAAC,IAAI,IAAI,IAAK,EAAE,GAAIA,CAAC,GAAG,EAAI;AACpCD,EAAAA,CAAC,CAAC,CAAGC,CAAC,GAAG,EAAE,IAAK,CAAC,IAAK,CAAC,IAAI,EAAE,CAAC,GAAGA,CAAC;AAClC,EAAA,KAAKrB,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGoB,CAAC,CAACzB,MAAM,EAAEK,CAAC,IAAI,EAAE,EAAE;AAC/BwB,IAAAA,CAAC,GAAGF,IAAI,CAAC,CAAC,CAAC;AACXG,IAAAA,CAAC,GAAGH,IAAI,CAAC,CAAC,CAAC;AACXI,IAAAA,CAAC,GAAGJ,IAAI,CAAC,CAAC,CAAC;AACXK,IAAAA,CAAC,GAAGL,IAAI,CAAC,CAAC,CAAC;AACXM,IAAAA,CAAC,GAAGN,IAAI,CAAC,CAAC,CAAC;AACXO,IAAAA,CAAC,GAAGP,IAAI,CAAC,CAAC,CAAC;AACXQ,IAAAA,CAAC,GAAGR,IAAI,CAAC,CAAC,CAAC;AACXS,IAAAA,CAAC,GAAGT,IAAI,CAAC,CAAC,CAAC;IACX,KAAKU,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG,EAAE,EAAEA,CAAC,EAAE,EAAE;AACrB,MAAA,IAAIA,CAAC,GAAG,EAAE,EACNT,CAAC,CAACS,CAAC,CAAC,GAAGZ,CAAC,CAACY,CAAC,GAAGhC,CAAC,CAAC,CAAC,KAEhBuB,CAAC,CAACS,CAAC,CAAC,GAAGG,QAAQ,CAACA,QAAQ,CAACA,QAAQ,CAACjB,gBAAgB,CAACK,CAAC,CAACS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAET,CAAC,CAACS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAEf,gBAAgB,CAACM,CAAC,CAACS,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,EAAET,CAAC,CAACS,CAAC,GAAG,EAAE,CAAC,CAAC;AACrHC,MAAAA,EAAE,GAAGE,QAAQ,CAACA,QAAQ,CAACA,QAAQ,CAACA,QAAQ,CAACJ,CAAC,EAAEf,gBAAgB,CAACY,CAAC,CAAC,CAAC,EAAEjB,SAAS,CAACiB,CAAC,EAAEC,CAAC,EAAEC,CAAC,CAAC,CAAC,EAAEX,QAAQ,CAACa,CAAC,CAAC,CAAC,EAAET,CAAC,CAACS,CAAC,CAAC,CAAC;AAC1GE,MAAAA,EAAE,GAAGC,QAAQ,CAACpB,gBAAgB,CAACS,CAAC,CAAC,EAAEV,UAAU,CAACU,CAAC,EAAEC,CAAC,EAAEC,CAAC,CAAC,CAAC;AACvDK,MAAAA,CAAC,GAAGD,CAAC;AACLA,MAAAA,CAAC,GAAGD,CAAC;AACLA,MAAAA,CAAC,GAAGD,CAAC;AACLA,MAAAA,CAAC,GAAGO,QAAQ,CAACR,CAAC,EAAEM,EAAE,CAAC;AACnBN,MAAAA,CAAC,GAAGD,CAAC;AACLA,MAAAA,CAAC,GAAGD,CAAC;AACLA,MAAAA,CAAC,GAAGD,CAAC;AACLA,MAAAA,CAAC,GAAGW,QAAQ,CAACF,EAAE,EAAEC,EAAE,CAAC;AACxB,IAAA;AACAZ,IAAAA,IAAI,CAAC,CAAC,CAAC,GAAGa,QAAQ,CAACX,CAAC,EAAEF,IAAI,CAAC,CAAC,CAAC,CAAC;AAC9BA,IAAAA,IAAI,CAAC,CAAC,CAAC,GAAGa,QAAQ,CAACV,CAAC,EAAEH,IAAI,CAAC,CAAC,CAAC,CAAC;AAC9BA,IAAAA,IAAI,CAAC,CAAC,CAAC,GAAGa,QAAQ,CAACT,CAAC,EAAEJ,IAAI,CAAC,CAAC,CAAC,CAAC;AAC9BA,IAAAA,IAAI,CAAC,CAAC,CAAC,GAAGa,QAAQ,CAACR,CAAC,EAAEL,IAAI,CAAC,CAAC,CAAC,CAAC;AAC9BA,IAAAA,IAAI,CAAC,CAAC,CAAC,GAAGa,QAAQ,CAACP,CAAC,EAAEN,IAAI,CAAC,CAAC,CAAC,CAAC;AAC9BA,IAAAA,IAAI,CAAC,CAAC,CAAC,GAAGa,QAAQ,CAACN,CAAC,EAAEP,IAAI,CAAC,CAAC,CAAC,CAAC;AAC9BA,IAAAA,IAAI,CAAC,CAAC,CAAC,GAAGa,QAAQ,CAACL,CAAC,EAAER,IAAI,CAAC,CAAC,CAAC,CAAC;AAC9BA,IAAAA,IAAI,CAAC,CAAC,CAAC,GAAGa,QAAQ,CAACJ,CAAC,EAAET,IAAI,CAAC,CAAC,CAAC,CAAC;AAClC,EAAA;AACA,EAAA,OAAOA,IAAI;AACf;AACA,SAASa,QAAQA,CAAClC,CAAC,EAAEW,CAAC,EAAE;EACpB,IAAIwB,GAAG,GAAG,CAACnC,CAAC,GAAG,MAAM,KAAKW,CAAC,GAAG,MAAM,CAAC;AACrC,EAAA,IAAIyB,GAAG,GAAG,CAACpC,CAAC,IAAI,EAAE,KAAKW,CAAC,IAAI,EAAE,CAAC,IAAIwB,GAAG,IAAI,EAAE,CAAC;AAC7C,EAAA,OAAQC,GAAG,IAAI,EAAE,GAAKD,GAAG,GAAG,MAAO;AACvC;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/jsencrypt/lib/lib/jsbn/util.js

@@ -1,61 +0,0 @@
-var BI_RM = "0123456789abcdefghijklmnopqrstuvwxyz";
-function int2char(n) {
-  return BI_RM.charAt(n);
-}
-//#region BIT_OPERATIONS
-// (public) this & a
-function op_and(x, y) {
-  return x & y;
-}
-// (public) this | a
-function op_or(x, y) {
-  return x | y;
-}
-// (public) this ^ a
-function op_xor(x, y) {
-  return x ^ y;
-}
-// (public) this & ~a
-function op_andnot(x, y) {
-  return x & ~y;
-}
-// return index of lowest 1-bit in x, x < 2^31
-function lbit(x) {
-  if (x == 0) {
-    return -1;
-  }
-  var r = 0;
-  if ((x & 0xffff) == 0) {
-    x >>= 16;
-    r += 16;
-  }
-  if ((x & 0xff) == 0) {
-    x >>= 8;
-    r += 8;
-  }
-  if ((x & 0xf) == 0) {
-    x >>= 4;
-    r += 4;
-  }
-  if ((x & 3) == 0) {
-    x >>= 2;
-    r += 2;
-  }
-  if ((x & 1) == 0) {
-    ++r;
-  }
-  return r;
-}
-// return number of 1 bits in x
-function cbit(x) {
-  var r = 0;
-  while (x != 0) {
-    x &= x - 1;
-    ++r;
-  }
-  return r;
-}
-//#endregion BIT_OPERATIONS
-
-export { cbit, int2char, lbit, op_and, op_andnot, op_or, op_xor };
-//# sourceMappingURL=util.js.map

package/lib/node_modules/jsencrypt/lib/lib/jsbn/util.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"util.js","sources":["../../../../../../node_modules/jsencrypt/lib/lib/jsbn/util.js"],"sourcesContent":["var BI_RM = \"0123456789abcdefghijklmnopqrstuvwxyz\";\nexport function int2char(n) {\n    return BI_RM.charAt(n);\n}\n//#region BIT_OPERATIONS\n// (public) this & a\nexport function op_and(x, y) {\n    return x & y;\n}\n// (public) this | a\nexport function op_or(x, y) {\n    return x | y;\n}\n// (public) this ^ a\nexport function op_xor(x, y) {\n    return x ^ y;\n}\n// (public) this & ~a\nexport function op_andnot(x, y) {\n    return x & ~y;\n}\n// return index of lowest 1-bit in x, x < 2^31\nexport function lbit(x) {\n    if (x == 0) {\n        return -1;\n    }\n    var r = 0;\n    if ((x & 0xffff) == 0) {\n        x >>= 16;\n        r += 16;\n    }\n    if ((x & 0xff) == 0) {\n        x >>= 8;\n        r += 8;\n    }\n    if ((x & 0xf) == 0) {\n        x >>= 4;\n        r += 4;\n    }\n    if ((x & 3) == 0) {\n        x >>= 2;\n        r += 2;\n    }\n    if ((x & 1) == 0) {\n        ++r;\n    }\n    return r;\n}\n// return number of 1 bits in x\nexport function cbit(x) {\n    var r = 0;\n    while (x != 0) {\n        x &= x - 1;\n        ++r;\n    }\n    return r;\n}\n//#endregion BIT_OPERATIONS\n"],"names":["BI_RM","int2char","n","charAt","op_and","x","y","op_or","op_xor","op_andnot","lbit","r","cbit"],"mappings":"AAAA,IAAIA,KAAK,GAAG,sCAAsC;AAC3C,SAASC,QAAQA,CAACC,CAAC,EAAE;AACxB,EAAA,OAAOF,KAAK,CAACG,MAAM,CAACD,CAAC,CAAC;AAC1B;AACA;AACA;AACO,SAASE,MAAMA,CAACC,CAAC,EAAEC,CAAC,EAAE;EACzB,OAAOD,CAAC,GAAGC,CAAC;AAChB;AACA;AACO,SAASC,KAAKA,CAACF,CAAC,EAAEC,CAAC,EAAE;EACxB,OAAOD,CAAC,GAAGC,CAAC;AAChB;AACA;AACO,SAASE,MAAMA,CAACH,CAAC,EAAEC,CAAC,EAAE;EACzB,OAAOD,CAAC,GAAGC,CAAC;AAChB;AACA;AACO,SAASG,SAASA,CAACJ,CAAC,EAAEC,CAAC,EAAE;EAC5B,OAAOD,CAAC,GAAG,CAACC,CAAC;AACjB;AACA;AACO,SAASI,IAAIA,CAACL,CAAC,EAAE;EACpB,IAAIA,CAAC,IAAI,CAAC,EAAE;AACR,IAAA,OAAO,EAAE;AACb,EAAA;EACA,IAAIM,CAAC,GAAG,CAAC;AACT,EAAA,IAAI,CAACN,CAAC,GAAG,MAAM,KAAK,CAAC,EAAE;AACnBA,IAAAA,CAAC,KAAK,EAAE;AACRM,IAAAA,CAAC,IAAI,EAAE;AACX,EAAA;AACA,EAAA,IAAI,CAACN,CAAC,GAAG,IAAI,KAAK,CAAC,EAAE;AACjBA,IAAAA,CAAC,KAAK,CAAC;AACPM,IAAAA,CAAC,IAAI,CAAC;AACV,EAAA;AACA,EAAA,IAAI,CAACN,CAAC,GAAG,GAAG,KAAK,CAAC,EAAE;AAChBA,IAAAA,CAAC,KAAK,CAAC;AACPM,IAAAA,CAAC,IAAI,CAAC;AACV,EAAA;AACA,EAAA,IAAI,CAACN,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;AACdA,IAAAA,CAAC,KAAK,CAAC;AACPM,IAAAA,CAAC,IAAI,CAAC;AACV,EAAA;AACA,EAAA,IAAI,CAACN,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;AACd,IAAA,EAAEM,CAAC;AACP,EAAA;AACA,EAAA,OAAOA,CAAC;AACZ;AACA;AACO,SAASC,IAAIA,CAACP,CAAC,EAAE;EACpB,IAAIM,CAAC,GAAG,CAAC;EACT,OAAON,CAAC,IAAI,CAAC,EAAE;IACXA,CAAC,IAAIA,CAAC,GAAG,CAAC;AACV,IAAA,EAAEM,CAAC;AACP,EAAA;AACA,EAAA,OAAOA,CAAC;AACZ;AACA;;;;","x_google_ignoreList":[0]}