fsevents 1.0.12 → 1.0.14

package/node_modules/aws4/node_modules/lru-cache/node_modules/pseudomap/test/basic.js

@@ -1,86 +0,0 @@
-var t = require('tap')
-
-process.env.TEST_PSEUDOMAP = 'true'
-
-var PM = require('../')
-runTests(PM)
-
-// if possible, verify that Map also behaves the same way
-if (typeof Map === 'function')
-  runTests(Map)
-
-
-function runTests (Map) {
-  t.throws(Map)
-
-  var m = new Map()
-
-  t.equal(m.size, 0)
-
-  m.set(1, '1 string')
-  t.equal(m.get(1), '1 string')
-  t.equal(m.size, 1)
-  m.size = 1000
-  t.equal(m.size, 1)
-  m.size = 0
-  t.equal(m.size, 1)
-
-  m = new Map([[1, 'number 1'], ['1', 'string 1']])
-  t.equal(m.get(1), 'number 1')
-  t.equal(m.get('1'), 'string 1')
-  t.equal(m.size, 2)
-
-  m = new Map(m)
-  t.equal(m.get(1), 'number 1')
-  t.equal(m.get('1'), 'string 1')
-  t.equal(m.size, 2)
-
-  var akey = {}
-  var bkey = {}
-  m.set(akey, { some: 'data' })
-  m.set(bkey, { some: 'other data' })
-  t.same(m.get(akey), { some: 'data' })
-  t.same(m.get(bkey), { some: 'other data' })
-  t.equal(m.size, 4)
-
-  var x = /x/
-  var y = /x/
-  m.set(x, 'x regex')
-  m.set(y, 'y regex')
-  t.equal(m.get(x), 'x regex')
-  m.set(x, 'x again')
-  t.equal(m.get(x), 'x again')
-  t.equal(m.size, 6)
-
-  m.set(NaN, 'not a number')
-  t.equal(m.get(NaN), 'not a number')
-  m.set(NaN, 'it is a ' + typeof NaN)
-  t.equal(m.get(NaN), 'it is a number')
-  m.set('NaN', 'stringie nan')
-  t.equal(m.get(NaN), 'it is a number')
-  t.equal(m.get('NaN'), 'stringie nan')
-  t.equal(m.size, 8)
-
-  m.delete(NaN)
-  t.equal(m.get(NaN), undefined)
-  t.equal(m.size, 7)
-
-  var expect = [
-    { value: 'number 1', key: 1 },
-    { value: 'string 1', key: '1' },
-    { value: { some: 'data' }, key: {} },
-    { value: { some: 'other data' }, key: {} },
-    { value: 'x again', key: /x/ },
-    { value: 'y regex', key: /x/ },
-    { value: 'stringie nan', key: 'NaN' }
-  ]
-  var actual = []
-
-  m.forEach(function (value, key) {
-    actual.push({ value: value, key: key })
-  })
-  t.same(actual, expect)
-
-  m.clear()
-  t.equal(m.size, 0)
-}

package/node_modules/aws4/node_modules/lru-cache/node_modules/yallist/.npmignore

@@ -1,4 +0,0 @@
-node_modules/
-coverage/
-.nyc_output/
-nyc_output/

package/node_modules/aws4/node_modules/lru-cache/node_modules/yallist/.travis.yml

@@ -1,7 +0,0 @@
-sudo: false
-language: node_js
-node_js:
-  - '0.10'
-  - '0.12'
-  - '4'
-  - '5'

package/node_modules/aws4/node_modules/lru-cache/node_modules/yallist/CONTRIBUTING.md

@@ -1,4 +0,0 @@
-1. The whole API is public.  No underscore-prefixed pretend-private
-   things or hidden Object.create magic mumbo jumbo here.  Plain old
-   objects that are created from constructors.
-2. 100% test coverage must be maintained.

package/node_modules/aws4/node_modules/lru-cache/node_modules/yallist/README.md

