github.com/nektos/act@v0.2.63/pkg/runner/testdata/actions/node16/node_modules/uuid/dist/md5-browser.js (about) 1 "use strict"; 2 3 Object.defineProperty(exports, "__esModule", { 4 value: true 5 }); 6 exports.default = void 0; 7 8 /* 9 * Browser-compatible JavaScript MD5 10 * 11 * Modification of JavaScript MD5 12 * https://github.com/blueimp/JavaScript-MD5 13 * 14 * Copyright 2011, Sebastian Tschan 15 * https://blueimp.net 16 * 17 * Licensed under the MIT license: 18 * https://opensource.org/licenses/MIT 19 * 20 * Based on 21 * A JavaScript implementation of the RSA Data Security, Inc. MD5 Message 22 * Digest Algorithm, as defined in RFC 1321. 23 * Version 2.2 Copyright (C) Paul Johnston 1999 - 2009 24 * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet 25 * Distributed under the BSD License 26 * See http://pajhome.org.uk/crypt/md5 for more info. 27 */ 28 function md5(bytes) { 29 if (typeof bytes === 'string') { 30 const msg = unescape(encodeURIComponent(bytes)); // UTF8 escape 31 32 bytes = new Uint8Array(msg.length); 33 34 for (let i = 0; i < msg.length; ++i) { 35 bytes[i] = msg.charCodeAt(i); 36 } 37 } 38 39 return md5ToHexEncodedArray(wordsToMd5(bytesToWords(bytes), bytes.length * 8)); 40 } 41 /* 42 * Convert an array of little-endian words to an array of bytes 43 */ 44 45 46 function md5ToHexEncodedArray(input) { 47 const output = []; 48 const length32 = input.length * 32; 49 const hexTab = '0123456789abcdef'; 50 51 for (let i = 0; i < length32; i += 8) { 52 const x = input[i >> 5] >>> i % 32 & 0xff; 53 const hex = parseInt(hexTab.charAt(x >>> 4 & 0x0f) + hexTab.charAt(x & 0x0f), 16); 54 output.push(hex); 55 } 56 57 return output; 58 } 59 /** 60 * Calculate output length with padding and bit length 61 */ 62 63 64 function getOutputLength(inputLength8) { 65 return (inputLength8 + 64 >>> 9 << 4) + 14 + 1; 66 } 67 /* 68 * Calculate the MD5 of an array of little-endian words, and a bit length. 69 */ 70 71 72 function wordsToMd5(x, len) { 73 /* append padding */ 74 x[len >> 5] |= 0x80 << len % 32; 75 x[getOutputLength(len) - 1] = len; 76 let a = 1732584193; 77 let b = -271733879; 78 let c = -1732584194; 79 let d = 271733878; 80 81 for (let i = 0; i < x.length; i += 16) { 82 const olda = a; 83 const oldb = b; 84 const oldc = c; 85 const oldd = d; 86 a = md5ff(a, b, c, d, x[i], 7, -680876936); 87 d = md5ff(d, a, b, c, x[i + 1], 12, -389564586); 88 c = md5ff(c, d, a, b, x[i + 2], 17, 606105819); 89 b = md5ff(b, c, d, a, x[i + 3], 22, -1044525330); 90 a = md5ff(a, b, c, d, x[i + 4], 7, -176418897); 91 d = md5ff(d, a, b, c, x[i + 5], 12, 1200080426); 92 c = md5ff(c, d, a, b, x[i + 6], 17, -1473231341); 93 b = md5ff(b, c, d, a, x[i + 7], 22, -45705983); 94 a = md5ff(a, b, c, d, x[i + 8], 7, 1770035416); 95 d = md5ff(d, a, b, c, x[i + 9], 12, -1958414417); 96 c = md5ff(c, d, a, b, x[i + 10], 17, -42063); 97 b = md5ff(b, c, d, a, x[i + 11], 22, -1990404162); 98 a = md5ff(a, b, c, d, x[i + 12], 7, 1804603682); 99 d = md5ff(d, a, b, c, x[i + 13], 12, -40341101); 100 c = md5ff(c, d, a, b, x[i + 14], 17, -1502002290); 101 b = md5ff(b, c, d, a, x[i + 15], 22, 1236535329); 102 a = md5gg(a, b, c, d, x[i + 1], 5, -165796510); 103 d = md5gg(d, a, b, c, x[i + 6], 9, -1069501632); 104 c = md5gg(c, d, a, b, x[i + 11], 14, 643717713); 105 b = md5gg(b, c, d, a, x[i], 20, -373897302); 106 a = md5gg(a, b, c, d, x[i + 5], 5, -701558691); 107 d = md5gg(d, a, b, c, x[i + 10], 9, 38016083); 108 c = md5gg(c, d, a, b, x[i + 15], 14, -660478335); 109 b = md5gg(b, c, d, a, x[i + 4], 20, -405537848); 110 a = md5gg(a, b, c, d, x[i + 9], 5, 568446438); 111 d = md5gg(d, a, b, c, x[i + 14], 9, -1019803690); 112 c = md5gg(c, d, a, b, x[i + 3], 14, -187363961); 113 b = md5gg(b, c, d, a, x[i + 8], 20, 1163531501); 114 a = md5gg(a, b, c, d, x[i + 13], 5, -1444681467); 115 d = md5gg(d, a, b, c, x[i + 2], 9, -51403784); 116 c = md5gg(c, d, a, b, x[i + 7], 14, 1735328473); 117 b = md5gg(b, c, d, a, x[i + 12], 20, -1926607734); 118 a = md5hh(a, b, c, d, x[i + 5], 4, -378558); 119 d = md5hh(d, a, b, c, x[i + 8], 11, -2022574463); 120 c = md5hh(c, d, a, b, x[i + 11], 16, 1839030562); 121 b = md5hh(b, c, d, a, x[i + 14], 23, -35309556); 122 a = md5hh(a, b, c, d, x[i + 1], 4, -1530992060); 123 d = md5hh(d, a, b, c, x[i + 4], 11, 1272893353); 124 c = md5hh(c, d, a, b, x[i + 7], 16, -155497632); 125 b = md5hh(b, c, d, a, x[i + 10], 23, -1094730640); 126 a = md5hh(a, b, c, d, x[i + 13], 4, 681279174); 127 d = md5hh(d, a, b, c, x[i], 11, -358537222); 128 c = md5hh(c, d, a, b, x[i + 3], 16, -722521979); 129 b = md5hh(b, c, d, a, x[i + 6], 23, 76029189); 130 a = md5hh(a, b, c, d, x[i + 9], 4, -640364487); 131 d = md5hh(d, a, b, c, x[i + 12], 11, -421815835); 132 c = md5hh(c, d, a, b, x[i + 15], 16, 530742520); 133 b = md5hh(b, c, d, a, x[i + 2], 23, -995338651); 134 a = md5ii(a, b, c, d, x[i], 6, -198630844); 135 d = md5ii(d, a, b, c, x[i + 7], 10, 1126891415); 136 c = md5ii(c, d, a, b, x[i + 14], 15, -1416354905); 137 b = md5ii(b, c, d, a, x[i + 5], 21, -57434055); 138 a = md5ii(a, b, c, d, x[i + 12], 6, 1700485571); 139 d = md5ii(d, a, b, c, x[i + 3], 10, -1894986606); 140 c = md5ii(c, d, a, b, x[i + 10], 15, -1051523); 141 b = md5ii(b, c, d, a, x[i + 1], 21, -2054922799); 142 a = md5ii(a, b, c, d, x[i + 8], 6, 1873313359); 143 d = md5ii(d, a, b, c, x[i + 15], 10, -30611744); 144 c = md5ii(c, d, a, b, x[i + 6], 15, -1560198380); 145 b = md5ii(b, c, d, a, x[i + 13], 21, 1309151649); 146 a = md5ii(a, b, c, d, x[i + 4], 6, -145523070); 147 d = md5ii(d, a, b, c, x[i + 11], 10, -1120210379); 148 c = md5ii(c, d, a, b, x[i + 2], 15, 718787259); 149 b = md5ii(b, c, d, a, x[i + 9], 21, -343485551); 150 a = safeAdd(a, olda); 151 b = safeAdd(b, oldb); 152 c = safeAdd(c, oldc); 153 d = safeAdd(d, oldd); 154 } 155 156 return [a, b, c, d]; 157 } 158 /* 159 * Convert an array bytes to an array of little-endian words 160 * Characters >255 have their high-byte silently ignored. 161 */ 162 163 164 function bytesToWords(input) { 165 if (input.length === 0) { 166 return []; 167 } 168 169 const length8 = input.length * 8; 170 const output = new Uint32Array(getOutputLength(length8)); 171 172 for (let i = 0; i < length8; i += 8) { 173 output[i >> 5] |= (input[i / 8] & 0xff) << i % 32; 174 } 175 176 return output; 177 } 178 /* 179 * Add integers, wrapping at 2^32. This uses 16-bit operations internally 180 * to work around bugs in some JS interpreters. 181 */ 182 183 184 function safeAdd(x, y) { 185 const lsw = (x & 0xffff) + (y & 0xffff); 186 const msw = (x >> 16) + (y >> 16) + (lsw >> 16); 187 return msw << 16 | lsw & 0xffff; 188 } 189 /* 190 * Bitwise rotate a 32-bit number to the left. 191 */ 192 193 194 function bitRotateLeft(num, cnt) { 195 return num << cnt | num >>> 32 - cnt; 196 } 197 /* 198 * These functions implement the four basic operations the algorithm uses. 199 */ 200 201 202 function md5cmn(q, a, b, x, s, t) { 203 return safeAdd(bitRotateLeft(safeAdd(safeAdd(a, q), safeAdd(x, t)), s), b); 204 } 205 206 function md5ff(a, b, c, d, x, s, t) { 207 return md5cmn(b & c | ~b & d, a, b, x, s, t); 208 } 209 210 function md5gg(a, b, c, d, x, s, t) { 211 return md5cmn(b & d | c & ~d, a, b, x, s, t); 212 } 213 214 function md5hh(a, b, c, d, x, s, t) { 215 return md5cmn(b ^ c ^ d, a, b, x, s, t); 216 } 217 218 function md5ii(a, b, c, d, x, s, t) { 219 return md5cmn(c ^ (b | ~d), a, b, x, s, t); 220 } 221 222 var _default = md5; 223 exports.default = _default;