sprockets-browserify 0.2.0 → 0.3.0

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

@@ -0,0 +1,79 @@
+
+/**
+ * A JavaScript implementation of the Secure Hash Algorithm, SHA-256, as defined
+ * in FIPS 180-2
+ * Version 2.2-beta Copyright Angel Marin, Paul Johnston 2000 - 2009.
+ * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
+ *
+ */
+
+var helpers = require('./helpers');
+
+var safe_add = function(x, y) {
+  var lsw = (x & 0xFFFF) + (y & 0xFFFF);
+  var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
+  return (msw << 16) | (lsw & 0xFFFF);
+};
+
+var S = function(X, n) {
+  return (X >>> n) | (X << (32 - n));
+};
+
+var R = function(X, n) {
+  return (X >>> n);
+};
+
+var Ch = function(x, y, z) {
+  return ((x & y) ^ ((~x) & z));
+};
+
+var Maj = function(x, y, z) {
+  return ((x & y) ^ (x & z) ^ (y & z));
+};
+
+var Sigma0256 = function(x) {
+  return (S(x, 2) ^ S(x, 13) ^ S(x, 22));
+};
+
+var Sigma1256 = function(x) {
+  return (S(x, 6) ^ S(x, 11) ^ S(x, 25));
+};
+
+var Gamma0256 = function(x) {
+  return (S(x, 7) ^ S(x, 18) ^ R(x, 3));
+};
+
+var Gamma1256 = function(x) {
+  return (S(x, 17) ^ S(x, 19) ^ R(x, 10));
+};
+
+var core_sha256 = function(m, l) {
+  var K = new Array(0x428A2F98,0x71374491,0xB5C0FBCF,0xE9B5DBA5,0x3956C25B,0x59F111F1,0x923F82A4,0xAB1C5ED5,0xD807AA98,0x12835B01,0x243185BE,0x550C7DC3,0x72BE5D74,0x80DEB1FE,0x9BDC06A7,0xC19BF174,0xE49B69C1,0xEFBE4786,0xFC19DC6,0x240CA1CC,0x2DE92C6F,0x4A7484AA,0x5CB0A9DC,0x76F988DA,0x983E5152,0xA831C66D,0xB00327C8,0xBF597FC7,0xC6E00BF3,0xD5A79147,0x6CA6351,0x14292967,0x27B70A85,0x2E1B2138,0x4D2C6DFC,0x53380D13,0x650A7354,0x766A0ABB,0x81C2C92E,0x92722C85,0xA2BFE8A1,0xA81A664B,0xC24B8B70,0xC76C51A3,0xD192E819,0xD6990624,0xF40E3585,0x106AA070,0x19A4C116,0x1E376C08,0x2748774C,0x34B0BCB5,0x391C0CB3,0x4ED8AA4A,0x5B9CCA4F,0x682E6FF3,0x748F82EE,0x78A5636F,0x84C87814,0x8CC70208,0x90BEFFFA,0xA4506CEB,0xBEF9A3F7,0xC67178F2);
+  var HASH = new Array(0x6A09E667, 0xBB67AE85, 0x3C6EF372, 0xA54FF53A, 0x510E527F, 0x9B05688C, 0x1F83D9AB, 0x5BE0CD19);
+    var W = new Array(64);
+    var a, b, c, d, e, f, g, h, i, j;
+    var T1, T2;
+  /* append padding */
+  m[l >> 5] |= 0x80 << (24 - l % 32);
+  m[((l + 64 >> 9) << 4) + 15] = l;
+  for (var i = 0; i < m.length; i += 16) {
+    a = HASH[0]; b = HASH[1]; c = HASH[2]; d = HASH[3]; e = HASH[4]; f = HASH[5]; g = HASH[6]; h = HASH[7];
+    for (var j = 0; j < 64; j++) {
+      if (j < 16) {
+        W[j] = m[j + i];
+      } else {
+        W[j] = safe_add(safe_add(safe_add(Gamma1256(W[j - 2]), W[j - 7]), Gamma0256(W[j - 15])), W[j - 16]);
+      }
+      T1 = safe_add(safe_add(safe_add(safe_add(h, Sigma1256(e)), Ch(e, f, g)), K[j]), W[j]);
+      T2 = safe_add(Sigma0256(a), Maj(a, b, c));
+      h = g; g = f; f = e; e = safe_add(d, T1); d = c; c = b; b = a; a = safe_add(T1, T2);
+    }
+    HASH[0] = safe_add(a, HASH[0]); HASH[1] = safe_add(b, HASH[1]); HASH[2] = safe_add(c, HASH[2]); HASH[3] = safe_add(d, HASH[3]);
+    HASH[4] = safe_add(e, HASH[4]); HASH[5] = safe_add(f, HASH[5]); HASH[6] = safe_add(g, HASH[6]); HASH[7] = safe_add(h, HASH[7]);
+  }
+  return HASH;
+};
+
+module.exports = function sha256(buf) {
+  return helpers.hash(buf, core_sha256, 32, true);
+};

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

