priority-slot-queue

Simple priority queue with stable ordering, built on btree-core.

Lower priority numbers come out first. Equal priorities keep insertion order.

Install

npm install priority-slot-queue

Usage

const PrioritySlotQueue = require('priority-slot-queue');

const q = new PrioritySlotQueue();

q.enqueue('send email', 5);
q.enqueue('critical alert', 1);
q.enqueue('cleanup', 10);

q.dequeue().value; // 'critical alert'
q.dequeue().value; // 'send email'
q.dequeue().value; // 'cleanup'

API

| Method | Description | | --- | --- | | enqueue(value, priority?) | Add item (default priority 0) | | dequeue() | Remove and return next item | | peek() | Next item without removing | | remove(id) | Remove by item id | | clear() | Remove all | | toArray() | All items in priority order | | size | Number of items |

License

MIT