Results for lazy_priority_queue

A highly parallel Perl 5 interpreter written in Rust

gRPC reaction plugin for Drasi

gRPC Adaptive reaction plugin for Drasi

High-performance parallel runtime for Rust with work-stealing and adaptive scheduling

Terminal-native AI agent runtime — parallel orchestration, reactive subagents, MCP, autonomous supervision

Lazy Sieve of Eratosthenes for infinitely generating primes lazily in Rust.

RabbitMQ/AMQP broker implementation for CeleRS

Background task processing for rust using apalis and postgres

Background task processing for rust using apalis and sqlite

High-performance inference server for TrustformeRS models

A experimental micor framework for clear design, based on queue model

Plumtree (Epidemic Broadcast Trees) implementation built on memberlist for efficient O(n) message broadcast.

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.