fifo

Double-linked-list FIFO queue (v2.4.1, stable, low churn). O(1) push/shift/unshift/remove/move operations. Unlike array-based queues, removal of arbitrary nodes is O(1) by retaining node references. Supports iteration and bumping nodes to end. Minimal API, no dependencies. Suitable for high-performance queuing in Node.js or browser (bundled).