async/await simple priority queues
priority queue(heap) data structure for node.js and browsers
A lightweight collection for working with regular and priority queues.
Async event emitter with priority queues, once-listeners, and a mutable mid-flight queue.
An npm module for findTopN using priority queues
Jobs microservice — background jobs, priority queues, cron scheduling, retries with backoff
implementation of priority queues using heaps
**Distributed delayed jobs in nodejs**. Resque is a background job system backed by [Redis](http://redis.io) (version 2.6.0 and up required). It includes priority queues, plugins, locking, delayed jobs, and more! This project is a very opinionated but API
⚡ Priority queues for ES6
AI cofounder — multi-agent workspace manager built on Pi; orchestrates AI coding agents with tick-based scheduling, priority queues, inbox IPC, cron jobs, and optional Docker sandbox isolation.
A powerful rate limiter with concurrency control, priority queues, task scheduling, and Redis clustering support
fast, tiny `queueMicrotask` shim for modern engines
Min-Max heap implementation (generalized priority queues)
Agent deck management — card-based task routing, priority queues, crew scheduling
an opinionated implementation of resque in node
A fast, efficient Node.js Worker Thread Pool implementation
Outpatient front-end module for O3
Simple JS stack with auto run for node and browsers
Vanilla JS utilities to implement overflow menus
A tiny (139B to 204B) utility to regulate the execution rate of your functions
A heap-based implementation of priority queue in javascript with typescript support.
Backburner.js is a simple run loop-esque library for coalescing actions
Database-specific job handling and queue management
https://linux.die.net/man/2/nice binding for Node.js
A Priority Queue implemented as a heap with a function to efficiently change the priority of an item.
O(1) amortized priority queue. Adaptive Ladder Queue for heavy-tailed distributions.
A trusty priority queue server built with Rust
A priority queue implementation based on Rust's BinaryHeap
Priority Queue is more specialized data structure than Queue. Like ordinary queue, priority queue has same method but with a major difference. In Priority queue items are ordered by key value so that item with the lowest value of key is at front and item with the highest value of key is at rear or vice versa. So we're assigned priority to item based on its key value. Lower the value, higher the priority. Following are the principal methods of a Priority Queue.
Embedded persistent priority queue with native lease/visibility-timeout semantics. Single-binary, no server, crash-safe by construction.
A priority queue based on a binomial heap.
A high-performance, thread-safe priority queue with dynamic priority updates
Very generic containers including KD trees, fibonacci heaps, minmax heaps, ...
Generic d-ary heap priority queue supporting min/max via comparator, with O(1) item lookup for updates. Features configurable arity, efficient priority updates, and cross-language API compatibility.
A d-ary heap
A high-performance Fibonacci Heap implementation in Rust with generic type support
Performant priority queue in pure ruby with support for changing priority using pairing heap data structure
Delayed_job (or DJ) encapsulates the common pattern of asynchronously executing longer tasks in the background. It is a direct extraction from Shopify where the job table is responsible for a multitude of core tasks.
Light-weight priority queue implementation using a heap
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.
A priority queue which implements a lazy binomial heap. It supports the change priority operation, being suitable for algorithms like Dijkstra's shortest path and Prim's minimum spanning tree. It can be instantiated as a min-priority queue as well as a max-priority queue.
Asynchronous Priority Queue with EventMachine
Fast priority queue implementation (c++ wrapper, see README.md for a comparison with other libraries)
A binary heap-based priority queue supporting min-heap, max-heap, and custom comparator modes. Features O(log n) push/pop, priority changes, merge operations, and FIFO tie-breaking.
A simple LRU-cache based on a hash and priority queue
depq is a Double-Ended Priority Queue library. It is a data structure which can insert elements and delete elements with minimum and maximum priority. If there are elements which has same priority, the element inserted first is chosen. The priority can be changed after the element is inserted.
A simple priority queue in Ruby.
Backgroundjob (Bj) is a brain dead simple zero admin background priority queue for Rails. Bj is robust, platform independent (including windows), and supports internal or external manangement of the background runner process.
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.