A minimalistic queue data structure for Node.js, version 1.0.0, released under MIT license. It provides basic FIFO operations (enqueue, dequeue, peek, size) with no dependencies. Last updated in 2018, it is stable but unmaintained, suitable for simple queue needs without advanced features like concurrency, iterators, or TypeScript support.
npm install queuejsNo compatibility data collected yet for this library.
Verified import paths — ran on the pinned version, not inferred.
Creates a queue, enqueues two elements, demonstrates size, peek, and dequeue operations.
Use enq() for enqueue and deq() for dequeue.
Check queue.isEmpty() before calling deq() or peek().
Use require('queuejs') or use a bundler that handles CommonJS.Consider modern alternatives like denque or double-ended-queue for better performance and features.
queue.enq(element)
Check isEmpty() before deq/peek: if (!queue.isEmpty()) queue.deq();
No dependency data recorded yet.