{"bugs":{"url":"http://github.com/tjfontaine/node-binaryheap/issues"},"dist":{"shasum":"78daba867acdb8f90f2e345c1045afc05520468c","tarball":"https://registry.npmjs.org/binaryheap/-/binaryheap-0.0.2.tgz","integrity":"sha512-8sWUet/fbiUq/qTt3FAyXi7+hOes34+nQwmqh4EHvh5kGENMW73AR2G7FT01zFUqHZJXnpQKgv3NELVVWt/OCg==","signatures":[{"sig":"MEYCIQCG9KSRbULKQIzY1eXqzzs1aBe7vB2VTY/A6hfBEOP8ogIhAKmlCle+x7G9Z90f44l/NwAlRjk8uOH1QB6eZJjIq1AH","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}]},"main":"binaryheap.js","name":"binaryheap","author":{"url":"http://atxconsulting.com","name":"Timothy J Fontaine","email":"tjfontaine@gmail.com"},"readme":"BinaryHeap\n==========\n\nBasic binary heap tree using linked lists\n\nUsage\n-----\n\n```javascript\nvar BinaryHeap = require('binaryheap');\nvar heap = new BinaryHeap();\n\nvar a = [6, 5, 3, 1, 8, 7, 2, 4];\n\na.forEach(function (k) {\n  heap.insert({ value: k }, k);\n});\n\nheap.print();\n\nwhile (heap.length) {\n  console.log('popping', heap.pop().value);\n}\n```\n\nBy default it stores as a max-heap, if you pass truthy to the constructor though\nit will behave as a min-heap.\n\nMethods\n-------\n\n * `insert(obj, key)` -- obj can be any new or existing object, and key is any\nvalue that behaves sanely with `>` or `<`\n * `pop()` -- removes and returns the maximum or minimum object from the root\nof the heap\n * `remove(obj)` -- removes a previously inserted object from the heap\n * `print()` -- mostly for debugging purposes prints a graphviz dot style\ndigraph to confirm ordering\n\nMembers\n-------\n\n * `length` -- number of objects currently in the heap\n","engines":{"node":">= 0.6.0"},"_npmUser":{"name":"tjfontaine","email":"tjfontaine@gmail.com"},"homepage":"http://github.com/tjfontaine/node-binaryheap","keywords":["balanced","binary","heap","minheap","maxheap"],"repository":{"url":"http://github.com/tjfontaine/node-binaryheap.git","type":"git"},"_npmVersion":"1.1.69","description":"A simple binary heap","maintainers":[{"name":"tjfontaine","email":"tjfontaine@gmail.com"}],"readmeFilename":"README.md","_id":"binaryheap@0.0.2","version":"0.0.2"}