Simple priority Queue implementation for Node.js
Tiny concurrency-limited promise queue with priorities, AbortSignal support, and onIdle(). Zero dependencies.
PQueue decorator
Promise queue with concurrency control
natty-fetch with pqueue
A producer-consumer pattern implementation using PQueue for efficient data processing
Promise queue with concurrency control. This is a fork of sindresorhus/p-queue, but with CommonJS support.
Compatible version of p-queue
Compatible version of p-timeout
Promise queue with concurrency control. Same API as p-queue, ships ESM + CJS with zero dependencies.
Promised out of order transform.
A basic queue decoration for hapi servers
Run a promise (perhaps with p-queue) generating a profiler json suitable to be consumed inside Chrome or Edge devtools to be analyzed
Promise queue with concurrency control. A fork of p-queue for commonjs.
Promise queue with concurrency control
Promise queue with concurrency control
Promise queue with concurrency control
p-queue and p-retry together.
datastructures: simple and fast queue and priority queue
Promise queue with concurrency control
A modular and efficient implementation of a Priority Queue with enqueue-optimized and dequeue-optimized strategies.
A lightweight set of utility functions for TypeScript
Promise queue with concurrency control
Promise queue with concurrency control
Priority Queue for Rust
A high-performance, thread-safe priority queue with dynamic priority updates
Queue programs for execution
Common data structure and algorithms for rust-lang to complete the already excellent std::collections
A priority queue is like a standard queue, except that each inserted element is given a certain priority, based on the result of the comparison block given at instantiation time. Retrieving an element from the queue will always return the one with the highest priority.
This is a fibonacci-heap priority-queue implementation. That means insert: O(1) decrease_priority: Amortized O(1) delete_min: Amortized O(log n) This project is different from K. Kodamas PQueue in that it allows a decrease key operation. That makes PriorityQueue usable for algorithms like dijkstras shortest path algorithm, while PQueue is more suitable for Heapsort and the like.