{"_id":"dequeue","_rev":"245552","name":"dequeue","description":"A simple double ended queue datastructure","dist-tags":{"latest":"1.0.5"},"maintainers":[{"name":"lleo","email":"lleoem@gmail.com"}],"time":{"modified":"2021-06-03T16:03:11.000Z","created":"2012-07-06T22:38:36.766Z","1.0.5":"2013-08-29T15:45:51.180Z","1.0.4":"2013-03-22T15:28:53.795Z","1.0.3":"2012-07-08T02:41:03.238Z","1.0.2":"2012-07-08T01:23:13.342Z","1.0.1":"2012-07-07T12:25:07.569Z","1.0.0":"2012-07-06T22:38:36.766Z"},"users":{"lleo":true},"author":{"name":"LLeo","email":"lleoem@gmail.com","url":"http://lleo-blog.blogspot.com/"},"repository":{"type":"git","url":"https://github.com/lleo/node-dequeue"},"versions":{"1.0.5":{"name":"dequeue","main":"./lib/index.js","version":"1.0.5","description":"A simple double ended queue datastructure","keywords":["datastructure","queue","double ended queue","fifo","FIFO","linked list"],"homepage":"https://github.com/lleo/node-dequeue","repository":{"type":"git","url":"https://github.com/lleo/node-dequeue"},"bugs":{"url":"https://github.com/lleo/node-dequeue/issues","email":"lleoem@gmail.com"},"author":{"name":"LLeo","email":"lleoem@gmail.com","url":"http://lleo-blog.blogspot.com/"},"engines":{"node":"*"},"dependencies":{},"readmeFilename":"README.md","_id":"dequeue@1.0.5","dist":{"shasum":"10f1cef07e3234b21dcb38f4bfa2d66034ab67c7","size":2717,"noattachment":false,"key":"/dequeue/-/dequeue-1.0.5.tgz","tarball":"http://registry.cnpm.dingdandao.com/dequeue/download/dequeue-1.0.5.tgz"},"_from":".","_npmVersion":"1.3.5","_npmUser":{"name":"lleo","email":"lleoem@gmail.com"},"maintainers":[{"name":"lleo","email":"lleoem@gmail.com"}],"directories":{},"publish_time":1377791151180,"_cnpm_publish_time":1377791151180,"_hasShrinkwrap":false},"1.0.4":{"name":"dequeue","main":"./lib/index.js","version":"1.0.4","description":"A simple double ended queue datastructure","keywords":["datastructure","queue","double ended queue","fifo","FIFO","linked list"],"homepage":"https://github.com/lleo/node-dequeue","repository":{"type":"git","url":"https://github.com/lleo/node-dequeue"},"bugs":{"url":"https://github.com/lleo/node-dequeue/issues","email":"lleoem@gmail.com"},"author":{"name":"LLeo","email":"lleoem@gmail.com","url":"http://lleo-blog.blogspot.com/"},"engines":{"node":"*"},"dependencies":{},"readmeFilename":"README.md","_id":"dequeue@1.0.4","dist":{"shasum":"64ee18f20cf2dae739577faa99f9abaa451b0ed0","size":2648,"noattachment":false,"key":"/dequeue/-/dequeue-1.0.4.tgz","tarball":"http://registry.cnpm.dingdandao.com/dequeue/download/dequeue-1.0.4.tgz"},"_from":".","_npmVersion":"1.2.15","_npmUser":{"name":"lleo","email":"lleoem@gmail.com"},"maintainers":[{"name":"lleo","email":"lleoem@gmail.com"}],"directories":{},"publish_time":1363966133795,"_cnpm_publish_time":1363966133795,"_hasShrinkwrap":false},"1.0.3":{"name":"dequeue","main":"./lib/index.js","version":"1.0.3","description":"A simple double ended queue datastructure","keywords":["datastructure","queue","double ended queue","fifo","FIFO","linked list"],"homepage":"https://github.com/lleo/node-dequeue","repository":{"type":"git","url":"git://github.com/lleo/node-dequeue.git"},"bugs":{"email":"lleoem@gmail.com","url":"https://github.com/lleo/node-dequeue/issues"},"author":{"name":"LLeo","email":"lleoem@gmail.com","url":"http://lleo-blog.blogspot.com/"},"engines":{"node":"*"},"dependencies":{},"_npmUser":{"name":"lleo","email":"lleoem@gmail.com"},"_id":"dequeue@1.0.3","devDependencies":{},"optionalDependencies":{},"_engineSupported":true,"_npmVersion":"1.1.13","_nodeVersion":"v0.8.1","_defaultsLoaded":true,"dist":{"shasum":"30b8f4da2fc240951a15d31b35283e29b2de8978","size":1872,"noattachment":false,"key":"/dequeue/-/dequeue-1.0.3.tgz","tarball":"http://registry.cnpm.dingdandao.com/dequeue/download/dequeue-1.0.3.tgz"},"maintainers":[{"name":"lleo","email":"lleoem@gmail.com"}],"directories":{},"publish_time":1341715263238,"_cnpm_publish_time":1341715263238,"_hasShrinkwrap":false},"1.0.2":{"name":"dequeue","main":"./lib/index.js","version":"1.0.2","description":"A simple double ended queue datastructure","keywords":["datastructure","queue","double ended queue","fifo","FIFO","linked list"],"homepage":"https://github.com/lleo/node-dequeue","repository":{"type":"git","url":"git://github.com/lleo/node-dequeue.git"},"bugs":{"email":"lleoem@gmail.com","url":"https://github.com/lleo/node-dequeue/issues"},"author":{"name":"LLeo","email":"lleoem@gmail.com","url":"http://lleo-blog.blogspot.com/"},"engines":{"node":"*"},"dependencies":{},"_npmUser":{"name":"lleo","email":"lleoem@gmail.com"},"_id":"dequeue@1.0.2","devDependencies":{},"optionalDependencies":{},"_engineSupported":true,"_npmVersion":"1.1.13","_nodeVersion":"v0.8.1","_defaultsLoaded":true,"dist":{"shasum":"0aed0396762de573e331e8f1c6663a3729b1ab05","size":1322,"noattachment":false,"key":"/dequeue/-/dequeue-1.0.2.tgz","tarball":"http://registry.cnpm.dingdandao.com/dequeue/download/dequeue-1.0.2.tgz"},"maintainers":[{"name":"lleo","email":"lleoem@gmail.com"}],"directories":{},"publish_time":1341710593342,"_cnpm_publish_time":1341710593342,"_hasShrinkwrap":false},"1.0.1":{"name":"dequeue","main":"./lib/index.js","version":"1.0.1","description":"A simple double ended queue datastructure","keywords":["datastructure","queue","double ended queue","fifo","FIFO","linked list"],"homepage":"https://github.com/lleo/node-dequeue","repository":{"type":"git","url":"git://github.com/lleo/node-dequeue.git"},"bugs":{"email":"lleoem@gmail.com","url":"https://github.com/lleo/node-dequeue/issues"},"author":{"name":"LLeo","email":"lleoem@gmail.com","url":"http://lleo-blog.blogspot.com/"},"engines":{"node":"*"},"dependencies":{},"_npmUser":{"name":"lleo","email":"lleoem@gmail.com"},"_id":"dequeue@1.0.1","devDependencies":{},"optionalDependencies":{},"_engineSupported":true,"_npmVersion":"1.1.13","_nodeVersion":"v0.8.1","_defaultsLoaded":true,"dist":{"shasum":"cfa1545d1d98edcf28dd7bab793c206b08a8c979","size":1178,"noattachment":false,"key":"/dequeue/-/dequeue-1.0.1.tgz","tarball":"http://registry.cnpm.dingdandao.com/dequeue/download/dequeue-1.0.1.tgz"},"maintainers":[{"name":"lleo","email":"lleoem@gmail.com"}],"directories":{},"publish_time":1341663907569,"_cnpm_publish_time":1341663907569,"_hasShrinkwrap":false},"1.0.0":{"name":"dequeue","main":"./lib/index.js","version":"1.0.0","description":"A simple double ended queue datastructure","keywords":["datastructure","queue","double ended queue","fifo","FIFO","linked list"],"homepage":"https://github.com/lleo/node-dequeue","repository":{"type":"git","url":"git://github.com/lleo/node-dequeue.git"},"bugs":{"email":"lleoem@gmail.com","url":"https://github.com/lleo/node-dequeue/issues"},"author":{"name":"LLeo","email":"lleoem@gmail.com","url":"http://lleo-blog.blogspot.com/"},"engines":{"node":"*"},"dependencies":{},"_npmUser":{"name":"lleo","email":"lleoem@gmail.com"},"_id":"dequeue@1.0.0","devDependencies":{},"optionalDependencies":{},"_engineSupported":true,"_npmVersion":"1.1.13","_nodeVersion":"v0.8.1","_defaultsLoaded":true,"dist":{"shasum":"58813e3ea0d40da95764a1ef364e456c373d9abe","size":1246,"noattachment":false,"key":"/dequeue/-/dequeue-1.0.0.tgz","tarball":"http://registry.cnpm.dingdandao.com/dequeue/download/dequeue-1.0.0.tgz"},"maintainers":[{"name":"lleo","email":"lleoem@gmail.com"}],"directories":{},"publish_time":1341614316766,"_cnpm_publish_time":1341614316766,"_hasShrinkwrap":false}},"readme":"A Simple Double Ended Queue Datastructure\n=========================================\n\nI was using a javascript array as a FIFO. Somewhere between 100,000 and\n200,000 entries the program performance went to hell (dev host is a MBP\nw/8GB RAM). 15 minutes later, I implemented a simple dequeue and my FIFO\nscales up to millions of entries.\n\nIt is a dropin replacement for javascript-arrays-as-fifo.\n\nBTW, I use [Felix's Node.js Style Guide](http://nodeguide.com/style.html);\nget over it ;)\n\n## So here is the API:\n\n    var Dequeue = require('dequeue')\n    \n    //var fifo = []\n    var fifo = new Dequeue()\n    \n    fifo.length === 0 //=> true\n    \n    fifo.push(d1)\n    fifo.length === 1 //=> true\n    \n    fifo.unshift(d2)\n    \n    fifo.pop() === d1 //=> true\n    \n    fifo.push(d3)\n    \n    fifo.shift() === d2 //=> true\n    \n    fifo.length === 1 //=> true; only d3 is in the dequeue\n","_attachments":{},"readmeFilename":"README.md","homepage":"https://github.com/lleo/node-dequeue","bugs":{"url":"https://github.com/lleo/node-dequeue/issues","email":"lleoem@gmail.com"}}