Yet another priority queue implementation.
npm install priority-queue-jsYet another priority queue implementation.
push, slice, forEach, map etc.)npm install priority-queue-js.push(item) - inserts a new item.peek() - returns the smallest item.pop() - removes the smallest item and returns it.shift() - removes the biggest item and returns it.slice(begin, end) - returns slice of queue data.copy() - returns copy of queue datajs
import PriorityQueue from 'priority-queue-js';const queue = new PriorityQueue();
queue.push(9);
queue.push(3);
queue.push(5);
console.log(queue.copy()) // [3, 5, 9]
``js
function comparator(a, b) {
return a.val - b.val;
}const queue = new PriorityQueue({ comparator });
queue.push({ val: 9 });
queue.push({ val: 3 });
queue.push({ val: 5 });
for (const item of queue) {
console.log(item.val);
}
``