1. Added AMD support.

2. Fixed ArrayBuffer dosen't work in Webpack.

.covignore

@@ -1,2 +1,2 @@
+/node_modules/
 /tests/
-node_modules/

.gitignore

@@ -1,2 +1,2 @@
-node_modules/
+/node_modules/
-covreporter
+/covreporter/

.npmignore

@@ -1,3 +1 @@
 covreporter
-build
-tests

.travis.yml

@@ -1,12 +1,11 @@
 language: node_js
 node_js:
-  - "0.11"
+  - "0.12.15"
-  - "0.10"
+  - "4.5"
-  - "0.8"
+  - "6.5.0"
 before_install:
-  - npm install mocha -g
+  - npm install coveralls
-  - npm install coveralls -g
+  - npm install mocha-lcov-reporter
-  - npm install mocha-lcov-reporter -g
 script: npm run-script coveralls
 branches:
   only:

CHANGELOG.md

@@ -1,45 +1,67 @@
-# v0.3.0 / 2015-05-23
+# Change Log
 
-* Support ArrayBuffer input.
+## v0.4.0 / 2017-01-23
+### Added
+- AMD support.
+### Fixed
+- ArrayBuffer dosen't work in Webpack.
 
-# v0.2.3 / 2015-02-11
+## v0.3.2 / 2016-09-12
+### Added
+- CommonJS detection.
 
-* Support byte array input.
+## v0.3.1 / 2016-09-08
+### Added
+- some files to npm package.
+### Fixed
+- coding style.
 
-# v0.2.2 / 2015-02-10
+## v0.3.0 / 2015-05-23
+### Added
+- support for ArrayBuffer input.
 
-* Improve performance.
+## v0.2.3 / 2015-02-11
+### Added
+- support for byte array input.
 
-# v0.2.1 / 2015-02-05
+## v0.2.2 / 2015-02-10
+### Improved
+- performance.
 
-* Fixed special length bug.
+## v0.2.1 / 2015-02-05
-* Add test cases.
+### Fixed
+- special length bug.
+### Added
+- test cases.
 
-# v0.2.0 / 2015-02-03
+## v0.2.0 / 2015-02-03
+### Removed
+- ascii parameter.
+### Improved
+- performance.
+### Added
+- test cases.
 
-* Remove ascii parameter.
+## v0.1.4 / 2015-01-24
-* Improve performance.
+### Improved
-* Add test cases.
+- performance.
 
-# v0.1.4 / 2015-01-24
+## v0.1.3 / 2015-01-09
+### Improved
+- performance.
 
-* Improve performance.
+## v0.1.2 / 2015-01-06
+### Added
+- bower package.
+- travis.
+- coveralls.
+### Fixed
+- JSHint warnings.
 
-# v0.1.3 / 2015-01-09
+## v0.1.1 / 2014-07-27
+### Fixed
+- accents bug.
 
-* Improve performance.
+## v0.1.0 / 2014-01-05
-
+### Added
-# v0.1.2 / 2015-01-06
+- initial release.
-
-* Add bower package.
-* Fixed JSHint warnings.
-* Add travis.
-* Add coveralls.
-
-# v0.1.1 / 2014-07-27
-
-* Fixed accents bug
-
-# v0.1.0 / 2014-01-05
-
-* Initial release

LICENSE.txt

@@ -1,4 +1,4 @@
-Copyright (c) 2015 Chen Yi-Cyuan
+Copyright (c) 2014-2017 Chen, Yi-Cyuan
 
 MIT License
 

README.md

