{"_id":"queue-fifo","_rev":"15-f959b6bc54c194a4e8eadaca2bec8d4e","name":"queue-fifo","description":"Javascript implementation of a queue data structure","dist-tags":{"latest":"0.2.6"},"versions":{"0.1.0":{"name":"queue-fifo","version":"0.1.0","description":"Javascript implementation of a queue data structure","main":"index.js","scripts":{"test":"./node_modules/mocha/bin/mocha"},"repository":{"type":"git","url":"https://github.com/jasonsjones/queue-fifo.git"},"keywords":["queue","FIFO","data structure"],"author":{"name":"Jason Jones"},"license":"MIT","bugs":{"url":"https://github.com/jasonsjones/queue-fifo/issues"},"homepage":"https://github.com/jasonsjones/queue-fifo","devDependencies":{"grunt":"^0.4.5","grunt-contrib-jshint":"^0.10.0","grunt-mocha-cli":"^1.12.0","jshint-stylish":"^1.0.0","mocha":"^2.1.0","should":"^4.6.1"},"dependencies":{"dbly-linked-list":"^0.1.3"},"gitHead":"1b421ac840d92bafa100377888d5795026ff3644","_id":"queue-fifo@0.1.0","_shasum":"8714b08a51193edd1b95ecfc447b999e6c2ae52a","_from":".","_npmVersion":"2.1.16","_nodeVersion":"0.10.25","_npmUser":{"name":"jsj0nes","email":"jsjones96@gmail.com"},"maintainers":[{"name":"jsj0nes","email":"jsjones96@gmail.com"}],"dist":{"shasum":"8714b08a51193edd1b95ecfc447b999e6c2ae52a","tarball":"https://registry.npmjs.org/queue-fifo/-/queue-fifo-0.1.0.tgz","integrity":"sha512-2LCiIUEwT528c9vPxJ3gvGVvcHXkgz20Uobw9bwC6LamcLsx/xsPlJiUZ8bplRzYQJZBVU3N77uqb+S5GzU/Nw==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQC4LUBQxHNCFTSgKnMGU4OO85IIud5CsHL4cMN2yVPKmAIgS68ITA82uS9onQE7t2vzTS8pGl3pLh5HiQf6psmYdEo="}]},"directories":{}},"0.2.0":{"name":"queue-fifo","version":"0.2.0","description":"Javascript implementation of a queue data structure","main":"index.js","scripts":{"test":"./node_modules/mocha/bin/mocha"},"repository":{"type":"git","url":"https://github.com/jasonsjones/queue-fifo.git"},"keywords":["queue","FIFO","data structure"],"author":{"name":"Jason Jones"},"license":"MIT","bugs":{"url":"https://github.com/jasonsjones/queue-fifo/issues"},"homepage":"https://github.com/jasonsjones/queue-fifo","devDependencies":{"grunt":"^0.4.5","grunt-contrib-jshint":"^0.10.0","grunt-mocha-cli":"^1.12.0","jshint-stylish":"^1.0.0","mocha":"^2.1.0","should":"^4.6.1"},"dependencies":{"dbly-linked-list":"^0.1.3"},"gitHead":"03130c2bcfb656a1c663204b71a3c7fd01ef99ec","_id":"queue-fifo@0.2.0","_shasum":"88aaf02ccc6cc71a968cc60ce5135b3bd618f9b9","_from":".","_npmVersion":"2.1.16","_nodeVersion":"0.10.25","_npmUser":{"name":"jsj0nes","email":"jsjones96@gmail.com"},"maintainers":[{"name":"jsj0nes","email":"jsjones96@gmail.com"}],"dist":{"shasum":"88aaf02ccc6cc71a968cc60ce5135b3bd618f9b9","tarball":"https://registry.npmjs.org/queue-fifo/-/queue-fifo-0.2.0.tgz","integrity":"sha512-4xoRBggAb1BNYGnEiuvh/vQZnjrzQPZ5Ry9Y7IEdHNd8dN9til63AGZB9FfrztHeUseF6Q5O5B5UzGFFuStRIg==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQDfNzPxgZ4JNCOE/iyoz8jXtAtxmfvytQ9DcClOgqnySwIhALnB4KzPQiVxiu5fEuBvviKRW4xyITHYYhvO/kMFn2vZ"}]},"directories":{}},"0.2.1":{"name":"queue-fifo","version":"0.2.1","description":"Javascript implementation of a queue data structure","main":"index.js","scripts":{"test":"./node_modules/mocha/bin/mocha"},"repository":{"type":"git","url":"https://github.com/jasonsjones/queue-fifo.git"},"keywords":["queue","FIFO","data structure"],"author":{"name":"Jason Jones"},"license":"MIT","bugs":{"url":"https://github.com/jasonsjones/queue-fifo/issues"},"homepage":"https://github.com/jasonsjones/queue-fifo","devDependencies":{"grunt":"^0.4.5","grunt-contrib-jshint":"^0.10.0","grunt-mocha-cli":"^1.12.0","jshint-stylish":"^1.0.0","mocha":"^2.1.0","should":"^4.6.1"},"dependencies":{"dbly-linked-list":"^0.1.3"},"gitHead":"73796f0272995317f1d39e1b6dc4f1909eb79714","_id":"queue-fifo@0.2.1","_shasum":"cf825a42106b95b9c90a189a72effa9a8cfb3e53","_from":".","_npmVersion":"2.1.16","_nodeVersion":"0.10.40","_npmUser":{"name":"jsj0nes","email":"jsjones96@gmail.com"},"maintainers":[{"name":"jsj0nes","email":"jsjones96@gmail.com"}],"dist":{"shasum":"cf825a42106b95b9c90a189a72effa9a8cfb3e53","tarball":"https://registry.npmjs.org/queue-fifo/-/queue-fifo-0.2.1.tgz","integrity":"sha512-zLO9p0yQjVzG5N+kxKvkIPUR9pg1FSlQA+wpPKk1qjqDct1ofXVq/MKIvQZZwkPiwTAKk+cYsQmKXsqB6oo1uw==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQDlBAiU8a2se1MVhVqVkYrOKzSSiNaIf3OsPLRAmHZDrwIhAJgCG0+XF/HvtqOsy7lFI0oT70gAa2WlAWSTLntF3bek"}]},"directories":{}},"0.2.2":{"name":"queue-fifo","version":"0.2.2","description":"Javascript implementation of a queue data structure","main":"index.js","scripts":{"test":"./node_modules/mocha/bin/mocha"},"repository":{"type":"git","url":"https://github.com/jasonsjones/queue-fifo.git"},"keywords":["queue","FIFO","data structure"],"author":{"name":"Jason Jones"},"license":"MIT","bugs":{"url":"https://github.com/jasonsjones/queue-fifo/issues"},"homepage":"https://github.com/jasonsjones/queue-fifo","devDependencies":{"gulp":"^3.9.0","gulp-jscs":"^1.6.0","gulp-jshint":"^1.12.0","gulp-load-plugins":"^0.8.0","gulp-mocha":"^2.2.0","gulp-util":"^3.0.7","jshint-stylish":"^1.0.2","mocha":"^2.3.0","should":"8.0.2"},"dependencies":{"dbly-linked-list":"^0.1.3"},"gitHead":"9d2d39f23616fafd52fc209938bd2d5ea9fb90fd","_id":"queue-fifo@0.2.2","_shasum":"48ca5ad31703eac9f85e9c7d709ed344e3a64cbe","_from":".","_npmVersion":"2.1.16","_nodeVersion":"0.10.41","_npmUser":{"name":"jsj0nes","email":"jsjones96@gmail.com"},"maintainers":[{"name":"jsj0nes","email":"jsjones96@gmail.com"}],"dist":{"shasum":"48ca5ad31703eac9f85e9c7d709ed344e3a64cbe","tarball":"https://registry.npmjs.org/queue-fifo/-/queue-fifo-0.2.2.tgz","integrity":"sha512-42YyKKZjbGktT91XHAYeWWC2yA5Ahb7cTdkqzm9Lv0P30RPnZColhMSRRQZdniuTL3ozbHHjyKmKm/Vkr1601Q==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQDrMGF+NPZ9tyGMWZB2ny+B0bY6WEMRJ8+j1TcFLanToQIhANe/PA1lJ85ZfO2lRb7oECTftKX+pAfl5p8N6JN2RdDc"}]},"directories":{}},"0.2.3":{"name":"queue-fifo","version":"0.2.3","description":"Javascript implementation of a queue data structure","main":"index.js","scripts":{"test":"./node_modules/mocha/bin/mocha"},"repository":{"type":"git","url":"https://github.com/jasonsjones/queue-fifo.git"},"keywords":["queue","FIFO","abstract data-type","data structure"],"author":{"name":"Jason Jones"},"license":"MIT","bugs":{"url":"https://github.com/jasonsjones/queue-fifo/issues"},"homepage":"https://github.com/jasonsjones/queue-fifo","devDependencies":{"gulp":"3.9.1","gulp-istanbul":"0.10.3","gulp-jscs":"3.0.2","gulp-jshint":"2.0.0","gulp-load-plugins":"1.2.0","gulp-mocha":"2.2.0","gulp-util":"3.0.7","jshint-stylish":"2.1.0","mocha":"2.4.5","should":"8.2.2"},"dependencies":{"dbly-linked-list":"0.1.10"},"gitHead":"0e8cf35ffe14509af97f5addb3cc9578686817f7","_id":"queue-fifo@0.2.3","_shasum":"8bd019281cf1574f0e076ddaa8a1c6193ff8aa26","_from":".","_npmVersion":"1.4.28","_npmUser":{"name":"jsj0nes","email":"jsjones96@gmail.com"},"maintainers":[{"name":"jsj0nes","email":"jsjones96@gmail.com"}],"dist":{"shasum":"8bd019281cf1574f0e076ddaa8a1c6193ff8aa26","tarball":"https://registry.npmjs.org/queue-fifo/-/queue-fifo-0.2.3.tgz","integrity":"sha512-XlJ7PxYNwGE9dkyMqbitmRfXjSOCtyP9USFb3zbz+Ac38t7x9V9T1xnD2mjqJ9F8hru/v4cFUkME+6B9a8sFWg==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCVhbnzbCy02wiDusVSCn8nKTTXRzfBAn6vncVHb/ey/wIgBXFA1+Fxs5tE7egXySj1cjch6BFgVK/Il5Z80xdxzc4="}]},"_npmOperationalInternal":{"host":"packages-12-west.internal.npmjs.com","tmp":"tmp/queue-fifo-0.2.3.tgz_1459483830390_0.7162837067153305"},"directories":{}},"0.2.4":{"name":"queue-fifo","version":"0.2.4","description":"Javascript implementation of a queue data structure","main":"index.js","scripts":{"pretest":"npm run lint","test":"nyc mocha","lint":"eslint index.js test/*.js"},"repository":{"type":"git","url":"git+https://github.com/jasonsjones/queue-fifo.git"},"keywords":["queue","FIFO","abstract data-type","data structure"],"author":{"name":"Jason Jones"},"license":"MIT","bugs":{"url":"https://github.com/jasonsjones/queue-fifo/issues"},"homepage":"https://github.com/jasonsjones/queue-fifo","devDependencies":{"chai":"^4.1.2","eslint":"^4.12.1","mocha":"^4.0.1","nyc":"^11.3.0"},"dependencies":{"dbly-linked-list":"0.2.0"},"gitHead":"da6b7c26f2749738a0763f02743b7669d6c1f6aa","_id":"queue-fifo@0.2.4","_npmVersion":"5.5.1","_nodeVersion":"8.9.0","_npmUser":{"name":"jsj0nes","email":"jsjones96@gmail.com"},"dist":{"integrity":"sha512-o2xWptfzdw4QLIozUUcRPnppoTNK+X1DxWGd8csnJ1gQUsATfQaDryaGB1MhAu1L48vqPMtH69PZ1kZD82zlVw==","shasum":"8276bf59122abcae9ac5a3234f534e696699bf25","tarball":"https://registry.npmjs.org/queue-fifo/-/queue-fifo-0.2.4.tgz","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIDKsiDaoOy886f3SjxBNMTQsCnvLHVpF5sIHtCVZtGEgAiEA5GW0C02e7uwNc562hjDBQkqffFdld1VaZtmwyr+gg2Y="}]},"maintainers":[{"name":"jsj0nes","email":"jsjones96@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/queue-fifo-0.2.4.tgz_1512163567717_0.056887863436713815"},"directories":{}},"0.2.5":{"name":"queue-fifo","version":"0.2.5","description":"Javascript implementation of a queue data structure","main":"index.js","scripts":{"pretest":"npm run lint","test":"nyc mocha","lint":"eslint index.js test/*.js"},"repository":{"type":"git","url":"git+https://github.com/jasonsjones/queue-fifo.git"},"keywords":["queue","FIFO","abstract data-type","data structure"],"author":{"name":"Jason Jones"},"license":"MIT","bugs":{"url":"https://github.com/jasonsjones/queue-fifo/issues"},"homepage":"https://github.com/jasonsjones/queue-fifo","devDependencies":{"chai":"^4.1.2","eslint":"^4.12.1","mocha":"^4.0.1","nyc":"^11.3.0"},"dependencies":{"dbly-linked-list":"0.2.0"},"gitHead":"16cc001165ce41d5186eaf1f72d1e242617333b7","_id":"queue-fifo@0.2.5","_npmVersion":"5.5.1","_nodeVersion":"8.9.0","_npmUser":{"name":"jsj0nes","email":"jsjones96@gmail.com"},"dist":{"integrity":"sha512-GrHy3RDy0BOEVjelr+htts/QJyZAJr+7m4TisCA+RlUSsegQT6EGOf+NyxLDhSRflFI5vq3aADFOR/tNZCasxg==","shasum":"b3f0c626dea8b505b7e816aa888c1860f9433e9c","tarball":"https://registry.npmjs.org/queue-fifo/-/queue-fifo-0.2.5.tgz","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIErrQdZNX5SNqSVSFBNvblNYFtJ786pVIxwobasH6AzUAiAgOkE8AfdO6jNuVYbOokxCblLfCd+UIsgQfzJvpWOJyA=="}]},"maintainers":[{"name":"jsj0nes","email":"jsjones96@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/queue-fifo-0.2.5.tgz_1512351000315_0.7690728339366615"},"directories":{}},"0.2.6":{"name":"queue-fifo","version":"0.2.6","description":"Javascript implementation of a queue data structure","main":"index.js","typings":"index.d.ts","scripts":{"pretest":"npm run lint","test":"nyc mocha","lint":"eslint index.js test/*.js"},"repository":{"type":"git","url":"git+https://github.com/jasonsjones/queue-fifo.git"},"keywords":["queue","FIFO","abstract data-type","data structure"],"author":{"name":"Jason Jones"},"license":"MIT","bugs":{"url":"https://github.com/jasonsjones/queue-fifo/issues"},"homepage":"https://github.com/jasonsjones/queue-fifo","devDependencies":{"chai":"^4.2.0","eslint":"^5.16.0","mocha":"^6.1.4","nyc":"^14.1.1"},"dependencies":{"dbly-linked-list":"0.3.4"},"gitHead":"067ffd15628d223e2be5c8834615612022746126","_id":"queue-fifo@0.2.6","_nodeVersion":"11.13.0","_npmVersion":"6.7.0","dist":{"integrity":"sha512-rwlnZHAaTmWEGKC7ziasK8u4QnZW/uN6kSiG+tHNf/1GA+R32FArZi18s3SYUpKcA0Y6jJoUDn5GT3Anoc2mWw==","shasum":"6438814581e7a6d31074202beaa1bd7726b76501","tarball":"https://registry.npmjs.org/queue-fifo/-/queue-fifo-0.2.6.tgz","fileCount":5,"unpackedSize":10705,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJc6bh7CRA9TVsSAnZWagAAhsIP/0GL+rYSIzuFE+s7Hge6\nFWx5RDaOdOvwt7ADj0rzzIOZAdaG2K4f5t6uN0BKze/sM7bNCoaEtHuqAWiq\nAIt/iaO62v77PaZbp5ELbySICvIt/bsqpx3J69QJdt/j7eeRuMCh9YXSakZL\npjE608N9TUEliPxFjX16L3tPdu1XALkwFb6Bt4/w77S3Mi4JV67oOoGXRtwX\nLgKbdKmes7j2xov4/9BKsNxbQbLTlxp41i2Ihw0KtGf/Bh+SBoRbfZaPGZhK\npUZytdZM5Bs8ZBEB0aa2ToN8Pr1znishvJKxJS+gAhySMo32tob0VAcokJ2O\nfeme2zLmw/IT5wOHej8FCI0Ey7sP9fiaB839yr/lHunb+5WiYO4QPlqMwH61\nyqIrvK7LJfZbkwooesdeG/odr/sb3iDVsaydKoM/XZKXyNeMe3mVwElI9fV7\n3yM+zSFI9J+NYkUcpJV5zA4ZuqtyXM0gVKPhm6+WE3YLH2JSAECk1+uERUGB\nJaRBRRIEdK+7Rm1YMMu1Rvmsc92XOshZeF4+xGBuIuayHfr1YcXVksQF3zII\ntYQwRQz0xobkWBTV/pa7gXgJLvGakoAZ2E2ZT1vLjwZYE/oXfoN4rkxAOqAt\nuTKKu1FIyvWHFIK0uyqR/96kReHPubWUCPVtv5+HCrT3MihBxcw+f+OjJiSB\nBiot\r\n=Tk2r\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIFUd8kTD4PIM1JzXMUytcu62pMkQbMyRu+xOV26sMoLdAiBaLbVAJqOzZoXNJB44jQqqKW3iN2FQau1mZfsixGX7KA=="}]},"maintainers":[{"name":"jsj0nes","email":"jsjones96@gmail.com"}],"_npmUser":{"name":"jsj0nes","email":"jsjones96@gmail.com"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/queue-fifo_0.2.6_1558820986620_0.001395268672162775"},"_hasShrinkwrap":false}},"readme":"[![npm version][npm-image]][npm-url]\n[![Build Status][circleci-image]][circleci-url]\n[![dependency status][dm-image]][dm-url]\n[![devDependency status][devdep-image]][devdep-url]\n[![npm](https://img.shields.io/npm/l/queue-fifo.svg?style=flat-square)]()\n\n# Queue Data Structure\n\n## Description\n\nThis is a javascript implementation of a\n[queue](http://en.wikipedia.org/wiki/Queue%28abstract_data_type%29)\ndata structure.\n\nA queue data structure models the notion of 'First in First Out', or FIFO&mdash;\nimage the line at the grocery store.  The first item to be removed from a queue\nis the first item placed in the queue.  Basically, the order in which items\nare placed in the queue matters.\n\nThis particular implementation utilizes a\n[linked list](https://www.npmjs.com/package/dbly-linked-list) as the\nunderlying data structure.  This offers several benefits.\n\n* We can leverage the work that has already been done to implement the\n  linked list.\n\n* This lends itself to a level of composition and abstraction which greatly\n  simplifies this implementation.  It provides a wrapper around only those\n  methods of the linked list that we need to construct the properties of a\n  queue data structure.\n\n* The 'queue' or 'dequeue' operations can be completed in O(1) time.\n\n* No additional overhead is required to 'resize' the data structure to add\n  more elements to the queue.  When elements are 'queued' up in the queue, the\n  underlying linked list will adjust its size dynamically.\n\n*For specific examples and documentation, see the below sections*\n\n### Motivation:\n\nThe main purpose of this project is revisit the basics, and focus on the\ndevelopment process.\n\n*I wholehearedly acknowledge that the basic data structure space is populated\nwith well-written code and efficient implementations, and one could easily grab\none of those libraries and integrate it in their project.  However, the main\ndifference between those libraries/implementations and this one is that this is\nthe best implementation I have ever written.  My hope is that someone else will\nfind this useful, but understand, this code is not the goal; this will simply\nbe a useful bi-product of the journey.  The underlying motivation is to\nunderstand and, more importantly, learn from the process to get to the desired\nend-state&mdash;for me it is all about the joy of the journey.*\n\n#### Environment:\n\nAlthough this implementation is designed to be used with\n[Node.js](http://www.nodejs.org), it could be used in other contexts with minor\nmodifications.  This implementation does not have any external dependencies\nthat would preclude it from being used in the browser--just include it with a\n`<script>` tag and it should be good to go.  _Disclaimer: I have not tested\nthis implementation in any other context/environment; only tested with node.js_\n\n----\n\n## Basic Usage\n\nInstall with npm :\n\n```bash\nnpm install queue-fifo --save\n```\n\nInstall with yarn :\n\n```bash\nyarn add queue-fifo\n```\n\nBasic usage example below.  _Note: it does not cover all the available\nmethods, rather just highlights the main functionality to get up and running\nwith this data structure. For a description of all the methods, see the\nAPI section._\n\n```javascript\nvar Queue = require('queue-fifo');\nvar queue = new Queue();\n\nqueue.isEmpty();\n// --> true\n\nqueue.enqueue('data item 1');\nqueue.enqueue('data item 2');\nqueue.enqueue('data item 3');\nqueue.enqueue('data item 4');\n// queue contains:\n// 'data item 1', <-- front\n//  ... ,\n// 'data item 4'\n\nqueue.isEmpty();\n// --> false\n\nqueue.size();\n// --> 4\n\nqueue.dequeue();\n// --> removes 'data item 1'\n\nqueue.peek()\n// --> 'data item 2'\n\nqueue.size();\n// --> 3\n\nqueue.clear();\nqueue.isEmpty();\n// --> true\n```\n\nTypeScript definitions are also provided:\n\n```typescript\nimport Queue = require('queue-fifo');\n\nlet stringQueue = new Queue<string>();\nlet numberQueue = new Queue<number>();\n```\n\n## API\n\n**Available methods for a queue instance:**\n\n* ### isEmpty()\n    Determines if the queue is empty or not. Returns true if is empty, false\n    otherwise.\n\n* ### size()\n    Returns the size of the queue, or number of items\n\n* ### clear()\n    Clears the queue of all data\n\n* ### enqueue(data)\n    Adds an new item containing 'data' to the back of the queue\n\n* ### dequeue()\n    Removes the item from the front of the queue\n\n* ### peek()\n    Returns the data of the item at the front of the queue,\n    but does not remove it\n\n----\n## License\nMIT &copy; Jason Jones\n\n[npm-image]:https://badge.fury.io/js/queue-fifo.svg\n[npm-url]:http://npmjs.org/package/queue-fifo\n[circleci-image]: https://img.shields.io/circleci/project/github/jasonsjones/queue-fifo.svg?style=flat-square\n[circleci-url]: https://circleci.com/gh/jasonsjones/queue-fifo\n[dm-image]:https://david-dm.org/jasonsjones/queue-fifo.svg?style=flat-square\n[dm-url]:https://david-dm.org/jasonsjones/queue-fifo\n[devdep-image]:https://david-dm.org/jasonsjones/queue-fifo/dev-status.svg?style=flat-square\n[devdep-url]:https://david-dm.org/jasonsjones/queue-fifo?type=dev\n","maintainers":[{"email":"jsjones96@gmail.com","name":"jasonsjones"}],"time":{"modified":"2022-06-25T06:51:47.410Z","created":"2015-01-25T04:21:09.048Z","0.1.0":"2015-01-25T04:21:09.048Z","0.2.0":"2015-01-31T02:30:08.084Z","0.2.1":"2015-09-09T14:02:11.447Z","0.2.2":"2015-12-28T13:57:05.856Z","0.2.3":"2016-04-01T04:10:32.796Z","0.2.4":"2017-12-01T21:26:08.072Z","0.2.5":"2017-12-04T01:30:00.392Z","0.2.6":"2019-05-25T21:49:46.751Z"},"homepage":"https://github.com/jasonsjones/queue-fifo","keywords":["queue","FIFO","abstract data-type","data structure"],"repository":{"type":"git","url":"git+https://github.com/jasonsjones/queue-fifo.git"},"author":{"name":"Jason Jones"},"bugs":{"url":"https://github.com/jasonsjones/queue-fifo/issues"},"license":"MIT","readmeFilename":"README.md"}