
Security News
Feross on TBPN: How North Korea Hijacked Axios
Socket CEO Feross Aboukhadijeh breaks down how North Korea hijacked Axios and what it means for the future of software supply chain security.
@practicaljs/priority-queue
Advanced tools
Javascript Priority Queue ( Min / Max Heap ).
| Method | Time Complexity |
|---|---|
| Peek | O(1) |
| Enqueue | O(logn) |
| Dequeue | O(logn) |
| Clear | O(1) |
npm i @practicaljs/priority-queue
Create a new priority queue class
const queue = new PriorityQueue<number>((a, b) => a - b);
To prioritize lower values use a-b, for higher values use b-a
example
const nums = [3, 5, 9, 4, 1, 6, 2, 7, 8];
const queue = new PriorityQueue<number>((a, b) => a - b);
// [1, 2, 3....]
const queue = new PriorityQueue<number>((a, b) => b - a);
// [9, 8, 7....]
The same can be done for objects
const foodLikes = [
{ name: 'sushi', rating: 4 },
{ name: 'chicken', rating: 4 },
{ name: 'beef', rating: 5 },
{ name: 'pork', rating: 1 }
];
// prioritize by lower rating
const queue = new PriorityQueue<typeof foodLikes[0]>((a, b) => a.rating - b.rating);
// [{ name: 'pork', rating: 1 }, { name: 'sushi', rating: 4 }...]
const queue = new PriorityQueue<typeof foodLikes[0]>((a, b) => b.rating - a.rating);
// [ { name: 'beef', rating: 5 }, { name: 'chicken', rating: 4 }...]
You can also prioritize object by special logic, in this case the object you want to prioritize give it a lower value
const events = [
{ name: 'Dinner', time: 19 },
{ name: 'Special - House Music', time: 22 },
{ name: 'lunch', time: 12 },
{ name: 'breakfast', time: 7 },
{ name: 'Special - Live Music', time: 23 }
];
const queue = new PriorityQueue<typeof events[0]>((a, b) => {
const aRating = a.name.startsWith('Special') ? 0 : 2;
const bRating = b.name.startsWith('Special') ? 0 : 2;
// if a == 0 and b == 2 it will be prioritized
// if you want to prioritize non special events change the
// order to bRating - aRating;
return aRating - bRating;
});
//[{ name: 'Special - House Music', time: 22 }, { name: 'Special - Live Music', time: 23 }...]
You can also prioritize by secondary vaules
const events = [
{ name: 'Dinner', time: 19 },
{ name: 'Special - House Music', time: 22 },
{ name: 'lunch', time: 12 },
{ name: 'breakfast', time: 7 },
{ name: 'Special - Live Music', time: 23 }
];
const queue = new PriorityQueue<typeof events[0]>((a, b) => {
const aRating = a.name.startsWith('Special') ? 0 : 2;
const bRating = b.name.startsWith('Special') ? 0 : 2;
if (aRating == bRating) {
// Here I want earliest time first
return a.time - b.time
}
return aRating - bRating;
});
//[{ name: 'Special - House Music', time: 22 }, { name: 'Special - Live Music', time: 23 }, { name: 'breakfast', time: 7}...]
FAQs
Javascript / Typescript priority queue ( max / min heap )
The npm package @practicaljs/priority-queue receives a total of 22 weekly downloads. As such, @practicaljs/priority-queue popularity was classified as not popular.
We found that @practicaljs/priority-queue demonstrated a not healthy version release cadence and project activity because the last version was released a year ago. It has 2 open source maintainers 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
Socket CEO Feross Aboukhadijeh breaks down how North Korea hijacked Axios and what it means for the future of software supply chain security.

Security News
OpenSSF has issued a high-severity advisory warning open source developers of an active Slack-based campaign using impersonation to deliver malware.

Research
/Security News
Malicious packages published to npm, PyPI, Go Modules, crates.io, and Packagist impersonate developer tooling to fetch staged malware, steal credentials and wallets, and enable remote access.