A simple to use buffering queue (no dependencies) which flexibly buffers objects, strings, integers etc. until either a maximum size is reached, or an interval has come to an end.
Reusable journal core: generic buffered queue, batching, and pluggable flush (optional DOM pagehide helper)
Tiny queue data structure
Provides a buffered queue abstraction for writing to AWS [Firehose](https://aws.amazon.com/kinesis/data-firehose/).
fast, tiny `queueMicrotask` shim for modern engines
A shim for the setImmediate efficient script yielding API
Promise queue with concurrency control
A simple tool to keep requests to be executed in order.
The smallest and simplest JavaScript priority queue
Creates a buffer around a GeoJSON feature.
Buffered child process#spawn.
queue-lit is a tiny queue data structure in case you `Array#push()` or `Array#shift()` on large arrays very often
Next tick shim that prefers process.nextTick over queueMicrotask for compat
simple line-by-line stream reader
Simple JS queue with auto run for node and browsers
In memory queue system prioritizing tasks
Promise-based queue
The fastest javascript implementation of a double-ended queue. Used by the official Redis, MongoDB, MariaDB & MySQL libraries for Node.js and many other libraries. Maintains compatability with deque.
LRU Queue
An Ember Object Proxy with change buffering
Sequential asynchronous lock-based queue for promises
Creates a prefetched async iterable
Simple JS queue with auto run for node and browsers
asynchronous function queue with adjustable concurrency
A circular queue (also called a circular buffer or ring buffer) is useful when buffering data streams
Buffered Queue which flush the data when the queue max size has reached and all other subscribers which are listening to
RingBuffer provides a simple ring buffer implementation in Ruby. A ring buffer is a queue with a maximum capacity. When the capacity exceeds, the first element inserted is removed.