Lightweight queue based on fixed size array internally.
Curated collection of data structures for the JavaScript/TypeScript.
Tiny queue data structure
LRU Queue
queue-lit is a tiny queue data structure in case you `Array#push()` or `Array#shift()` on large arrays very often
Strict borsh compatible de/serializer
utilities for observable asynchronous control flow
fast, tiny `queueMicrotask` shim for modern engines
Sequential asynchronous lock-based queue for promises
a simple priority queue data structure
A shim for the setImmediate efficient script yielding API
Promise queue with concurrency control
Enqueues messages onto a given SQS queue
The smallest and simplest JavaScript priority queue
A simple tool to keep requests to be executed in order.
Extremely fast double-ended queue implementation
Tiny async queue with concurrency control. Like p-limit or fastq, but smaller and faster.
A tiny (130B to 205B) and fast utility to randomize unique IDs of fixed length
Lightweight utilities for debouncing, throttling, and more - designed for npm packages.
Better Queue for NodeJS
Next tick shim that prefers process.nextTick over queueMicrotask for compat
A lightweight task queue
Simple JS queue with auto run for node and browsers
In memory queue system prioritizing tasks
No description provided.
No description provided.
No description provided.
No description provided.