From 62b1608155ec14cf6e4edd60b04fe2131b4a6ec4 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Aur=C3=A9lien=20Ooms?= Date: Wed, 18 Jan 2017 19:43:21 +0100 Subject: [PATCH 1/3] up deps + es6 modules --- .codeclimate.yml | 7 +- .gitignore | 32 +- .groc.json | 7 - .travis.yml | 18 +- README.md | 151 +--- bower.json | 21 - component.json | 11 - doc/css/style.css | 52 ++ doc/manual/example.md | 57 ++ doc/manual/installation.md | 13 + doc/manual/overview.md | 0 doc/manual/usage.md | 14 + doc/scripts/header.js | 34 + esdoc.json | 37 + inch.json | 5 - js/dist/binomial-heap.js | 891 ---------------------- js/dist/binomial-heap.js.map | 1 - js/dist/binomial-heap.min.js | 2 - js/index.js | 15 - js/src/LazyNode.js | 9 - lib/BinomialHeap.js | 477 ++++++++++++ lib/BinomialTree.js | 42 + lib/BinomialTreeWithParent.js | 50 ++ lib/LazyBinomialHeap.js | 257 +++++++ lib/LazyNode.js | 12 + lib/LazyStack.js | 60 ++ lib/index.js | 48 ++ package.json | 96 ++- pkg.json | 18 - {js/src => src}/BinomialHeap.js | 6 +- {js/src => src}/BinomialTree.js | 6 +- {js/src => src}/BinomialTreeWithParent.js | 6 +- {js/src => src}/LazyBinomialHeap.js | 7 +- src/LazyNode.js | 7 + js/src/LazyList.js => src/LazyStack.js | 8 +- src/index.js | 24 + test/js/index.js | 10 - test/js/src/all.js | 42 - test/src/spec.js | 50 ++ 39 files changed, 1329 insertions(+), 1274 deletions(-) delete mode 100644 .groc.json delete mode 100644 bower.json delete mode 100644 component.json create mode 100644 doc/css/style.css create mode 100644 doc/manual/example.md create mode 100644 doc/manual/installation.md create mode 100644 doc/manual/overview.md create mode 100644 doc/manual/usage.md create mode 100644 doc/scripts/header.js create mode 100644 esdoc.json delete mode 100644 inch.json delete mode 100644 js/dist/binomial-heap.js delete mode 100644 js/dist/binomial-heap.js.map delete mode 100644 js/dist/binomial-heap.min.js delete mode 100644 js/index.js delete mode 100644 js/src/LazyNode.js create mode 100644 lib/BinomialHeap.js create mode 100644 lib/BinomialTree.js create mode 100644 lib/BinomialTreeWithParent.js create mode 100644 lib/LazyBinomialHeap.js create mode 100644 lib/LazyNode.js create mode 100644 lib/LazyStack.js create mode 100644 lib/index.js delete mode 100644 pkg.json rename {js/src => src}/BinomialHeap.js (99%) rename {js/src => src}/BinomialTree.js (89%) rename {js/src => src}/BinomialTreeWithParent.js (88%) rename {js/src => src}/LazyBinomialHeap.js (97%) create mode 100644 src/LazyNode.js rename js/src/LazyList.js => src/LazyStack.js (91%) create mode 100644 src/index.js delete mode 100644 test/js/index.js delete mode 100644 test/js/src/all.js create mode 100644 test/src/spec.js diff --git a/.codeclimate.yml b/.codeclimate.yml index 0672c33..554bdae 100644 --- a/.codeclimate.yml +++ b/.codeclimate.yml @@ -1,7 +1,6 @@ languages: JavaScript: true exclude_paths: -- "js/dist/*.js" -- "js/dist/**/*.js" -- "test/*.js" -- "test/**/*.js" +- "doc/**" +- "lib/**" +- "test/**" diff --git a/.gitignore b/.gitignore index dcb4ccc..be10dca 100644 --- a/.gitignore +++ b/.gitignore @@ -1,28 +1,10 @@ -# Logs -logs -*.log - -# Runtime data -pids -*.pid -*.seed - -# Directory for instrumented libs generated by jscoverage/JSCover -lib-cov - -# Coverage directory used by tools like istanbul -coverage - -# Grunt intermediate storage (http://gruntjs.com/creating-plugins#storing-task-files) -.grunt - -# Compiled binary addons (http://nodejs.org/api/addons.html) -build/Release - # Dependency directory -# Deployed apps should consider commenting this line out: -# see https://npmjs.org/doc/faq.html#Should-I-check-my-node_modules-folder-into-git node_modules +jspm_packages + +# Coverage directory used by nyc +coverage +.nyc_output -# groc -doc +# Documentation +gh-pages diff --git a/.groc.json b/.groc.json deleted file mode 100644 index 56e8333..0000000 --- a/.groc.json +++ /dev/null @@ -1,7 +0,0 @@ -{ - "glob": [ - "js/src/**/*.js", - "README.md" - ], - "github": true -} \ No newline at end of file diff --git a/.travis.yml b/.travis.yml index 9a0746b..bd60bd8 100644 --- a/.travis.yml +++ b/.travis.yml @@ -1,13 +1,15 @@ language: node_js + node_js: - - "iojs" - - "0.12" - - "0.11" - - "0.10" + - node + install: - - npm -d install + - npm install + script: - - npm test + - npm run cover + after_success: - - ./node_modules/.bin/coveralls < coverage/lcov.info || true - - ./node_modules/.bin/codeclimate < coverage/lcov.info || true + - bash <(curl -s https://codecov.io/bash) || true + - coveralls < coverage/lcov.info || true + - codeclimate-test-reporter < coverage/lcov.info || true diff --git a/README.md b/README.md index f92a5b7..4b0a22e 100644 --- a/README.md +++ b/README.md @@ -1,8 +1,8 @@ [js-binomial-heap](http://aureooms.github.io/js-binomial-heap) == -Binomial heap code bricks in JavaScript. Parent is -[aureooms/js-heap](https://github.com/aureooms/js-heap). +Binomial heap data structures for JavaScript. +Parent is [aureooms/js-heap](https://github.com/aureooms/js-heap). ```js // @@ -18,7 +18,6 @@ Binomial heap code bricks in JavaScript. Parent is [![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) [![NPM version](http://img.shields.io/npm/v/aureooms-js-binomial-heap.svg?style=flat)](https://www.npmjs.org/package/aureooms-js-binomial-heap) -[![Bower version](http://img.shields.io/bower/v/aureooms-js-binomial-heap.svg?style=flat)](http://bower.io/search/?q=aureooms-js-binomial-heap) [![Build Status](http://img.shields.io/travis/aureooms/js-binomial-heap.svg?style=flat)](https://travis-ci.org/aureooms/js-binomial-heap) [![Coverage Status](http://img.shields.io/coveralls/aureooms/js-binomial-heap.svg?style=flat)](https://coveralls.io/r/aureooms/js-binomial-heap) [![Dependencies Status](http://img.shields.io/david/aureooms/js-binomial-heap.svg?style=flat)](https://david-dm.org/aureooms/js-binomial-heap#info=dependencies) @@ -26,152 +25,8 @@ Binomial heap code bricks in JavaScript. Parent is [![Code Climate](http://img.shields.io/codeclimate/github/aureooms/js-binomial-heap.svg?style=flat)](https://codeclimate.com/github/aureooms/js-binomial-heap) [![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) [![GitHub issues](http://img.shields.io/github/issues/aureooms/js-binomial-heap.svg?style=flat)](https://github.com/aureooms/js-binomial-heap/issues) -[![Inline docs](http://inch-ci.org/github/aureooms/js-binomial-heap.svg?branch=master&style=shields)](http://inch-ci.org/github/aureooms/js-binomial-heap) - -Can be managed through [jspm](https://github.com/jspm/jspm-cli), -[duo](https://github.com/duojs/duo), -[component](https://github.com/componentjs/component), -[bower](https://github.com/bower/bower), -[ender](https://github.com/ender-js/Ender), -[jam](https://github.com/caolan/jam), -[spm](https://github.com/spmjs/spm), -and [npm](https://github.com/npm/npm). - -## Description - -This package contains binomial heap implementations. - - -## Install - -### jspm -```terminal -jspm install github:aureooms/js-binomial-heap -# or -jspm install npm:aureooms-js-binomial-heap -``` -### duo -No install step needed for duo! - -### component -```terminal -component install aureooms/js-binomial-heap -``` - -### bower -```terminal -bower install aureooms-js-binomial-heap -``` - -### ender -```terminal -ender add aureooms-js-binomial-heap -``` - -### jam -```terminal -jam install aureooms-js-binomial-heap -``` - -### spm -```terminal -spm install aureooms-js-binomial-heap --save -``` - -### npm -```terminal -npm install aureooms-js-binomial-heap --save -``` - -## Require -### jspm -```js -let binomialheap = require( "github:aureooms/js-binomial-heap" ) ; -// or -import binomialheap from 'aureooms-js-binomial-heap' ; -``` -### duo -```js -let binomialheap = require( "aureooms/js-binomial-heap" ) ; -``` - -### component, ender, spm, npm -```js -let binomialheap = require( "aureooms-js-binomial-heap" ) ; -``` - -### bower -The script tag exposes the global variable `binomialheap`. -```html - -``` -Alternatively, you can use any tool mentioned [here](http://bower.io/docs/tools/). - -### jam -```js -require( [ "aureooms-js-binomial-heap" ] , function ( binomialheap ) { ... } ) ; -``` - -## Use - -```js -// can choose between 3 different implementations -// -// - BinomialHeap( BinomialTreeWithParent ) -// # head -> value -// # headreference -> reference -// # pop -> value -// # popreference -> reference -// # push( value ) -> reference -// # pushreference( reference ) -// # merge( other ) -// # update( reference , value ) -// # decreasekey( reference , value ) -// # increasekey( reference , value ) -// # delete( reference ) -// -// - BinomialHeap( BinomialTree ) -// # head -> value -// # pop -> value -// # push( value ) -// # merge( other ) -// -// - LazyBinomialHeap( BinomialTree ) -// # pop -> value -// # push( value ) -// # merge( other ) - -let compare = require( "aureooms-js-compare" ) ; - -let Heap = binomialheap. ... ( binomialheap. ... ) ; - -let a = new Heap( compare.increasing ) ; -let b = new Heap( compare.increasing ) ; - -a.push( 5 ) ; -a.push( 1 ) ; -a.push( 4 ) ; -b.push( 3 ) ; -b.push( 2 ) ; - -a.length ; // 3 -b.length ; // 2 - -a.merge( b ) ; -delete b ; - -a.length ; // 5 - -a.pop( ) ; // 1 -a.pop( ) ; // 2 -a.pop( ) ; // 3 -a.pop( ) ; // 4 -a.pop( ) ; // 5 - -a.length ; // 0 -``` +[![Documentation](https://aureooms.github.io/js-binomial-heap/badge.svg)](https://aureooms.github.io/js-binomial-heap/source.html) ## Reference - http://www.cs.princeton.edu/~wayne/cs423/lectures/heaps-4up.pdf - diff --git a/bower.json b/bower.json deleted file mode 100644 index d16e282..0000000 --- a/bower.json +++ /dev/null @@ -1,21 +0,0 @@ -{ - "homepage": "http://aureooms.github.io/js-binomial-heap/", - "name": "aureooms-js-binomial-heap", - "license": "AGPL-3.0", - "description": "Binomial heap code bricks for JavaScript", - "version": "10.0.1", - "main": "js/dist/binomial-heap.js", - "ignore": [ - "js/index.js", - "js/src", - "test", - "pkg.json", - "package.json", - ".groc.json", - ".travis.yml", - ".gitignore", - "README.md", - "inch.json", - ".codeclimate.yml" - ] -} \ No newline at end of file diff --git a/component.json b/component.json deleted file mode 100644 index 925f815..0000000 --- a/component.json +++ /dev/null @@ -1,11 +0,0 @@ -{ - "name": "aureooms-js-binomial-heap", - "repo": "aureooms/js-binomial-heap", - "scripts": [ - "js/dist/binomial-heap.js" - ], - "version": "10.0.1", - "description": "Binomial heap code bricks for JavaScript", - "main": "js/dist/binomial-heap.js", - "license": "AGPL-3.0" -} \ No newline at end of file diff --git a/doc/css/style.css b/doc/css/style.css new file mode 100644 index 0000000..ed56934 --- /dev/null +++ b/doc/css/style.css @@ -0,0 +1,52 @@ +h1, +h2, +.navigation, +.layout-container > header, +footer +{ + border: none; +} + +.project-name { + color: #FC913A; + font-weight: bold; +} + +.layout-container > header > a.repo-url-github { + font-size: inherit; + display: inline; + background: none; + vertical-align: inherit; +} + +.search-box img { + display: none; +} + +.search-box::before{ + content: "search"; +} + +.search-input-edge { + height: 0px; +} + +.search-result { + width: 300px; + margin-left: 42px; + box-shadow: 1px 1px 13px rgba(0,0,0,0.2); +} + +.search-input { + visibility: visible; +} + +.search-result li.search-separator { + text-transform: capitalize; + background-color: #ccc; +} + +span[data-ice="signature"] > span { + /*font-weight: bold;*/ + font-style: italic; +} diff --git a/doc/manual/example.md b/doc/manual/example.md new file mode 100644 index 0000000..741944e --- /dev/null +++ b/doc/manual/example.md @@ -0,0 +1,57 @@ + +```js +// can choose between 3 different implementations +// +// - BinomialHeap( BinomialTreeWithParent ) +// # head -> value +// # headreference -> reference +// # pop -> value +// # popreference -> reference +// # push( value ) -> reference +// # pushreference( reference ) +// # merge( other ) +// # update( reference , value ) +// # decreasekey( reference , value ) +// # increasekey( reference , value ) +// # delete( reference ) +// +// - BinomialHeap( BinomialTree ) +// # head -> value +// # pop -> value +// # push( value ) +// # merge( other ) +// +// - LazyBinomialHeap( BinomialTree ) +// # pop -> value +// # push( value ) +// # merge( other ) + +let compare = require( "aureooms-js-compare" ) ; + +let Heap = binomialheap. ... ( binomialheap. ... ) ; + +let a = new Heap( compare.increasing ) ; +let b = new Heap( compare.increasing ) ; + +a.push( 5 ) ; +a.push( 1 ) ; +a.push( 4 ) ; +b.push( 3 ) ; +b.push( 2 ) ; + +a.length ; // 3 +b.length ; // 2 + +a.merge( b ) ; +delete b ; + +a.length ; // 5 + +a.pop( ) ; // 1 +a.pop( ) ; // 2 +a.pop( ) ; // 3 +a.pop( ) ; // 4 +a.pop( ) ; // 5 + +a.length ; // 0 +``` diff --git a/doc/manual/installation.md b/doc/manual/installation.md new file mode 100644 index 0000000..cb0d8df --- /dev/null +++ b/doc/manual/installation.md @@ -0,0 +1,13 @@ +Can be managed using +[jspm](http://jspm.io) +or [npm](https://github.com/npm/npm). + +### jspm +```terminal +jspm install npm:aureooms-js-binomial-heap +``` + +### npm +```terminal +npm install aureooms-js-binomial-heap --save +``` diff --git a/doc/manual/overview.md b/doc/manual/overview.md new file mode 100644 index 0000000..e69de29 diff --git a/doc/manual/usage.md b/doc/manual/usage.md new file mode 100644 index 0000000..0bf3345 --- /dev/null +++ b/doc/manual/usage.md @@ -0,0 +1,14 @@ +The code needs a ES2015+ polyfill to work, for example +[babel-polyfill](https://babeljs.io/docs/usage/polyfill). +```js +require( 'babel-polyfill' ) ; +// or +import 'babel-polyfill' ; +``` + +Then +```js +const binomialheap = require( 'aureooms-js-binomial-heap' ) ; +// or +import binomialheap from 'aureooms-js-binomial-heap' ; +``` diff --git a/doc/scripts/header.js b/doc/scripts/header.js new file mode 100644 index 0000000..df005d7 --- /dev/null +++ b/doc/scripts/header.js @@ -0,0 +1,34 @@ +var domReady = function(callback) { + var state = document.readyState ; + if ( state === 'interactive' || state === 'complete' ) { + callback() ; + } + else { + document.addEventListener('DOMContentLoaded', callback); + } +} ; + + +domReady(function(){ + + var projectname = document.createElement('a'); + projectname.classList.add('project-name'); + projectname.text = 'aureooms/js-binomial-heap'; + projectname.href = './index.html' ; + + var header = document.getElementsByTagName('header')[0] ; + header.insertBefore(projectname,header.firstChild); + + var testlink = document.querySelector('header > a[data-ice="testLink"]') ; + testlink.href = 'https://coveralls.io/github/aureooms/js-binomial-heap' ; + testlink.target = '_BLANK' ; + + var searchBox = document.querySelector('.search-box'); + var input = document.querySelector('.search-input'); + + // active search box when focus on searchBox. + input.addEventListener('focus', function(){ + searchBox.classList.add('active'); + }); + +}); diff --git a/esdoc.json b/esdoc.json new file mode 100644 index 0000000..f2645d6 --- /dev/null +++ b/esdoc.json @@ -0,0 +1,37 @@ +{ + "source": "./src", + "destination": "./gh-pages", + "access": [ + "public", + "protected", + "private" + ], + "debug": false, + "index": "./README.md", + "package": "./package.json", + "title": "aureooms/js-binomial-heap", + "test": { + "type": "ava", + "source": "./test/src" + }, + "manual": { + "overview": [ + "./doc/manual/overview.md" + ], + "installation": [ + "./doc/manual/installation.md" + ], + "usage": [ + "./doc/manual/usage.md" + ], + "example": [ + "./doc/manual/example.md" + ] + }, + "styles": [ + "./doc/css/style.css" + ], + "scripts": [ + "./doc/scripts/header.js" + ] +} diff --git a/inch.json b/inch.json deleted file mode 100644 index bb05fa6..0000000 --- a/inch.json +++ /dev/null @@ -1,5 +0,0 @@ -{ - "files" : { - "included": [ "js/src/**/*.js" ] - } -} diff --git a/js/dist/binomial-heap.js b/js/dist/binomial-heap.js deleted file mode 100644 index 7cac1e7..0000000 --- a/js/dist/binomial-heap.js +++ /dev/null @@ -1,891 +0,0 @@ -"use strict"; - -(function () { - - "use strict"; - - var definition = function definition(exports, undefined) { - - /* js/src/BinomialHeap.js */ - var BinomialHeap = function BinomialHeap(BinomialTree) { - - var binomial_heap_push = function binomial_heap_push(compare, list, tree, rank) { - - var i, len; - - // ensures list has at least rank cells - - i = rank - list.length; - - while (i-- > 0) { - list.push(null); - } - - // loop invariant - // tree and list[i] have the same rank - - len = list.length; - - for (i = rank; i < len && list[i] !== null; ++i) { - - // there is already a tree with this rank - - tree = tree.merge(compare, list[i]); - list[i] = null; - } - - // do not forget to append null if - // we are lacking space - - if (i === len) { - list.push(null); - } - - // cell is empty - // we can just put the new tree here - - list[i] = tree; - }; - - var merge = function merge(compare, list, other) { - - var i, len, carry; - - if (other.length === 0) { - return; - } - - // merging two binomial heaps is like - // adding two little endian integers - // so, we first make sure that we have - // enough place to store the result - - i = other.length - list.length; - - while (i-- > 0) { - list.push(null); - } - - carry = null; - - len = list.length; - - // remember len >= other.length - - for (i = 0; i < len; ++i) { - - // other[i] can be either null or not - // list[i] can be either null or not - // carry can be either null or not - // --> 2^3 = 8 possibilities - // - // null ? | other[i] | list[i] | carry - // --------------------------------------- - // (0) | no | no | no - // (1) | no | no | yes - // (2) | no | yes | no - // (3) | no | yes | yes - // (4) | yes | no | no - // (5) | yes | no | yes - // (6) | yes | yes | no - // (7) | yes | yes | yes - - if (i >= other.length || other[i] === null) { - - if (carry !== null) { - - // (6) other[i] = null and list[i] = null and carry != null - // --> put carry in current cell - - if (list[i] === null) { - list[i] = carry; - carry = null; - } - - // (4) other[i] = null and list[i] != null and carry != null - // --> merge carry with current cell - - else { - carry = carry.merge(compare, list[i]); - list[i] = null; - } - } - - // We do not need to do anything for - // those 2 cases (carry and other[i] are null). - // == - // (5) other[i] = null and list[i] != null and carry = null - // (7) other[i] = null and list[i] = null and carry = null - } - - // (0) other[i] != null and list[i] != null and carry != null - // (2) other[i] != null and list[i] = null and carry != null - // --> merge carry with other[i] - - else if (carry !== null) { - - carry = carry.merge(compare, other[i]); - } - - // (1) other[i] != null and list[i] != null and carry = null - // --> merge current cell with other[i] - - else if (list[i] !== null) { - - carry = list[i].merge(compare, other[i]); - list[i] = null; - } - - // (3) other[i] != null and list[i] = null and carry = null - // --> put other[i] in list - - else { - - list[i] = other[i]; - } - } - - // do not forget to append last carry - - if (carry !== null) { - list.push(carry); - } - }; - - var find_min_index = function find_min_index(compare, list, j, len) { - - var i, opt, item, candidate; - - // there MUST be at least one - // non null element in this list - // we look for the first one - - for (; j < len - 1 && list[j] === null; ++j); - - // here j is necessarily < len - // and list[j] is non null - - i = j; - opt = list[j].value; - - // we lookup remaining elements to see if there - // is not a better candidate - - for (++j; j < len; ++j) { - - item = list[j]; - - if (item !== null) { - - candidate = item.value; - - if (compare(candidate, opt) < 0) { - - i = j; - opt = candidate; - } - } - } - - return i; - }; - - var remove_head_at_index = function remove_head_at_index(compare, list, i, len) { - - var orphans; - - orphans = list[i].children; - list[i] = null; - - change_parent(null, orphans); - - // we just removed the ith element - // if list[i] is the last cell - // of list we can drop it - - if (i === len - 1) { - list.pop(); - } - - // we merge back the children of - // the removed tree into the heap - - merge(compare, list, orphans); - }; - - var binomial_heap_pop = function binomial_heap_pop(compare, list) { - - var i, len, tree; - - len = list.length; - - i = find_min_index(compare, list, 0, len); - - tree = list[i]; - - remove_head_at_index(compare, list, i, len); - - return tree; - }; - - var change_parent = function change_parent(parent, children) { - - var i, len; - - for (i = 0, len = children.length; i < len; ++i) { - children[i].setparent(parent); - } - }; - - var shift_up = function shift_up(tree, parent) { - - var tmp, i; - - // console.log( "tree", tree.value ); - // console.log( "parent", parent.value ); - - // Here, we cannot just swap values as it would invalidate - // externally stored references. - // Instead, we swap children lists and update references - // between the tree and its parent. - // Then we update and return the new tree's parent. - - // console.log( "tree.children", tree.children ); - // console.log( "parent.children", parent.children ); - - tmp = parent.children; - parent.children = tree.children; - tree.children = tmp; - - i = parent.rank(); - - // console.log( tree.children, i ); - - tree.children[i] = parent; - - tree.parent = parent.parent; - - change_parent(tree, tree.children); - change_parent(parent, parent.children); - - // console.log( "tree.children", tree.children ); - // console.log( "parent.children", parent.children ); - - return tree.parent; - }; - - var percolate_up = function percolate_up(list, tree) { - - var tmp, parent; - - parent = tree.parent; - - if (parent !== null) { - - while (true) { - - parent = shift_up(tree, parent); - - if (parent === null) { - break; - } - - // TODO this call might not be necessary - parent.children[tree.rank()] = tree; - } - - list[tree.rank()] = tree; - } - }; - - var decreasekey = function decreasekey(compare, list, tree, value) { - - var d, tmp, parent; - - tree.value = value; - parent = tree.parent; - - if (parent !== null) { - - while (true) { - - d = compare(value, parent.value); - - if (d >= 0) { - return; - } - - parent = shift_up(tree, parent); - - if (parent === null) { - break; - } - - // TODO this call should be in if ( d >= 0 ) - parent.children[tree.rank()] = tree; - } - - list[tree.rank()] = tree; - } - }; - - var deletetree = function deletetree(compare, list, tree) { - - percolate_up(list, tree); - - remove_head_at_index(compare, list, tree.rank(), list.length); - - tree.detach(); - }; - - var Heap = function Heap(compare) { - - // the compare function to use to compare values - - this.compare = compare; - - // number of elements in this heap - - this.length = 0; - - // list of binomial trees - - this.list = []; - }; - - Heap.prototype.head = function () { - - var i, tree; - - if (this.length === 0) { - return undefined; - } - - i = find_min_index(this.compare, this.list, 0, this.list.length); - - tree = this.list[i]; - - return tree.value; - }; - - Heap.prototype.headreference = function () { - - var i, tree; - - if (this.length === 0) { - return null; - } - - i = find_min_index(this.compare, this.list, 0, this.list.length); - - tree = this.list[i]; - - return tree; - }; - - Heap.prototype.pop = function () { - - if (this.length === 0) { - return undefined; - } - - --this.length; - - return binomial_heap_pop(this.compare, this.list).value; - }; - - Heap.prototype.popreference = function () { - - if (this.length === 0) { - return null; - } - - --this.length; - - return binomial_heap_pop(this.compare, this.list).detach(); - }; - - Heap.prototype.push = function (value) { - - var tree; - - // push a new tree of rank 0 - - tree = new BinomialTree(value, []); - - this.pushreference(tree); - - return tree; - }; - - Heap.prototype.pushreference = function (tree) { - - ++this.length; - - // push an existing tree of rank 0 - - binomial_heap_push(this.compare, this.list, tree, 0); - }; - - Heap.prototype.merge = function (other) { - - merge(this.compare, this.list, other.list); - - this.length += other.length; - - return this; - }; - - Heap.prototype.update = function (tree, value) { - - var d; - - d = this.compare(value, tree.value); - - if (d < 0) { - this.decreasekey(tree, value); - } else if (d > 0) { - this.increasekey(tree, value); - } else { - - // d === 0 does not imply tree.value === value - - tree.value = value; - } - }; - - Heap.prototype.decreasekey = function (tree, value) { - - decreasekey(this.compare, this.list, tree, value); - }; - - Heap.prototype.increasekey = function (tree, value) { - - deletetree(this.compare, this.list, tree); - - tree.value = value; - - binomial_heap_push(this.compare, this.list, tree, 0); - }; - - Heap.prototype["delete"] = function (tree) { - - --this.length; - - deletetree(this.compare, this.list, tree); - }; - - return Heap; - }; - - exports.BinomialHeap = BinomialHeap; - - /* js/src/BinomialTree.js */ - - var BinomialTree = function BinomialTree(value, children) { - this.value = value; - this.children = children; - }; - - /** - * /!\ Can only be used to merge two trees of the same rank. - * /!\ Modifies both trees - */ - - BinomialTree.prototype.merge = function (predicate, other) { - - if (predicate(this.value, other.value) <= 0) { - this.children = this.children.concat(other); - return this; - } else { - other.children = other.children.concat(this); - return other; - } - }; - - /** - * Method used to reset a tree element in order to reuse it - * somewhere else, e.g. insert it back in the same or a new - * heap. - */ - - BinomialTree.prototype.detach = function () { - this.children.splice(0); - return this; - }; - - BinomialTree.prototype.setparent = function (parent) {}; - - exports.BinomialTree = BinomialTree; - - /* js/src/BinomialTreeWithParent.js */ - - var BinomialTreeWithParent = function BinomialTreeWithParent(value, children) { - this.value = value; - this.children = children; - this.parent = null; - }; - - BinomialTreeWithParent.prototype.rank = function () { - return this.children.length; - }; - - /** - * /!\ Can only be used to merge two trees of the same rank. - * /!\ Modifies both trees - */ - - BinomialTreeWithParent.prototype.merge = function (predicate, other) { - - if (predicate(this.value, other.value) <= 0) { - this.children = this.children.concat(other); - other.parent = this; - return this; - } else { - other.children = other.children.concat(this); - this.parent = other; - return other; - } - }; - - /** - * Method used to reset a tree element in order to reuse it - * somewhere else, e.g. insert it back in the same or a new - * heap. - */ - - BinomialTreeWithParent.prototype.detach = function () { - this.children.splice(0); - this.parent = null; - return this; - }; - - BinomialTreeWithParent.prototype.setparent = function (parent) { - this.parent = parent; - }; - - exports.BinomialTreeWithParent = BinomialTreeWithParent; - - /* js/src/LazyBinomialHeap.js */ - - var LazyBinomialHeap = function LazyBinomialHeap(BinomialTree) { - - var lazy_binomial_heap_push = function lazy_binomial_heap_push(lazy, tree, rank) { - - var i, sequence; - - // lightweight binomial heap containing a unique tree - - sequence = []; - - // offset tree by its rank - - i = rank; - - while (i--) { - sequence.push(null); - } - - sequence.push(tree); - - // do not merge the generated sequence immediately - - lazy.push(sequence); - }; - - var merge = function merge(compare, list, other) { - - var i, len, carry; - - if (other.length === 0) { - return; - } - - // merging two binomial heaps is like - // adding two little endian integers - // so, we first make sure that we have - // enough place to store the result - - i = other.length - list.length; - - while (i-- > 0) { - list.push(null); - } - - carry = null; - - len = list.length; - - // remember len >= other.length - - for (i = 0; i < len; ++i) { - - // other[i] can be either null or not - // list[i] can be either null or not - // carry can be either null or not - // --> 2^3 = 8 possibilities - // - // null ? | other[i] | list[i] | carry - // --------------------------------------- - // (0) | no | no | no - // (1) | no | no | yes - // (2) | no | yes | no - // (3) | no | yes | yes - // (4) | yes | no | no - // (5) | yes | no | yes - // (6) | yes | yes | no - // (7) | yes | yes | yes - - if (i >= other.length || other[i] === null) { - - if (carry !== null) { - - // (6) other[i] = null and list[i] = null and carry != null - // --> put carry in current cell - - if (list[i] === null) { - list[i] = carry; - carry = null; - } - - // (4) other[i] = null and list[i] != null and carry != null - // --> merge carry with current cell - - else { - carry = carry.merge(compare, list[i]); - list[i] = null; - } - } - - // We do not need to do anything for - // those 2 cases (carry and other[i] are null). - // == - // (5) other[i] = null and list[i] != null and carry = null - // (7) other[i] = null and list[i] = null and carry = null - } - - // (0) other[i] != null and list[i] != null and carry != null - // (2) other[i] != null and list[i] = null and carry != null - // --> merge carry with other[i] - - else if (carry !== null) { - - carry = carry.merge(compare, other[i]); - } - - // (1) other[i] != null and list[i] != null and carry = null - // --> merge current cell with other[i] - - else if (list[i] !== null) { - - carry = list[i].merge(compare, other[i]); - list[i] = null; - } - - // (3) other[i] != null and list[i] = null and carry = null - // --> put other[i] in list - - else { - - list[i] = other[i]; - } - } - - // do not forget to append last carry - - if (carry !== null) { - list.push(carry); - } - }; - - var lazy_binomial_heap_pop = function lazy_binomial_heap_pop(compare, list, lazy) { - - var i, j, len, opt, item, candidate, orphan; - - // amortized merge of - // stored values - - while (!lazy.empty()) merge(compare, list, lazy.pop()); - - // standard O(log n) optimum search method - - len = list.length; - - // there MUST be at least one - // non null element in this list - // we look for the first one - - for (j = 0; j < len - 1 && list[j] === null; ++j); - - // here j is necessarily < len - // and list[j] is non null - - i = j; - opt = list[j].value; - - // we lookup remaining elements to see if there - // is not a better candidate - - for (++j; j < len; ++j) { - - item = list[j]; - - if (item !== null) { - - candidate = item.value; - - if (compare(candidate, opt) < 0) { - - i = j; - opt = candidate; - } - } - } - - orphan = list[i].children; - list[i] = null; - - // we just removed the ith element - // if list[i] is the last cell - // of list we can drop it - - if (i === len - 1) { - list.pop(); - } - - // we store the children in the - // lazy list - - lazy.push(orphan); - - return opt; - }; - - var Heap = function Heap(compare) { - - // the compare function to use to compare values - - this.compare = compare; - - // number of elements in this heap - - this.length = 0; - - // list of binomial trees - - this.list = []; - - // list of binomial heaps waiting to be merged - - this.lazy = new LazyStack(); - }; - - Heap.prototype.pop = function () { - - if (this.length === 0) { - return undefined; - } - - --this.length; - - return lazy_binomial_heap_pop(this.compare, this.list, this.lazy); - }; - - Heap.prototype.push = function (value) { - - ++this.length; - - // push a new tree of rank 0 - - return lazy_binomial_heap_push(this.lazy, new BinomialTree(value, []), 0); - }; - - Heap.prototype.merge = function (other) { - - this.lazy.meld(other.lazy); - - this.length += other.length; - - return this; - }; - - return Heap; - }; - - exports.LazyBinomialHeap = LazyBinomialHeap; - - /* js/src/LazyList.js */ - - /** - * LazyStack#peek only valid if LazyStack#empty is false. - * LazyStack#shift only valid if LazyStack#empty is false. - */ - - var LazyStack = function LazyStack() { - - this.top = null; - this.bottom = null; - }; - - LazyStack.prototype.empty = function () { - - return this.top === null; - }; - - LazyStack.prototype.push = function (value) { - - this.top = new LazyNode(value, this.top); - - if (this.bottom === null) this.bottom = this.top; - }; - - /** - * Only valid if LazyStack#empty is false. - */ - - LazyStack.prototype.pop = function () { - - var value; - - value = this.top.value; - - this.top = this.top.next; - - if (this.top === null) this.bottom = null; - - return value; - }; - - LazyStack.prototype.meld = function (other) { - - if (this.bottom === null) this.top = other.top;else this.bottom.next = other.top; - - this.bottom = other.bottom; - }; - - exports.LazyStack = LazyStack; - - /* js/src/LazyNode.js */ - - var LazyNode = function LazyNode(value, next) { - - this.value = value; - this.next = next; - }; - - exports.LazyNode = LazyNode; - - return exports; - }; - if (typeof exports === "object") { - definition(exports); - } else if (typeof define === "function" && define.amd) { - define("aureooms-js-binomial-heap", [], function () { - return definition({}); - }); - } else if (typeof window === "object" && typeof window.document === "object") { - definition(window["binomialheap"] = {}); - } else console.error("unable to detect type of module to define for aureooms-js-binomial-heap"); -})(); - -// we do not keep track of any parent here \ No newline at end of file diff --git a/js/dist/binomial-heap.js.map b/js/dist/binomial-heap.js.map deleted file mode 100644 index 6fc76bd..0000000 --- a/js/dist/binomial-heap.js.map +++ /dev/null @@ -1 +0,0 @@ -{"version":3,"file":"js/dist/binomial-heap.js.map","sources":["js/dist/binomial-heap.js"],"names":["definition","exports","undefined","BinomialHeap","BinomialTree","binomial_heap_push","compare","list","tree","rank","i","len","length","push","merge","other","carry","find_min_index","j","opt","item","candidate","value","remove_head_at_index","orphans","children","change_parent","pop","binomial_heap_pop","parent","setparent","shift_up","tmp","percolate_up","decreasekey","d","deletetree","detach","Heap","this","prototype","head","headreference","popreference","pushreference","update","increasekey","predicate","concat","splice","BinomialTreeWithParent","LazyBinomialHeap","lazy_binomial_heap_push","lazy","sequence","lazy_binomial_heap_pop","orphan","empty","LazyStack","meld","top","bottom","LazyNode","next","define","amd","window","document","console","error"],"mappings":"AAAA,cAEA,WAIC,GAAIA,GAAa,SAAoBC,EAASC,GAG7C,GAAIC,GAAe,SAAsBC,GAExC,GAAIC,GAAqB,SAA4BC,EAASC,EAAMC,EAAMC,GAEzE,GAAIC,GAAGC,CAMP,KAFAD,EAAID,EAAOF,EAAKK,OAETF,IAAM,GACZH,EAAKM,KAAK,KAQX,KAFAF,EAAMJ,EAAKK,OAENF,EAAID,EAAUE,EAAJD,GAAuB,OAAZH,EAAKG,KAAeA,EAI7CF,EAAOA,EAAKM,MAAMR,EAASC,EAAKG,IAChCH,EAAKG,GAAK,IAMPA,KAAMC,GACTJ,EAAKM,KAAK,MAMXN,EAAKG,GAAKF,GAGPM,EAAQ,SAAeR,EAASC,EAAMQ,GAEzC,GAAIL,GAAGC,EAAKK,CAEZ,IAAqB,IAAjBD,EAAMH,OAAV,CAWA,IAFAF,EAAIK,EAAMH,OAASL,EAAKK,OAEjBF,IAAM,GACZH,EAAKM,KAAK,KASX,KANAG,EAAQ,KAERL,EAAMJ,EAAKK,OAINF,EAAI,EAAOC,EAAJD,IAAWA,EAkBlBA,GAAKK,EAAMH,QAAuB,OAAbG,EAAML,GAEhB,OAAVM,IAKa,OAAZT,EAAKG,IACRH,EAAKG,GAAKM,EACVA,EAAQ,OAORA,EAAQA,EAAMF,MAAMR,EAASC,EAAKG,IAClCH,EAAKG,GAAK,OAeM,OAAVM,EAERA,EAAQA,EAAMF,MAAMR,EAASS,EAAML,IAMf,OAAZH,EAAKG,IAEbM,EAAQT,EAAKG,GAAGI,MAAMR,EAASS,EAAML,IACrCH,EAAKG,GAAK,MAQVH,EAAKG,GAAKK,EAAML,EAMJ,QAAVM,GACHT,EAAKM,KAAKG,KAIRC,EAAiB,SAAwBX,EAASC,EAAMW,EAAGP,GAQ9D,IANA,GAAID,GAAGS,EAAKC,EAAMC,EAMPV,EAAM,EAAVO,GAA2B,OAAZX,EAAKW,KAAeA,GAW1C,IANAR,EAAIQ,EACJC,EAAMZ,EAAKW,GAAGI,QAKPJ,EAAOP,EAAJO,IAAWA,EAEpBE,EAAOb,EAAKW,GAEC,OAATE,IAEHC,EAAYD,EAAKE,MAEbhB,EAAQe,EAAWF,GAAO,IAE7BT,EAAIQ,EACJC,EAAME,GAKT,OAAOX,IAGJa,EAAuB,SAA8BjB,EAASC,EAAMG,EAAGC,GAE1E,GAAIa,EAEJA,GAAUjB,EAAKG,GAAGe,SAClBlB,EAAKG,GAAK,KAEVgB,EAAc,KAAMF,GAMhBd,IAAMC,EAAM,GACfJ,EAAKoB,MAMNb,EAAMR,EAASC,EAAMiB,IAGlBI,EAAoB,SAA2BtB,EAASC,GAE3D,GAAIG,GAAGC,EAAKH,CAUZ,OARAG,GAAMJ,EAAKK,OAEXF,EAAIO,EAAeX,EAASC,EAAM,EAAGI,GAErCH,EAAOD,EAAKG,GAEZa,EAAqBjB,EAASC,EAAMG,EAAGC,GAEhCH,GAGJkB,EAAgB,SAAuBG,EAAQJ,GAElD,GAAIf,GAAGC,CAEP,KAAKD,EAAI,EAAGC,EAAMc,EAASb,OAAYD,EAAJD,IAAWA,EAC7Ce,EAASf,GAAGoB,UAAUD,IAIpBE,EAAW,SAAkBvB,EAAMqB,GAEtC,GAAIG,GAAKtB,CAgCT,OAlBAsB,GAAMH,EAAOJ,SACbI,EAAOJ,SAAWjB,EAAKiB,SACvBjB,EAAKiB,SAAWO,EAEhBtB,EAAImB,EAAOpB,OAIXD,EAAKiB,SAASf,GAAKmB,EAEnBrB,EAAKqB,OAASA,EAAOA,OAErBH,EAAclB,EAAMA,EAAKiB,UACzBC,EAAcG,EAAQA,EAAOJ,UAKtBjB,EAAKqB,QAGTI,EAAe,SAAsB1B,EAAMC,GAE9C,GAASqB,EAIT,IAFAA,EAASrB,EAAKqB,OAEC,OAAXA,EAAiB,CAEpB,OAAa,CAIZ,GAFAA,EAASE,EAASvB,EAAMqB,GAET,OAAXA,EACH,KAIDA,GAAOJ,SAASjB,EAAKC,QAAUD,EAGhCD,EAAKC,EAAKC,QAAUD,IAIlB0B,EAAc,SAAqB5B,EAASC,EAAMC,EAAMc,GAE3D,GAAIa,GAAQN,CAKZ,IAHArB,EAAKc,MAAQA,EACbO,EAASrB,EAAKqB,OAEC,OAAXA,EAAiB,CAEpB,OAAa,CAIZ,GAFAM,EAAI7B,EAAQgB,EAAOO,EAAOP,OAEtBa,GAAK,EACR,MAKD,IAFAN,EAASE,EAASvB,EAAMqB,GAET,OAAXA,EACH,KAIDA,GAAOJ,SAASjB,EAAKC,QAAUD,EAGhCD,EAAKC,EAAKC,QAAUD,IAIlB4B,EAAa,SAAoB9B,EAASC,EAAMC,GAEnDyB,EAAa1B,EAAMC,GAEnBe,EAAqBjB,EAASC,EAAMC,EAAKC,OAAQF,EAAKK,QAEtDJ,EAAK6B,UAGFC,EAAO,SAAchC,GAIxBiC,KAAKjC,QAAUA,EAIfiC,KAAK3B,OAAS,EAId2B,KAAKhC,QA6HN,OA1HA+B,GAAKE,UAAUC,KAAO,WAErB,GAAI/B,GAAGF,CAEP,OAAoB,KAAhB+B,KAAK3B,OACDV,GAGRQ,EAAIO,EAAesB,KAAKjC,QAASiC,KAAKhC,KAAM,EAAGgC,KAAKhC,KAAKK,QAEzDJ,EAAO+B,KAAKhC,KAAKG,GAEVF,EAAKc,QAGbgB,EAAKE,UAAUE,cAAgB,WAE9B,GAAIhC,GAAGF,CAEP,OAAoB,KAAhB+B,KAAK3B,OACD,MAGRF,EAAIO,EAAesB,KAAKjC,QAASiC,KAAKhC,KAAM,EAAGgC,KAAKhC,KAAKK,QAEzDJ,EAAO+B,KAAKhC,KAAKG,KAKlB4B,EAAKE,UAAUb,IAAM,WAEpB,MAAoB,KAAhBY,KAAK3B,OACDV,KAGNqC,KAAK3B,OAEAgB,EAAkBW,KAAKjC,QAASiC,KAAKhC,MAAMe,QAGnDgB,EAAKE,UAAUG,aAAe,WAE7B,MAAoB,KAAhBJ,KAAK3B,OACD,QAGN2B,KAAK3B,OAEAgB,EAAkBW,KAAKjC,QAASiC,KAAKhC,MAAM8B,WAGnDC,EAAKE,UAAU3B,KAAO,SAAUS,GAE/B,GAAId,EAQJ,OAJAA,GAAO,GAAIJ,GAAakB,MAExBiB,KAAKK,cAAcpC,GAEZA,GAGR8B,EAAKE,UAAUI,cAAgB,SAAUpC,KAEtC+B,KAAK3B,OAIPP,EAAmBkC,KAAKjC,QAASiC,KAAKhC,KAAMC,EAAM,IAGnD8B,EAAKE,UAAU1B,MAAQ,SAAUC,GAMhC,MAJAD,GAAMyB,KAAKjC,QAASiC,KAAKhC,KAAMQ,EAAMR,MAErCgC,KAAK3B,QAAUG,EAAMH,OAEd2B,MAGRD,EAAKE,UAAUK,OAAS,SAAUrC,EAAMc,GAEvC,GAAIa,EAEJA,GAAII,KAAKjC,QAAQgB,EAAOd,EAAKc,OAErB,EAAJa,EACHI,KAAKL,YAAY1B,EAAMc,GACba,EAAI,EACdI,KAAKO,YAAYtC,EAAMc,GAKvBd,EAAKc,MAAQA,GAIfgB,EAAKE,UAAUN,YAAc,SAAU1B,EAAMc,GAE5CY,EAAYK,KAAKjC,QAASiC,KAAKhC,KAAMC,EAAMc,IAG5CgB,EAAKE,UAAUM,YAAc,SAAUtC,EAAMc,GAE5Cc,EAAWG,KAAKjC,QAASiC,KAAKhC,KAAMC,GAEpCA,EAAKc,MAAQA,EAEbjB,EAAmBkC,KAAKjC,QAASiC,KAAKhC,KAAMC,EAAM,IAGnD8B,EAAKE,UAAU,UAAY,SAAUhC,KAElC+B,KAAK3B,OAEPwB,EAAWG,KAAKjC,QAASiC,KAAKhC,KAAMC,IAG9B8B,EAGRrC,GAAQE,aAAeA,CAIvB,IAAIC,GAAe,SAAsBkB,EAAOG,GAC/Cc,KAAKjB,MAAQA,EACbiB,KAAKd,SAAWA,EAQjBrB,GAAaoC,UAAU1B,MAAQ,SAAUiC,EAAWhC,GAEnD,MAAIgC,GAAUR,KAAKjB,MAAOP,EAAMO,QAAU,GACzCiB,KAAKd,SAAWc,KAAKd,SAASuB,OAAOjC,GAC9BwB,OAEPxB,EAAMU,SAAWV,EAAMU,SAASuB,OAAOT,MAChCxB,IAUTX,EAAaoC,UAAUH,OAAS,WAE/B,MADAE,MAAKd,SAASwB,OAAO,GACdV,MAGRnC,EAAaoC,UAAUV,UAAY,SAAUD,KAE7C5B,EAAQG,aAAeA,CAIvB,IAAI8C,GAAyB,SAAgC5B,EAAOG,GACnEc,KAAKjB,MAAQA,EACbiB,KAAKd,SAAWA,EAChBc,KAAKV,OAAS,KAGfqB,GAAuBV,UAAU/B,KAAO,WACvC,MAAO8B,MAAKd,SAASb,QAQtBsC,EAAuBV,UAAU1B,MAAQ,SAAUiC,EAAWhC,GAE7D,MAAIgC,GAAUR,KAAKjB,MAAOP,EAAMO,QAAU,GACzCiB,KAAKd,SAAWc,KAAKd,SAASuB,OAAOjC,GACrCA,EAAMc,OAASU,KACRA,OAEPxB,EAAMU,SAAWV,EAAMU,SAASuB,OAAOT,MACvCA,KAAKV,OAASd,EACPA,IAUTmC,EAAuBV,UAAUH,OAAS,WAGzC,MAFAE,MAAKd,SAASwB,OAAO,GACrBV,KAAKV,OAAS,KACPU,MAGRW,EAAuBV,UAAUV,UAAY,SAAUD,GACtDU,KAAKV,OAASA,GAGf5B,EAAQiD,uBAAyBA,CAIjC,IAAIC,GAAmB,SAA0B/C,GAEhD,GAAIgD,GAA0B,SAAiCC,EAAM7C,EAAMC,GAE1E,GAAIC,GAAG4C,CAUP,KANAA,KAIA5C,EAAID,EAEGC,KACN4C,EAASzC,KAAK,KAGfyC,GAASzC,KAAKL,GAId6C,EAAKxC,KAAKyC,IAGPxC,EAAQ,SAAeR,EAASC,EAAMQ,GAEzC,GAAIL,GAAGC,EAAKK,CAEZ,IAAqB,IAAjBD,EAAMH,OAAV,CAWA,IAFAF,EAAIK,EAAMH,OAASL,EAAKK,OAEjBF,IAAM,GACZH,EAAKM,KAAK,KASX,KANAG,EAAQ,KAERL,EAAMJ,EAAKK,OAINF,EAAI,EAAOC,EAAJD,IAAWA,EAkBlBA,GAAKK,EAAMH,QAAuB,OAAbG,EAAML,GAEhB,OAAVM,IAKa,OAAZT,EAAKG,IACRH,EAAKG,GAAKM,EACVA,EAAQ,OAORA,EAAQA,EAAMF,MAAMR,EAASC,EAAKG,IAClCH,EAAKG,GAAK,OAeM,OAAVM,EAERA,EAAQA,EAAMF,MAAMR,EAASS,EAAML,IAMf,OAAZH,EAAKG,IAEbM,EAAQT,EAAKG,GAAGI,MAAMR,EAASS,EAAML,IACrCH,EAAKG,GAAK,MAQVH,EAAKG,GAAKK,EAAML,EAMJ,QAAVM,GACHT,EAAKM,KAAKG,KAIRuC,EAAyB,SAAgCjD,EAASC,EAAM8C,GAO3E,IALA,GAAI3C,GAAGQ,EAAGP,EAAKQ,EAAKC,EAAMC,EAAWmC,GAK7BH,EAAKI,SAAS3C,EAAMR,EAASC,EAAM8C,EAAK1B,MAUhD,KANAhB,EAAMJ,EAAKK,OAMNM,EAAI,EAAOP,EAAM,EAAVO,GAA2B,OAAZX,EAAKW,KAAeA,GAW/C,IANAR,EAAIQ,EACJC,EAAMZ,EAAKW,GAAGI,QAKPJ,EAAOP,EAAJO,IAAWA,EAEpBE,EAAOb,EAAKW,GAEC,OAATE,IAEHC,EAAYD,EAAKE,MAEbhB,EAAQe,EAAWF,GAAO,IAE7BT,EAAIQ,EACJC,EAAME,GAqBT,OAhBAmC,GAASjD,EAAKG,GAAGe,SACjBlB,EAAKG,GAAK,KAMNA,IAAMC,EAAM,GACfJ,EAAKoB,MAMN0B,EAAKxC,KAAK2C,GAEHrC,GAGJmB,EAAO,SAAchC,GAIxBiC,KAAKjC,QAAUA,EAIfiC,KAAK3B,OAAS,EAId2B,KAAKhC,QAILgC,KAAKc,KAAO,GAAIK,GAgCjB,OA7BApB,GAAKE,UAAUb,IAAM,WAEpB,MAAoB,KAAhBY,KAAK3B,OACDV,KAGNqC,KAAK3B,OAEA2C,EAAuBhB,KAAKjC,QAASiC,KAAKhC,KAAMgC,KAAKc,QAG7Df,EAAKE,UAAU3B,KAAO,SAAUS,GAM/B,QAJEiB,KAAK3B,OAIAwC,EAAwBb,KAAKc,KAAM,GAAIjD,GAAakB,MAAY,IAGxEgB,EAAKE,UAAU1B,MAAQ,SAAUC,GAMhC,MAJAwB,MAAKc,KAAKM,KAAK5C,EAAMsC,MAErBd,KAAK3B,QAAUG,EAAMH,OAEd2B,MAGDD,EAGRrC,GAAQkD,iBAAmBA,CAS3B,IAAIO,GAAY,WAEfnB,KAAKqB,IAAM,KACXrB,KAAKsB,OAAS,KAGfH,GAAUlB,UAAUiB,MAAQ,WAE3B,MAAoB,QAAblB,KAAKqB,KAGbF,EAAUlB,UAAU3B,KAAO,SAAUS,GAEpCiB,KAAKqB,IAAM,GAAIE,GAASxC,EAAOiB,KAAKqB,KAEhB,OAAhBrB,KAAKsB,SAAiBtB,KAAKsB,OAAStB,KAAKqB,MAO9CF,EAAUlB,UAAUb,IAAM,WAEzB,GAAIL,EAQJ,OANAA,GAAQiB,KAAKqB,IAAItC,MAEjBiB,KAAKqB,IAAMrB,KAAKqB,IAAIG,KAEH,OAAbxB,KAAKqB,MAAcrB,KAAKsB,OAAS,MAE9BvC,GAGRoC,EAAUlB,UAAUmB,KAAO,SAAU5C,GAEhB,OAAhBwB,KAAKsB,OAAiBtB,KAAKqB,IAAM7C,EAAM6C,IAASrB,KAAKsB,OAAOE,KAAOhD,EAAM6C,IAE7ErB,KAAKsB,OAAS9C,EAAM8C,QAGrB5D,EAAQyD,UAAYA,CAIpB,IAAII,GAAW,SAAkBxC,EAAOyC,GAEvCxB,KAAKjB,MAAQA,EACbiB,KAAKwB,KAAOA,EAKb,OAFA9D,GAAQ6D,SAAWA,EAEZ7D,EAEe,iBAAZA,SACVD,EAAWC,SACiB,kBAAX+D,SAAyBA,OAAOC,IACjDD,OAAO,+BAAiC,WACvC,MAAOhE,SAEoB,gBAAXkE,SAAkD,gBAApBA,QAAOC,SACtDnE,EAAWkE,OAAqB,iBAC1BE,QAAQC,MAAM"} \ No newline at end of file diff --git a/js/dist/binomial-heap.min.js b/js/dist/binomial-heap.min.js deleted file mode 100644 index 556f668..0000000 --- a/js/dist/binomial-heap.min.js +++ /dev/null @@ -1,2 +0,0 @@ -"use strict";!function(){var t=function(t,n){var e=function(t){var e=function(t,n,e,i){var l,r;for(l=i-n.length;l-->0;)n.push(null);for(r=n.length,l=i;r>l&&null!==n[l];++l)e=e.merge(t,n[l]),n[l]=null;l===r&&n.push(null),n[l]=e},i=function(t,n,e){var i,l,r;if(0!==e.length){for(i=e.length-n.length;i-->0;)n.push(null);for(r=null,l=n.length,i=0;l>i;++i)i>=e.length||null===e[i]?null!==r&&(null===n[i]?(n[i]=r,r=null):(r=r.merge(t,n[i]),n[i]=null)):null!==r?r=r.merge(t,e[i]):null!==n[i]?(r=n[i].merge(t,e[i]),n[i]=null):n[i]=e[i];null!==r&&n.push(r)}},l=function(t,n,e,i){for(var l,r,o,h;i-1>e&&null===n[e];++e);for(l=e,r=n[e].value,++e;i>e;++e)o=n[e],null!==o&&(h=o.value,t(h,r)<0&&(l=e,r=h));return l},r=function(t,n,e,l){var r;r=n[e].children,n[e]=null,h(null,r),e===l-1&&n.pop(),i(t,n,r)},o=function(t,n){var e,i,o;return i=n.length,e=l(t,n,0,i),o=n[e],r(t,n,e,i),o},h=function(t,n){var e,i;for(e=0,i=n.length;i>e;++e)n[e].setparent(t)},u=function(t,n){var e,i;return e=n.children,n.children=t.children,t.children=e,i=n.rank(),t.children[i]=n,t.parent=n.parent,h(t,t.children),h(n,n.children),t.parent},s=function(t,n){var e;if(e=n.parent,null!==e){for(;;){if(e=u(n,e),null===e)break;e.children[n.rank()]=n}t[n.rank()]=n}},p=function(t,n,e,i){var l,r;if(e.value=i,r=e.parent,null!==r){for(;;){if(l=t(i,r.value),l>=0)return;if(r=u(e,r),null===r)break;r.children[e.rank()]=e}n[e.rank()]=e}},a=function(t,n,e){s(n,e),r(t,n,e.rank(),n.length),e.detach()},c=function(t){this.compare=t,this.length=0,this.list=[]};return c.prototype.head=function(){var t,e;return 0===this.length?n:(t=l(this.compare,this.list,0,this.list.length),e=this.list[t],e.value)},c.prototype.headreference=function(){var t,n;return 0===this.length?null:(t=l(this.compare,this.list,0,this.list.length),n=this.list[t])},c.prototype.pop=function(){return 0===this.length?n:(--this.length,o(this.compare,this.list).value)},c.prototype.popreference=function(){return 0===this.length?null:(--this.length,o(this.compare,this.list).detach())},c.prototype.push=function(n){var e;return e=new t(n,[]),this.pushreference(e),e},c.prototype.pushreference=function(t){++this.length,e(this.compare,this.list,t,0)},c.prototype.merge=function(t){return i(this.compare,this.list,t.list),this.length+=t.length,this},c.prototype.update=function(t,n){var e;e=this.compare(n,t.value),0>e?this.decreasekey(t,n):e>0?this.increasekey(t,n):t.value=n},c.prototype.decreasekey=function(t,n){p(this.compare,this.list,t,n)},c.prototype.increasekey=function(t,n){a(this.compare,this.list,t),t.value=n,e(this.compare,this.list,t,0)},c.prototype["delete"]=function(t){--this.length,a(this.compare,this.list,t)},c};t.BinomialHeap=e;var i=function(t,n){this.value=t,this.children=n};i.prototype.merge=function(t,n){return t(this.value,n.value)<=0?(this.children=this.children.concat(n),this):(n.children=n.children.concat(this),n)},i.prototype.detach=function(){return this.children.splice(0),this},i.prototype.setparent=function(t){},t.BinomialTree=i;var l=function(t,n){this.value=t,this.children=n,this.parent=null};l.prototype.rank=function(){return this.children.length},l.prototype.merge=function(t,n){return t(this.value,n.value)<=0?(this.children=this.children.concat(n),n.parent=this,this):(n.children=n.children.concat(this),this.parent=n,n)},l.prototype.detach=function(){return this.children.splice(0),this.parent=null,this},l.prototype.setparent=function(t){this.parent=t},t.BinomialTreeWithParent=l;var r=function(t){var e=function(t,n,e){var i,l;for(l=[],i=e;i--;)l.push(null);l.push(n),t.push(l)},i=function(t,n,e){var i,l,r;if(0!==e.length){for(i=e.length-n.length;i-->0;)n.push(null);for(r=null,l=n.length,i=0;l>i;++i)i>=e.length||null===e[i]?null!==r&&(null===n[i]?(n[i]=r,r=null):(r=r.merge(t,n[i]),n[i]=null)):null!==r?r=r.merge(t,e[i]):null!==n[i]?(r=n[i].merge(t,e[i]),n[i]=null):n[i]=e[i];null!==r&&n.push(r)}},l=function(t,n,e){for(var l,r,o,h,u,s,p;!e.empty();)i(t,n,e.pop());for(o=n.length,r=0;o-1>r&&null===n[r];++r);for(l=r,h=n[r].value,++r;o>r;++r)u=n[r],null!==u&&(s=u.value,t(s,h)<0&&(l=r,h=s));return p=n[l].children,n[l]=null,l===o-1&&n.pop(),e.push(p),h},r=function(t){this.compare=t,this.length=0,this.list=[],this.lazy=new o};return r.prototype.pop=function(){return 0===this.length?n:(--this.length,l(this.compare,this.list,this.lazy))},r.prototype.push=function(n){return++this.length,e(this.lazy,new t(n,[]),0)},r.prototype.merge=function(t){return this.lazy.meld(t.lazy),this.length+=t.length,this},r};t.LazyBinomialHeap=r;var o=function(){this.top=null,this.bottom=null};o.prototype.empty=function(){return null===this.top},o.prototype.push=function(t){this.top=new h(t,this.top),null===this.bottom&&(this.bottom=this.top)},o.prototype.pop=function(){var t;return t=this.top.value,this.top=this.top.next,null===this.top&&(this.bottom=null),t},o.prototype.meld=function(t){null===this.bottom?this.top=t.top:this.bottom.next=t.top,this.bottom=t.bottom},t.LazyStack=o;var h=function(t,n){this.value=t,this.next=n};return t.LazyNode=h,t};"object"==typeof exports?t(exports):"function"==typeof define&&define.amd?define("aureooms-js-binomial-heap",[],function(){return t({})}):"object"==typeof window&&"object"==typeof window.document?t(window.binomialheap={}):console.error("unable to detect type of module to define for aureooms-js-binomial-heap")}(); -//# sourceMappingURL=js/dist/binomial-heap.js.map \ No newline at end of file diff --git a/js/index.js b/js/index.js deleted file mode 100644 index e6e928c..0000000 --- a/js/index.js +++ /dev/null @@ -1,15 +0,0 @@ -var pkg = require('aureooms-node-package'); - -var fs = require('fs'); -var data = fs.readFileSync(pkg.config, 'utf8'); -var opt = JSON.parse(data); - -opt = { - name : opt.name, - src : __dirname + '/src/', - exports : module.exports, - base : 0, - debug : opt.debug -}; - -pkg.include(opt); diff --git a/js/src/LazyNode.js b/js/src/LazyNode.js deleted file mode 100644 index d488fbd..0000000 --- a/js/src/LazyNode.js +++ /dev/null @@ -1,9 +0,0 @@ - -var LazyNode = function ( value , next ) { - - this.value = value ; - this.next = next ; - -} ; - -exports.LazyNode = LazyNode ; diff --git a/lib/BinomialHeap.js b/lib/BinomialHeap.js new file mode 100644 index 0000000..347563b --- /dev/null +++ b/lib/BinomialHeap.js @@ -0,0 +1,477 @@ +"use strict"; + +Object.defineProperty(exports, "__esModule", { + value: true +}); +exports.default = BinomialHeap; +function BinomialHeap(BinomialTree) { + + var binomial_heap_push = function binomial_heap_push(compare, list, tree, rank) { + + var i, len; + + // ensures list has at least rank cells + + i = rank - list.length; + + while (i-- > 0) { + list.push(null); + } + + // loop invariant + // tree and list[i] have the same rank + + len = list.length; + + for (i = rank; i < len && list[i] !== null; ++i) { + + // there is already a tree with this rank + + tree = tree.merge(compare, list[i]); + list[i] = null; + } + + // do not forget to append null if + // we are lacking space + + if (i === len) { + list.push(null); + } + + // cell is empty + // we can just put the new tree here + + list[i] = tree; + }; + + var merge = function merge(compare, list, other) { + + var i, len, carry; + + if (other.length === 0) { + return; + } + + // merging two binomial heaps is like + // adding two little endian integers + // so, we first make sure that we have + // enough place to store the result + + i = other.length - list.length; + + while (i-- > 0) { + list.push(null); + } + + carry = null; + + len = list.length; + + // remember len >= other.length + + for (i = 0; i < len; ++i) { + + // other[i] can be either null or not + // list[i] can be either null or not + // carry can be either null or not + // --> 2^3 = 8 possibilities + // + // null ? | other[i] | list[i] | carry + // --------------------------------------- + // (0) | no | no | no + // (1) | no | no | yes + // (2) | no | yes | no + // (3) | no | yes | yes + // (4) | yes | no | no + // (5) | yes | no | yes + // (6) | yes | yes | no + // (7) | yes | yes | yes + + if (i >= other.length || other[i] === null) { + + if (carry !== null) { + + // (6) other[i] = null and list[i] = null and carry != null + // --> put carry in current cell + + if (list[i] === null) { + list[i] = carry; + carry = null; + } + + // (4) other[i] = null and list[i] != null and carry != null + // --> merge carry with current cell + + else { + carry = carry.merge(compare, list[i]); + list[i] = null; + } + } + + // We do not need to do anything for + // those 2 cases (carry and other[i] are null). + // == + // (5) other[i] = null and list[i] != null and carry = null + // (7) other[i] = null and list[i] = null and carry = null + } + + // (0) other[i] != null and list[i] != null and carry != null + // (2) other[i] != null and list[i] = null and carry != null + // --> merge carry with other[i] + + else if (carry !== null) { + + carry = carry.merge(compare, other[i]); + } + + // (1) other[i] != null and list[i] != null and carry = null + // --> merge current cell with other[i] + + else if (list[i] !== null) { + + carry = list[i].merge(compare, other[i]); + list[i] = null; + } + + // (3) other[i] != null and list[i] = null and carry = null + // --> put other[i] in list + + else { + + list[i] = other[i]; + } + } + + // do not forget to append last carry + + if (carry !== null) { + list.push(carry); + } + }; + + var find_min_index = function find_min_index(compare, list, j, len) { + + var i, opt, item, candidate; + + // there MUST be at least one + // non null element in this list + // we look for the first one + + for (; j < len - 1 && list[j] === null; ++j) {} + + // here j is necessarily < len + // and list[j] is non null + + i = j; + opt = list[j].value; + + // we lookup remaining elements to see if there + // is not a better candidate + + for (++j; j < len; ++j) { + + item = list[j]; + + if (item !== null) { + + candidate = item.value; + + if (compare(candidate, opt) < 0) { + + i = j; + opt = candidate; + } + } + } + + return i; + }; + + var remove_head_at_index = function remove_head_at_index(compare, list, i, len) { + + var orphans; + + orphans = list[i].children; + list[i] = null; + + change_parent(null, orphans); + + // we just removed the ith element + // if list[i] is the last cell + // of list we can drop it + + if (i === len - 1) { + list.pop(); + } + + // we merge back the children of + // the removed tree into the heap + + merge(compare, list, orphans); + }; + + var binomial_heap_pop = function binomial_heap_pop(compare, list) { + + var i, len, tree; + + len = list.length; + + i = find_min_index(compare, list, 0, len); + + tree = list[i]; + + remove_head_at_index(compare, list, i, len); + + return tree; + }; + + var change_parent = function change_parent(parent, children) { + + var i, len; + + for (i = 0, len = children.length; i < len; ++i) { + children[i].setparent(parent); + } + }; + + var shift_up = function shift_up(tree, parent) { + + var tmp, i; + + // console.log( "tree", tree.value ); + // console.log( "parent", parent.value ); + + // Here, we cannot just swap values as it would invalidate + // externally stored references. + // Instead, we swap children lists and update references + // between the tree and its parent. + // Then we update and return the new tree's parent. + + // console.log( "tree.children", tree.children ); + // console.log( "parent.children", parent.children ); + + tmp = parent.children; + parent.children = tree.children; + tree.children = tmp; + + i = parent.rank(); + + // console.log( tree.children, i ); + + tree.children[i] = parent; + + tree.parent = parent.parent; + + change_parent(tree, tree.children); + change_parent(parent, parent.children); + + // console.log( "tree.children", tree.children ); + // console.log( "parent.children", parent.children ); + + return tree.parent; + }; + + var percolate_up = function percolate_up(list, tree) { + + var tmp, parent; + + parent = tree.parent; + + if (parent !== null) { + + while (true) { + + parent = shift_up(tree, parent); + + if (parent === null) { + break; + } + + // TODO this call might not be necessary + parent.children[tree.rank()] = tree; + } + + list[tree.rank()] = tree; + } + }; + + var decreasekey = function decreasekey(compare, list, tree, value) { + + var d, tmp, parent; + + tree.value = value; + parent = tree.parent; + + if (parent !== null) { + + while (true) { + + d = compare(value, parent.value); + + if (d >= 0) { + return; + } + + parent = shift_up(tree, parent); + + if (parent === null) { + break; + } + + // TODO this call should be in if ( d >= 0 ) + parent.children[tree.rank()] = tree; + } + + list[tree.rank()] = tree; + } + }; + + var deletetree = function deletetree(compare, list, tree) { + + percolate_up(list, tree); + + remove_head_at_index(compare, list, tree.rank(), list.length); + + tree.detach(); + }; + + var Heap = function Heap(compare) { + + // the compare function to use to compare values + + this.compare = compare; + + // number of elements in this heap + + this.length = 0; + + // list of binomial trees + + this.list = []; + }; + + Heap.prototype.head = function () { + + var i, tree; + + if (this.length === 0) { + return undefined; + } + + i = find_min_index(this.compare, this.list, 0, this.list.length); + + tree = this.list[i]; + + return tree.value; + }; + + Heap.prototype.headreference = function () { + + var i, tree; + + if (this.length === 0) { + return null; + } + + i = find_min_index(this.compare, this.list, 0, this.list.length); + + tree = this.list[i]; + + return tree; + }; + + Heap.prototype.pop = function () { + + if (this.length === 0) { + return undefined; + } + + --this.length; + + return binomial_heap_pop(this.compare, this.list).value; + }; + + Heap.prototype.popreference = function () { + + if (this.length === 0) { + return null; + } + + --this.length; + + return binomial_heap_pop(this.compare, this.list).detach(); + }; + + Heap.prototype.push = function (value) { + + var tree; + + // push a new tree of rank 0 + + tree = new BinomialTree(value, []); + + this.pushreference(tree); + + return tree; + }; + + Heap.prototype.pushreference = function (tree) { + + ++this.length; + + // push an existing tree of rank 0 + + binomial_heap_push(this.compare, this.list, tree, 0); + }; + + Heap.prototype.merge = function (other) { + + merge(this.compare, this.list, other.list); + + this.length += other.length; + + return this; + }; + + Heap.prototype.update = function (tree, value) { + + var d; + + d = this.compare(value, tree.value); + + if (d < 0) { + this.decreasekey(tree, value); + } else if (d > 0) { + this.increasekey(tree, value); + } else { + + // d === 0 does not imply tree.value === value + + tree.value = value; + } + }; + + Heap.prototype.decreasekey = function (tree, value) { + + decreasekey(this.compare, this.list, tree, value); + }; + + Heap.prototype.increasekey = function (tree, value) { + + deletetree(this.compare, this.list, tree); + + tree.value = value; + + binomial_heap_push(this.compare, this.list, tree, 0); + }; + + Heap.prototype.delete = function (tree) { + + --this.length; + + deletetree(this.compare, this.list, tree); + }; + + return Heap; +} +//# sourceMappingURL=data:application/json;base64,{"version":3,"sources":["../src/BinomialHeap.js"],"names":["BinomialHeap","BinomialTree","binomial_heap_push","compare","list","tree","rank","i","len","length","push","merge","other","carry","find_min_index","j","opt","item","candidate","value","remove_head_at_index","orphans","children","change_parent","pop","binomial_heap_pop","parent","setparent","shift_up","tmp","percolate_up","decreasekey","d","deletetree","detach","Heap","prototype","head","undefined","headreference","popreference","pushreference","update","increasekey","delete"],"mappings":";;;;;kBAAwBA,Y;AAAT,SAASA,YAAT,CAAwBC,YAAxB,EAAuC;;AAErD,KAAIC,qBAAqB,SAArBA,kBAAqB,CAAWC,OAAX,EAAoBC,IAApB,EAA0BC,IAA1B,EAAgCC,IAAhC,EAAuC;;AAE/D,MAAIC,CAAJ,EAAOC,GAAP;;AAEA;;AAEAD,MAAID,OAAOF,KAAKK,MAAhB;;AAEA,SAAQF,MAAM,CAAd,EAAkB;AACjBH,QAAKM,IAAL,CAAW,IAAX;AACA;;AAED;AACA;;AAEAF,QAAMJ,KAAKK,MAAX;;AAEA,OAAMF,IAAID,IAAV,EAAiBC,IAAIC,GAAJ,IAAWJ,KAAKG,CAAL,MAAY,IAAxC,EAA+C,EAAEA,CAAjD,EAAqD;;AAEpD;;AAEAF,UAAOA,KAAKM,KAAL,CAAYR,OAAZ,EAAqBC,KAAKG,CAAL,CAArB,CAAP;AACAH,QAAKG,CAAL,IAAU,IAAV;AAEA;;AAED;AACA;;AAEA,MAAKA,MAAMC,GAAX,EAAiB;AAChBJ,QAAKM,IAAL,CAAW,IAAX;AACA;;AAED;AACA;;AAEAN,OAAKG,CAAL,IAAUF,IAAV;AAEA,EAtCD;;AAyCA,KAAIM,QAAQ,SAARA,KAAQ,CAAWR,OAAX,EAAoBC,IAApB,EAA0BQ,KAA1B,EAAkC;;AAE7C,MAAIL,CAAJ,EAAOC,GAAP,EAAYK,KAAZ;;AAEA,MAAKD,MAAMH,MAAN,KAAiB,CAAtB,EAA0B;AACzB;AACA;;AAED;AACA;AACA;AACA;;AAEAF,MAAIK,MAAMH,MAAN,GAAeL,KAAKK,MAAxB;;AAEA,SAAQF,MAAM,CAAd,EAAkB;AACjBH,QAAKM,IAAL,CAAW,IAAX;AACA;;AAEDG,UAAQ,IAAR;;AAEAL,QAAMJ,KAAKK,MAAX;;AAEA;;AAEA,OAAMF,IAAI,CAAV,EAAcA,IAAIC,GAAlB,EAAwB,EAAED,CAA1B,EAA8B;;AAE7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,OAAKA,KAAKK,MAAMH,MAAX,IAAqBG,MAAML,CAAN,MAAa,IAAvC,EAA8C;;AAE7C,QAAKM,UAAU,IAAf,EAAsB;;AAGrB;AACA;;AAEA,SAAKT,KAAKG,CAAL,MAAY,IAAjB,EAAwB;AACvBH,WAAKG,CAAL,IAAUM,KAAV;AACAA,cAAQ,IAAR;AACA;;AAGD;AACA;;AAPA,UASK;AACJA,eAAQA,MAAMF,KAAN,CAAaR,OAAb,EAAsBC,KAAKG,CAAL,CAAtB,CAAR;AACAH,YAAKG,CAAL,IAAU,IAAV;AACA;AAED;;AAED;AACA;AACA;AACA;AACA;AAEA;;AAED;AACA;AACA;;AAlCA,QAoCK,IAAKM,UAAU,IAAf,EAAsB;;AAE1BA,aAAQA,MAAMF,KAAN,CAAaR,OAAb,EAAsBS,MAAML,CAAN,CAAtB,CAAR;AAEA;;AAED;AACA;;AAPK,SASA,IAAKH,KAAKG,CAAL,MAAY,IAAjB,EAAwB;;AAE5BM,cAAQT,KAAKG,CAAL,EAAQI,KAAR,CAAeR,OAAf,EAAwBS,MAAML,CAAN,CAAxB,CAAR;AACAH,WAAKG,CAAL,IAAU,IAAV;AAEA;;AAGD;AACA;;AATK,UAWA;;AAEJH,YAAKG,CAAL,IAAUK,MAAML,CAAN,CAAV;AAEA;AAED;;AAED;;AAEA,MAAKM,UAAU,IAAf,EAAsB;AACrBT,QAAKM,IAAL,CAAWG,KAAX;AACA;AAED,EAjHD;;AAmHA,KAAIC,iBAAiB,SAAjBA,cAAiB,CAAWX,OAAX,EAAoBC,IAApB,EAA0BW,CAA1B,EAA6BP,GAA7B,EAAmC;;AAEvD,MAAID,CAAJ,EAAOS,GAAP,EAAYC,IAAZ,EAAkBC,SAAlB;;AAEA;AACA;AACA;;AAEA,SAAQH,IAAIP,MAAM,CAAV,IAAeJ,KAAKW,CAAL,MAAY,IAAnC,EAA0C,EAAEA,CAA5C;;AAEA;AACA;;AAEAR,MAAIQ,CAAJ;AACAC,QAAMZ,KAAKW,CAAL,EAAQI,KAAd;;AAEA;AACA;;AAEA,OAAM,EAAEJ,CAAR,EAAYA,IAAIP,GAAhB,EAAsB,EAAEO,CAAxB,EAA4B;;AAE3BE,UAAOb,KAAKW,CAAL,CAAP;;AAEA,OAAKE,SAAS,IAAd,EAAqB;;AAEpBC,gBAAYD,KAAKE,KAAjB;;AAEA,QAAKhB,QAASe,SAAT,EAAoBF,GAApB,IAA4B,CAAjC,EAAqC;;AAEpCT,SAAIQ,CAAJ;AACAC,WAAME,SAAN;AAEA;AAED;AAED;;AAED,SAAOX,CAAP;AAEA,EAxCD;;AA0CA,KAAIa,uBAAuB,SAAvBA,oBAAuB,CAAWjB,OAAX,EAAoBC,IAApB,EAA0BG,CAA1B,EAA6BC,GAA7B,EAAmC;;AAE7D,MAAIa,OAAJ;;AAEAA,YAAUjB,KAAKG,CAAL,EAAQe,QAAlB;AACAlB,OAAKG,CAAL,IAAU,IAAV;;AAEAgB,gBAAe,IAAf,EAAqBF,OAArB;;AAEA;AACA;AACA;;AAEA,MAAKd,MAAMC,MAAM,CAAjB,EAAqB;AACpBJ,QAAKoB,GAAL;AACA;;AAED;AACA;;AAEAb,QAAOR,OAAP,EAAgBC,IAAhB,EAAsBiB,OAAtB;AAEA,EAtBD;;AAwBA,KAAII,oBAAoB,SAApBA,iBAAoB,CAAWtB,OAAX,EAAoBC,IAApB,EAA2B;;AAElD,MAAIG,CAAJ,EAAOC,GAAP,EAAYH,IAAZ;;AAEAG,QAAMJ,KAAKK,MAAX;;AAEAF,MAAIO,eAAgBX,OAAhB,EAAyBC,IAAzB,EAA+B,CAA/B,EAAkCI,GAAlC,CAAJ;;AAEAH,SAAOD,KAAKG,CAAL,CAAP;;AAEAa,uBAAsBjB,OAAtB,EAA+BC,IAA/B,EAAqCG,CAArC,EAAwCC,GAAxC;;AAEA,SAAOH,IAAP;AACA,EAbD;;AAeA,KAAIkB,gBAAgB,SAAhBA,aAAgB,CAAWG,MAAX,EAAmBJ,QAAnB,EAA8B;;AAEjD,MAAIf,CAAJ,EAAOC,GAAP;;AAEA,OAAMD,IAAI,CAAJ,EAAOC,MAAMc,SAASb,MAA5B,EAAqCF,IAAIC,GAAzC,EAA+C,EAAED,CAAjD,EAAqD;AACpDe,YAASf,CAAT,EAAYoB,SAAZ,CAAsBD,MAAtB;AACA;AAED,EARD;;AAUA,KAAIE,WAAW,SAAXA,QAAW,CAAWvB,IAAX,EAAiBqB,MAAjB,EAA0B;;AAExC,MAAIG,GAAJ,EAAStB,CAAT;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEAsB,QAAMH,OAAOJ,QAAb;AACAI,SAAOJ,QAAP,GAAkBjB,KAAKiB,QAAvB;AACAjB,OAAKiB,QAAL,GAAgBO,GAAhB;;AAGAtB,MAAImB,OAAOpB,IAAP,EAAJ;;AAEA;;AAEAD,OAAKiB,QAAL,CAAcf,CAAd,IAAmBmB,MAAnB;;AAEArB,OAAKqB,MAAL,GAAcA,OAAOA,MAArB;;AAEAH,gBAAelB,IAAf,EAAqBA,KAAKiB,QAA1B;AACAC,gBAAeG,MAAf,EAAuBA,OAAOJ,QAA9B;;AAEA;AACA;;AAEA,SAAOjB,KAAKqB,MAAZ;AAEA,EArCD;;AAuCA,KAAII,eAAe,SAAfA,YAAe,CAAW1B,IAAX,EAAiBC,IAAjB,EAAwB;;AAE1C,MAAIwB,GAAJ,EAASH,MAAT;;AAEAA,WAASrB,KAAKqB,MAAd;;AAEA,MAAKA,WAAW,IAAhB,EAAuB;;AAEtB,UAAQ,IAAR,EAAe;;AAEdA,aAASE,SAAUvB,IAAV,EAAgBqB,MAAhB,CAAT;;AAEA,QAAKA,WAAW,IAAhB,EAAuB;AACtB;AACA;;AAED;AACAA,WAAOJ,QAAP,CAAgBjB,KAAKC,IAAL,EAAhB,IAA+BD,IAA/B;AAEA;;AAEDD,QAAKC,KAAKC,IAAL,EAAL,IAAoBD,IAApB;AAEA;AAED,EAzBD;;AA2BA,KAAI0B,cAAc,SAAdA,WAAc,CAAW5B,OAAX,EAAoBC,IAApB,EAA0BC,IAA1B,EAAgCc,KAAhC,EAAwC;;AAEzD,MAAIa,CAAJ,EAAOH,GAAP,EAAYH,MAAZ;;AAEArB,OAAKc,KAAL,GAAaA,KAAb;AACAO,WAASrB,KAAKqB,MAAd;;AAEA,MAAKA,WAAW,IAAhB,EAAuB;;AAEtB,UAAQ,IAAR,EAAe;;AAEdM,QAAI7B,QAASgB,KAAT,EAAgBO,OAAOP,KAAvB,CAAJ;;AAEA,QAAKa,KAAK,CAAV,EAAc;AACb;AACA;;AAEDN,aAASE,SAAUvB,IAAV,EAAgBqB,MAAhB,CAAT;;AAEA,QAAKA,WAAW,IAAhB,EAAuB;AACtB;AACA;;AAED;AACAA,WAAOJ,QAAP,CAAgBjB,KAAKC,IAAL,EAAhB,IAA+BD,IAA/B;AAEA;;AAEDD,QAAKC,KAAKC,IAAL,EAAL,IAAoBD,IAApB;AAEA;AAED,EAhCD;;AAkCA,KAAI4B,aAAa,SAAbA,UAAa,CAAW9B,OAAX,EAAoBC,IAApB,EAA0BC,IAA1B,EAAiC;;AAEjDyB,eAAc1B,IAAd,EAAoBC,IAApB;;AAEAe,uBAAsBjB,OAAtB,EAA+BC,IAA/B,EAAqCC,KAAKC,IAAL,EAArC,EAAkDF,KAAKK,MAAvD;;AAEAJ,OAAK6B,MAAL;AAEA,EARD;;AAUA,KAAIC,OAAO,SAAPA,IAAO,CAAWhC,OAAX,EAAqB;;AAE/B;;AAEA,OAAKA,OAAL,GAAeA,OAAf;;AAGA;;AAEA,OAAKM,MAAL,GAAc,CAAd;;AAGA;;AAEA,OAAKL,IAAL,GAAY,EAAZ;AAEA,EAhBD;;AAkBA+B,MAAKC,SAAL,CAAeC,IAAf,GAAsB,YAAY;;AAEjC,MAAI9B,CAAJ,EAAOF,IAAP;;AAEA,MAAK,KAAKI,MAAL,KAAgB,CAArB,EAAyB;AACxB,UAAO6B,SAAP;AACA;;AAED/B,MAAIO,eAAgB,KAAKX,OAArB,EAA8B,KAAKC,IAAnC,EAAyC,CAAzC,EAA4C,KAAKA,IAAL,CAAUK,MAAtD,CAAJ;;AAEAJ,SAAO,KAAKD,IAAL,CAAUG,CAAV,CAAP;;AAEA,SAAOF,KAAKc,KAAZ;AAEA,EAdD;;AAgBAgB,MAAKC,SAAL,CAAeG,aAAf,GAA+B,YAAY;;AAE1C,MAAIhC,CAAJ,EAAOF,IAAP;;AAEA,MAAK,KAAKI,MAAL,KAAgB,CAArB,EAAyB;AACxB,UAAO,IAAP;AACA;;AAEDF,MAAIO,eAAgB,KAAKX,OAArB,EAA8B,KAAKC,IAAnC,EAAyC,CAAzC,EAA4C,KAAKA,IAAL,CAAUK,MAAtD,CAAJ;;AAEAJ,SAAO,KAAKD,IAAL,CAAUG,CAAV,CAAP;;AAEA,SAAOF,IAAP;AAEA,EAdD;;AAgBA8B,MAAKC,SAAL,CAAeZ,GAAf,GAAqB,YAAY;;AAEhC,MAAK,KAAKf,MAAL,KAAgB,CAArB,EAAyB;AACxB,UAAO6B,SAAP;AACA;;AAED,IAAE,KAAK7B,MAAP;;AAEA,SAAOgB,kBAAmB,KAAKtB,OAAxB,EAAiC,KAAKC,IAAtC,EAA6Ce,KAApD;AAEA,EAVD;;AAYAgB,MAAKC,SAAL,CAAeI,YAAf,GAA8B,YAAY;;AAEzC,MAAK,KAAK/B,MAAL,KAAgB,CAArB,EAAyB;AACxB,UAAO,IAAP;AACA;;AAED,IAAE,KAAKA,MAAP;;AAEA,SAAOgB,kBAAmB,KAAKtB,OAAxB,EAAiC,KAAKC,IAAtC,EAA6C8B,MAA7C,EAAP;AAEA,EAVD;;AAYAC,MAAKC,SAAL,CAAe1B,IAAf,GAAsB,UAAWS,KAAX,EAAmB;;AAExC,MAAId,IAAJ;;AAEA;;AAEAA,SAAO,IAAIJ,YAAJ,CAAkBkB,KAAlB,EAAyB,EAAzB,CAAP;;AAEA,OAAKsB,aAAL,CAAoBpC,IAApB;;AAEA,SAAOA,IAAP;AAEA,EAZD;;AAcA8B,MAAKC,SAAL,CAAeK,aAAf,GAA+B,UAAWpC,IAAX,EAAkB;;AAEhD,IAAE,KAAKI,MAAP;;AAEA;;AAEAP,qBAAoB,KAAKC,OAAzB,EAAkC,KAAKC,IAAvC,EAA6CC,IAA7C,EAAmD,CAAnD;AAEA,EARD;;AAUA8B,MAAKC,SAAL,CAAezB,KAAf,GAAuB,UAAWC,KAAX,EAAmB;;AAEzCD,QAAO,KAAKR,OAAZ,EAAqB,KAAKC,IAA1B,EAAgCQ,MAAMR,IAAtC;;AAEA,OAAKK,MAAL,IAAeG,MAAMH,MAArB;;AAEA,SAAO,IAAP;AAEA,EARD;;AAUA0B,MAAKC,SAAL,CAAeM,MAAf,GAAwB,UAAWrC,IAAX,EAAiBc,KAAjB,EAAyB;;AAEhD,MAAIa,CAAJ;;AAEAA,MAAI,KAAK7B,OAAL,CAAcgB,KAAd,EAAqBd,KAAKc,KAA1B,CAAJ;;AAEA,MAAKa,IAAI,CAAT,EAAa;AACZ,QAAKD,WAAL,CAAkB1B,IAAlB,EAAwBc,KAAxB;AACA,GAFD,MAIK,IAAKa,IAAI,CAAT,EAAa;AACjB,QAAKW,WAAL,CAAkBtC,IAAlB,EAAwBc,KAAxB;AACA,GAFI,MAIA;;AAEJ;;AAEAd,QAAKc,KAAL,GAAaA,KAAb;AAEA;AAED,EAtBD;;AAwBAgB,MAAKC,SAAL,CAAeL,WAAf,GAA6B,UAAW1B,IAAX,EAAiBc,KAAjB,EAAyB;;AAErDY,cAAa,KAAK5B,OAAlB,EAA2B,KAAKC,IAAhC,EAAsCC,IAAtC,EAA4Cc,KAA5C;AAEA,EAJD;;AAMAgB,MAAKC,SAAL,CAAeO,WAAf,GAA6B,UAAWtC,IAAX,EAAiBc,KAAjB,EAAyB;;AAErDc,aAAY,KAAK9B,OAAjB,EAA0B,KAAKC,IAA/B,EAAqCC,IAArC;;AAEAA,OAAKc,KAAL,GAAaA,KAAb;;AAEAjB,qBAAoB,KAAKC,OAAzB,EAAkC,KAAKC,IAAvC,EAA6CC,IAA7C,EAAmD,CAAnD;AAEA,EARD;;AAUA8B,MAAKC,SAAL,CAAeQ,MAAf,GAAwB,UAAWvC,IAAX,EAAkB;;AAEzC,IAAE,KAAKI,MAAP;;AAEAwB,aAAY,KAAK9B,OAAjB,EAA0B,KAAKC,IAA/B,EAAqCC,IAArC;AAEA,EAND;;AAQA,QAAO8B,IAAP;AAEA","file":"BinomialHeap.js","sourcesContent":["export default function BinomialHeap ( BinomialTree ) {\n\n\tvar binomial_heap_push = function ( compare, list, tree, rank ) {\n\n\t\tvar i, len;\n\n\t\t// ensures list has at least rank cells\n\n\t\ti = rank - list.length;\n\n\t\twhile ( i --> 0 ) {\n\t\t\tlist.push( null );\n\t\t}\n\n\t\t// loop invariant\n\t\t// tree and list[i] have the same rank\n\n\t\tlen = list.length;\n\n\t\tfor ( i = rank ; i < len && list[i] !== null ; ++i ) {\n\n\t\t\t// there is already a tree with this rank\n\n\t\t\ttree = tree.merge( compare, list[i] );\n\t\t\tlist[i] = null;\n\n\t\t}\n\n\t\t// do not forget to append null if\n\t\t// we are lacking space\n\n\t\tif ( i === len ) {\n\t\t\tlist.push( null );\n\t\t}\n\n\t\t// cell is empty\n\t\t// we can just put the new tree here\n\n\t\tlist[i] = tree;\n\n\t};\n\n\n\tvar merge = function ( compare, list, other ) {\n\n\t\tvar i, len, carry;\n\n\t\tif ( other.length === 0 ) {\n\t\t\treturn;\n\t\t}\n\n\t\t// merging two binomial heaps is like\n\t\t// adding two little endian integers\n\t\t// so, we first make sure that we have\n\t\t// enough place to store the result\n\n\t\ti = other.length - list.length;\n\n\t\twhile ( i --> 0 ) {\n\t\t\tlist.push( null );\n\t\t}\n\n\t\tcarry = null;\n\n\t\tlen = list.length;\n\n\t\t// remember len >= other.length\n\n\t\tfor ( i = 0 ; i < len ; ++i ) {\n\n\t\t\t// other[i] can be either null or not\n\t\t\t// list[i] can be either null or not\n\t\t\t// carry can be either null or not\n\t\t\t// --> 2^3 = 8 possibilities\n\t\t\t//\n\t\t\t//    null ? | other[i] | list[i] | carry\n\t\t\t// ---------------------------------------\n\t\t\t//     (0)   |    no    |     no  |   no\n\t\t\t//     (1)   |    no    |     no  |  yes\n\t\t\t//     (2)   |    no    |    yes  |   no\n\t\t\t//     (3)   |    no    |    yes  |  yes\n\t\t\t//     (4)   |   yes    |     no  |   no\n\t\t\t//     (5)   |   yes    |     no  |  yes\n\t\t\t//     (6)   |   yes    |    yes  |   no\n\t\t\t//     (7)   |   yes    |    yes  |  yes\n\n\t\t\tif ( i >= other.length || other[i] === null ) {\n\n\t\t\t\tif ( carry !== null ) {\n\n\n\t\t\t\t\t// (6) other[i] = null and list[i] = null and carry != null\n\t\t\t\t\t// --> put carry in current cell\n\n\t\t\t\t\tif ( list[i] === null ) {\n\t\t\t\t\t\tlist[i] = carry;\n\t\t\t\t\t\tcarry = null;\n\t\t\t\t\t}\n\n\n\t\t\t\t\t// (4) other[i] = null and list[i] != null and carry != null\n\t\t\t\t\t// --> merge carry with current cell\n\n\t\t\t\t\telse {\n\t\t\t\t\t\tcarry = carry.merge( compare, list[i] );\n\t\t\t\t\t\tlist[i] = null;\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t\t// We do not need to do anything for\n\t\t\t\t// those 2 cases (carry and other[i] are null).\n\t\t\t\t// ==\n\t\t\t\t// (5) other[i] = null and list[i] != null and carry = null\n\t\t\t\t// (7) other[i] = null and list[i] = null and carry = null\n\n\t\t\t}\n\n\t\t\t// (0) other[i] != null and list[i] != null and carry != null\n\t\t\t// (2) other[i] != null and list[i] = null and carry != null\n\t\t\t// --> merge carry with other[i]\n\n\t\t\telse if ( carry !== null ) {\n\n\t\t\t\tcarry = carry.merge( compare, other[i] );\n\n\t\t\t}\n\n\t\t\t// (1) other[i] != null and list[i] != null and carry = null\n\t\t\t// --> merge current cell with other[i]\n\n\t\t\telse if ( list[i] !== null ) {\n\n\t\t\t\tcarry = list[i].merge( compare, other[i] );\n\t\t\t\tlist[i] = null;\n\n\t\t\t}\n\n\n\t\t\t// (3) other[i] != null and list[i] = null and carry = null\n\t\t\t// --> put other[i] in list\n\n\t\t\telse {\n\n\t\t\t\tlist[i] = other[i];\n\n\t\t\t}\n\n\t\t}\n\n\t\t// do not forget to append last carry\n\n\t\tif ( carry !== null ) {\n\t\t\tlist.push( carry );\n\t\t}\n\n\t};\n\n\tvar find_min_index = function ( compare, list, j, len ) {\n\n\t\tvar i, opt, item, candidate;\n\n\t\t// there MUST be at least one\n\t\t// non null element in this list\n\t\t// we look for the first one\n\n\t\tfor ( ; j < len - 1 && list[j] === null ; ++j ) ;\n\n\t\t// here j is necessarily < len\n\t\t// and list[j] is non null\n\n\t\ti = j;\n\t\topt = list[j].value;\n\n\t\t// we lookup remaining elements to see if there\n\t\t// is not a better candidate\n\n\t\tfor ( ++j ; j < len ; ++j ) {\n\n\t\t\titem = list[j];\n\n\t\t\tif ( item !== null ) {\n\n\t\t\t\tcandidate = item.value;\n\n\t\t\t\tif ( compare( candidate, opt ) < 0 ) {\n\n\t\t\t\t\ti = j;\n\t\t\t\t\topt = candidate;\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t\treturn i;\n\n\t};\n\n\tvar remove_head_at_index = function ( compare, list, i, len ) {\n\n\t\tvar orphans;\n\n\t\torphans = list[i].children;\n\t\tlist[i] = null;\n\n\t\tchange_parent( null, orphans );\n\n\t\t// we just removed the ith element\n\t\t// if list[i] is the last cell\n\t\t// of list we can drop it\n\n\t\tif ( i === len - 1 ) {\n\t\t\tlist.pop();\n\t\t}\n\n\t\t// we merge back the children of\n\t\t// the removed tree into the heap\n\n\t\tmerge( compare, list, orphans );\n\n\t};\n\n\tvar binomial_heap_pop = function ( compare, list ) {\n\n\t\tvar i, len, tree;\n\n\t\tlen = list.length;\n\n\t\ti = find_min_index( compare, list, 0, len );\n\n\t\ttree = list[i];\n\n\t\tremove_head_at_index( compare, list, i, len );\n\n\t\treturn tree;\n\t};\n\n\tvar change_parent = function ( parent, children ) {\n\n\t\tvar i, len;\n\n\t\tfor ( i = 0, len = children.length ; i < len ; ++i ) {\n\t\t\tchildren[i].setparent(parent);\n\t\t}\n\n\t};\n\n\tvar shift_up = function ( tree, parent ) {\n\n\t\tvar tmp, i;\n\n\t\t// console.log( \"tree\", tree.value );\n\t\t// console.log( \"parent\", parent.value );\n\n\t\t// Here, we cannot just swap values as it would invalidate\n\t\t// externally stored references.\n\t\t// Instead, we swap children lists and update references\n\t\t// between the tree and its parent.\n\t\t// Then we update and return the new tree's parent.\n\n\t\t// console.log( \"tree.children\", tree.children );\n\t\t// console.log( \"parent.children\", parent.children );\n\n\t\ttmp = parent.children;\n\t\tparent.children = tree.children;\n\t\ttree.children = tmp;\n\n\n\t\ti = parent.rank();\n\n\t\t// console.log( tree.children, i );\n\n\t\ttree.children[i] = parent;\n\n\t\ttree.parent = parent.parent;\n\n\t\tchange_parent( tree, tree.children );\n\t\tchange_parent( parent, parent.children );\n\n\t\t// console.log( \"tree.children\", tree.children );\n\t\t// console.log( \"parent.children\", parent.children );\n\n\t\treturn tree.parent;\n\n\t};\n\n\tvar percolate_up = function ( list, tree ) {\n\n\t\tvar tmp, parent;\n\n\t\tparent = tree.parent;\n\n\t\tif ( parent !== null ) {\n\n\t\t\twhile ( true ) {\n\n\t\t\t\tparent = shift_up( tree, parent );\n\n\t\t\t\tif ( parent === null ) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\t// TODO this call might not be necessary\n\t\t\t\tparent.children[tree.rank()] = tree;\n\n\t\t\t}\n\n\t\t\tlist[tree.rank()] = tree;\n\n\t\t}\n\n\t};\n\n\tvar decreasekey = function ( compare, list, tree, value ) {\n\n\t\tvar d, tmp, parent;\n\n\t\ttree.value = value;\n\t\tparent = tree.parent;\n\n\t\tif ( parent !== null ) {\n\n\t\t\twhile ( true ) {\n\n\t\t\t\td = compare( value, parent.value );\n\n\t\t\t\tif ( d >= 0 ) {\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\tparent = shift_up( tree, parent );\n\n\t\t\t\tif ( parent === null ) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\t// TODO this call should be in if ( d >= 0 )\n\t\t\t\tparent.children[tree.rank()] = tree;\n\n\t\t\t}\n\n\t\t\tlist[tree.rank()] = tree;\n\n\t\t}\n\n\t};\n\n\tvar deletetree = function ( compare, list, tree ) {\n\n\t\tpercolate_up( list, tree );\n\n\t\tremove_head_at_index( compare, list, tree.rank(), list.length );\n\n\t\ttree.detach();\n\n\t};\n\n\tvar Heap = function ( compare ) {\n\n\t\t// the compare function to use to compare values\n\n\t\tthis.compare = compare;\n\n\n\t\t// number of elements in this heap\n\n\t\tthis.length = 0;\n\n\n\t\t// list of binomial trees\n\n\t\tthis.list = [];\n\n\t};\n\n\tHeap.prototype.head = function () {\n\n\t\tvar i, tree;\n\n\t\tif ( this.length === 0 ) {\n\t\t\treturn undefined;\n\t\t}\n\n\t\ti = find_min_index( this.compare, this.list, 0, this.list.length );\n\n\t\ttree = this.list[i];\n\n\t\treturn tree.value;\n\n\t};\n\n\tHeap.prototype.headreference = function () {\n\n\t\tvar i, tree;\n\n\t\tif ( this.length === 0 ) {\n\t\t\treturn null;\n\t\t}\n\n\t\ti = find_min_index( this.compare, this.list, 0, this.list.length );\n\n\t\ttree = this.list[i];\n\n\t\treturn tree;\n\n\t};\n\n\tHeap.prototype.pop = function () {\n\n\t\tif ( this.length === 0 ) {\n\t\t\treturn undefined;\n\t\t}\n\n\t\t--this.length;\n\n\t\treturn binomial_heap_pop( this.compare, this.list ).value;\n\n\t};\n\n\tHeap.prototype.popreference = function () {\n\n\t\tif ( this.length === 0 ) {\n\t\t\treturn null;\n\t\t}\n\n\t\t--this.length;\n\n\t\treturn binomial_heap_pop( this.compare, this.list ).detach();\n\n\t};\n\n\tHeap.prototype.push = function ( value ) {\n\n\t\tvar tree;\n\n\t\t// push a new tree of rank 0\n\n\t\ttree = new BinomialTree( value, [] );\n\n\t\tthis.pushreference( tree );\n\n\t\treturn tree;\n\n\t};\n\n\tHeap.prototype.pushreference = function ( tree ) {\n\n\t\t++this.length;\n\n\t\t// push an existing tree of rank 0\n\n\t\tbinomial_heap_push( this.compare, this.list, tree, 0 );\n\n\t};\n\n\tHeap.prototype.merge = function ( other ) {\n\n\t\tmerge( this.compare, this.list, other.list );\n\n\t\tthis.length += other.length;\n\n\t\treturn this;\n\n\t};\n\n\tHeap.prototype.update = function ( tree, value ) {\n\n\t\tvar d;\n\n\t\td = this.compare( value, tree.value );\n\n\t\tif ( d < 0 ) {\n\t\t\tthis.decreasekey( tree, value );\n\t\t}\n\n\t\telse if ( d > 0 ) {\n\t\t\tthis.increasekey( tree, value );\n\t\t}\n\n\t\telse {\n\n\t\t\t// d === 0 does not imply tree.value === value\n\n\t\t\ttree.value = value;\n\n\t\t}\n\n\t};\n\n\tHeap.prototype.decreasekey = function ( tree, value ) {\n\n\t\tdecreasekey( this.compare, this.list, tree, value );\n\n\t};\n\n\tHeap.prototype.increasekey = function ( tree, value ) {\n\n\t\tdeletetree( this.compare, this.list, tree );\n\n\t\ttree.value = value;\n\n\t\tbinomial_heap_push( this.compare, this.list, tree, 0 );\n\n\t};\n\n\tHeap.prototype.delete = function ( tree ) {\n\n\t\t--this.length;\n\n\t\tdeletetree( this.compare, this.list, tree );\n\n\t};\n\n\treturn Heap;\n\n}\n"]} \ No newline at end of file diff --git a/lib/BinomialTree.js b/lib/BinomialTree.js new file mode 100644 index 0000000..0418872 --- /dev/null +++ b/lib/BinomialTree.js @@ -0,0 +1,42 @@ +"use strict"; + +Object.defineProperty(exports, "__esModule", { + value: true +}); +exports.default = BinomialTree; +function BinomialTree(value, children) { + this.value = value; + this.children = children; +} + +/** + * /!\ Can only be used to merge two trees of the same rank. + * /!\ Modifies both trees + */ + +BinomialTree.prototype.merge = function (predicate, other) { + + if (predicate(this.value, other.value) <= 0) { + this.children = this.children.concat(other); + return this; + } else { + other.children = other.children.concat(this); + return other; + } +}; + +/** + * Method used to reset a tree element in order to reuse it + * somewhere else, e.g. insert it back in the same or a new + * heap. + */ + +BinomialTree.prototype.detach = function () { + this.children.splice(0); + return this; +}; + +BinomialTree.prototype.setparent = function (parent) { + // we do not keep track of any parent here +}; +//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJzb3VyY2VzIjpbIi4uL3NyYy9CaW5vbWlhbFRyZWUuanMiXSwibmFtZXMiOlsiQmlub21pYWxUcmVlIiwidmFsdWUiLCJjaGlsZHJlbiIsInByb3RvdHlwZSIsIm1lcmdlIiwicHJlZGljYXRlIiwib3RoZXIiLCJjb25jYXQiLCJkZXRhY2giLCJzcGxpY2UiLCJzZXRwYXJlbnQiLCJwYXJlbnQiXSwibWFwcGluZ3MiOiI7Ozs7O2tCQUV3QkEsWTtBQUFULFNBQVNBLFlBQVQsQ0FBd0JDLEtBQXhCLEVBQStCQyxRQUEvQixFQUEwQztBQUN4RCxNQUFLRCxLQUFMLEdBQWFBLEtBQWI7QUFDQSxNQUFLQyxRQUFMLEdBQWdCQSxRQUFoQjtBQUNBOztBQUVEOzs7OztBQUtBRixhQUFhRyxTQUFiLENBQXVCQyxLQUF2QixHQUErQixVQUFXQyxTQUFYLEVBQXNCQyxLQUF0QixFQUE4Qjs7QUFFNUQsS0FBS0QsVUFBVyxLQUFLSixLQUFoQixFQUF1QkssTUFBTUwsS0FBN0IsS0FBd0MsQ0FBN0MsRUFBaUQ7QUFDaEQsT0FBS0MsUUFBTCxHQUFnQixLQUFLQSxRQUFMLENBQWNLLE1BQWQsQ0FBc0JELEtBQXRCLENBQWhCO0FBQ0EsU0FBTyxJQUFQO0FBQ0EsRUFIRCxNQUtLO0FBQ0pBLFFBQU1KLFFBQU4sR0FBaUJJLE1BQU1KLFFBQU4sQ0FBZUssTUFBZixDQUF1QixJQUF2QixDQUFqQjtBQUNBLFNBQU9ELEtBQVA7QUFDQTtBQUVELENBWkQ7O0FBY0E7Ozs7OztBQU1BTixhQUFhRyxTQUFiLENBQXVCSyxNQUF2QixHQUFnQyxZQUFZO0FBQzNDLE1BQUtOLFFBQUwsQ0FBY08sTUFBZCxDQUFzQixDQUF0QjtBQUNBLFFBQU8sSUFBUDtBQUNBLENBSEQ7O0FBS0FULGFBQWFHLFNBQWIsQ0FBdUJPLFNBQXZCLEdBQW1DLFVBQVdDLE1BQVgsRUFBb0I7QUFDdEQ7QUFDQSxDQUZEIiwiZmlsZSI6IkJpbm9taWFsVHJlZS5qcyIsInNvdXJjZXNDb250ZW50IjpbIlxuXG5leHBvcnQgZGVmYXVsdCBmdW5jdGlvbiBCaW5vbWlhbFRyZWUgKCB2YWx1ZSwgY2hpbGRyZW4gKSB7XG5cdHRoaXMudmFsdWUgPSB2YWx1ZTtcblx0dGhpcy5jaGlsZHJlbiA9IGNoaWxkcmVuO1xufVxuXG4vKipcbiAqIC8hXFwgQ2FuIG9ubHkgYmUgdXNlZCB0byBtZXJnZSB0d28gdHJlZXMgb2YgdGhlIHNhbWUgcmFuay5cbiAqIC8hXFwgTW9kaWZpZXMgYm90aCB0cmVlc1xuICovXG5cbkJpbm9taWFsVHJlZS5wcm90b3R5cGUubWVyZ2UgPSBmdW5jdGlvbiAoIHByZWRpY2F0ZSwgb3RoZXIgKSB7XG5cblx0aWYgKCBwcmVkaWNhdGUoIHRoaXMudmFsdWUsIG90aGVyLnZhbHVlICkgPD0gMCApIHtcblx0XHR0aGlzLmNoaWxkcmVuID0gdGhpcy5jaGlsZHJlbi5jb25jYXQoIG90aGVyICk7XG5cdFx0cmV0dXJuIHRoaXM7XG5cdH1cblxuXHRlbHNlIHtcblx0XHRvdGhlci5jaGlsZHJlbiA9IG90aGVyLmNoaWxkcmVuLmNvbmNhdCggdGhpcyApO1xuXHRcdHJldHVybiBvdGhlcjtcblx0fVxuXG59O1xuXG4vKipcbiAqIE1ldGhvZCB1c2VkIHRvIHJlc2V0IGEgdHJlZSBlbGVtZW50IGluIG9yZGVyIHRvIHJldXNlIGl0XG4gKiBzb21ld2hlcmUgZWxzZSwgZS5nLiBpbnNlcnQgaXQgYmFjayBpbiB0aGUgc2FtZSBvciBhIG5ld1xuICogaGVhcC5cbiAqL1xuXG5CaW5vbWlhbFRyZWUucHJvdG90eXBlLmRldGFjaCA9IGZ1bmN0aW9uICgpIHtcblx0dGhpcy5jaGlsZHJlbi5zcGxpY2UoIDAgKTtcblx0cmV0dXJuIHRoaXM7XG59O1xuXG5CaW5vbWlhbFRyZWUucHJvdG90eXBlLnNldHBhcmVudCA9IGZ1bmN0aW9uICggcGFyZW50ICkge1xuXHQvLyB3ZSBkbyBub3Qga2VlcCB0cmFjayBvZiBhbnkgcGFyZW50IGhlcmVcbn07XG4iXX0= \ No newline at end of file diff --git a/lib/BinomialTreeWithParent.js b/lib/BinomialTreeWithParent.js new file mode 100644 index 0000000..c0ef70a --- /dev/null +++ b/lib/BinomialTreeWithParent.js @@ -0,0 +1,50 @@ +"use strict"; + +Object.defineProperty(exports, "__esModule", { + value: true +}); +exports.default = BinomialTreeWithParent; +function BinomialTreeWithParent(value, children) { + this.value = value; + this.children = children; + this.parent = null; +} + +BinomialTreeWithParent.prototype.rank = function () { + return this.children.length; +}; + +/** + * /!\ Can only be used to merge two trees of the same rank. + * /!\ Modifies both trees + */ + +BinomialTreeWithParent.prototype.merge = function (predicate, other) { + + if (predicate(this.value, other.value) <= 0) { + this.children = this.children.concat(other); + other.parent = this; + return this; + } else { + other.children = other.children.concat(this); + this.parent = other; + return other; + } +}; + +/** + * Method used to reset a tree element in order to reuse it + * somewhere else, e.g. insert it back in the same or a new + * heap. + */ + +BinomialTreeWithParent.prototype.detach = function () { + this.children.splice(0); + this.parent = null; + return this; +}; + +BinomialTreeWithParent.prototype.setparent = function (parent) { + this.parent = parent; +}; +//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJzb3VyY2VzIjpbIi4uL3NyYy9CaW5vbWlhbFRyZWVXaXRoUGFyZW50LmpzIl0sIm5hbWVzIjpbIkJpbm9taWFsVHJlZVdpdGhQYXJlbnQiLCJ2YWx1ZSIsImNoaWxkcmVuIiwicGFyZW50IiwicHJvdG90eXBlIiwicmFuayIsImxlbmd0aCIsIm1lcmdlIiwicHJlZGljYXRlIiwib3RoZXIiLCJjb25jYXQiLCJkZXRhY2giLCJzcGxpY2UiLCJzZXRwYXJlbnQiXSwibWFwcGluZ3MiOiI7Ozs7O2tCQUV3QkEsc0I7QUFBVCxTQUFTQSxzQkFBVCxDQUFrQ0MsS0FBbEMsRUFBeUNDLFFBQXpDLEVBQW9EO0FBQ2xFLE1BQUtELEtBQUwsR0FBYUEsS0FBYjtBQUNBLE1BQUtDLFFBQUwsR0FBZ0JBLFFBQWhCO0FBQ0EsTUFBS0MsTUFBTCxHQUFjLElBQWQ7QUFDQTs7QUFFREgsdUJBQXVCSSxTQUF2QixDQUFpQ0MsSUFBakMsR0FBd0MsWUFBWTtBQUNuRCxRQUFPLEtBQUtILFFBQUwsQ0FBY0ksTUFBckI7QUFDQSxDQUZEOztBQUlBOzs7OztBQUtBTix1QkFBdUJJLFNBQXZCLENBQWlDRyxLQUFqQyxHQUF5QyxVQUFXQyxTQUFYLEVBQXNCQyxLQUF0QixFQUE4Qjs7QUFFdEUsS0FBS0QsVUFBVyxLQUFLUCxLQUFoQixFQUF1QlEsTUFBTVIsS0FBN0IsS0FBd0MsQ0FBN0MsRUFBaUQ7QUFDaEQsT0FBS0MsUUFBTCxHQUFnQixLQUFLQSxRQUFMLENBQWNRLE1BQWQsQ0FBc0JELEtBQXRCLENBQWhCO0FBQ0FBLFFBQU1OLE1BQU4sR0FBZSxJQUFmO0FBQ0EsU0FBTyxJQUFQO0FBQ0EsRUFKRCxNQU1LO0FBQ0pNLFFBQU1QLFFBQU4sR0FBaUJPLE1BQU1QLFFBQU4sQ0FBZVEsTUFBZixDQUF1QixJQUF2QixDQUFqQjtBQUNBLE9BQUtQLE1BQUwsR0FBY00sS0FBZDtBQUNBLFNBQU9BLEtBQVA7QUFDQTtBQUVELENBZEQ7O0FBZ0JBOzs7Ozs7QUFNQVQsdUJBQXVCSSxTQUF2QixDQUFpQ08sTUFBakMsR0FBMEMsWUFBWTtBQUNyRCxNQUFLVCxRQUFMLENBQWNVLE1BQWQsQ0FBc0IsQ0FBdEI7QUFDQSxNQUFLVCxNQUFMLEdBQWMsSUFBZDtBQUNBLFFBQU8sSUFBUDtBQUNBLENBSkQ7O0FBTUFILHVCQUF1QkksU0FBdkIsQ0FBaUNTLFNBQWpDLEdBQTZDLFVBQVdWLE1BQVgsRUFBb0I7QUFDaEUsTUFBS0EsTUFBTCxHQUFjQSxNQUFkO0FBQ0EsQ0FGRCIsImZpbGUiOiJCaW5vbWlhbFRyZWVXaXRoUGFyZW50LmpzIiwic291cmNlc0NvbnRlbnQiOlsiXG5cbmV4cG9ydCBkZWZhdWx0IGZ1bmN0aW9uIEJpbm9taWFsVHJlZVdpdGhQYXJlbnQgKCB2YWx1ZSwgY2hpbGRyZW4gKSB7XG5cdHRoaXMudmFsdWUgPSB2YWx1ZTtcblx0dGhpcy5jaGlsZHJlbiA9IGNoaWxkcmVuO1xuXHR0aGlzLnBhcmVudCA9IG51bGw7XG59XG5cbkJpbm9taWFsVHJlZVdpdGhQYXJlbnQucHJvdG90eXBlLnJhbmsgPSBmdW5jdGlvbiAoKSB7XG5cdHJldHVybiB0aGlzLmNoaWxkcmVuLmxlbmd0aDtcbn07XG5cbi8qKlxuICogLyFcXCBDYW4gb25seSBiZSB1c2VkIHRvIG1lcmdlIHR3byB0cmVlcyBvZiB0aGUgc2FtZSByYW5rLlxuICogLyFcXCBNb2RpZmllcyBib3RoIHRyZWVzXG4gKi9cblxuQmlub21pYWxUcmVlV2l0aFBhcmVudC5wcm90b3R5cGUubWVyZ2UgPSBmdW5jdGlvbiAoIHByZWRpY2F0ZSwgb3RoZXIgKSB7XG5cblx0aWYgKCBwcmVkaWNhdGUoIHRoaXMudmFsdWUsIG90aGVyLnZhbHVlICkgPD0gMCApIHtcblx0XHR0aGlzLmNoaWxkcmVuID0gdGhpcy5jaGlsZHJlbi5jb25jYXQoIG90aGVyICk7XG5cdFx0b3RoZXIucGFyZW50ID0gdGhpcztcblx0XHRyZXR1cm4gdGhpcztcblx0fVxuXG5cdGVsc2Uge1xuXHRcdG90aGVyLmNoaWxkcmVuID0gb3RoZXIuY2hpbGRyZW4uY29uY2F0KCB0aGlzICk7XG5cdFx0dGhpcy5wYXJlbnQgPSBvdGhlcjtcblx0XHRyZXR1cm4gb3RoZXI7XG5cdH1cblxufTtcblxuLyoqXG4gKiBNZXRob2QgdXNlZCB0byByZXNldCBhIHRyZWUgZWxlbWVudCBpbiBvcmRlciB0byByZXVzZSBpdFxuICogc29tZXdoZXJlIGVsc2UsIGUuZy4gaW5zZXJ0IGl0IGJhY2sgaW4gdGhlIHNhbWUgb3IgYSBuZXdcbiAqIGhlYXAuXG4gKi9cblxuQmlub21pYWxUcmVlV2l0aFBhcmVudC5wcm90b3R5cGUuZGV0YWNoID0gZnVuY3Rpb24gKCkge1xuXHR0aGlzLmNoaWxkcmVuLnNwbGljZSggMCApO1xuXHR0aGlzLnBhcmVudCA9IG51bGw7XG5cdHJldHVybiB0aGlzO1xufTtcblxuQmlub21pYWxUcmVlV2l0aFBhcmVudC5wcm90b3R5cGUuc2V0cGFyZW50ID0gZnVuY3Rpb24gKCBwYXJlbnQgKSB7XG5cdHRoaXMucGFyZW50ID0gcGFyZW50O1xufTtcbiJdfQ== \ No newline at end of file diff --git a/lib/LazyBinomialHeap.js b/lib/LazyBinomialHeap.js new file mode 100644 index 0000000..d525ac8 --- /dev/null +++ b/lib/LazyBinomialHeap.js @@ -0,0 +1,257 @@ +'use strict'; + +Object.defineProperty(exports, "__esModule", { + value: true +}); +exports.default = LazyBinomialHeap; + +var _LazyStack = require('./LazyStack'); + +var _LazyStack2 = _interopRequireDefault(_LazyStack); + +function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; } + +function LazyBinomialHeap(BinomialTree) { + + var lazy_binomial_heap_push = function lazy_binomial_heap_push(lazy, tree, rank) { + + var i, sequence; + + // lightweight binomial heap containing a unique tree + + sequence = []; + + // offset tree by its rank + + i = rank; + + while (i--) { + sequence.push(null); + } + + sequence.push(tree); + + // do not merge the generated sequence immediately + + lazy.push(sequence); + }; + + var merge = function merge(compare, list, other) { + + var i, len, carry; + + if (other.length === 0) { + return; + } + + // merging two binomial heaps is like + // adding two little endian integers + // so, we first make sure that we have + // enough place to store the result + + i = other.length - list.length; + + while (i-- > 0) { + list.push(null); + } + + carry = null; + + len = list.length; + + // remember len >= other.length + + for (i = 0; i < len; ++i) { + + // other[i] can be either null or not + // list[i] can be either null or not + // carry can be either null or not + // --> 2^3 = 8 possibilities + // + // null ? | other[i] | list[i] | carry + // --------------------------------------- + // (0) | no | no | no + // (1) | no | no | yes + // (2) | no | yes | no + // (3) | no | yes | yes + // (4) | yes | no | no + // (5) | yes | no | yes + // (6) | yes | yes | no + // (7) | yes | yes | yes + + if (i >= other.length || other[i] === null) { + + if (carry !== null) { + + // (6) other[i] = null and list[i] = null and carry != null + // --> put carry in current cell + + if (list[i] === null) { + list[i] = carry; + carry = null; + } + + // (4) other[i] = null and list[i] != null and carry != null + // --> merge carry with current cell + + else { + carry = carry.merge(compare, list[i]); + list[i] = null; + } + } + + // We do not need to do anything for + // those 2 cases (carry and other[i] are null). + // == + // (5) other[i] = null and list[i] != null and carry = null + // (7) other[i] = null and list[i] = null and carry = null + } + + // (0) other[i] != null and list[i] != null and carry != null + // (2) other[i] != null and list[i] = null and carry != null + // --> merge carry with other[i] + + else if (carry !== null) { + + carry = carry.merge(compare, other[i]); + } + + // (1) other[i] != null and list[i] != null and carry = null + // --> merge current cell with other[i] + + else if (list[i] !== null) { + + carry = list[i].merge(compare, other[i]); + list[i] = null; + } + + // (3) other[i] != null and list[i] = null and carry = null + // --> put other[i] in list + + else { + + list[i] = other[i]; + } + } + + // do not forget to append last carry + + if (carry !== null) { + list.push(carry); + } + }; + + var lazy_binomial_heap_pop = function lazy_binomial_heap_pop(compare, list, lazy) { + + var i, j, len, opt, item, candidate, orphan; + + // amortized merge of + // stored values + + while (!lazy.empty()) { + merge(compare, list, lazy.pop()); + } // standard O(log n) optimum search method + + len = list.length; + + // there MUST be at least one + // non null element in this list + // we look for the first one + + for (j = 0; j < len - 1 && list[j] === null; ++j) {} + + // here j is necessarily < len + // and list[j] is non null + + i = j; + opt = list[j].value; + + // we lookup remaining elements to see if there + // is not a better candidate + + for (++j; j < len; ++j) { + + item = list[j]; + + if (item !== null) { + + candidate = item.value; + + if (compare(candidate, opt) < 0) { + + i = j; + opt = candidate; + } + } + } + + orphan = list[i].children; + list[i] = null; + + // we just removed the ith element + // if list[i] is the last cell + // of list we can drop it + + if (i === len - 1) { + list.pop(); + } + + // we store the children in the + // lazy list + + lazy.push(orphan); + + return opt; + }; + + var Heap = function Heap(compare) { + + // the compare function to use to compare values + + this.compare = compare; + + // number of elements in this heap + + this.length = 0; + + // list of binomial trees + + this.list = []; + + // list of binomial heaps waiting to be merged + + this.lazy = new _LazyStack2.default(); + }; + + Heap.prototype.pop = function () { + + if (this.length === 0) { + return undefined; + } + + --this.length; + + return lazy_binomial_heap_pop(this.compare, this.list, this.lazy); + }; + + Heap.prototype.push = function (value) { + + ++this.length; + + // push a new tree of rank 0 + + return lazy_binomial_heap_push(this.lazy, new BinomialTree(value, []), 0); + }; + + Heap.prototype.merge = function (other) { + + this.lazy.meld(other.lazy); + + this.length += other.length; + + return this; + }; + + return Heap; +} +//# sourceMappingURL=data:application/json;base64,{"version":3,"sources":["../src/LazyBinomialHeap.js"],"names":["LazyBinomialHeap","BinomialTree","lazy_binomial_heap_push","lazy","tree","rank","i","sequence","push","merge","compare","list","other","len","carry","length","lazy_binomial_heap_pop","j","opt","item","candidate","orphan","empty","pop","value","children","Heap","prototype","undefined","meld"],"mappings":";;;;;kBAEwBA,gB;;AAFxB;;;;;;AAEe,SAASA,gBAAT,CAA4BC,YAA5B,EAA2C;;AAEzD,KAAIC,0BAA0B,SAA1BA,uBAA0B,CAAUC,IAAV,EAAgBC,IAAhB,EAAsBC,IAAtB,EAA4B;;AAEzD,MAAIC,CAAJ,EAAOC,QAAP;;AAEA;;AAEAA,aAAW,EAAX;;AAGA;;AAEAD,MAAID,IAAJ;;AAEA,SAAQC,GAAR,EAAc;AACbC,YAASC,IAAT,CAAe,IAAf;AACA;;AAEDD,WAASC,IAAT,CAAeJ,IAAf;;AAGA;;AAEAD,OAAKK,IAAL,CAAWD,QAAX;AAEA,EAxBD;;AA0BA,KAAIE,QAAQ,SAARA,KAAQ,CAAWC,OAAX,EAAoBC,IAApB,EAA0BC,KAA1B,EAAkC;;AAE7C,MAAIN,CAAJ,EAAOO,GAAP,EAAYC,KAAZ;;AAEA,MAAKF,MAAMG,MAAN,KAAiB,CAAtB,EAA0B;AACzB;AACA;;AAED;AACA;AACA;AACA;;AAEAT,MAAIM,MAAMG,MAAN,GAAeJ,KAAKI,MAAxB;;AAEA,SAAQT,MAAM,CAAd,EAAkB;AACjBK,QAAKH,IAAL,CAAW,IAAX;AACA;;AAEDM,UAAQ,IAAR;;AAEAD,QAAMF,KAAKI,MAAX;;AAEA;;AAEA,OAAMT,IAAI,CAAV,EAAcA,IAAIO,GAAlB,EAAwB,EAAEP,CAA1B,EAA8B;;AAE7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,OAAKA,KAAKM,MAAMG,MAAX,IAAqBH,MAAMN,CAAN,MAAa,IAAvC,EAA8C;;AAE7C,QAAKQ,UAAU,IAAf,EAAsB;;AAGrB;AACA;;AAEA,SAAKH,KAAKL,CAAL,MAAY,IAAjB,EAAwB;AACvBK,WAAKL,CAAL,IAAUQ,KAAV;AACAA,cAAQ,IAAR;AACA;;AAGD;AACA;;AAPA,UASK;AACJA,eAAQA,MAAML,KAAN,CAAaC,OAAb,EAAsBC,KAAKL,CAAL,CAAtB,CAAR;AACAK,YAAKL,CAAL,IAAU,IAAV;AACA;AAED;;AAED;AACA;AACA;AACA;AACA;AAEA;;AAED;AACA;AACA;;AAlCA,QAoCK,IAAKQ,UAAU,IAAf,EAAsB;;AAE1BA,aAAQA,MAAML,KAAN,CAAaC,OAAb,EAAsBE,MAAMN,CAAN,CAAtB,CAAR;AAEA;;AAED;AACA;;AAPK,SASA,IAAKK,KAAKL,CAAL,MAAY,IAAjB,EAAwB;;AAE5BQ,cAAQH,KAAKL,CAAL,EAAQG,KAAR,CAAeC,OAAf,EAAwBE,MAAMN,CAAN,CAAxB,CAAR;AACAK,WAAKL,CAAL,IAAU,IAAV;AAEA;;AAGD;AACA;;AATK,UAWA;;AAEJK,YAAKL,CAAL,IAAUM,MAAMN,CAAN,CAAV;AAEA;AAED;;AAED;;AAEA,MAAKQ,UAAU,IAAf,EAAsB;AACrBH,QAAKH,IAAL,CAAWM,KAAX;AACA;AAED,EAjHD;;AAoHA,KAAIE,yBAAyB,SAAzBA,sBAAyB,CAAWN,OAAX,EAAoBC,IAApB,EAA0BR,IAA1B,EAAiC;;AAE7D,MAAIG,CAAJ,EAAOW,CAAP,EAAUJ,GAAV,EAAeK,GAAf,EAAoBC,IAApB,EAA0BC,SAA1B,EAAqCC,MAArC;;AAEA;AACA;;AAEA,SAAQ,CAAElB,KAAKmB,KAAL,EAAV;AAA0Bb,SAAOC,OAAP,EAAgBC,IAAhB,EAAsBR,KAAKoB,GAAL,EAAtB;AAA1B,GAP6D,CAS7D;;AAEAV,QAAMF,KAAKI,MAAX;;AAEA;AACA;AACA;;AAEA,OAAME,IAAI,CAAV,EAAcA,IAAIJ,MAAM,CAAV,IAAeF,KAAKM,CAAL,MAAY,IAAzC,EAAgD,EAAEA,CAAlD;;AAEA;AACA;;AAEAX,MAAIW,CAAJ;AACAC,QAAMP,KAAKM,CAAL,EAAQO,KAAd;;AAEA;AACA;;AAEA,OAAM,EAAEP,CAAR,EAAYA,IAAIJ,GAAhB,EAAsB,EAAEI,CAAxB,EAA4B;;AAE3BE,UAAOR,KAAKM,CAAL,CAAP;;AAEA,OAAKE,SAAS,IAAd,EAAqB;;AAEpBC,gBAAYD,KAAKK,KAAjB;;AAEA,QAAKd,QAASU,SAAT,EAAoBF,GAApB,IAA4B,CAAjC,EAAqC;;AAEpCZ,SAAIW,CAAJ;AACAC,WAAME,SAAN;AAEA;AAED;AAED;;AAEDC,WAASV,KAAKL,CAAL,EAAQmB,QAAjB;AACAd,OAAKL,CAAL,IAAU,IAAV;;AAEA;AACA;AACA;;AAEA,MAAKA,MAAMO,MAAM,CAAjB,EAAqB;AACpBF,QAAKY,GAAL;AACA;;AAED;AACA;;AAEApB,OAAKK,IAAL,CAAWa,MAAX;;AAEA,SAAOH,GAAP;AACA,EAhED;;AAkEA,KAAIQ,OAAO,SAAPA,IAAO,CAAWhB,OAAX,EAAqB;;AAE/B;;AAEA,OAAKA,OAAL,GAAeA,OAAf;;AAGA;;AAEA,OAAKK,MAAL,GAAc,CAAd;;AAGA;;AAEA,OAAKJ,IAAL,GAAY,EAAZ;;AAGA;;AAEA,OAAKR,IAAL,GAAY,yBAAZ;AAEA,EArBD;;AAwBAuB,MAAKC,SAAL,CAAeJ,GAAf,GAAqB,YAAY;;AAEhC,MAAK,KAAKR,MAAL,KAAgB,CAArB,EAAyB;AACxB,UAAOa,SAAP;AACA;;AAED,IAAE,KAAKb,MAAP;;AAEA,SAAOC,uBAAwB,KAAKN,OAA7B,EAAsC,KAAKC,IAA3C,EAAiD,KAAKR,IAAtD,CAAP;AAEA,EAVD;;AAYAuB,MAAKC,SAAL,CAAenB,IAAf,GAAsB,UAAUgB,KAAV,EAAiB;;AAEtC,IAAE,KAAKT,MAAP;;AAEA;;AAEA,SAAOb,wBAAyB,KAAKC,IAA9B,EAAoC,IAAIF,YAAJ,CAAkBuB,KAAlB,EAAyB,EAAzB,CAApC,EAAmE,CAAnE,CAAP;AAEA,EARD;;AAWAE,MAAKC,SAAL,CAAelB,KAAf,GAAuB,UAAWG,KAAX,EAAmB;;AAEzC,OAAKT,IAAL,CAAU0B,IAAV,CAAgBjB,MAAMT,IAAtB;;AAEA,OAAKY,MAAL,IAAeH,MAAMG,MAArB;;AAEA,SAAO,IAAP;AACA,EAPD;;AASA,QAAOW,IAAP;AACA","file":"LazyBinomialHeap.js","sourcesContent":["import LazyStack from './LazyStack' ;\n\nexport default function LazyBinomialHeap ( BinomialTree ) {\n\n\tvar lazy_binomial_heap_push = function( lazy, tree, rank ){\n\n\t\tvar i, sequence;\n\n\t\t// lightweight binomial heap containing a unique tree\n\n\t\tsequence = [];\n\n\n\t\t// offset tree by its rank\n\n\t\ti = rank;\n\n\t\twhile ( i-- ) {\n\t\t\tsequence.push( null );\n\t\t}\n\n\t\tsequence.push( tree );\n\n\n\t\t// do not merge the generated sequence immediately\n\n\t\tlazy.push( sequence );\n\n\t};\n\n\tvar merge = function ( compare, list, other ) {\n\n\t\tvar i, len, carry;\n\n\t\tif ( other.length === 0 ) {\n\t\t\treturn;\n\t\t}\n\n\t\t// merging two binomial heaps is like\n\t\t// adding two little endian integers\n\t\t// so, we first make sure that we have\n\t\t// enough place to store the result\n\n\t\ti = other.length - list.length;\n\n\t\twhile ( i --> 0 ) {\n\t\t\tlist.push( null );\n\t\t}\n\n\t\tcarry = null;\n\n\t\tlen = list.length;\n\n\t\t// remember len >= other.length\n\n\t\tfor ( i = 0 ; i < len ; ++i ) {\n\n\t\t\t// other[i] can be either null or not\n\t\t\t// list[i] can be either null or not\n\t\t\t// carry can be either null or not\n\t\t\t// --> 2^3 = 8 possibilities\n\t\t\t//\n\t\t\t//    null ? | other[i] | list[i] | carry\n\t\t\t// ---------------------------------------\n\t\t\t//     (0)   |    no    |     no  |   no\n\t\t\t//     (1)   |    no    |     no  |  yes\n\t\t\t//     (2)   |    no    |    yes  |   no\n\t\t\t//     (3)   |    no    |    yes  |  yes\n\t\t\t//     (4)   |   yes    |     no  |   no\n\t\t\t//     (5)   |   yes    |     no  |  yes\n\t\t\t//     (6)   |   yes    |    yes  |   no\n\t\t\t//     (7)   |   yes    |    yes  |  yes\n\n\t\t\tif ( i >= other.length || other[i] === null ) {\n\n\t\t\t\tif ( carry !== null ) {\n\n\n\t\t\t\t\t// (6) other[i] = null and list[i] = null and carry != null\n\t\t\t\t\t// --> put carry in current cell\n\n\t\t\t\t\tif ( list[i] === null ) {\n\t\t\t\t\t\tlist[i] = carry;\n\t\t\t\t\t\tcarry = null;\n\t\t\t\t\t}\n\n\n\t\t\t\t\t// (4) other[i] = null and list[i] != null and carry != null\n\t\t\t\t\t// --> merge carry with current cell\n\n\t\t\t\t\telse {\n\t\t\t\t\t\tcarry = carry.merge( compare, list[i] );\n\t\t\t\t\t\tlist[i] = null;\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t\t// We do not need to do anything for\n\t\t\t\t// those 2 cases (carry and other[i] are null).\n\t\t\t\t// ==\n\t\t\t\t// (5) other[i] = null and list[i] != null and carry = null\n\t\t\t\t// (7) other[i] = null and list[i] = null and carry = null\n\n\t\t\t}\n\n\t\t\t// (0) other[i] != null and list[i] != null and carry != null\n\t\t\t// (2) other[i] != null and list[i] = null and carry != null\n\t\t\t// --> merge carry with other[i]\n\n\t\t\telse if ( carry !== null ) {\n\n\t\t\t\tcarry = carry.merge( compare, other[i] );\n\n\t\t\t}\n\n\t\t\t// (1) other[i] != null and list[i] != null and carry = null\n\t\t\t// --> merge current cell with other[i]\n\n\t\t\telse if ( list[i] !== null ) {\n\n\t\t\t\tcarry = list[i].merge( compare, other[i] );\n\t\t\t\tlist[i] = null;\n\n\t\t\t}\n\n\n\t\t\t// (3) other[i] != null and list[i] = null and carry = null\n\t\t\t// --> put other[i] in list\n\n\t\t\telse {\n\n\t\t\t\tlist[i] = other[i];\n\n\t\t\t}\n\n\t\t}\n\n\t\t// do not forget to append last carry\n\n\t\tif ( carry !== null ) {\n\t\t\tlist.push( carry );\n\t\t}\n\n\t};\n\n\n\tvar lazy_binomial_heap_pop = function ( compare, list, lazy ) {\n\n\t\tvar i, j, len, opt, item, candidate, orphan;\n\n\t\t// amortized merge of\n\t\t// stored values\n\n\t\twhile ( ! lazy.empty( ) ) merge( compare, list, lazy.pop( ) ) ;\n\n\t\t// standard O(log n) optimum search method\n\n\t\tlen = list.length;\n\n\t\t// there MUST be at least one\n\t\t// non null element in this list\n\t\t// we look for the first one\n\n\t\tfor ( j = 0 ; j < len - 1 && list[j] === null ; ++j ) ;\n\n\t\t// here j is necessarily < len\n\t\t// and list[j] is non null\n\n\t\ti = j;\n\t\topt = list[j].value;\n\n\t\t// we lookup remaining elements to see if there\n\t\t// is not a better candidate\n\n\t\tfor ( ++j ; j < len ; ++j ) {\n\n\t\t\titem = list[j];\n\n\t\t\tif ( item !== null ) {\n\n\t\t\t\tcandidate = item.value;\n\n\t\t\t\tif ( compare( candidate, opt ) < 0 ) {\n\n\t\t\t\t\ti = j;\n\t\t\t\t\topt = candidate;\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t\torphan = list[i].children;\n\t\tlist[i] = null;\n\n\t\t// we just removed the ith element\n\t\t// if list[i] is the last cell\n\t\t// of list we can drop it\n\n\t\tif ( i === len - 1 ) {\n\t\t\tlist.pop();\n\t\t}\n\n\t\t// we store the children in the\n\t\t// lazy list\n\n\t\tlazy.push( orphan );\n\n\t\treturn opt;\n\t};\n\n\tvar Heap = function ( compare ) {\n\n\t\t// the compare function to use to compare values\n\n\t\tthis.compare = compare;\n\n\n\t\t// number of elements in this heap\n\n\t\tthis.length = 0;\n\n\n\t\t// list of binomial trees\n\n\t\tthis.list = [];\n\n\n\t\t// list of binomial heaps waiting to be merged\n\n\t\tthis.lazy = new LazyStack( ) ;\n\n\t};\n\n\n\tHeap.prototype.pop = function () {\n\n\t\tif ( this.length === 0 ) {\n\t\t\treturn undefined;\n\t\t}\n\n\t\t--this.length;\n\n\t\treturn lazy_binomial_heap_pop( this.compare, this.list, this.lazy );\n\n\t};\n\n\tHeap.prototype.push = function (value) {\n\n\t\t++this.length;\n\n\t\t// push a new tree of rank 0\n\n\t\treturn lazy_binomial_heap_push( this.lazy, new BinomialTree( value, [] ), 0 );\n\n\t};\n\n\n\tHeap.prototype.merge = function ( other ) {\n\n\t\tthis.lazy.meld( other.lazy ) ;\n\n\t\tthis.length += other.length ;\n\n\t\treturn this ;\n\t};\n\n\treturn Heap;\n}\n"]} \ No newline at end of file diff --git a/lib/LazyNode.js b/lib/LazyNode.js new file mode 100644 index 0000000..ab65a67 --- /dev/null +++ b/lib/LazyNode.js @@ -0,0 +1,12 @@ +"use strict"; + +Object.defineProperty(exports, "__esModule", { + value: true +}); +exports.default = LazyNode; +function LazyNode(value, next) { + + this.value = value; + this.next = next; +} +//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJzb3VyY2VzIjpbIi4uL3NyYy9MYXp5Tm9kZS5qcyJdLCJuYW1lcyI6WyJMYXp5Tm9kZSIsInZhbHVlIiwibmV4dCJdLCJtYXBwaW5ncyI6Ijs7Ozs7a0JBQ3dCQSxRO0FBQVQsU0FBU0EsUUFBVCxDQUFvQkMsS0FBcEIsRUFBNEJDLElBQTVCLEVBQW1DOztBQUVqRCxNQUFLRCxLQUFMLEdBQWFBLEtBQWI7QUFDQSxNQUFLQyxJQUFMLEdBQVlBLElBQVo7QUFFQSIsImZpbGUiOiJMYXp5Tm9kZS5qcyIsInNvdXJjZXNDb250ZW50IjpbIlxuZXhwb3J0IGRlZmF1bHQgZnVuY3Rpb24gTGF6eU5vZGUgKCB2YWx1ZSAsIG5leHQgKSB7XG5cblx0dGhpcy52YWx1ZSA9IHZhbHVlIDtcblx0dGhpcy5uZXh0ID0gbmV4dCA7XG5cbn1cbiJdfQ== \ No newline at end of file diff --git a/lib/LazyStack.js b/lib/LazyStack.js new file mode 100644 index 0000000..e70ce95 --- /dev/null +++ b/lib/LazyStack.js @@ -0,0 +1,60 @@ +'use strict'; + +Object.defineProperty(exports, "__esModule", { + value: true +}); +exports.default = LazyStack; + +var _LazyNode = require('./LazyNode'); + +var _LazyNode2 = _interopRequireDefault(_LazyNode); + +function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; } + +/** + * LazyStack#peek only valid if LazyStack#empty is false. + * LazyStack#shift only valid if LazyStack#empty is false. + */ + +function LazyStack() { + + this.top = null; + this.bottom = null; +} + +LazyStack.prototype.empty = function () { + + return this.top === null; +}; + +LazyStack.prototype.push = function (value) { + + this.top = new _LazyNode2.default(value, this.top); + + if (this.bottom === null) this.bottom = this.top; +}; + +/** + * Only valid if LazyStack#empty is false. + */ + +LazyStack.prototype.pop = function () { + + var value; + + value = this.top.value; + + this.top = this.top.next; + + if (this.top === null) this.bottom = null; + + return value; +}; + +LazyStack.prototype.meld = function (other) { + + if (this.bottom === null) this.top = other.top;else this.bottom.next = other.top; + + this.bottom = other.bottom; +}; +//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJzb3VyY2VzIjpbIi4uL3NyYy9MYXp5U3RhY2suanMiXSwibmFtZXMiOlsiTGF6eVN0YWNrIiwidG9wIiwiYm90dG9tIiwicHJvdG90eXBlIiwiZW1wdHkiLCJwdXNoIiwidmFsdWUiLCJwb3AiLCJuZXh0IiwibWVsZCIsIm90aGVyIl0sIm1hcHBpbmdzIjoiOzs7OztrQkFPd0JBLFM7O0FBUHhCOzs7Ozs7QUFFQTs7Ozs7QUFLZSxTQUFTQSxTQUFULEdBQXVCOztBQUVyQyxNQUFLQyxHQUFMLEdBQVcsSUFBWDtBQUNBLE1BQUtDLE1BQUwsR0FBYyxJQUFkO0FBRUE7O0FBRURGLFVBQVVHLFNBQVYsQ0FBb0JDLEtBQXBCLEdBQTRCLFlBQWE7O0FBRXhDLFFBQU8sS0FBS0gsR0FBTCxLQUFhLElBQXBCO0FBRUEsQ0FKRDs7QUFNQUQsVUFBVUcsU0FBVixDQUFvQkUsSUFBcEIsR0FBMkIsVUFBV0MsS0FBWCxFQUFtQjs7QUFHN0MsTUFBS0wsR0FBTCxHQUFXLHVCQUFjSyxLQUFkLEVBQXNCLEtBQUtMLEdBQTNCLENBQVg7O0FBRUEsS0FBSyxLQUFLQyxNQUFMLEtBQWdCLElBQXJCLEVBQTRCLEtBQUtBLE1BQUwsR0FBYyxLQUFLRCxHQUFuQjtBQUU1QixDQVBEOztBQVNBOzs7O0FBSUFELFVBQVVHLFNBQVYsQ0FBb0JJLEdBQXBCLEdBQTBCLFlBQWE7O0FBRXRDLEtBQUlELEtBQUo7O0FBRUFBLFNBQVEsS0FBS0wsR0FBTCxDQUFTSyxLQUFqQjs7QUFFQSxNQUFLTCxHQUFMLEdBQVcsS0FBS0EsR0FBTCxDQUFTTyxJQUFwQjs7QUFFQSxLQUFLLEtBQUtQLEdBQUwsS0FBYSxJQUFsQixFQUF5QixLQUFLQyxNQUFMLEdBQWMsSUFBZDs7QUFFekIsUUFBT0ksS0FBUDtBQUVBLENBWkQ7O0FBY0FOLFVBQVVHLFNBQVYsQ0FBb0JNLElBQXBCLEdBQTJCLFVBQVdDLEtBQVgsRUFBbUI7O0FBRTdDLEtBQUssS0FBS1IsTUFBTCxLQUFnQixJQUFyQixFQUE0QixLQUFLRCxHQUFMLEdBQVdTLE1BQU1ULEdBQWpCLENBQTVCLEtBRUssS0FBS0MsTUFBTCxDQUFZTSxJQUFaLEdBQW1CRSxNQUFNVCxHQUF6Qjs7QUFFTCxNQUFLQyxNQUFMLEdBQWNRLE1BQU1SLE1BQXBCO0FBRUEsQ0FSRCIsImZpbGUiOiJMYXp5U3RhY2suanMiLCJzb3VyY2VzQ29udGVudCI6WyJpbXBvcnQgTGF6eU5vZGUgZnJvbSAnLi9MYXp5Tm9kZScgO1xuXG4vKipcbiAqIExhenlTdGFjayNwZWVrIG9ubHkgdmFsaWQgaWYgTGF6eVN0YWNrI2VtcHR5IGlzIGZhbHNlLlxuICogTGF6eVN0YWNrI3NoaWZ0IG9ubHkgdmFsaWQgaWYgTGF6eVN0YWNrI2VtcHR5IGlzIGZhbHNlLlxuICovXG5cbmV4cG9ydCBkZWZhdWx0IGZ1bmN0aW9uIExhenlTdGFjayAoICkge1xuXG5cdHRoaXMudG9wID0gbnVsbCA7XG5cdHRoaXMuYm90dG9tID0gbnVsbCA7XG5cbn1cblxuTGF6eVN0YWNrLnByb3RvdHlwZS5lbXB0eSA9IGZ1bmN0aW9uICggKSB7XG5cblx0cmV0dXJuIHRoaXMudG9wID09PSBudWxsIDtcblxufSA7XG5cbkxhenlTdGFjay5wcm90b3R5cGUucHVzaCA9IGZ1bmN0aW9uICggdmFsdWUgKSB7XG5cblxuXHR0aGlzLnRvcCA9IG5ldyBMYXp5Tm9kZSggdmFsdWUgLCB0aGlzLnRvcCApIDtcblxuXHRpZiAoIHRoaXMuYm90dG9tID09PSBudWxsICkgdGhpcy5ib3R0b20gPSB0aGlzLnRvcCA7XG5cbn0gO1xuXG4vKipcbiAqIE9ubHkgdmFsaWQgaWYgTGF6eVN0YWNrI2VtcHR5IGlzIGZhbHNlLlxuICovXG5cbkxhenlTdGFjay5wcm90b3R5cGUucG9wID0gZnVuY3Rpb24gKCApIHtcblxuXHR2YXIgdmFsdWUgO1xuXG5cdHZhbHVlID0gdGhpcy50b3AudmFsdWUgO1xuXG5cdHRoaXMudG9wID0gdGhpcy50b3AubmV4dCA7XG5cblx0aWYgKCB0aGlzLnRvcCA9PT0gbnVsbCApIHRoaXMuYm90dG9tID0gbnVsbCA7XG5cblx0cmV0dXJuIHZhbHVlIDtcblxufSA7XG5cbkxhenlTdGFjay5wcm90b3R5cGUubWVsZCA9IGZ1bmN0aW9uICggb3RoZXIgKSB7XG5cblx0aWYgKCB0aGlzLmJvdHRvbSA9PT0gbnVsbCApIHRoaXMudG9wID0gb3RoZXIudG9wIDtcblxuXHRlbHNlIHRoaXMuYm90dG9tLm5leHQgPSBvdGhlci50b3AgO1xuXG5cdHRoaXMuYm90dG9tID0gb3RoZXIuYm90dG9tIDtcblxufSA7XG4iXX0= \ No newline at end of file diff --git a/lib/index.js b/lib/index.js new file mode 100644 index 0000000..787acdd --- /dev/null +++ b/lib/index.js @@ -0,0 +1,48 @@ +'use strict'; + +Object.defineProperty(exports, "__esModule", { + value: true +}); +exports.LazyStack = exports.LazyNode = exports.LazyBinomialHeap = exports.BinomialTreeWithParent = exports.BinomialTree = exports.BinomialHeap = undefined; + +var _BinomialHeap = require('./BinomialHeap'); + +var _BinomialHeap2 = _interopRequireDefault(_BinomialHeap); + +var _BinomialTree = require('./BinomialTree'); + +var _BinomialTree2 = _interopRequireDefault(_BinomialTree); + +var _BinomialTreeWithParent = require('./BinomialTreeWithParent'); + +var _BinomialTreeWithParent2 = _interopRequireDefault(_BinomialTreeWithParent); + +var _LazyBinomialHeap = require('./LazyBinomialHeap'); + +var _LazyBinomialHeap2 = _interopRequireDefault(_LazyBinomialHeap); + +var _LazyNode = require('./LazyNode'); + +var _LazyNode2 = _interopRequireDefault(_LazyNode); + +var _LazyStack = require('./LazyStack'); + +var _LazyStack2 = _interopRequireDefault(_LazyStack); + +function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; } + +exports.default = { + BinomialHeap: _BinomialHeap2.default, + BinomialTree: _BinomialTree2.default, + BinomialTreeWithParent: _BinomialTreeWithParent2.default, + LazyBinomialHeap: _LazyBinomialHeap2.default, + LazyNode: _LazyNode2.default, + LazyStack: _LazyStack2.default +}; +exports.BinomialHeap = _BinomialHeap2.default; +exports.BinomialTree = _BinomialTree2.default; +exports.BinomialTreeWithParent = _BinomialTreeWithParent2.default; +exports.LazyBinomialHeap = _LazyBinomialHeap2.default; +exports.LazyNode = _LazyNode2.default; +exports.LazyStack = _LazyStack2.default; +//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJzb3VyY2VzIjpbIi4uL3NyYy9pbmRleC5qcyJdLCJuYW1lcyI6WyJCaW5vbWlhbEhlYXAiLCJCaW5vbWlhbFRyZWUiLCJCaW5vbWlhbFRyZWVXaXRoUGFyZW50IiwiTGF6eUJpbm9taWFsSGVhcCIsIkxhenlOb2RlIiwiTGF6eVN0YWNrIl0sIm1hcHBpbmdzIjoiOzs7Ozs7O0FBQUE7Ozs7QUFDQTs7OztBQUNBOzs7O0FBQ0E7Ozs7QUFDQTs7OztBQUNBOzs7Ozs7a0JBRWU7QUFDZEEscUNBRGM7QUFFZEMscUNBRmM7QUFHZEMseURBSGM7QUFJZEMsNkNBSmM7QUFLZEMsNkJBTGM7QUFNZEM7QUFOYyxDO1FBVWRMLFk7UUFDQUMsWTtRQUNBQyxzQjtRQUNBQyxnQjtRQUNBQyxRO1FBQ0FDLFMiLCJmaWxlIjoiaW5kZXguanMiLCJzb3VyY2VzQ29udGVudCI6WyJpbXBvcnQgQmlub21pYWxIZWFwIGZyb20gJy4vQmlub21pYWxIZWFwJyA7XG5pbXBvcnQgQmlub21pYWxUcmVlIGZyb20gJy4vQmlub21pYWxUcmVlJyA7XG5pbXBvcnQgQmlub21pYWxUcmVlV2l0aFBhcmVudCBmcm9tICcuL0Jpbm9taWFsVHJlZVdpdGhQYXJlbnQnIDtcbmltcG9ydCBMYXp5Qmlub21pYWxIZWFwIGZyb20gJy4vTGF6eUJpbm9taWFsSGVhcCcgO1xuaW1wb3J0IExhenlOb2RlIGZyb20gJy4vTGF6eU5vZGUnIDtcbmltcG9ydCBMYXp5U3RhY2sgZnJvbSAnLi9MYXp5U3RhY2snIDtcblxuZXhwb3J0IGRlZmF1bHQge1xuXHRCaW5vbWlhbEhlYXAgLFxuXHRCaW5vbWlhbFRyZWUgLFxuXHRCaW5vbWlhbFRyZWVXaXRoUGFyZW50ICxcblx0TGF6eUJpbm9taWFsSGVhcCAsXG5cdExhenlOb2RlICxcblx0TGF6eVN0YWNrICxcbn0gO1xuXG5leHBvcnQge1xuXHRCaW5vbWlhbEhlYXAgLFxuXHRCaW5vbWlhbFRyZWUgLFxuXHRCaW5vbWlhbFRyZWVXaXRoUGFyZW50ICxcblx0TGF6eUJpbm9taWFsSGVhcCAsXG5cdExhenlOb2RlICxcblx0TGF6eVN0YWNrICxcbn0gO1xuIl19 \ No newline at end of file diff --git a/package.json b/package.json index d88f820..13276a0 100644 --- a/package.json +++ b/package.json @@ -1,37 +1,61 @@ { - "name": "aureooms-js-binomial-heap", - "description": "Binomial heap code bricks for JavaScript", - "homepage": "http://aureooms.github.io/js-binomial-heap/", - "main": "js/dist/binomial-heap.js", - "version": "10.0.1", - "repository": { - "url": "https://github.com/aureooms/js-binomial-heap.git", - "type": "git" - }, - "keywords": [ - "binomial", - "bricks", - "ender", - "heap", - "javascript", - "js" - ], - "scripts": { - "build": "./node_modules/.bin/aureooms-node-package-build", - "test": "./node_modules/.bin/aureooms-node-package-test", - "doc": "./node_modules/.bin/groc" - }, - "author": "aureooms", - "devDependencies": { - "aureooms-js-heap-spec": "^8.0.0", - "aureooms-node-package": "^6.0.1" - }, - "bugs": { - "url": "https://github.com/aureooms/js-binomial-heap/issues" - }, - "dependencies": {}, - "license": "AGPL-3.0", - "spm": { - "main": "js/dist/binomial-heap.js" - } -} \ No newline at end of file + "name": "aureooms-js-binomial-heap", + "description": "Binomial heap data structures for JavaScript", + "version": "10.0.1", + "author": "Aurélien Ooms ", + "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": "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" + } +} diff --git a/pkg.json b/pkg.json deleted file mode 100644 index 1ceeeea..0000000 --- a/pkg.json +++ /dev/null @@ -1,18 +0,0 @@ -{ - "name": "binomial-heap", - "code": { - "main": [ - "js", - "dist", - "binomial-heap.js" - ], - "test": [ - "test", - "js" - ] - }, - "src": "js/src/", - "debug": false, - "out": "js/dist/", - "babel": true -} \ No newline at end of file diff --git a/js/src/BinomialHeap.js b/src/BinomialHeap.js similarity index 99% rename from js/src/BinomialHeap.js rename to src/BinomialHeap.js index 32b62a8..a5f5afc 100644 --- a/js/src/BinomialHeap.js +++ b/src/BinomialHeap.js @@ -1,4 +1,4 @@ -var BinomialHeap = function ( BinomialTree ) { +export default function BinomialHeap ( BinomialTree ) { var binomial_heap_push = function ( compare, list, tree, rank ) { @@ -515,6 +515,4 @@ var BinomialHeap = function ( BinomialTree ) { return Heap; -}; - -exports.BinomialHeap = BinomialHeap; +} diff --git a/js/src/BinomialTree.js b/src/BinomialTree.js similarity index 89% rename from js/src/BinomialTree.js rename to src/BinomialTree.js index 36f5fc6..81a0b8a 100644 --- a/js/src/BinomialTree.js +++ b/src/BinomialTree.js @@ -1,9 +1,9 @@ -var BinomialTree = function ( value, children ) { +export default function BinomialTree ( value, children ) { this.value = value; this.children = children; -}; +} /** * /!\ Can only be used to merge two trees of the same rank. @@ -38,5 +38,3 @@ BinomialTree.prototype.detach = function () { BinomialTree.prototype.setparent = function ( parent ) { // we do not keep track of any parent here }; - -exports.BinomialTree = BinomialTree; diff --git a/js/src/BinomialTreeWithParent.js b/src/BinomialTreeWithParent.js similarity index 88% rename from js/src/BinomialTreeWithParent.js rename to src/BinomialTreeWithParent.js index b1302a4..fbab462 100644 --- a/js/src/BinomialTreeWithParent.js +++ b/src/BinomialTreeWithParent.js @@ -1,10 +1,10 @@ -var BinomialTreeWithParent = function ( value, children ) { +export default function BinomialTreeWithParent ( value, children ) { this.value = value; this.children = children; this.parent = null; -}; +} BinomialTreeWithParent.prototype.rank = function () { return this.children.length; @@ -46,5 +46,3 @@ BinomialTreeWithParent.prototype.detach = function () { BinomialTreeWithParent.prototype.setparent = function ( parent ) { this.parent = parent; }; - -exports.BinomialTreeWithParent = BinomialTreeWithParent; diff --git a/js/src/LazyBinomialHeap.js b/src/LazyBinomialHeap.js similarity index 97% rename from js/src/LazyBinomialHeap.js rename to src/LazyBinomialHeap.js index 6d3e379..c3c7b5f 100644 --- a/js/src/LazyBinomialHeap.js +++ b/src/LazyBinomialHeap.js @@ -1,5 +1,6 @@ +import LazyStack from './LazyStack' ; -var LazyBinomialHeap = function ( BinomialTree ) { +export default function LazyBinomialHeap ( BinomialTree ) { var lazy_binomial_heap_push = function( lazy, tree, rank ){ @@ -266,6 +267,4 @@ var LazyBinomialHeap = function ( BinomialTree ) { }; return Heap; -}; - -exports.LazyBinomialHeap = LazyBinomialHeap; +} diff --git a/src/LazyNode.js b/src/LazyNode.js new file mode 100644 index 0000000..e1b56a4 --- /dev/null +++ b/src/LazyNode.js @@ -0,0 +1,7 @@ + +export default function LazyNode ( value , next ) { + + this.value = value ; + this.next = next ; + +} diff --git a/js/src/LazyList.js b/src/LazyStack.js similarity index 91% rename from js/src/LazyList.js rename to src/LazyStack.js index 5b2b62d..8ff0fa8 100644 --- a/js/src/LazyList.js +++ b/src/LazyStack.js @@ -1,16 +1,16 @@ - +import LazyNode from './LazyNode' ; /** * LazyStack#peek only valid if LazyStack#empty is false. * LazyStack#shift only valid if LazyStack#empty is false. */ -var LazyStack = function ( ) { +export default function LazyStack ( ) { this.top = null ; this.bottom = null ; -} ; +} LazyStack.prototype.empty = function ( ) { @@ -54,5 +54,3 @@ LazyStack.prototype.meld = function ( other ) { this.bottom = other.bottom ; } ; - -exports.LazyStack = LazyStack ; diff --git a/src/index.js b/src/index.js new file mode 100644 index 0000000..61ab456 --- /dev/null +++ b/src/index.js @@ -0,0 +1,24 @@ +import BinomialHeap from './BinomialHeap' ; +import BinomialTree from './BinomialTree' ; +import BinomialTreeWithParent from './BinomialTreeWithParent' ; +import LazyBinomialHeap from './LazyBinomialHeap' ; +import LazyNode from './LazyNode' ; +import LazyStack from './LazyStack' ; + +export default { + BinomialHeap , + BinomialTree , + BinomialTreeWithParent , + LazyBinomialHeap , + LazyNode , + LazyStack , +} ; + +export { + BinomialHeap , + BinomialTree , + BinomialTreeWithParent , + LazyBinomialHeap , + LazyNode , + LazyStack , +} ; diff --git a/test/js/index.js b/test/js/index.js deleted file mode 100644 index 869a49d..0000000 --- a/test/js/index.js +++ /dev/null @@ -1,10 +0,0 @@ -var pkg = require('aureooms-node-package'); - - -var opt = { - src : __dirname + '/src/', - exports : module.exports, - base : 0 -}; - -pkg.include(opt); diff --git a/test/js/src/all.js b/test/js/src/all.js deleted file mode 100644 index e43db49..0000000 --- a/test/js/src/all.js +++ /dev/null @@ -1,42 +0,0 @@ - -var heapspec = require( "aureooms-js-heap-spec" ) ; - -var heapswithreferences = [ - - - [ "BinomialHeap, BinomialTreeWithParent" , function ( compare ) { - - return new ( binomialheap.BinomialHeap( binomialheap.BinomialTreeWithParent ) )( compare ) ; - - } ] , - - -] ; - -var heapswithoutreferences = [ - - [ "BinomialHeap, BinomialTree" , function ( compare ) { - - return new ( binomialheap.BinomialHeap( binomialheap.BinomialTree ) )( compare ) ; - - } ] , -] ; - -var lazyheaps = [ - - [ "LazyBinomialHeap, BinomialTree" , function ( compare ) { - - return new ( binomialheap.LazyBinomialHeap( binomialheap.BinomialTree ) )( compare ) ; - - } ] , - [ "LazyBinomialHeap, BinomialTreeWithParent" , function ( compare ) { - - return new ( binomialheap.LazyBinomialHeap( binomialheap.BinomialTreeWithParent ) )( compare ) ; - - } ] -] ; - -heapspec.test( heapswithreferences , true ) ; -heapspec.test( heapswithoutreferences , false ) ; -heapspec.pushpop( lazyheaps ) ; -heapspec.merge( lazyheaps ) ; diff --git a/test/src/spec.js b/test/src/spec.js new file mode 100644 index 0000000..59f98e0 --- /dev/null +++ b/test/src/spec.js @@ -0,0 +1,50 @@ +import ava from 'ava' ; + +import * as spec from 'aureooms-js-heap-spec' ; + +import { + BinomialHeap, + BinomialTreeWithParent, + BinomialTree, + LazyBinomialHeap, +} from '../../src' ; + +const heapswithreferences = [ + + + [ "BinomialHeap, BinomialTreeWithParent" , function ( compare ) { + + return new ( BinomialHeap( BinomialTreeWithParent ) )( compare ) ; + + } ] , + + +] ; + +const heapswithoutreferences = [ + + [ "BinomialHeap, BinomialTree" , function ( compare ) { + + return new ( BinomialHeap( BinomialTree ) )( compare ) ; + + } ] , +] ; + +const lazyheaps = [ + + [ "LazyBinomialHeap, BinomialTree" , function ( compare ) { + + return new ( LazyBinomialHeap( BinomialTree ) )( compare ) ; + + } ] , + [ "LazyBinomialHeap, BinomialTreeWithParent" , function ( compare ) { + + return new ( LazyBinomialHeap( BinomialTreeWithParent ) )( compare ) ; + + } ] +] ; + +spec.test( ava , heapswithreferences , { references : true , length : true } ) ; +spec.test( ava , heapswithoutreferences , { references : false , length : true } ) ; +spec.pushpop( ava , true , lazyheaps ) ; +spec.merge( ava , true , lazyheaps ) ; From d1c4546ce00d0818f85438b3b910f5024b7c67f5 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Aur=C3=A9lien=20Ooms?= Date: Wed, 18 Jan 2017 19:44:26 +0100 Subject: [PATCH 2/3] esdoc does not support ava --- esdoc.json | 4 ---- 1 file changed, 4 deletions(-) diff --git a/esdoc.json b/esdoc.json index f2645d6..eaf839a 100644 --- a/esdoc.json +++ b/esdoc.json @@ -10,10 +10,6 @@ "index": "./README.md", "package": "./package.json", "title": "aureooms/js-binomial-heap", - "test": { - "type": "ava", - "source": "./test/src" - }, "manual": { "overview": [ "./doc/manual/overview.md" From 403371b2a13fa97270ebdfee56c31aa32c2bee1d Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Aur=C3=A9lien=20Ooms?= Date: Wed, 18 Jan 2017 19:44:58 +0100 Subject: [PATCH 3/3] 11.0.0 --- package.json | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/package.json b/package.json index 13276a0..496dea7 100644 --- a/package.json +++ b/package.json @@ -1,7 +1,7 @@ { "name": "aureooms-js-binomial-heap", "description": "Binomial heap data structures for JavaScript", - "version": "10.0.1", + "version": "11.0.0", "author": "Aurélien Ooms ", "ava": { "require": [