@@ -0,0 +1,100 @@
+var test = require('tape');
+var Buffer = require('buffer').Buffer;
+
+var crypto = require('../');
+
+var algorithms = ['sha1', 'sha256', 'md5'];
+var encodings = ['binary', 'hex', 'base64'];
+
+
+// We can't compare against node's crypto library directly because when
+// using testling we only have another version of crypto-browserify to
+// check against. So we'll use a cached version of the expected values
+// generated by node crypto.
+var EXPECTED = {};
+
+EXPECTED['sha1-hash-binary'] = atob('qvTGHdzF6KLavt4PO0gs2a6pQ00=');
+EXPECTED['sha1-hash-hex'] = 'aaf4c61ddcc5e8a2dabede0f3b482cd9aea9434d';
+EXPECTED['sha1-hash-base64'] = 'qvTGHdzF6KLavt4PO0gs2a6pQ00=';
+
+EXPECTED['sha256-hash-binary'] = atob('LPJNul+wow4m6DsqxbninhsWHlwfp0JecwQzYpOLmCQ=');
+EXPECTED['sha256-hash-hex'] = '2cf24dba5fb0a30e26e83b2ac5b9e29e1b161e5c1fa7425e73043362938b9824';
+EXPECTED['sha256-hash-base64'] = 'LPJNul+wow4m6DsqxbninhsWHlwfp0JecwQzYpOLmCQ=';
+
+EXPECTED['md5-hash-binary'] = atob('XUFAKrxLKna5cZ2REBfFkg==');
+EXPECTED['md5-hash-hex'] = '5d41402abc4b2a76b9719d911017c592';
+EXPECTED['md5-hash-base64'] = 'XUFAKrxLKna5cZ2REBfFkg==';
+
+EXPECTED['sha1-hmac-binary'] = atob('URIFXAX5RPhXVe/FzYlw4ZTp9Fs=');
+EXPECTED['sha1-hmac-hex'] = '5112055c05f944f85755efc5cd8970e194e9f45b';
+EXPECTED['sha1-hmac-base64'] = 'URIFXAX5RPhXVe/FzYlw4ZTp9Fs=';
+
+EXPECTED['sha256-hmac-binary'] = atob('iKqz7ejTrflNJquQ07r9SiCDBww7zOnAFO4EpEOEfAs=');
+EXPECTED['sha256-hmac-hex'] = '88aab3ede8d3adf94d26ab90d3bafd4a2083070c3bcce9c014ee04a443847c0b';
+EXPECTED['sha256-hmac-base64'] = 'iKqz7ejTrflNJquQ07r9SiCDBww7zOnAFO4EpEOEfAs=';
+
+EXPECTED['md5-hmac-binary'] = atob('ut5jhjxh7QsxZYBuzWrO/A==');
+EXPECTED['md5-hmac-hex'] = 'bade63863c61ed0b3165806ecd6acefc';
+EXPECTED['md5-hmac-base64'] = 'ut5jhjxh7QsxZYBuzWrO/A==';
+
+EXPECTED['md5-with-binary'] = '27549c8ff29ca52f7957f89c328dbb6d';
+EXPECTED['sha1-with-binary'] = '4fa10dda29053b237b5d9703151c852c61e6d8d7';
+EXPECTED['sha256-with-binary'] = '424ff84246aabc1560a2881b9664108dfe26784c762d930c4ff396c085f4183b';
+
+EXPECTED['md5-empty-string'] = 'd41d8cd98f00b204e9800998ecf8427e';
+EXPECTED['sha1-empty-string'] = 'da39a3ee5e6b4b0d3255bfef95601890afd80709';
+EXPECTED['sha256-empty-string'] = 'e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855';
+
+
+algorithms.forEach(function (algorithm) {
+    encodings.forEach(function (encoding) {
+        test(algorithm + ' hash using ' + encoding, function (t) {
+            t.plan(1);
+            var actual = crypto.createHash(algorithm).update('hello', 'utf-8').digest(encoding);
+            var expected = EXPECTED[algorithm + '-hash-' + encoding];
+            t.equal(actual, expected);
+            t.end();
+        });
+
+        test(algorithm + ' hmac using ' + encoding, function (t) {
+            t.plan(1);
+            var actual = crypto.createHmac(algorithm, 'secret').update('hello', 'utf-8').digest(encoding);
+            var expected = EXPECTED[algorithm + '-hmac-' + encoding];
+            t.equal(actual, expected);
+            t.end();
+        });
+    });
+
+    test(algorithm + ' with empty string', function (t) {
+        t.plan(1);
+        var actual = crypto.createHash(algorithm).update('', 'utf-8').digest('hex');
+        var expected = EXPECTED[algorithm + '-empty-string'];
+        t.equal(actual, expected);
+        t.end();
+    });
+
+    test(algorithm + ' with raw binary', function (t) {
+        t.plan(1);
+        var seed = 'hello';
+        for (var i = 0; i < 1000; i++) {
+            seed = crypto.createHash(algorithm).update(seed).digest('binary');
+        }
+        var actual = crypto.createHash(algorithm).update(seed).digest('hex');
+        var expected = EXPECTED[algorithm + '-with-binary'];
+        t.equal(actual, expected);
+        t.end();
+    });
+});
+
+
+test('randomBytes', function (t) {
+    t.plan(5);
+    t.equal(crypto.randomBytes(10).length, 10);
+    t.ok(crypto.randomBytes(10) instanceof Buffer);
+    crypto.randomBytes(10, function(ex, bytes) {
+        t.error(ex);
+        t.equal(bytes.length, 10);
+        t.ok(bytes instanceof Buffer);
+        t.end();
+  });
+});

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

