{"_id":"@aureooms/js-binomial-heap","_rev":"3-a6a6494af50ad908b365838316b8ef89","name":"@aureooms/js-binomial-heap","description":"Binomial heap data structures for JavaScript","dist-tags":{"latest":"11.0.0"},"versions":{"11.0.0":{"name":"@aureooms/js-binomial-heap","description":"Binomial heap data structures for JavaScript","version":"11.0.0","author":{"name":"Aurélien Ooms","email":"aurelien.ooms@gmail.com"},"ava":{"require":["babel-polyfill","babel-register"]},"babel":{"presets":["latest"],"env":{"development":{"sourceMaps":"inline"}}},"bugs":{"url":"https://github.com/aureooms/js-binomial-heap/issues"},"dependencies":{},"devDependencies":{"@aureooms/js-array":"^3.1.0","@aureooms/js-functools":"^2.0.3","@aureooms/js-heap-spec":"^10.0.1","@aureooms/js-itertools":"^3.1.1","ava":"^0.17.0","babel-cli":"^6.18.0","babel-polyfill":"^6.20.0","babel-preset-latest":"^6.16.0","codeclimate-test-reporter":"^0.4.0","coveralls":"^2.11.15","esdoc":"^0.5.2","nyc":"^10.1.2"},"homepage":"http://aureooms.github.io/js-binomial-heap/","keywords":["binomial","data","heap","javascript","js","structure"],"license":"AGPL-3.0","main":"lib/index.js","repository":{"url":"git+https://github.com/aureooms/js-binomial-heap.git","type":"git"},"scripts":{"build":"babel src -d lib","cover":"nyc --reporter=lcov npm test","prepublish":"npm run build","test":"ava ./test/src --concurrency 8"},"gitHead":"15305339dd253c837e11ddcbfdb8ae41019c0187","_id":"@aureooms/js-binomial-heap@11.0.0","_shasum":"8ca6dbaf28834213c933eec1d4cfa6f73b352474","_from":".","_npmVersion":"4.2.0","_nodeVersion":"7.5.0","_npmUser":{"name":"aureooms","email":"aurelien.ooms@gmail.com"},"dist":{"shasum":"8ca6dbaf28834213c933eec1d4cfa6f73b352474","tarball":"https://registry.npmjs.org/@aureooms/js-binomial-heap/-/js-binomial-heap-11.0.0.tgz","integrity":"sha512-TK9VL0L/1W6e1MtKAN4WmmKscp79FRR582ivBAO/aAKtXJkIHbEQLk0NRS/EuzL5ePAfBbRyyAy5Mk+o++yolg==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIBNE3u2+Z0pqPofmAaiwUMzwC8nrHdq5DfP+Rs5StYfGAiEAkGeSLKrX3p4sJ7ZXUIT23j9rdBhqKsRqndcS6tKcHsc="}]},"maintainers":[{"name":"aureooms","email":"aurelien.ooms@gmail.com"}],"_npmOperationalInternal":{"host":"packages-18-east.internal.npmjs.com","tmp":"tmp/js-binomial-heap-11.0.0.tgz_1487247192561_0.6916790835093707"},"directories":{},"deprecated":"This package has moved to @heap-data-structure/binomial-heap."}},"readme":"[@aureooms/js-binomial-heap](http://aureooms.github.io/js-binomial-heap)\n==\n\n<img src=\"https://cdn.rawgit.com/aureooms/js-binomial-heap/master/media/sketch.svg\" width=\"864\">\n\nBinomial heap data structures for JavaScript.\nSee [docs](https://aureooms.github.io/js-binomial-heap/index.html).\nParent is [@aureooms/js-heap](https://github.com/aureooms/js-heap).\n\n```js\n//\n//    o       o           o--.             o\n//    |\\      |\\          |\\  \\           /|\\\n//    o o  +  o o    =    o o  o    =    o o o\n//      |       |           |  |\\          | |\\\n//      o       o           o  o o         o o o\n//                               |             |\n//                               o             o\n//\nlet heaps = [\n  new ( BinomialHeap( BinomialTreeWithParent ) )( compare.increasing ) ,\n  new ( BinomialHeap( BinomialTree ) )( compare.increasing ) ,\n  new ( LazyBinomialHeap( BinomialTree ) )( compare.increasing ) ,\n  new ( LazyBinomialHeap( BinomialTreeWithParent ) )( compare.increasing ) ,\n] ;\n```\n\n[![NPM license](http://img.shields.io/npm/l/@aureooms/js-binomial-heap.svg?style=flat)](https://raw.githubusercontent.com/aureooms/js-binomial-heap/master/LICENSE)\n[![NPM version](http://img.shields.io/npm/v/@aureooms/js-binomial-heap.svg?style=flat)](https://www.npmjs.org/package/@aureooms/js-binomial-heap)\n[![Build Status](http://img.shields.io/travis/aureooms/js-binomial-heap.svg?style=flat)](https://travis-ci.org/aureooms/js-binomial-heap)\n[![Coverage Status](http://img.shields.io/coveralls/aureooms/js-binomial-heap.svg?style=flat)](https://coveralls.io/r/aureooms/js-binomial-heap)\n[![Dependencies Status](http://img.shields.io/david/aureooms/js-binomial-heap.svg?style=flat)](https://david-dm.org/aureooms/js-binomial-heap#info=dependencies)\n[![devDependencies Status](http://img.shields.io/david/dev/aureooms/js-binomial-heap.svg?style=flat)](https://david-dm.org/aureooms/js-binomial-heap#info=devDependencies)\n[![Code Climate](http://img.shields.io/codeclimate/github/aureooms/js-binomial-heap.svg?style=flat)](https://codeclimate.com/github/aureooms/js-binomial-heap)\n[![NPM downloads per month](http://img.shields.io/npm/dm/@aureooms/js-binomial-heap.svg?style=flat)](https://www.npmjs.org/package/@aureooms/js-binomial-heap)\n[![GitHub issues](http://img.shields.io/github/issues/aureooms/js-binomial-heap.svg?style=flat)](https://github.com/aureooms/js-binomial-heap/issues)\n[![Documentation](https://aureooms.github.io/js-binomial-heap/badge.svg)](https://aureooms.github.io/js-binomial-heap/source.html)\n\n## Reference\n\n  - http://www.cs.princeton.edu/~wayne/cs423/lectures/heaps-4up.pdf\n","maintainers":[{"name":"aureooms","email":"aurelien.ooms@gmail.com"}],"time":{"modified":"2022-06-12T14:51:55.294Z","created":"2017-02-16T12:13:13.123Z","11.0.0":"2017-02-16T12:13:13.123Z"},"homepage":"http://aureooms.github.io/js-binomial-heap/","keywords":["binomial","data","heap","javascript","js","structure"],"repository":{"url":"git+https://github.com/aureooms/js-binomial-heap.git","type":"git"},"author":{"name":"Aurélien Ooms","email":"aurelien.ooms@gmail.com"},"bugs":{"url":"https://github.com/aureooms/js-binomial-heap/issues"},"license":"AGPL-3.0","readmeFilename":"README.md"}