meteor-node-stubs 1.2.4 → 1.2.6

package/node_modules/is-typed-array/test/index.js

@@ -1,104 +0,0 @@
-'use strict';
-
-var test = require('tape');
-var isTypedArray = require('../');
-var isCallable = require('is-callable');
-var hasSymbols = typeof Symbol === 'function' && typeof Symbol('foo') === 'symbol';
-var generators = require('make-generator-function')();
-var arrowFn = require('make-arrow-function')();
-var forEach = require('foreach');
-var inspect = require('object-inspect');
-
-var typedArrayNames = [
-	'Int8Array',
-	'Uint8Array',
-	'Uint8ClampedArray',
-	'Int16Array',
-	'Uint16Array',
-	'Int32Array',
-	'Uint32Array',
-	'Float32Array',
-	'Float64Array',
-	'BigInt64Array',
-	'BigUint64Array'
-];
-
-test('not arrays', function (t) {
-	t.test('non-number/string primitives', function (st) {
-		st.notOk(isTypedArray(), 'undefined is not typed array');
-		st.notOk(isTypedArray(null), 'null is not typed array');
-		st.notOk(isTypedArray(false), 'false is not typed array');
-		st.notOk(isTypedArray(true), 'true is not typed array');
-		st.end();
-	});
-
-	t.notOk(isTypedArray({}), 'object is not typed array');
-	t.notOk(isTypedArray(/a/g), 'regex literal is not typed array');
-	// eslint-disable-next-line prefer-regex-literals
-	t.notOk(isTypedArray(new RegExp('a', 'g')), 'regex object is not typed array');
-	t.notOk(isTypedArray(new Date()), 'new Date() is not typed array');
-
-	t.test('numbers', function (st) {
-		st.notOk(isTypedArray(42), 'number is not typed array');
-		st.notOk(isTypedArray(Object(42)), 'number object is not typed array');
-		st.notOk(isTypedArray(NaN), 'NaN is not typed array');
-		st.notOk(isTypedArray(Infinity), 'Infinity is not typed array');
-		st.end();
-	});
-
-	t.test('strings', function (st) {
-		st.notOk(isTypedArray('foo'), 'string primitive is not typed array');
-		st.notOk(isTypedArray(Object('foo')), 'string object is not typed array');
-		st.end();
-	});
-
-	t.end();
-});
-
-test('Functions', function (t) {
-	t.notOk(isTypedArray(function () {}), 'function is not typed array');
-	t.end();
-});
-
-test('Generators', { skip: generators.length === 0 }, function (t) {
-	forEach(generators, function (genFn) {
-		t.notOk(isTypedArray(genFn), 'generator function ' + inspect(genFn) + ' is not typed array');
-	});
-	t.end();
-});
-
-test('Arrow functions', { skip: !arrowFn }, function (t) {
-	t.notOk(isTypedArray(arrowFn), 'arrow function is not typed array');
-	t.end();
-});
-
-test('@@toStringTag', { skip: !hasSymbols || !Symbol.toStringTag }, function (t) {
-	forEach(typedArrayNames, function (typedArray) {
-		if (typeof global[typedArray] === 'function') {
-			var fakeTypedArray = [];
-			fakeTypedArray[Symbol.toStringTag] = typedArray;
-			t.notOk(isTypedArray(fakeTypedArray), 'faked ' + typedArray + ' is not typed array');
-		} else {
-			t.comment('# SKIP ' + typedArray + ' is not supported');
-		}
-	});
-	t.end();
-});
-
-test('non-Typed Arrays', function (t) {
-	t.notOk(isTypedArray([]), '[] is not typed array');
-	t.end();
-});
-
-test('Typed Arrays', function (t) {
-	forEach(typedArrayNames, function (typedArray) {
-		var TypedArray = global[typedArray];
-		if (isCallable(TypedArray)) {
-			var arr = new TypedArray(10);
-			t.ok(isTypedArray(arr), 'new ' + typedArray + '(10) is typed array');
-		} else {
-			t.comment('# SKIP ' + typedArray + ' is not supported');
-		}
-	});
-	t.end();
-});

package/node_modules/md5.js/LICENSE

@@ -1,21 +0,0 @@
-The MIT License (MIT)
-
-Copyright (c) 2016 Kirill Fomichev
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in
-all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-THE SOFTWARE.

package/node_modules/md5.js/README.md

