105 lines
3.5 KiB
JSON
105 lines
3.5 KiB
JSON
{
|
|
"_args": [
|
|
[
|
|
{
|
|
"raw": "tiny-queue@^0.2.1",
|
|
"scope": null,
|
|
"escapedName": "tiny-queue",
|
|
"name": "tiny-queue",
|
|
"rawSpec": "^0.2.1",
|
|
"spec": ">=0.2.1 <0.3.0",
|
|
"type": "range"
|
|
},
|
|
"/home/jdaugherty/work/GT2/GT2-Android/node_modules/websql"
|
|
]
|
|
],
|
|
"_from": "tiny-queue@>=0.2.1 <0.3.0",
|
|
"_id": "tiny-queue@0.2.1",
|
|
"_inCache": true,
|
|
"_location": "/tiny-queue",
|
|
"_npmUser": {
|
|
"name": "nolanlawson",
|
|
"email": "nolan@nolanlawson.com"
|
|
},
|
|
"_npmVersion": "1.4.13",
|
|
"_phantomChildren": {},
|
|
"_requested": {
|
|
"raw": "tiny-queue@^0.2.1",
|
|
"scope": null,
|
|
"escapedName": "tiny-queue",
|
|
"name": "tiny-queue",
|
|
"rawSpec": "^0.2.1",
|
|
"spec": ">=0.2.1 <0.3.0",
|
|
"type": "range"
|
|
},
|
|
"_requiredBy": [
|
|
"/websql"
|
|
],
|
|
"_resolved": "https://registry.npmjs.org/tiny-queue/-/tiny-queue-0.2.1.tgz",
|
|
"_shasum": "25a67f2c6e253b2ca941977b5ef7442ef97a6046",
|
|
"_shrinkwrap": null,
|
|
"_spec": "tiny-queue@^0.2.1",
|
|
"_where": "/home/jdaugherty/work/GT2/GT2-Android/node_modules/websql",
|
|
"author": {
|
|
"name": "Nolan Lawson",
|
|
"email": "nolan.lawson@gmail.com"
|
|
},
|
|
"bugs": {
|
|
"url": "https://github.com/nolanlawson/tiny-queue/issues"
|
|
},
|
|
"dependencies": {},
|
|
"description": "Simple FIFO queue implementation to avoid having to do shift() on an array, which is slow.",
|
|
"devDependencies": {
|
|
"tape": "^2.13.1"
|
|
},
|
|
"directories": {},
|
|
"dist": {
|
|
"shasum": "25a67f2c6e253b2ca941977b5ef7442ef97a6046",
|
|
"tarball": "https://registry.npmjs.org/tiny-queue/-/tiny-queue-0.2.1.tgz"
|
|
},
|
|
"gitHead": "52efc6443d44ccbe460a5500992a91ae6f66e2cc",
|
|
"homepage": "https://github.com/nolanlawson/tiny-queue",
|
|
"keywords": [
|
|
"queue",
|
|
"fifo"
|
|
],
|
|
"license": "Apache 2",
|
|
"main": "index.js",
|
|
"maintainers": [
|
|
{
|
|
"name": "nolanlawson",
|
|
"email": "nolan@nolanlawson.com"
|
|
}
|
|
],
|
|
"name": "tiny-queue",
|
|
"optionalDependencies": {},
|
|
"readme": "tiny-queue\n============\n\nA simple FIFO queue implementation to avoid having to do `shift()`\non an array, which is slow. It's implemented in the straightforward `root -> node1 -> node2 -> etc.`\narchitecture that we all remember from CS 101.\n\nThis can typically be used as a drop-in replacement for an array, and it's only 38 lines of code.\n\n### Status\n\n[](https://ci.testling.com/nolanlawson/tiny-queue)\n\n### Usage\n\n```\nnpm install tiny-queue\n```\n\nThen:\n\n```js\nvar Queue = require('tiny-queue');\nvar queue = new Queue();\n\nqueue.push('foo');\nqueue.push('bar');\nqueue.shift(); // 'foo'\nqueue.shift(); //'bar'\nqueue.length; // 0\nqueue.shift(); // undefined\n```\n\n### API\n\nThe returned `Queue` object, once instantiated, only supports\nfour operations:\n\n```js\nqueue.push()\nqueue.shift()\nqueue.slice() // returns a regular Array\nqueue.length\n```\n\nSo it's basically a drop-in replacement for most naïve usages\nof an array as a queue.\n",
|
|
"readmeFilename": "README.md",
|
|
"repository": {
|
|
"type": "git",
|
|
"url": "git+https://github.com/nolanlawson/tiny-queue.git"
|
|
},
|
|
"scripts": {
|
|
"test": "tape test.js"
|
|
},
|
|
"testling": {
|
|
"files": [
|
|
"test.js"
|
|
],
|
|
"browsers": [
|
|
"iexplore/8..latest",
|
|
"chrome/22..latest",
|
|
"chrome/canary",
|
|
"firefox/24..latest",
|
|
"firefox/nightly",
|
|
"opera/15..latest",
|
|
"opera/next",
|
|
"safari/5.0.5..latest",
|
|
"iphone/latest",
|
|
"ipad/latest",
|
|
"android-browser/latest"
|
|
]
|
|
},
|
|
"version": "0.2.1"
|
|
}
|