Priority queue data structure where you are able to set your own compare function.
A heap-based implementation of priority queue in javascript with typescript support.
The smallest and simplest JavaScript priority queue
fast, tiny `queueMicrotask` shim for modern engines
Generic browser priority queue.
Priority queue data structures
Fast heap-based priority queue in JavaScript
The smallest and simplest JavaScript priority queue
Tiny queue data structure
A promise based, dynamic priority queue runner, with concurrency limiting.
A priority queue that shuffles elements with the same priority.
High-priority task queue for Node.js and browsers
A JS library for finding optimal label position inside a polygon
a simple priority queue data structure
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 simple and efficient queue system for Node.js applications
A JS library for finding optimal label position inside a polygon
Sequential asynchronous lock-based queue for promises
A shim for the setImmediate efficient script yielding API
async/await simple priority queues
Fast 2D concave hull algorithm in JavaScript (generates an outline of a point set)
A Promise-based dynamic priority queue runner.
A complete, fully tested data structure library written in TypeScript.
Promise queue with concurrency control