{"_id":"tiny-queue","_rev":"1017360","name":"tiny-queue","description":"Simple FIFO queue implementation to avoid having to do shift() on an array, which is slow.","dist-tags":{"latest":"0.2.1"},"maintainers":[{"name":"nolanlawson","email":"nolan@nolanlawson.com"}],"time":{"modified":"2021-09-28T15:36:51.000Z","created":"2014-05-23T02:26:37.349Z","0.2.1":"2014-08-11T02:14:17.200Z","0.2.0":"2014-05-23T03:03:54.426Z","0.1.0":"2014-05-23T02:26:37.349Z"},"users":{},"author":{"name":"Nolan Lawson","email":"nolan.lawson@gmail.com"},"repository":{"type":"git","url":"https://github.com/nolanlawson/tiny-queue.git"},"versions":{"0.2.1":{"name":"tiny-queue","version":"0.2.1","description":"Simple FIFO queue implementation to avoid having to do shift() on an array, which is slow.","main":"index.js","scripts":{"test":"tape test.js"},"repository":{"type":"git","url":"https://github.com/nolanlawson/tiny-queue.git"},"keywords":["queue","fifo"],"author":{"name":"Nolan Lawson","email":"nolan.lawson@gmail.com"},"license":"Apache 2","bugs":{"url":"https://github.com/nolanlawson/tiny-queue/issues"},"homepage":"https://github.com/nolanlawson/tiny-queue","devDependencies":{"tape":"^2.13.1"},"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"]},"gitHead":"52efc6443d44ccbe460a5500992a91ae6f66e2cc","_id":"tiny-queue@0.2.1","_shasum":"25a67f2c6e253b2ca941977b5ef7442ef97a6046","_from":".","_npmVersion":"1.4.13","_npmUser":{"name":"nolanlawson","email":"nolan@nolanlawson.com"},"maintainers":[{"name":"nolanlawson","email":"nolan@nolanlawson.com"}],"dist":{"shasum":"25a67f2c6e253b2ca941977b5ef7442ef97a6046","size":5929,"noattachment":false,"key":"/tiny-queue/-/tiny-queue-0.2.1.tgz","tarball":"http://registry.cnpm.dingdandao.com/tiny-queue/download/tiny-queue-0.2.1.tgz"},"directories":{},"publish_time":1407723257200,"_cnpm_publish_time":1407723257200,"_hasShrinkwrap":false},"0.2.0":{"name":"tiny-queue","version":"0.2.0","description":"Simple FIFO queue implementation to avoid having to do shift() on an array, which is slow.","main":"index.js","scripts":{"test":"tape test.js"},"repository":{"type":"git","url":"https://github.com/nolanlawson/tiny-queue.git"},"keywords":["queue","fifo"],"author":{"name":"Nolan Lawson","email":"nolan.lawson@gmail.com"},"license":"Apache 2","bugs":{"url":"https://github.com/nolanlawson/tiny-queue/issues"},"homepage":"https://github.com/nolanlawson/tiny-queue","devDependencies":{"tape":"^2.13.1"},"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"]},"_id":"tiny-queue@0.2.0","_shasum":"c49fcb5c87555be1b4a5df7eb87101d5b78bc9dc","_from":".","_npmVersion":"1.4.10","_npmUser":{"name":"nolanlawson","email":"nolan@nolanlawson.com"},"maintainers":[{"name":"nolanlawson","email":"nolan@nolanlawson.com"}],"dist":{"shasum":"c49fcb5c87555be1b4a5df7eb87101d5b78bc9dc","size":8755,"noattachment":false,"key":"/tiny-queue/-/tiny-queue-0.2.0.tgz","tarball":"http://registry.cnpm.dingdandao.com/tiny-queue/download/tiny-queue-0.2.0.tgz"},"directories":{},"publish_time":1400814234426,"_cnpm_publish_time":1400814234426,"_hasShrinkwrap":false},"0.1.0":{"name":"tiny-queue","version":"0.1.0","description":"Simple FIFO queue implementation to avoid having to do shift() on an array, which is slow.","main":"index.js","scripts":{"test":"echo \"Error: no test specified\" && exit 1"},"repository":{"type":"git","url":"https://github.com/nolanlawson/tiny-queue.git"},"keywords":["queue","fifo"],"author":{"name":"Nolan Lawson","email":"nolan.lawson@gmail.com"},"license":"Apache 2","bugs":{"url":"https://github.com/nolanlawson/tiny-queue/issues"},"homepage":"https://github.com/nolanlawson/tiny-queue","_id":"tiny-queue@0.1.0","_shasum":"91f3a11914ac0fee3ea645088ece44f70df44ed0","_from":".","_npmVersion":"1.4.10","_npmUser":{"name":"nolanlawson","email":"nolan@nolanlawson.com"},"maintainers":[{"name":"nolanlawson","email":"nolan@nolanlawson.com"}],"dist":{"shasum":"91f3a11914ac0fee3ea645088ece44f70df44ed0","size":5382,"noattachment":false,"key":"/tiny-queue/-/tiny-queue-0.1.0.tgz","tarball":"http://registry.cnpm.dingdandao.com/tiny-queue/download/tiny-queue-0.1.0.tgz"},"directories":{},"publish_time":1400811997349,"_cnpm_publish_time":1400811997349,"_hasShrinkwrap":false}},"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[![browser support](https://ci.testling.com/nolanlawson/tiny-queue.png)](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","_attachments":{},"homepage":"https://github.com/nolanlawson/tiny-queue","bugs":{"url":"https://github.com/nolanlawson/tiny-queue/issues"},"license":"Apache 2"}