Huge News!Announcing our $40M Series B led by Abstract Ventures.Learn More →
js-md5 - npm Package Compare versions
Comparing version 0.2.2 to 0.3.0
| { | ||
| "name": "js-md5", | ||
| "version": "0.2.2", | ||
| "version": "0.3.0", | ||
| "main": ["build/md5.min.js"], | ||
@@ -5,0 +5,0 @@ "ignore": [ |
@@ -1,12 +0,22 @@ | ||
| (function(p,E){var u="undefined"!=typeof module;u&&(p=global,p.JS_MD5_TEST&&(p.navigator={userAgent:"Firefox"}));var B=(p.JS_MD5_TEST||!u)&&-1!=navigator.userAgent.indexOf("Firefox"),y=!p.JS_MD5_TEST&&"undefined"!=typeof ArrayBuffer,f="0123456789abcdef".split(""),C=[128,32768,8388608,-2147483648],t=[0,8,16,24],e=[],r;if(y){var z=new ArrayBuffer(68);r=new Uint8Array(z);e=new Uint32Array(z)}var A=function(g){var k,l,m,n,b,a,d,c,h,p=!0,u=!1,q=0,v=0,x=0,w=g.length;e[16]=0;do{e[0]=e[16];e[16]=e[1]=e[2]= | ||
| e[3]=e[4]=e[5]=e[6]=e[7]=e[8]=e[9]=e[10]=e[11]=e[12]=e[13]=e[14]=e[15]=0;if(y)for(a=v;q<w&&64>a;++q)b=g.charCodeAt(q),128>b?r[a++]=b:(2048>b?r[a++]=192|b>>6:(55296>b||57344<=b?r[a++]=224|b>>12:(b=65536+((b&1023)<<10|g.charCodeAt(++q)&1023),r[a++]=240|b>>18,r[a++]=128|b>>12&63),r[a++]=128|b>>6&63),r[a++]=128|b&63);else for(a=v;q<w&&64>a;++q)b=g.charCodeAt(q),128>b?e[a>>2]|=b<<t[a++&3]:(2048>b?e[a>>2]|=(192|b>>6)<<t[a++&3]:(55296>b||57344<=b?e[a>>2]|=(224|b>>12)<<t[a++&3]:(b=65536+((b&1023)<<10|g.charCodeAt(++q)& | ||
| 1023),e[a>>2]|=(240|b>>18)<<t[a++&3],e[a>>2]|=(128|b>>12&63)<<t[a++&3]),e[a>>2]|=(128|b>>6&63)<<t[a++&3]),e[a>>2]|=(128|b&63)<<t[a++&3]);x+=a-v;v=a-64;q==w&&(e[a>>2]|=C[a&3],++q);q>w&&56>a&&(e[14]=x<<3,u=!0);p?(b=e[0]-680876937,b=(b<<7|b>>>25)-271733879<<0,c=(-1732584194^b&2004318071)+e[1]-117830708,c=(c<<12|c>>>20)+b<<0,d=(-271733879^c&(b^-271733879))+e[2]-1126478375,d=(d<<17|d>>>15)+c<<0,a=(b^d&(c^b))+e[3]-1316259209):(b=k,a=l,d=m,c=n,b+=(c^a&(d^c))+e[0]-680876936,b=(b<<7|b>>>25)+a<<0,c+=(d^b&(a^ | ||
| d))+e[1]-389564586,c=(c<<12|c>>>20)+b<<0,d+=(a^c&(b^a))+e[2]+606105819,d=(d<<17|d>>>15)+c<<0,a+=(b^d&(c^b))+e[3]-1044525330);a=(a<<22|a>>>10)+d<<0;b+=(c^a&(d^c))+e[4]-176418897;b=(b<<7|b>>>25)+a<<0;c+=(d^b&(a^d))+e[5]+1200080426;c=(c<<12|c>>>20)+b<<0;d+=(a^c&(b^a))+e[6]-1473231341;d=(d<<17|d>>>15)+c<<0;a+=(b^d&(c^b))+e[7]-45705983;a=(a<<22|a>>>10)+d<<0;b+=(c^a&(d^c))+e[8]+1770035416;b=(b<<7|b>>>25)+a<<0;c+=(d^b&(a^d))+e[9]-1958414417;c=(c<<12|c>>>20)+b<<0;d+=(a^c&(b^a))+e[10]-42063;d=(d<<17|d>>>15)+ | ||
| c<<0;a+=(b^d&(c^b))+e[11]-1990404162;a=(a<<22|a>>>10)+d<<0;b+=(c^a&(d^c))+e[12]+1804603682;b=(b<<7|b>>>25)+a<<0;c+=(d^b&(a^d))+e[13]-40341101;c=(c<<12|c>>>20)+b<<0;d+=(a^c&(b^a))+e[14]-1502002290;d=(d<<17|d>>>15)+c<<0;a+=(b^d&(c^b))+e[15]+1236535329;a=(a<<22|a>>>10)+d<<0;b+=(d^c&(a^d))+e[1]-165796510;b=(b<<5|b>>>27)+a<<0;c+=(a^d&(b^a))+e[6]-1069501632;c=(c<<9|c>>>23)+b<<0;d+=(b^a&(c^b))+e[11]+643717713;d=(d<<14|d>>>18)+c<<0;a+=(c^b&(d^c))+e[0]-373897302;a=(a<<20|a>>>12)+d<<0;b+=(d^c&(a^d))+e[5]-701558691; | ||
| b=(b<<5|b>>>27)+a<<0;c+=(a^d&(b^a))+e[10]+38016083;c=(c<<9|c>>>23)+b<<0;d+=(b^a&(c^b))+e[15]-660478335;d=(d<<14|d>>>18)+c<<0;a+=(c^b&(d^c))+e[4]-405537848;a=(a<<20|a>>>12)+d<<0;b+=(d^c&(a^d))+e[9]+568446438;b=(b<<5|b>>>27)+a<<0;c+=(a^d&(b^a))+e[14]-1019803690;c=(c<<9|c>>>23)+b<<0;d+=(b^a&(c^b))+e[3]-187363961;d=(d<<14|d>>>18)+c<<0;a+=(c^b&(d^c))+e[8]+1163531501;a=(a<<20|a>>>12)+d<<0;b+=(d^c&(a^d))+e[13]-1444681467;b=(b<<5|b>>>27)+a<<0;c+=(a^d&(b^a))+e[2]-51403784;c=(c<<9|c>>>23)+b<<0;d+=(b^a&(c^b))+ | ||
| e[7]+1735328473;d=(d<<14|d>>>18)+c<<0;a+=(c^b&(d^c))+e[12]-1926607734;a=(a<<20|a>>>12)+d<<0;h=a^d;b+=(h^c)+e[5]-378558;b=(b<<4|b>>>28)+a<<0;c+=(h^b)+e[8]-2022574463;c=(c<<11|c>>>21)+b<<0;h=c^b;d+=(h^a)+e[11]+1839030562;d=(d<<16|d>>>16)+c<<0;a+=(h^d)+e[14]-35309556;a=(a<<23|a>>>9)+d<<0;h=a^d;b+=(h^c)+e[1]-1530992060;b=(b<<4|b>>>28)+a<<0;c+=(h^b)+e[4]+1272893353;c=(c<<11|c>>>21)+b<<0;h=c^b;d+=(h^a)+e[7]-155497632;d=(d<<16|d>>>16)+c<<0;a+=(h^d)+e[10]-1094730640;a=(a<<23|a>>>9)+d<<0;h=a^d;b+=(h^c)+e[13]+ | ||
| 681279174;b=(b<<4|b>>>28)+a<<0;c+=(h^b)+e[0]-358537222;c=(c<<11|c>>>21)+b<<0;h=c^b;d+=(h^a)+e[3]-722521979;d=(d<<16|d>>>16)+c<<0;a+=(h^d)+e[6]+76029189;a=(a<<23|a>>>9)+d<<0;h=a^d;b+=(h^c)+e[9]-640364487;b=(b<<4|b>>>28)+a<<0;c+=(h^b)+e[12]-421815835;c=(c<<11|c>>>21)+b<<0;h=c^b;d+=(h^a)+e[15]+530742520;d=(d<<16|d>>>16)+c<<0;a+=(h^d)+e[2]-995338651;a=(a<<23|a>>>9)+d<<0;b+=(d^(a|~c))+e[0]-198630844;b=(b<<6|b>>>26)+a<<0;c+=(a^(b|~d))+e[7]+1126891415;c=(c<<10|c>>>22)+b<<0;d+=(b^(c|~a))+e[14]-1416354905; | ||
| d=(d<<15|d>>>17)+c<<0;a+=(c^(d|~b))+e[5]-57434055;a=(a<<21|a>>>11)+d<<0;b+=(d^(a|~c))+e[12]+1700485571;b=(b<<6|b>>>26)+a<<0;c+=(a^(b|~d))+e[3]-1894986606;c=(c<<10|c>>>22)+b<<0;d+=(b^(c|~a))+e[10]-1051523;d=(d<<15|d>>>17)+c<<0;a+=(c^(d|~b))+e[1]-2054922799;a=(a<<21|a>>>11)+d<<0;b+=(d^(a|~c))+e[8]+1873313359;b=(b<<6|b>>>26)+a<<0;c+=(a^(b|~d))+e[15]-30611744;c=(c<<10|c>>>22)+b<<0;d+=(b^(c|~a))+e[6]-1560198380;d=(d<<15|d>>>17)+c<<0;a+=(c^(d|~b))+e[13]+1309151649;a=(a<<21|a>>>11)+d<<0;b+=(d^(a|~c))+e[4]- | ||
| 145523070;b=(b<<6|b>>>26)+a<<0;c+=(a^(b|~d))+e[11]-1120210379;c=(c<<10|c>>>22)+b<<0;d+=(b^(c|~a))+e[2]+718787259;d=(d<<15|d>>>17)+c<<0;a+=(c^(d|~b))+e[9]-343485551;a=(a<<21|a>>>11)+d<<0;p?(k=b+1732584193<<0,l=a-271733879<<0,m=d-1732584194<<0,n=c+271733878<<0,p=!1):(k=k+b<<0,l=l+a<<0,m=m+d<<0,n=n+c<<0)}while(!u);return B?(g=f[k>>4&15]+f[k&15],g+=f[k>>12&15]+f[k>>8&15],g+=f[k>>20&15]+f[k>>16&15],g+=f[k>>28&15]+f[k>>24&15],g+=f[l>>4&15]+f[l&15],g+=f[l>>12&15]+f[l>>8&15],g+=f[l>>20&15]+f[l>>16&15],g+= | ||
| f[l>>28&15]+f[l>>24&15],g+=f[m>>4&15]+f[m&15],g+=f[m>>12&15]+f[m>>8&15],g+=f[m>>20&15]+f[m>>16&15],g+=f[m>>28&15]+f[m>>24&15],g+=f[n>>4&15]+f[n&15],g+=f[n>>12&15]+f[n>>8&15],g+=f[n>>20&15]+f[n>>16&15],g+=f[n>>28&15]+f[n>>24&15]):f[k>>4&15]+f[k&15]+f[k>>12&15]+f[k>>8&15]+f[k>>20&15]+f[k>>16&15]+f[k>>28&15]+f[k>>24&15]+f[l>>4&15]+f[l&15]+f[l>>12&15]+f[l>>8&15]+f[l>>20&15]+f[l>>16&15]+f[l>>28&15]+f[l>>24&15]+f[m>>4&15]+f[m&15]+f[m>>12&15]+f[m>>8&15]+f[m>>20&15]+f[m>>16&15]+f[m>>28&15]+f[m>>24&15]+f[n>> | ||
| 4&15]+f[n&15]+f[n>>12&15]+f[n>>8&15]+f[n>>20&15]+f[n>>16&15]+f[n>>28&15]+f[n>>24&15]};if(!p.JS_MD5_TEST&&u){var D=require("crypto");module.exports=function(e){return 80>=e.length||183>=e.length&&!/[^\x00-\x7F]/.test(e)?A(e):D.createHash("md5").update(e,"utf8").digest("hex")}}else p&&(p.md5=A)})(this); | ||
| /* | ||
| * js-md5 v0.3.0 | ||
| * https://github.com/emn178/js-md5 | ||
| * | ||
| * Copyright 2014-2015, emn178@gmail.com | ||
| * | ||
| * Licensed under the MIT license: | ||
| * http://www.opensource.org/licenses/MIT | ||
| */ | ||
| (function(q,F){var u="undefined"!=typeof module;u&&(q=global,q.JS_MD5_TEST&&(q.navigator={userAgent:"Firefox"}));var C=(q.JS_MD5_TEST||!u)&&-1!=navigator.userAgent.indexOf("Firefox"),y=!q.JS_MD5_TEST&&"undefined"!=typeof ArrayBuffer,f="0123456789abcdef".split(""),D=[128,32768,8388608,-2147483648],t=[0,8,16,24],e=[],r;if(y){var A=new ArrayBuffer(68);r=new Uint8Array(A);e=new Uint32Array(A)}var x=function(g){var q="string"!=typeof g;q&&g.constructor==ArrayBuffer&&(g=new Uint8Array(g));var k,l,m,n,b, | ||
| a,d,c,h,u=!0,x=!1,p=0,v=0,z=0,w=g.length;e[16]=0;do{e[0]=e[16];e[16]=e[1]=e[2]=e[3]=e[4]=e[5]=e[6]=e[7]=e[8]=e[9]=e[10]=e[11]=e[12]=e[13]=e[14]=e[15]=0;if(q)if(y)for(a=v;p<w&&64>a;++p)r[a++]=g[p];else for(a=v;p<w&&64>a;++p)e[a>>2]|=g[p]<<t[a++&3];else if(y)for(a=v;p<w&&64>a;++p)b=g.charCodeAt(p),128>b?r[a++]=b:(2048>b?r[a++]=192|b>>6:(55296>b||57344<=b?r[a++]=224|b>>12:(b=65536+((b&1023)<<10|g.charCodeAt(++p)&1023),r[a++]=240|b>>18,r[a++]=128|b>>12&63),r[a++]=128|b>>6&63),r[a++]=128|b&63);else for(a= | ||
| v;p<w&&64>a;++p)b=g.charCodeAt(p),128>b?e[a>>2]|=b<<t[a++&3]:(2048>b?e[a>>2]|=(192|b>>6)<<t[a++&3]:(55296>b||57344<=b?e[a>>2]|=(224|b>>12)<<t[a++&3]:(b=65536+((b&1023)<<10|g.charCodeAt(++p)&1023),e[a>>2]|=(240|b>>18)<<t[a++&3],e[a>>2]|=(128|b>>12&63)<<t[a++&3]),e[a>>2]|=(128|b>>6&63)<<t[a++&3]),e[a>>2]|=(128|b&63)<<t[a++&3]);z+=a-v;v=a-64;p==w&&(e[a>>2]|=D[a&3],++p);p>w&&56>a&&(e[14]=z<<3,x=!0);u?(b=e[0]-680876937,b=(b<<7|b>>>25)-271733879<<0,c=(-1732584194^b&2004318071)+e[1]-117830708,c=(c<<12|c>>> | ||
| 20)+b<<0,d=(-271733879^c&(b^-271733879))+e[2]-1126478375,d=(d<<17|d>>>15)+c<<0,a=(b^d&(c^b))+e[3]-1316259209):(b=k,a=l,d=m,c=n,b+=(c^a&(d^c))+e[0]-680876936,b=(b<<7|b>>>25)+a<<0,c+=(d^b&(a^d))+e[1]-389564586,c=(c<<12|c>>>20)+b<<0,d+=(a^c&(b^a))+e[2]+606105819,d=(d<<17|d>>>15)+c<<0,a+=(b^d&(c^b))+e[3]-1044525330);a=(a<<22|a>>>10)+d<<0;b+=(c^a&(d^c))+e[4]-176418897;b=(b<<7|b>>>25)+a<<0;c+=(d^b&(a^d))+e[5]+1200080426;c=(c<<12|c>>>20)+b<<0;d+=(a^c&(b^a))+e[6]-1473231341;d=(d<<17|d>>>15)+c<<0;a+=(b^d& | ||
| (c^b))+e[7]-45705983;a=(a<<22|a>>>10)+d<<0;b+=(c^a&(d^c))+e[8]+1770035416;b=(b<<7|b>>>25)+a<<0;c+=(d^b&(a^d))+e[9]-1958414417;c=(c<<12|c>>>20)+b<<0;d+=(a^c&(b^a))+e[10]-42063;d=(d<<17|d>>>15)+c<<0;a+=(b^d&(c^b))+e[11]-1990404162;a=(a<<22|a>>>10)+d<<0;b+=(c^a&(d^c))+e[12]+1804603682;b=(b<<7|b>>>25)+a<<0;c+=(d^b&(a^d))+e[13]-40341101;c=(c<<12|c>>>20)+b<<0;d+=(a^c&(b^a))+e[14]-1502002290;d=(d<<17|d>>>15)+c<<0;a+=(b^d&(c^b))+e[15]+1236535329;a=(a<<22|a>>>10)+d<<0;b+=(d^c&(a^d))+e[1]-165796510;b=(b<<5| | ||
| b>>>27)+a<<0;c+=(a^d&(b^a))+e[6]-1069501632;c=(c<<9|c>>>23)+b<<0;d+=(b^a&(c^b))+e[11]+643717713;d=(d<<14|d>>>18)+c<<0;a+=(c^b&(d^c))+e[0]-373897302;a=(a<<20|a>>>12)+d<<0;b+=(d^c&(a^d))+e[5]-701558691;b=(b<<5|b>>>27)+a<<0;c+=(a^d&(b^a))+e[10]+38016083;c=(c<<9|c>>>23)+b<<0;d+=(b^a&(c^b))+e[15]-660478335;d=(d<<14|d>>>18)+c<<0;a+=(c^b&(d^c))+e[4]-405537848;a=(a<<20|a>>>12)+d<<0;b+=(d^c&(a^d))+e[9]+568446438;b=(b<<5|b>>>27)+a<<0;c+=(a^d&(b^a))+e[14]-1019803690;c=(c<<9|c>>>23)+b<<0;d+=(b^a&(c^b))+e[3]- | ||
| 187363961;d=(d<<14|d>>>18)+c<<0;a+=(c^b&(d^c))+e[8]+1163531501;a=(a<<20|a>>>12)+d<<0;b+=(d^c&(a^d))+e[13]-1444681467;b=(b<<5|b>>>27)+a<<0;c+=(a^d&(b^a))+e[2]-51403784;c=(c<<9|c>>>23)+b<<0;d+=(b^a&(c^b))+e[7]+1735328473;d=(d<<14|d>>>18)+c<<0;a+=(c^b&(d^c))+e[12]-1926607734;a=(a<<20|a>>>12)+d<<0;h=a^d;b+=(h^c)+e[5]-378558;b=(b<<4|b>>>28)+a<<0;c+=(h^b)+e[8]-2022574463;c=(c<<11|c>>>21)+b<<0;h=c^b;d+=(h^a)+e[11]+1839030562;d=(d<<16|d>>>16)+c<<0;a+=(h^d)+e[14]-35309556;a=(a<<23|a>>>9)+d<<0;h=a^d;b+=(h^ | ||
| c)+e[1]-1530992060;b=(b<<4|b>>>28)+a<<0;c+=(h^b)+e[4]+1272893353;c=(c<<11|c>>>21)+b<<0;h=c^b;d+=(h^a)+e[7]-155497632;d=(d<<16|d>>>16)+c<<0;a+=(h^d)+e[10]-1094730640;a=(a<<23|a>>>9)+d<<0;h=a^d;b+=(h^c)+e[13]+681279174;b=(b<<4|b>>>28)+a<<0;c+=(h^b)+e[0]-358537222;c=(c<<11|c>>>21)+b<<0;h=c^b;d+=(h^a)+e[3]-722521979;d=(d<<16|d>>>16)+c<<0;a+=(h^d)+e[6]+76029189;a=(a<<23|a>>>9)+d<<0;h=a^d;b+=(h^c)+e[9]-640364487;b=(b<<4|b>>>28)+a<<0;c+=(h^b)+e[12]-421815835;c=(c<<11|c>>>21)+b<<0;h=c^b;d+=(h^a)+e[15]+530742520; | ||
| d=(d<<16|d>>>16)+c<<0;a+=(h^d)+e[2]-995338651;a=(a<<23|a>>>9)+d<<0;b+=(d^(a|~c))+e[0]-198630844;b=(b<<6|b>>>26)+a<<0;c+=(a^(b|~d))+e[7]+1126891415;c=(c<<10|c>>>22)+b<<0;d+=(b^(c|~a))+e[14]-1416354905;d=(d<<15|d>>>17)+c<<0;a+=(c^(d|~b))+e[5]-57434055;a=(a<<21|a>>>11)+d<<0;b+=(d^(a|~c))+e[12]+1700485571;b=(b<<6|b>>>26)+a<<0;c+=(a^(b|~d))+e[3]-1894986606;c=(c<<10|c>>>22)+b<<0;d+=(b^(c|~a))+e[10]-1051523;d=(d<<15|d>>>17)+c<<0;a+=(c^(d|~b))+e[1]-2054922799;a=(a<<21|a>>>11)+d<<0;b+=(d^(a|~c))+e[8]+1873313359; | ||
| b=(b<<6|b>>>26)+a<<0;c+=(a^(b|~d))+e[15]-30611744;c=(c<<10|c>>>22)+b<<0;d+=(b^(c|~a))+e[6]-1560198380;d=(d<<15|d>>>17)+c<<0;a+=(c^(d|~b))+e[13]+1309151649;a=(a<<21|a>>>11)+d<<0;b+=(d^(a|~c))+e[4]-145523070;b=(b<<6|b>>>26)+a<<0;c+=(a^(b|~d))+e[11]-1120210379;c=(c<<10|c>>>22)+b<<0;d+=(b^(c|~a))+e[2]+718787259;d=(d<<15|d>>>17)+c<<0;a+=(c^(d|~b))+e[9]-343485551;a=(a<<21|a>>>11)+d<<0;u?(k=b+1732584193<<0,l=a-271733879<<0,m=d-1732584194<<0,n=c+271733878<<0,u=!1):(k=k+b<<0,l=l+a<<0,m=m+d<<0,n=n+c<<0)}while(!x); | ||
| return C?(g=f[k>>4&15]+f[k&15],g+=f[k>>12&15]+f[k>>8&15],g+=f[k>>20&15]+f[k>>16&15],g+=f[k>>28&15]+f[k>>24&15],g+=f[l>>4&15]+f[l&15],g+=f[l>>12&15]+f[l>>8&15],g+=f[l>>20&15]+f[l>>16&15],g+=f[l>>28&15]+f[l>>24&15],g+=f[m>>4&15]+f[m&15],g+=f[m>>12&15]+f[m>>8&15],g+=f[m>>20&15]+f[m>>16&15],g+=f[m>>28&15]+f[m>>24&15],g+=f[n>>4&15]+f[n&15],g+=f[n>>12&15]+f[n>>8&15],g+=f[n>>20&15]+f[n>>16&15],g+=f[n>>28&15]+f[n>>24&15]):f[k>>4&15]+f[k&15]+f[k>>12&15]+f[k>>8&15]+f[k>>20&15]+f[k>>16&15]+f[k>>28&15]+f[k>> | ||
| 24&15]+f[l>>4&15]+f[l&15]+f[l>>12&15]+f[l>>8&15]+f[l>>20&15]+f[l>>16&15]+f[l>>28&15]+f[l>>24&15]+f[m>>4&15]+f[m&15]+f[m>>12&15]+f[m>>8&15]+f[m>>20&15]+f[m>>16&15]+f[m>>28&15]+f[m>>24&15]+f[n>>4&15]+f[n&15]+f[n>>12&15]+f[n>>8&15]+f[n>>20&15]+f[n>>16&15]+f[n>>28&15]+f[n>>24&15]};if(!q.JS_MD5_TEST&&u){var B=require("crypto"),E=require("buffer").Buffer;module.exports=function(e){if("string"==typeof e)return 80>=e.length||183>=e.length&&!/[^\x00-\x7F]/.test(e)?x(e):B.createHash("md5").update(e,"utf8").digest("hex"); | ||
| e.constructor==ArrayBuffer&&(e=new Uint8Array(e));return 370>=e.length?x(e):B.createHash("md5").update(new E(e)).digest("hex")}}else q&&(q.md5=x)})(this); |
@@ -0,1 +1,5 @@ | ||
| # v0.3.0 / 2015-03-07 | ||
| * Support byte Array, Uint8Array and ArrayBuffer input. | ||
| # v0.2.2 / 2015-02-01 | ||
@@ -2,0 +6,0 @@ |
| { | ||
| "name": "js-md5", | ||
| "version": "0.2.2", | ||
| "version": "0.3.0", | ||
| "description": "A simple MD5 hash function for JavaScript supports UTF-8 encoding.", | ||
@@ -5,0 +5,0 @@ "main": "src/md5.js", |
@@ -37,4 +37,4 @@ # js-md5 | ||
| md5(''); | ||
| md5('The quick brown fox jumps over the lazy dog', true); | ||
| md5('The quick brown fox jumps over the lazy dog.', true); | ||
| md5('The quick brown fox jumps over the lazy dog'); | ||
| md5('The quick brown fox jumps over the lazy dog.'); | ||
| ``` | ||
@@ -57,2 +57,14 @@ Output | ||
| It also supports byte `Array`, `Uint8Array`, `ArrayBuffer` input: | ||
| Code | ||
| ```JavaScript | ||
| md5([]); | ||
| md5(new Uint8Array([])); | ||
| ``` | ||
| Output | ||
| d41d8cd98f00b204e9800998ecf8427e | ||
| d41d8cd98f00b204e9800998ecf8427e | ||
| ## Benchmark | ||
@@ -59,0 +71,0 @@ [UTF8](http://jsperf.com/md5-shootout/81) |
107
src/md5.js
| /* | ||
| * js-md5 v0.2.2 | ||
| * js-md5 v0.3.0 | ||
| * https://github.com/emn178/js-md5 | ||
@@ -34,2 +34,7 @@ * | ||
| var md5 = function(message) { | ||
| var notString = typeof(message) != 'string'; | ||
| if(notString && message.constructor == ArrayBuffer) { | ||
| message = new Uint8Array(message); | ||
| } | ||
| var h0, h1, h2, h3, a, b, c, d, bc, da, code, first = true, end = false, | ||
@@ -44,41 +49,53 @@ index = 0, i, start = 0, bytes = 0, length = message.length; | ||
| blocks[12] = blocks[13] = blocks[14] = blocks[15] = 0; | ||
| if(ARRAY_BUFFER) { | ||
| for (i = start;index < length && i < 64; ++index) { | ||
| code = message.charCodeAt(index); | ||
| if (code < 0x80) { | ||
| buffer8[i++] = code; | ||
| } else if (code < 0x800) { | ||
| buffer8[i++] = 0xc0 | (code >> 6); | ||
| buffer8[i++] = 0x80 | (code & 0x3f); | ||
| } else if (code < 0xd800 || code >= 0xe000) { | ||
| 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)); | ||
| buffer8[i++] = 0xf0 | (code >> 18); | ||
| buffer8[i++] = 0x80 | ((code >> 12) & 0x3f); | ||
| buffer8[i++] = 0x80 | ((code >> 6) & 0x3f); | ||
| buffer8[i++] = 0x80 | (code & 0x3f); | ||
| if(notString) { | ||
| if(ARRAY_BUFFER) { | ||
| for (i = start;index < length && i < 64; ++index) { | ||
| buffer8[i++] = message[index]; | ||
| } | ||
| } else { | ||
| for (i = start;index < length && i < 64; ++index) { | ||
| blocks[i >> 2] |= message[index] << SHIFT[i++ & 3]; | ||
| } | ||
| } | ||
| } else { | ||
| for (i = start;index < length && i < 64; ++index) { | ||
| code = message.charCodeAt(index); | ||
| if (code < 0x80) { | ||
| blocks[i >> 2] |= code << SHIFT[i++ & 3]; | ||
| } else if (code < 0x800) { | ||
| blocks[i >> 2] |= (0xc0 | (code >> 6)) << SHIFT[i++ & 3]; | ||
| blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3]; | ||
| } else if (code < 0xd800 || code >= 0xe000) { | ||
| 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)); | ||
| 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]; | ||
| if(ARRAY_BUFFER) { | ||
| for (i = start;index < length && i < 64; ++index) { | ||
| code = message.charCodeAt(index); | ||
| if (code < 0x80) { | ||
| buffer8[i++] = code; | ||
| } else if (code < 0x800) { | ||
| buffer8[i++] = 0xc0 | (code >> 6); | ||
| buffer8[i++] = 0x80 | (code & 0x3f); | ||
| } else if (code < 0xd800 || code >= 0xe000) { | ||
| 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)); | ||
| buffer8[i++] = 0xf0 | (code >> 18); | ||
| buffer8[i++] = 0x80 | ((code >> 12) & 0x3f); | ||
| buffer8[i++] = 0x80 | ((code >> 6) & 0x3f); | ||
| buffer8[i++] = 0x80 | (code & 0x3f); | ||
| } | ||
| } | ||
| } else { | ||
| for (i = start;index < length && i < 64; ++index) { | ||
| code = message.charCodeAt(index); | ||
| if (code < 0x80) { | ||
| blocks[i >> 2] |= code << SHIFT[i++ & 3]; | ||
| } else if (code < 0x800) { | ||
| blocks[i >> 2] |= (0xc0 | (code >> 6)) << SHIFT[i++ & 3]; | ||
| blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3]; | ||
| } else if (code < 0xd800 || code >= 0xe000) { | ||
| 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)); | ||
| 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]; | ||
| } | ||
| } | ||
| } | ||
@@ -304,10 +321,20 @@ } | ||
| var crypto = require('crypto'); | ||
| var Buffer = require('buffer').Buffer; | ||
| module.exports = function(message) { | ||
| if(message.length <= 80) { | ||
| if(typeof(message) == 'string') { | ||
| if(message.length <= 80) { | ||
| return md5(message); | ||
| } else if(message.length <= 183 && !/[^\x00-\x7F]/.test(message)) { | ||
| return md5(message); | ||
| } | ||
| return crypto.createHash('md5').update(message, 'utf8').digest('hex'); | ||
| } | ||
| if(message.constructor == ArrayBuffer) { | ||
| message = new Uint8Array(message); | ||
| } | ||
| if(message.length <= 370) { | ||
| return md5(message); | ||
| } else if(message.length <= 183 && !/[^\x00-\x7F]/.test(message)) { | ||
| return md5(message); | ||
| } | ||
| return crypto.createHash('md5').update(message, 'utf8').digest('hex'); | ||
| return crypto.createHash('md5').update(new Buffer(message)).digest('hex'); | ||
| }; | ||
@@ -314,0 +341,0 @@ } else if(root) { |
| var crypto = require('crypto'); | ||
| var md5 = require('../src/md5.js'); | ||
| // var str = '0123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789'; | ||
| // var str = '01234567890123456789012345678901234567890123456789012345678901234567890123456789'; | ||
| var str = '01234567890123456789012345678901234567890123456789012345678901234567890123456789'; | ||
| // var str = '789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789'; | ||
| var str = '789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789'; | ||
| // var str = '789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789'; | ||
| // var str = '7890123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789'; | ||
@@ -11,5 +11,20 @@ // var str = '摘要摘要演算法第五版摘要摘要演算法第五版摘要摘要演算法第五版摘要摘要演算法第五版摘要摘要演算法第五版摘要摘要演算法第五版摘要摘要演算法第五版摘要摘要演算法第五版摘要摘要演算法第五版摘要摘要演算法第五版摘要摘要演算法第五版摘要摘要演算法第五版摘要摘要演算法第五版摘要摘要演算法第五版摘要摘要演算法第五版摘要摘要演算法第五版摘要摘要演算法第五版摘要摘要演算法第五版摘要摘要演算法第五版摘要摘要演算法第五版摘要摘要演算法第五版摘要摘要演算法第五版摘要摘要演算法第五版摘要摘要演算法第五版摘要摘要演算法第五版摘要摘要演算法第五版摘要摘要演算法第五版摘要摘要演算法第五版摘要摘要演算法第五版摘要摘要演算法第五版摘要摘要演算法第五版摘要摘要演算法第五版'; | ||
| var b = []; | ||
| for(var i = 0;i < str.length;++i) { | ||
| b[i] = str.charCodeAt(i); | ||
| } | ||
| console.time('s'); | ||
| for(var i = 0;i < 100000;++i) { | ||
| crypto.createHash('md5').update(str, 'utf8').digest('hex'); | ||
| for(var i = 0;i < 1;++i) { | ||
| // if(typeof(str) == 'string') { | ||
| // crypto.createHash('md5').update(str, 'utf8').digest('hex'); | ||
| // } | ||
| // if(str.constructor == ArrayBuffer) { | ||
| // str = new Uint8Array(str); | ||
| // } | ||
| // crypto.createHash('md5').update(new Buffer(new Uint8Array(str))).digest('hex'); | ||
| // crypto.createHash('md5').update(str, 'utf8').digest('hex'); | ||
| md5(b); | ||
| } | ||
@@ -19,3 +34,3 @@ console.timeEnd('s'); | ||
| console.time('s'); | ||
| for(var i = 0;i < 100000;++i) { | ||
| for(var i = 0;i < 1;++i) { | ||
| md5(str); | ||
@@ -22,0 +37,0 @@ } |
| md5 = require('../src/md5.js'); | ||
| expect = require('expect.js'); | ||
| testName = 'default'; | ||
| require('./test.js'); | ||
@@ -11,4 +10,3 @@ | ||
| JS_MD5_TEST = true; | ||
| testName = 'without ArrayBuffer'; | ||
| base64 = require('../src/md5.js'); | ||
| require('../src/md5.js'); | ||
| require('./test.js'); |
@@ -1,21 +0,44 @@ | ||
| var module = md5; | ||
| (function(md5) { | ||
| describe('md5', function() { | ||
| describe('ascii', function() { | ||
| describe('less than 64 bytes', function() { | ||
| it('should be successful', function() { | ||
| expect(md5('')).to.be('d41d8cd98f00b204e9800998ecf8427e'); | ||
| expect(md5('The quick brown fox jumps over the lazy dog')).to.be('9e107d9d372bb6826bd81d3542a419d6'); | ||
| expect(md5('The quick brown fox jumps over the lazy dog.')).to.be('e4d909c290d0fb1ca068ffaddf22cbd0'); | ||
| }); | ||
| }); | ||
| describe(testName, function() { | ||
| describe('ascii', function() { | ||
| describe('less than 64 bytes', function() { | ||
| it('should be successful', function() { | ||
| expect(module('')).to.be('d41d8cd98f00b204e9800998ecf8427e'); | ||
| expect(module('The quick brown fox jumps over the lazy dog')).to.be('9e107d9d372bb6826bd81d3542a419d6'); | ||
| expect(module('The quick brown fox jumps over the lazy dog.')).to.be('e4d909c290d0fb1ca068ffaddf22cbd0'); | ||
| expect(module('0123456780123456780123456780123456780123456780123456780')).to.be('a119de63e4b2398427da06dd780263b3'); | ||
| expect(module('01234567801234567801234567801234567801234567801234567801')).to.be('ddafd84ebe63aebc4626b037a569d78b'); | ||
| describe('more than 64 bytes', function() { | ||
| it('should be successful', function() { | ||
| expect(md5('The MD5 message-digest algorithm is a widely used cryptographic hash function producing a 128-bit (16-byte) hash value, typically expressed in text format as a 32 digit hexadecimal number. MD5 has been utilized in a wide variety of cryptographic applications, and is also commonly used to verify data integrity.')).to.be('f63872ef7bc97a8a8eadba6f0881de53'); | ||
| }); | ||
| }); | ||
| }); | ||
| describe('more than 64 bytes', function() { | ||
| describe('UTF8', function() { | ||
| describe('less than 64 bytes', function() { | ||
| it('should be successful', function() { | ||
| expect(md5('中文')).to.be('a7bac2239fcdcb3a067903d8077c4a07'); | ||
| expect(md5('aécio')).to.be('ec3edbf3b05a449fc206a0138c739c3b'); | ||
| expect(md5('𠜎')).to.be('b90869aaf121210f6c563973fa855650'); | ||
| }); | ||
| }); | ||
| describe('more than 64 bytes', function() { | ||
| it('should be successful', function() { | ||
| expect(md5('訊息摘要演算法第五版（英語：Message-Digest Algorithm 5，縮寫為MD5），是當前電腦領域用於確保資訊傳輸完整一致而廣泛使用的雜湊演算法之一')).to.be('edce615b179e6e29be23145b77ebbd61'); | ||
| expect(md5('訊息摘要演算法第五版（英語：Message-Digest Algorithm 5，縮寫為MD5），是當前電腦領域用於確保資訊傳輸完整一致而廣泛使用的雜湊演算法之一（又譯雜湊演算法、摘要演算法等），主流程式語言普遍已有MD5的實作。')).to.be('ad36c9ab669a0ba9ce46d3ce9134de34'); | ||
| }); | ||
| }); | ||
| }); | ||
| describe('special length', function() { | ||
| it('should be successful', function() { | ||
| expect(module('The MD5 message-digest algorithm is a widely used cryptographic hash function producing a 128-bit (16-byte) hash value, typically expressed in text format as a 32 digit hexadecimal number. MD5 has been utilized in a wide variety of cryptographic applications, and is also commonly used to verify data integrity.')).to.be('f63872ef7bc97a8a8eadba6f0881de53'); | ||
| expect(module('01234567801234567801234567801234567801234567801234567801234567801234567')).to.be('658d914ae42c4938874b2e786ccda479'); | ||
| expect(module('012345678012345678012345678012345678012345678012345678012345678012345678')).to.be('a083a3710d685793f1f17988bfe3c175'); | ||
| expect(module('012345678012345678012345678012345678012345678012345678012345678012345678012345678012345678012345678012345678012345678012345678012345678012345678')).to.be('2b21a843cfc31c8026a0d835bc91bc98'); | ||
| expect(md5('0123456780123456780123456780123456780123456780123456780')).to.be('a119de63e4b2398427da06dd780263b3'); | ||
| expect(md5('01234567801234567801234567801234567801234567801234567801')).to.be('ddafd84ebe63aebc4626b037a569d78b'); | ||
| expect(md5('0123456780123456780123456780123456780123456780123456780123456780')).to.be('9ea04d743618797ce464445b5785a630'); | ||
| expect(md5('01234567801234567801234567801234567801234567801234567801234567801234567')).to.be('658d914ae42c4938874b2e786ccda479'); | ||
| expect(md5('012345678012345678012345678012345678012345678012345678012345678012345678')).to.be('a083a3710d685793f1f17988bfe3c175'); | ||
| expect(md5('012345678012345678012345678012345678012345678012345678012345678012345678012345678012345678012345678012345678012345678012345678012345678012345678')).to.be('2b21a843cfc31c8026a0d835bc91bc98'); | ||
| }); | ||
@@ -25,18 +48,25 @@ }); | ||
| describe('UTF8', function() { | ||
| describe('less than 64 bytes', function() { | ||
| describe('Array', function() { | ||
| describe('Array', function() { | ||
| it('should be successful', function() { | ||
| expect(module('中文')).to.be('a7bac2239fcdcb3a067903d8077c4a07'); | ||
| expect(module('aécio')).to.be('ec3edbf3b05a449fc206a0138c739c3b'); | ||
| expect(module('𠜎')).to.be('b90869aaf121210f6c563973fa855650'); | ||
| expect(md5([])).to.be('d41d8cd98f00b204e9800998ecf8427e'); | ||
| expect(md5([0])).to.be('93b885adfe0da089cdf634904fd59f71'); | ||
| expect(md5([84, 104, 101, 32, 113, 117, 105, 99, 107, 32, 98, 114, 111, 119, 110, 32, 102, 111, 120, 32, 106, 117, 109, 112, 115, 32, 111, 118, 101, 114, 32, 116, 104, 101, 32, 108, 97, 122, 121, 32, 100, 111, 103])).to.be('9e107d9d372bb6826bd81d3542a419d6'); | ||
| }); | ||
| }); | ||
| describe('more than 64 bytes', function() { | ||
| describe('Uint8Array', function() { | ||
| it('should be successful', function() { | ||
| expect(module('訊息摘要演算法第五版（英語：Message-Digest Algorithm 5，縮寫為MD5），是當前電腦領域用於確保資訊傳輸完整一致而廣泛使用的雜湊演算法之一')).to.be('edce615b179e6e29be23145b77ebbd61'); | ||
| expect(module('訊息摘要演算法第五版（英語：Message-Digest Algorithm 5，縮寫為MD5），是當前電腦領域用於確保資訊傳輸完整一致而廣泛使用的雜湊演算法之一（又譯雜湊演算法、摘要演算法等），主流程式語言普遍已有MD5的實作。')).to.be('ad36c9ab669a0ba9ce46d3ce9134de34'); | ||
| expect(md5(new Uint8Array([]))).to.be('d41d8cd98f00b204e9800998ecf8427e'); | ||
| expect(md5(new Uint8Array(371))).to.be('58f494c2a0fb65332110fb62ae5c4a74'); | ||
| }); | ||
| }); | ||
| describe('ArrayBuffer', function() { | ||
| it('should be successful', function() { | ||
| expect(md5(new ArrayBuffer(0))).to.be('d41d8cd98f00b204e9800998ecf8427e'); | ||
| expect(md5(new ArrayBuffer(1))).to.be('93b885adfe0da089cdf634904fd59f71'); | ||
| }); | ||
| }); | ||
| }); | ||
| }); | ||
| })(md5); |
Sorry, the diff of this file is not supported yet
Sorry, the diff of this file is not supported yet
New alerts
License Policy Violation
LicenseThis package is not allowed per your license policy. Review the package's license to ensure compliance.
Found 1 instance in 1 package
Fixed alerts
License Policy Violation
LicenseThis package is not allowed per your license policy. Review the package's license to ensure compliance.
Found 1 instance in 1 package
Improved metrics
- Total package byte prevSize
- increased by9.41%
39978
- Lines of code
- increased by12.48%
658
- Number of lines in readme file
- increased by13.19%
103
No dependency changes