@@ -0,0 +1,77 @@
+var test = require('tape');
+
+var crypto = require('crypto');
+var cryptoB = require('../');
+var fs = require('fs');
+
+function assertSame(name, fn) {
+    test(name, function (t) {
+        t.plan(1);
+        fn(crypto, function (err, expected) {
+            fn(cryptoB, function (err, actual) {
+                t.equal(actual, expected);
+                t.end();
+            });
+        });
+    });
+}
+
+var algorithms = ['sha1', 'sha256', 'md5'];
+var encodings = ['binary', 'hex', 'base64'];
+
+
+algorithms.forEach(function (algorithm) {
+    encodings.forEach(function (encoding) {
+        assertSame(algorithm + ' hash using ' + encoding, function (crypto, cb) {
+            cb(null, crypto.createHash(algorithm).update('hellø', 'utf-8').digest(encoding));
+        })
+
+        assertSame(algorithm + ' hmac using ' + encoding, function (crypto, cb) {
+            cb(null, crypto.createHmac(algorithm, 'secret').update('hellø', 'utf-8').digest(encoding))
+        })
+    });
+
+    assertSame(algorithm + ' with raw binary', function (crypto, cb) {
+        var seed = 'hellø';
+        for (var i = 0; i < 1000; i++) {
+            seed = crypto.createHash(algorithm).update(new Buffer(seed)).digest('binary');
+        }
+        cb(null, crypto.createHash(algorithm).update(new Buffer(seed)).digest('hex'));
+    });
+
+    assertSame(algorithm + ' empty string', function (crypto, cb) {
+        cb(null, crypto.createHash(algorithm).update('').digest('hex'));
+    });
+});
+
+function pad(n, w) {
+  n = n + ''; return new Array(w - n.length + 1).join('0') + n;
+}
+
+var vectors = fs.readdirSync(__dirname + '/vectors').sort().
+    filter(function (t) { return t.match(/\.dat$/); }).
+    map(function (t) { return fs.readFileSync(__dirname + '/vectors/' + t); });
+
+['md5', 'sha1', 'sha256'].forEach(function (algorithm) {
+    test(algorithm, function (t) {
+        function hash(data) { return cryptoB.createHash(algorithm).update(data).digest('hex'); }
+
+        var hashes = fs.readFileSync(__dirname + '/vectors/byte-hashes.' + algorithm).toString().split(/\r?\n/);
+        t.plan(vectors.length);
+        for (var i = 0; i < vectors.length; i++) {
+            t.equal(hash(vectors[i]), hashes[i], 'byte' + pad(i, 4) + '.dat');
+        }
+    });
+});
+
+test('randomBytes', function (t) {
+    t.plan(5);
+    t.equal(cryptoB.randomBytes(10).length, 10);
+    t.ok(cryptoB.randomBytes(10) instanceof Buffer);
+    cryptoB.randomBytes(10, function(ex, bytes) {
+        t.error(ex);
+        t.equal(bytes.length, 10);
+        t.ok(bytes instanceof Buffer);
+        t.end();
+  });
+});

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

