mirror of
https://github.com/emn178/js-md5.git
synced 2026-11-16 23:08:55 +08:00
### Fixed
- Unpaired UTF-16 surrogates produce wrong digests and consume the next code unit in the JS path. Unpaired surrogates are now encoded as U+FFFD, matching `TextEncoder` and Node.js `crypto`. #57 Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
This commit is contained in:
co-authored by
Claude Opus 5.5
parent
ee1c332b60
commit
68b5c32442
@@ -1,5 +1,9 @@
|
||||
# Change Log
|
||||
|
||||
## v0.10.0 / 2026-11-16
|
||||
### Fixed
|
||||
- Unpaired UTF-16 surrogates produce wrong digests and consume the next code unit in the JS path. Unpaired surrogates are now encoded as U+FFFD, matching `TextEncoder` and Node.js `crypto`. #57
|
||||
|
||||
## v0.9.2 / 2026-07-20
|
||||
### Fixed
|
||||
- CI test.
|
||||
|
||||
+1
-1
@@ -1,6 +1,6 @@
|
||||
{
|
||||
"name": "js-md5",
|
||||
"version": "0.9.2",
|
||||
"version": "0.10.0",
|
||||
"main": ["src/md5.js"],
|
||||
"ignore": [
|
||||
"tests"
|
||||
|
||||
+10
-4
@@ -2,7 +2,7 @@
|
||||
* [js-md5]{@link https://github.com/emn178/js-md5}
|
||||
*
|
||||
* @namespace md5
|
||||
* @version 0.9.2
|
||||
* @version 0.10.0
|
||||
* @author Chen, Yi-Cyuan [emn178@gmail.com]
|
||||
* @copyright Chen, Yi-Cyuan 2014-2026
|
||||
* @license MIT
|
||||
@@ -227,7 +227,7 @@
|
||||
var result = formatMessage(message);
|
||||
message = result[0];
|
||||
var isString = result[1];
|
||||
var code, index = 0, i, length = message.length, blocks = this.blocks;
|
||||
var code, code2, index = 0, i, length = message.length, blocks = this.blocks;
|
||||
var buffer8 = this.buffer8;
|
||||
|
||||
while (index < length) {
|
||||
@@ -253,12 +253,18 @@
|
||||
buffer8[i++] = 0xe0 | (code >>> 12);
|
||||
buffer8[i++] = 0x80 | ((code >>> 6) & 0x3f);
|
||||
buffer8[i++] = 0x80 | (code & 0x3f);
|
||||
} else {
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (message.charCodeAt(++index) & 0x3ff));
|
||||
} else if (code < 0xdc00 && (code2 = message.charCodeAt(index + 1)) >= 0xdc00 && code2 < 0xe000) {
|
||||
++index;
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (code2 & 0x3ff));
|
||||
buffer8[i++] = 0xf0 | (code >>> 18);
|
||||
buffer8[i++] = 0x80 | ((code >>> 12) & 0x3f);
|
||||
buffer8[i++] = 0x80 | ((code >>> 6) & 0x3f);
|
||||
buffer8[i++] = 0x80 | (code & 0x3f);
|
||||
} else {
|
||||
// unpaired surrogate: U+FFFD
|
||||
buffer8[i++] = 0xef;
|
||||
buffer8[i++] = 0xbf;
|
||||
buffer8[i++] = 0xbd;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
Vendored
+2
-2
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
+10
-4
@@ -8,7 +8,7 @@ var md5$1 = {exports: {}};
|
||||
* [js-md5]{@link https://github.com/emn178/js-md5}
|
||||
*
|
||||
* @namespace md5
|
||||
* @version 0.9.2
|
||||
* @version 0.10.0
|
||||
* @author Chen, Yi-Cyuan [emn178@gmail.com]
|
||||
* @copyright Chen, Yi-Cyuan 2014-2026
|
||||
* @license MIT
|
||||
@@ -203,7 +203,7 @@ var md5$1 = {exports: {}};
|
||||
var result = formatMessage(message);
|
||||
message = result[0];
|
||||
var isString = result[1];
|
||||
var code, index = 0, i, length = message.length, blocks = this.blocks;
|
||||
var code, code2, index = 0, i, length = message.length, blocks = this.blocks;
|
||||
var buffer8 = this.buffer8;
|
||||
|
||||
while (index < length) {
|
||||
@@ -229,12 +229,18 @@ var md5$1 = {exports: {}};
|
||||
buffer8[i++] = 0xe0 | (code >>> 12);
|
||||
buffer8[i++] = 0x80 | ((code >>> 6) & 0x3f);
|
||||
buffer8[i++] = 0x80 | (code & 0x3f);
|
||||
} else {
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (message.charCodeAt(++index) & 0x3ff));
|
||||
} else if (code < 0xdc00 && (code2 = message.charCodeAt(index + 1)) >= 0xdc00 && code2 < 0xe000) {
|
||||
++index;
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (code2 & 0x3ff));
|
||||
buffer8[i++] = 0xf0 | (code >>> 18);
|
||||
buffer8[i++] = 0x80 | ((code >>> 12) & 0x3f);
|
||||
buffer8[i++] = 0x80 | ((code >>> 6) & 0x3f);
|
||||
buffer8[i++] = 0x80 | (code & 0x3f);
|
||||
} else {
|
||||
// unpaired surrogate: U+FFFD
|
||||
buffer8[i++] = 0xef;
|
||||
buffer8[i++] = 0xbf;
|
||||
buffer8[i++] = 0xbd;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
+10
-4
@@ -13,7 +13,7 @@ var md5$1 = {exports: {}};
|
||||
* [js-md5]{@link https://github.com/emn178/js-md5}
|
||||
*
|
||||
* @namespace md5
|
||||
* @version 0.9.2
|
||||
* @version 0.10.0
|
||||
* @author Chen, Yi-Cyuan [emn178@gmail.com]
|
||||
* @copyright Chen, Yi-Cyuan 2014-2026
|
||||
* @license MIT
|
||||
@@ -239,7 +239,7 @@ var md5$1 = {exports: {}};
|
||||
var result = formatMessage(message);
|
||||
message = result[0];
|
||||
var isString = result[1];
|
||||
var code, index = 0, i, length = message.length, blocks = this.blocks;
|
||||
var code, code2, index = 0, i, length = message.length, blocks = this.blocks;
|
||||
var buffer8 = this.buffer8;
|
||||
|
||||
while (index < length) {
|
||||
@@ -265,12 +265,18 @@ var md5$1 = {exports: {}};
|
||||
buffer8[i++] = 0xe0 | (code >>> 12);
|
||||
buffer8[i++] = 0x80 | ((code >>> 6) & 0x3f);
|
||||
buffer8[i++] = 0x80 | (code & 0x3f);
|
||||
} else {
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (message.charCodeAt(++index) & 0x3ff));
|
||||
} else if (code < 0xdc00 && (code2 = message.charCodeAt(index + 1)) >= 0xdc00 && code2 < 0xe000) {
|
||||
++index;
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (code2 & 0x3ff));
|
||||
buffer8[i++] = 0xf0 | (code >>> 18);
|
||||
buffer8[i++] = 0x80 | ((code >>> 12) & 0x3f);
|
||||
buffer8[i++] = 0x80 | ((code >>> 6) & 0x3f);
|
||||
buffer8[i++] = 0x80 | (code & 0x3f);
|
||||
} else {
|
||||
// unpaired surrogate: U+FFFD
|
||||
buffer8[i++] = 0xef;
|
||||
buffer8[i++] = 0xbf;
|
||||
buffer8[i++] = 0xbd;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
+27
-9
@@ -2,7 +2,7 @@
|
||||
* [js-md5]{@link https://github.com/emn178/js-md5}
|
||||
*
|
||||
* @namespace md5
|
||||
* @version 0.9.2
|
||||
* @version 0.10.0
|
||||
* @author Chen, Yi-Cyuan [emn178@gmail.com]
|
||||
* @copyright Chen, Yi-Cyuan 2014-2026
|
||||
* @license MIT
|
||||
@@ -369,7 +369,7 @@
|
||||
var result = formatMessage(message);
|
||||
message = result[0];
|
||||
var isString = result[1];
|
||||
var code, index = 0, i, length = message.length, blocks = this.blocks;
|
||||
var code, code2, index = 0, i, length = message.length, blocks = this.blocks;
|
||||
var buffer8 = this.buffer8;
|
||||
|
||||
while (index < length) {
|
||||
@@ -395,12 +395,18 @@
|
||||
buffer8[i++] = 0xe0 | (code >>> 12);
|
||||
buffer8[i++] = 0x80 | ((code >>> 6) & 0x3f);
|
||||
buffer8[i++] = 0x80 | (code & 0x3f);
|
||||
} else {
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (message.charCodeAt(++index) & 0x3ff));
|
||||
} else if (code < 0xdc00 && (code2 = message.charCodeAt(index + 1)) >= 0xdc00 && code2 < 0xe000) {
|
||||
++index;
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (code2 & 0x3ff));
|
||||
buffer8[i++] = 0xf0 | (code >>> 18);
|
||||
buffer8[i++] = 0x80 | ((code >>> 12) & 0x3f);
|
||||
buffer8[i++] = 0x80 | ((code >>> 6) & 0x3f);
|
||||
buffer8[i++] = 0x80 | (code & 0x3f);
|
||||
} else {
|
||||
// unpaired surrogate: U+FFFD
|
||||
buffer8[i++] = 0xef;
|
||||
buffer8[i++] = 0xbf;
|
||||
buffer8[i++] = 0xbd;
|
||||
}
|
||||
}
|
||||
} else {
|
||||
@@ -415,12 +421,18 @@
|
||||
blocks[i >>> 2] |= (0xe0 | (code >>> 12)) << SHIFT[i++ & 3];
|
||||
blocks[i >>> 2] |= (0x80 | ((code >>> 6) & 0x3f)) << SHIFT[i++ & 3];
|
||||
blocks[i >>> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];
|
||||
} else {
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (message.charCodeAt(++index) & 0x3ff));
|
||||
} else if (code < 0xdc00 && (code2 = message.charCodeAt(index + 1)) >= 0xdc00 && code2 < 0xe000) {
|
||||
++index;
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (code2 & 0x3ff));
|
||||
blocks[i >>> 2] |= (0xf0 | (code >>> 18)) << SHIFT[i++ & 3];
|
||||
blocks[i >>> 2] |= (0x80 | ((code >>> 12) & 0x3f)) << SHIFT[i++ & 3];
|
||||
blocks[i >>> 2] |= (0x80 | ((code >>> 6) & 0x3f)) << SHIFT[i++ & 3];
|
||||
blocks[i >>> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];
|
||||
} else {
|
||||
// unpaired surrogate: U+FFFD
|
||||
blocks[i >>> 2] |= 0xef << SHIFT[i++ & 3];
|
||||
blocks[i >>> 2] |= 0xbf << SHIFT[i++ & 3];
|
||||
blocks[i >>> 2] |= 0xbd << SHIFT[i++ & 3];
|
||||
}
|
||||
}
|
||||
}
|
||||
@@ -803,7 +815,7 @@
|
||||
var i, result = formatMessage(key);
|
||||
key = result[0];
|
||||
if (result[1]) {
|
||||
var bytes = [], length = key.length, index = 0, code;
|
||||
var bytes = [], length = key.length, index = 0, code, code2;
|
||||
for (i = 0; i < length; ++i) {
|
||||
code = key.charCodeAt(i);
|
||||
if (code < 0x80) {
|
||||
@@ -815,12 +827,18 @@
|
||||
bytes[index++] = (0xe0 | (code >>> 12));
|
||||
bytes[index++] = (0x80 | ((code >>> 6) & 0x3f));
|
||||
bytes[index++] = (0x80 | (code & 0x3f));
|
||||
} else {
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (key.charCodeAt(++i) & 0x3ff));
|
||||
} else if (code < 0xdc00 && (code2 = key.charCodeAt(i + 1)) >= 0xdc00 && code2 < 0xe000) {
|
||||
++i;
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (code2 & 0x3ff));
|
||||
bytes[index++] = (0xf0 | (code >>> 18));
|
||||
bytes[index++] = (0x80 | ((code >>> 12) & 0x3f));
|
||||
bytes[index++] = (0x80 | ((code >>> 6) & 0x3f));
|
||||
bytes[index++] = (0x80 | (code & 0x3f));
|
||||
} else {
|
||||
// unpaired surrogate: U+FFFD
|
||||
bytes[index++] = 0xef;
|
||||
bytes[index++] = 0xbf;
|
||||
bytes[index++] = 0xbd;
|
||||
}
|
||||
}
|
||||
key = bytes;
|
||||
|
||||
Vendored
+2
-2
File diff suppressed because one or more lines are too long
+2
-2
File diff suppressed because one or more lines are too long
+27
-9
@@ -8,7 +8,7 @@ var md5$1 = {exports: {}};
|
||||
* [js-md5]{@link https://github.com/emn178/js-md5}
|
||||
*
|
||||
* @namespace md5
|
||||
* @version 0.9.2
|
||||
* @version 0.10.0
|
||||
* @author Chen, Yi-Cyuan [emn178@gmail.com]
|
||||
* @copyright Chen, Yi-Cyuan 2014-2026
|
||||
* @license MIT
|
||||
@@ -340,7 +340,7 @@ var md5$1 = {exports: {}};
|
||||
var result = formatMessage(message);
|
||||
message = result[0];
|
||||
var isString = result[1];
|
||||
var code, index = 0, i, length = message.length, blocks = this.blocks;
|
||||
var code, code2, index = 0, i, length = message.length, blocks = this.blocks;
|
||||
var buffer8 = this.buffer8;
|
||||
|
||||
while (index < length) {
|
||||
@@ -366,12 +366,18 @@ var md5$1 = {exports: {}};
|
||||
buffer8[i++] = 0xe0 | (code >>> 12);
|
||||
buffer8[i++] = 0x80 | ((code >>> 6) & 0x3f);
|
||||
buffer8[i++] = 0x80 | (code & 0x3f);
|
||||
} else {
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (message.charCodeAt(++index) & 0x3ff));
|
||||
} else if (code < 0xdc00 && (code2 = message.charCodeAt(index + 1)) >= 0xdc00 && code2 < 0xe000) {
|
||||
++index;
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (code2 & 0x3ff));
|
||||
buffer8[i++] = 0xf0 | (code >>> 18);
|
||||
buffer8[i++] = 0x80 | ((code >>> 12) & 0x3f);
|
||||
buffer8[i++] = 0x80 | ((code >>> 6) & 0x3f);
|
||||
buffer8[i++] = 0x80 | (code & 0x3f);
|
||||
} else {
|
||||
// unpaired surrogate: U+FFFD
|
||||
buffer8[i++] = 0xef;
|
||||
buffer8[i++] = 0xbf;
|
||||
buffer8[i++] = 0xbd;
|
||||
}
|
||||
}
|
||||
} else {
|
||||
@@ -386,12 +392,18 @@ var md5$1 = {exports: {}};
|
||||
blocks[i >>> 2] |= (0xe0 | (code >>> 12)) << SHIFT[i++ & 3];
|
||||
blocks[i >>> 2] |= (0x80 | ((code >>> 6) & 0x3f)) << SHIFT[i++ & 3];
|
||||
blocks[i >>> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];
|
||||
} else {
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (message.charCodeAt(++index) & 0x3ff));
|
||||
} else if (code < 0xdc00 && (code2 = message.charCodeAt(index + 1)) >= 0xdc00 && code2 < 0xe000) {
|
||||
++index;
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (code2 & 0x3ff));
|
||||
blocks[i >>> 2] |= (0xf0 | (code >>> 18)) << SHIFT[i++ & 3];
|
||||
blocks[i >>> 2] |= (0x80 | ((code >>> 12) & 0x3f)) << SHIFT[i++ & 3];
|
||||
blocks[i >>> 2] |= (0x80 | ((code >>> 6) & 0x3f)) << SHIFT[i++ & 3];
|
||||
blocks[i >>> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];
|
||||
} else {
|
||||
// unpaired surrogate: U+FFFD
|
||||
blocks[i >>> 2] |= 0xef << SHIFT[i++ & 3];
|
||||
blocks[i >>> 2] |= 0xbf << SHIFT[i++ & 3];
|
||||
blocks[i >>> 2] |= 0xbd << SHIFT[i++ & 3];
|
||||
}
|
||||
}
|
||||
}
|
||||
@@ -774,7 +786,7 @@ var md5$1 = {exports: {}};
|
||||
var i, result = formatMessage(key);
|
||||
key = result[0];
|
||||
if (result[1]) {
|
||||
var bytes = [], length = key.length, index = 0, code;
|
||||
var bytes = [], length = key.length, index = 0, code, code2;
|
||||
for (i = 0; i < length; ++i) {
|
||||
code = key.charCodeAt(i);
|
||||
if (code < 0x80) {
|
||||
@@ -786,12 +798,18 @@ var md5$1 = {exports: {}};
|
||||
bytes[index++] = (0xe0 | (code >>> 12));
|
||||
bytes[index++] = (0x80 | ((code >>> 6) & 0x3f));
|
||||
bytes[index++] = (0x80 | (code & 0x3f));
|
||||
} else {
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (key.charCodeAt(++i) & 0x3ff));
|
||||
} else if (code < 0xdc00 && (code2 = key.charCodeAt(i + 1)) >= 0xdc00 && code2 < 0xe000) {
|
||||
++i;
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (code2 & 0x3ff));
|
||||
bytes[index++] = (0xf0 | (code >>> 18));
|
||||
bytes[index++] = (0x80 | ((code >>> 12) & 0x3f));
|
||||
bytes[index++] = (0x80 | ((code >>> 6) & 0x3f));
|
||||
bytes[index++] = (0x80 | (code & 0x3f));
|
||||
} else {
|
||||
// unpaired surrogate: U+FFFD
|
||||
bytes[index++] = 0xef;
|
||||
bytes[index++] = 0xbf;
|
||||
bytes[index++] = 0xbd;
|
||||
}
|
||||
}
|
||||
key = bytes;
|
||||
|
||||
+19
-7
@@ -2,7 +2,7 @@
|
||||
* [js-md5]{@link https://github.com/emn178/js-md5}
|
||||
*
|
||||
* @namespace md5
|
||||
* @version 0.9.2
|
||||
* @version 0.10.0
|
||||
* @author Chen, Yi-Cyuan [emn178@gmail.com]
|
||||
* @copyright Chen, Yi-Cyuan 2014-2026
|
||||
* @license MIT
|
||||
@@ -347,7 +347,7 @@
|
||||
var result = formatMessage(message);
|
||||
message = result[0];
|
||||
var isString = result[1];
|
||||
var code, index = 0, i, length = message.length, blocks = this.blocks;
|
||||
var code, code2, index = 0, i, length = message.length, blocks = this.blocks;
|
||||
var buffer8 = this.buffer8;
|
||||
|
||||
while (index < length) {
|
||||
@@ -373,12 +373,18 @@
|
||||
buffer8[i++] = 0xe0 | (code >>> 12);
|
||||
buffer8[i++] = 0x80 | ((code >>> 6) & 0x3f);
|
||||
buffer8[i++] = 0x80 | (code & 0x3f);
|
||||
} else {
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (message.charCodeAt(++index) & 0x3ff));
|
||||
} else if (code < 0xdc00 && (code2 = message.charCodeAt(index + 1)) >= 0xdc00 && code2 < 0xe000) {
|
||||
++index;
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (code2 & 0x3ff));
|
||||
buffer8[i++] = 0xf0 | (code >>> 18);
|
||||
buffer8[i++] = 0x80 | ((code >>> 12) & 0x3f);
|
||||
buffer8[i++] = 0x80 | ((code >>> 6) & 0x3f);
|
||||
buffer8[i++] = 0x80 | (code & 0x3f);
|
||||
} else {
|
||||
// unpaired surrogate: U+FFFD
|
||||
buffer8[i++] = 0xef;
|
||||
buffer8[i++] = 0xbf;
|
||||
buffer8[i++] = 0xbd;
|
||||
}
|
||||
}
|
||||
}
|
||||
@@ -757,7 +763,7 @@
|
||||
var i, result = formatMessage(key);
|
||||
key = result[0];
|
||||
if (result[1]) {
|
||||
var bytes = [], length = key.length, index = 0, code;
|
||||
var bytes = [], length = key.length, index = 0, code, code2;
|
||||
for (i = 0; i < length; ++i) {
|
||||
code = key.charCodeAt(i);
|
||||
if (code < 0x80) {
|
||||
@@ -769,12 +775,18 @@
|
||||
bytes[index++] = (0xe0 | (code >>> 12));
|
||||
bytes[index++] = (0x80 | ((code >>> 6) & 0x3f));
|
||||
bytes[index++] = (0x80 | (code & 0x3f));
|
||||
} else {
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (key.charCodeAt(++i) & 0x3ff));
|
||||
} else if (code < 0xdc00 && (code2 = key.charCodeAt(i + 1)) >= 0xdc00 && code2 < 0xe000) {
|
||||
++i;
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (code2 & 0x3ff));
|
||||
bytes[index++] = (0xf0 | (code >>> 18));
|
||||
bytes[index++] = (0x80 | ((code >>> 12) & 0x3f));
|
||||
bytes[index++] = (0x80 | ((code >>> 6) & 0x3f));
|
||||
bytes[index++] = (0x80 | (code & 0x3f));
|
||||
} else {
|
||||
// unpaired surrogate: U+FFFD
|
||||
bytes[index++] = 0xef;
|
||||
bytes[index++] = 0xbf;
|
||||
bytes[index++] = 0xbd;
|
||||
}
|
||||
}
|
||||
key = bytes;
|
||||
|
||||
Vendored
+2
-2
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
+19
-7
@@ -8,7 +8,7 @@ var md5$1 = {exports: {}};
|
||||
* [js-md5]{@link https://github.com/emn178/js-md5}
|
||||
*
|
||||
* @namespace md5
|
||||
* @version 0.9.2
|
||||
* @version 0.10.0
|
||||
* @author Chen, Yi-Cyuan [emn178@gmail.com]
|
||||
* @copyright Chen, Yi-Cyuan 2014-2026
|
||||
* @license MIT
|
||||
@@ -323,7 +323,7 @@ var md5$1 = {exports: {}};
|
||||
var result = formatMessage(message);
|
||||
message = result[0];
|
||||
var isString = result[1];
|
||||
var code, index = 0, i, length = message.length, blocks = this.blocks;
|
||||
var code, code2, index = 0, i, length = message.length, blocks = this.blocks;
|
||||
var buffer8 = this.buffer8;
|
||||
|
||||
while (index < length) {
|
||||
@@ -349,12 +349,18 @@ var md5$1 = {exports: {}};
|
||||
buffer8[i++] = 0xe0 | (code >>> 12);
|
||||
buffer8[i++] = 0x80 | ((code >>> 6) & 0x3f);
|
||||
buffer8[i++] = 0x80 | (code & 0x3f);
|
||||
} else {
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (message.charCodeAt(++index) & 0x3ff));
|
||||
} else if (code < 0xdc00 && (code2 = message.charCodeAt(index + 1)) >= 0xdc00 && code2 < 0xe000) {
|
||||
++index;
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (code2 & 0x3ff));
|
||||
buffer8[i++] = 0xf0 | (code >>> 18);
|
||||
buffer8[i++] = 0x80 | ((code >>> 12) & 0x3f);
|
||||
buffer8[i++] = 0x80 | ((code >>> 6) & 0x3f);
|
||||
buffer8[i++] = 0x80 | (code & 0x3f);
|
||||
} else {
|
||||
// unpaired surrogate: U+FFFD
|
||||
buffer8[i++] = 0xef;
|
||||
buffer8[i++] = 0xbf;
|
||||
buffer8[i++] = 0xbd;
|
||||
}
|
||||
}
|
||||
}
|
||||
@@ -733,7 +739,7 @@ var md5$1 = {exports: {}};
|
||||
var i, result = formatMessage(key);
|
||||
key = result[0];
|
||||
if (result[1]) {
|
||||
var bytes = [], length = key.length, index = 0, code;
|
||||
var bytes = [], length = key.length, index = 0, code, code2;
|
||||
for (i = 0; i < length; ++i) {
|
||||
code = key.charCodeAt(i);
|
||||
if (code < 0x80) {
|
||||
@@ -745,12 +751,18 @@ var md5$1 = {exports: {}};
|
||||
bytes[index++] = (0xe0 | (code >>> 12));
|
||||
bytes[index++] = (0x80 | ((code >>> 6) & 0x3f));
|
||||
bytes[index++] = (0x80 | (code & 0x3f));
|
||||
} else {
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (key.charCodeAt(++i) & 0x3ff));
|
||||
} else if (code < 0xdc00 && (code2 = key.charCodeAt(i + 1)) >= 0xdc00 && code2 < 0xe000) {
|
||||
++i;
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (code2 & 0x3ff));
|
||||
bytes[index++] = (0xf0 | (code >>> 18));
|
||||
bytes[index++] = (0x80 | ((code >>> 12) & 0x3f));
|
||||
bytes[index++] = (0x80 | ((code >>> 6) & 0x3f));
|
||||
bytes[index++] = (0x80 | (code & 0x3f));
|
||||
} else {
|
||||
// unpaired surrogate: U+FFFD
|
||||
bytes[index++] = 0xef;
|
||||
bytes[index++] = 0xbf;
|
||||
bytes[index++] = 0xbd;
|
||||
}
|
||||
}
|
||||
key = bytes;
|
||||
|
||||
@@ -13,7 +13,7 @@ var md5$1 = {exports: {}};
|
||||
* [js-md5]{@link https://github.com/emn178/js-md5}
|
||||
*
|
||||
* @namespace md5
|
||||
* @version 0.9.2
|
||||
* @version 0.10.0
|
||||
* @author Chen, Yi-Cyuan [emn178@gmail.com]
|
||||
* @copyright Chen, Yi-Cyuan 2014-2026
|
||||
* @license MIT
|
||||
@@ -359,7 +359,7 @@ var md5$1 = {exports: {}};
|
||||
var result = formatMessage(message);
|
||||
message = result[0];
|
||||
var isString = result[1];
|
||||
var code, index = 0, i, length = message.length, blocks = this.blocks;
|
||||
var code, code2, index = 0, i, length = message.length, blocks = this.blocks;
|
||||
var buffer8 = this.buffer8;
|
||||
|
||||
while (index < length) {
|
||||
@@ -385,12 +385,18 @@ var md5$1 = {exports: {}};
|
||||
buffer8[i++] = 0xe0 | (code >>> 12);
|
||||
buffer8[i++] = 0x80 | ((code >>> 6) & 0x3f);
|
||||
buffer8[i++] = 0x80 | (code & 0x3f);
|
||||
} else {
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (message.charCodeAt(++index) & 0x3ff));
|
||||
} else if (code < 0xdc00 && (code2 = message.charCodeAt(index + 1)) >= 0xdc00 && code2 < 0xe000) {
|
||||
++index;
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (code2 & 0x3ff));
|
||||
buffer8[i++] = 0xf0 | (code >>> 18);
|
||||
buffer8[i++] = 0x80 | ((code >>> 12) & 0x3f);
|
||||
buffer8[i++] = 0x80 | ((code >>> 6) & 0x3f);
|
||||
buffer8[i++] = 0x80 | (code & 0x3f);
|
||||
} else {
|
||||
// unpaired surrogate: U+FFFD
|
||||
buffer8[i++] = 0xef;
|
||||
buffer8[i++] = 0xbf;
|
||||
buffer8[i++] = 0xbd;
|
||||
}
|
||||
}
|
||||
}
|
||||
@@ -769,7 +775,7 @@ var md5$1 = {exports: {}};
|
||||
var i, result = formatMessage(key);
|
||||
key = result[0];
|
||||
if (result[1]) {
|
||||
var bytes = [], length = key.length, index = 0, code;
|
||||
var bytes = [], length = key.length, index = 0, code, code2;
|
||||
for (i = 0; i < length; ++i) {
|
||||
code = key.charCodeAt(i);
|
||||
if (code < 0x80) {
|
||||
@@ -781,12 +787,18 @@ var md5$1 = {exports: {}};
|
||||
bytes[index++] = (0xe0 | (code >>> 12));
|
||||
bytes[index++] = (0x80 | ((code >>> 6) & 0x3f));
|
||||
bytes[index++] = (0x80 | (code & 0x3f));
|
||||
} else {
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (key.charCodeAt(++i) & 0x3ff));
|
||||
} else if (code < 0xdc00 && (code2 = key.charCodeAt(i + 1)) >= 0xdc00 && code2 < 0xe000) {
|
||||
++i;
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (code2 & 0x3ff));
|
||||
bytes[index++] = (0xf0 | (code >>> 18));
|
||||
bytes[index++] = (0x80 | ((code >>> 12) & 0x3f));
|
||||
bytes[index++] = (0x80 | ((code >>> 6) & 0x3f));
|
||||
bytes[index++] = (0x80 | (code & 0x3f));
|
||||
} else {
|
||||
// unpaired surrogate: U+FFFD
|
||||
bytes[index++] = 0xef;
|
||||
bytes[index++] = 0xbf;
|
||||
bytes[index++] = 0xbd;
|
||||
}
|
||||
}
|
||||
key = bytes;
|
||||
|
||||
+27
-9
@@ -13,7 +13,7 @@ var md5$1 = {exports: {}};
|
||||
* [js-md5]{@link https://github.com/emn178/js-md5}
|
||||
*
|
||||
* @namespace md5
|
||||
* @version 0.9.2
|
||||
* @version 0.10.0
|
||||
* @author Chen, Yi-Cyuan [emn178@gmail.com]
|
||||
* @copyright Chen, Yi-Cyuan 2014-2026
|
||||
* @license MIT
|
||||
@@ -381,7 +381,7 @@ var md5$1 = {exports: {}};
|
||||
var result = formatMessage(message);
|
||||
message = result[0];
|
||||
var isString = result[1];
|
||||
var code, index = 0, i, length = message.length, blocks = this.blocks;
|
||||
var code, code2, index = 0, i, length = message.length, blocks = this.blocks;
|
||||
var buffer8 = this.buffer8;
|
||||
|
||||
while (index < length) {
|
||||
@@ -407,12 +407,18 @@ var md5$1 = {exports: {}};
|
||||
buffer8[i++] = 0xe0 | (code >>> 12);
|
||||
buffer8[i++] = 0x80 | ((code >>> 6) & 0x3f);
|
||||
buffer8[i++] = 0x80 | (code & 0x3f);
|
||||
} else {
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (message.charCodeAt(++index) & 0x3ff));
|
||||
} else if (code < 0xdc00 && (code2 = message.charCodeAt(index + 1)) >= 0xdc00 && code2 < 0xe000) {
|
||||
++index;
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (code2 & 0x3ff));
|
||||
buffer8[i++] = 0xf0 | (code >>> 18);
|
||||
buffer8[i++] = 0x80 | ((code >>> 12) & 0x3f);
|
||||
buffer8[i++] = 0x80 | ((code >>> 6) & 0x3f);
|
||||
buffer8[i++] = 0x80 | (code & 0x3f);
|
||||
} else {
|
||||
// unpaired surrogate: U+FFFD
|
||||
buffer8[i++] = 0xef;
|
||||
buffer8[i++] = 0xbf;
|
||||
buffer8[i++] = 0xbd;
|
||||
}
|
||||
}
|
||||
} else {
|
||||
@@ -427,12 +433,18 @@ var md5$1 = {exports: {}};
|
||||
blocks[i >>> 2] |= (0xe0 | (code >>> 12)) << SHIFT[i++ & 3];
|
||||
blocks[i >>> 2] |= (0x80 | ((code >>> 6) & 0x3f)) << SHIFT[i++ & 3];
|
||||
blocks[i >>> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];
|
||||
} else {
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (message.charCodeAt(++index) & 0x3ff));
|
||||
} else if (code < 0xdc00 && (code2 = message.charCodeAt(index + 1)) >= 0xdc00 && code2 < 0xe000) {
|
||||
++index;
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (code2 & 0x3ff));
|
||||
blocks[i >>> 2] |= (0xf0 | (code >>> 18)) << SHIFT[i++ & 3];
|
||||
blocks[i >>> 2] |= (0x80 | ((code >>> 12) & 0x3f)) << SHIFT[i++ & 3];
|
||||
blocks[i >>> 2] |= (0x80 | ((code >>> 6) & 0x3f)) << SHIFT[i++ & 3];
|
||||
blocks[i >>> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];
|
||||
} else {
|
||||
// unpaired surrogate: U+FFFD
|
||||
blocks[i >>> 2] |= 0xef << SHIFT[i++ & 3];
|
||||
blocks[i >>> 2] |= 0xbf << SHIFT[i++ & 3];
|
||||
blocks[i >>> 2] |= 0xbd << SHIFT[i++ & 3];
|
||||
}
|
||||
}
|
||||
}
|
||||
@@ -815,7 +827,7 @@ var md5$1 = {exports: {}};
|
||||
var i, result = formatMessage(key);
|
||||
key = result[0];
|
||||
if (result[1]) {
|
||||
var bytes = [], length = key.length, index = 0, code;
|
||||
var bytes = [], length = key.length, index = 0, code, code2;
|
||||
for (i = 0; i < length; ++i) {
|
||||
code = key.charCodeAt(i);
|
||||
if (code < 0x80) {
|
||||
@@ -827,12 +839,18 @@ var md5$1 = {exports: {}};
|
||||
bytes[index++] = (0xe0 | (code >>> 12));
|
||||
bytes[index++] = (0x80 | ((code >>> 6) & 0x3f));
|
||||
bytes[index++] = (0x80 | (code & 0x3f));
|
||||
} else {
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (key.charCodeAt(++i) & 0x3ff));
|
||||
} else if (code < 0xdc00 && (code2 = key.charCodeAt(i + 1)) >= 0xdc00 && code2 < 0xe000) {
|
||||
++i;
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (code2 & 0x3ff));
|
||||
bytes[index++] = (0xf0 | (code >>> 18));
|
||||
bytes[index++] = (0x80 | ((code >>> 12) & 0x3f));
|
||||
bytes[index++] = (0x80 | ((code >>> 6) & 0x3f));
|
||||
bytes[index++] = (0x80 | (code & 0x3f));
|
||||
} else {
|
||||
// unpaired surrogate: U+FFFD
|
||||
bytes[index++] = 0xef;
|
||||
bytes[index++] = 0xbf;
|
||||
bytes[index++] = 0xbd;
|
||||
}
|
||||
}
|
||||
key = bytes;
|
||||
|
||||
+8
-8
@@ -93,7 +93,7 @@
|
||||
|
||||
<dt class="tag-source">Source:</dt>
|
||||
<dd class="tag-source"><ul class="dummy"><li>
|
||||
<a href="md5.js.html">md5.js</a>, <a href="md5.js.html#line803">line 803</a>
|
||||
<a href="md5.js.html">md5.js</a>, <a href="md5.js.html#line815">line 815</a>
|
||||
</li></ul></dd>
|
||||
|
||||
|
||||
@@ -224,7 +224,7 @@
|
||||
|
||||
<dt class="tag-source">Source:</dt>
|
||||
<dd class="tag-source"><ul class="dummy"><li>
|
||||
<a href="md5.js.html">md5.js</a>, <a href="md5.js.html#line722">line 722</a>
|
||||
<a href="md5.js.html">md5.js</a>, <a href="md5.js.html#line734">line 734</a>
|
||||
</li></ul></dd>
|
||||
|
||||
|
||||
@@ -351,7 +351,7 @@
|
||||
|
||||
<dt class="tag-source">Source:</dt>
|
||||
<dd class="tag-source"><ul class="dummy"><li>
|
||||
<a href="md5.js.html">md5.js</a>, <a href="md5.js.html#line734">line 734</a>
|
||||
<a href="md5.js.html">md5.js</a>, <a href="md5.js.html#line746">line 746</a>
|
||||
</li></ul></dd>
|
||||
|
||||
|
||||
@@ -478,7 +478,7 @@
|
||||
|
||||
<dt class="tag-source">Source:</dt>
|
||||
<dd class="tag-source"><ul class="dummy"><li>
|
||||
<a href="md5.js.html">md5.js</a>, <a href="md5.js.html#line772">line 772</a>
|
||||
<a href="md5.js.html">md5.js</a>, <a href="md5.js.html#line784">line 784</a>
|
||||
</li></ul></dd>
|
||||
|
||||
|
||||
@@ -607,7 +607,7 @@
|
||||
|
||||
<dt class="tag-source">Source:</dt>
|
||||
<dd class="tag-source"><ul class="dummy"><li>
|
||||
<a href="md5.js.html">md5.js</a>, <a href="md5.js.html#line756">line 756</a>
|
||||
<a href="md5.js.html">md5.js</a>, <a href="md5.js.html#line768">line 768</a>
|
||||
</li></ul></dd>
|
||||
|
||||
|
||||
@@ -734,7 +734,7 @@
|
||||
|
||||
<dt class="tag-source">Source:</dt>
|
||||
<dd class="tag-source"><ul class="dummy"><li>
|
||||
<a href="md5.js.html">md5.js</a>, <a href="md5.js.html#line700">line 700</a>
|
||||
<a href="md5.js.html">md5.js</a>, <a href="md5.js.html#line712">line 712</a>
|
||||
</li></ul></dd>
|
||||
|
||||
|
||||
@@ -861,7 +861,7 @@
|
||||
|
||||
<dt class="tag-source">Source:</dt>
|
||||
<dd class="tag-source"><ul class="dummy"><li>
|
||||
<a href="md5.js.html">md5.js</a>, <a href="md5.js.html#line655">line 655</a>
|
||||
<a href="md5.js.html">md5.js</a>, <a href="md5.js.html#line667">line 667</a>
|
||||
</li></ul></dd>
|
||||
|
||||
|
||||
@@ -988,7 +988,7 @@
|
||||
|
||||
<dt class="tag-source">Source:</dt>
|
||||
<dd class="tag-source"><ul class="dummy"><li>
|
||||
<a href="md5.js.html">md5.js</a>, <a href="md5.js.html#line688">line 688</a>
|
||||
<a href="md5.js.html">md5.js</a>, <a href="md5.js.html#line700">line 700</a>
|
||||
</li></ul></dd>
|
||||
|
||||
|
||||
|
||||
+1
-1
@@ -47,7 +47,7 @@
|
||||
|
||||
|
||||
<dt class="tag-version">Version:</dt>
|
||||
<dd class="tag-version"><ul class="dummy"><li>0.9.2</li></ul></dd>
|
||||
<dd class="tag-version"><ul class="dummy"><li>0.10.0</li></ul></dd>
|
||||
|
||||
|
||||
|
||||
|
||||
+1
-1
@@ -214,7 +214,7 @@
|
||||
|
||||
<dt class="tag-source">Source:</dt>
|
||||
<dd class="tag-source"><ul class="dummy"><li>
|
||||
<a href="md5.js.html">md5.js</a>, <a href="md5.js.html#line882">line 882</a>
|
||||
<a href="md5.js.html">md5.js</a>, <a href="md5.js.html#line900">line 900</a>
|
||||
</li></ul></dd>
|
||||
|
||||
|
||||
|
||||
+7
-7
@@ -208,7 +208,7 @@
|
||||
|
||||
<dt class="tag-source">Source:</dt>
|
||||
<dd class="tag-source"><ul class="dummy"><li>
|
||||
<a href="md5.js.html">md5.js</a>, <a href="md5.js.html#line722">line 722</a>
|
||||
<a href="md5.js.html">md5.js</a>, <a href="md5.js.html#line734">line 734</a>
|
||||
</li></ul></dd>
|
||||
|
||||
|
||||
@@ -330,7 +330,7 @@
|
||||
|
||||
<dt class="tag-source">Source:</dt>
|
||||
<dd class="tag-source"><ul class="dummy"><li>
|
||||
<a href="md5.js.html">md5.js</a>, <a href="md5.js.html#line734">line 734</a>
|
||||
<a href="md5.js.html">md5.js</a>, <a href="md5.js.html#line746">line 746</a>
|
||||
</li></ul></dd>
|
||||
|
||||
|
||||
@@ -452,7 +452,7 @@
|
||||
|
||||
<dt class="tag-source">Source:</dt>
|
||||
<dd class="tag-source"><ul class="dummy"><li>
|
||||
<a href="md5.js.html">md5.js</a>, <a href="md5.js.html#line772">line 772</a>
|
||||
<a href="md5.js.html">md5.js</a>, <a href="md5.js.html#line784">line 784</a>
|
||||
</li></ul></dd>
|
||||
|
||||
|
||||
@@ -576,7 +576,7 @@
|
||||
|
||||
<dt class="tag-source">Source:</dt>
|
||||
<dd class="tag-source"><ul class="dummy"><li>
|
||||
<a href="md5.js.html">md5.js</a>, <a href="md5.js.html#line756">line 756</a>
|
||||
<a href="md5.js.html">md5.js</a>, <a href="md5.js.html#line768">line 768</a>
|
||||
</li></ul></dd>
|
||||
|
||||
|
||||
@@ -698,7 +698,7 @@
|
||||
|
||||
<dt class="tag-source">Source:</dt>
|
||||
<dd class="tag-source"><ul class="dummy"><li>
|
||||
<a href="md5.js.html">md5.js</a>, <a href="md5.js.html#line700">line 700</a>
|
||||
<a href="md5.js.html">md5.js</a>, <a href="md5.js.html#line712">line 712</a>
|
||||
</li></ul></dd>
|
||||
|
||||
|
||||
@@ -820,7 +820,7 @@
|
||||
|
||||
<dt class="tag-source">Source:</dt>
|
||||
<dd class="tag-source"><ul class="dummy"><li>
|
||||
<a href="md5.js.html">md5.js</a>, <a href="md5.js.html#line655">line 655</a>
|
||||
<a href="md5.js.html">md5.js</a>, <a href="md5.js.html#line667">line 667</a>
|
||||
</li></ul></dd>
|
||||
|
||||
|
||||
@@ -942,7 +942,7 @@
|
||||
|
||||
<dt class="tag-source">Source:</dt>
|
||||
<dd class="tag-source"><ul class="dummy"><li>
|
||||
<a href="md5.js.html">md5.js</a>, <a href="md5.js.html#line688">line 688</a>
|
||||
<a href="md5.js.html">md5.js</a>, <a href="md5.js.html#line700">line 700</a>
|
||||
</li></ul></dd>
|
||||
|
||||
|
||||
|
||||
+27
-9
@@ -30,7 +30,7 @@
|
||||
* [js-md5]{@link https://github.com/emn178/js-md5}
|
||||
*
|
||||
* @namespace md5
|
||||
* @version 0.9.2
|
||||
* @version 0.10.0
|
||||
* @author Chen, Yi-Cyuan [emn178@gmail.com]
|
||||
* @copyright Chen, Yi-Cyuan 2014-2026
|
||||
* @license MIT
|
||||
@@ -405,7 +405,7 @@
|
||||
var result = formatMessage(message);
|
||||
message = result[0];
|
||||
var isString = result[1];
|
||||
var code, index = 0, i, length = message.length, blocks = this.blocks;
|
||||
var code, code2, index = 0, i, length = message.length, blocks = this.blocks;
|
||||
var buffer8 = this.buffer8;
|
||||
|
||||
while (index < length) {
|
||||
@@ -431,12 +431,18 @@
|
||||
buffer8[i++] = 0xe0 | (code >>> 12);
|
||||
buffer8[i++] = 0x80 | ((code >>> 6) & 0x3f);
|
||||
buffer8[i++] = 0x80 | (code & 0x3f);
|
||||
} else {
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (message.charCodeAt(++index) & 0x3ff));
|
||||
} else if (code < 0xdc00 && (code2 = message.charCodeAt(index + 1)) >= 0xdc00 && code2 < 0xe000) {
|
||||
++index;
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (code2 & 0x3ff));
|
||||
buffer8[i++] = 0xf0 | (code >>> 18);
|
||||
buffer8[i++] = 0x80 | ((code >>> 12) & 0x3f);
|
||||
buffer8[i++] = 0x80 | ((code >>> 6) & 0x3f);
|
||||
buffer8[i++] = 0x80 | (code & 0x3f);
|
||||
} else {
|
||||
// unpaired surrogate: U+FFFD
|
||||
buffer8[i++] = 0xef;
|
||||
buffer8[i++] = 0xbf;
|
||||
buffer8[i++] = 0xbd;
|
||||
}
|
||||
}
|
||||
} else {
|
||||
@@ -451,12 +457,18 @@
|
||||
blocks[i >>> 2] |= (0xe0 | (code >>> 12)) << SHIFT[i++ & 3];
|
||||
blocks[i >>> 2] |= (0x80 | ((code >>> 6) & 0x3f)) << SHIFT[i++ & 3];
|
||||
blocks[i >>> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];
|
||||
} else {
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (message.charCodeAt(++index) & 0x3ff));
|
||||
} else if (code < 0xdc00 && (code2 = message.charCodeAt(index + 1)) >= 0xdc00 && code2 < 0xe000) {
|
||||
++index;
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (code2 & 0x3ff));
|
||||
blocks[i >>> 2] |= (0xf0 | (code >>> 18)) << SHIFT[i++ & 3];
|
||||
blocks[i >>> 2] |= (0x80 | ((code >>> 12) & 0x3f)) << SHIFT[i++ & 3];
|
||||
blocks[i >>> 2] |= (0x80 | ((code >>> 6) & 0x3f)) << SHIFT[i++ & 3];
|
||||
blocks[i >>> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];
|
||||
} else {
|
||||
// unpaired surrogate: U+FFFD
|
||||
blocks[i >>> 2] |= 0xef << SHIFT[i++ & 3];
|
||||
blocks[i >>> 2] |= 0xbf << SHIFT[i++ & 3];
|
||||
blocks[i >>> 2] |= 0xbd << SHIFT[i++ & 3];
|
||||
}
|
||||
}
|
||||
}
|
||||
@@ -839,7 +851,7 @@
|
||||
var i, result = formatMessage(key);
|
||||
key = result[0];
|
||||
if (result[1]) {
|
||||
var bytes = [], length = key.length, index = 0, code;
|
||||
var bytes = [], length = key.length, index = 0, code, code2;
|
||||
for (i = 0; i < length; ++i) {
|
||||
code = key.charCodeAt(i);
|
||||
if (code < 0x80) {
|
||||
@@ -851,12 +863,18 @@
|
||||
bytes[index++] = (0xe0 | (code >>> 12));
|
||||
bytes[index++] = (0x80 | ((code >>> 6) & 0x3f));
|
||||
bytes[index++] = (0x80 | (code & 0x3f));
|
||||
} else {
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (key.charCodeAt(++i) & 0x3ff));
|
||||
} else if (code < 0xdc00 && (code2 = key.charCodeAt(i + 1)) >= 0xdc00 && code2 < 0xe000) {
|
||||
++i;
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (code2 & 0x3ff));
|
||||
bytes[index++] = (0xf0 | (code >>> 18));
|
||||
bytes[index++] = (0x80 | ((code >>> 12) & 0x3f));
|
||||
bytes[index++] = (0x80 | ((code >>> 6) & 0x3f));
|
||||
bytes[index++] = (0x80 | (code & 0x3f));
|
||||
} else {
|
||||
// unpaired surrogate: U+FFFD
|
||||
bytes[index++] = 0xef;
|
||||
bytes[index++] = 0xbf;
|
||||
bytes[index++] = 0xbd;
|
||||
}
|
||||
}
|
||||
key = bytes;
|
||||
|
||||
Generated
+2
-2
@@ -1,12 +1,12 @@
|
||||
{
|
||||
"name": "js-md5",
|
||||
"version": "0.9.2",
|
||||
"version": "0.10.0",
|
||||
"lockfileVersion": 3,
|
||||
"requires": true,
|
||||
"packages": {
|
||||
"": {
|
||||
"name": "js-md5",
|
||||
"version": "0.9.2",
|
||||
"version": "0.10.0",
|
||||
"license": "MIT",
|
||||
"devDependencies": {
|
||||
"@rollup/plugin-commonjs": "^29.0.3",
|
||||
|
||||
+1
-1
@@ -1,6 +1,6 @@
|
||||
{
|
||||
"name": "js-md5",
|
||||
"version": "0.9.2",
|
||||
"version": "0.10.0",
|
||||
"description": "A simple MD5 hash function for JavaScript supports UTF-8 encoding.",
|
||||
"main": "src/md5.js",
|
||||
"module": "build/md5.mjs",
|
||||
|
||||
+27
-9
@@ -2,7 +2,7 @@
|
||||
* [js-md5]{@link https://github.com/emn178/js-md5}
|
||||
*
|
||||
* @namespace md5
|
||||
* @version 0.9.2
|
||||
* @version 0.10.0
|
||||
* @author Chen, Yi-Cyuan [emn178@gmail.com]
|
||||
* @copyright Chen, Yi-Cyuan 2014-2026
|
||||
* @license MIT
|
||||
@@ -377,7 +377,7 @@
|
||||
var result = formatMessage(message);
|
||||
message = result[0];
|
||||
var isString = result[1];
|
||||
var code, index = 0, i, length = message.length, blocks = this.blocks;
|
||||
var code, code2, index = 0, i, length = message.length, blocks = this.blocks;
|
||||
var buffer8 = this.buffer8;
|
||||
|
||||
while (index < length) {
|
||||
@@ -403,12 +403,18 @@
|
||||
buffer8[i++] = 0xe0 | (code >>> 12);
|
||||
buffer8[i++] = 0x80 | ((code >>> 6) & 0x3f);
|
||||
buffer8[i++] = 0x80 | (code & 0x3f);
|
||||
} else {
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (message.charCodeAt(++index) & 0x3ff));
|
||||
} else if (code < 0xdc00 && (code2 = message.charCodeAt(index + 1)) >= 0xdc00 && code2 < 0xe000) {
|
||||
++index;
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (code2 & 0x3ff));
|
||||
buffer8[i++] = 0xf0 | (code >>> 18);
|
||||
buffer8[i++] = 0x80 | ((code >>> 12) & 0x3f);
|
||||
buffer8[i++] = 0x80 | ((code >>> 6) & 0x3f);
|
||||
buffer8[i++] = 0x80 | (code & 0x3f);
|
||||
} else {
|
||||
// unpaired surrogate: U+FFFD
|
||||
buffer8[i++] = 0xef;
|
||||
buffer8[i++] = 0xbf;
|
||||
buffer8[i++] = 0xbd;
|
||||
}
|
||||
}
|
||||
} else {
|
||||
@@ -423,12 +429,18 @@
|
||||
blocks[i >>> 2] |= (0xe0 | (code >>> 12)) << SHIFT[i++ & 3];
|
||||
blocks[i >>> 2] |= (0x80 | ((code >>> 6) & 0x3f)) << SHIFT[i++ & 3];
|
||||
blocks[i >>> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];
|
||||
} else {
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (message.charCodeAt(++index) & 0x3ff));
|
||||
} else if (code < 0xdc00 && (code2 = message.charCodeAt(index + 1)) >= 0xdc00 && code2 < 0xe000) {
|
||||
++index;
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (code2 & 0x3ff));
|
||||
blocks[i >>> 2] |= (0xf0 | (code >>> 18)) << SHIFT[i++ & 3];
|
||||
blocks[i >>> 2] |= (0x80 | ((code >>> 12) & 0x3f)) << SHIFT[i++ & 3];
|
||||
blocks[i >>> 2] |= (0x80 | ((code >>> 6) & 0x3f)) << SHIFT[i++ & 3];
|
||||
blocks[i >>> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];
|
||||
} else {
|
||||
// unpaired surrogate: U+FFFD
|
||||
blocks[i >>> 2] |= 0xef << SHIFT[i++ & 3];
|
||||
blocks[i >>> 2] |= 0xbf << SHIFT[i++ & 3];
|
||||
blocks[i >>> 2] |= 0xbd << SHIFT[i++ & 3];
|
||||
}
|
||||
}
|
||||
}
|
||||
@@ -811,7 +823,7 @@
|
||||
var i, result = formatMessage(key);
|
||||
key = result[0];
|
||||
if (result[1]) {
|
||||
var bytes = [], length = key.length, index = 0, code;
|
||||
var bytes = [], length = key.length, index = 0, code, code2;
|
||||
for (i = 0; i < length; ++i) {
|
||||
code = key.charCodeAt(i);
|
||||
if (code < 0x80) {
|
||||
@@ -823,12 +835,18 @@
|
||||
bytes[index++] = (0xe0 | (code >>> 12));
|
||||
bytes[index++] = (0x80 | ((code >>> 6) & 0x3f));
|
||||
bytes[index++] = (0x80 | (code & 0x3f));
|
||||
} else {
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (key.charCodeAt(++i) & 0x3ff));
|
||||
} else if (code < 0xdc00 && (code2 = key.charCodeAt(i + 1)) >= 0xdc00 && code2 < 0xe000) {
|
||||
++i;
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (code2 & 0x3ff));
|
||||
bytes[index++] = (0xf0 | (code >>> 18));
|
||||
bytes[index++] = (0x80 | ((code >>> 12) & 0x3f));
|
||||
bytes[index++] = (0x80 | ((code >>> 6) & 0x3f));
|
||||
bytes[index++] = (0x80 | (code & 0x3f));
|
||||
} else {
|
||||
// unpaired surrogate: U+FFFD
|
||||
bytes[index++] = 0xef;
|
||||
bytes[index++] = 0xbf;
|
||||
bytes[index++] = 0xbd;
|
||||
}
|
||||
}
|
||||
key = bytes;
|
||||
|
||||
@@ -45,6 +45,10 @@
|
||||
'05fe3b294344f4e93c811e10f9825a38': ['中文', '中文'],
|
||||
'c1bc6df91f38e6332b8562324005103d': ['aécio', 'aécio'],
|
||||
'14eef78533c35078177d11fb4593a19e': ['𠜎', '𠜎']
|
||||
},
|
||||
'UTF8 unpaired surrogates': {
|
||||
'2ef4c67742d4f436cbdfdbad133659af': ['\ud800', 'a\ud83db'],
|
||||
'f537b6e97a3e8b23a9e87a29fb5c4173': ['a\udc00b', '\ud83d\ude00\udfff']
|
||||
}
|
||||
}
|
||||
};
|
||||
|
||||
@@ -27,6 +27,16 @@
|
||||
'edce615b179e6e29be23145b77ebbd61': '訊息摘要演算法第五版(英語:Message-Digest Algorithm 5,縮寫為MD5),是當前電腦領域用於確保資訊傳輸完整一致而廣泛使用的雜湊演算法之一',
|
||||
'ad36c9ab669a0ba9ce46d3ce9134de34': '訊息摘要演算法第五版(英語:Message-Digest Algorithm 5,縮寫為MD5),是當前電腦領域用於確保資訊傳輸完整一致而廣泛使用的雜湊演算法之一(又譯雜湊演算法、摘要演算法等),主流程式語言普遍已有MD5的實作。'
|
||||
},
|
||||
'UTF8 unpaired surrogates': {
|
||||
'9b759040321a408a5c7768b4511287a6': '\ud800',
|
||||
'e240e5e976deb550ea69ec12f01d19ea': '\udc00x',
|
||||
'ff6405018d5ab2642e35fdba389b7c51': 'a\ud83db',
|
||||
'ef175e9b596d296034dda690087252f8': 'a\udc00',
|
||||
'2e906629739ba554e03c1201e05b94f2': '\ud83d\ud83d\ude00',
|
||||
'468a7f02af0808ae39ef3e3629ae048c': '\ud83d\ude00\udfff',
|
||||
'6785af8cb378bd9950085c5d6375f9ad': Array(57).join('0') + '\ud800',
|
||||
'a20fb4cd303a71aa61dd524e8fc525ef': Array(64).join('0') + '\ud800b'
|
||||
},
|
||||
'special length': {
|
||||
'a119de63e4b2398427da06dd780263b3': '0123456780123456780123456780123456780123456780123456780',
|
||||
'ddafd84ebe63aebc4626b037a569d78b': '01234567801234567801234567801234567801234567801234567801',
|
||||
|
||||
Reference in New Issue
Block a user