@@ -1,29 +0,0 @@
-# md5.js
-
-[![NPM Package](https://img.shields.io/npm/v/md5.js.svg?style=flat-square)](https://www.npmjs.org/package/md5.js)
-[![Build Status](https://img.shields.io/travis/crypto-browserify/md5.js.svg?branch=master&style=flat-square)](https://travis-ci.org/crypto-browserify/md5.js)
-[![Dependency status](https://img.shields.io/david/crypto-browserify/md5.js.svg?style=flat-square)](https://david-dm.org/crypto-browserify/md5.js#info=dependencies)
-
-[![js-standard-style](https://cdn.rawgit.com/feross/standard/master/badge.svg)](https://github.com/feross/standard)
-
-Node style `md5` on pure JavaScript.
-
-From [NIST SP 800-131A][1]: *md5 is no longer acceptable where collision resistance is required such as digital signatures.*
-
-## Example
-
-```js
-var MD5 = require('md5.js')
-
-console.log(new MD5().update('42').digest('hex'))
-// => a1d0c6e83f027327d8461063f4ac58a6
-
-var md5stream = new MD5()
-md5stream.end('42')
-console.log(md5stream.read().toString('hex'))
-// => a1d0c6e83f027327d8461063f4ac58a6
-```
-
-## LICENSE [MIT](LICENSE)
-
-[1]: http://nvlpubs.nist.gov/nistpubs/SpecialPublications/NIST.SP.800-131Ar1.pdf

package/node_modules/md5.js/index.js

@@ -1,146 +0,0 @@
-'use strict'
-var inherits = require('inherits')
-var HashBase = require('hash-base')
-var Buffer = require('safe-buffer').Buffer
-
-var ARRAY16 = new Array(16)
-
-function MD5 () {
-  HashBase.call(this, 64)
-
-  // state
-  this._a = 0x67452301
-  this._b = 0xefcdab89
-  this._c = 0x98badcfe
-  this._d = 0x10325476
-}
-
-inherits(MD5, HashBase)
-
-MD5.prototype._update = function () {
-  var M = ARRAY16
-  for (var i = 0; i < 16; ++i) M[i] = this._block.readInt32LE(i * 4)
-
-  var a = this._a
-  var b = this._b
-  var c = this._c
-  var d = this._d
-
-  a = fnF(a, b, c, d, M[0], 0xd76aa478, 7)
-  d = fnF(d, a, b, c, M[1], 0xe8c7b756, 12)
-  c = fnF(c, d, a, b, M[2], 0x242070db, 17)
-  b = fnF(b, c, d, a, M[3], 0xc1bdceee, 22)
-  a = fnF(a, b, c, d, M[4], 0xf57c0faf, 7)
-  d = fnF(d, a, b, c, M[5], 0x4787c62a, 12)
-  c = fnF(c, d, a, b, M[6], 0xa8304613, 17)
-  b = fnF(b, c, d, a, M[7], 0xfd469501, 22)
-  a = fnF(a, b, c, d, M[8], 0x698098d8, 7)
-  d = fnF(d, a, b, c, M[9], 0x8b44f7af, 12)
-  c = fnF(c, d, a, b, M[10], 0xffff5bb1, 17)
-  b = fnF(b, c, d, a, M[11], 0x895cd7be, 22)
-  a = fnF(a, b, c, d, M[12], 0x6b901122, 7)
-  d = fnF(d, a, b, c, M[13], 0xfd987193, 12)
-  c = fnF(c, d, a, b, M[14], 0xa679438e, 17)
-  b = fnF(b, c, d, a, M[15], 0x49b40821, 22)
-
-  a = fnG(a, b, c, d, M[1], 0xf61e2562, 5)
-  d = fnG(d, a, b, c, M[6], 0xc040b340, 9)
-  c = fnG(c, d, a, b, M[11], 0x265e5a51, 14)
-  b = fnG(b, c, d, a, M[0], 0xe9b6c7aa, 20)
-  a = fnG(a, b, c, d, M[5], 0xd62f105d, 5)
-  d = fnG(d, a, b, c, M[10], 0x02441453, 9)
-  c = fnG(c, d, a, b, M[15], 0xd8a1e681, 14)
-  b = fnG(b, c, d, a, M[4], 0xe7d3fbc8, 20)
-  a = fnG(a, b, c, d, M[9], 0x21e1cde6, 5)
-  d = fnG(d, a, b, c, M[14], 0xc33707d6, 9)
-  c = fnG(c, d, a, b, M[3], 0xf4d50d87, 14)
-  b = fnG(b, c, d, a, M[8], 0x455a14ed, 20)
-  a = fnG(a, b, c, d, M[13], 0xa9e3e905, 5)
-  d = fnG(d, a, b, c, M[2], 0xfcefa3f8, 9)
-  c = fnG(c, d, a, b, M[7], 0x676f02d9, 14)
-  b = fnG(b, c, d, a, M[12], 0x8d2a4c8a, 20)
-
-  a = fnH(a, b, c, d, M[5], 0xfffa3942, 4)
-  d = fnH(d, a, b, c, M[8], 0x8771f681, 11)
-  c = fnH(c, d, a, b, M[11], 0x6d9d6122, 16)
-  b = fnH(b, c, d, a, M[14], 0xfde5380c, 23)
-  a = fnH(a, b, c, d, M[1], 0xa4beea44, 4)
-  d = fnH(d, a, b, c, M[4], 0x4bdecfa9, 11)
-  c = fnH(c, d, a, b, M[7], 0xf6bb4b60, 16)
-  b = fnH(b, c, d, a, M[10], 0xbebfbc70, 23)
-  a = fnH(a, b, c, d, M[13], 0x289b7ec6, 4)
-  d = fnH(d, a, b, c, M[0], 0xeaa127fa, 11)
-  c = fnH(c, d, a, b, M[3], 0xd4ef3085, 16)
-  b = fnH(b, c, d, a, M[6], 0x04881d05, 23)
-  a = fnH(a, b, c, d, M[9], 0xd9d4d039, 4)
-  d = fnH(d, a, b, c, M[12], 0xe6db99e5, 11)
-  c = fnH(c, d, a, b, M[15], 0x1fa27cf8, 16)
-  b = fnH(b, c, d, a, M[2], 0xc4ac5665, 23)
-
-  a = fnI(a, b, c, d, M[0], 0xf4292244, 6)
-  d = fnI(d, a, b, c, M[7], 0x432aff97, 10)
-  c = fnI(c, d, a, b, M[14], 0xab9423a7, 15)
-  b = fnI(b, c, d, a, M[5], 0xfc93a039, 21)
-  a = fnI(a, b, c, d, M[12], 0x655b59c3, 6)
-  d = fnI(d, a, b, c, M[3], 0x8f0ccc92, 10)
-  c = fnI(c, d, a, b, M[10], 0xffeff47d, 15)
-  b = fnI(b, c, d, a, M[1], 0x85845dd1, 21)
-  a = fnI(a, b, c, d, M[8], 0x6fa87e4f, 6)
-  d = fnI(d, a, b, c, M[15], 0xfe2ce6e0, 10)
-  c = fnI(c, d, a, b, M[6], 0xa3014314, 15)
-  b = fnI(b, c, d, a, M[13], 0x4e0811a1, 21)
-  a = fnI(a, b, c, d, M[4], 0xf7537e82, 6)
-  d = fnI(d, a, b, c, M[11], 0xbd3af235, 10)
-  c = fnI(c, d, a, b, M[2], 0x2ad7d2bb, 15)
-  b = fnI(b, c, d, a, M[9], 0xeb86d391, 21)
-
-  this._a = (this._a + a) | 0
-  this._b = (this._b + b) | 0
-  this._c = (this._c + c) | 0
-  this._d = (this._d + d) | 0
-}
-
-MD5.prototype._digest = function () {
-  // create padding and handle blocks
-  this._block[this._blockOffset++] = 0x80
-  if (this._blockOffset > 56) {
-    this._block.fill(0, this._blockOffset, 64)
-    this._update()
-    this._blockOffset = 0
-  }
-
-  this._block.fill(0, this._blockOffset, 56)
-  this._block.writeUInt32LE(this._length[0], 56)
-  this._block.writeUInt32LE(this._length[1], 60)
-  this._update()
-
-  // produce result
-  var buffer = Buffer.allocUnsafe(16)
-  buffer.writeInt32LE(this._a, 0)
-  buffer.writeInt32LE(this._b, 4)
-  buffer.writeInt32LE(this._c, 8)
-  buffer.writeInt32LE(this._d, 12)
-  return buffer
-}
-
-function rotl (x, n) {
-  return (x << n) | (x >>> (32 - n))
-}
-
-function fnF (a, b, c, d, m, k, s) {
-  return (rotl((a + ((b & c) | ((~b) & d)) + m + k) | 0, s) + b) | 0
-}
-
-function fnG (a, b, c, d, m, k, s) {
-  return (rotl((a + ((b & d) | (c & (~d))) + m + k) | 0, s) + b) | 0
-}
-
-function fnH (a, b, c, d, m, k, s) {
-  return (rotl((a + (b ^ c ^ d) + m + k) | 0, s) + b) | 0
-}
-
-function fnI (a, b, c, d, m, k, s) {
-  return (rotl((a + ((c ^ (b | (~d)))) + m + k) | 0, s) + b) | 0
-}
-
-module.exports = MD5

package/node_modules/md5.js/package.json

@@ -1,71 +0,0 @@
-{
-  "_args": [
-    [
-      "md5.js@1.3.5",
-      "/home/denyhs/Documents/work/meteor/meteor/npm-packages/meteor-node-stubs"
-    ]
-  ],
-  "_from": "md5.js@1.3.5",
-  "_id": "md5.js@1.3.5",
-  "_inBundle": false,
-  "_integrity": "sha512-xitP+WxNPcTTOgnTJcrhM0xvdPepipPSf3I8EIpGKeFLjt3PlJLIDG3u8EX53ZIubkb+5U2+3rELYpEhHhzdkg==",
-  "_location": "/md5.js",
-  "_phantomChildren": {},
-  "_requested": {
-    "type": "version",
-    "registry": true,
-    "raw": "md5.js@1.3.5",
-    "name": "md5.js",
-    "escapedName": "md5.js",
-    "rawSpec": "1.3.5",
-    "saveSpec": null,
-    "fetchSpec": "1.3.5"
-  },
-  "_requiredBy": [
-    "/create-hash",
-    "/evp_bytestokey"
-  ],
-  "_resolved": "https://registry.npmjs.org/md5.js/-/md5.js-1.3.5.tgz",
-  "_spec": "1.3.5",
-  "_where": "/home/denyhs/Documents/work/meteor/meteor/npm-packages/meteor-node-stubs",
-  "author": {
-    "name": "Kirill Fomichev",
-    "email": "fanatid@ya.ru",
-    "url": "https://github.com/fanatid"
-  },
-  "bugs": {
-    "url": "https://github.com/crypto-browserify/md5.js/issues"
-  },
-  "dependencies": {
-    "hash-base": "^3.0.0",
-    "inherits": "^2.0.1",
-    "safe-buffer": "^5.1.2"
-  },
-  "description": "node style md5 on pure JavaScript",
-  "devDependencies": {
-    "hash-test-vectors": "^1.3.2",
-    "standard": "^7.0.0",
-    "tape": "^4.2.0"
-  },
-  "files": [
-    "index.js"
-  ],
-  "homepage": "https://github.com/crypto-browserify/md5.js",
-  "keywords": [
-    "crypto",
-    "md5"
-  ],
-  "license": "MIT",
-  "main": "index.js",
-  "name": "md5.js",
-  "repository": {
-    "type": "git",
-    "url": "git+https://github.com/crypto-browserify/md5.js.git"
-  },
-  "scripts": {
-    "lint": "standard",
-    "test": "npm run lint && npm run unit",
-    "unit": "node test/*.js"
-  },
-  "version": "1.3.5"
-}

package/node_modules/miller-rabin/.npmignore

@@ -1,2 +0,0 @@
-node_modules/
-npm-debug.log

package/node_modules/miller-rabin/1.js

@@ -1,7 +0,0 @@
-'use strict';
-
-const BN = require('bn.js');
-
-const p = new BN('2e1b162f326430f5ac6af10f96b2a8350e01675d22324c9f', 'hex');
-
-console.log(p.bitLength());

package/node_modules/miller-rabin/README.md

@@ -1,26 +0,0 @@
-# Miller-Rabin
-
-#### LICENSE
-
-This software is licensed under the MIT License.
-
-Copyright Fedor Indutny, 2014.
-
-Permission is hereby granted, free of charge, to any person obtaining a
-copy of this software and associated documentation files (the
-"Software"), to deal in the Software without restriction, including
-without limitation the rights to use, copy, modify, merge, publish,
-distribute, sublicense, and/or sell copies of the Software, and to permit
-persons to whom the Software is furnished to do so, subject to the
-following conditions:
-
-The above copyright notice and this permission notice shall be included
-in all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
-OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
-MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
-NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
-DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
-OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
-USE OR OTHER DEALINGS IN THE SOFTWARE.

package/node_modules/miller-rabin/bin/miller-rabin

@@ -1,29 +0,0 @@
-#!/usr/bin/env node
-var bn = require('bn.js');
-var fs = require('fs');
-var mr = require('../').create();
-
-var num = '';
-if (process.argv[2]) {
-  num += fs.readFileSync(process.argv[2]);
-  start(num);
-} else {
-  process.stdin.on('data', function(chunk) {
-    num += chunk.toString().replace(/[^0-9a-f]/gi, '');
-  });
-  process.stdin.once('end', function() {
-    start(num);
-  });
-}
-
-function start(text) {
-  var num = new bn(text, 16);
-
-  var divisor = mr.getDivisor(num);
-  if (!divisor)
-    process.exit(1);
-  if (divisor.cmpn(1) === 0)
-    process.exit(0);
-
-  console.log(divisor.toString(16));
-}

package/node_modules/miller-rabin/lib/mr.js

@@ -1,115 +0,0 @@
-var bn = require('bn.js');
-var brorand = require('brorand');
-
-function MillerRabin(rand) {
-  this.rand = rand || new brorand.Rand();
-}
-module.exports = MillerRabin;
-
-MillerRabin.create = function create(rand) {
-  return new MillerRabin(rand);
-};
-
-MillerRabin.prototype._randbelow = function _randbelow(n) {
-  var len = n.bitLength();
-  var min_bytes = Math.ceil(len / 8);
-
-  // Generage random bytes until a number less than n is found.
-  // This ensures that 0..n-1 have an equal probability of being selected.
-  do
-    var a = new bn(this.rand.generate(min_bytes));
-  while (a.cmp(n) >= 0);
-
-  return a;
-};
-
-MillerRabin.prototype._randrange = function _randrange(start, stop) {
-  // Generate a random number greater than or equal to start and less than stop.
-  var size = stop.sub(start);
-  return start.add(this._randbelow(size));
-};
-
-MillerRabin.prototype.test = function test(n, k, cb) {
-  var len = n.bitLength();
-  var red = bn.mont(n);
-  var rone = new bn(1).toRed(red);
-
-  if (!k)
-    k = Math.max(1, (len / 48) | 0);
-
-  // Find d and s, (n - 1) = (2 ^ s) * d;
-  var n1 = n.subn(1);
-  for (var s = 0; !n1.testn(s); s++) {}
-  var d = n.shrn(s);
-
-  var rn1 = n1.toRed(red);
-
-  var prime = true;
-  for (; k > 0; k--) {
-    var a = this._randrange(new bn(2), n1);
-    if (cb)
-      cb(a);
-
-    var x = a.toRed(red).redPow(d);
-    if (x.cmp(rone) === 0 || x.cmp(rn1) === 0)
-      continue;
-
-    for (var i = 1; i < s; i++) {
-      x = x.redSqr();
-
-      if (x.cmp(rone) === 0)
-        return false;
-      if (x.cmp(rn1) === 0)
-        break;
-    }
-
-    if (i === s)
-      return false;
-  }
-
-  return prime;
-};
-
-MillerRabin.prototype.getDivisor = function getDivisor(n, k) {
-  var len = n.bitLength();
-  var red = bn.mont(n);
-  var rone = new bn(1).toRed(red);
-
-  if (!k)
-    k = Math.max(1, (len / 48) | 0);
-
-  // Find d and s, (n - 1) = (2 ^ s) * d;
-  var n1 = n.subn(1);
-  for (var s = 0; !n1.testn(s); s++) {}
-  var d = n.shrn(s);
-
-  var rn1 = n1.toRed(red);
-
-  for (; k > 0; k--) {
-    var a = this._randrange(new bn(2), n1);
-
-    var g = n.gcd(a);
-    if (g.cmpn(1) !== 0)
-      return g;
-
-    var x = a.toRed(red).redPow(d);
-    if (x.cmp(rone) === 0 || x.cmp(rn1) === 0)
-      continue;
-
-    for (var i = 1; i < s; i++) {
-      x = x.redSqr();
-
-      if (x.cmp(rone) === 0)
-        return x.fromRed().subn(1).gcd(n);
-      if (x.cmp(rn1) === 0)
-        break;
-    }
-
-    if (i === s) {
-      x = x.redSqr();
-      return x.fromRed().subn(1).gcd(n);
-    }
-  }
-
-  return false;
-};

package/node_modules/miller-rabin/node_modules/bn.js/LICENSE

@@ -1,19 +0,0 @@
-Copyright Fedor Indutny, 2015.
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.