Extremely fast double-ended queue (deque) implementation in JavaScript, version 2.1.0-0. Uses a circular buffer for O(1) operations on both ends, including random access via .get(). Outperforms native Array for shift/unshift even with V8's small array optimization. Suitable as stack, queue, or deque. No dependencies. Last release was a pre-release; library may be in maintenance mode.
npm install double-ended-queueNo compatibility data collected yet for this library.
Verified import paths — ran on the pinned version, not inferred.
Quick start: create a deque from an array, demonstrate shift/pop, enqueue/dequeue, and random access via .get().
Use an array literal when intending to pass a single numeric element: new Deque([5])
Check the return value for undefined or use .isEmpty() before accessing.
If you intend to create a deque with one element, pass an array literal.
Always use new Deque(...) or extend Deque properly.
Run 'npm install double-ended-queue' in your project root.
Use 'var Deque = require("double-ended-queue");' (CommonJS) or proper ESM import.No dependency data recorded yet.