snowball 0.1.21 → 0.1.22

data/node_modules/browserify/node_modules/crypto-browserify/package.json

@@ -0,0 +1,33 @@
+{
+  "author": {
+    "name": "Dominic Tarr",
+    "email": "dominic.tarr@gmail.com",
+    "url": "dominictarr.com"
+  },
+  "name": "crypto-browserify",
+  "description": "partial implementation of crypto for the browser",
+  "version": "0.2.1",
+  "homepage": "https://github.com/dominictarr/crypto-browserify",
+  "repository": {
+    "type": "git",
+    "url": "git://github.com/dominictarr/crypto-browserify.git"
+  },
+  "scripts": {
+    "test": "node test/simple.js"
+  },
+  "engines": {
+    "node": "*"
+  },
+  "dependencies": {},
+  "devDependencies": {
+    "tape": "~0.1.5"
+  },
+  "optionalDependencies": {},
+  "readme": "# crypto-browserify\n\nA (partial) port of `crypto` to the browser.\n\n\n[![travis](https://secure.travis-ci.org/dominictarr/crypto-browserify.png?branch=master)](https://travis-ci.org/dominictarr/crypto-browserify)\n\n[![browser support](http://ci.testling.com/dominictarr/crypto-browserify.png)](http://ci.testling.com/dominictarr/crypto-browserify)\n\n\nBasically, I found some crypto implemented in JS lieing on the internet somewhere\nand wrapped it in the part of the `crypto` api that I am currently using.\n\nIn a way that will be compatible with [browserify](https://github.com/substack/node-browserify/).\n\nI will extend this if I need more features, or if anyone else wants to extend this,\nI will add you as a maintainer.\n\nProvided that you agree that it should replicate the [node.js/crypto](http://nodejs.org/api/crypto.html) api exactly, of course.\n\n",
+  "readmeFilename": "readme.markdown",
+  "bugs": {
+    "url": "https://github.com/dominictarr/crypto-browserify/issues"
+  },
+  "_id": "crypto-browserify@0.2.1",
+  "_from": "crypto-browserify@0.2.1"
+}

data/node_modules/browserify/node_modules/crypto-browserify/readme.markdown

