Returns an array sorted by elements priority
The smallest and simplest JavaScript priority queue
Tiny queue data structure
fast, tiny `queueMicrotask` shim for modern engines
A heap-based implementation of priority queue in javascript with typescript support.
Priority queue data structures
Generic browser priority queue.
queue-lit is a tiny queue data structure in case you `Array#push()` or `Array#shift()` on large arrays very often
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.
Fast heap-based priority queue in JavaScript
A JS library for finding optimal label position inside a polygon
Extremely fast double-ended queue implementation
asynchronous function queue with adjustable concurrency
Call an array of promise-returning functions, restricting concurrency to a specified limit.
Curated collection of data structures for the JavaScript/TypeScript.
The smallest and simplest JavaScript priority queue
Zero dependency library to safe merge objects.
A priority queue that shuffles elements with the same priority.
A promise based, dynamic priority queue runner, with concurrency limiting.
High-priority task queue for Node.js and browsers
a simple priority queue data structure
In memory queue system prioritizing tasks
Backburner.js is a simple run loop-esque library for coalescing actions
A shim for the setImmediate efficient script yielding API
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.