javascript standard data structure library which benchmark against C++ STL
javascript standard data structure library which benchmark against C++ STL
javascript standard data structure library which benchmark against C++ STL
javascript standard data structure library which benchmark against C++ STL
javascript standard data structure library which benchmark against C++ STL
Tiny queue data structure
fast, tiny `queueMicrotask` shim for modern engines
High-performance (binary) tree and sorted map implementation (AVL, Splay, Radix, Red-Black)
A simple tool to keep requests to be executed in order.
LRU Queue
A shim for the setImmediate efficient script yielding API
Simple JS queue with auto run for node and browsers
Promise-based queue
Promise queue with concurrency control
Next tick shim that prefers process.nextTick over queueMicrotask for compat
A promise based, dynamic priority queue runner, with concurrency limiting.
Simple JS queue with auto run for node and browsers
The smallest and simplest JavaScript priority queue
queue-lit is a tiny queue data structure in case you `Array#push()` or `Array#shift()` on large arrays very often
Fast, in memory work queue
In memory queue system prioritizing tasks
High-priority task queue for Node.js and browsers
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.
A heap-based implementation of priority queue in javascript with typescript support.