99 lines
7.2 KiB
JSON
99 lines
7.2 KiB
JSON
{
|
|
"_args": [
|
|
[
|
|
{
|
|
"raw": "yallist@^2.1.2",
|
|
"scope": null,
|
|
"escapedName": "yallist",
|
|
"name": "yallist",
|
|
"rawSpec": "^2.1.2",
|
|
"spec": ">=2.1.2 <3.0.0",
|
|
"type": "range"
|
|
},
|
|
"/home/jdaugherty/work/GT2/GT2-Android/node_modules/lru-cache"
|
|
]
|
|
],
|
|
"_from": "yallist@>=2.1.2 <3.0.0",
|
|
"_id": "yallist@2.1.2",
|
|
"_inCache": true,
|
|
"_location": "/yallist",
|
|
"_nodeVersion": "8.0.0-pre",
|
|
"_npmOperationalInternal": {
|
|
"host": "packages-12-west.internal.npmjs.com",
|
|
"tmp": "tmp/yallist-2.1.2.tgz_1489443365033_0.47744474792853"
|
|
},
|
|
"_npmUser": {
|
|
"name": "isaacs",
|
|
"email": "i@izs.me"
|
|
},
|
|
"_npmVersion": "4.3.0",
|
|
"_phantomChildren": {},
|
|
"_requested": {
|
|
"raw": "yallist@^2.1.2",
|
|
"scope": null,
|
|
"escapedName": "yallist",
|
|
"name": "yallist",
|
|
"rawSpec": "^2.1.2",
|
|
"spec": ">=2.1.2 <3.0.0",
|
|
"type": "range"
|
|
},
|
|
"_requiredBy": [
|
|
"/lru-cache",
|
|
"/lru-memoizer/lru-cache"
|
|
],
|
|
"_resolved": "https://registry.npmjs.org/yallist/-/yallist-2.1.2.tgz",
|
|
"_shasum": "1c11f9218f076089a47dd512f93c6699a6a81d52",
|
|
"_shrinkwrap": null,
|
|
"_spec": "yallist@^2.1.2",
|
|
"_where": "/home/jdaugherty/work/GT2/GT2-Android/node_modules/lru-cache",
|
|
"author": {
|
|
"name": "Isaac Z. Schlueter",
|
|
"email": "i@izs.me",
|
|
"url": "http://blog.izs.me/"
|
|
},
|
|
"bugs": {
|
|
"url": "https://github.com/isaacs/yallist/issues"
|
|
},
|
|
"dependencies": {},
|
|
"description": "Yet Another Linked List",
|
|
"devDependencies": {
|
|
"tap": "^10.3.0"
|
|
},
|
|
"directories": {
|
|
"test": "test"
|
|
},
|
|
"dist": {
|
|
"shasum": "1c11f9218f076089a47dd512f93c6699a6a81d52",
|
|
"tarball": "https://registry.npmjs.org/yallist/-/yallist-2.1.2.tgz"
|
|
},
|
|
"files": [
|
|
"yallist.js",
|
|
"iterator.js"
|
|
],
|
|
"gitHead": "566cd4cd1e2ce57ffa84e295981cd9aa72319391",
|
|
"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[](https://travis-ci.org/isaacs/yallist) [](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": {
|
|
"postpublish": "git push origin --all; git push origin --tags",
|
|
"postversion": "npm publish",
|
|
"preversion": "npm test",
|
|
"test": "tap test/*.js --100"
|
|
},
|
|
"version": "2.1.2"
|
|
}
|