A proof of concept for a priority queue which factors in the time added.
fast, tiny `queueMicrotask` shim for modern engines
The smallest and simplest JavaScript priority queue
Generic browser priority queue.
A heap-based implementation of priority queue in javascript with typescript support.
Polyfill for Temporal (https://github.com/tc39/proposal-temporal), an ECMA TC39 Stage 3 proposal
Priority queue data structures
Get the byteLength out of a DataView, robustly.
Get the byteOffset out of a DataView, robustly.
Fast heap-based priority queue in JavaScript
The smallest and simplest JavaScript priority queue
High-priority task queue for Node.js and browsers
A lightweight polyfill for Temporal, successor to the JavaScript Date object
Get the byte length of an ArrayBuffer, even in engines without a `.byteLength` method.
Robustly get the byte length of a Typed Array
Robustly get the byte offset of a Typed Array
Tiny queue data structure
Temporal integration for NestJS
Get utf8 byte length of string
A shim for the setImmediate efficient script yielding API
A JS library for finding optimal label position inside a polygon
Reads / writes floats / doubles from / to buffers in both modern and ancient browsers.
A priority queue that shuffles elements with the same priority.
A promise based, dynamic priority queue runner, with concurrency limiting.