@@ -0,0 +1,20 @@
+# crypto-browserify
+
+A (partial) port of `crypto` to the browser.
+
+
+[![travis](https://secure.travis-ci.org/dominictarr/crypto-browserify.png?branch=master)](https://travis-ci.org/dominictarr/crypto-browserify)
+
+[![browser support](http://ci.testling.com/dominictarr/crypto-browserify.png)](http://ci.testling.com/dominictarr/crypto-browserify)
+
+
+Basically, I found some crypto implemented in JS lieing on the internet somewhere
+and wrapped it in the part of the `crypto` api that I am currently using.
+
+In a way that will be compatible with [browserify](https://github.com/substack/node-browserify/).
+
+I will extend this if I need more features, or if anyone else wants to extend this,
+I will add you as a maintainer.
+
+Provided that you agree that it should replicate the [node.js/crypto](http://nodejs.org/api/crypto.html) api exactly, of course.
+

data/node_modules/browserify/node_modules/crypto-browserify/rng.js

@@ -0,0 +1,37 @@
+// Original code adapted from Robert Kieffer.
+// details at https://github.com/broofa/node-uuid
+(function() {
+  var _global = this;
+
+  var mathRNG, whatwgRNG;
+
+  // NOTE: Math.random() does not guarantee "cryptographic quality"
+  mathRNG = function(size) {
+    var bytes = new Array(size);
+    var r;
+
+    for (var i = 0, r; i < size; i++) {
+      if ((i & 0x03) == 0) r = Math.random() * 0x100000000;
+      bytes[i] = r >>> ((i & 0x03) << 3) & 0xff;
+    }
+
+    return bytes;
+  }
+
+  // currently only available in webkit-based browsers.
+  if (_global.crypto && crypto.getRandomValues) {
+    var _rnds = new Uint32Array(4);
+    whatwgRNG = function(size) {
+      var bytes = new Array(size);
+      crypto.getRandomValues(_rnds);
+
+      for (var c = 0 ; c < size; c++) {
+        bytes[c] = _rnds[c >> 2] >>> ((c & 0x03) * 8) & 0xff;
+      }
+      return bytes;
+    }
+  }
+
+  module.exports = whatwgRNG || mathRNG;
+
+}())

data/node_modules/browserify/node_modules/crypto-browserify/sha.js

@@ -0,0 +1,210 @@
+/*
+ * A JavaScript implementation of the Secure Hash Algorithm, SHA-1, as defined
+ * in FIPS PUB 180-1
+ * Version 2.1a Copyright Paul Johnston 2000 - 2002.
+ * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
+ * Distributed under the BSD License
+ * See http://pajhome.org.uk/crypt/md5 for details.
+ */
+
+exports.hex_sha1 = hex_sha1;
+exports.b64_sha1 = b64_sha1;
+exports.str_sha1 = str_sha1;
+exports.hex_hmac_sha1 = hex_hmac_sha1;
+exports.b64_hmac_sha1 = b64_hmac_sha1;
+exports.str_hmac_sha1 = str_hmac_sha1;
+
+/*
+ * Configurable variables. You may need to tweak these to be compatible with
+ * the server-side, but the defaults work in most cases.
+ */
+var hexcase = 0;  /* hex output format. 0 - lowercase; 1 - uppercase        */
+var b64pad  = ""; /* base-64 pad character. "=" for strict RFC compliance   */
+var chrsz   = 8;  /* bits per input character. 8 - ASCII; 16 - Unicode      */
+
+/*
+ * These are the functions you'll usually want to call
+ * They take string arguments and return either hex or base-64 encoded strings
+ */
+function hex_sha1(s){return binb2hex(core_sha1(str2binb(s),s.length * chrsz));}
+function b64_sha1(s){return binb2b64(core_sha1(str2binb(s),s.length * chrsz));}
+function str_sha1(s){return binb2str(core_sha1(str2binb(s),s.length * chrsz));}
+function hex_hmac_sha1(key, data){ return binb2hex(core_hmac_sha1(key, data));}
+function b64_hmac_sha1(key, data){ return binb2b64(core_hmac_sha1(key, data));}
+function str_hmac_sha1(key, data){ return binb2str(core_hmac_sha1(key, data));}
+
+/*
+ * Perform a simple self-test to see if the VM is working
+ */
+function sha1_vm_test()
+{
+  return hex_sha1("abc") == "a9993e364706816aba3e25717850c26c9cd0d89d";
+}
+
+/*
+ * Calculate the SHA-1 of an array of big-endian words, and a bit length
+ */
+function core_sha1(x, len)
+{
+  /* append padding */
+  x[len >> 5] |= 0x80 << (24 - len % 32);
+  x[((len + 64 >> 9) << 4) + 15] = len;
+
+  var w = Array(80);
+  var a =  1732584193;
+  var b = -271733879;
+  var c = -1732584194;
+  var d =  271733878;
+  var e = -1009589776;
+
+  for(var i = 0; i < x.length; i += 16)
+  {
+    var olda = a;
+    var oldb = b;
+    var oldc = c;
+    var oldd = d;
+    var olde = e;
+
+    for(var j = 0; j < 80; j++)
+    {
+      if(j < 16) w[j] = x[i + j];
+      else w[j] = rol(w[j-3] ^ w[j-8] ^ w[j-14] ^ w[j-16], 1);
+      var t = safe_add(safe_add(rol(a, 5), sha1_ft(j, b, c, d)),
+                       safe_add(safe_add(e, w[j]), sha1_kt(j)));
+      e = d;
+      d = c;
+      c = rol(b, 30);
+      b = a;
+      a = t;
+    }
+
+    a = safe_add(a, olda);
+    b = safe_add(b, oldb);
+    c = safe_add(c, oldc);
+    d = safe_add(d, oldd);
+    e = safe_add(e, olde);
+  }
+  return Array(a, b, c, d, e);
+
+}
+
+/*
+ * Perform the appropriate triplet combination function for the current
+ * iteration
+ */
+function sha1_ft(t, b, c, d)
+{
+  if(t < 20) return (b & c) | ((~b) & d);
+  if(t < 40) return b ^ c ^ d;
+  if(t < 60) return (b & c) | (b & d) | (c & d);
+  return b ^ c ^ d;
+}
+
+/*
+ * Determine the appropriate additive constant for the current iteration
+ */
+function sha1_kt(t)
+{
+  return (t < 20) ?  1518500249 : (t < 40) ?  1859775393 :
+         (t < 60) ? -1894007588 : -899497514;
+}
+
+/*
+ * Calculate the HMAC-SHA1 of a key and some data
+ */
+function core_hmac_sha1(key, data)
+{
+  var bkey = str2binb(key);
+  if(bkey.length > 16) bkey = core_sha1(bkey, key.length * chrsz);
+
+  var ipad = Array(16), opad = Array(16);
+  for(var i = 0; i < 16; i++)
+  {
+    ipad[i] = bkey[i] ^ 0x36363636;
+    opad[i] = bkey[i] ^ 0x5C5C5C5C;
+  }
+
+  var hash = core_sha1(ipad.concat(str2binb(data)), 512 + data.length * chrsz);
+  return core_sha1(opad.concat(hash), 512 + 160);
+}
+
+/*
+ * Add integers, wrapping at 2^32. This uses 16-bit operations internally
+ * to work around bugs in some JS interpreters.
+ */
+function safe_add(x, y)
+{
+  var lsw = (x & 0xFFFF) + (y & 0xFFFF);
+  var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
+  return (msw << 16) | (lsw & 0xFFFF);
+}
+
+/*
+ * Bitwise rotate a 32-bit number to the left.
+ */
+function rol(num, cnt)
+{
+  return (num << cnt) | (num >>> (32 - cnt));
+}
+
+/*
+ * Convert an 8-bit or 16-bit string to an array of big-endian words
+ * In 8-bit function, characters >255 have their hi-byte silently ignored.
+ */
+function str2binb(str)
+{
+  var bin = Array();
+  var mask = (1 << chrsz) - 1;
+  for(var i = 0; i < str.length * chrsz; i += chrsz)
+    bin[i>>5] |= (str.charCodeAt(i / chrsz) & mask) << (32 - chrsz - i%32);
+  return bin;
+}
+
+/*
+ * Convert an array of big-endian words to a string
+ */
+function binb2str(bin)
+{
+  var str = "";
+  var mask = (1 << chrsz) - 1;
+  for(var i = 0; i < bin.length * 32; i += chrsz)
+    str += String.fromCharCode((bin[i>>5] >>> (32 - chrsz - i%32)) & mask);
+  return str;
+}
+
+/*
+ * Convert an array of big-endian words to a hex string.
+ */
+function binb2hex(binarray)
+{
+  var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef";
+  var str = "";
+  for(var i = 0; i < binarray.length * 4; i++)
+  {
+    str += hex_tab.charAt((binarray[i>>2] >> ((3 - i%4)*8+4)) & 0xF) +
+           hex_tab.charAt((binarray[i>>2] >> ((3 - i%4)*8  )) & 0xF);
+  }
+  return str;
+}
+
+/*
+ * Convert an array of big-endian words to a base-64 string
+ */
+function binb2b64(binarray)
+{
+  var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
+  var str = "";
+  for(var i = 0; i < binarray.length * 4; i += 3)
+  {
+    var triplet = (((binarray[i   >> 2] >> 8 * (3 -  i   %4)) & 0xFF) << 16)
+                | (((binarray[i+1 >> 2] >> 8 * (3 - (i+1)%4)) & 0xFF) << 8 )
+                |  ((binarray[i+2 >> 2] >> 8 * (3 - (i+2)%4)) & 0xFF);
+    for(var j = 0; j < 4; j++)
+    {
+      if(i * 8 + j * 6 > binarray.length * 32) str += b64pad;
+      else str += tab.charAt((triplet >> 6*(3-j)) & 0x3F);
+    }
+  }
+  return str;
+}
+

data/node_modules/browserify/node_modules/crypto-browserify/test/simple.js

@@ -0,0 +1,35 @@
+var test = require("tape")
+
+var crypto = require('crypto')
+var cryptoB = require('../')
+var assert = require('assert')
+
+function assertSame (fn) {
+  test(fn.name, function (t) {
+    fn(crypto, function (err, expected) {
+      fn(cryptoB, function (err, actual) {
+        t.equal(actual, expected)
+        t.end()
+      })
+    })
+  })
+}
+
+assertSame(function sha1 (crypto, cb) {
+  cb(null, crypto.createHash('sha1').update('hello', 'utf-8').digest('hex'))
+})
+
+assertSame(function md5(crypto, cb) {
+  cb(null, crypto.createHash('md5').update('hello', 'utf-8').digest('hex'))
+})
+
+assert.equal(cryptoB.randomBytes(10).length, 10)
+test('randomBytes', function (t) {
+  cryptoB.randomBytes(10, function(ex, bytes) {
+    assert.ifError(ex)
+    bytes.forEach(function(bite) {
+      assert.equal(typeof bite, 'number')
+    })
+    t.end()
+  })
+})

data/node_modules/browserify/node_modules/deputy/.travis.yml

@@ -0,0 +1,4 @@
+language: node_js
+node_js:
+  - 0.6
+  - 0.8

data/node_modules/browserify/node_modules/deputy/README.markdown

@@ -0,0 +1,55 @@
+deputy
+======
+
+This module is a caching layer around
+[node-detective](http://github.com/substack/node-detective).
+
+[![build status](https://secure.travis-ci.org/substack/node-deputy.png)](http://travis-ci.org/substack/node-deputy)
+
+example
+=======
+
+cache.js
+--------
+
+``` js
+var deputy = require('deputy');
+var detective = deputy(process.env.HOME + '/.config/deputy.json');
+
+var deps = detective.find('require("a"); require("b")');
+console.dir(deps);
+```
+
+output:
+
+```
+$ node cache.js 
+{ strings: [ 'a', 'b' ], expressions: [] }
+$ cat ~/.config/deputy.json 
+{"55952d490bd28e3e256f0b036ced834d":{"strings":["a","b"],"expressions":[]}}
+```
+
+methods
+=======
+
+``` js
+var deputy = require('deputy')
+```
+
+var detective = deputy(cacheFile)
+---------------------------------
+
+Return a new [detective](http://github.com/substack/node-detective)
+object using `cacheFile` for caching.
+
+install
+=======
+
+With [npm](http://npmjs.org) do:
+
+    npm install deputy
+
+license
+=======
+
+MIT/X11

data/node_modules/browserify/node_modules/deputy/example/cache.js

@@ -0,0 +1,5 @@
+var deputy = require('deputy');
+var detective = deputy(process.env.HOME + '/.config/deputy.json');
+
+var deps = detective.find('require("a"); require("b")');
+console.dir(deps);

data/node_modules/browserify/node_modules/deputy/index.js

@@ -0,0 +1,46 @@
+var fs = require('fs');
+var path = require('path');
+var crypto = require('crypto');
+var existsSync = fs.existsSync || path.existsSync;
+
+var mkdirp = require('mkdirp');
+var detective = require('detective');
+
+module.exports = function (cacheFile) {
+    mkdirp.sync(path.dirname(cacheFile), 0700);
+    
+    var cache = {};
+    if (existsSync(cacheFile)) {
+        var body = fs.readFileSync(cacheFile);
+        try {
+            cache = JSON.parse(body);
+        }
+        catch (err) {}
+    }
+    
+    function save (h, res) {
+        cache[h] = res;
+        fs.writeFileSync(cacheFile, JSON.stringify(cache));
+    }
+    
+    function hash (src) {
+        return new crypto.Hash('md5').update(src).digest('hex');
+    }
+    
+    var deputy = function (src) {
+        return deputy.find(src).strings;
+    };
+    
+    deputy.find = function (src) {
+        var h = hash(src);
+        var c = cache[h];
+        if (c) return c;
+        else {
+            c = detective.find(src);
+            save(h, c);
+            return c;
+        }
+    };
+    
+    return deputy;
+};