The smallest and simplest JavaScript priority queue
JavaScript implementation of PriorityQueue (using Min Heap or Max Heap)
The smallest and simplest JavaScript priority queue
fast, tiny `queueMicrotask` shim for modern engines
A heap-based implementation of priority queue in javascript with typescript support.
Fast heap-based priority queue in JavaScript
javascript priority-queue
Generic browser priority queue.
Priority queue data structures
A JS library for finding optimal label position inside a polygon
High-priority task queue for Node.js and browsers
Simple JS stack with auto run for node and browsers
Tiny queue data structure
A promise based, dynamic priority queue runner, with concurrency limiting.
A priority queue that shuffles elements with the same priority.
Promise queue with concurrency control
Microsoft Azure Storage SDK for JavaScript - Queue
[DepUp] 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
a simple priority queue data structure
Simple JS queue with auto run for node and browsers
Efficient Binary heap (priority queue, binary tree) data structure for JavaScript / TypeScript. Includes JavaScript methods, Python's heapq module methods, and Java's PriorityQueue methods.
Simple JS queue with auto run for node and browsers
A JS library for finding optimal label position inside a polygon