@@ -1,6 +1,7 @@
 # js-sha256
 [![Build Status](https://travis-ci.org/emn178/js-sha256.svg?branch=master)](https://travis-ci.org/emn178/js-sha256)
 [![Coverage Status](https://coveralls.io/repos/emn178/js-sha256/badge.svg?branch=master)](https://coveralls.io/r/emn178/js-sha256?branch=master)
+[![CDNJS](https://img.shields.io/cdnjs/v/js-sha256.svg)](https://cdnjs.com/libraries/js-sha256/)  
 [![NPM](https://nodei.co/npm/js-sha256.png?stars&downloads)](https://nodei.co/npm/js-sha256/)  
 A simple SHA-256 / SHA-224 hash function for JavaScript supports UTF-8 encoding.
 
@@ -80,44 +81,9 @@ Output
     e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855
     182889f925ae4e5cc37118ded6ed87f7bdc7cab5ec5e78faef2e50048999473f
 
-## Benchmark
-[UTF8](http://jsperf.com/sha256/66)  
-[ASCII](http://jsperf.com/sha256/65)
-
-## Extensions
-### jQuery
-If you prefer jQuery style, you can add following code to add a jQuery extension.
-
-Code
-```JavaScript
-jQuery.sha256 = sha256
-jQuery.sha224 = sha224
-```
-And then you could use like this:
-```JavaScript
-$.sha256('message');
-$.sha224('message');
-```
-### Prototype
-If you prefer prototype style, you can add following code to add a prototype extension.
-
-Code
-```JavaScript
-String.prototype.sha256 = function() {
-  return sha256(this);
-};
-String.prototype.sha224 = function() {
-  return sha224(this);
-};
-```
-And then you could use like this:
-```JavaScript
-'message'.sha256();
-'message'.sha224();
-```
 ## License
 The project is released under the [MIT license](http://www.opensource.org/licenses/MIT).
 
 ## Contact
 The project's website is located at https://github.com/emn178/js-sha256  
-Author: emn178@gmail.com
+Author: Chen, Yi-Cyuan (emn178@gmail.com)

bower.json

@@ -1,6 +1,6 @@
 {
   "name": "js-sha256",
-  "version": "0.3.0",
+  "version": "0.4.0",
   "main": ["src/sha256.js"],
   "ignore": [
     "samples",

build/sha256.min.js

@@ -1,17 +1,9 @@
-/*
+/**
- * js-sha256 v0.3.0
+ * [js-sha256]{@link https://github.com/emn178/js-sha256}
- * https://github.com/emn178/js-sha256
  *
- * Copyright 2014-2015, emn178@gmail.com
+ * @version 0.4.0
- *
+ * @author Chen, Yi-Cyuan [emn178@gmail.com]
- * Licensed under the MIT license:
+ * @copyright Chen, Yi-Cyuan 2014-2017
- * http://www.opensource.org/licenses/MIT
+ * @license MIT
  */
-(function(I,R){var K="undefined"!=typeof module;K&&(I=global);var a="0123456789abcdef".split(""),Q=[-2147483648,8388608,32768,128],C=[24,16,8,0],M=[1116352408,1899447441,3049323471,3921009573,961987163,1508970993,2453635748,2870763221,3624381080,310598401,607225278,1426881987,1925078388,2162078206,2614888103,3248222580,3835390401,4022224774,264347078,604807628,770255983,1249150122,1555081692,1996064986,2554220882,2821834349,2952996808,3210313671,3336571891,3584528711,113926993,338241895,666307205,
+!function(){"use strict";var e="object"==typeof window?window:{},o=!e.JS_SHA256_NO_NODE_JS&&"object"==typeof process&&process.versions&&process.versions.node;o&&(e=global);var r=!e.JS_SHA256_NO_COMMON_JS&&"object"==typeof module&&module.exports,t="function"==typeof define&&define.amd,n="0123456789abcdef".split(""),s=[-2147483648,8388608,32768,128],f=[24,16,8,0],i=[1116352408,1899447441,3049323471,3921009573,961987163,1508970993,2453635748,2870763221,3624381080,310598401,607225278,1426881987,1925078388,2162078206,2614888103,3248222580,3835390401,4022224774,264347078,604807628,770255983,1249150122,1555081692,1996064986,2554220882,2821834349,2952996808,3210313671,3336571891,3584528711,113926993,338241895,666307205,773529912,1294757372,1396182291,1695183700,1986661051,2177026350,2456956037,2730485921,2820302411,3259730800,3345764771,3516065817,3600352804,4094571909,275423344,430227734,506948616,659060556,883997877,958139571,1322822218,1537002063,1747873779,1955562222,2024104815,2227730452,2361852424,2428436474,2756734187,3204031479,3329325298],a=[],c=function(e){return d(e,!0)},d=function(o,r){var t="string"!=typeof o;t&&o.constructor==e.ArrayBuffer&&(o=new Uint8Array(o));var c,d,u,p,l,h,v,_,y,w,A,S,b,O,m,J,N,g,j,C,x,H,M=!0,B=!1,D=0,E=0,U=0,k=o.length;r?(c=3238371032,d=914150663,u=812702999,p=4144912697,l=4290775857,h=1750603025,v=1694076839,_=3204075428):(c=1779033703,d=3144134277,u=1013904242,p=2773480762,l=1359893119,h=2600822924,v=528734635,_=1541459225),y=0;do{if(a[0]=y,a[16]=a[1]=a[2]=a[3]=a[4]=a[5]=a[6]=a[7]=a[8]=a[9]=a[10]=a[11]=a[12]=a[13]=a[14]=a[15]=0,t)for(A=E;k>D&&64>A;++D)a[A>>2]|=o[D]<<f[3&A++];else for(A=E;k>D&&64>A;++D)w=o.charCodeAt(D),128>w?a[A>>2]|=w<<f[3&A++]:2048>w?(a[A>>2]|=(192|w>>6)<<f[3&A++],a[A>>2]|=(128|63&w)<<f[3&A++]):55296>w||w>=57344?(a[A>>2]|=(224|w>>12)<<f[3&A++],a[A>>2]|=(128|w>>6&63)<<f[3&A++],a[A>>2]|=(128|63&w)<<f[3&A++]):(w=65536+((1023&w)<<10|1023&o.charCodeAt(++D)),a[A>>2]|=(240|w>>18)<<f[3&A++],a[A>>2]|=(128|w>>12&63)<<f[3&A++],a[A>>2]|=(128|w>>6&63)<<f[3&A++],a[A>>2]|=(128|63&w)<<f[3&A++]);U+=A-E,E=A-64,D==k&&(a[A>>2]|=s[3&A],++D),y=a[16],D>k&&56>A&&(a[15]=U<<3,B=!0);var q=c,z=d,F=u,G=p,I=l,K=h,L=v,P=_;for(S=16;64>S;++S)J=a[S-15],b=(J>>>7|J<<25)^(J>>>18|J<<14)^J>>>3,J=a[S-2],O=(J>>>17|J<<15)^(J>>>19|J<<13)^J>>>10,a[S]=a[S-16]+b+a[S-7]+O<<0;for(H=z&F,S=0;64>S;S+=4)M?(r?(j=300032,J=a[0]-1413257819,P=J-150054599<<0,G=J+24177077<<0):(j=704751109,J=a[0]-210244248,P=J-1521486534<<0,G=J+143694565<<0),M=!1):(b=(q>>>2|q<<30)^(q>>>13|q<<19)^(q>>>22|q<<10),O=(I>>>6|I<<26)^(I>>>11|I<<21)^(I>>>25|I<<7),j=q&z,m=j^q&F^H,g=I&K^~I&L,J=P+O+g+i[S]+a[S],N=b+m,P=G+J<<0,G=J+N<<0),b=(G>>>2|G<<30)^(G>>>13|G<<19)^(G>>>22|G<<10),O=(P>>>6|P<<26)^(P>>>11|P<<21)^(P>>>25|P<<7),C=G&q,m=C^G&z^j,g=P&I^~P&K,J=L+O+g+i[S+1]+a[S+1],N=b+m,L=F+J<<0,F=J+N<<0,b=(F>>>2|F<<30)^(F>>>13|F<<19)^(F>>>22|F<<10),O=(L>>>6|L<<26)^(L>>>11|L<<21)^(L>>>25|L<<7),x=F&G,m=x^F&q^C,g=L&P^~L&I,J=K+O+g+i[S+2]+a[S+2],N=b+m,K=z+J<<0,z=J+N<<0,b=(z>>>2|z<<30)^(z>>>13|z<<19)^(z>>>22|z<<10),O=(K>>>6|K<<26)^(K>>>11|K<<21)^(K>>>25|K<<7),H=z&F,m=H^z&G^x,g=K&L^~K&P,J=I+O+g+i[S+3]+a[S+3],N=b+m,I=q+J<<0,q=J+N<<0;c=c+q<<0,d=d+z<<0,u=u+F<<0,p=p+G<<0,l=l+I<<0,h=h+K<<0,v=v+L<<0,_=_+P<<0}while(!B);var Q=n[c>>28&15]+n[c>>24&15]+n[c>>20&15]+n[c>>16&15]+n[c>>12&15]+n[c>>8&15]+n[c>>4&15]+n[15&c]+n[d>>28&15]+n[d>>24&15]+n[d>>20&15]+n[d>>16&15]+n[d>>12&15]+n[d>>8&15]+n[d>>4&15]+n[15&d]+n[u>>28&15]+n[u>>24&15]+n[u>>20&15]+n[u>>16&15]+n[u>>12&15]+n[u>>8&15]+n[u>>4&15]+n[15&u]+n[p>>28&15]+n[p>>24&15]+n[p>>20&15]+n[p>>16&15]+n[p>>12&15]+n[p>>8&15]+n[p>>4&15]+n[15&p]+n[l>>28&15]+n[l>>24&15]+n[l>>20&15]+n[l>>16&15]+n[l>>12&15]+n[l>>8&15]+n[l>>4&15]+n[15&l]+n[h>>28&15]+n[h>>24&15]+n[h>>20&15]+n[h>>16&15]+n[h>>12&15]+n[h>>8&15]+n[h>>4&15]+n[15&h]+n[v>>28&15]+n[v>>24&15]+n[v>>20&15]+n[v>>16&15]+n[v>>12&15]+n[v>>8&15]+n[v>>4&15]+n[15&v];return r||(Q+=n[_>>28&15]+n[_>>24&15]+n[_>>20&15]+n[_>>16&15]+n[_>>12&15]+n[_>>8&15]+n[_>>4&15]+n[15&_]),Q},u=d;u.sha256=d,u.sha224=c,r?module.exports=u:(e.sha256=d,e.sha224=c,t&&define(function(){return u}))}();
-773529912,1294757372,1396182291,1695183700,1986661051,2177026350,2456956037,2730485921,2820302411,3259730800,3345764771,3516065817,3600352804,4094571909,275423344,430227734,506948616,659060556,883997877,958139571,1322822218,1537002063,1747873779,1955562222,2024104815,2227730452,2361852424,2428436474,2756734187,3204031479,3329325298],c=[],L=function(a){return A(a,!0)},A=function(D,A){var J="string"!=typeof D;J&&D.constructor==I.ArrayBuffer&&(D=new Uint8Array(D));var m,n,p,q,r,t,u,v,f,K=!0,L=!1,b,B=
-0,N=0,P=0,O=D.length,e,d,E,F,G,H;A?(m=3238371032,n=914150663,p=812702999,q=4144912697,r=4290775857,t=1750603025,u=1694076839,v=3204075428):(m=1779033703,n=3144134277,p=1013904242,q=2773480762,r=1359893119,t=2600822924,u=528734635,v=1541459225);f=0;do{c[0]=f;c[16]=c[1]=c[2]=c[3]=c[4]=c[5]=c[6]=c[7]=c[8]=c[9]=c[10]=c[11]=c[12]=c[13]=c[14]=c[15]=0;if(J)for(b=N;B<O&&64>b;++B)c[b>>2]|=D[B]<<C[b++&3];else for(b=N;B<O&&64>b;++B)f=D.charCodeAt(B),128>f?c[b>>2]|=f<<C[b++&3]:(2048>f?c[b>>2]|=(192|f>>6)<<C[b++&
-3]:(55296>f||57344<=f?c[b>>2]|=(224|f>>12)<<C[b++&3]:(f=65536+((f&1023)<<10|D.charCodeAt(++B)&1023),c[b>>2]|=(240|f>>18)<<C[b++&3],c[b>>2]|=(128|f>>12&63)<<C[b++&3]),c[b>>2]|=(128|f>>6&63)<<C[b++&3]),c[b>>2]|=(128|f&63)<<C[b++&3]);P+=b-N;N=b-64;B==O&&(c[b>>2]|=Q[b&3],++B);f=c[16];B>O&&56>b&&(c[15]=P<<3,L=!0);var w=m,k=n,l=p,g=q,x=r,y=t,z=u,h=v;for(b=16;64>b;++b)d=c[b-15],e=(d>>>7|d<<25)^(d>>>18|d<<14)^d>>>3,d=c[b-2],d=(d>>>17|d<<15)^(d>>>19|d<<13)^d>>>10,c[b]=c[b-16]+e+c[b-7]+d<<0;H=k&l;for(b=0;64>
-b;b+=4)K?(A?(G=300032,d=c[0]-1413257819,h=d-150054599<<0,g=d+24177077<<0):(G=704751109,d=c[0]-210244248,h=d-1521486534<<0,g=d+143694565<<0),K=!1):(e=(w>>>2|w<<30)^(w>>>13|w<<19)^(w>>>22|w<<10),d=(x>>>6|x<<26)^(x>>>11|x<<21)^(x>>>25|x<<7),G=w&k,E=G^w&l^H,F=x&y^~x&z,d=h+d+F+M[b]+c[b],e+=E,h=g+d<<0,g=d+e<<0),e=(g>>>2|g<<30)^(g>>>13|g<<19)^(g>>>22|g<<10),d=(h>>>6|h<<26)^(h>>>11|h<<21)^(h>>>25|h<<7),H=g&w,E=H^g&k^G,F=h&x^~h&y,d=z+d+F+M[b+1]+c[b+1],e+=E,z=l+d<<0,l=d+e<<0,e=(l>>>2|l<<30)^(l>>>13|l<<19)^
-(l>>>22|l<<10),d=(z>>>6|z<<26)^(z>>>11|z<<21)^(z>>>25|z<<7),G=l&g,E=G^l&w^H,F=z&h^~z&x,d=y+d+F+M[b+2]+c[b+2],e+=E,y=k+d<<0,k=d+e<<0,e=(k>>>2|k<<30)^(k>>>13|k<<19)^(k>>>22|k<<10),d=(y>>>6|y<<26)^(y>>>11|y<<21)^(y>>>25|y<<7),H=k&l,E=H^k&g^G,F=y&z^~y&h,d=x+d+F+M[b+3]+c[b+3],e+=E,x=w+d<<0,w=d+e<<0;m=m+w<<0;n=n+k<<0;p=p+l<<0;q=q+g<<0;r=r+x<<0;t=t+y<<0;u=u+z<<0;v=v+h<<0}while(!L);J=a[m>>28&15]+a[m>>24&15]+a[m>>20&15]+a[m>>16&15]+a[m>>12&15]+a[m>>8&15]+a[m>>4&15]+a[m&15]+a[n>>28&15]+a[n>>24&15]+a[n>>20&
-15]+a[n>>16&15]+a[n>>12&15]+a[n>>8&15]+a[n>>4&15]+a[n&15]+a[p>>28&15]+a[p>>24&15]+a[p>>20&15]+a[p>>16&15]+a[p>>12&15]+a[p>>8&15]+a[p>>4&15]+a[p&15]+a[q>>28&15]+a[q>>24&15]+a[q>>20&15]+a[q>>16&15]+a[q>>12&15]+a[q>>8&15]+a[q>>4&15]+a[q&15]+a[r>>28&15]+a[r>>24&15]+a[r>>20&15]+a[r>>16&15]+a[r>>12&15]+a[r>>8&15]+a[r>>4&15]+a[r&15]+a[t>>28&15]+a[t>>24&15]+a[t>>20&15]+a[t>>16&15]+a[t>>12&15]+a[t>>8&15]+a[t>>4&15]+a[t&15]+a[u>>28&15]+a[u>>24&15]+a[u>>20&15]+a[u>>16&15]+a[u>>12&15]+a[u>>8&15]+a[u>>4&15]+a[u&
-15];A||(J+=a[v>>28&15]+a[v>>24&15]+a[v>>20&15]+a[v>>16&15]+a[v>>12&15]+a[v>>8&15]+a[v>>4&15]+a[v&15]);return J};!I.JS_SHA256_TEST&&K?(A.sha256=A,A.sha224=L,module.exports=A):I&&(I.sha256=A,I.sha224=L)})(this);

package.json

@@ -1,15 +1,19 @@
 {
   "name": "js-sha256",
-  "version": "0.3.0",
+  "version": "0.4.0",
   "description": "A simple SHA-256 / SHA-224 hash function for JavaScript supports UTF-8 encoding.",
   "main": "src/sha256.js",
   "devDependencies": {
     "expect.js": "~0.3.1",
-    "jscoverage": "~0.5.9"
+    "jscoverage": "~0.5.9",
+    "mocha": "~2.3.4",
+    "uglifyjs": "~2.4.10"
   },
   "scripts": {
     "test": "mocha tests/node-test.js -r jscoverage",
-    "coveralls": "mocha tests/node-test.js -R mocha-lcov-reporter -r jscoverage | coveralls"
+    "report": "mocha tests/node-test.js -r jscoverage --covout=html",
+    "coveralls": "mocha tests/node-test.js -R mocha-lcov-reporter -r jscoverage | coveralls",
+    "build": "uglifyjs src/sha256.js --compress --mangle --comments --output build/sha256.min.js"
   },
   "repository": {
     "type": "git",
@@ -26,7 +30,7 @@
     "HMAC"
   ],
   "license": "MIT",
-  "author": "emn178 <emn178@gmail.com>",
+  "author": "Chen, Yi-Cyuan <emn178@gmail.com>",
   "homepage": "https://github.com/emn178/js-sha256",
   "bugs": {
     "url": "https://github.com/emn178/js-sha256/issues"

src/sha256.js

@@ -1,20 +1,22 @@
-/*
+/**
- * js-sha256 v0.3.0
+ * [js-sha256]{@link https://github.com/emn178/js-sha256}
- * https://github.com/emn178/js-sha256
  *
- * Copyright 2014-2015, emn178@gmail.com
+ * @version 0.4.0
- *
+ * @author Chen, Yi-Cyuan [emn178@gmail.com]
- * Licensed under the MIT license:
+ * @copyright Chen, Yi-Cyuan 2014-2017
- * http://www.opensource.org/licenses/MIT
+ * @license MIT
  */
-;(function(root, undefined) {
+/*jslint bitwise: true */
+(function () {
   'use strict';
 
-  var NODE_JS = typeof(module) != 'undefined';
+  var root = typeof window === 'object' ? window : {};
-  if(NODE_JS) {
+  var NODE_JS = !root.JS_SHA256_NO_NODE_JS && typeof process == 'object' && process.versions && process.versions.node;
+  if (NODE_JS) {
     root = global;
   }
-  var TYPED_ARRAY = typeof(Uint8Array) != 'undefined';
+  var COMMON_JS = !root.JS_SHA256_NO_COMMON_JS && typeof module === 'object' && module.exports;
+  var AMD = typeof define === 'function' && define.amd;
   var HEX_CHARS = '0123456789abcdef'.split('');
   var EXTRA = [-2147483648, 8388608, 32768, 128];
   var SHIFT = [24, 16, 8, 0];
@@ -29,13 +31,13 @@
 
   var blocks = [];
 
-  var sha224 = function(message) {
+  var sha224 = function (message) {
     return sha256(message, true);
   };
 
-  var sha256 = function(message, is224) {
+  var sha256 = function (message, is224) {
-    var notString = typeof(message) != 'string';
+    var notString = typeof message != 'string';
-    if(notString && message.constructor == root.ArrayBuffer) {
+    if (notString && message.constructor == root.ArrayBuffer) {
       message = new Uint8Array(message);
     }
 
@@ -43,7 +45,7 @@
         i, j, index = 0, start = 0, bytes = 0, length = message.length,
         s0, s1, maj, t1, t2, ch, ab, da, cd, bc;
 
-    if(is224) {
+    if (is224) {
       h0 = 0xc1059ed8;
       h1 = 0x367cd507;
       h2 = 0x3070dd17;
@@ -69,12 +71,12 @@
       blocks[4] = blocks[5] = blocks[6] = blocks[7] =
       blocks[8] = blocks[9] = blocks[10] = blocks[11] =
       blocks[12] = blocks[13] = blocks[14] = blocks[15] = 0;
-      if(notString) {
+      if (notString) {
-        for (i = start;index < length && i < 64; ++index) {
+        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) {
+        for (i = start; index < length && i < 64; ++index) {
           code = message.charCodeAt(index);
           if (code < 0x80) {
             blocks[i >> 2] |= code << SHIFT[i++ & 3];
@@ -96,18 +98,18 @@
       }
       bytes += i - start;
       start = i - 64;
-      if(index == length) {
+      if (index == length) {
         blocks[i >> 2] |= EXTRA[i & 3];
         ++index;
       }
       block = blocks[16];
-      if(index > length && i < 56) {
+      if (index > length && i < 56) {
         blocks[15] = bytes << 3;
         end = true;
       }
 
       var a = h0, b = h1, c = h2, d = h3, e = h4, f = h5, g = h6, h = h7;
-      for(j = 16;j < 64;++j) {
+      for (j = 16; j < 64; ++j) {
         // rightrotate
         t1 = blocks[j - 15];
         s0 = ((t1 >>> 7) | (t1 << 25)) ^ ((t1 >>> 18) | (t1 << 14)) ^ (t1 >>> 3);
@@ -117,9 +119,9 @@
       }
 
       bc = b & c;
-      for(j = 0;j < 64;j += 4) {
+      for (j = 0; j < 64; j += 4) {
-        if(first) {
+        if (first) {
-          if(is224) {
+          if (is224) {
             ab = 300032;
             t1 = blocks[0] - 1413257819;
             h = t1 - 150054599 << 0;
@@ -179,7 +181,7 @@
       h5 = h5 + f << 0;
       h6 = h6 + g << 0;
       h7 = h7 + h << 0;
-    } while(!end);
+    } while (!end);
 
     var hex = HEX_CHARS[(h0 >> 28) & 0x0F] + HEX_CHARS[(h0 >> 24) & 0x0F] +
               HEX_CHARS[(h0 >> 20) & 0x0F] + HEX_CHARS[(h0 >> 16) & 0x0F] +
@@ -209,7 +211,7 @@
               HEX_CHARS[(h6 >> 20) & 0x0F] + HEX_CHARS[(h6 >> 16) & 0x0F] +
               HEX_CHARS[(h6 >> 12) & 0x0F] + HEX_CHARS[(h6 >> 8) & 0x0F] +
               HEX_CHARS[(h6 >> 4) & 0x0F] + HEX_CHARS[h6 & 0x0F];
-    if(!is224) {
+    if (!is224) {
       hex += HEX_CHARS[(h7 >> 28) & 0x0F] + HEX_CHARS[(h7 >> 24) & 0x0F] +
              HEX_CHARS[(h7 >> 20) & 0x0F] + HEX_CHARS[(h7 >> 16) & 0x0F] +
              HEX_CHARS[(h7 >> 12) & 0x0F] + HEX_CHARS[(h7 >> 8) & 0x0F] +
@@ -218,12 +220,19 @@
     return hex;
   };
 
-  if(!root.JS_SHA256_TEST && NODE_JS) {
+  var exports = sha256;
-    sha256.sha256 = sha256;
+  exports.sha256 = sha256;
-    sha256.sha224 = sha224;
+  exports.sha224 = sha224;
-    module.exports = sha256;
+
-  } else if(root) {
+  if (COMMON_JS) {
+    module.exports = exports;
+  } else {
     root.sha256 = sha256;
     root.sha224 = sha224;
+    if (AMD) {
+      define(function () {
+        return exports;
+      });
     }
-}(this));
+  }
+})();

tests/node-test.js

@@ -1,6 +1,7 @@
+// Node.js env
+expect = require('expect.js');
 sha256 = require('../src/sha256.js').sha256;
 sha224 = require('../src/sha256.js').sha224;
-expect = require('expect.js');
 require('./test.js');
 
 delete require.cache[require.resolve('../src/sha256.js')]
@@ -8,6 +9,39 @@ delete require.cache[require.resolve('./test.js')]
 sha256 = null;
 sha224 = null;
 
-JS_SHA256_TEST = true;
+// Webpack browser env
+JS_SHA256_NO_NODE_JS = true;
+window = global;
+sha256 = require('../src/sha256.js').sha256;
+sha224 = require('../src/sha256.js').sha224;
+require('./test.js');
+
+delete require.cache[require.resolve('../src/sha256.js')]
+delete require.cache[require.resolve('./test.js')]
+sha256 = null;
+sha224 = null;
+
+// browser env
+JS_SHA256_NO_NODE_JS = true;
+JS_SHA256_NO_COMMON_JS = true;
+window = global;
 require('../src/sha256.js');
 require('./test.js');
+
+delete require.cache[require.resolve('../src/sha256.js')]
+delete require.cache[require.resolve('./test.js')]
+sha256 = null;
+sha224 = null;
+
+// browser AMD
+JS_SHA256_NO_NODE_JS = true;
+JS_SHA256_NO_COMMON_JS = true;
+window = global;
+define = function (func) {
+  sha256 = func();
+  sha224 = sha256.sha224;
+  require('./test.js');
+};
+define.amd = true;
+
+require('../src/sha256.js');

tests/test.js

@@ -1,40 +1,40 @@
-(function(sha256, sha224) {
+(function (sha256, sha224) {
-  describe('sha256', function() {
+  describe('sha256', function () {
-    context('when ascii', function() {
+    context('when ascii', function () {
-      context('and less than 64 bytes', function() {
+      context('and less than 64 bytes', function () {
-        it('should be equal', function() {
+        it('should be equal', function () {
           expect(sha256('')).to.be('e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855');
           expect(sha256('The quick brown fox jumps over the lazy dog')).to.be('d7a8fbb307d7809469ca9abcb0082e4f8d5651e46d3cdb762d02d0bf37c9e592');
           expect(sha256('The quick brown fox jumps over the lazy dog.')).to.be('ef537f25c895bfa782526529a9b63d97aa631564d5d789c2b765448c8635fb6c');
         });
       });
 
-      context('and more than 64 bytes', function() {
+      context('and more than 64 bytes', function () {
-        it('should be equal', function() {
+        it('should be equal', function () {
           expect(sha256('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('54e73d89e1924fdcd056390266a983924b6d6d461e9470b6cd50bbaf69b5c54c');
         });
       });
     });
 
-    context('when UTF8', function() {
+    context('when UTF8', function () {
-      context('and less than 64 bytes', function() {
+      context('and less than 64 bytes', function () {
-        it('should be equal', function() {
+        it('should be equal', function () {
           expect(sha256('中文')).to.be('72726d8818f693066ceb69afa364218b692e62ea92b385782363780f47529c21');
           expect(sha256('aécio')).to.be('53196d1acfce0c4b264e01e8018c989d571351f59e33f055f76ff15b4f0516c6');
           expect(sha256('𠜎')).to.be('8d10a48685dbc34484696de7ea7434d80a54c1d60100530faccf697463ef19c9');
         });
       });
 
-      context('and more than 64 bytes', function() {
+      context('and more than 64 bytes', function () {
-        it('should be equal', function() {
+        it('should be equal', function () {
           expect(sha256('訊息摘要演算法第五版（英語：Message-Digest Algorithm 5，縮寫為MD5），是當前電腦領域用於確保資訊傳輸完整一致而廣泛使用的雜湊演算法之一')).to.be('d691014feebf35b3500ef6f6738d0094cac63628a7a018a980a40292a77703d1');
           expect(sha256('訊息摘要演算法第五版（英語：Message-Digest Algorithm 5，縮寫為MD5），是當前電腦領域用於確保資訊傳輸完整一致而廣泛使用的雜湊演算法之一（又譯雜湊演算法、摘要演算法等），主流程式語言普遍已有MD5的實作。')).to.be('81a1472ebdeb09406a783d607ff49ee2fde3e9f44ac1cd158ad8d6ad3c4e69fa');
         });
       });
     });
     
-    context('when special length', function() {
+    context('when special length', function () {
-      it('should be equal', function() {
+      it('should be equal', function () {
         expect(sha256('0123456780123456780123456780123456780123456780123456780')).to.be('5e6b963e2b6444dab8544beab8532850cef2a9d143872a6a5384abe37e61b3db');
         expect(sha256('01234567801234567801234567801234567801234567801234567801')).to.be('85d240a4a03a0710423fc4f701da51e8785c9eaa96d718ab1c7991d6afd60d62');
         expect(sha256('0123456780123456780123456780123456780123456780123456780123456780')).to.be('c3ee464d5620eb2dde3dfda4c7955dbd9e9e2e9b113c13983fc67b0dfd892a53');
@@ -43,8 +43,8 @@
       });
     });
 
-    context('when Array', function() {
+    context('when Array', function () {
-      it('should be equal', function() {
+      it('should be equal', function () {
         expect(sha256([])).to.be('e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855');
         expect(sha256([211, 212])).to.be('182889f925ae4e5cc37118ded6ed87f7bdc7cab5ec5e78faef2e50048999473f');
         expect(sha256([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('d7a8fbb307d7809469ca9abcb0082e4f8d5651e46d3cdb762d02d0bf37c9e592');
@@ -52,56 +52,56 @@
       });
     });
 
-    context('when Uint8Array', function() {
+    context('when Uint8Array', function () {
-      it('should be equal', function() {
+      it('should be equal', function () {
         expect(sha256(new Uint8Array([]))).to.be('e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855');
         expect(sha256(new Uint8Array([211, 212]))).to.be('182889f925ae4e5cc37118ded6ed87f7bdc7cab5ec5e78faef2e50048999473f');
       });
     });
 
-    context('when ArrayBuffer', function() {
+    context('when ArrayBuffer', function () {
-      it('should be equal', function() {
+      it('should be equal', function () {
         expect(sha256(new ArrayBuffer(0))).to.be('e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855');
       });
     });
   });
 
-  describe('sha224', function() {
+  describe('sha224', function () {
-    context('when ascii', function() {
+    context('when ascii', function () {
-      context('and less than 64 bytes', function() {
+      context('and less than 64 bytes', function () {
-        it('should be equal', function() {
+        it('should be equal', function () {
           expect(sha224('')).to.be('d14a028c2a3a2bc9476102bb288234c415a2b01f828ea62ac5b3e42f');
           expect(sha224('The quick brown fox jumps over the lazy dog')).to.be('730e109bd7a8a32b1cb9d9a09aa2325d2430587ddbc0c38bad911525');
           expect(sha224('The quick brown fox jumps over the lazy dog.')).to.be('619cba8e8e05826e9b8c519c0a5c68f4fb653e8a3d8aa04bb2c8cd4c');
         });
       });
 
-      context('and more than 64 bytes', function() {
+      context('and more than 64 bytes', function () {
-        it('should be equal', function() {
+        it('should be equal', function () {
           expect(sha224('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('4d97e15967391d2e846ea7d21bb480efadbae5868b731e7cc6267006');
         });
       });
     });
 
-    context('when UTF8', function() {
+    context('when UTF8', function () {
-      context('and less than 64 bytes', function() {
+      context('and less than 64 bytes', function () {
-        it('should be equal', function() {
+        it('should be equal', function () {
           expect(sha224('中文')).to.be('dfbab71afdf54388af4d55f8bd3de8c9b15e0eb916bf9125f4a959d4');
           expect(sha224('aécio')).to.be('d12841cafd89c534924a839e62bf35a2b5f3717b7802eb19bd8d8e15');
           expect(sha224('𠜎')).to.be('eaa0129b5509f5701db218fb7076b282e4409da52d06363aa3bdd63d');
         });
       });
 
-      context('and more than 64 bytes', function() {
+      context('and more than 64 bytes', function () {
-        it('should be equal', function() {
+        it('should be equal', function () {
           expect(sha224('訊息摘要演算法第五版（英語：Message-Digest Algorithm 5，縮寫為MD5），是當前電腦領域用於確保資訊傳輸完整一致而廣泛使用的雜湊演算法之一')).to.be('0dda421f3f81272418e1313673e9d74b7f2d04efc9c52c69458e12c3');
           expect(sha224('訊息摘要演算法第五版（英語：Message-Digest Algorithm 5，縮寫為MD5），是當前電腦領域用於確保資訊傳輸完整一致而廣泛使用的雜湊演算法之一（又譯雜湊演算法、摘要演算法等），主流程式語言普遍已有MD5的實作。')).to.be('a8cb74a54e6dc6ab6110db3915ba08ffe5e1abafaea78538fa12a626');
         });
       });
     });
     
-    context('when special length', function() {
+    context('when special length', function () {
-      it('should be equal', function() {
+      it('should be equal', function () {
         expect(sha224('0123456780123456780123456780123456780123456780123456780')).to.be('bc4a354d66f3cff4bc6dd6a88fbb0435cede7fd5fe94da0760cb1924');
         expect(sha224('01234567801234567801234567801234567801234567801234567801')).to.be('2f148f757d1295784a7c69bf328b8bf827a536669e132234cd6f50e7');
         expect(sha224('0123456780123456780123456780123456780123456780123456780123456780')).to.be('496275a96bf41aa27ce89c3ae0fc63c3a3eab063887a8ea075bd091b');