
Security News
Vite Releases Technical Preview of Rolldown-Vite, a Rust-Based Bundler
Vite releases Rolldown-Vite, a Rust-based bundler preview offering faster builds and lower memory usage as a drop-in replacement for Vite.
ts-priority-queue
Advanced tools
Supply Chain Security
Vulnerability
Quality
Maintenance
License
A priority queue is a data structure with these operations:
Operation | Syntax (ts-priority-queue) | Description |
---|---|---|
Create | var queue = new PriorityQueue(); | Creates a priority queue |
Queue | queue.queue(value); | Inserts a new value in the queue |
Length | var length = queue.length; | Returns the number of elements in the queue |
Peek | var firstItem = queue.peek(); | Returns the smallest item in the queue and leaves the queue unchanged |
Dequeue | var firstItem = queue.dequeue(); | Returns the smallest item in the queue and removes it from the queue |
Clear | queue.clear(); | Removes all values from the queue |
You cannot access the data in any other way: you must dequeue or peek.
Provides an O(log n) approach to priority queue insertions and removals. I forked this from the CoffeeScript js-priority-queue library so that I could write it in TypeScript. I've removed the array- and BHeap-based strategies as they were not recommended for use anyway.
You can npm install ts-priority-queue
Then write code like this:
var queue = new PriorityQueue({ comparator: function(a, b) { return b - a; }});
queue.queue(5);
queue.queue(3);
queue.queue(2);
var lowest = queue.dequeue(); // returns 5
How exactly will these elements be ordered? Let's use the comparator
option.
This is the argument we would pass to
Array.prototype.sort:
var compareNumbers = function(a, b) { return a - b; };
var queue = new PriorityQueue({ comparator: compareNumbers });
You can also pass initial values, in any order. With lots of values, it's faster to load them all at once than one at a time.
var queue = new PriorityQueue({ comparator: compareNumbers, initialValues: [ 1, 2, 3 ] })
Complexity:
Operation | Complexity |
---|---|
Create | O(n lg n) |
Queue | O(lg n) |
Peek | O(1) |
Dequeue | O(lg n) |
Public Domain. Do with it what you will.
FAQs
Priority queue data structures
The npm package ts-priority-queue receives a total of 202 weekly downloads. As such, ts-priority-queue popularity was classified as not popular.
We found that ts-priority-queue demonstrated a not healthy version release cadence and project activity because the last version was released a year ago. It has 1 open source maintainer collaborating on the project.
Did you know?
Socket for GitHub automatically highlights issues in each pull request and monitors the health of all your open source dependencies. Discover the contents of your packages and block harmful activity before you install or update your dependencies.
Security News
Vite releases Rolldown-Vite, a Rust-based bundler preview offering faster builds and lower memory usage as a drop-in replacement for Vite.
Research
Security News
A malicious npm typosquat uses remote commands to silently delete entire project directories after a single mistyped install.
Research
Security News
Malicious PyPI package semantic-types steals Solana private keys via transitive dependency installs using monkey patching and blockchain exfiltration.