A simple double-ended queue datastructure for Node.js, version 1.0.5 (last released in 2013). Provides O(1) push, pop, shift, and unshift operations, making it a drop-in replacement for JavaScript arrays used as FIFO queues. Avoids performance degradation seen with large arrays (100k+ entries) by using a linked list internally. Lightweight, no dependencies, and supports Node.js engines of all versions.
npm install dequeueNo compatibility data collected yet for this library.
Verified import paths — ran on the pinned version, not inferred.
Creates a dequeue, adds elements with push and unshift, then removes from both ends using shift and pop.
Create a .d.ts file or use @types/dequeue if available.
Use require() instead of import or use a bundler like webpack.
Consider using alternatives like 'denque' or 'double-ended-queue' for active maintenance.
Evaluate migration to a maintained library such as 'denque'.
Run: npm install dequeue
This is a library, not a CLI. Use require('dequeue') in your Node.js code.Use: const Dequeue = require('dequeue') or import Dequeue from 'dequeue' (with bundler support).No dependency data recorded yet.