source: trip-planner-front/node_modules/uuid/lib/md5-browser.js@ 1ad8e64

Last change on this file since 1ad8e64 was e29cc2e, checked in by Ema <ema_spirova@…>, 3 years ago

primeNG components

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