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.
Curated collection of data structures for the JavaScript/TypeScript.
Min/Max Heap & Heap Sort implementation in javascript
A heap-based implementation of priority queue in javascript with typescript support.
Tools and constants shared across Apify projects.