@@ -0,0 +1,7 @@
+{
+  "browserify": {
+    "transform": [
+      "brfs"
+    ]
+  }
+}

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

@@ -0,0 +1,36 @@
+var test = require("tape")
+
+var crypto = require('crypto')
+var cryptoB = require('../')
+
+function assertSame (fn) {
+  test(fn.name, function (t) {
+    t.plan(1)
+    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'))
+})
+
+test('randomBytes', function (t) {
+  t.plan(5)
+  t.equal(cryptoB.randomBytes(10).length, 10)
+  t.ok(cryptoB.randomBytes(10) instanceof Buffer)
+  cryptoB.randomBytes(10, function(ex, bytes) {
+    t.error(ex)
+    t.equal(bytes.length, 10)
+    t.ok(bytes instanceof Buffer)
+    t.end()
+  })
+})

data/node_modules/browserify/node_modules/crypto-browserify/test/vectors/Readme.txt

@@ -0,0 +1,25 @@
+
+File formats:
+
+There are two files included for this byte-oriented test.  
+One file contains the messages and the other file contains the hashes.
+
+The message files provided use "compact strings" to store the message values.  
+Compact strings are used to represented the messages in a compact form.  
+A compact string has the form
+	z || b || n(1) || n(2) || ... || n(z)
+where z>=0 that represents the number of n, b is either 0 or 1, and 
+each n(i) is a decimal integer representing a positive number.  
+The length of the compact string is given by the summation of the n(i).
+
+The compact string is interpreted as the representation of the bit string 
+consisting of b repeated n(1) times, followed by 1-b repeated n(2) times, 
+followed by b repeated n(3) times, and so on.
+
+Example:
+	M = 5 1 7 13 5 1 2
+	where z = 5 and b = 1.  Then the compact string M represents the bit string
+	1111111000000000000011111011
+	where 1 is repeated 7 times, 0 is repeated 13 times, 1 is repeated 5 times,
+	0 is repeated 1 time, and 1 is repeated 2 times.
+

data/node_modules/browserify/node_modules/crypto-browserify/test/vectors/byte-hashes.md5

@@ -0,0 +1,196 @@
+d41d8cd98f00b204e9800998ecf8427e
+c3e97dd6e97fb5125688c97f36720cbe
+038701ca277a9d4de87bff428dd30a12
+bc60c6192e361d99b59d47250668a852
+542c3a0ab6b51bc6a88fa7bb567bca3e
+e035f9e748a2a09a4fbdcf18c4f58bf1
+3b4cc9226a236742d72578c5915b6c3c
+35950208a022baac90056636827158ce
+84cedff2ed1b78b395cc8651094f4ce3
+7badf748f4cb700272a72edfea22e9bf
+a1bb6e142739dbdb0925747d95e0a1ad
+0cd9b72dfdee8efd2e1515f4c5a62284
+ef07c13e75d50578d09052aa21a7cffb
+cf3b261af9344bf83b4dd82b30242c78
+530710f65fb98fff8eb927e2938cb8c5
+4e6d73658b27e19d4bb4500625001e39
+c8e5f2f272b1ef88ec62dd0d9d54e902
+031cbf1fb05b4ec09f3c93235d0f49ac
+8c0e1400df02ba8c4809b705e5f5e114
+57ec48278e19f71f54c570a5ab306df7
+ecd3dc346a2337b95389a094a031610f
+f11d91eae492225cbd82ef356aa96f9f
+26bd8b480216c723ce75da98b9bd430c
+80999c2d12f623e4f87e0550a8e3523a
+00945c1bd739ce389ac24bb93f6f9a85
+7ab55f0bd5dca5b17ecaa7fef73ed87b
+e3cedd606ad51dd18532abd3079a3e0c
+df5ecc6732e22cc25836398a10222e97
+863b6d9962ee3761bbb9cd8a8367589e
+683c9384e29efe82dd3ac847904c28e8
+b3d948e72159ddc9c600d75512c5f115
+ce8633a6cf189b07e022147bbbd0f350
+8df17372eb32a0afa4fc47837262ff61
+62c63ca91890ce6f78a59c0bdb1e7bab
+1eda4bb0259a939548ec4ceb39facde4
+c4f37a2c450f2a23322513b372e668a5
+cab8f06436c5ad45f982490215836f4e
+3a43bc720714a2a42a73a76085542f86
+03f2f4033b258e6eb1e101f1ed4c24b4
+2ceb33cec5ecad4a50f6bd3a831ae77c
+dd808f695d28f93562cfcb164bc3cce4
+01c6d7a87e94bf685205ec8d7c5196af
+ef0e93e8928f8bae1b216da8e661fc9b
+c8da55117d7d4b7ee8ddc8dc4ba73aa6
+bbfc64583c6d4c2ef4b0358464d4d028
+3bb5864481f2e66387419dd1a168aadc
+0d725d3a1d3d97d7b5ea8293bbbf32ba
+915eb22a15f7673f983672b6c353b6c8
+13b51da3e8a1422bfd58b79c4e19de64
+e69d6c03102464f22c395f9fa27108de
+132fa4cbedaa7bd965b0b5900211be48
+e37ff5d9f14249f327a19dd5296e6c7e
+4881a65cf107b1d034ff3ecd64ab9cb4
+547e92d01c0b699cfdf43f91714cfe2d
+aa2b3a055b56845f19109f21d3c783f4
+eb1f01cc647ece73b2192537200bb8b9
+1db274ef41b1ad71f713df2b05207e1a
+d8b4ec343b4310345efc6da9cee8a2ec
+082ee3b2be7910f7350368e395a63d90
+d247c4070ae1de106bcb438a2dacac23
+f8cbc4f3af45befc792679f2b113f1cb
+9031006a437019c5dcd987a31731ebd9
+a6b62759ee3883258fbdeeb8b56e6283
+4933898605b4a1b970b674a2dde92292
+f0684ca20de4607232f3e158e81a37f2
+c0b3fdecb3bb7b4ff0c936f378ccb027
+50652123b5e0e51bb5bc3fdde3c6a750
+ed4526ba8226d969f47edbb27b2f1144
+80e6f61dff9da8673fa16dbbdb14d03d
+1d52744bf1450d7c5cfdf1f0bbf967c1
+3438a953124960bcc44611923a8844ee
+b2f341296dd7aabbd4fd8e011be68a7d
+322dba69658a92e9a9ace4d7177fb97d
+b94a434a98efa493fbbc989360671bb9
+cd9ce9a01ed810af70999d8ce4c63811
+4c639abb75a0ae0f22c3384cb9c68441
+fe31ffcced1717988c854c2f3492466e
+b56d81337f9bbf0d838df831e9b40216
+0be9161adfeb2dd1c3f20338bfb3ec4b
+be7b7c9fa1ab09d6578a3f2a82bfafe3
+f6bdc04b4611ddf0aa8403bcb04292f7
+1c7146a10f3c76b0c1dd4af354b14982
+0d3d987f94aee65f84436696bcf33ea4
+1a5c9ac3ee859361ad5477ea792506a3
+e827d60f27e35d8e5b05af748ba897dd
+5b7899bf7a6267d9b3b8c82f241a1d7b
+6dc9fe740cf4a4b93cb0953a3c2a6026
+27adf814806fd4a51c1ffc84122c5c8a
+f74e94ab992c8f27de264993a09ab429
+5eee0f1591d10c159763749ec86b9ecb
+46898964a3889615d9f7c22a81e0a0e7
+8fb58d6770971b0f12e40b31ad65b4a9
+eb4ce130268dc13731dcd16ff492d0a9
+23532a54e8005860ad5e77f4e3392827
+07fedc4dc4891d1a90c501a781a666f2
+83e8341035b37dd70a92a6eed5406927
+6c9f7b3b25734d58f21f5050642874a5
+ef661042e6624f4052ce86d8f233d780
+efe794cdfad5cb86656e29854a1f5c92
+e5f19a0045481443bae165f03598a9ba
+b8fe8691321edbf308a9d60bb817c6af
+f31fdd0f1aef106005e6d29b72229fa1
+239ed45c3cb734db446adfbbe3dab8a1
+2c2303411c7d25617a54106aca18070d
+de179c41aca8bcdc388964024948ff8e
+ca335b74d59bd50832267d3bf28f81df
+dabda7a1cbaa8ea5104c57c8950b703a
+076352a22ecea5ebc876812f62c1cb8d
+ee0a2bdec712a9413623d8a920714b96
+a927c3a99f2843de4133377c690db9b7
+1fa98cff485549d49799dc8cf987a8af
+74013a076a786a26c7e04217bb51031d
+a44ca9661e967bb2e98af65277dac72f
+d30897726b635548dbfa5cebffd9cd63
+4ad04a250b8029c9a7bf6529ee8793c3
+de41e337d96fd23619121ea709861e1a
+18e070fd32cf732b9f37a0083320eec2
+7dd4b27ca8906182f684d0ee4ddb98c4
+70a440a8bd06ff40f6e9135946eb174d
+b8d052366e752ce7c803abd24854e934
+8ab9dfff746ce3e62c6e04feb7b48528
+ecfca8b371616efe78e9916dbf825f5b
+5f76da828c37fc4edb4557953539c92a
+ecad54f76ce3bc233e02fc6fd7f94628
+e8a1cc06bfec7f677f36a693e1342400
+9ad0fe040e44a8e7146c3dd8582b6752
+4e56f978f94cf72158fd4311831b4f9f
+3b95686fe49f50006607d5978aaa3efc
+fa354daecc45f14b82b0e7e567d24282
+b7c30cf902e74c10e3d5c3af7e854f6b
+e9369a7ec98e63186bdae77025cb5519
+57b441e2f3397d2628657e636cd2fc80
+8ae3a1e880ffb884260ec26e8fcd71a5
+eb7d8f9199945e8a1e5c3708da45e08b
+d7dd1997c20a1029f9bd0fd1e2d2ed92
+a986ef62ef378583985cf0d0a34d17d0
+ad5bef0d6ad3434f871983ed09aaa43c
+326f662a5c18a14d26c3d35131ea4b4e
+ea4bf919aebf4add0024d91ee6f640d0
+9cc49e156084d2c757bd6d502bae8309
+9c18d4c75cc02337c277532ecea4b9fa
+4159a65b7db275742e998fb855e7b9f3
+df34d37f6b4ef078bd9570efdd8fd2e2
+84d2c12c4f0c28d288464d33a23f227c
+17b55bbd4222066960e54182e1e95f0b
+75eb69b22793852bc892ce264c421a1e
+de4abe78e28e2718200c76237f2ed42f
+1149c8fc988799f43f6e5069355e108b
+4129891ff13ddd62820f6f3cdbfa95da
+c8758df3c9ad4d311516ea39fe734052
+360ddf0b658fd764ef5ae9bf7a8a1a12
+ad054e0e84e2b8e2b02ce4dee7688226
+cb434f8c5fad9793ed142805afa861a0
+83a3d5436f96cb2cb31d929794425f31
+34dde0f0fe7d4fdb359df1fccbf5fcde
+7b77219e9549fad49e97c380f7e1f362
+053f4e89ae2355c5cb259d21e85eb9cd
+fc45c5118f642cc479e6a550756f1a4e
+0138351089a87a2ddc2d98255ce6b8cc
+1f3e42daa4b315f2a0e6a530e0cc6976
+aec4974f238a6e04dcb07e20ad861230
+7a27fedaeec41b5832bda3169d76cd05
+154bd1371ae66ad3ab9a9ee6b1324e36
+a4594c9e974eed1fc159cc306dd7378a
+431acd1a4a4d6036057c9906da8add5e
+f6afe47bdedf075c7e188b2640152cf7
+8bc3bd8625778f64ed7c29698025f292
+51f6bb4db8e6e61cc4333450c6035139
+0baff1c675866bf259d3ac9417a33464
+6e8a56a9a005c6c6239ccbdf48f59aa8
+6565bceb49f962f797f49084f3f819a1
+2267037a7f3e753c653218fcf67ce9c7
+aca1ae6237f498986991565b0307f0da
+785bb09a5f25730a3aed4de12da4d9ea
+4eb5472f4e5243fcd4a76533789e829a
+7d725ae9a8e569f49c56194226b64dee
+7396f5d4491e79ec1ac0ce7a105bb233
+aa64644a4877da34e2197c5f2dc375c5
+2165718fc24bf21f1c4e0623c8e8d811
+e1f45852024724f00ced7935e297983a
+deac06cde1f6b18a53a2cf0b03998da2
+8371f0970efbc6099c50afbbd4f0e477
+985d909280bc20607f4cb4941ae535f2
+abcdd18a791546544b52c0587dbd6107
+23e8b5a657c962a3e77979859ae1400e
+cc4fab29cc180ffa888be396ce6aa6f5
+b553506daedf701ccdc437fbf3e6bbe4
+d707ae093ab94607010ddda09fc8a5a8
+76bdae04521ba996636c4dc431040031
+556c14fd0f3ff7bd6b435bd630e48811
+b500501957d4b8b412ea0102c842dd5e
+d18506a74c66e4d8537269c10c783923
+c9b4b691f4d88b7d2b4d5b770b05c8bf
+ba915c678f944fe5a480364ddc3382a8
+78134c91a1ffb2e21594daa2c2a932fc
+6fc6c8790dfc301ee38b8b63e18def5c