@@ -1,204 +0,0 @@
-# yallist
-
-Yet Another Linked List
-
-There are many doubly-linked list implementations like it, but this
-one is mine.
-
-For when an array would be too big, and a Map can't be iterated in
-reverse order.
-
-
-[![Build Status](https://travis-ci.org/isaacs/yallist.svg?branch=master)](https://travis-ci.org/isaacs/yallist) [![Coverage Status](https://coveralls.io/repos/isaacs/yallist/badge.svg?service=github)](https://coveralls.io/github/isaacs/yallist)
-
-## basic usage
-
-```javascript
-var yallist = require('yallist')
-var myList = yallist.create([1, 2, 3])
-myList.push('foo')
-myList.unshift('bar')
-// of course pop() and shift() are there, too
-console.log(myList.toArray()) // ['bar', 1, 2, 3, 'foo']
-myList.forEach(function (k) {
-  // walk the list head to tail
-})
-myList.forEachReverse(function (k, index, list) {
-  // walk the list tail to head
-})
-var myDoubledList = myList.map(function (k) {
-  return k + k
-})
-// now myDoubledList contains ['barbar', 2, 4, 6, 'foofoo']
-// mapReverse is also a thing
-var myDoubledListReverse = myList.mapReverse(function (k) {
-  return k + k
-}) // ['foofoo', 6, 4, 2, 'barbar']
-
-var reduced = myList.reduce(function (set, entry) {
-  set += entry
-  return set
-}, 'start')
-console.log(reduced) // 'startfoo123bar'
-```
-
-## api
-
-The whole API is considered "public".
-
-Functions with the same name as an Array method work more or less the
-same way.
-
-There's reverse versions of most things because that's the point.
-
-### Yallist
-
-Default export, the class that holds and manages a list.
-
-Call it with either a forEach-able (like an array) or a set of
-arguments, to initialize the list.
-
-The Array-ish methods all act like you'd expect.  No magic length,
-though, so if you change that it won't automatically prune or add
-empty spots.
-
-### Yallist.create(..)
-
-Alias for Yallist function.  Some people like factories.
-
-#### yallist.head
-
-The first node in the list
-
-#### yallist.tail
-
-The last node in the list
-
-#### yallist.length
-
-The number of nodes in the list.  (Change this at your peril.  It is
-not magic like Array length.)
-
-#### yallist.toArray()
-
-Convert the list to an array.
-
-#### yallist.forEach(fn, [thisp])
-
-Call a function on each item in the list.
-
-#### yallist.forEachReverse(fn, [thisp])
-
-Call a function on each item in the list, in reverse order.
-
-#### yallist.get(n)
-
-Get the data at position `n` in the list.  If you use this a lot,
-probably better off just using an Array.
-
-#### yallist.getReverse(n)
-
-Get the data at position `n`, counting from the tail.
-
-#### yallist.map(fn, thisp)
-
-Create a new Yallist with the result of calling the function on each
-item.
-
-#### yallist.mapReverse(fn, thisp)
-
-Same as `map`, but in reverse.
-
-#### yallist.pop()
-
-Get the data from the list tail, and remove the tail from the list.
-
-#### yallist.push(item, ...)
-
-Insert one or more items to the tail of the list.
-
-#### yallist.reduce(fn, initialValue)
-
-Like Array.reduce.
-
-#### yallist.reduceReverse
-
-Like Array.reduce, but in reverse.
-
-#### yallist.reverse
-
-Reverse the list in place.
-
-#### yallist.shift()
-
-Get the data from the list head, and remove the head from the list.
-
-#### yallist.slice([from], [to])
-
-Just like Array.slice, but returns a new Yallist.
-
-#### yallist.sliceReverse([from], [to])
-
-Just like yallist.slice, but the result is returned in reverse.
-
-#### yallist.toArray()
-
-Create an array representation of the list.
-
-#### yallist.toArrayReverse()
-
-Create a reversed array representation of the list.
-
-#### yallist.unshift(item, ...)
-
-Insert one or more items to the head of the list.
-
-#### yallist.unshiftNode(node)
-
-Move a Node object to the front of the list.  (That is, pull it out of
-wherever it lives, and make it the new head.)
-
-If the node belongs to a different list, then that list will remove it
-first.
-
-#### yallist.pushNode(node)
-
-Move a Node object to the end of the list.  (That is, pull it out of
-wherever it lives, and make it the new tail.)
-
-If the node belongs to a list already, then that list will remove it
-first.
-
-#### yallist.removeNode(node)
-
-Remove a node from the list, preserving referential integrity of head
-and tail and other nodes.
-
-Will throw an error if you try to have a list remove a node that
-doesn't belong to it.
-
-### Yallist.Node
-
-The class that holds the data and is actually the list.
-
-Call with `var n = new Node(value, previousNode, nextNode)`
-
-Note that if you do direct operations on Nodes themselves, it's very
-easy to get into weird states where the list is broken.  Be careful :)
-
-#### node.next
-
-The next node in the list.
-
-#### node.prev
-
-The previous node in the list.
-
-#### node.value
-
-The data the node contains.
-
-#### node.list
-
-The list to which this node belongs.  (Null if it does not belong to
-any list.)

package/node_modules/aws4/node_modules/lru-cache/node_modules/yallist/package.json

@@ -1,60 +0,0 @@
-{
-  "_from": "yallist@^2.0.0",
-  "_id": "yallist@2.0.0",
-  "_location": "/aws4/lru-cache/yallist",
-  "_nodeVersion": "4.0.0",
-  "_npmUser": {
-    "email": "i@izs.me",
-    "name": "isaacs"
-  },
-  "_npmVersion": "3.3.2",
-  "_phantomChildren": {},
-  "_requiredBy": [
-    "/aws4/lru-cache"
-  ],
-  "_resolved": "https://registry.npmjs.org/yallist/-/yallist-2.0.0.tgz",
-  "_shasum": "306c543835f09ee1a4cb23b7bce9ab341c91cdd4",
-  "_shrinkwrap": null,
-  "author": {
-    "email": "i@izs.me",
-    "name": "Isaac Z. Schlueter",
-    "url": "http://blog.izs.me/"
-  },
-  "bugs": {
-    "url": "https://github.com/isaacs/yallist/issues"
-  },
-  "dependencies": {},
-  "description": "Yet Another Linked List",
-  "devDependencies": {
-    "tap": "^2.3.2"
-  },
-  "directories": {
-    "test": "test"
-  },
-  "dist": {
-    "shasum": "306c543835f09ee1a4cb23b7bce9ab341c91cdd4",
-    "tarball": "http://registry.npmjs.org/yallist/-/yallist-2.0.0.tgz"
-  },
-  "gitHead": "702eaba87deefa9f8fc2f8e36cb225bc2141fdc3",
-  "homepage": "https://github.com/isaacs/yallist#readme",
-  "license": "ISC",
-  "main": "yallist.js",
-  "maintainers": [
-    {
-      "name": "isaacs",
-      "email": "i@izs.me"
-    }
-  ],
-  "name": "yallist",
-  "optionalDependencies": {},
-  "readme": "# yallist\n\nYet Another Linked List\n\nThere are many doubly-linked list implementations like it, but this\none is mine.\n\nFor when an array would be too big, and a Map can't be iterated in\nreverse order.\n\n\n[![Build Status](https://travis-ci.org/isaacs/yallist.svg?branch=master)](https://travis-ci.org/isaacs/yallist) [![Coverage Status](https://coveralls.io/repos/isaacs/yallist/badge.svg?service=github)](https://coveralls.io/github/isaacs/yallist)\n\n## basic usage\n\n```javascript\nvar yallist = require('yallist')\nvar myList = yallist.create([1, 2, 3])\nmyList.push('foo')\nmyList.unshift('bar')\n// of course pop() and shift() are there, too\nconsole.log(myList.toArray()) // ['bar', 1, 2, 3, 'foo']\nmyList.forEach(function (k) {\n  // walk the list head to tail\n})\nmyList.forEachReverse(function (k, index, list) {\n  // walk the list tail to head\n})\nvar myDoubledList = myList.map(function (k) {\n  return k + k\n})\n// now myDoubledList contains ['barbar', 2, 4, 6, 'foofoo']\n// mapReverse is also a thing\nvar myDoubledListReverse = myList.mapReverse(function (k) {\n  return k + k\n}) // ['foofoo', 6, 4, 2, 'barbar']\n\nvar reduced = myList.reduce(function (set, entry) {\n  set += entry\n  return set\n}, 'start')\nconsole.log(reduced) // 'startfoo123bar'\n```\n\n## api\n\nThe whole API is considered \"public\".\n\nFunctions with the same name as an Array method work more or less the\nsame way.\n\nThere's reverse versions of most things because that's the point.\n\n### Yallist\n\nDefault export, the class that holds and manages a list.\n\nCall it with either a forEach-able (like an array) or a set of\narguments, to initialize the list.\n\nThe Array-ish methods all act like you'd expect.  No magic length,\nthough, so if you change that it won't automatically prune or add\nempty spots.\n\n### Yallist.create(..)\n\nAlias for Yallist function.  Some people like factories.\n\n#### yallist.head\n\nThe first node in the list\n\n#### yallist.tail\n\nThe last node in the list\n\n#### yallist.length\n\nThe number of nodes in the list.  (Change this at your peril.  It is\nnot magic like Array length.)\n\n#### yallist.toArray()\n\nConvert the list to an array.\n\n#### yallist.forEach(fn, [thisp])\n\nCall a function on each item in the list.\n\n#### yallist.forEachReverse(fn, [thisp])\n\nCall a function on each item in the list, in reverse order.\n\n#### yallist.get(n)\n\nGet the data at position `n` in the list.  If you use this a lot,\nprobably better off just using an Array.\n\n#### yallist.getReverse(n)\n\nGet the data at position `n`, counting from the tail.\n\n#### yallist.map(fn, thisp)\n\nCreate a new Yallist with the result of calling the function on each\nitem.\n\n#### yallist.mapReverse(fn, thisp)\n\nSame as `map`, but in reverse.\n\n#### yallist.pop()\n\nGet the data from the list tail, and remove the tail from the list.\n\n#### yallist.push(item, ...)\n\nInsert one or more items to the tail of the list.\n\n#### yallist.reduce(fn, initialValue)\n\nLike Array.reduce.\n\n#### yallist.reduceReverse\n\nLike Array.reduce, but in reverse.\n\n#### yallist.reverse\n\nReverse the list in place.\n\n#### yallist.shift()\n\nGet the data from the list head, and remove the head from the list.\n\n#### yallist.slice([from], [to])\n\nJust like Array.slice, but returns a new Yallist.\n\n#### yallist.sliceReverse([from], [to])\n\nJust like yallist.slice, but the result is returned in reverse.\n\n#### yallist.toArray()\n\nCreate an array representation of the list.\n\n#### yallist.toArrayReverse()\n\nCreate a reversed array representation of the list.\n\n#### yallist.unshift(item, ...)\n\nInsert one or more items to the head of the list.\n\n#### yallist.unshiftNode(node)\n\nMove a Node object to the front of the list.  (That is, pull it out of\nwherever it lives, and make it the new head.)\n\nIf the node belongs to a different list, then that list will remove it\nfirst.\n\n#### yallist.pushNode(node)\n\nMove a Node object to the end of the list.  (That is, pull it out of\nwherever it lives, and make it the new tail.)\n\nIf the node belongs to a list already, then that list will remove it\nfirst.\n\n#### yallist.removeNode(node)\n\nRemove a node from the list, preserving referential integrity of head\nand tail and other nodes.\n\nWill throw an error if you try to have a list remove a node that\ndoesn't belong to it.\n\n### Yallist.Node\n\nThe class that holds the data and is actually the list.\n\nCall with `var n = new Node(value, previousNode, nextNode)`\n\nNote that if you do direct operations on Nodes themselves, it's very\neasy to get into weird states where the list is broken.  Be careful :)\n\n#### node.next\n\nThe next node in the list.\n\n#### node.prev\n\nThe previous node in the list.\n\n#### node.value\n\nThe data the node contains.\n\n#### node.list\n\nThe list to which this node belongs.  (Null if it does not belong to\nany list.)\n",
-  "readmeFilename": "README.md",
-  "repository": {
-    "type": "git",
-    "url": "git+https://github.com/isaacs/yallist.git"
-  },
-  "scripts": {
-    "test": "tap test/*.js --cov"
-  },
-  "version": "2.0.0"
-}

package/node_modules/aws4/node_modules/lru-cache/node_modules/yallist/test/basic.js

@@ -1,188 +0,0 @@
-var t  = require('tap')
-var Yallist = require('../yallist.js')
-
-var y = new Yallist(1,2,3,4,5)
-var z = new Yallist([1,2,3,4,5])
-t.similar(y, z, 'build from single list or args')
-
-function add10 (i) {
-  return i + 10
-}
-t.similar(y.map(add10).toArray(), [11, 12, 13, 14, 15])
-t.similar(y.mapReverse(add10).toArray(), [15, 14, 13, 12, 11])
-
-t.similar(y.map(add10).toArrayReverse(), [15, 14, 13, 12, 11])
-t.isa(Yallist(1,2,3), 'Yallist')
-t.equal(y.push(6, 7, 8), 8)
-t.similar(y.toArray(), [1, 2, 3, 4, 5, 6, 7, 8])
-y.pop()
-y.shift()
-y.unshift(100)
-
-var expect = [100, 2, 3, 4, 5, 6, 7]
-var expectReverse = [ 7, 6, 5, 4, 3, 2, 100 ]
-
-t.similar(y.toArray(), expect)
-t.equal(y.length, y.toArray().length)
-
-t.test(function forEach (t) {
-  t.plan(y.length * 2)
-  y.forEach(function (item, i, list) {
-    t.equal(item, expect[i])
-    t.equal(list, y)
-  })
-})
-
-t.test(function forEach (t) {
-  t.plan(y.length * 5)
-  var n = 0
-  y.forEachReverse(function (item, i, list) {
-    t.equal(item, expectReverse[n])
-    t.equal(item, expect[i])
-    t.equal(item, y.get(i))
-    t.equal(item, y.getReverse(n))
-    n += 1
-    t.equal(list, y)
-  })
-})
-
-t.equal(y.getReverse(100), undefined)
-
-t.equal(y.get(9999), undefined)
-
-
-function sum (a, b) { return a + b }
-t.equal(y.reduce(sum), 127)
-t.equal(y.reduce(sum, 100), 227)
-t.equal(y.reduceReverse(sum), 127)
-t.equal(y.reduceReverse(sum, 100), 227)
-
-t.equal(Yallist().pop(), undefined)
-t.equal(Yallist().shift(), undefined)
-
-var x = Yallist()
-x.unshift(1)
-t.equal(x.length, 1)
-t.similar(x.toArray(), [1])
-
-// verify that y.toArray() returns an array and if we create a
-// new Yallist from that array, we get a list matching 
-t.similar(Yallist(y.toArray()), y)
-t.similar(Yallist.apply(null, y.toArray()), y)
-
-t.throws(function () {
-  new Yallist().reduce(function () {})
-}, {}, new TypeError('Reduce of empty list with no initial value'))
-t.throws(function () {
-  new Yallist().reduceReverse(function () {})
-}, {}, new TypeError('Reduce of empty list with no initial value'))
-
-var z = y.reverse()
-t.equal(z, y)
-t.similar(y.toArray(), expectReverse)
-y.reverse()
-t.similar(y.toArray(), expect)
-
-var a = Yallist(1,2,3,4,5,6)
-var cases = [
-  [ [2, 4], [3, 4] ],
-  [ [2, -4], [] ],
-  [ [2, -2], [3, 4] ],
-  [ [1, -2], [2, 3, 4] ],
-  [ [-1, -2], [] ],
-  [ [-5, -2], [2, 3, 4] ],
-  [ [-99, 2], [1, 2] ],
-  [ [5, 99], [6] ],
-  [ [], [1,2,3,4,5,6] ]
-]
-t.test('slice', function (t) {
-  t.plan(cases.length)
-  cases.forEach(function (c) {
-    t.test(JSON.stringify(c), function (t) {
-      t.similar(a.slice.apply(a, c[0]), Yallist(c[1]))
-      t.similar([].slice.apply(a.toArray(), c[0]), c[1])
-      t.end()
-    })
-  })
-})
-
-t.test('sliceReverse', function (t) {
-  t.plan(cases.length)
-  cases.forEach(function (c) {
-    var rev = c[1].slice().reverse()
-    t.test(JSON.stringify([c[0], rev]), function (t) {
-      t.similar(a.sliceReverse.apply(a, c[0]), Yallist(rev))
-      t.similar([].slice.apply(a.toArray(), c[0]).reverse(), rev)
-      t.end()
-    })
-  })
-})
-
-var inserter = Yallist(1,2,3,4,5)
-inserter.unshiftNode(inserter.head.next)
-t.similar(inserter.toArray(), [2,1,3,4,5])
-inserter.unshiftNode(inserter.tail)
-t.similar(inserter.toArray(), [5,2,1,3,4])
-inserter.unshiftNode(inserter.head)
-t.similar(inserter.toArray(), [5,2,1,3,4])
-
-var single = Yallist(1)
-single.unshiftNode(single.head)
-t.similar(single.toArray(), [1])
-
-inserter = Yallist(1,2,3,4,5)
-inserter.pushNode(inserter.tail.prev)
-t.similar(inserter.toArray(), [1,2,3,5,4])
-inserter.pushNode(inserter.head)
-t.similar(inserter.toArray(), [2,3,5,4,1])
-inserter.unshiftNode(inserter.head)
-t.similar(inserter.toArray(), [2,3,5,4,1])
-
-single = Yallist(1)
-single.pushNode(single.tail)
-t.similar(single.toArray(), [1])
-
-var swiped = Yallist(9,8,7)
-inserter.unshiftNode(swiped.head.next)
-t.similar(inserter.toArray(), [8,2,3,5,4,1])
-t.similar(swiped.toArray(), [9,7])
-
-swiped = Yallist(9,8,7)
-inserter.pushNode(swiped.head.next)
-t.similar(inserter.toArray(), [8,2,3,5,4,1,8])
-t.similar(swiped.toArray(), [9,7])
-
-swiped.unshiftNode(Yallist.Node(99))
-t.similar(swiped.toArray(), [99,9,7])
-swiped.pushNode(Yallist.Node(66))
-t.similar(swiped.toArray(), [99,9,7,66])
-
-var e = Yallist()
-e.unshiftNode(Yallist.Node(1))
-t.same(e.toArray(), [1])
-e = Yallist()
-e.pushNode(Yallist.Node(1))
-t.same(e.toArray(), [1])
-
-// steal them back, don't break the lists
-swiped.unshiftNode(inserter.head)
-t.same(swiped, Yallist(8,99,9,7,66))
-t.same(inserter, Yallist(2,3,5,4,1,8))
-swiped.unshiftNode(inserter.tail)
-t.same(inserter, Yallist(2,3,5,4,1))
-t.same(swiped, Yallist(8,8,99,9,7,66))
-
-
-t.throws(function remove_foreign_node () {
-  e.removeNode(swiped.head)
-}, {}, new Error('removing node which does not belong to this list'))
-t.throws(function remove_unlisted_node () {
-  e.removeNode(Yallist.Node('nope'))
-}, {}, new Error('removing node which does not belong to this list'))
-
-e = Yallist(1,2)
-e.removeNode(e.head)
-t.same(e, Yallist(2))
-e = Yallist(1,2)
-e.removeNode(e.tail)
-t.same(e, Yallist(1))