elixir-heapq
Heap
A priority queue implementation in Elixir using a heap data structure.
A Heap-based Priority Queue Implementation in Elixir.
8 stars
2 watching
2 forks
Language: Elixir
last commit: about 9 years ago
Linked from 1 awesome list
Related projects:
Repository | Description | Stars |
---|---|---|
| A queue data structure implemented as a wrapper around the Elixir language's existing queue data type with additional features and improved API. | 34 |
| An Elixir wrapper around Erlang's array data structure | 36 |
| A library implementing a priority queue with multiple backends and flexible configuration options. | 11 |
| A simple, in-memory queue with worker pooling and rate limiting. | 266 |
| A data structure for efficiently managing items with priorities | 177 |
| A binary heap data structure implementation in CoffeeScript/JavaScript for efficient priority management | 126 |
| A data structure implementation for managing elements of varying priorities in Swift | 372 |
| A pluggable job queue and worker pool for Elixir, focused on at-least-once execution. | 723 |
| A tiny resource-pool implementation for Elixir that avoids process-based overhead by directly sharing resources between processes | 347 |
| An Elixir implementation of the Rendezvous hashing algorithm | 9 |
| An Elixir client for interacting with an in-memory job queue service | 17 |
| A distributed job processing system utilizing an in-memory real-time database | 672 |
| A tool for generating match_specs from LINQ-inspired queries at compile-time for use with Elixir record types. | 78 |
| Automated deployment tool for Elixir applications | 297 |
| Implementations of priority queues for Erlang, with varying trade-offs between speed and complexity. | 171 |