Store variables and data based on their priority.
Suspense enable and SSR compatible async components with priorities
A BPMN modeler with support for modeling task priorities visually
Add focus priorities to Jasmine 2.x
Parser for TASKS.md files — extracts tasks, metadata, priorities, and blockers
This package permit to have a centralized dotenv on a monorepo. It also includes some extra features such as manipulation and saving of changes to the dotenv file, a default centralized file, and a file loader with ordering and priorities.
Your Priorities Web App SDK
Enterprise-grade request queue for NestJS with Redis support, retries, priorities, and rate limiting
High-performance job queue for Bun & AI agents. SQLite persistence, cron scheduling, priorities, retries, DLQ, webhooks, native MCP server. Zero external dependencies.
BullMQ event adapter for Motia framework, enabling distributed event handling with advanced features like retries, priorities, delays, and FIFO queues.
Tiny concurrency-limited promise queue with priorities, AbortSignal support, and onIdle(). Zero dependencies.
FEN queue with priorities
Simple job-runner with priorities, dependencies, and tag-groups
a queue runner with priorities, concurrency and promises
A redis-based job queue library written in typescript that supports retries, job priorities and expiration.
In-memory job queue with priorities, delays, and dead-letter for RobinPath
Next.js dotenv file loading
Elegant UI blocking management for React applications with priorities, scopes, and automatic cleanup
A Python-style async task scheduler with priorities, concurrency control, retries, timeouts, and cancellation
Connect Circuit to Cursor and Claude Code - bring customer priorities and engineering briefs into your AI coding assistant
Lookup ClickUp field options, statuses, priorities, and task types — map values to IDs without hard-coding metadata.
Priorities tasks by creating today.txt on Desktop.
OpenClaw plugin for Otper boards (https://otper.com) — exposes Otper boards, lists, cards, labels, comments, and today's priorities as agent tools.
Calculates consent based on a list of priorities
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.
Service Discovery & Distributed Key-Value Store
Jira Cloud platform REST API documentation
Jira Cloud platform REST API lib (OpenAPI document version: 1001.0.0-SNAPSHOT-af42c50d50804c2f1b8ad4bb80d52c53890867e2)
An executor-agnostic async file IO library
High-performance shared memory IPC library with multi-priority messaging and lock-free ring buffers
Continuous integration using cargo for Clippy and tests for all possible features.
Thread-safe, dynamically resizable queues with lock-based and lock-free implementations for high-throughput scenarios
Writes [lints.rust] to stdout such that all lints are denied or allowed.
Priority queue traits and high performance d-ary heap implementations.
CPU affinity and process priority launcher with profile support
High-performance agentic robotics framework with ROS2 compatibility
A Redmine plugin to prioritize versions to help users make a decision on which issues need to be worked on next.
Performant priority queue in pure ruby with support for changing priority using pairing heap data structure
This gem is a Logstash plugin required to be installed on top of the Logstash core pipeline using $LS_HOME/bin/logstash-plugin install gemname. This gem is not a stand-alone program
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.
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.
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.
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.
Asynchronous Priority Queue with EventMachine
Fast priority queue implementation (c++ wrapper, see README.md for a comparison with other libraries)
Run tests in priority
An extension for Sidekiq allowing jobs in a single queue to be executed by a priority score rather than FIFO
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.