heapify
heapify copied to clipboard
The fastest JavaScript priority queue out there. Zero dependencies.
Bumps [terser](https://github.com/terser/terser) from 5.10.0 to 5.14.2. Changelog Sourced from terser's changelog. v5.14.2 Security fix for RegExps that should not be evaluated (regexp DDOS) Source maps improvements (#1211) Performance improvements in...
Bumps [node-fetch](https://github.com/node-fetch/node-fetch) from 2.6.1 to 2.6.7. Release notes Sourced from node-fetch's releases. v2.6.7 Security patch release Recommended to upgrade, to not leak sensitive cookie and authentication header information to 3th...
Should partially fix #24
Currently the `KeysBackingArrayType` and `PrioritiesBackingArrayType` do not allow arbitrary TypedArray types.
Bumps [minimist](https://github.com/substack/minimist) from 1.2.5 to 1.2.6. Commits 7efb22a 1.2.6 ef88b93 security notice for additional prototype pollution issue c2b9819 isConstructorOrProto adapted from PR bc8ecee test from prototype pollution PR See full...
``` priorityQueue.push("x,y", 10) priorityQueue.push("a", 20) console.log(priorityQueue.pop()) // 0 console.log(priorityQueue.peek()) // 0 ``` The output should be ``` "x,y" "a" ``` I want to use Dijkstra's algorithm on a 2D-array grid....
Add support for being able to use require instead of import. This is useful when working with Node.js and you for some reason can't use ES modules
I don't know if this is outside the scope of this project, but while trying to implement Dijkstra's algorithm with this library I stumbled into this requirement. Basically I need...
I.e. something like this: ```typescript popItem(): [number, number] | undefined; peekItem(): [number, number] | undefined; ```
I could not find a description on what `peek()` and `peekPriority()` return when the heap is empty. `pop()` has a return type of `number | undefined`, and is documented to...